Search

In Computational Fluid Dynamics (CFD) studies composed of the coupling of different simulations, the uncertainty in one stage may be propagated to the following stage and affect the accuracy of the prediction. In this paper, a framework for uncertainty quantification is applied to the two-step simulation of the mechanical design of a swirling jet flow generated by a rotating pipe (\textit{Simulation 1}) impinging on a flat plate to provide convective heat transfer (\textit{Simulation 2}). The first approach is the Stochastic Collocation Method (SCM) with Clenshaw-Curtis sparse grids. The conclusion drawn from the analysis is that the simulated system does not exhibit a significant sensitivity to stochastic variations of model input parameters, over the tested uncertainty ranges. Additionally, a set of non-linear regression models for the stochastic velocity and turbulent profiles for the pipe nozzle are created and tested, since impinging jets at Reynolds number of $Re=23000$ are very frequent in the literature, but stochastic inlet conditions have never been provided. Numerical results demonstrate a negligible difference in the predicted convective heat transfer with respect to the use of the profiles simulated via CFD. These suggested surrogate models can be directly embedded onto other CFD applications (e.g arrays of jets or jet flows impinging on plates with different shapes) in which a realistic swirling flow under uncertainty can be of interest.

Quantum correlation provides a promising measure beyond entanglement. Here, we propose a necessary and sufficient condition for nonzero quantum correlation in continuous variable systems, which is simple and easy to perform in terms of a marker $Q_r$. In order to get this condition, we introduce continuous-variable local orthogonal bases of the operator space, which are generalized from the orthogonal basis sets in local operator space for discrete variables. Based on this, we obtain the marker $Q_r$ for all bipartite continuous variable states, and provide several examples including two-mode Gaussian and non-Gaussian states. Our result may provide a candidate for quantum correlation measures, and can be measured by designed quantum circuits., Comment: 17 pages, 2 figures

In this letter we propose a set of conditions on the joint probabilities as a test of genuine multipartite nonlocality without inequality. Our test is failed by all non-signaling local models in which even nonlocal correlations among some observables (not all) are allowed as long as these correlations respect the non-signaling principle. A pass of our test by a state therefore indicates that this state cannot be simulated by any non-signaling local models, i.e., the state exhibits genuine multipartite nonlocality. It turns out that all entangled symmetric n-qubit ($n \geq 3$) states pass our test and therefore are n-way nonlocal. Also we construct two Bell-type inequalities from our proposed test whose violations indicate genuine multipartite nonlocal correlations., Comment: 6 pages, 1 appendix

We show that a single Bell's inequality with two dichotomic observables for each observer, which is originated from Hardy's nonlocality proof without inequalities, is violated by all entangled pure states of a given number of particles, each of which may have a different number of energy levels. Thus Gisin's theorem is proved in its most general form from which it follows that for pure states Bell's nonlocality and quantum entanglement are equivalent., Comment: 7 pages 1 table and 1 appendix

The control of epidemic spreading is essential to avoid potential fatal consequences and also, to lessen unforeseen socio-economic impact. The need for effective control is exemplified during the severe acute respiratory syndrome (SARS) in 2003, which has inflicted near to a thousand deaths as well as bankruptcies of airlines and related businesses. In this article, we examine the efficacy of control strategies on the propagation of infectious diseases based on removing connections within real world airline network with the associated economic and social costs taken into account through defining appropriate quantitative measures. We uncover the surprising results that removing less busy connections can be far more effective in hindering the spread of the disease than removing the more popular connections. Since disconnecting the less popular routes tend to incur less socio-economic cost, our finding suggests the possibility of trading minimal reduction in connectivity of an important hub with efficiencies in epidemic control. In particular, we demonstrate the performance of various local epidemic control strategies, and show how our approach can predict their cost effectiveness through the spreading control characteristics., Comment: 11 pages, 4 figures

Results on beam tests of 3D silicon pixel sensors aimed at the ATLAS Insertable-B-Layer and High Luminosity LHC (HL-LHC)) upgrades are presented. Measurements include charge collection, tracking efficiency and charge sharing between pixel cells, as a function of track incident angle, and were performed with and without a 1.6 T magnetic field oriented as the ATLAS Inner Detector solenoid field. Sensors were bump bonded to the front-end chip currently used in the ATLAS pixel detector. Full 3D sensors, with electrodes penetrating through the entire wafer thickness and active edge, and double-sided 3D sensors with partially overlapping bias and read-out electrodes were tested and showed comparable performance.

