986 research outputs found

    Large deviations for two scale chemical kinetic processes

    Full text link
    We formulate the large deviations for a class of two scale chemical kinetic processes motivated from biological applications. The result is successfully applied to treat a genetic switching model with positive feedbacks. The corresponding Hamiltonian is convex with respect to the momentum variable as a by-product of the large deviation theory. This property ensures its superiority in the rare event simulations compared with the result obtained by formal WKB asymptotics. The result is of general interest to understand the large deviations for multiscale problems

    Two-scale large deviations for chemical reaction kinetics through second quantization path integral

    Full text link
    Motivated by the study of rare events for a typical genetic switching model in systems biology, in this paper we aim to establish the general two-scale large deviations for chemical reaction systems. We build a formal approach to explicitly obtain the large deviation rate functionals for the considered two-scale processes based upon the second-quantization path integral technique. We get three important types of large deviation results when the underlying two times scales are in three different regimes. This is realized by singular perturbation analysis to the rate functionals obtained by path integral. We find that the three regimes possess the same deterministic mean-field limit but completely different chemical Langevin approximations. The obtained results are natural extensions of the classical large volume limit for chemical reactions. We also discuss its implication on the single-molecule Michaelis-Menten kinetics. Our framework and results can be applied to understand general multi-scale systems including diffusion processes

    Finding Transition Pathways on Manifolds

    Full text link
    We consider noise-induced transition paths in randomly perturbed dynami- cal systems on a smooth manifold. The classical Freidlin-Wentzell large devia- tion theory in Euclidean spaces is generalized and new forms of action functionals are derived in the spaces of functions and the space of curves to accommodate the intrinsic constraints associated with the manifold. Numerical meth- ods are proposed to compute the minimum action paths for the systems with constraints. The examples of conformational transition paths for a single and double rod molecules arising in polymer science are numerically investigated

    Multi-scale 3D Convolution Network for Video Based Person Re-Identification

    Full text link
    This paper proposes a two-stream convolution network to extract spatial and temporal cues for video based person Re-Identification (ReID). A temporal stream in this network is constructed by inserting several Multi-scale 3D (M3D) convolution layers into a 2D CNN network. The resulting M3D convolution network introduces a fraction of parameters into the 2D CNN, but gains the ability of multi-scale temporal feature learning. With this compact architecture, M3D convolution network is also more efficient and easier to optimize than existing 3D convolution networks. The temporal stream further involves Residual Attention Layers (RAL) to refine the temporal features. By jointly learning spatial-temporal attention masks in a residual manner, RAL identifies the discriminative spatial regions and temporal cues. The other stream in our network is implemented with a 2D CNN for spatial feature extraction. The spatial and temporal features from two streams are finally fused for the video based person ReID. Evaluations on three widely used benchmarks datasets, i.e., MARS, PRID2011, and iLIDS-VID demonstrate the substantial advantages of our method over existing 3D convolution networks and state-of-art methods.Comment: AAAI, 201

    Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks

    Full text link
    It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventional methods, agent nodes are divided into different layers with the aid of the space-time hierarchical-model and their positions are estimated gradually. In particular, an information propagation rule is conceived upon considering the quality of positional information. According to the rule, the information always propagates from the upper layers to a certain lower layer and the message passing process is further optimized at each layer. Hence, the potential error propagation can be mitigated. Additionally, both position estimation and position broadcasting are carried out by the sensor nodes. Furthermore, a sensor activation mechanism is conceived, which is capable of significantly reducing both the energy consumption and the network traffic overhead incurred by the localization process. The analytical and numerical results provided demonstrate the superiority of our space-time hierarchical-graph based cooperative localization scheme over the benchmarking schemes considered.Comment: 14 pages, 15 figures, 4 tables, accepted to appear on IEEE Transactions on Signal Processing, Sept. 201

    Utility greedy discrete bit loading for interference limited multi-cell OFDM system

    No full text
    In this contribution we present the solution of the utility greedy discrete bit loading for interference limited multicell OFDM networks. Setting the utility as the sum of consumed power proportions, the algorithm follows greedy way to achieve the maximum throughput of the system. Simulation has shown that the proposed algorithm has better performance and lower complexity than the traditional optimal algorithm. The discussion of the results is provided

    Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components

    Get PDF
    This paper is concerned with delay-dependent stability for continuous systems with two additive time-varying delay components. By constructing a new class of Lyapunov functional and using a new convex polyhedron method, a new delay-dependent stability criterion is derived in terms of linear matrix inequalities. The obtained stability criterion is less conservative than some existing ones. Finally, numerical examples are given to illustrate the effectiveness of the proposed method
    corecore