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

KAUST Repository

Ruhi, Navid Azizan; Thrampoulidis, Christos; Hassibi, Babak

2017-01-01

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.

Canonical reduction of self-dual Yang-Mills equations to Fitzhugh-Nagumo equation and exact solutions

International Nuclear Information System (INIS)

Sayed, S.M.; Gharib, G.M.

2009-01-01

The (constrained) canonical reduction of four-dimensional self-dual Yang-Mills theory to two-dimensional Fitzhugh-Nagumo and the real Newell-Whitehead equations are considered. On the other hand, other methods and transformations are developed to obtain exact solutions for the original two-dimensional Fitzhugh-Nagumo and Newell-Whitehead equations. The corresponding gauge potential A μ and the gauge field strengths F μν are also obtained. New explicit and exact traveling wave and solitary solutions (for Fitzhugh-Nagumo and Newell-Whitehead equations) are obtained by using an improved sine-cosine method and the Wu's elimination method with the aid of Mathematica.

Canonical reduction of self-dual Yang-Mills equations to Fitzhugh-Nagumo equation and exact solutions

Energy Technology Data Exchange (ETDEWEB)

Sayed, S.M. [Mathematics Department, Faculty of Science, Beni-Suef University, Beni-Suef (Egypt); Mathematics Department, P.O. Box 1144, Tabouk Teacher College, Ministry of Education (Saudi Arabia)], E-mail: eaashour@lycos.com; Gharib, G.M. [Mathematics Department, P.O. Box 1144, Tabouk Teacher College, Ministry of Education (Saudi Arabia)

2009-01-30

The (constrained) canonical reduction of four-dimensional self-dual Yang-Mills theory to two-dimensional Fitzhugh-Nagumo and the real Newell-Whitehead equations are considered. On the other hand, other methods and transformations are developed to obtain exact solutions for the original two-dimensional Fitzhugh-Nagumo and Newell-Whitehead equations. The corresponding gauge potential A{sub {mu}} and the gauge field strengths F{sub {mu}}{sub {nu}} are also obtained. New explicit and exact traveling wave and solitary solutions (for Fitzhugh-Nagumo and Newell-Whitehead equations) are obtained by using an improved sine-cosine method and the Wu's elimination method with the aid of Mathematica.

An exact method for computing the frustration index in signed networks using binary programming

OpenAIRE

Aref, Samin; Mason, Andrew J.; Wilson, Mark C.

2016-01-01

Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, physics, material science, and biology. The frustration index determines the distance of a network from a state of total structural balance. Although the definition of the frustration index goes back to 1960, its exact algorithmic computation, which is closely related to classic NP-hard graph problems, has only become a focus in recent years. We develop three new b...

Leakage detection and estimation algorithm for loss reduction in water piping networks

CSIR Research Space (South Africa)

Adedeji, KB

2017-10-01

Full Text Available the development of efficient algorithms for detecting leakage in water piping networks. Water distribution networks (WDNs) are disperse in nature with numerous number of nodes and branches. Consequently, identifying the segment(s) of the network and the exact...

New method for the exact determination of the effective conductivity and the local field in RLC networks

International Nuclear Information System (INIS)

Zekri, L.; Zekri, N.; Bouamrane, R.

1999-10-01

We present a new numerical method for determining exactly the effective conductivity and the local field for random RLC networks. This method is compared to a real space renormalization group method and the Frank and Lobb method. Although our method is slower than the Frank and Lobb method, it also computes exactly the local field for large size systems. We also show that the renormalization group method fails in determining the local field. (author)

Exact asymptotic expansion for the resistance between the center node and a node on the cobweb network boundary

Directory of Open Access Journals (Sweden)

R. Kenna

2014-09-01

Full Text Available We analyze the resistance between two nodes in a cobweb network of resistors. Based on an exact expression, we derive the asymptotic expansions for the resistance between the center node and a node on the boundary of the M x N cobweb network with resistors r and s in the two spatial directions. All coefficients in this expansion are expressed through analytical functions.

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.

Lie symmetry analysis and reduction for exact solution of (2+1)-dimensional Bogoyavlensky-Konopelchenko equation by geometric approach

Science.gov (United States)

Ray, S. Saha

2018-04-01

In this paper, the symmetry analysis and similarity reduction of the (2+1)-dimensional Bogoyavlensky-Konopelchenko (B-K) equation are investigated by means of the geometric approach of an invariance group, which is equivalent to the classical Lie symmetry method. Using the extended Harrison and Estabrook’s differential forms approach, the infinitesimal generators for (2+1)-dimensional B-K equation are obtained. Firstly, the vector field associated with the Lie group of transformation is derived. Then the symmetry reduction and the corresponding explicit exact solution of (2+1)-dimensional B-K equation is obtained.

Uncertainty Reduction for Stochastic Processes on Complex Networks

Science.gov (United States)

Radicchi, Filippo; Castellano, Claudio

2018-05-01

Many real-world systems are characterized by stochastic dynamical rules where a complex network of interactions among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the stochastic rules, the ability to predict system configurations is generally characterized by a large uncertainty. Selecting a fraction of the nodes and observing their state may help to reduce the uncertainty about the unobserved nodes. However, choosing these points of observation in an optimal way is a highly nontrivial task, depending on the nature of the stochastic process and on the structure of the underlying interaction pattern. In this paper, we introduce a computationally efficient algorithm to determine quasioptimal solutions to the problem. The method leverages network sparsity to reduce computational complexity from exponential to almost quadratic, thus allowing the straightforward application of the method to mid-to-large-size systems. Although the method is exact only for equilibrium stochastic processes defined on trees, it turns out to be effective also for out-of-equilibrium processes on sparse loopy networks.

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

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.

Extremal black holes as exact string solutions

International Nuclear Information System (INIS)

Horowitz, G.T.; Tseytlin, A.A.

1994-01-01

We show that the leading order solution describing an extremal electrically charged black hole in string theory is, in fact, an exact solution to all orders in α' when interpreted in a Kaluza-Klein fashion. This follows from the observation that it can be obtained via dimensional reduction from a five-dimensional background which is proved to be an exact string solution

fastBMA: scalable network inference and transitive reduction.

Science.gov (United States)

Hung, Ling-Hong; Shi, Kaiyuan; Wu, Migao; Young, William Chad; Raftery, Adrian E; Yeung, Ka Yee

2017-10-01

Inferring genetic networks from genome-wide expression data is extremely demanding computationally. We have developed fastBMA, a distributed, parallel, and scalable implementation of Bayesian model averaging (BMA) for this purpose. fastBMA also includes a computationally efficient module for eliminating redundant indirect edges in the network by mapping the transitive reduction to an easily solved shortest-path problem. We evaluated the performance of fastBMA on synthetic data and experimental genome-wide time series yeast and human datasets. When using a single CPU core, fastBMA is up to 100 times faster than the next fastest method, LASSO, with increased accuracy. It is a memory-efficient, parallel, and distributed application that scales to human genome-wide expression data. A 10 000-gene regulation network can be obtained in a matter of hours using a 32-core cloud cluster (2 nodes of 16 cores). fastBMA is a significant improvement over its predecessor ScanBMA. It is more accurate and orders of magnitude faster than other fast network inference methods such as the 1 based on LASSO. The improved scalability allows it to calculate networks from genome scale data in a reasonable time frame. The transitive reduction method can improve accuracy in denser networks. fastBMA is available as code (M.I.T. license) from GitHub (https://github.com/lhhunghimself/fastBMA), as part of the updated networkBMA Bioconductor package (https://www.bioconductor.org/packages/release/bioc/html/networkBMA.html) and as ready-to-deploy Docker images (https://hub.docker.com/r/biodepot/fastbma/). © The Authors 2017. Published by Oxford University Press.

Parameter-free Network Sparsification and Data Reduction by Minimal Algorithmic Information Loss

KAUST Repository

Zenil, Hector

2018-02-16

The study of large and complex datasets, or big data, organized as networks has emerged as one of the central challenges in most areas of science and technology. Cellular and molecular networks in biology is one of the prime examples. Henceforth, a number of techniques for data dimensionality reduction, especially in the context of networks, have been developed. Yet, current techniques require a predefined metric upon which to minimize the data size. Here we introduce a family of parameter-free algorithms based on (algorithmic) information theory that are designed to minimize the loss of any (enumerable computable) property contributing to the object\\'s algorithmic content and thus important to preserve in a process of data dimension reduction when forcing the algorithm to delete first the least important features. Being independent of any particular criterion, they are universal in a fundamental mathematical sense. Using suboptimal approximations of efficient (polynomial) estimations we demonstrate how to preserve network properties outperforming other (leading) algorithms for network dimension reduction. Our method preserves all graph-theoretic indices measured, ranging from degree distribution, clustering-coefficient, edge betweenness, and degree and eigenvector centralities. We conclude and demonstrate numerically that our parameter-free, Minimal Information Loss Sparsification (MILS) method is robust, has the potential to maximize the preservation of all recursively enumerable features in data and networks, and achieves equal to significantly better results than other data reduction and network sparsification methods.

Prepotential approach to exact and quasi-exact solvabilities

International Nuclear Information System (INIS)

Ho, C.-L.

2008-01-01

Exact and quasi-exact solvabilities of the one-dimensional Schroedinger equation are discussed from a unified viewpoint based on the prepotential together with Bethe ansatz equations. This is a constructive approach which gives the potential as well as the eigenfunctions and eigenvalues simultaneously. The novel feature of the present work is the realization that both exact and quasi-exact solvabilities can be solely classified by two integers, the degrees of two polynomials which determine the change of variable and the zeroth order prepotential. Most of the well-known exactly and quasi-exactly solvable models, and many new quasi-exactly solvable ones, can be generated by appropriately choosing the two polynomials. This approach can be easily extended to the constructions of exactly and quasi-exactly solvable Dirac, Pauli, and Fokker-Planck equations

Symmetries and exact solutions of the nondiagonal Einstein-Rosen metrics

International Nuclear Information System (INIS)

Goyal, N; Gupta, R K

2012-01-01

We seek exact solutions of the nondiagonal Einstein-Rosen metrics. The method of Lie symmetry of differential equations is utilized to obtain new exact solutions of Einstein vacuum equations obtained from the nondiagonal Einstein-Rosen metric. Four cases arise depending on the nature of the Lie symmetry generator. In all cases, we find reductions in terms of ordinary differential equations and exact solutions of the nonlinear system of partial differential equations (PDEs) are derived. For this purpose, first we check the Painlevé property and then corresponding to the nonlinear system of PDEs, symmetries and exact solutions are obtained.

Index-aware model order reduction : LTI DAEs in electric networks

NARCIS (Netherlands)

Banagaaya, N.; Schilders, W.H.A.; Ali, G.; Tischendorf, C.

2014-01-01

Purpose Model order reduction (MOR) has been widely used in the electric networks but little has been done to reduce higher index differential algebraic equations (DAEs). The paper aims to discuss these issues. Design/methodology/approach Most methods first do an index reduction before reducing a

Exact work

International Nuclear Information System (INIS)

Zeger, J.

1993-01-01

Organized criminals also tried to illegally transfer nuclear material through Austria. Two important questions have to be answered after the material is sized by police authorities: What is the composition of the material and where does it come from? By application of a broad range of analytical techniques, which were developed or refined by our experts, it is possible to measure the exact amount and isotopic composition of uranium and plutonium in any kind of samples. The criminalistic application is only a byproduct of the large scale work on controlling the peaceful application of nuclear energy, which is done in contract with the IAEA in the context of the 'Network of Analytical Laboratories'

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.

Model reduction of detailed-balanced reaction networks by clustering linkage classes

NARCIS (Netherlands)

Rao, Shodhan; Jayawardhana, Bayu; van der Schaft, Abraham; Findeisen, Rolf; Bullinger, Eric; Balsa-Canto, Eva; Bernaerts, Kristel

2016-01-01

We propose a model reduction method that involves sequential application of clustering of linkage classes and Kron reduction. This approach is specifically useful for chemical reaction networks with each linkage class having less number of reactions. In case of detailed balanced chemical reaction

Exact solutions for the (2+1)-dimensional Boiti-Leon-Pempielli system

International Nuclear Information System (INIS)

Hu, Y H; Zheng, C L

2008-01-01

The object reduction approach is applied to the (2+1)-dimensional Boiti-Leon-Pempielli system using a special conditional similarity reduction. Abundant exact solutions of this system, including the hyperboloid function solutions, the trigonometric function solutions and a rational function solution, are obtained

Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem

DEFF Research Database (Denmark)

Gamst, M.

2014-01-01

problem. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results show that solving the integrated job scheduling and constrained network routing problem to optimality is very difficult. The exact solution approach performs......This paper examines the problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job has a certain demand, which must be sent to the executing machine via constrained paths. A job cannot start before all its demands have...... arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through...

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.

Electrocardiogram (ECG Signal Modeling and Noise Reduction Using Hopfield Neural Networks

Directory of Open Access Journals (Sweden)

F. Bagheri

2013-02-01

Full Text Available The Electrocardiogram (ECG signal is one of the diagnosing approaches to detect heart disease. In this study the Hopfield Neural Network (HNN is applied and proposed for ECG signal modeling and noise reduction. The Hopfield Neural Network (HNN is a recurrent neural network that stores the information in a dynamic stable pattern. This algorithm retrieves a pattern stored in memory in response to the presentation of an incomplete or noisy version of that pattern. Computer simulation results show that this method can successfully model the ECG signal and remove high-frequency noise.

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

KAUST Repository

Tourki, Kamel; Yang, Hongchuan; Alouini, Mohamed-Slim

2010-01-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.

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.

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...

Exact properties of spin glasses. I. 2D supersymmetry and Nishimori's result

International Nuclear Information System (INIS)

Georges, A.; Le Doussal, P.; Hansel, D.

1985-01-01

We introduce an effective theory of interacting fermions and bosons in order to express the quenched internal energy of the 2D Ising spin glass. We show that an exact result derived by Nishimori appears, in this formulation, as a dimensional reduction due to the apparition of a supersymmetry. For a general Ising spin glass, this suggests new insights into the physical meaning of this exact result

Exact Inverse Matrices of Fermat and Mersenne Circulant Matrix

Directory of Open Access Journals (Sweden)

Yanpeng Zheng

2015-01-01

Full Text Available The well known circulant matrices are applied to solve networked systems. In this paper, circulant and left circulant matrices with the Fermat and Mersenne numbers are considered. The nonsingularity of these special matrices is discussed. Meanwhile, the exact determinants and inverse matrices of these special matrices are presented.

Quasi-exact solvability

International Nuclear Information System (INIS)

Ushveridze, A.G.

1992-01-01

This paper reports that quasi-exactly solvable (QES) models realize principally new type of exact solvability in quantum physics. These models are distinguished by the fact that the Schrodinger equations for them can be solved exactly only for certain limited parts of the spectrum, but not for the whole spectrum. They occupy an intermediate position between the exactly the authors solvable (ES) models and all the others. The number of energy levels for which the spectral problems can be solved exactly refer below to as the order of QES model. From the mathematical point of view the existence of QES models is not surprising. Indeed, if the term exact solvability expresses the possibility of total explicit diagonalization of infinite Hamiltonian matrix, then the term quasi-exact solvability implies the situation when the Hamiltonian matrix can be reduced explicitly to the block-diagonal form with one of the appearing blocks being finite

Exact analysis of the response of quantum systems to two-photons using a QSDE approach

International Nuclear Information System (INIS)

Pan, Yu; Dong, Daoyi; Zhang, Guofeng

2016-01-01

We introduce the quantum stochastic differential equation (QSDE) approach to exactly analyze the response of quantum systems to a continuous-mode two-photon input. The QSDE description of the two-photon process allows us to integrate the input–output analysis with the quantum network theory, and so the analytical computability of the output state of a general quantum system can be addressed within this framework. We show that the time-domain two-photon output states can be exactly calculated for a large class of quantum systems including passive linear networks, optomechanical oscillators and two-level emitter in waveguide systems. In particular, we propose to utilise the results for the exact simulation of the stimulated emission as well as the study of the scattering of two-mode photon wave packets. (paper)

Leakage Detection and Estimation Algorithm for Loss Reduction in Water Piping Networks

Directory of Open Access Journals (Sweden)

Kazeem B. Adedeji

2017-10-01

Full Text Available Water loss through leaking pipes constitutes a major challenge to the operational service of water utilities. In recent years, increasing concern about the financial loss and environmental pollution caused by leaking pipes has been driving the development of efficient algorithms for detecting leakage in water piping networks. Water distribution networks (WDNs are disperse in nature with numerous number of nodes and branches. Consequently, identifying the segment(s of the network and the exact leaking pipelines connected to this segment(s where higher background leakage outflow occurs is a challenging task. Background leakage concerns the outflow from small cracks or deteriorated joints. In addition, because they are diffuse flow, they are not characterised by quick pressure drop and are not detectable by measuring instruments. Consequently, they go unreported for a long period of time posing a threat to water loss volume. Most of the existing research focuses on the detection and localisation of burst type leakages which are characterised by a sudden pressure drop. In this work, an algorithm for detecting and estimating background leakage in water distribution networks is presented. The algorithm integrates a leakage model into a classical WDN hydraulic model for solving the network leakage flows. The applicability of the developed algorithm is demonstrated on two different water networks. The results of the tested networks are discussed and the solutions obtained show the benefits of the proposed algorithm. A noteworthy evidence is that the algorithm permits the detection of critical segments or pipes of the network experiencing higher leakage outflow and indicates the probable pipes of the network where pressure control can be performed. However, the possible position of pressure control elements along such critical pipes will be addressed in future work.

ExactPack Documentation

Energy Technology Data Exchange (ETDEWEB)

Singleton, Robert Jr. [Los Alamos National Laboratory; Israel, Daniel M. [Los Alamos National Laboratory; Doebling, Scott William [Los Alamos National Laboratory; Woods, Charles Nathan [Los Alamos National Laboratory; Kaul, Ann [Los Alamos National Laboratory; Walter, John William Jr [Los Alamos National Laboratory; Rogers, Michael Lloyd [Los Alamos National Laboratory

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.

Exact Repetition as Input Enhancement in Second Language Acquisition.

Science.gov (United States)

Jensen, Eva Dam; Vinther, Thora

2003-01-01

Reports on two studies on input enhancement used to support learners' selection of focus of attention in Spanish second language listening material. Input consisted of video recordings of dialogues between native speakers. Exact repetition and speech rate reduction were examined for effect on comprehension, acquisition of decoding strategies, and…

Sequential reduction of external networks for the security- and short circuit monitor in power system control centers

Energy Technology Data Exchange (ETDEWEB)

Dietze, P [Siemens A.G., Erlangen (Germany, F.R.). Abt. ESTE

1978-01-01

For the evaluation of the effects of switching operations or simulation of line, transformer, and generator outages the influence of interconnected neighbor networks is modelled by network equivalents in the process computer. The basic passive conductivity model is produced by sequential reduction and adapted to fit the active network behavior. The reduction routine uses the admittance matrix, sparse technique and optimal ordering; it is applicable to process computer applications.

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.

Learning Bayesian Networks with Incomplete Data by Augmentation

OpenAIRE

Adel, Tameem; de Campos, Cassio P.

2016-01-01

We present new algorithms for learning Bayesian networks from data with missing values using a data augmentation approach. An exact Bayesian network learning algorithm is obtained by recasting the problem into a standard Bayesian network learning problem without missing data. To the best of our knowledge, this is the first exact algorithm for this problem. As expected, the exact algorithm does not scale to large domains. We build on the exact method to create an approximate algorithm using a ...

On reduction and exact solutions of nonlinear many-dimensional Schroedinger equations

International Nuclear Information System (INIS)

Barannik, A.F.; Marchenko, V.A.; Fushchich, V.I.

1991-01-01

With the help of the canonical decomposition of an arbitrary subalgebra of the orthogonal algebra AO(n) the rank n and n-1 maximal subalgebras of the extended isochronous Galileo algebra, the rank n maximal subalgebras of the generalized extended classical Galileo algebra AG(a,n) the extended special Galileo algebra AG(2,n) and the extended whole Galileo algebra AG(3,n) are described. By using the rank n subalgebras, ansatze reducing the many dimensional Schroedinger equations to ordinary differential equations is found. With the help of the reduced equation solutions exact solutions of the Schroedinger equation are considered

Evolution of a Network of Vortex Loops in He-II: Exact Solution of the Rate Equation

International Nuclear Information System (INIS)

Nemirovskii, Sergey K.

2006-01-01

The evolution of a network of vortex loops in He-II due to the fusion and breakdown of vortex loops is studied. We perform investigation on the base of the ''rate equation'' for the distribution function n(l) of number of loops of length l. By use of the special ansatz we have found the exact powerlike solution of the rate equation in a stationary case. That solution is the famous equilibrium distribution n(l)∝l -5/2 obtained earlier from thermodynamic arguments. Our result, however, is not equilibrium; it describes the state with two mutual fluxes of the length (or energy) in l space. Analyzing this solution we drew several results on the structure and dynamics of the vortex tangle in the superfluid turbulent helium. In particular, we obtained that the mean radius of the curvature is of the order of interline space and that the decay of the vortex tangle obeys the Vinen equation. We also evaluated the full rate of reconnection

Evolution of a network of vortex loops in He-II: exact solution of the rate equation.

Science.gov (United States)

Nemirovskii, Sergey K

2006-01-13

The evolution of a network of vortex loops in He-II due to the fusion and breakdown of vortex loops is studied. We perform investigation on the base of the "rate equation" for the distribution function n(l) of number of loops of length l. By use of the special ansatz we have found the exact power-like solution of the rate equation in a stationary case. That solution is the famous equilibrium distribution n(l) proportional l(-5/2) obtained earlier from thermodynamic arguments. Our result, however, is not equilibrium; it describes the state with two mutual fluxes of the length (or energy) in l space. Analyzing this solution we drew several results on the structure and dynamics of the vortex tangle in the superfluid turbulent helium. In particular, we obtained that the mean radius of the curvature is of the order of interline space and that the decay of the vortex tangle obeys the Vinen equation. We also evaluated the full rate of reconnection.

A Branch and Cut algorithm for the container shipping network design problem

DEFF Research Database (Denmark)

Reinhardt, Line Blander; Pisinger, David

2012-01-01

The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear...... programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers...

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.

Structural factoring approach for analyzing stochastic networks

Science.gov (United States)

Hayhurst, Kelly J.; Shier, Douglas R.

1991-01-01

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

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

Macroscopic phase-resetting curves for spiking neural networks

Science.gov (United States)

Dumont, Grégory; Ermentrout, G. Bard; Gutkin, Boris

2017-10-01

The study of brain rhythms is an open-ended, and challenging, subject of interest in neuroscience. One of the best tools for the understanding of oscillations at the single neuron level is the phase-resetting curve (PRC). Synchronization in networks of neurons, effects of noise on the rhythms, effects of transient stimuli on the ongoing rhythmic activity, and many other features can be understood by the PRC. However, most macroscopic brain rhythms are generated by large populations of neurons, and so far it has been unclear how the PRC formulation can be extended to these more common rhythms. In this paper, we describe a framework to determine a macroscopic PRC (mPRC) for a network of spiking excitatory and inhibitory neurons that generate a macroscopic rhythm. We take advantage of a thermodynamic approach combined with a reduction method to simplify the network description to a small number of ordinary differential equations. From this simplified but exact reduction, we can compute the mPRC via the standard adjoint method. Our theoretical findings are illustrated with and supported by numerical simulations of the full spiking network. Notably our mPRC framework allows us to predict the difference between effects of transient inputs to the excitatory versus the inhibitory neurons in the network.

Macroscopic phase-resetting curves for spiking neural networks.

Science.gov (United States)

Dumont, Grégory; Ermentrout, G Bard; Gutkin, Boris

2017-10-01

The study of brain rhythms is an open-ended, and challenging, subject of interest in neuroscience. One of the best tools for the understanding of oscillations at the single neuron level is the phase-resetting curve (PRC). Synchronization in networks of neurons, effects of noise on the rhythms, effects of transient stimuli on the ongoing rhythmic activity, and many other features can be understood by the PRC. However, most macroscopic brain rhythms are generated by large populations of neurons, and so far it has been unclear how the PRC formulation can be extended to these more common rhythms. In this paper, we describe a framework to determine a macroscopic PRC (mPRC) for a network of spiking excitatory and inhibitory neurons that generate a macroscopic rhythm. We take advantage of a thermodynamic approach combined with a reduction method to simplify the network description to a small number of ordinary differential equations. From this simplified but exact reduction, we can compute the mPRC via the standard adjoint method. Our theoretical findings are illustrated with and supported by numerical simulations of the full spiking network. Notably our mPRC framework allows us to predict the difference between effects of transient inputs to the excitatory versus the inhibitory neurons in the network.

Predictive brain networks for major depression in a semi-multimodal fusion hierarchical feature reduction framework.

Science.gov (United States)

Yang, Jie; Yin, Yingying; Zhang, Zuping; Long, Jun; Dong, Jian; Zhang, Yuqun; Xu, Zhi; Li, Lei; Liu, Jie; Yuan, Yonggui

2018-02-05

Major depressive disorder (MDD) is characterized by dysregulation of distributed structural and functional networks. It is now recognized that structural and functional networks are related at multiple temporal scales. The recent emergence of multimodal fusion methods has made it possible to comprehensively and systematically investigate brain networks and thereby provide essential information for influencing disease diagnosis and prognosis. However, such investigations are hampered by the inconsistent dimensionality features between structural and functional networks. Thus, a semi-multimodal fusion hierarchical feature reduction framework is proposed. Feature reduction is a vital procedure in classification that can be used to eliminate irrelevant and redundant information and thereby improve the accuracy of disease diagnosis. Our proposed framework primarily consists of two steps. The first step considers the connection distances in both structural and functional networks between MDD and healthy control (HC) groups. By adding a constraint based on sparsity regularization, the second step fully utilizes the inter-relationship between the two modalities. However, in contrast to conventional multi-modality multi-task methods, the structural networks were considered to play only a subsidiary role in feature reduction and were not included in the following classification. The proposed method achieved a classification accuracy, specificity, sensitivity, and area under the curve of 84.91%, 88.6%, 81.29%, and 0.91, respectively. Moreover, the frontal-limbic system contributed the most to disease diagnosis. Importantly, by taking full advantage of the complementary information from multimodal neuroimaging data, the selected consensus connections may be highly reliable biomarkers of MDD. Copyright © 2017 Elsevier B.V. All rights reserved.

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

Exact sampling of graphs with prescribed degree correlations

Science.gov (United States)

Bassler, Kevin E.; Del Genio, Charo I.; Erdős, Péter L.; Miklós, István; Toroczkai, Zoltán

2015-08-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 and 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 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 produces independent samples without backtracking. The complexity of the graph construction algorithm is {O}({NM}) where N is the number of nodes and M is the number of edges.

Phase reduction and synchronization of a network of coupled dynamical elements exhibiting collective oscillations

Science.gov (United States)

Nakao, Hiroya; Yasui, Sho; Ota, Masashi; Arai, Kensuke; Kawamura, Yoji

2018-04-01

A general phase reduction method for a network of coupled dynamical elements exhibiting collective oscillations, which is applicable to arbitrary networks of heterogeneous dynamical elements, is developed. A set of coupled adjoint equations for phase sensitivity functions, which characterize the phase response of the collective oscillation to small perturbations applied to individual elements, is derived. Using the phase sensitivity functions, collective oscillation of the network under weak perturbation can be described approximately by a one-dimensional phase equation. As an example, mutual synchronization between a pair of collectively oscillating networks of excitable and oscillatory FitzHugh-Nagumo elements with random coupling is studied.

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.

Optimization-based topology identification of complex networks

International Nuclear Information System (INIS)

Tang Sheng-Xue; Chen Li; He Yi-Gang

2011-01-01

In many cases, the topological structures of a complex network are unknown or uncertain, and it is of significance to identify the exact topological structure. An optimization-based method of identifying the topological structure of a complex network is proposed in this paper. Identification of the exact network topological structure is converted into a minimal optimization problem by using the estimated network. Then, an improved quantum-behaved particle swarm optimization algorithm is used to solve the optimization problem. Compared with the previous adaptive synchronization-based method, the proposed method is simple and effective and is particularly valid to identify the topological structure of synchronization complex networks. In some cases where the states of a complex network are only partially observable, the exact topological structure of a network can also be identified by using the proposed method. Finally, numerical simulations are provided to show the effectiveness of the proposed method. (general)

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.

An exact algorithm for optimal MAE stack filter design.

Science.gov (United States)

Dellamonica, Domingos; Silva, Paulo J S; Humes, Carlos; Hirata, Nina S T; Barrera, Junior

2007-02-01

We propose a new algorithm for optimal MAE stack filter design. It is based on three main ingredients. First, we show that the dual of the integer programming formulation of the filter design problem is a minimum cost network flow problem. Next, we present a decomposition principle that can be used to break this dual problem into smaller subproblems. Finally, we propose a specialization of the network Simplex algorithm based on column generation to solve these smaller subproblems. Using our method, we were able to efficiently solve instances of the filter problem with window size up to 25 pixels. To the best of our knowledge, this is the largest dimension for which this problem was ever solved exactly.

Exact milestoning

International Nuclear Information System (INIS)

Bello-Rivas, Juan M.; Elber, Ron

2015-01-01

A new theory and an exact computer algorithm for calculating kinetics and thermodynamic properties of a particle system are described. The algorithm avoids trapping in metastable states, which are typical challenges for Molecular Dynamics (MD) simulations on rough energy landscapes. It is based on the division of the full space into Voronoi cells. Prior knowledge or coarse sampling of space points provides the centers of the Voronoi cells. Short time trajectories are computed between the boundaries of the cells that we call milestones and are used to determine fluxes at the milestones. The flux function, an essential component of the new theory, provides a complete description of the statistical mechanics of the system at the resolution of the milestones. We illustrate the accuracy and efficiency of the exact Milestoning approach by comparing numerical results obtained on a model system using exact Milestoning with the results of long trajectories and with a solution of the corresponding Fokker-Planck equation. The theory uses an equation that resembles the approximate Milestoning method that was introduced in 2004 [A. K. Faradjian and R. Elber, J. Chem. Phys. 120(23), 10880-10889 (2004)]. However, the current formulation is exact and is still significantly more efficient than straightforward MD simulations on the system studied

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

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

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

Data Centric Sensor Stream Reduction for Real-Time Applications in Wireless Sensor Networks

Science.gov (United States)

Aquino, Andre Luiz Lins; Nakamura, Eduardo Freire

2009-01-01

This work presents a data-centric strategy to meet deadlines in soft real-time applications in wireless sensor networks. This strategy considers three main aspects: (i) The design of real-time application to obtain the minimum deadlines; (ii) An analytic model to estimate the ideal sample size used by data-reduction algorithms; and (iii) Two data-centric stream-based sampling algorithms to perform data reduction whenever necessary. Simulation results show that our data-centric strategies meet deadlines without loosing data representativeness. PMID:22303145

Exactly solvable quantum state reduction models with time-dependent coupling

International Nuclear Information System (INIS)

Brody, Dorje C; Constantinou, Irene C; Dear, James D C; Hughston, Lane P

2006-01-01

A closed-form solution to the energy-based stochastic Schroedinger equation with a time-dependent coupling is obtained. The solution is algebraic in character, and is expressed directly in terms of independent random data. The data consist of (i) a random variable H which has the distribution P(H=E i ) = π i , where π i is the transition probability vertical bar (ψ 0 vertical bar Φ i ) vertical bar 2 from the initial state vertical bar ψ 0 ) to the Lueders state vertical bar Φ i ) with energy E i , and (ii) an independent P-Brownian motion, where P is the physical probability measure associated with the dynamics of the reduction process. When the coupling is time independent, it is known that state reduction occurs asymptotically-that is to say, over an infinite time horizon. In the case of a time-dependent coupling, we show that if the magnitude of the coupling decreases sufficiently rapidly, then the energy variance will be reduced under the dynamics, but the state need not reach an energy eigenstate. This situation corresponds to the case of a 'partial' or 'incomplete' measurement of the energy. We also construct an example of a model where the opposite situation prevails, in which complete state reduction is achieved after the passage of a finite period of time

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.

Horizontal decomposition of data table for finding one reduct

Science.gov (United States)

Hońko, Piotr

2018-04-01

Attribute reduction, being one of the most essential tasks in rough set theory, is a challenge for data that does not fit in the available memory. This paper proposes new definitions of attribute reduction using horizontal data decomposition. Algorithms for computing superreduct and subsequently exact reducts of a data table are developed and experimentally verified. In the proposed approach, the size of subtables obtained during the decomposition can be arbitrarily small. Reducts of the subtables are computed independently from one another using any heuristic method for finding one reduct. Compared with standard attribute reduction methods, the proposed approach can produce superreducts that usually inconsiderably differ from an exact reduct. The approach needs comparable time and much less memory to reduce the attribute set. The method proposed for removing unnecessary attributes from superreducts executes relatively fast for bigger databases.

Locality-Driven Parallel Static Analysis for Power Delivery Networks

KAUST Repository

Zeng, Zhiyu

2011-06-01

Large VLSI on-chip Power Delivery Networks (PDNs) are challenging to analyze due to the sheer network complexity. In this article, a novel parallel partitioning-based PDN analysis approach is presented. We use the boundary circuit responses of each partition to divide the full grid simulation problem into a set of independent subgrid simulation problems. Instead of solving exact boundary circuit responses, a more efficient scheme is proposed to provide near-exact approximation to the boundary circuit responses by exploiting the spatial locality of the flip-chip-type power grids. This scheme is also used in a block-based iterative error reduction process to achieve fast convergence. Detailed computational cost analysis and performance modeling is carried out to determine the optimal (or near-optimal) number of partitions for parallel implementation. Through the analysis of several large power grids, the proposed approach is shown to have excellent parallel efficiency, fast convergence, and favorable scalability. Our approach can solve a 16-million-node power grid in 18 seconds on an IBM p5-575 processing node with 16 Power5+ processors, which is 18.8X faster than a state-of-the-art direct solver. © 2011 ACM.

Discrete Symmetries Analysis and Exact Solutions of the Inviscid Burgers Equation

Directory of Open Access Journals (Sweden)

Hongwei Yang

2012-01-01

Full Text Available We discuss the Lie point symmetries and discrete symmetries of the inviscid Burgers equation. By employing the Lie group method of infinitesimal transformations, symmetry reductions and similarity solutions of the governing equation are given. Based on discrete symmetries analysis, two groups of discrete symmetries are obtained, which lead to new exact solutions of the inviscid Burgers equation.

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

Directory of Open Access Journals (Sweden)

Li Xueying

2017-03-01

Full Text Available 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.

Column generation algorithms for virtual network embedding in flexi-grid optical networks.

Science.gov (United States)

Lin, Rongping; Luo, Shan; Zhou, Jingwei; Wang, Sheng; Chen, Bin; Zhang, Xiaoning; Cai, Anliang; Zhong, Wen-De; Zukerman, Moshe

2018-04-16

Network virtualization provides means for efficient management of network resources by embedding multiple virtual networks (VNs) to share efficiently the same substrate network. Such virtual network embedding (VNE) gives rise to a challenging problem of how to optimize resource allocation to VNs and to guarantee their performance requirements. In this paper, we provide VNE algorithms for efficient management of flexi-grid optical networks. We provide an exact algorithm aiming to minimize the total embedding cost in terms of spectrum cost and computation cost for a single VN request. Then, to achieve scalability, we also develop a heuristic algorithm for the same problem. We apply these two algorithms for a dynamic traffic scenario where many VN requests arrive one-by-one. We first demonstrate by simulations for the case of a six-node network that the heuristic algorithm obtains very close blocking probabilities to exact algorithm (about 0.2% higher). Then, for a network of realistic size (namely, USnet) we demonstrate that the blocking probability of our new heuristic algorithm is about one magnitude lower than a simpler heuristic algorithm, which was a component of an earlier published algorithm.

A Branch and Cut algorithm for the container shipping network design problem

DEFF Research Database (Denmark)

Reinhardt, Line Blander; Kallehauge, Brian; Pisinger, David

The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear...... programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers...... transhipment cost. The problem is solved with branch-and-cut using clover and transhipment inequalities. Computational results are reported for instances with up to 15 ports....

Noise reduction and image enhancement using a hardware implementation of artificial neural networks

Science.gov (United States)

David, Robert; Williams, Erin; de Tremiolles, Ghislain; Tannhof, Pascal

1999-03-01

In this paper, we present a neural based solution developed for noise reduction and image enhancement using the ZISC, an IBM hardware processor which implements the Restricted Coulomb Energy algorithm and the K-Nearest Neighbor algorithm. Artificial neural networks present the advantages of processing time reduction in comparison with classical models, adaptability, and the weighted property of pattern learning. The goal of the developed application is image enhancement in order to restore old movies (noise reduction, focus correction, etc.), to improve digital television images, or to treat images which require adaptive processing (medical images, spatial images, special effects, etc.). Image results show a quantitative improvement over the noisy image as well as the efficiency of this system. Further enhancements are being examined to improve the output of the system.

Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks

NARCIS (Netherlands)

L.J.J. van Iersel (Leo); S.M. Kelk (Steven); M. Mnich

2009-01-01

htmlabstractPhylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridization or horizontal gene transfer. The level k of a network determines how non-treelike the evolution can be,

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

Science.gov (United States)

Hyman, J.; Hagberg, A.; Srinivasan, G.; Mohd-Yusof, J.; Viswanathan, H. S.

2017-12-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

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...

Exact cosmological solutions for MOG

International Nuclear Information System (INIS)

Roshan, Mahmood

2015-01-01

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.)

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.)

Quasi-exact solutions of nonlinear differential equations

OpenAIRE

Kudryashov, Nikolay A.; Kochanov, Mark B.

2014-01-01

The concept of quasi-exact solutions of nonlinear differential equations is introduced. Quasi-exact solution expands the idea of exact solution for additional values of parameters of differential equation. These solutions are approximate solutions of nonlinear differential equations but they are close to exact solutions. Quasi-exact solutions of the the Kuramoto--Sivashinsky, the Korteweg--de Vries--Burgers and the Kawahara equations are founded.

Generative Adversarial Networks for Noise Reduction in Low-Dose CT.

Science.gov (United States)

Wolterink, Jelmer M; Leiner, Tim; Viergever, Max A; Isgum, Ivana

2017-12-01

Noise is inherent to low-dose CT acquisition. We propose to train a convolutional neural network (CNN) jointly with an adversarial CNN to estimate routine-dose CT images from low-dose CT images and hence reduce noise. A generator CNN was trained to transform low-dose CT images into routine-dose CT images using voxelwise loss minimization. An adversarial discriminator CNN was simultaneously trained to distinguish the output of the generator from routine-dose CT images. The performance of this discriminator was used as an adversarial loss for the generator. Experiments were performed using CT images of an anthropomorphic phantom containing calcium inserts, as well as patient non-contrast-enhanced cardiac CT images. The phantom and patients were scanned at 20% and 100% routine clinical dose. Three training strategies were compared: the first used only voxelwise loss, the second combined voxelwise loss and adversarial loss, and the third used only adversarial loss. The results showed that training with only voxelwise loss resulted in the highest peak signal-to-noise ratio with respect to reference routine-dose images. However, CNNs trained with adversarial loss captured image statistics of routine-dose images better. Noise reduction improved quantification of low-density calcified inserts in phantom CT images and allowed coronary calcium scoring in low-dose patient CT images with high noise levels. Testing took less than 10 s per CT volume. CNN-based low-dose CT noise reduction in the image domain is feasible. Training with an adversarial network improves the CNNs ability to generate images with an appearance similar to that of reference routine-dose CT images.

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.

Spread of epidemic disease on networks

Science.gov (United States)

Newman, M. E.

2002-07-01

The study of social networks, and in particular the spread of disease on networks, has attracted considerable recent attention in the physics community. In this paper, we show that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks. In addition to the standard but unrealistic case of fixed infectiveness time and fixed and uncorrelated probability of transmission between all pairs of individuals, we solve cases in which times and probabilities are nonuniform and correlated. We also consider one simple case of an epidemic in a structured population, that of a sexually transmitted disease in a population divided into men and women. We confirm the correctness of our exact solutions with numerical simulations of SIR epidemics on networks.

Exact two-point resistance, and the simple random walk on the complete graph minus N edges

International Nuclear Information System (INIS)

Chair, Noureddine

2012-01-01

An analytical approach is developed to obtain the exact expressions for the two-point resistance and the total effective resistance of the complete graph minus N edges of the opposite vertices. These expressions are written in terms of certain numbers that we introduce, which we call the Bejaia and the Pisa numbers; these numbers are the natural generalizations of the bisected Fibonacci and Lucas numbers. The correspondence between random walks and the resistor networks is then used to obtain the exact expressions for the first passage and mean first passage times on this graph. - Highlights: ► We obtain exact formulas for the two-point resistance of the complete graph minus N edges. ► We obtain also the total effective resistance of this graph. ► We modified Schwatt’s formula on trigonometrical power sum to suit our computations. ► We introduced the generalized bisected Fibonacci and Lucas numbers: the Bejaia and the Pisa numbers. ► The first passage and mean first passage times of the random walks have exact expressions.

New exact solutions of the Einstein—Maxwell equations for magnetostatic fields

International Nuclear Information System (INIS)

Goyal, Nisha; Gupta, R.K.

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

Stochastic Simulation of Biomolecular Reaction Networks Using the Biomolecular Network Simulator Software

National Research Council Canada - National Science Library

Frazier, John; Chusak, Yaroslav; Foy, Brent

2008-01-01

.... The software uses either exact or approximate stochastic simulation algorithms for generating Monte Carlo trajectories that describe the time evolution of the behavior of biomolecular reaction networks...

Exact piecewise flat gravitational waves

NARCIS (Netherlands)

van de Meent, M.

2011-01-01

We generalize our previous linear result (van de Meent 2011 Class. Quantum Grav 28 075005) in obtaining gravitational waves from our piecewise flat model for gravity in 3+1 dimensions to exact piecewise flat configurations describing exact planar gravitational waves. We show explicitly how to

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...... by comparing the results obtained in PSCAD® with the detailed network model and with the reduced one. Moreover the control schemes of a wind turbine and a photovoltaic plant included in the detailed network model are described....

Exact solitary waves of the Fisher equation

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.

2005-01-01

New method is presented to search exact solutions of nonlinear differential equations. This approach is used to look for exact solutions of the Fisher equation. New exact solitary waves of the Fisher equation are given

Epidemic spreading on complex networks with community structures

NARCIS (Netherlands)

Stegehuis, C.; van der Hofstad, R.W.; van Leeuwaarden, J.S.H.

2016-01-01

Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities

CONDITIONS FOR EXACT CAVALIERI ESTIMATION

Directory of Open Access Journals (Sweden)

Mónica Tinajero-Bravo

2014-03-01

Full Text Available Exact Cavalieri estimation amounts to zero variance estimation of an integral with systematic observations along a sampling axis. A sufficient condition is given, both in the continuous and the discrete cases, for exact Cavalieri sampling. The conclusions suggest improvements on the current stereological application of fractionator-type sampling.

Modelling traffic congestion using queuing networks

Indian Academy of Sciences (India)

Flow-density curves; uninterrupted traffic; Jackson networks. ... ness - also suffer from a big handicap vis-a-vis the Indian scenario: most of these models do .... more well-known queuing network models and onsite data, a more exact Road Cell ...

Exact solutions for rotating charged dust

International Nuclear Information System (INIS)

Islam, J.N.

1984-01-01

Earlier work by the author on rotating charged dust is summarized. An incomplete class of exact solutions for differentially rotating charged dust in Newton-Maxwell theory for the equal mass and charge case that was found earlier is completed. A new global exact solution for cylindrically symmetric differentially rotating charged dust in Newton-Maxwell theory is presented. Lastly, a new exact solution for cylindrically symmetric rigidly rotating charged dust in general relativity is given. (author)

Carbon Reduction Strategies Based on an NW Small-World Network with a Progressive Carbon Tax

Directory of Open Access Journals (Sweden)

Bin Wu

2017-09-01

Full Text Available There is an increasingly urgent need to reduce carbon emissions. Devising effective carbon tax policies has become an important research topic. It is necessary to explore carbon reduction strategies based on the design of carbon tax elements. In this study, we explore the effect of a progressive carbon tax policy on carbon emission reductions using the logical deduction method. We apply experience-weighted attraction learning theory to construct an evolutionary game model for enterprises with different levels of energy consumption in an NW small-world network, and study their strategy choices when faced with a progressive carbon tax policy. The findings suggest that enterprises that adopt other energy consumption strategies gradually transform to a low energy consumption strategy, and that this trend eventually spreads to the entire system. With other conditions unchanged, the rate at which enterprises change to a low energy consumption strategy becomes faster as the discount coefficient, the network externality, and the expected adjustment factor increase. Conversely, the rate of change slows as the cost of converting to a low energy consumption strategy increases.

Network reconfiguration for loss reduction in electrical distribution system using genetic algorithm

International Nuclear Information System (INIS)

Adail, A.S.A.A.

2012-01-01

Distribution system is a critical links between the utility and the nuclear installation. During feeding electricity to that installation there are power losses. The quality of the network depends on the reduction of these losses. Distribution system which feeds the nuclear installation must have a higher quality power. For example, in Inshas site, electrical power is supplied to it from two incoming feeders (one from new abu-zabal substation and the other from old abu-zabal substation). Each feeder is designed to carry the full load, while the operator preferred to connect with a new abu-zabal substation, which has a good power quality. Bad power quality affects directly the nuclear reactor and has a negative impact on the installed sensitive equipment's of the operation. The thesis is Studying the electrical losses in a distribution system (causes and effected factors), feeder reconfiguration methods, and applying of genetic algorithm in an electric distribution power system. In the end, this study proposes an optimization technique based on genetic algorithms for distribution network reconfiguration to reduce the network losses to minimum. The proposed method is applied to IEEE test network; that contain 3 feeders and 16 nodes. The technique is applied through two groups, distribution have general loads, and nuclear loads. In the groups the technique applied to seven cases at normal operation state, system fault condition as well as different loads conditions. Simulated results are drawn to show the accuracy of the technique.

Mapping Koch curves into scale-free small-world networks

International Nuclear Information System (INIS)

Zhang Zhongzhi; Gao Shuyang; Zhou Shuigeng; Chen Lichao; Zhang Hongjuan; Guan Jihong

2010-01-01

The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems-a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, a small diameter and average path length and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks.

Exact two-point resistance, and the simple random walk on the complete graph minus N edges

Energy Technology Data Exchange (ETDEWEB)

Chair, Noureddine, E-mail: n.chair@ju.edu.jo

2012-12-15

An analytical approach is developed to obtain the exact expressions for the two-point resistance and the total effective resistance of the complete graph minus N edges of the opposite vertices. These expressions are written in terms of certain numbers that we introduce, which we call the Bejaia and the Pisa numbers; these numbers are the natural generalizations of the bisected Fibonacci and Lucas numbers. The correspondence between random walks and the resistor networks is then used to obtain the exact expressions for the first passage and mean first passage times on this graph. - Highlights: Black-Right-Pointing-Pointer We obtain exact formulas for the two-point resistance of the complete graph minus N edges. Black-Right-Pointing-Pointer We obtain also the total effective resistance of this graph. Black-Right-Pointing-Pointer We modified Schwatt's formula on trigonometrical power sum to suit our computations. Black-Right-Pointing-Pointer We introduced the generalized bisected Fibonacci and Lucas numbers: the Bejaia and the Pisa numbers. Black-Right-Pointing-Pointer The first passage and mean first passage times of the random walks have exact expressions.

Performing a local reduction operation on a parallel computer

Science.gov (United States)

Blocksome, Michael A.; Faraj, Daniel A.

2012-12-11

A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

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

Directory of Open Access Journals (Sweden)

M. P. Jarabo-Amores

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.

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.

Optimalization of Beacon Selection for Localization in Wireless AD-HOC Networks

Directory of Open Access Journals (Sweden)

Martin Matula

2008-01-01

Full Text Available In this paper we engage in optimalization of convenient beacons for localization position of a node in the ad-hoc network. An algorithm designed by us localizes position of moving or static node by RSS (Received Signal Strength method and trilateration. At first, localization of unknown node runs by combination of all beacons. Than optimalizating algorithmreduces the number of beacons (and repeats localization, while only three left. Its reduction is based on highest levels of received signal strength. It is only when signals are from the nearest beacons. Position localizating exactness is statistically interpreted from all localization by beacons combination and its repeating.

Convergent dynamics for multistable delayed neural networks

International Nuclear Information System (INIS)

Shih, Chih-Wen; Tseng, Jui-Pin

2008-01-01

This investigation aims at developing a methodology to establish convergence of dynamics for delayed neural network systems with multiple stable equilibria. The present approach is general and can be applied to several network models. We take the Hopfield-type neural networks with both instantaneous and delayed feedbacks to illustrate the idea. We shall construct the complete dynamical scenario which comprises exactly 2 n stable equilibria and exactly (3 n − 2 n ) unstable equilibria for the n-neuron network. In addition, it is shown that every solution of the system converges to one of the equilibria as time tends to infinity. The approach is based on employing the geometrical structure of the network system. Positively invariant sets and componentwise dynamical properties are derived under the geometrical configuration. An iteration scheme is subsequently designed to confirm the convergence of dynamics for the system. Two examples with numerical simulations are arranged to illustrate the present theory

On exact solutions of scattering problems

International Nuclear Information System (INIS)

Nikishov, P.Yu.; Plekhanov, E.B.; Zakhariev, B.N.

1982-01-01

Examples illustrating the quality of the reconstruction of potentials from single-channel scattering data by using exactly solvable models are given. Simple exact solutions for multi-channel systems with non-degenerated resonance singularities of the scattering matrix are derived

Exact PsTd invariant and PsTd symmetric breaking solutions, symmetry reductions and Bäcklund transformations for an AB-KdV system

Science.gov (United States)

Jia, Man; Lou, Sen Yue

2018-05-01

In natural and social science, many events happened at different space-times may be closely correlated. Two events, A (Alice) and B (Bob) are defined as correlated if one event is determined by another, say, B = f ˆ A for suitable f ˆ operators. A nonlocal AB-KdV system with shifted-parity (Ps, parity with a shift), delayed time reversal (Td, time reversal with a delay) symmetry where B =Ps ˆ Td ˆ A is constructed directly from the normal KdV equation to describe two-area physical event. The exact solutions of the AB-KdV system, including PsTd invariant and PsTd symmetric breaking solutions are shown by different methods. The PsTd invariant solution show that the event happened at A will happen also at B. These solutions, such as single soliton solutions, infinitely many singular soliton solutions, soliton-cnoidal wave interaction solutions, and symmetry reduction solutions etc., show the AB-KdV system possesses rich structures. Also, a special Bäcklund transformation related to residual symmetry is presented via the localization of the residual symmetry to find interaction solutions between the solitons and other types of the AB-KdV system.

Synchronization in Complex Oscillator Networks and Smart Grids

Energy Technology Data Exchange (ETDEWEB)

Dorfler, Florian [Los Alamos National Laboratory; Chertkov, Michael [Los Alamos National Laboratory; Bullo, Francesco [Center for Control, Dynamical Systems and Computation, University of California at Santa Babara, Santa Barbara CA

2012-07-24

The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing the interaction among them. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here we present a novel, concise, and closed-form condition for synchronization of the fully nonlinear, non-equilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters, or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters, they are statistically correct for almost all networks, and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks such as electric power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex networks scenarios and in smart grid applications.

Reconstructible phylogenetic networks: do not distinguish the indistinguishable.

Science.gov (United States)

Pardi, Fabio; Scornavacca, Celine

2015-04-01

Phylogenetic networks represent the evolution of organisms that have undergone reticulate events, such as recombination, hybrid speciation or lateral gene transfer. An important way to interpret a phylogenetic network is in terms of the trees it displays, which represent all the possible histories of the characters carried by the organisms in the network. Interestingly, however, different networks may display exactly the same set of trees, an observation that poses a problem for network reconstruction: from the perspective of many inference methods such networks are "indistinguishable". This is true for all methods that evaluate a phylogenetic network solely on the basis of how well the displayed trees fit the available data, including all methods based on input data consisting of clades, triples, quartets, or trees with any number of taxa, and also sequence-based approaches such as popular formalisations of maximum parsimony and maximum likelihood for networks. This identifiability problem is partially solved by accounting for branch lengths, although this merely reduces the frequency of the problem. Here we propose that network inference methods should only attempt to reconstruct what they can uniquely identify. To this end, we introduce a novel definition of what constitutes a uniquely reconstructible network. For any given set of indistinguishable networks, we define a canonical network that, under mild assumptions, is unique and thus representative of the entire set. Given data that underwent reticulate evolution, only the canonical form of the underlying phylogenetic network can be uniquely reconstructed. While on the methodological side this will imply a drastic reduction of the solution space in network inference, for the study of reticulate evolution this is a fundamental limitation that will require an important change of perspective when interpreting phylogenetic networks.

Reconstructible phylogenetic networks: do not distinguish the indistinguishable.

Directory of Open Access Journals (Sweden)

Fabio Pardi

2015-04-01

Full Text Available Phylogenetic networks represent the evolution of organisms that have undergone reticulate events, such as recombination, hybrid speciation or lateral gene transfer. An important way to interpret a phylogenetic network is in terms of the trees it displays, which represent all the possible histories of the characters carried by the organisms in the network. Interestingly, however, different networks may display exactly the same set of trees, an observation that poses a problem for network reconstruction: from the perspective of many inference methods such networks are "indistinguishable". This is true for all methods that evaluate a phylogenetic network solely on the basis of how well the displayed trees fit the available data, including all methods based on input data consisting of clades, triples, quartets, or trees with any number of taxa, and also sequence-based approaches such as popular formalisations of maximum parsimony and maximum likelihood for networks. This identifiability problem is partially solved by accounting for branch lengths, although this merely reduces the frequency of the problem. Here we propose that network inference methods should only attempt to reconstruct what they can uniquely identify. To this end, we introduce a novel definition of what constitutes a uniquely reconstructible network. For any given set of indistinguishable networks, we define a canonical network that, under mild assumptions, is unique and thus representative of the entire set. Given data that underwent reticulate evolution, only the canonical form of the underlying phylogenetic network can be uniquely reconstructed. While on the methodological side this will imply a drastic reduction of the solution space in network inference, for the study of reticulate evolution this is a fundamental limitation that will require an important change of perspective when interpreting phylogenetic networks.

Collaborative Multi-Layer Network Coding in Hybrid Cellular Cognitive Radio Networks

KAUST Repository

Moubayed, Abdallah J.

2015-05-01

In this paper, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated collaboration between the collocated primary and cognitive radio base-stations in order to minimize their own as well as each other\\'s packet recovery overheads, thus by improving their throughput. The proposed scheme ensures that each network\\'s performance is not degraded by its help to the other network. Moreover, it guarantees that the primary network\\'s interference threshold is not violated in the same and adjacent cells. Yet, the scheme allows the reduction of the recovery overhead in the collocated primary and cognitive radio networks. The reduction in the cognitive radio network is further amplified due to the perfect detection of spectrum holes which allows the cognitive radio base station to transmit at higher power without fear of violating the interference threshold of the primary network. For the secondary network, simulation results show reductions of 20% and 34% in the packet recovery overhead, compared to the non-collaborative scheme, for low and high probabilities of primary packet arrivals, respectively. For the primary network, this reduction was found to be 12%. © 2015 IEEE.

Time measurement - technical importance of most exact clocks

International Nuclear Information System (INIS)

Goebel, E.O.; Riehle, F.

2004-01-01

The exactness of the best atomic clocks currently shows a temporal variation of 1 second in 30 million years. This means that we have reached the point of the most exact frequency and time measurement ever. In the past, there was a trend towards increasing the exactness in an increasingly fast sequence. Will this trend continue? And who will profit from it? This article is meant to give answers to these questions. This is done by presenting first the level reached currently with the best atomic clocks and describing the research activities running worldwide with the aim of achieving even more exact clocks. In the second part, we present examples of various areas of technical subjects and research in which the most exact clocks are being applied presently and even more exact ones will be needed in the future [de

New exact solutions of the mBBM equation

International Nuclear Information System (INIS)

Zhang Zhe; Li Desheng

2013-01-01

The enhanced modified simple equation method presented in this article is applied to construct the exact solutions of modified Benjamin-Bona-Mahoney equation. Some new exact solutions are derived by using this method. When some parameters are taken as special values, the solitary wave solutions can be got from the exact solutions. It is shown that the method introduced in this paper has general significance in searching for exact solutions to the nonlinear evolution equations. (authors)

Exact discretization of Schrödinger equation

Energy Technology Data Exchange (ETDEWEB)

Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru

2016-01-08

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

Exact discretization of Schrödinger equation

International Nuclear Information System (INIS)

Tarasov, Vasily E.

2016-01-01

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

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...

Exact-exchange-based quasiparticle calculations

International Nuclear Information System (INIS)

Aulbur, Wilfried G.; Staedele, Martin; Goerling, Andreas

2000-01-01

One-particle wave functions and energies from Kohn-Sham calculations with the exact local Kohn-Sham exchange and the local density approximation (LDA) correlation potential [EXX(c)] are used as input for quasiparticle calculations in the GW approximation (GWA) for eight semiconductors. Quasiparticle corrections to EXX(c) band gaps are small when EXX(c) band gaps are close to experiment. In the case of diamond, quasiparticle calculations are essential to remedy a 0.7 eV underestimate of the experimental band gap within EXX(c). The accuracy of EXX(c)-based GWA calculations for the determination of band gaps is as good as the accuracy of LDA-based GWA calculations. For the lowest valence band width a qualitatively different behavior is observed for medium- and wide-gap materials. The valence band width of medium- (wide-) gap materials is reduced (increased) in EXX(c) compared to the LDA. Quasiparticle corrections lead to a further reduction (increase). As a consequence, EXX(c)-based quasiparticle calculations give valence band widths that are generally 1-2 eV smaller (larger) than experiment for medium- (wide-) gap materials. (c) 2000 The American Physical Society

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

International Nuclear Information System (INIS)

Zabadal, Jorge; Borges, Volnei; Van der Laan, Flavio T.; Santos, Marcio G.

2015-01-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)

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)

Evaluation and design of a rain gauge network using a statistical optimization method in a severe hydro-geological hazard prone area

Science.gov (United States)

Fattoruso, Grazia; Longobardi, Antonia; Pizzuti, Alfredo; Molinara, Mario; Marocco, Claudio; De Vito, Saverio; Tortorella, Francesco; Di Francia, Girolamo

2017-06-01

Rainfall data collection gathered in continuous by a distributed rain gauge network is instrumental to more effective hydro-geological risk forecasting and management services though the input estimated rainfall fields suffer from prediction uncertainty. Optimal rain gauge networks can generate accurate estimated rainfall fields. In this research work, a methodology has been investigated for evaluating an optimal rain gauges network aimed at robust hydrogeological hazard investigations. The rain gauges of the Sarno River basin (Southern Italy) has been evaluated by optimizing a two-objective function that maximizes the estimated accuracy and minimizes the total metering cost through the variance reduction algorithm along with the climatological variogram (time-invariant). This problem has been solved by using an enumerative search algorithm, evaluating the exact Pareto-front by an efficient computational time.

Neural networks for the dimensionality reduction of GOME measurement vector in the estimation of ozone profiles

International Nuclear Information System (INIS)

Del Frate, F.; Iapaolo, M.; Casadio, S.; Godin-Beekmann, S.; Petitdidier, M.

2005-01-01

Dimensionality reduction can be of crucial importance in the application of inversion schemes to atmospheric remote sensing data. In this study the problem of dimensionality reduction in the retrieval of ozone concentration profiles from the radiance measurements provided by the instrument Global Ozone Monitoring Experiment (GOME) on board of ESA satellite ERS-2 is considered. By means of radiative transfer modelling, neural networks and pruning algorithms, a complete procedure has been designed to extract the GOME spectral ranges most crucial for the inversion. The quality of the resulting retrieval algorithm has been evaluated by comparing its performance to that yielded by other schemes and co-located profiles obtained with lidar measurements

A BEFORE AND AFTER TRIAL OF THE EFFECTIVENESS OF NETWORK ANALYSIS IN HEALTH OPERATIONS MANAGEMENT.

Science.gov (United States)

Bhalwar, R; Srivastava, M; Verma, S S; Vaze, M; Tilak, V W

1996-10-01

An intervention trial using "before-and-after" approach was undertaken to address the question whether network analysis as a health managerial tool of control can favourably affect the delays that occur in planning and executing the antimalaria operations of a Station Health Organization in a large military station. Exposure variable of interest was intervention with a network diagram, by which the potential causes of delay along the various activities were assessed and remedial measures were introduced during the second year. Sample size was calculated using conventional alpha and beta error levels. The study indicated that there was a definite beneficial outcome in that the operations could be started as well as completed in time during the intervention year. There was reduction in time requirement in 5 out of the 9 activities, the exact 'p' value being 0.08, by both parametric and non-parametric tests. The use of network analysis in health care management has been recommended.

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...

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....... The l-step delayed fault detection problem is also considered for discrete-time systems....

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

Exact solutions, numerical relativity and gravitational radiation

International Nuclear Information System (INIS)

Winicour, J.

1986-01-01

In recent years, there has emerged a new use for exact solutions to Einstein's equation as checks on the accuracy of numerical relativity codes. Much has already been written about codes based upon the space-like Cauchy problem. In the case of two Killing vectors, a numerical characteristic initial value formulation based upon two intersecting families of null hypersurfaces has successfully evolved the Schwarzschild and the colliding plane wave vacuum solutions. Here the author discusses, in the context of exact solutions, numerical studies of gravitational radiation based upon the null cone initial value problem. Every stage of progress in the null cone approach has been associated with exact solutions in some sense. He begins by briefly recapping this history. Then he presents two new examples illustrating how exact solutions can be useful

Perturbation of an exact strong gravity solution

International Nuclear Information System (INIS)

Baran, S.A.

1982-10-01

Perturbations of an exact strong gravity solution are investigated. It is shown, by using the new multipole expansions previously presented, that this exact and static spherically symmetric solution is stable under odd parity perturbations. (author)

Nonlinear evolution-type equations and their exact solutions using inverse variational methods

International Nuclear Information System (INIS)

Kara, A H; Khalique, C M

2005-01-01

We present the role of invariants in obtaining exact solutions of differential equations. Firstly, conserved vectors of a partial differential equation (p.d.e.) allow us to obtain reduced forms of the p.d.e. for which some of the Lie point symmetries (in vector field form) are easily concluded and, therefore, provide a mechanism for further reduction. Secondly, invariants of reduced forms of a p.d.e. are obtainable from a variational principle even though the p.d.e. itself does not admit a Lagrangian. In this latter case, the reductions carry all the usual advantages regarding Noether symmetries and double reductions. The examples we consider are nonlinear evolution-type equations such as the Korteweg-deVries equation, but a detailed analysis is made on the Fisher equation (which describes reaction-diffusion waves in biology, inter alia). Other diffusion-type equations lend themselves well to the method we describe (e.g., the Fitzhugh Nagumo equation, which is briefly discussed). Some aspects of Painleve properties are also suggested

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.

Exact optics - III. Schwarzschild's spectrograph camera revised

Science.gov (United States)

Willstrop, R. V.

2004-03-01

Karl Schwarzschild identified a system of two mirrors, each defined by conic sections, free of third-order spherical aberration, coma and astigmatism, and with a flat focal surface. He considered it impractical, because the field was too restricted. This system was rediscovered as a quadratic approximation to one of Lynden-Bell's `exact optics' designs which have wider fields. Thus the `exact optics' version has a moderate but useful field, with excellent definition, suitable for a spectrograph camera. The mirrors are strongly aspheric in both the Schwarzschild design and the exact optics version.

Exact and approximate multiple diffraction calculations

International Nuclear Information System (INIS)

Alexander, Y.; Wallace, S.J.; Sparrow, D.A.

1976-08-01

A three-body potential scattering problem is solved in the fixed scatterer model exactly and approximately to test the validity of commonly used assumptions of multiple scattering calculations. The model problem involves two-body amplitudes that show diffraction-like differential scattering similar to high energy hadron-nucleon amplitudes. The exact fixed scatterer calculations are compared to Glauber approximation, eikonal-expansion results and a noneikonal approximation

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.

The general Klein-Gordon-Schroedinger system: modulational instability and exact solutions

International Nuclear Information System (INIS)

Tang Xiaoyan; Ding Wei

2008-01-01

The general Klein-Gordon-Schroedinger (gKGS) system is studied where the cubic auto-interactions are introduced in both the nonlinear Schroedinger and the nonlinear Klein-Gordon fields. We first investigate the modulational instability (MI) of the system, and thus derive the general dispersion relation between the frequency and wavenumber of the modulating perturbations, which demonstrates many possibilities for the MI regions. Using the travelling wave reduction, the gKGS system is greatly simplified. Via a simple function expansion method, we obtain some exact travelling wave solutions. Under some special parameter values, some representative wave structures are graphically displayed including the kink, anti-kink, bright, dark, grey and periodic solitons

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

Collaborative Multi-Layer Network Coding For Hybrid Cellular Cognitive Radio Networks

KAUST Repository

Moubayed, Abdallah J.

2014-05-01

In this thesis, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated collaboration between the collocated primary and cognitive radio base-stations in order to minimize their own as well as each other’s packet recovery overheads, thus by improving their throughput. The proposed scheme ensures that each network’s performance is not degraded by its help to the other network. Moreover, it guarantees that the primary network’s interference threshold is not violated in the same and adjacent cells. Yet, the scheme allows the reduction of the recovery overhead in the collocated primary and cognitive radio networks. The reduction in the cognitive radio network is further amplified due to the perfect detection of spectrum holes which allows the cognitive radio base station to transmit at higher power without fear of violating the interference threshold of the primary network. For the secondary network, simulation results show reductions of 20% and 34% in the packet recovery overhead, compared to the non-collaborative scheme, for low and high probabilities of primary packet arrivals, respectively. For the primary network, this reduction was found to be 12%. Furthermore, with the use of fractional cooperation, the average recovery overhead is further reduced by around 5% for the primary network and around 10% for the secondary network when a high fractional cooperation probability is used.

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.

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

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

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.

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...

Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.

Science.gov (United States)

Mirzaei, Sajad; Wu, Yufeng

2016-01-01

Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.

Exact gravitational quasinormal frequencies of topological black holes

International Nuclear Information System (INIS)

Birmingham, Danny; Mokhtari, Susan

2006-01-01

We compute the exact gravitational quasinormal frequencies for massless topological black holes in d-dimensional anti-de Sitter space. Using the gauge invariant formalism for gravitational perturbations derived by Kodama and Ishibashi, we show that in all cases the scalar, vector, and tensor modes can be reduced to a simple scalar field equation. This equation is exactly solvable in terms of hypergeometric functions, thus allowing an exact analytic determination of the gravitational quasinormal frequencies

Extension of the KLI approximation toward the exact optimized effective potential.

Science.gov (United States)

Iafrate, G J; Krieger, J B

2013-03-07

The integral equation for the optimized effective potential (OEP) is utilized in a compact form from which an accurate OEP solution for the spin-unrestricted exchange-correlation potential, Vxcσ, is obtained for any assumed orbital-dependent exchange-correlation energy functional. The method extends beyond the Krieger-Li-Iafrate (KLI) approximation toward the exact OEP result. The compact nature of the OEP equation arises by replacing the integrals involving the Green's function terms in the traditional OEP equation by an equivalent first-order perturbation theory wavefunction often referred to as the "orbital shift" function. Significant progress is then obtained by solving the equation for the first order perturbation theory wavefunction by use of Dalgarno functions which are determined from well known methods of partial differential equations. The use of Dalgarno functions circumvents the need to explicitly address the Green's functions and the associated problems with "sum over states" numerics; as well, the Dalgarno functions provide ease in dealing with inherent singularities arising from the origin and the zeros of the occupied orbital wavefunctions. The Dalgarno approach for finding a solution to the OEP equation is described herein, and a detailed illustrative example is presented for the special case of a spherically symmetric exchange-correlation potential. For the case of spherical symmetry, the relevant Dalgarno function is derived by direct integration of the appropriate radial equation while utilizing a user friendly method which explicitly treats the singular behavior at the origin and at the nodal singularities arising from the zeros of the occupied states. The derived Dalgarno function is shown to be an explicit integral functional of the exact OEP Vxcσ, thus allowing for the reduction of the OEP equation to a self-consistent integral equation for the exact exchange-correlation potential; the exact solution to this integral equation can be

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.

Quaternionic formulation of the exact parity model

International Nuclear Information System (INIS)

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

1996-01-01

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

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.

A Potential Reduction Method for Canonical Duality, with an Application to the Sensor Network Localization Problem

OpenAIRE

Latorre, Vittorio

2014-01-01

We propose to solve large instances of the non-convex optimization problems reformulated with canonical duality theory. To this aim we propose an interior point potential reduction algorithm based on the solution of the primal-dual total complementarity (Lagrange) function. We establish the global convergence result for the algorithm under mild assumptions and demonstrate the method on instances of the Sensor Network Localization problem. Our numerical results are promising and show the possi...

The exact wavefunction factorization of a vibronic coupling system

International Nuclear Information System (INIS)

Chiang, Ying-Chih; Klaiman, Shachar; Otto, Frank; Cederbaum, Lorenz S.

2014-01-01

We investigate the exact wavefunction as a single product of electronic and nuclear wavefunction for a model conical intersection system. Exact factorized spiky potentials and nodeless nuclear wavefunctions are found. The exact factorized potential preserves the symmetry breaking effect when the coupling mode is present. Additionally nodeless wavefunctions are found to be closely related to the adiabatic nuclear eigenfunctions. This phenomenon holds even for the regime where the non-adiabatic coupling is relevant, and sheds light on the relation between the exact wavefunction factorization and the adiabatic approximation

Exact folded-band chaotic oscillator.

Science.gov (United States)

Corron, Ned J; Blakely, Jonathan N

2012-06-01

An exactly solvable chaotic oscillator with folded-band dynamics is shown. The oscillator is a hybrid dynamical system containing a linear ordinary differential equation and a nonlinear switching condition. Bounded oscillations are provably chaotic, and successive waveform maxima yield a one-dimensional piecewise-linear return map with segments of both positive and negative slopes. Continuous-time dynamics exhibit a folded-band topology similar to Rössler's oscillator. An exact solution is written as a linear convolution of a fixed basis pulse and a discrete binary sequence, from which an equivalent symbolic dynamics is obtained. The folded-band topology is shown to be dependent on the symbol grammar.

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. Copyright © 2016 Elsevier Ltd. All rights reserved.

Three faces of node importance in network epidemiology: Exact results for small graphs

Science.gov (United States)

Holme, Petter

2017-12-01

We investigate three aspects of the importance of nodes with respect to susceptible-infectious-removed (SIR) disease dynamics: influence maximization (the expected outbreak size given a set of seed nodes), the effect of vaccination (how much deleting nodes would reduce the expected outbreak size), and sentinel surveillance (how early an outbreak could be detected with sensors at a set of nodes). We calculate the exact expressions of these quantities, as functions of the SIR parameters, for all connected graphs of three to seven nodes. We obtain the smallest graphs where the optimal node sets are not overlapping. We find that (i) node separation is more important than centrality for more than one active node, (ii) vaccination and influence maximization are the most different aspects of importance, and (iii) the three aspects are more similar when the infection rate is low.

Discrete-state phasor neural networks

Science.gov (United States)

Noest, André J.

1988-08-01

An associative memory network with local variables assuming one of q equidistant positions on the unit circle (q-state phasors) is introduced, and its recall behavior is solved exactly for any q when the interactions are sparse and asymmetric. Such models can describe natural or artifical networks of (neuro-)biological, chemical, or electronic limit-cycle oscillators with q-fold instead of circular symmetry, or similar optical computing devices using a phase-encoded data representation.

Mobilizing Drug Consumption Rooms: inter-place networks and harm reduction drug policy.

Science.gov (United States)

McCann, Eugene; Temenos, Cristina

2015-01-01

This article discusses the learning and politics involved in spreading Drug Consumption Rooms (DCRs) globally. DCRs are health facilities, operating under a harm reduction philosophy, where people consume illicit drugs in a supervised setting. Approximately 90 are located in almost 60 cities in 11 countries. They are intensely local attempts to improve the lives of specific populations and urban neighborhoods. DCRs are also global models that travel. This article examines the relationship between DCRs as facilities that are fixed in place and DCRs as globally-mobilized models of drug policy and public health practice. Drawing on research from seven countries, we apply concepts from the policy mobilities literature to analyze the travels of the DCR model and the political strategies involved in the siting of these public health service facilities. We detail the networked mobilization of the DCR model from Europe to Canada and Australia, the learning among facilities, the strategies used to mold the DCR model to local contexts, and the role of DCR staff in promoting continued proliferation of DCRs. We conclude by identifying some immobilities of DCRs to identify questions about practices, principles and future directions of harm reduction. Copyright © 2014 Elsevier Ltd. All rights reserved.

Exact Solutions for Einstein's Hyperbolic Geometric Flow

International Nuclear Information System (INIS)

He Chunlei

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

A Class of Quasi-exact Solutions of Rabi Hamiltonian

International Nuclear Information System (INIS)

Pan Feng; Yao Youkun; Xie Mingxia; Han Wenjuan; Draayer, J.P.

2007-01-01

A class of quasi-exact solutions of the Rabi Hamiltonian, which describes a two-level atom interacting with a single-mode radiation field via a dipole interaction without the rotating-wave approximation, are obtained by using a wavefunction ansatz. Exact solutions for part of the spectrum are obtained when the atom-field coupling strength and the field frequency satisfy certain relations. As an example, the lowest exact energy level and the corresponding atom-field entanglement at the quasi-exactly solvable point are calculated and compared to results from the Jaynes-Cummings and counter-rotating cases of the Rabi Hamiltonian.

Exact solution for the Poisson field in a semi-infinite strip.

Science.gov (United States)

Cohen, Yossi; Rothman, Daniel H

2017-04-01

The Poisson equation is associated with many physical processes. Yet exact analytic solutions for the two-dimensional Poisson field are scarce. Here we derive an analytic solution for the Poisson equation with constant forcing in a semi-infinite strip. We provide a method that can be used to solve the field in other intricate geometries. We show that the Poisson flux reveals an inverse square-root singularity at a tip of a slit, and identify a characteristic length scale in which a small perturbation, in a form of a new slit, is screened by the field. We suggest that this length scale expresses itself as a characteristic spacing between tips in real Poisson networks that grow in response to fluxes at tips.

Large scale exact quantum dynamics calculations: Ten thousand quantum states of acetonitrile

Science.gov (United States)

Halverson, Thomas; Poirier, Bill

2015-03-01

'Exact' quantum dynamics (EQD) calculations of the vibrational spectrum of acetonitrile (CH3CN) are performed, using two different methods: (1) phase-space-truncated momentum-symmetrized Gaussian basis and (2) correlated truncated harmonic oscillator basis. In both cases, a simple classical phase space picture is used to optimize the selection of individual basis functions-leading to drastic reductions in basis size, in comparison with existing methods. Massive parallelization is also employed. Together, these tools-implemented into a single, easy-to-use computer code-enable a calculation of tens of thousands of vibrational states of CH3CN to an accuracy of 0.001-10 cm-1.

Quasi exact solution of the Rabi Hamiltonian

CERN Document Server

Koç, R; Tuetuencueler, H

2002-01-01

A method is suggested to obtain the quasi exact solution of the Rabi Hamiltonian. It is conceptually simple and can be easily extended to other systems. The analytical expressions are obtained for eigenstates and eigenvalues in terms of orthogonal polynomials. It is also demonstrated that the Rabi system, in a particular case, coincides with the quasi exactly solvable Poeschl-Teller potential.

Exact solutions for the static bending of Euler-Bernoulli beams using Eringen’s two-phase local/nonlocal model

International Nuclear Information System (INIS)

Wang, Y. B.; Zhu, X. W.; Dai, H. H.

2016-01-01

Though widely used in modelling nano- and micro- structures, Eringen’s differential model shows some inconsistencies and recent study has demonstrated its differences between the integral model, which then implies the necessity of using the latter model. In this paper, an analytical study is taken to analyze static bending of nonlocal Euler-Bernoulli beams using Eringen’s two-phase local/nonlocal model. Firstly, a reduction method is proved rigorously, with which the integral equation in consideration can be reduced to a differential equation with mixed boundary value conditions. Then, the static bending problem is formulated and four types of boundary conditions with various loadings are considered. By solving the corresponding differential equations, exact solutions are obtained explicitly in all of the cases, especially for the paradoxical cantilever beam problem. Finally, asymptotic analysis of the exact solutions reveals clearly that, unlike the differential model, the integral model adopted herein has a consistent softening effect. Comparisons are also made with existing analytical and numerical results, which further shows the advantages of the analytical results obtained. Additionally, it seems that the once controversial nonlocal bar problem in the literature is well resolved by the reduction method.

Exact solutions for the static bending of Euler-Bernoulli beams using Eringen’s two-phase local/nonlocal model

Energy Technology Data Exchange (ETDEWEB)

Wang, Y. B. [Department of Mathematics, ShaoXing University, No.900, ChengNan Avenue 312000, ShaoXing, Zhejiang (China); Zhu, X. W., E-mail: xiaowuzhu1026@znufe.edu.cn [School of Statistics and Mathematics, Zhongnan University of Economics and Law, Wuhan 430073 (China); Dai, H. H. [Department of Mathematics, City University of HongKong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong (China)

2016-08-15

Though widely used in modelling nano- and micro- structures, Eringen’s differential model shows some inconsistencies and recent study has demonstrated its differences between the integral model, which then implies the necessity of using the latter model. In this paper, an analytical study is taken to analyze static bending of nonlocal Euler-Bernoulli beams using Eringen’s two-phase local/nonlocal model. Firstly, a reduction method is proved rigorously, with which the integral equation in consideration can be reduced to a differential equation with mixed boundary value conditions. Then, the static bending problem is formulated and four types of boundary conditions with various loadings are considered. By solving the corresponding differential equations, exact solutions are obtained explicitly in all of the cases, especially for the paradoxical cantilever beam problem. Finally, asymptotic analysis of the exact solutions reveals clearly that, unlike the differential model, the integral model adopted herein has a consistent softening effect. Comparisons are also made with existing analytical and numerical results, which further shows the advantages of the analytical results obtained. Additionally, it seems that the once controversial nonlocal bar problem in the literature is well resolved by the reduction method.

Criteria for exact qudit universality

International Nuclear Information System (INIS)

Brennen, Gavin K.; O'Leary, Dianne P.; Bullock, Stephen S.

2005-01-01

We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states vertical bar 0>, vertical bar 1>, ..., vertical bar d-1>. An important earlier work [A. Muthukrishnan and C.R. Stroud, Jr., Phys. Rev. A 62, 052309 (2000)] describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d-1 parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the QR-matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of H jk x =(ℎ/2π)Ω(vertical bar k> jk y =(ℎ/2π)Ω(i vertical bar k> jk x,y are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian H=(ℎ/2π)Ω vertical bar d-1,d-1> 87 Rb and construct an optimal gate sequence using Raman laser pulses

Exact theory of freeze-out

Science.gov (United States)

Cannoni, Mirco

2015-03-01

We show that the standard theory of thermal production and chemical decoupling of WIMPs is incomplete. The hypothesis that WIMPs are produced and decouple from a thermal bath implies that the rate equation the bath particles interacting with the WIMPs is an algebraic equation that constraints the actual WIMPs abundance to have a precise analytical form down to the temperature . The point , which coincides with the stationary point of the equation for the quantity , is where the maximum departure of the WIMPs abundance from the thermal value is reached. For each mass and total annihilation cross section , the temperature and the actual WIMPs abundance are exactly known. This value provides the true initial condition for the usual differential equation that have to be integrated in the interval . The matching of the two abundances at is continuous and differentiable. The dependence of the present relic abundance on the abundance at an intermediate temperature is an exact result. The exact theory suggests a new analytical approximation that furnishes the relic abundance accurate at the level of 1-2 % in the case of -wave and -wave scattering cross sections. We conclude the paper studying the evolution of the WIMPs chemical potential and the entropy production using methods of non-equilibrium thermodynamics.

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......, then it is a von Neumann II 1   -factor. This is a partial solution to a well known problem of Kaplansky. The present result was used by Blackadar, Kumjian and Rørdam to prove that RR(A)=0  for every simple non-commutative torus of any dimension...

New exact solutions of the Dirac equation. 11

International Nuclear Information System (INIS)

Bagrov, V.G.; Noskov, M.D.

1984-01-01

Investigations into determining new exact solutions of relativistic wave equations started in another paper were continued. Exact solutions of the Dirac, Klein-Gordon equations and classical relativistic equations of motion in four new types of external electromagnetic fields were found

Exact solitary waves of the Korteveg - de Vries - Burgers equation

OpenAIRE

Kudryashov, N. A.

2004-01-01

New approach is presented to search exact solutions of nonlinear differential equations. This method is used to look for exact solutions of the Korteveg -- de Vries -- Burgers equation. New exact solitary waves of the Korteveg -- de Vries -- Burgers equation are found.

Hydrogen Production via Water Dissociation Using Pt–TiO2 Photocatalysts: An Oxidation–Reduction Network

Directory of Open Access Journals (Sweden)

J. F. Guayaquil-Sosa

2017-10-01

Full Text Available Several TiO2 based semiconductors with different Pt loadings are prepared using incipient impregnation, wet impregnation and the sol-gel method. These photocatalysts are evaluated in the Photo-CREC-Water II Photoreactor for hydrogen production via water dissociation, using an organic renewable scavenger (ethanol. Results obtained show the influence of the photocatalyst preparation in the production of hydrogen and in the observed quantum yields. Furthermore, it is established that the reaction networks leading to hydrogen production, using various photocatalysts, share common features. This analysis is developed by both identifying and quantifying different chemical species and their changes with irradiation time. Key species in this oxidation–reduction network are hydrogen, hydrogen peroxide, ethanol, methane, ethane, acetaldehyde and carbon dioxide. On this basis, it is shown that under an inert gas atmosphere, ethanol consumption is sub-stoichiometric. This points towards simultaneous ethanol consumption and the formation of the ethanol scavenger.

Polygons of differential equations for finding exact solutions

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.; Demina, Maria V.

2007-01-01

A method for finding exact solutions of nonlinear differential equations is presented. Our method is based on the application of polygons corresponding to nonlinear differential equations. It allows one to express exact solutions of the equation studied through solutions of another equation using properties of the basic equation itself. The ideas of power geometry are used and developed. Our approach has a pictorial interpretation, which is illustrative and effective. The method can be also applied for finding transformations between solutions of differential equations. To demonstrate the method application exact solutions of several equations are found. These equations are: the Korteveg-de Vries-Burgers equation, the generalized Kuramoto-Sivashinsky equation, the fourth-order nonlinear evolution equation, the fifth-order Korteveg-de Vries equation, the fifth-order modified Korteveg-de Vries equation and the sixth-order nonlinear evolution equation describing turbulent processes. Some new exact solutions of nonlinear evolution equations are given

Safe reduction rules for weighted treewidth

NARCIS (Netherlands)

Eijkhof, F. van den; Bodlaender, H.L.; Koster, A.M.C.A.

2002-01-01

Several sets of reductions rules are known for preprocessing a graph when computing its treewidth. In this paper, we give reduction rules for a weighted variant of treewidth, motivated by the analysis of algorithms for probabilistic networks. We present two general reduction rules that are safe for

INDEFINITE COPOSITIVE MATRICES WITH EXACTLY ONE POSITIVE EIGENVALUE OR EXACTLY ONE NEGATIVE EIGENVALUE

NARCIS (Netherlands)

Jargalsaikhan, Bolor

Checking copositivity of a matrix is a co-NP-complete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out

Energy-dependent solar neutrino flux depletion in the exact parity model and implications for SNO, SuperKamiokande and BOREXINO

International Nuclear Information System (INIS)

Volkas, R.R.; Wong, Y.Y.Y.

1998-03-01

Energy-dependent solar neutrino flux reduction caused by the Mikheyev-Smirnov-Wolfenstein (MSW) effect is applied to the Exact Parity Model. Several scenarios are possible, depending on the region of parameter space chosen. The interplay between intergenerational MSW transitions and vacuum 'intragenerational' ordinary-mirror neutrino oscillations is discussed. Expectations for the ratio of charged to neutral current event rates at the Sudbury Neutrino Observatory (SNO) are estimated. The implications of the various scenarios for the Boron neutrino energy spectrum and BOREXINO are briefly discussed. The consequences of MSW-induced solar neutrino depletion within the Exact Parity Model differ in interesting ways from the standard ν e ↔ ν μ,τ and ν e ↔ ν s cases. The physical causes of these differences are determined. (authors)

Analytic progress on exact lattice chiral symmetry

International Nuclear Information System (INIS)

Kikukawa, Y.

2002-01-01

Theoretical issues of exact chiral symmetry on the lattice are discussed and related recent works are reviewed. For chiral theories, the construction with exact gauge invariance is reconsidered from the point of view of domain wall fermion. The issue in the construction of electroweak theory is also discussed. For vector-like theories, we discuss unitarity (positivity), Hamiltonian approach, and several generalizations of the Ginsparg-Wilson relation (algebraic and odd-dimensional)

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

The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks.

Science.gov (United States)

Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

2018-02-03

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C /2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C /2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi's model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

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.

Exactly solvable birth and death processes

International Nuclear Information System (INIS)

Sasaki, Ryu

2009-01-01

Many examples of exactly solvable birth and death processes, a typical stationary Markov chain, are presented together with the explicit expressions of the transition probabilities. They are derived by similarity transforming exactly solvable 'matrix' quantum mechanics, which is recently proposed by Odake and the author [S. Odake and R. Sasaki, J. Math. Phys. 49, 053503 (2008)]. The (q-) Askey scheme of hypergeometric orthogonal polynomials of a discrete variable and their dual polynomials play a central role. The most generic solvable birth/death rates are rational functions of q x (with x being the population) corresponding to the q-Racah polynomial.

Neural networks prove effective at NOx reduction

Energy Technology Data Exchange (ETDEWEB)

Radl, B.J. [Pegasus Technologies, Mentor, OH (USA)

2000-05-01

The availability of low cost computer hardware and software is opening up possibilities for the use of artificial intelligence concepts, notably neural networks, in power plant control applications, delivering lower costs, greater efficiencies and reduced emissions. One example of a neural network system is the NeuSIGHT combustion optimisation system, developed by Pegasus Technologies, a subsidiary of KFx Inc. It can help reduce NOx emissions, improve heat rate and enable either deferral or elimination of capital expenditures. on other NOx control technologies, such as low NOx burners, SNCR and SCR. This paper illustrates these benefits using three recent case studies. 4 figs.

Reduction in operation overvoltages on vhv networks

Energy Technology Data Exchange (ETDEWEB)

Maury, E

1966-03-01

The adoption of reduced insulating levels compatible with a regular working of the vhv networks is possible provided that the closing or re-closing voltages be reduced on the no-load lines. For this purpose, circuit-breakers fitted with closing resistors are now used. Another solution consists in closing the contacts of the circuit-breaker at a given time on the voltage sinusoid of the network. The gain resulting from this solution is shown and the problems which have to be solved in order to obtain a synchronized closure of the circuit-breakers at 525 and 765 kV are considered.

Exact traveling wave solutions of the Boussinesq equation

International Nuclear Information System (INIS)

Ding Shuangshuang; Zhao Xiqiang

2006-01-01

The repeated homogeneous balance method is used to construct exact traveling wave solutions of the Boussinesq equation, in which the homogeneous balance method is applied to solve the Riccati equation and the reduced nonlinear ordinary differential equation, respectively. Many new exact traveling wave solutions of the Boussinesq equation are successfully obtained

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.

Tensor network method for reversible classical computation

Science.gov (United States)

Yang, Zhi-Cheng; Kourtis, Stefanos; Chamon, Claudio; Mucciolo, Eduardo R.; Ruckenstein, Andrei E.

2018-03-01

We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017), 10.1038/ncomms15303]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs and outputs at the boundary can be represented as the full contraction of a tensor network. We introduce an iterative compression-decimation (ICD) scheme that performs this contraction efficiently. The ICD algorithm first propagates local constraints to longer ranges via repeated contraction-decomposition sweeps over all lattice bonds, thus achieving compression on a given length scale. It then decimates the lattice via coarse-graining tensor contractions. Repeated iterations of these two steps gradually collapse the tensor network and ultimately yield the exact tensor trace for large systems, without the need for manual control of tensor dimensions. Our protocol allows us to obtain the exact number of solutions for computations where a naive enumeration would take astronomically long times.

Vortex (particle) and antivortex (hole) doping into superconducting network

International Nuclear Information System (INIS)

Ishida, Takekazu; Shimizu, Makoto; Matsushima, Yoshiaki; Hayashi, Masahiko; Ebisawa, Hiromichi; Sato, Osamu; Kato, Masaru; Satoh, Kazuo

2007-01-01

Superconducting finite-sized Pb square networks with 10 x 10 square holes fabricated by electron beam lithography have been investigated in view of particle (vortex) doping into superconducting networks. Vortex image observations were carried out by a SQUID microscope to compare with predictions from the Ginzburg-Landau theory. We found the exactly reversed pattern between the vortex-doping x and the antivortex doping 1 - x into the fully occupied network (x = 1/4)

Exact solution for the generalized Telegraph Fisher's equation

International Nuclear Information System (INIS)

Abdusalam, H.A.; Fahmy, E.S.

2009-01-01

In this paper, we applied the factorization scheme for the generalized Telegraph Fisher's equation and an exact particular solution has been found. The exact particular solution for the generalized Fisher's equation was obtained as a particular case of the generalized Telegraph Fisher's equation and the two-parameter solution can be obtained when n=2.

Exact solution of the hidden Markov processes

Science.gov (United States)

Saakian, David B.

2017-11-01

We write a master equation for the distributions related to hidden Markov processes (HMPs) and solve it using a functional equation. Thus the solution of HMPs is mapped exactly to the solution of the functional equation. For a general case the latter can be solved only numerically. We derive an exact expression for the entropy of HMPs. Our expression for the entropy is an alternative to the ones given before by the solution of integral equations. The exact solution is possible because actually the model can be considered as a generalized random walk on a one-dimensional strip. While we give the solution for the two second-order matrices, our solution can be easily generalized for the L values of the Markov process and M values of observables: We should be able to solve a system of L functional equations in the space of dimension M -1 .

Dissipative motion perturbation theory and exact solutions

International Nuclear Information System (INIS)

Lodder, J.J.

1976-06-01

Dissipative motion of classical and quantum systems is described. In particular, attention is paid to systems coupled to the radiation field. A dissipative equation of motion for a particle in an arbitrary potential coupled to the radiation field is derived by means of perturbation theory. The usual divrgencies associated with the radiation field are eliminated by the application of a theory of generalized functions. This theory is developed as a subject in its own right and is presented independently. The introduction of classical zero-point energy makes the classical equa tion of motion for the phase density formally the same as its quantum counterpart. In particular, it is shown that the classical zero-point energy prevents the collapse of a classical H-atom and gives rise to a classical ground state. For systems with a quadratic Hamiltoian, the equation of motion can be solved exactly, even in the continuum limit for the radiation field, by means of the new generalized functions. Classically, the Fokker-Planck equation is found without any approximations, and quantum mechanically, the only approximation is the neglect of the change in the ground state caused by the interaction. The derivation is valid even for strong damping and arbitrarily short times. There is no transient time. For harmonic oscillators complete equivalence is shown to exist between quantum mechanics and classical mechanics with zero-point energy. A discussion of the derivation of the Pauli equation is given and perturbation theory is compared with the exact derivation. The exactly solvable models are used to calculate the Langevin force of the radiation field. The result is that the classical Langevin force is exactly delta-correlated, while the quantum Langevin force is not delta-correlated at all. The fluctuation-dissipation theorem is shown to be an exact consequence of the solution to the equations of motion

Exact Theory of Compressible Fluid Turbulence

Science.gov (United States)

Drivas, Theodore; Eyink, Gregory

2017-11-01

We obtain exact results for compressible turbulence with any equation of state, using coarse-graining/filtering. We find two mechanisms of turbulent kinetic energy dissipation: scale-local energy cascade and ``pressure-work defect'', or pressure-work at viscous scales exceeding that in the inertial-range. Planar shocks in an ideal gas dissipate all kinetic energy by pressure-work defect, but the effect is omitted by standard LES modeling of pressure-dilatation. We also obtain a novel inverse cascade of thermodynamic entropy, injected by microscopic entropy production, cascaded upscale, and removed by large-scale cooling. This nonlinear process is missed by the Kovasznay linear mode decomposition, treating entropy as a passive scalar. For small Mach number we recover the incompressible ``negentropy cascade'' predicted by Obukhov. We derive exact Kolmogorov 4/5th-type laws for energy and entropy cascades, constraining scaling exponents of velocity, density, and internal energy to sub-Kolmogorov values. Although precise exponents and detailed physics are Mach-dependent, our exact results hold at all Mach numbers. Flow realizations at infinite Reynolds are ``dissipative weak solutions'' of compressible Euler equations, similarly as Onsager proposed for incompressible turbulence.

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

Directory of Open Access Journals (Sweden)

Terry Gibson

2012-10-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.

Exact Cover Problem in Milton Babbitt's All-partition Array

OpenAIRE

Bemman, Brian; Meredith, David

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, A, and a collection of distinct subsets of this set, S, then a subset of S is an exact cover of A if it exhaustively and exclu- sively partitions A. We provide a backtracking algorithm for solving ...

Exact theory of freeze-out

International Nuclear Information System (INIS)

Cannoni, Mirco

2015-01-01

We show that the standard theory of thermal production and chemical decoupling of WIMPs is incomplete. The hypothesis that WIMPs are produced and decouple from a thermal bath implies that the rate equation the bath particles interacting with the WIMPs is an algebraic equation that constraints the actual WIMPs abundance to have a precise analytical form down to the temperature x * = m χ /T * . The point x., which coincides with the stationary point of the equation for the quantity Δ = Y-Y 0 , is where the maximum departure of the WIMPs abundance Y from the thermal value Y 0 is reached. For each mass m χ and total annihilation cross section left angle σ ann υ r right angle, the temperature x * and the actual WIMPs abundance Y(x * ) are exactly known. This value provides the true initial condition for the usual differential equation that have to be integrated in the interval x ≥ x * . The matching of the two abundances at x * is continuous and differentiable. The dependence of the present relic abundance on the abundance at an intermediate temperature is an exact result. The exact theory suggests a new analytical approximation that furnishes the relic abundance accurate at the level of 1.2 % in the case of S-wave and P-wave scattering cross sections. We conclude the paper studying the evolution of the WIMPs chemical potential and the entropy production using methods of non-equilibrium thermodynamics. (orig.)

Exact solution of nonsteady thermal boundary layer equation

International Nuclear Information System (INIS)

Dorfman, A.S.

1995-01-01

There are only a few exact solutions of the thermal boundary layer equation. Most of them are derived for a specific surface temperature distribution. The first exact solution of the steady-state boundary layer equation was given for a plate with constant surface temperature and free-stream velocity. The same problem for a plate with polynomial surface temperature distribution was solved by Chapmen and Rubesin. Levy gave the exact solution for the case of a power law distribution of both surface temperature and free-stream velocity. The exact solution of the steady-state boundary layer equation for an arbitrary surface temperature and a power law free-stream velocity distribution was given by the author in two forms: of series and of the integral with an influence function of unheated zone. A similar solution of the nonsteady thermal boundary layer equation for an arbitrary surface temperature and a power law free-stream velocity distribution is presented here. In this case, the coefficients of series depend on time, and in the limit t → ∞ they become the constant coefficients of a similar solution published before. This solution, unlike the one presented here, does not satisfy the initial conditions at t = 0, and, hence, can be used only in time after the beginning of the process. The solution in the form of a series becomes a closed-form exact solution for polynomial surface temperature and a power law free-stream velocity distribution. 7 refs., 2 figs

Constructing exact symmetric informationally complete measurements from numerical solutions

Science.gov (United States)

Appleby, Marcus; Chien, Tuan-Yow; Flammia, Steven; Waldron, Shayne

2018-04-01

Recently, several intriguing conjectures have been proposed connecting symmetric informationally complete quantum measurements (SIC POVMs, or SICs) and algebraic number theory. These conjectures relate the SICs to their minimal defining algebraic number field. Testing or sharpening these conjectures requires that the SICs are expressed exactly, rather than as numerical approximations. While many exact solutions of SICs have been constructed previously using Gröbner bases, this method has probably been taken as far as is possible with current computer technology (except in special cases where there are additional symmetries). Here, we describe a method for converting high-precision numerical solutions into exact ones using an integer relation algorithm in conjunction with the Galois symmetries of an SIC. Using this method, we have calculated 69 new exact solutions, including nine new dimensions, where previously only numerical solutions were known—which more than triples the number of known exact solutions. In some cases, the solutions require number fields with degrees as high as 12 288. We use these solutions to confirm that they obey the number-theoretic conjectures, and address two questions suggested by the previous work.

An exact fermion-pair to boson mapping

International Nuclear Information System (INIS)

Johnson, C.W.

1993-01-01

I derive in a novel fashion exact formulas for the calculation of general matrix elements, including the overlap (norm) matrix, between states constructed from fermion pairs. Mapping the fermion pairs to bosons, I show how to construct finite and exact (in the sense of preserving matrix elements) boson representations of the norm operator and one- and two-fermion operators. This may lead to a microscopic basis for the Interacting Boson Model, as well as new truncation schemes for the nuclear shell model

Collaborative multi-layer network coding for cellular cognitive radio networks

KAUST Repository

Sorour, Sameh

2013-06-01

In this paper, we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in underlay cellular cognitive radio networks. This scheme allows the collocated primary and cognitive radio base-stations to collaborate with each other, in order to minimize their own and each other\\'s packet recovery overheads, and thus improve their throughput, without any coordination between them. This non-coordinated collaboration is done using a novel multi-layer instantly decodable network coding scheme, which guarantees that each network\\'s help to the other network does not result in any degradation in its own performance. It also does not cause any violation to the primary networks interference thresholds in the same and adjacent cells. Yet, our proposed scheme both guarantees the reduction of the recovery overhead in collocated primary and cognitive radio networks, and allows early recovery of their packets compared to non-collaborative schemes. Simulation results show that a recovery overhead reduction of 15% and 40% can be achieved by our proposed scheme in the primary and cognitive radio networks, respectively, compared to the corresponding non-collaborative scheme. © 2013 IEEE.

The exact mass-gaps of the principal chiral models

CERN Document Server

Hollowood, Timothy J

1994-01-01

An exact expression for the mass-gap, the ratio of the physical particle mass to the $\\Lambda$-parameter, is found for the principal chiral sigma models associated to all the classical Lie algebras. The calculation is based on a comparison of the free-energy in the presence of a source coupling to a conserved charge of the theory computed in two ways: via the thermodynamic Bethe Ansatz from the exact scattering matrix and directly in perturbation theory. The calculation provides a non-trivial test of the form of the exact scattering matrix.

Improvement of the Hopfield Neural Network by MC-Adaptation Rule

Science.gov (United States)

Zhou, Zhen; Zhao, Hong

2006-06-01

We show that the performance of the Hopfield neural networks, especially the quality of the recall and the capacity of the effective storing, can be greatly improved by making use of a recently presented neural network designing method without altering the whole structure of the network. In the improved neural network, a memory pattern is recalled exactly from initial states having a given degree of similarity with the memory pattern, and thus one can avoids to apply the overlap criterion as carried out in the Hopfield neural networks.

An Exact Solution of the Binary Singular Problem

Directory of Open Access Journals (Sweden)

Baiqing Sun

2014-01-01

Full Text Available Singularity problem exists in various branches of applied mathematics. Such ordinary differential equations accompany singular coefficients. In this paper, by using the properties of reproducing kernel, the exact solution expressions of dual singular problem are given in the reproducing kernel space and studied, also for a class of singular problem. For the binary equation of singular points, I put it into the singular problem first, and then reuse some excellent properties which are applied to solve the method of solving differential equations for its exact solution expression of binary singular integral equation in reproducing kernel space, and then obtain its approximate solution through the evaluation of exact solutions. Numerical examples will show the effectiveness of this method.

Categorical Tensor Network States

Directory of Open Access Journals (Sweden)

Jacob D. Biamonte

2011-12-01

Full Text Available We examine the use of string diagrams and the mathematics of category theory in the description of quantum states by tensor networks. This approach lead to a unification of several ideas, as well as several results and methods that have not previously appeared in either side of the literature. Our approach enabled the development of a tensor network framework allowing a solution to the quantum decomposition problem which has several appealing features. Specifically, given an n-body quantum state |ψ〉, we present a new and general method to factor |ψ〉 into a tensor network of clearly defined building blocks. We use the solution to expose a previously unknown and large class of quantum states which we prove can be sampled efficiently and exactly. This general framework of categorical tensor network states, where a combination of generic and algebraically defined tensors appear, enhances the theory of tensor network states.

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.

Exact soliton-like solutions of perturbed phi4-equation

International Nuclear Information System (INIS)

Gonzalez, J.A.

1986-05-01

Exact soliton-like solutions of damped, driven phi 4 -equation are found. The exact expressions for the velocities of solitons are given. It is non-perturbatively proved that the perturbed phi 4 -equation has stable kink-like solutions of a new type. (author)

Inverse Schroedinger equation and the exact wave function

International Nuclear Information System (INIS)

Nakatsuji, Hiroshi

2002-01-01

Using the inverse of the Hamiltonian, we introduce the inverse Schroedinger equation (ISE) that is equivalent to the ordinary Schroedinger equation (SE). The ISE has the variational principle and the H-square group of equations as the SE has. When we use a positive Hamiltonian, shifting the energy origin, the inverse energy becomes monotonic and we further have the inverse Ritz variational principle and cross-H-square equations. The concepts of the SE and the ISE are combined to generalize the theory for calculating the exact wave function that is a common eigenfunction of the SE and ISE. The Krylov sequence is extended to include the inverse Hamiltonian, and the complete Krylov sequence is introduced. The iterative configuration interaction (ICI) theory is generalized to cover both the SE and ISE concepts and four different computational methods of calculating the exact wave function are presented in both analytical and matrix representations. The exact wave-function theory based on the inverse Hamiltonian can be applied to systems that have singularities in the Hamiltonian. The generalized ICI theory is applied to the hydrogen atom, giving the exact solution without any singularity problem

Evaluation and Simulation of Common Video Conference Traffics in Communication Networks

Directory of Open Access Journals (Sweden)

Farhad faghani

2014-01-01

Full Text Available Multimedia traffics are the basic traffics in data communication networks. Especially Video conferences are the most desirable traffics in huge networks(wired, wireless, …. Traffic modeling can help us to evaluate the real networks. So, in order to have good services in data communication networks which provide multimedia services, QoS will be very important .In this research we tried to have an exact traffic model design and simulation to overcome QoS challenges. Also, we predict bandwidth by Kalman filter in Ethernet networks.

Multifuel multimodal network design; Projeto de redes multicombustiveis multimodal

Energy Technology Data Exchange (ETDEWEB)

Lage, Carolina; Dias, Gustavo; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE). Programa de Engenharia de Producao

2008-07-01

The objective of the Multi commodity Multimodal Network Project is the development of modeling tools and methodologies for the optimal sizing of production networks and multimodal distribution of multiple fuel and its incomes, considering investments and transportation costs. Given the inherently non-linear combinatory nature of the problem, the resolution of real instances by the complete model, in an exact way, becomes computationally intractable. Thus, the strategy for resolution should contain a combination of exacts and heuristics methods, that must be applied to subdivisions of the original problem. This paper deals with one of these subdivisions, tackling the problem of modeling a network of pipelines in order to drain the production of ethanol away from the producing plants. The objective consists in defining the best network topology, minimizing investment and operational costs, and attending the total demand. In order to do that, the network was considered a tree, where the nodes are the center of producing regions and the edges are the pipelines, trough where the ethanol produced by plants must be drained away. The main objective also includes the decision over the optimal diameter of each pipeline and the optimal size of the bombs, in order to minimize the pumping costs. (author)

Exact theory of freeze-out

Energy Technology Data Exchange (ETDEWEB)

Cannoni, Mirco [Universidad de Huelva, Departamento de Fisica Aplicada, Facultad de Ciencias Experimentales, Huelva (Spain)

2015-03-01

We show that the standard theory of thermal production and chemical decoupling of WIMPs is incomplete. The hypothesis that WIMPs are produced and decouple from a thermal bath implies that the rate equation the bath particles interacting with the WIMPs is an algebraic equation that constraints the actual WIMPs abundance to have a precise analytical form down to the temperature x{sub *} = m{sub χ}/T{sub *}. The point x., which coincides with the stationary point of the equation for the quantity Δ = Y-Y{sub 0}, is where the maximum departure of the WIMPs abundance Y from the thermal value Y{sub 0} is reached. For each mass m{sub χ} and total annihilation cross section left angle σ{sub ann}υ{sub r} right angle, the temperature x{sub *} and the actual WIMPs abundance Y(x{sub *}) are exactly known. This value provides the true initial condition for the usual differential equation that have to be integrated in the interval x ≥ x{sub *}. The matching of the two abundances at x{sub *} is continuous and differentiable. The dependence of the present relic abundance on the abundance at an intermediate temperature is an exact result. The exact theory suggests a new analytical approximation that furnishes the relic abundance accurate at the level of 1.2 % in the case of S-wave and P-wave scattering cross sections. We conclude the paper studying the evolution of the WIMPs chemical potential and the entropy production using methods of non-equilibrium thermodynamics. (orig.)

Exactly marginal deformations from exceptional generalised geometry

Energy Technology Data Exchange (ETDEWEB)

Ashmore, Anthony [Merton College, University of Oxford,Merton Street, Oxford, OX1 4JD (United Kingdom); Mathematical Institute, University of Oxford,Andrew Wiles Building, Woodstock Road, Oxford, OX2 6GG (United Kingdom); Gabella, Maxime [Institute for Advanced Study,Einstein Drive, Princeton, NJ 08540 (United States); Graña, Mariana [Institut de Physique Théorique, CEA/Saclay,91191 Gif-sur-Yvette (France); Petrini, Michela [Sorbonne Université, UPMC Paris 05, UMR 7589, LPTHE,75005 Paris (France); Waldram, Daniel [Department of Physics, Imperial College London,Prince Consort Road, London, SW7 2AZ (United Kingdom)

2017-01-27

We apply exceptional generalised geometry to the study of exactly marginal deformations of N=1 SCFTs that are dual to generic AdS{sub 5} flux backgrounds in type IIB or eleven-dimensional supergravity. In the gauge theory, marginal deformations are parametrised by the space of chiral primary operators of conformal dimension three, while exactly marginal deformations correspond to quotienting this space by the complexified global symmetry group. We show how the supergravity analysis gives a geometric interpretation of the gauge theory results. The marginal deformations arise from deformations of generalised structures that solve moment maps for the generalised diffeomorphism group and have the correct charge under the generalised Reeb vector, generating the R-symmetry. If this is the only symmetry of the background, all marginal deformations are exactly marginal. If the background possesses extra isometries, there are obstructions that come from fixed points of the moment maps. The exactly marginal deformations are then given by a further quotient by these extra isometries. Our analysis holds for any N=2 AdS{sub 5} flux background. Focussing on the particular case of type IIB Sasaki-Einstein backgrounds we recover the result that marginal deformations correspond to perturbing the solution by three-form flux at first order. In various explicit examples, we show that our expression for the three-form flux matches those in the literature and the obstruction conditions match the one-loop beta functions of the dual SCFT.

Factorization of Constrained Energy K-Network Reliability with Perfect Nodes

OpenAIRE

Burgos, Juan Manuel

2013-01-01

This paper proves a new general K-network constrained energy reliability global factorization theorem. As in the unconstrained case, beside its theoretical mathematical importance the theorem shows how to do parallel processing in exact network constrained energy reliability calculations in order to reduce the processing time of this NP-hard problem. Followed by a new simple factorization formula for its calculation, we propose a new definition of constrained energy network reliability motiva...

Exact solutions of nonlinear differential equations using continued fractions

International Nuclear Information System (INIS)

Ditto, W.L.; Pickett, T.J.

1990-01-01

The continued-fraction conversion method (J. Math. Phys. (N.Y.), 29, 1761 (1988)) is used to generate a homologous family of exact solutions to the Lane-Emden equation φ(r) '' + 2φ(r)'/r + αφ(r) p = 0, for p=5. An exact solution is also obtained for a generalization of the Lane-Emden equation of the form -φ '' (r) -2φ(r)'/r + αφ(r) 2p+1 + λφ(r) 4p+1 = 0 for arbitrary α, γ and p. A condition is established for the generation of exact solutions from the method

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.

Fluctuation-dissipation relation and stationary distribution of an exactly solvable many-particle model for active biomatter far from equilibrium.

Science.gov (United States)

Netz, Roland R

2018-05-14

An exactly solvable, Hamiltonian-based model of many massive particles that are coupled by harmonic potentials and driven by stochastic non-equilibrium forces is introduced. The stationary distribution and the fluctuation-dissipation relation are derived in closed form for the general non-equilibrium case. Deviations from equilibrium are on one hand characterized by the difference of the obtained stationary distribution from the Boltzmann distribution; this is possible because the model derives from a particle Hamiltonian. On the other hand, the difference between the obtained non-equilibrium fluctuation-dissipation relation and the standard equilibrium fluctuation-dissipation theorem allows us to quantify non-equilibrium in an alternative fashion. Both indicators of non-equilibrium behavior, i.e., deviations from the Boltzmann distribution and deviations from the equilibrium fluctuation-dissipation theorem, can be expressed in terms of a single non-equilibrium parameter α that involves the ratio of friction coefficients and random force strengths. The concept of a non-equilibrium effective temperature, which can be defined by the relation between fluctuations and the dissipation, is by comparison with the exactly derived stationary distribution shown not to hold, even if the effective temperature is made frequency dependent. The analysis is not confined to close-to-equilibrium situations but rather is exact and thus holds for arbitrarily large deviations from equilibrium. Also, the suggested harmonic model can be obtained from non-linear mechanical network systems by an expansion in terms of suitably chosen deviatory coordinates; the obtained results should thus be quite general. This is demonstrated by comparison of the derived non-equilibrium fluctuation dissipation relation with experimental data on actin networks that are driven out of equilibrium by energy-consuming protein motors. The comparison is excellent and allows us to extract the non

Fluctuation-dissipation relation and stationary distribution of an exactly solvable many-particle model for active biomatter far from equilibrium

Science.gov (United States)

Netz, Roland R.

2018-05-01

An exactly solvable, Hamiltonian-based model of many massive particles that are coupled by harmonic potentials and driven by stochastic non-equilibrium forces is introduced. The stationary distribution and the fluctuation-dissipation relation are derived in closed form for the general non-equilibrium case. Deviations from equilibrium are on one hand characterized by the difference of the obtained stationary distribution from the Boltzmann distribution; this is possible because the model derives from a particle Hamiltonian. On the other hand, the difference between the obtained non-equilibrium fluctuation-dissipation relation and the standard equilibrium fluctuation-dissipation theorem allows us to quantify non-equilibrium in an alternative fashion. Both indicators of non-equilibrium behavior, i.e., deviations from the Boltzmann distribution and deviations from the equilibrium fluctuation-dissipation theorem, can be expressed in terms of a single non-equilibrium parameter α that involves the ratio of friction coefficients and random force strengths. The concept of a non-equilibrium effective temperature, which can be defined by the relation between fluctuations and the dissipation, is by comparison with the exactly derived stationary distribution shown not to hold, even if the effective temperature is made frequency dependent. The analysis is not confined to close-to-equilibrium situations but rather is exact and thus holds for arbitrarily large deviations from equilibrium. Also, the suggested harmonic model can be obtained from non-linear mechanical network systems by an expansion in terms of suitably chosen deviatory coordinates; the obtained results should thus be quite general. This is demonstrated by comparison of the derived non-equilibrium fluctuation dissipation relation with experimental data on actin networks that are driven out of equilibrium by energy-consuming protein motors. The comparison is excellent and allows us to extract the non

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...

Learning and forgetting on asymmetric, diluted neural networks

International Nuclear Information System (INIS)

Derrida, B.; Nadal, J.P.

1987-01-01

It is possible to construct diluted asymmetric models of neural networks for which the dynamics can be calculated exactly. The authors test several learning schemes, in particular, models for which the values of the synapses remain bounded and depend on the history. Our analytical results on the relative efficiencies of the various learning schemes are qualitatively similar to the corresponding ones obtained numerically on fully connected symmetric networks

Electron transfer dynamics: Zusman equation versus exact theory

International Nuclear Information System (INIS)

Shi Qiang; Chen Liping; Nan Guangjun; Xu Ruixue; Yan Yijing

2009-01-01

The Zusman equation has been widely used to study the effect of solvent dynamics on electron transfer reactions. However, application of this equation is limited by the classical treatment of the nuclear degrees of freedom. In this paper, we revisit the Zusman equation in the framework of the exact hierarchical equations of motion formalism, and show that a high temperature approximation of the hierarchical theory is equivalent to the Zusman equation in describing electron transfer dynamics. Thus the exact hierarchical formalism naturally extends the Zusman equation to include quantum nuclear dynamics at low temperatures. This new finding has also inspired us to rescale the original hierarchical equations and incorporate a filtering algorithm to efficiently propagate the hierarchical equations. Numerical exact results are also presented for the electron transfer reaction dynamics and rate constant calculations.

Evaluation of the Harmonic Impedance of Frydlant (Line 53 Power Network

Directory of Open Access Journals (Sweden)

Shehab Abdulwadood Ali

2013-01-01

Full Text Available The harmonic impedance of the power system is an important quantity, which describes the behaviour of the power system with the existence of different frequencies beside the fundamental. The harmonic study belongs to the most difficult part of the electrical measurements and calculations even by using computer software. The main problem accompanying the calculating methods is to obtain the exact data of the electrical network parameters or to know the exact operational status of the system. In this paper the harmonic impedance of Frydlant (line 53, 22~kV in Czech Republic power network was calculated by using a very specialized software and suitable for solving such calculations called "NetCalc. version 3.0" [1].

Exact solutions of some nonlinear partial differential equations using ...

Indian Academy of Sciences (India)

The functional variable method is a powerful solution method for obtaining exact solutions of some nonlinear partial differential equations. In this paper, the functional variable method is used to establish exact solutions of the generalized forms of Klein–Gordon equation, the (2 + 1)-dimensional Camassa–Holm ...

Memristor-based neural networks

International Nuclear Information System (INIS)

Thomas, Andy

2013-01-01

The synapse is a crucial element in biological neural networks, but a simple electronic equivalent has been absent. This complicates the development of hardware that imitates biological architectures in the nervous system. Now, the recent progress in the experimental realization of memristive devices has renewed interest in artificial neural networks. The resistance of a memristive system depends on its past states and exactly this functionality can be used to mimic the synaptic connections in a (human) brain. After a short introduction to memristors, we present and explain the relevant mechanisms in a biological neural network, such as long-term potentiation and spike time-dependent plasticity, and determine the minimal requirements for an artificial neural network. We review the implementations of these processes using basic electric circuits and more complex mechanisms that either imitate biological systems or could act as a model system for them. (topical review)

Selective Reduction of AMPA Currents onto Hippocampal Interneurons Impairs Network Oscillatory Activity

Science.gov (United States)

Le Magueresse, Corentin; Monyer, Hannah

2012-01-01

Reduction of excitatory currents onto GABAergic interneurons in the forebrain results in impaired spatial working memory and altered oscillatory network patterns in the hippocampus. Whether this phenotype is caused by an alteration in hippocampal interneurons is not known because most studies employed genetic manipulations affecting several brain regions. Here we performed viral injections in genetically modified mice to ablate the GluA4 subunit of the AMPA receptor in the hippocampus (GluA4HC−/− mice), thereby selectively reducing AMPA receptor-mediated currents onto a subgroup of hippocampal interneurons expressing GluA4. This regionally selective manipulation led to a strong spatial working memory deficit while leaving reference memory unaffected. Ripples (125–250 Hz) in the CA1 region of GluA4HC−/− mice had larger amplitude, slower frequency and reduced rate of occurrence. These changes were associated with an increased firing rate of pyramidal cells during ripples. The spatial selectivity of hippocampal pyramidal cells was comparable to that of controls in many respects when assessed during open field exploration and zigzag maze running. However, GluA4 ablation caused altered modulation of firing rate by theta oscillations in both interneurons and pyramidal cells. Moreover, the correlation between the theta firing phase of pyramidal cells and position was weaker in GluA4HC−/− mice. These results establish the involvement of AMPA receptor-mediated currents onto hippocampal interneurons for ripples and theta oscillations, and highlight potential cellular and network alterations that could account for the altered working memory performance. PMID:22675480

Exact Cover Problem in Milton Babbitt's All-partition Array

DEFF Research Database (Denmark)

Bemman, Brian; Meredith, David

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...

A class of exact solutions to the Einstein field equations

International Nuclear Information System (INIS)

Goyal, Nisha; Gupta, R K

2012-01-01

The Einstein-Rosen metric is considered and a class of new exact solutions of the field equations for stationary axisymmetric Einstein-Maxwell fields is obtained. The Lie classical approach is applied to obtain exact solutions. By using the Lie classical method, we are able to derive symmetries that are used for reducing the coupled system of partial differential equations into ordinary differential equations. From reduced differential equations we have derived some new exact solutions of Einstein-Maxwell equations. (paper)

Exactly and completely integrable nonlinear dynamical systems

International Nuclear Information System (INIS)

Leznov, A.N.; Savel'ev, M.V.

1987-01-01

The survey is devoted to a consitent exposition of the group-algebraic methods for the integration of systems of nonlinear partial differential equations possessing a nontrivial internal symmetry algebra. Samples of exactly and completely integrable wave and evolution equations are considered in detail, including generalized (periodic and finite nonperiodic Toda lattice, nonlinear Schroedinger, Korteweg-de Vries, Lotka-Volterra equations, etc.) For exactly integrable systems the general solutions of the Cauchy and Goursat problems are given in an explicit form, while for completely integrable systems an effective method for the construction of their soliton solutions is developed. Application of the developed methods to a differential geometry problem of classification of the integrable manifolds embeddings is discussed. For exactly integrable systems the supersymmetric extensions are constructed. By the example of the generalized Toda lattice a quantization scheme is developed. It includes an explicit derivation of the corresponding Heisenberg operators and their desription in terms of the quantum algebras of the Hopf type. Among multidimensional systems the four-dimensional self-dual Yang-Mills equations are investigated most attentively with a goal of constructing their general solutions

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.

A novel recurrent neural network with finite-time convergence for linear programming.

Science.gov (United States)

Liu, Qingshan; Cao, Jinde; Chen, Guanrong

2010-11-01

In this letter, a novel recurrent neural network based on the gradient method is proposed for solving linear programming problems. Finite-time convergence of the proposed neural network is proved by using the Lyapunov method. Compared with the existing neural networks for linear programming, the proposed neural network is globally convergent to exact optimal solutions in finite time, which is remarkable and rare in the literature of neural networks for optimization. Some numerical examples are given to show the effectiveness and excellent performance of the new recurrent neural network.

Stochastic epidemic-type model with enhanced connectivity: exact solution

International Nuclear Information System (INIS)

Williams, H T; Mazilu, I; Mazilu, D A

2012-01-01

We present an exact analytical solution to a one-dimensional model of the susceptible–infected–recovered (SIR) epidemic type, with infection rates dependent on nearest-neighbor occupations. We use a quantum mechanical approach, transforming the master equation via a quantum spin operator formulation. We calculate exactly the time-dependent density of infected, recovered and susceptible populations for random initial conditions. Our results compare well with those of previous work, validating the model as a useful tool for additional and extended studies in this important area. Our model also provides exact solutions for the n-point correlation functions, and can be extended to more complex epidemic-type models

Energy vs. density on paths toward exact density functionals

DEFF Research Database (Denmark)

Kepp, Kasper Planeta

2018-01-01

Recently, the progression toward more exact density functional theory has been questioned, implying a need for more formal ways to systematically measure progress, i.e. a “path”. Here I use the Hohenberg-Kohn theorems and the definition of normality by Burke et al. to define a path toward exactness...

Exact Synthesis of Reversible Circuits Using A* Algorithm

Science.gov (United States)

Datta, K.; Rathi, G. K.; Sengupta, I.; Rahaman, H.

2015-06-01

With the growing emphasis on low-power design methodologies, and the result that theoretical zero power dissipation is possible only if computations are information lossless, design and synthesis of reversible logic circuits have become very important in recent years. Reversible logic circuits are also important in the context of quantum computing, where the basic operations are reversible in nature. Several synthesis methodologies for reversible circuits have been reported. Some of these methods are termed as exact, where the motivation is to get the minimum-gate realization for a given reversible function. These methods are computationally very intensive, and are able to synthesize only very small functions. There are other methods based on function transformations or higher-level representation of functions like binary decision diagrams or exclusive-or sum-of-products, that are able to handle much larger circuits without any guarantee of optimality or near-optimality. Design of exact synthesis algorithms is interesting in this context, because they set some kind of benchmarks against which other methods can be compared. This paper proposes an exact synthesis approach based on an iterative deepening version of the A* algorithm using the multiple-control Toffoli gate library. Experimental results are presented with comparisons with other exact and some heuristic based synthesis approaches.

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.

Exact braneworld cosmology induced from bulk black holes

International Nuclear Information System (INIS)

Gregory, James P; Padilla, Antonio

2002-01-01

We use a new, exact approach in calculating the energy density measured by an observer living on a brane embedded in a charged black-hole spacetime. We find that the bulk Weyl tensor gives rise to nonlinear terms in the energy density and pressure in the FRW equations for the brane. Remarkably, these take exactly the same form as the 'unconventional' terms found in the cosmology of branes embedded in pure AdS, with extra matter living on the brane. Black-hole-driven cosmologies have the benefit that there is no ambiguity in splitting the braneworld energy momentum into tension and additional matter. We propose a new, enlarged relationship between the two descriptions of braneworld cosmology. We also study the exact thermodynamics of the field theory and present a generalized Cardy-Verlinde formula in this set-up

When is quasi-linear theory exact. [particle acceleration

Science.gov (United States)

Jones, F. C.; Birmingham, T. J.

1975-01-01

We use the cumulant expansion technique of Kubo (1962, 1963) to derive an integrodifferential equation for the average one-particle distribution function for particles being accelerated by electric and magnetic fluctuations of a general nature. For a very restricted class of fluctuations, the equation for this function degenerates exactly to a differential equation of Fokker-Planck type. Quasi-linear theory, including the adiabatic assumption, is an exact theory only for this limited class of fluctuations.

Exact Lagrangian caps and non-uniruled Lagrangian submanifolds

Science.gov (United States)

Dimitroglou Rizell, Georgios

2015-04-01

We make the elementary observation that the Lagrangian submanifolds of C n , n≥3, constructed by Ekholm, Eliashberg, Murphy and Smith are non-uniruled and, moreover, have infinite relative Gromov width. The construction of these submanifolds involve exact Lagrangian caps, which obviously are non-uniruled in themselves. This property is also used to show that if a Legendrian submanifold inside a contactisation admits an exact Lagrangian cap, then its Chekanov-Eliashberg algebra is acyclic.

Network master planning for a global manufacturing company

OpenAIRE

Heinz, Michael Pierre

2006-01-01

Production in global, intra-organisational networks is becoming more common. In this context, the allocation of production quantities to constrained manufacturing capacity is a challenging process. Due to a volatile environment it is argued to be impossible to achieve a ‘clean’ system design with dedicated resources which exactly meets future demand. Thus, recursive ‘Network Master Planning’ (NMP) becomes necessary. The aim of this research is to generate an understanding of th...

Percolation in real multiplex networks

Science.gov (United States)

Bianconi, Ginestra; Radicchi, Filippo

2016-12-01

We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where nodes are present in the system with given probability. The approach relies on the locally treelike ansatz, so that it is expected to accurately reproduce the true percolation diagram of sparse multiplex networks with negligible number of short loops. The performance of our theory is tested in social, biological, and transportation multiplex graphs. When compared against previously introduced methods, we observe improvements in the prediction of the percolation diagrams in all networks analyzed. Results from our method confirm previous claims about the robustness of real multiplex networks, in the sense that the average connectedness of the system does not exhibit any significant abrupt change as its individual components are randomly destroyed.

Addressing water incidents by using pipe network models

CSIR Research Space (South Africa)

Yoyo, Sonwabiso

2016-05-01

Full Text Available quantities like flow rate and pressure with water meters. Such an approach provides a highly exact and realistic understanding, but is potentially very expensive to implement. This is especially so in view of the large number water infrastructure networks...

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.

Optimal information transfer in enzymatic networks: A field theoretic formulation

Science.gov (United States)

Samanta, Himadri S.; Hinczewski, Michael; Thirumalai, D.

2017-07-01

Signaling in enzymatic networks is typically triggered by environmental fluctuations, resulting in a series of stochastic chemical reactions, leading to corruption of the signal by noise. For example, information flow is initiated by binding of extracellular ligands to receptors, which is transmitted through a cascade involving kinase-phosphatase stochastic chemical reactions. For a class of such networks, we develop a general field-theoretic approach to calculate the error in signal transmission as a function of an appropriate control variable. Application of the theory to a simple push-pull network, a module in the kinase-phosphatase cascade, recovers the exact results for error in signal transmission previously obtained using umbral calculus [Hinczewski and Thirumalai, Phys. Rev. X 4, 041017 (2014), 10.1103/PhysRevX.4.041017]. We illustrate the generality of the theory by studying the minimal errors in noise reduction in a reaction cascade with two connected push-pull modules. Such a cascade behaves as an effective three-species network with a pseudointermediate. In this case, optimal information transfer, resulting in the smallest square of the error between the input and output, occurs with a time delay, which is given by the inverse of the decay rate of the pseudointermediate. Surprisingly, in these examples the minimum error computed using simulations that take nonlinearities and discrete nature of molecules into account coincides with the predictions of a linear theory. In contrast, there are substantial deviations between simulations and predictions of the linear theory in error in signal propagation in an enzymatic push-pull network for a certain range of parameters. Inclusion of second-order perturbative corrections shows that differences between simulations and theoretical predictions are minimized. Our study establishes that a field theoretic formulation of stochastic biological signaling offers a systematic way to understand error propagation in

Reduction of Uncertainty Propagation in the Airport Operations Network

Energy Technology Data Exchange (ETDEWEB)

Rodriguez Sanz, A.; Gomez Comendador, F.; Arnaldo Valdes, R.

2016-07-01

Airport operations are a complex system involving multiple elements (ground access, landside, airside and airspace), stakeholders (ANS providers, airlines, airport managers, policy makers and ground handling companies) and interrelated processes. To ensure appropriate and safe operation it is necessary to understand these complex relationships and how the effects of potential incidents, failures and delays (due to unexpected events or capacity constraints) may propagate throughout the different stages of the system. An incident may easily ripple through the network and affect the operation of the airport as a whole, making the entire system vulnerable. A holistic view of the processes that also takes all of the parties (and the connections between them) into account would significantly reduce the risks associated with airport operations, while at the same time improving efficiency. Therefore, this paper proposes a framework to integrate all relevant stakeholders and reduce uncertainty in delay propagation, thereby lowering the cause-effect chain probability of the airport system (which is crucial for the operation and development of air transport). Firstly, we developed a model (map) to identify the functional relationships and interdependencies between the different stakeholders and processes that make up the airport operations network. This will act as a conceptual framework. Secondly, we reviewed and characterised the main causes of delay. Finally, we extended the system map to create a probabilistic graphical model, using a Bayesian Network approach and influence diagrams, in order to predict the propagation of unexpected delays across the airport operations network. This will enable us to learn how potential incidents may spread throughout the network creating unreliable, uncertain system states. Policy makers, regulators and airport managers may use this conceptual framework (and the associated indicators) to understand how delays propagate across the airport

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.

An outer approximation method for the road network design problem.

Science.gov (United States)

Asadi Bagloee, Saeed; Sarvi, Majid

2018-01-01

Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.

Lattice sigma models with exact supersymmetry

International Nuclear Information System (INIS)

Simon Catterall; Sofiane Ghadab

2004-01-01

We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and twisted versions of conventional supersymmetric sigma models with N=2 supersymmetry. The fermionic symmetry corresponds to a scalar BRST charge built from the original supercharges. The lattice theories possess local actions and exhibit no fermion doubling. In the two and four dimensional theories we show that these lattice theories are invariant under additional discrete symmetries. We argue that the presence of these exact symmetries ensures that no fine tuning is required to achieve N=2 supersymmetry in the continuum limit. As a concrete example we show preliminary numerical results from a simulation of the O(3) supersymmetric sigma model in two dimensions. (author)

Resiliently evolving supply-demand networks

Science.gov (United States)

Rubido, Nicolás; Grebogi, Celso; Baptista, Murilo S.

2014-01-01

The ability to design a transport network such that commodities are brought from suppliers to consumers in a steady, optimal, and stable way is of great importance for distribution systems nowadays. In this work, by using the circuit laws of Kirchhoff and Ohm, we provide the exact capacities of the edges that an optimal supply-demand network should have to operate stably under perturbations, i.e., without overloading. The perturbations we consider are the evolution of the connecting topology, the decentralization of hub sources or sinks, and the intermittence of supplier and consumer characteristics. We analyze these conditions and the impact of our results, both on the current United Kingdom power-grid structure and on numerically generated evolving archetypal network topologies.

Two statistical mechanics aspects of complex networks

Science.gov (United States)

Thurner, Stefan; Biely, Christoly

2006-12-01

By adopting an ensemble interpretation of non-growing rewiring networks, network theory can be reduced to a counting problem of possible network states and an identification of their associated probabilities. We present two scenarios of how different rewirement schemes can be used to control the state probabilities of the system. In particular, we review how by generalizing the linking rules of random graphs, in combination with superstatistics and quantum mechanical concepts, one can establish an exact relation between the degree distribution of any given network and the nodes’ linking probability distributions. In a second approach, we control state probabilities by a network Hamiltonian, whose characteristics are motivated by biological and socio-economical statistical systems. We demonstrate that a thermodynamics of networks becomes a fully consistent concept, allowing to study e.g. ‘phase transitions’ and computing entropies through thermodynamic relations.

Benchmarking GW against exact diagonalization for semiempirical models

DEFF Research Database (Denmark)

Kaasbjerg, Kristen; Thygesen, Kristian Sommer

2010-01-01

We calculate ground-state total energies and single-particle excitation energies of seven pi-conjugated molecules described with the semiempirical Pariser-Parr-Pople model using self-consistent many-body perturbation theory at the GW level and exact diagonalization. For the total energies GW capt...... (Hubbard models) where correlation effects dominate over screening/relaxation effects. Finally we illustrate the important role of the derivative discontinuity of the true exchange-correlation functional by computing the exact Kohn-Sham levels of benzene....

The exact parity symmetric model and big bang nucleosynthesis

Energy Technology Data Exchange (ETDEWEB)

Foot, R.; Volkas, R.R.

1996-12-01

The assumption of exact, unbroken parity symmetry leads directly to a simple predictive resolution of the atmospheric and solar neutrino puzzles. This is because the existence of this symmetry implies the existence of a set of mirror neutrinos which must mix maximally with the known neutrinos if neutrinos have mass. the maximal mixing of the electron neutrino with the mirror electron neutrino with 3 x 10{sup -10} eV{sup 2} {<=} |{delta}m{sup 2}| {<=} 10{sup -3} eV{sup 2} leads to a predicted reduction of the solar neutrino flux by-a factor of 2, which is in quite good agreement with the experiments. The maximal mixing of the muon neutrino with the mirror muon neutrino with |{delta}m{sup 2}| {approx} 10{sup -2} eV{sup 2} also solves the atmospheric neutrino puzzle. We show that there is a significant range of parameters where these solutions are not in conflict with standard Big Bang Nucleosynthesis when the creation of lepton asymmetry due to neutrino oscillations is taken into account. (authors).

Exactly solvable energy-dependent potentials

International Nuclear Information System (INIS)

Garcia-Martinez, J.; Garcia-Ravelo, J.; Pena, J.J.; Schulze-Halberg, A.

2009-01-01

We introduce a method for constructing exactly-solvable Schroedinger equations with energy-dependent potentials. Our method is based on converting a general linear differential equation of second order into a Schroedinger equation with energy-dependent potential. Particular examples presented here include harmonic oscillator, Coulomb and Morse potentials with various types of energy dependence.

New exact travelling wave solutions for the Ostrovsky equation

International Nuclear Information System (INIS)

Kangalgil, Figen; Ayaz, Fatma

2008-01-01

In this Letter, auxiliary equation method is proposed for constructing more general exact solutions of nonlinear partial differential equation with the aid of symbolic computation. In order to illustrate the validity and the advantages of the method we choose the Ostrovsky equation. As a result, many new and more general exact solutions have been obtained for the equation

Ontology-Based Peer Exchange Network (OPEN)

Science.gov (United States)

Dong, Hui

2010-01-01

In current Peer-to-Peer networks, distributed and semantic free indexing is widely used by systems adopting "Distributed Hash Table" ("DHT") mechanisms. Although such systems typically solve a. user query rather fast in a deterministic way, they only support a very narrow search scheme, namely the exact hash key match. Furthermore, DHT systems put…

Exact solutions for some discrete models of the Boltzmann equation

International Nuclear Information System (INIS)

Cabannes, H.; Hong Tiem, D.

1987-01-01

For the simplest of the discrete models of the Boltzmann equation: the Broadwell model, exact solutions have been obtained by Cornille in the form of bisolitons. In the present Note, we build exact solutions for more complex models [fr

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....

Jitter reduction in Differentiated Services (Diffserv) networks

NARCIS (Netherlands)

Karagiannis, Georgios; Rexhepi, Vlora

2001-01-01

A method and a computer program for reducing jitter in IP packet transmission in a Diffserv network having ingress and egress Border Routers and using premium service, expedited forwarding and source route option, recognize incoming packets which have firm jitter requirements. The program verifies

Jitter reduction in Differentiated Services (Diffserv) networks

NARCIS (Netherlands)

Karagiannis, Georgios; Rexhepi, Vlora

2005-01-01

A method and a computer program for reducing jitter in IP packet transmission in a Diffserv network having ingress and egress Border Routers and using premium service, expedited forwarding and source route option, recognize incoming packets which have firm jitter requirements. The program verifies

Firing rate dynamics in recurrent spiking neural networks with intrinsic and network heterogeneity.

Science.gov (United States)

Ly, Cheng

2015-12-01

Heterogeneity of neural attributes has recently gained a lot of attention and is increasing recognized as a crucial feature in neural processing. Despite its importance, this physiological feature has traditionally been neglected in theoretical studies of cortical neural networks. Thus, there is still a lot unknown about the consequences of cellular and circuit heterogeneity in spiking neural networks. In particular, combining network or synaptic heterogeneity and intrinsic heterogeneity has yet to be considered systematically despite the fact that both are known to exist and likely have significant roles in neural network dynamics. In a canonical recurrent spiking neural network model, we study how these two forms of heterogeneity lead to different distributions of excitatory firing rates. To analytically characterize how these types of heterogeneities affect the network, we employ a dimension reduction method that relies on a combination of Monte Carlo simulations and probability density function equations. We find that the relationship between intrinsic and network heterogeneity has a strong effect on the overall level of heterogeneity of the firing rates. Specifically, this relationship can lead to amplification or attenuation of firing rate heterogeneity, and these effects depend on whether the recurrent network is firing asynchronously or rhythmically firing. These observations are captured with the aforementioned reduction method, and furthermore simpler analytic descriptions based on this dimension reduction method are developed. The final analytic descriptions provide compact and descriptive formulas for how the relationship between intrinsic and network heterogeneity determines the firing rate heterogeneity dynamics in various settings.

The asymptotic and exact Fisher information matrices of a vector ARMA process

NARCIS (Netherlands)

Klein, A.; Melard, G.; Saidi, A.

2008-01-01

The exact Fisher information matrix of a Gaussian vector autoregressive-moving average (VARMA) process has been considered for a time series of length N in relation to the exact maximum likelihood estimation method. In this paper it is shown that the Gaussian exact Fisher information matrix

Exact 2-point function in Hermitian matrix model

International Nuclear Information System (INIS)

Morozov, A.; Shakirov, Sh.

2009-01-01

J. Harer and D. Zagier have found a strikingly simple generating function [1,2] for exact (all-genera) 1-point correlators in the Gaussian Hermitian matrix model. In this paper we generalize their result to 2-point correlators, using Toda integrability of the model. Remarkably, this exact 2-point correlation function turns out to be an elementary function - arctangent. Relation to the standard 2-point resolvents is pointed out. Some attempts of generalization to 3-point and higher functions are described.

Exact solutions in string-motivated scalar-field cosmology

International Nuclear Information System (INIS)

Oezer, M.; Taha, M.O.

1992-01-01

Two exact cosmological solutions to a scalar-field potential motivated by six-dimensional (6D) Einstein-Maxwell theory are given. The resulting pure scalar-field cosmology is free of singularity and causality problems but conserves entropy. These solutions are then extended into exact cosmological solutions for a decaying scalar field with an approximate two-loop 4D string potential. The resulting cosmology is, for both solutions, free of cosmological problems and close to the standard cosmology of the radiation era

Exactly soluble matrix models

International Nuclear Information System (INIS)

Raju Viswanathan, R.

1991-09-01

We study examples of one dimensional matrix models whose potentials possess an energy spectrum that can be explicitly determined. This allows for an exact solution in the continuum limit. Specifically, step-like potentials and the Morse potential are considered. The step-like potentials show no scaling behaviour and the Morse potential (which corresponds to a γ = -1 model) has the interesting feature that there are no quantum corrections to the scaling behaviour in the continuum limit. (author). 5 refs

Perturbative QCD lagrangian at large distances and stochastic dimensionality reduction

International Nuclear Information System (INIS)

Shintani, M.

1986-10-01

We construct a Lagrangian for perturbative QCD at large distances within the covariant operator formalism which explains the color confinement of quarks and gluons while maintaining unitarity of the S-matrix. It is also shown that when interactions are switched off, the mechanism of stochastic dimensionality reduction is operative in the system due to exact super-Lorentz symmetries. (orig.)

Disease spreading in real-life networks

Science.gov (United States)

Gallos, Lazaros; Argyrakis, Panos

2002-08-01

In recent years the scientific community has shown a vivid interest in the network structure and dynamics of real-life organized systems. Many such systems, covering an extremely wide range of applications, have been recently shown to exhibit scale-free character in their connectivity distribution, meaning that they obey a power law. Modeling of epidemics on lattices and small-world networks suffers from the presence of a critical infection threshold, above which the entire population is infected. For scale-free networks, the original assumption was that the formation of a giant cluster would lead to an epidemic spreading in the same way as in simpler networks. Here we show that modeling epidemics on a scale-free network can greatly improve the predictions on the rate and efficiency of spreading, as compared to lattice models and small-world networks. We also show that the dynamics of a disease are greatly influenced by the underlying population structure. The exact same model can describe a plethora of networks, such as social networks, virus spreading in the Web, rumor spreading, signal transmission etc.

Linear orbit parameters for the exact equations of motion

International Nuclear Information System (INIS)

Parzen, G.

1995-01-01

This paper defines the beta function and other linear orbit parameters using the exact equations of motion. The β, α and ψ functions are redefined using the exact equations. Expressions are found for the transfer matrix and the emittance. The differential equations for η = x/β 1/2 is found. New relationships between α, β, ψ and ν are derived

Hierarchical regular small-world networks

International Nuclear Information System (INIS)

Boettcher, Stefan; Goncalves, Bruno; Guclu, Hasan

2008-01-01

Two new networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They possess a unique one-dimensional lattice backbone overlaid by a hierarchical sequence of long-distance links, mixing real-space and small-world features. Both networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as revealed by renormalization group studies. The 3-regular network is planar, has a diameter growing as √N with system size N, and leads to super-diffusion with an exact, anomalous exponent d w = 1.306..., but possesses only a trivial fixed point T c = 0 for the Ising ferromagnet. In turn, the 4-regular network is non-planar, has a diameter growing as ∼2 √(log 2 N 2 ) , exhibits 'ballistic' diffusion (d w = 1), and a non-trivial ferromagnetic transition, T c > 0. It suggests that the 3-regular network is still quite 'geometric', while the 4-regular network qualifies as a true small world with mean-field properties. As an engineering application we discuss synchronization of processors on these networks. (fast track communication)

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

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Al-Naffouri, Tareq Y.

2014-01-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.

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.

Universality in exact quantum state population dynamics and control

International Nuclear Information System (INIS)

Wu, Lian-Ao; Segal, Dvira; Brumer, Paul; Egusquiza, Inigo L.

2010-01-01

We consider an exact population transition, defined as the probability of finding a state at a final time that is exactly equal to the probability of another state at the initial time. We prove that, given a Hamiltonian, there always exists a complete set of orthogonal states that can be employed as time-zero states for which this exact population transition occurs. The result is general: It holds for arbitrary systems, arbitrary pairs of initial and final states, and for any time interval. The proposition is illustrated with several analytic models. In particular, we demonstrate that in some cases, by tuning the control parameters, a complete transition might occur, where a target state, vacant at t=0, is fully populated at time τ.

Fuzziness and Foundations of Exact and Inexact Sciences

CERN Document Server

Dompere, Kofi Kissi

2013-01-01

The monograph is an examination of the fuzzy rational foundations of the structure of exact and inexact sciences over the epistemological space which is distinguished from the ontological space. It is thus concerned with the demarcation problem. It examines exact science and its critique of inexact science. The role of fuzzy rationality in these examinations is presented. The driving force of the discussions is the nature of the information that connects the cognitive relational structure of the epistemological space to the ontological space for knowing. The knowing action is undertaken by decision-choice agents who must process information to derive exact-inexact or true-false conclusions. The information processing is done with a paradigm and laws of thought that constitute the input-output machine. The nature of the paradigm selected depends on the nature of the information structure that is taken as input of the thought processing. Generally, the information structure received from the ontological space i...

Symmetry and exact solutions of nonlinear spinor equations

International Nuclear Information System (INIS)

Fushchich, W.I.; Zhdanov, R.Z.

1989-01-01

This review is devoted to the application of algebraic-theoretical methods to the problem of constructing exact solutions of the many-dimensional nonlinear systems of partial differential equations for spinor, vector and scalar fields widely used in quantum field theory. Large classes of nonlinear spinor equations invariant under the Poincare group P(1, 3), Weyl group (i.e. Poincare group supplemented by a group of scale transformations), and the conformal group C(1, 3) are described. Ansaetze invariant under the Poincare and the Weyl groups are constructed. Using these we reduce the Poincare-invariant nonlinear Dirac equations to systems of ordinary differential equations and construct large families of exact solutions of the nonlinear Dirac-Heisenberg equation depending on arbitrary parameters and functions. In a similar way we have obtained new families of exact solutions of the nonlinear Maxwell-Dirac and Klein-Gordon-Dirac equations. The obtained solutions can be used for quantization of nonlinear equations. (orig.)

Fast Exact Euclidean Distance (FEED) Transformation

NARCIS (Netherlands)

Schouten, Theo; Kittler, J.; van den Broek, Egon; 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

Exact Results in Non-Supersymmetric Large N Orientifold Field Theories

CERN Document Server

Armoni, Adi; Veneziano, Gabriele

2003-01-01

We consider non-supersymmetric large N orientifold field theories. Specifically, we discuss a gauge theory with a Dirac fermion in the anti-symmetric tensor representation. We argue that, at large N and in a large part of its bosonic sector, this theory is non-perturbatively equivalent to N=1 SYM, so that exact results established in the latter (parent) theory also hold in the daughter orientifold theory. In particular, the non-supersymmetric theory has an exactly calculable bifermion condensate, exactly degenerate parity doublets, and a vanishing cosmological constant (all this to leading order in 1/N).

On nonlinear differential equation with exact solutions having various pole orders

International Nuclear Information System (INIS)

Kudryashov, N.A.

2015-01-01

We consider a nonlinear ordinary differential equation having solutions with various movable pole order on the complex plane. We show that the pole order of exact solution is determined by values of parameters of the equation. Exact solutions in the form of the solitary waves for the second order nonlinear differential equation are found taking into account the method of the logistic function. Exact solutions of differential equations are discussed and analyzed

A principled dimension-reduction method for the population density approach to modeling networks of neurons with synaptic dynamics.

Science.gov (United States)

Ly, Cheng

2013-10-01

The population density approach to neural network modeling has been utilized in a variety of contexts. The idea is to group many similar noisy neurons into populations and track the probability density function for each population that encompasses the proportion of neurons with a particular state rather than simulating individual neurons (i.e., Monte Carlo). It is commonly used for both analytic insight and as a time-saving computational tool. The main shortcoming of this method is that when realistic attributes are incorporated in the underlying neuron model, the dimension of the probability density function increases, leading to intractable equations or, at best, computationally intensive simulations. Thus, developing principled dimension-reduction methods is essential for the robustness of these powerful methods. As a more pragmatic tool, it would be of great value for the larger theoretical neuroscience community. For exposition of this method, we consider a single uncoupled population of leaky integrate-and-fire neurons receiving external excitatory synaptic input only. We present a dimension-reduction method that reduces a two-dimensional partial differential-integral equation to a computationally efficient one-dimensional system and gives qualitatively accurate results in both the steady-state and nonequilibrium regimes. The method, termed modified mean-field method, is based entirely on the governing equations and not on any auxiliary variables or parameters, and it does not require fine-tuning. The principles of the modified mean-field method have potential applicability to more realistic (i.e., higher-dimensional) neural networks.

Exact approaches for scaffolding

OpenAIRE

Weller, Mathias; Chateau, Annie; Giroudeau, Rodolphe

2015-01-01

This paper presents new structural and algorithmic results around the scaffolding problem, which occurs prominently in next generation sequencing. The problem can be formalized as an optimization problem on a special graph, the "scaffold graph". We prove that the problem is polynomial if this graph is a tree by providing a dynamic programming algorithm for this case. This algorithm serves as a basis to deduce an exact algorithm for general graphs using a tree decomposition of the input. We ex...

Emergence of robustness in networks of networks

Science.gov (United States)

Roth, Kevin; Morone, Flaviano; Min, Byungjoon; Makse, Hernán A.

2017-06-01

A model of interdependent networks of networks (NONs) was introduced recently [Proc. Natl. Acad. Sci. (USA) 114, 3849 (2017), 10.1073/pnas.1620808114] in the context of brain activation to identify the neural collective influencers in the brain NON. Here we investigate the emergence of robustness in such a model, and we develop an approach to derive an exact expression for the random percolation transition in Erdös-Rényi NONs of this kind. Analytical calculations are in agreement with numerical simulations, and highlight the robustness of the NON against random node failures, which thus presents a new robust universality class of NONs. The key aspect of this robust NON model is that a node can be activated even if it does not belong to the giant mutually connected component, thus allowing the NON to be built from below the percolation threshold, which is not possible in previous models of interdependent networks. Interestingly, the phase diagram of the model unveils particular patterns of interconnectivity for which the NON is most vulnerable, thereby marking the boundary above which the robustness of the system improves with increasing dependency connections.

arXiv Integrable flows between exact CFTs

CERN Document Server

Georgiou, George

2017-11-14

We explicitly construct families of integrable σ-model actions smoothly inter-polating between exact CFTs. In the ultraviolet the theory is the direct product of two current algebras at levels k$_{1}$ and k$_{2}$. In the infrared and for the case of two deformation matrices the CFT involves a coset CFT, whereas for a single matrix deformation it is given by the ultraviolet direct product theories but at levels k$_{1}$ and k$_{2}$ − k$_{1}$. For isotropic deformations we demonstrate integrability. In this case we also compute the exact beta-function for the deformation parameters using gravitational methods. This is shown to coincide with previous results obtained using perturbation theory and non-perturbative symmetries.

Exact computation of the 9-j symbols

International Nuclear Information System (INIS)

Lai Shantao; Chiu Jingnan

1992-01-01

A useful algebraic formula for the 9-j symbol has been rewritten for convenient use on a computer. A simple FORTRAN program for the exact computation of 9-j symbols has been written for the VAX with VMS version V5,4-1 according to this formula. The results agree with the approximate values in existing literature. Some specific values of 9-j symbols needed for the intensity and alignments of three-photon nonresonant transitions are tabulated. Approximate 9-j symbol values beyond the limitation of the computer can also be computed by this program. The computer code of the exact computation of 3-j, 6-j and 9-j symbols are available through electronic mail upon request. (orig.)

Exact deconstruction of the 6D (2,0) theory

Science.gov (United States)

Hayling, J.; Papageorgakis, C.; Pomoni, E.; Rodríguez-Gómez, D.

2017-06-01

The dimensional-deconstruction prescription of Arkani-Hamed, Cohen, Kaplan, Karch and Motl provides a mechanism for recovering the A-type (2,0) theories on T 2, starting from a four-dimensional N=2 circular-quiver theory. We put this conjecture to the test using two exact-counting arguments: in the decompactification limit, we compare the Higgs-branch Hilbert series of the 4D N=2 quiver to the "half-BPS" limit of the (2,0) superconformal index. We also compare the full partition function for the 4D quiver on S 4 to the (2,0) partition function on S 4 × T 2. In both cases we find exact agreement. The partition function calculation sets up a dictionary between exact results in 4D and 6D.

Exact deconstruction of the 6D (2,0) theory

International Nuclear Information System (INIS)

Hayling, J.; Papageorgakis, C.; Pomoni, E.; Rodriguez-Gomez, D.

2017-06-01

The dimensional-deconstruction prescription of Arkani-Hamed, Cohen, Kaplan, Karch and Motl provides a mechanism for recovering the A-type (2,0) theories on T 2 , starting from a four-dimensional N=2 circular-quiver theory. We put this conjecture to the test using two exact-counting arguments: In the decompactification limit, we compare the Higgs-branch Hilbert series of the 4D N=2 quiver to the ''half-BPS'' limit of the (2,0) superconformal index. We also compare the full partition function for the 4D quiver on S 4 to the (2,0) partition function on S 4 x T 2 . In both cases we find exact agreement. The partition function calculation sets up a dictionary between exact results in 4D and 6D.

Exact Stiffness for Beams on Kerr-Type Foundation: The Virtual Force Approach

Directory of Open Access Journals (Sweden)

Suchart Limkatanyu

2013-01-01

Full Text Available This paper alternatively derives the exact element stiffness equation for a beam on Kerr-type foundation. The shear coupling between the individual Winkler-spring components and the peripheral discontinuity at the boundaries between the loaded and the unloaded soil surfaces are taken into account in this proposed model. The element flexibility matrix is derived based on the virtual force principle and forms the core of the exact element stiffness matrix. The sixth-order governing differential compatibility of the problem is revealed using the virtual force principle and solved analytically to obtain the exact force interpolation functions. The matrix virtual force equation is employed to obtain the exact element flexibility matrix based on the exact force interpolation functions. The so-called “natural” element stiffness matrix is obtained by inverting the exact element flexibility matrix. One numerical example is utilized to confirm the accuracy and the efficiency of the proposed beam element on Kerr-type foundation and to show a more realistic distribution of interactive foundation force.

Exact estimation of biodiesel cetane number (CN) from its fatty acid methyl esters (FAMEs) profile using partial least square (PLS) adapted by artificial neural network (ANN)

International Nuclear Information System (INIS)

Hosseinpour, Soleiman; Aghbashlo, Mortaza; Tabatabaei, Meisam; Khalife, Esmail

2016-01-01

Highlights: • Estimating the biodiesel CN from its FAMEs profile using ANN-based PLS approach. • Comparing the capability of ANN-adapted PLS approach with the standard PLS model. • Exact prediction of biodiesel CN from it FAMEs profile using ANN-based PLS method. • Developing an easy-to-use software using ANN-PLS model for computing the biodiesel CN. - Abstract: Cetane number (CN) is among the most important properties of biodiesel because it quantifies combustion speed or in better words, ignition quality. Experimental measurement of biodiesel CN is rather laborious and expensive. However, the high proportionality of biodiesel fatty acid methyl esters (FAMEs) profile with its CN is very appealing to develop straightforward and inexpensive computerized tools for biodiesel CN estimation. Unfortunately, correlating the chemical structure of biodiesel to its CN using conventional statistical and mathematical approaches is very difficult. To solve this issue, partial least square (PLS) adapted by artificial neural network (ANN) was introduced and examined herein as an innovative approach for the exact estimation of biodiesel CN from its FAMEs profile. In the proposed approach, ANN paradigm was used for modeling the inner relation between the input and the output PLS score vectors. In addition, the capability of the developed method in predicting the biodiesel CN was compared with the basal PLS method. The accuracy of the developed approaches for computing the biodiesel CN was assessed using three statistical criteria, i.e., coefficient of determination (R"2), mean-squared error (MSE), and percentage error (PE). The ANN-adapted PLS method predicted the biodiesel CN with an R"2 value higher than 0.99 demonstrating the fidelity of the developed model over the classical PLS method with a markedly lower R"2 value of about 0.85. In order to facilitate the use of the proposed model, an easy-to-use computer program was also developed on the basis of ANN-adapted PLS

Auto-Baecklund transformation and similarity reductions to the variable coefficients variant Boussinesq system

Energy Technology Data Exchange (ETDEWEB)

Moussa, M.H.M. [Department of Mathematic, Faculty of Education, Ain Shams University, Roxy, Hiliopolis, Cairo (Egypt)], E-mail: m_h_m_moussa@yahoo.com; El Shikh, Rehab M. [Department of Mathematic, Faculty of Education, Ain Shams University, Roxy, Hiliopolis, Cairo (Egypt)

2008-02-25

Based on the closed connections among the homogeneous balance (HB) method, Weiss-Tabor-Carneval (WTC) method and Clarkson-Kruskal (CK) method, we study Baecklund transformation and similarity reductions of the variable coefficients variant Boussinesq system. In the meantime, new exact solutions also are found.

Hydraulic Soft Yaw System Load Reduction and Prototype Results

DEFF Research Database (Denmark)

Stubkier, Søren; Pedersen, Henrik C.; Markussen, Kristian

2013-01-01

Introducing a hydraulic soft yaw concept for wind turbines leads to significant load reductions in the wind turbine structure. The soft yaw system operates as a shock absorption system on a car, hence absorbing the loading from turbulent wind conditions instead of leading them into the stiff wind...... turbine structure. Results presented shows fatigue reductions of up to 40% and ultimate load reduction of up to 19%. The ultimate load reduction increases even more when the over load protection system in the hydraulic soft yaw system is introduced and results show how the exact extreme load cut off...... operates. Further it is analyzed how the soft yaw system influence the power production of the turbine. It is shown that the influence is minimal, but at larger yaw errors the effect is possitive. Due to the implemeted functions in the hydraulic soft yaw system such as even load distribution on the pinions...

Novel correlations in two dimensions: Some exact solutions

International Nuclear Information System (INIS)

Murthy, M.V.; Bhaduri, R.K.; Sen, D.

1996-01-01

We construct a new many-body Hamiltonian with two- and three-body interactions in two space dimensions and obtain its exact many-body ground state for an arbitrary number of particles. This ground state has a novel pairwise correlation. A class of exact solutions for the excited states is also found. These excited states display an energy spectrum similar to the Calogero-Sutherland model in one dimension. The model reduces to an analog of the well-known trigonometric Sutherland model when projected on to a circular ring. copyright 1996 The American Physical Society

Exact results for integrable asymptotically-free field theories

CERN Document Server

Evans, J M; Evans, Jonathan M; Hollowood, Timothy J

1995-01-01

An account is given of a technique for testing the equivalence between an exact factorizable S-matrix and an asymptotically-free Lagrangian field theory in two space-time dimensions. The method provides a way of resolving CDD ambiguities in the S-matrix and it also allows for an exact determination of the physical mass in terms of the Lambda parameter of perturbation theory. The results for various specific examples are summarized. (To appear in the Proceedings of the Conference on Recent Developments in Quantum Field Theory and Statistical Mechanics, ICTP, Trieste, Easter 1995).

Accelerating exact schedulability analysis for fixed-priority pre-emptive scheduling

NARCIS (Netherlands)

Hang, Y.; Jiale, Z.; Keskin, U.; Bril, R.J.

2010-01-01

The schedulability analysis for fixed-priority preemptive scheduling (FPPS) plays a significant role in the real-time systems domain. The so-called Hyperplanes Exact Test (HET) [1] is an example of an exact schedulability test for FPPS. In this paper, we aim at improving the efficiency of HET by

Exact WKB analysis and cluster algebras

International Nuclear Information System (INIS)

Iwaki, Kohei; Nakanishi, Tomoki

2014-01-01

We develop the mutation theory in the exact WKB analysis using the framework of cluster algebras. Under a continuous deformation of the potential of the Schrödinger equation on a compact Riemann surface, the Stokes graph may change the topology. We call this phenomenon the mutation of Stokes graphs. Along the mutation of Stokes graphs, the Voros symbols, which are monodromy data of the equation, also mutate due to the Stokes phenomenon. We show that the Voros symbols mutate as variables of a cluster algebra with surface realization. As an application, we obtain the identities of Stokes automorphisms associated with periods of cluster algebras. The paper also includes an extensive introduction of the exact WKB analysis and the surface realization of cluster algebras for nonexperts. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Cluster algebras in mathematical physics’. (paper)

An evaluation of the multi-state node networks reliability using the traditional binary-state networks reliability algorithm

International Nuclear Information System (INIS)

Yeh, W.-C.

2003-01-01

A system where the components and system itself are allowed to have a number of performance levels is called the Multi-state system (MSS). A multi-state node network (MNN) is a generalization of the MSS without satisfying the flow conservation law. Evaluating the MNN reliability arises at the design and exploitation stage of many types of technical systems. Up to now, the known existing methods can only evaluate a special MNN reliability called the multi-state node acyclic network (MNAN) in which no cyclic is allowed. However, no method exists for evaluating the general MNN reliability. The main purpose of this article is to show first that each MNN reliability can be solved using any the traditional binary-state networks (TBSN) reliability algorithm with a special code for the state probability. A simple heuristic SDP algorithm based on minimal cuts (MC) for estimating the MNN reliability is presented as an example to show how the TBSN reliability algorithm is revised to solve the MNN reliability problem. To the author's knowledge, this study is the first to discuss the relationships between MNN and TBSN and also the first to present methods to solve the exact and approximated MNN reliability. One example is illustrated to show how the exact MNN reliability is obtained using the proposed algorithm

Heterotic reduction of Courant algebroid connections and Einstein–Hilbert actions

Energy Technology Data Exchange (ETDEWEB)

Jurčo, Branislav, E-mail: jurco@karlin.mff.cuni.cz [Mathematical Institute, Faculty of Mathematics and Physics, Charles University, Prague 186 75 (Czech Republic); Vysoký, Jan, E-mail: vysoky@math.cas.cz [Institute of Mathematics of the Czech Academy of Sciences, Žitná 25, Prague 115 67 (Czech Republic); Mathematical Sciences Institute, Australian National University, Acton ACT 2601 (Australia)

2016-08-15

We discuss Levi-Civita connections on Courant algebroids. We define an appropriate generalization of the curvature tensor and compute the corresponding scalar curvatures in the exact and heterotic case, leading to generalized (bosonic) Einstein–Hilbert type of actions known from supergravity. In particular, we carefully analyze the process of the reduction for the generalized metric, connection, curvature tensor and the scalar curvature.

Heterotic reduction of Courant algebroid connections and Einstein–Hilbert actions

International Nuclear Information System (INIS)

Jurčo, Branislav; Vysoký, Jan

2016-01-01

We discuss Levi-Civita connections on Courant algebroids. We define an appropriate generalization of the curvature tensor and compute the corresponding scalar curvatures in the exact and heterotic case, leading to generalized (bosonic) Einstein–Hilbert type of actions known from supergravity. In particular, we carefully analyze the process of the reduction for the generalized metric, connection, curvature tensor and the scalar curvature.

Recent results for random networks of automata

International Nuclear Information System (INIS)

Flyvbjerg, H.

1987-05-01

After a very brief historical and contextual introduction to random networks of automata we review recent numerical and analytical results. Open questions and unsolved problems are pointed out and discussed. One such question is also answered: it is shown that the size of the stable core can be used as order parameter for a transition between phases of frozen and chaotic network behavior. A mean-field-like but exact selfconsistency equation for the size of the stable core is given. A new derivation of critical parameter values follows from it. (orig.)

A Recurrent Neural Network for Nonlinear Fractional Programming

Directory of Open Access Journals (Sweden)

Quan-Ju Zhang

2012-01-01

Full Text Available This paper presents a novel recurrent time continuous neural network model which performs nonlinear fractional optimization subject to interval constraints on each of the optimization variables. The network is proved to be complete in the sense that the set of optima of the objective function to be minimized with interval constraints coincides with the set of equilibria of the neural network. It is also shown that the network is primal and globally convergent in the sense that its trajectory cannot escape from the feasible region and will converge to an exact optimal solution for any initial point being chosen in the feasible interval region. Simulation results are given to demonstrate further the global convergence and good performance of the proposing neural network for nonlinear fractional programming problems with interval constraints.

Exact solutions to the Mo-Papas and Landau-Lifshitz equations

Science.gov (United States)

Rivera, R.; Villarroel, D.

2002-10-01

Two exact solutions of the Mo-Papas and Landau-Lifshitz equations for a point charge in classical electrodynamics are presented here. Both equations admit as an exact solution the motion of a charge rotating with constant speed in a circular orbit. These equations also admit as an exact solution the motion of two identical charges rotating with constant speed at the opposite ends of a diameter. These exact solutions allow one to obtain, starting from the equation of motion, a definite formula for the rate of radiation. In both cases the rate of radiation can also be obtained, with independence of the equation of motion, from the well known fields of a point charge, that is, from the Maxwell equations. The rate of radiation obtained from the Mo-Papas equation in the one-charge case coincides with the rate of radiation that comes from the Maxwell equations; but in the two-charge case the results do not coincide. On the other hand, the rate of radiation obtained from the Landau-Lifshitz equation differs from the one that follows from the Maxwell equations in both the one-charge and two-charge cases. This last result does not support a recent statement by Rohrlich in favor of considering the Landau-Lifshitz equation as the correct and exact equation of motion for a point charge in classical electrodynamics.

Exact solutions to the Mo-Papas and Landau-Lifshitz equations

International Nuclear Information System (INIS)

Rivera, R.; Villarroel, D.

2002-01-01

Two exact solutions of the Mo-Papas and Landau-Lifshitz equations for a point charge in classical electrodynamics are presented here. Both equations admit as an exact solution the motion of a charge rotating with constant speed in a circular orbit. These equations also admit as an exact solution the motion of two identical charges rotating with constant speed at the opposite ends of a diameter. These exact solutions allow one to obtain, starting from the equation of motion, a definite formula for the rate of radiation. In both cases the rate of radiation can also be obtained, with independence of the equation of motion, from the well known fields of a point charge, that is, from the Maxwell equations. The rate of radiation obtained from the Mo-Papas equation in the one-charge case coincides with the rate of radiation that comes from the Maxwell equations; but in the two-charge case the results do not coincide. On the other hand, the rate of radiation obtained from the Landau-Lifshitz equation differs from the one that follows from the Maxwell equations in both the one-charge and two-charge cases. This last result does not support a recent statement by Rohrlich in favor of considering the Landau-Lifshitz equation as the correct and exact equation of motion for a point charge in classical electrodynamics

Exact axially symmetric galactic dynamos

Science.gov (United States)

Henriksen, R. N.; Woodfinden, A.; Irwin, J. A.

2018-05-01

We give a selection of exact dynamos in axial symmetry on a galactic scale. These include some steady examples, at least one of which is wholly analytic in terms of simple functions and has been discussed elsewhere. Most solutions are found in terms of special functions, such as associated Lagrange or hypergeometric functions. They may be considered exact in the sense that they are known to any desired accuracy in principle. The new aspect developed here is to present scale-invariant solutions with zero resistivity that are self-similar in time. The time dependence is either a power law or an exponential factor, but since the geometry of the solution is self-similar in time we do not need to fix a time to study it. Several examples are discussed. Our results demonstrate (without the need to invoke any other mechanisms) X-shaped magnetic fields and (axially symmetric) magnetic spiral arms (both of which are well observed and documented) and predict reversing rotation measures in galaxy haloes (now observed in the CHANG-ES sample) as well as the fact that planar magnetic spirals are lifted into the galactic halo.

Statistical mechanics of polymer networks of any topology

International Nuclear Information System (INIS)

Duplantier, B.

1989-01-01

The statistical mechanics is considered of any polymer network with a prescribed topology, in dimension d, which was introduced previously. The basic direct renormalization theory of the associated continuum model is established. It has a very simple multiplicative structure in terms of the partition functions of the star polymers constituting the vertices of the network. A calculation is made to O(ε 2 ), where d = 4 -ε, of the basic critical dimensions σ L associated with any L=leg vertex (L ≥ 1). From this infinite series of critical exponents, any topology-dependent critical exponent can be derived. This is applied to the configuration exponent γ G of any network G to O(ε 2 ), including L-leg star polymers. The infinite sets of contact critical exponents θ between multiple points of polymers or between the cores of several star polymers are also deduced. As a particular case, the three exponents θ 0 , θ 1 , θ 2 calculated by des Cloizeaux by field-theoretic methods are recovered. The limiting exact logarithmic laws are derived at the upper critical dimension d = 4. The results are generalized to the series of topological exponents of polymer networks near a surface and of tricritical polymers at the Θ-point. Intersection properties of networks of random walks can be studied similarly. The above factorization theory of the partition function of any polymer network over its constituting L-vertices also applies to two dimensions, where it can be related to conformal invariance. The basic critical exponents σ L and thus any topological polymer exponents are then exactly known. Principal results published elsewhere are recalled

Exact deconstruction of the 6D (2,0) theory

Energy Technology Data Exchange (ETDEWEB)

Hayling, J.; Papageorgakis, C. [Queen Mary Univ. of London (United Kingdom). CRST and School of Physics and Astronomy; Pomoni, E. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Rodriguez-Gomez, D. [Oviedo Univ. (Spain). Dept. of Physics

2017-06-15

The dimensional-deconstruction prescription of Arkani-Hamed, Cohen, Kaplan, Karch and Motl provides a mechanism for recovering the A-type (2,0) theories on T{sup 2}, starting from a four-dimensional N=2 circular-quiver theory. We put this conjecture to the test using two exact-counting arguments: In the decompactification limit, we compare the Higgs-branch Hilbert series of the 4D N=2 quiver to the ''half-BPS'' limit of the (2,0) superconformal index. We also compare the full partition function for the 4D quiver on S{sup 4} to the (2,0) partition function on S{sup 4} x T{sup 2}. In both cases we find exact agreement. The partition function calculation sets up a dictionary between exact results in 4D and 6D.

Reduction of water losses by rehabilitation of water distribution network.

Science.gov (United States)

Güngör, Mahmud; Yarar, Ufuk; Firat, Mahmut

2017-09-11

Physical or real losses may be indicated as the most important component of the water losses occurring in a water distribution network (WDN). The objective of this study is to examine the effects of piping material management and network rehabilitation on the physical water losses and water losses management in a WDN. For this aim, the Denizli WDN consisting of very old pipes that have exhausted their economic life is selected as the study area. The fact that the current network is old results in the decrease of pressure strength, increase of failure intensity, and inefficient use of water resources thus leading to the application of the rehabilitation program. In Denizli, network renewal works have been carried out since the year 2009 under the rehabilitation program. It was determined that the failure rate at regions where network renewal constructions have been completed decreased down to zero level. Renewal of piping material enables the minimization of leakage losses as well as the failure rate. On the other hand, the system rehabilitation has the potential to amortize itself in a very short amount of time if the initial investment cost of network renewal is considered along with the operating costs of the old and new systems, as well as water loss costs. As a result, it can be stated that renewal of piping material in water distribution systems, enhancement of the physical properties of the system, provide significant contributions such as increase of water and energy efficiency and more effective use of resources.

New exact wave solutions for Hirota equation

Indian Academy of Sciences (India)

2Department of Engineering Sciences, Faculty of Technology and Engineering,. University ... of nonlinear partial differential equations (NPDEs) in mathematical physics. Keywords. ... This method has been successfully applied to obtain exact.

Optimising stochastic trajectories in exact quantum jump approaches of interacting systems

International Nuclear Information System (INIS)

Lacroix, D.

2004-11-01

The standard methods used to substitute the quantum dynamics of two interacting systems by a quantum jump approach based on the Stochastic Schroedinger Equation (SSE) are described. It turns out that for a given situation, there exists an infinite number of SSE reformulation. This fact is used to propose general strategies to optimise the stochastic paths in order to reduce the statistical fluctuations. In this procedure, called the 'adaptative noise method', a specific SSE is obtained for which the noise depends explicitly on both the initial state and on the properties of the interaction Hamiltonian. It is also shown that this method can be further improved by the introduction of a mean-field dynamics. The different optimisation procedures are illustrated quantitatively in the case of interacting spins. A significant reduction of the statistical fluctuations is obtained. Consequently, a much smaller number of trajectories is needed to accurately reproduce the exact dynamics as compared to the standard SSE method. (author)

TVT-Exact and midurethral sling (SLING-IUFT) operative procedures: a randomized study.

Science.gov (United States)

Aniuliene, Rosita; Aniulis, Povilas; Skaudickas, Darijus

2015-01-01

The aim of the study is to compare results, effectiveness and complications of TVT exact and midurethral sling (SLING-IUFT) operations in the treatment of female stress urinary incontinence (SUI). A single center nonblind, randomized study of women with SUI who were randomized to TVT-Exact and SLING-IUFT was performed by one surgeon from April 2009 to April 2011. SUI was diagnosed on coughing and Valsalva test and urodynamics (cystometry and uroflowmetry) were assessed before operation and 1 year after surgery. This was a prospective randomized study. The follow up period was 12 months. 76 patients were operated using the TVT-Exact operation and 78 patients - using the SLING-IUFT operation. There was no statistically significant differences between groups for BMI, parity, menopausal status and prolapsed stage (no patients had cystocele greater than stage II). Mean operative time was significantly shorter in the SLING-IUFT group (19 ± 5.6 min.) compared with the TVT-Exact group (27 ± 7.1 min.). There were statistically significant differences in the effectiveness of both procedures: TVT-Exact - at 94.5% and SLING-IUFT - at 61.2% after one year. Hospital stay was statistically significantly shorter in the SLING-IUFT group (1. 2 ± 0.5 days) compared with the TVT-Exact group (3.5 ± 1.5 days). Statistically significantly fewer complications occurred in the SLING-IUFT group. the TVT-Exact and SLING-IUFT operations are both effective for surgical treatment of female stress urinary incontinence. The SLING-IUFT involved a shorter operation time and lower complications rate., the TVT-Exact procedure had statistically significantly more complications than the SLING-IUFT operation, but a higher effectiveness.

Exact solutions to quadratic gravity

Czech Academy of Sciences Publication Activity Database

Pravda, Vojtěch; Pravdová, Alena; Podolský, J.; Švarc, J.

2017-01-01

Roč. 95, č. 8 (2017), č. článku 084025. ISSN 2470-0010 R&D Projects: GA ČR GB14-37086G Institutional support: RVO:67985840 Keywords : quadratic gravity * exact solutions * Kundt spacetimes Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 4.568, year: 2016 https://journals.aps.org/prd/abstract/10.1103/PhysRevD.95.084025

Exact solutions to quadratic gravity

Czech Academy of Sciences Publication Activity Database

Pravda, Vojtěch; Pravdová, Alena; Podolský, J.; Švarc, J.

2017-01-01

Roč. 95, č. 8 (2017), č. článku 084025. ISSN 2470-0010 R&D Projects: GA ČR GB14-37086G Institutional support: RVO:67985840 Keywords : quadratic gravity * exact solutions * Kundt spacetimes Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 4.568, year: 2016 https://journals. aps .org/prd/abstract/10.1103/PhysRevD.95.084025

Model checking exact cost for attack scenarios

DEFF Research Database (Denmark)

Aslanyan, Zaruhi; Nielson, Flemming

2017-01-01

Attack trees constitute a powerful tool for modelling security threats. Many security analyses of attack trees can be seamlessly expressed as model checking of Markov Decision Processes obtained from the attack trees, thus reaping the benefits of a coherent framework and a mature tool support....... However, current model checking does not encompass the exact cost analysis of an attack, which is standard for attack trees. Our first contribution is the logic erPCTL with cost-related operators. The extended logic allows to analyse the probability of an event satisfying given cost bounds and to compute...... the exact cost of an event. Our second contribution is the model checking algorithm for erPCTL. Finally, we apply our framework to the analysis of attack trees....

Exact nonparametric confidence bands for the survivor function.

Science.gov (United States)

Matthews, David

2013-10-12

A method to produce exact simultaneous confidence bands for the empirical cumulative distribution function that was first described by Owen, and subsequently corrected by Jager and Wellner, is the starting point for deriving exact nonparametric confidence bands for the survivor function of any positive random variable. We invert a nonparametric likelihood test of uniformity, constructed from the Kaplan-Meier estimator of the survivor function, to obtain simultaneous lower and upper bands for the function of interest with specified global confidence level. The method involves calculating a null distribution and associated critical value for each observed sample configuration. However, Noe recursions and the Van Wijngaarden-Decker-Brent root-finding algorithm provide the necessary tools for efficient computation of these exact bounds. Various aspects of the effect of right censoring on these exact bands are investigated, using as illustrations two observational studies of survival experience among non-Hodgkin's lymphoma patients and a much larger group of subjects with advanced lung cancer enrolled in trials within the North Central Cancer Treatment Group. Monte Carlo simulations confirm the merits of the proposed method of deriving simultaneous interval estimates of the survivor function across the entire range of the observed sample. This research was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada. It was begun while the author was visiting the Department of Statistics, University of Auckland, and completed during a subsequent sojourn at the Medical Research Council Biostatistics Unit in Cambridge. The support of both institutions, in addition to that of NSERC and the University of Waterloo, is greatly appreciated.

Exact Finite Differences. The Derivative on Non Uniformly Spaced Partitions

Directory of Open Access Journals (Sweden)

Armando Martínez-Pérez

2017-10-01

Full Text Available We define a finite-differences derivative operation, on a non uniformly spaced partition, which has the exponential function as an exact eigenvector. We discuss some properties of this operator and we propose a definition for the components of a finite-differences momentum operator. This allows us to perform exact discrete calculations.

Exact Boundary Controllability of Electromagnetic Fields in a General Region

International Nuclear Information System (INIS)

Eller, M. M.; Masters, J. E.

2002-01-01

We prove exact controllability for Maxwell's system with variable coefficients in a bounded domain by a current flux in the boundary. The proof relies on a duality argument which reduces the proof of exact controllability to the proof of continuous observability for the homogeneous adjoint system. There is no geometric restriction imposed on the domain

New Exact Solutions for (1 + 1)-Dimensional Dispersion-Less System

International Nuclear Information System (INIS)

Naranmandula; Hu Jianguo; Bao Gang; Tubuxin

2008-01-01

Using improved homogeneous balance method, we obtain complex function form new exact solutions for the (1+1)-dimensional dispersion-less system, and from the exact solutions we derive real function form solution of the field u. Based on this real function form solution, we find some new interesting coherent structures by selecting arbitrary functions appropriately

Hybrid stochastic simplifications for multiscale gene networks

Directory of Open Access Journals (Sweden)

Debussche Arnaud

2009-09-01

Full Text Available Abstract Background Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. Results We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion 123 which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Conclusion Hybrid simplifications can be used for onion-like (multi-layered approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.

Unifying neural-network quantum states and correlator product states via tensor networks

Science.gov (United States)

Clark, Stephen R.

2018-04-01

Correlator product states (CPS) are a powerful and very broad class of states for quantum lattice systems whose (unnormalised) amplitudes in a fixed basis can be sampled exactly and efficiently. They work by gluing together states of overlapping clusters of sites on the lattice, called correlators. Recently Carleo and Troyer (2017 Science 355 602) introduced a new type sampleable ansatz called neural-network quantum states (NQS) that are inspired by the restricted Boltzmann model used in machine learning. By employing the formalism of tensor networks we show that NQS are a special form of CPS with novel properties. Diagramatically a number of simple observations become transparent. Namely, that NQS are CPS built from extensively sized GHZ-form correlators making them uniquely unbiased geometrically. The appearance of GHZ correlators also relates NQS to canonical polyadic decompositions of tensors. Another immediate implication of the NQS equivalence to CPS is that we are able to formulate exact NQS representations for a wide range of paradigmatic states, including superpositions of weighed-graph states, the Laughlin state, toric code states, and the resonating valence bond state. These examples reveal the potential of using higher dimensional hidden units and a second hidden layer in NQS. The major outlook of this study is the elevation of NQS to correlator operators allowing them to enhance conventional well-established variational Monte Carlo approaches for strongly correlated fermions.

An Exact Confidence Region in Multivariate Calibration

OpenAIRE

Mathew, Thomas; Kasala, Subramanyam

1994-01-01

In the multivariate calibration problem using a multivariate linear model, an exact confidence region is constructed. It is shown that the region is always nonempty and is invariant under nonsingular transformations.

Exact geodesic distances in FLRW spacetimes

Science.gov (United States)

Cunningham, William J.; Rideout, David; Halverson, James; Krioukov, Dmitri

2017-11-01

Geodesics are used in a wide array of applications in cosmology and astrophysics. However, it is not a trivial task to efficiently calculate exact geodesic distances in an arbitrary spacetime. We show that in spatially flat (3 +1 )-dimensional Friedmann-Lemaître-Robertson-Walker (FLRW) spacetimes, it is possible to integrate the second-order geodesic differential equations, and derive a general method for finding both timelike and spacelike distances given initial-value or boundary-value constraints. In flat spacetimes with either dark energy or matter, whether dust, radiation, or a stiff fluid, we find an exact closed-form solution for geodesic distances. In spacetimes with a mixture of dark energy and matter, including spacetimes used to model our physical universe, there exists no closed-form solution, but we provide a fast numerical method to compute geodesics. A general method is also described for determining the geodesic connectedness of an FLRW manifold, provided only its scale factor.

Hardware-Efficient On-line Learning through Pipelined Truncated-Error Backpropagation in Binary-State Networks

Directory of Open Access Journals (Sweden)

Hesham Mostafa

2017-09-01

Full Text Available Artificial neural networks (ANNs trained using backpropagation are powerful learning architectures that have achieved state-of-the-art performance in various benchmarks. Significant effort has been devoted to developing custom silicon devices to accelerate inference in ANNs. Accelerating the training phase, however, has attracted relatively little attention. In this paper, we describe a hardware-efficient on-line learning technique for feedforward multi-layer ANNs that is based on pipelined backpropagation. Learning is performed in parallel with inference in the forward pass, removing the need for an explicit backward pass and requiring no extra weight lookup. By using binary state variables in the feedforward network and ternary errors in truncated-error backpropagation, the need for any multiplications in the forward and backward passes is removed, and memory requirements for the pipelining are drastically reduced. Further reduction in addition operations owing to the sparsity in the forward neural and backpropagating error signal paths contributes to highly efficient hardware implementation. For proof-of-concept validation, we demonstrate on-line learning of MNIST handwritten digit classification on a Spartan 6 FPGA interfacing with an external 1Gb DDR2 DRAM, that shows small degradation in test error performance compared to an equivalently sized binary ANN trained off-line using standard back-propagation and exact errors. Our results highlight an attractive synergy between pipelined backpropagation and binary-state networks in substantially reducing computation and memory requirements, making pipelined on-line learning practical in deep networks.

Hardware-Efficient On-line Learning through Pipelined Truncated-Error Backpropagation in Binary-State Networks.

Science.gov (United States)

Mostafa, Hesham; Pedroni, Bruno; Sheik, Sadique; Cauwenberghs, Gert

2017-01-01

Artificial neural networks (ANNs) trained using backpropagation are powerful learning architectures that have achieved state-of-the-art performance in various benchmarks. Significant effort has been devoted to developing custom silicon devices to accelerate inference in ANNs. Accelerating the training phase, however, has attracted relatively little attention. In this paper, we describe a hardware-efficient on-line learning technique for feedforward multi-layer ANNs that is based on pipelined backpropagation. Learning is performed in parallel with inference in the forward pass, removing the need for an explicit backward pass and requiring no extra weight lookup. By using binary state variables in the feedforward network and ternary errors in truncated-error backpropagation, the need for any multiplications in the forward and backward passes is removed, and memory requirements for the pipelining are drastically reduced. Further reduction in addition operations owing to the sparsity in the forward neural and backpropagating error signal paths contributes to highly efficient hardware implementation. For proof-of-concept validation, we demonstrate on-line learning of MNIST handwritten digit classification on a Spartan 6 FPGA interfacing with an external 1Gb DDR2 DRAM, that shows small degradation in test error performance compared to an equivalently sized binary ANN trained off-line using standard back-propagation and exact errors. Our results highlight an attractive synergy between pipelined backpropagation and binary-state networks in substantially reducing computation and memory requirements, making pipelined on-line learning practical in deep networks.

A unified form of exact-MSR codes via product-matrix frameworks

KAUST Repository

Lin, Sian Jheng

2015-02-01

Regenerating codes represent a class of block codes applicable for distributed storage systems. The [n, k, d] regenerating code has data recovery capability while possessing arbitrary k out of n code fragments, and supports the capability for code fragment regeneration through the use of other arbitrary d fragments, for k ≤ d ≤ n - 1. Minimum storage regenerating (MSR) codes are a subset of regenerating codes containing the minimal size of each code fragment. The first explicit construction of MSR codes that can perform exact regeneration (named exact-MSR codes) for d ≥ 2k - 2 has been presented via a product-matrix framework. This paper addresses some of the practical issues on the construction of exact-MSR codes. The major contributions of this paper include as follows. A new product-matrix framework is proposed to directly include all feasible exact-MSR codes for d ≥ 2k - 2. The mechanism for a systematic version of exact-MSR code is proposed to minimize the computational complexities for the process of message-symbol remapping. Two practical forms of encoding matrices are presented to reduce the size of the finite field.

A unified form of exact-MSR codes via product-matrix frameworks

KAUST Repository

Lin, Sian Jheng; Chung, Weiho; Han, Yunghsiangsam; Al-Naffouri, Tareq Y.

2015-01-01

Regenerating codes represent a class of block codes applicable for distributed storage systems. The [n, k, d] regenerating code has data recovery capability while possessing arbitrary k out of n code fragments, and supports the capability for code fragment regeneration through the use of other arbitrary d fragments, for k ≤ d ≤ n - 1. Minimum storage regenerating (MSR) codes are a subset of regenerating codes containing the minimal size of each code fragment. The first explicit construction of MSR codes that can perform exact regeneration (named exact-MSR codes) for d ≥ 2k - 2 has been presented via a product-matrix framework. This paper addresses some of the practical issues on the construction of exact-MSR codes. The major contributions of this paper include as follows. A new product-matrix framework is proposed to directly include all feasible exact-MSR codes for d ≥ 2k - 2. The mechanism for a systematic version of exact-MSR code is proposed to minimize the computational complexities for the process of message-symbol remapping. Two practical forms of encoding matrices are presented to reduce the size of the finite field.

Decentralized Network Interdiction Games

Science.gov (United States)

2015-12-31

preventing attacks on critical computer communi- cations networks. Such problems have traditionally been looked at from a centralized decision-maker’s point...is critical from a military perspective to understand the cause and remedies for such efficiency loss. This project is exactly motivated and designed... utilitarian ; that is, θc(x1, . . . , xF ) := ∑ f∈F θf (xf , x−f ). A commonly used measure of Nash equilibria’s inefficiency is the price of anarchy

Exact analytic solutions generated from stipulated Morse and trigonometric Scarf potentials

International Nuclear Information System (INIS)

Saikia, N; Ahmed, S A S

2011-01-01

The extended transformation method has been applied to the exactly solvable stipulated Morse potential and trigonometric Scarf potential, to generate a set of exactly solvable quantum systems (QSs) in any chosen dimension. Bound state solutions of the exactly solvable potentials are given. The generated QSs are generally of Sturmian form. We also report a system case-specific regrouping technique to convert a Sturmian QS to a normal QS. A second-order application of the transformation method is given. The normalizability of the generated QSs is generally given in Sturmian form.

Exact ground and excited states of an antiferromagnetic quantum spin model

International Nuclear Information System (INIS)

Bose, I.

1989-08-01

A quasi-one-dimensional spin model which consists of a chain of octahedra of spins has been suggested for which a certain parameter regime of the Hamiltonian, the ground state, can be written down exactly. The ground state is highly degenerate and can be other than a singlet. Also, several excited states can be constructed exactly. The ground state is a local RVB state for which resonance is confined to rings of spins. Some exact numerical results for an octahedron of spins have also been reported. (author). 16 refs, 2 figs, 1 tab

Corollary from the Exact Expression for Enthalpy of Vaporization

OpenAIRE

A. A. Sobko

2011-01-01

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 paramet...

Exact Maxwell-Boltzmann, Bose-Einstein and Fermi-Dirac statistics

International Nuclear Information System (INIS)

Niven, Robert K.

2005-01-01

The exact Maxwell-Boltzmann (MB), Bose-Einstein (BE) and Fermi-Dirac (FD) entropies and probabilistic distributions are derived by the combinatorial method of Boltzmann, without Stirling's approximation. The new entropy measures are explicit functions of the probability and degeneracy of each state, and the total number of entities, N. By analysis of the cost of a 'binary decision', exact BE and FD statistics are shown to have profound consequences for the behaviour of quantum mechanical systems

Exact penalty results for mathematical programs with vanishing constraints

Czech Academy of Sciences Publication Activity Database

Hoheisel, T.; Kanzow, Ch.; Outrata, Jiří

2010-01-01

Roč. 72, č. 5 (2010), s. 2514-2526 ISSN 0362-546X R&D Projects: GA AV ČR IAA100750802 Institutional research plan: CEZ:AV0Z10750506 Keywords : Mathematical programs with vanishing constraints * Mathematical programs with equilibrium constraints * Exact penalization * Calmness * Subdifferential calculus * Limiting normal cone Subject RIV: BA - General Mathematics Impact factor: 1.279, year: 2010 http://library.utia.cas.cz/separaty/2010/MTR/outrata-exact penalty results for mathematical programs with vanishing constraints.pdf

Exact non-Markovian master equations for multiple qubit systems: Quantum-trajectory approach

Science.gov (United States)

Chen, Yusui; You, J. Q.; Yu, Ting

2014-11-01

A wide class of exact master equations for a multiple qubit system can be explicitly constructed by using the corresponding exact non-Markovian quantum-state diffusion equations. These exact master equations arise naturally from the quantum decoherence dynamics of qubit system as a quantum memory coupled to a collective colored noisy source. The exact master equations are also important in optimal quantum control, quantum dissipation, and quantum thermodynamics. In this paper, we show that the exact non-Markovian master equation for a dissipative N -qubit system can be derived explicitly from the statistical average of the corresponding non-Markovian quantum trajectories. We illustrated our general formulation by an explicit construction of a three-qubit system coupled to a non-Markovian bosonic environment. This multiple qubit master equation offers an accurate time evolution of quantum systems in various domains, and paves the way to investigate the memory effect of an open system in a non-Markovian regime without any approximation.

Study of coupled nonlinear partial differential equations for finding exact analytical solutions.

Science.gov (United States)

Khan, Kamruzzaman; Akbar, M Ali; Koppelaar, H

2015-07-01

Exact solutions of nonlinear partial differential equations (NPDEs) are obtained via the enhanced (G'/G)-expansion method. The method is subsequently applied to find exact solutions of the Drinfel'd-Sokolov-Wilson (DSW) equation and the (2+1)-dimensional Painlevé integrable Burgers (PIB) equation. The efficiency of this method for finding these exact solutions is demonstrated. The method is effective and applicable for many other NPDEs in mathematical physics.

Exact Slater integrals

International Nuclear Information System (INIS)

Golden, L.B.

1968-01-01

In atomic structure calculations, one has to evaluate the Slater integrals. In the present program, the authors evaluate exactly the Slater integral when hydrogenic wave functions are used for the bound-state orbitals. When hydrogenic wave functions are used, the Slater integrals involve integrands which can be written in the form of a product of an exponential, exp(ax) and a known analytic polynomial function, f(x). By repeated partial integration such an integral can be expressed in terms of a finite series involving the exponential, the polynomial function and its derivatives. PL/1-FORMAC has a built-in subroutine that will analytically find the derivatives of any multinomial. Thus, the finite series and hence the Slater integral can be evaluated analytically. (Auth.)

Using Equation-Free Computation to Accelerate Network-Free Stochastic Simulation of Chemical Kinetics.

Science.gov (United States)

Lin, Yen Ting; Chylek, Lily A; Lemons, Nathan W; Hlavacek, William S

2018-06-21

The chemical kinetics of many complex systems can be concisely represented by reaction rules, which can be used to generate reaction events via a kinetic Monte Carlo method that has been termed network-free simulation. Here, we demonstrate accelerated network-free simulation through a novel approach to equation-free computation. In this process, variables are introduced that approximately capture system state. Derivatives of these variables are estimated using short bursts of exact stochastic simulation and finite differencing. The variables are then projected forward in time via a numerical integration scheme, after which a new exact stochastic simulation is initialized and the whole process repeats. The projection step increases efficiency by bypassing the firing of numerous individual reaction events. As we show, the projected variables may be defined as populations of building blocks of chemical species. The maximal number of connected molecules included in these building blocks determines the degree of approximation. Equation-free acceleration of network-free simulation is found to be both accurate and efficient.

Neural networks prove effective at NO{sub x} reduction

Energy Technology Data Exchange (ETDEWEB)

Radl, B.J. [Pegasus Technologies, Mentor, OH (United States)

2000-05-01

The virtues of the Pegasus NeuSIGHT combustion optimisation software are extolled. It has been installed at more than 25 power plants and operates mostly in closed loop control. The software uses the leading neural network technology from Computer associates. The system is said to reduce emissions of nitrogen oxides, increase plant efficiency and has the potential for saving millions of dollars in capital and operating costs. The value of the system is illustrated by case studies from three coal-fired power plants. The meaning of 'neural network' is explained.

Group Centric Networking: Addressing Information Sharing Requirements at the Tactical Edge

Science.gov (United States)

2016-04-10

Group Centric Networking: Addressing Information Sharing Requirements at the Tactical Edge Bow-Nan Cheng, Greg Kuperman, Patricia Deutsch, Logan...been a large push in the U.S. Department of Defense to move to an all Internet Protocol (IP) infrastructure, particularly on the tactical edge . IP and...lossy links, and scaling to large numbers of users. Unfortunately, these are the exact conditions military tactical edge networks must operate within

Scaling of load in communications networks.

Science.gov (United States)

Narayan, Onuttom; Saniee, Iraj

2010-09-01

We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k)∼k{-γ} , we show that the load is l(k)∼k{η} with η=γ-1 , implying that the probability distribution for the load is p(l)∼1/l{2} independent of γ . The results are obtained through scaling arguments supported by finite size scaling studies. They contradict earlier claims, but are in agreement with the exact solution for the special case of tree graphs. Results are also presented for real communications networks at the IP layer, using the latest available data. Our analysis of the data shows relatively poor power-law degree distributions as compared to the scaling of the load versus degree. This emphasizes the importance of the load in network analysis.

The simplest problem in the collective dynamics of neural networks: is synchrony stable?

International Nuclear Information System (INIS)

Timme, Marc; Wolf, Fred

2008-01-01

For spiking neural networks we consider the stability problem of global synchrony, arguably the simplest non-trivial collective dynamics in such networks. We find that even this simplest dynamical problem—local stability of synchrony—is non-trivial to solve and requires novel methods for its solution. In particular, the discrete mode of pulsed communication together with the complicated connectivity of neural interaction networks requires a non-standard approach. The dynamics in the vicinity of the synchronous state is determined by a multitude of linear operators, in contrast to a single stability matrix in conventional linear stability theory. This unusual property qualitatively depends on network topology and may be neglected for globally coupled homogeneous networks. For generic networks, however, the number of operators increases exponentially with the size of the network. We present methods to treat this multi-operator problem exactly. First, based on the Gershgorin and Perron–Frobenius theorems, we derive bounds on the eigenvalues that provide important information about the synchronization process but are not sufficient to establish the asymptotic stability or instability of the synchronous state. We then present a complete analysis of asymptotic stability for topologically strongly connected networks using simple graph-theoretical considerations. For inhibitory interactions between dissipative (leaky) oscillatory neurons the synchronous state is stable, independent of the parameters and the network connectivity. These results indicate that pulse-like interactions play a profound role in network dynamical systems, and in particular in the dynamics of biological synchronization, unless the coupling is homogeneous and all-to-all. The concepts introduced here are expected to also facilitate the exact analysis of more complicated dynamical network states, for instance the irregular balanced activity in cortical neural networks

Exactly solvable models in many-body theory

CERN Document Server

March, N H

2016-01-01

The book reviews several theoretical, mostly exactly solvable, models for selected systems in condensed states of matter, including the solid, liquid, and disordered states, and for systems of few or many bodies, both with boson, fermion, or anyon statistics. Some attention is devoted to models for quantum liquids, including superconductors and superfluids. Open problems in relativistic fields and quantum gravity are also briefly reviewed.The book ranges almost comprehensively, but concisely, across several fields of theoretical physics of matter at various degrees of correlation and at different energy scales, with relevance to molecular, solid-state, and liquid-state physics, as well as to phase transitions, particularly for quantum liquids. Mostly exactly solvable models are presented, with attention also to their numerical approximation and, of course, to their relevance for experiments.

A Simplified Network Model for Travel Time Reliability Analysis in a Road Network

Directory of Open Access Journals (Sweden)

Kenetsu Uchida

2017-01-01

Full Text Available This paper proposes a simplified network model which analyzes travel time reliability in a road network. A risk-averse driver is assumed in the simplified model. The risk-averse driver chooses a path by taking into account both a path travel time variance and a mean path travel time. The uncertainty addressed in this model is that of traffic flows (i.e., stochastic demand flows. In the simplified network model, the path travel time variance is not calculated by considering all travel time covariance between two links in the network. The path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. Numerical experiments are carried out to illustrate the applicability and validity of the proposed model. The experiments introduce the path choice behavior of a risk-neutral driver and several types of risk-averse drivers. It is shown that the mean link flows calculated by introducing the risk-neutral driver differ as a whole from those calculated by introducing several types of risk-averse drivers. It is also shown that the mean link flows calculated by the simplified network model are almost the same as the flows calculated by using the exact path travel time variance.

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).

Analysis of thin plates with holes by using exact geometrical representation within XFEM.

Science.gov (United States)

Perumal, Logah; Tso, C P; Leng, Lim Thong

2016-05-01

This paper presents analysis of thin plates with holes within the context of XFEM. New integration techniques are developed for exact geometrical representation of the holes. Numerical and exact integration techniques are presented, with some limitations for the exact integration technique. Simulation results show that the proposed techniques help to reduce the solution error, due to the exact geometrical representation of the holes and utilization of appropriate quadrature rules. Discussion on minimum order of integration order needed to achieve good accuracy and convergence for the techniques presented in this work is also included.

A Formal Approach to the Selection by Minimum Error and Pattern Method for Sensor Data Loss Reduction in Unstable Wireless Sensor Network Communications.

Science.gov (United States)

Kim, Changhwa; Shin, DongHyun

2017-05-12

There are wireless networks in which typically communications are unsafe. Most terrestrial wireless sensor networks belong to this category of networks. Another example of an unsafe communication network is an underwater acoustic sensor network (UWASN). In UWASNs in particular, communication failures occur frequently and the failure durations can range from seconds up to a few hours, days, or even weeks. These communication failures can cause data losses significant enough to seriously damage human life or property, depending on their application areas. In this paper, we propose a framework to reduce sensor data loss during communication failures and we present a formal approach to the Selection by Minimum Error and Pattern (SMEP) method that plays the most important role for the reduction in sensor data loss under the proposed framework. The SMEP method is compared with other methods to validate its effectiveness through experiments using real-field sensor data sets. Moreover, based on our experimental results and performance comparisons, the SMEP method has been validated to be better than others in terms of the average sensor data value error rate caused by sensor data loss.

Exactness of supersymmetric WKB method for translational shape invariant potentials

International Nuclear Information System (INIS)

Cheng, K M; Leung, P T; Pang, C S

2003-01-01

By examining the generic form of the superpotential of translational shape invariant potentials (TSIPs), we explicitly show the exactness of the lowest order supersymmetric WKB (SWKB) formula for TSIPs. Remarkably, our method applies to both unbroken and broken supersymmetric systems. We also demonstrate the equivalence of one-parameter and multi-parameter TSIPs, thus establishing the exactness of the SWKB formula for all TSIPs

Exactness of supersymmetric WKB method for translational shape invariant potentials

CERN Document Server

Cheng, K M; Pang, C S

2003-01-01

By examining the generic form of the superpotential of translational shape invariant potentials (TSIPs), we explicitly show the exactness of the lowest order supersymmetric WKB (SWKB) formula for TSIPs. Remarkably, our method applies to both unbroken and broken supersymmetric systems. We also demonstrate the equivalence of one-parameter and multi-parameter TSIPs, thus establishing the exactness of the SWKB formula for all TSIPs.

Inhibition delay increases neural network capacity through Stirling transform

Science.gov (United States)

Nogaret, Alain; King, Alastair

2018-03-01

Inhibitory neural networks are found to encode high volumes of information through delayed inhibition. We show that inhibition delay increases storage capacity through a Stirling transform of the minimum capacity which stabilizes locally coherent oscillations. We obtain both the exact and asymptotic formulas for the total number of dynamic attractors. Our results predict a (ln2) -N-fold increase in capacity for an N -neuron network and demonstrate high-density associative memories which host a maximum number of oscillations in analog neural devices.

Exact solution for a non-Markovian dissipative quantum dynamics.

Science.gov (United States)

Ferialdi, Luca; Bassi, Angelo

2012-04-27

We provide the exact analytic solution of the stochastic Schrödinger equation describing a harmonic oscillator interacting with a non-Markovian and dissipative environment. This result represents an arrival point in the study of non-Markovian dynamics via stochastic differential equations. It is also one of the few exactly solvable models for infinite-dimensional systems. We compute the Green's function; in the case of a free particle and with an exponentially correlated noise, we discuss the evolution of Gaussian wave functions.

Study of coupled nonlinear partial differential equations for finding exact analytical solutions

Science.gov (United States)

Khan, Kamruzzaman; Akbar, M. Ali; Koppelaar, H.

2015-01-01

Exact solutions of nonlinear partial differential equations (NPDEs) are obtained via the enhanced (G′/G)-expansion method. The method is subsequently applied to find exact solutions of the Drinfel'd–Sokolov–Wilson (DSW) equation and the (2+1)-dimensional Painlevé integrable Burgers (PIB) equation. The efficiency of this method for finding these exact solutions is demonstrated. The method is effective and applicable for many other NPDEs in mathematical physics. PMID:26587256

Throughput Analysis of Large Wireless Networks with Regular Topologies

Directory of Open Access Journals (Sweden)

Hong Kezhu

2007-01-01

Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.

Throughput Analysis of Large Wireless Networks with Regular Topologies

Directory of Open Access Journals (Sweden)

Kezhu Hong

2007-04-01

Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.

Exact coefficients for higher dimensional operators with sixteen supersymmetries

Energy Technology Data Exchange (ETDEWEB)

Chen, Wei-Ming [Department of Physics and Astronomy, National Taiwan University,Taipei 10617, Taiwan, R.O.C. (China); Huang, Yu-tin [Department of Physics and Astronomy, National Taiwan University,Taipei 10617, Taiwan, R.O.C. (China); School of Natural Sciences, Institute for Advanced Study,Princeton, NJ 08540 (United States); Wen, Congkao [INFN Sezione di Roma “Tor Vergata' ,Via della Ricerca Scientifica, 00133 Roma (Italy)

2015-09-15

We consider constraints on higher-dimensional operators for supersymmetric effective field theories. In four dimensions with maximal supersymmetry and SU(4) R-symmetry, we demonstrate that the coefficients of abelian operators F{sup n} with MHV helicity configurations must satisfy a recursion relation, and are completely determined by that of F{sup 4}. As the F{sup 4} coefficient is known to be one-loop exact, this allows us to derive exact coefficients for all such operators. We also argue that the results are consistent with the SL(2,Z) duality symmetry. Breaking SU(4) to Sp(4), in anticipation for the Coulomb branch effective action, we again find an infinite class of operators whose coefficients are determined exactly. We also consider three-dimensional N=8 as well as six-dimensional N=(2,0),(1,0) and (1,1) theories. In all cases, we demonstrate that the coefficient of dimension-six operator must be proportional to the square of that of dimension-four.

Smooth function approximation using neural networks.

Science.gov (United States)

Ferrari, Silvia; Stengel, Robert F

2005-01-01

An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.

Estimation of Maximum Allowable PV Connection to LV Residential Power Networks

DEFF Research Database (Denmark)

Demirok, Erhan; Sera, Dezso; Teodorescu, Remus

2011-01-01

Maximum photovoltaic (PV) hosting capacity of low voltage (LV) power networks is mainly restricted by either thermal limits of network components or grid voltage quality resulted from high penetration of distributed PV systems. This maximum hosting capacity may be lower than the available solar...... potential of geographic area due to power network limitations even though all rooftops are fully occupied with PV modules. Therefore, it becomes more of an issue to know what exactly limits higher PV penetration level and which solutions should be engaged efficiently such as over sizing distribution...

Parameter learning in MTE networks using incomplete data

DEFF Research Database (Denmark)

Fernández, Antonio; Langseth, Helge; Nielsen, Thomas Dyhre

a considerable computational burden as well as the inability to handle missing values in the training data. In this paper we describe an EM-based algorithm for learning the maximum likelihood parameters of an MTE network when confronted with incomplete data. In order to overcome the computational difficulties we......Bayesian networks with mixtures of truncated exponentials (MTEs) are gaining popularity as a flexible modelling framework for hybrid domains. MTEs support efficient and exact inference algorithms, but estimating an MTE from data has turned out to be a difficult task. Current methods suffer from...

Exact results relating spin-orbit interactions in two-dimensional strongly correlated systems

Science.gov (United States)

Kucska, Nóra; Gulácsi, Zsolt

2018-06-01

A 2D square, two-bands, strongly correlated and non-integrable system is analysed exactly in the presence of many-body spin-orbit interactions via the method of Positive Semidefinite Operators. The deduced exact ground states in the high concentration limit are strongly entangled, and given by the spin-orbit coupling are ferromagnetic and present an enhanced carrier mobility, which substantially differs for different spin projections. The described state emerges in a restricted parameter space region, which however is clearly accessible experimentally. The exact solutions are provided via the solution of a matching system of equations containing 74 coupled, non-linear and complex algebraic equations. In our knowledge, other exact results for 2D interacting systems with spin-orbit interactions are not present in the literature.

Euclidean shortest paths exact or approximate algorithms

CERN Document Server

Li, Fajie

2014-01-01

This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.

On exactly soluble model in quantum electrodynamics

International Nuclear Information System (INIS)

Bogolubov, N.N.; Shumovsky, A.S.; Fam Le Kien

1984-01-01

Equations of motion describing the dynamics of three-level atom of ladder type interacting with two modes of quantized radiation field are solved exactly. Evolution of level population and photon rumbers under different unitial conditions is irvestigated

Comments on exact quantization conditions and non-perturbative topological strings

International Nuclear Information System (INIS)

Hatsuda, Yasuyuki

2015-12-01

We give some remarks on exact quantization conditions associated with quantized mirror curves of local Calabi-Yau threefolds, conjectured in arXiv:1410.3382. It is shown that they characterize a non-perturbative completion of the refined topological strings in the Nekrasov-Shatashvili limit. We find that the quantization conditions enjoy an exact S-dual invariance. We also discuss Borel summability of the semi-classical spectrum.

A network traffic reduction method for cooperative positioning

NARCIS (Netherlands)

Das, Kallol; Wymeersch, Henk

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

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.

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

International Nuclear Information System (INIS)

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

2013-01-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

Quasi-exact solvability and entropies of the one-dimensional regularised Calogero model

Science.gov (United States)

Pont, Federico M.; Osenda, Omar; Serra, Pablo

2018-05-01

The Calogero model can be regularised through the introduction of a cutoff parameter which removes the divergence in the interaction term. In this work we show that the one-dimensional two-particle regularised Calogero model is quasi-exactly solvable and that for certain values of the Hamiltonian parameters the eigenfunctions can be written in terms of Heun’s confluent polynomials. These eigenfunctions are such that the reduced density matrix of the two-particle density operator can be obtained exactly as well as its entanglement spectrum. We found that the number of non-zero eigenvalues of the reduced density matrix is finite in these cases. The limits for the cutoff distance going to zero (Calogero) and infinity are analysed and all the previously obtained results for the Calogero model are reproduced. Once the exact eigenfunctions are obtained, the exact von Neumann and Rényi entanglement entropies are studied to characterise the physical traits of the model. The quasi-exactly solvable character of the model is assessed studying the numerically calculated Rényi entropy and entanglement spectrum for the whole parameter space.

Exact simulation of max-stable processes.

Science.gov (United States)

Dombry, Clément; Engelke, Sebastian; Oesting, Marco

2016-06-01

Max-stable processes play an important role as models for spatial extreme events. Their complex structure as the pointwise maximum over an infinite number of random functions makes their simulation difficult. Algorithms based on finite approximations are often inexact and computationally inefficient. We present a new algorithm for exact simulation of a max-stable process at a finite number of locations. It relies on the idea of simulating only the extremal functions, that is, those functions in the construction of a max-stable process that effectively contribute to the pointwise maximum. We further generalize the algorithm by Dieker & Mikosch (2015) for Brown-Resnick processes and use it for exact simulation via the spectral measure. We study the complexity of both algorithms, prove that our new approach via extremal functions is always more efficient, and provide closed-form expressions for their implementation that cover most popular models for max-stable processes and multivariate extreme value distributions. For simulation on dense grids, an adaptive design of the extremal function algorithm is proposed.

New explicit and exact solutions of the Benney–Kawahara–Lin equation

International Nuclear Information System (INIS)

Yuan-Xi, Xie

2009-01-01

In this paper, we present a combination method of constructing the explicit and exact solutions of nonlinear partial differential equations. And as an illustrative example, we apply the method to the Benney–Kawahara–Lin equation and derive its many explicit and exact solutions which are all new solutions. (general)

A new auxiliary equation and exact travelling wave solutions of nonlinear equations

International Nuclear Information System (INIS)

Sirendaoreji

2006-01-01

A new auxiliary ordinary differential equation and its solutions are used for constructing exact travelling wave solutions of nonlinear partial differential equations in a unified way. The main idea of this method is to take full advantage of the auxiliary equation which has more new exact solutions. More new exact travelling wave solutions are obtained for the quadratic nonlinear Klein-Gordon equation, the combined KdV and mKdV equation, the sine-Gordon equation and the Whitham-Broer-Kaup equations

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

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Yang, Hong-Chuan; Alouini, Mohamed-Slim

2015-01-01

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

Charge transfer excitations from exact and approximate ensemble Kohn-Sham theory

Science.gov (United States)

Gould, Tim; Kronik, Leeor; Pittalis, Stefano

2018-05-01

By studying the lowest excitations of an exactly solvable one-dimensional soft-Coulomb molecular model, we show that components of Kohn-Sham ensembles can be used to describe charge transfer processes. Furthermore, we compute the approximate excitation energies obtained by using the exact ensemble densities in the recently formulated ensemble Hartree-exchange theory [T. Gould and S. Pittalis, Phys. Rev. Lett. 119, 243001 (2017)]. Remarkably, our results show that triplet excitations are accurately reproduced across a dissociation curve in all cases tested, even in systems where ground state energies are poor due to strong static correlations. Singlet excitations exhibit larger deviations from exact results but are still reproduced semi-quantitatively.

Growing Homophilic Networks Are Natural Navigable Small Worlds.

Science.gov (United States)

Malkov, Yury A; Ponomarenko, Alexander

2016-01-01

Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks. A very simple algorithm produces hierarchical self-similar optimally wired navigable small world networks with exponential degree distribution by using only local information. Adding preferential attachment produces a scale-free network which has shorter greedy paths, but worse (power law) scaling of the information extraction locality (algorithmic complexity of a search). Introducing saturation of the preferential attachment leads to truncated scale-free degree distribution that offers a good tradeoff between these parameters and can be useful for practical applications. Several features of the model are observed in real-life networks, in particular in the brain neural networks, supporting the earlier suggestions that they are navigable.

Growing Homophilic Networks Are Natural Navigable Small Worlds.

Directory of Open Access Journals (Sweden)

Yury A Malkov

Full Text Available Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks. A very simple algorithm produces hierarchical self-similar optimally wired navigable small world networks with exponential degree distribution by using only local information. Adding preferential attachment produces a scale-free network which has shorter greedy paths, but worse (power law scaling of the information extraction locality (algorithmic complexity of a search. Introducing saturation of the preferential attachment leads to truncated scale-free degree distribution that offers a good tradeoff between these parameters and can be useful for practical applications. Several features of the model are observed in real-life networks, in particular in the brain neural networks, supporting the earlier suggestions that they are navigable.

Load reduction test method of similarity theory and BP neural networks of large cranes

Science.gov (United States)

Yang, Ruigang; Duan, Zhibin; Lu, Yi; Wang, Lei; Xu, Gening

2016-01-01

Static load tests are an important means of supervising and detecting a crane's lift capacity. Due to space restrictions, however, there are difficulties and potential danger when testing large bridge cranes. To solve the loading problems of large-tonnage cranes during testing, an equivalency test is proposed based on the similarity theory and BP neural networks. The maximum stress and displacement of a large bridge crane is tested in small loads, combined with the training neural network of a similar structure crane through stress and displacement data which is collected by a physics simulation progressively loaded to a static load test load within the material scope of work. The maximum stress and displacement of a crane under a static load test load can be predicted through the relationship of stress, displacement, and load. By measuring the stress and displacement of small tonnage weights, the stress and displacement of large loads can be predicted, such as the maximum load capacity, which is 1.25 times the rated capacity. Experimental study shows that the load reduction test method can reflect the lift capacity of large bridge cranes. The load shedding predictive analysis for Sanxia 1200 t bridge crane test data indicates that when the load is 1.25 times the rated lifting capacity, the predicted displacement and actual displacement error is zero. The method solves the problem that lifting capacities are difficult to obtain and testing accidents are easily possible when 1.25 times related weight loads are tested for large tonnage cranes.

Maps on statistical manifolds exactly reduced from the Perron-Frobenius equations for solvable chaotic maps

Science.gov (United States)

Goto, Shin-itiro; Umeno, Ken

2018-03-01

Maps on a parameter space for expressing distribution functions are exactly derived from the Perron-Frobenius equations for a generalized Boole transform family. Here the generalized Boole transform family is a one-parameter family of maps, where it is defined on a subset of the real line and its probability distribution function is the Cauchy distribution with some parameters. With this reduction, some relations between the statistical picture and the orbital one are shown. From the viewpoint of information geometry, the parameter space can be identified with a statistical manifold, and then it is shown that the derived maps can be characterized. Also, with an induced symplectic structure from a statistical structure, symplectic and information geometric aspects of the derived maps are discussed.

Asymptotically exact solution of a local copper-oxide model

International Nuclear Information System (INIS)

Zhang Guangming; Yu Lu.

1994-03-01

We present an asymptotically exact solution of a local copper-oxide model abstracted from the multi-band models. The phase diagram is obtained through the renormalization-group analysis of the partition function. In the strong coupling regime, we find an exactly solved line, which crosses the quantum critical point of the mixed valence regime separating two different Fermi-liquid (FL) phases. At this critical point, a many-particle resonance is formed near the chemical potential, and a marginal-FL spectrum can be derived for the spin and charge susceptibilities. (author). 15 refs, 1 fig

String propagation in an exact four-dimensional black hole background

International Nuclear Information System (INIS)

Mahapatra, S.

1997-01-01

We study string propagation in an exact, stringy, four-dimensional dyonic black hole background. The exact solutions in terms of elliptic functions describing string configurations in the J=0 limit are obtained by solving the string equations of motion and constraints. By using the covariant formalism, we also investigate the propagation of physical perturbations along the string in the given curved background. copyright 1997 The American Physical Society

Exact results for Wilson loops in arbitrary representations

Energy Technology Data Exchange (ETDEWEB)

Fiol, Bartomeu; Torrents, Genís [Departament de Física Fonamental i Institut de Ciències del Cosmos, Universitat de Barcelona,Martí i Franquès 1, 08028 Barcelona, Catalonia (Spain)

2014-01-08

We compute the exact vacuum expectation value of 1/2 BPS circular Wilson loops of N=4 U(N) super Yang-Mills in arbitrary irreducible representations. By localization arguments, the computation reduces to evaluating certain integrals in a Gaussian matrix model, which we do using the method of orthogonal polynomials. Our results are particularly simple for Wilson loops in antisymmetric representations; in this case, we observe that the final answers admit an expansion where the coefficients are positive integers, and can be written in terms of sums over skew Young diagrams. As an application of our results, we use them to discuss the exact Bremsstrahlung functions associated to the corresponding heavy probes.

Exact Turbulence Law in Collisionless Plasmas: Hybrid Simulations

Science.gov (United States)

Hellinger, P.; Verdini, A.; Landi, S.; Franci, L.; Matteini, L.

2017-12-01

An exact vectorial law for turbulence in homogeneous incompressible Hall-MHD is derived and tested in two-dimensional hybrid simulations of plasma turbulence. The simulations confirm the validity of the MHD exact law in the kinetic regime, the simulated turbulence exhibits a clear inertial range on large scales where the MHD cascade flux dominates. The simulation results also indicate that in the sub-ion range the cascade continues via the Hall term and that the total cascade rate tends to decrease at around the ion scales, especially in high-beta plasmas. This decrease is like owing to formation of non-thermal features, such as collisionless ion energization, that can not be retained in the Hall MHD approximation.

A conditionally exactly solvable generalization of the inverse square root potential

Energy Technology Data Exchange (ETDEWEB)

Ishkhanyan, A.M., E-mail: aishkhanyan@gmail.com [Institute for Physical Research, NAS of Armenia, Ashtarak 0203 (Armenia); Armenian State Pedagogical University, Yerevan 0010 (Armenia); Institute of Physics and Technology, National Research Tomsk Polytechnic University, Tomsk 634050 (Russian Federation)

2016-11-25

We present a conditionally exactly solvable singular potential for the one-dimensional Schrödinger equation which involves the exactly solvable inverse square root potential. Each of the two fundamental solutions that compose the general solution of the problem is given by a linear combination with non-constant coefficients of two confluent hypergeometric functions. Discussing the bound-state wave functions vanishing both at infinity and in the origin, we derive the exact equation for the energy spectrum which is written using two Hermite functions of non-integer order. In specific auxiliary variables this equation becomes a mathematical equation that does not refer to a specific physical context discussed. In the two-dimensional space of these auxiliary variables the roots of this equation draw a countable infinite set of open curves with hyperbolic asymptotes. We present an analytic description of these curves by a transcendental algebraic equation for the involved variables. The intersections of the curves thus constructed with a certain cubic curve provide a highly accurate description of the energy spectrum. - Highlights: • We present a conditionally exactly solvable singular potential for 1D Schrödinger equation. • Each of the two fundamental solutions is given by a linear combination with non-constant coefficients of two confluent hypergeometric functions. • The exact equation for the energy spectrum is written using two Hermite functions that do not reduce to polynomials.

Bayesian estimation inherent in a Mexican-hat-type neural network

Science.gov (United States)

Takiyama, Ken

2016-05-01

Brain functions, such as perception, motor control and learning, and decision making, have been explained based on a Bayesian framework, i.e., to decrease the effects of noise inherent in the human nervous system or external environment, our brain integrates sensory and a priori information in a Bayesian optimal manner. However, it remains unclear how Bayesian computations are implemented in the brain. Herein, I address this issue by analyzing a Mexican-hat-type neural network, which was used as a model of the visual cortex, motor cortex, and prefrontal cortex. I analytically demonstrate that the dynamics of an order parameter in the model corresponds exactly to a variational inference of a linear Gaussian state-space model, a Bayesian estimation, when the strength of recurrent synaptic connectivity is appropriately stronger than that of an external stimulus, a plausible condition in the brain. This exact correspondence can reveal the relationship between the parameters in the Bayesian estimation and those in the neural network, providing insight for understanding brain functions.

Full-Duplex opportunistic relay selection in future spectrum-sharing networks

KAUST Repository

Khafagy, Mohammad Galal; Alouini, Mohamed-Slim; Aï ssa, Sonia

2015-01-01

We propose and analyze the performance of full-duplex relay selection in primary/secondary spectrum-sharing networks. Contrary to half-duplex relaying, full-duplex relaying (FDR) enables simultaneous listening/forwarding at the secondary relay, thereby allowing for a higher spectral efficiency. However, since the source and relay simultaneously transmit in FDR, their superimposed signal at the primary receiver should now satisfy the existing interference constraint which can considerably limit the secondary network throughput. In this regard, relay selection can offer an adequate solution to boost the secondary throughput while satisfying the imposed interference limit. We first analyze the performance of opportunistic relay selection among a cluster of full-duplex decode-and-forward relays with self-interference by deriving the exact cumulative distribution function of its end-to-end signal-to-noise ratio. Second, we evaluate the end-to-end performance of relay selection with interference constraints due to the presence of a primary receiver. Finally, the presented exact theoretical findings are verified by numerical simulations.

Full-Duplex opportunistic relay selection in future spectrum-sharing networks

KAUST Repository

Khafagy, Mohammad Galal

2015-06-01

We propose and analyze the performance of full-duplex relay selection in primary/secondary spectrum-sharing networks. Contrary to half-duplex relaying, full-duplex relaying (FDR) enables simultaneous listening/forwarding at the secondary relay, thereby allowing for a higher spectral efficiency. However, since the source and relay simultaneously transmit in FDR, their superimposed signal at the primary receiver should now satisfy the existing interference constraint which can considerably limit the secondary network throughput. In this regard, relay selection can offer an adequate solution to boost the secondary throughput while satisfying the imposed interference limit. We first analyze the performance of opportunistic relay selection among a cluster of full-duplex decode-and-forward relays with self-interference by deriving the exact cumulative distribution function of its end-to-end signal-to-noise ratio. Second, we evaluate the end-to-end performance of relay selection with interference constraints due to the presence of a primary receiver. Finally, the presented exact theoretical findings are verified by numerical simulations.

Mirroring the videos of Anonymous:cloud activism, living networks, and political mimesis

OpenAIRE

Fish, Adam Richard

2016-01-01

Mirrors describe the multiplication of data across a network. In this article, I examine the politics of mirroring as practiced on videos by the hacktivist network Anonymous. Mirrors are designed to retain visibility on social media platforms and motivate viewers towards activism. They emerge from a particular social structure and propagate a specific symbolic system. Furthermore, mirrors are not exact replicas nor postmodern representations. Rather, mirroring maps a contestation over visibil...

Exact EGB models for spherical static perfect fluids

Energy Technology Data Exchange (ETDEWEB)

Hansraj, Sudan; Chilambwe, Brian; Maharaj, Sunil D. [University of KwaZulu-Natal, Astrophysics and Cosmology Research Unit, School of Mathematics, Statistics and Computer Science, Private Bag 54001, Durban (South Africa)

2015-06-15

We obtain a new exact solution to the field equations for a 5-dimensional spherically symmetric static distribution in the Einstein-Gauss-Bonnet modified theory of gravity. 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 admissibility. 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-dimensional perfect fluids in the standard Einstein theory is obtained. Plots of the dynamical quantities for the Gauss-Bonnet and the Einstein case reveal that the pressure is unaffected, while the energy density increases under the influence of the Gauss-Bonnet term. (orig.)

User Vulnerability and its Reduction on a Social Networking Site

Science.gov (United States)

2014-01-01

Watts and Strogatz 1998]. Thus, it is essential to consider the social utility of vulnerable friends before unfriending them in order to reduce...and Kleinberg 2010] of the social network and the user’s clustering coefficient [Watts and Strogatz 1998]. Thus, it is essential to consider the...Oxford University Press, USA. WATTS, D. AND STROGATZ , S. 1998. Collective Dynamics of Small-world Networks. Nature 393, 6684, 440–442. WONDRACEK, G

Deep neural networks for direct, featureless learning through observation: The case of two-dimensional spin models

Science.gov (United States)

Mills, Kyle; Tamblyn, Isaac

2018-03-01

We demonstrate the capability of a convolutional deep neural network in predicting the nearest-neighbor energy of the 4 ×4 Ising model. Using its success at this task, we motivate the study of the larger 8 ×8 Ising model, showing that the deep neural network can learn the nearest-neighbor Ising Hamiltonian after only seeing a vanishingly small fraction of configuration space. Additionally, we show that the neural network has learned both the energy and magnetization operators with sufficient accuracy to replicate the low-temperature Ising phase transition. We then demonstrate the ability of the neural network to learn other spin models, teaching the convolutional deep neural network to accurately predict the long-range interaction of a screened Coulomb Hamiltonian, a sinusoidally attenuated screened Coulomb Hamiltonian, and a modified Potts model Hamiltonian. In the case of the long-range interaction, we demonstrate the ability of the neural network to recover the phase transition with equivalent accuracy to the numerically exact method. Furthermore, in the case of the long-range interaction, the benefits of the neural network become apparent; it is able to make predictions with a high degree of accuracy, and do so 1600 times faster than a CUDA-optimized exact calculation. Additionally, we demonstrate how the neural network succeeds at these tasks by looking at the weights learned in a simplified demonstration.

An exactly solvable model for first- and second-order transitions

International Nuclear Information System (INIS)

Klushin, L I; Skvortsov, A M; Gorbunov, A A

1998-01-01

The possibility of an exact analytical description of first-order and second-order transitions is demonstrated using a specific microscopic model. Predictions using the exactly calculated partition function are compared with those based on the Landau and Yang-Lee approaches. The model employed is an adsorbed polymer chain with an arbitrary number of links and an external force applied to its end, for which the variation of the partition function with the adsorption interaction parameter and the magnitude of the applied force is calculated. In the thermodynamic limit, the system has one isotropic and two anisotropic, ordered phases, each of which is characterized by two order parameters and between which first-order and second-order transitions occur and a bicritical point exists. The Landau free energy is found exactly as a function of each order parameter separately and, near the bicritical point, as a function of both of them simultaneously. An exact analytical formula is found for the distribution of the complex zeros of the partition function in first-order and second-order phase transitions. Hypotheses concerning the way in which the free energy and the positions of the complex zeros scale with the number of particles N in the system are verified. (reviews of topical problems)

Delay-Dependent Stability Criteria of Uncertain Periodic Switched Recurrent Neural Networks with Time-Varying Delays

Directory of Open Access Journals (Sweden)

Xing Yin

2011-01-01

uncertain periodic switched recurrent neural networks with time-varying delays. When uncertain discrete-time recurrent neural network is a periodic system, it is expressed as switched neural network for the finite switching state. Based on the switched quadratic Lyapunov functional approach (SQLF and free-weighting matrix approach (FWM, some linear matrix inequality criteria are found to guarantee the delay-dependent asymptotical stability of these systems. Two examples illustrate the exactness of the proposed criteria.

Exactly solvable position dependent mass schroedinger equation

International Nuclear Information System (INIS)

Koc, R.; Tuetuencueler, H.; Koercuek, E.

2002-01-01

Exact solution of the Schrodinger equation with a variable mass is presented. We have derived general expressions for the eigenstates and eigenvalues of the position dependent mass systems. We provide supersymmetric and Lie algebraic methods to discuss the position dependent mass systems

OSPF-TE Extensions for Green Routing in Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, S.; Fagertun, Anna Manolova

2012-01-01

This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing.......This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing....

Vulnerability of complex networks under intentional attack with incomplete information

International Nuclear Information System (INIS)

Wu, J; Deng, H Z; Tan, Y J; Zhu, D Z

2007-01-01

We study the vulnerability of complex networks under intentional attack with incomplete information, which means that one can only preferentially attack the most important nodes among a local region of a network. The known random failure and the intentional attack are two extreme cases of our study. Using the generating function method, we derive the exact value of the critical removal fraction f c of nodes for the disintegration of networks and the size of the giant component. To validate our model and method, we perform simulations of intentional attack with incomplete information in scale-free networks. We show that the attack information has an important effect on the vulnerability of scale-free networks. We also demonstrate that hiding a fraction of the nodes information is a cost-efficient strategy for enhancing the robustness of complex networks

Structural and functional networks in complex systems with delay.

Science.gov (United States)

Eguíluz, Víctor M; Pérez, Toni; Borge-Holthoefer, Javier; Arenas, Alex

2011-05-01

Functional networks of complex systems are obtained from the analysis of the temporal activity of their components, and are often used to infer their unknown underlying connectivity. We obtain the equations relating topology and function in a system of diffusively delay-coupled elements in complex networks. We solve exactly the resulting equations in motifs (directed structures of three nodes) and in directed networks. The mean-field solution for directed uncorrelated networks shows that the clusterization of the activity is dominated by the in-degree of the nodes, and that the locking frequency decreases with increasing average degree. We find that the exponent of a power law degree distribution of the structural topology γ is related to the exponent of the associated functional network as α=(2-γ)(-1) for γ<2. © 2011 American Physical Society

A Summary of Research on Energy Saving and Emission Reduction of Transportation

Science.gov (United States)

Cheng, Dongxiang; Wu, Lufen

2017-12-01

Road transport is an important part of transportation, and road in the field of energy-saving emission reduction is a very important industry. According to the existing problems of road energy saving and emission reduction, this paper elaborates the domestic and international research on energy saving and emission reduction from three aspects: road network optimization, pavement material and pavement maintenance. Road network optimization may be overlooked, and the research content is still relatively preliminary; pavement materials mainly from the asphalt pavement temperature mixed asphalt technology research; pavement maintenance technology development is relatively comprehensive.

Software Defined Coded Networking

DEFF Research Database (Denmark)

Di Paola, Carla; Roetter, Daniel Enrique Lucani; Palazzo, Sergio

2017-01-01

the quality of each link and even across neighbouring links and using simulations to show that an additional reduction of packet transmission in the order of 40% is possible. Second, to advocate for the use of network coding (NC) jointly with software defined networking (SDN) providing an implementation...

Selecting Optimal Parameters of Random Linear Network Coding for Wireless Sensor Networks

DEFF Research Database (Denmark)

Heide, J; Zhang, Qi; Fitzek, F H P

2013-01-01

This work studies how to select optimal code parameters of Random Linear Network Coding (RLNC) in Wireless Sensor Networks (WSNs). With Rateless Deluge [1] the authors proposed to apply Network Coding (NC) for Over-the-Air Programming (OAP) in WSNs, and demonstrated that with NC a significant...... reduction in the number of transmitted packets can be achieved. However, NC introduces additional computations and potentially a non-negligible transmission overhead, both of which depend on the chosen coding parameters. Therefore it is necessary to consider the trade-off that these coding parameters...... present in order to obtain the lowest energy consumption per transmitted bit. This problem is analyzed and suitable coding parameters are determined for the popular Tmote Sky platform. Compared to the use of traditional RLNC, these parameters enable a reduction in the energy spent per bit which grows...

Sex-work harm reduction.

Science.gov (United States)

Rekart, Michael L

2005-12-17

Sex work is an extremely dangerous profession. The use of harm-reduction principles can help to safeguard sex workers' lives in the same way that drug users have benefited from drug-use harm reduction. Sex workers are exposed to serious harms: drug use, disease, violence, discrimination, debt, criminalisation, and exploitation (child prostitution, trafficking for sex work, and exploitation of migrants). Successful and promising harm-reduction strategies are available: education, empowerment, prevention, care, occupational health and safety, decriminalisation of sex workers, and human-rights-based approaches. Successful interventions include peer education, training in condom-negotiating skills, safety tips for street-based sex workers, male and female condoms, the prevention-care synergy, occupational health and safety guidelines for brothels, self-help organisations, and community-based child protection networks. Straightforward and achievable steps are available to improve the day-to-day lives of sex workers while they continue to work. Conceptualising and debating sex-work harm reduction as a new paradigm can hasten this process.

A BEHAVIORAL-APPROACH TO LINEAR EXACT MODELING

NARCIS (Netherlands)

ANTOULAS, AC; WILLEMS, JC

1993-01-01

The behavioral approach to system theory provides a parameter-free framework for the study of the general problem of linear exact modeling and recursive modeling. The main contribution of this paper is the solution of the (continuous-time) polynomial-exponential time series modeling problem. Both

Exact Finite-Difference Schemes for d-Dimensional Linear Stochastic Systems with Constant Coefficients

Directory of Open Access Journals (Sweden)

Peng Jiang

2013-01-01

Full Text Available The authors attempt to construct the exact finite-difference schemes for linear stochastic differential equations with constant coefficients. The explicit solutions to Itô and Stratonovich linear stochastic differential equations with constant coefficients are adopted with the view of providing exact finite-difference schemes to solve them. In particular, the authors utilize the exact finite-difference schemes of Stratonovich type linear stochastic differential equations to solve the Kubo oscillator that is widely used in physics. Further, the authors prove that the exact finite-difference schemes can preserve the symplectic structure and first integral of the Kubo oscillator. The authors also use numerical examples to prove the validity of the numerical methods proposed in this paper.

Determining the control networks regulating stem cell lineages in colonic crypts

OpenAIRE

Yang, J; Axelrod, DE; Komarova, NL

2017-01-01

The question of stem cell control is at the center of our understanding of tissue functioning, both in healthy and cancerous conditions. It is well accepted that cellular fate decisions (such as divisions, differentiation, apoptosis) are orchestrated by a network of regulatory signals emitted by different cell populations in the lineage and the surrounding tissue. The exact regulatory network that governs stem cell lineages in a given tissue is usually unknown. Here we propose an algorithm to...

The impact of vessel speed reduction on port accidents.

Science.gov (United States)

Chang, Young-Tae; Park, Hyosoo

2016-03-19

Reduced-speed zones (RSZs) have been designated across the world to control emissions from ships and prevent mammal strikes. While some studies have examined the effectiveness of speed reduction on emissions and mammal preservation, few have analyzed the effects of reduced ship speed on vessel safety. Those few studies have not yet measured the relationship between vessel speed and accidents by using real accident data. To fill this gap in the literature, this study estimates the impact of vessel speed reduction on vessel damages, casualties and frequency of vessel accidents. Accidents in RSZ ports were compared to non-RSZ ports by using U.S. Coast Guard data to capture the speed reduction effects. The results show that speed reduction influenced accident frequency as a result of two factors, the fuel price and the RSZ designation. Every $10 increase in the fuel price led to a 10.3% decrease in the number of accidents, and the RSZ designation reduced vessel accidents by 47.9%. However, the results do not clarify the exact impact of speed reduction on accident casualty. Copyright © 2016 Elsevier Ltd. All rights reserved.

Quantum decay model with exact explicit analytical solution

Science.gov (United States)

Marchewka, Avi; Granot, Er'El

2009-01-01

A simple decay model is introduced. The model comprises a point potential well, which experiences an abrupt change. Due to the temporal variation, the initial quantum state can either escape from the well or stay localized as a new bound state. The model allows for an exact analytical solution while having the necessary features of a decay process. The results show that the decay is never exponential, as classical dynamics predicts. Moreover, at short times the decay has a fractional power law, which differs from perturbation quantum method predictions. At long times the decay includes oscillations with an envelope that decays algebraically. This is a model where the final state can be either continuous or localized, and that has an exact analytical solution.

The Problem of Understanding of Nature in Exact Science

Directory of Open Access Journals (Sweden)

Leo Näpinen

2014-10-01

Full Text Available In this short inquiry I would like to defend the statement that exact science deals with the explanation of models, but not with the understanding (comprehending of nature. By the word ‘nature’ I mean nature as physis (as a self-moving and self-developing living organism to which humans also belong, not nature as natura naturata (as a nonevolving creature created by someone or something. The Estonian philosopher of science Rein Vihalemm (2008 has shown with his conception of phi-science (φ-science that exact science is itself an idealized model or theoretical object derived from Galilean mathematical physics.

Quasi-exact solvability of the one-dimensional Holstein model

International Nuclear Information System (INIS)

Pan Feng; Dai Lianrong; Draayer, J P

2006-01-01

The one-dimensional Holstein model of spinless fermions interacting with dispersionless phonons is solved by using a Bethe ansatz in analogue to that for the one-dimensional spinless Fermi-Hubbard model. Excitation energies and the corresponding wavefunctions of the model are determined by a set of partial differential equations. It is shown that the model is, at least, quasi-exactly solvable for the two-site case, when the phonon frequency, the electron-phonon coupling strength and the hopping integral satisfy certain relations. As examples, some quasi-exact solutions of the model for the two-site case are derived. (letter to the editor)

Disease clusters, exact distributions of maxima, and P-values.

Science.gov (United States)

Grimson, R C

1993-10-01

This paper presents combinatorial (exact) methods that are useful in the analysis of disease cluster data obtained from small environments, such as buildings and neighbourhoods. Maxwell-Boltzmann and Fermi-Dirac occupancy models are compared in terms of appropriateness of representation of disease incidence patterns (space and/or time) in these environments. The methods are illustrated by a statistical analysis of the incidence pattern of bone fractures in a setting wherein fracture clustering was alleged to be occurring. One of the methodological results derived in this paper is the exact distribution of the maximum cell frequency in occupancy models.

Clock Math — a System for Solving SLEs Exactly

Directory of Open Access Journals (Sweden)

Jakub Hladík

2013-01-01

Full Text Available In this paper, we present a GPU-accelerated hybrid system that solves ill-conditioned systems of linear equations exactly. Exactly means without rounding errors due to using integer arithmetics. First, we scale floating-point numbers up to integers, then we solve dozens of SLEs within different modular arithmetics and then we assemble sub-solutions back using the Chinese remainder theorem. This approach effectively bypasses current CPU floating-point limitations. The system is capable of solving Hilbert’s matrix without losing a single bit of precision, and with a significant speedup compared to existing CPU solvers.

Exact solution of matricial Φ23 quantum field theory

Science.gov (United States)

Grosse, Harald; Sako, Akifumi; Wulkenhaar, Raimar

2017-12-01

We apply a recently developed method to exactly solve the Φ3 matrix model with covariance of a two-dimensional theory, also known as regularised Kontsevich model. Its correlation functions collectively describe graphs on a multi-punctured 2-sphere. We show how Ward-Takahashi identities and Schwinger-Dyson equations lead in a special large- N limit to integral equations that we solve exactly for all correlation functions. The solved model arises from noncommutative field theory in a special limit of strong deformation parameter. The limit defines ordinary 2D Schwinger functions which, however, do not satisfy reflection positivity.

Exact computation and large angular momentum asymptotics of 3nj symbols: Semiclassical disentangling of spin networks

International Nuclear Information System (INIS)

Anderson, Roger W.; Aquilanti, Vincenzo; Silva Ferreira, Cristiane da

2008-01-01

Spin networks, namely, the 3nj symbols of quantum angular momentum theory and their generalizations to groups other than SU(2) and to quantum groups, permeate many areas of pure and applied science. The issues of their computation and characterization for large values of their entries are a challenge for diverse fields, such as spectroscopy and quantum chemistry, molecular and condensed matter physics, quantum computing, and the geometry of space time. Here we record progress both in their efficient calculation and in the study of the large j asymptotics. For the 9j symbol, a prototypical entangled network, we present and extensively check numerically formulas that illustrate the passage to the semiclassical limit, manifesting both the occurrence of disentangling and the discrete-continuum transition.

Modeling Renewable Penertration Using a Network Economic Model

Science.gov (United States)

Lamont, A.

2001-03-01

This paper evaluates the accuracy of a network economic modeling approach in designing energy systems having renewable and conventional generators. The network approach models the system as a network of processes such as demands, generators, markets, and resources. The model reaches a solution by exchanging prices and quantity information between the nodes of the system. This formulation is very flexible and takes very little time to build and modify models. This paper reports an experiment designing a system with photovoltaic and base and peak fossil generators. The level of PV penetration as a function of its price and the capacities of the fossil generators were determined using the network approach and using an exact, analytic approach. It is found that the two methods agree very closely in terms of the optimal capacities and are nearly identical in terms of annual system costs.

A Short-Circuit Method for Networks.

Science.gov (United States)

Ong, P. P.

1983-01-01

Describes a method of network analysis that allows avoidance of Kirchoff's Laws (providing the network is symmetrical) by reduction to simple series/parallel resistances. The method can be extended to symmetrical alternating current, capacitance or inductance if corresponding theorems are used. Symmetric cubic network serves as an example. (JM)

Exact Tests for Two-Way Contingency Tables with Structural Zeros

Directory of Open Access Journals (Sweden)

Luke J. West

2008-11-01

Full Text Available Fisher's exact test, named for Sir Ronald Aylmer Fisher, tests contingency tables for homogeneity of proportion. This paper discusses a generalization of Fisher's exact test for the case where some of the table entries are constrained to be zero. The resulting test is useful for assessing cases where the null hypothesis of conditional multinomial distribution is suspected to be false. The test is implemented in the form of a new R package, aylmer.

Alternative approach to automated management of load flow in engineering networks considering functional reliability

Directory of Open Access Journals (Sweden)

Ирина Александровна Гавриленко

2016-02-01

Full Text Available The approach to automated management of load flow in engineering networks considering functional reliability was proposed in the article. The improvement of the concept of operational and strategic management of load flow in engineering networks was considered. The verbal statement of the problem for thesis research is defined, namely, the problem of development of information technology for exact calculation of the functional reliability of the network, or the risk of short delivery of purpose-oriented product for consumers

INTEGRATING ARTIFICIAL NEURAL NETWORKS FOR DEVELOPING TELEMEDICINE SOLUTION

Directory of Open Access Journals (Sweden)

Mihaela GHEORGHE

2015-06-01

Full Text Available Artificial intelligence is assuming an increasing important role in the telemedicine field, especially neural networks with their ability to achieve meaning from large sets of data characterized by lacking exactness and accuracy. These can be used for assisting physicians or other clinical staff in the process of taking decisions under uncertainty. Thus, machine learning methods which are specific to this technology are offering an approach for prediction based on pattern classification. This paper aims to present the importance of neural networks in detecting trends and extracting patterns which can be used within telemedicine domains, particularly for taking medical diagnosis decisions.

Outage analysis for underlay relay-assisted cognitive networks

KAUST Repository

Tourki, Kamel; Qaraqe, Khalid A.; Alouini, Mohamed-Slim

2012-01-01

Cooperative relay technology was recently introduced into cognitive radio networks in order to enhance network capacity, scalability, and reliability of end-to-end communication. In this paper, we investigate an underlay cognitive network where the quality of service of the secondary link is maintained by triggering an opportunistic regenerative relaying once it falls under an unacceptable level. We first provide the exact cumulative density function (CDF) of received signal-to-noise (SNR) over each hop with co-located relays. Then, the CDFs are used to determine very accurate closed-form expression for the outage probability for a transmission rate R. We validate our analysis by showing that simulation results coincide with our analytical results in Rayleigh fading channels. © 2012 IEEE.

Outage analysis for underlay relay-assisted cognitive networks

KAUST Repository

Tourki, Kamel

2012-12-01

Cooperative relay technology was recently introduced into cognitive radio networks in order to enhance network capacity, scalability, and reliability of end-to-end communication. In this paper, we investigate an underlay cognitive network where the quality of service of the secondary link is maintained by triggering an opportunistic regenerative relaying once it falls under an unacceptable level. We first provide the exact cumulative density function (CDF) of received signal-to-noise (SNR) over each hop with co-located relays. Then, the CDFs are used to determine very accurate closed-form expression for the outage probability for a transmission rate R. We validate our analysis by showing that simulation results coincide with our analytical results in Rayleigh fading channels. © 2012 IEEE.

Exact collisional moments for plasma fluid theories

Science.gov (United States)

Pfefferle, David; Hirvijoki, Eero; Lingam, Manasvi

2017-10-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 the 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 deriving 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 rate.

Exact solitary and periodic wave solutions for a generalized nonlinear Schroedinger equation

International Nuclear Information System (INIS)

Sun Chengfeng; Gao Hongjun

2009-01-01

The generalized nonlinear Schroedinger equation (GNLS) iu t + u xx + β | u | 2 u + γ | u | 4 u + iα (| u | 2 u) x + iτ(| u | 2 ) x u = 0 is studied. Using the bifurcation of travelling waves of this equation, some exact solitary wave solutions were obtained in [Wang W, Sun J,Chen G, Bifurcation, Exact solutions and nonsmooth behavior of solitary waves in the generalized nonlinear Schroedinger equation. Int J Bifucat Chaos 2005:3295-305.]. In this paper, more explicit exact solitary wave solutions and some new smooth periodic wave solutions are obtained.

Analyzing Bullwhip Effect in Supply Networks under Exogenous Uncertainty

Directory of Open Access Journals (Sweden)

Mitra Darvish

2014-05-01

Full Text Available This paper explains a model for analyzing and measuring the propagation of order amplifications (i.e. bullwhip effect for a single-product supply network topology considering exogenous uncertainty and linear and time-invariant inventory management policies for network entities. The stream of orders placed by each entity of the network is characterized assuming customer demand is ergodic. In fact, we propose an exact formula in order to measure the bullwhip effect in the addressed supply network topology considering the system in Markovian chain framework and presenting a matrix of network member relationships and relevant order sequences. The formula turns out using a mathematical method called frequency domain analysis. The major contribution of this paper is analyzing the bullwhip effect considering exogenous uncertainty in supply networks and using the Fourier transform in order to simplify the relevant calculations. We present a number of numerical examples to assess the analytical results accuracy in quantifying the bullwhip effect.

Comparison of order reduction algorithms for application to electrical networks

Directory of Open Access Journals (Sweden)

Lj. Radić-Weissenfeld

2009-05-01

Full Text Available This paper addresses issues related to the minimization of the computational burden in terms of both memory and speed during the simulation of electrical models. In order to achieve a simple and computational fast model the order reduction of its reducible part is proposed. In this paper the overview of the order reduction algorithms and their application are discussed.

Exact renormalization group as a scheme for calculations

International Nuclear Information System (INIS)

Mack, G.

1985-10-01

In this lecture I report on recent work to use exact renormalization group methods to construct a scheme for calculations in quantum field theory and classical statistical mechanics on the continuum. (orig./HSI)

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

New types of exact solutions for a breaking soliton equation

International Nuclear Information System (INIS)

Mei Jianqin; Zhang Hongqing

2004-01-01

In this paper based on a system of Riccati equations, we present a newly generally projective Riccati equation expansion method and its algorithm, which can be used to construct more new exact solutions of nonlinear differential equations in mathematical physics. A typical breaking soliton equation is chosen to illustrate our algorithm such that more families of new exact solutions are obtained, which contain soliton-like solutions and periodic solutions. This algorithm can also be applied to other nonlinear differential equations

Interferometric crosstalk reduction by phase scrambling

NARCIS (Netherlands)

Tafur Monroy, I.; Tangdiongga, E.; Jonker, R.J.W.; Waardt, de H.

2000-01-01

Interferometric crosstalk, arising from the detection of undesired signals at the same nominal wavelength, may introduce large power penalties and bit-error rate (BER) floor significantly restricting the scalability of optical networks. In this paper, interferometric crosstalk reduction in optical

Exact error estimation for solutions of nuclide chain equations

International Nuclear Information System (INIS)

Tachihara, Hidekazu; Sekimoto, Hiroshi

1999-01-01

The exact solution of nuclide chain equations within arbitrary figures is obtained for a linear chain by employing the Bateman method in the multiple-precision arithmetic. The exact error estimation of major calculation methods for a nuclide chain equation is done by using this exact solution as a standard. The Bateman, finite difference, Runge-Kutta and matrix exponential methods are investigated. The present study confirms the following. The original Bateman method has very low accuracy in some cases, because of large-scale cancellations. The revised Bateman method by Siewers reduces the occurrence of cancellations and thereby shows high accuracy. In the time difference method as the finite difference and Runge-Kutta methods, the solutions are mainly affected by the truncation errors in the early decay time, and afterward by the round-off errors. Even though the variable time mesh is employed to suppress the accumulation of round-off errors, it appears to be nonpractical. Judging from these estimations, the matrix exponential method is the best among all the methods except the Bateman method whose calculation process for a linear chain is not identical with that for a general one. (author)

Development and evaluation of thermal model reduction algorithms for spacecraft

Science.gov (United States)

Deiml, Michael; Suderland, Martin; Reiss, Philipp; Czupalla, Markus

2015-05-01

This paper is concerned with the topic of the reduction of thermal models of spacecraft. The work presented here has been conducted in cooperation with the company OHB AG, formerly Kayser-Threde GmbH, and the Institute of Astronautics at Technische Universität München with the goal to shorten and automatize the time-consuming and manual process of thermal model reduction. The reduction of thermal models can be divided into the simplification of the geometry model for calculation of external heat flows and radiative couplings and into the reduction of the underlying mathematical model. For simplification a method has been developed which approximates the reduced geometry model with the help of an optimization algorithm. Different linear and nonlinear model reduction techniques have been evaluated for their applicability in reduction of the mathematical model. Thereby the compatibility with the thermal analysis tool ESATAN-TMS is of major concern, which restricts the useful application of these methods. Additional model reduction methods have been developed, which account to these constraints. The Matrix Reduction method allows the approximation of the differential equation to reference values exactly expect for numerical errors. The summation method enables a useful, applicable reduction of thermal models that can be used in industry. In this work a framework for model reduction of thermal models has been created, which can be used together with a newly developed graphical user interface for the reduction of thermal models in industry.

The generalized tanh method to obtain exact solutions of nonlinear partial differential equation

OpenAIRE

Gómez, César

2007-01-01

In this paper, we present the generalized tanh method to obtain exact solutions of nonlinear partial differential equations, and we obtain solitons and exact solutions of some important equations of the mathematical physics.

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

Detecting impacts of extreme events with ecological in situ monitoring networks

Directory of Open Access Journals (Sweden)

M. D. Mahecha

2017-09-01

Full Text Available Extreme hydrometeorological conditions typically impact ecophysiological processes on land. Satellite-based observations of the terrestrial biosphere provide an important reference for detecting and describing the spatiotemporal development of such events. However, in-depth investigations of ecological processes during extreme events require additional in situ observations. The question is whether the density of existing ecological in situ networks is sufficient for analysing the impact of extreme events, and what are expected event detection rates of ecological in situ networks of a given size. To assess these issues, we build a baseline of extreme reductions in the fraction of absorbed photosynthetically active radiation (FAPAR, identified by a new event detection method tailored to identify extremes of regional relevance. We then investigate the event detection success rates of hypothetical networks of varying sizes. Our results show that large extremes can be reliably detected with relatively small networks, but also reveal a linear decay of detection probabilities towards smaller extreme events in log–log space. For instance, networks with  ≈  100 randomly placed sites in Europe yield a  ≥  90 % chance of detecting the eight largest (typically very large extreme events; but only a  ≥  50 % chance of capturing the 39 largest events. These findings are consistent with probability-theoretic considerations, but the slopes of the decay rates deviate due to temporal autocorrelation and the exact implementation of the extreme event detection algorithm. Using the examples of AmeriFlux and NEON, we then investigate to what degree ecological in situ networks can capture extreme events of a given size. Consistent with our theoretical considerations, we find that today's systematically designed networks (i.e. NEON reliably detect the largest extremes, but that the extreme event detection rates are not higher than would

Exact Solutions to a Combined sinh-cosh-Gordon Equation

International Nuclear Information System (INIS)

Wei Long

2010-01-01

Based on a transformed Painleve property and the variable separated ODE method, a function transformation method is proposed to search for exact solutions of some partial differential equations (PDEs) with hyperbolic or exponential functions. This approach provides a more systematical and convenient handling of the solution process of this kind of nonlinear equations. Its key point is to eradicate the hyperbolic or exponential terms by a transformed Painleve property and reduce the given PDEs to a variable-coefficient ordinary differential equations, then we seek for solutions to the resulting equations by some methods. As an application, exact solutions for the combined sinh-cosh-Gordon equation are formally derived. (general)

Big Data Reduction and Optimization in Sensor Monitoring Network

Directory of Open Access Journals (Sweden)

Bin He

2014-01-01

Full Text Available Wireless sensor networks (WSNs are increasingly being utilized to monitor the structural health of the underground subway tunnels, showing many promising advantages over traditional monitoring schemes. Meanwhile, with the increase of the network size, the system is incapable of dealing with big data to ensure efficient data communication, transmission, and storage. Being considered as a feasible solution to these issues, data compression can reduce the volume of data travelling between sensor nodes. In this paper, an optimization algorithm based on the spatial and temporal data compression is proposed to cope with these issues appearing in WSNs in the underground tunnel environment. The spatial and temporal correlation functions are introduced for the data compression and data recovery. It is verified that the proposed algorithm is applicable to WSNs in the underground tunnel.

The relation among the hyperbolic-function-type exact solutions of nonlinear evolution equations

International Nuclear Information System (INIS)

Liu Chunping; Liu Xiaoping

2004-01-01

First, we investigate the solitary wave solutions of the Burgers equation and the KdV equation, which are obtained by using the hyperbolic function method. Then we present a theorem which will not only give us a clear relation among the hyperbolic-function-type exact solutions of nonlinear evolution equations, but also provide us an approach to construct new exact solutions in complex scalar field. Finally, we apply the theorem to the KdV-Burgers equation and obtain its new exact solutions

Defect networks and supersymmetric loop operators

Energy Technology Data Exchange (ETDEWEB)

Bullimore, Mathew [Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo, ON N2L 2Y5 (Canada)

2015-02-10

We consider topological defect networks with junctions in A{sub N−1} Toda CFT and the connection to supersymmetric loop operators in N=2 theories of class S on a four-sphere. Correlation functions in the presence of topological defect networks are computed by exploiting the monodromy of conformal blocks, generalising the notion of a Verlinde operator. Concentrating on a class of topological defects in A{sub 2} Toda theory, we find that the Verlinde operators generate an algebra whose structure is determined by a set of generalised skein relations that encode the representation theory of a quantum group. In the second half of the paper, we explore the dictionary between topological defect networks and supersymmetric loop operators in the N=2{sup ∗} theory by comparing to exact localisation computations. In this context, the the generalised skein relations are related to the operator product expansion of loop operators.

Exact, almost and delayed fault detection: An observer based approach

DEFF Research Database (Denmark)

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

1999-01-01

This paper consider the problem of fault detection and isolation in continuous- and discrete-time systems while using zero or almost zero threshold. A number of different fault detections and isolation problems using exact or almost exact disturbance decoupling are formulated. Solvability...... conditions are given for the formulated design problems together with methods for appropriate design of observer based fault detectors. The l-step delayed fault detection problem is also considered for discrete-time systems . Moreover, certain indirect fault detection methods such as unknown input observers...

Identification of Conserved Moieties in Metabolic Networks by Graph Theoretical Analysis of Atom Transition Networks

Science.gov (United States)

Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.

2016-01-01

Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moiety with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. We also give examples of new applications made possible by elucidating the atomic structure of conserved moieties. PMID:27870845

Model order reduction techniques with applications in finite element analysis

CERN Document Server

Qu, Zu-Qing

2004-01-01

Despite the continued rapid advance in computing speed and memory the increase in the complexity of models used by engineers persists in outpacing them. Even where there is access to the latest hardware, simulations are often extremely computationally intensive and time-consuming when full-blown models are under consideration. The need to reduce the computational cost involved when dealing with high-order/many-degree-of-freedom models can be offset by adroit computation. In this light, model-reduction methods have become a major goal of simulation and modeling research. Model reduction can also ameliorate problems in the correlation of widely used finite-element analyses and test analysis models produced by excessive system complexity. Model Order Reduction Techniques explains and compares such methods focusing mainly on recent work in dynamic condensation techniques: - Compares the effectiveness of static, exact, dynamic, SEREP and iterative-dynamic condensation techniques in producing valid reduced-order mo...

About simple nonlinear and linear superpositions of special exact solutions of Veselov-Novikov equation

International Nuclear Information System (INIS)

Dubrovsky, V. G.; Topovsky, A. V.

2013-01-01

New exact solutions, nonstationary and stationary, of Veselov-Novikov (VN) equation in the forms of simple nonlinear and linear superpositions of arbitrary number N of exact special solutions u (n) , n= 1, …, N are constructed via Zakharov and Manakov ∂-dressing method. Simple nonlinear superpositions are represented up to a constant by the sums of solutions u (n) and calculated by ∂-dressing on nonzero energy level of the first auxiliary linear problem, i.e., 2D stationary Schrödinger equation. It is remarkable that in the zero energy limit simple nonlinear superpositions convert to linear ones in the form of the sums of special solutions u (n) . It is shown that the sums u=u (k 1 ) +...+u (k m ) , 1 ⩽k 1 2 m ⩽N of arbitrary subsets of these solutions are also exact solutions of VN equation. The presented exact solutions include as superpositions of special line solitons and also superpositions of plane wave type singular periodic solutions. By construction these exact solutions represent also new exact transparent potentials of 2D stationary Schrödinger equation and can serve as model potentials for electrons in planar structures of modern electronics.

Compressive Sensing for Feedback Reduction in Wireless Multiuser Networks

KAUST Repository

Elkhalil, Khalil

2015-01-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

A Framework for Network Visualisation (Un Cadre Pour la Visualisation des Reseaux)

Science.gov (United States)

2010-02-01

Consider, for example, the passenger transportation network. Two hundred years ago it had no railways and what little intercity travel there was went by...road; one hundred years ago most intercity travel was by a vast rail network, and there was no air traffic; starting perhaps fifty years ago, rail...archaeological interest, and so forth. Exactly where between towns a road is laid may make no difference to a traveller , but it does make a difference to the

Formulations and exact algorithms for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian

2008-01-01

In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact...

Leakage Detection and Estimation Algorithm for Loss Reduction in Water Piping Networks

OpenAIRE

Kazeem B. Adedeji; Yskandar Hamam; Bolanle T. Abe; Adnan M. Abu-Mahfouz

2017-01-01

Water loss through leaking pipes constitutes a major challenge to the operational service of water utilities. In recent years, increasing concern about the financial loss and environmental pollution caused by leaking pipes has been driving the development of efficient algorithms for detecting leakage in water piping networks. Water distribution networks (WDNs) are disperse in nature with numerous number of nodes and branches. Consequently, identifying the segment(s) of the network and the exa...

A new neural network model for solving random interval linear programming problems.

Science.gov (United States)

Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

2017-05-01

This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.

Quantifying loopy network architectures.

Directory of Open Access Journals (Sweden)

Eleni Katifori

Full Text Available Biology presents many examples of planar distribution and structural networks having dense sets of closed loops. An archetype of this form of network organization is the vasculature of dicotyledonous leaves, which showcases a hierarchically-nested architecture containing closed loops at many different levels. Although a number of approaches have been proposed to measure aspects of the structure of such networks, a robust metric to quantify their hierarchical organization is still lacking. We present an algorithmic framework, the hierarchical loop decomposition, that allows mapping loopy networks to binary trees, preserving in the connectivity of the trees the architecture of the original graph. We apply this framework to investigate computer generated graphs, such as artificial models and optimal distribution networks, as well as natural graphs extracted from digitized images of dicotyledonous leaves and vasculature of rat cerebral neocortex. We calculate various metrics based on the asymmetry, the cumulative size distribution and the Strahler bifurcation ratios of the corresponding trees and discuss the relationship of these quantities to the architectural organization of the original graphs. This algorithmic framework decouples the geometric information (exact location of edges and nodes from the metric topology (connectivity and edge weight and it ultimately allows us to perform a quantitative statistical comparison between predictions of theoretical models and naturally occurring loopy graphs.

Exact Solutions of the Harry-Dym Equation

International Nuclear Information System (INIS)

Mokhtari, Reza

2011-01-01

The aim of this paper is to generate exact travelling wave solutions of the Harry-Dym equation through the methods of Adomian decomposition, He's variational iteration, direct integration, and power series. We show that the two later methods are more successful than the two former to obtain more solutions of the equation. (general)

Robust Learning of High-dimensional Biological Networks with Bayesian Networks

Science.gov (United States)

Nägele, Andreas; Dejori, Mathäus; Stetter, Martin

Structure learning of Bayesian networks applied to gene expression data has become a potentially useful method to estimate interactions between genes. However, the NP-hardness of Bayesian network structure learning renders the reconstruction of the full genetic network with thousands of genes unfeasible. Consequently, the maximal network size is usually restricted dramatically to a small set of genes (corresponding with variables in the Bayesian network). Although this feature reduction step makes structure learning computationally tractable, on the downside, the learned structure might be adversely affected due to the introduction of missing genes. Additionally, gene expression data are usually very sparse with respect to the number of samples, i.e., the number of genes is much greater than the number of different observations. Given these problems, learning robust network features from microarray data is a challenging task. This chapter presents several approaches tackling the robustness issue in order to obtain a more reliable estimation of learned network features.

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.

On a New Variance Reduction Technique: Neural Network Biasing-a Study of Two Test Cases with the Monte Carlo Code Tripoli4

International Nuclear Information System (INIS)

Dumonteil, E.

2009-01-01

Various variance-reduction techniques are used in Monte Carlo particle transport. Most of them rely either on a hypothesis made by the user (parameters of the exponential biasing, mesh and weight bounds for weight windows, etc.) or on a previous calculation of the system with, for example, a deterministic solver. This paper deals with a new acceleration technique, namely, auto-adaptative neural network biasing. Indeed, instead of using any a priori knowledge of the system, it is possible, at a given point in a simulation, to use the Monte Carlo histories previously simulated to train a neural network, which, in return, should be able to provide an estimation of the adjoint flux, used then for biasing the simulation. We will describe this method, detail its implementation in the Monte Carlo code Tripoli4, and discuss its results on two test cases. (author)

Causal Inference and Explaining Away in a Spiking Network

Science.gov (United States)

Moreno-Bote, Rubén; Drugowitsch, Jan

2015-01-01

While the brain uses spiking neurons for communication, theoretical research on brain computations has mostly focused on non-spiking networks. The nature of spike-based algorithms that achieve complex computations, such as object probabilistic inference, is largely unknown. Here we demonstrate that a family of high-dimensional quadratic optimization problems with non-negativity constraints can be solved exactly and efficiently by a network of spiking neurons. The network naturally imposes the non-negativity of causal contributions that is fundamental to causal inference, and uses simple operations, such as linear synapses with realistic time constants, and neural spike generation and reset non-linearities. The network infers the set of most likely causes from an observation using explaining away, which is dynamically implemented by spike-based, tuned inhibition. The algorithm performs remarkably well even when the network intrinsically generates variable spike trains, the timing of spikes is scrambled by external sources of noise, or the network is mistuned. This type of network might underlie tasks such as odor identification and classification. PMID:26621426

A Sufficient Condition on Convex Relaxation of AC Optimal Power Flow in Distribution Networks

DEFF Research Database (Denmark)

Huang, Shaojun; Wu, Qiuwei; Wang, Jianhui

2016-01-01

This paper proposes a sufficient condition for the convex relaxation of AC Optimal Power Flow (OPF) in radial distribution networks as a second order cone program (SOCP) to be exact. The condition requires that the allowed reverse power flow is only reactive or active, or none. Under the proposed...... solution of the SOCP can be converted to an optimal solution of the original AC OPF. The efficacy of the convex relaxation to solve the AC OPF is demonstrated by case studies of an optimal multi-period planning problem of electric vehicles (EVs) in distribution networks....... sufficient condition, the feasible sub-injection region (power injections of nodes excluding the root node) of the AC OPF is convex. The exactness of the convex relaxation under the proposed condition is proved through constructing a group of monotonic series with limits, which ensures that the optimal...

New Exact Travelling Wave and Periodic Solutions of Discrete Nonlinear Schroedinger Equation

International Nuclear Information System (INIS)

Yang Qin; Dai Chaoqing; Zhang Jiefang

2005-01-01

Some new exact travelling wave and period solutions of discrete nonlinear Schroedinger equation are found by using a hyperbolic tangent function approach, which was usually presented to find exact travelling wave solutions of certain nonlinear partial differential models. Now we can further extend the new algorithm to other nonlinear differential-different models.

An Exact Line Integral Representation of the Magnetic Physical Optics Scattered Field

DEFF Research Database (Denmark)

Meincke, Peter; Breinbjerg, Olav; Jørgensen, Erik

2003-01-01

An exact line integral representation is derived for the magnetic physical optics field scattered by a perfectly electrically conducting planar plate illuminated by electric or magnetic Hertzian dipoles. The positions of source and observation points can be almost arbitrary. Numerical examples...... are presented to illustrate the exactness of the line integral representation....

Exact and Optimal Quantum Mechanics/Molecular Mechanics Boundaries.

Science.gov (United States)

Sun, Qiming; Chan, Garnet Kin-Lic

2014-09-09

Motivated by recent work in density matrix embedding theory, we define exact link orbitals that capture all quantum mechanical (QM) effects across arbitrary quantum mechanics/molecular mechanics (QM/MM) boundaries. Exact link orbitals are rigorously defined from the full QM solution, and their number is equal to the number of orbitals in the primary QM region. Truncating the exact set yields a smaller set of link orbitals optimal with respect to reproducing the primary region density matrix. We use the optimal link orbitals to obtain insight into the limits of QM/MM boundary treatments. We further analyze the popular general hybrid orbital (GHO) QM/MM boundary across a test suite of molecules. We find that GHOs are often good proxies for the most important optimal link orbital, although there is little detailed correlation between the detailed GHO composition and optimal link orbital valence weights. The optimal theory shows that anions and cations cannot be described by a single link orbital. However, expanding to include the second most important optimal link orbital in the boundary recovers an accurate description. The second optimal link orbital takes the chemically intuitive form of a donor or acceptor orbital for charge redistribution, suggesting that optimal link orbitals can be used as interpretative tools for electron transfer. We further find that two optimal link orbitals are also sufficient for boundaries that cut across double bonds. Finally, we suggest how to construct "approximately" optimal link orbitals for practical QM/MM calculations.

Dynamic Programming Approach for Exact Decision Rule Optimization

KAUST Repository

Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2013-01-01

This chapter is devoted to the study of an extension of dynamic programming approach that allows sequential optimization of exact decision rules relative to the length and coverage. It contains also results of experiments with decision tables from

Exact travelling wave solutions for some important nonlinear ...

Indian Academy of Sciences (India)

The study of nonlinear partial differential equations is an active area of research in applied mathematics, theoretical physics and engineering fields. In particular ... In [16–18], the author applied this method to construct the exact solutions of.

Exact Solutions for Nonlinear Differential Difference Equations in Mathematical Physics

Directory of Open Access Journals (Sweden)

Khaled A. Gepreel

2013-01-01

Full Text Available We modified the truncated expansion method to construct the exact solutions for some nonlinear differential difference equations in mathematical physics via the general lattice equation, the discrete nonlinear Schrodinger with a saturable nonlinearity, the quintic discrete nonlinear Schrodinger equation, and the relativistic Toda lattice system. Also, we put a rational solitary wave function method to find the rational solitary wave solutions for some nonlinear differential difference equations. The proposed methods are more effective and powerful to obtain the exact solutions for nonlinear difference differential equations.

Exact wavefunctions for a time-dependent Coulomb potential

International Nuclear Information System (INIS)

Menouar, S; Maamache, M; Saadi, Y; Choi, J R

2008-01-01

The one-dimensional Schroedinger equation associated with a time-dependent Coulomb potential is studied. The invariant operator method (Lewis and Riesenfeld) and unitary transformation approach are employed to derive quantum solutions of the system. We obtain an ordinary second-order differential equation whose analytical exact solution has been unknown. It is confirmed that the form of this equation is similar to the radial Schroedinger equation for the hydrogen atom in a (arbitrary) strong magnetic field. The qualitative properties for the eigenstates spectrum are described separately for the different values of the parameter ω 0 appearing in the x 2 term, x being the position, i.e., ω 0 > 0, ω 0 0 = 0. For the ω 0 = 0 case, the eigenvalue equation of invariant operator reduces to a solvable form and, consequently, we have provided exact eigenstates of the time-dependent Hamiltonian system

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.

Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding

KAUST Repository

Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-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 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.

The modified simplest equation method to look for exact solutions of nonlinear partial differential equations

OpenAIRE

Efimova, Olga Yu.

2010-01-01

The modification of simplest equation method to look for exact solutions of nonlinear partial differential equations is presented. Using this method we obtain exact solutions of generalized Korteweg-de Vries equation with cubic source and exact solutions of third-order Kudryashov-Sinelshchikov equation describing nonlinear waves in liquids with gas bubbles.

Reduction of nuclear moment of inertia due to pairing interaction

International Nuclear Information System (INIS)

Zeng, J.Y.; Jin, T.H.; Zhao, Z.J.

1994-01-01

The BCS theoretical values of the moments of inertia of even-even nuclei are systematically smaller than the experimental ones by a factor of 10--40%. This long-standing discrepancy disappears in the particle-number-conserving treatment for the cranked shell model, in which the blocking effects are taken into account exactly. The calculated moments of inertia satisfactorily reproduce the experimental data covering a large number of rare-earth even-even nuclei, whose deformations and single-particle states are well characterized (Lund systematics). The pairing interaction strength G is unambiguously determined by the even-odd mass difference. The reduction of the moment of inertia due to the antialignment effect of pairing interaction is discussed and no systematic excessive reduction is found

Unified Tractable Model for Large-Scale Networks Using Stochastic Geometry: Analysis and Design

KAUST Repository

Afify, Laila H.

2016-12-01

The ever-growing demands for wireless technologies necessitate the evolution of next generation wireless networks that fulfill the diverse wireless users requirements. However, upscaling existing wireless networks implies upscaling an intrinsic component in the wireless domain; the aggregate network interference. Being the main performance limiting factor, it becomes crucial to develop a rigorous analytical framework to accurately characterize the out-of-cell interference, to reap the benefits of emerging networks. Due to the different network setups and key performance indicators, it is essential to conduct a comprehensive study that unifies the various network configurations together with the different tangible performance metrics. In that regard, the focus of this thesis is to present a unified mathematical paradigm, based on Stochastic Geometry, for large-scale networks with different antenna/network configurations. By exploiting such a unified study, we propose an efficient automated network design strategy to satisfy the desired network objectives. First, this thesis studies the exact aggregate network interference characterization, by accounting for each of the interferers signals in the large-scale network. Second, we show that the information about the interferers symbols can be approximated via the Gaussian signaling approach. The developed mathematical model presents twofold analysis unification for uplink and downlink cellular networks literature. It aligns the tangible decoding error probability analysis with the abstract outage probability and ergodic rate analysis. Furthermore, it unifies the analysis for different antenna configurations, i.e., various multiple-input multiple-output (MIMO) systems. Accordingly, we propose a novel reliable network design strategy that is capable of appropriately adjusting the network parameters to meet desired design criteria. In addition, we discuss the diversity-multiplexing tradeoffs imposed by differently favored

An exact model for airline flight network optimization based on transport momentum and aircraft load factor

Directory of Open Access Journals (Sweden)

Daniel Jorge Caetano

2017-12-01

Full Text Available The problem of airline flight network optimization can be split into subproblems such as Schedule Generation (SG and Fleet Assignment (FA, solved in consecutive steps or in an integrated way, usually based on monetary costs and revenue forecasts. A linear pro­gramming model to solve SG and FA in an integrated way is presented, but with an al­ternative approach based on transport momentum and aircraft load factor. This alterna­tive approach relies on demand forecast and allows obtaining solutions considering min­imum average load factors. Results of the proposed model applications to instances of a regional Brazilian airline are presented. The comparison of the schedules generated by the proposed approach against those obtained by applying a model based on mone­tary costs and revenue forecasts demonstrates the validity of this alternative approach for airlines network planning.

Drag reduction of nata de coco suspensions in circular pipe flow

Science.gov (United States)

Warashina, J.; Ogata, S.

2015-04-01

Reducing pipe friction by adding a drag-reducing agent has attracted interest as a means to reduce energy consumption. In addition to reducing drag, these agents are required to have a low environmental load and conserve natural resources. However, no drag-reducing agent currently satisfies both these conditions. We focused on nata de coco and found that the nata de coco fiber reduced drag by up to 25%. With respect to the mechanism of drag reduction by nata de coco fiber, the relationship between drag-reduction phenomena and the fiber form of nata de coco was investigated by visualization. We also found that the drag-reduction effect appeared to be due to the formation of networks of tangled fibers of nata de coco. However, drag reduction did not occur in the case in which fibers of nata de coco did not form networks.

Exactly soluble two-state quantum models with linear couplings

International Nuclear Information System (INIS)

Torosov, B T; Vitanov, N V

2008-01-01

A class of exact analytic solutions of the time-dependent Schroedinger equation is presented for a two-state quantum system coherently driven by a nonresonant external field. The coupling is a linear function of time with a finite duration and the detuning is constant. Four special models are considered in detail, namely the shark, double-shark, tent and zigzag models. The exact solution is derived by rotation of the Landau-Zener propagator at an angle of π/4 and is expressed in terms of Weber's parabolic cylinder function. Approximations for the transition probabilities are derived for all four models by using the asymptotics of the Weber function; these approximations demonstrate various effects of physical interest for each model

Watermelon configurations with wall interaction: exact and asymptotic results

Energy Technology Data Exchange (ETDEWEB)

Krattenthaler, C [Institut Camille Jordan, Universite Claude Bernard Lyon-I, 21, avenue Claude Bernard, F-69622 Villeurbanne Cedex (France)

2006-06-15

We perform an exact and asymptotic analysis of the model of n vicious walkers interacting with a wall via contact potentials, a model introduced by Brak, Essam and Owczarek. More specifically, we study the partition function of watermelon configurations which start on the wall, but may end at arbitrary height, and their mean number of contacts with the wall. We improve and extend the earlier (partially nonrigorous) results by Brak, Essam and Owczarek, providing new exact results, and more precise and more general asymptotic results, in particular full asymptotic expansions for the partition function and the mean number of contacts. Furthermore, we relate this circle of problems to earlier results in the combinatorial and statistical literature.

Watermelon configurations with wall interaction: exact and asymptotic results

International Nuclear Information System (INIS)

Krattenthaler, C

2006-01-01

We perform an exact and asymptotic analysis of the model of n vicious walkers interacting with a wall via contact potentials, a model introduced by Brak, Essam and Owczarek. More specifically, we study the partition function of watermelon configurations which start on the wall, but may end at arbitrary height, and their mean number of contacts with the wall. We improve and extend the earlier (partially nonrigorous) results by Brak, Essam and Owczarek, providing new exact results, and more precise and more general asymptotic results, in particular full asymptotic expansions for the partition function and the mean number of contacts. Furthermore, we relate this circle of problems to earlier results in the combinatorial and statistical literature

Watermelon configurations with wall interaction: exact and asymptotic results

Science.gov (United States)

Krattenthaler, C.

2006-06-01

We perform an exact and asymptotic analysis of the model of n vicious walkers interacting with a wall via contact potentials, a model introduced by Brak, Essam and Owczarek. More specifically, we study the partition function of watermelon configurations which start on the wall, but may end at arbitrary height, and their mean number of contacts with the wall. We improve and extend the earlier (partially nonrigorous) results by Brak, Essam and Owczarek, providing new exact results, and more precise and more general asymptotic results, in particular full asymptotic expansions for the partition function and the mean number of contacts. Furthermore, we relate this circle of problems to earlier results in the combinatorial and statistical literature.

Exact combinatorial approach to finite coagulating systems

Science.gov (United States)

Fronczak, Agata; Chmiel, Anna; Fronczak, Piotr

2018-02-01

This paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, an exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the average number of such clusters, and that average's standard deviation. The correctness of our general expressions is proved based on the (analytical and numerical) results obtained for systems with the constant kernel. In addition, the results obtained are compared with the results arising from the solutions to the mean-field Smoluchowski coagulation equation, indicating its weak points. The paper closes with a brief discussion on the extensibility to other systems of the approach presented herein, emphasizing the issue of arbitrary initial conditions.

Exact and Heuristic Algorithms for Runway Scheduling

Science.gov (United States)

Malik, Waqar A.; Jung, Yoon C.

2016-01-01

This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.

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.

The exact equation of motion of a simple pendulum of arbitrary amplitude: a hypergeometric approach

International Nuclear Information System (INIS)

Qureshi, M I; Rafat, M; Azad, S Ismail

2010-01-01

The motion of a simple pendulum of arbitrary amplitude is usually treated by approximate methods. By using generalized hypergeometric functions, it is however possible to solve the problem exactly. In this paper, we provide the exact equation of motion of a simple pendulum of arbitrary amplitude. A new and exact expression for the time of swinging of a simple pendulum from the vertical position to an arbitrary angular position θ is given by equation (3.10). The time period of such a pendulum is also exactly expressible in terms of hypergeometric functions. The exact expressions thus obtained are used to plot the graphs that compare the exact time period T(θ 0 ) with the time period T(0) (based on simple harmonic approximation). We also compare the relative difference between T(0) and T(θ 0 ) found from the exact equation of motion with the usual perturbation theory estimate. The treatment is intended for graduate students, who have acquired some familiarity with the hypergeometric functions. This approach may also be profitably used by specialists who encounter during their investigations nonlinear differential equations similar in form to the pendulum equation. Such nonlinear differential equations could arise in diverse fields, such as acoustic vibrations, oscillations in small molecules, turbulence and electronic filters, among others.

Managing the PSTN transformation a blueprint for a successful migration to IP-based networks

CERN Document Server

Dornheim, Sandra

2015-01-01

While there are many scholarly books and papers that cover the technical issues behind the public switched telephone network (PSTN) migration, few books describe exactly how to manage the migration process economically. Filling this need, Managing the PSTN Transformation: A Blueprint for a Successful Migration to IP-Based Networks reflects the latest understanding of the challenges behind migrating customers from the old PSTN network to an IP infrastructure. The IP transformation blueprint described in this book is not a theoretical cookbook that describes how this could work. Instead, the boo

Exact results for the spectra of bosons and fermions with contact interaction

Energy Technology Data Exchange (ETDEWEB)

Mashkevich, Stefan [Schroedinger, 120 West 45th St., New York, NY 10036 (United States)]. E-mail: mash@mashke.org; Matveenko, Sergey [Landau Institute for Theoretical Physics, Kosygina Str. 2, 119334 Moscow (Russian Federation)]. E-mail: matveen@landau.ac.ru; Ouvry, Stephane [Laboratoire de Physique Theorique et Modeles Statistiques, Unite de Recherche de l' Universite Paris 11 associee au CNRS, UMR 8626., Bat. 100, Universite Paris-Sud, 91405 Orsay (France)]. E-mail: ouvry@lptms.u-psud.fr

2007-02-19

An N-body bosonic model with delta-contact interactions projected on the lowest Landau level is considered. For a given number of particles in a given angular momentum sector, any energy level can be obtained exactly by means of diagonalizing a finite matrix: they are roots of algebraic equations. A complete solution of the three-body problem is presented, some general properties of the N-body spectrum are pointed out, and a number of novel exact analytic eigenstates are obtained. The FQHE N-fermion model with Laplacian-delta interactions is also considered along the same lines of analysis. New exact eigenstates are proposed, along with the Slater determinant, whose eigenvalues are shown to be related to Catalan numbers.

The Vulnerability of Some Networks including Cycles via Domination Parameters

Directory of Open Access Journals (Sweden)

Tufan Turaci

2016-01-01

Full Text Available Let G=(V(G,E(G be an undirected simple connected graph. A network is usually represented by an undirected simple graph where vertices represent processors and edges represent links between processors. Finding the vulnerability values of communication networks modeled by graphs is important for network designers. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. The domination number and its variations are the most important vulnerability parameters for network vulnerability. Some variations of domination numbers are the 2-domination number, the bondage number, the reinforcement number, the average lower domination number, the average lower 2-domination number, and so forth. In this paper, we study the vulnerability of cycles and related graphs, namely, fans, k-pyramids, and n-gon books, via domination parameters. Then, exact solutions of the domination parameters are obtained for the above-mentioned graphs.

Continuous-time quantum walks on multilayer dendrimer networks

Science.gov (United States)

Galiceanu, Mircea; Strunz, Walter T.

2016-08-01

We consider continuous-time quantum walks (CTQWs) on multilayer dendrimer networks (MDs) and their application to quantum transport. A detailed study of properties of CTQWs is presented and transport efficiency is determined in terms of the exact and average return probabilities. The latter depends only on the eigenvalues of the connectivity matrix, which even for very large structures allows a complete analytical solution for this particular choice of network. In the case of MDs we observe an interplay between strong localization effects, due to the dendrimer topology, and good efficiency from the linear segments. We show that quantum transport is enhanced by interconnecting more layers of dendrimers.

A TLD dose algorithm using artificial neural networks

International Nuclear Information System (INIS)

Moscovitch, M.; Rotunda, J.E.; Tawil, R.A.; Rathbone, B.A.

1995-01-01

An artificial neural network was designed and used to develop a dose algorithm for a multi-element thermoluminescence dosimeter (TLD). The neural network architecture is based on the concept of functional links network (FLN). Neural network is an information processing method inspired by the biological nervous system. A dose algorithm based on neural networks is fundamentally different as compared to conventional algorithms, as it has the capability to learn from its own experience. The neural network algorithm is shown the expected dose values (output) associated with given responses of a multi-element dosimeter (input) many times. The algorithm, being trained that way, eventually is capable to produce its own unique solution to similar (but not exactly the same) dose calculation problems. For personal dosimetry, the output consists of the desired dose components: deep dose, shallow dose and eye dose. The input consists of the TL data obtained from the readout of a multi-element dosimeter. The neural network approach was applied to the Harshaw Type 8825 TLD, and was shown to significantly improve the performance of this dosimeter, well within the U.S. accreditation requirements for personnel dosimeters

Canonical transformations and exact invariants for dissipative systems

International Nuclear Information System (INIS)

Pedrosa, I.A.

1986-01-01

A simple treatment to the problem of finding exact invariants and related auxiliary equations for time-dependent oscillators with friction is presented. The treatment is based on the use of a time-dependent canonical transformation and an auxiliary transformation. (Author) [pt

SEIR Model of Rumor Spreading in Online Social Network with Varying Total Population Size

International Nuclear Information System (INIS)

Dong Suyalatu; Deng Yan-Bin; Huang Yong-Chang

2017-01-01

Based on the infectious disease model with disease latency, this paper proposes a new model for the rumor spreading process in online social network. In this paper what we establish an SEIR rumor spreading model to describe the online social network with varying total number of users and user deactivation rate. We calculate the exact equilibrium points and reproduction number for this model. Furthermore, we perform the rumor spreading process in the online social network with increasing population size based on the original real world Facebook network. The simulation results indicate that the SEIR model of rumor spreading in online social network with changing total number of users can accurately reveal the inherent characteristics of rumor spreading process in online social network . (paper)

Exact Solutions of Five Complex Nonlinear Schrödinger Equations by Semi-Inverse Variational Principle

International Nuclear Information System (INIS)

Najafi Mohammad; Arbabi Somayeh

2014-01-01

In this paper, we establish exact solutions for five complex nonlinear Schrödinger equations. The semi-inverse variational principle (SVP) is used to construct exact soliton solutions of five complex nonlinear Schrödinger equations. Many new families of exact soliton solutions of five complex nonlinear Schrödinger equations are successfully obtained. (general)

Liner Service Network Design

DEFF Research Database (Denmark)

Brouer, Berit Dangaard

. 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...... management is of great concern to liner shippers as 70-80% of vessel round trips experience delays in at least one port. A novel mathematical model for handling a disruption using a series of recovery techniques is presented as the The Vessel Schedule Recovery Problem. The model has been applied to four real...... is based upon improving the constructed solution by applying an IP model as a large scale neighbourhood to each service in the network. The IP is based on estimating the benefit of inserting and removing port calls within a predefined neighborhood of candidate ports. Furthermore, the heuristic applies...

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.

Integrated built-in-test false and missed alarms reduction based on forward infinite impulse response & recurrent finite impulse response dynamic neural networks

Science.gov (United States)

Cui, Yiqian; Shi, Junyou; Wang, Zili

2017-11-01

Built-in tests (BITs) are widely used in mechanical systems to perform state identification, whereas the BIT false and missed alarms cause trouble to the operators or beneficiaries to make correct judgments. Artificial neural networks (ANN) are previously used for false and missed alarms identification, which has the features such as self-organizing and self-study. However, these ANN models generally do not incorporate the temporal effect of the bottom-level threshold comparison outputs and the historical temporal features are not fully considered. To improve the situation, this paper proposes a new integrated BIT design methodology by incorporating a novel type of dynamic neural networks (DNN) model. The new DNN model is termed as Forward IIR & Recurrent FIR DNN (FIRF-DNN), where its component neurons, network structures, and input/output relationships are discussed. The condition monitoring false and missed alarms reduction implementation scheme based on FIRF-DNN model is also illustrated, which is composed of three stages including model training, false and missed alarms detection, and false and missed alarms suppression. Finally, the proposed methodology is demonstrated in the application study and the experimental results are analyzed.

Exact Rational Expectations, Cointegration, and Reduced Rank Regression

DEFF Research Database (Denmark)

Johansen, Søren; Swensen, Anders Rygh

We interpret the linear relations from exact rational expectations models as restrictions on the parameters of the statistical model called the cointegrated vector autoregressive model for non-stationary variables. We then show how reduced rank regression, Anderson (1951), plays an important role...

Exact rational expectations, cointegration, and reduced rank regression

DEFF Research Database (Denmark)

Johansen, Søren; Swensen, Anders Rygh

We interpret the linear relations from exact rational expectations models as restrictions on the parameters of the statistical model called the cointegrated vector autoregressive model for non-stationary variables. We then show how reduced rank regression, Anderson (1951), plays an important role...

Exact rational expectations, cointegration, and reduced rank regression

DEFF Research Database (Denmark)

Johansen, Søren; Swensen, Anders Rygh

2008-01-01

We interpret the linear relations from exact rational expectations models as restrictions on the parameters of the statistical model called the cointegrated vector autoregressive model for non-stationary variables. We then show how reduced rank regression, Anderson (1951), plays an important role...

An exact approach for studying cargo transport by an ensemble of molecular motors

International Nuclear Information System (INIS)

Materassi, Donatello; Roychowdhury, Subhrajit; Hays, Thomas; Salapaka, Murti

2013-01-01

Intracellular transport is crucial for many cellular processes where a large fraction of the cargo is transferred by motor-proteins over a network of microtubules. Malfunctions in the transport mechanism underlie a number of medical maladies. Existing methods for studying how motor-proteins coordinate the transfer of a shared cargo over a microtubule are either analytical or are based on Monte-Carlo simulations. Approaches that yield analytical results, while providing unique insights into transport mechanism, make simplifying assumptions, where a detailed characterization of important transport modalities is difficult to reach. On the other hand, Monte-Carlo based simulations can incorporate detailed characteristics of the transport mechanism; however, the quality of the results depend on the number and quality of simulation runs used in arriving at results. Here, for example, it is difficult to simulate and study rare-events that can trigger abnormalities in transport. In this article, a semi-analytical methodology that determines the probability distribution function of motor-protein behavior in an exact manner is developed. The method utilizes a finite-dimensional projection of the underlying infinite-dimensional Markov model, which retains the Markov property, and enables the detailed and exact determination of motor configurations, from which meaningful inferences on transport characteristics of the original model can be derived. Under this novel probabilistic approach new insights about the mechanisms of action of these proteins are found, suggesting hypothesis about their behavior and driving the design and realization of new experiments. The advantages provided in accuracy and efficiency make it possible to detect rare events in the motor protein dynamics, that could otherwise pass undetected using standard simulation methods. In this respect, the model has allowed to provide a possible explanation for possible mechanisms under which motor proteins could

Reactive power compensation and loss reduction in large industrial enterprises

Energy Technology Data Exchange (ETDEWEB)

Jovanovic, S; Gajic, B; Mijailovic, S [Institute Nikola Tesla, Beograd (Yugoslavia)

1991-12-01

This paper considers the reactive power compensation and the active power and energy loss reduction of large radial power networks in the Serbian mine and smelting industry. It gives an efficient optimization procedure for positioning and sizing capacitors in large industrial systems integrated with a simple network analysis method. (Author).

Exact time-dependent exchange-correlation potentials for strong-field electron dynamics

International Nuclear Information System (INIS)

Lein, Manfred; Kuemmel, Stephan

2005-01-01

By solving the time-dependent Schroedinger equation and inverting the time-dependent Kohn-Sham scheme we obtain the exact time-dependent exchange-correlation potential of density-functional theory for the strong-field dynamics of a correlated system. We demonstrate that essential features of the exact exchange-correlation potential can be related to derivative discontinuities in stationary density-functional theory. Incorporating the discontinuity in a time-dependent density-functional calculation greatly improves the description of the ionization process

Non-Fermi-liquid behavior: Exact results for ensembles of magnetic impurities

CERN Document Server

Zvyagin, A A

2002-01-01

In this work we consider several exactly solvable models of magnetic impurities in critical quantum antiferromagnetic spin chains and multichannel Kondo impurities. Their ground state properties are studied and the finite set of nonlinear integral equations, which exactly describe the thermodynamics of the models, is constructed. We obtain several analytic low-energy expressions for the temperature, magnetic field, and frequency dependences of important characteristics of exactly solvable disordered quantum spin models and disordered multichannel Kondo impurities with essential many-body interactions. We show that the only low-energy parameter that gets renormalized is the velocity of the low-lying excitations (or the effective crossover scale connected with each impurity); the others appear to be universal. In our study several kinds of strong disorder important for experiments were used. Some of them produce low divergences in certain characteristics of our strongly disordered critical systems (compared wit...

Less is more : data reduction in wireless sensor networks

NARCIS (Netherlands)

Masoum, Alireza

2018-01-01

Wireless sensor networks are monitoring systems consisting of many small, low-cost and low-power devices called sensor nodes. A large number of sensor nodes are deployed in an environment to monitor a physical phenomenon, execute light processes on collected data, and send either raw data or

Redundancy reduction in wireless sensor networks via centrality metrics

NARCIS (Netherlands)

Mocanu, D.C.; Torres Vega, M.; Liotta, A.; Cui, P.; Aggarwal, C.; Zhou, Z.-H.; Tuzhilin, A.; Xiong, H.; Wu, X.

2015-01-01

The advances in wireless communications, together with the need of sensing and controlling various nature or human made systems in a large number of points (e.g. smart traffic control, environmental monitoring), lead to the emergence of Wireless Sensor Networks (WSN) as a powerful tool to fulfill

Power Control in Wireless Sensor Networks with Variable Interference

Directory of Open Access Journals (Sweden)

Michele Chincoli

2016-01-01

Full Text Available Adaptive transmission power control schemes have been introduced in wireless sensor networks to adjust energy consumption under different network conditions. This is a crucial goal, given the constraints under which sensor communications operate. Power reduction may however have counterproductive effects to network performance. Yet, indiscriminate power boosting may detrimentally affect interference. We are interested in understanding the conditions under which coordinated power reduction may lead to better spectrum efficiency and interference mitigation and, thus, have beneficial effects on network performance. Through simulations, we analyze the performance of sensor nodes in an environment with variable interference. Then we study the relation between transmission power and communication efficiency, particularly in the context of Adaptive and Robust Topology (ART control, showing how appropriate power reduction can benefit both energy and spectrum efficiency. We also identify critical limitations in ART, discussing the potential of more cooperative power control approaches.

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.

Group handoff management in low power microcell-femtocell network

Directory of Open Access Journals (Sweden)

Debashis De

2017-02-01

Full Text Available This paper presents an analytical model of group based hand-off management based on bird flocking behavior. In the proposed scheme, a number of mobile devices form a group if these devices move together for a long time duration. Although call delivery or call generation are performed individually, hand-off is performed in a group. Dynamic group formation, group division and group merging methods are proposed in this paper. From the simulation results it is demonstrated that approximately 75%, 65% and 90% reduction in power, cost and latency consumption can be obtained respectively using group hand-off management. Thus the proposed scheme is referred as green, economic and fast hand-off strategy. In this paper instead of a macrocell network, a microcell-femtocell network is considered as the transmission power of a microcell or a femtocell base station is much less than a macrocell base station. Simulation results present that the microcell-femtocell network achieves approximately 25–55% and 35–55% reduction in power transmission, and 50–65% and 15–45% reduction in path loss than only a macrocell network and macrocell-femtocell network respectively. Thus microcell-femtocell network is a power-efficient network.

Fingering patterns in magnetic fluids: Perturbative solutions and the stability of exact stationary shapes

Science.gov (United States)

Anjos, Pedro H. A.; Lira, Sérgio A.; Miranda, José A.

2018-04-01

We examine the formation of interfacial patterns when a magnetic liquid droplet (ferrofluid, or a magnetorheological fluid), surrounded by a nonmagnetic fluid, is subjected to a radial magnetic field in a Hele-Shaw cell. By using a vortex-sheet formalism, we find exact stationary solutions for the fluid-fluid interface in the form of n -fold polygonal shapes. A weakly nonlinear, mode-coupling method is then utilized to find time-evolving perturbative solutions for the interfacial patterns. The stability of such nonzero surface tension exact solutions is checked and discussed, by trying to systematically approach the exact stationary shapes through perturbative solutions containing an increasingly larger number of participating Fourier modes. Our results indicate that the exact stationary solutions of the problem are stable, and that a good matching between exact and perturbative shape solutions is achieved just by using a few Fourier modes. The stability of such solutions is substantiated by a linearization process close to the stationary shape, where a system of mode-coupling equations is diagonalized, determining the eigenvalues which dictate the stability of a fixed point.

Parameter-free Network Sparsification and Data Reduction by Minimal Algorithmic Information Loss

KAUST Repository

Zenil, Hector; Kiani, Narsis A.; Tegner, Jesper

2018-01-01

The study of large and complex datasets, or big data, organized as networks has emerged as one of the central challenges in most areas of science and technology. Cellular and molecular networks in biology is one of the prime examples. Henceforth, a

Periodicity and stability for variable-time impulsive neural networks.

Science.gov (United States)

Li, Hongfei; Li, Chuandong; Huang, Tingwen

2017-10-01

The paper considers a general neural networks model with variable-time impulses. It is shown that each solution of the system intersects with every discontinuous surface exactly once via several new well-proposed assumptions. Moreover, based on the comparison principle, this paper shows that neural networks with variable-time impulse can be reduced to the corresponding neural network with fixed-time impulses under well-selected conditions. Meanwhile, the fixed-time impulsive systems can be regarded as the comparison system of the variable-time impulsive neural networks. Furthermore, a series of sufficient criteria are derived to ensure the existence and global exponential stability of periodic solution of variable-time impulsive neural networks, and to illustrate the same stability properties between variable-time impulsive neural networks and the fixed-time ones. The new criteria are established by applying Schaefer's fixed point theorem combined with the use of inequality technique. Finally, a numerical example is presented to show the effectiveness of the proposed results. Copyright © 2017 Elsevier Ltd. All rights reserved.

A trial of beclomethasone/formoterol in COPD using EXACT-PRO to measure exacerbations

DEFF Research Database (Denmark)

Singh, Dave; Kampschulte, Jorg; Wedzicha, Jadwiga A

2013-01-01

-primary outcome, and the Exacerbations of Chronic Pulmonary Disease Tool (EXACT) means of collecting patient-reported outcome data are also being used to enhance the detection of exacerbation events. EXACT data are being collected using a novel application of a digital platform technology. FORWARD is therefore...

Exact solutions of continuous states for Hartmann potential

International Nuclear Information System (INIS)

Chen Changyuan; Lu Falin; Sun Dongsheng

2004-01-01

In this Letter, we obtain the exact solutions of continuous states for the Hartmann potential. The normalized wave functions of continuous states on the 'k/2π scale' and the calculation formula of phase shifts are presented. Analytical properties of the scattering amplitude are discussed

About simple nonlinear and linear superpositions of special exact solutions of Veselov-Novikov equation

Energy Technology Data Exchange (ETDEWEB)

Dubrovsky, V. G.; Topovsky, A. V. [Novosibirsk State Technical University, Karl Marx prosp. 20, Novosibirsk 630092 (Russian Federation)

2013-03-15

New exact solutions, nonstationary and stationary, of Veselov-Novikov (VN) equation in the forms of simple nonlinear and linear superpositions of arbitrary number N of exact special solutions u{sup (n)}, n= 1, Horizontal-Ellipsis , N are constructed via Zakharov and Manakov {partial_derivative}-dressing method. Simple nonlinear superpositions are represented up to a constant by the sums of solutions u{sup (n)} and calculated by {partial_derivative}-dressing on nonzero energy level of the first auxiliary linear problem, i.e., 2D stationary Schroedinger equation. It is remarkable that in the zero energy limit simple nonlinear superpositions convert to linear ones in the form of the sums of special solutions u{sup (n)}. It is shown that the sums u=u{sup (k{sub 1})}+...+u{sup (k{sub m})}, 1 Less-Than-Or-Slanted-Equal-To k{sub 1} < k{sub 2} < Horizontal-Ellipsis < k{sub m} Less-Than-Or-Slanted-Equal-To N of arbitrary subsets of these solutions are also exact solutions of VN equation. The presented exact solutions include as superpositions of special line solitons and also superpositions of plane wave type singular periodic solutions. By construction these exact solutions represent also new exact transparent potentials of 2D stationary Schroedinger equation and can serve as model potentials for electrons in planar structures of modern electronics.

Achievable peak electrode voltage reduction by neurostimulators using descending staircase currents to deliver charge.

Science.gov (United States)

Halpern, Mark

2011-01-01

This paper considers the achievable reduction in peak voltage across two driving terminals of an RC circuit when delivering charge using a stepped current waveform, comprising a chosen number of steps of equal duration, compared with using a constant current over the total duration. This work has application to the design of neurostimulators giving reduced peak electrode voltage when delivering a given electric charge over a given time duration. Exact solutions for the greatest possible peak voltage reduction using two and three steps are given. Furthermore, it is shown that the achievable peak voltage reduction, for any given number of steps is identical for simple series RC circuits and parallel RC circuits, for appropriate different values of RC. It is conjectured that the maximum peak voltage reduction cannot be improved using a more complicated RC circuit.

Network-based functional enrichment

Directory of Open Access Journals (Sweden)

Poirel Christopher L

2011-11-01

Full Text Available Abstract Background Many methods have been developed to infer and reason about molecular interaction networks. These approaches often yield networks with hundreds or thousands of nodes and up to an order of magnitude more edges. It is often desirable to summarize the biological information in such networks. A very common approach is to use gene function enrichment analysis for this task. A major drawback of this method is that it ignores information about the edges in the network being analyzed, i.e., it treats the network simply as a set of genes. In this paper, we introduce a novel method for functional enrichment that explicitly takes network interactions into account. Results Our approach naturally generalizes Fisher’s exact test, a gene set-based technique. Given a function of interest, we compute the subgraph of the network induced by genes annotated to this function. We use the sequence of sizes of the connected components of this sub-network to estimate its connectivity. We estimate the statistical significance of the connectivity empirically by a permutation test. We present three applications of our method: i determine which functions are enriched in a given network, ii given a network and an interesting sub-network of genes within that network, determine which functions are enriched in the sub-network, and iii given two networks, determine the functions for which the connectivity improves when we merge the second network into the first. Through these applications, we show that our approach is a natural alternative to network clustering algorithms. Conclusions We presented a novel approach to functional enrichment that takes into account the pairwise relationships among genes annotated by a particular function. Each of the three applications discovers highly relevant functions. We used our methods to study biological data from three different organisms. Our results demonstrate the wide applicability of our methods. Our algorithms are

New exact solutions for two nonlinear equations

International Nuclear Information System (INIS)

Wang Quandi; Tang Minying

2008-01-01

In this Letter, we investigate two nonlinear equations given by u t -u xxt +3u 2 u x =2u x u xx +uu xxx and u t -u xxt +4u 2 u x =3u x u xx +uu xxx . Through some special phase orbits we obtain four new exact solutions for each equation above. Some previous results are extended

Granular neural networks, pattern recognition and bioinformatics

CERN Document Server

Pal, Sankar K; Ganivada, Avatharam

2017-01-01

This book provides a uniform framework describing how fuzzy rough granular neural network technologies can be formulated and used in building efficient pattern recognition and mining models. It also discusses the formation of granules in the notion of both fuzzy and rough sets. Judicious integration in forming fuzzy-rough information granules based on lower approximate regions enables the network to determine the exactness in class shape as well as to handle the uncertainties arising from overlapping regions, resulting in efficient and speedy learning with enhanced performance. Layered network and self-organizing analysis maps, which have a strong potential in big data, are considered as basic modules,. The book is structured according to the major phases of a pattern recognition system (e.g., classification, clustering, and feature selection) with a balanced mixture of theory, algorithm, and application. It covers the latest findings as well as directions for future research, particularly highlighting bioinf...

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