Quantum controlled-NOT gate with 'hot' trapped ions

We present a novel method of performing quantum logic gates in trapped ion quantum computers which does not require the ions to be cooled down to the ground state of their vibrational modes, thereby avoiding one of the principal experimental difficulties encountered in realizing this technology. Our scheme employs adiabatic passages and a phase shift conditional on the phonon number state.

Maximum packings of K-v-K-u with triples

We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of K-v - K-u (the complete graph on v vertices with a. hole of size u) into the maximum possible number of edge disjoint triangles.

The number of 4-cycles in 2-factorizations of K2n minus a 1-factor

In this paper we give a complete solution to problem of determining the number of 4-cycles in a 2-factorization of K-2n\ 1-factor. (C) 2000 Elsevier Science B.V. All rights reserved.

The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2

In this paper necessary and sufficient conditions for a vector to be the fine structure of a balanced ternary design with block size 3, index 3 and rho(2) = 1 and 2 are determined with one unresolved case.

Decompositions of complete multipartite graphs into cycles of even length

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain small decompositions exist, are also given for arbitrary even cycle lengths.

Labelled tableaux for non-normal modal logics

In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular, in a uniform and modular way.

Visualization of learning in multilayer perceptron networks using principal component analysis

This paper is concerned with the use of scientific visualization methods for the analysis of feedforward neural networks (NNs). Inevitably, the kinds of data associated with the design and implementation of neural networks are of very high dimensionality, presenting a major challenge for visualization. A method is described using the well-known statistical technique of principal component analysis (PCA). This is found to be an effective and useful method of visualizing the learning trajectories of many learning algorithms such as back-propagation and can also be used to provide insight into the learning process and the nature of the error surface.

John Waldridge, The Leaven of the Ancients: Suhrawardi and the Heritage of the Greeks, SUNY Series in Islam (Albany: State University of New York Press, 1999). Pp. 323

In the Leaven of the Ancients, John Walbridge studies the appropriation of non–Peripatetic philosophical ideas by an anti–Aristotelian Islamic philosopher, Shihab al-Din al-Suhrawardi (d. 1191). He proposes a comprehensive explanation of the origin of Suhrawardi's philosophical system, a revival of the “wisdom of the Ancients” and its philosophical affiliations “grounded” in Greek philosophy (p. xiii). Walbridge attempts to uncover the reasons for Suhrawardi's rejection of the prevailing neo–Aristotelian synthesis in Islamic philosophy, Suhrawardi's knowledge and understanding of non–Aristotelian Greek philosophy, the ancient philosophers Suhrawardi was attempting to follow, the relationship between Suhrawardi's specific philosophical teachings (logic, ontology, physics, and metaphysics), and his understanding of non–Aristotelian ancient philosophy and the relationship between Suhrawardi's system and the major Greek philosophers, schools, and traditions—in particular the Presocratics, Plato, and the Stoics (p. 8). Copyright © 2003 Cambridge University Press

Social class and cultural mobility - Reconfiguring the cultural omnivore thesis

This article explores the idea of 'cultural mobility' both as a way of thinking about the polarizing logic of class relations and practices in contemporary society and as a means by which the debate over the cultural omnivore might be advanced. The concept of cultural mobility refers to the differential capacity to engage with or consume cultural goods and services across the entire spectrum of cultural life, an ability which is itself premised upon an unequal, class-related distribution in cultural competence. Cultural mobility, then, is the ability to move at will between cultural realms, a freedom to choose where one is positioned in the cultural landscape. I argue that the concept provides fertile ground for exploring possible interconnections between a number of divergent strands in current social theory which have largely developed independently of each other. At the same time much of this theoretical effort remains divorced from concrete research agendas. Using data collected as part of a major study of Australian cultural consumption, the article provides a case study of cultural mobility and its class moorings which serves to clarify some of the existing confusions concerning the cultural omnivore.

Mathematical constraints on a theory of human memory - Response

Colonius suggests that, in using standard set theory as the language in which to express our computational-level theory of human memory, we would need to violate the axiom of foundation in order to express meaningful memory bindings in which a context is identical to an item in the list. We circumvent Colonius's objection by allowing that a list item may serve as a label for a context without being identical to that context. This debate serves to highlight the value of specifying memory operations in set theoretic notation, as it would have been difficult if not impossible to formulate such an objection at the algorithmic level.

Correcting the effects of spontaneous emission on cold-trapped ions

We propose two quantum error-correction schemes which increase the maximum storage time for qubits in a system of cold-trapped ions, using a minimal number of ancillary qubits. Both schemes consider only the errors introduced by the decoherence due to spontaneous emission from the upper levels of the ions. Continuous monitoring of the ion fluorescence is used in conjunction with selective coherent feedback to eliminate these errors immediately following spontaneous emission events.

Optimal quantum trajectories for discrete measurements

Using the method of quantum trajectories we show that a known pure state can be optimally monitored through time when subject to a sequence of discrete measurements. By modifying the way that we extract information from the measurement apparatus we can minimize the average algorithmic information of the measurement record, without changing the unconditional evolution of the measured system. We define an optimal measurement scheme as one which has the lowest average algorithmic information allowed. We also show how it is possible to extract information about system operator averages from the measurement records and their probabilities. The optimal measurement scheme, in the limit of weak coupling, determines the statistics of the variance of the measured variable directly. We discuss the relevance of such measurements for recent experiments in quantum optics.

A fuzzy Reed-Frost model for epidemic spreading

In this paper, we present a fuzzy approach to the Reed-Frost model for epidemic spreading taking into account uncertainties in the diagnostic of the infection. The heterogeneities in the infected group is based on the clinical signals of the individuals (symptoms, laboratorial exams, medical findings, etc.), which are incorporated into the dynamic of the epidemic. The infectivity level is time-varying and the classification of the individuals is performed through fuzzy relations. Simulations considering a real problem with data of the viral epidemic in a children daycare are performed and the results are compared with a stochastic Reed-Frost generalization.