In this work, we investigate a model of an adaptive networked dynamical system, where the coupling strengths among phase oscillators coevolve with the phase states. It is shown that in this model the oscillators can spontaneously differentiate into two dynamical groups after a long time evolution. Within each group, the oscillators have similar phases, while oscillators in different groups have approximately opposite phases. The network gradually converts from the initial random structure with a uniform distribution of connection strengths into a modular structure which is characterized by strong intra connections and weak inter connections. Furthermore, the connection strengths follow a power law distribution, which is a natural consequence of the coevolution of the network and the dynamics. Interestingly, it is found that if the inter connections are weaker than a certain threshold, the two dynamical groups will almost decouple and evolve independently. These results are helpful in further understanding the empirical observations in many social and biological networks., Comment: 14 page, 5 figures

We report two analytical bounds for quantum error-correcting codes that do not have preexisting classical counterparts. Firstly the quantum Hamming and Singleton bounds are combined into a single tighter bound, and then the combined bound is further strengthened via the well-known Lloyd's theorem in classical coding theory, which claims that perfect codes, codes attaining the Hamming bound, do not exist if the Lloyd's polynomial has some non-integer zeros. Our bound characterizes quantitatively the improvement over the Hamming bound via the non-integerness of the zeros of the Lloyd's polynomial. In the case of 1-error correcting codes our bound holds true for impure codes as well, which we conjecture to be always true, and for stabilizer codes there is a 1-logical-qudit improvement for an infinite family of lengths., Comment: 5 pages

Stable chaos refers to the long irregular transients, with a negative largest Lyapunov exponent, which is usually observed in certain high-dimensional dynamical systems. The mechanism underlying this phenomenon has not been well studied so far. In this paper, we investigate the dynamical formation of stable irregular transients in coupled discontinuous map systems. Interestingly, it is found that the transient dynamics has a hidden pattern in the phase space: it repeatedly approaches a basin boundary and then jumps from the bundary to a remote region in the phase space. This pattern can be clearly visualized by measuring the distance sequences between the trajectory and the basin boundary. The dynamical formation of stable chaos originates from the intersection points of the discontinuous boundaries and their images. We carry out numerical experiments to verify this mechanism., Comment: 5 pages, 5 figures

The topological information of a network can be retrieved equivalently from its complement consisting of the same nodes but complementary edges. Hence the partition of a network into certain substructures based on given criteria should be the same as that of its complement based on the equivalent criteria if the topological information is considered exclusively. This symmetry of partitioning between a network and its complement is due to the equivalence of their topological information and hence should be respected regardless of the detailed characteristics of the substructures considered. In this work we suggest this symmetry consideration as a general guideline and propose a symmetric community detection scheme to show its implications. Our method has no resolution limit and can be used to detect hierarchical community structures at different levels. Our study also suggests that the community structure is unlikely a result of random fluctuations in large networks., Comment: 5 pages, 5 figures, submitted for journal publication on 8, June, 2009

We propose a method to investigate modular structure in networks based on fitted probabilistic model, where the connection probability between nodes is related to a set of introduced local attributes. The attributes, as parameters of the empirical model, can be estimated by maximizing the likelihood function of the observed network. We demonstrate that the distribution of attributes provides an informative visulization of modular networks on low-dimensional space, and suggest the attribute space can be served as a better platform for further network analysis.

We propose a multi-phase approach to explore network structures. In this method, structure analysis is not carried out on the observed network directly. Instead, certain similarity measures of the nodes are derived from the network firstly, which are then projected onto an appropriate lower-dimensional feature space. The clustering structure can be defined in the feature space, and analyzed by conventional clustering algorithms. The classified data are finally mapped back to the original network space if necessary to complete the analysis of network structures. By mapping onto the feature space, some difficulties due to the diversity of micro-structures and scale of the network can be circumvented. This makes it possible for the proposed method to deal with more general structures such as detecting groups in a random background, as well as identifying usual community structures in networks.

We demonstrate the possibility to build a thermoelectric engine using a one dimensional gas of molecules with unequal masses and hard-point interaction. Most importantly, we show that the efficiency of this engine is determined by a new parameter YT which is different from the well known figure of merit ZT. Even though the efficiency of this particular model is low, our results shed new light on the problem and open the possibility to build efficient thermoelectric engines., Comment: 4 pages, 4 eps figures

