Bose-Hubbard model in a strong effective magnetic field: Emergence of a chiral Mott insulator ground state

Motivated by experiments on Josephson junction arrays, and cold atoms in an optical lattice in a synthetic magnetic field, we study the ``fully frustrated'' Bose-Hubbard model with half a magnetic flux quantum per plaquette. We obtain the phase diagram of this model on a two-leg ladder at integer filling via the density matrix renormalization group approach, complemented by Monte Carlo simulations on an effective classical XY model. The ground state at intermediate correlations is consistently shown to be a chiral Mott insulator (CMI) with a gap to all excitations and staggered loop currents which spontaneously break time-reversal symmetry. We characterize the CMI state as a vortex supersolid or an indirect exciton condensate, and discuss various experimental implications.

Chiral Mott insulator with staggered loop currents in the fully frustrated Bose-Hubbard model

Motivated by experiments on Josephson junction arrays in a magnetic field and ultracold interacting atoms in an optical lattice in the presence of a ``synthetic'' orbital magnetic field, we study the ``fully frustrated'' Bose-Hubbard model and quantum XY model with half a flux quantum per lattice plaquette. Using Monte Carlo simulations and the density matrix renormalization group method, we show that these kinetically frustrated boson models admit three phases at integer filling: a weakly interacting chiral superfluid phase with staggered loop currents which spontaneously break time-reversal symmetry, a conventional Mott insulator at strong coupling, and a remarkable ``chiral Mott insulator'' (CMI) with staggered loop currents sandwiched between them at intermediate correlation. We discuss how the CMI state may be viewed as an exciton condensate or a vortex supersolid, study a Jastrow variational wave function which captures its correlations, present results for the boson momentum distribution across the phase diagram, and consider various experimental implications of our phase diagram. Finally, we consider generalizations to a staggered flux Bose-Hubbard model and a two-dimensional (2D) version of the CMI in weakly coupled ladders.

Performance modelling of a fault-tolerant real-time multiprocessor using stochastic Petri nets

The fault-tolerant multiprocessor (ftmp) is a bus-based multiprocessor architecture with real-time and fault- tolerance features and is used in critical aerospace applications. A preliminary performance evaluation is of crucial importance in the design of such systems. In this paper, we review stochastic Petri nets (spn) and developspn-based performance models forftmp. These performance models enable efficient computation of important performance measures such as processing power, bus contention, bus utilization, and waiting times.

Space and time efficiency of the forest-of-quadtrees representation

A forest of quadtrees is a refinement of a quadtree data structure that is used to represent planar regions. A forest of quadtrees provides space savings over regular quadtrees by concentrating vital information. The paper presents some of the properties of a forest of quadtrees and studies the storage requirements for the case in which a single 2m × 2m region is equally likely to occur in any position within a 2n × 2n image. Space and time efficiency are investigated for the forest-of-quadtrees representation as compared with the quadtree representation for various cases.

Stochastic Modeling of an Aircraft Traversing a Runway Using Time Series Analysis

Time series, from a narrow point of view, is a sequence of observations on a stochastic process made at discrete and equally spaced time intervals. Its future behavior can be predicted by identifying, fitting, and confirming a mathematical model. In this paper, time series analysis is applied to problems concerning runwayinduced vibrations of an aircraft. A simple mathematical model based on this technique is fitted to obtain the impulse response coefficients of an aircraft system considered as a whole for a particular type of operation. Using this model, the output which is the aircraft response can be obtained with lesser computation time for any runway profile as the input.

A differential transformation technique for the analysis of a class of non-linear time varying systems

The scope of the differential transformation technique, developed earlier for the study of non-linear, time invariant systems, has been extended to the domain of time-varying systems by modifications to the differential transformation laws proposed therein. Equivalence of a class of second-order, non-linear, non-autonomous systems with a linear autonomous model of second order is established through these transformation laws. The feasibility of application of this technique in obtaining the response of such non-linear time-varying systems is discussed.

Two-level k-means clustering algorithm for k-tau relationship establishment and linear-time classification

Partitional clustering algorithms, which partition the dataset into a pre-defined number of clusters, can be broadly classified into two types: algorithms which explicitly take the number of clusters as input and algorithms that take the expected size of a cluster as input. In this paper, we propose a variant of the k-means algorithm and prove that it is more efficient than standard k-means algorithms. An important contribution of this paper is the establishment of a relation between the number of clusters and the size of the clusters in a dataset through the analysis of our algorithm. We also demonstrate that the integration of this algorithm as a pre-processing step in classification algorithms reduces their running-time complexity.

