Experiences with Establishment of a Multi-University Center of Academic Excellence in Information Assurance/Cyber Defense

The National Security Agency (NSA) and Department of Homeland Security (DHS), in response to an unmet workforce need for cybersecurity program graduates, jointly sponsor a program by which a post-secondary education institution may achieve recognition as a Center of Academic Excellence in Information Assurance/Cyber Defense (CAE IA/CD). The program identifies standards, criteria, and an evaluation process. Many individual institutions have achieved recognition. The University of Maine System, composed of seven universities, is the first multi-university entity to achieve the CAE IA/CD recognition. The purpose of this paper is to share the key challenges, opportunities, and experiences that contributed to this achievement, and offer recommendations

Qubit-Qutrit Separability-Probability Ratios

Paralleling our recent computationally-intensive (quasi-Monte Carlo) work for the case N=4 (quant-ph/0308037), we undertake the task for N=6 of computing to high numerical accuracy, the formulas of Sommers and Zyczkowski (quant-ph/0304041) for the (N^2-1)-dimensional volume and (N^2-2)-dimensional hyperarea of the (separable and nonseparable) N x N density matrices, based on the Bures (minimal monotone) metric -- and also their analogous formulas (quant-ph/0302197) for the (non-monotone) Hilbert-Schmidt metric. With the same seven billion well-distributed (``low-discrepancy'') sample points, we estimate the unknown volumes and hyperareas based on five additional (monotone) metrics of interest, including the Kubo-Mori and Wigner-Yanase. Further, we estimate all of these seven volume and seven hyperarea (unknown) quantities when restricted to the separable density matrices. The ratios of separable volumes (hyperareas) to separable plus nonseparable volumes (hyperareas) yield estimates of the separability probabilities of generically rank-six (rank-five) density matrices. The (rank-six) separability probabilities obtained based on the 35-dimensional volumes appear to be -- independently of the metric (each of the seven inducing Haar measure) employed -- twice as large as those (rank-five ones) based on the 34-dimensional hyperareas. Accepting such a relationship, we fit exact formulas to the estimates of the Bures and Hilbert-Schmidt separable volumes and hyperareas.(An additional estimate -- 33.9982 -- of the ratio of the rank-6 Hilbert-Schmidt separability probability to the rank-4 one is quite clearly close to integral too.) The doubling relationship also appears to hold for the N=4 case for the Hilbert-Schmidt metric, but not the others. We fit exact formulas for the Hilbert-Schmidt separable volumes and hyperareas.Comment: 36 pages, 15 figures, 11 tables, final PRA version, new last paragraph presenting qubit-qutrit probability ratios disaggregated by the two distinct forms of partial transpositio

Differential information in large games with strategic complementarities

We study equilibrium in large games of strategic complementarities (GSC) with differential information. We define an appropriate notion of distributional Bayesian Nash equilibrium and prove its existence. Furthermore, we characterize order-theoretic properties of the equilibrium set, provide monotone comparative statics for ordered perturbations of the space of games, and provide explicit algorithms for computing extremal equilibria. We complement the paper with new results on the existence of Bayesian Nash equilibrium in the sense of Balder and Rustichini (J Econ Theory 62(2):385–393, 1994) or Kim and Yannelis (J Econ Theory 77(2):330–353, 1997) for large GSC and provide an analogous characterization of the equilibrium set as in the case of distributional Bayesian Nash equilibrium. Finally, we apply our results to riot games, beauty contests, and common value auctions. In all cases, standard existence and comparative statics tools in the theory of supermodular games for finite numbers of agents do not apply in general, and new constructions are required

An Evaluation of Local Path ID Swapping in Computer Networks

This paper analyzes a method for identifying end-to-end connections in computer networks which is designed to provide reductions in the sizes of the packet headers and routing tables stored in the nodes. The method, known as Local Path ID Swapping, uses a shortened connection identifier, called the LPID, in the message headers and routing tables. In general, the LPID field is swapped in the message header from node to node along the path of the route. Some analytical results are presented for evaluating the important tradeoffs involved in LPID swapping. Most notable is the tradeoff between the size of the LPID field and the number of connections which can be defined in the network

Search within a Page

Three families of strategies for organizing an index of ordered keys are investigated. It is assumed either that the index is small enough to fit in main memory or that some superstrategy organizes the index into pages and that search within a page is being studied. Examples of strategies within the three families are B-tree Search, Binary Search, and Square Root Search. The expected access times of these and other strategies are compared, and their relative merits in different indexing situations are discussed and conjectured on. Considering time and space costs and complexity of programming, it is concluded that a Binary Search strategy is generally preferable