An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy

"Assessing Pharmacy Students' Learning Styles and Personality Types: A Ten-Year Analysis "

Charles R. Phillips is an Associate Professor of Pharmacy Administration/Department Chair of Pharmacy Practice in the College of Pharmacy and Health Sciences at Drake University. He can be contacted at [email protected] ten-year analysis of 1,313 Myers-Briggs Type Indicator (MBTI) is presented to address learning styles in pharnacy students. Objectives were to present a ten-year view of pharmacy student's learning styles, identify differences in pharmacy students versus the general college student population, and compare personality types of students choosing to track into the PharmD Program with those in the BS Pharmacy program. Compared to the general college poplation, the distribution of pharmacy students differed in several personality types measured by the Myerss-Briggs Type Indicator. Generally, Drake pharmacy student's modal type remained introvert, Sensing, Thinking, Judging, (ISTJ) to Introvert, Sensing, Feeling, Judging (ISFJ) for the ten years of data. Female pharmacy students were 72 percent more likely to have feeling as a dominant function. Females were also more likely to have a judging preference. When compared to BS Pharmacy students, PharmD students were more than three times more likely to be Extraverted, Intuitive, Feeling, Judging (ENFJ). This analysis provided learning and teaching style information for both students and faculty. It is timely as colleges attempt to change students to independent learners. The key to successfully implementing ability-based outcomes and active learning may lie with the use of a variety of strategies that help students with different preferences

On the Relationship between Convex Bodies Related to Correlation Experiments with Dichotomic Observables

In this paper we explore further the connections between convex bodies related to quantum correlation experiments with dichotomic variables and related bodies studied in combinatorial optimization, especially cut polyhedra. Such a relationship was established in Avis, Imai, Ito and Sasaki (2005 J. Phys. A: Math. Gen. 38 10971-87) with respect to Bell inequalities. We show that several well known bodies related to cut polyhedra are equivalent to bodies such as those defined by Tsirelson (1993 Hadronic J. S. 8 329-45) to represent hidden deterministic behaviors, quantum behaviors, and no-signalling behaviors. Among other things, our results allow a unique representation of these bodies, give a necessary condition for vertices of the no-signalling polytope, and give a method for bounding the quantum violation of Bell inequalities by means of a body that contains the set of quantum behaviors. Optimization over this latter body may be performed efficiently by semidefinite programming. In the second part of the paper we apply these results to the study of classical correlation functions. We provide a complete list of tight inequalities for the two party case with (m,n) dichotomic observables when m=4,n=4 and when min{m,n}<=3, and give a new general family of correlation inequalities.Comment: 17 pages, 2 figure

Quantisation of Conformal Fields in Three-dimensional Anti-de Sitter Black Hole Spacetime

Utilizing the conformal-flatness nature of 3-dim. Anti-de Sitter (AdS_3) black hole solution of Banados, Teitelboim and Zanelli, the quantisation of conformally-coupled scalar and spinor fields in this background spacetime is explicitly carried out. In particular, mode expansion forms and propagators of the fields are obtained in closed forms. The vacuum in this conformally-coupled field theories in AdS_3 black hole spacetime, which is conformally-flat, is the conformal vacuum which is unique and has global meaning. This point particularly suggests that now the particle production by AdS_3 black hole spacetime should be absent. General argument establishing the absence of real particle creation by AdS_3 black hole spacetime for this case of conformal triviality is provided. Then next, using the explicit mode expansion forms for conformally-coupled scalar and spinor fields, the bosonic and fermionic superradiances are examined and found to be absent confirming the expectation.Comment: 51 pages, Revtex, version to appear in Int. J. Mod. Phys.

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph

