WorldWideScience

Sample records for networks exact reduction

  1. Finding optimal exact reducts

    KAUST Repository

    AbouEisha, Hassan M.

    2014-01-01

    The problem of attribute reduction is an important problem related to feature selection and knowledge discovery. The problem of finding reducts with minimum cardinality is NP-hard. This paper suggests a new algorithm for finding exact reducts with minimum cardinality. This algorithm transforms the initial table to a decision table of a special kind, apply a set of simplification steps to this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. I present results of computer experiments for a collection of decision tables from UCIML Repository. For many of the experimented tables, the simplification steps solved the problem.

  2. Compiling Relational Bayesian Networks for Exact Inference

    DEFF Research Database (Denmark)

    Jaeger, Manfred; Chavira, Mark; Darwiche, Adnan

    2004-01-01

    We describe a system for exact inference with relational Bayesian networks as defined in the publicly available \\primula\\ tool. The system is based on compiling propositional instances of relational Bayesian networks into arithmetic circuits and then performing online inference by evaluating...... and differentiating these circuits in time linear in their size. We report on experimental results showing the successful compilation, and efficient inference, on relational Bayesian networks whose {\\primula}--generated propositional instances have thousands of variables, and whose jointrees have clusters...

  3. Upper bounds on minimum cardinality of exact and approximate reducts

    KAUST Repository

    Chikalov, Igor

    2010-01-01

    In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.

  4. Compiling Relational Bayesian Networks for Exact Inference

    DEFF Research Database (Denmark)

    Jaeger, Manfred; Darwiche, Adnan; Chavira, Mark

    2006-01-01

    We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available PRIMULA tool. The system is based on compiling propositional instances of relational Bayesian networks into arithmetic circuits and then performing online inference...... by evaluating and differentiating these circuits in time linear in their size. We report on experimental results showing successful compilation and efficient inference on relational Bayesian networks, whose PRIMULA--generated propositional instances have thousands of variables, and whose jointrees have clusters...

  5. Exactly Embedded Wavefunction Methods for Characterizing Nitrogen Reduction Catalysis

    Science.gov (United States)

    2015-01-15

    AFRL-OSR-VA-TR-2015-0038 Exactly Embedded Wavefunction Methods for Characterizing Nitrogen THOMAS MILLER CALIFORNIA INSTITUTE OF TECHNOLOGY Final...SUBTITLE Exactly Embedded Wavefunction Methods for Characterizing Nitrogen Reduction Catalysis 5a. CONTRACT NUMBER N/A 5b. GRANT NUMBER FA9550...of developing and applying exactly embedded density functional and wavefunction theory methods for the investigation of small-molecular activation

  6. Dynamical Response of Networks Under External Perturbations: Exact Results

    Science.gov (United States)

    Chinellato, David D.; Epstein, Irving R.; Braha, Dan; Bar-Yam, Yaneer; de Aguiar, Marcus A. M.

    2015-04-01

    We give exact statistical distributions for the dynamic response of influence networks subjected to external perturbations. We consider networks whose nodes have two internal states labeled 0 and 1. We let nodes be frozen in state 0, in state 1, and the remaining nodes change by adopting the state of a connected node with a fixed probability per time step. The frozen nodes can be interpreted as external perturbations to the subnetwork of free nodes. Analytically extending and to be smaller than 1 enables modeling the case of weak coupling. We solve the dynamical equations exactly for fully connected networks, obtaining the equilibrium distribution, transition probabilities between any two states and the characteristic time to equilibration. Our exact results are excellent approximations for other topologies, including random, regular lattice, scale-free and small world networks, when the numbers of fixed nodes are adjusted to take account of the effect of topology on coupling to the environment. This model can describe a variety of complex systems, from magnetic spins to social networks to population genetics, and was recently applied as a framework for early warning signals for real-world self-organized economic market crises.

  7. Exactness

    Institute of Scientific and Technical Information of China (English)

    许涛

    2004-01-01

    M r.Sm ith liked to be exact. O ne day when he was w alking in thestreet a m an cam e over and asked him E xcuse m e but w here's the , : “ ,nearest bookshop ?” The nearest bookshop Y ou have to cross a bridge and then turn “ ?to the right. ” A nd is the bridge long “ ?” Thirty m eters. “ ” The m an thanked him and went towards the bridge. Suddenly heheard som eone running after him . Stop M r.Sm ith w as shouting. I'm sorry. I just rem em bered ...

  8. Exact two-terminal reliability of some directed networks

    CERN Document Server

    Tanguy, Christian

    2008-01-01

    The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of bounds, sums of disjoint products algorithms, Monte Carlo evaluations, studies of the reliability polynomials, etc.) only provide approximations when the network's size increases, even when nodes do not fail and all edges have the same reliability p. We consider here a directed, generic graph of arbitrary size mimicking real-life long-haul communication networks, and give the exact, analytical solution for the two-terminal reliability. This solution involves a product of transfer matrices, in which individual reliabilities of edges and nodes are taken into account. The special case of identical edge and node reliabilities (p and rho, respectively) is addressed. We consider a case study based on a commonly-used configuration, and assess the influence of the edges being directed (or not) on various measures of network performance. While the two-...

  9. Size reduction of complex networks preserving modularity

    Energy Technology Data Exchange (ETDEWEB)

    Arenas, A.; Duch, J.; Fernandez, A.; Gomez, S.

    2008-12-24

    The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular structure are based on the optimization of a quality function known as modularity. However this optimization is a hard task provided that the computational complexity of the problem is in the NP-hard class. Here we propose an exact method for reducing the size of weighted (directed and undirected) complex networks while maintaining invariant its modularity. This size reduction allows the heuristic algorithms that optimize modularity for a better exploration of the modularity landscape. We compare the modularity obtained in several real complex-networks by using the Extremal Optimization algorithm, before and after the size reduction, showing the improvement obtained. We speculate that the proposed analytical size reduction could be extended to an exact coarse graining of the network in the scope of real-space renormalization.

  10. REDUCTION OF NONLINEAR PARTIAL DIFFERENTIAL EQUATION AND EXACT SOLUTIONS

    Institute of Scientific and Technical Information of China (English)

    YeCaier; PanZuliang

    2003-01-01

    Nonlinear partial differetial equation(NLPDE)is converted into ordinary differential equation(ODE)via a new ansatz.Using undetermined function method,the ODE obtained above is replaced by a set of algebraic equations which are solved out with the aid of Mathematica.The exact solutions and solitary solutions of NLPDE are obtained.

  11. Mathematics of epidemics on networks from exact to approximate models

    CERN Document Server

    Kiss, István Z; Simon, Péter L

    2017-01-01

    This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to each other with special focus on epidemic spread on networks. The content of the book is at the interface of graph theory, stochastic processes and dynamical systems. The authors set out to make a significant contribution to closing the gap between model development and the supporting mathematics. This is done by: Summarising and presenting the state-of-the-art in modeling epidemics on networks with results and readily usable models signposted throughout the book; Presenting different mathematical approaches to formulate exact and solvable models; Identifying the concrete links between approximate models and their rigorous mathematical representation; Presenting a model hierarchy and clearly highlighting the links between model assumptions and model complexity; Providing a reference source for advanced undergraduate...

  12. Exact Solutions for Models of Cultural Transmission and Network Rewiring

    CERN Document Server

    Evans, T S

    2006-01-01

    We look at the evolution through rewiring of the degree distribution of a network so the number edges is constant. This is exactly equivalent to the evolution of probability distributions in models of cultural transmission with drift and innovation, or models of homogeneity in genes in the presence of mutation. We show that the mean field equations in the literature are incomplete and provide the full equations. We then give an exact solution for both their long time solution and for their approach to equilibrium. Numerical results show these are excellent approximations and confirm the characteristic simple inverse power law distributions with a large scale cutoff under certain conditions. The alternative is that we reach a completely homogeneous solution. We consider how such processes may arise in practice, using a recent Minority Game study as an example.

  13. Rapid Exact Signal Scanning With Deep Convolutional Neural Networks

    Science.gov (United States)

    Thom, Markus; Gritschneder, Franz

    2017-03-01

    A rigorous formulation of the dynamics of a signal processing scheme aimed at dense signal scanning without any loss in accuracy is introduced and analyzed. Related methods proposed in the recent past lack a satisfactory analysis of whether they actually fulfill any exactness constraints. This is improved through an exact characterization of the requirements for a sound sliding window approach. The tools developed in this paper are especially beneficial if Convolutional Neural Networks are employed, but can also be used as a more general framework to validate related approaches to signal scanning. The proposed theory helps to eliminate redundant computations and renders special case treatment unnecessary, resulting in a dramatic boost in efficiency particularly on massively parallel processors. This is demonstrated both theoretically in a computational complexity analysis and empirically on modern parallel processors.

  14. Transitive Reduction of Citation Networks

    CERN Document Server

    Clough, James R; Loach, Tamar V; Evans, Tim S

    2013-01-01

    Citation networks form directed acyclic graphs. The transitive reduction of such a DAG removes all edges in the graph that are implied by transitivity, but retains the causal structure of the original network. We investigate how the degree distribution, clustering coefficients and relationship between time of publication and degree (representing citation count) are changed under transitive reduction. We show that models which accurately reproduce the degree distribution of a citation network before transitive reduction may not do so afterwards and hence suggest that these models fail to accurately capture the causal structure of the network. We also investigate how the citation count of individual papers is changed and suggest that information about the types of citations a paper receives can be inferred from the number of citations which are retained after transitive reduction. These methods are tested on citation networks from the hep-th and hep-ph sections of the arXiv repository, and all data has been mad...

  15. Unitary Networks from the Exact Renormalization of Wave Functionals

    CERN Document Server

    Fliss, Jackson R; Parrikar, Onkar

    2016-01-01

    The exact renormalization group (ERG) for $O(N)$ vector models (at large $N$) on flat Euclidean space can be interpreted as the bulk dynamics corresponding to a holographically dual higher spin gauge theory on $AdS_{d+1}$. This was established in the sense that at large $N$ the generating functional of correlation functions of single trace operators is reproduced by the on-shell action of the bulk higher spin theory, which is most simply presented in a first-order (phase space) formalism. In this paper, we extend the ERG formalism to the wave functionals of arbitrary states of the $O(N)$ vector model at the free fixed point. We find that the ERG flow of the ground state and a specific class of excited states is implemented by the action of unitary operators which can be chosen to be local. Consequently, the ERG equations provide a continuum notion of a tensor network. We compare this tensor network with the entanglement renormalization networks, MERA, and its continuum version, cMERA, which have appeared rece...

  16. Exact Structure Discovery in Bayesian Networks with Less Space

    CERN Document Server

    Parviainen, Pekka

    2012-01-01

    The fastest known exact algorithms for scorebased structure discovery in Bayesian networks on n nodes run in time and space 2nnO(1). The usage of these algorithms is limited to networks on at most around 25 nodes mainly due to the space requirement. Here, we study space-time tradeoffs for finding an optimal network structure. When little space is available, we apply the Gurevich-Shelah recurrence-originally proposed for the Hamiltonian path problem-and obtain time 22n-snO(1) in space 2snO(1) for any s = n/2, n/4, n/8, . . .; we assume the indegree of each node is bounded by a constant. For the more practical setting with moderate amounts of space, we present a novel scheme. It yields running time 2n(3/2)pnO(1) in space 2n(3/4)pnO(1) for any p = 0, 1, . . ., n/2; these bounds hold as long as the indegrees are at most 0.238n. Furthermore, the latter scheme allows easy and efficient parallelization beyond previous algorithms. We also explore empirically the potential of the presented techniques.

  17. Kitaev honeycomb tensor networks: exact unitary circuits and applications

    CERN Document Server

    Schmoll, Philipp

    2016-01-01

    The Kitaev honeycomb model is a paradigm of exactly-solvable models, showing non-trivial physical properties such as topological quantum order, abelian and non-abelian anyons, and chirality. Its solution is one of the most beautiful examples of the interplay of different mathematical techniques in condensed matter physics. In this paper, we show how to derive a tensor network (TN) description of the eigenstates of this spin-1/2 model in the thermodynamic limit, and in particular for its ground state. In our setting, eigenstates are naturally encoded by an exact 3d TN structure made of fermionic unitary operators, corresponding to the unitary quantum circuit building up the many-body quantum state. In our derivation we review how the different "solution ingredients" of the Kitaev honeycomb model can be accounted for in the TN language, namely: Jordan-Wigner transformation, braidings of Majorana modes, fermionic Fourier transformation, and Bogoliubov transformation. The TN built in this way allows for a clear u...

  18. Complexity reduction of astrochemical networks

    CERN Document Server

    Grassi, T; Gianturco, F A; Baiocchi, P; Merlin, E

    2012-01-01

    We present a new computational scheme aimed at reducing the complexity of the chemical networks in astrophysical models, one which is shown to markedly improve their computational efficiency. It contains a flux-reduction scheme that permits to deal with both large and small systems. This procedure is shown to yield a large speed-up of the corresponding numerical codes and provides good accord with the full network results. We analyse and discuss two examples involving chemistry networks of the interstellar medium and show that the results from the present reduction technique reproduce very well the results from fuller calculations.

  19. Kitaev honeycomb tensor networks: Exact unitary circuits and applications

    Science.gov (United States)

    Schmoll, Philipp; Orús, Román

    2017-01-01

    The Kitaev honeycomb model is a paradigm of exactly solvable models, showing nontrivial physical properties such as topological quantum order, Abelian and non-Abelian anyons, and chirality. Its solution is one of the most beautiful examples of the interplay of different mathematical techniques in condensed matter physics. In this paper, we show how to derive a tensor network (TN) description of the eigenstates of this spin-1/2 model in the thermodynamic limit, and in particular for its ground state. In our setting, eigenstates are naturally encoded by an exact 3d TN structure made of fermionic unitary operators, corresponding to the unitary quantum circuit building up the many-body quantum state. In our derivation we review how the different "solution ingredients" of the Kitaev honeycomb model can be accounted for in the TN language, namely, Jordan-Wigner transformation, braidings of Majorana modes, fermionic Fourier transformation, and Bogoliubov transformation. The TN built in this way allows for a clear understanding of several properties of the model. In particular, we show how the fidelity diagram is straightforward both at zero temperature and at finite temperature in the vortex-free sector. We also show how the properties of two-point correlation functions follow easily. Finally, we also discuss the pros and cons of contracting of our 3d TN down to a 2d projected entangled pair state (PEPS) with finite bond dimension. The results in this paper can be extended to generalizations of the Kitaev model, e.g., to other lattices, spins, and dimensions.

  20. Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks

    CERN Document Server

    Torabkhani, Nima; Beirami, Ahmad; Fekri, Faramarz

    2011-01-01

    In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or blocking by full buffers. We assert that because of RLNC, the content of buffers have dependencies which cannot be captured directly using the classical queueing theoretical models. We model the performance of the network using Markov chains by a careful derivation of the buffer occupancy states and their transition rules. We verify by simulations that the proposed framework results in an accurate measure of the network throughput offered by RLNC. Further, we introduce a class of acyclic networks for which the number of state variables is significantly reduced.

  1. Exact Convex Relaxation of Optimal Power Flow in Radial Networks

    Energy Technology Data Exchange (ETDEWEB)

    Gan, LW; Li, N; Topcu, U; Low, SH

    2015-01-01

    The optimal power flow (OPF) problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. It is nonconvex. We prove that a global optimum of OPF can be obtained by solving a second-order cone program, under a mild condition after shrinking the OPF feasible set slightly, for radial power networks. The condition can be checked a priori, and holds for the IEEE 13, 34, 37, 123-bus networks and two real-world networks.

  2. Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries

    DEFF Research Database (Denmark)

    Brodal, Gert Stølting; Jacob, Rico

    2003-01-01

    We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models.......We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models....

  3. Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Jacob, Rico

    2001-01-01

    We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models.......We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models....

  4. Exact Solutions of a Generalized Weighted Scale Free Network

    Directory of Open Access Journals (Sweden)

    Li Tan

    2013-01-01

    Full Text Available We investigate a class of generalized weighted scale-free networks, where the new vertex connects to m pairs of vertices selected preferentially. The key contribution of this paper is that, from the standpoint of random processes, we provide rigorous analytic solutions for the steady state distributions, including the vertex degree distribution, the vertex strength distribution and the edge weight distribution. Numerical simulations indicate that this network model yields three power law distributions for the vertex degrees, vertex strengths and edge weights, respectively.

  5. Nonequivalent Similarity Reductions and Exact Solutions for Coupled Burgers-Type Equations

    Science.gov (United States)

    M. H. M., Moussa; R. A. K., Omar; Rehab, M. El-Shiekh; H. R., El-Melegy

    2012-01-01

    Using the machinery of Lie group analysis, the nonlinear system of coupled Burgers-type equations is studied. Using the infinitesimal generators in the optimal system of subalgebra of the said Lie algebras, it leads to two nonequivalent similarity transformations by using it we obtain two reductions in the form of system of nonlinear ordinary differential equations. The search for solutions of these systems by using the G'/G-method has yielded certain exact solutions expressed by rational functions, hyperbolic functions, and trigonometric functions. Some figures are given to show the properties of the solutions.

  6. Nonequivalent Similarity Reductions and Exact Solutions for Coupled Burgers-Type Equations

    Institute of Scientific and Technical Information of China (English)

    M.H.M. Moussa; R.A.K. Omar; Rehab M. El-Shiekh; H.R. El-Melegy

    2012-01-01

    Using the machinery of Lie group analysis, the nonlinear system of coupled Burgers-type equations is studied. Using the infinitesimal generators in the optimal system of subalgebra of the said Lie algebras, it leads to two nonequivalent similarity transformations by using it we obtain two reductions in the form of system of nonlinear ordinary differential equations. The search for solutions of these systems by using the G/G-method has yielded certain exact solutions expressed by rational functions, hyperbolic functions, and trigonometric functions. Some figures are given to show the properties of the solutions.

  7. Exact mean field dynamics for epidemic-like processes on heterogeneous networks

    CERN Document Server

    Lucas, Andrew

    2012-01-01

    We show that the mean field equations for the SIR epidemic can be exactly solved for a network with arbitrary degree distribution. Our exact solution consists of reducing the dynamics to a lone first order differential equation, which has a solution in terms of an integral over functions dependent on the degree distribution of the network, and reconstructing all mean field functions of interest from this integral. Irreversibility of the SIR epidemic is crucial for the solution. We also find exact solutions to the sexually transmitted disease SI epidemic on bipartite graphs, to a simplified rumor spreading model, and to a new model for recommendation spreading, via similar techniques. Numerical simulations of these processes on scale free networks demonstrate the qualitative validity of mean field theory in most regimes.

  8. Exact Solutions of Degree Distributions for Random Birth-and-Death Networks

    CERN Document Server

    Zhang, Xiaojun; Rayman-Bacchus, Lez

    2015-01-01

    In this paper, a general random birth-and-death network model (RBDN) is considered, in which at each time step, a new node is added into the network with probability p or an existing node is deleted from the network with probability q=1-p. For different p (1>p>1/2, 0exact solutions. First, a homogeneous Markov chain with two variables based on stochastic process rules (SPR) is employed and its state transformation equations are provided for solving the degree distributions of RBDN. Then for different p, the different degree distribution equations are determined, and the exact solutions of the degree distributions are obtained by the probability generating function approach. Computation simulations are used to verify these exact solutions.

  9. Methods for communication-network reliability analysis - Probabilistic graph reduction

    Science.gov (United States)

    Shooman, Andrew M.; Kershenbaum, Aaron

    The authors have designed and implemented a graph-reduction algorithm for computing the k-terminal reliability of an arbitrary network with possibly unreliable nodes. The two contributions of the present work are a version of the delta-y transformation for k-terminal reliability and an extension of Satyanarayana and Wood's polygon to chain transformations to handle graphs with imperfect vertices. The exact algorithm is faster than or equal to that of Satyanarayana and Wood and the simple algorithm without delta-y and polygon to chain transformations for every problem considered. The exact algorithm runs in linear time on series-parallel graphs and is faster than the above-stated algorithms for huge problems which run in exponential time. The approximate algorithms reduce the computation time for the network reliability problem by two to three orders of magnitude for large problems, while providing reasonably accurate answers in most cases.

  10. Model Reduction for Complex Hyperbolic Networks

    OpenAIRE

    Himpe, Christian; Ohlberger, Mario

    2013-01-01

    We recently introduced the joint gramian for combined state and parameter reduction [C. Himpe and M. Ohlberger. Cross-Gramian Based Combined State and Parameter Reduction for Large-Scale Control Systems. arXiv:1302.0634, 2013], which is applied in this work to reduce a parametrized linear time-varying control system modeling a hyperbolic network. The reduction encompasses the dimension of nodes and parameters of the underlying control system. Networks with a hyperbolic structure have many app...

  11. Exact solution of Schroedinger equation in the case of reduction to Riccati type of ODE

    CERN Document Server

    Ershkov, Sergey V

    2011-01-01

    Here is presented a new type of exact solution of Schroedinger equation in the case of it's reduction to Riccati type of ordinary differential equations. Due to a very special character of Riccati's type equation, it's general solution is proved to have a proper gap of components of the particle wavefunction (which is known to be determining a proper quantum state of the particle). It means a possibility of sudden transformation or transmutation of quantum state of the particle (from one meaning of wavefunction to another), at definite moment of parametrical time. Besides, in the case of spherical symmetry of particle potential V in position space, as well as spherical symmetry of quantum system E total energy, such a solution is proved to be a multiplying of Bessel function (for radial component) & Legendre spherical function (for angle component), in spherical coordinate system.

  12. Exact mesh shape design of large cable-network antenna reflectors with flexible ring truss supports

    Science.gov (United States)

    Liu, Wang; Li, Dong-Xu; Yu, Xin-Zhan; Jiang, Jian-Ping

    2014-04-01

    An exact-designed mesh shape with favorable surface accuracy is of practical significance to the performance of large cable-network antenna reflectors. In this study, a novel design approach that could guide the generation of exact spatial parabolic mesh configurations of such reflector was proposed. By incorporating the traditional force density method with the standard finite element method, this proposed approach had taken the deformation effects of flexible ring truss supports into consideration, and searched for the desired mesh shapes that can satisfy the requirement that all the free nodes are exactly located on the objective paraboloid. Compared with the conventional design method, a remarkable improvement of surface accuracy in the obtained mesh shapes had been demonstrated by numerical examples. The present work would provide a helpful technical reference for the mesh shape design of such cable-network antenna reflector in engineering practice. [Figure not available: see fulltext.

  13. Bosonization, Singularity Analysis, Nonlocal Symmetry Reductions and Exact Solutions of Supersymmetric KdV Equation

    CERN Document Server

    Gao, Xiao Nan; Tang, Xiao Yan

    2013-01-01

    Assuming that there exist at least two fermionic parameters, the classical N= 1 supersymmetric Korteweg-de Vries (SKdV) system can be transformed to some coupled bosonic systems. The boson fields in the bosonized SKdV (BSKdV) systems are defined on even Grassmann algebra. Due to the intrusion of other Grassmann parameters, the BSKdV systems are different from the usual non-supersymmetric integrable systems, and many more abundant solution structures can be unearthed. With the help of the singularity analysis, the Painlev\\'e property of the BSKdV system is proved and a B\\"acklund transformation (BT) is found. The BT related nonlocal symmetry, we call it as residual symmetry, is used to find symmetry reduction solutions of the BSKdV system. Hinted from the symmetry reduction solutions, a more generalized but much simpler method is established to find exact solutions of the BSKdV and then the SKdV systems, which actually can be applied to any fermionic systems.

  14. Symmetry reductions and exact solutions of the (2 + 1)-dimensional Camassa–Holm Kadomtsev–Petviashvili equation

    Indian Academy of Sciences (India)

    Wang Zhen-Li; Liu Qiang

    2015-07-01

    In this paper, the classical Lie group method is employed to obtain exact travelling wave solutions of the generalized Camassa–Holm Kadomtsev–Petviashvili (g-CH–KP) equation. We give the conservation laws of the g-CH–KP equation. Using the symmetries, we find six classical similarity reductions of g-CH–KP equation. Many types of exact solutions of the g-CH–KP equation are derived by solving the reduced equations.

  15. Exact probabilities for the indeterminacy of complex networks as perceived through press perturbations

    CERN Document Server

    Koslicki, David

    2016-01-01

    We consider the goal of predicting how complex networks respond to chronic (press) perturbations when characterizations of their network topology and interaction strengths are associated with uncertainty. Our primary result is the derivation of exact formulas for the expected number and probability of qualitatively incorrect predictions about a system's responses under uncertainties drawn form arbitrary distributions of error. These formulas obviate the current use of simulations, algorithms, and qualitative modeling techniques. Additional indices provide new tools for identifying which links in a network are most qualitatively and quantitatively sensitive to error, and for determining the volume of errors within which predictions will remain qualitatively determinate (i.e. sign insensitive). Together with recent advances in the empirical characterization of uncertainty in ecological networks, these tools bridge a way towards probabilistic predictions of network dynamics.

  16. Exact computation of the maximum-entropy potential of spiking neural-network models.

    Science.gov (United States)

    Cofré, R; Cessac, B

    2014-05-01

    Understanding how stimuli and synaptic connectivity influence the statistics of spike patterns in neural networks is a central question in computational neuroscience. The maximum-entropy approach has been successfully used to characterize the statistical response of simultaneously recorded spiking neurons responding to stimuli. However, in spite of good performance in terms of prediction, the fitting parameters do not explain the underlying mechanistic causes of the observed correlations. On the other hand, mathematical models of spiking neurons (neuromimetic models) provide a probabilistic mapping between the stimulus, network architecture, and spike patterns in terms of conditional probabilities. In this paper we build an exact analytical mapping between neuromimetic and maximum-entropy models.

  17. Improved bounds on the epidemic threshold of exact SIS models on complex networks

    KAUST Repository

    Ruhi, Navid Azizan

    2017-01-05

    The SIS (susceptible-infected-susceptible) epidemic model on an arbitrary network, without making approximations, is a 2n-state Markov chain with a unique absorbing state (the all-healthy state). This makes analysis of the SIS model and, in particular, determining the threshold of epidemic spread quite challenging. It has been shown that the exact marginal probabilities of infection can be upper bounded by an n-dimensional linear time-invariant system, a consequence of which is that the Markov chain is “fast-mixing” when the LTI system is stable, i.e. when equation (where β is the infection rate per link, δ is the recovery rate, and λmax(A) is the largest eigenvalue of the network\\'s adjacency matrix). This well-known threshold has been recently shown not to be tight in several cases, such as in a star network. In this paper, we provide tighter upper bounds on the exact marginal probabilities of infection, by also taking pairwise infection probabilities into account. Based on this improved bound, we derive tighter eigenvalue conditions that guarantee fast mixing (i.e., logarithmic mixing time) of the chain. We demonstrate the improvement of the threshold condition by comparing the new bound with the known one on various networks with various epidemic parameters.

  18. Exact Outage Performance Analysis of Multiuser Multi-relay Spectrum Sharing Cognitive Networks

    Directory of Open Access Journals (Sweden)

    T. Zhang

    2015-04-01

    Full Text Available In this paper, we investigate the outage performance of dual-hop multiuser multi-relay cognitive radio networks under spectrum sharing constraints. Using an efficient relay-destination selection scheme, the exact and asymptotic closed-form expressions for the outage probability are derived. From these expressions it is indicated that the achieved diversity order is only determined by the number of secondary user (SU relays and destinations, and equals to M+N (where M and N are the number of destination nodes and relay nodes, respectively. Further, we find that the coding gain of the SU network will be affected by the interference threshold $bar I$ at the primary user (PU receiver. Specifically, as the increases of the interference threshold, the coding gain of the considered network approaches to that of the multiuser multi-relay system in the non-cognitive network. Finally, our study is corroborated by representative numerical examples.

  19. Optical Networks for Cost Monitoring and Reduction

    Directory of Open Access Journals (Sweden)

    R Buvanesvari

    2011-03-01

    Full Text Available This paper focuses on cost reduction and monitoring in optical networks. Optical mesh networks are cost savings with switching systems that are interconnected by point-to-point networks. Transponders play a major role in it. All-optical packet switching has been intensively investigated in recent years as an alternative to static, cross connect based networks. Several switch architectures have been proposed, all of them using buffers made of fiber delay lines. We consider the problem of minimizing the congestion in wireless optical (FSO backbone networks by placing controllable relay nodes. We propose algorithms for placement of relays in the network under node interface constraints. Further reduction in cost is done by the conversion of optical to electrical at the intermediate nodes. Optical transport networks offer a new level of flexibility in the optical layer allowing various services and thereby improving the efficiency, performance and robustness. An optical path with a transparent feature allows the transmission of signals that are optical and also independent of data rate and modulation format. Client layer protocol provides transparency for the transport layer in optical networks. Thus there is a significant challenge in terms of function, flexibility and monitoring cost.

  20. Exact event-driven implementation for recurrent networks of stochastic perfect integrate-and-fire neurons.

    Science.gov (United States)

    Taillefumier, Thibaud; Touboul, Jonathan; Magnasco, Marcelo

    2012-12-01

    In vivo cortical recording reveals that indirectly driven neural assemblies can produce reliable and temporally precise spiking patterns in response to stereotyped stimulation. This suggests that despite being fundamentally noisy, the collective activity of neurons conveys information through temporal coding. Stochastic integrate-and-fire models delineate a natural theoretical framework to study the interplay of intrinsic neural noise and spike timing precision. However, there are inherent difficulties in simulating their networks' dynamics in silico with standard numerical discretization schemes. Indeed, the well-posedness of the evolution of such networks requires temporally ordering every neuronal interaction, whereas the order of interactions is highly sensitive to the random variability of spiking times. Here, we answer these issues for perfect stochastic integrate-and-fire neurons by designing an exact event-driven algorithm for the simulation of recurrent networks, with delayed Dirac-like interactions. In addition to being exact from the mathematical standpoint, our proposed method is highly efficient numerically. We envision that our algorithm is especially indicated for studying the emergence of polychronized motifs in networks evolving under spike-timing-dependent plasticity with intrinsic noise.

  1. Knowledge Network Approach to Noise Reduction

    CERN Document Server

    Berrones, A

    2006-01-01

    Previous preliminary results on the application of knowledge networks to noise reduction in stationary harmonic and weakly chaotic signals are extended to more general cases. The formalism gives a novel algorithm from which statistical tests for the identification of deterministic behavior in noisy stationary time series can be constructed.

  2. An exact arithmetic toolbox for a consistent and reproducible structural analysis of metabolic network models.

    Science.gov (United States)

    Chindelevitch, Leonid; Trigg, Jason; Regev, Aviv; Berger, Bonnie

    2014-10-07

    Constraint-based models are currently the only methodology that allows the study of metabolism at the whole-genome scale. Flux balance analysis is commonly used to analyse constraint-based models. Curiously, the results of this analysis vary with the software being run, a situation that we show can be remedied by using exact rather than floating-point arithmetic. Here we introduce MONGOOSE, a toolbox for analysing the structure of constraint-based metabolic models in exact arithmetic. We apply MONGOOSE to the analysis of 98 existing metabolic network models and find that the biomass reaction is surprisingly blocked (unable to sustain non-zero flux) in nearly half of them. We propose a principled approach for unblocking these reactions and extend it to the problems of identifying essential and synthetic lethal reactions and minimal media. Our structural insights enable a systematic study of constraint-based metabolic models, yielding a deeper understanding of their possibilities and limitations.

  3. Exact and heuristic methods for network completion for time-varying genetic networks.

    Science.gov (United States)

    Nakajima, Natsu; Akutsu, Tatsuya

    2014-01-01

    Robustness in biological networks can be regarded as an important feature of living systems. A system maintains its functions against internal and external perturbations, leading to topological changes in the network with varying delays. To understand the flexibility of biological networks, we propose a novel approach to analyze time-dependent networks, based on the framework of network completion, which aims to make the minimum amount of modifications to a given network so that the resulting network is most consistent with the observed data. We have developed a novel network completion method for time-varying networks by extending our previous method for the completion of stationary networks. In particular, we introduce a double dynamic programming technique to identify change time points and required modifications. Although this extended method allows us to guarantee the optimality of the solution, this method has relatively low computational efficiency. In order to resolve this difficulty, we developed a heuristic method for speeding up the calculation of minimum least squares errors. We demonstrate the effectiveness of our proposed methods through computational experiments using synthetic data and real microarray gene expression data. The results indicate that our methods exhibit good performance in terms of completing and inferring gene association networks with time-varying structures.

  4. Exact probability distributions of selected species in stochastic chemical reaction networks.

    Science.gov (United States)

    López-Caamal, Fernando; Marquez-Lago, Tatiana T

    2014-09-01

    Chemical reactions are discrete, stochastic events. As such, the species' molecular numbers can be described by an associated master equation. However, handling such an equation may become difficult due to the large size of reaction networks. A commonly used approach to forecast the behaviour of reaction networks is to perform computational simulations of such systems and analyse their outcome statistically. This approach, however, might require high computational costs to provide accurate results. In this paper we opt for an analytical approach to obtain the time-dependent solution of the Chemical Master Equation for selected species in a general reaction network. When the reaction networks are composed exclusively of zeroth and first-order reactions, this analytical approach significantly alleviates the computational burden required by simulation-based methods. By building upon these analytical solutions, we analyse a general monomolecular reaction network with an arbitrary number of species to obtain the exact marginal probability distribution for selected species. Additionally, we study two particular topologies of monomolecular reaction networks, namely (i) an unbranched chain of monomolecular reactions with and without synthesis and degradation reactions and (ii) a circular chain of monomolecular reactions. We illustrate our methodology and alternative ways to use it for non-linear systems by analysing a protein autoactivation mechanism. Later, we compare the computational load required for the implementation of our results and a pure computational approach to analyse an unbranched chain of monomolecular reactions. Finally, we study calcium ions gates in the sarco/endoplasmic reticulum mediated by ryanodine receptors.

  5. The exact evaluation of the corner-to-corner resistance of an M x N resistor network: asymptotic expansion

    Energy Technology Data Exchange (ETDEWEB)

    Essam, J W [Department of Mathematics, Royal Holloway College, University of London, Egham, Surrey TW20 0EX (United Kingdom); Wu, F Y [Department of Physics, Northeastern University, Boston, MA 02115 (United States)

    2009-01-16

    We study the corner-to-corner resistance of an M x N resistor network with resistors r and s in the two spatial directions and obtain an asymptotic expansion of its exact expression for large M and N.

  6. Exact computation of the Maximum Entropy Potential of spiking neural networks models

    CERN Document Server

    Cofre, Rodrigo

    2014-01-01

    Understanding how stimuli and synaptic connectivity in uence the statistics of spike patterns in neural networks is a central question in computational neuroscience. Maximum Entropy approach has been successfully used to characterize the statistical response of simultaneously recorded spiking neurons responding to stimuli. But, in spite of good performance in terms of prediction, the ?tting parameters do not explain the underlying mechanistic causes of the observed correlations. On the other hand, mathematical models of spiking neurons (neuro-mimetic models) provide a probabilistic mapping between stimulus, network architecture and spike patterns in terms of conditional proba- bilities. In this paper we build an exact analytical mapping between neuro-mimetic and Maximum Entropy models.

  7. Direct Reduction and Exact Solutions for Generalized Variable Coefficients 2D KdV Equation under Some Integrability Conditions

    Institute of Scientific and Technical Information of China (English)

    M.H.M. Moussa; Rehab M. El-Shiekh

    2011-01-01

    Based on the closed connections among the homogeneous balance (HB) method and Clarkson-Kruskal (CK) method, we study the similarity reductions of the generalized variable coefficients 2D KdV equation. In the meantime it is shown that this leads to a direct reduction in the form of ordinary differential equation under some integrability conditions between the variable coefficients. Two different cases have been discussed, the search for solutions of those ordinary differential equations yielded many exact travelling and solitonic wave solutions in the form of hyperbolic and trigonometric functions under some constraints between the variable coefficients.

  8. Exactly computing the parsimony scores on phylogenetic networks using dynamic programming.

    Science.gov (United States)

    Kannan, Lavanya; Wheeler, Ward C

    2014-04-01

    Scoring a given phylogenetic network is the first step that is required in searching for the best evolutionary framework for a given dataset. Using the principle of maximum parsimony, we can score phylogenetic networks based on the minimum number of state changes across a subset of edges of the network for each character that are required for a given set of characters to realize the input states at the leaves of the networks. Two such subsets of edges of networks are interesting in light of studying evolutionary histories of datasets: (i) the set of all edges of the network, and (ii) the set of all edges of a spanning tree that minimizes the score. The problems of finding the parsimony scores under these two criteria define slightly different mathematical problems that are both NP-hard. In this article, we show that both problems, with scores generalized to adding substitution costs between states on the endpoints of the edges, can be solved exactly using dynamic programming. We show that our algorithms require O(m(p)k) storage at each vertex (per character), where k is the number of states the character can take, p is the number of reticulate vertices in the network, m = k for the problem with edge set (i), and m = 2 for the problem with edge set (ii). This establishes an O(nm(p)k(2)) algorithm for both the problems (n is the number of leaves in the network), which are extensions of Sankoff's algorithm for finding the parsimony scores for phylogenetic trees. We will discuss improvements in the complexities and show that for phylogenetic networks whose underlying undirected graphs have disjoint cycles, the storage at each vertex can be reduced to O(mk), thus making the algorithm polynomial for this class of networks. We will present some properties of the two approaches and guidance on choosing between the criteria, as well as traverse through the network space using either of the definitions. We show that our methodology provides an effective means to

  9. Exact Solutions of Generalized Modified Boussinesq, Kuramoto-Sivashinsky, and Camassa-Holm Equations via Double Reduction Theory

    Directory of Open Access Journals (Sweden)

    Zulfiqar Ali

    2013-01-01

    Full Text Available We find exact solutions of the Generalized Modified Boussinesq (GMB equation, the Kuromoto-Sivashinsky (KS equation the and, Camassa-Holm (CH equation by utilizing the double reduction theory related to conserved vectors. The fourth order GMB equation involves the arbitrary function and mixed derivative terms in highest derivative. The partial Noether’s approach yields seven conserved vectors for GMB equation and one conserved for vector KS equation. Due to presence of mixed derivative term the conserved vectors for GMB equation derived by the Noether like theorem do not satisfy the divergence relationship. The extra terms that constitute the trivial part of conserved vectors are adjusted and the resulting conserved vectors satisfy the divergence property. The double reduction theory yields two independent solutions and one reduction for GMB equation and one solution for KS equation. For CH equation two independent solutions are obtained elsewhere by double reduction theory with the help of conserved Vectors.

  10. Random sampling versus exact enumeration of attractors in random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Berdahl, Andrew; Shreim, Amer; Sood, Vishal; Paczuski, Maya; Davidsen, Joern [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Alberta (Canada)], E-mail: aberdahl@phas.ucalgary.ca

    2009-04-15

    We clarify the effect different sampling methods and weighting schemes have on the statistics of attractors in ensembles of random Boolean networks (RBNs). We directly measure the cycle lengths of attractors and the sizes of basins of attraction in RBNs using exact enumeration of the state space. In general, the distribution of attractor lengths differs markedly from that obtained by randomly choosing an initial state and following the dynamics to reach an attractor. Our results indicate that the former distribution decays as a power law with exponent 1 for all connectivities K>1 in the infinite system size limit. In contrast, the latter distribution decays as a power law only for K=2. This is because the mean basin size grows linearly with the attractor cycle length for K>2, and is statistically independent of the cycle length for K=2. We also find that the histograms of basin sizes are strongly peaked at integer multiples of powers of two for K<3.

  11. Reduction Mappings between Probabilistic Boolean Networks

    Directory of Open Access Journals (Sweden)

    Ivan Ivanov

    2004-01-01

    Full Text Available Probabilistic Boolean networks (PBNs comprise a model describing a directed graph with rule-based dependences between its nodes. The rules are selected, based on a given probability distribution which provides a flexibility when dealing with the uncertainty which is typical for genetic regulatory networks. Given the computational complexity of the model, the characterization of mappings reducing the size of a given PBN becomes a critical issue. Mappings between PBNs are important also from a theoretical point of view. They provide means for developing a better understanding about the dynamics of PBNs. This paper considers two kinds of mappings reduction and projection and their effect on the original probability structure of a given PBN.

  12. Direct Similarity Reduction and New Exact Solutions for the Variable-Coefficient Kadomtsev-Petviashvili Equation

    Science.gov (United States)

    El-Shiekh, Rehab M.

    2015-06-01

    In this paper, the generalized (3+1)-dimensional variable-coefficient Kadomtsev-Petviashvili equation (VCKPE), which can describe nonlinear phenomena in fluids or plasmas, is studied by using two different Clarkson and Kruskal (CK) direct methods, namely, the classical CK and the modified enlarged CK method. A similarity reduction to a (2+1)-dimensional nonlinear partial differential equation and a direct similarity reduction to a nonlinear ordinary differential equation are obtained, respectively. By solving the reduced ordinary differential equation, new solitary, periodic, and singular solutions for the VCKPE are obtained. Some figures for the soliton and periodic wave solutions are given to reflect the effect of the variable coefficients on the solution propagation. Finally, the comparison between the two different CK techniques indicates that the modified enlarged CK technique is clearly more powerful and simple than the classical CK technique.

  13. Science and Technology Networks : A Helping Hand to Boost Implementation of the Sendai Framework for Disaster Risk Reduction 2015–2030?

    NARCIS (Netherlands)

    Trogrlić, RobertŠakić; Cumiskey, Lydia; Triyanti, Annisa; Duncan, Melanie J.; Eltinay, Nuha; Hogeboom, Rick J.; Jasuja, Mansi; Meechaiya, Chinaporn; Pickering, Christina J.; Murray, Virginia

    2017-01-01

    The Sendai Framework for Disaster Risk Reduction 2015–2030 underlines the importance of Science and Technology (S&T) and S&T networks for effective disaster risk reduction (DRR). The knowledge of existing S&T networks and their exact role in DRR, however, is limited. This opinion piece initiates a d

  14. Model-order reduction of biochemical reaction networks

    NARCIS (Netherlands)

    Rao, Shodhan; Schaft, Arjan van der; Eunen, Karen van; Bakker, Barbara M.; Jayawardhana, Bayu

    2013-01-01

    In this paper we propose a model-order reduction method for chemical reaction networks governed by general enzyme kinetics, including the mass-action and Michaelis-Menten kinetics. The model-order reduction method is based on the Kron reduction of the weighted Laplacian matrix which describes the gr

  15. An exact arithmetic toolbox for a consistent and reproducible structural analysis of metabolic network models

    National Research Council Canada - National Science Library

    Chindelevitch, Leonid; Trigg, Jason; Regev, Aviv; Berger, Bonnie

    2014-01-01

    .... Flux balance analysis is commonly used to analyse constraint-based models. Curiously, the results of this analysis vary with the software being run, a situation that we show can be remedied by using exact rather than floating-point arithmetic...

  16. Reduction of Protein Networks Models by Passivity Preserving Projection

    Institute of Scientific and Technical Information of China (English)

    Luca Mesin; Flavio Canavero; Lamberto Rondoni

    2013-01-01

    Reduction of complex protein networks models is of great importance.The accuracy of a passivity preserving algorithm (PRIMA) for model order reduction (MOR) is here tested on protein networks,introducing innovative variations of the standard PRIMA method to fit the problem at hand.The reduction method does not require to solve the complete system,resulting in a promising tool for studying very large-scale models for which the full solution cannot be computed.The mathematical structure of the considered kinetic equations is preserved.Keeping constant the reduction factor,the approximation error is lower for larger systems.

  17. Reduction Method for Active Distribution Networks

    DEFF Research Database (Denmark)

    Raboni, Pietro; Chen, Zhe

    2013-01-01

    On-line security assessment is traditionally performed by Transmission System Operators at the transmission level, ignoring the effective response of distributed generators and small loads. On the other hand the required computation time and amount of real time data for including Distribution...... Networks also would be too large. In this paper an adaptive aggregation method for subsystems with power electronic interfaced generators and voltage dependant loads is proposed. With this tool may be relatively easier including distribution networks into security assessment. The method is validated...

  18. Exact and Approximate Inference in Associative Hierarchical Networks using Graph Cuts

    CERN Document Server

    Russell, Chris; Kohli, Pushmeet; Torr, Philip H S

    2012-01-01

    Markov Networks are widely used through out computer vision and machine learning. An important subclass are the Associative Markov Networks which are used in a wide variety of applications. For these networks a good approximate minimum cost solution can be found efficiently using graph cut based move making algorithms such as alpha- expansion. Recently a related model has been proposed, the associative hierarchical net- work, which provides a natural generalisation of the Associative Markov Network for higher order cliques (i.e. clique size greater than two). This method provides a good model for object class segmentation problem in com- puter vision. Within this paper we briefly describe the associative hierarchical network and provide a computationally efficient method for ap- proximate inference based on graph cuts. Our method performs well for networks con- taining hundreds of thousand of variables, and higher order potentials are defined over cliques containing tens of thousands of vari- ables. Due to th...

  19. A layer reduction based community detection algorithm on multiplex networks

    Science.gov (United States)

    Wang, Xiaodong; Liu, Jing

    2017-04-01

    Detecting hidden communities is important for the analysis of complex networks. However, many algorithms have been designed for single layer networks (SLNs) while just a few approaches have been designed for multiplex networks (MNs). In this paper, we propose an algorithm based on layer reduction for detecting communities on MNs, which is termed as LRCD-MNs. First, we improve a layer reduction algorithm termed as neighaggre to combine similar layers and keep others separated. Then, we use neighaggre to find the community structure hidden in MNs. Experiments on real-life networks show that neighaggre can obtain higher relative entropy than the other algorithm. Moreover, we apply LRCD-MNs on some real-life and synthetic multiplex networks and the results demonstrate that, although LRCD-MNs does not have the advantage in terms of modularity, it can obtain higher values of surprise, which is used to evaluate the quality of partitions of a network.

  20. Deep Belief Networks for dimensionality reduction

    NARCIS (Netherlands)

    Noulas, A.K.; Kröse, B.J.A.

    2008-01-01

    Deep Belief Networks are probabilistic generative models which are composed by multiple layers of latent stochastic variables. The top two layers have symmetric undirected connections, while the lower layers receive directed top-down connections from the layer above. The current state-of-the-art tra

  1. On Exact Controllability of Networks of Nonlinear Elastic Strings in 3-Dimensional Space

    Institute of Scientific and Technical Information of China (English)

    Günter R. LEUGERING; E. J. P. Georg SCHMIDT

    2012-01-01

    This paper concerns a system of nonlinear wave equations describing the vibrations of a 3-dimensional network of elastic strings.The authors derive the equations and appropriate nodal conditions,determine equilibrium solutions,and,by using the methods of quasilinear hyperbolic systems,prove that for tree networks the natural initial,bound-ary value problem has classical solutions existing in neighborhoods of the "stretched" equilibrium solutions.Then the local controllability of such networks near such equilibrium configurations in a certain specified time interval is proved.Finally,it is proved that,given two different equilibrium states satisfying certain conditions,it is possible to control the network from states in a small enough neighborhood of one equilibrium to any state in a suitable neighborhood of the second equilibrium over a sufficiently large time interval.

  2. Compressive Sensing for Feedback Reduction in Wireless Multiuser Networks

    KAUST Repository

    Elkhalil, Khalil

    2015-05-01

    User/relay selection is a simple technique that achieves spatial diversity in multiuser networks. However, for user/relay selection algorithms to make a selection decision, channel state information (CSI) from all cooperating users/relays is usually required at a central node. This requirement poses two important challenges. Firstly, CSI acquisition generates a great deal of feedback overhead (air-time) that could result in significant transmission delays. Secondly, the fed-back channel information is usually corrupted by additive noise. This could lead to transmission outages if the central node selects the set of cooperating relays based on inaccurate feedback information. Motivated by the aforementioned challenges, we propose a limited feedback user/relay selection scheme that is based on the theory of compressed sensing. Firstly, we introduce a limited feedback relay selection algorithm for a multicast relay network. The proposed algorithm exploits the theory of compressive sensing to first obtain the identity of the “strong” relays with limited feedback air-time. Following that, the CSI of the selected relays is estimated using minimum mean square error estimation without any additional feedback. To minimize the effect of noise on the fed-back CSI, we introduce a back-off strategy that optimally backs-off on the noisy received CSI. In the second part of the thesis, we propose a feedback reduction scheme for full-duplex relay-aided multiuser networks. The proposed scheme permits the base station (BS) to obtain channel state information (CSI) from a subset of strong users under substantially reduced feedback overhead. More specifically, we cast the problem of user identification and CSI estimation as a block sparse signal recovery problem in compressive sensing (CS). Using existing CS block recovery algorithms, we first obtain the identity of the strong users and then estimate their CSI using the best linear unbiased estimator (BLUE). Moreover, we derive the

  3. Steady state analysis of Boolean molecular network models via model reduction and computational algebra

    Science.gov (United States)

    2014-01-01

    Background A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. Results This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. Conclusions The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate

  4. Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

    Science.gov (United States)

    Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

    2014-06-26

    A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for

  5. Identifying functional modules in protein-protein interaction networks: An integrated exact approach

    NARCIS (Netherlands)

    Dittrich, M.; Klau, G.W.; Rosenwald, A.; Dandekar, T.; et al, not CWI

    2008-01-01

    Motivation: With the exponential growth of expression and protein-protein interaction (PPI) data, the frontier of research in system biology shifts more and more to the integrated analysis of these large datasets. Of particular interest is the identification of functional modules in PPI networks, sh

  6. Exact Evaluation of The Resistance in an Infinite Face- Centered Cubic Network

    CERN Document Server

    Asad, Jihad H

    2012-01-01

    The equivalent resistance between the origin and the lattice site (2n,0,0), in an infinite Face Centered Cubic network consisting from identical resistors each of resistance R, has been expressed in terms of the complete elliptic integral of the first kind, and . The asymptotic behavior is investigated, and some numerical values for the equivalent resistance are presented.

  7. Exact Determination of Optimal Weights for Fastest Distributed Consensus Algorithm in Path Network via SDP

    CERN Document Server

    Jafarizadeh, Saber

    2010-01-01

    Providing an analytical solution for the problem of finding Fastest Distributed Consensus (FDC) is one of the challenging problems in the field of sensor networks. Most of the methods proposed so far deal with the FDC averaging algorithm problem by numerical convex optimization methods and in general no closed-form solution for finding FDC has been offered up to now except in [3] where the conjectured answer for path has been proved. Here in this work we present an analytical solution for the problem of Fastest Distributed Consensus for the Path network using semidefinite programming particularly solving the slackness conditions, where the optimal weights are obtained by inductive comparing of the characteristic polynomials initiated by slackness conditions.

  8. Information Sharing for Strong Neutrals on Social Networks - Exact Solutions for Consensus Times

    CERN Document Server

    Lim, Chjan

    2014-01-01

    To analyze the nuances of the root concept of neutral in social networks, we focus on several related interpretations and suggest corresponding mathematical models for each of them from the family of information-sharing multi-agents network games known as Voter models and the Naming Games (NG). We solve the case of the strong neutrals known as the middle-roaders for global quantities such as expected times to consensus and local times. By using generating functions and treating the two extreme and middle opinions in this modification as a two balls, three urns version of the Voter model, we give closed-form expressions for the eigenvalues and eigenvectors of its Markov propagator. This modification of the two-opinions Naming Games is applicable to the roles and behaviour of neutrals in social forums or blogs, and represent a significant departure from the linguistic roots of the original NG.

  9. An exact relationship between invasion probability and endemic prevalence for Markovian SIS dynamics on networks.

    Science.gov (United States)

    Wilkinson, Robert R; Sharkey, Kieran J

    2013-01-01

    Understanding models which represent the invasion of network-based systems by infectious agents can give important insights into many real-world situations, including the prevention and control of infectious diseases and computer viruses. Here we consider Markovian susceptible-infectious-susceptible (SIS) dynamics on finite strongly connected networks, applicable to several sexually transmitted diseases and computer viruses. In this context, a theoretical definition of endemic prevalence is easily obtained via the quasi-stationary distribution (QSD). By representing the model as a percolation process and utilising the property of duality, we also provide a theoretical definition of invasion probability. We then show that, for undirected networks, the probability of invasion from any given individual is equal to the (probabilistic) endemic prevalence, following successful invasion, at the individual (we also provide a relationship for the directed case). The total (fractional) endemic prevalence in the population is thus equal to the average invasion probability (across all individuals). Consequently, for such systems, the regions or individuals already supporting a high level of infection are likely to be the source of a successful invasion by another infectious agent. This could be used to inform targeted interventions when there is a threat from an emerging infectious disease.

  10. An exact relationship between invasion probability and endemic prevalence for Markovian SIS dynamics on networks.

    Directory of Open Access Journals (Sweden)

    Robert R Wilkinson

    Full Text Available Understanding models which represent the invasion of network-based systems by infectious agents can give important insights into many real-world situations, including the prevention and control of infectious diseases and computer viruses. Here we consider Markovian susceptible-infectious-susceptible (SIS dynamics on finite strongly connected networks, applicable to several sexually transmitted diseases and computer viruses. In this context, a theoretical definition of endemic prevalence is easily obtained via the quasi-stationary distribution (QSD. By representing the model as a percolation process and utilising the property of duality, we also provide a theoretical definition of invasion probability. We then show that, for undirected networks, the probability of invasion from any given individual is equal to the (probabilistic endemic prevalence, following successful invasion, at the individual (we also provide a relationship for the directed case. The total (fractional endemic prevalence in the population is thus equal to the average invasion probability (across all individuals. Consequently, for such systems, the regions or individuals already supporting a high level of infection are likely to be the source of a successful invasion by another infectious agent. This could be used to inform targeted interventions when there is a threat from an emerging infectious disease.

  11. Exact detection of direct links in networks of interacting dynamical units

    CERN Document Server

    Rubido, Nicolás; Bianco-Martínez, Ezequiel; Grebogi, Celso; Baptista, Murilo S; Masoller, Cristina

    2014-01-01

    The inference of an underlying network structure from local observations of a complex system composed of interacting units is usually attempted by using statistical similarity measures, such as Cross-Correlation (CC) and Mutual Information (MI). The possible existence of a direct link between different units is, however, hindered within the time-series measurements. Here we show that when an abrupt change in the ordered set of CC or MI values exits, it is possible to infer, without errors, the underlying network structure from the time-series measurements, even in the presence of observational noise, non-identical units, and coupling heterogeneity. We find that a necessary condition for the discontinuity to occur is that the dynamics of the coupled units is partially coherent, i.e., neither complete disorder nor globally synchronous patterns are present. We critically compare the inference methods based on CC and MI, in terms of how effective, robust, and reliable they are, and conclude that, in general, MI o...

  12. Final Report. Analysis and Reduction of Complex Networks Under Uncertainty

    Energy Technology Data Exchange (ETDEWEB)

    Marzouk, Youssef M. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States); Coles, T. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States); Spantini, A. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States); Tosatto, L. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)

    2013-09-30

    The project was a collaborative effort among MIT, Sandia National Laboratories (local PI Dr. Habib Najm), the University of Southern California (local PI Prof. Roger Ghanem), and The Johns Hopkins University (local PI Prof. Omar Knio, now at Duke University). Our focus was the analysis and reduction of large-scale dynamical systems emerging from networks of interacting components. Such networks underlie myriad natural and engineered systems. Examples important to DOE include chemical models of energy conversion processes, and elements of national infrastructure—e.g., electric power grids. Time scales in chemical systems span orders of magnitude, while infrastructure networks feature both local and long-distance connectivity, with associated clusters of time scales. These systems also blend continuous and discrete behavior; examples include saturation phenomena in surface chemistry and catalysis, and switching in electrical networks. Reducing size and stiffness is essential to tractable and predictive simulation of these systems. Computational singular perturbation (CSP) has been effectively used to identify and decouple dynamics at disparate time scales in chemical systems, allowing reduction of model complexity and stiffness. In realistic settings, however, model reduction must contend with uncertainties, which are often greatest in large-scale systems most in need of reduction. Uncertainty is not limited to parameters; one must also address structural uncertainties—e.g., whether a link is present in a network—and the impact of random perturbations, e.g., fluctuating loads or sources. Research under this project developed new methods for the analysis and reduction of complex multiscale networks under uncertainty, by combining computational singular perturbation (CSP) with probabilistic uncertainty quantification. CSP yields asymptotic approximations of reduceddimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing

  13. Symmetry Reduction, Exact Solutions, and Conservation Laws of (2+1)-Dimensional Burgers Korteweg-de Vries Equation

    Institute of Scientific and Technical Information of China (English)

    DONG Zhong-Zhou; LIU Xi-Qiang; BAI Cheng-Lin

    2006-01-01

    Using the classical Lie method of infinitesimals, we first obtain the symmetry of the (2+1)-dimensional Burgers-Korteweg-de-Vries (3D-BKdV) equation. Then we reduce the 3D-BKdV equation using the symmetry and give some exact solutions of the 3D-BKdV equation. When using the direct method, we restrict a condition and get a relationship between the new solutions and the old ones. Given a solution of the 3D-BKdV equation, we can get a new one from the relationship. The relationship between the symmetry obtained by using the classical Lie method and that obtained by using the direct method is also mentioned. At last, we give the conservation laws of the 3D-BKdV equation.

  14. Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions

    CERN Document Server

    Krislock, Nathan

    2010-01-01

    The sensor network localization, SNL, problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are within radio range and the positions of a subset of the sensors (called anchors). Current solution techniques relax this problem to a weighted, nearest, (positive) semidefinite programming, SDP, completion problem, by using the linear mapping between Euclidean distance matrices, EDM, and semidefinite matrices. The resulting SDP is solved using primal-dual interior point solvers, yielding an expensive and inexact solution. This relaxation is highly degenerate in the sense that the feasible set is restricted to a low dimensional face of the SDP cone, implying that the Slater constraint qualification fails. Cliques in the graph of the SNL problem give rise to this degeneracy in the SDP relaxation. In this paper, we take advantage of the absence of the Slater constraint qualification and derive a technique for the SNL problem, with exact ...

  15. Analysis and Reduction of Complex Networks Under Uncertainty

    Energy Technology Data Exchange (ETDEWEB)

    Knio, Omar M

    2014-04-09

    This is a collaborative proposal that aims at developing new methods for the analysis and reduction of complex multiscale networks under uncertainty. The approach is based on combining methods of computational singular perturbation (CSP) and probabilistic uncertainty quantification. In deterministic settings, CSP yields asymptotic approximations of reduced-dimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing uncertainty raises fundamentally new issues, particularly concerning its impact on the topology of slow manifolds, and means to represent and quantify associated variability. To address these challenges, this project uses polynomial chaos (PC) methods to reformulate uncertain network models, and to analyze them using CSP in probabilistic terms. Specific objectives include (1) developing effective algorithms that can be used to illuminate fundamental and unexplored connections among model reduction, multiscale behavior, and uncertainty, and (2) demonstrating the performance of these algorithms through applications to model problems.

  16. Neural Network Machine Learning and Dimension Reduction for Data Visualization

    Science.gov (United States)

    Liles, Charles A.

    2014-01-01

    Neural network machine learning in computer science is a continuously developing field of study. Although neural network models have been developed which can accurately predict a numeric value or nominal classification, a general purpose method for constructing neural network architecture has yet to be developed. Computer scientists are often forced to rely on a trial-and-error process of developing and improving accurate neural network models. In many cases, models are constructed from a large number of input parameters. Understanding which input parameters have the greatest impact on the prediction of the model is often difficult to surmise, especially when the number of input variables is very high. This challenge is often labeled the "curse of dimensionality" in scientific fields. However, techniques exist for reducing the dimensionality of problems to just two dimensions. Once a problem's dimensions have been mapped to two dimensions, it can be easily plotted and understood by humans. The ability to visualize a multi-dimensional dataset can provide a means of identifying which input variables have the highest effect on determining a nominal or numeric output. Identifying these variables can provide a better means of training neural network models; models can be more easily and quickly trained using only input variables which appear to affect the outcome variable. The purpose of this project is to explore varying means of training neural networks and to utilize dimensional reduction for visualizing and understanding complex datasets.

  17. Kron Reduction of Graphs with Applications to Electrical Networks

    CERN Document Server

    Dorfler, Florian

    2011-01-01

    Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different names and as purely theoretic problems in the literature on linear algebra. In this paper we propose a general graph-theoretic f...

  18. Exact outage analysis of the effect of co-channel interference on secured multi-hop relaying networks

    Science.gov (United States)

    Quang Nguyen, Sang; Kong, Hyung Yun

    2016-11-01

    In this article, the presence of multi-hop relaying, eavesdropper and co-channel interference (CCI) in the same system model is investigated. Specifically, the effect of CCI on a secured multi-hop relaying network is studied, in which the source communicates with the destination via multi-relay-hopping under the presence of an eavesdropper and CCI at each node. The optimal relay at each cluster is selected to help forward the message from the source to the destination. We apply two relay selection approaches to such a system model, i.e. the optimal relay is chosen based on (1) the maximum channel gain from the transmitter to all relays in the desired cluster and (2) the minimum channel gain from the eavesdropper to all relays in each cluster. For the performance evaluation and comparison, we derived the exact closed form of the secrecy outage probability of the two approaches. That analysis is verified by Monte Carlo simulation. Finally, the effects of the number of hops, the transmit power at the source, relays and the external sources, the distance between the external sources and each node in the system, and the location of the eavesdropper are presented and discussed.

  19. Non-linear dimensionality reduction of signaling networks

    Directory of Open Access Journals (Sweden)

    Ivakhno Sergii

    2007-06-01

    Full Text Available Abstract Background Systems wide modeling and analysis of signaling networks is essential for understanding complex cellular behaviors, such as the biphasic responses to different combinations of cytokines and growth factors. For example, tumor necrosis factor (TNF can act as a proapoptotic or prosurvival factor depending on its concentration, the current state of signaling network and the presence of other cytokines. To understand combinatorial regulation in such systems, new computational approaches are required that can take into account non-linear interactions in signaling networks and provide tools for clustering, visualization and predictive modeling. Results Here we extended and applied an unsupervised non-linear dimensionality reduction approach, Isomap, to find clusters of similar treatment conditions in two cell signaling networks: (I apoptosis signaling network in human epithelial cancer cells treated with different combinations of TNF, epidermal growth factor (EGF and insulin and (II combination of signal transduction pathways stimulated by 21 different ligands based on AfCS double ligand screen data. For the analysis of the apoptosis signaling network we used the Cytokine compendium dataset where activity and concentration of 19 intracellular signaling molecules were measured to characterise apoptotic response to TNF, EGF and insulin. By projecting the original 19-dimensional space of intracellular signals into a low-dimensional space, Isomap was able to reconstruct clusters corresponding to different cytokine treatments that were identified with graph-based clustering. In comparison, Principal Component Analysis (PCA and Partial Least Squares – Discriminant analysis (PLS-DA were unable to find biologically meaningful clusters. We also showed that by using Isomap components for supervised classification with k-nearest neighbor (k-NN and quadratic discriminant analysis (QDA, apoptosis intensity can be predicted for different

  20. Proposal of interference reduction routing for ad-hoc networks

    Directory of Open Access Journals (Sweden)

    Katsuhiro Naito

    2010-10-01

    Full Text Available In this paper, we propose an interference reduction routing protocol for ad-hoc networks. The interference is one of the degradation factors in wireless communications. In the ad-hoc network, some nodes communicate simultaneously. Therefore, these communications cause interference each other, and some packets are corrupted due to interference from another node. In the proposed protocol, each node estimates required transmission power according to hello messages. Therefore, the node can transmit a data packet with minimum required transmission power. Consequently, the interference against neighbor nodes can be reduced. From simulation results, we can find that the proposed protocol can reduce the number of control messages and can improve the throughput performance.

  1. Proposal of interference reduction routing for ad-hoc networks

    Directory of Open Access Journals (Sweden)

    Katsuhiro Naito

    2010-10-01

    Full Text Available In this paper, we propose an interference reduction routing protocol for ad-hoc networks. The interference is one of the degradation factors in wireless communications. In the ad-hoc network, some nodes communicate simultaneously. Therefore, these communications cause interference each other, and some packets are corrupted due to interference from another node. In the proposed protocol, each node estimates required transmission power according to hello messages. Therefore, the node can transmit a data packet with minimum required transmission power. Consequently, the interference against neighbor nodes can be reduced. From simulation results, we can find that the proposed protocol can reduce the number of control messages and can improve the throughput performance.

  2. Earthquake Risk Reduction to Istanbul Natural Gas Distribution Network

    Science.gov (United States)

    Zulfikar, Can; Kariptas, Cagatay; Biyikoglu, Hikmet; Ozarpa, Cevat

    2017-04-01

    Earthquake Risk Reduction to Istanbul Natural Gas Distribution Network Istanbul Natural Gas Distribution Corporation (IGDAS) is one of the end users of the Istanbul Earthquake Early Warning (EEW) signal. IGDAS, the primary natural gas provider in Istanbul, operates an extensive system 9,867km of gas lines with 750 district regulators and 474,000 service boxes. The natural gas comes to Istanbul city borders with 70bar in 30inch diameter steel pipeline. The gas pressure is reduced to 20bar in RMS stations and distributed to district regulators inside the city. 110 of 750 district regulators are instrumented with strong motion accelerometers in order to cut gas flow during an earthquake event in the case of ground motion parameters exceeds the certain threshold levels. Also, state of-the-art protection systems automatically cut natural gas flow when breaks in the gas pipelines are detected. IGDAS uses a sophisticated SCADA (supervisory control and data acquisition) system to monitor the state-of-health of its pipeline network. This system provides real-time information about quantities related to pipeline monitoring, including input-output pressure, drawing information, positions of station and RTU (remote terminal unit) gates, slum shut mechanism status at 750 district regulator sites. IGDAS Real-time Earthquake Risk Reduction algorithm follows 4 stages as below: 1) Real-time ground motion data transmitted from 110 IGDAS and 110 KOERI (Kandilli Observatory and Earthquake Research Institute) acceleration stations to the IGDAS Scada Center and KOERI data center. 2) During an earthquake event EEW information is sent from IGDAS Scada Center to the IGDAS stations. 3) Automatic Shut-Off is applied at IGDAS district regulators, and calculated parameters are sent from stations to the IGDAS Scada Center and KOERI. 4) Integrated building and gas pipeline damage maps are prepared immediately after the earthquake event. The today's technology allows to rapidly estimate the

  3. Noise reduction facilitated by dosage compensation in gene networks

    Science.gov (United States)

    Peng, Weilin; Song, Ruijie; Acar, Murat

    2016-01-01

    Genetic noise together with genome duplication and volume changes during cell cycle are significant contributors to cell-to-cell heterogeneity. How can cells buffer the effects of these unavoidable epigenetic and genetic variations on phenotypes that are sensitive to such variations? Here we show that a simple network motif that is essential for network-dosage compensation can reduce the effects of extrinsic noise on the network output. Using natural and synthetic gene networks with and without the network motif, we measure gene network activity in single yeast cells and find that the activity of the compensated network is significantly lower in noise compared with the non-compensated network. A mathematical analysis provides intuitive insights into these results and a novel stochastic model tracking cell-volume and cell-cycle predicts the experimental results. Our work implies that noise is a selectable trait tunable by evolution. PMID:27694830

  4. On Efficient Data Reduction for Network Partition Forecasting in WSNs

    Directory of Open Access Journals (Sweden)

    Faisal Karim Shaikh

    2011-04-01

    Full Text Available WSNs (Wireless Sensor Networks are generally deployed for long-lived missions. However, they rely on finite energy resources which lead to network partitioning. Network partitioning limits the dependability of WSN by making relevant spatial regions disconnected thus requiring the maintenance of the network. The network maintenance necessitates early warning and consequently forecasting of the network partitioning such that some early action can be taken to mitigate the problem. There exist approaches allowing for detection of network partitioning but none for its forecasting. We present an efficient approach for a proactive network ParFor (Partition Forecasting based on energy maps. ParFor implements spatial and temporal suppression mechanisms such that from energy weak regions only a few nodes report short alarms to the sink. Using these alarms the forecasting is done centrally at the sink. Using simulations we highlight the efficiency and accuracy of ParFor.

  5. Dimensionality reduction in conic section function neural network

    Indian Academy of Sciences (India)

    Tulay Yildirim; Lale Ozyilmaz

    2002-12-01

    This paper details how dimensionality can be reduced in conic section function neural networks (CSFNN). This is particularly important for hardware implementation of networks. One of the main problems to be solved when considering the hardware design is the high connectivity requirement. If the effect that each of the network inputs has on the network output after training a neural network is known, then some inputs can be removed from the network. Consequently, the dimensionality of the network, and hence, the connectivity and the training time can be reduced. Sensitivity analysis, which extracts the cause and effect relationship between the inputs and outputs of the network, has been proposed as a method to achieve this and is investigated for Iris plant, thyroid disease and ionosphere databases. Simulations demonstrate the validity of the method used.

  6. Exact solutions for social and biological contagion models on mixed directed and undirected, degree-correlated random networks

    CERN Document Server

    Payne, Joshua L; Dodds, Peter Sheridan

    2011-01-01

    We derive analytic expressions for the probability and expected size of global spreading events starting from a single infected seed for a broad collection of contagion processes acting on random networks with both directed and undirected edges and arbitrary degree-degree correlations. Our work extends previous theoretical developments for the undirected case, and we provide numerical support for our findings by investigating an example class of networks for which we are able to obtain closed-form expressions.

  7. Graphical reduction of reaction networks by linear elimination of species

    DEFF Research Database (Denmark)

    Saez Cornellana, Meritxell; Wiuf, Carsten; Feliu, Elisenda

    2017-01-01

    We give a graphically based procedure to reduce a reaction network to a smaller reaction network with fewer species after linear elimination of a set of noninteracting species. We give a description of the reduced reaction network, its kinetics and conservations laws, and explore properties...... of the network and its kinetics. We conclude by comparing our approach to an older similar approach by Temkin and co-workers. Finally, we apply the procedure to biological examples such as substrate mechanisms, post-translational modification systems and networks with intermediates (transient) steps....

  8. On Projection-Based Model Reduction of Biochemical Networks Part I: The Deterministic Case

    OpenAIRE

    Sootla, Aivar; Anderson, James

    2014-01-01

    This paper addresses the problem of model reduction for dynamical system models that describe biochemical reaction networks. Inherent in such models are properties such as stability, positivity and network structure. Ideally these properties should be preserved by model reduction procedures, although traditional projection based approaches struggle to do this. We propose a projection based model reduction algorithm which uses generalised block diagonal Gramians to preserve structure and posit...

  9. Wireless multimedia sensor networks on reconfigurable hardware information reduction techniques

    CERN Document Server

    Ang, Li-minn; Chew, Li Wern; Yeong, Lee Seng; Chia, Wai Chong

    2013-01-01

    Traditional wireless sensor networks (WSNs) capture scalar data such as temperature, vibration, pressure, or humidity. Motivated by the success of WSNs and also with the emergence of new technology in the form of low-cost image sensors, researchers have proposed combining image and audio sensors with WSNs to form wireless multimedia sensor networks (WMSNs).

  10. Exact Determination of Optimal Weights for Fastest Distribution Consensus Algorithm in Star and CCS Networks via SDP

    CERN Document Server

    Jafarizadeh, Saber

    2010-01-01

    Providing an analytical solution for the problem of finding Fastest Distributed Consensus (FDC) is one of the challenging problems in the field of sensor networks. Most of the methods proposed so far deal with the FDC averaging algorithm problem by numerical methods, with convex-optimization techniques and in general no closed-form solution for finding FDC has been offered up to now except in [1] where the conjectured answer for path has been proved. Here in this work we present the analytical solution for the problem of finding FDC by means of semidefinite programming (SDP), for two networks, Star and Complete Cored Star which are containing path as a particular case. Our method in this paper is based on convexity of fastest distributed consensus averaging problem, and we rather allow the networks to have their own symmetric pattern, in order to find the optimal weights. The main idea of the proposed methodology is to solve the slackness conditions to obtain a closed-form expression for the optimal weights, ...

  11. Optimal reconfiguration-based dynamic tariff for congestion management and line loss reduction in distribution networks

    DEFF Research Database (Denmark)

    Huang, Shaojun; Wu, Qiuwei; Cheng, Lin

    2016-01-01

    This paper presents an optimal reconfiguration-based dynamic tariff (DT) method for congestion management and line loss reduction in distribution networks with high penetration of electric vehicles. In the proposed DT concept, feeder reconfiguration (FR) is employed through mixed integer programm......This paper presents an optimal reconfiguration-based dynamic tariff (DT) method for congestion management and line loss reduction in distribution networks with high penetration of electric vehicles. In the proposed DT concept, feeder reconfiguration (FR) is employed through mixed integer...... manner through the DT framework. Three case studies were conducted to validate the optimal reconfiguration-based DT method for congestion management and line loss reduction in distribution networks....

  12. A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods

    Directory of Open Access Journals (Sweden)

    Maaly A. Hassan

    2011-03-01

    Full Text Available The interference imposes a significant negative impact on the performance of wireless networks. With thecontinuous deployment of larger and more sophisticated wireless networks, reducing interference in suchnetworks is quickly being focused upon as a problem in today’s world. In this paper we analyze theinterference reduction problem from a graph theoretical viewpoint. A graph coloring methods areexploited to model the interference reduction problem. However, additional constraints to graph coloringscenarios that account for various networking conditions result in additional complexity to standardgraph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.

  13. Analysis and Reduction of Complex Networks Under Uncertainty.

    Energy Technology Data Exchange (ETDEWEB)

    Ghanem, Roger G [University of Southern California

    2014-07-31

    This effort was a collaboration with Youssef Marzouk of MIT, Omar Knio of Duke University (at the time at Johns Hopkins University) and Habib Najm of Sandia National Laboratories. The objective of this effort was to develop the mathematical and algorithmic capacity to analyze complex networks under uncertainty. Of interest were chemical reaction networks and smart grid networks. The statements of work for USC focused on the development of stochastic reduced models for uncertain networks. The USC team was led by Professor Roger Ghanem and consisted of one graduate student and a postdoc. The contributions completed by the USC team consisted of 1) methodology and algorithms to address the eigenvalue problem, a problem of significance in the stability of networks under stochastic perturbations, 2) methodology and algorithms to characterize probability measures on graph structures with random flows. This is an important problem in characterizing random demand (encountered in smart grid) and random degradation (encountered in infrastructure systems), as well as modeling errors in Markov Chains (with ubiquitous relevance !). 3) methodology and algorithms for treating inequalities in uncertain systems. This is an important problem in the context of models for material failure and network flows under uncertainty where conditions of failure or flow are described in the form of inequalities between the state variables.

  14. Congestion Reduction Using Ad hoc Message Dissemination in Vehicular Networks

    CERN Document Server

    Hewer, Thomas D

    2008-01-01

    Vehicle-to-vehicle communications can be used effectively for intelligent transport systems (ITS) and location-aware services. The ability to disseminate information in an ad-hoc fashion allows pertinent information to propagate faster through the network. In the realm of ITS, the ability to spread warning information faster and further is of great advantage to the receivers of this information. In this paper we propose and present a message-dissemination procedure that uses vehicular wireless protocols for influencing traffic flow, reducing congestion in road networks. The computational experiments presented in this paper show how an intelligent driver model (IDM) and car-following model can be adapted to 'react' to the reception of information. This model also presents the advantages of coupling together traffic modelling tools and network simulation tools.

  15. Novel Online Dimensionality Reduction Method with Improved Topology Representing and Radial Basis Function Networks.

    Science.gov (United States)

    Ni, Shengqiao; Lv, Jiancheng; Cheng, Zhehao; Li, Mao

    2015-01-01

    This paper presents improvements to the conventional Topology Representing Network to build more appropriate topology relationships. Based on this improved Topology Representing Network, we propose a novel method for online dimensionality reduction that integrates the improved Topology Representing Network and Radial Basis Function Network. This method can find meaningful low-dimensional feature structures embedded in high-dimensional original data space, process nonlinear embedded manifolds, and map the new data online. Furthermore, this method can deal with large datasets for the benefit of improved Topology Representing Network. Experiments illustrate the effectiveness of the proposed method.

  16. Novel Online Dimensionality Reduction Method with Improved Topology Representing and Radial Basis Function Networks.

    Directory of Open Access Journals (Sweden)

    Shengqiao Ni

    Full Text Available This paper presents improvements to the conventional Topology Representing Network to build more appropriate topology relationships. Based on this improved Topology Representing Network, we propose a novel method for online dimensionality reduction that integrates the improved Topology Representing Network and Radial Basis Function Network. This method can find meaningful low-dimensional feature structures embedded in high-dimensional original data space, process nonlinear embedded manifolds, and map the new data online. Furthermore, this method can deal with large datasets for the benefit of improved Topology Representing Network. Experiments illustrate the effectiveness of the proposed method.

  17. MIDER: network inference with mutual information distance and entropy reduction.

    Directory of Open Access Journals (Sweden)

    Alejandro F Villaverde

    Full Text Available The prediction of links among variables from a given dataset is a task referred to as network inference or reverse engineering. It is an open problem in bioinformatics and systems biology, as well as in other areas of science. Information theory, which uses concepts such as mutual information, provides a rigorous framework for addressing it. While a number of information-theoretic methods are already available, most of them focus on a particular type of problem, introducing assumptions that limit their generality. Furthermore, many of these methods lack a publicly available implementation. Here we present MIDER, a method for inferring network structures with information theoretic concepts. It consists of two steps: first, it provides a representation of the network in which the distance among nodes indicates their statistical closeness. Second, it refines the prediction of the existing links to distinguish between direct and indirect interactions and to assign directionality. The method accepts as input time-series data related to some quantitative features of the network nodes (such as e.g. concentrations, if the nodes are chemical species. It takes into account time delays between variables, and allows choosing among several definitions and normalizations of mutual information. It is general purpose: it may be applied to any type of network, cellular or otherwise. A Matlab implementation including source code and data is freely available (http://www.iim.csic.es/~gingproc/mider.html. The performance of MIDER has been evaluated on seven different benchmark problems that cover the main types of cellular networks, including metabolic, gene regulatory, and signaling. Comparisons with state of the art information-theoretic methods have demonstrated the competitive performance of MIDER, as well as its versatility. Its use does not demand any a priori knowledge from the user; the default settings and the adaptive nature of the method provide good

  18. MIDER: network inference with mutual information distance and entropy reduction.

    Science.gov (United States)

    Villaverde, Alejandro F; Ross, John; Morán, Federico; Banga, Julio R

    2014-01-01

    The prediction of links among variables from a given dataset is a task referred to as network inference or reverse engineering. It is an open problem in bioinformatics and systems biology, as well as in other areas of science. Information theory, which uses concepts such as mutual information, provides a rigorous framework for addressing it. While a number of information-theoretic methods are already available, most of them focus on a particular type of problem, introducing assumptions that limit their generality. Furthermore, many of these methods lack a publicly available implementation. Here we present MIDER, a method for inferring network structures with information theoretic concepts. It consists of two steps: first, it provides a representation of the network in which the distance among nodes indicates their statistical closeness. Second, it refines the prediction of the existing links to distinguish between direct and indirect interactions and to assign directionality. The method accepts as input time-series data related to some quantitative features of the network nodes (such as e.g. concentrations, if the nodes are chemical species). It takes into account time delays between variables, and allows choosing among several definitions and normalizations of mutual information. It is general purpose: it may be applied to any type of network, cellular or otherwise. A Matlab implementation including source code and data is freely available (http://www.iim.csic.es/~gingproc/mider.html). The performance of MIDER has been evaluated on seven different benchmark problems that cover the main types of cellular networks, including metabolic, gene regulatory, and signaling. Comparisons with state of the art information-theoretic methods have demonstrated the competitive performance of MIDER, as well as its versatility. Its use does not demand any a priori knowledge from the user; the default settings and the adaptive nature of the method provide good results for a wide

  19. Artificial Neural Network in Harmonic Reduction of STATCOM

    Institute of Scientific and Technical Information of China (English)

    Li Hongmei; Li Zhenran; Zheng Peiying

    2005-01-01

    To eliminate harmonic pollution incurred from the static synchronous compensator(STATCOM), a method of applying artificial neural network is presented. When PWM wave is formed based on the harmonic suppression theory, a concave is set on certain angle of the square wave to suppress unnecessary harmonics, by timely and on-line determining the chopping angle corresponding to respective harmonics through artificial neural network, i.e. by setting the position of concave to eliminate corresponding harmonics, the harmonic component on output voltage of the inverter can be improved. To conclude through computer simulation test, the perfect control effect has been proved.

  20. A network traffic reduction method for cooperative positioning

    NARCIS (Netherlands)

    Das, Kallol; Wymeersch, Henk

    2011-01-01

    Cooperative positioning is suitable for applications where conventional positioning fails due to lack of connectivity with a sufficient number of reference nodes. In a dense network, as the number of cooperating devices increases, the number of packet exchanges also increases proportionally. This ca

  1. Getting acquainted through social networking sites: testing a model of online uncertainty reduction and social attraction

    NARCIS (Netherlands)

    Antheunis, M.L.; Valkenburg, P.M.; Peter, J.

    2010-01-01

    The first aim of this study was to examine which uncertainty reduction strategies members of social network sites used to gain information about a person who they had recently met online. The second aim was to investigate whether and how these uncertainty reduction strategies resulted in social attr

  2. Getting acquainted through social networking sites: Testing a model of online uncertainty reduction and social attraction

    NARCIS (Netherlands)

    Antheunis, M.L.; Valkenburg, P.M.; Peter, J.

    2008-01-01

    The first aim of this study was to examine which uncertainty reduction strategies members of social networking sites used to gain information about a person who they had recently met online. The second aim was to investigate whether and how these uncertainty reduction strategies resulted in social a

  3. Beyond a complete failure: The impact of partial capacity reductions on public transport network vulnerability

    NARCIS (Netherlands)

    Cats, O.; Jenelius, E.

    2015-01-01

    Disruptions often result with partial capacity reduction without resulting with a complete breakdown. This study aims to move beyond the analysis of complete failure by investigating the impacts of partial capacity reduction on public transport network performance. We analyse the relation between th

  4. 雷达组网的精确极大似然误差配准算法%An Exact Maximum Likelihood Error Registration Algorithm for Radar Network

    Institute of Scientific and Technical Information of China (English)

    丰昌政; 薛强

    2012-01-01

    针对最小二乘法和卡尔曼滤波方法在雷达网系统中的误差配准问题,提出一种雷达组网的精确极大似然误差配准算法.采用基于圆极投影的极大似然配准算法,利用各雷达站的几何关系,通过极大似然混合高斯-牛顿迭代方法估计出雷达网的系统误差,并进行仿真.仿真结果证明:该配准方法具有良好的一致性,可以用于多雷达组网的误差配准.%For the least square method and Caiman filter method in radar network system's error registration problems, put forward a kind of radar netting exact maximum likelihood error registration algorithm. Using maximum likelihood registration algorithm based on circular polar projection, according to the radar station geometric relationship, to estimate the error of radar network system by maximum likelihood mixed Gauss-Newton iterative method, and carried out a simulation. The simulation results show that the algorithm has good compatibility, can be used for multi radar netted registration.

  5. Structure-preserving model reduction of large-scale logistics networks. Applications for supply chains

    Science.gov (United States)

    Scholz-Reiter, B.; Wirth, F.; Dashkovskiy, S.; Makuschewitz, T.; Schönlein, M.; Kosmykov, M.

    2011-12-01

    We investigate the problem of model reduction with a view to large-scale logistics networks, specifically supply chains. Such networks are modeled by means of graphs, which describe the structure of material flow. An aim of the proposed model reduction procedure is to preserve important features within the network. As a new methodology we introduce the LogRank as a measure for the importance of locations, which is based on the structure of the flows within the network. We argue that these properties reflect relative importance of locations. Based on the LogRank we identify subgraphs of the network that can be neglected or aggregated. The effect of this is discussed for a few motifs. Using this approach we present a meta algorithm for structure-preserving model reduction that can be adapted to different mathematical modeling frameworks. The capabilities of the approach are demonstrated with a test case, where a logistics network is modeled as a Jackson network, i.e., a particular type of queueing network.

  6. Blind Separation by Redundancy Reduction in a Recurrent Neural Network

    Institute of Scientific and Technical Information of China (English)

    LIU Ju; NIE Kaibao; HE Zhenya

    2001-01-01

    In this paper, a novel information the-ory criterion is proposed for blind source separationbased on a fully recurrent neural network, and a learn-ing algorithm is then developed. Stochastic naturalgradient descent algorithm is used in this algorithm.The proposed algorithm can ensure the maximizationof transferred information when a Hebb term is intro-duced to express the derivative of information missing.At the same time, the mutual information of outputs isminimized so as to make the outputs mutually statis-tically independent. The computer simulation showsthe validity and the good performance of the proposedalgorithm.

  7. Neural Network Target Identification System for False Alarm Reduction

    Science.gov (United States)

    Ye, David; Edens, Weston; Lu, Thomas T.; Chao, Tien-Hsin

    2009-01-01

    A multi-stage automated target recognition (ATR) system has been designed to perform computer vision tasks with adequate proficiency in mimicking human vision. The system is able to detect, identify, and track targets of interest. Potential regions of interest (ROIs) are first identified by the detection stage using an Optimum Trade-off Maximum Average Correlation Height (OT-MACH) filter combined with a wavelet transform. False positives are then eliminated by the verification stage using feature extraction methods in conjunction with neural networks. Feature extraction transforms the ROIs using filtering and binning algorithms to create feature vectors. A feed forward back propagation neural network (NN) is then trained to classify each feature vector and remove false positives. This paper discusses the test of the system performance and parameter optimizations process which adapts the system to various targets and datasets. The test results show that the system was successful in substantially reducing the false positive rate when tested on a sonar image dataset.

  8. Neural Network Target Identification System for False Alarm Reduction

    Science.gov (United States)

    Ye, David; Edens, Weston; Lu, Thomas T.; Chao, Tien-Hsin

    2009-01-01

    A multi-stage automated target recognition (ATR) system has been designed to perform computer vision tasks with adequate proficiency in mimicking human vision. The system is able to detect, identify, and track targets of interest. Potential regions of interest (ROIs) are first identified by the detection stage using an Optimum Trade-off Maximum Average Correlation Height (OT-MACH) filter combined with a wavelet transform. False positives are then eliminated by the verification stage using feature extraction methods in conjunction with neural networks. Feature extraction transforms the ROIs using filtering and binning algorithms to create feature vectors. A feed forward back propagation neural network (NN) is then trained to classify each feature vector and remove false positives. This paper discusses the test of the system performance and parameter optimizations process which adapts the system to various targets and datasets. The test results show that the system was successful in substantially reducing the false positive rate when tested on a sonar image dataset.

  9. Scaling Properties of Dimensionality Reduction for Neural Populations and Network Models.

    Directory of Open Access Journals (Sweden)

    Ryan C Williamson

    2016-12-01

    Full Text Available Recent studies have applied dimensionality reduction methods to understand how the multi-dimensional structure of neural population activity gives rise to brain function. It is unclear, however, how the results obtained from dimensionality reduction generalize to recordings with larger numbers of neurons and trials or how these results relate to the underlying network structure. We address these questions by applying factor analysis to recordings in the visual cortex of non-human primates and to spiking network models that self-generate irregular activity through a balance of excitation and inhibition. We compared the scaling trends of two key outputs of dimensionality reduction-shared dimensionality and percent shared variance-with neuron and trial count. We found that the scaling properties of networks with non-clustered and clustered connectivity differed, and that the in vivo recordings were more consistent with the clustered network. Furthermore, recordings from tens of neurons were sufficient to identify the dominant modes of shared variability that generalize to larger portions of the network. These findings can help guide the interpretation of dimensionality reduction outputs in regimes of limited neuron and trial sampling and help relate these outputs to the underlying network structure.

  10. Dropping Probability Reduction in OBS Networks: A Simple Approach

    KAUST Repository

    Elrasad, Amr

    2016-08-01

    In this paper, we propose and derive a slotted-time model for analyzing the burst blocking probability in Optical Burst Switched (OBS) networks. We evaluated the immediate and delayed signaling reservation schemes. The proposed model compares the performance of both just-in-time (JIT) and just-enough-time (JET) signaling protocols associated with of void/non-void filling link scheduling schemes. It also considers none and limited range wavelength conversions scenarios. Our model is distinguished by being adaptable to different offset-time and burst length distributions. We observed that applying a limited range of wavelength conversion, burst blocking probability is reduced by several orders of magnitudes and yields a better burst delivery ratio compared with full wavelength conversion.

  11. Adaptively biased sequential importance sampling for rare events in reaction networks with comparison to exact solutions from finite buffer dCME method.

    Science.gov (United States)

    Cao, Youfang; Liang, Jie

    2013-07-14

    Critical events that occur rarely in biological processes are of great importance, but are challenging to study using Monte Carlo simulation. By introducing biases to reaction selection and reaction rates, weighted stochastic simulation algorithms based on importance sampling allow rare events to be sampled more effectively. However, existing methods do not address the important issue of barrier crossing, which often arises from multistable networks and systems with complex probability landscape. In addition, the proliferation of parameters and the associated computing cost pose significant problems. Here we introduce a general theoretical framework for obtaining optimized biases in sampling individual reactions for estimating probabilities of rare events. We further describe a practical algorithm called adaptively biased sequential importance sampling (ABSIS) method for efficient probability estimation. By adopting a look-ahead strategy and by enumerating short paths from the current state, we estimate the reaction-specific and state-specific forward and backward moving probabilities of the system, which are then used to bias reaction selections. The ABSIS algorithm can automatically detect barrier-crossing regions, and can adjust bias adaptively at different steps of the sampling process, with bias determined by the outcome of exhaustively generated short paths. In addition, there are only two bias parameters to be determined, regardless of the number of the reactions and the complexity of the network. We have applied the ABSIS method to four biochemical networks: the birth-death process, the reversible isomerization, the bistable Schlögl model, and the enzymatic futile cycle model. For comparison, we have also applied the finite buffer discrete chemical master equation (dCME) method recently developed to obtain exact numerical solutions of the underlying discrete chemical master equations of these problems. This allows us to assess sampling results objectively

  12. 广义 MKP 方程的对称约化和精确解%Symmetry Reductions and Exact Solutions of the Generalized MKP Equation

    Institute of Scientific and Technical Information of China (English)

    李康; 刘洪吉

    2015-01-01

    利用对称方法求出了广义M KP方程的对称,基于求得的对称与原方程相容,求出了广义M KP方程的一些精确解,包括雅可比椭圆函数解、三角函数解、双曲函数解、有理数解、多项式解等。%By applying the direct symmetry method ,we get the symmetry of generalized MKP equa‐tion .Based on the compatibility of the symmetry and the generalized MKP equation ,we find some exact solutions of the generalized MKP equation ,which include the Jacobi elliptic function solution ,the trigo‐nometric function solution ,the hyperbolic functions solution ,the rational solution ,the polynomial solu‐tion and so on .

  13. Reduction of analytical thermal models and their development in the form of networks

    Science.gov (United States)

    Trigeol, J.-F.; Soulier, F.; Lagonotte, P.

    2002-11-01

    The aim of model reduction is to obtain the simplest model while reflecting as far as possible the dynamic behaviour of a system. First, we present the reduction method based on a complex admittance matrix [Y(s)] of the whole initial model. From which we obtain by two inversions, the matrix [Y_red(s)], which can be interpreted as a reduced network. We give an example of application of the numeric reduction method. The same method is applied with success to analytical expression of impedances kept from the quadrupole representation of heat conduction. In order to simulate easily the transient responses of analytical models, we present the development of analytical impedance in the form of an equivalent network, which is proved to be very efficient during simulations. The first application is done with a heterogeneous system made of two bars of different materials, one is made of copper and the other is made of steel. The second application is done with a more complex thermal system constituting a cooler with 7 branches. This cooler is reduced to 1, 2 and 3 nodes to obtain the simplest model while reflecting as far as possible the dynamic behaviour. This document presents a generalisation of the method of network reduction in the case where the models' impedances have analytical expressions. In this case, we show that contrary to the numerical reduction, which approximates admittances to the first order, we are free to choose the model order, whatever the kept nodes, in such a manner that the model's bandwidth is considered as sufficient. The resulting equivalent networks allow easy simulations of the transient responses thanks to standard electric network softwares. Beyond the dealt examples of analytical reduction, for industrial systems non analytically calculable but governed by an equation of heat diffusion, the structures (topologies) of the reduced models would be the same. That opens prospects to obtain thermal reduced models from an automated networking

  14. Delivery Time Reduction for Order-Constrained Applications using Binary Network Codes

    OpenAIRE

    Douik, Ahmed; Karim, Mohammad S.; Sadeghi, Parastoo; Sorour, Sameh

    2016-01-01

    Consider a radio access network wherein a base-station is required to deliver a set of order-constrained messages to a set of users over independent erasure channels. This paper studies the delivery time reduction problem using instantly decodable network coding (IDNC). Motivated by time-critical and order-constrained applications, the delivery time is defined, at each transmission, as the number of undelivered messages. The delivery time minimization problem being computationally intractable...

  15. Up to what point is loss reduction environmentally friendly?: The LCA of loss reduction scenarios in drinking water networks.

    Science.gov (United States)

    Pillot, Julie; Catel, Laureline; Renaud, Eddy; Augeard, Bénédicte; Roux, Philippe

    2016-11-01

    In a context of increasing water shortage all over the world, water utilities must minimise losses in their distribution networks and draw up water loss reduction action plans. While leak reduction is clearly an important part of sustainable water management, its impacts have to be reconsidered in a broader objective of environmental protection than strictly the avoided losses in cubic metres of water. Reducing the volume of water abstracted reduces also environmental impacts associated to water production (the operation and infrastructure needed for abstraction, treatment, supply). In the mean time, activities for reducing water losses generate their own environmental impacts, notably as a result of the work, equipment, and infrastructures used for this purpose. In this study, Life Cycle Assessment (LCA) was used to assess and compare two sets of environmental impacts: those resulting from the production and supply of water which will never reach subscribers, and those caused by water loss reduction activities. This information can then be used to establish whether or not there is a point beyond which loss reduction is no longer effective in reducing the environmental impacts of drinking water supply. Results show that the improvement actions that start from a low water supply efficiency are clearly beneficial for ecosystems, human health and preservation of resources. When seeking to improve the efficiency beyond certain values (about 65%), the uncertainty makes it impossible to conclude for an environmental benefit on all impact categories.

  16. Minimal Exact Balancedness

    NARCIS (Netherlands)

    Lohmann, E.R.M.A.; Borm, P.E.M.; Herings, P.J.J.

    2011-01-01

    To verify whether a transferable utility game is exact, one has to check a linear inequality for each exact balanced collection of coalitions. This paper studies the structure and properties of the class of exact balanced collections. Comparing the definition of exact balanced collections with the

  17. Introducing network Gramians to undirected network systems for structure-preserving model reduction

    NARCIS (Netherlands)

    Cheng, Xiaodong; Scherpen, Jacquelien M.A.

    2016-01-01

    In this paper, we propose the notion of controllability Gramian for linear network systems. In contrast to the conventional Gramians defined for asymptotically stable systems, the new Gramian is generalized to semi-stable systems and can be computed for network systems with imaginary axis poles. We

  18. Model reduction of second-order network systems using graph clustering

    NARCIS (Netherlands)

    Cheng, Xiaodong; Scherpen, Jacquelien M.A.; Kawano, Yu

    2016-01-01

    A general framework is proposed for structure-preserving model reduction of a second-order network system. The method is based on graph clustering, and a recursive algorithm is proposed to find an appropriate clustering. Behaviors of nodes are interpreted by transfer functions, and the similarities

  19. Mobile sensor network noise reduction and recalibration using a Bayesian network

    Science.gov (United States)

    Xiang, Y.; Tang, Y.; Zhu, W.

    2016-02-01

    People are becoming increasingly interested in mobile air quality sensor network applications. By eliminating the inaccuracies caused by spatial and temporal heterogeneity of pollutant distributions, this method shows great potential for atmospheric research. However, systems based on low-cost air quality sensors often suffer from sensor noise and drift. For the sensing systems to operate stably and reliably in real-world applications, those problems must be addressed. In this work, we exploit the correlation of different types of sensors caused by cross sensitivity to help identify and correct the outlier readings. By employing a Bayesian network based system, we are able to recover the erroneous readings and recalibrate the drifted sensors simultaneously. Our method improves upon the state-of-art Bayesian belief network techniques by incorporating the virtual evidence and adjusting the sensor calibration functions recursively.Specifically, we have (1) designed a system based on the Bayesian belief network to detect and recover the abnormal readings, (2) developed methods to update the sensor calibration functions infield without requirement of ground truth, and (3) extended the Bayesian network with virtual evidence for infield sensor recalibration. To validate our technique, we have tested our technique with metal oxide sensors measuring NO2, CO, and O3 in a real-world deployment. Compared with the existing Bayesian belief network techniques, results based on our experiment setup demonstrate that our system can reduce error by 34.1 % and recover 4 times more data on average.

  20. Social networking technology, social network composition, and reductions in substance use among homeless adolescents.

    Science.gov (United States)

    Rice, Eric; Milburn, Norweeta G; Monro, William

    2011-03-01

    Peer-based prevention programs for homeless youth are complicated by the potential for reinforcing high-risk behaviors among participants. The goal of this study is to understand how homeless youth could be linked to positive peers in prevention programming by understanding where in social and physical space positive peers for homeless youth are located, how these ties are associated with substance use, and the role of social networking technologies (e.g., internet and cell phones) in this process. Personal social network data were collected from 136 homeless adolescents in Los Angeles, CA. Respondents reported on composition of their social networks with respect to: home-based peers and parents (accessed via social networking technology; e.g., the internet, cell phone, texting), homeless peers and agency staff (accessed face-to-face) and whether or not network members were substance-using or non-substance-using. Associations between respondent's lifetime cocaine, heroin, and methamphetamine use and recent (previous 30 days) alcohol and marijuana use were assessed by the number of non-substance-using versus substance-using ties in multivariate linear regression models. 43% of adolescents reported a non-substance-using home-based tie. More of these ties were associated with less recent alcohol use. 62% of adolescents reported a substance-using homeless tie. More of these ties were associated with more recent marijuana use as well as more lifetime heroin and methamphetamine use. For homeless youth, who are physically disconnected from positive peers, social networking technologies can be used to facilitate the sorts of positive social ties that effective peer-based prevention programs require.

  1. A Dimensionality Reduction Framework for Detection of Multiscale Structure in Heterogeneous Networks

    Institute of Scientific and Technical Information of China (English)

    Hua-Wei Shen; Xue-Qi Cheng; Yuan-Zhuo Wang; Yi-xin Chen

    2012-01-01

    Graph clustering has been widely applied in exploring regularities emerging in relational data.Recently,the rapid development of network theory correlates graph clustering with the detection of community structure,a common and important topological characteristic of networks.Most existing methods investigate the community structure at a single topological scale.However,as shown by empirical studies,the community structure of real world networks often exhibits multiple topological descriptions,corresponding to the clustering at different resolutions.Furthermore,the detection of multiscale community structure is heavily affected by the heterogeneous distribution of node degree.It is very challenging to detect multiscale community structure in heterogeneous networks.In this paper,we propose a novel,unified framework for detecting community structure from the perspective of dimensionality reduction.Based on the framework,we first prove that the well-known Laplacian matrix for network partition and the widely-used modularity matrix for community detection are two kinds of covariaace matrices used in dimensionality reduction. We then propose a novel method to detect communities at multiple topological scales within our framework.We further show that existing algorithms fail to deal with heterogeneous node degrees.We develop a novel method to handle heterogeneity of networks by introducing a rescaling transformation into the covariance matrices in our framework.Extensive tests on real world and artificial networks demonstrate that the proposed correlation matrices significantly outperform Laplacian and modularity matrices in terms of their ability to identify multiscale community structure in heterogeneous networks.

  2. Formation of a Network Structure in the Gaseous Reduction of Magnetite Doped with Alumina

    Science.gov (United States)

    Kapelyushin, Yury; Sasaki, Yasushi; Zhang, Jianqiang; Jeong, Sunkwang; Ostrovski, Oleg

    2017-04-01

    Reduction of un-doped magnetite is developed topochemically with the formation of a dense iron shell. However, the reduction of alumina-doped magnetite to wüstite proceeds with the formation of a network-like structure which consists of criss-crossed horizontal and vertical plates of wüstite. Reduction of magnetite includes the conversion of Fe3+ to Fe2+ and the movement of iron cations from the tetrahedral sites on the {400} and {220} planes of magnetite to the octahedral sites on the {200} planes of wüstite. Alumina has a negligibly small solubility in wüstite. In the reduction of magnetite doped with Al2O3, rejected Al3+ cations from wüstite diffuse to the magnetite-hercynite solid solution. Enrichment of the Fe3O4-FeAl2O4 solution with alumina in the vicinity of the reduction interface restricts the growth of {220} planes of wüstite and nucleation of {220} planes adjusted to the existing planes, preventing the merging of wüstite plates during the reduction process. Reduction of magnetite from the magnetite-hercynite solid solution practically stops when the Al3+ content at the interface approaches the solubility limit. Wüstite in the separated plates is reduced further to iron.

  3. Formation of a Network Structure in the Gaseous Reduction of Magnetite Doped with Alumina

    Science.gov (United States)

    Kapelyushin, Yury; Sasaki, Yasushi; Zhang, Jianqiang; Jeong, Sunkwang; Ostrovski, Oleg

    2017-01-01

    Reduction of un-doped magnetite is developed topochemically with the formation of a dense iron shell. However, the reduction of alumina-doped magnetite to wüstite proceeds with the formation of a network-like structure which consists of criss-crossed horizontal and vertical plates of wüstite. Reduction of magnetite includes the conversion of Fe3+ to Fe2+ and the movement of iron cations from the tetrahedral sites on the {400} and {220} planes of magnetite to the octahedral sites on the {200} planes of wüstite. Alumina has a negligibly small solubility in wüstite. In the reduction of magnetite doped with Al2O3, rejected Al3+ cations from wüstite diffuse to the magnetite-hercynite solid solution. Enrichment of the Fe3O4-FeAl2O4 solution with alumina in the vicinity of the reduction interface restricts the growth of {220} planes of wüstite and nucleation of {220} planes adjusted to the existing planes, preventing the merging of wüstite plates during the reduction process. Reduction of magnetite from the magnetite-hercynite solid solution practically stops when the Al3+ content at the interface approaches the solubility limit. Wüstite in the separated plates is reduced further to iron.

  4. Combining in silico evolution and nonlinear dimensionality reduction to redesign responses of signaling networks

    Science.gov (United States)

    Prescott, Aaron M.; Abel, Steven M.

    2016-12-01

    The rational design of network behavior is a central goal of synthetic biology. Here, we combine in silico evolution with nonlinear dimensionality reduction to redesign the responses of fixed-topology signaling networks and to characterize sets of kinetic parameters that underlie various input-output relations. We first consider the earliest part of the T cell receptor (TCR) signaling network and demonstrate that it can produce a variety of input-output relations (quantified as the level of TCR phosphorylation as a function of the characteristic TCR binding time). We utilize an evolutionary algorithm (EA) to identify sets of kinetic parameters that give rise to: (i) sigmoidal responses with the activation threshold varied over 6 orders of magnitude, (ii) a graded response, and (iii) an inverted response in which short TCR binding times lead to activation. We also consider a network with both positive and negative feedback and use the EA to evolve oscillatory responses with different periods in response to a change in input. For each targeted input-output relation, we conduct many independent runs of the EA and use nonlinear dimensionality reduction to embed the resulting data for each network in two dimensions. We then partition the results into groups and characterize constraints placed on the parameters by the different targeted response curves. Our approach provides a way (i) to guide the design of kinetic parameters of fixed-topology networks to generate novel input-output relations and (ii) to constrain ranges of biological parameters using experimental data. In the cases considered, the network topologies exhibit significant flexibility in generating alternative responses, with distinct patterns of kinetic rates emerging for different targeted responses.

  5. The ART of representation: Memory reduction and noise tolerance in a neural network vision system

    Science.gov (United States)

    Langley, Christopher S.

    The Feature Cerebellar Model Arithmetic Computer (FCMAC) is a multiple-input-single-output neural network that can provide three-degree-of-freedom (3-DOF) pose estimation for a robotic vision system. The FCMAC provides sufficient accuracy to enable a manipulator to grasp an object from an arbitrary pose within its workspace. The network learns an appearance-based representation of an object by storing coarsely quantized feature patterns. As all unique patterns are encoded, the network size grows uncontrollably. A new architecture is introduced herein, which combines the FCMAC with an Adaptive Resonance Theory (ART) network. The ART module categorizes patterns observed during training into a set of prototypes that are used to build the FCMAC. As a result, the network no longer grows without bound, but constrains itself to a user-specified size. Pose estimates remain accurate since the ART layer tends to discard the least relevant information first. The smaller network performs recall faster, and in some cases is better for generalization, resulting in a reduction of error at recall time. The ART-Under-Constraint (ART-C) algorithm is extended to include initial filling with randomly selected patterns (referred to as ART-F). In experiments using a real-world data set, the new network performed equally well using less than one tenth the number of coarse patterns as a regular FCMAC. The FCMAC is also extended to include real-valued input activations. As a result, the network can be tuned to reject a variety of types of noise in the image feature detection. A quantitative analysis of noise tolerance was performed using four synthetic noise algorithms, and a qualitative investigation was made using noisy real-world image data. In validation experiments, the FCMAC system outperformed Radial Basis Function (RBF) networks for the 3-DOF problem, and had accuracy comparable to that of Principal Component Analysis (PCA) and superior to that of Shape Context Matching (SCM), both

  6. Education as networking: Rethinking the success of the harm reduction policy of Taiwan.

    Science.gov (United States)

    Chen, Jia-shin

    2015-05-01

    The harm reduction policy of Taiwan has been considered a success. However, the HIV incidence among injection drug users declined before the nationwide needle and syringe program and drug substitution treatments were implemented. Thus, other factors in the policy might have contributed to its success. Some authors have suggested that education may have played a pivotal part. In this research, the purported significance of education in the success of the policy is conceptualized by reviewing the studies on harm reduction in Taiwan and reflecting upon my own fieldwork. Moreover, relevant literature is used as reference to reformulate this notion of education. This article shows that harm reduction education may be conducted in numerous forms, most of which are non-formal, improvisational, and contingent. Non-governmental organizations may play a role, but more actors, strategies, infrastructures, and interactions should be considered. This article draws from actor-network theory and refines the current thesis that attributes the policy success to education by utilizing three reflections, namely, appreciating materiality and spatiality, recognizing covert actors in the networking, and treating education as an outcome rather than a means. In conclusion, looking at education as a form of networking offers theoretical insight that increases understanding of its participants, mechanisms, processes, and permutations. © The Author(s) 2014.

  7. A Geometric Method for Model Reduction of Biochemical Networks with Polynomial Rate Functions.

    Science.gov (United States)

    Samal, Satya Swarup; Grigoriev, Dima; Fröhlich, Holger; Weber, Andreas; Radulescu, Ovidiu

    2015-12-01

    Model reduction of biochemical networks relies on the knowledge of slow and fast variables. We provide a geometric method, based on the Newton polytope, to identify slow variables of a biochemical network with polynomial rate functions. The gist of the method is the notion of tropical equilibration that provides approximate descriptions of slow invariant manifolds. Compared to extant numerical algorithms such as the intrinsic low-dimensional manifold method, our approach is symbolic and utilizes orders of magnitude instead of precise values of the model parameters. Application of this method to a large collection of biochemical network models supports the idea that the number of dynamical variables in minimal models of cell physiology can be small, in spite of the large number of molecular regulatory actors.

  8. Efficient hierarchical analysis of the stability of a network through dimensional reduction of its influence topology

    CERN Document Server

    Kinkhabwala, Ali

    2013-01-01

    The connection between network topology and stability remains unclear. General approaches that clarify this relationship and allow for more efficient stability analysis would be desirable. In this manuscript, I examine the mathematical notion of influence topology, which is fundamentally based on the network reaction stoichiometries and the first derivatives of the reactions with respect to each species at the steady state solution(s). The influence topology is naturally represented as a signed directed bipartite graph with arrows or blunt arrows connecting a species node to a reaction node (positive/negative derivative) or a reaction node to a species node (positive/negative stoichiometry). The set of all such graphs is denumerable. A significant reduction in dimensionality is possible through stoichiometric scaling, cycle compaction, and temporal scaling. All cycles in a network can be read directly from the graph of its influence topology, enabling efficient and intuitive computation of the principal minor...

  9. Modeling the Metabolism of Arabidopsis thaliana: Application of Network Decomposition and Network Reduction in the Context of Petri Nets

    Directory of Open Access Journals (Sweden)

    Ina Koch

    2017-06-01

    Full Text Available Motivation:Arabidopsis thaliana is a well-established model system for the analysis of the basic physiological and metabolic pathways of plants. Nevertheless, the system is not yet fully understood, although many mechanisms are described, and information for many processes exists. However, the combination and interpretation of the large amount of biological data remain a big challenge, not only because data sets for metabolic paths are still incomplete. Moreover, they are often inconsistent, because they are coming from different experiments of various scales, regarding, for example, accuracy and/or significance. Here, theoretical modeling is powerful to formulate hypotheses for pathways and the dynamics of the metabolism, even if the biological data are incomplete. To develop reliable mathematical models they have to be proven for consistency. This is still a challenging task because many verification techniques fail already for middle-sized models. Consequently, new methods, like decomposition methods or reduction approaches, are developed to circumvent this problem.Methods: We present a new semi-quantitative mathematical model of the metabolism of Arabidopsis thaliana. We used the Petri net formalism to express the complex reaction system in a mathematically unique manner. To verify the model for correctness and consistency we applied concepts of network decomposition and network reduction such as transition invariants, common transition pairs, and invariant transition pairs.Results: We formulated the core metabolism of Arabidopsis thaliana based on recent knowledge from literature, including the Calvin cycle, glycolysis and citric acid cycle, glyoxylate cycle, urea cycle, sucrose synthesis, and the starch metabolism. By applying network decomposition and reduction techniques at steady-state conditions, we suggest a straightforward mathematical modeling process. We demonstrate that potential steady-state pathways exist, which provide the

  10. Loss Reduction in Heavy Loaded Distribution Networks Using Cyclic Sub Tree Search

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Sang-Yule; Shin, Myong-Chul [Sungkyunkwan University, Seoul (Korea)

    2001-05-01

    Network reconfiguration in distribution systems is realized by changing the status of sectionalizing switches, and is usually done for loss reduction or load balancing in the system. This paper presents an effective heuristic based switching scheme to solve the distribution feeder loss reduction problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to apply a proposed technique called cyclic best first search, the proposed algorithm identify the most effective the set of switch status configuration of distribution system for loss reduction. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32, 69 bus system models (author). 17 refs., 10 figs., 2 tabs.

  11. Artificial Neural Network-Based Clutter Reduction Systems for Ship Size Estimation in Maritime Radars

    Directory of Open Access Journals (Sweden)

    Vicen-Bueno R

    2010-01-01

    Full Text Available The existence of clutter in maritime radars deteriorates the estimation of some physical parameters of the objects detected over the sea surface. For that reason, maritime radars should incorporate efficient clutter reduction techniques. Due to the intrinsic nonlinear dynamic of sea clutter, nonlinear signal processing is needed, what can be achieved by artificial neural networks (ANNs. In this paper, an estimation of the ship size using an ANN-based clutter reduction system followed by a fixed threshold is proposed. High clutter reduction rates are achieved using 1-dimensional (horizontal or vertical integration modes, although inaccurate ship width estimations are achieved. These estimations are improved using a 2-dimensional (rhombus integration mode. The proposed system is compared with a CA-CFAR system, denoting a great performance improvement and a great robustness against changes in sea clutter conditions and ship parameters, independently of the direction of movement of the ocean waves and ships.

  12. Training Process Reduction Based On Potential Weights Linear Analysis To Accelarate Back Propagation Network

    CERN Document Server

    Asadi, Roya; Sulaiman, Nasir

    2009-01-01

    Learning is the important property of Back Propagation Network (BPN) and finding the suitable weights and thresholds during training in order to improve training time as well as achieve high accuracy. Currently, data pre-processing such as dimension reduction input values and pre-training are the contributing factors in developing efficient techniques for reducing training time with high accuracy and initialization of the weights is the important issue which is random and creates paradox, and leads to low accuracy with high training time. One good data preprocessing technique for accelerating BPN classification is dimension reduction technique but it has problem of missing data. In this paper, we study current pre-training techniques and new preprocessing technique called Potential Weight Linear Analysis (PWLA) which combines normalization, dimension reduction input values and pre-training. In PWLA, the first data preprocessing is performed for generating normalized input values and then applying them by pre-...

  13. ExactPack Documentation

    Energy Technology Data Exchange (ETDEWEB)

    Singleton, Jr., Robert [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Israel, Daniel M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Doebling, Scott William [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Woods, Charles Nathan [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kaul, Ann [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Walter, Jr., John William [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Rogers, Michael Lloyd [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2016-05-09

    For code verification, one compares the code output against known exact solutions. There are many standard test problems used in this capacity, such as the Noh and Sedov problems. ExactPack is a utility that integrates many of these exact solution codes into a common API (application program interface), and can be used as a stand-alone code or as a python package. ExactPack consists of python driver scripts that access a library of exact solutions written in Fortran or Python. The spatial profiles of the relevant physical quantities, such as the density, fluid velocity, sound speed, or internal energy, are returned at a time specified by the user. The solution profiles can be viewed and examined by a command line interface or a graphical user interface, and a number of analysis tools and unit tests are also provided. We have documented the physics of each problem in the solution library, and provided complete documentation on how to extend the library to include additional exact solutions. ExactPack’s code architecture makes it easy to extend the solution-code library to include additional exact solutions in a robust, reliable, and maintainable manner.

  14. Dissimilatory nitrate reduction processes in sediments of urban river networks: Spatiotemporal variations and environmental implications.

    Science.gov (United States)

    Cheng, Lv; Li, Xiaofei; Lin, Xianbiao; Hou, Lijun; Liu, Min; Li, Ye; Liu, Sai; Hu, Xiaoting

    2016-12-01

    Urbanizations have increased the loadings of reactive nitrogen in urban riverine environments. However, limited information about dissimilatory nitrate reduction processes and associated contributions to nitrogen removal is available for urban riverine environments. In this study, sediment slurry experiments were conducted with nitrogen isotope-tracing technique to investigate the potential rates of denitrification, anaerobic ammonium oxidation (anammox) and dissimilatory nitrate reduction to ammonium (DNRA) and their contributions to nitrate reduction in sediments of urban river networks, Shanghai. The potential rates of denitrification, anammox and DNRA measured in the study area ranged from 0.193 to 98.7 nmol N g(-1) h(-1) dry weight (dw), 0.0387-23.7 nmol N g(-1) h(-1) dw and 0-10.3 nmol N g(-1) h(-1) dw, respectively. Denitrification and DNRA rates were higher in summer than in winter, while anammox rates were greater in winter than in summer for most sites. Dissolved oxygen, total organic carbon, nitrate, ammonium, sulfide, Fe(II) and Fe(III) were found to have significant influence on these nitrate reduction processes. Denitrification contributed 11.5-99.5%% to total nitrate reduction, as compared to 0.343-81.6% for anammox and 0-52.3% for DNRA. It is estimated that nitrogen loss of approximately 1.33 × 10(5) t N year(-1) was linked to both denitrification and anammox processes, which accounted for about 20.1% of total inorganic nitrogen transported annually into the urban river networks of Shanghai. Overall, these results show the potential importance of denitrification and anammox in nitrogen removal and provide new insight into the mechanisms of nitrogen cycles in urban riverine environments.

  15. Analysis of GHG Emission Reduction in South Korea Using a CO2 Transportation Network Optimization Model

    Directory of Open Access Journals (Sweden)

    Suk Ho Jin

    2017-07-01

    Full Text Available Korea’s national carbon capture and storage (CCS master plan aims to commercialize CCS projects by 2030. Furthermore, the Korean government is forced to reduce emissions from various sectors, including industries and power generation, by 219 million tons by 2030. This study analyzes a few scenarios of Korean CCS projects with a CO2 pipeline transportation network optimization model for minimizing the total facility cost and pipeline cost. Our scenarios are based on the “2030 asic roadmap for reducing greenhouse gases” established by the government. The results for each scenario demonstrate that the effective design and implementation of CO2 pipeline network enables the lowering of CO2 units cost. These suggest that CO2 transportation networks, which connect the capture and sequestration parts, will be more important in the future and can be used to substitute and supplement the emission reduction target in case the execution of other reduction options faces uncertainty. Our mathematical model and scenario designs will be helpful for various countries which plan to introduce CCS technology.

  16. We4DRR: A brand new European network for women in Disaster Risk Reduction

    Science.gov (United States)

    Papathoma-Koehle, Maria; Keiler, Margreth; Promper, Catrin; Patek, Maria

    2017-04-01

    Natural hazards often intensify societal inequalities having disproportionate impact on some population groups including women. On the other hand, women working in the field of natural hazards, either on site as emergency workers or in research, policy and administration as scientists, experts and managers have to deal with a number of challenges. However, gender issues are often neglected and women networks related to natural hazards in Europe but also worldwide are scarce. We present here "We4DRR: Women exchange for Disaster Risk Reduction", a new women's network focusing on gender issues in the field of disaster risk reduction but also on women working in the field. The network was initiated and organised by the Austrian Federal Ministry of Agriculture, Forestry, Environment and Water Management (BMLFUW) and the University of Natural Resources and Life Sciences Vienna (BOKU) and was launched in Austria in March 2016. Its aims include collecting data on gender issues and DRR, empowerment of women, mentoring of young female professionals, and increasing the visibility of gender-specific aspects in DRR.

  17. Exact Threshold Circuits

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.

    2010-01-01

    We initiate a systematic study of constant depth Boolean circuits built using exact threshold gates. We consider both unweighted and weighted exact threshold gates and introduce corresponding circuit classes. We next show that this gives a hierarchy of classes that seamlessly interleave with the ......We initiate a systematic study of constant depth Boolean circuits built using exact threshold gates. We consider both unweighted and weighted exact threshold gates and introduce corresponding circuit classes. We next show that this gives a hierarchy of classes that seamlessly interleave...... with the well-studied corresponding hierarchies defined using ordinary threshold gates. A major open problem in Boolean circuit complexity is to provide an explicit super-polynomial lower bound for depth two threshold circuits. We identify the class of depth two exact threshold circuits as a natural subclass...

  18. A Recurrent Probabilistic Neural Network with Dimensionality Reduction Based on Time-series Discriminant Component Analysis.

    Science.gov (United States)

    Hayashi, Hideaki; Shibanoki, Taro; Shima, Keisuke; Kurita, Yuichi; Tsuji, Toshio

    2015-12-01

    This paper proposes a probabilistic neural network (NN) developed on the basis of time-series discriminant component analysis (TSDCA) that can be used to classify high-dimensional time-series patterns. TSDCA involves the compression of high-dimensional time series into a lower dimensional space using a set of orthogonal transformations and the calculation of posterior probabilities based on a continuous-density hidden Markov model with a Gaussian mixture model expressed in the reduced-dimensional space. The analysis can be incorporated into an NN, which is named a time-series discriminant component network (TSDCN), so that parameters of dimensionality reduction and classification can be obtained simultaneously as network coefficients according to a backpropagation through time-based learning algorithm with the Lagrange multiplier method. The TSDCN is considered to enable high-accuracy classification of high-dimensional time-series patterns and to reduce the computation time taken for network training. The validity of the TSDCN is demonstrated for high-dimensional artificial data and electroencephalogram signals in the experiments conducted during the study.

  19. Median Filter Noise Reduction of Image and Backpropagation Neural Network Model for Cervical Cancer Classification

    Science.gov (United States)

    Wutsqa, D. U.; Marwah, M.

    2017-06-01

    In this paper, we consider spatial operation median filter to reduce the noise in the cervical images yielded by colposcopy tool. The backpropagation neural network (BPNN) model is applied to the colposcopy images to classify cervical cancer. The classification process requires an image extraction by using a gray level co-occurrence matrix (GLCM) method to obtain image features that are used as inputs of BPNN model. The advantage of noise reduction is evaluated by comparing the performances of BPNN models with and without spatial operation median filter. The experimental result shows that the spatial operation median filter can improve the accuracy of the BPNN model for cervical cancer classification.

  20. Efficient Data Reduction Techniques for Remote Applications of a Wireless Visual Sensor Network

    Directory of Open Access Journals (Sweden)

    Khursheed Khursheed

    2013-05-01

    Full Text Available A Wireless Visual Sensor Network (WVSN is formed by deploying many Visual Sensor Nodes (VSNs in the field. After acquiring an image of the area of interest, the VSN performs local processing on it and transmits the result using an embedded wireless transceiver. Wireless data transmission consumes a great deal of energy, where energy consumption is mainly dependent on the amount of information being transmitted. The image captured by the VSN contains a huge amount of data. For certain applications, segmentation can be performed on the captured images. The amount of information in the segmented images can be reduced by applying efficient bi‐level image compression methods. In this way, the communication energy consumption of each of the VSNs can be reduced. However, the data reduction capability of bi‐level image compression standards is fixed and is limited by the used compression algorithm. For applications attributing few changes in adjacent frames, change coding can be applied for further data reduction. Detecting and compressing only the Regions of Interest (ROIs in the change frame is another possibility for further data reduction. In a communication system, where both the sender and the receiver know the employed compression standard, there is a possibility for further data reduction by not including the header information in the compressed bit stream of the sender. This paper summarizes different information reduction techniques such as image coding, change coding and ROI coding. The main contribution is the investigation of the combined effect of all these coding methods and their application to a few representative real life applications. This paper is intended to be a resource for researchers interested in techniques for information reduction in energy constrained embedded applications.

  1. Dimensionality Reduction and Reconstruction using Mirroring Neural Networks and Object Recognition based on Reduced Dimension Characteristic Vector

    CERN Document Server

    Deepthi, Dasika Ratna; Eswaran, K

    2007-01-01

    In this paper, we present a Mirroring Neural Network architecture to perform non-linear dimensionality reduction and Object Recognition using a reduced lowdimensional characteristic vector. In addition to dimensionality reduction, the network also reconstructs (mirrors) the original high-dimensional input vector from the reduced low-dimensional data. The Mirroring Neural Network architecture has more number of processing elements (adalines) in the outer layers and the least number of elements in the central layer to form a converging-diverging shape in its configuration. Since this network is able to reconstruct the original image from the output of the innermost layer (which contains all the information about the input pattern), these outputs can be used as object signature to classify patterns. The network is trained to minimize the discrepancy between actual output and the input by back propagating the mean squared error from the output layer to the input layer. After successfully training the network, it ...

  2. Exactly Solvable Quantum Mechanics

    CERN Document Server

    Sasaki, Ryu

    2014-01-01

    A comprehensive review of exactly solvable quantum mechanics is presented with the emphasis of the recently discovered multi-indexed orthogonal polynomials. The main subjects to be discussed are the factorised Hamiltonians, the general structure of the solution spaces of the Schroedinger equation (Crum's theorem and its modifications), the shape invariance, the exact solvability in the Schroedinger picture as well as in the Heisenberg picture, the creation/annihilation operators and the dynamical symmetry algebras, coherent states, various deformation schemes (multiple Darboux transformations) and the infinite families of multi-indexed orthogonal polynomials, the exceptional orthogonal polynomials, and deformed exactly solvable scattering problems.

  3. Feedback Reduction in Broadcast and two Hop Multiuser Networks: A Compressed Sensing Approach

    KAUST Repository

    Shibli, Hussain J.

    2013-05-21

    In multiuser wireless networks, the base stations (BSs) rely on the channel state information (CSI) of the users to in order to perform user scheduling and downlink transmission. While the downlink channels can be easily estimated at all user terminals via a single broadcast, several key challenges are faced during uplink (feedback) transmission. Firstly, the noisy and fading feedback channels are usually unknown at the base station, and therefore, channel training is usually required from all users. Secondly, the amount of air-time required for feedback transmission grows linearly with the number of users. This domination of the network resources by feedback information leads to increased scheduling delay and outdated CSI at the BS. In this thesis, we tackle the above challenges and propose feedback reduction algorithms based on the theory of compressive sensing (CS). The proposed algorithms encompass both single and dual hop wireless networks, and; i) permit the BS to obtain CSI with acceptable recovery guarantees under substantially reduced feedback overhead, ii) are agnostic to the statistics of the feedback channels, and iii) utilize the apriori statistics of the additive noise to identify strong users. Numerical results show that the proposed algorithms are able to reduce the feedback overhead, improve detection at the BS, and achieve a sum-rate close to that obtained by noiseless dedicated feedback algorithms.

  4. Transdisciplinarity among tobacco harm-reduction researchers: a network analytic approach.

    Science.gov (United States)

    Provan, Keith G; Clark, Pamela I; Huerta, Timothy

    2008-08-01

    Progress in tobacco control and other areas of health research is thought to be heavily influenced by the extent to which researchers are able to work with each other not only within, but also across disciplines. This study provides an examination of the extent to which researchers in the area of tobacco harm reduction work together. Specifically, data were collected in 2005 from a national group of 67 top tobacco-control researchers from eight broadly defined disciplines representing 17 areas of expertise. Network analysis was utilized to examine the extent to which these researchers were engaged in research that was interdisciplinary or transdisciplinary, based on the outcome or product attained. Findings revealed that interdisciplinary network ties were much denser than transdisciplinary ties, but researchers in some disciplines were more likely to work across disciplines than others, especially when synergistic outcomes resulted. The study demonstrates for the first time how tobacco-control researchers work together, providing direction for policy officials seeking to encourage greater transdisciplinarity. The study also demonstrates the value of network-analysis methods for understanding research relationships in one important area of health care.

  5. PAPR Reduction of OFDM Signal by Neural Networks without Side Information and its FPGA Implementation

    Science.gov (United States)

    Ohta, Masaya; Ueda, Yasuo; Yamashita, Katsumi

    A major drawback of orthogonal frequency division multiplexing (OFDM) is the high peak-to-average power ratio (PAPR) of the transmitted signal. PAPR reduction techniques by using neural networks have been proposed to reduce the PAPR problem in OFDM transmitter. These techniques require side information to be transmitted from the transmitter to the receiver in order to recover the original data symbol from the received signal. In this paper, we propose a novel technique to reduce PAPR of OFDM signal. Proposed technique is based on Tone Injection(TI) and dose not use any side information to be transmitted from the transmitter to the receiver. Moreover, the proposed model is designed with VHDL for a FPGA device, and evaluated the performance.

  6. Romantic relationship stages and social networking sites: uncertainty reduction strategies and perceived relational norms on facebook.

    Science.gov (United States)

    Fox, Jesse; Anderegg, Courtney

    2014-11-01

    Due to their pervasiveness and unique affordances, social media play a distinct role in the development of modern romantic relationships. This study examines how a social networking site is used for information seeking about a potential or current romantic partner. In a survey, Facebook users (N=517) were presented with Facebook behaviors categorized as passive (e.g., reading a partner's profile), active (e.g., "friending" a common third party), or interactive (e.g., commenting on the partner's wall) uncertainty reduction strategies. Participants reported how normative they perceived these behaviors to be during four possible stages of relationship development (before meeting face-to-face, after meeting face-to-face, casual dating, and exclusive dating). Results indicated that as relationships progress, perceived norms for these behaviors change. Sex differences were also observed, as women perceived passive and interactive strategies as more normative than men during certain relationship stages.

  7. Connection errors in networks of linear features and the application of geometrical reduction in spatial data algorithms

    CERN Document Server

    Rodis, Panteleimon

    2011-01-01

    The topic of this paper is to present a study of the connection errors in networks of linear features that are mapped in Geographical Information Systems (GIS), as well as algorithms that detect them and the notion of geometrical reduction and its use in spatial data algorithms. In datasets of networks usually there can be found errors, when a number of elements of the network are not connected according to the specifications of the network. This can occur due to errors in the digitization process of the network or because these elements are connected in reality in a not legal way. These errors can be topological, when the network elements are not correctly connected, or errors that violate the specifications of the network. Examples of specifications that their violation can result this situation is when in a telecommunication network there is the restriction that channels of high capacity should not be connected directly to home networks but only through local sub-networks, or when in a road network there i...

  8. Dramatic reduction of dimensionality in large biochemical networks owing to strong pair correlations

    Science.gov (United States)

    Dworkin, Michael; Mukherjee, Sayak; Jayaprakash, Ciriyam; Das, Jayajit

    2012-01-01

    Large multi-dimensionality of high-throughput datasets pertaining to cell signalling and gene regulation renders it difficult to extract mechanisms underlying the complex kinetics involving various biochemical compounds (e.g. proteins and lipids). Data-driven models often circumvent this difficulty by using pair correlations of the protein expression levels to produce a small number (fewer than 10) of principal components, each a linear combination of the concentrations, to successfully model how cells respond to different stimuli. However, it is not understood if this reduction is specific to a particular biological system or to nature of the stimuli used in these experiments. We study temporal changes in pair correlations, described by the covariance matrix, between concentrations of different molecular species that evolve following deterministic mass-action kinetics in large biologically relevant reaction networks and show that this dramatic reduction of dimensions (from hundreds to less than five) arises from the strong correlations between different species at any time and is insensitive to the form of the nonlinear interactions, network architecture, and to a wide range of values of rate constants and concentrations. We relate temporal changes in the eigenvalue spectrum of the covariance matrix to low-dimensional, local changes in directions of the system trajectory embedded in much larger dimensions using elementary differential geometry. We illustrate how to extract biologically relevant insights such as identifying significant timescales and groups of correlated chemical species from our analysis. Our work provides for the first time, to our knowledge, a theoretical underpinning for the successful experimental analysis and points to a way to extract mechanisms from large-scale high-throughput datasets. PMID:22378749

  9. Fuzzy Logic based Handoff Latency Reduction Mechanism in Layer 2 of Heterogeneous Mobile IPv6 Networks

    Science.gov (United States)

    Anwar, Farhat; Masud, Mosharrof H.; Latif, Suhaimi A.

    2013-12-01

    Mobile IPv6 (MIPv6) is one of the pioneer standards that support mobility in IPv6 environment. It has been designed to support different types of technologies for providing seamless communications in next generation network. However, MIPv6 and subsequent standards have some limitations due to its handoff latency. In this paper, a fuzzy logic based mechanism is proposed to reduce the handoff latency of MIPv6 for Layer 2 (L2) by scanning the Access Points (APs) while the Mobile Node (MN) is moving among different APs. Handoff latency occurs when the MN switches from one AP to another in L2. Heterogeneous network is considered in this research in order to reduce the delays in L2. Received Signal Strength Indicator (RSSI) and velocity of the MN are considered as the input of fuzzy logic technique. This technique helps the MN to measure optimum signal quality from APs for the speedy mobile node based on fuzzy logic input rules and makes a list of interfaces. A suitable interface from the list of available interfaces can be selected like WiFi, WiMAX or GSM. Simulation results show 55% handoff latency reduction and 50% packet loss improvement in L2 compared to standard to MIPv6.

  10. Building collaboration through shared actions: The experience of the Global Network for Disaster Reduction

    Directory of Open Access Journals (Sweden)

    Terry Gibson

    2012-06-01

    Full Text Available This article asks how the emergent Global Network for Disaster Reduction has built collaboration and impact. Observation of the network’s journey nuanced the researcher’s initial hypothesis in marked ways. A ‘reflective practitioner’ perspective is adopted, locating action within two relevant theoretical frameworks to aid understanding and define future progress. Development showed an early emphasis on a ‘community of practice’ model. However, this appeared ineffective in creating the intended collaboration and led to the recognition of the power of shared action. This observation is framed within the thinking of Freire (1996 on action and reflection as a means of empowerment. The political dimension of the network’s activity is recognised, and is related to Gaventa’s (1980 thinking on the creation of political space. The article attempts to show that combining cycles of action and reflection in the network’s activity (i.e. creating a practitioner focus with a wider investigation of relevant literature and thinking can be helpful in framing understanding and determining future strategy. It concludes by suggesting that a proposed framework of ‘communities of praxis’ may have a broader application in the development of networks.

  11. Pulmonary Nodule Detection in CT Images: False Positive Reduction Using Multi-View Convolutional Networks.

    Science.gov (United States)

    Setio, Arnaud Arindra Adiyoso; Ciompi, Francesco; Litjens, Geert; Gerke, Paul; Jacobs, Colin; van Riel, Sarah J; Wille, Mathilde Marie Winkler; Naqibullah, Matiullah; Sanchez, Clara I; van Ginneken, Bram

    2016-05-01

    We propose a novel Computer-Aided Detection (CAD) system for pulmonary nodules using multi-view convolutional networks (ConvNets), for which discriminative features are automatically learnt from the training data. The network is fed with nodule candidates obtained by combining three candidate detectors specifically designed for solid, subsolid, and large nodules. For each candidate, a set of 2-D patches from differently oriented planes is extracted. The proposed architecture comprises multiple streams of 2-D ConvNets, for which the outputs are combined using a dedicated fusion method to get the final classification. Data augmentation and dropout are applied to avoid overfitting. On 888 scans of the publicly available LIDC-IDRI dataset, our method reaches high detection sensitivities of 85.4% and 90.1% at 1 and 4 false positives per scan, respectively. An additional evaluation on independent datasets from the ANODE09 challenge and DLCST is performed. We showed that the proposed multi-view ConvNets is highly suited to be used for false positive reduction of a CAD system.

  12. On exactly conservative integrators

    Energy Technology Data Exchange (ETDEWEB)

    Bowman, J.C. [Max-Planck-Inst. fuer Plasmaphysik, Garching (Germany); Shadwick, B.A. [Univ. of California, Berkeley, CA (United States). Dept. of Physics; Morrison, P.J. [Texas Univ., Austin, TX (United States). Inst. for Fusion Studies

    1997-06-01

    Traditional explicit numerical discretizations of conservative systems generically predict artificial secular drifts of nonlinear invariants. These algorithms are based on polynomial functions of the time step. The authors discuss a general approach for developing explicit algorithms that conserve such invariants exactly. They illustrate the method by applying it to the truncated two-dimensional Euler equations.

  13. On exactly conservative integrators

    Energy Technology Data Exchange (ETDEWEB)

    Bowman, J.C. [Max-Planck-Inst. fuer Plasmaphysik, Garching (Germany); Shadwick, B.A. [Univ. of California, Berkeley, CA (United States). Dept. of Physics; Morrison, P.J. [Texas Univ., Austin, TX (United States). Inst. for Fusion Studies

    1997-06-01

    Traditional explicit numerical discretizations of conservative systems generically predict artificial secular drifts of nonlinear invariants. These algorithms are based on polynomial functions of the time step. The authors discuss a general approach for developing explicit algorithms that conserve such invariants exactly. They illustrate the method by applying it to the truncated two-dimensional Euler equations.

  14. Artificial neural network modeling using clinical and knowledge independent variables predicts salt intake reduction behavior.

    Science.gov (United States)

    Isma'eel, Hussain A; Sakr, George E; Almedawar, Mohamad M; Fathallah, Jihan; Garabedian, Torkom; Eddine, Savo Bou Zein; Nasreddine, Lara; Elhajj, Imad H

    2015-06-01

    High dietary salt intake is directly linked to hypertension and cardiovascular diseases (CVDs). Predicting behaviors regarding salt intake habits is vital to guide interventions and increase their effectiveness. We aim to compare the accuracy of an artificial neural network (ANN) based tool that predicts behavior from key knowledge questions along with clinical data in a high cardiovascular risk cohort relative to the least square models (LSM) method. We collected knowledge, attitude and behavior data on 115 patients. A behavior score was calculated to classify patients' behavior towards reducing salt intake. Accuracy comparison between ANN and regression analysis was calculated using the bootstrap technique with 200 iterations. Starting from a 69-item questionnaire, a reduced model was developed and included eight knowledge items found to result in the highest accuracy of 62% CI (58-67%). The best prediction accuracy in the full and reduced models was attained by ANN at 66% and 62%, respectively, compared to full and reduced LSM at 40% and 34%, respectively. The average relative increase in accuracy over all in the full and reduced models is 82% and 102%, respectively. Using ANN modeling, we can predict salt reduction behaviors with 66% accuracy. The statistical model has been implemented in an online calculator and can be used in clinics to estimate the patient's behavior. This will help implementation in future research to further prove clinical utility of this tool to guide therapeutic salt reduction interventions in high cardiovascular risk individuals.

  15. Delay Reduction for Instantly Decodable Network Coding in Persistent Channels With Feedback Imperfections

    KAUST Repository

    Douik, Ahmed S.

    2015-11-05

    This paper considers the multicast decoding delay reduction problem for generalized instantly decodable network coding (G-IDNC) over persistent erasure channels with feedback imperfections. The feedback scenario discussed is the most general situation in which the sender does not always receive acknowledgments from the receivers after each transmission and the feedback communications are subject to loss. The decoding delay increment expressions are derived and employed to express the decoding delay reduction problem as a maximum weight clique problem in the G-IDNC graph. This paper provides a theoretical analysis of the expected decoding delay increase at each time instant. Problem formulations in simpler channel and feedback models are shown to be special cases of the proposed generalized formulation. Since finding the optimal solution to the problem is known to be NP-hard, a suboptimal greedy algorithm is designed and compared with blind approaches proposed in the literature. Through extensive simulations, the proposed algorithm is shown to outperform the blind methods in all situations and to achieve significant improvement, particularly for high time-correlated channels.

  16. Reduction of electromagnetic exposure using hybrid (DVB-H/UMTS) networks

    Science.gov (United States)

    Schack, M.; Unger, P.; Kürner, T.

    2007-06-01

    The hybrid mobile communication network described in this paper consists of a point-to-point network (UMTS) and a point-to-multipoint network (DVB-H). Using an additional DVB-H network increases the downlink capacity of the communications system. Another benefit of combining these two networks is an optimised transfer of data by collecting several user requests for a single response via the broadcast network DVB-H. It is analysed how the hybrid network structure influences the electromagnetic exposure. Therefore, realistic scenarios have been developed consisting of different user behaviour and different network structures. These scenarios provide building data for investigations of indoor coverage and realistic propagation of signals. In order to evaluate the grade of exposure, criteria have been defined. These criteria have been used for comparing a hybrid network with a single UMTS network in terms of electromagnetic exposure. The simulation results of the scenarios are shown for different network structures and network configurations.

  17. Exact Relativistic 'Antigravity' Propulsion

    CERN Document Server

    Felber, F S

    2006-01-01

    The Schwarzschild solution is used to find the exact relativistic motion of a payload in the gravitational field of a mass moving with constant velocity. At radial approach or recession speeds faster than 3^-1/2 times the speed of light, even a small mass gravitationally repels a payload. At relativistic speeds, a suitable mass can quickly propel a heavy payload from rest nearly to the speed of light with negligible stresses on the payload.

  18. Exact Relativistic `Antigravity' Propulsion

    Science.gov (United States)

    Felber, Franklin S.

    2006-01-01

    The Schwarzschild solution is used to find the exact relativistic motion of a payload in the gravitational field of a mass moving with constant velocity. At radial approach or recession speeds faster than 3-1/2 times the speed of light, even a small mass gravitationally repels a payload. At relativistic speeds, a suitable mass can quickly propel a heavy payload from rest nearly to the speed of light with negligible stresses on the payload.

  19. Noise Reduction Technique for Images using Radial Basis Function Neural Networks

    Directory of Open Access Journals (Sweden)

    Sander Ali Khowaja

    2014-07-01

    Full Text Available This paper presents a NN (Neural Network based model for reducing the noise from images. This is a RBF (Radial Basis Function network which is used to reduce the effect of noise and blurring from the captured images. The proposed network calculates the mean MSE (Mean Square Error and PSNR (Peak Signal to Noise Ratio of the noisy images. The proposed network has also been successfully applied to medical images. The performance of the trained RBF network has been compared with the MLP (Multilayer Perceptron Network and it has been demonstrated that the performance of the RBF network is better than the MLP network.

  20. Exploring the effects of dimensionality reduction in deep networks for force estimation in robotic-assisted surgery

    Science.gov (United States)

    Aviles, Angelica I.; Alsaleh, Samar; Sobrevilla, Pilar; Casals, Alicia

    2016-03-01

    Robotic-Assisted Surgery approach overcomes the limitations of the traditional laparoscopic and open surgeries. However, one of its major limitations is the lack of force feedback. Since there is no direct interaction between the surgeon and the tissue, there is no way of knowing how much force the surgeon is applying which can result in irreversible injuries. The use of force sensors is not practical since they impose different constraints. Thus, we make use of a neuro-visual approach to estimate the applied forces, in which the 3D shape recovery together with the geometry of motion are used as input to a deep network based on LSTM-RNN architecture. When deep networks are used in real time, pre-processing of data is a key factor to reduce complexity and improve the network performance. A common pre-processing step is dimensionality reduction which attempts to eliminate redundant and insignificant information by selecting a subset of relevant features to use in model construction. In this work, we show the effects of dimensionality reduction in a real-time application: estimating the applied force in Robotic-Assisted Surgeries. According to the results, we demonstrated positive effects of doing dimensionality reduction on deep networks including: faster training, improved network performance, and overfitting prevention. We also show a significant accuracy improvement, ranging from about 33% to 86%, over existing approaches related to force estimation.

  1. Exact analysis of bi-periodic structures

    CERN Document Server

    Cai, C W; Chan, H C

    2002-01-01

    By using the U-transformation method, it is possible to uncouple linear simultaneous equations, either algebraic or differential, with cyclic periodicity. This book presents a procedure for applying the U-transformation technique twice to uncouple the two sets of unknown variables in a doubly periodic structure to achieve an analytical exact solution. Explicit exact solutions for the static and dynamic analyses for certain engineering structures with doubly periodic properties - such as a continuous truss with any number of spans, cable network and grillwork on supports with periodicity, and g

  2. A mathematical/physics carbon emission reduction strategy for building supply chain network based on carbon tax policy

    Science.gov (United States)

    Li, Xueying; Peng, Ying; Zhang, Jing

    2017-01-01

    Under the background of a low carbon economy, this paper examines the impact of carbon tax policy on supply chain network emission reduction. The integer linear programming method is used to establish a supply chain network emission reduction such a model considers the cost of CO2 emissions, and analyses the impact of different carbon price on cost and carbon emissions in supply chains. The results show that the implementation of a carbon tax policy can reduce CO2 emissions in building supply chain, but the increase in carbon price does not produce a reduction effect, and may bring financial burden to the enterprise. This paper presents a reasonable carbon price range and provides decision makers with strategies towards realizing a low carbon building supply chain in an economical manner.

  3. Bit Rate Reduction of FS-1015 Speech Coder Using Fuzzy ARTMAP and KSOFM Neural Networks

    Directory of Open Access Journals (Sweden)

    Ali Eslamzadeh

    2009-03-01

    Full Text Available The speech spectrum is very sensitive to linear predictive coding (LPC parameters, so small quantization errors may cause unstable synthesis filter. Line spectral pairs (LSPs are more efficient representations than LPC parameters. On the other hand, artificial neural networks (ANNs have been used successfully to improving the quality and also reduction the computational complexity of speech coders. This work proposes an efficient technique to reduce the bit rate of FS-1015 speech coder, while improving the performance. In this way, LSP parameters are used instead of the LPC parameters. In addition, neural vector quantizers based on Kohonen self-organizing feature map (KSOFM, with a modified-supervised training algorithm, and fuzzy ARTMAP are also employed to reduce the bit rate. By using the mentioned neural vector quantizer models, the quality of synthesized speech, in terms of mean opinion score (MOS, is improved 0.13 and 0.26, respectively. The execution time of proposed models, as compared to FS-1015 standard, is also reduced 27% and 43%, respectively.

  4. Completion time reduction in instantly decodable network coding through decoding delay control

    KAUST Repository

    Douik, Ahmed S.

    2014-12-01

    For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users\\' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.

  5. Compression and Combining Based on Channel Shortening and Rank Reduction Technique for Cooperative Wireless Sensor Networks

    KAUST Repository

    Ahmed, Qasim Zeeshan

    2013-12-18

    This paper investigates and compares the performance of wireless sensor networks where sensors operate on the principles of cooperative communications. We consider a scenario where the source transmits signals to the destination with the help of L sensors. As the destination has the capacity of processing only U out of these L signals, the strongest U signals are selected while the remaining (L?U) signals are suppressed. A preprocessing block similar to channel-shortening is proposed in this contribution. However, this preprocessing block employs a rank-reduction technique instead of channel-shortening. By employing this preprocessing, we are able to decrease the computational complexity of the system without affecting the bit error rate (BER) performance. From our simulations, it can be shown that these schemes outperform the channel-shortening schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared to channel-shortening schemes when sensors employ fixed gain amplification. However, for sensors which employ variable gain amplification, a tradeoff exists in terms of BER performance between the channel-shortening and these schemes. These schemes outperform channel-shortening scheme for lower signal-to-noise ratio.

  6. Exact Lattice Supersymmetry

    Energy Technology Data Exchange (ETDEWEB)

    Catterall, Simon; Kaplan, David B.; Unsal, Mithat

    2009-03-31

    We provide an introduction to recent lattice formulations of supersymmetric theories which are invariant under one or more real supersymmetries at nonzero lattice spacing. These include the especially interesting case of N = 4 SYM in four dimensions. We discuss approaches based both on twisted supersymmetry and orbifold-deconstruction techniques and show their equivalence in the case of gauge theories. The presence of an exact supersymmetry reduces and in some cases eliminates the need for fine tuning to achieve a continuum limit invariant under the full supersymmetry of the target theory. We discuss open problems.

  7. Exactly conservation integrators

    Energy Technology Data Exchange (ETDEWEB)

    Shadwick, B.A.; Bowman, J.C.; Morrison, P.J. [Univ. of Texas, Austin, TX (United States)

    1999-03-01

    Traditional explicit numerical discretizations of conservative systems generically predict artificial secular drifts of any nonlinear invariants. In this work the authors present a general approach for developing explicit nontraditional algorithms that conserve such invariants exactly. They illustrate the method by applying it to the three-wave truncation of the Euler equations, the Lotka-Volterra predator-prey model, and the Kepler problem. The ideas are discussed in the context of symplectic (phase-space-conserving) integration methods as well as nonsymplectic conservative methods. They comment on the application of the method to general conservative systems.

  8. Exactly conservative integrators

    Energy Technology Data Exchange (ETDEWEB)

    Shadwick, B.A.; Bowman, J.C.; Morrison, P.J.

    1995-07-19

    Traditional numerical discretizations of conservative systems generically yield an artificial secular drift of any nonlinear invariants. In this work we present an explicit nontraditional algorithm that exactly conserves invariants. We illustrate the general method by applying it to the Three-Wave truncation of the Euler equations, the Volterra-Lotka predator-prey model, and the Kepler problem. We discuss our method in the context of symplectic (phase space conserving) integration methods as well as nonsymplectic conservative methods. We comment on the application of our method to general conservative systems.

  9. Exactly conservative integrators

    CERN Document Server

    Shadwick, B A; Morrison, P J; Bowman, John C

    1995-01-01

    Traditional numerical discretizations of conservative systems generically yield an artificial secular drift of any nonlinear invariants. In this work we present an explicit nontraditional algorithm that exactly conserves these invariants. We illustrate the general method by applying it to the three-wave truncation of the Euler equations, the Lotka--Volterra predator--prey model, and the Kepler problem. This method is discussed in the context of symplectic (phase space conserving) integration methods as well as nonsymplectic conservative methods. We comment on the application of our method to general conservative systems.

  10. Exactly conservative integrators

    Energy Technology Data Exchange (ETDEWEB)

    Shadwick, B.A.; Bowman, J.C.; Morrison, P.J.

    1995-07-19

    Traditional numerical discretizations of conservative systems generically yield an artificial secular drift of any nonlinear invariants. In this work we present an explicit nontraditional algorithm that exactly conserves invariants. We illustrate the general method by applying it to the Three-Wave truncation of the Euler equations, the Volterra-Lotka predator-prey model, and the Kepler problem. We discuss our method in the context of symplectic (phase space conserving) integration methods as well as nonsymplectic conservative methods. We comment on the application of our method to general conservative systems.

  11. Localization & Exact Holography

    CERN Document Server

    Dabholkar, Atish; Murthy, Sameer

    2011-01-01

    We consider the AdS_2/CFT_1 holographic correspondence near the horizon of big four-dimensional black holes preserving four supersymmetries in toroidally compactified Type-II string theory. The boundary partition function of CFT_1 is given by the known quantum degeneracies of these black holes. The bulk partition function is given by a functional integral over string fields in AdS_2. Using recent results on localization we reduce the infinite-dimensional functional integral to a finite number of ordinary integrals over a space of localizing instantons. Under reasonable assumptions about the relevant terms in the effective action, these integrals can be evaluated exactly to obtain a bulk partition function. It precisely reproduces all terms in the exact Rademacher expansion of the boundary partition function as nontrivial functions of charges except for the Kloosterman sum which can in principle follow from an analysis of phases in the background of orbifolded instantons. Our results can be regarded as a step ...

  12. Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

    Science.gov (United States)

    Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

    2016-08-01

    This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.

  13. Binary video codec for data reduction in wireless visual sensor networks

    Science.gov (United States)

    Khursheed, Khursheed; Ahmad, Naeem; Imran, Muhammad; O'Nils, Mattias

    2013-02-01

    Wireless Visual Sensor Networks (WVSN) is formed by deploying many Visual Sensor Nodes (VSNs) in the field. Typical applications of WVSN include environmental monitoring, health care, industrial process monitoring, stadium/airports monitoring for security reasons and many more. The energy budget in the outdoor applications of WVSN is limited to the batteries and the frequent replacement of batteries is usually not desirable. So the processing as well as the communication energy consumption of the VSN needs to be optimized in such a way that the network remains functional for longer duration. The images captured by VSN contain huge amount of data and require efficient computational resources for processing the images and wide communication bandwidth for the transmission of the results. Image processing algorithms must be designed and developed in such a way that they are computationally less complex and must provide high compression rate. For some applications of WVSN, the captured images can be segmented into bi-level images and hence bi-level image coding methods will efficiently reduce the information amount in these segmented images. But the compression rate of the bi-level image coding methods is limited by the underlined compression algorithm. Hence there is a need for designing other intelligent and efficient algorithms which are computationally less complex and provide better compression rate than that of bi-level image coding methods. Change coding is one such algorithm which is computationally less complex (require only exclusive OR operations) and provide better compression efficiency compared to image coding but it is effective for applications having slight changes between adjacent frames of the video. The detection and coding of the Region of Interest (ROIs) in the change frame efficiently reduce the information amount in the change frame. But, if the number of objects in the change frames is higher than a certain level then the compression efficiency

  14. Reduction of electromagnetic exposure using hybrid (DVB-H/UMTS networks

    Directory of Open Access Journals (Sweden)

    M. Schack

    2007-06-01

    Full Text Available The hybrid mobile communication network described in this paper consists of a point-to-point network (UMTS and a point-to-multipoint network (DVB-H. Using an additional DVB-H network increases the downlink capacity of the communications system. Another benefit of combining these two networks is an optimised transfer of data by collecting several user requests for a single response via the broadcast network DVB-H. It is analysed how the hybrid network structure influences the electromagnetic exposure. Therefore, realistic scenarios have been developed consisting of different user behaviour and different network structures. These scenarios provide building data for investigations of indoor coverage and realistic propagation of signals. In order to evaluate the grade of exposure, criteria have been defined. These criteria have been used for comparing a hybrid network with a single UMTS network in terms of electromagnetic exposure. The simulation results of the scenarios are shown for different network structures and network configurations.

  15. Exact Solutions to Maccari's System

    Institute of Scientific and Technical Information of China (English)

    PAN Jun-Ting; GONG Lun-Xun

    2007-01-01

    Based on the generalized Riccati relation, an algebraic method to construct a series of exact solutions to nonlinear evolution equations is proposed. Being concise and straightforward, the method is applied to Maccari's system, and some exact solutions of the system are obtained. The method is of important significance in exploring exact solutions for other nonlinear evolution equations.

  16. Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding

    KAUST Repository

    Douik, Ahmed

    2016-06-27

    For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.

  17. Separation of time-scales and model reduction for stochastic reaction networks

    CERN Document Server

    Kang, Hye-Won

    2010-01-01

    A stochastic model for a chemical reaction network is embedded in a one-parameter family of models with species numbers and rate constants scaled by powers of the parameter. A systematic approach is developed for determining appropriate choices of the exponents that can be applied to large complex networks. When the scaling implies subnetworks have different time-scales, the subnetworks can be approximated separately providing insight into the behavior of the full network through the analysis of these lower dimensional approximations.

  18. Network analysis of biochemical logic for noise reduction and stability: a system of three coupled enzymatic and gates.

    Science.gov (United States)

    Privman, Vladimir; Arugula, Mary A; Halámek, Jan; Pita, Marcos; Katz, Evgeny

    2009-04-16

    We develop an approach aimed at optimizing the parameters of a network of biochemical logic gates for reduction of the "analog" noise buildup. Experiments for three coupled enzymatic AND gates are reported, illustrating our procedure. Specifically, starch, one of the controlled network inputs, is converted to maltose by beta-amylase. With the use of phosphate (another controlled input), maltose phosphorylase then produces glucose. Finally, nicotinamide adenine dinucleotide (NAD(+)), the third controlled input, is reduced under the action of glucose dehydrogenase to yield the optically detected signal. Network functioning is analyzed by varying selective inputs and fitting standardized few-parameters "response-surface" functions assumed for each gate. This allows a certain probe of the individual gate quality, but primarily yields information on the relative contribution of the gates to noise amplification. The derived information is then used to modify our experimental system to put it in a regime of a less noisy operation.

  19. Stress reduction in phase-separated, cross-linked networks: influence of phase structure and kinetics of reaction.

    Science.gov (United States)

    Szczepanski, Caroline R; Stansbury, Jeffrey W

    2014-10-05

    A mechanism for polymerization shrinkage and stress reduction was developed for heterogeneous networks formed via ambient, photo-initiated polymerization-induced phase separation (PIPS). The material system used consists of a bulk homopolymer matrix of triethylene glycol dimethacrylate (TEGDMA) modified with one of three non-reactive, linear prepolymers (poly-methyl, ethyl and butyl methacrylate). At higher prepolymer loading levels (10-20 wt%) an enhanced reduction in both shrinkage and polymerization stress is observed. The onset of gelation in these materials is delayed to a higher degree of methacrylate conversion (~15-25%), providing more time for phase structure evolution by thermodynamically driven monomer diffusion between immiscible phases prior to network macro-gelation. The resulting phase structure was probed by introducing a fluorescently tagged prepolymer into the matrix. The phase structure evolves from a dispersion of prepolymer at low loading levels to a fully co-continuous heterogeneous network at higher loadings. The bulk modulus in phase separated networks is equivalent or greater than that of poly(TEGDMA), despite a reduced polymerization rate and cross-link density in the prepolymer-rich domains.

  20. Exact probes of orientifolds

    CERN Document Server

    Fiol, Bartomeu; Torrents, Genis

    2014-01-01

    We compute the exact vacuum expectation value of circular Wilson loops for Euclidean ${\\cal N}=4$ super Yang-Mills with $G=SO(N),Sp(N)$, in the fundamental and spinor representations. These field theories are dual to type IIB string theory compactified on $AdS_5\\times {\\mathbb R} {\\mathbb P}^5$ plus certain choices of discrete torsion, and we use our results to probe this holographic duality. We first revisit the LLM-type geometries having $AdS_5\\times {\\mathbb R} {\\mathbb P}^5$ as ground state. Our results clarify and refine the identification of these LLM-type geometries as bubbling geometries arising from fermions on a half harmonic oscillator. We furthermore identify the presence of discrete torsion with the one-fermion Wigner distribution becoming negative at the origin of phase space. We then turn to the string world-sheet interpretation of our results and argue that for the quantities considered they imply two features: first, the contribution coming from world-sheets with a single crosscap is closely ...

  1. Exactly and quasi-exactly solvable 'discrete' quantum mechanics.

    OpenAIRE

    Sasaki, Ryu

    2011-01-01

    A brief introduction to discrete quantum mechanics is given together with the main results on various exactly solvable systems. Namely, the intertwining relations, shape invariance, Heisenberg operator solutions, annihilation/creation operators and dynamical symmetry algebras, including the q-oscillator algebra and the Askey-Wilson algebra. A simple recipe to construct exactly and quasi-exactly solvable (QES) Hamiltonians in one-dimensional 'discrete' quantum mechanics is presented. It reprod...

  2. Exactly and quasi-exactly solvable 'discrete' quantum mechanics.

    Science.gov (United States)

    Sasaki, Ryu

    2011-03-28

    A brief introduction to discrete quantum mechanics is given together with the main results on various exactly solvable systems. Namely, the intertwining relations, shape invariance, Heisenberg operator solutions, annihilation/creation operators and dynamical symmetry algebras, including the q-oscillator algebra and the Askey-Wilson algebra. A simple recipe to construct exactly and quasi-exactly solvable (QES) Hamiltonians in one-dimensional 'discrete' quantum mechanics is presented. It reproduces all the known Hamiltonians whose eigenfunctions consist of the Askey scheme of hypergeometric orthogonal polynomials of a continuous or a discrete variable. Several new exactly and QES Hamiltonians are constructed. The sinusoidal coordinate plays an essential role.

  3. A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.

    Science.gov (United States)

    Röhl, Annika; Bockmayr, Alexander

    2017-01-03

    Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.

  4. Label Space Reduction in MPLS Networks: How Much Can A Single Stacked Label Do?

    DEFF Research Database (Denmark)

    Solano, Fernando; Stidsen, Thomas K.; Fabregat, Ramon

    2008-01-01

    Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying virtual private networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the config...

  5. Variable-Width Datapath for On-Chip Network Static Power Reduction

    Energy Technology Data Exchange (ETDEWEB)

    Michelogiannakis, George; Shalf, John

    2013-11-13

    With the tight power budgets in modern large-scale chips and the unpredictability of application traffic, on-chip network designers are faced with the dilemma of designing for worst- case bandwidth demands and incurring high static power overheads, or designing for an average traffic pattern and risk degrading performance. This paper proposes adaptive bandwidth networks (ABNs) which divide channels and switches into lanes such that the network provides just the bandwidth necessary in each hop. ABNs also activate input virtual channels (VCs) individually and take advantage of drowsy SRAM cells to eliminate false VC activations. In addition, ABNs readily apply to silicon defect tolerance with just the extra cost for detecting faults. For application traffic, ABNs reduce total power consumption by an average of 45percent with comparable performance compared to single-lane power-gated networks, and 33percent compared to multi-network designs.

  6. The Real-Time Optimisation of DNO Owned Storage Devices on the LV Network for Peak Reduction

    Directory of Open Access Journals (Sweden)

    Matthew Rowe

    2014-05-01

    Full Text Available Energy storage is a potential alternative to conventional network reinforcement of the low voltage (LV distribution network to ensure the grid’s infrastructure remains within its operating constraints. This paper presents a study on the control of such storage devices, owned by distribution network operators. A deterministic model predictive control (MPC controller and a stochastic receding horizon controller (SRHC are presented, where the objective is to achieve the greatest peak reduction in demand, for a given storage device specification, taking into account the high level of uncertainty in the prediction of LV demand. The algorithms presented in this paper are compared to a standard set-point controller and bench marked against a control algorithm with a perfect forecast. A specific case study, using storage on the LV network, is presented, and the results of each algorithm are compared. A comprehensive analysis is then carried out simulating a large number of LV networks of varying numbers of households. The results show that the performance of each algorithm is dependent on the number of aggregated households. However, on a typical aggregation, the novel SRHC algorithm presented in this paper is shown to outperform each of the comparable storage control techniques.

  7. The Neglected Exactness

    Science.gov (United States)

    Endom, Joerg

    2014-05-01

    negligible any more. Locating for example the exact position of joints, rebars on site, getting correct calibration information or overlaying measurements of independent methods requires high accuracy positioning for all data. Different technologies of synchronizing and stabilizing are discussed in this presentation. Furthermore a scale problem for interdisciplinary work between the geotechnical engineer, the civil engineer, the surveyor and the geophysicist is presented. Manufacturers as well as users are addressed to work on a unified methodology that could be implemented in future. This presentation is a contribution to COST Action TU1208.

  8. Drastic disorded-induced reduction of signal amplification in scale-free networks

    CERN Document Server

    Chacón, Ricardo

    2014-01-01

    Understanding information transmission across a network is a fundamental task for controlling and manipulating both biological and man-made information processing systems. Here, we show how topological resonant-like amplification effects in scale-free networks of signaling devices are drastically reduced when phase disorder in the external signals is considered. This is demonstrated theoretically by means of a star-like network of overdamped bistable systems, and confirmed numerically by simulations of scale-free networks of such systems. The taming effect of the phase disorder is found to be sensitive to the amplification's strength, while the topology-induced amplification mechanism is robust against this kind of quenched disorder in the sense that it does not significantly change the values of the coupling strength where amplification is maximum in its absence.

  9. Experimental Demonstration of a Cognitive Optical Network for Reduction of Restoration Time

    DEFF Research Database (Denmark)

    Kachris, Christoforos; Klonidis, Dimitris; Francescon, Antonio;

    2014-01-01

    This paper presents the implementation and performance evaluation of a cognitive heterogeneous optical network testbed. The testbed integrates the CMP, the data plane and the cognitive system and reduces by 48% the link restoration time....

  10. Delay reduction in multi-hop device-to-device communication using network coding

    KAUST Repository

    Douik, Ahmed S.

    2015-08-12

    This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.

  11. An exact accelerated stochastic simulation algorithm

    Science.gov (United States)

    Mjolsness, Eric; Orendorff, David; Chatelain, Philippe; Koumoutsakos, Petros

    2009-04-01

    An exact method for stochastic simulation of chemical reaction networks, which accelerates the stochastic simulation algorithm (SSA), is proposed. The present "ER-leap" algorithm is derived from analytic upper and lower bounds on the multireaction probabilities sampled by SSA, together with rejection sampling and an adaptive multiplicity for reactions. The algorithm is tested on a number of well-quantified reaction networks and is found experimentally to be very accurate on test problems including a chaotic reaction network. At the same time ER-leap offers a substantial speedup over SSA with a simulation time proportional to the 2/3 power of the number of reaction events in a Galton-Watson process.

  12. Energy Efficiency of Ultra-Low-Power Bicycle Wireless Sensor Networks Based on a Combination of Power Reduction Techniques

    Directory of Open Access Journals (Sweden)

    Sadik Kamel Gharghan

    2016-01-01

    Full Text Available In most wireless sensor network (WSN applications, the sensor nodes (SNs are battery powered and the amount of energy consumed by the nodes in the network determines the network lifespan. For future Internet of Things (IoT applications, reducing energy consumption of SNs has become mandatory. In this paper, an ultra-low-power nRF24L01 wireless protocol is considered for a bicycle WSN. The power consumption of the mobile node on the cycle track was modified by combining adjustable data rate, sleep/wake, and transmission power control (TPC based on two algorithms. The first algorithm was a TPC-based distance estimation, which adopted a novel hybrid particle swarm optimization-artificial neural network (PSO-ANN using the received signal strength indicator (RSSI, while the second algorithm was a novel TPC-based accelerometer using inclination angle of the bicycle on the cycle track. Based on the second algorithm, the power consumption of the mobile and master nodes can be improved compared with the first algorithm and constant transmitted power level. In addition, an analytical model is derived to correlate the power consumption and data rate of the mobile node. The results indicate that the power savings based on the two algorithms outperformed the conventional operation (i.e., without power reduction algorithm by 78%.

  13. The Role of Delay and Connectivity in Throughput Reduction of Cooperative Decentralized Wireless Networks

    Directory of Open Access Journals (Sweden)

    Ahmed Alkhayyat

    2015-01-01

    Full Text Available We proposed a multiple relay selection protocol for decentralized wireless networks. The proposed relays selection protocol aims to address three issues: (1 selecting relays within the coverage area of the source and destination to ensure that the relays are positioned one hop away from the destination, (2 ensuring that the best node (best relays with less distance and attenuation from the destination access the channel first, and (3 ensuring that the proposed relays selection is collision-free. Our analysis also considers three important characteristics of decentralized wireless networks that are directly affected by cooperation: delay, connectivity, and throughput. The main goal of this paper is to demonstrate that improving connectivity and increasing number of relays reduce the throughput of cooperative decentralized wireless networks; consequently, a trade-off equation has been derived.

  14. Reduction of Network Effects On Control System Performance by Controller Design

    Directory of Open Access Journals (Sweden)

    Naser Pariz

    2007-09-01

    Full Text Available This paper discusses the impact of network architecture on control performance in a class of distributed control systems called Networked Control Systems (NCSs and provides design considerations related to control quality.Then, we discuss the framework for controller design NCSs where sensors, actuators, and controllers are distributed and interconnected by a common communication network. Multiple distributed communication delays as well as multiple inputs and multiple outputs are considered in the discretetime modeling algorithm. The proposed NCS model is used as a foundation for optimal controller design to compensate for the multiple time delays. The proposed control algorithm utilizes the information of delayed signals and improves the control performance of a control system with distributed communication delays. Several simulation studies are provided to evaluate the control performance of the proposed controller design.

  15. Groundwater Monitoring Network Design Using a Space-Filling/ Bias-Reduction Heuristic

    Science.gov (United States)

    Yan, T.; Singh, A.; Kelley, V.; Deeds, N.

    2012-12-01

    Groundwater monitoring network design is one of the primary goals of groundwater management. In this study, a heuristic method for selecting wells to monitor groundwater flow is developed. The approach selects wells to a) maximize spread within the monitoring area (space-filling objective), b) reduce bias in estimate of groundwater level (drawdown objective) by selecting pairs of well proximal and distant from pumping areas. By selecting pairs of monitoring wells, this method is able to capture the largest and smallest drawdown in the study area while ensuring the newly added monitoring wells are at the greatest distance from existing monitoring wells. One of the advantages of this method is that it does not require water level information, obtained either from field measurements or groundwater model runs, which might be unavailable at the time of the monitoring network design; instead, this method utilizes pumping rates and locations thus can take future planning into consideration. If water level data is available then that may be included by considering it in the drawdown objective. A FORTRAN code is developed to implement this method. By changing the weighting factors, users have the flexibility on deciding the importance of pumping and spatial information to their network designs. The method has been successfully applied to monitoring network design in Upper Trinity County Groundwater Conservation District in Texas. Monitoring wells were selected from thousands of existing wells and added to the current monitoring network. The results support the decision maker on the number and distribution of a new groundwater network using existing wells. The study can be extended to improve the application of desired future condition (DFC) for Groundwater Conservation Districts in Texas.

  16. Wills Eye Hospital and surgical network: successful pre-positioning strategies for payment reduction and managed care pressures.

    Science.gov (United States)

    Kessler, D M

    2001-01-01

    Through strategic clinical diversification, political activism, and bold expansion, Wills Eye Hospital, a teaching specialty surgical hospital, survives ravages of sudden onslaughts of managed care payment reductions while maintaining autonomy. Slack inpatient resources were re-utilized to create unique programs attractive to regional managed care organizations. Advocacy and lobbying for short-term favorable treatment from Medicare bought the Hospital valuable time and positioning. Building out a regional network of ambulatory surgical centers assures the growth and access to market required for Wills to maintain its autonomy in a managed care contracting environment.

  17. How deals with discrete data for the reduction of simulation models using neural network

    CERN Document Server

    Thomas, Philippe

    2009-01-01

    Simulation is useful for the evaluation of a Master Production/distribution Schedule (MPS). Also, the goal of this paper is the study of the design of a simulation model by reducing its complexity. According to theory of constraints, we want to build reduced models composed exclusively by bottlenecks and a neural network. Particularly a multilayer perceptron, is used. The structure of the network is determined by using a pruning procedure. This work focuses on the impact of discrete data on the results and compares different approaches to deal with these data. This approach is applied to sawmill internal supply chain

  18. Remarks on Exactly Solvable Noncommutative Quantum Field

    Institute of Scientific and Technical Information of China (English)

    WANG Ning

    2007-01-01

    We study exactly the solvable noncommutative scalar quantum Geld models of (2n) or (2n + 1) dimensions. By writing out an equivalent action of the noncommutative field, it is shown that the special condition B·θ =±I in field theoretic context means the full restoration of the maximal U(∞) gauge symmetries broken due to kinetic term. It is further shown that the model can be obtained by dimensional reduction of a 2n- dimensional exactly solvable noncommutative φ4 quantum field model closely related to the 1+1- dimensional Moyal/ matrix-valued nonlinear Schr(o)dinger (MNLS) equation. The corresponding quantum fundamental commutation relation of the MNLS model is also given explicitly.

  19. Exact solution for generalized pairing

    OpenAIRE

    Pan, Feng; J.P. Draayer

    1997-01-01

    An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with some numerical examples.

  20. Exact cosmological solutions for MOG

    Energy Technology Data Exchange (ETDEWEB)

    Roshan, Mahmood [Ferdowsi University of Mashhad, Department of Physics, P.O. Box 1436, Mashhad (Iran, Islamic Republic of)

    2015-09-15

    We find some new exact cosmological solutions for the covariant scalar-tensor-vector gravity theory, the so-called modified gravity (MOG). The exact solution of the vacuum field equations has been derived. Also, for non-vacuum cases we have found some exact solutions with the aid of the Noether symmetry approach. More specifically, the symmetry vector and also the Noether conserved quantity associated to the point-like Lagrangian of the theory have been found. Also we find the exact form of the generic vector field potential of this theory by considering the behavior of the relevant point-like Lagrangian under the infinitesimal generator of the Noether symmetry. Finally, we discuss the cosmological implications of the solutions. (orig.)

  1. Detecting small attractors of large Boolean networks by function-reduction-based strategy.

    Science.gov (United States)

    Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin

    2016-04-01

    Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.

  2. TCP Traffic Control Evaluation and Reduction over Wireless Networks Using Parallel Sequential Decoding Mechanism

    Directory of Open Access Journals (Sweden)

    Ramazan Aygün

    2007-11-01

    Full Text Available The assumption of TCP-based protocols that packet error (lost or damaged is due to network congestion is not true for wireless networks. For wireless networks, it is important to reduce the number of retransmissions to improve the effectiveness of TCP-based protocols. In this paper, we consider improvement at the data link layer for systems that use stop-and-wait ARQ as in IEEE 802.11 standard. We show that increasing the buffer size will not solve the actual problem and moreover it is likely to degrade the quality of delivery (QoD. We firstly study a wireless router system model with a sequential convolutional decoder for error detection and correction in order to investigate QoD of flow and error control. To overcome the problems along with high packet error rate, we propose a wireless router system with parallel sequential decoders. We simulate our systems and provide performance in terms of average buffer occupancy, blocking probability, probability of decoding failure, system throughput, and channel throughput. We have studied these performance metrics for different channel conditions, packet arrival rates, decoding time-out limits, system capacities, and the number of sequential decoders. Our results show that parallel sequential decoders have great impact on the system performance and increase QoD significantly.

  3. TCP Traffic Control Evaluation and Reduction over Wireless Networks Using Parallel Sequential Decoding Mechanism

    Directory of Open Access Journals (Sweden)

    Aygün Ramazan

    2007-01-01

    Full Text Available The assumption of TCP-based protocols that packet error (lost or damaged is due to network congestion is not true for wireless networks. For wireless networks, it is important to reduce the number of retransmissions to improve the effectiveness of TCP-based protocols. In this paper, we consider improvement at the data link layer for systems that use stop-and-wait ARQ as in IEEE 802.11 standard. We show that increasing the buffer size will not solve the actual problem and moreover it is likely to degrade the quality of delivery (QoD. We firstly study a wireless router system model with a sequential convolutional decoder for error detection and correction in order to investigate QoD of flow and error control. To overcome the problems along with high packet error rate, we propose a wireless router system with parallel sequential decoders. We simulate our systems and provide performance in terms of average buffer occupancy, blocking probability, probability of decoding failure, system throughput, and channel throughput. We have studied these performance metrics for different channel conditions, packet arrival rates, decoding time-out limits, system capacities, and the number of sequential decoders. Our results show that parallel sequential decoders have great impact on the system performance and increase QoD significantly.

  4. Power Consumption Reduction for Wireless Sensor Networks Using A Fuzzy Approach

    Directory of Open Access Journals (Sweden)

    Giovanni Pau

    2016-01-01

    Full Text Available The increasing complexity of Wireless Sensor Networks (WSNs is leading towards the deployment of complex networked systems and the optimal design of WSNs can be a very difficult task because several constraints and requirements must be considered, among all the power consumption. This paper proposes a novel fuzzy logic based mechanism that according to the battery level and to the ratio of Throughput to Workload determines the sleeping time of sensor devices in a Wireless Sensor Network for environmental monitoring based on the IEEE 802.15.4 protocol. The main aim here is to find an effective solution that achieves the target while avoiding complex and computationally expensive solutions, which would not be appropriate for the problem at hand and would impair the practical applicability of the approach in real scenarios. The results of several real test-bed scenarios show that the proposed system outperforms other solutions, significantly reducing the whole power consumption while maintaining good performance in terms of the ratio of throughput to workload. An implementation on off-the-shelf devices proves that the proposed controller does not require powerful hardware and can be easily implemented on a low-cost device, thus paving the way for extensive usage in practice.

  5. Model reduction for the dynamics and control of large structural systems via neutral network processing direct numerical optimization

    Science.gov (United States)

    Becus, Georges A.; Chan, Alistair K.

    1993-01-01

    Three neural network processing approaches in a direct numerical optimization model reduction scheme are proposed and investigated. Large structural systems, such as large space structures, offer new challenges to both structural dynamicists and control engineers. One such challenge is that of dimensionality. Indeed these distributed parameter systems can be modeled either by infinite dimensional mathematical models (typically partial differential equations) or by high dimensional discrete models (typically finite element models) often exhibiting thousands of vibrational modes usually closely spaced and with little, if any, damping. Clearly, some form of model reduction is in order, especially for the control engineer who can actively control but a few of the modes using system identification based on a limited number of sensors. Inasmuch as the amount of 'control spillover' (in which the control inputs excite the neglected dynamics) and/or 'observation spillover' (where neglected dynamics affect system identification) is to a large extent determined by the choice of particular reduced model (RM), the way in which this model reduction is carried out is often critical.

  6. Vibration reduction for smart periodic structures via periodic piezoelectric arrays with nonlinear interleaved-switched electronic networks

    Science.gov (United States)

    Bao, Bin; Guyomar, Daniel; Lallart, Mickaël

    2017-01-01

    Smart periodic structures covered by periodically distributed piezoelectric patches have drawn more and more attention in recent years for wave propagation attenuation and corresponding structural vibration suppression. Since piezoelectric materials are special type of energy conversion materials that link mechanical characteristics with electrical characteristics, shunt circuits coupled with such materials play a key role in the wave propagation and/or vibration control performance in smart periodic structures. Conventional shunt circuit designs utilize resistive shunt (R-shunt) and resonant shunt (RL-shunt). More recently, semi-passive nonlinear approaches have also been developed for efficiently controlling the vibrations of such structures. In this paper, an innovative smart periodic beam structure with nonlinear interleaved-switched electric networks based on synchronized switching damping on inductor (SSDI) is proposed and investigated for vibration reduction and wave propagation attenuation. Different from locally resonant band gap mechanism forming narrow band gaps around the desired resonant frequencies, the proposed interleaved electrical networks can induce new broadly low-frequency stop bands and broaden primitive Bragg stop bands by virtue of unique interleaved electrical configurations and the SSDI technique which has the unique feature of realizing automatic impedance adaptation with a small inductance. Finite element modeling of a Timoshenko electromechanical beam structure is also presented for validating dispersion properties of the structure. Both theoretical and experimental results demonstrate that the proposed beam structure not only shows better vibration and wave propagation attenuation than the smart beam structure with independent switched networks, but also has technical simplicity of requiring only half of the number of switches than the independent switched network needs.

  7. Loop Quantum Gravity, Exact Holographic Mapping, and Holographic Entanglement Entropy

    CERN Document Server

    Han, Muxin

    2016-01-01

    The relation between Loop Quantum Gravity (LQG) and tensor network is explored from the perspectives of bulk-boundary duality and holographic entanglement entropy. We find that the LQG spin-network states in a space $\\Sigma$ with boundary $\\partial\\Sigma$ is an exact holographic mapping similar to the proposal in arXiv:1309.6282. The tensor network, understood as the boundary quantum state, is the output of the exact holographic mapping emerging from a coarse graining procedure of spin-networks. Furthermore, when a region $A$ and its complement $\\bar{A}$ are specified on the boundary $\\partial\\Sigma$, we show that the boundary entanglement entropy $S(A)$ of the emergent tensor network satisfies the Ryu-Takayanagi formula in the semiclassical regime, i.e. $S(A)$ is proportional to the minimal area of the bulk surface attached to the boundary of $A$ in $\\partial\\Sigma$.

  8. Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.

    2013-10-01

    In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. © 2013 IEEE.

  9. On the Feedback Reduction of Relay Multiuser Networks using Compressive Sensing

    KAUST Repository

    Elkhalil, Khalil

    2016-01-29

    This paper presents a comprehensive performance analysis of full-duplex multiuser relay networks employing opportunistic scheduling with noisy and compressive feedback. Specifically, two feedback techniques based on compressive sensing (CS) theory are introduced and their effect on the system performance is analyzed. The problem of joint user identity and signal-tonoise ratio (SNR) estimation at the base-station is casted as a block sparse signal recovery problem in CS. Using existing CS block recovery algorithms, the identity of the strong users is obtained and their corresponding SNRs are estimated using the best linear unbiased estimator (BLUE). To minimize the effect of feedback noise on the estimated SNRs, a back-off strategy that optimally backs-off on the noisy estimated SNRs is introduced, and the error covariance matrix of the noise after CS recovery is derived. Finally, closed-form expressions for the end-to-end SNRs of the system are derived. Numerical results show that the proposed techniques drastically reduce the feedback air-time and achieve a rate close to that obtained by scheduling techniques that require dedicated error-free feedback from all network users. Key findings of this paper suggest that the choice of half-duplex or full-duplex SNR feedback is dependent on the channel coherence interval, and on low coherence intervals, full-duplex feedback is superior to the interference-free half-duplex feedback.

  10. Switched-based interference reduction scheme for open-access overlaid cellular networks

    KAUST Repository

    Radaydeh, Redha Mahmoud Mesleh

    2012-06-01

    Femtocells have been proposed to enhance the spatial coverage and system capacity of existing cellular networks. However, this technology may result in significant performance loss due to the increase in co-channel interference, particularly when coordination between access points is infeasible. This paper targets interference management in such overlaid networks. It is assumed that the femtocells employ the open-access strategy to reduce cross-tier interference, and can share resources concurrently. It is also assumed that each end user (EU) can access one channel at a time, and transfer limited feedback. To reduce the effect of co-tier interference in the absence of the desired EU channel state information (CSI) at the serving access point as well as coordination between active access points, a switched scheme based on the interference levels associated with available channels is proposed. Through the analysis, the scheme modes of operation in under-loaded and over-loaded channels are studied, from which the statistics of the resulting interference power are quantified. The impact of the proposed scheme on the received desired power is thoroughly discussed. In addition, the effect of the switching threshold on the achieved performance of the desired EU is investigated. The results clarify that the proposed scheme can improve the performance while reducing the number of examined channels and feedback load. © 2012 IEEE.

  11. Effects of Integration on the Cost Reduction in Distribution Network Design for Perishable Products

    Directory of Open Access Journals (Sweden)

    Z. Firoozi

    2014-01-01

    Full Text Available Perishable products, which include medical and pharmaceutical items as well as food products, are quite common in commerce and industries. Developing efficient network designs for storage and distribution of perishable products plays a prominent role in the cost and quality of these products. This paper aims to investigate and analyze the impact of applying an integrated approach for network design of perishable products. For this purpose, the problem has been formulated as a mixed integer nonlinear mathematical model that integrates inventory control and facility location decisions. To solve the integrated model, a memetic algorithm (MA is developed in this study. For verification of the proposed algorithm, its results are compared with the results of an adapted Lagrangian relaxation heuristic algorithm from the literature. Moreover, sensitivity analysis of the main parameters of the model is conducted to compare the results of the integrated approach with a decoupled method. The results show that as the products become more perishable, application of an integrated method becomes more reasonable in comparison with the decoupled one.

  12. Context-Based Moving Ob ject Tra jectory Uncertainty Reduction and Ranking in Road Network

    Institute of Scientific and Technical Information of China (English)

    Jian Dai; Zhi-Ming Ding; Jia-Jie Xu

    2016-01-01

    To support a large amount of GPS data generated from various moving objects, the back-end servers usually store low-sampling-rate trajectories. Therefore, no precise position information can be obtained directly from the back-end servers and uncertainty is an inherent characteristic of the spatio-temporal data. How to deal with the uncertainty thus becomes a basic and challenging problem. A lot of researches have been rigidly conducted on the uncertainty of a moving object itself and isolated from the context where it is derived. However, we discover that the uncertainty of moving objects can be efficiently reduced and effectively ranked using the context-aware information. In this paper, we focus on context-aware information and propose an integrated framework, Context-Based Uncertainty Reduction and Ranking (CURR), to reduce and rank the uncertainty of trajectories. Specifically, given two consecutive samplings, we aim to infer and rank the possible trajectories in accordance with the information extracted from context. Since some context-aware information can be used to reduce the uncertainty while some context-aware information can be used to rank the uncertainty, to leverage them accordingly, CURR naturally consists of two stages: reduction stage and ranking stage which complement each other. We also implement a prototype system to validate the effectiveness of our solution. Extensive experiments are conducted and the evaluation results demonstrate the efficiency and high accuracy of CURR.

  13. Exact Wavelets on the Ball

    CERN Document Server

    Leistedt, B

    2012-01-01

    We develop an exact wavelet transform on the three-dimensional ball (i.e. on the solid sphere), which we name the flaglet transform. For this purpose we first construct an exact harmonic transform on the radial line using damped Laguerre polynomials and develop a corresponding quadrature rule. Combined with the spherical harmonic transform, this approach leads to a sampling theorem on the ball and a novel three-dimensional decomposition which we call the Fourier-Laguerre transform. We relate this new transform to the well-known Fourier-Bessel decomposition and show that band-limitness in the Fourier-Laguerre basis is a sufficient condition to compute the Fourier-Bessel decomposition exactly. We then construct the flaglet transform on the ball through a harmonic tiling, which is exact thanks to the exactness of the Fourier-Laguerre transform (from which the name flaglets is coined). The corresponding wavelet kernels have compact localisation properties in real and harmonic space and their angular aperture is i...

  14. Exact completions and small sheaves

    CERN Document Server

    Shulman, Michael

    2012-01-01

    We prove a general theorem which includes most notions of "exact completion". The theorem is that "k-ary exact categories" are a reflective sub-2-category of "k-ary sites", for any regular cardinal k. A k-ary exact category is an exact category with disjoint and universal k-small coproducts, and a k-ary site is a site whose covering sieves are generated by k-small families and which satisfies a weak size condition. For different values of k, this includes the exact completions of a regular category or a category with (weak) finite limits; the pretopos completion of a coherent category; and the category of sheaves on a small site. For a large site with k the size of the universe, it gives a well-behaved "category of small sheaves". Along the way, we define a slightly generalized notion of "morphism of sites", and show that k-ary sites are equivalent to a type of "enhanced allegory".

  15. Model reduction and parameter estimation of non-linear dynamical biochemical reaction networks.

    Science.gov (United States)

    Sun, Xiaodian; Medvedovic, Mario

    2016-02-01

    Parameter estimation for high dimension complex dynamic system is a hot topic. However, the current statistical model and inference approach is known as a large p small n problem. How to reduce the dimension of the dynamic model and improve the accuracy of estimation is more important. To address this question, the authors take some known parameters and structure of system as priori knowledge and incorporate it into dynamic model. At the same time, they decompose the whole dynamic model into subset network modules, based on different modules, and then they apply different estimation approaches. This technique is called Rao-Blackwellised particle filters decomposition methods. To evaluate the performance of this method, the authors apply it to synthetic data generated from repressilator model and experimental data of the JAK-STAT pathway, but this method can be easily extended to large-scale cases.

  16. Adaptive method of speckle reduction based on curvelet transform and thresholding neural network in synthetic aperture radar images

    Science.gov (United States)

    Zakeri, Fatemeh; Zoej, Mohammad Javad Valadan

    2015-01-01

    Because of the effect of speckles in synthetic aperture radar (SAR) images, its reduction has been considered by many researchers to obtain reliable information. This paper proposes a method based on the curvelet transform to reduce speckles in SAR images. This study is based on the thresholding neural network (TNN) technique, which has been previously used in wavelet transformation. In addition, an adaptive learning TNN with remarkable time saving was introduced. Comparing the obtained results from the method with conventional speckle filters such as Lee, Kuan, Frost, and Gamma filters, curvelet-based, nonadaptive despeckling, wavelet-based TNN despeckling, and curvelet-based particle swarm optimization show better achievement of the proposed algorithm. For instance, noise mean value, noise standard deviation, mean square difference, equivalent number of looks, and β (an edge-preserving criterion) improved 2%, 9%, 21%, 35%, and 9%, respectively.

  17. Exact analysis of discrete data

    CERN Document Server

    Hirji, Karim F

    2005-01-01

    Researchers in fields ranging from biology and medicine to the social sciences, law, and economics regularly encounter variables that are discrete or categorical in nature. While there is no dearth of books on the analysis and interpretation of such data, these generally focus on large sample methods. When sample sizes are not large or the data are otherwise sparse, exact methods--methods not based on asymptotic theory--are more accurate and therefore preferable.This book introduces the statistical theory, analysis methods, and computation techniques for exact analysis of discrete data. After reviewing the relevant discrete distributions, the author develops the exact methods from the ground up in a conceptually integrated manner. The topics covered range from univariate discrete data analysis, a single and several 2 x 2 tables, a single and several 2 x K tables, incidence density and inverse sampling designs, unmatched and matched case -control studies, paired binary and trinomial response models, and Markov...

  18. A characterisation of algebraic exactness

    CERN Document Server

    Garner, Richard

    2011-01-01

    An algebraically exact category in one that admits all of the limits and colimits which every variety of algebras possesses and every forgetful functor between varieties preserves, and which verifies the same interactions between these limits and colimits as hold in any variety. Such categories were studied by Ad\\'amek, Lawvere and Rosick\\'y: they characterised them as the categories with small limits and sifted colimits for which the functor taking sifted colimits is continuous. They conjectured that a complete and sifted-cocomplete category should be algebraically exact just when it is Barr-exact, finite limits commute with filtered colimits, regular epimorphisms are stable by small products, and filtered colimits distribute over small products. We prove this conjecture.

  19. OPTIMAL SIZING OF DG UNITS USING EXACT LOSS FORMULA AT OPTIMAL POWER FACTOR

    Directory of Open Access Journals (Sweden)

    P.Sobha Rani

    2012-09-01

    Full Text Available Distributed generators are beneficial in reducing the losses effectively compared to other methods of loss reduction. The challenge of identifying the optimal locations and sizes of DG has generated research interests all over the world and many efforts have been made in this direction. Studies have indicated that inappropriatelocations and sizes of DG may lead to higher system losses than the ones in the existing network. In this paper IEEE 33-bus system is selected for locating and sizing of optimal distributed generation source. The DG unit size is calculated using exact loss formula. With the optimal size of DG unit at a suitable location and at optimalpower factor, it resulted in reduction in power losses and improvement in voltage profile.

  20. Risk Reduction in Operations, Maintenance and Application for Customer Access Network

    Directory of Open Access Journals (Sweden)

    Kasmiran Jumari

    2012-01-01

    Full Text Available Problem statement: This study is highlighted on a restoration scheme proposed against failure in working line at the drop region for Fiber-To-The Home (FTTH with a Passive Optical Network (PON. Whereas PON is a system that brings optical fiber cable and signals all or most of the way to the end user. In this study we highlighted the issue on survivability scheme against failure which is focused scattered residence architectures. Approach: Two types of restoration scheme are proposed by means of linear protection (tree and migrate protection (ring. Our proposed scheme is inexpensive and applicable to any residence architecture (ordered placement and scattered placement. The advantage of this scheme is the failure at fiber line can be recovered until two levels to make sure the optic signals flow continuously. FTTH based network design is simulated by using OptiSystem 7.0 in order to investigate the power output and BER performance at each node in the tree and ring protection scheme in scattered placement to prove the system feasibility. Results: The simulation analysis for output power in a linear protection path produced almost the same output power for all optical nodes regardless of the position and situation of the node. In linear protection, signal is split by optical splitter and did not having loss of power at each node. Thus the percentage adjustment on the coupling is obtained where; the average output power measured at the receiver is at -28.4206 dBm. While the signal for ring path is optimized by adjusting the loss ratio (n% and transmit it (1-n% in the optical coupler. Also found that; an average output power is -23 dBm only. A simulation of distance accessibility is increased with the increasing of sensitivity that used for the linear path and ring path. Conclusion: This study suggests the migration of tree to ring topology to enable the signal flow continuously in the case of failure occurs specifically in random or scattered

  1. Block compressed sensing for feedback reduction in relay-aided multiuser full duplex networks

    KAUST Repository

    Elkhalil, Khalil

    2016-08-11

    Opportunistic user selection is a simple technique that exploits the spatial diversity in multiuser relay-aided networks. Nonetheless, channel state information (CSI) from all users (and cooperating relays) is generally required at a central node in order to make selection decisions. Practically, CSI acquisition generates a great deal of feedback overhead that could result in significant transmission delays. In addition to this, the presence of a full-duplex cooperating relay corrupts the fed back CSI by additive noise and the relay\\'s loop (or self) interference. This could lead to transmission outages if user selection is based on inaccurate feedback information. In this paper, we propose an opportunistic full-duplex feedback algorithm that tackles the above challenges. We cast the problem of joint user signal-to-noise ratio (SNR) and the relay loop interference estimation at the base-station as a block sparse signal recovery problem in compressive sensing (CS). Using existing CS block recovery algorithms, the identity of the strong users is obtained and their corresponding SNRs are estimated. Numerical results show that the proposed technique drastically reduces the feedback overhead and achieves a rate close to that obtained by techniques that require dedicated error-free feedback from all users. Numerical results also show that there is a trade-off between the feedback interference and load, and for short coherence intervals, full-duplex feedback achieves higher throughput when compared to interference-free (half-duplex) feedback. © 2016 IEEE.

  2. A lossy graph model for delay reduction in generalized instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.

    2014-06-01

    The problem of minimizing the decoding delay in Generalized instantly decodable network coding (G-IDNC) for both perfect and lossy feedback scenarios is formulated as a maximum weight clique problem over the G-IDNC graph in. In this letter, we introduce a new lossy G-IDNC graph (LG-IDNC) model to further minimize the decoding delay in lossy feedback scenarios. Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations, arising from lossy feedback events, when the expected decoding delay of XORing them among themselves or with other certain packets is lower than that expected when sending these packets separately. We compare the decoding delay performance of LG-IDNC and G-IDNC graphs through extensive simulations. Numerical results show that our new LG-IDNC graph formulation outperforms the G-IDNC graph formulation in all lossy feedback situations and achieves significant improvement in the decoding delay especially when the feedback erasure probability is higher than the packet erasure probability. © 2012 IEEE.

  3. Low-complexity co-tier interference reduction scheme in open-access overlaid cellular networks

    KAUST Repository

    Radaydeh, Redha Mahmoud Mesleh

    2011-12-01

    This paper addresses the effect of co-tier interference on the performance of multiuser overlaid cellular networks that share the same available resources. It assumed that each macrocell contains a number of self-configurable and randomly located femtocells that employ the open-access control strategy to reduce the effect of cross-tier interference. It is also assumed that the desired user equipment (UE) can access only one of the available channels, maintains simple decoding circuitry with single receive antenna, and has limited knowledge of the instantaneous channel state information (CSI) due to resource limitation. To mitigate the effect of co-tier interference in the absence of the CSI of the desired UE, a low-complexity switched-based scheme for single channel selection based on the predicted interference levels associated with available channels is proposed for the case of over-loaded channels. Through the analysis, new general formulation for the statistics of the resulting instantaneous interference power and some performance measures are presented. The effect of the switching threshold on the efficiency and performance of the proposed scheme is studied. Numerical and simulation results to clarify the usefulness of the proposed scheme in reducing the impact of co-tier interference are also provided. © 2011 IEEE.

  4. Frontotemporal dementia and language networks: cortical thickness reduction is driven by dyslexia susceptibility genes

    Science.gov (United States)

    Paternicó, Donata; Manes, Marta; Premi, Enrico; Cosseddu, Maura; Gazzina, Stefano; Alberici, Antonella; Archetti, Silvana; Bonomi, Elisa; Cotelli, Maria Sofia; Cotelli, Maria; Turla, Marinella; Micheli, Anna; Gasparotti, Roberto; Padovani, Alessandro; Borroni, Barbara

    2016-01-01

    Variations within genes associated with dyslexia result in a language network vulnerability, and in patients with Frontotemporal Dementia (FTD), language disturbances represent a disease core feature. Here we explored whether variations within three related-dyslexia genes, namely KIAA0319, DCDC2, and CNTNAP, might affect cortical thickness measures in FTD patients. 112 FTD patients underwent clinical and neuropsychological examination, genetic analyses and brain Magnetic Resonance Imaging (MRI). KIAA0319 rs17243157 G/A, DCDC2 rs793842 A/G and CNTNAP2 rs17236239 A/G genetic variations were assessed. Cortical thickness was analysed by Freesurfer. Patients carrying KIAA0319 A*(AG or AA) carriers showed greater cortical thickness atrophy in the left fusiform and inferior temporal gyri, compared to KIAA0319 GG (p ≤ 0.001). Patients carrying CNTNAP2 G*(GA or GG) showed reduced cortical thickness in the left insula thenCNTNAP2 AA carriers (p≤0.001). When patients with both at-risk polymorphisms were considered (KIAA0319 A* and CNTNAP2 G*), greater and addictive cortical thickness atrophy of the left insula and the inferior temporal gyrus was demonstrated (p ≤ 0.001). No significant effect of DCDC2 was found. In FTD, variations of KIAA0319 and CNTNAP2 genes were related to cortical thickness abnormalities in those brain areas involved in language abilities. These findings shed light on genetic predisposition in defining phenotypic variability in FTD. PMID:27484312

  5. Delay reduction in persistent erasure channels for generalized instantly decodable network coding

    KAUST Repository

    Sorour, Sameh

    2013-06-01

    In this paper, we consider the problem of minimizing the decoding delay of generalized instantly decodable network coding (G-IDNC) in persistent erasure channels (PECs). By persistent erasure channels, we mean erasure channels with memory, which are modeled as a Gilbert-Elliott two-state Markov model with good and bad channel states. In this scenario, the channel erasure dependence, represented by the transition probabilities of this channel model, is an important factor that could be exploited to reduce the decoding delay. We first formulate the G-IDNC minimum decoding delay problem in PECs as a maximum weight clique problem over the G-IDNC graph. Since finding the optimal solution of this formulation is NP-hard, we propose two heuristic algorithms to solve it and compare them using extensive simulations. Simulation results show that each of these heuristics outperforms the other in certain ranges of channel memory levels. They also show that the proposed heuristics significantly outperform both the optimal strict IDNC in the literature and the channel-unaware G-IDNC algorithms. © 2013 IEEE.

  6. Automated detection of masses on whole breast volume ultrasound scanner: false positive reduction using deep convolutional neural network

    Science.gov (United States)

    Hiramatsu, Yuya; Muramatsu, Chisako; Kobayashi, Hironobu; Hara, Takeshi; Fujita, Hiroshi

    2017-03-01

    Breast cancer screening with mammography and ultrasonography is expected to improve sensitivity compared with mammography alone, especially for women with dense breast. An automated breast volume scanner (ABVS) provides the operator-independent whole breast data which facilitate double reading and comparison with past exams, contralateral breast, and multimodality images. However, large volumetric data in screening practice increase radiologists' workload. Therefore, our goal is to develop a computer-aided detection scheme of breast masses in ABVS data for assisting radiologists' diagnosis and comparison with mammographic findings. In this study, false positive (FP) reduction scheme using deep convolutional neural network (DCNN) was investigated. For training DCNN, true positive and FP samples were obtained from the result of our initial mass detection scheme using the vector convergence filter. Regions of interest including the detected regions were extracted from the multiplanar reconstraction slices. We investigated methods to select effective FP samples for training the DCNN. Based on the free response receiver operating characteristic analysis, simple random sampling from the entire candidates was most effective in this study. Using DCNN, the number of FPs could be reduced by 60%, while retaining 90% of true masses. The result indicates the potential usefulness of DCNN for FP reduction in automated mass detection on ABVS images.

  7. Network Reduction Algorithm for Developing Distribution Feeders for Real-Time Simulators: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Nagarajan, Adarsh; Nelson, Austin; Prabakar, Kumaraguru; Hoke, Andy; Asano, Marc; Ueda, Reid; Nepal, Shaili

    2017-06-15

    As advanced grid-support functions (AGF) become more widely used in grid-connected photovoltaic (PV) inverters, utilities are increasingly interested in their impacts when implemented in the field. These effects can be understood by modeling feeders in real-time systems and testing PV inverters using power hardware-in-the-loop (PHIL) techniques. This paper presents a novel feeder model reduction algorithm using a Monte Carlo method that enables large feeders to be solved and operated on real-time computing platforms. Two Hawaiian Electric feeder models in Synergi Electric's load flow software were converted to reduced order models in OpenDSS, and subsequently implemented in the OPAL-RT real-time digital testing platform. Smart PV inverters were added to the real-time model with AGF responses modeled after characterizing commercially available hardware inverters. Finally, hardware inverters were tested in conjunction with the real-time model using PHIL techniques so that the effects of AGFs on the choice feeders could be analyzed.

  8. Weights of Exact Threshold Functions

    DEFF Research Database (Denmark)

    Babai, László; Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.

    2010-01-01

    We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute value) of the coefficients required to represent such functions. These bounds are very close and in the linear case...

  9. Exactly solvable models of nuclei

    CERN Document Server

    Van Isacker, P

    2014-01-01

    In this paper a review is given of a class of sub-models of both approaches, characterized by the fact that they can be solved exactly, highlighting in the process a number of generic results related to both the nature of pair-correlated systems as well as collective modes of motion in the atomic nucleus.

  10. A complete algorithm to find exact minimal polynomial by approximations

    CERN Document Server

    Qin, Xiaolin; Chen, Jingwei; Zhang, Jingzhong

    2010-01-01

    We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approximate root. This also enables us to provide an efficient method of converting the rational approximation representation to the minimal polynomial representation, and devise a simple algorithm to factor multivariate polynomials with rational coefficients. Compared with the subsistent methods, our method combines advantage of high efficiency in numerical computation, and exact, stable results in symbolic computation. we also discuss some applications to some transcendental numbers by approximations. Moreover, the Digits of our algorithm is far less than the LLL-lattice basis reduction technique in theory. In this paper, we...

  11. THE NATIONAL CENTER FOR RADIOECOLOGY: A NETWORK OF EXCELLENCE FOR ENVIRONMENTAL AND HUMAN RADIATION RISK REDUCTION

    Energy Technology Data Exchange (ETDEWEB)

    Jannik, T.

    2013-01-09

    Radioecology in the United States can be traced back to the early 1950s when small research programs were established to address the fate and effects of radionuclides released in the environment from activities at nuclear facilities. These programs focused primarily on local environmental effects, but global radioactive fallout from nuclear weapons testing and the potential for larger scale local releases of radioisotopes resulted in major concerns about the threat, not only to humans, but to other species and to ecosystems that support all life. These concerns were shared by other countries and it was quickly recognized that a multi-disciplinary approach would be required to address and understand the implications of anthropogenic radioactivity in the environment. The management, clean-up and long-term monitoring of legacy wastes at Department of Energy (DOE), Department of Defense (DOD), and Nuclear Regulatory Commission (NRC)-regulated facilities continues to be of concern as long as nuclear operations continue. Research conducted through radioecology programs provides the credible scientific data needed for decision-making purposes. The current status of radioecology programs in the United States are: fragmented with little coordination to identify national strategies and direct programs; suffering from a steadily decreasing funding base; soon to be hampered by closure of key infrastructure; hampered by aging and retiring workforce (loss of technical expertise); and in need of training of young scientists to ensure continuation of the science (no formal graduate education program in radioecology remaining in the U.S.). With these concerns in mind, the Savannah River National Laboratory (SRNL) took the lead to establish the National Center for Radioecology (NCoRE) as a network of excellence of the remaining radioecology expertise in the United States. As part of the NCoRE mission, scientists at SRNL are working with six key partner universities to re-establish a

  12. Industry sponsorship bias in research findings: a network meta-analysis of LDL cholesterol reduction in randomised trials of statins

    Science.gov (United States)

    Dias, Sofia; Ades, A E

    2014-01-01

    Objective To explore the risk of industry sponsorship bias in a systematically identified set of placebo controlled and active comparator trials of statins. Design Systematic review and network meta-analysis. Eligibility Open label and double blind randomised controlled trials comparing one statin with another at any dose or with control (placebo, diet, or usual care) for adults with, or at risk of developing, cardiovascular disease. Only trials that lasted longer than four weeks with more than 50 participants per trial arm were included. Two investigators assessed study eligibility. Data sources Bibliographic databases and reference lists of relevant articles published between 1 January 1985 and 10 March 2013. Data extraction One investigator extracted data and another confirmed accuracy. Main outcome measure Mean absolute change from baseline concentration of low density lipoprotein (LDL) cholesterol. Data synthesis Study level outcomes from randomised trials were combined using random effects network meta-analyses. Results We included 183 randomised controlled trials of statins, 103 of which were two-armed or multi-armed active comparator trials. When all of the existing randomised evidence was synthesised in network meta-analyses, there were clear differences in the LDL cholesterol lowering effects of individual statins at different doses. In general, higher doses resulted in higher reductions in baseline LDL cholesterol levels. Of a total of 146 industry sponsored trials, 64 were placebo controlled (43.8%). The corresponding number for the non-industry sponsored trials was 16 (43.2%). Of the 35 unique comparisons available in 37 non-industry sponsored trials, 31 were also available in industry sponsored trials. There were no systematic differences in magnitude between the LDL cholesterol lowering effects of individual statins observed in industry sponsored versus non-industry sponsored trials. In industry sponsored trials, the mean change from baseline LDL

  13. When 'exact recovery' is exact recovery in compressed sensing simulation

    DEFF Research Database (Denmark)

    Sturm, Bob L.

    2012-01-01

    In a simulation of compressed sensing (CS), one must test whether the recovered solution \\(\\vax\\) is the true solution \\(\\vx\\), i.e., ``exact recovery.'' Most CS simulations employ one of two criteria: 1) the recovered support is the true support; or 2) the normalized squared error is less than...... for a given distribution of \\(\\vx\\)? We show that, in a best case scenario, \\(\\epsilon^2\\) sets a maximum allowed missed detection rate in a majority sense....

  14. Exact models for isotropic matter

    Science.gov (United States)

    Thirukkanesh, S.; Maharaj, S. D.

    2006-04-01

    We study the Einstein-Maxwell system of equations in spherically symmetric gravitational fields for static interior spacetimes. The condition for pressure isotropy is reduced to a recurrence equation with variable, rational coefficients. We demonstrate that this difference equation can be solved in general using mathematical induction. Consequently, we can find an explicit exact solution to the Einstein-Maxwell field equations. The metric functions, energy density, pressure and the electric field intensity can be found explicitly. Our result contains models found previously, including the neutron star model of Durgapal and Bannerji. By placing restrictions on parameters arising in the general series, we show that the series terminate and there exist two linearly independent solutions. Consequently, it is possible to find exact solutions in terms of elementary functions, namely polynomials and algebraic functions.

  15. Symmetries and Exact Solutions of the Breaking Soliton Equation

    Institute of Scientific and Technical Information of China (English)

    陈美; 刘希强

    2011-01-01

    With the aid of the classical Lie group method and nonclassical Lie group method, we derive the classical Lie point symmetry and the nonclassical Lie point symmetry of (2+1)-dimensional breaking soliton (BS) equation. Using the symmetries, we find six classical similarity reductions and two nonclassical similarity reductions of the BS equation. Varieties of exact solutions of the BS equation are obtained by solving the reduced equations.

  16. Exact non-abelian duality

    CERN Document Server

    Hewson, S F

    1996-01-01

    We investigate non-abelian gaugings of WZNW models. When the gauged group is semisimple we are able to present exact formulae for the dual conformal field theory, for all values of the level k. The results are then applied to non-abelian target space duality in string theory, showing that the standard formulae are quantum mechanically well defined in the low energy limit if the gauged group is semisimple.

  17. An artificial neural network approach for aerodynamic performance retention in airframe noise reduction design of a 3D swept wing model

    Institute of Scientific and Technical Information of China (English)

    Tao Jun; Sun Gang

    2016-01-01

    With the progress of high-bypass turbofan and the innovation of silencing nacelle in engine noise reduction, airframe noise has now become another important sound source besides the engine noise. Thus, reducing airframe noise makes a great contribution to the overall noise reduction of a civil aircraft. However, reducing airframe noise often leads to aerodynamic perfor-mance loss in the meantime. In this case, an approach based on artificial neural network is intro-duced. An established database serves as a basis and the training sample of a back propagation (BP) artificial neural network, which uses confidence coefficient reasoning method for optimization later on. Then the most satisfactory configuration is selected for validating computations through the trained BP network. On the basis of the artificial neural network approach, an optimization pro-cess of slat cove filler (SCF) for high lift devices (HLD) on the Trap Wing is presented. Aerody-namic performance of both the baseline and optimized configurations is investigated through unsteady detached eddy simulations (DES), and a hybrid method, which combines unsteady DES method with acoustic analogy theory, is employed to validate the noise reduction effect. The numerical results indicate not merely a significant airframe noise reduction effect but also excel-lent aerodynamic performance retention simultaneously.

  18. An artificial neural network approach for aerodynamic performance retention in airframe noise reduction design of a 3D swept wing model

    Directory of Open Access Journals (Sweden)

    Tao Jun

    2016-10-01

    Full Text Available With the progress of high-bypass turbofan and the innovation of silencing nacelle in engine noise reduction, airframe noise has now become another important sound source besides the engine noise. Thus, reducing airframe noise makes a great contribution to the overall noise reduction of a civil aircraft. However, reducing airframe noise often leads to aerodynamic performance loss in the meantime. In this case, an approach based on artificial neural network is introduced. An established database serves as a basis and the training sample of a back propagation (BP artificial neural network, which uses confidence coefficient reasoning method for optimization later on. Then the most satisfactory configuration is selected for validating computations through the trained BP network. On the basis of the artificial neural network approach, an optimization process of slat cove filler (SCF for high lift devices (HLD on the Trap Wing is presented. Aerodynamic performance of both the baseline and optimized configurations is investigated through unsteady detached eddy simulations (DES, and a hybrid method, which combines unsteady DES method with acoustic analogy theory, is employed to validate the noise reduction effect. The numerical results indicate not merely a significant airframe noise reduction effect but also excellent aerodynamic performance retention simultaneously.

  19. Large-scale reduction of the Bacillus subtilis genome: consequences for the transcriptional network, resource allocation, and metabolism.

    Science.gov (United States)

    Reuß, Daniel R; Altenbuchner, Josef; Mäder, Ulrike; Rath, Hermann; Ischebeck, Till; Sappa, Praveen Kumar; Thürmer, Andrea; Guérin, Cyprien; Nicolas, Pierre; Steil, Leif; Zhu, Bingyao; Feussner, Ivo; Klumpp, Stefan; Daniel, Rolf; Commichau, Fabian M; Völker, Uwe; Stülke, Jörg

    2017-02-01

    Understanding cellular life requires a comprehensive knowledge of the essential cellular functions, the components involved, and their interactions. Minimized genomes are an important tool to gain this knowledge. We have constructed strains of the model bacterium, Bacillus subtilis, whose genomes have been reduced by ∼36%. These strains are fully viable, and their growth rates in complex medium are comparable to those of wild type strains. An in-depth multi-omics analysis of the genome reduced strains revealed how the deletions affect the transcription regulatory network of the cell, translation resource allocation, and metabolism. A comparison of gene counts and resource allocation demonstrates drastic differences in the two parameters, with 50% of the genes using as little as 10% of translation capacity, whereas the 6% essential genes require 57% of the translation resources. Taken together, the results are a valuable resource on gene dispensability in B. subtilis, and they suggest the roads to further genome reduction to approach the final aim of a minimal cell in which all functions are understood.

  20. Exact analytical solutions for ADAFs

    CERN Document Server

    Habibi, Asiyeh; Shadmehri, Mohsen

    2016-01-01

    We obtain two-dimensional exact analytic solutions for the structure of the hot accretion flows without wind. We assume that the only non-zero component of the stress tensor is $T_{r\\varphi}$. Furthermore we assume that the value of viscosity coefficient $\\alpha$ varies with $\\theta$. We find radially self-similar solutions and compare them with the numerical and the analytical solutions already studied in the literature. The no-wind solution obtained in this paper may be applied to the nuclei of some cool-core clusters.

  1. EXACT ALGORITHM FOR BIN COVERING

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper presents a new arc flow model for the one-dimensional bin covering problem and an algorithm to solve the problem exactly through a branch-and-bound procedure and the technique of column generation. The subproblems occuring in the procedure of branch-and-bound have the same structure and therefore can be solved by the same algorithm. In order to solve effectively the subproblems which are generally large scale, a column generation algorithm is employed. Many rules found in this paper can improve the performance of the methods.

  2. Exact constants in approximation theory

    CERN Document Server

    Korneichuk, N

    1991-01-01

    This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base

  3. Modes of Large-Scale Brain Network Organization during Threat Processing and Posttraumatic Stress Disorder Symptom Reduction during TF-CBT among Adolescent Girls.

    Science.gov (United States)

    Cisler, Josh M; Sigel, Benjamin A; Kramer, Teresa L; Smitherman, Sonet; Vanderzee, Karin; Pemberton, Joy; Kilts, Clinton D

    2016-01-01

    Posttraumatic stress disorder (PTSD) is often chronic and disabling across the lifespan. The gold standard treatment for adolescent PTSD is Trauma-Focused Cognitive-Behavioral Therapy (TF-CBT), though treatment response is variable and mediating neural mechanisms are not well understood. Here, we test whether PTSD symptom reduction during TF-CBT is associated with individual differences in large-scale brain network organization during emotion processing. Twenty adolescent girls, aged 11-16, with PTSD related to assaultive violence completed a 12-session protocol of TF-CBT. Participants completed an emotion processing task, in which neutral and fearful facial expressions were presented either overtly or covertly during 3T fMRI, before and after treatment. Analyses focused on characterizing network properties of modularity, assortativity, and global efficiency within an 824 region-of-interest brain parcellation separately during each of the task blocks using weighted functional connectivity matrices. We similarly analyzed an existing dataset of healthy adolescent girls undergoing an identical emotion processing task to characterize normative network organization. Pre-treatment individual differences in modularity, assortativity, and global efficiency during covert fear vs neutral blocks predicted PTSD symptom reduction. Patients who responded better to treatment had greater network modularity and assortativity but lesser efficiency, a pattern that closely resembled the control participants. At a group level, greater symptom reduction was associated with greater pre-to-post-treatment increases in network assortativity and modularity, but this was more pronounced among participants with less symptom improvement. The results support the hypothesis that modularized and resilient brain organization during emotion processing operate as mechanisms enabling symptom reduction during TF-CBT.

  4. Exact Renormalization of Massless QED2

    CERN Document Server

    Casana, R; Casana, Rodolfo; Dias, Sebastiao Alves

    2001-01-01

    We perform the exact renormalization of two-dimensional massless gauge theories. Using these exact results we discuss the cluster property and confinement in both the anomalous and chiral Schwinger models.

  5. Exact Renormalization of Massless QED2

    Science.gov (United States)

    Casana, Rodolfo; Dias, Sebastião Alves

    We perform the exact renormalization of two-dimensional massless gauge theories. Using these exact results we discuss the cluster property and confinement in both the anomalous and chiral Schwinger models.

  6. AESS: Accelerated Exact Stochastic Simulation

    Science.gov (United States)

    Jenkins, David D.; Peterson, Gregory D.

    2011-12-01

    The Stochastic Simulation Algorithm (SSA) developed by Gillespie provides a powerful mechanism for exploring the behavior of chemical systems with small species populations or with important noise contributions. Gene circuit simulations for systems biology commonly employ the SSA method, as do ecological applications. This algorithm tends to be computationally expensive, so researchers seek an efficient implementation of SSA. In this program package, the Accelerated Exact Stochastic Simulation Algorithm (AESS) contains optimized implementations of Gillespie's SSA that improve the performance of individual simulation runs or ensembles of simulations used for sweeping parameters or to provide statistically significant results. Program summaryProgram title: AESS Catalogue identifier: AEJW_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJW_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: University of Tennessee copyright agreement No. of lines in distributed program, including test data, etc.: 10 861 No. of bytes in distributed program, including test data, etc.: 394 631 Distribution format: tar.gz Programming language: C for processors, CUDA for NVIDIA GPUs Computer: Developed and tested on various x86 computers and NVIDIA C1060 Tesla and GTX 480 Fermi GPUs. The system targets x86 workstations, optionally with multicore processors or NVIDIA GPUs as accelerators. Operating system: Tested under Ubuntu Linux OS and CentOS 5.5 Linux OS Classification: 3, 16.12 Nature of problem: Simulation of chemical systems, particularly with low species populations, can be accurately performed using Gillespie's method of stochastic simulation. Numerous variations on the original stochastic simulation algorithm have been developed, including approaches that produce results with statistics that exactly match the chemical master equation (CME) as well as other approaches that approximate the CME. Solution

  7. Exact finite elements for conduction and convection

    Science.gov (United States)

    Thornton, E. A.; Dechaumphai, P.; Tamma, K. K.

    1981-01-01

    An appproach for developing exact one dimensional conduction-convection finite elements is presented. Exact interpolation functions are derived based on solutions to the governing differential equations by employing a nodeless parameter. Exact interpolation functions are presented for combined heat transfer in several solids of different shapes, and for combined heat transfer in a flow passage. Numerical results demonstrate that exact one dimensional elements offer advantages over elements based on approximate interpolation functions. Previously announced in STAR as N81-31507

  8. Obtaining exact value by approximate computations

    Institute of Scientific and Technical Information of China (English)

    Jing-zhong ZHANG; Yong FENG

    2007-01-01

    Numerical approximate computations can solve large and complex problems fast. They have the advantage of high efficiency. However they only give approximate results, whereas we need exact results in some fields. There is a gap between approximate computations and exact results.In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.

  9. Weakly exact categories and the snake lemma

    CERN Document Server

    Jafari, Amir

    2009-01-01

    We generalize the notion of an exact category and introduce weakly exact categories. A proof of the snake lemma in this general setting is given. Some applications are given to illustrate how one can do homological algebra in a weakly exact category.

  10. Obtaining exact value by approximate computations

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Numerical approximate computations can solve large and complex problems fast.They have the advantage of high efficiency.However they only give approximate results,whereas we need exact results in some fields.There is a gap between approximate computations and exact results. In this paper,we build a bridge by which exact results can be obtained by numerical approximate computations.

  11. Exact propagators in harmonic superspace

    Science.gov (United States)

    Kuzenko, Sergei M.

    2004-10-01

    Within the background field formulation in harmonic superspace for quantum N = 2 super-Yang-Mills theories, the propagators of the matter, gauge and ghost superfields possess a complicated dependence on the SU(2) harmonic variables via the background vector multiplet. This dependence is shown to simplify drastically in the case of an on-shell vector multiplet. For a covariantly constant background vector multiplet, we exactly compute all the propagators. In conjunction with the covariant multi-loop scheme developed in arxiv:hep-th/0302205, these results provide an efficient (manifestly N = 2 supersymmetric) technical setup for computing multi-loop quantum corrections to effective actions in N = 2 supersymmetric gauge theories, including the N = 4 super-Yang-Mills theory.

  12. Exact propagators in harmonic superspace

    CERN Document Server

    Kuzenko, S M

    2004-01-01

    Within the background field formulation in harmonic superspace for quantum N = 2 super Yang-Mills theories, the propagators of the matter, gauge and ghost superfields possess a complicated dependence on the SU(2) harmonic variables via the background vector multiplet. This dependence is shown to simplify drastically in the case of an on-shell vector multiplet. For a covariantly constant background vector multiplet, we exactly compute all the propagators. In conjunction with the covariant multi-loop scheme developed in hep-th/0302205, these results provide an efficient (manifestly N = 2 supersymmetric) technical setup for computing multi-loop quantum corrections to effective actions in N = 2 supersymmetric gauge theories, including the N = 4 super Yang-Mills theory.

  13. Exact Bremsstrahlung and Effective Couplings

    CERN Document Server

    Mitev, Vladimir

    2015-01-01

    We calculate supersymmetric Wilson loops on the ellipsoid for a large class of $\\mathcal{N}=2$ SCFT using the localization formula of Hama and Hosomichi. From them we extract the radiation emitted by an accelerating heavy probe quark as well as the entanglement entropy following the recent works of Lewkowycz-Maldacena and Fiol-Gerchkovitz-Komargodski. Comparing our results with the $\\mathcal{N}=4$ SYM ones, we obtain interpolating functions $f(g^2)$ such that a given $\\mathcal{N}=2$ SCFT observable is obtained by replacing in the corresponding $\\mathcal{N}=4$ SYM result the coupling constant by $f(g^2)$. These ``exact effective couplings'' encode the finite, relative renormalization between the $\\mathcal{N}=2$ and the $\\mathcal{N}=4$ gluon propagator, they interpolate between the weak and the strong coupling. We discuss the range of their applicability.

  14. Exact Bremsstrahlung and effective couplings

    Science.gov (United States)

    Mitev, Vladimir; Pomoni, Elli

    2016-06-01

    We calculate supersymmetric Wilson loops on the ellipsoid for a large class of mathcal{N} = 2 SCFT using the localization formula of Hama and Hosomichi. From them we extract the radiation emitted by an accelerating heavy probe quark as well as the entanglement entropy following the recent works of Lewkowycz-Maldacena and Fiol-Gerchkovitz-Komargodski. Comparing our results with the mathcal{N} = 4 SYM ones, we obtain interpolating functions f ( g 2) such that a given mathcal{N} = 2 SCFT observable is obtained by replacing in the corresponding mathcal{N} = 4 SYM result the coupling constant by f ( g 2). These "exact effective couplings" encode the finite, relative renormalization between the mathcal{N} = 2 and the mathcal{N} = 4 gluon propagator and they interpolate between the weak and the strong coupling. We discuss the range of their applicability.

  15. Exact Bremsstrahlung and effective couplings

    Energy Technology Data Exchange (ETDEWEB)

    Mitev, Vladimir [Mainz Univ. (Germany). Inst. fuer Physik, WA THEP; Humboldt-Univ. Berlin (Germany). Inst. fuer Mathematik und Inst. fuer Physik; Pomoni, Elli [DESY Hamburg (Germany). Theory Group; National Technical Univ., Athens (Greece). Physics Div.

    2015-11-15

    We calculate supersymmetric Wilson loops on the ellipsoid for a large class of N=2 SCFT using the localization formula of Hama and Hosomichi. From them we extract the radiation emitted by an accelerating heavy probe quark as well as the entanglement entropy following the recent works of Lewkowycz-Maldacena and Fiol-Gerchkovitz-Komargodski. Comparing our results with the N=4 SYM ones, we obtain interpolating functions f(g{sup 2}) such that a given N=2 SCFT observable is obtained by replacing in the corresponding N=4 SYM result the coupling constant by f(g{sup 2}). These ''exact effective couplings'' encode the finite, relative renormalization between the N = 2 and the N = 4 gluon propagator, they interpolate between the weak and the strong coupling. We discuss the range of their applicability.

  16. Dimension reduction in heterogeneous neural networks: Generalized Polynomial Chaos (gPC) and ANalysis-Of-VAriance (ANOVA)

    Science.gov (United States)

    Choi, M.; Bertalan, T.; Laing, C. R.; Kevrekidis, I. G.

    2016-09-01

    We propose, and illustrate via a neural network example, two different approaches to coarse-graining large heterogeneous networks. Both approaches are inspired from, and use tools developed in, methods for uncertainty quantification (UQ) in systems with multiple uncertain parameters - in our case, the parameters are heterogeneously distributed on the network nodes. The approach shows promise in accelerating large scale network simulations as well as coarse-grained fixed point, periodic solution computation and stability analysis. We also demonstrate that the approach can successfully deal with structural as well as intrinsic heterogeneities.

  17. Exact self-dual skyrmions

    Science.gov (United States)

    Ferreira, L. A.; Shnir, Ya.

    2017-09-01

    We introduce a Skyrme type model with the target space being the sphere S3 and with an action possessing, as usual, quadratic and quartic terms in field derivatives. The novel character of the model is that the strength of the couplings of those two terms are allowed to depend upon the space-time coordinates. The model should therefore be interpreted as an effective theory, such that those couplings correspond in fact to low energy expectation values of fields belonging to a more fundamental theory at high energies. The theory possesses a self-dual sector that saturates the Bogomolny bound leading to an energy depending linearly on the topological charge. The self-duality equations are conformally invariant in three space dimensions leading to a toroidal ansatz and exact self-dual Skyrmion solutions. Those solutions are labelled by two integers and, despite their toroidal character, the energy density is spherically symmetric when those integers are equal and oblate or prolate otherwise.

  18. Exact Solutions in Modified Gravity Models

    Directory of Open Access Journals (Sweden)

    Valery V. Obukhov

    2012-06-01

    Full Text Available We review the exact solutions in modified gravity. It is one of the main problems of mathematical physics for the gravity theory. One can obtain an exact solution if the field equations reduce to a system of ordinary differential equations. In this paper we consider a number of exact solutions obtained by the method of separation of variables. Some applications to Cosmology and BH entropy are briefly mentioned.

  19. Exact Solutions in Modified Gravity Models

    CERN Document Server

    Makarenko, Andrey N

    2012-01-01

    We review the exact solutions in modified gravity. It is one of the main problems of mathematical physics for the gravity theory. One can obtain an exact solution if the field equations reduce to a system of ordinary differential equations. In this paper we consider a number of exact solutions obtained by the method of separation of variables. Some applications to Cosmology and BH entropy are briefly mentioned.

  20. The drag reduction research of the additives in the heating network%添加剂在供热管网中的减阻研究

    Institute of Scientific and Technical Information of China (English)

    韦节廷; 倪兵

    2011-01-01

    This paper mainly studies the drag reduction characteristics of the heating system at various temperatures,and compares the characteristics of water with additives cetyltrimethyl ammonium chloride(CTAC) and polyacrylamide(PAM).Ac-cording to experimental data,we can see that in 30 ℃ heating network system,the effect of adding polyacrylamide is the best.The drag reduction of additive is gradually reduced with the increasing of temprature.In 60 ℃,the polyacrylamide loses the drag reduction,and pressure loss of heating network system increased.The highest friction reduction efficiency with 20ppmCTAC can reach 25.7%,and the highest friction reduction efficiency with polyacrylamide could reach 40.68%.%主要进行了供热系统在不同温度时的清水、添入十六烷基三甲基氯化铵(CTAC)和聚丙烯酰胺(PAM)时减阻特性的比较研究,通过实验数据可以得出,30℃时在供热管网系统中添入聚丙烯酰胺减阻效果最佳,随着温度升高减租剂减阻性能逐渐降低,聚丙烯酰胺到60℃时丧失减阻性能并使热网压损增大。CTAC最大减阻效果达到25.7%,聚丙烯酰胺最高达到40.68%。

  1. Exact Surface States in Photonic Superlattices

    CERN Document Server

    Xie, Qiongtao

    2012-01-01

    We develop an analytical method to derive exact surface states in photonic superlattices. In a kind of infinite bichromatic superlattices satisfying some certain conditions, we analytically obtain their in-gap states, which are superpositions of finite numbers of unstable Bloch waves. By using the unstable in-gap states, we construct exactly several stable surface states in various photonic superlattices. We analytically explore the parametric dependence of these exact surface states. Our analysis provides an exact demonstration for the existence of surface states and would be also helpful to understand surface states in other lattice systems.

  2. Exact boundary controllability of nodal profile for quasilinear hyperbolic systems

    CERN Document Server

    Li, Tatsien; Gu, Qilong

    2016-01-01

    This book provides a comprehensive overview of the exact boundary controllability of nodal profile, a new kind of exact boundary controllability stimulated by some practical applications. This kind of controllability is useful in practice as it does not require any precisely given final state to be attained at a suitable time t=T by means of boundary controls, instead it requires the state to exactly fit any given demand (profile) on one or more nodes after a suitable time t=T by means of boundary controls. In this book we present a general discussion of this kind of controllability for general 1-D first order quasilinear hyperbolic systems and for general 1-D quasilinear wave equations on an interval as well as on a tree-like network using a modular-structure construtive method, suggested in LI Tatsien's monograph "Controllability and Observability for Quasilinear Hyperbolic Systems"(2010), and we establish a complete theory on the local exact boundary controllability of nodal profile for 1-D quasilinear hyp...

  3. An Exact Relaxation of Clustering

    DEFF Research Database (Denmark)

    Mørup, Morten; Hansen, Lars Kai

    2009-01-01

    of clustering problems such as the K-means objective and pairwise clustering as well as graph partition problems, e.g., for community detection in complex networks. In particular we show that a relaxation to the simplex can be given for which the extreme solutions are stable hard assignment solutions and vice......Continuous relaxation of hard assignment clustering problems can lead to better solutions than greedy iterative refinement algorithms. However, the validity of existing relaxations is contingent on problem specific fuzzy parameters that quantify the level of similarity between the original...... versa. Based on the new relaxation we derive the SR-clustering algorithm that has the same complexity as traditional greedy iterative refinement algorithms but leading to significantly better partitions of the data. A Matlab implementation of the SR-clustering algorithm is available for download....

  4. Extensin network formation in Vitis vinifera callus cells is an essential and causal event in rapid and H2O2-induced reduction in primary cell wall hydration

    Directory of Open Access Journals (Sweden)

    MacDougall Alistair J

    2011-06-01

    Full Text Available Abstract Background Extensin deposition is considered important for the correct assembly and biophysical properties of primary cell walls, with consequences to plant resistance to pathogens, tissue morphology, cell adhesion and extension growth. However, evidence for a direct and causal role for the extensin network formation in changes to cell wall properties has been lacking. Results Hydrogen peroxide treatment of grapevine (Vitis vinifera cv. Touriga callus cell walls was seen to induce a marked reduction in their hydration and thickness. An analysis of matrix proteins demonstrated this occurs with the insolubilisation of an abundant protein, GvP1, which displays a primary structure and post-translational modifications typical of dicotyledon extensins. The hydration of callus cell walls free from saline-soluble proteins did not change in response to H2O2, but fully regained this capacity after addition of extensin-rich saline extracts. To assay the specific contribution of GvP1 cross-linking and other wall matrix proteins to the reduction in hydration, GvP1 levels in cell walls were manipulated in vitro by binding selected fractions of extracellular proteins and their effect on wall hydration during H2O2 incubation assayed. Conclusions This approach allowed us to conclude that a peroxidase-mediated formation of a covalently linked network of GvP1 is essential and causal in the reduction of grapevine callus wall hydration in response to H2O2. Importantly, this approach also indicated that extensin network effects on hydration was only partially irreversible and remained sensitive to changes in matrix charge. We discuss this mechanism and the importance of these changes to primary wall properties in the light of extensin distribution in dicotyledons.

  5. Exact Coleman-de Luccia Instantons

    CERN Document Server

    Kanno, Sugumi

    2011-01-01

    We present exact Coleman-de Luccia (CdL) instantons, which describe vacuum decay from Anti de Sitter (AdS) space, de Sitter (dS) space and Minkowski space to AdS space. We systematically obtain these exact solutions by considering deformation of Hawking-Moss (HM) instantons. We analytically calculate decay rates and discuss a subtlety in the interpretation.

  6. Exact Solutions for Einstein's Hyperbolic Geometric Flow

    Institute of Scientific and Technical Information of China (English)

    HE Chun-Lei

    2008-01-01

    In this paper we investigate the Einstein's hyperbolic geometric flow and obtain some interesting exact solutions for this kind of flow. Many interesting properties of these exact solutions have also been analyzed and we believe that these properties of Einstein's hyperbolic geometric flow are very helpful to understanding the Einstein equations and the hyperbolic geometric flow.

  7. Conjugation-uniqueness of exact Borel subalgebras

    Institute of Scientific and Technical Information of China (English)

    张跃辉

    1999-01-01

    It is proved that the exact Borel subalgebras of a basic quasi-hereditary algebra are conjugate to each other. Moreover, the inner automorphism group of a basic quasi-hereditary algebra acts transitively on the set of its exact Borel subalgebras.

  8. Exact, almost and delayed fault detection

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Saberi, Ali; Stoorvogel, Anton A.;

    1999-01-01

    Considers the problem of fault detection and isolation while using zero or almost zero threshold. A number of different fault detection and isolation problems using exact or almost exact disturbance decoupling are formulated. Solvability conditions are given for the formulated design problems. Th...

  9. An alternative to exact renormalization equations

    OpenAIRE

    Alexandre, Jean

    2005-01-01

    An alternative point of view to exact renormalization equations is discussed, where quantum fluctuations of a theory are controlled by the bare mass of a particle. The procedure is based on an exact evolution equation for the effective action, and recovers usual renormalization results.

  10. Simultaneous influence of gas mixture composition and process temperature on Fe2O3->FeO reduction kinetics: neural network modeling

    Directory of Open Access Journals (Sweden)

    K. Piotrowski

    2005-09-01

    Full Text Available The kinetics of Fe2O3->FeO reaction was investigated. The thermogravimetric (TGA data covered the reduction of hematite both by pure species (nitrogen diluted CO or H2 and by their mixture. The conventional analysis has indicated that initially the reduction of hematite is a complex, surface controlled process, however once a thin layer of lower oxidation state iron oxides (magnetite, wüstite is formed on the surface, it changes to diffusion control. Artificial Neural Network (ANN has proved to be a convenient tool for modeling of this complex, heterogeneous reaction runs within the both (kinetic and diffusion regions, correctly considering influence of temperature and gas composition effects and their complex interactions. ANN's model shows the capability to mimic some extreme (minimum of the reaction rate within the determined temperature window, while the Arrhenius dependency is of limited use.

  11. Study on dioxygen reduction by mutational modifications of the hydrogen bond network leading from bulk water to the trinuclear copper center in bilirubin oxidase

    Energy Technology Data Exchange (ETDEWEB)

    Morishita, Hirotoshi; Kurita, Daisuke; Kataoka, Kunishige; Sakurai, Takeshi, E-mail: tsakurai@se.kanazawa-u.ac.jp

    2014-07-18

    Highlights: • Proton transport pathway in bilirubin oxidase was mutated. • Two intermediates in the dioxygen reduction steps were trapped and characterized. • A specific glutamate for dioxygen reduction by multicopper oxidases was identified. - Abstract: The hydrogen bond network leading from bulk water to the trinuclear copper center in bilirubin oxidase is constructed with Glu463 and water molecules to transport protons for the four-electron reduction of dioxygen. Substitutions of Glu463 with Gln or Ala were attributed to virtually complete loss or significant reduction in enzymatic activities due to an inhibition of the proton transfer steps to dioxygen. The single turnover reaction of the Glu463Gln mutant afforded the highly magnetically interacted intermediate II (native intermediate) with a broad g = 1.96 electron paramagnetic resonance signal detectable at cryogenic temperatures. Reactions of the double mutants, Cys457Ser/Glu463Gln and Cys457Ser/Glu463Ala afforded the intermediate I (peroxide intermediate) because the type I copper center to donate the fourth electron to dioxygen was vacant in addition to the interference of proton transport due to the mutation at Glu463. The intermediate I gave no electron paramagnetic resonance signal, but the type II copper signal became detectable with the decay of the intermediate I. Structural and functional similarities between multicopper oxidases are discussed based on the present mutation at Glu463 in bilirubin oxidase.

  12. EXACT2: the semantics of biomedical protocols.

    Science.gov (United States)

    Soldatova, Larisa N; Nadis, Daniel; King, Ross D; Basu, Piyali S; Haddi, Emma; Baumlé, Véronique; Saunders, Nigel J; Marwan, Wolfgang; Rudkin, Brian B

    2014-01-01

    The reliability and reproducibility of experimental procedures is a cornerstone of scientific practice. There is a pressing technological need for the better representation of biomedical protocols to enable other agents (human or machine) to better reproduce results. A framework that ensures that all information required for the replication of experimental protocols is essential to achieve reproducibility. To construct EXACT2 we manually inspected hundreds of published and commercial biomedical protocols from several areas of biomedicine. After establishing a clear pattern for extracting the required information we utilized text-mining tools to translate the protocols into a machine amenable format. We have verified the utility of EXACT2 through the successful processing of previously 'unseen' (not used for the construction of EXACT2)protocols. We have developed the ontology EXACT2 (EXperimental ACTions) that is designed to capture the full semantics of biomedical protocols required for their reproducibility. The paper reports on a fundamentally new version EXACT2 that supports the semantically-defined representation of biomedical protocols. The ability of EXACT2 to capture the semantics of biomedical procedures was verified through a text mining use case. In this EXACT2 is used as a reference model for text mining tools to identify terms pertinent to experimental actions, and their properties, in biomedical protocols expressed in natural language. An EXACT2-based framework for the translation of biomedical protocols to a machine amenable format is proposed. The EXACT2 ontology is sufficient to record, in a machine processable form, the essential information about biomedical protocols. EXACT2 defines explicit semantics of experimental actions, and can be used by various computer applications. It can serve as a reference model for for the translation of biomedical protocols in natural language into a semantically-defined format.

  13. The value of supply security The cost of power interruptions: Economic input for damage reduction and investment in networks

    NARCIS (Netherlands)

    de Nooij, M.; Koopmans, C.C.; Bijvoet, C.

    2007-01-01

    Most research into the reliability of electricity supply focuses on the suppliers. Reductions in the number of power interruptions will often be possible, but are often very costly. These costs will eventually be borne by electricity users. This paper studies the value of supply security in order to

  14. Algorithms and Complexity Results for Exact Bayesian Structure Learning

    CERN Document Server

    Ordyniak, Sebastian

    2012-01-01

    Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian structure learning under graph theoretic restrictions on the super-structure. The super-structure (a concept introduced by Perrier, Imoto, and Miyano, JMLR 2008) is an undirected graph that contains as subgraphs the skeletons of solution networks. Our results apply to several variants of score-based Bayesian structure learning where the score of a network decomposes into local scores of its nodes. Results: We show that exact Bayesian structure learning can be carried out in non-uniform polynomial time if the super-structure has bounded treewidth and in linear time if in addition the super-structure has bounded maximum degree. We complement this with a number of hardness results. We show that both restrictions (treewidth and degree) are essential and cannot be dropped without loosing uniform ...

  15. Formulation of a Network and the Study of Reaction Paths for the Sustainable Reduction of CO2 Emissions

    DEFF Research Database (Denmark)

    Frauzem, Rebecca; Kongpanna, Pichayapan; Roh, Kosan

    carbonate (DMC) [2]. In this work, through a computer-aided framework for process network synthesis-design, a network of conversion processes that all use emitted CO2 is investigated. CO2 is emitted into the environment from various sources: power generation, industrial processes, transportation...... and commercial processes. Within these there are high-purity emissions and low-purity emissions. Rather than sending these to the atmosphere, it is possible to collect them and use them for other purposes. Targeting some of the largest contributors: power generation, manufacturing, chemical industry...... through the reactions. Studies and detailed simulations have been performed on CO2 conversion to methanol, synthesis gas processes, dimethyl carbonate production, and other processes. The detailed simulations are performed on the paths that are selected based on basic calculations on each path. Then...

  16. Exact Renormalization Group for Point Interactions

    CERN Document Server

    Eröncel, Cem

    2014-01-01

    Renormalization is one of the deepest ideas in physics, yet its exact implementation in any interesting problem is usually very hard. In the present work, following the approach by Glazek and Maslowski in the flat space, we will study the exact renormalization of the same problem in a nontrivial geometric setting, namely in the two dimensional hyperbolic space. Delta function potential is an asymptotically free quantum mechanical problem which makes it resemble non-abelian gauge theories, yet it can be treated exactly in this nontrivial geometry.

  17. Quaternionic formulation of the exact parity model

    Energy Technology Data Exchange (ETDEWEB)

    Brumby, S.P.; Foot, R.; Volkas, R.R.

    1996-02-28

    The exact parity model (EPM) is a simple extension of the standard model which reinstates parity invariance as an unbroken symmetry of nature. The mirror matter sector of the model can interact with ordinary matter through gauge boson mixing, Higgs boson mixing and, if neutrinos are massive, through neutrino mixing. The last effect has experimental support through the observed solar and atmospheric neutrino anomalies. In the paper it is shown that the exact parity model can be formulated in a quaternionic framework. This suggests that the idea of mirror matter and exact parity may have profound implications for the mathematical formulation of quantum theory. 13 refs.

  18. EXACT RENORMALIZATION GROUP FOR POINT INTERACTIONS

    Directory of Open Access Journals (Sweden)

    Osman Teoman Turgut Teoman Turgut

    2014-04-01

    Full Text Available Renormalization is one of the deepest ideas in physics, yet its exact implementation in any interesting problem is usually very hard. In the present work, following the approach by Glazek and Maslowski in the flat space, we will study the exact renormalization of the same problem in a nontrivial geometric setting, namely in the two dimensional hyperbolic space. Delta function potential is an asymptotically free quantum mechanical problem which makes it resemble nonabelian gauge theories, yet it can be treated exactly in this nontrivial geometry.

  19. High Concentration of Heat Pumps in Suburban Areas and Reduction of Their Impact on the Electricity Network

    OpenAIRE

    Pruissen, O.P. van; Kamphuis, I.G.

    2011-01-01

    One of the challenges of the near future for a more renewable Dutch electricity infrastructure is the embedding of high concentrations of heat pumps in currently built domestic residences. In the Dutch situation demand of electricity occurs simultaneously with demand of heat, high electricity peak loads in the low voltage network are expected. This study focuses on domestic residences with high peak loads at substations when heating is provided merely by heat pumps with additional electric re...

  20. Selection of bi-level image compression method for reduction of communication energy in wireless visual sensor networks

    Science.gov (United States)

    Khursheed, Khursheed; Imran, Muhammad; Ahmad, Naeem; O'Nils, Mattias

    2012-06-01

    Wireless Visual Sensor Network (WVSN) is an emerging field which combines image sensor, on board computation unit, communication component and energy source. Compared to the traditional wireless sensor network, which operates on one dimensional data, such as temperature, pressure values etc., WVSN operates on two dimensional data (images) which requires higher processing power and communication bandwidth. Normally, WVSNs are deployed in areas where installation of wired solutions is not feasible. The energy budget in these networks is limited to the batteries, because of the wireless nature of the application. Due to the limited availability of energy, the processing at Visual Sensor Nodes (VSN) and communication from VSN to server should consume as low energy as possible. Transmission of raw images wirelessly consumes a lot of energy and requires higher communication bandwidth. Data compression methods reduce data efficiently and hence will be effective in reducing communication cost in WVSN. In this paper, we have compared the compression efficiency and complexity of six well known bi-level image compression methods. The focus is to determine the compression algorithms which can efficiently compress bi-level images and their computational complexity is suitable for computational platform used in WVSNs. These results can be used as a road map for selection of compression methods for different sets of constraints in WVSN.

  1. Fast Exact Euclidean Distance (FEED) Transformation

    NARCIS (Netherlands)

    Schouten, Theo; Broek, van den Egon; Kittler, J.; Petrou, M.; Nixon, M.

    2004-01-01

    Fast Exact Euclidean Distance (FEED) transformation is introduced, starting from the inverse of the distance transformation. The prohibitive computational cost of a naive implementation of traditional Euclidean Distance Transformation, is tackled by three operations: restriction of both the number o

  2. An Exact Black Hole Entropy Bound

    CERN Document Server

    Birmingham, Daniel; Birmingham, Danny; Sen, Siddhartha

    2001-01-01

    We show that a Rademacher expansion can be used to establish an exact bound for the entropy of black holes within a conformal field theory framework. This convergent expansion includes all subleading corrections to the Bekenstein-Hawking term.

  3. Exact Mappings in Condensed Matter Physics

    OpenAIRE

    Lee, Ching Hua

    2016-01-01

    Condensed matter systems are complex yet simple. Amidst their complexity, one often find order specified by not more than a few parameters. Key to such a reductionistic description is an appropriate choice of basis, two of which I shall describe in this thesis. The first, an exact mapping known as the Wannier State Representation (WSR), provides an exact Hilbert space correspondence between two intensely-studied topological systems, the Fractional Quantum Hall (FQH) and Fractional Chern Insul...

  4. New exact wave solutions for Hirota equation

    Indian Academy of Sciences (India)

    M Eslami; M A Mirzazadeh; A Neirameh

    2015-01-01

    In this paper, we construct the topological or dark solitons of Hirota equation by using the first integral method. This approach provides first integrals in polynomial form with a high accuracy for two-dimensional plane autonomous systems. Exact soliton solution is constructed through the established first integrals. This method is a powerful tool for searching exact travelling solutions of nonlinear partial differential equations (NPDEs) in mathematical physics.

  5. Exactly solvable one-dimensional inhomogeneous models

    Energy Technology Data Exchange (ETDEWEB)

    Derrida, B.; France, M.M.; Peyriere, J.

    1986-11-01

    The authors present a simple way of constructing one-dimensional inhomogeneous models (random or quasiperiodic) which can be solved exactly. They treat the example of an Ising chain in a varying magnetic field, but their procedure can easily be extended to other one-dimensional inhomogeneous models. For all the models they can construct, the free energy and its derivatives with respect to temperature can be computed exactly at one particular temperature.

  6. Exact Algorithms for Solving Stochastic Games

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Koucky, Michal; Lauritzen, Niels;

    2012-01-01

    Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.......Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games....

  7. New exact solutions in standard inflationary models

    CERN Document Server

    Chervon, S V; Shchigolev, V K

    1997-01-01

    The exact solutions in the standard inflationary model based on the self-interacting scalar field minimally coupled to gravity are considered. The shape's freedom of the self-interacting potential $V(\\phi)$ is postulated to obtain a new set of the exact solutions in the framework of Friedmann-Robertson-Walker Universes. The general solution was found in the case of power law inflation. We obtained new solutions and compared them with obtained ones earlir for the exponential type inflation.

  8. The NADPH metabolic network regulates human αB-crystallin cardiomyopathy and reductive stress in Drosophila melanogaster.

    Directory of Open Access Journals (Sweden)

    Heng B Xie

    2013-06-01

    Full Text Available Dominant mutations in the alpha-B crystallin (CryAB gene are responsible for a number of inherited human disorders, including cardiomyopathy, skeletal muscle myopathy, and cataracts. The cellular mechanisms of disease pathology for these disorders are not well understood. Among recent advances is that the disease state can be linked to a disturbance in the oxidation/reduction environment of the cell. In a mouse model, cardiomyopathy caused by the dominant CryAB(R120G missense mutation was suppressed by mutation of the gene that encodes glucose 6-phosphate dehydrogenase (G6PD, one of the cell's primary sources of reducing equivalents in the form of NADPH. Here, we report the development of a Drosophila model for cellular dysfunction caused by this CryAB mutation. With this model, we confirmed the link between G6PD and mutant CryAB pathology by finding that reduction of G6PD expression suppressed the phenotype while overexpression enhanced it. Moreover, we find that expression of mutant CryAB in the Drosophila heart impaired cardiac function and increased heart tube dimensions, similar to the effects produced in mice and humans, and that reduction of G6PD ameliorated these effects. Finally, to determine whether CryAB pathology responds generally to NADPH levels we tested mutants or RNAi-mediated knockdowns of phosphogluconate dehydrogenase (PGD, isocitrate dehydrogenase (IDH, and malic enzyme (MEN, the other major enzymatic sources of NADPH, and we found that all are capable of suppressing CryAB(R120G pathology, confirming the link between NADP/H metabolism and CryAB.

  9. The NADPH metabolic network regulates human αB-crystallin cardiomyopathy and reductive stress in Drosophila melanogaster.

    Science.gov (United States)

    Xie, Heng B; Cammarato, Anthony; Rajasekaran, Namakkal S; Zhang, Huali; Suggs, Jennifer A; Lin, Ho-Chen; Bernstein, Sanford I; Benjamin, Ivor J; Golic, Kent G

    2013-06-01

    Dominant mutations in the alpha-B crystallin (CryAB) gene are responsible for a number of inherited human disorders, including cardiomyopathy, skeletal muscle myopathy, and cataracts. The cellular mechanisms of disease pathology for these disorders are not well understood. Among recent advances is that the disease state can be linked to a disturbance in the oxidation/reduction environment of the cell. In a mouse model, cardiomyopathy caused by the dominant CryAB(R120G) missense mutation was suppressed by mutation of the gene that encodes glucose 6-phosphate dehydrogenase (G6PD), one of the cell's primary sources of reducing equivalents in the form of NADPH. Here, we report the development of a Drosophila model for cellular dysfunction caused by this CryAB mutation. With this model, we confirmed the link between G6PD and mutant CryAB pathology by finding that reduction of G6PD expression suppressed the phenotype while overexpression enhanced it. Moreover, we find that expression of mutant CryAB in the Drosophila heart impaired cardiac function and increased heart tube dimensions, similar to the effects produced in mice and humans, and that reduction of G6PD ameliorated these effects. Finally, to determine whether CryAB pathology responds generally to NADPH levels we tested mutants or RNAi-mediated knockdowns of phosphogluconate dehydrogenase (PGD), isocitrate dehydrogenase (IDH), and malic enzyme (MEN), the other major enzymatic sources of NADPH, and we found that all are capable of suppressing CryAB(R120G) pathology, confirming the link between NADP/H metabolism and CryAB.

  10. Exact sampling of graphs with prescribed degree correlations

    CERN Document Server

    Bassler, Kevin E; Erdős, Péter L; Miklós, István; Toroczkai, Zoltán

    2015-01-01

    Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree. Conversely, in biological and technological networks, high-degree nodes tend to be linked with low-degree nodes. Degree correlations also affect the dynamics of processes supported by a network structure, such as the spread of opinions or epidemics. The proper modelling of these systems, i.e., without uncontrolled biases, requires the sampling of networks with a specified set of constraints. We present a solution to the sampling problem when the constraints imposed are the degree correlations. In particular, we develop an efficient and exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself. Our algorithm always pro...

  11. Transforming waste biomass with an intrinsically porous network structure into porous nitrogen-doped graphene for highly efficient oxygen reduction.

    Science.gov (United States)

    Zhou, Huang; Zhang, Jian; Amiinu, Ibrahim Saana; Zhang, Chenyu; Liu, Xiaobo; Tu, Wenmao; Pan, Mu; Mu, Shichun

    2016-04-21

    Porous nitrogen-doped graphene with a very high surface area (1152 m(2) g(-1)) is synthesized by a novel strategy using intrinsically porous biomass (soybean shells) as a carbon and nitrogen source via calcination and KOH activation. To redouble the oxygen reduction reaction (ORR) activity by tuning the doped-nitrogen content and type, ammonia (NH3) is injected during thermal treatment. Interestingly, this biomass-derived graphene catalyst exhibits the unique properties of mesoporosity and high pyridine-nitrogen content, which contribute to the excellent oxygen reduction performance. As a result, the onset and half-wave potentials of the new metal-free non-platinum catalyst reach -0.009 V and -0.202 V (vs. SCE), respectively, which is very close to the catalytic activity of the commercial Pt/C catalyst in alkaline media. Moreover, our catalyst has a higher ORR stability and stronger CO and CH3OH tolerance than Pt/C in alkaline media. Importantly, in acidic media, the catalyst also exhibits good ORR performance and higher ORR stability compared to Pt/C.

  12. The exact Laplacian spectrum for the Dyson hierarchical network

    CERN Document Server

    Agliari, Elena

    2016-01-01

    We consider the Dyson hierarchical graph $\\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\\sigma \\in (1/2, 1]$. Exploiting the deterministic recursivity through which $\\mathcal{G}$ is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and the relaxation modes), this result allows addressing analytically a large class of problems. In particular, as examples of applications, we study the random walk and the continuous-time quantum walk embedded in $\\mathcal{G}$, and the relaxation times of a polymer whose structure is described by $\\mathcal{G}$.

  13. The exact Laplacian spectrum for the Dyson hierarchical network

    Science.gov (United States)

    Agliari, Elena; Tavani, Flavia

    2017-01-01

    We consider the Dyson hierarchical graph , that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter σ ∈ (1/2, 1]. Exploiting the deterministic recursivity through which is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and relaxation modes), this result allows addressing analytically a large class of problems. In particular, as examples of applications, we study the random walk and the continuous-time quantum walk embedded in , the relaxation times of a polymer whose structure is described by , and the community structure of in terms of modularity measures.

  14. Exact solutions for a class of quasi-exactly solvable models: A unified treatment

    Science.gov (United States)

    Hatami, N.; Setare, M. R.

    2017-07-01

    The exact solution of the Schrödinger equation for the four quasi-exactly solvable potentials is presented using the functional Bethe ansatz method. It is shown that all models give rise to the same basic differential equation which is quasi-exactly solvable. The eigenvalues, eigenfunctions and the allowed potential parameters are given for each of the four models in terms of the roots of a set of algebraic Bethe ansatz equations.

  15. Placement of DG and Capacitor for Loss Reduction, Reliability and Voltage Improvement in Distribution Networks Using BPSO

    Directory of Open Access Journals (Sweden)

    Reza Baghipour

    2012-11-01

    Full Text Available This paper presents multi-objective function for optimally determining the size and location of distributed generation (DG and capacitor in distribution systems for power loss minimization, reliability and voltage improvement. The objective function proposed in this paper includes reliability index, active power loss index, DG's and capacitor's investment cost index and voltage profile index which is minimized using binary particle swarm optimization algorithm (BPSO. The effectiveness of the proposed method is examined in the 10 and 33 bus test systems and comparative studies are conducted before and after DG and capacitor installation in the test systems. Results illustrate significant losses reduction and voltage profile and reliability improvement with presence of DG unit and capacitor.

  16. Energy Consumption in Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    JIN Yan; WANG Ling; YANG Xiao-zong; WEN Dong-xin

    2007-01-01

    Wireless sensor networks (WSNs) can be used to collect surrounding data by multi-hop. As sensor networks have the constrained and not rechargeable energy resource, energy efficiency is an important design issue for its topology. In this paper, the energy consumption issue under the different topology is studied. We derive the exact mathematical expression of energy consumption for the fiat and clustering scheme, respectively. Then the energy consumptions of different schemes are compared. By the comparison, multi-level clustering scheme is more energy efficient in large scale networks. Simulation results demonstrate that our analysis is correct from the view of prolonging the large-scale network lifetime and achieving more power reductions.

  17. 10 kV distribution network line loss analysis and loss reduction measures%10kV配电网线损分析及降损措施

    Institute of Scientific and Technical Information of China (English)

    柴珂

    2015-01-01

    线损率是供电企业的一项重要指标,水电公司的10kV及以下配网线损率偏高,影响电网经济运行。本文通过各方面分析,针对性地提出了相应的降损措施。%Line loss.suggestions is an important index for power supply enterprises. Distribution network line loss.suggestions hydropower company of 10 kv and below is on the high side. Affect the economic operation of power grid. By analyzing various aspects, this paper puts forward the corresponding loss reduction measures.

  18. Exact Sequences in Non-Exact Categories (An Application to Semimodules)

    CERN Document Server

    Abuhlail, Jawad

    2011-01-01

    We consider a notion of exact sequences in any -not necessarily exact- pointed category relative to a given (E;M)-factorization structure. We apply this notion to introduce and investigate a new notion of exact sequences of semimodules over semirings relative to the canonical image factorization. Several homological results are proved using the new notion of exactness including some restricted versions of the Short Five Lemma and the Snake Lemma opening the door for introducing and investigating homology objects in such categories. Our results apply in particular to the variety of commutative monoids extending results in homological varieties to relative homological varieties.

  19. A nitrogen-doped mesoporous carbon containing an embedded network of carbon nanotubes as a highly efficient catalyst for the oxygen reduction reaction.

    Science.gov (United States)

    Li, Jin-Cheng; Zhao, Shi-Yong; Hou, Peng-Xiang; Fang, Ruo-Pian; Liu, Chang; Liang, Ji; Luan, Jian; Shan, Xu-Yi; Cheng, Hui-Ming

    2015-12-01

    A nitrogen-doped mesoporous carbon containing a network of carbon nanotubes (CNTs) was produced for use as a catalyst for the oxygen reduction reaction (ORR). SiO2 nanoparticles were decorated with clusters of Fe atoms to act as catalyst seeds for CNT growth, after which the material was impregnated with aniline. After polymerization of the aniline, the material was pyrolysed and the SiO2 was removed by acid treatment. The resulting carbon-based hybrid also contained some Fe from the CNT growth catalyst and was doped with N from the aniline. The Fe-N species act as active catalytic sites and the CNT network enables efficient electron transport in the material. Mesopores left by the removal of the SiO2 template provide short transport pathways and easy access to ions. As a result, the catalyst showed not only excellent ORR activity, with 59 mV more positive onset potential and 30 mV more positive half-wave potential than a Pt/C catalyst, but also much longer durability and stronger tolerance to methanol crossover than a Pt/C catalyst.

  20. Performing target specific band reduction using artificial neural networks and assessment of its efficacy using various target detection algorithms

    Science.gov (United States)

    Yadav, Deepti; Arora, M. K.; Tiwari, K. C.; Ghosh, J. K.

    2016-04-01

    Hyperspectral imaging is a powerful tool in the field of remote sensing and has been used for many applications like mineral detection, detection of landmines, target detection etc. Major issues in target detection using HSI are spectral variability, noise, small size of the target, huge data dimensions, high computation cost, complex backgrounds etc. Many of the popular detection algorithms do not work for difficult targets like small, camouflaged etc. and may result in high false alarms. Thus, target/background discrimination is a key issue and therefore analyzing target's behaviour in realistic environments is crucial for the accurate interpretation of hyperspectral imagery. Use of standard libraries for studying target's spectral behaviour has limitation that targets are measured in different environmental conditions than application. This study uses the spectral data of the same target which is used during collection of the HSI image. This paper analyze spectrums of targets in a way that each target can be spectrally distinguished from a mixture of spectral data. Artificial neural network (ANN) has been used to identify the spectral range for reducing data and further its efficacy for improving target detection is verified. The results of ANN proposes discriminating band range for targets; these ranges were further used to perform target detection using four popular spectral matching target detection algorithm. Further, the results of algorithms were analyzed using ROC curves to evaluate the effectiveness of the ranges suggested by ANN over full spectrum for detection of desired targets. In addition, comparative assessment of algorithms is also performed using ROC.

  1. Noise and Speckle Reduction in Doppler Blood Flow Spectrograms Using an Adaptive Pulse-Coupled Neural Network

    Directory of Open Access Journals (Sweden)

    Haiyan Li

    2010-01-01

    Full Text Available A novel method, called adaptive pulse coupled neural network (AD-PCNN using a two-stage denoising strategy, is proposed to reduce noise and speckle in the spectrograms of Doppler blood flow signals. AD-PCNN contains an adaptive thresholding PCNN and a threshold decaying PCNN. Firstly, PCNN pulses based on the adaptive threshold filter a part of background noise in the spectrogram while isolating the remained noise and speckles. Subsequently, the speckles and noise of the denoised spectrogram are detected by the pulses generated through the threshold decaying PCNN and then are iteratively removed by the intensity variation to speckle or noise neurons. The relative root mean square (RRMS error of the maximum frequency extracted from the AD-PCNN spectrogram of the simulated Doppler blood flow signals is decreased 25.2% on average compared to that extracted from the MPWD (matching pursuit with Wigner Distribution spectrogram, and the RRMS error of the AD-PCNN spectrogram is decreased 10.8% on average compared to MPWD spectrogram. Experimental results of synthetic and clinical signals show that the proposed method is better than the MPWD in improving the accuracy of the spectrograms and their maximum frequency curves.

  2. Classes of exact Einstein Maxwell solutions

    Science.gov (United States)

    Komathiraj, K.; Maharaj, S. D.

    2007-12-01

    We find new classes of exact solutions to the Einstein Maxwell system of equations for a charged sphere with a particular choice of the electric field intensity and one of the gravitational potentials. The condition of pressure isotropy is reduced to a linear, second order differential equation which can be solved in general. Consequently we can find exact solutions to the Einstein Maxwell field equations corresponding to a static spherically symmetric gravitational potential in terms of hypergeometric functions. It is possible to find exact solutions which can be written explicitly in terms of elementary functions, namely polynomials and product of polynomials and algebraic functions. Uncharged solutions are regainable with our choice of electric field intensity; in particular we generate the Einstein universe for particular parameter values.

  3. Exact coherent structures for the turbulent cascade

    Science.gov (United States)

    Eckhardt, Bruno; Zammert, Stefan

    2016-11-01

    The exact coherent structures that are connected with the transition to turbulence in interior flows usually extend across the full height of the domain. Using exact coherent states that are localized in the shear direction together with scaling ideas for the Navier-Stokes equation that combine length and Reynolds number, we show how such large scale structures can be morphed into smaller scale coherent structures. As the Reynolds number increases, more of these states with ever smaller scales appear, all the way down to the Kolmogorov scale. We present the structure and dynamical properties of several families of exact coherent solution in plane Couette flow, with different degrees of spatial localization: Some of them remain localized in the center and help to built the turbulence cascade, others are localized near the walls and contribute to shaping the boundary layer profile.

  4. Supersymmetric QCD: Exact Results and Strong Coupling

    CERN Document Server

    Dine, Michael; Pack, Lawrence; Park, Chang-Soon; Ubaldi, Lorenzo; Wu, Weitao

    2011-01-01

    We revisit two longstanding puzzles in supersymmetric gauge theories. The first concerns the question of the holomorphy of the coupling, and related to this the possible definition of an exact (NSVZ) beta function. The second concerns instantons in pure gluodynamics, which appear to give sensible, exact results for certain correlation functions, which nonetheless differ from those obtained using systematic weak coupling expansions. For the first question, we extend an earlier proposal of Arkani-Hamed and Murayama, showing that if their regulated action is written suitably, the holomorphy of the couplings is manifest, and it is easy to determine the renormalization scheme for which the NSVZ formula holds. This scheme, however, is seen to be one of an infinite class of schemes, each leading to an exact beta function; the NSVZ scheme, while simple, is not selected by any compelling physical consideration. For the second question, we explain why the instanton computation in the pure supersymmetric gauge theory is...

  5. Exact solutions in three-dimensional gravity

    CERN Document Server

    Garcia-Diaz, Alberto A

    2017-01-01

    A self-contained text, systematically presenting the determination and classification of exact solutions in three-dimensional Einstein gravity. This book explores the theoretical framework and general physical and geometrical characteristics of each class of solutions, and includes information on the researchers responsible for their discovery. Beginning with the physical character of the solutions, these are identified and ordered on the basis of their geometrical invariant properties, symmetries, and algebraic classifications, or from the standpoint of their physical nature, for example electrodynamic fields, fluid, scalar field, or dilaton. Consequently, this text serves as a thorough catalogue on 2+1 exact solutions to the Einstein equations coupled to matter and fields, and on vacuum solutions of topologically massive gravity with a cosmological constant. The solutions are also examined from different perspectives, enabling a conceptual bridge between exact solutions of three- and four-dimensional gravit...

  6. Exact solution of the robust knapsack problem☆

    Science.gov (United States)

    Monaci, Michele; Pferschy, Ulrich; Serafini, Paolo

    2013-01-01

    We consider an uncertain variant of the knapsack problem in which the weight of the items is not exactly known in advance, but belongs to a given interval, and an upper bound is imposed on the number of items whose weight differs from the expected one. For this problem, we provide a dynamic programming algorithm and present techniques aimed at reducing its space and time complexities. Finally, we computationally compare the performances of the proposed algorithm with those of different exact algorithms presented so far in the literature for robust optimization problems. PMID:24187428

  7. Exact two-qubit universal quantum circuit

    CERN Document Server

    Zhang, J; Sastry, S; Whaley, K B; Zhang, Jun; Vala, Jiri; Sastry, Shankar

    2003-01-01

    We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit gates. Each block in this circuit is given in a closed form solution. We also analyze the efficiency of different entangling gates, and find that exactly half of all the controlled-unitary gates can be used to implement two-qubit operations as efficiently as the commonly used CNOT gate.

  8. DFT calculations with the exact functional

    Science.gov (United States)

    Burke, Kieron

    2014-03-01

    I will discuss several works in which we calculate the exact exchange-correlation functional of density functional theory, mostly using the density-matrix renormalization group method invented by Steve White, our collaborator. We demonstrate that a Mott-Hubard insulator is a band metal. We also perform Kohn-Sham DFT calculations with the exact functional and prove that a simple algoritm always converges. But we find convergence becomes harder as correlations get stronger. An example from transport through molecular wires may also be discussed. Work supported by DOE grant DE-SC008696.

  9. Exact Classical Correspondence in Quantum Cosmology

    CERN Document Server

    John, Moncy V

    2014-01-01

    We find a Friedmann model with appropriate matter/energy density such that the solution of the Wheeler-DeWitt equation exactly corresponds to the classical evolution. The well-known problems in quantum cosmology disappear in the resulting coasting evolution. The exact quantum-classical correspondence is demonstrated with the help of the de Broglie-Bohm and modified de Broglie-Bohm approaches to quantum mechanics. It is reassuring that such a solution leads to a robust model for the universe, which agrees well with cosmological expansion indicated by SNe Ia data.

  10. Exact Results for the BTZ Black Hole

    CERN Document Server

    Birmingham, Daniel; Sen, S; Birmingham, Danny; Sachs, Ivo; Sen, Siddhartha

    2001-01-01

    In this review, we summarize exact results for the three-dimensional BTZ black hole. We use rigorous mathematical results to clarify the general structure and properties of this black hole spacetime and its microscopic description. In particular, we study the formation of the black hole by point particle collisions, leading to an exact analytic determination of the Choptuik scaling parameter. We also show that a `No Hair Theorem' follows immediately from a mathematical theorem of hyperbolic geometry, due to Sullivan. A microscopic understanding of the Bekenstein-Hawking entropy, and decay rate for massless scalars, is shown to follow from standard results of conformal field theory.

  11. Exact Chern-Simons / Topological String duality

    CERN Document Server

    Krefl, Daniel

    2015-01-01

    We invoke universal Chern-Simons theory to analytically calculate the exact free energy of the refined topological string on the resolved conifold. In the unrefined limit we reproduce non-perturbative corrections for the resolved conifold found elsewhere in the literature, thereby providing strong evidence that the Chern-Simons / topological string duality is exact, and in particular holds at arbitrary N as well. In the refined case, the non-perturbative corrections we find are novel and appear to be non-trivial. We show that non-perturbatively special treatment is needed for rational valued deformation parameter. Above results are also extend to refined Chern-Simons with orthogonal groups.

  12. Necessity of Exact Calculation for Transition Probability

    Institute of Scientific and Technical Information of China (English)

    LIU Fu-Sui; CHEN Wan-Fang

    2003-01-01

    This paper shows that exact calculation for transition probability can make some systems deviate fromFermi golden rule seriously. This paper also shows that the corresponding exact calculation of hopping rate inducedby phonons for deuteron in Pd-D system with the many-body electron screening, proposed by Ichimaru, can explainthe experimental fact observed in Pd-D system, and predicts that perfection and low-dimension of Pd lattice are veryimportant for the phonon-induced hopping rate enhancement in Pd-D system.

  13. Exact and truncated Coriolis coupling calculations for the S(1D)+HD reaction employing the ground adiabatic electronic state.

    Science.gov (United States)

    Yang, Huan; Han, Keli; Schatz, George C; Smith, Sean C; Hankel, Marlies

    2010-10-21

    We present exact quantum differential cross sections and exact and estimated integral cross sections and branching ratios for the title reaction. We employ a time-dependent wavepacket method as implemented in the DIFFREALWAVE code including all Coriolis couplings and also an adapted DIFFREALWAVE code where the helicity quantum number and with this the Coriolis couplings have been truncated. Our exact differential cross sections at 0.453 eV total energy, one of the experimental energies, show good agreement with the experimental results for one of the product channels. While the truncated calculation present a significant reduction in the computational effort needed they overestimate the exact integral cross sections.

  14. EXACT SOLUTIONS TO NONLINEAR WAVE EQUATION

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    In this paper,we use an invariant set to construct exact solutions to a nonlinear wave equation with a variable wave speed. Moreover,we obtain conditions under which the equation admits a nonclassical symmetry. Several different nonclassical symmetries for equations with different diffusion terms are presented.

  15. Exact Optimum Design of Segmented Thermoelectric Generators

    Directory of Open Access Journals (Sweden)

    M. Zare

    2016-01-01

    Full Text Available A considerable difference between experimental and theoretical results has been observed in the studies of segmented thermoelectric generators (STEGs. Because of simplicity, the approximate methods are widely used for design and optimization of the STEGs. This study is focused on employment of exact method for design and optimization of STEGs and comparison of exact and approximate results. Thus, using new highly efficient thermoelectric materials, four STEGs are proposed to operate in the temperature range of 300 to 1300 kelvins. The proposed STEGs are optimally designed to achieve maximum efficiency. Design and performance characteristics of the optimized generators including maximum conversion efficiency and length of elements are calculated through both exact and approximate methods. The comparison indicates that the approximate method can cause a difference up to 20% in calculation of some design characteristics despite its appropriate results in efficiency calculation. The results also show that the maximum theoretical efficiency of 23.08% is achievable using the new proposed STEGs. Compatibility factor of the selected materials for the proposed STEGs is also calculated using both exact and approximate methods. The comparison indicates a negligible difference in calculation of compatibility factor, despite the considerable difference in calculation of reduced efficiency (temperature independence efficiency.

  16. Exactly solvable models of baryon structure

    CERN Document Server

    Bijker, R

    1998-01-01

    We present a qualitative analysis of the gross features of baryon spectroscopy (masses and form factors) in terms of various exactly solvable models. It is shown that a collective model, in which baryon resonances are interpreted as rotations and vibrations of an oblate symmetric top, provides a good starting point for a more detailed quantitative study.

  17. Exactly solvable models of baryon structure

    Energy Technology Data Exchange (ETDEWEB)

    Bijker, R. [Instituto de Ciencias Nucleares, Universidad Nacional Autonoma de Mexico. Apartado Postal 70-543, 04510 Mexico D.F. (Mexico); Leviatan, A. [Racah Institute of Physics, The Hebrew University. Jerusalem 91904, Israel (Israel)

    1998-12-31

    We present a qualitative analysis of the gross features of baryon spectroscopy (masses and form factors) in terms of various exactly solvable models. It is shown that a collective model, in which baryon resonances are interpreted as rotations and vibrations of an oblate symmetric top, provides a good starting point for a more detailed quantitative study. (Author)

  18. BSA - exact algorithm computing LTS estimate

    CERN Document Server

    Klouda, Karel

    2010-01-01

    The main result of this paper is a new exact algorithm computing the estimate given by the Least Trimmed Squares (LTS). The algorithm works under very weak assumptions. To prove that, we study the respective objective function using basic techniques of analysis and linear algebra.

  19. Exact Vacuum Solutions to the Einstein Equation

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In this paper, the author presents a framework for getting a series of exact vacuum solutions to the Einstein equation. This procedure of resolution is based on a canonical form of the metric. According to this procedure, the Einstein equation can be reduced to some 2-dimensional Laplace-like equations or rotation and divergence equations,which are much convenient for the resolution.

  20. Solitons in nonlocal nonlinear media: Exact solutions

    DEFF Research Database (Denmark)

    Krolikowski, Wieslaw; Bang, Ole

    2001-01-01

    We investigate the propagation of one-dimensional bright and dark spatial solitons in a nonlocal Kerr-like media, in which the nonlocality is of general form. We find an exact analytical solution to the nonlinear propagation equation in the case of weak nonlocality. We study the properties...

  1. Gorensteinness and Tate Cohomology in Exact Categories

    Institute of Scientific and Technical Information of China (English)

    WANG Zhi-cheng

    2015-01-01

    Motivated by the classical Gorenstein homological theory and structure of Tate cohomology, we develop a theory of Gorenstein projective objects and Tate cohomology in an exact category A with enough projectives. We study some properties of Gorenstein projective objects and establish Tate cohomology of objects with finite Gorenstein projective dimension.

  2. Exact internal controllability for shallow shells

    Institute of Scientific and Technical Information of China (English)

    FENG Shaoji; FENG Dexing

    2006-01-01

    The internal control problem is considered, based on the linear displacement equations of shallow shell. It is shown, with some checkable geometric conditions on control region, that the undergoing shallow shell is exactly controllable by using Hilbert uniqueness method (HUM), piecewise multiplier method and Riemannian geometry method. Then some examples are given to show the assumed geometric conditions.

  3. Spectral geometry: two exactly solvable models

    Energy Technology Data Exchange (ETDEWEB)

    Kuperin, Yu.A. (International Solvay Institutes for Physics and Chemistry, C.P. 231, Boulevard du Triomphe, 1050, Brussels (Belgium) Department of Mathematical and Computational Physics, Saint Petersburg State University, 198904, Saint Petersburg (Russian Federation) Institute for Physical Research and Technology, Saint Petersburg (Russian Federation)); Pavlov, B.S. (International Solvay Institutes for Physics and Chemistry, C.P. 231, Boulevard du Triomphe, 1050, Brussels (Belgium) Department of Mathematical and Computational Physics, Saint Petersburg State University, 198904, Saint Petersburg (Russian Federation)); Rudin, G.E. (Department of Mathematical and Computational Physics, Saint Petersburg State University, 198904, Saint Petersburg (Russian Federation)); Vinitsky, S.I. (International Solvay Institutes for Physics and Chemistry, C.P. 231, Boulevard du Triomphe, 1050, Brussels (Belgium) Institute for Physical Research and Technology, Saint Petersburg (Russian Federation) Joi

    1994-10-24

    Two exactly solvable models illustrating the links between spectral properties of Hamiltonians, connections on the induced Hilbert bundles and topological characteristics of the basis spaces are considered. The first of them is based on the extension theory for symmetric operators and the second on the one-dimensional Laplace operator with parametrical boundary conditions. ((orig.))

  4. Exact Solutions in Nonlocal Linear Models

    OpenAIRE

    Vernov, S. Yu.

    2008-01-01

    A general class of cosmological models driven by a nonlocal scalar field inspired by the string field theory is studied. Using the fact that the considering linear nonlocal model is equivalent to an infinite number of local models we have found an exact special solution of the nonlocal Friedmann equations. This solution describes a monotonically increasing Universe with the phantom dark energy.

  5. On Exact and Inexact Differentials and Applications

    Science.gov (United States)

    Cortez, L. A. B.; de Oliveira, E. Capelas

    2017-01-01

    Considering the important role played by mathematical derivatives in the study of physical-chemical processes, this paper discusses the different possibilities and formulations of this concept and its application. In particular, in Chemical Thermodynamics, we study exact differentials associated with the so-called state functions and inexact…

  6. Quantum geometry from phase space reduction

    CERN Document Server

    Conrady, Florian

    2009-01-01

    In this work we give an explicit isomorphism between the usual spin network basis and the direct quantization of the reduced phase space of tetrahedra. The main outcome is a formula that describes the space of SU(2) invariant states by an integral over coherent states satisfying the closure constraint exactly, or equivalently, as an integral over the space of classical tetrahedra. This provides an explicit realization of theorems by Guillemin--Sternberg and Hall that describe the commutation of quantization and reduction. In the final part of the paper, we use our result to express the FK spin foam model as an integral over classical tetrahedra and the asymptotics of the vertex amplitude is determined.

  7. The National Center for Radioecology (NCoRE): A Network of Excellence for Environmental and Human Radiation Risk Reduction - 13365

    Energy Technology Data Exchange (ETDEWEB)

    Kuhne, W.W.; Jannik, G.T.; Farfan, E.B.; Knox, A.S.; Mayer, J.J.; Murray, A.M. [Savannah River National Laboratory, Savannah River Site, Aiken, SC 29808 (United States)

    2013-07-01

    Radioecology in the United States can be traced back to the early 1950's when small research programs were established to address the fate and effects of radionuclides released in the environment from activities at nuclear facilities. These programs focused primarily on local environmental effects, but global radioactive fallout from nuclear weapons testing and the potential for larger scale local releases of radioisotopes resulted in major concerns about the threat, not only to humans, but to other species and to ecosystems that support all life. These concerns were shared by other countries and it was quickly recognized that a multi-disciplinary approach would be required to address and understand the implications of anthropogenic radioactivity in the environment. The management, clean-up and long-term monitoring of legacy wastes at Department of Energy (DOE), Department of Defense (DOD), and Nuclear Regulatory Commission (NRC)-regulated facilities continues to be of concern as long as nuclear operations continue. Research conducted through radioecology programs provides the credible scientific data needed for decision-making purposes. The current status of radioecology programs in the United States are: fragmented with little coordination to identify national strategies and direct programs; suffering from a steadily decreasing funding base; soon to be hampered by closure of key infrastructure; hampered by aging and retiring workforce (loss of technical expertise); and in need of training of young scientists to ensure continuation of the science (no formal graduate education program in radioecology remaining in the U.S.). With these concerns in mind, the Savannah River National Laboratory (SRNL) took the lead to establish the National Center for Radioecology (NCoRE) as a network of excellence of the remaining radioecology expertise in the United States. As part of the NCoRE mission, scientists at SRNL are working with six key partner universities to re

  8. Local Optima Networks of the Quadratic Assignment Problem

    CERN Document Server

    Daolio, Fabio; Ochoa, Gabriela; Tomassini, Marco

    2011-01-01

    Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Problem (QAP). This network model is a reduction of the landscape in which the nodes correspond to the local optima, and the edges account for the notion of adjacency between their basins of attraction. The model was inspired by the notion of 'inherent network' of potential energy surfaces proposed in physical-chemistry. The local optima networks extracted from the so called uniform and real-like QAP instances, show features clearly distinguishing these two types of instances. Apart from a clear confirmation that the search difficulty increases with the problem dimension, the analysis provides new confirming evidence explaining why the real-like instances are easier to solve exactly using heuristic search, while the uniform instances are easier to solve approximately. Although the local optima network model is still under development, w...

  9. Randomized controlled trial of Mindfulness-Based Stress Reduction versus aerobic exercise: effects on the self-referential brain network in social anxiety disorder

    Directory of Open Access Journals (Sweden)

    Philippe eGoldin

    2012-11-01

    Full Text Available Background: Social Anxiety Disorder (SAD is characterized by distorted self-views. The goal of this study was to examine whether Mindfulness-Based Stress Reduction (MBSR alters behavioral and brain measures of negative and positive self-views. Methods: 56 adult patients with generalized SAD were randomly assigned to MBSR or a comparison aerobic exercise (AE program. A self-referential encoding task was administered at baseline and post-intervention to examine changes in behavioral and neural responses in the self-referential brain network during functional magnetic resonance imaging. Patients were cued to decide whether positive and negative social trait adjectives were self-descriptive or in upper case font. Results: Behaviorally, compared to AE, MBSR produced greater decreases in negative self-views, and equivalent increases in positive self-views. Neurally, during negative self vs. case, compared to AE, MBSR led to increased brain responses in the posterior cingulate cortex (PCC. There were no differential changes for positive self vs. case. Secondary analyses showed that changes in endorsement of negative and positive self-views were associated with decreased social anxiety symptom severity for MBSR, but not AE. Additionally, MBSR-related increases in DMPFC activity during negative self-view vs. case were associated with decreased social anxiety-related disability and increased mindfulness. Analysis of neural temporal dynamics revealed MBSR-related changes in the timing of neural responses in the DMPFC and PCC for negative self-view vs. case.Conclusions: These findings suggest that MBSR attenuates maladaptive habitual self-views by facilitating automatic (i.e., uninstructed recruitment of cognitive and attention regulation neural networks. This highlights potentially important links between self-referential and cognitive-attention regulation systems and suggests that MBSR may enhance more adaptive social self-referential processes in

  10. Definition of a unique model for the improvement of the monitoring network and seismic risk reduction of the school buildings in Italy

    Science.gov (United States)

    Greco, M.; Console, R.; Colangelo, A.; Cioè, A.; Trivigno, L.

    2015-12-01

    In the latest decade the safety of the Italian schools against seismic risk is a crucial subject for the Italian legislation as well as to the UN Convention on the DRR and the more specific priorities adopted even within the OECD. Recently, the Italian Parliament approved a law (L98/2013) which launched the Commissioning Safety of School Buildings Plan and the Definition of a Unique Model, to be developed by the CGIAM, in order to improve monitoring network and seismic risk reduction (SRR). The objectives of such a law deals with increasing in the knowledge of public actions aimed to improve the effectiveness of the SRR policy on school buildings. The actions of the CGIAM will consist in the identification of a significant number of school buildings in Italy, mainly in terms of type of construction and material, on which calibrate specific synthetic parameters and test models. Furthermore, the activities are addressed to quantitatively evaluation of intervention efficacy, to set up simple systems of instrumental monitoring, even able to test the possibility of periodical checks of the state of general preservation. The main issues carried on by the CGIAM mainly concern the completion and enrichment of the existing data base of school buildings, even through the collaboration of the Ministries and other relevant Italian research institutions, the evaluation of seismic hazard and site condition analysis as well as the definition of other seismic risk factors. Nevertheless a cost-benefit analysis as well as application and dissemination of such tools are proposed too. At the same time, the CGIAM contributes to the definition of experimental installation and use of a Simplified Accelerometric Monitoring Network for school buildings comprehensive of testing phase on a limited number of structures. The work proposes a synthetic overview of the employed methodologies as well as the first results arising from the research and implementation activities.

  11. Exact solutions for nonlinear foam drainage equation

    Science.gov (United States)

    Zayed, E. M. E.; Al-Nowehy, Abdul-Ghani

    2016-09-01

    In this paper, the modified simple equation method, the exp-function method, the soliton ansatz method, the Riccati equation expansion method and the ( G^' }/G) -expansion method are used to construct exact solutions with parameters of the nonlinear foam drainage equation. When these parameters are taken to be special values, the solitary wave solutions and the trigonometric function solutions are derived from the exact solutions. The obtained results confirm that the proposed methods are efficient techniques for analytic treatments of a wide variety of nonlinear partial differential equations in mathematical physics. We compare our results together with each other yielding from these integration tools. Also, our results have been compared with the well-known results of others.

  12. Exact solutions for nonlinear foam drainage equation

    Science.gov (United States)

    Zayed, E. M. E.; Al-Nowehy, Abdul-Ghani

    2017-02-01

    In this paper, the modified simple equation method, the exp-function method, the soliton ansatz method, the Riccati equation expansion method and the ( G^' }/G)-expansion method are used to construct exact solutions with parameters of the nonlinear foam drainage equation. When these parameters are taken to be special values, the solitary wave solutions and the trigonometric function solutions are derived from the exact solutions. The obtained results confirm that the proposed methods are efficient techniques for analytic treatments of a wide variety of nonlinear partial differential equations in mathematical physics. We compare our results together with each other yielding from these integration tools. Also, our results have been compared with the well-known results of others.

  13. Sampling exactly from the normal distribution

    CERN Document Server

    Karney, Charles F F

    2013-01-01

    An algorithm for sampling exactly from the normal distribution is given. The algorithm reads some number of uniformly distributed random digits in a given base and generates an initial portion of the representation of a normal deviate in the same base. Thereafter, uniform random digits are copied directly into the representation of the normal deviate. Thus, in constrast to existing methods, it is possible to generate normal deviates exactly rounded to any precision with a mean cost that scales linearly in the precision. The method performs no arbitrary precision arithmetic, calls no transcendental functions, and, indeed, uses no floating point arithmetic whatsoever; it uses only simple integer operations. The algorithm is inspired by von Neumann's algorithm for sampling from the exponential distribution; an improvement to von Neumann's algorithm is also given.

  14. Exact cosmological solutions from Hojman conservation quantities

    Energy Technology Data Exchange (ETDEWEB)

    Capozziello, Salvatore, E-mail: capozzie@na.infn.it [Dipartimento di Fisica, Università di Napoli “Federico II”, Napoli (Italy); INFN Sez. di Napoli, Compl. Univ. di Monte S. Angelo, Edificio G, Via Cinthia, I-80126, Napoli (Italy); Roshan, Mahmood, E-mail: rowshan@alumni.ut.ac.ir [Department of Physics, Ferdowsi University of Mashhad, P.O. Box 1436, Mashhad (Iran, Islamic Republic of)

    2013-10-07

    We present a new approach to find exact solutions for cosmological models. By requiring the existence of a symmetry transformation vector for the equations of motion of the given cosmological model (without using either Lagrangian or Hamiltonian), one can find corresponding Hojman conserved quantities. With the help of these conserved quantities, the analysis of the cosmological model can be simplified. In the case of quintessence scalar–tensor models, we show that the Hojman conserved quantities exist for a wide range of V(ϕ)-potentials and allow to find exact solutions for the cosmic scale factor and the scalar field. Finally, we investigate the general cosmological behavior of solutions by adopting a phase-space view.

  15. Exact cosmological solutions from Hojman conservation quantities

    CERN Document Server

    Capozziello, Salvatore

    2013-01-01

    We present a new approach to find exact solutions for cosmological models. By requiring the existence of a symmetry transformation vector for the equations of motion of the given cosmological model (without using either Lagrangian or Hamiltonian), one can find corresponding Hojman conserved quantities. With the help of these conserved quantities, the analysis of the cosmological model can be simplified. In the case of quintessence scalar-tensor models, we show that the Hojman conserved quantities exist for a wide range of V(\\phi)-potentials and allow to find exact solutions for the cosmic scale factor and the scalar field. Finally, we investigate the general cosmological behavior of solutions by adopting a phase-space view.

  16. Representing exact number visually using mental abacus.

    Science.gov (United States)

    Frank, Michael C; Barner, David

    2012-02-01

    Mental abacus (MA) is a system for performing rapid and precise arithmetic by manipulating a mental representation of an abacus, a physical calculation device. Previous work has speculated that MA is based on visual imagery, suggesting that it might be a method of representing exact number nonlinguistically, but given the limitations on visual working memory, it is unknown how MA structures could be stored. We investigated the structure of the representations underlying MA in a group of children in India. Our results suggest that MA is represented in visual working memory by splitting the abacus into a series of columns, each of which is independently stored as a unit with its own detailed substructure. In addition, we show that the computations of practiced MA users (but not those of control participants) are relatively insensitive to verbal interference, consistent with the hypothesis that MA is a nonlinguistic format for exact numerical computation.

  17. Exact four-spinon dynamical correlation function

    CERN Document Server

    Abada, A; Si-Lakhal, B; Seba, S; Abada, As

    1998-01-01

    We discuss some properties of the exact four-spinon dynamical correlation function in the antiferromagnetic spin 1/2 XXX-model the expression of which we derived recently. We show that the region in which it is not identically zero is different from and larger than the spin-wave continuum. We discuss its behavior as a function of the neutron momentum transfer $k$ for fixed values of the neutron energy $\\omega$ and compare it to the one corresponding to the exact two-spinon dynamical correlation function. We show that the overall shapes are quite similar but there are differences that we discuss. Particular is the fact that the symmetry about the axis $k=\\pi$ present in the two-spinon case seems to be lost in the four-spinon one. We finish with concluding remarks.

  18. Exact solution to fractional logistic equation

    Science.gov (United States)

    West, Bruce J.

    2015-07-01

    The logistic equation is one of the most familiar nonlinear differential equations in the biological and social sciences. Herein we provide an exact solution to an extension of this equation to incorporate memory through the use of fractional derivatives in time. The solution to the fractional logistic equation (FLE) is obtained using the Carleman embedding technique that allows the nonlinear equation to be replaced by an infinite-order set of linear equations, which we then solve exactly. The formal series expansion for the initial value solution of the FLE is shown to be expressed in terms of a series of weighted Mittag-Leffler functions that reduces to the well known analytic solution in the limit where the fractional index for the derivative approaches unity. The numerical integration to the FLE provides an excellent fit to the analytic solution. We propose this approach as a general technique for solving a class of nonlinear fractional differential equations.

  19. Exact Relativistic Magnetized Haloes around Rotating Disks

    Directory of Open Access Journals (Sweden)

    Antonio C. Gutiérrez-Piñeres

    2015-01-01

    Full Text Available The study of the dynamics of magnetic fields in galaxies is one of important problems in formation and evolution of galaxies. In this paper, we present the exact relativistic treatment of a rotating disk surrounded by a magnetized material halo. The features of the halo and disk are described by the distributional energy-momentum tensor of a general fluid in canonical form. All the relevant quantities and the metric and electromagnetic potentials are exactly determined by an arbitrary harmonic function only. For instance, the generalized Kuzmin-disk potential is used. The particular class of solutions obtained is asymptotically flat and satisfies all the energy conditions. Moreover, the motion of a charged particle on the halo is described. As far as we know, this is the first relativistic model describing analytically the magnetized halo of a rotating disk.

  20. Exact BPS bound for noncommutative baby Skyrmions

    Energy Technology Data Exchange (ETDEWEB)

    Domrin, Andrei, E-mail: domrin@mi.ras.ru [Department of Mathematics and Mechanics, Moscow State University, Leninskie gory, 119992, GSP-2, Moscow (Russian Federation); Lechtenfeld, Olaf, E-mail: lechtenf@itp.uni-hannover.de [Institut für Theoretische Physik and Riemann Center for Geometry and Physics, Leibniz Universität Hannover, Appelstraße 2, 30167 Hannover (Germany); Linares, Román, E-mail: lirr@xanum.uam.mx [Departamento de Física, Universidad Autónoma Metropolitana Iztapalapa, San Rafael Atlixco 186, C.P. 09340, México D.F. (Mexico); Maceda, Marco, E-mail: mmac@xanum.uam.mx [Departamento de Física, Universidad Autónoma Metropolitana Iztapalapa, San Rafael Atlixco 186, C.P. 09340, México D.F. (Mexico)

    2013-11-25

    The noncommutative baby Skyrme model is a Moyal deformation of the two-dimensional sigma model plus a Skyrme term, with a group-valued or Grassmannian target. Exact abelian solitonic solutions have been identified analytically in this model, with a singular commutative limit. Inside any given Grassmannian, we establish a BPS bound for the energy functional, which is saturated by these baby Skyrmions. This asserts their stability for unit charge, as we also test in second-order perturbation theory.

  1. NEW EXACTLY SOLVABLE SUPERSYMMETRIC PERIODIC POTENTIALS

    Institute of Scientific and Technical Information of China (English)

    LIU KE-JIA; HE LI; ZHOU GUO-LI; WU YU-JIAO

    2001-01-01

    Using the formalism of supersymmetric quantum mechanics, we give an exact solution for a family of onedimensional periodic potentials, which are the supersymmetric partners of the potential proportional to the trigonometric function cos(2x) such that the Schrodinger equation for this potential is named the Mathieu equation mathematically.We show that the new potentials are distinctly different from their original ones. However, both have the same energy band structure. All the potentials obtained in this paper are free of singularities.

  2. EXACT SOLUTIONS OF A DIPOLAR FLUID FLOW

    Institute of Scientific and Technical Information of China (English)

    T. HAYAT

    2003-01-01

    Exact solutions for three canonical flow problems of a dipolar fluid are obtained: (i)The flow of a dipolar fluid due to a suddenly accelerated plate, (ii) The flow generated by periodic oscillation of a plate, (iii) The flow due to plate oscillation in the presence of a transverse magnetic field. The solutions of some interesting flows caused by an arbitrary velocity of the plate and of certain special oscillations are also obtained.

  3. Introduction to Hubbard model and exact diagonalization

    Directory of Open Access Journals (Sweden)

    S. Akbar Jafari

    2008-06-01

    Full Text Available  Hubbard model is an important model in the theory of strongly correlated electron systems. In this contribution we introduce this model and the concepts of electron correlation by building on a tight binding model. After enumerating various methods of tackling the Hubbard model, we introduce the numerical method of exact diagonalization in detail. The book keeping and practical implementation aspects are illustrated with analytically solvable example of two-site Hubbard model.

  4. Exact plane gravitational waves and electromagnetic fields

    OpenAIRE

    Enrico MontanariUniversity of Ferrara and INFN sezione di Ferrara, Italy; Mirco Calura(University of Ferrara and INFN sezione di Ferrara, Italy)

    2000-01-01

    The behaviour of a "test" electromagnetic field in the background of an exact gravitational plane wave is investigated in the framework of Einstein's general relativity. We have expressed the general solution to the de Rham equations as a Fourier-like integral. In the general case we have reduced the problem to a set of ordinary differential equations and have explicitly written the solution in the case of linear polarization of the gravitational wave. We have expressed our ...

  5. Exact axisymmetric Taylor states for shaped plasmas

    Energy Technology Data Exchange (ETDEWEB)

    Cerfon, Antoine J., E-mail: cerfon@cims.nyu.edu; O' Neil, Michael, E-mail: oneil@cims.nyu.edu [Courant Institute of Mathematical Sciences, New York University, New York, New York 10012 (United States)

    2014-06-15

    We present a general construction for exact analytic Taylor states in axisymmetric toroidal geometries. In this construction, the Taylor equilibria are fully determined by specifying the aspect ratio, elongation, and triangularity of the desired plasma geometry. For equilibria with a magnetic X-point, the location of the X-point must also be specified. The flexibility and simplicity of these solutions make them useful for verifying the accuracy of numerical solvers and for theoretical studies of Taylor states in laboratory experiments.

  6. Exact solution of phantom dark energy model

    Institute of Scientific and Technical Information of China (English)

    Wang Wen-Fu; Shui Zheng-Wei; Tang Bin

    2010-01-01

    We investigate the phantom dark energy model derived from the scalar field with a negative kinetic term. By assuming a particular relation between the time derivative of the phantom field and the Hubble function, an exact solution of the model is constructed. Absence of the 'big rip' singularity is shown explicitly. We then derive special features of phantom dark energy model and show that its predictions are consistent with all astrophysical observations.

  7. Coherent states for exactly solvable potentials

    OpenAIRE

    Shreecharan, T.; Panigrahi, Prasanta. K.; Banerji, J.

    2003-01-01

    A general algebraic procedure for constructing coherent states of a wide class of exactly solvable potentials e.g., Morse and P{\\"o}schl-Teller, is given. The method, {\\it a priori}, is potential independent and connects with earlier developed ones, including the oscillator based approaches for coherent states and their generalizations. This approach can be straightforwardly extended to construct more general coherent states for the quantum mechanical potential problems, like the nonlinear co...

  8. Stripe Ansatzs from Exactly Solved Models

    OpenAIRE

    2001-01-01

    Using the Boltzmann weights of classical Statistical Mechanics vertex models we define a new class of Tensor Product Ansatzs for 2D quantum lattice systems, characterized by a strong anisotropy, which gives rise to stripe like structures. In the case of the six vertex model we compute exactly, in the thermodynamic limit, the norm of the ansatz and other observables. Employing this ansatz we study the phase diagram of a Hamiltonian given by the sum of XXZ Hamiltonians along the legs coupled by...

  9. Exact quantization conditions for cluster integrable systems

    Science.gov (United States)

    Franco, Sebastián; Hatsuda, Yasuyuki; Mariño, Marcos

    2016-06-01

    We propose exact quantization conditions for the quantum integrable systems of Goncharov and Kenyon, based on the enumerative geometry of the corresponding toric Calabi-Yau manifolds. Our conjecture builds upon recent results on the quantization of mirror curves, and generalizes a previous proposal for the quantization of the relativistic Toda lattice. We present explicit tests of our conjecture for the integrable systems associated to the resolved {{{C}}3}/{{{Z}}5} and {{{C}}3}/{{{Z}}6} orbifolds.

  10. Exact quantization conditions for cluster integrable systems

    CERN Document Server

    Franco, Sebastian; Marino, Marcos

    2015-01-01

    We propose exact quantization conditions for the quantum integrable systems of Goncharov and Kenyon, based on the enumerative geometry of the corresponding toric Calabi-Yau manifolds. Our conjecture builds upon recent results on the quantization of mirror curves, and generalizes a previous proposal for the quantization of the relativistic Toda lattice. We present explicit tests of our conjecture for the integrable systems associated to the resolved C^3/Z_5 and C^3/Z_6 orbifolds.

  11. On exact solutions of the Bogoyavlenskii equation

    Indian Academy of Sciences (India)

    Yan-Ze Peng; Ming Shen

    2006-09-01

    Exact solutions for the Bogoyavlenskii equation are studied by the travelling wave method and the singular manifold method. It is found that the linear superposition of the shock wave solution and the complex solitary wave solution for the physical field is still a solution of the equation of interest, except for a phase-shift. The dromion-like structures with elastic and nonelastic interactions are found.

  12. EXACT SOLUTIONS FOR GENERAL VARIABLE-COEFFICIENT KdV EQUATION

    Institute of Scientific and Technical Information of China (English)

    LiuXiqiang; JiangSong

    2001-01-01

    By asing the nonclassical method of symmetry reductions, the exact solutions for general variable-coefficient KdV equation with dissipative loss and nonuniformity terms are obtained. When the dissipative loss and nonuniformity terms don't exist, the multisoliton solutions are found and the corresponding Painleve II type equation for the variable-coefficient KdV equation is given.

  13. Exact solutions to the Boltzmann equation by mapping the scattering integral into a differential operator

    Energy Technology Data Exchange (ETDEWEB)

    Zabadal, Jorge; Borges, Volnei; Van der Laan, Flavio T., E-mail: jorge.zabadal@ufrgs.br, E-mail: borges@ufrgs.br, E-mail: ftvdl@ufrgs.br [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Departamento de Engenharia Mecanica. Grupo de Pesquisas Radiologicas; Ribeiro, Vinicius G., E-mail: vinicius_ribeiro@uniritter.edu.br [Centro Universitario Ritter dos Reis (UNIRITTER), Porto Alegre, RS (Brazil); Santos, Marcio G., E-mail: phd.marcio@gmail.com [Universidade Federal do Rio Grande do Sul (UFRGS), Tramandai, RS (Brazil). Departamento Interdisciplinar do Campus Litoral Norte

    2015-07-01

    This work presents a new analytical method for solving the Boltzmann equation. In this formulation, a linear differential operator is applied over the Boltzmann model, in order to produce a partial differential equation in which the scattering term is absent. This auxiliary equation is solved via reduction of order. The exact solution obtained is employed to define a precursor for the buildup factor. (author)

  14. Exact tests for Hardy-Weinberg proportions.

    Science.gov (United States)

    Engels, William R

    2009-12-01

    Exact conditional tests are often required to evaluate statistically whether a sample of diploids comes from a population with Hardy-Weinberg proportions or to confirm the accuracy of genotype assignments. This requirement is especially common when the sample includes multiple alleles and sparse data, thus rendering asymptotic methods, such as the common chi(2)-test, unreliable. Such an exact test can be performed using the likelihood ratio as its test statistic rather than the more commonly used probability test. Conceptual advantages in using the likelihood ratio are discussed. A substantially improved algorithm is described to permit the performance of a full-enumeration exact test on sample sizes that are too large for previous methods. An improved Monte Carlo algorithm is also proposed for samples that preclude full enumeration. These algorithms are about two orders of magnitude faster than those currently in use. Finally, methods are derived to compute the number of possible samples with a given set of allele counts, a useful quantity for evaluating the feasibility of the full enumeration procedure. Software implementing these methods, ExactoHW, is provided.

  15. Stochastic TDHF in an exactly solvable model

    CERN Document Server

    Lacombe, Lionel; Suraud, Eric; Dinh, Phuong Mai

    2016-01-01

    We apply in a schematic model a theory beyond mean-field, namely Stochastic Time-Dependent Hartree-Fock (STDHF), which includes dynamical electron-electron collisions on top of an incoherent ensemble of mean-field states by occasional 2-particle-2-hole ($2p2h$) jumps. The model considered here is inspired by a Lipkin-Meshkov-Glick model of $\\Omega$ particles distributed into two bands of energy and coupled by a two-body interaction. Such a model can be exactly solved (numerically though) for small $\\Omega$. It therefore allows a direct comparison of STDHF and the exact propagation. The systematic impact of the model parameters as the density of states, the excitation energy and the bandwidth is presented and discussed. The time evolution of the STDHF compares fairly well with the exact entropy, as soon as the excitation energy is sufficiently large to allow $2p2h$ transitions. Limitations concerning low energy excitations and memory effects are also discussed.

  16. Exact and Approximate Sizes of Convex Datacubes

    Science.gov (United States)

    Nedjar, Sébastien

    In various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. The notion of data cube has been explored in various ways: iceberg cubes, range cubes, differential cubes or emerging cubes. Previously, we have introduced the concept of convex cube which generalizes all the quoted variants of cubes. More precisely, the convex cube captures all the tuples satisfying a monotone and/or antimonotone constraint combination. This paper is dedicated to a study of the convex cube size. Actually, knowing the size of such a cube even before computing it has various advantages. First of all, free space can be saved for its storage and the data warehouse administration can be improved. However the main interest of this size knowledge is to choose at best the constraints to apply in order to get a workable result. For an aided calibrating of constraints, we propose a sound characterization, based on inclusion-exclusion principle, of the exact size of convex cube as long as an upper bound which can be very quickly yielded. Moreover we adapt the nearly optimal algorithm HyperLogLog in order to provide a very good approximation of the exact size of convex cubes. Our analytical results are confirmed by experiments: the approximated size of convex cubes is really close to their exact size and can be computed quasi immediately.

  17. Exact Eigenfunctions of a Chaotic System

    CERN Document Server

    Ausländer, O M

    1997-01-01

    The interest in the properties of quantum systems, whose classical dynamics are chaotic, derives from their abundance in nature. The spectrum of such systems can be related, in the semiclassical approximation (SCA), to the unstable classical periodic orbits, through Gutzwiller's trace formula. The class of systems studied in this work, tiling billiards on the pseudo-sphere, is special in this correspondence being exact, via Selberg's trace formula. In this work, an exact expression for Green's function (GF) and the eigenfunctions (EF) of tiling billiards on the pseudo-sphere, whose classical dynamics are chaotic, is derived. GF is shown to be equal to the quotient of two infinite sums over periodic orbits, where the denominator is the spectral determinant. Such a result is known to be true for typical chaotic systems, in the leading SCA. From the exact expression for GF, individual EF can be identified. In order to obtain a SCA by finite series for the infinite sums encountered, resummation by analytic contin...

  18. Exact outage analysis of incremental decode-and-forward opportunistic relaying

    KAUST Repository

    Tourki, Kamel

    2010-11-01

    In this paper, we investigate a dual-hop decode-andforward opportunistic relaying scheme where the selected relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we derive exact closed-form expression for the outage probability based on the exact statistics of each hop. Furthermore, we perform asymptotic analysis and we deduce the diversity order of the scheme. We validate our analysis by showing that performance simulation results coincide with our analytical results over different network architectures. © 2010 IEEE.

  19. Exact diagonalization of quantum-spin models

    Science.gov (United States)

    Lin, H. Q.

    1990-10-01

    We have developed a technique to replace hashing in implementing the Lanczös method for exact diagonalization of quantum-spin models that enables us to carry out numerical studies on substantially larger lattices than previously studied. We describe the algorithm in detail and present results for the ground-state energy, the first-excited-state energy, and the spin-spin correlations on various finite lattices for spins S=1/2, 1, 3/2, and 2. Results for an infinite system are obtained by extrapolation. We also discuss the generalization of our method to other models.

  20. Maxwell Optics II. An Exact Formalism

    CERN Document Server

    Khan, S A

    2002-01-01

    We present a formalism for light optics starting with the Maxwell equations and casting them into an exact matrix form taking into account the spatial and temporal variations of the permittivity and permeability. This $8 \\times 8$ matrix representation is used to construct the optical Hamiltonian. This has a close analogy with the algebraic structure of the Dirac equation, enabling the use of the rich machinery of the Dirac electron theory. We get interesting wavelength-dependent contributions which can not be obtained in any of the traditional approaches.

  1. Exact solutions for Weyl fermions with gravity

    Energy Technology Data Exchange (ETDEWEB)

    Cianci, Roberto; Fabbri, Luca; Vignolo, Stefano [Universita di Genova, DIME Sez. Metodi e Modelli Matematici, Genoa (Italy)

    2015-10-15

    We consider the single-handed spinor field in interaction with its own gravitational field described by the set of field equations given by the Weyl field equations written in terms of derivatives that are covariant with respect to the gravitational connection plus Einstein field equations soured with the energy tensor of the spinor: for the Weyl spinor and the ensuing spacetime of Weyl-Lewis-Papapetrou structure, we find all exact solutions. The obtained solution for the metric tensor is that of a PP-wave spacetime, while the spinor field is a flag-dipole. (orig.)

  2. Exact Topological Twistons in Crystalline Polyethylene

    CERN Document Server

    Ventura, E; Bazeia, D

    2000-01-01

    We investigate the presence of topological twistons in crystalline polyethylene. We describe crystalline polyethylene with a model that couples the torsional and longitudinal degrees of freedom of the polymeric chain by means of a system of two real scalar fields. This model supports topological twistons, which are described by exact and stable topological solutions that appear when the interaction between torsional and longitudinal fields is polynomial, containing up to the sixth power in the fields. We calculate the energy of the topological twiston, and the result is in very good agreement with the value obtained via molecular simulation.

  3. The Exact Limit of Some Cubic Towers

    DEFF Research Database (Denmark)

    Anbar Meidl, Nurdagül; Beelen, Peter; Nguyen, Nhut

    2016-01-01

    Recently, a new explicit tower of function fields was introduced by Bassa, Beelen, Garcia and Stichtenoth (BBGS). This resulted in currently the best known lower bound for Ihara’s constant in the case of non-prime finite fields. In particular over cubic fields, the tower’s limit is at least as good...... as Zink’s bound; i.e. λ(BBGS/Fq3 ) ≥ 2(q2 - 1)/(q + 2). In this paper, the exact value of λ(BBGS/Fq3 ) is computed. We also settle a question stated by Ihara....

  4. Exact probability distribution functions for Parrondo's games

    Science.gov (United States)

    Zadourian, Rubina; Saakian, David B.; Klümper, Andreas

    2016-12-01

    We study the discrete time dynamics of Brownian ratchet models and Parrondo's games. Using the Fourier transform, we calculate the exact probability distribution functions for both the capital dependent and history dependent Parrondo's games. In certain cases we find strong oscillations near the maximum of the probability distribution with two limiting distributions for odd and even number of rounds of the game. Indications of such oscillations first appeared in the analysis of real financial data, but now we have found this phenomenon in model systems and a theoretical understanding of the phenomenon. The method of our work can be applied to Brownian ratchets, molecular motors, and portfolio optimization.

  5. Nonuniform Braneworld Stars: AN Exact Solution

    Science.gov (United States)

    Ovalle, J.

    In this paper the first exact interior solution to Einstein's field equations for a static and nonuniform braneworld star with local and nonlocal bulk terms is presented. It is shown that the bulk Weyl scalar U(r) is always negative inside the stellar distribution, and in consequence it reduces both the effective density and the effective pressure. It is found that the anisotropy generated by bulk gravity effect has an acceptable physical behavior inside the distribution. Using a Reissner-Nördstrom-like exterior solution, the effects of bulk gravity on pressure and density are found through matching conditions.

  6. Exact formulas in noncommutative gauge theories

    CERN Document Server

    Wallet, Jean-Christophe

    2016-01-01

    The noncommutative space $\\mathbb{R}^3_\\lambda$, a deformation of $\\mathbb{R}^3$, supports a $3$-parameter family of gauge theory models with gauge-invariant harmonic term, stable vacuum and which are perturbatively finite to all orders. Properties of this family are discussed. The partition function factorizes as an infinite product of reduced partition functions, each one corresponding to the reduced gauge theory on one of the fuzzy spheres entering the decomposition of $\\mathbb{R}^3_\\lambda$. For a particular sub-family of gauge theories, each reduced partition function is exactly expressible as a ratio of determinants. A relation with integrable 2-D Toda lattice hierarchy is indicated.

  7. An exact approach for aggregated formulations

    DEFF Research Database (Denmark)

    Gamst, Mette; Spoorendonk, Simon; Røpke, Stefan

    optimality cannot be guaranteed by branching on aggregated variables. We present a generic exact solution method to remedy the drawbacks of aggregation. It combines the original and aggregated formulations and applies Benders' decomposition. We apply the method to the Split Delivery Vehicle Routing Problem.......Aggregating formulations is a powerful approach for problems to take on tractable forms. Aggregation may lead to loss of information, i.e. the aggregated formulation may be an approximation of the original problem. In branch-and-bound context, aggregation can also complicate branching, e.g. when...

  8. Coupled Nonlinear Schr(o)dinger Equation: Symmetries and Exact Solutions

    Institute of Scientific and Technical Information of China (English)

    LIU Ping; LOU Sen-Yue

    2009-01-01

    The symmetries, symmetry reductions, and exact solutions of a coupled nonlinear Schr(o)dinger (CNLS) equation derived from the governing system for atmospheric gravity waves are researched by means of classical Lie group approach in this paper. Calculation shows the CNLS equation is invariant under some Galilean transformations, scaling transformations, phase shifts, and space-time translations. Some ordinary differential equations are derived from the CNLS equation. Several exact solutions including envelope cnoidal waves, solitary waves and trigonometric function solutions for the CNLS equation are also obtained by making use of symmetries.

  9. Lie symmetry analysis and exact solutions of the quasi-geostrophic two-layer problem

    CERN Document Server

    Bihlo, Alexander

    2010-01-01

    The quasi-geostrophic two-layer model is of superior interest in dynamic meteorology since it is one of the easiest ways to study baroclinic processes in geophysical fluid dynamics. The complete set of point symmetries of the two-layer equations is determined. An optimal set of one- and two-dimensional inequivalent subalgebras of the maximum Lie invariance algebra is constructed. On the basis of these subalgebras we exhaustively carry out group-invariant reduction and compute various classes of exact solutions. Where possible, reference to the physical meaning of the exact solutions is given.

  10. Massive-training artificial neural network (MTANN) for reduction of false positives in computer-aided detection of polyps: Suppression of rectal tubes.

    Science.gov (United States)

    Suzuki, Kenji; Yoshida, Hiroyuki; Näppi, Janne; Dachman, Abraham H

    2006-10-01

    One of the limitations of the current computer-aided detection (CAD) of polyps in CT colonography (CTC) is a relatively large number of false-positive (FP) detections. Rectal tubes (RTs) are one of the typical sources of FPs because a portion of a RT, especially a portion of a bulbous tip, often exhibits a cap-like shape that closely mimics the appearance of a small polyp. Radiologists can easily recognize and dismiss RT-induced FPs; thus, they may lose their confidence in CAD as an effective tool if the CAD scheme generates such "obvious" FPs due to RTs consistently. In addition, RT-induced FPs may distract radiologists from less common true positives in the rectum. Therefore, removal RT-induced FPs as well as other types of FPs is desirable while maintaining a high sensitivity in the detection of polyps. We developed a three-dimensional (3D) massive-training artificial neural network (MTANN) for distinction between polyps and RTs in 3D CTC volumetric data. The 3D MTANN is a supervised volume-processing technique which is trained with input CTC volumes and the corresponding "teaching" volumes. The teaching volume for a polyp contains a 3D Gaussian distribution, and that for a RT contains zeros for enhancement of polyps and suppression of RTs, respectively. For distinction between polyps and nonpolyps including RTs, a 3D scoring method based on a 3D Gaussian weighting function is applied to the output of the trained 3D MTANN. Our database consisted of CTC examinations of 73 patients, scanned in both supine and prone positions (146 CTC data sets in total), with optical colonoscopy as a reference standard for the presence of polyps. Fifteen patients had 28 polyps, 15 of which were 5-9 mm and 13 were 10-25 mm in size. These CTC cases were subjected to our previously reported CAD scheme that included centerline-based segmentation of the colon, shape-based detection of polyps, and reduction of FPs by use of a Bayesian neural network based on geometric and texture

  11. An Exactly Solvable Many-Fermion Model

    Science.gov (United States)

    Zettili, Nouredine

    2001-04-01

    We deal with the construction of a simple many-body model that can be solved exactly. This model serves as a tool for testing the validity and accuracy of many-body approximation methods. The model consists of a system of two distinguishable, one-dimensional sets of fermions interacting via a schematic two-body force. We construct the Hamiltonian of the model by means of vector operators that satisfy a Lie algebra and which are the generators of an SO(2,1) group. The Hamiltonian depends on an adjustable parameter which regulates the strength of the two-body interaction. The size of the Hamiltonian's matrix is rendered finite by means of a built-in symmetry: the Hamiltonian is represented by a five-diagonal square matrix of finite size. The energy spectrum of the model is obtained by diagonalizing this matrix. The energy eigenvalues obtained from this diagonalization are exact, for we don't resort to any approximation in the diagonalization. This model offers a rich and flexible platform for testing quantitatively the various many-body approximation methods especially those that deal with nuclear collective motion.

  12. An Exactly Solvable Many-Body Model

    Science.gov (United States)

    Zettili, Nouredine; Boukahil, Abdelkrim

    2012-03-01

    We deal here with the construction of a simple many-body model that can be solved exactly. This model serves as a tool for testing the validity and accuracy of many-body approximation methods, most notably those encountered in nuclear theory. The model consists of a system of two distinguishable, one-dimensional sets fermions interacting via a schematic two-body force. We construct the Hamiltonian of the model by means of vector operators that satisfy a Lie algebra and which are the generators of an SO(2,1) group. The Hamiltonian depends on an adjustable parameter which regulates the strength of the two-body interaction. The size of the Hamiltonian's matrix is rendered finite by means of a built-in symmetry: the Hamiltonian is represented by a five-diagonal square matrix of finite size. The energy spectrum of the model is obtained by diagonalizing this matrix. The energy eigenvalues obtained from this diagonalization are exact, for we don't need to resort to any approximation in the diagonalization. This model offers a rich and flexible platform for testing quantitatively the various many-body approximation methods especially those that deal with nuclear collective motion.

  13. Explicitly broken supersymmetry with exactly massless moduli

    Science.gov (United States)

    Dong, Xi; Freedman, Daniel Z.; Zhao, Yue

    2016-06-01

    The AdS/CFT correspondence is applied to an analogue of the little hierarchy problem in three-dimensional supersymmetric theories. The bulk is governed by a super-gravity theory in which a U(1) × U(1) R-symmetry is gauged by Chern-Simons fields. The bulk theory is deformed by a boundary term quadratic in the gauge fields. It breaks SUSY completely and sources an exactly marginal operator in the dual CFT. SUSY breaking is communicated by gauge interactions to bulk scalar fields and their spinor superpartners. The bulk-to-boundary propagator of the Chern-Simons fields is a total derivative with respect to the bulk coordinates. Integration by parts and the Ward identity permit evaluation of SUSY breaking effects to all orders in the strength of the deformation. The R-charges of scalars and spinors differ so large SUSY breaking mass shifts are generated. Masses of R-neutral particles such as scalar moduli are not shifted to any order in the deformation strength, despite the fact that they may couple to R-charged fields running in loops. We also obtain a universal deformation formula for correlation functions under an exactly marginal deformation by a product of holomorphic and anti-holomorphic U(1) currents.

  14. Exact collisional moments for plasma fluid theories

    Science.gov (United States)

    Pfefferlé, D.; Hirvijoki, E.; Lingam, M.

    2017-04-01

    The velocity-space moments of the often troublesome nonlinear Landau collision operator are expressed exactly in terms of multi-index Hermite-polynomial moments of distribution functions. The collisional moments are shown to be generated by derivatives of two well-known functions, namely, the Rosenbluth-MacDonald-Judd-Trubnikov potentials for a Gaussian distribution. The resulting formula has a nonlinear dependency on the relative mean flow of the colliding species normalised to the root-mean-square of the corresponding thermal velocities and a bilinear dependency on densities and higher-order velocity moments of the distribution functions, with no restriction on temperature, flow, or mass ratio of the species. The result can be applied to both the classic transport theory of plasmas that relies on the Chapman-Enskog method, as well as to derive collisional fluid equations that follow Grad's moment approach. As an illustrative example, we provide the collisional ten-moment equations with exact conservation laws for momentum- and energy-transfer rates.

  15. Exact renormalization group and Sine Gordon theory

    Science.gov (United States)

    Oak, Prafulla; Sathiapalan, B.

    2017-07-01

    The exact renormalization group is used to study the RG flow of quantities in field theories. The basic idea is to write an evolution operator for the flow and evaluate it in perturbation theory. This is easier than directly solving the differential equation. This is illustrated by reproducing known results in four dimensional ϕ 4 field theory and the two dimensional Sine-Gordon theory. It is shown that the calculation of beta function is somewhat simplified. The technique is also used to calculate the c-function in two dimensional Sine-Gordon theory. This agrees with other prescriptions for calculating c-functions in the literature. If one extrapolates the connection between central charge of a CFT and entanglement entropy in two dimensions, to the c-function of the perturbed CFT, then one gets a value for the entanglement entropy in Sine-Gordon theory that is in exact agreement with earlier calculations (including one using holography) in arXiv:1610.04233.

  16. An exact exponential time algorithm for counting bipartite cliques

    DEFF Research Database (Denmark)

    Kutzkov, Konstantin

    2012-01-01

    We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.249^n), improving upon known exact algorithms for finding and counting bipartite cliques.......We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.249^n), improving upon known exact algorithms for finding and counting bipartite cliques....

  17. Submerged Landau jet: exact solutions, their meaning and application

    Energy Technology Data Exchange (ETDEWEB)

    Broman, Goran I [Blekinge Institute of Technology, Karlskrona (Sweden); Rudenko, Oleg V [M. V. Lomonosov Moscow State University, Faculty of Physics, Moscow (Russian Federation)

    2010-01-31

    Exact hydrodynamic solutions generalizing the Landau submerged jet solution are reviewed. It is shown how exact inviscid solutions can be obtained and how boundary layer viscosity can be included by introducing parabolic coordinates. The use of exact solutions in applied hydrodynamics and acoustics is discussed. A historical perspective on the discovery of a class of exact solutions and on the analysis of their physical meaning is presented. (methodological notes)

  18. Exact Controllability and Asymptotic Analysis for Shallow Shells

    Institute of Scientific and Technical Information of China (English)

    S. KAIZU; N. SABU

    2007-01-01

    The authors consider the exact controllability of the vibrations of a thin shallow shell, of thickness 2ε with controls imposed on the lateral surface and at the top and bottom of the shell. Apart from proving the existence of exact controls, it is shown that the solutions of the three dimensional exact controllability problems converge, as the thickness of the shell goes to zero, to the solution of an exact controllability problem in two dimensions.

  19. First investigation at elevated pressures to confirm the exact nature of the gated electron-transfer systems: volume profiles of the gated reduction reaction and nongated reverse oxidation reaction involving a [Cu(dmp)2(solvent)]2+/[Cu(dmp)2]+ couple (dmp = 2,9-dimethyl-1,10-phenanthroline).

    Science.gov (United States)

    Itoh, Sumitaka; Noda, Kyoko; Yamane, Ryouhei; Kishikawa, Nobuyuki; Takagi, Hideo D

    2007-02-19

    Redox reactions involving the [Cu(dmp)2]2+/+ couple (dmp = 2,9-dimethyl-1,10-phenanthroline) in acetonitrile were examined at elevated pressures up to 200 MPa. Activation volumes were determined as -8.8 and -6.3 cm3 mol-1 for the reduction cross-reaction by [Co(bipy)3]2+ (bipy = 2,2'-bipyridine) and for the oxidation cross-reaction by [Ni(tacn)2]3+ (tacn = 1,4,7-triazacyclononane), respectively. The activation volume for the hypothetical gated mode of the self-exchange reaction estimated from the reduction cross-reaction was -13.9 cm3 mol-1, indicating extensive electrostrictive rearrangement of solvent molecules around the CuII complex during the change in the coordination geometry before the electron-transfer step. On the other hand, the activation volume for the self-exchange reaction estimated from the oxidation cross-reaction was -2.7 +/- 1.5 cm3 mol-1. Although this value was within the range that can be interpreted by the concept of the ordinary concerted process, from theoretical considerations it was concluded that the reverse (oxidation) cross-reaction of the gated reduction reaction of the [Cu(dmp)2(CH3CN)]2+/[Cu(dmp)2]+ couple proceeds through the product excited state while the direct self-exchange reaction between [Cu(dmp)2(CH3CN)]2+ and [Cu(dmp)2]+ proceeds through an ordinary concerted process.

  20. Plausibility functions and exact frequentist inference

    CERN Document Server

    Martin, Ryan

    2012-01-01

    In the frequentist program, inferential methods with exact control on error rates are a primary focus. Methods based on asymptotic distribution theory may not be suitable in a particular problem, in which case, a numerical method is needed. This paper presents a general, Monte Carlo-driven framework for the construction of frequentist procedures based on plausibility functions. It is proved that the suitably defined plausibility function-based tests and confidence regions have desired frequentist properties. Moreover, in an important special case involving likelihood ratios, conditions are given such that the plausibility function behaves asymptotically like a consistent Bayesian posterior distribution. An extension of the proposed method is also given for the case where nuisance parameters are present. A number of examples are given which illustrate the method and demonstrate its strong performance compared to other popular existing methods.

  1. Exact fermionic Green's functions from holograpny

    CERN Document Server

    Fan, ZhongYing

    2014-01-01

    We construct a series of charged dilatonic black holes which share zero entropy in the zero temperature limit using Einstein-Maxwell-Dilaton theories. In these black holes, the wave functions and the Green's functions of massless fermions can be solved exactly in terms of special functions in the phase space of $(\\omega,k)$. We observe that for sufficiently large charge, there are many poles in the Green's function with vanishing $\\omega$, which strongly signifies that Fermi surfaces exist in these holographic systems. The new distinguishing properties of the Green's function arising in these systems were illustrated with great details. We also study the poles motion of the Green's function for arbitrary (complex) frequency. Our analytic results provide a more realistic and elegant approach to study strongly correlated fermionic systems using gauge/gravity duality.

  2. Exact Solution and Exotic Fluid in Cosmology

    Directory of Open Access Journals (Sweden)

    Phillial Oh

    2012-09-01

    Full Text Available We investigate cosmological consequences of nonlinear sigma model coupled with a cosmological fluid which satisfies the continuity equation. The target space action is of the de Sitter type and is composed of four scalar fields. The potential which is a function of only one of the scalar fields is also introduced. We perform a general analysis of the ensuing cosmological equations and give various critical points and their properties. Then, we show that the model exhibits an exact cosmological solution which yields a transition from matter domination into dark energy epoch and compare it with the Λ-CDM behavior. Especially, we calculate the age of the Universe and show that it is consistent with the observational value if the equation of the state ωf of the cosmological fluid is within the range of 0.13 < ωf < 0.22. Some implication of this result is also discussed.

  3. Exact linear modeling using Ore algebras

    CERN Document Server

    Schindelar, Kristina; Zerz, Eva

    2010-01-01

    Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely as possible. The case of operators with constant coefficients is well studied and known in the systems theoretic literature, whereas the operators with varying coefficients were addressed only recently. This question can be tackled either using Gr\\"obner bases for modules over Ore algebras or by following the ideas from differential algebra and computing in commutative rings. In this paper, we present algorithmic methods to compute "most powerful unfalsified models" (MPUM) and their counterparts with variable coefficients (VMPUM) for polynomial and polynomial-exponential signals. We also study the structural properties of the resulting models, discuss computer algebraic techniques behind algorithms and provide several examples.

  4. Exactly solvable cellular automaton traffic jam model.

    Science.gov (United States)

    Kearney, Michael J

    2006-12-01

    A detailed study is undertaken of the v{max}=1 limit of the cellular automaton traffic model proposed by Nagel and Paczuski [Phys. Rev. E 51, 2909 (1995)]. The model allows one to analyze the behavior of a traffic jam initiated in an otherwise freely flowing stream of traffic. By mapping onto a discrete-time queueing system, itself related to various problems encountered in lattice combinatorics, exact results are presented in relation to the jam lifetime, the maximum jam length, and the jam mass (the space-time cluster size or integrated vehicle waiting time), both in terms of the critical and the off-critical behavior. This sets existing scaling results in their natural context and also provides several other interesting results in addition.

  5. Exact Description of Decoherence in Optical Cavities

    CERN Document Server

    Romero, K M F

    2002-01-01

    The exact reduced dynamics for the independent oscillator model in the RWA approximation at zero and finite temperatures is derived. It is shown that the information about the interaction and the environment is encapsulated into three time dependent coefficients of the master equation, one of which vanishes in the zero temperature case. In currently used optical cavities all the information about the field dynamics is contained into {\\it two} (or three) experimentally accesible and physically meaningful real functions of time. From the phenomenological point of view it suffices then to carefully measure two ({\\it three}) adequate observables in order to map the evolution of any initial condition, as shown with several examples: (generalized) coherent states, Fock states, Schr\\"odinger cat states, and squeezed states.

  6. Exact eigenfunctions and the open topological string

    Science.gov (United States)

    Mariño, Marcos; Zakany, Szabolcs

    2017-08-01

    Mirror curves to toric Calabi-Yau threefolds can be quantized and lead to trace class operators on the real line. The eigenvalues of these operators are encoded in the BPS invariants of the underlying threefold, but much less is known about their eigenfunctions. In this paper, we first develop methods in spectral theory to compute these eigenfunctions. We also provide an integral matrix representation which allows them to be studied in a ’t Hooft limit, where they are described by standard topological open string amplitudes. Based on these results, we propose a conjecture for the exact eigenfunctions, which involves both the WKB wavefunction and the standard topological string wavefunction. This conjecture can be made completely explicit in the maximally supersymmetric, or self-dual case, which we work out in detail for local \

  7. Exactly soluble model of boundary degeneracy

    Science.gov (United States)

    Ganeshan, Sriram; Gorshkov, Alexey V.; Gurarie, Victor; Galitski, Victor M.

    2017-01-01

    We investigate the topological degeneracy that can be realized in Abelian fractional quantum spin Hall states with multiply connected gapped boundaries. Such a topological degeneracy (also dubbed as "boundary degeneracy") does not require superconducting proximity effect and can be created by simply applying a depletion gate to the quantum spin Hall material and using a generic spin-mixing term (e.g., due to backscattering) to gap out the edge modes. We construct an exactly soluble microscopic model manifesting this topological degeneracy and solve it using the recently developed technique [S. Ganeshan and M. Levin, Phys. Rev. B 93, 075118 (2016), 10.1103/PhysRevB.93.075118]. The corresponding string operators spanning this degeneracy are explicitly calculated. It is argued that the proposed scheme is experimentally reasonable.

  8. Remarks on exactness notions pertaining to pushouts

    CERN Document Server

    Garner, Richard

    2012-01-01

    We call a finitely complete category diexact if every Mal'cev relation admits a pushout which is stable under pullback and itself a pullback. We prove three results relating to diexact categories: firstly, that a category is a pretopos if and only if it is diexact with a strict initial object; secondly, that a category is diexact if and only if it is Barr-exact, and every pair of monomorphisms admits a pushout which is stable and a pullback; and thirdly, that a small category with finite limits and pushouts of Mal'cev spans is diexact if and only if it admits a full structure-preserving embedding into a Grothendieck topos.

  9. Exact entanglement bases and general bound entanglement

    CERN Document Server

    Zhong, Z Z

    2004-01-01

    In this paper, we give the more general bound entangled states associated with the unextendible product bases (UPB), i.e. by using of the exact entanglement bases (EEB) and the complete basis with unextendible product bases (CBUPB), we prove that the arbitrary convex sums of the uniform mixtures (bound entangled states) associated with UPBs are still bound entangled states. Further, we discuss the equivalent transformation group and classification of the CBUPBs, and by using this classification, we prove that in the meaning of indistinguishability, the set of the above all possible bound entangled states can be reduced to the set of all possible mixtures of some fixed basic bound entangled states. At last, we prove that every operating of the partial transposition (PT) map acting upon a density matrix under any bipartite partitioning induces a mapping from the above reduced set of bound entangled states to oneself, which corresponds to a non-identical permutation of the basic bound entangled states.

  10. Exact observability, square functions and spectral theory

    CERN Document Server

    Haak, Bernhard Hermann

    2011-01-01

    In the first part of this article we introduce the notion of a backward-forward conditioning (BFC) system that generalises the notion of zero-class admissibiliy introduced in [Xu,Liu,Yung]. We can show that unless the spectum contains a halfplane, the BFC property occurs only in siutations where the underlying semigroup extends to a group. In a second part we present a sufficient condition for exact observability in Banach spaces that is designed for infinite-dimensional output spaces and general strongly continuous semigroups. To obtain this we make use of certain weighted square function estimates. Specialising to the Hilbert space situation we obtain a result for contraction semigroups without an analyticity condition on the semigroup.

  11. Exact Power Constraints in Smart Grid Control

    DEFF Research Database (Denmark)

    Trangbæk, K; Petersen, Mette Højgaard; Bendtsen, Jan Dimon

    2011-01-01

    This paper deals with hierarchical model predictive control (MPC) of smart grid systems. The objective is to accommodate load variations on the grid, arising from varying consumption and natural variations in the power production e.g. from wind turbines. This balancing between supply and demand...... is performed by distributing power to consumers in an optimal manner, subject to the requirement that each consumer receives the specific amount of energy the consumer is entitled to within a specific time horizon. However, in order to do so, the high-level controller requires knowledge of how much energy...... consumer models. The example illustrates that the exact bounds computed by the proposed method leads to a better power distribution than a conventional, conservative approach in case of fast changes in the load....

  12. Coinductive Formal Reasoning in Exact Real Arithmetic

    CERN Document Server

    Niqui, Milad

    2008-01-01

    In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations are special cases-- on a representation of real numbers by coinductive streams. The algorithms work on coinductive stream of M\\"obius maps and form the basis of the Edalat--Potts exact real arithmetic. We use the machinery of the Coq proof assistant for the coinductive types to present the formalisation. The formalised algorithms are only partially productive, i.e., they do not output provably infinite streams for all possible inputs. We show how to deal with this partiality in the presence of syntactic restrictions posed by the constructive type theory of Coq. Furthermore we show that the type theoretic techniques that we develop are compatible with the semantics of the algorithms as continuous maps on real numbers. The resulting Coq formalisation is available for public download.

  13. An exact algorithm for graph partitioning

    CERN Document Server

    Hager, William; Zhang, Hongchao

    2009-01-01

    An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine underestimate. It is shown that the best affine underestimate can be expressed in terms of the center and the radius of the smallest sphere containing the feasible set. The concave term is obtained either by a constant diagonal shift associated with the smallest eigenvalue of the objective function Hessian, or by a diagonal shift obtained by solving a semidefinite programming problem. Numerical results show that the proposed algorithm is competitive with state-of-the-art graph partitioning codes.

  14. Symmetric Morse potential is exactly solvable

    CERN Document Server

    Sasaki, Ryu

    2016-01-01

    Morse potential $V_M(x)= g^2\\exp (2x)-g(2h+1)\\exp(x)$ is defined on the full line, $-\\inftyexactly solvable 1-d quantum mechanical system with finitely many discrete eigenstates. By taking its right half $0\\le x<\\infty$ and glueing it with the left half of its mirror image $V_M(-x)$, $-\\infty

  15. Exact relativistic theory of geoid's undulation

    CERN Document Server

    Kopeikin, Sergei; Karpik, Alexander

    2014-01-01

    Precise determination of geoid is one of the most important problem of physical geodesy. The present paper extends the Newtonian concept of the geoid to the realm of Einstein's general relativity and derives an exact relativistic equation for the unperturbed geoid and level surfaces under assumption of axisymmetric distribution of background matter in the core and mantle of the Earth. We consider Earth's crust as a small disturbance imposed on the background distribution of matter, and formulate the master equation for the anomalous gravity potential caused by this disturbance. We find out the gauge condition that drastically simplifies the master equation for the anomalous gravitational potential and reduces it to the form closely resembling the one in the Newtonian theory. The master equation gives access to the precise calculation of geoid's undulation with the full account for relativistic effects not limited to the post-Newtonian approximation. The geoid undulation theory, given in the present paper, uti...

  16. Exactly isochoric deformations of soft solids

    Science.gov (United States)

    Biggins, John S.; Wei, Z.; Mahadevan, L.

    2014-12-01

    Many materials of contemporary interest, such as gels, biological tissues and elastomers, are easily deformed but essentially incompressible. Traditional linear theory of elasticity implements incompressibility only to first order and thus permits some volume changes, which become problematically large even at very small strains. Using a mixed coordinate transformation originally due to Gauss, we enforce the constraint of isochoric deformations exactly to develop a linear theory with perfect volume conservation that remains valid until strains become geometrically large. We demonstrate the utility of this approach by calculating the response of an infinite soft isochoric solid to a point force that leads to a nonlinear generalization of the Kelvin solution. Our approach naturally generalizes to a range of problems involving deformations of soft solids and interfaces in two-dimensional and axisymmetric geometries, which we exemplify by determining the solution to a distributed load that mimics muscular contraction within the bulk of a soft solid.

  17. Exact Timing of Returned Molecular Wavepacket

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhe; WANG Ting-Ying; ZHANG Gui-Zhong; W.T. Hill Ⅲ

    2006-01-01

    An ionizing wavepacket of electron will re-visit its parent molecular ion during photoionization by strong laser field. This scenario is associated with physical concepts such as molecular re-scattering/collision, interference,diffraction, molecular clock, and generation of XUV light via high-order harmonic generation. On the workbench of a reduced dimensionality model of molecular hydrogen ions irradiated by laser pulse of 0.01-10.0 a.u. intensities, one-cycle pulsewidth, and 800 nm wavelength, by deploying a momentum operator on the time-dependent wavefunction of an ionizing wavepacket, we can determine, in a precise manner, the exact time instant for the re-visiting electron to come back to the cation position. The time value is 57.6% of an optical cycle of the exciting laser pulse. This result may be useful in attosecond pump-probe experiments or molecular clock applications.

  18. Exact Spherically Symmetric Solutions in Massive Gravity

    CERN Document Server

    Berezhiani, Z; Nesti, F; Pilo, L

    2008-01-01

    A phase of massive gravity free from pathologies can be obtained by coupling the metric to an additional spin-two field. We study the gravitational field produced by a static spherically symmetric body, by finding the exact solution that generalizes the Schwarzschild metric to the case of massive gravity. Besides the usual 1/r term, the main effects of the new spin-two field are a shift of the total mass of the body and the presence of a new power-like term, with sizes determined by the mass and the shape (the radius) of the source. These modifications, being source dependent, give rise to a dynamical violation of the Strong Equivalence Principle. Depending on the details of the coupling of the new field, the power-like term may dominate at large distances or even in the ultraviolet. The effect persists also when the dynamics of the extra field is decoupled.

  19. Homological Pisot Substitutions and Exact Regularity

    CERN Document Server

    Barge, Marcy; Jones, Leslie; Sadun, Lorenzo

    2010-01-01

    We consider one-dimensional substitution tiling spaces where the dilatation (stretching factor) is a degree d Pisot number, and where the first rational Cech cohomology is d-dimensional. We construct examples of such "homological Pisot" substitutions that do not have pure discrete spectra. These examples are not unimodular, and we conjecture that the coincidence rank must always divide a power of the norm of the dilatation. To support this conjecture, we show that homological Pisot substitutions exhibit an Exact Regularity Property (ERP), in which the number of occurrences of a patch for a return length is governed strictly by the length. The ERP puts strong constraints on the measure of any cylinder set in the corresponding tiling space.

  20. An exact formulation of hyperdynamics simulations

    Science.gov (United States)

    Chen, L. Y.; Horing, N. J. M.

    2007-06-01

    We introduce a new formula for the acceleration weight factor in the hyperdynamics simulation method, the use of which correctly provides an exact simulation of the true dynamics of a system. This new form of hyperdynamics is valid and applicable where the transition state theory (TST) is applicable and also where the TST is not applicable. To illustrate this new formulation, we perform hyperdynamics simulations for four systems ranging from one degree of freedom to 591 degrees of freedom: (1) We first analyze free diffusion having one degree of freedom. This system does not have a transition state. The TST and the original form of hyperdynamics are not applicable. Using the new form of hyperdynamics, we compute mean square displacement for a range of time. The results obtained agree perfectly with the analytical formula. (2) Then we examine the classical Kramers escape rate problem. The rate computed is in perfect agreement with the Kramers formula over a broad range of temperature. (3) We also study another classical problem: Computing the rate of effusion out of a cubic box through a tiny hole. This problem does not involve an energy barrier. Thus, the original form of hyperdynamics excludes the possibility of using a nonzero bias and is inappropriate. However, with the new weight factor formula, our new form of hyperdynamics can be easily implemented and it produces the exact results. (4) To illustrate applicability to systems of many degrees of freedom, we analyze diffusion of an atom adsorbed on the (001) surface of an fcc crystal. The system is modeled by an atom on top of a slab of six atomic layers. Each layer has 49 atoms. With the bottom two layers of atoms fixed, this system has 591 degrees of freedom. With very modest computing effort, we are able to characterize its diffusion pathways in the exchange-with-the-substrate and hop-over-the-bridge mechanisms.

  1. Quantitative study on exact reconstruction sampling condition by verifying solution uniqueness in limited-view CT.

    Science.gov (United States)

    Yan, Bin; Zhang, Wenkun; Li, Lei; Zhang, Hanming; Wang, Linyuan

    2016-10-01

    In limited-view computed tomography reconstruction, iterative image reconstruction with sparsity-exploiting methods, such as total variation (TV) minimization, inspired by compressive sensing, potentially claims large reductions in sampling requirements. However, a quantitative notion of this claim is non-trivial because of the ill-defined reduction in sampling achieved by the sparsity-exploiting method. In this paper, exact reconstruction sampling condition for limited-view problem is studied by verifying the uniqueness of solution in TV minimization model. Uniqueness is tested by solving a convex optimization problem derived from the sufficient and necessary condition of solution uniqueness. Through this method, the sufficient sampling number of exact reconstruction is quantified for any fixed phantom and settled geometrical parameter in the limited-view problem. This paper provides a reference to quantify the sampling condition. Three phantoms are tested to study the sampling condition of limited view exact reconstruction in this paper. The experiment results show the quantified sampling number and indicate that an object would be accurately reconstructed as the scanning range becomes narrower by increasing sampling number. The increased samplings compensate for the deficiency of the projection angle. However, the lower bound of the scanning range corresponding to three different phantoms are presented, in which an exact reconstruction cannot be obtained once the projection angular is narrowed to this extent no matter how to increase sampling.

  2. The exact asymptotic for the stationary distribution of some unreliable systems

    CERN Document Server

    Lorek, Pawel

    2011-01-01

    In this paper we find asymptotic distribution for some unreliable networks. Using Markov Additive Structure and Adan, Foley, McDonald method, we find the exact asymptotic for the stationary distribution. With the help of MA structure and matrix geometric approach, we also investigate the asymptotic when breakdown intensity is small. In particular, two different asymptotic regimes for small breakdown intensity suggest two different patterns of large deviations, which is confirmed by simulation study.

  3. Discriminating complex networks through supervised NDR and Bayesian classifier

    Science.gov (United States)

    Yan, Ke-Sheng; Rong, Li-Li; Yu, Kai

    2016-12-01

    Discriminating complex networks is a particularly important task for the purpose of the systematic study of networks. In order to discriminate unknown networks exactly, a large set of network measurements are needed to be taken into account for comprehensively considering network properties. However, as we demonstrate in this paper, these measurements are nonlinear correlated with each other in general, resulting in a wide variety of redundant measurements which unintentionally explain the same aspects of network properties. To solve this problem, we adopt supervised nonlinear dimensionality reduction (NDR) to eliminate the nonlinear redundancy and visualize networks in a low-dimensional projection space. Though unsupervised NDR can achieve the same aim, we illustrate that supervised NDR is more appropriate than unsupervised NDR for discrimination task. After that, we perform Bayesian classifier (BC) in the projection space to discriminate the unknown network by considering the projection score vectors as the input of the classifier. We also demonstrate the feasibility and effectivity of this proposed method in six extensive research real networks, ranging from technological to social or biological. Moreover, the effectiveness and advantage of the proposed method is proved by the contrast experiments with the existing method.

  4. Quantitative Study on Exact Reconstruction Sampling Condition in Limited-view CT

    CERN Document Server

    Yan, Bin; Li, Lei; Zhang, Hanming; Wang, Linyuan

    2016-01-01

    In limited-view computed tomography reconstruction, iterative image reconstruction with sparsity-exploiting methods, such as total variation (TV) minimization, inspired by compressive sensing, potentially claims large reductions in sampling requirements. However, a quantitative notion of this claim is non-trivial because of the ill-defined reduction in sampling achieved by the sparsity-exploiting method. In this paper, exact reconstruction sampling condition for limited-view problem is studied by verifying the uniqueness of solution in TV minimization model. Uniqueness is tested by solving a convex optimization problem derived from the sufficient and necessary condition of solution uniqueness. Through this method, the sufficient sampling number of exact reconstruction is quantified for any fixed phantom and settled geometrical parameter in the limited-view problem. This paper provides a reference to quantify the sampling condition. Using Shepp-Logan phantom as an example, the experiment results show the quant...

  5. Self-regulating genes. Exact steady state solution by using Poisson representation

    Science.gov (United States)

    Sugár, István; Simon, István

    2014-09-01

    Systems biology studies the structure and behavior of complex gene regulatory networks. One of its aims is to develop a quantitative understanding of the modular components that constitute such networks. The self-regulating gene is a type of auto regulatory genetic modules which appears in over 40% of known transcription factors in E. coli. In this work, using the technique of Poisson Representation, we are able to provide exact steady state solutions for this feedback model. By using the methods of synthetic biology (P.E.M. Purnick and Weiss, R., Nature Reviews, Molecular Cell Biology, 2009, 10: 410-422) one can build the system itself from modules like this.

  6. STELLAR: fast and exact local alignments

    Directory of Open Access Journals (Sweden)

    Weese David

    2011-10-01

    Full Text Available Abstract Background Large-scale comparison of genomic sequences requires reliable tools for the search of local alignments. Practical local aligners are in general fast, but heuristic, and hence sometimes miss significant matches. Results We present here the local pairwise aligner STELLAR that has full sensitivity for ε-alignments, i.e. guarantees to report all local alignments of a given minimal length and maximal error rate. The aligner is composed of two steps, filtering and verification. We apply the SWIFT algorithm for lossless filtering, and have developed a new verification strategy that we prove to be exact. Our results on simulated and real genomic data confirm and quantify the conjecture that heuristic tools like BLAST or BLAT miss a large percentage of significant local alignments. Conclusions STELLAR is very practical and fast on very long sequences which makes it a suitable new tool for finding local alignments between genomic sequences under the edit distance model. Binaries are freely available for Linux, Windows, and Mac OS X at http://www.seqan.de/projects/stellar. The source code is freely distributed with the SeqAn C++ library version 1.3 and later at http://www.seqan.de.

  7. Exact electromagnetic response of Landau level electrons

    Science.gov (United States)

    Nguyen, Dung Xuan; Gromov, Andrey

    2017-02-01

    We present a simple method that allows us to calculate the electromagnetic response of noninteracting electrons in a strong magnetic field to arbitrary order in the gradients of external electric and magnetic fields. We illustrate the method on both nonrelativistic and massless Dirac electrons filling N Landau levels. First, we derive an exact relation between the electromagnetic response of the nonrelativistic and Dirac electrons in the lowest Landau level. Next, we obtain a closed form expression for the polarization operator in the large-N (or weak magnetic field) limit. We explicitly show that in the large-N limit the random phase approximation (RPA) computation of the polarization tensor agrees—in leading and subleading order in N —with a Fermi liquid computation to all orders in the gradient expansion and for arbitrary value of the g factor. Finally, we show that in the large-N limit the nonrelativistic polarization tensor agrees with Dirac's in the leading and subleading orders in N , provided that the Berry phase of the Dirac cone is taken into account via replacement N ⟶N +1 /2 .

  8. Explicitly Broken Supersymmetry with Exactly Massless Moduli

    CERN Document Server

    Dong, Xi; Zhao, Yue

    2014-01-01

    There is an avatar of the little hierarchy problem of the MSSM in 3-dimensional supersymmetry. We propose a solution to this problem in AdS$_3$ based on the AdS/CFT correspondence. The bulk theory is a supergravity theory in which U(1) $\\times$ U(1) R-symmetry is gauged by Chern-Simons fields. The bulk theory is deformed by a boundary term quadratic in the gauge fields. It breaks SUSY completely and sources an exactly marginal operator in the dual CFT. SUSY breaking is communicated by gauge interactions to bulk scalar fields and their spinor superpartners. Since the R-charges of scalar and spinor differ, this generates a SUSY breaking shift of their masses. The Ward identity facilitates the calculation of these mass shifts to any desired order in the strength of the deformation. Moduli fields are massless $R$-neutral bulk scalars with vanishing potential in the undeformed theory. These properties are maintained to all orders in the deformation despite the fact that moduli couple in the bulk to loops of R-char...

  9. Exact Electromagnetic Response of Landau Level Electrons

    CERN Document Server

    Nguyen, Dung Xuan

    2016-01-01

    We present a simple method that allows to calculate the electromagnetic response of non-interacting electrons in strong magnetic field to arbitrary order in the gradients of external electric and magnetic fields. We illustrate the method on both non-relativistic and massless Dirac electrons filling $N$ Landau levels. First, we derive an exact relation between the electromagnetic response of the non-relativistic and Dirac electrons in the lowest Landau level. Next, we obtain a closed form expression for the polarization operator in the large $N$ (or weak magnetic field) limit. We explicitly show that in the large $N$ limit the random phase approximation (RPA) computation of the polarization tensor agrees - in leading and sub-leading order in $N$ - with a Fermi liquid computation to {\\it all} orders in the gradient expansion and for arbitrary value of the $\\mathrm{g}$-factor. Finally, we show that in the large $N$ limit the non-relativistic polarization tensor agrees with Dirac's in the leading and sub-leading ...

  10. The Manifestly Gauge Invariant Exact Renormalisation Group

    CERN Document Server

    Rosten, O J

    2005-01-01

    We construct a manifestly gauge invariant Exact Renormalisation Group (ERG) whose form is suitable for computation in SU(N) Yang-Mills theory, beyond one-loop. An effective cutoff is implemented by embedding the physical SU(N) theory in a spontaneously broken SU(N|N) Yang-Mills theory. To facilitate computations within this scheme, which proceed at every step without fixing the gauge, we develop a set of diagrammatic techniques. As an initial test of the formalism, the one-loop SU(N) Yang-Mills beta-function, beta_1, is computed, and the standard, universal answer is reproduced. It is recognised that the computational technique can be greatly simplified. Using these simplifications, a partial proof is given that, to all orders in perturbation theory, the explicit dependence of perturbative $\\beta$-function coefficients, beta_n, on certain non-universal elements of the manifestly gauge invariant ERG cancels out. This partial proof yields an extremely compact, diagrammatic form for the surviving contributions t...

  11. New exact solutions of the Einstein-Maxwell equations for magnetostatic fields

    Institute of Scientific and Technical Information of China (English)

    Nisha Goyal; R. K. Gupta

    2012-01-01

    The symmetry reduction method based on the Fréchet derivative of differential operators is applied to investigate symmetries of the Einstein-Maxwell field equations for magnetostatic fields,which is a coupled system of nonlinear partial differential equations of the second order.The technique yields invariant transformations that reduce the given system of partial differential equations to a system of nonlinear ordinary differential equations.Some of the reduced systems are further studied to obtain the exact solutions.

  12. Exact Hypothesis Tests for Log-linear Models with exactLoglinTest

    Directory of Open Access Journals (Sweden)

    Brian Caffo

    2006-11-01

    Full Text Available This manuscript overviews exact testing of goodness of fit for log-linear models using the R package exactLoglinTest. This package evaluates model fit for Poisson log-linear models by conditioning on minimal sufficient statistics to remove nuisance parameters. A Monte Carlo algorithm is proposed to estimate P values from the resulting conditional distribution. In particular, this package implements a sequentially rounded normal approximation and importance sampling to approximate probabilities from the conditional distribution. Usually, this results in a high percentage of valid samples. However, in instances where this is not the case, a Metropolis Hastings algorithm can be implemented that makes more localized jumps within the reference set. The manuscript details how some conditional tests for binomial logit models can also be viewed as conditional Poisson log-linear models and hence can be performed via exactLoglinTest. A diverse battery of examples is considered to highlight use, features and extensions of the software. Notably, potential extensions to evaluating disclosure risk are also considered.

  13. Exact sampling hardness of Ising spin models

    Science.gov (United States)

    Fefferman, B.; Foss-Feig, M.; Gorshkov, A. V.

    2017-09-01

    We study the complexity of classically sampling from the output distribution of an Ising spin model, which can be implemented naturally in a variety of atomic, molecular, and optical systems. In particular, we construct a specific example of an Ising Hamiltonian that, after time evolution starting from a trivial initial state, produces a particular output configuration with probability very nearly proportional to the square of the permanent of a matrix with arbitrary integer entries. In a similar spirit to boson sampling, the ability to sample classically from the probability distribution induced by time evolution under this Hamiltonian would imply unlikely complexity theoretic consequences, suggesting that the dynamics of such a spin model cannot be efficiently simulated with a classical computer. Physical Ising spin systems capable of achieving problem-size instances (i.e., qubit numbers) large enough so that classical sampling of the output distribution is classically difficult in practice may be achievable in the near future. Unlike boson sampling, our current results only imply hardness of exact classical sampling, leaving open the important question of whether a much stronger approximate-sampling hardness result holds in this context. The latter is most likely necessary to enable a convincing experimental demonstration of quantum supremacy. As referenced in a recent paper [A. Bouland, L. Mancinska, and X. Zhang, in Proceedings of the 31st Conference on Computational Complexity (CCC 2016), Leibniz International Proceedings in Informatics (Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, 2016)], our result completes the sampling hardness classification of two-qubit commuting Hamiltonians.

  14. Exact focusing of extracorporeal shock wave therapy for calcifying tendinopathy.

    Science.gov (United States)

    Haake, Michael; Deike, Barbara; Thon, Alexander; Schmitt, Jan

    2002-04-01

    A controlled prospective randomized study was designed to analyze the effect of extracorporeal shock wave therapy on calcifying tendinopathy of the shoulder focused on the calcified area or the origin of the supraspinatus tendon. Fifty patients were included in the study and were treated with a Storz Minilith Sl-1 shock wave generator. The first group of patients received 4000 impulses (positive energy flux density, 0.78 mJ/mm2) in two treatment sessions after receiving local anesthesia at the origin of the supraspinatus tendon. Patients in the second group received extracorporeal shock wave therapy at the calcified area. Follow-ups were done 12 weeks and 1 year after treatment by an independent observer. An increase of function and a reduction of pain occurred in both groups. Statistical analyses showed a significant superiority of extracorporeal shock wave application at the calcified area in the primary end point (Constant and Murley score). Therefore, exact fluoroscopic focusing of extracorporeal shock wave therapy at the calcific deposit for treatment of calcifying tendinopathy of the supraspinatus muscle is recommended. Based on these results, extracorporeal shock wave application should be focused fluoroscopically with appropriate shock wave generators.

  15. Exact Dynamics via Poisson Process: a unifying Monte Carlo paradigm

    Science.gov (United States)

    Gubernatis, James

    2014-03-01

    A common computational task is solving a set of ordinary differential equations (o.d.e.'s). A little known theorem says that the solution of any set of o.d.e.'s is exactly solved by the expectation value over a set of arbitary Poisson processes of a particular function of the elements of the matrix that defines the o.d.e.'s. The theorem thus provides a new starting point to develop real and imaginary-time continous-time solvers for quantum Monte Carlo algorithms, and several simple observations enable various quantum Monte Carlo techniques and variance reduction methods to transfer to a new context. I will state the theorem, note a transformation to a very simple computational scheme, and illustrate the use of some techniques from the directed-loop algorithm in context of the wavefunction Monte Carlo method that is used to solve the Lindblad master equation for the dynamics of open quantum systems. I will end by noting that as the theorem does not depend on the source of the o.d.e.'s coming from quantum mechanics, it also enables the transfer of continuous-time methods from quantum Monte Carlo to the simulation of various classical equations of motion heretofore only solved deterministically.

  16. Quasitraces on exact C*-algebras are traces

    DEFF Research Database (Denmark)

    Haagerup, Uffe

    2014-01-01

    It is shown that all 2-quasitraces on a unital exact C ∗   -algebra are traces. As consequences one gets: (1) Every stably finite exact unital C ∗   -algebra has a tracial state, and (2) if an AW ∗   -factor of type II 1   is generated (as an AW ∗   -algebra) by an exact C ∗   -subalgebra, then i...

  17. On exact solutions of modified KdV-ZK equation

    Directory of Open Access Journals (Sweden)

    Syed Tauseef Mohyud-Din

    2016-12-01

    Full Text Available In this work, we established some exact particular solutions with parameters for Modified KdV-ZK Equation. The improved tanϕ(ξ2-expansion method is introduced to construct exact particular solutions of nonlinear evolution equations. The exact particular solutions contain four types: hyperbolic function solution, trigonometric function solution, exponential solution, and rational solution. The method appears to be effective mathematical tool for solving nonlinear evolution equations (NLEEs in applied mathematics and engineering.

  18. Transient response of lattice structures based on exact member theory

    Science.gov (United States)

    Anderson, Melvin S.

    1989-01-01

    The computer program BUNVIS-RG, which treats vibration and buckling of lattice structures using exact member stiffness matrices, has been extended to calculate the exact modal mass and stiffness quantities that can be used in a conventional transient response analysis based on modes. The exact nature of the development allows inclusion of local member response without introduction of any interior member nodes. Results are given for several problems in which significant interaction between local and global response occurs.

  19. Exact classical Doppler effect derived from the photon emission process

    CERN Document Server

    Lin, Chyi-Lung; Hsieh, Shang-Lin; Tsai, Chun-Ming

    2016-01-01

    The concept of photon is not necessary only applied to the relativistic Doppler theory. It may also work well for classical theory. As conservation of momentum and energy are physical laws, if applying these laws gives the exact relativistic Doppler effect, it should also give the exact classical Doppler effect. So far the classical Doppler effect is only obtained by using some approximation, as derived by Fermi in 1932. We show that the exact classical Doppler effect can be derived from the photon emission process in the exact treatment and reveal that these results are the same as those derived from the wave theory of light.

  20. On the exact controllability of a nonlinear stochastic heat equation

    Directory of Open Access Journals (Sweden)

    Bui An Ton

    2006-01-01

    Full Text Available The exact controllability of a nonlinear stochastic heat equation with null Dirichlet boundary conditions, nonzero initial and target values, and an interior control is established.

  1. Poverty Reduction

    OpenAIRE

    Ortiz, Isabel

    2007-01-01

    The paper reviews poverty trends and measurements, poverty reduction in historical perspective, the poverty-inequality-growth debate, national poverty reduction strategies, criticisms of the agenda and the need for redistribution, international policies for poverty reduction, and ultimately understanding poverty at a global scale. It belongs to a series of backgrounders developed at Joseph Stiglitz's Initiative for Policy Dialogue.

  2. Gradient networks

    Science.gov (United States)

    Toroczkai, Zoltán; Kozma, Balázs; Bassler, Kevin E.; Hengartner, N. W.; Korniss, G.

    2008-04-01

    Gradient networks are defined (Toroczkai and Bassler 2004 Nature 428 716) as directed graphs formed by local gradients of a scalar field distributed on the nodes of a substrate network G. We present the derivation for some of the general properties of gradient graphs and give an exact expression for the in-degree distribution R(l) of the gradient network when the substrate is a binomial (Erd{\\;\\kern -0.10em \\raise -0.35ex \\{{^{^{\\prime\\prime}}}}\\kern -0.57em \\o} s-Rényi) random graph, G_{N,p} , and the scalars are independent identically distributed (i.i.d.) random variables. We show that in the limit N \\to \\infty, p \\to 0, z = pN = \\mbox{const} \\gg 1, R(l)\\propto l^{-1} for l Bassler (2004 Nature 428 716).

  3. Truncating an exact matrix product state for the XY model: Transfer matrix and its renormalization

    Science.gov (United States)

    Rams, Marek M.; Zauner, Valentin; Bal, Matthias; Haegeman, Jutho; Verstraete, Frank

    2015-12-01

    We discuss how to analytically obtain an essentially infinite matrix product state (MPS) representation of the ground state of the XY model. On one hand this allows us to illustrate how the Ornstein-Zernike form of the correlation function emerges in the exact case using standard MPS language. On the other hand we study the consequences of truncating the bond dimension of the exact MPS, which is also part of many tensor network algorithms, and analyze how the truncated MPS transfer matrix is representing the dominant part of the exact quantum transfer matrix. In the gapped phase we observe that the correlation length obtained from a truncated MPS approaches the exact value following a power law in effective bond dimension. In the gapless phase we find a good match between a state obtained numerically from standard MPS techniques with finite bond dimension and a state obtained by effective finite imaginary time evolution in our framework. This provides a direct hint for a geometric interpretation of finite entanglement scaling at the critical point in this case. Finally, by analyzing the spectra of transfer matrices, we support the interpretation put forward by V. Zauner et al. [New J. Phys. 17, 053002 (2015), 10.1088/1367-2630/17/5/053002] that the MPS transfer matrix emerges from the quantum transfer matrix though the application of Wilson's numerical renormalization group along the imaginary-time direction.

  4. Exact integrability in quantum field theory and statistical systems

    Science.gov (United States)

    Thacker, H. B.

    1981-04-01

    The properties of exactly integrable two-dimensional quantum systems are reviewed and discussed. The nature of exact integrability as a physical phenomenon and various aspects of the mathematical formalism are explored by discussing several examples, including detailed treatments of the nonlinear Schrödinger (delta-function gas) model, the massive Thirring model, and the six-vertex (ice) model. The diagonalization of a Hamiltonian by Bethe's Ansatz is illustrated for the nonlinear Schrödínger model, and the integral equation method of Lieb for obtaining the spectrum of the many-body system from periodic boundary conditions is reviewed. Similar methods are applied to the massive Thirring model, where the fermion-antifermion and bound-state spectrum are obtained explicitly by the integral equation method. After a brief review of the classical inverse scattering method, the quantum inverse method for the nonlinear Schrödinger model is introduced and shown to be an algebraization of the Bethe Ansatz technique. In the quantum inverse method, an auxiliary linear problem is used to define nonlocal operators which are functionals of the original local field on a fixed-time string of arbitrary length. The particular operators for which the string is infinitely long (free boundary conditions) or forms a closed loop around a cylinder (periodic boundary conditions) correspond to the quantized scattering data and have a special significance. One of them creates the Bethe eigenstates, while the other is the generating function for an infinite number of conservation laws. The analogous operators on a lattice are constructed for the symmetric six-vertex model, where the object which corresponds to a solution of the auxiliary linear problem is a string of vertices contracted over horizontal links (arrows). The relationship between the quantum inverse method and the transfer matrix formalism is exhibited. The inverse Gel'fand-Levitan transform which expresses the local field

  5. Robustness of Interdependent Networks

    Science.gov (United States)

    Havlin, Shlomo

    2011-03-01

    In interdependent networks, when nodes in one network fail, they cause dependent nodes in other networks to also fail. This may happen recursively and can lead to a cascade of failures. In fact, a failure of a very small fraction of nodes in one network may lead to the complete fragmentation of a system of many interdependent networks. We will present a framework for understanding the robustness of interacting networks subject to such cascading failures and provide a basic analytic approach that may be useful in future studies. We present exact analytical solutions for the critical fraction of nodes that upon removal will lead to a failure cascade and to a complete fragmentation of two interdependent networks in a first order transition. Surprisingly, analyzing complex systems as a set of interdependent networks may alter a basic assumption that network theory has relied on: while for a single network a broader degree distribution of the network nodes results in the network being more robust to random failures, for interdependent networks, the broader the distribution is, the more vulnerable the networks become to random failure. We also show that reducing the coupling between the networks leads to a change from a first order percolation phase transition to a second order percolation transition at a critical point. These findings pose a significant challenge to the future design of robust networks that need to consider the unique properties of interdependent networks.

  6. 基于废料削减的反应器网络综合—环境指标瞬时值%Reactor Network Synthesis for Waste Reduction Using Instantaneous Value of Environmental Index

    Institute of Scientific and Technical Information of China (English)

    陈启石; 冯霄

    2008-01-01

    Waste reduction is gaining importance as the preferred means of pollution prevention. Reactor networksynthesis is one of the key parts of chemical process synthesis. In this study, a geometric approach to reactor net-work synthesis for waste reduction is presented. The bases of the approach are potential environment impact (PEI)rate-law expression, PEI balance and the instantaneous value of environmental indexes. The instantaneous value can bederived using the PEI balance, PEI rate-law expression and the environmental indexes. The optimal reactor networkswith the minimum generation of potential environment impact are geometrically derived by comparing with areasof the corresponding regions. From the case study involving complex reactions, the approach does not involve solv-ing the complicated mathematical problem and can avoid the dimension limitation in the attainable region approach.

  7. THM reduction on water distribution network with chlorine dioxide as disinfectant; Reduccion de THM en red de distribucion utilizando dioxido de cloro como desinfectante

    Energy Technology Data Exchange (ETDEWEB)

    Ventura, G.; Gorriz, D.; Pascual, E.; Romero, M.

    2009-07-01

    A disinfectant change on water distribution network, by chlorine dioxide in that case, avoids THM formation. In the other hand it creates big doubts about utilization and analytical determination of another oxidant different to chlorine. Just a need to comply the current legislation points us to make a change as the one mentioned above and carried out in DWTP Rio Verde, being managed by Acosol, where the THM formation is been reduced to 80%, according to the new limit of 100{mu}g/l, along the 200 km of the supply network. (Author) 13 refs.

  8. New Approach to Find Exact Solutions to Classical Boussinesq System

    Institute of Scientific and Technical Information of China (English)

    ZHI Hong-Yan; ZHAO Xue-Qin; ZHANG Hong-Qing

    2005-01-01

    In this paper, based on a new system of three Riccati equations, we give a new method to construct more new exact solutions of nonlinear differential equations in mathematical physics. The classical Boussinesq system is chosen to illustrate our method. As a consequence, more families of new exact solutions are obtained, which include solitary wave solutions and periodic solutions.

  9. Dirac oscillators and quasi-exactly solvable operators

    CERN Document Server

    Brihaye, Y

    2005-01-01

    The Dirac equation is considered in the background of potentials of several types, namely scalar and vector-potentials as well as "Dirac-oscillator" potential or some of its generalisations. We investigate the radial Dirac equation within a quite general spherically symmetric form for these potentials and we analyse some exactly and quasi exactly solvable properties of the underlying matricial linear operators.

  10. A Family of Exact Solutions for the Nonlinear Schrodinger Equation

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In this paper, the nonlinear Schrodinger (NLS) equation was analytically solved. Firstly, the stationary solutions of NLSequation were explicitly given by the elliptic functions. Then a family of exact solutions of NLS equation were obtained from these sta-tionary solutions by a method for finding new exact solutions from the stationary solutions of integrable evolution equations.

  11. Exact isotropic scalar field cosmologies in Einstein-Cartan theory

    Energy Technology Data Exchange (ETDEWEB)

    Galiakhmetov, A M, E-mail: agal17@mail.r [Department of Physics, Donetsk National Technical University, Kirova street 51, 84646, Gorlovka (Ukraine)

    2010-03-07

    Exact general solutions to the Einstein-Cartan equations are obtained for spatially flat isotropic and homogeneous cosmologies with a nonminimally coupled scalar field. It is shown that both singular and nonsingular models are possible. Exact general solutions of an analogous problem in the torsion-less case are derived. The role of torsion in the evolution of models is elucidated.

  12. Exact null controllability of degenerate evolution equations with scalar control

    Energy Technology Data Exchange (ETDEWEB)

    Fedorov, Vladimir E; Shklyar, Benzion

    2012-12-31

    Necessary and sufficient conditions for the exact null controllability of a degenerate linear evolution equation with scalar control are obtained. These general results are used to examine the exact null controllability of the Dzektser equation in the theory of seepage. Bibliography: 13 titles.

  13. Time-dependent exact solutions of the nonlinear Kompaneets equation

    Energy Technology Data Exchange (ETDEWEB)

    Ibragimov, N H, E-mail: nib@bth.s [Department of Mathematics and Science, Blekinge Institute of Technology, 371 79 Karlskrona (Sweden)

    2010-12-17

    Time-dependent exact solutions of the Kompaneets photon diffusion equation are obtained for several approximations of this equation. One of the approximations describes the case when the induced scattering is dominant. In this case, the Kompaneets equation has an additional symmetry which is used for constructing some exact solutions as group invariant solutions. (fast track communication)

  14. Exact Cover Problem in Milton Babbitt's All-partition Array

    DEFF Research Database (Denmark)

    2015-01-01

    One aspect of analyzing Milton Babbitt’s (1916–2011) all- partition arrays requires finding a sequence of distinct, non-overlapping aggregate regions that completely and exactly covers an irregular matrix of pitch class integers. This is an example of the so-called exact cover problem. Given a set...

  15. LOCAL EXACT BOUNDARY CONTROLLABILITY FOR A CLASS OFQUASILINEAR HYPERBOLIC SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    For a class of mixed initial-boundary value problem for general quasilinear hyperbolic systems, this paper establishes the local exact boundary controllability with boundary controls only acting on one end. As an application, the authors show the local exact boundary controllability for a kind of nonlinear vibrating string problem.

  16. Probabilistic Inferences in Bayesian Networks

    OpenAIRE

    Ding, Jianguo

    2010-01-01

    This chapter summarizes the popular inferences methods in Bayesian networks. The results demonstrates that the evidence can propagated across the Bayesian networks by any links, whatever it is forward or backward or intercausal style. The belief updating of Bayesian networks can be obtained by various available inference techniques. Theoretically, exact inferences in Bayesian networks is feasible and manageable. However, the computing and inference is NP-hard. That means, in applications, in ...

  17. An exact factorization perspective on quantum interferences in nonadiabatic dynamics

    Science.gov (United States)

    Curchod, Basile F. E.; Agostini, Federica; Gross, E. K. U.

    2016-07-01

    Nonadiabatic quantum interferences emerge whenever nuclear wavefunctions in different electronic states meet and interact in a nonadiabatic region. In this work, we analyze how nonadiabatic quantum interferences translate in the context of the exact factorization of the molecular wavefunction. In particular, we focus our attention on the shape of the time-dependent potential energy surface—the exact surface on which the nuclear dynamics takes place. We use a one-dimensional exactly solvable model to reproduce different conditions for quantum interferences, whose characteristic features already appear in one-dimension. The time-dependent potential energy surface develops complex features when strong interferences are present, in clear contrast to the observed behavior in simple nonadiabatic crossing cases. Nevertheless, independent classical trajectories propagated on the exact time-dependent potential energy surface reasonably conserve a distribution in configuration space that mimics one of the exact nuclear probability densities.

  18. An Exact Factorization Perspective on Quantum Interferences in Nonadiabatic Dynamics

    CERN Document Server

    Curchod, Basile F E; Gross, E K U

    2016-01-01

    Nonadiabatic quantum interferences emerge whenever nuclear wavefunctions in different electronic states meet and interact in a nonadiabatic region. In this work, we analyze how nonadiabatic quantum interferences translate in the context of the exact factorization of the molecular wavefunction. In particular, we focus our attention on the shape of the time-dependent potential energy surface - the exact surface on which the nuclear dynamics takes place - using an exactly-solvable model to reproduce different conditions for quantum interferences. The time-dependent potential energy surface develops complex features when strong interferences are present, in clear contrast to the observed behavior in simple nonadiabatic crossing cases. Nevertheless, independent classical trajectories propagated on the exact time-dependent potential energy surface reasonably conserve a distribution in configuration space that mimics the one of the exact nuclear probability density.

  19. Efficient and exact maximum likelihood quantisation of genomic features using dynamic programming.

    Science.gov (United States)

    Song, Mingzhou; Haralick, Robert M; Boissinot, Stéphane

    2010-01-01

    An efficient and exact dynamic programming algorithm is introduced to quantise a continuous random variable into a discrete random variable that maximises the likelihood of the quantised probability distribution for the original continuous random variable. Quantisation is often useful before statistical analysis and modelling of large discrete network models from observations of multiple continuous random variables. The quantisation algorithm is applied to genomic features including the recombination rate distribution across the chromosomes and the non-coding transposable element LINE-1 in the human genome. The association pattern is studied between the recombination rate, obtained by quantisation at genomic locations around LINE-1 elements, and the length groups of LINE-1 elements, also obtained by quantisation on LINE-1 length. The exact and density-preserving quantisation approach provides an alternative superior to the inexact and distance-based univariate iterative k-means clustering algorithm for discretisation.

  20. On PT Symmetry Systems: Invariance, Conservation Laws, and Reductions

    Directory of Open Access Journals (Sweden)

    P. Masemola

    2014-01-01

    results in a scalar cubic Schrödinger equation. We investigate the relationship between the conservation laws and Lie symmetries and investigate a Lagrangian, corresponding Noether symmetries, conserved vectors, and exact solutions via “double reductions.”

  1. Harmonic oscillator in heat bath: Exact simulation of time-lapse-recorded data and exact analytical benchmark statistics

    DEFF Research Database (Denmark)

    Nørrelykke, Simon F; Flyvbjerg, Henrik

    2011-01-01

    The stochastic dynamics of the damped harmonic oscillator in a heat bath is simulated with an algorithm that is exact for time steps of arbitrary size. Exact analytical results are given for correlation functions and power spectra in the form they acquire when computed from experimental time...

  2. Extensin network formation in Vitis vinifera callus cells is an essential and causal event in rapid and H2O2-induced reduction in primary cell wall hydration

    OpenAIRE

    MacDougall Alistair J; Findlay Kim; Vatulescu Ada D; Ribeiro José ML; Pereira Cristina; Jackson Phil AP

    2011-01-01

    Abstract Background Extensin deposition is considered important for the correct assembly and biophysical properties of primary cell walls, with consequences to plant resistance to pathogens, tissue morphology, cell adhesion and extension growth. However, evidence for a direct and causal role for the extensin network formation in changes to cell wall properties has been lacking. Results Hydrogen peroxide treatment of grapevine (Vitis vinifera cv. Touriga) callus cell walls was seen to induce a...

  3. Data reduction and tying in regional gravity surveys—results from a new gravity base station network and the Bouguer gravity anomaly map for northeastern Mexico

    Science.gov (United States)

    Hurtado-Cardador, Manuel; Urrutia-Fucugauchi, Jaime

    2006-12-01

    Since 1947 Petroleos Mexicanos (Pemex) has conducted oil exploration projects using potential field methods. Geophysical exploration companies under contracts with Pemex carried out gravity anomaly surveys that were referred to different floating data. Each survey comprises observations of gravity stations along highways, roads and trails at intervals of about 500 m. At present, 265 separate gravimeter surveys that cover 60% of the Mexican territory (mainly in the oil producing regions of Mexico) are available. This gravity database represents the largest, highest spatial resolution information, and consequently has been used in the geophysical data compilations for the Mexico and North America gravity anomaly maps. Regional integration of gravimeter surveys generates gradients and spurious anomalies in the Bouguer anomaly maps at the boundaries of the connected surveys due to the different gravity base stations utilized. The main objective of this study is to refer all gravimeter surveys from Pemex to a single new first-order gravity base station network, in order to eliminate problems of gradients and spurious anomalies. A second objective is to establish a network of permanent gravity base stations (BGP), referred to a single base from the World Gravity System. Four regional loops of BGP covering eight States of Mexico were established to support the tie of local gravity base stations from each of the gravimeter surveys located in the vicinity of these loops. The third objective is to add the gravity constants, measured and calculated, for each of the 265 gravimeter surveys to their corresponding files in the Pemex and Instituto Mexicano del Petroleo database. The gravity base used as the common datum is the station SILAG 9135-49 (Latin American System of Gravity) located in the National Observatory of Tacubaya in Mexico City. We present the results of the installation of a new gravity base network in northeastern Mexico, reference of the 43 gravimeter surveys

  4. Approximate reduction of dynamical systems

    CERN Document Server

    Tabuada, Paulo; Julius, Agung; Pappas, George J

    2007-01-01

    The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with mechanical systems with symmetry--which, unfortunately, limits the type of systems to which it can be applied. The goal of this paper is to consider a more general form of reduction, termed approximate reduction, in order to extend the class of systems that can be reduced. Using notions related to incremental stability, we give conditions on when a dynamical system can be projected to a lower dimensional space while providing hard bounds on the induced errors, i.e., when it is behaviorally similar to a dynamical system on a lower dimensional space. These concepts are illustrated on a series of examples.

  5. Lie symmetry analysis and exact solutions of the quasigeostrophic two-layer problem

    Science.gov (United States)

    Bihlo, Alexander; Popovych, Roman O.

    2011-03-01

    The quasigeostrophic two-layer model is of superior interest in dynamic meteorology since it is one of the easiest ways to study baroclinic processes in geophysical fluid dynamics. The complete set of point symmetries of the two-layer equations is determined. An optimal set of one- and two-dimensional inequivalent subalgebras of the maximal Lie invariance algebra is constructed. On the basis of these subalgebras, we exhaustively carry out group-invariant reduction and compute various classes of exact solutions. Wherever possible, reference to the physical meaning of the exact solutions is given. In particular, the well-known baroclinic Rossby wave solutions in the two-layer model are rediscovered.

  6. Exact Solutions of Atmospheric (2+1)-Dimensional Nonlinear Incompressible Non-hydrostatic Boussinesq Equations

    Science.gov (United States)

    Liu, Ping; Wang, Ya-Xiong; Ren, Bo; Li, Jin-Hua

    2016-12-01

    Exact solutions of the atmospheric (2+1)-dimensional nonlinear incompressible non-hydrostatic Boussinesq (INHB) equations are researched by Combining function expansion and symmetry method. By function expansion, several expansion coefficient equations are derived. Symmetries and similarity solutions are researched in order to obtain exact solutions of the INHB equations. Three types of symmetry reduction equations and similarity solutions for the expansion coefficient equations are proposed. Non-traveling wave solutions for the INHB equations are obtained by symmetries of the expansion coefficient equations. Making traveling wave transformations on expansion coefficient equations, we demonstrate some traveling wave solutions of the INHB equations. The evolutions on the wind velocities, temperature perturbation and pressure perturbation are demonstrated by figures, which demonstrate the periodic evolutions with time and space. Supported by the National Natural Science Foundation of China under Grant Nos. 11305031 and 11305106, and Training Programme Foundation for Outstanding Young Teachers in Higher Education Institutions of Guangdong Province under Grant No. Yq2013205

  7. Diagnosis of status of aluminum reduction cells based on symmetric Alpha-stable probabilistic distribution neural network%基于对称Alpha稳定分布概率神经网络的铝电解槽况诊断

    Institute of Scientific and Technical Information of China (English)

    易军; 李太福; 田应甫; 姚立忠; 侯杰

    2012-01-01

    The numerous variables in non-steady state of aluminum reduction cells are non-Gaussian and impulsive. Due to correlation of variables, the condition that training samples must be independent and identically distributed is not fulfilled. For these reasons, it is too hard to diagnose the status of aluminum reduction cells in application. A diagnosis method for the status of aluminum reduction cells based on symmetric Alpha-stable (SaS) probabilistic distribution neural network was proposed. In the method, probability density function of SaS was introduced as radial basis function of model layer into the probabilistic neural network because such function had good fitting ability to non-Gaussian distributed data. And it also improved neural network approximation ability of partial pulse burst. By using 40 groups data of 170 kA operating aluminum smelter from a factory, this method could diagnose five statuses of aluminum reduction cells correctly and had not only stronger adaptability and robustness, but also approximation reliability and fast convergence.%在铝电解槽非稳态情况下,槽参数易发生局部突变,呈现非高斯概率分布,且各种槽参数相关性较强,无法满足概率神经网络中训练样本必须服从独立同分布的假设条件,影响槽况诊断的精确度.提出一种基于对称Alpha稳定分布概率神经网络的铝电解槽况诊断方法,利用其对非高斯分布数据的良好近似拟合能力,改进模式层的径向基函数,提高概率神经网络对槽参数局部突变的适应性.通过取自某厂170 kA大型预焙槽的样本进行检验表明,该方法能够对5种槽况做出正确的诊断,具有较强的分类精度和收敛速度.

  8. Symmetry Reductions, Exact Solutions and Conservation Laws of Asymmetric Nizhnik-Novikov-Veselov Equation

    Institute of Scientific and Technical Information of China (English)

    ZHANG Li-Hua; WANG Ling; LIU Xi-Qiang; DONG Zhong-Zhou; BAI Cheng-Lin; LIU Xi-Qiang

    2008-01-01

    By applying a direct symmetry method, we get the symmetry of the asymmetric Nizhnik-Novikov-Veselov equation (ANNV). Taking the special case, we have a finite-dimensional symmetry. By using the equivalent vector of the symmetry, we construct an eight-dimensional symmetry algebra and get the optimal system of group-invariant solutions. To every case of the optimal system, we reduce the ANNV equation and obtain some solutions to the reduced equations. Furthermore, we find some new explicit solutions of the ANNV equation. At last, we give the conservation laws of the ANNV equation.

  9. Dissociation between exact and approximate addition in developmental dyslexia.

    Science.gov (United States)

    Yang, Xiujie; Meng, Xiangzhi

    2016-09-01

    Previous research has suggested that number sense and language are involved in number representation and calculation, in which number sense supports approximate arithmetic, and language permits exact enumeration and calculation. Meanwhile, individuals with dyslexia have a core deficit in phonological processing. Based on these findings, we thus hypothesized that children with dyslexia may exhibit exact calculation impairment while doing mental arithmetic. The reaction time and accuracy while doing exact and approximate addition with symbolic Arabic digits and non-symbolic visual arrays of dots were compared between typically developing children and children with dyslexia. Reaction time analyses did not reveal any differences across two groups of children, the accuracies, interestingly, revealed a distinction of approximation and exact addition across two groups of children. Specifically, two groups of children had no differences in approximation. Children with dyslexia, however, had significantly lower accuracy in exact addition in both symbolic and non-symbolic tasks than that of typically developing children. Moreover, linguistic performances were selectively associated with exact calculation across individuals. These results suggested that children with dyslexia have a mental arithmetic deficit specifically in the realm of exact calculation, while their approximation ability is relatively intact.

  10. Kohn-Sham calculations with the exact functional

    CERN Document Server

    Wagner, Lucas O; Stoudenmire, E M; Burke, Kieron; White, Steven R

    2014-01-01

    As a proof of principle, self-consistent Kohn-Sham calculations are performed with the exact exchange-correlation functional. The systems calculated are one-dimensional real-space interacting fermions with more than two electrons. To find the exact functional for trial densities requires solving the interacting Schroedinger equation multiple times, a much more demanding task than direct solution of the Schr\\"odinger equation. The density matrix renormalization group method makes this possible. We illustrate and explore the convergence properties of the exact KS scheme for both weakly and strongly correlated systems. We also explore the spin-dependent generalization and densities for which the functional is ill defined.

  11. Generating exact solutions to Einstein's equation using linearized approximations

    Science.gov (United States)

    Harte, Abraham I.; Vines, Justin

    2016-10-01

    We show that certain solutions to the linearized Einstein equation can—by the application of a particular type of linearized gauge transformation—be straightforwardly transformed into solutions of the exact Einstein equation. In cases with nontrivial matter content, the exact stress-energy tensor of the transformed metric has the same eigenvalues and eigenvectors as the linearized stress-energy tensor of the initial approximation. When our gauge exists, the tensorial structure of transformed metric perturbations identically eliminates all nonlinearities in Einstein's equation. As examples, we derive the exact Kerr and gravitational plane wave metrics from standard harmonic-gauge approximations.

  12. Generating exact solutions to Einstein's equation using linearized approximations

    CERN Document Server

    Harte, Abraham I

    2016-01-01

    We show that certain solutions to the linearized Einstein equation can---by the application of a particular type of linearized gauge transformation---be straightforwardly transformed into solutions of the exact Einstein equation. In cases with nontrivial matter content, the exact stress-energy tensor of the transformed metric has the same eigenvalues and eigenvectors as the linearized stress-energy tensor of the initial approximation. When our gauge exists, the tensorial structure of transformed metric perturbations identically eliminates all nonlinearities in Einstein's equation. As examples, we derive the exact Kerr and gravitational plane wave metrics from standard harmonic-gauge approximations.

  13. The Quasi-Exactly Solvable Problems in Relativistic Quantum Mechanics

    Science.gov (United States)

    Liu, Li-Yan; Hao, Qing-Hai

    2014-06-01

    We study the quasi-exactly solvable problems in relativistic quantum mechanics. We consider the problems for the two-dimensional Klein—Gordon and Dirac equations with equal vector and scalar potentials, and try to find the general form of the quasi-exactly solvable potential. After obtaining the general form of the potential, we present several examples to give the specific forms. In the examples, we show for special parameters the harmonic potential plus Coulomb potential, Killingbeck potential and a quartic potential plus Cornell potential are quasi-exactly solvable potentials.

  14. Exact and approximate expressions for the period of anharmonic oscillators

    Energy Technology Data Exchange (ETDEWEB)

    Amore, Paolo [Facultad de Ciencias, Universidad de Colima, Bernal DIaz del Castillo 340, Colima (Mexico); Fernandez, Francisco M [INIFTA (Conicet, UNLP), Blvd. 113 y 64 S/N, Sucursal 4, Casilla de Correo 16, 1900 La Plata (Argentina)

    2005-07-01

    In this paper, we present a straightforward systematic method for the exact and approximate calculation of integrals that appear in formulae for the period of anharmonic oscillators and other problems of interest in classical mechanics.

  15. Exact BPS domain walls at finite gauge coupling

    CERN Document Server

    Blaschke, Filip

    2016-01-01

    Bogomol'nyi-Prasad-Sommerfield solitons in models with spontaneously broken gauge symmetry have been intensively studied at infinite gauge coupling limit, where the governing equation -- so-called master equation -- is exactly solvable. Except of handful of special solutions, the standing impression is that analytic results at finite coupling are generally unavailable. The aim of this paper is to demonstrate, using domain walls in Abelian-Higgs models as a simplest example, that exact solitons at finite gauge coupling can be readily obtained, if the number of Higgs fields ($N_F$) is large enough. In particular, we present a family of exact solutions, describing $N$ domain walls at arbitrary positions in models with at least $N_F \\geq 2N+1$. We have also found that adding together any pair of solution can produce a new exact solution, if the combined tension is below certain limit.

  16. On exact triangles consisting of stable vector bundles on tori

    CERN Document Server

    Kobayashi, Kazushi

    2016-01-01

    In this paper, we consider the exact triangles consisting of stable holomorphic vector bundles on one-dimensional complex tori, and discuss their relations with the corresponding Fukaya category via the homological mirror symmetry.

  17. Exact Controllability for a Class of Nonlinear Evolution Control Systems

    Institute of Scientific and Technical Information of China (English)

    L¨u Yue; Li Yong

    2015-01-01

    In this paper, we study the exact controllability of the nonlinear control systems. The controllability results by using the monotone operator theory are es-tablished. No compactness assumptions are imposed in the main results.

  18. Cohomology of exact categories and (non-)additive sheaves

    CERN Document Server

    Kaledin, Dmitry

    2011-01-01

    We use (non-)additive sheaves to introduce an (absolute) notion of Hochschild cohomology for exact categories as Ext's in a suitable bisheaf category. We compare our approach to various definitions present in the literature.

  19. A New Exactly Solvable Inflation Model and its Power Spectrum

    Institute of Scientific and Technical Information of China (English)

    李新洲; 刘道军; 郝建纲

    2003-01-01

    We present a new exactly solvable inflation model in which inflation can stop automatically, and in the approximately de Sitter limit, we give its power spectrum which can be tested in the future observations of cosmic microwave background anisotropy.

  20. On exact solutions in multidimensional gravity with antisymmetric forms

    CERN Document Server

    Ivashchuk, V D

    2001-01-01

    This short review deals with a multidimensional gravitational model containing dilatonic scalar fields and antisymmetric forms. The manifold is chosen in the product form. The sigma-model approach and exact solutions are reviewed.

  1. Exactly solvable models for multiatomic molecular Bose-Einstein condensates

    Science.gov (United States)

    Santos, G.

    2011-08-01

    I introduce two families of exactly solvable models for multiatomic hetero-nuclear and homo-nuclear molecular Bose-Einstein condensates through the algebraic Bethe ansatz method. The conserved quantities of the respective models are also shown.

  2. Exactly solvable models for multiatomic molecular Bose-Einstein condensates

    Energy Technology Data Exchange (ETDEWEB)

    Santos, G, E-mail: gfilho@if.ufrgs.br, E-mail: gfilho@cbpf.br [Instituto de Fisica da UFRGS, Av. Bento Goncalves, 9500, Agronomia, Porto Alegre, RS (Brazil)

    2011-08-26

    I introduce two families of exactly solvable models for multiatomic hetero-nuclear and homo-nuclear molecular Bose-Einstein condensates through the algebraic Bethe ansatz method. The conserved quantities of the respective models are also shown. (paper)

  3. The exact solutions for a nonisospectral nonlinear Schroedinger equation

    Energy Technology Data Exchange (ETDEWEB)

    Ning Tongke [Finance College, Shanghai Normal University, Shanghai 200234 (China)], E-mail: tkning@shnu.edu.cn; Zhang Weiguo; Jia Gao [Science College, University of Shanghai for Science and Technology, Shanghai 200093 (China)

    2009-10-30

    In this paper, lax pair for the nonisospectral nonlinear Schroedinger hierarchy is given, the time dependence of nonisospectral scattering data is derived and exact solutions for the nonisospectral nonlinear Schroedinger hierarchy are obtained through the inverse scattering transform.

  4. Exact theory of intermediate phases in two dimensions

    Energy Technology Data Exchange (ETDEWEB)

    Delfino, Gesualdo, E-mail: delfino@sissa.it; Squarcini, Alessio, E-mail: alessio.squarcini@sissa.it

    2014-03-15

    We show how field theory yields the exact description of intermediate phases in the scaling limit of two-dimensional statistical systems at a first order phase transition point. The ability of a third phase to form an intermediate wetting layer or only isolated bubbles is explicitly related to the spectrum of excitations of the field theory. The order parameter profiles are determined and interface properties such as passage probabilities and internal structure are deduced from them. The theory is illustrated through the application to the q-state Potts model and the Ashkin–Teller model. The latter is shown to provide the first exact solution of a bulk wetting transition. -- Highlights: •Phase separation with appearance of a third phase is studied exactly. •Interfacial properties are derived from field theory. •Exact solution of bulk wetting transition is provided.

  5. Generalization of quasi-exactly solvable and isospectral potentials

    Indian Academy of Sciences (India)

    P K Bera; J Datta; M M Panja; Tapas Sil

    2007-09-01

    A unified approach in the light of supersymmetric quantum mechanics (SSQM) has been suggested for generating multidimensional quasi-exactly solvable (QES) potentials. This method provides a convenient means to construct isospectral potentials of derived potentials.

  6. Exact Solutions of the Generalized Benjamin-Bona-Mahony Equation

    Directory of Open Access Journals (Sweden)

    Xun Liu

    2010-01-01

    Full Text Available We apply the theory of Weierstrass elliptic function to study exact solutions of the generalized Benjamin-Bona-Mahony equation. By using the theory of Weierstrass elliptic integration, we get some traveling wave solutions, which are expressed by the hyperbolic functions and trigonometric functions. This method is effective to find exact solutions of many other similar equations which have arbitrary-order nonlinearity.

  7. Analysis of exact linearization and aproximate feedback linearization techniques

    OpenAIRE

    Schnitman, Leizer; Cardoso, Gildeberto de Souza

    2011-01-01

    p. 1-17 This paper presents a study of linear control systems based on exact feedback linearization and approximate feedback linearization. As exact feedback linearization is applied, a linear controller can perform the control objectives. The approximate feedback linearization is required when a nonlinear system presents a noninvolutive property. It uses a Taylor series expansion in order to compute a nonlinear transformation of coordinates to satisfy the involutivity conditions.

  8. Analysis of Exact Linearization and Aproximate Feedback Linearization Techniques

    OpenAIRE

    Cardoso, Gildeberto S.; Leizer Schnitman

    2011-01-01

    This paper presents a study of linear control systems based on exact feedback linearization and approximate feedback linearization. As exact feedback linearization is applied, a linear controller can perform the control objectives. The approximate feedback linearization is required when a nonlinear system presents a noninvolutive property. It uses a Taylor series expansion in order to compute a nonlinear transformation of coordinates to satisfy the involutivity conditions.

  9. Some exact solutions in K-essence theory isotropic cosmology

    CERN Document Server

    Pimentel, Luis O

    2016-01-01

    We use a simple form of the K-essence theory and apply it to the classic isotropic cosmological model and seek exact solutions. The particular form of the kinetic term that we choose is $K \\left(\\phi, X \\right)= K_0(\\phi)X^m +K_1$. The resulting field equations in the homogeneous and isotropic cosmology (FRW)is considered. Several exact solutions are obtained.

  10. Exact Penalization in Stochastic Programming—Calmness and Constraint Qualification

    OpenAIRE

    Martin Branda

    2014-01-01

    We deal with the conditions which ensure exact penalization in stochastic programming problems under finite discrete distributions. We give several sufficient conditions for problem calmness including graph calmness, existence of an error bound, and generalized Mangasarian-Fromowitz constraint qualification. We propose a new version of the theorem on asymptotic equivalence of local minimizers of chance constrained problems and problems with exact penalty objective. We apply the theory to a pr...

  11. General exact theory of autoresonance in nonautonomous systems

    OpenAIRE

    Chacon, Ricardo

    2003-01-01

    A general exact theory of autoresonance (self-sustained resonance) in both dissipative and Hamiltonian nonautonomous systems is presented. The equations that together govern the autoresonance solutions and excitations are derived with the aid of a variational principle concerning the power functional. The theory is applied to Duffing oscillators to obtain exact analytical expressions for autoresonance excitations and solutions which explain all the phenomenological and approximate results ari...

  12. Black Hole - Moving Mirror I: An Exact Correspondence

    CERN Document Server

    Anderson, Paul R; Evans, Charles R

    2015-01-01

    An exact correspondence is shown between a new moving mirror trajectory in (1+1)D and a spacetime in (1+1)D in which a black hole forms from the collapse of a null shell. It is shown that the Bogolubov coefficients between the "in" and "out" states are identical and the exact Bogolubov coefficients are displayed. Generalization to the (3+1)D black hole case is discussed.

  13. Exact CS Reconstruction Condition of Undersampled Spectrum-Sparse Signals

    Directory of Open Access Journals (Sweden)

    Ying Luo

    2013-01-01

    Full Text Available Compressive sensing (CS reconstruction of a spectrum-sparse signal from undersampled data is, in fact, an ill-posed problem. In this paper, we mathematically prove that, in certain cases, the exact CS reconstruction of a spectrum-sparse signal from undersampled data is impossible. Then we present the exact CS reconstruction condition of undersampled spectrum-sparse signals, which is valuable for digital signal compression.

  14. Exact and Approximate Quadratures for Curvature Tensor Estimation

    OpenAIRE

    Langer, Torsten; Belyaev, Alexander; Seidel, Hans-Peter; Greiner, Günther; Hornegger, Joachim; Niemann, Heinrich; Stamminger, Marc

    2005-01-01

    Accurate estimations of geometric properties of a surface from its discrete approximation are important for many computer graphics and geometric modeling applications. In this paper, we derive exact quadrature formulae for mean curvature, Gaussian curvature, and the Taubin integral representation of the curvature tensor. The exact quadratures are then used to obtain reliable estimates of the curvature tensor of a smooth surface approximated by a dense triangle me...

  15. Corollary from the Exact Expression for Enthalpy of Vaporization

    Directory of Open Access Journals (Sweden)

    A. A. Sobko

    2011-01-01

    Full Text Available A problem on determining effective volumes for atoms and molecules becomes actual due to rapidly developing nanotechnologies. In the present study an exact expression for enthalpy of vaporization is obtained, from which an exact expression is derived for effective volumes of atoms and molecules, and under certain assumptions on the form of an atom (molecule it is possible to find their linear dimensions. The accuracy is only determined by the accuracy of measurements of thermodynamic parameters at the critical point.

  16. Exact solutions of (3 + 1)-dimensional stochastic Burgers equation

    Energy Technology Data Exchange (ETDEWEB)

    Wang Tieying [Department of Applied Mathematics and Physics, Dalian Nationalities for University, Dalian 116600 (China)]. E-mail: wangty@dlnu.edu.cn; Ren Yonghong [Department of Applied Mathematics, Dalian University of Technology, Dalian 116024 (China); Zhao Yali [Department of Mathematics, Chaoyang Teachers College, Chaoyang 122000 (China)

    2006-08-15

    A generalized tan h function method is used for constructing exact travelling wave solutions of nonlinear stochastic partial differential equations. The main idea of this method is to take full advantage of the Riccati equation, which has more exact solutions. More Wick-type stochastic multiple soliton-like solutions and triangular periodic solutions are obtained for the (3 + 1)-dimensional Wick-type stochastic Burgers equation via Hermite transformation.

  17. Exact solutions for steady flows of second-grade fluids

    Institute of Scientific and Technical Information of China (English)

    ZHANG Dao-xiang; FENG Su-xiao; LU Zhi-ming; LIU Yu-lu

    2009-01-01

    This paper aims to investigate exact solutions for a second-grade fluid flow with the inverse method.By assuming the relation between the vorticity field and the streamfunction,the exact solutions of the motion of plane second-grade fluids are investigated and obtained.The solutions obtained include simple Couette flows,slit jet flows and uniform flows over a series of distributed obstacles.

  18. Exact solutions to the generalized Lienard equation and its applications

    Indian Academy of Sciences (India)

    Yang Xian-Lin; Tang Jia-Shi

    2008-12-01

    Some new exact solutions of the generalized Lienard equation are obtained, and the solutions of the equation are applied to solve nonlinear wave equations with nonlinear terms of any order directly. The generalized one-dimensional Klein–Gordon equation, the generalized Ablowitz (A) equation and the generalized Gerdjikov–Ivanov (GI) equation are investigated and abundant new exact travelling wave solutions are obtained that include solitary wave solutions and triangular periodic wave solutions.

  19. Instantaneous Bethe-Salpeter Equation and Its Exact Solution

    Institute of Scientific and Technical Information of China (English)

    CHANG Chao-Hsi; CHEN Jiao-Kai; LI Xue-Qian; WANG Guo-Li

    2005-01-01

    We present an approach to solve Bethe-Salpeter (BS) equations exactly without any approximation if the kernel of the BS equations exactly is instantaneous, and take positronium as an example to illustrate the general features of the exact solutions. The key step for the approach is from the BS equations to derive a set of coupled and welldetermined integration equations in linear eigenvalue for the components of the BS wave functions equivalently, which may be solvable numerically under a controlled accuracy, even though there is no analytic solution. For positronium,the exact solutions precisely present corrections to those of the corresponding Schrodinger equation in order v1 (v is the relative velocity) for eigenfunctions, in order v2 for eigenvalues, and the mixing between S and D components in JPC = 1- states etc., quantitatively. Moreover, we also point out that there is a questionable step in some existent derivations for the instantaneous BS equations if one is pursuing the exact solutions. Finally, we emphasize that one should take the O(v) corrections emerging in the exact solutions into account accordingly if one is interested in the relativistic corrections for relevant problems to the bound states.

  20. Strong conjugation actions induced by flags of exact Borel subalgebras

    Institute of Scientific and Technical Information of China (English)

    ZHANG; Yuehui(张跃辉)

    2002-01-01

    Let A be a quasi-hereditary algebra with a strong exact Borel subalgebra. It is proved that for any standard semisimple subalgebra T there exists an exact Borel subalgebra B of A such that T is a maximal semisimple subalgebra of B. It is shown that the maximal length of flags of exact Borel subalgebras of A is the difference of the radium and the rank of Grothendic group of A plus 2. The number of conjugation-classes of exact Borel subalgebras is 1 if and only if A is basic; the number is 2 if and only if A is semisimple. For all other cases, this number is 0 or no less than 3. Furthermore, it is shown that all the exact Borel subalgebras are idempotent-conjugate to each other, that is, for any exact Borel subalgebras B and C of A, there exists an idempotent e of A, and an invertible element u of A, such that eBe = u-1eCeu.

  1. High-order exact solutions for pseudo-plane ideal flows

    Science.gov (United States)

    Sun, Che

    2016-08-01

    A steady pseudo-plane ideal flow (PIF) model is derived from the 3D Euler equations under Boussinesq approximation. The model is solved analytically to yield high-degree polynomial exact solutions. Unlike quadratic flows, the cubic and quartic solutions display reduced geometry in the form of straightline jet, circular vortex, and multipolar strain field. The high-order circular-vortex solutions are vertically aligned and even the non-aligned multipolar strain-field solutions display vertical concentricity. Such geometry reduction is explained by an analytical theorem stating that only straightline jet and circular vortex have functional solutions to the PIF model.

  2. Q-Conditional Symmetries and Exact Solutions of Nonlinear Reaction–Diffusion Systems

    Directory of Open Access Journals (Sweden)

    Oleksii Pliukhin

    2015-10-01

    Full Text Available A wide range of reaction–diffusion systems with constant diffusivities that are invariant under Q-conditional operators is found. Using the symmetries obtained, the reductions of the corresponding systems to the systems of ODEs are conducted in order to find exact solutions. In particular, the solutions of some reaction–diffusion systems of the Lotka–Volterra type in an explicit form and satisfying Dirichlet boundary conditions are obtained. An biological interpretation is presented in order to show that two different types of interaction between biological species can be described.

  3. Exact N{sup 3}LO results for qq'→H+X

    Energy Technology Data Exchange (ETDEWEB)

    Anzai, Chihaya; Hasselhuhn, Alexander; Hoeschele, Maik; Steinhauser, Matthias [Karlsruhe Institute of Technology (Germany). Inst. fuer Theoretische Teilchenphysik; Hoff, Jens [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Kilgore, William [Brookhaven National Laboratory, Upton, NY (United States). Physics Dept.; Ueda, Takahiro [NIKHEF Theory Group, Amsterdam (Netherlands)

    2015-06-15

    We compute the contribution to the total cross section for the inclusive production of a Standard Model Higgs boson induced by two quarks with different flavour in the initial state. Our calculation is exact in the Higgs boson mass and the partonic center-of-mass energy. We describe the reduction to master integrals, the construction of a canonical basis, and the solution of the corresponding differential equations. Our analytic result contains both Harmonic Polylogarithms and iterated integrals with additional letters in the alphabet.

  4. Facile synthesis of platinum-gold alloyed string-bead nanochain networks with the assistance of allantoin and their enhanced electrocatalytic performance for oxygen reduction and methanol oxidation reactions

    Science.gov (United States)

    He, Li-Li; Zheng, Jie-Ning; Song, Pei; Zhong, Shu-Xian; Wang, Ai-Jun; Chen, Zhaojiang; Feng, Jiu-Ju

    2015-02-01

    In this work, a facile one-pot wet-chemical method is developed for preparation of bimetallic platinum-gold (Pt-Au) alloyed string-bead nanochain networks, using allantoin as a structure-directing agent, without any template, surfactant, or seed. The characterization experiments are mainly performed by transmission electron microscopy (TEM), X-ray photoelectron spectroscopy (XPS), and X-ray diffraction (XRD) spectroscopy. The as-prepared Pt-Au nanocrystals show enhanced electrocatalytic performance toward oxygen reduction reaction (ORR) mainly predominated by a four-electron pathway, and display improved catalytic activity and high stability for methanol oxidation reaction (MOR) over commercial Pt black and Pt-Ru black.

  5. Exact holography of the mass-deformed M2-brane theory

    Energy Technology Data Exchange (ETDEWEB)

    Jang, Dongmin; Kim, Yoonbai; Kwon, O. Kab [Sungkyunkwan University, Department of Physics, BK21 Physics Research Division, Institute of Basic Science, Suwon (Korea, Republic of); Tolla, D.D. [Sungkyunkwan University, Department of Physics, BK21 Physics Research Division, Institute of Basic Science, Suwon (Korea, Republic of); Sungkyunkwan University, University College, Suwon (Korea, Republic of)

    2017-05-15

    We test the holographic relation between the vacuum expectation values of gauge invariant operators in N = 6 U{sub k}(N) x U{sub -k}(N) mass-deformed ABJM theory and the LLM geometries with Z{sub k} orbifold in 11-dimensional supergravity. To do so, we apply the Kaluza-Klein reduction to construct a 4-dimensional gravity theory and implement the holographic renormalization procedure. We obtain an exact holographic relation for the vacuum expectation values of the chiral primary operator with conformal dimension Δ = 1, which is given by left angle O{sup (Δ=1)} right angle = N{sup (3)/(2)} f{sub (Δ=1)}, for large N and k = 1. Here the factor f{sub (Δ)} is independent of N. Our results involve an infinite number of exact dual relations for all possible supersymmetric Higgs vacua and so provide a non-trivial test of gauge/gravity duality away from the conformal fixed point. We extend our results to the case of k ≠ 1 for LLM geometries represented by rectangular-shaped Young diagrams. We also discuss the exact mapping of the gauge/gravity at finite N for classical supersymmetric vacuum solutions in field theory side and corresponding classical solutions in gravity side. (orig.)

  6. 一种基于属性约简和SOM的客户细分方法%A Customer Classification Method Based on Attribute Reduction and SOM Neural Network

    Institute of Scientific and Technical Information of China (English)

    郑永前; 于胜男; 王永生

    2011-01-01

    In the insurance industry, customer classification is the basis for differentiated marketing. Due to the knowledge redundancy, the normally adopted traditional clustering method for customer classification suffers from low clustering quality. In order to achieve an effective classification, this paper proposes a clustering model based on attribute reduction and self-organizing feature map (SOM) neural network. By using attribute reduction rule, it can distinguish the redundant knowledge and effectively discover key attributes.Key attributes are used as inputs for learning by SOM neural network so as to obtain better clustering quality. The effectiveness of proposed method is verified through a ease study from the H Insurance company.%客户细分是保险行业进行差异化营销的基础.由于知识冗余的存在,采用传统的聚类方法进行客户细分存在细分质量低的问题.为有效进行客户细分,提出基于属性约简和SOM的聚类模型.应用属性约简规则处理数据可有效识别冗余知识,找出关键属性;将关键属性作为SOM神经模型的输入,提高客户细分质量.以H保险公司作为实例,使用该模型进行客户细分,通过聚类结果比较,证明方法有效.

  7. Markov Chain-based Degree Distributions of Evolving Networks

    Institute of Scientific and Technical Information of China (English)

    Xiang Xing KONG; Zhen Ting HOU; Ding Hua SHI; Quan Rong CHEN; Qing Gui ZHAO

    2012-01-01

    In this paper,we study a class of stochastic processes,called evolving network Markov chains,in evolving networks. Our approach is to transform the degree distribution problem of an evolving network to a corresponding problem of evolving network Markov chains.We investigate the evolving network Markov chains,thereby obtaining some exact formulas as well as a precise criterion for determining whether the steady degree distribution of the evolving network is a power-law or not.With this new method,we finally obtain a rigorous,exact and unified solution of the steady degree distribution of the evolving network.

  8. Redesigning the network of pedestrian spaces in the function of reduction of CO2 emission. Case study: Pančevo and Vršac

    Directory of Open Access Journals (Sweden)

    Đukić Aleksandra

    2012-01-01

    Full Text Available Research problem. The research problem is the increase of GHG and CO2 emissions in the transport sector, i.e. the intensification of urban transport activity in Serbia during the last 15 years. Focusing on redesigning of pedestrian networks as well as understanding the connections between urban design and pedestrian movement, the walkable environment could be achieved. In addition, as a direct result, a contribution would be made to a decrease of GHG and CO2 emission. Methodology. The following methods were used: analysis of the readability of open spaces, analysis of contents, rhythm and transparency on the ground floor of buildings and analysis of the intensity of use of open spaces using the Space Syntax method. Results. The results show a proportional relation between characteristics on ground floors of buildings and the intensity of pedestrian movement. Also, they enable the establishing of general recommendations for designing the immediate pedestrian environment and upgrading the quality of open public spaces. Conclusion. The improvement of the quality of pedestrian environment would have as its direct consequence greater use of open public spaces, and thus also increased intensity of pedestrian movement. In this manner, people would face a better quality and broader selection of contents and spaces.

  9. Reduction of redundant neural network activation during the performance of a task: a functional model applied to problem-solving strategies.

    Science.gov (United States)

    Gupta, S K

    1999-01-01

    Problem-solving is explained by various paradigms. For example, epistemological paradigms state that, when the task is novel, and pursued of one's free will, problem-solving occurs in discontinuous, discernable phases. It is then also a microdevelopmental process, i.e. involves the construction of knowledge through qualitatively different stages of thought. Quantitative methods are used to focus on the redundancy of function as well as the concept of selective activation of the brains's neural network during the performance of a task. In this model, the following are identified: (a) performance circuits: (i) NP, no performance; (ii) LP, low performance; (iii) MP, medium performance; (iv) HP, high performance; and (v) VHR, very high performance; (b) task performance groups: (i) NOU, no outline used; (serves as a control); (ii) OU, outline used; (iii) MOU, modified outline used; (iv) QMOU, qualitatively and quantitatively modified outline used. An example of a distribution that one obtains is (for the efficiency of activation of the HP): QMOU:MOU:OU. NOU is in the ratio of: 400:100:50:5 (out of 10(3) trials). The subject is hence educated as to the mechanism of various strategies that he may use in everyday problem-solving.

  10. [The reduction of the HIV vulnerability of women involved in the sex business in Ukraine through social mobilization and the creation of self-support networks].

    Science.gov (United States)

    Andrushchak, L I; Khodakevich, L N

    2000-01-01

    The importance of making plans on projects and measures, aimed at the prevention of HIV infection and the social development of female sex workers (FSW) with due regard to observing the principles of human rights protection, is discussed. The materials and resolutions of the First International Conference "Social Development of HIV-Vulnerable Groups of Population", held of Kiev on December 26, 1998, are presented. The conference was attended by representatives of state and public organizations, specialists on the organization of the prevention of HIV and sexually transmitted diseases among FSW, lawyers, physicians and representatives of the HIV-vulnerable target group (FSW) from 7 Ukrainian cities and from Belarus. All these activities contributed to the implementation of the Project "FSW Network Initiative with NGOs" in 11 Ukrainian cities, starting from September 1999, with the support of UNAIDS. The possibility of the mobilization of FSW for organizing self-support groups with a view to protect their rights and to take themselves measures for HIV/AIDS prevention among FSW is shown.

  11. Infrared variation reduction by simultaneous background suppression and target contrast enhancement for deep convolutional neural network-based automatic target recognition

    Science.gov (United States)

    Kim, Sungho

    2017-06-01

    Automatic target recognition (ATR) is a traditionally challenging problem in military applications because of the wide range of infrared (IR) image variations and the limited number of training images. IR variations are caused by various three-dimensional target poses, noncooperative weather conditions (fog and rain), and difficult target acquisition environments. Recently, deep convolutional neural network-based approaches for RGB images (RGB-CNN) showed breakthrough performance in computer vision problems, such as object detection and classification. The direct use of RGB-CNN to the IR ATR problem fails to work because of the IR database problems (limited database size and IR image variations). An IR variation-reduced deep CNN (IVR-CNN) to cope with the problems is presented. The problem of limited IR database size is solved by a commercial thermal simulator (OKTAL-SE). The second problem of IR variations is mitigated by the proposed shifted ramp function-based intensity transformation. This can suppress the background and enhance the target contrast simultaneously. The experimental results on the synthesized IR images generated by the thermal simulator (OKTAL-SE) validated the feasibility of IVR-CNN for military ATR applications.

  12. Majorana fermions in the nonuniform Ising-Kitaev chain: exact solution.

    Science.gov (United States)

    Narozhny, Boris

    2017-05-03

    A quantum computer based on Majorana qubits would contain a large number of zero-energy Majorana states. This system can be modelled as a connected network of the Ising-Kitaev chains alternating the "trivial" and "topological" regions, with the zero-energy Majorana fermions localized at their interfaces. The low-energy sector of the theory describing such a network can be formulated in terms of leading-order couplings between the Majorana zero modes. I consider a minimal model exhibiting effective couplings between four Majorana zero modes - the nonuniform Ising-Kitaev chain, containing two "topological" regions separated by a "trivial" region. Solving the model exactly, I show that for generic values of the model parameters the four zero modes are localized at the four interface points of the chain. In the special case where additional inversion symmetry is present, the Majorana zero modes are "delocalized" between two interface points. In both cases, the low-energy sector of the theory can be formulated in terms of the localized Majorana fermions, but the couplings between some of them are independent of their respective separations: the exact solution does not support the "nearest-neighbor" form of the effective low-energy Hamiltonian.

  13. Transient Stability of the Power System with the Exact Long Transmission Line Model

    Directory of Open Access Journals (Sweden)

    Prechanon Kumkratug

    2012-01-01

    Full Text Available Problem statement: The exact long transmission line model consists of the lump of the series resistance, reactance and shunt capacitance. With the consideration the actual long transmission line model, it causes in the difficulty of deriving the mathematical model. Approach: This study investigates the transient stability of power system with consideration the exact long transmission line model. The concept of two-port network is applied in this study. The generator, transformer and short transmission line are represented by two-port networks. With the combination principles of the series and shunt connection, the mathematical model is achieved in a much simpler way. The proposed method is tested on the sample system and compared on various cases. Results: The first swing of rotor angle curve of the faulted system without the resistance is obviously higher than that of with the resistance whereas the second swing of the faulted system without the resistance is slightly less than that of with the resistance. The critical clearing time of the system with the resistance is better than that of with resistance. Conclusion: It was found from the simulation results that the resistance of the line provides the improvement of the first swing but not for the second swing. It was found from this study that for practical long line, the resistance is very import parameters to determine the critical clearing time of the single machine infinite system whereas shunt capacitance insignificantly affects on the critical clearing time of the single machine infinite bus system.

  14. Exact exchange with non-orthogonal generalized Wannier functions

    Science.gov (United States)

    Mountjoy, Jeff; Todd, Michelle; Mosey, Nicholas J.

    2017-03-01

    The evaluation of exact exchange (EXX) is an important component of quantum chemical calculations performed with ab initio and hybrid density functional methods. While evaluating exact exchange is routine in molecular quantum chemical calculations performed with localized basis sets, the non-local nature of the exchange operator presents a major impediment to the efficient use of exact exchange in calculations that employ planewave basis sets. Non-orthogonal generalized Wannier functions (NGWFs) corresponding to planewave expansions of localized basis functions are an alternative form of basis set that can be used in quantum chemical calculations. The periodic nature of these functions renders them suitable for calculations of periodic systems, while the contraction of sets of planewaves into individual basis functions reduces the number of variational parameters, permitting the construction and direct diagonalization of the Fock matrix. The present study examines how NGWFs corresponding to Fourier series representations of conventional atom-centered basis sets can be used to evaluate exact exchange in periodic systems. Specifically, an approach for constructing the exchange operator with NGWFs is presented and used to perform Hartree-Fock calculations with a series of molecules in periodically repeated simulation cells. The results demonstrate that the NGWF approach is significantly faster than the EXX method, which is a standard approach for evaluating exact exchange in periodic systems.

  15. Liner Service Network Design

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard

    This thesis concerns design of liner shipping networks using operations research to optimize liner shipping networks at the strategic, tactical and operational level. Liner shipping networks are often compared to public transit networks as they consist of a set of scheduled sailings connecting....... The research field of liner shipping network design is relatively young and many open research questions exists. Among others, a unified and rich mathematical model formulating the main characteristics of the business domain has not been clearly described and exact methods for such mathematical models...... are still not able to solve significant instances of this complex optimization problem. In this thesis two research directions are explored within the field: The first research direction contributes to basic research on the liner shipping network design problem by describing the domain seen from...

  16. Symmetries, Integrability and Exact Solutions to the (2+1)-Dimensional Benney Types of Equations

    Science.gov (United States)

    Liu, Han-Ze; Xin, Xiang-Peng

    2016-08-01

    This paper is concerned with the (2+1)-dimensional Benney types of equations. By the complete Lie group classification method, all of the point symmetries of the Benney types of equations are obtained, and the integrable condition of the equation is given. Then, the symmetry reductions and exact solutions to the (2+1)-dimensional nonlinear wave equations are presented. Especially, the shock wave solutions of the Benney equations are investigated by the symmetry reduction and trial function method. Supported by the National Natural Science Foundation of China under Grant Nos. 11171041 and 11505090, Research Award Foundation for Outstanding Young Scientists of Shandong Province under Grant No. BS2015SF009, and the doctorial foundation of Liaocheng University under Grant No. 31805

  17. Exact EGB models for spherical static perfect fluids

    CERN Document Server

    Hansraj, Sudan; Maharaj, Sunil D

    2015-01-01

    We obtain a new exact solution to the field equations in the EGB modified theory of gravity for a 5-dimensional spherically symmetric static distribution. By using a transformation, the study is reduced to the analysis of a single second order nonlinear differential equation. In general the condition of pressure isotropy produces a first order differential equation which is an Abel equation of the second kind. An exact solution is found. The solution is examined for physical admissability. In particular a set of constants is found which ensures that a pressure-free hypersurface exists which defines the boundary of the distribution. Additionally the isotropic pressure and the energy density are shown to be positive within the radius of the sphere. The adiabatic sound speed criterion is also satisfied within the fluid ensuring a subluminal sound speed. Furthermore, the weak, strong and dominant conditions hold throughout the distribution. On setting the Gauss-Bonnet coupling to zero, an exact solution for 5-dim...

  18. Exact solutions for classical Yang-Mills fields

    CERN Document Server

    Frasca, Marco

    2014-01-01

    Some years ago we displayed a set of classical solutions for the classical Yang-Mills field theory having the property to satisfy a dispersion relation typical of a massive theory. But such solutions seemed to be exact only in the Landau gauge making all the argument an asymptotic one for the most general case of a generic gauge. These solutions can be used to describe the vacuum of the quantum Yang-Mills theory and so, to prove that they are always exact can grant a general framework to build a quantum field theory. Here we show that these solutions are always exact changing just the normalization factor. The components of the field become separated on a generic gauge being all equal just in the Landau gauge.

  19. Exact Verification of Hybrid Systems Based on Bilinear SOS Representation

    CERN Document Server

    Yang, Zhengfeng; Lin, Wang

    2012-01-01

    In this paper, we address the problem of safety verification of nonlinear hybrid systems and stability analysis of nonlinear autonomous systems. A hybrid symbolic-numeric method is presented to compute exact inequality invariants of hybrid systems and exact estimates of regions of attraction of autonomous systems efficiently. Some numerical invariants of a hybrid system or an estimate of region of attraction can be obtained by solving a bilinear SOS program via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants and estimates of regions of attraction with rational coefficients. Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.

  20. Exact solitary wave solutions of nonlinear wave equations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The hyperbolic function method for nonlinear wave equations ispresented. In support of a computer algebra system, many exact solitary wave solutions of a class of nonlinear wave equations are obtained via the method. The method is based on the fact that the solitary wave solutions are essentially of a localized nature. Writing the solitary wave solutions of a nonlinear wave equation as the polynomials of hyperbolic functions, the nonlinear wave equation can be changed into a nonlinear system of algebraic equations. The system can be solved via Wu Elimination or Grbner base method. The exact solitary wave solutions of the nonlinear wave equation are obtained including many new exact solitary wave solutions.