Universal instability modes in internal and external flows

Two prototypical external and internal flows have been studied which display linear temporal instability followed by nonlinear saturation taking the flows to a new equilibrium state. Direct simulation results are obtained using a specific formulation and numerical methods with very high accuracy. These results are analyzed via proper orthogonal decomposition (POD), which reveal similar modes for flow past a circular cylinder and flow inside a lid-driven cavity, indicating universality of such modes. Unlike many other efforts on reduced order modeling via POD, here the emphasis has been on understanding the physical aspect of the flow instability which requires very high accuracy of the simulation. Then, the obtained POD modes are related to the instability modes (in the classical sense of defining the latter) and new generic types of instability modes are identified in the studied external and internal flows. These new modes have been reported for flow past a circular cylinder [Sengupta TK, Singh N, Suman VK. Dynamical system approach to instability of flow past a circular cylinder. J Fluid Mech 2010;656:82–115] which help one in understanding the instability sequence and the relative importance of these modes in the flow evolution starting from an impulsive start. Present comparative study, furthermore, reveals universality of such instability modes by showing their presence for the flow inside a lid-driven cavity as well. Despite seeming dissimilarities between these two flows, similarities between the instability portrait of these two flows suggest universality of such modes. From the equilibrium amplitude of vorticity time-series, we establish the presence of multiple modes and multiple bifurcation sequences for these flows in parameter space. Existing theory due to Landau and Stuart that considers only a single dominant mode and its self-interaction does not explain all these features. We invoke a multi-modal interaction model in the cited reference above, termed as Landau–Stuart–Eckhaus (LSE) equation in recognition of Eckhaus’ work in modifying the classical Stuart–Landau equation. We also show that the new instability modes do not follow either the classical Stuart–Landau or the newly proposed LSE model equations and for this reason we call these as anomalous modes. Two specific classes of anomalous modes are identified and classified in the present work. Empirical expressions for the evolution of these anomalous modes are presented and their unambiguous role during instabilities is discussed.     

A recursive maximum a posteriori estimator

Kalman Filter (KF) is the optimal state estimator for linear dynamical systems in the presence of zero mean white Gaussian noise. It is a minimum mean square error (MMSE) estimator. In the present work a recursive maximum a posteriori estimator (RMAPE) has been developed from basic principles of estimation. This estimator may be used for realtime state estimation of linear dynamical systems in presence of zero mean white Gaussian noise. It is further shown here that the KF can be derived from this RMAPE algorithm, i.e. this work shows an alternative method way to derive the KF. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Face posture estimation using eigen analysis on an IBR (image based rendered) database

In this paper, we present a novel representation of the human face for estimating the orientation of the human head in a two dimensional intensity image. The method combines the use of the much familiar eigenvalue based dissimilarity measure with image based rendering. There are two main components of the algorithm described here: the offline hierarchical image database generation and organization, and the online pose estimation stage. The synthetic images of the subject's face are automatically generated offline, for a large set of pose parameter values, using an affine coordinate based image reprojection technique. The resulting database is formally called as the IBR (or image based rendered) database. This is followed by the hierarchical organization of the database, which is driven by the eigenvalue based dissimilarity measure between any two synthetic image pair. This hierarchically organized database is a detailed, yet structured, representation of the subject's face. During the pose estimation of a subject in an image, the eigenvalue based measure is invoked again to search the synthetic (IBR) image closest to the real image. This approach provides a relatively easy first step to narrow down the search space for complex feature detection and tracking algorithms in potential applications like virtual reality and video-teleconferencing applications.     

A weightage formula to rerank periodicals in the field of microbiology

Ranking lists of periodicals in different scientific disciplines are generally based on the total number of citations derived from a group of source journals with equal weightage given to all citations irrespective of chronology. As a result, in all these ranking lists, the position occupied by the post-war journals, may not be an accurate index of their demand or usefulness to research workers in the concerned field. This may happen because the quantum of published literature in the new journals is limited by the period for which they have been in existence, which is in many cases less than 20 years. Moreover, many of the post-war journals appearing in all these recent ranking lists have started publication even after 1960s, and their enumerated citations cover in fact a variable period of less than 20 years unlike in the case of pre-war journals. To avoid such discriminating against new journals which necessarily have fewer citation credits Sengupta suggested earlier an off-setting weightage formula which has been applied in this paper to rerank microbiology periodicals. A revised ranking list in the field of microbiology has been recommended in preference to the earlier one compiled by Sengupta. Results and findings, after application of the weightage formula, have been presented and discussed in this paper.     