We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (Newman and Leicht 2007 {\it Proc. Natl. Acad. Sci. USA} {\bf 104} 9564), we develop an algorithm that is applicable to a network with any degree distribution. The partition of a network suggested by this algorithm also applies to its complementary network. In general, groups of similar components are not necessarily identical with the communities in a community network; thus partitioning a network into groups of similar components provides additional information of the network structure. The proposed algorithm can also be used for community detection when the groups and the communities overlap. By introducing a tunable parameter that controls the involved effects of the heterogeneity, we can also investigate conveniently how the group structure can be coupled with the heterogeneity characteristics. In particular, an interesting example shows a group partition can evolve into a community partition in some situations when the involved heterogeneity effects are tuned. The extension of this algorithm to weighted networks is discussed as well., Comment: 14 pages, 10 figures, latex, more discussions added, typos cleared

In this paper, we investigate the development of generalized synchronization (GS) on typical complex networks, such as scale-free networks, small-world networks, random networks and modular networks. By adopting the auxiliary-system approach to networks, we show that GS can take place in oscillator networks with both heterogeneous and homogeneous degree distribution, regardless of whether the coupled chaotic oscillators are identical or nonidentical. For coupled identical oscillators on networks, we find that there exists a general bifurcation path from initial non-synchronization to final global complete synchronization (CS) via GS as the coupling strength is increased. For coupled nonidentical oscillators on networks, we further reveal how network topology competes with the local dynamics to dominate the development of GS on networks. Especially, we analyze how different coupling strategies affect the development of GS on complex networks. Our findings provide a further understanding for the occurrence and development of collective behavior in complex networks., Comment: 10 pages, 13 figures

We report the first nonadditive quantum error-correcting code, namely, a $((9,12,3))$ code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more levels while correcting arbitrary single-qubit errors., Comment: 1 eps figure

All quantum information processes inevitably requires the explicit state preparation of an entangled state. Here we present the construction of a quantum switchboard which can act both as an optimal quantum cloning machine and a quantum demultiplexer based on the preparation of a four-qubit state., Comment: 3 pages, 1 figure

We show the quantum state transfer technique in two-color photoassociation (PA) of a Bose-Einstein condensate, where a quantized field is used to couple the free-bound transition from atom state to excited molecular state. Under the weak excitation condition, we find that quantum states of the quantized field can be transferred to the created molecular condensate. The feasibility of this technique is confirmed by considering the atomic and molecular decays discovered in the current PA experiments. The present results allow us to manipulate quantum states of molecules in the photoassociation of a Bose-Einstein condensate., Comment: 4 Pages, 1 figure

We investigated spin dependent transport through Fe/GaAs/Fe tunnel junctions. The tunneling magnetoresistance effect (TMR) was probed for different types of Fe/GaAs interfaces. For interfaces cleaned by hydrogen plasma the TMR effect is increased and observable at room temperature. If an epitaxial Fe/GaAs(001) interface is involved, the tunnel junction exhibits a bias dependent inversion of the TMR effect. This is a first experimental signature for band structure effects at a Fe/GaAs interface and relevant for spin injection experiments., Comment: 11 pages, 3 figures, submitted to Appl. Phys. Lett

We investigate the inverse problem concerning the evolution of a qubit system, specifically we consider how one can establish the Hamiltonians that account for the evolution of a qubit along a prescribed path in the projected Hilbert space. For a given path, there are infinite Hamiltonians which can realize the same evolution. A general form of the Hamiltonians is constructed in which one may select the desired one for implementing a prescribed evolution. This scheme can be generalized to higher dimensional systems., Comment: 6 pages

When prior partial information about a state to be cloned is available, it can be cloned with a fidelity higher than that of universal quantum cloning. We experimentally verify this intriguing relationship between the cloning fidelity and the prior information by reporting the first experimental optimal quantum state-dependent cloning, using nuclear magnetic resonance techniques. Our experiments may further have important implications into many quantum information processing protocols., Comment: 4 pages, 2 figures

We describe a nuclear magnetic resonance (NMR) experiment which implements an efficient one-to-two qubit phase-covariant cloning machine(QPCCM). In the experiment we have achieved remarkably high fidelities of cloning, 0.848 and 0.844 respectively for the original and the blank qubit. This experimental value is close to the optimal theoretical value of 0.854. We have also demonstrated how to use our phase-covariant cloning machine for quantum simulations of bit by bit eavesdropping in the four-state quantum key distribution protocol., Comment: 4 pages, 5 figures

Strange nonchaotic attractors (SNAs) in noise driven systems are investigated. Before the transition to chaos, due to the effect of noise, a typical trajectory will wander between the periodic attractor and its nearby chaotic saddle in an intermittent way, forms a strange attractor gradually. The existence of SNAs is confirmed by simulation results of various critera both in map and continuous systems. Dimension transition is found and intermittent behavior is studied by peoperties of local Lyapunov exponent. The universality and generalization of this kind of SNAs are discussed and common features are concluded.

