Elliptical tracers in two-dimensional, homogeneous, isotropic fluid turbulence: The statistics of alignment, rotation, and nematic order

We study the statistical properties of orientation and rotation dynamics of elliptical tracer particles in two-dimensional, homogeneous, and isotropic turbulence by direct numerical simulations. We consider both the cases in which the turbulent flow is generated by forcing at large and intermediate length scales. We show that the two cases are qualitatively different. For large-scale forcing, the spatial distribution of particle orientations forms large-scale structures, which are absent for intermediate-scale forcing. The alignment with the local directions of the flow is much weaker in the latter case than in the former. For intermediate-scale forcing, the statistics of rotation rates depends weakly on the Reynolds number and on the aspect ratio of particles. In contrast with what is observed in three-dimensional turbulence, in two dimensions the mean-square rotation rate increases as the aspect ratio increases.

Polarization-rotation resonances with subnatural widths using a control laser

We demonstrate extremely narrow resonances for polarization rotation in an atomic vapor. The resonances are created using a strong control laser on the same transition, which polarizes the atoms due to optical pumping among the magnetic sublevels. As the power in the control laser is increased, successively higher-order nested polarization-rotation resonances are created, with progressively narrower linewidths. We study these resonances in the D-2 line of Rb in a room temperature vapor cell, and demonstrate a width of 0.14 G for the third-order rotation. The physical basis for the observed resonances is that optical pumping results in a simplified. AV-type level structure with differential dressing of the levels by the control laser, which is why the control power has to be sufficiently high for each resonance to appear. This explanation is borne out by a density-matrix analysis of the system. The dispersive lineshape and subnatural width of the resonance lends itself naturally to applications such as laser locking to atomic transitions and precision measurements. Copyright (c) EPLA, 2014

Efficient QR Decomposition Using Low Complexity Column-wise Givens Rotation (CGR)

QR decomposition (QRD) is a widely used Numerical Linear Algebra (NLA) kernel with applications ranging from SONAR beamforming to wireless MIMO receivers. In this paper, we propose a novel Givens Rotation (GR) based QRD (GR QRD) where we reduce the computational complexity of GR and exploit higher degree of parallelism. This low complexity Column-wise GR (CGR) can annihilate multiple elements of a column of a matrix simultaneously. The algorithm is first realized on a Two-Dimensional (2 D) systolic array and then implemented on REDEFINE which is a Coarse Grained run-time Reconfigurable Architecture (CGRA). We benchmark the proposed implementation against state-of-the-art implementations to report better throughput, convergence and scalability.

Energy Sharing for Multiple Sensor Nodes With Finite Buffers

We consider the problem of finding optimal energy sharing policies that maximize the network performance of a system comprising of multiple sensor nodes and a single energy harvesting (EH) source. Sensor nodes periodically sense the random field and generate data, which is stored in the corresponding data queues. The EH source harnesses energy from ambient energy sources and the generated energy is stored in an energy buffer. Sensor nodes receive energy for data transmission from the EH source. The EH source has to efficiently share the stored energy among the nodes to minimize the long-run average delay in data transmission. We formulate the problem of energy sharing between the nodes in the framework of average cost infinite-horizon Markov decision processes (MDPs). We develop efficient energy sharing algorithms, namely Q-learning algorithm with exploration mechanisms based on the epsilon-greedy method as well as upper confidence bound (UCB). We extend these algorithms by incorporating state and action space aggregation to tackle state-action space explosion in the MDP. We also develop a cross entropy based method that incorporates policy parameterization to find near optimal energy sharing policies. Through simulations, we show that our algorithms yield energy sharing policies that outperform the heuristic greedy method.

Throughput Analysis of Best-m Feedback in OFDM Systems with Uniformly Correlated Subchannels

Practical orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE), exploit multi-user diversity using very limited feedback. The best-m feedback scheme is one such limited feedback scheme, in which users report only the gains of their m best subchannels (SCs) and their indices. While the scheme has been extensively studied and adopted in standards such as LTE, an analysis of its throughput for the practically important case in which the SCs are correlated has received less attention. We derive new closed-form expressions for the throughput when the SC gains of a user are uniformly correlated. We analyze the performance of the greedy but unfair frequency-domain scheduler and the fair round-robin scheduler for the general case in which the users see statistically non-identical SCs. An asymptotic analysis is then developed to gain further insights. The analysis and extensive numerical results bring out how correlation reduces throughput.