Propagation of correlations in local random quantum circuits

We derive a dynamical bound on the propagation of correlations in local random quantum circuits—lattice spin systems where piecewise quantum operations—in space and time—occur with classical probabilities. Correlations are quantified by the Frobenius norm of the commutator of two positive operators acting on disjoint regions of a one-dimensional circular chain of length L. For a time \(t=O(L)\), correlations spread ballistically to spatial distances \(\mathcal {D}=t\), growing at best, diffusively with time for any distance within that radius with extensively suppressed distance- dependent corrections. For \(t=\varOmega (L^2)\), all parts of the system get almost equally correlated with exponentially suppressed distance- dependent corrections and approach the maximum amount of correlations that may be established asymptotically.     

Modular synchronization in distributed, multiversion databases:version control and concurrency control

A version control mechanism is proposed that enhances the modularity and extensibility of multiversion concurrency control algorithms. The multiversion algorithms are decoupled into two components: version control and concurrency control. This permits modular development of multiversion protocols and simplifies the task of proving the correctness of these protocols. A set of procedures for version control is described that defines the interface with the version control component. It is shown that the same interface can be used by the database actions of both two-phase locking and time-stamp concurrency control protocols to access multiversion data. An interesting feature of the framework is that the execution of read-only transactions becomes completely independent of the underlying concurrency control implementation. Unlike other multiversion algorithms, read-only transactions in this scheme do not modify any version-related information, and therefore do not interfere with the execution of read-write transactions. The extension of the multiversion algorithms to a distributed environment becomes very simple     

Optimisation of tensile membrane structures under uncertain wind loads using PCE and kriging based metamodels

Tensile membrane structures (TMS) are light-weight flexible structures that are designed to span long distances with structural efficiency. The stability of a TMS is jeopardised under heavy wind forces due to its inherent flexibility and inability to carry out-of-plane moment and shear. A stable TMS under uncertain wind loads (without any tearing failure) can only be achieved by a proper choice of the initial prestress. In this work, a double-loop reliability-based design optimisation (RBDO) of TMS under uncertain wind load is proposed. Using a sequential polynomial chaos expansion (PCE) and kriging based metamodel, this RBDO reduces the cost of inner-loop reliability analysis involving an intensive finite element solver. The proposed general approach is applied to the RBDO of two benchmark TMS and its computational efficiency is demonstrated through these case studies. The method developed here is suggested for RBDO of large and complex engineering systems requiring costly numerical solution.     

Hadamard quantum broadcast channels

We consider three different communication tasks for quantum broadcast channels, and we determine the capacity region of a Hadamard broadcast channel for these various tasks. We define a Hadamard broadcast channel to be such that the channel from the sender to one of the receivers is entanglement-breaking and the channel from the sender to the other receiver is complementary to this one. As such, this channel is a quantum generalization of a degraded broadcast channel, which is well known in classical information theory. The first communication task we consider is classical communication to both receivers, the second is quantum communication to the stronger receiver and classical communication to other, and the third is entanglement-assisted classical communication to the stronger receiver and unassisted classical communication to the other. The structure of a Hadamard broadcast channel plays a critical role in our analysis: The channel to the weaker receiver can be simulated by performing a measurement channel on the stronger receiver’s system, followed by a preparation channel. As such, we can incorporate the classical output of the measurement channel as an auxiliary variable and solve all three of the above capacities for Hadamard broadcast channels, in this way avoiding known difficulties associated with quantum auxiliary variables.     

Fairness of Transitions in Diagnosability of Discrete Event Systems

Failure diagnosability has been widely studied for discrete event system (DES) models because of modeling simplicity and computational efficiency due to abstraction. In the literature it is often held that for diagnosability, such models can be used not only for systems that fall naturally in the class of DES but also for the ones traditionally treated as continuous variable dynamic systems. A class of algorithms for failure diagnosability of DES models has been successfully developed for systems where fairness is not a part of the model. These algorithms are based on detecting cycles in the normal and the failure model that look identical. However, there exist systems with all transitions fair where the diagnosability condition that hinges upon this feature renders many failures non-diagnosable although they may actually be diagnosable by transitions out of a cycle. Hence, the diagnosability conditions based on cycle detection need to be modified to hold for many real-world systems where all transitions are fair. In this work, however, it is shown by means of an example that a system may have some transitions fair and some unfair. A new failure diagnosability mechanism is proposed for DES models with both fair and unfair transitions. Time complexity for deciding diagnosability of DES models with fair and unfair transitions is analyzed and compared with the time complexities of other DES diagnosability analysis methods reported in the literature.