Different chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the Error Function Attack is presented systematically and used to evaluate system security. We define a quantitative measure (Quality Factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from Quality Factor.

It has been proposed to realize secure communication using chaotic synchronization via transmission of binary message encoded by parameter modulation in the chaotic system. This paper considers the use of parameter adaptive control techniques to extract the message, based on the assumptions that we know the equation form of the chaotic system in the transmitter but do not have access to the precise values of the parameters which are kept secret as a secure set. In the case that a synchronizing system can be constructed using parameter adaptive control by the transmitted signal and the synchronization is robust to parameter mismatches, the parameter modulation can be revealed and the message decoded without resorting to exact parameter values in the secure set. A practical local Lyapunov function method for designing parameter adaptive control rules based on originally synchronized systems is presented., Comment: 13 pages, 13 figures

We show how to extract messages masked by a chaotic signal of a time-delay system with very high dimension and many positive Lyapunov exponents. Using a special embedding coordinate, the infinite dimensional phase space of the time-delay system is projected to a special three-dimensional space, which enables us to identify the time-delay of the system from the transmitted signal, and reconstruct the chaotic dynamics to unmask the hidden message successfully. The message extraction procedure is illustrated by simulations with Mackey-Glass time-delay system for two type of masking schemes and different kinds of messages., Comment: 6 pages, 5 figures

Nonlinear dynamical systems possessing an invariant subspace can display interesting dynamical behavior, such as on-off intermittency and bubbling. This letter shows that a class of such systems have amazing features of (1) supersensitivity to small input signals and (2) robustness of the supersensitivity in the presence of noise. These features make the systems very promising as small signal detectors., Comment: 8 pages, 3 figures

Nonlinear dynamical systems possessing reflection symmetry have an invariant subspace in the phase space. The dynamics within the invariant subspace can be random or chaotic. As a system parameter changes, the motion transverse to the invariant subspace can lose stability, leading to on-off intermittency. Under certain conditions, the bursting behavior is symmetry-breaking. We demonstrate the possibility of observing multiplicative noise(chaos)-induced amplification of weak signal and stochastic resonance via on-off intermittency with symmetry breaking in a general class of symmetrical systems. Differences of this mechanism of stochastic resonance to that in noisy bistable or threshold systems are discussed, Comment: 6 pages, 11 figures

Sensitive dependence of nonlinear systems on initial conditions or parameters can be useful in applications. We propose in this paper that bubbling behavior in simple driven symmetrical maps may be used as a working principle of sensitive devices. The system is stable when there is no input and displays bursting behavior when there is small input. The symmetrical property of the bursting pattern is very sensitive to the bias of the noisy inputs, which makes the system promising for detecting weak signals among noisy environment., Comment: 10 pages, 9 figures

Synchronization of identical chaotic systems subjected to common noise has been the subject of recent research. Studies on several chaotic systems have shown that, the synchronization is actually induced by the non-zero mean of the noise, and symmetric noise with zero-mean cannot lead to synchronization. Here it is presented that synchronization can be achieved by {\sl zero-mean} noise in some chaotic maps with large convergence regions., Comment: 5 pages, 4 figures

Synchronization of chaotic system may occur only when the largest conditional Lyapunov exponent of the driven system is negative. The synchronization with positive conditional Lyapunov reported in a recent paper (Phys. Rev. E, {\bf 56}, 2272 (1997)) is a combined result of the contracting region of the system and the finite precision in computer simulations., Comment: 6 pages, 7 figures

We examine the application of $c=1$ conformal field theory to the description of the fractional quantum Hall effect (FQHE). It is found that the Gaussian model together with an appropriate boundary condition for the order parameter furnishes an effective theory for the Laughlin type FQHE. The plateau formation condition corresponds to taking the {\em chiral} portion of the theory., Comment: (10 pages)

The path integral approach to representing braid group is generalized for particles with spin. Introducing the notion of {\em charged} winding number in the super-plane, we represent the braid group generators as homotopically constrained Feynman kernels. In this framework, super Knizhnik-Zamolodchikov operators appear naturally in the Hamiltonian, suggesting the possibility of {\em spinning nonabelian} anyons. We then apply our formulation to the study of fractional quantum Hall effect (FQHE). A systematic discussion of the ground states and their quasi-hole excitations is given. We obtain Laughlin, Halperin and Moore-Read states as {\em exact} ground state solutions to the respective Hamiltonians associated to the braid group representations. The energy gap of the quasi-excitation is also obtainable from this approach., Comment: (36 pages) e-mail scip1005@nusvm.bitnet