Reduced Look Ahead Orthogonal Matching Pursuit

Compressed Sensing (CS) is an elegant technique to acquire signals and reconstruct them efficiently by solving a system of under-determined linear equations. The excitement in this field stems from the fact that we can sample at a rate way below the Nyquist rate and still reconstruct the signal provided some conditions are met. Some of the popular greedy reconstruction algorithms are the Orthogonal Matching Pursuit (OMP), the Subspace Pursuit (SP) and the Look Ahead Orthogonal Matching Pursuit (LAOMP). The LAOMP performs better than the OMP. However, when compared to the SP and the OMP, the computational complexity of LAOMP is higher. We introduce a modified version of the LAOMP termed as Reduced Look Ahead Orthogonal Matching Pursuit (Reduced LAOMP). Reduced LAOMP uses prior information from the results of the OMP and the SP in the quest to speedup the look ahead strategy in the LAOMP. Monte Carlo simulations of this algorithm deliver promising results.

Multi-agent Reinforcement Learning for Traffic Signal Control

Optimal control of traffic lights at junctions or traffic signal control (TSC) is essential for reducing the average delay experienced by the road users amidst the rapid increase in the usage of vehicles. In this paper, we formulate the TSC problem as a discounted cost Markov decision process (MDP) and apply multi-agent reinforcement learning (MARL) algorithms to obtain dynamic TSC policies. We model each traffic signal junction as an independent agent. An agent decides the signal duration of its phases in a round-robin (RR) manner using multi-agent Q-learning with either is an element of-greedy or UCB 3] based exploration strategies. It updates its Q-factors based on the cost feedback signal received from its neighbouring agents. This feedback signal can be easily constructed and is shown to be effective in minimizing the average delay of the vehicles in the network. We show through simulations over VISSIM that our algorithms perform significantly better than both the standard fixed signal timing (FST) algorithm and the saturation balancing (SAT) algorithm 15] over two real road networks.

Partial rotation of the isopropyl group in the solid state: single-crystal-to-single-crystal phase transformation in a carvacrol derivative

A hitherto unseen rotation of the isopropyl group in the solid state, predicted to be forbidden based on theoretical investigations, is reported. This C-C rotation observed during the temperature dependent single-crystal-to-single-crystal transformation is attributed to the concomitant changes in molecular structure and intermolecular packing.

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.

Evolution of multivariant microstructures with anisotropic misfit: A phase field study

We study, in two dimensions, the effect of misfit anisotropy on microstructural evolution during precipitation of an ordered beta phase from a disordered alpha matrix; these phases have, respectively, 2- and 6-fold rotation symmetries. Thus, precipitation produces three orientational variants of beta phase particles, and they have an anisotropic (and crystallographically equivalent) misfit strain with the matrix. The anisotropy in misfit is characterized using a parameter t = epsilon(yy)/epsilon(xx), where epsilon(xx) and epsilon(yy) are the principal components of the misfit strain tensor. Our phase field, simulations show that the morphology of beta phase particles is significantly influenced by 1, the level of misfit anisotropy. Particles are circular in systems with dilatational misfit (t = 1), elongated along the direction of lower principal misfit when 0 < t < 1 and elongated along the invariant direction when - 1 <= t <= 0. In the special case of a pure shear misfit strain (t = - 1), the microstructure exhibits star, wedge and checkerboard patterns; these microstructural features are in agreement with those in Ti-Al-Nb alloys.

Unsteady-Flow Of A Viscous-Fluid Between 2 Parallel Disks With A Time-Varying Gap Width And A Magnetic-Field