Conflict-Tolerant Real-Time Features

This paper addresses the problem of detecting and resolving conflicts due to timing constraints imposed by features in real-time systems. We consider systems composed of a base system with multiple features or controllers, each of which independently advise the system on how to react to input events so as to conform to their individual specifications. We propose a methodology for developing such systems in a modular manner based on the notion of conflict tolerant features that are designed to continue offering advice even when their advice has been overridden in the past. We give a simple priority based scheme for composing such features. This guarantees the maximal use of each feature. We provide a formal framework for specifying such features, and a compositional technique for verifying systems developed in this framework.

Kernels for large margin time-series classification

In this paper we propose a novel family of kernels for multivariate time-series classification problems. Each time-series is approximated by a linear combination of piecewise polynomial functions in a Reproducing Kernel Hilbert Space by a novel kernel interpolation technique. Using the associated kernel function a large margin classification formulation is proposed which can discriminate between two classes. The formulation leads to kernels, between two multivariate time-series, which can be efficiently computed. The kernels have been successfully applied to writer independent handwritten character recognition.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

Supervisory Control for Real-Time Systems Based on Conflict-Tolerant Controllers

This paper addresses the problem of detecting and resolving conflicts due to timing constraints imposed by features in real-time and hybrid systems. We consider systems composed of a base system with multiple features or controllers, each of which independently advise the system on how to react to input events so as to conform to their individual specifications. We propose a methodology for developing such systems in a modular manner based on the notion of conflict-tolerant features that are designed to continue offering advice even when their advice has been overridden in the past. We give a simple priority-based scheme forcomposing such features. This guarantees the maximal use of each feature. We provide a formal framework for specifying such features, and a compositional technique for verifying systems developed in this framework.

Discovering user preferences by using time entries in click-through data to improve search engine results

The search engine log files have been used to gather direct user feedback on the relevancy of the documents presented in the results page. Typically the relative position of the clicks gathered from the log files is used a proxy for the direct user feedback. In this paper we identify reasons for the incompleteness of the relative position of clicks for deciphering the user preferences. Hence, we propose the use of time spent by the user in reading through the document as indicative of user preference for a document with respect to a query. Also, we identify the issues involved in using the time measure and propose means to address them.

Approximate linear time ML decoding on tail-biting trellises in two rounds

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(m log m) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is deduced and simulation results on an AWGN channel using tail-biting trellises for two rate 1/2 convolutional codes with memory 4 and 6 respectively, are reported.

Active and break spells of the Indian summer monsoon

In this paper, we suggest criteria for the identification of active and break events of the Indian summer monsoon on the basis of recently derived high resolution daily gridded rainfall dataset over India (1951-2007). Active and break events are defined as periods during the peak monsoon months of July and August, in which the normalized anomaly of the rainfall over a critical area, called the monsoon core zone exceeds 1 or is less than -1.0 respectively, provided the criterion is satisfied for at least three consecutive days. We elucidate the major features of these events. We consider very briefly the relationship of the intraseasonal fluctuations between these events and the interannual variation of the summer monsoon rainfall. We find that breaks tend to have a longer life-span than active spells.While, almost 80% of the active spells lasted 3-4 days, only 40% of the break spells were of such short duration. A small fraction (9%) of active spells and 32% of break spells lasted for a week or longer. While active events occurred almost every year, not a single break occurred in 26% of the years considered. On an average, there are 7 days of active and break events from July through August. There are no significant trends in either the days of active or break events. We have shown that there is a major difference between weak spells and long intense breaks. While weak spells are characterized by weak moist convective regimes, long intense break events have a heat trough type circulation which is similar to the circulation over the Indian subcontinent before the onset of the monsoon. The space-time evolution of the rainfall composite patterns suggests that the revival from breaks occurs primarily from northward propagations of the convective cloud zone. There are important differences between the spatial patterns of the active/break spells and those characteristic of interannual variation, particularly those associated with the link to ENSO. Hence, the interannual variation of the Indian monsoon cannot be considered as primarily arising from the interannual variation of intraseasonal variation. However, the signature over the eastern equatorial Indian Ocean on intraseasonal time scales is similar to that on the interannual time scales.

Computation-Based Reliability Analysis in Real Time Applications

Reliability analysis for computing systems in aerospace applications must account for actual computations the system performs in the use environment. This paper introduces a theoretical nonhomogeneous Markov model for such applications.