Real-time density matrix renormalization group dynamics of spin and charge transport in push-pull polyenes and related systems

In this paper we investigate the effect of terminal substituents on the dynamics of spin and charge transport in donor-acceptor substituted polyenes [D-(CH)(x)-A] chains, also known as push-pull polyenes. We employ a long-range correlated model Hamiltonian for the D-(CH)(x)-A system, and time-dependent density matrix renormalization group technique for time propagating the wave packet obtained by injecting a hole at a terminal site, in the ground state of the system. Our studies reveal that the end groups do not affect spin and charge velocities in any significant way, but change the amount of charge transported. We have compared these push-pull systems with donor-acceptor substituted polymethine imine (PMI), D-(CHN)(x)-A, systems in which besides electron affinities, the nature of p(z) orbitals in conjugation also alternate from site to site. We note that spin and charge dynamics in the PMIs are very different from that observed in the case of push-pull polyenes, and within the time scale of our studies, transport of spin and charge leads to the formation of a ``quasi-static'' state.

An Opportunistic, Fast, and Distributed Subchannel and User-Pairing Algorithm for OFDMA

Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.

Damage identification of beam-like structures with contiguous and distributed damage

Structural health monitoring of existing infrastructure is currently an active field of research, where elaborate experimental programs and advanced analytical methods are used in identifying the current state of health of critical structures. Change of static deflection as the indicator of damage is the simplest tool in a structural health monitoring scenario of bridges that is least exploited in damage identification strategies. In this paper, some simple and elegant equations based on loss of symmetry due to damage are derived and presented for identification of damage in a bridge girder modeled as a simply supported beam using changes in static deflections and dynamic parameters. A single contiguous and distributed damage, typical of reinforced or prestressed concrete structures, is assumed for the structure. The methodology is extended for a base-line-free as well as base-line-inclusive measurement. Measurement strategy involves application of loads only at two symmetric points one at a time and deflection measurements at those symmetric points as well as at the midspan of the beam. A laboratory-based experiment is used to validate the approach. Copyright (c) 2012 John Wiley & Sons, Ltd.

Cavitation in brittle metallic glasses - Effects of stress state and distributed weak zones

Experimental studies and atomistic simulations have shown that brittle metallic glasses fail by a cavitation mechanism whose origin has been traced to the presence of intrinsic atomic density fluctuations which give rise to weak zones with reduced yield strength. It has been shown recently through continuum analysis that the presence of these zones can lower the cavitation stress considerably under equibiaxial loading. The objective of the present work is to study the effect of the applied stress state on the cavitation behavior of such a heterogeneous plastic solid with distributed weak zones. To this end, 2D plane strain finite element simulations are performed by subjecting a unit cell containing a weak zone to different (biaxiality) stress ratios. The volume fraction and yield strength of the weak zone are varied over a wide range. The results show that unlike in a homogeneous plastic solid, the cavitation stress of the heterogeneous aggregate does not reduce appreciably as the stress ratio decreases from unity when the yield strength of the weak zone is low. It is found that a non-dimensional parameter characterizing the stress state prevailing in the weak zone and its yield properties uniquely control the cavitation stress. The nature of cavitation bifurcation may change from unstable bifurcation to the left at sufficiently low stress ratio to one involving snap cavitation at high stress ratio. (C) 2014 Elsevier Ltd. All rights reserved.

Simple three parameter equations for correlating liquid phase compositions in subcritical and supercritical systems

Two Chrastil type expressions have been developed to model the solubility of supercritical fluids/gases in liquids. The three parameter expressions proposed correlates the solubility as a function of temperature, pressure and density. The equation can also be used to check the self-consistency of the experimental data of liquid phase compositions for supercritical fluid-liquid equilibria. Fifty three different binary systems (carbon-dioxide + liquid) with around 2700 data points encompassing a wide range of compounds like esters, alcohols, carboxylic acids and ionic liquids were successfully modeled for a wide range of temperatures and pressures. Besides the test for self-consistency, based on the data at one temperature, the model can be used to predict the solubility of supercritical fluids in liquids at different temperatures. (C) 2014 Elsevier B.V. All rights reserved.

Identification of dominant modes in random dynamical and aeroelastic systems

