Secure Concurrency Control in Firm Real-Time Database Systems

Many real-time database applications arise in electronic financial services, safety-critical installations and military systems where enforcing security is crucial to the success of the enterprise. For real-time database systems supporting applications with firm deadlines, we investigate here the performance implications, in terms of killed transactions, of guaranteeing multilevel secrecy. In particular, we focus on the concurrency control (CC) aspects of this issue. Our main contributions are the following: First, we identify which among the previously proposed real-time CC protocols are capable of providing covert-channel-free security. Second, using a detailed simulation model, we profile the real-time performance of a representative set of these secure CC protocols for a variety of security-classified workloads and system configurations. Our experiments show that a prioritized optimistic CC protocol, OPT-WAIT, provides the best overall performance. Third, we propose and evaluate a novel "dual-CC" approach that allows the real-time database system to simultaneously use different CC mechanisms for guaranteeing security and for improving real-time performance. By appropriately choosing these different mechanisms, concurrency control protocols that provide even better performance than OPT-WAIT are designed. Finally, we propose and evaluate GUARD, an adaptive admission-control policy designed to provide fairness with respect to the distribution of killed transactions across security levels. Our experiments show that GUARD efficiently provides close to ideal fairness for real-time applications that can tolerate covert channel bandwidths of upto one bit per second.

Some recent results on the stability of linear time varying systems

Some theorems derived recently by the authors on the stability of multidimensional linear time varying systems are reported in this paper. To begin with, criteria based on Liapunov�s direct method are stated. These are followed by conditions on the asymptotic behaviour and boundedness of solutions. Finally,L 2 andL ? stabilities of these systems are discussed. In conclusion, mention is made of some of the problems in aerospace engineering to which these theorems have been applied.

Time Dependent Operator-split and Unsplit Schemes for One Dimensional Premixed Flames

This paper is concerned with a study of an operator split scheme and unsplit scheme for the computation of adiabatic freely propagating one-dimensional premixed flames. The study uses unsteady method for both split and unsplit schemes employing implicit chemistry and explicit diffusion, a combination which is stable and convergent. Solution scheme is not sensitive to the initial starting estimate and provides steady state even with straight line profiles (far from steady state) in small number of time steps. Two systems H2-Air and H2-NO (involving complex nitrogen chemistry) are considered in presentinvestigation. Careful comparison shows that the operator split approach is slightly superior than the unsplit when chemistry becomes complex. Comparison of computational times with those of existing steady and unsteady methods seems to suggest that the method employing implicit-explicit algorithm is very efficient and robust.

A kinetic Ising model study of dynamical correlations in confined fluids: Emergence of both fast and slow time scales

Experiments and computer simulation studies have revealed existence of rich dynamics in the orientational relaxation of molecules in confined systems such as water in reverse micelles, cyclodextrin cavities, and nanotubes. Here we introduce a novel finite length one dimensional Ising model to investigate the propagation and the annihilation of dynamical correlations in finite systems and to understand the intriguing shortening of the orientational relaxation time that has been reported for small sized reverse micelles. In our finite sized model, the two spins at the two end cells are oriented in the opposite directions to mimic the effects of surface that in real system fixes water orientation in the opposite directions. This produces opposite polarizations to propagate inside from the surface and to produce bulklike condition at the center. This model can be solved analytically for short chains. For long chains, we solve the model numerically with Glauber spin flip dynamics (and also with Metropolis single-spin flip Monte Carlo algorithm). We show that model nicely reproduces many of the features observed in experiments. Due to the destructive interference among correlations that propagate from the surface to the core, one of the rotational relaxation time components decays faster than the bulk. In general, the relaxation of spins is nonexponential due to the interplay between various interactions. In the limit of strong coupling between the spins or in the limit of low temperature, the nature of relaxation of the spins undergoes a qualitative change with the emergence of a homogeneous dynamics where decay is predominantly exponential, again in agreement with experiments. (C) 2010 American Institute of Physics. doi: 10.1063/1.3474948]

Optimal Receive Antenna Selection in Time-Varying Fading Channels with Practical Training Constraints

Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, a preferable strategy is to linearly weight the channel estimates of different antennas differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then characterize explicitly the optimal selection weights that minimize the SEP. We also consider packet reception, in which multiple symbols of a packet are received by the same antenna. New suboptimal, but computationally efficient weighted selection schemes are proposed for reducing the packet error rate. The benefits of weighted selection are also demonstrated using a practical channel code used in third generation cellular systems. Our results show that optimal weighted selection yields a significant performance gain over conventional unweighted selection.

Terahertz Time Domain Spectroscopy to Detect Low-Frequency Vibrations of Double-Walled Carbon Nanotubes

We have measured the frequency-dependent real index of refraction and extinction coefficient (and hence the complex dielectric function) of a free-standing double-walled carbon nanotube film of thickness 200 nm by using terahertz time domain spectroscopy in the frequency range 0.1 to 2.5 THz. The real index of refraction and extinction coefficient have very high values of approximately 52 and 35, respectively, at 0.1 THz, which decrease at higher frequencies. Two low-frequency phonon modes of the carbon nanotubes at 0.45 and 0.75 THz were clearly observed for the first time in the real and imaginary parts of the complex dielectric function along with a broad resonance centred at around 1.45 THz, the latter being similar to that in single-walled carbon nanotubes assigned to electronic excitations. Our experiments bring out a possible application of double-walled carbon nanotube films as a neutral density filter in the THz range.

Trajectories of charged particles in the static Ernst space-time

The authors study the trajectories of charged particles in Ernst's space-time representing a static black hole immersed in a magnetic field. They find bound orbits always exist for realistic magnetic field strengths. A similar investigation is carried out for the case of Melvin's magnetic universe and for a corresponding test field superposed on a flat space-time.

On Minimization of Test Application Time for RAS

Conventional Random access scan (RAS) for testing has lower test application time, low power dissipation, and low test data volume compared to standard serial scan chain based design In this paper, we present two cluster based techniques, namely, Serial Input Random Access Scan and Variable Word Length Random Access Scan to reduce test application time even further by exploiting the parallelism among the clusters and performing write operations on multiple bits Experimental results on benchmarks circuits show on an average 2-3 times speed up in test write time and average 60% reduction in write test data volume