Universality in the fast orientational relaxation near isotropic-nematic transition

Detailed molecular dynamics simulations of Lennard-Jones ellipsoids have been carried out to investigate the emergence of criticality in the single-particle orientational relaxation near the isotropic-nematic (IN) phase transition. The simulations show a sudden appearance of a power-law behavior in the decay of the second-rank orientational relaxation as the IN transition is approached. The simulated value of the power-law exponent is 0.56, which is larger than the mean-field value (0.5) but less than the observed value (0.63) and may be due to the finite size of the simulated system. The decay of the first-rank orientational time correlation function, on the other hand, is nearly exponential but its decay becomes very slow near the isotropic-nematic transition, The zero-frequency rotational friction, calculated from the simulated angular Velocity correlation function, shows a marked increase near the IN transition.

High-Temperature Phase Transition Studies in a Novel Fast Ion Conductor, Na2Cd(SO4)2, Probed by Raman Spectroscopy

Temperature-dependent Raman spectroscopic studies were carried out on Na2Cd(SO4)(2) from room temperature to 600 degrees C. We observe two transitions at around 280 and 565 degrees C. These transitions are driven by the change in the SO4 ion. On the basis of these studies, one can explain the changes in the conductivity data observed around 280 and 565 degrees C. At 280 degrees C, spontaneous tilting of the SO4 ion leads to restriction of Na+ mobility. Above 565 degrees C, the SO4 ion starts to rotate freely, leading to increased mobility of Na+ ion in the channel.

Fast decay of the velocity autocorrelation function in dense shear flow of inelastic hard spheres

We find in complementary experiments and event-driven simulations of sheared inelastic hard spheres that the velocity autocorrelation function psi(t) decays much faster than t(-3/2) obtained for a fluid of elastic spheres at equilibrium. Particle displacements are measured in experiments inside a gravity-driven flow sheared by a rough wall. The average packing fraction obtained in the experiments is 0.59, and the packing fraction in the simulations is varied between 0.5 and 0.59. The motion is observed to be diffusive over long times except in experiments where there is layering of particles parallel to boundaries, and diffusion is inhibited between layers. Regardless, a rapid decay of psi(t) is observed, indicating that this is a feature of the sheared dissipative fluid, and is independent of the details of the relative particle arrangements. An important implication of our study is that the non-analytic contribution to the shear stress may not be present in a sheared inelastic fluid, leading to a wider range of applicability of kinetic theory approaches to dense granular matter.

Fast Multiple Access Selection through variable power transmissions

Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.

Fast matrix transposition computer implementation

Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc has been programmed and tested. A simple description of computer implementation is given in this note.

Fast Public Key Cryptosystem Based On Matrix Rings

A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

Resistivity Maxima in Lithium Fast-Ion Conductors at High Pressure

The resistivity of two types of lithium fast-ion conductors, Li16-2xZnx(GeO4)4 (x=1,2) and Li3+xGexV1-xO4 (x=0.25,0.6,0.72), showed pronounced maxima as a function of pressure. For the first type, ln(ρ / ρ0) peaked at values of 0.12 (x=1) and 0.35 (x=2) near 20 kbar and decreased thereafter up to 80 kbar. Thermal activation energies and prefactors also showed corresponding maxima. For the second type, ln(ρ / ρ0) increased to 3-4 between 20 and 32 kbar. Near 80 kbar, ρ decreased (for x=0.25) by a factor of 250. The results are interpreted in terms of negative activation volumes.

A fast acting detector for abnormal output voltages of an UPS system

A new method of sensing the abnormal output voltage conditions of a single phase UPS system is presented, which provides the information almost instantaneously, so that a fast load transfer can be initiated. A continuous monitoring of the UPS output instantaneous voltage is used so that any under/over voltage, transients, or waveform distortion present can be detected.

Fast Accurate Transient Stability Simulations

The paper describes a Simultaneous Implicit (SI) approach for transient stability simulations based on an iterative technique using traingularised admittance matrix [1]. The reduced saliency of generator in the subtransient state is taken advantage of to speed up the algorithm. Accordingly, generator differential equations, except rotor swing, contain voltage proportional to fluxes in the main field, dampers and a hypothetical winding representing deep flowing eddy currents, as state variables. The simulation results are validated by comparison with two independent methods viz. Runge-Kutta simulation for a simplified system and a method based on modelling damper windings using conventional induction motor theory.

A fast method of comparing protein structures

Comparative studies on protein structures form an integral part of protein crystallography. Here, a fast method of comparing protein structures is presented. Protein structures are represented as a set of secondary structural elements. The method also provides information regarding preferred packing arrangements and evolutionary dynamics of secondary structural elements. This information is not easily obtained from previous methods. In contrast to those methods, the present one can be used only for proteins with some secondary structure. The method is illustrated with globin folds, cytochromes and dehydrogenases as examples.

Block- and strand-multiplexing for fast computation of a class of transforms

The transforms dealt with in this paper are defined in terms of the transform kernels which are Kroneeker products of the two or more component kernels. The signal flow-graph for the computation of such a transform is obtained with the flow-graphs for the component transforms as building blocks.

Korteweg-de Vries equation for the propagation of fast ion-acoustic waves in multi-dimensions

Abstract is not available.

Kernel-based spatial-color modeling for fast moving object tracking

Visual tracking has been a challenging problem in computer vision over the decades. The applications of Visual Tracking are far-reaching, ranging from surveillance and monitoring to smart rooms. Mean-shift (MS) tracker, which gained more attention recently, is known for tracking objects in a cluttered environment and its low computational complexity. The major problem encountered in histogram-based MS is its inability to track rapidly moving objects. In order to track fast moving objects, we propose a new robust mean-shift tracker that uses both spatial similarity measure and color histogram-based similarity measure. The inability of MS tracker to handle large displacements is circumvented by the spatial similarity-based tracking module, which lacks robustness to object's appearance change. The performance of the proposed tracker is better than the individual trackers for tracking fast-moving objects with better accuracy.

Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.