Identification of dominant modes is an important step in studying linearly vibrating systems, including flow-induced vibrations. In the presence of uncertainty, when some of the system parameters and the external excitation are modeled as random quantities, this step becomes more difficult. This work is aimed at giving a systematic treatment to this end. The ability to capture the time averaged kinetic energy is chosen as the primary criterion for selection of modes. Accordingly, a methodology is proposed based on the overlap of probability density functions (pdf) of the natural and excitation frequencies, proximity of the natural frequencies of the mean or baseline system, modal participation factor, and stochastic variation of mode shapes in terms of the modes of the baseline system - termed here as statistical modal overlapping. The probabilistic descriptors of the natural frequencies and mode shapes are found by solving a random eigenvalue problem. Three distinct vibration scenarios are considered: (i) undamped arid damped free vibrations of a bladed disk assembly, (ii) forced vibration of a building, and (iii) flutter of a bridge model. Through numerical studies, it is observed that the proposed methodology gives an accurate selection of modes. (C) 2015 Elsevier Ltd. All rights reserved.

RD-TDMA: A Randomized and Distributed TDMA Scheduling for Correlated Contention in WSNs

In wireless sensor networks (WSNs), contention occurs when two or more nodes in a proximity simultaneously try to access the channel. The contention causes collisions, which are very likely to occur when traffic is correlated. The excessive collision not only affects the reliability and the QoS of the application, but also the lifetime of the network. It is well-known that random access mechanisms do not efficiently handle correlated-contention, and therefore, suffer from high collision rate. Most of the existing TDMA scheduling techniques try to find an optimal or a sub-optimal schedule. Usually, the situation of correlated-contention persists only for a short duration, and therefore, it is not worthwhile to take a long time to generate an optimal or a sub-optimal schedule. We propose a randomized distributed TDMA scheduling (RD-TDMA) algorithm to quickly generate a feasible schedule (not necessarily optimal) to handle correlated-contention in WSNs. In RD-TDMA, a node in the network negotiates a slot with its neighbors using the message exchange mechanism. The proposed protocol has been simulated using the Castalia simulator to evaluate its runtime performance. Simulation results show that the RD-TDMA algorithm considerably reduces the time required to schedule.

Length scales in glass-forming liquids and related systems: a review

The central problem in the study of glass-forming liquids and other glassy systems is the understanding of the complex structural relaxation and rapid growth of relaxation times seen on approaching the glass transition. A central conceptual question is whether one can identify one or more growing length scale(s) associated with this behavior. Given the diversity of molecular glass-formers and a vast body of experimental, computational and theoretical work addressing glassy behavior, a number of ideas and observations pertaining to growing length scales have been presented over the past few decades, but there is as yet no consensus view on this question. In this review, we will summarize the salient results and the state of our understanding of length scales associated with dynamical slow down. After a review of slow dynamics and the glass transition, pertinent theories of the glass transition will be summarized and a survey of ideas relating to length scales in glassy systems will be presented. A number of studies have focused on the emergence of preferred packing arrangements and discussed their role in glassy dynamics. More recently, a central object of attention has been the study of spatially correlated, heterogeneous dynamics and the associated length scale, studied in computer simulations and theoretical analysis such as inhomogeneous mode coupling theory. A number of static length scales have been proposed and studied recently, such as the mosaic length scale discussed in the random first-order transition theory and the related point-to-set correlation length. We will discuss these, elaborating on key results, along with a critical appraisal of the state of the art. Finally we will discuss length scales in driven soft matter, granular fluids and amorphous solids, and give a brief description of length scales in aging systems. Possible relations of these length scales with those in glass-forming liquids will be discussed.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Composite Performance and Reliability Analysis for Hypercube Systems

In this paper we propose a novel technique to model and ana¿ lyze the performability of parallel and distributed architectures using GSPN-reward models.

Invariant-preserving Petri net reduction and conditions for invariant-existence

The use of invariants is an important tool for analysis of distributed and concurrent systems modeled by Petri nets. For a large practical system, the computation of desired invariants by the existing techniques is a time-consuming task. This paper proposes a theoretical foundation for simplified computation of desired invariants. We provide invariant-preserving Petri net reduction rules followed by the conditions for the existence of invariants in various well-structured nets. If an invariant exists, it can be found directly from the net structure using the formulas derived, or by applying the existing techniques on the reduced net.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.