In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A graph G = (V, E) is a k-degenerate graph if for any its induced subgraph has a vertex whose degree is less than or equal to k, and many real-world graphs have small degeneracies, or very close to small degeneracies. Although, the studies are on subgraphs enumeration, such as trees, paths, and matchings, but the problem addresses the subgraph enumeration, such as enumeration of subgraphs that are trees. Their induced subgraph versions have not been studied well. One of few example is for chordless paths and cycles. Our motivation is to reduce the time complexity close to O(1) for each solution. This type of optimal algorithms are proposed many subgraph classes such as trees, and spanning trees. Induced subtrees are fundamental object thus it should be studied deeply and there possibly exist some efficient algorithms. Our algorithm utilizes nice properties of k-degeneracy to state an effective amortized analysis. As a result, the time complexity is reduced to O(k) time per induced subtree. The problem is solved in constant time for each in planar graphs, as a corollary

A Perturbative Approach to the Relativistic Harmonic Oscillator

A quantum realization of the Relativistic Harmonic Oscillator is realized in terms of the spatial variable $x$ and {\d\over \d x} (the minimal canonical representation). The eigenstates of the Hamiltonian operator are found (at lower order) by using a perturbation expansion in the constant $c^{-1}$. Unlike the Foldy-Wouthuysen transformed version of the relativistic hydrogen atom, conventional perturbation theory cannot be applied and a perturbation of the scalar product itself is required.Comment: 9 pages, latex, no figure

Bell inequalities stronger than the CHSH inequality for 3-level isotropic states

We show that some two-party Bell inequalities with two-valued observables are stronger than the CHSH inequality for 3 \otimes 3 isotropic states in the sense that they are violated by some isotropic states in the 3 \otimes 3 system that do not violate the CHSH inequality. These Bell inequalities are obtained by applying triangular elimination to the list of known facet inequalities of the cut polytope on nine points. This gives a partial solution to an open problem posed by Collins and Gisin. The results of numerical optimization suggest that they are candidates for being stronger than the I_3322 Bell inequality for 3 \otimes 3 isotropic states. On the other hand, we found no Bell inequalities stronger than the CHSH inequality for 2 \otimes 2 isotropic states. In addition, we illustrate an inclusion relation among some Bell inequalities derived by triangular elimination.Comment: 9 pages, 1 figure. v2: organization improved; less references to the cut polytope to make the main results clear; references added; typos corrected; typesetting style change

Image processing mini manual

The intent is to provide an introduction to the image processing capabilities available at the Langley Research Center (LaRC) Central Scientific Computing Complex (CSCC). Various image processing software components are described. Information is given concerning the use of these components in the Data Visualization and Animation Laboratory at LaRC

A robust pseudo-inverse spectral filter applied to the Earth Radiation Budget Experiment (ERBE) scanning channels

Computer simulations of a least squares estimator operating on the ERBE scanning channels are discussed. The estimator is designed to minimize the errors produced by nonideal spectral response to spectrally varying and uncertain radiant input. The three ERBE scanning channels cover a shortwave band a longwave band and a ""total'' band from which the pseudo inverse spectral filter estimates the radiance components in the shortwave band and a longwave band. The radiance estimator draws on instantaneous field of view (IFOV) scene type information supplied by another algorithm of the ERBE software, and on a priori probabilistic models of the responses of the scanning channels to the IFOV scene types for given Sun scene spacecraft geometry. It is found that the pseudoinverse spectral filter is stable, tolerant of errors in scene identification and in channel response modeling, and, in the absence of such errors, yields minimum variance and essentially unbiased radiance estimates

Quantum correlations in the temporal CHSH scenario

We consider a temporal version of the CHSH scenario using projective measurements on a single quantum system. It is known that quantum correlations in this scenario are fundamentally more general than correlations obtainable with the assumptions of macroscopic realism and non-invasive measurements. In this work, we also educe some fundamental limitations of these quantum correlations. One result is that a set of correlators can appear in the temporal CHSH scenario if and only if it can appear in the usual spatial CHSH scenario. In particular, we derive the validity of the Tsirelson bound and the impossibility of PR-box behavior. The strength of possible signaling also turns out to be surprisingly limited, giving a maximal communication capacity of approximately 0.32 bits. We also find a temporal version of Hardy's nonlocality paradox with a maximal quantum value of 1/4.Comment: corrected versio