4 resultados para Linear chains, critical exponents, complex networks, vehicular traffic
Resumo:
The emerging field of quantum thermodynamics is contributing important results and insights into archetypal many-body problems, including quantum phase transitions. Still, the question whether out-of-equilibrium quantities, such as fluctuations of work, exhibit critical scaling after a sudden quench in a closed system has remained elusive. Here, we take a novel approach to the problem by studying a quench across an impurity quantum critical point. By performing density matrix renormalization group computations on the two-impurity Kondo model, we are able to establish that the irreversible work produced in a quench exhibits finite-size scaling at quantum criticality. This scaling faithfully predicts the equilibrium critical exponents for the crossover length and the order parameter of the model, and, moreover, implies a new exponent for the rescaled irreversible work. By connecting the irreversible work to the two-impurity spin correlation function, our findings can be tested experimentally.
Resumo:
Let A be a unital dense algebra of linear mappings on a complex vector space X. Let φ = Σn i=1 Mai,bi be a locally quasi-nilpotent elementary operator of length n on A. We show that, if {a1, . . . , an} is locally linearly independent, then the local dimension of V (φ) = span{biaj : 1 ≤ i, j ≤ n} is at most n(n−1) 2 . If ldim V (φ) = n(n−1) 2 , then there exists a representation of φ as φ = Σn i=1 Mui,vi with viuj = 0 for i ≥ j. Moreover, we give a complete characterization of locally quasinilpotent elementary operators of length 3.
Resumo:
The focus of this work is to develop the knowledge of prediction of the physical and chemical properties of processed linear low density polyethylene (LLDPE)/graphene nanoplatelets composites. Composites made from LLDPE reinforced with 1, 2, 4, 6, 8, and 10 wt% grade C graphene nanoplatelets (C-GNP) were processed in a twin screw extruder with three different screw speeds and feeder speeds (50, 100, and 150 rpm). These applied conditions are used to optimize the following properties: thermal conductivity, crystallization temperature, degradation temperature, and tensile strength while prediction of these properties was done through artificial neural network (ANN). The three first properties increased with increase in both screw speed and C-GNP content. The tensile strength reached a maximum value at 4 wt% C-GNP and a speed of 150 rpm as this represented the optimum condition for the stress transfer through the amorphous chains of the matrix to the C-GNP. ANN can be confidently used as a tool to predict the above material properties before investing in development programs and actual manufacturing, thus significantly saving money, time, and effort.
Resumo:
We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary BS and the interference power constraints at the primary users. The problem of interest differs from the ones studied previously that often assumed a sum power constraint and/or single antenna employed at either both the primary and secondary receivers or the primary receivers. To develop an efficient numerical algorithm, we first invoke the rank relaxation method to transform the considered problem into a convex-concave problem based on a downlink-uplink result. We then propose a barrier interior-point method to solve the resulting saddle point problem. In particular, in each iteration of the proposed method we find the Newton step by solving a system of discrete-time Sylvester equations, which help reduce the complexity significantly, compared to the conventional method. Simulation results are provided to demonstrate fast convergence and effectiveness of the proposed algorithm.