The unsteady incompressible viscous fluid flow between two parallel infinite disks which are located at a distance h(t*) at time t* has been studied. The upper disk moves towards the lower disk with velocity h'(t*). The lower disk is porous and rotates with angular velocity Omega(t*). A magnetic field B(t*) is applied perpendicular to the two disks. It has been found that the governing Navier-Stokes equations reduce to a set of ordinary differential equations if h(t*), a(t*) and B(t*) vary with time t* in a particular manner, i.e. h(t*) = H(1 - alpha t*)(1/2), Omega(t*) = Omega(0)(1 - alpha t*)(-1), B(t*) = B-0(1 - alpha t*)(-1/2). These ordinary differential equations have been solved numerically using a shooting method. For small Reynolds numbers, analytical solutions have been obtained using a regular perturbation technique. The effects of squeeze Reynolds numbers, Hartmann number and rotation of the disk on the flow pattern, normal force or load and torque have been studied in detail

Unsteady flow over a stretching surface with a magnetic field in a rotating fluid

The effect of the magnetic field on the unsteady flow over a stretching surface in a rotating fluid has been studied. The unsteadiness in the flow field is due to the time-dependent variation of the velocity of the stretching surface and the angular velocity of the rotating fluid. The Navier-Stokes equations and the energy equation governing the flow and the heat transfer admit a self-similar solution if the velocity of the stretching surface and the angular velocity of the rotating fluid vary inversely as a linear function of time. The resulting system of ordinary differential equations is solved numerically using a shooting method. The rotation parameter causes flow reversal in the component of the velocity parallel to the strerching surface and the magnetic field tends to prevent or delay the flow reversal. The surface shear stresses dong the stretching surface and in the rotating direction increase with the rotation parameter, but the surface heat transfer decreases. On the other hand, the magnetic field increases the surface shear stress along the stretching surface, but reduces the surface shear stress in the rotating direction and the surface heat transfer. The effect of the unsteady parameter is more pronounced on the velocity profiles in the rotating direction and temperature profiles.

Adenosine-5'-carboxylic Acid

The two molecules in the asymmetric unit of adenosine-5'-carboxylic acid, C10H11N5O5, exist as zwitterions with N1 protonated and the carboxyl groups ionized. Both molecules are in an anti conformation with glycosyl torsion angles of -161.4(3) and -155.5(3)degrees. The ribose moieties adopt a C3-endo-C2-exo twist conformation. The pseudo-rotation parameters are P = 0.01(1) and 6.58(1)degrees, and tau(m) = 36.2(2) and 34.6(2)degrees, for molecules A and B, respectively. The carboxyl groups of A and B are not in the standard g(+), g(-) or t conformations. Both Watson-Crick sites, N1 and N6, of the adenine bases are involved in a pair of hydrogen bonds with the dissociated carboxyl groups, forming a cyclic tetramer. The adenine base of molecule A stacks on the ribose O4' atom of a symmetry-related B molecule at a distance of 2.88 Angstrom; the adenine base of B stacks in an analogous way at a distance of 2.91 Angstrom.

An Investigation of Friction During Friction Stir Welding of Metallic Materials

The technique of friction stir welding (FSW) puts effective use frictional heat for the purpose of joining metallic materials. In this research article, we present and discuss an experimental method to determine the coefficient of friction during FSW. The experiments were conducted to study the interaction between the FSW tool (a die steel) and the base metal (a high strength aluminum alloy) at various contact pressures (13MPa, 26MPa, and 39MPa) and rotation speeds (200rpm, 600rpm, 1000rpm, and 1400rpm). The experimental results, the microstructure, and the process temperature reveal the experimental setup to be capable of simulating the conditions during FSW. The coefficient of friction was found to vary from 0.15 to 1.4, and the temperature increased to as high as 450C. The coefficient of friction was found to increase with temperature. There exists a critical temperature at which point a steep increase in the coefficient of friction was observed. The critical temperature decreases from 250C at a contact pressure of 26MPa to 200C at contact pressure of 34MPa. Below the critical temperature at a specific contact pressure the maximum coefficient of friction is 0.6, and above the critical temperature it reaches a value as high as 1.4. The steep increase in the coefficient of friction is found to be due to the seizure phenomenon and the contact condition during FSW between the tool and the workpiece (base metal) is found to be sticking.