Discrete physics: Practice, representation and rules of correspondence

Energy Technology Data Exchange (ETDEWEB)

Noyes, H.P.

1988-07-01

We make a brief historical review of some aspects of modern physics which we find most significant in our own endeavor. We discuss the ''Yukawa Vertices'' of elementary particle theory as used in laboratory practice, second quantized field theory, analytic S-Matrix theory and in our own approach. We review the conserved quantum numbers in the Standard Model of quarks and leptons. This concludes our presentation of the ''E-frame.'' We try to develop a self-consistent representation of our theory. We have already claimed that this approach provides a discrete reconciliation between the formal (representational) aspects of quantum mechanics and relativity. Also discussed are rules of correspondence connecting the formalism to the practice of physics by using the counter paradigm and event-based coordinates to construct relativistic quantum mechanics in a new way. 31 refs., 12 figs., 1 tab.

Representation of discrete Steklov-Poincare operator arising in domain decomposition methods in wavelet basis

Energy Technology Data Exchange (ETDEWEB)

Jemcov, A.; Matovic, M.D. [Queen`s Univ., Kingston, Ontario (Canada)

1996-12-31

This paper examines the sparse representation and preconditioning of a discrete Steklov-Poincare operator which arises in domain decomposition methods. A non-overlapping domain decomposition method is applied to a second order self-adjoint elliptic operator (Poisson equation), with homogeneous boundary conditions, as a model problem. It is shown that the discrete Steklov-Poincare operator allows sparse representation with a bounded condition number in wavelet basis if the transformation is followed by thresholding and resealing. These two steps combined enable the effective use of Krylov subspace methods as an iterative solution procedure for the system of linear equations. Finding the solution of an interface problem in domain decomposition methods, known as a Schur complement problem, has been shown to be equivalent to the discrete form of Steklov-Poincare operator. A common way to obtain Schur complement matrix is by ordering the matrix of discrete differential operator in subdomain node groups then block eliminating interface nodes. The result is a dense matrix which corresponds to the interface problem. This is equivalent to reducing the original problem to several smaller differential problems and one boundary integral equation problem for the subdomain interface.

Variability of a "force signature" during windmill softball pitching and relationship between discrete force variables and pitch velocity.

Science.gov (United States)

Nimphius, Sophia; McGuigan, Michael R; Suchomel, Timothy J; Newton, Robert U

2016-06-01

This study assessed reliability of discrete ground reaction force (GRF) variables over multiple pitching trials, investigated the relationships between discrete GRF variables and pitch velocity (PV) and assessed the variability of the "force signature" or continuous force-time curve during the pitching motion of windmill softball pitchers. Intraclass correlation coefficient (ICC) for all discrete variables was high (0.86-0.99) while the coefficient of variance (CV) was low (1.4-5.2%). Two discrete variables were significantly correlated to PV; second vertical peak force (r(5)=0.81, p=0.03) and time between peak forces (r(5)=-0.79; p=0.03). High ICCs and low CVs support the reliability of discrete GRF and PV variables over multiple trials and significant correlations indicate there is a relationship between the ability to produce force and the timing of this force production with PV. The mean of all pitchers' curve-average standard deviation of their continuous force-time curves demonstrated low variability (CV=4.4%) indicating a repeatable and identifiable "force signature" pattern during this motion. As such, the continuous force-time curve in addition to discrete GRF variables should be examined in future research as a potential method to monitor or explain changes in pitching performance. Copyright © 2016 Elsevier B.V. All rights reserved.

Can time be a discrete dynamical variable

International Nuclear Information System (INIS)

Lee, T.D.

1983-01-01

The possibility that time can be regarded as a discrete dynamical variable is examined through all phases of mechanics: from classical mechanics to nonrelativistic quantum mechanics, and to relativistic quantum field theories. (orig.)

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

The objectives of Discrete Mathematics (IDISM2) are: The introduction of the mathematics needed for analysis, design and verification of discrete systems, including the application within programming languages for computer systems. Having passed the IDISM2 course, the student will be able...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics......; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...

Variable discrete ordinates method for radiation transfer in plane-parallel semi-transparent media with variable refractive index

Science.gov (United States)

Sarvari, S. M. Hosseini

2017-09-01

The traditional form of discrete ordinates method is applied to solve the radiative transfer equation in plane-parallel semi-transparent media with variable refractive index through using the variable discrete ordinate directions and the concept of refracted radiative intensity. The refractive index are taken as constant in each control volume, such that the direction cosines of radiative rays remain non-variant through each control volume, and then, the directions of discrete ordinates are changed locally by passing each control volume, according to the Snell's law of refraction. The results are compared by the previous studies in this field. Despite simplicity, the results show that the variable discrete ordinate method has a good accuracy in solving the radiative transfer equation in the semi-transparent media with arbitrary distribution of refractive index.

The Concepts of Pseudo Compound Poisson and Partition Representations in Discrete Probability

Directory of Open Access Journals (Sweden)

Werner Hürlimann

2015-01-01

Full Text Available The mathematical/statistical concepts of pseudo compound Poisson and partition representations in discrete probability are reviewed and clarified. A combinatorial interpretation of the convolution of geometric distributions in terms of a variant of Newton’s identities is obtained. The practical use of the twofold convolution leads to an improved goodness-of-fit for a data set from automobile insurance that was up to now not fitted satisfactorily.

Calculating and controlling the error of discrete representations of Pareto surfaces in convex multi-criteria optimization.

Science.gov (United States)

Craft, David

2010-10-01

A discrete set of points and their convex combinations can serve as a sparse representation of the Pareto surface in multiple objective convex optimization. We develop a method to evaluate the quality of such a representation, and show by example that in multiple objective radiotherapy planning, the number of Pareto optimal solutions needed to represent Pareto surfaces of up to five dimensions grows at most linearly with the number of objectives. The method described is also applicable to the representation of convex sets. Copyright © 2009 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved.

Functional representations of integrable hierarchies

International Nuclear Information System (INIS)

Dimakis, Aristophanes; Mueller-Hoissen, Folkert

2006-01-01

We consider a general framework for integrable hierarchies in Lax form and derive certain universal equations from which 'functional representations' of particular hierarchies (such as KP, discrete KP, mKP, AKNS), i.e. formulations in terms of functional equations, are systematically and quite easily obtained. The formalism genuinely applies to hierarchies where the dependent variables live in a noncommutative (typically matrix) algebra. The obtained functional representations can be understood as 'noncommutative' analogues of 'Fay identities' for the KP hierarchy

Discrete Approximations of Determinantal Point Processes on Continuous Spaces: Tree Representations and Tail Triviality

Science.gov (United States)

Osada, Hirofumi; Osada, Shota

2018-01-01

We prove tail triviality of determinantal point processes μ on continuous spaces. Tail triviality has been proved for such processes only on discrete spaces, and hence we have generalized the result to continuous spaces. To do this, we construct tree representations, that is, discrete approximations of determinantal point processes enjoying a determinantal structure. There are many interesting examples of determinantal point processes on continuous spaces such as zero points of the hyperbolic Gaussian analytic function with Bergman kernel, and the thermodynamic limit of eigenvalues of Gaussian random matrices for Sine_2 , Airy_2 , Bessel_2 , and Ginibre point processes. Our main theorem proves all these point processes are tail trivial.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics...... to new problems. Relations and functions: Define a product set; define and apply equivalence relations; construct and apply functions. Apply these concepts to new problems. Natural numbers and induction: Define the natural numbers; apply the principle of induction to verify a selection of properties...

AIC identifies optimal representation of longitudinal dietary variables.

Science.gov (United States)

VanBuren, John; Cavanaugh, Joseph; Marshall, Teresa; Warren, John; Levy, Steven M

2017-09-01

The Akaike Information Criterion (AIC) is a well-known tool for variable selection in multivariable modeling as well as a tool to help identify the optimal representation of explanatory variables. However, it has been discussed infrequently in the dental literature. The purpose of this paper is to demonstrate the use of AIC in determining the optimal representation of dietary variables in a longitudinal dental study. The Iowa Fluoride Study enrolled children at birth and dental examinations were conducted at ages 5, 9, 13, and 17. Decayed or filled surfaces (DFS) trend clusters were created based on age 13 DFS counts and age 13-17 DFS increments. Dietary intake data (water, milk, 100 percent-juice, and sugar sweetened beverages) were collected semiannually using a food frequency questionnaire. Multinomial logistic regression models were fit to predict DFS cluster membership (n=344). Multiple approaches could be used to represent the dietary data including averaging across all collected surveys or over different shorter time periods to capture age-specific trends or using the individual time points of dietary data. AIC helped identify the optimal representation. Averaging data for all four dietary variables for the whole period from age 9.0 to 17.0 provided a better representation in the multivariable full model (AIC=745.0) compared to other methods assessed in full models (AICs=750.6 for age 9 and 9-13 increment dietary measurements and AIC=762.3 for age 9, 13, and 17 individual measurements). The results illustrate that AIC can help researchers identify the optimal way to summarize information for inclusion in a statistical model. The method presented here can be used by researchers performing statistical modeling in dental research. This method provides an alternative approach for assessing the propriety of variable representation to significance-based procedures, which could potentially lead to improved research in the dental community. © 2017 American

Discrete-time BAM neural networks with variable delays

Science.gov (United States)

Liu, Xin-Ge; Tang, Mei-Lan; Martin, Ralph; Liu, Xin-Bi

2007-07-01

This Letter deals with the global exponential stability of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Using a Lyapunov functional, and linear matrix inequality techniques (LMI), we derive a new delay-dependent exponential stability criterion for BAM neural networks with variable delays. As this criterion has no extra constraints on the variable delay functions, it can be applied to quite general BAM neural networks with a broad range of time delay functions. It is also easy to use in practice. An example is provided to illustrate the theoretical development.

Discrete-time BAM neural networks with variable delays

International Nuclear Information System (INIS)

Liu Xinge; Tang Meilan; Martin, Ralph; Liu Xinbi

2007-01-01

This Letter deals with the global exponential stability of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Using a Lyapunov functional, and linear matrix inequality techniques (LMI), we derive a new delay-dependent exponential stability criterion for BAM neural networks with variable delays. As this criterion has no extra constraints on the variable delay functions, it can be applied to quite general BAM neural networks with a broad range of time delay functions. It is also easy to use in practice. An example is provided to illustrate the theoretical development

An integrable (2+1)-dimensional Toda equation with two discrete variables

International Nuclear Information System (INIS)

Cao Cewen; Cao Jianli

2007-01-01

An integrable (2+1)-dimensional Toda equation with two discrete variables is presented from the compatible condition of a Lax triad composed of the ZS-AKNS (Zakharov, Shabat; Ablowitz, Kaup, Newell, Segur) eigenvalue problem and two discrete spectral problems. Through the nonlinearization technique, the Lax triad is transformed into a Hamiltonian system and two symplectic maps, respectively, which are integrable in the Liouville sense, sharing the same set of integrals, functionally independent and involutive with each other. In the Jacobi variety of the associated algebraic curve, both the continuous and the discrete flows are straightened out by the Abel-Jacobi coordinates, and are integrated by quadratures. An explicit algebraic-geometric solution in the original variable is obtained by the Riemann-Jacobi inversion

Discrete singular convolution for the generalized variable-coefficient ...

African Journals Online (AJOL)

Numerical solutions of the generalized variable-coefficient Korteweg-de Vries equation are obtained using a discrete singular convolution and a fourth order singly diagonally implicit Runge-Kutta method for space and time discretisation, respectively. The theoretical convergence of the proposed method is rigorously ...

Characterization, scaling, and partial representation of diffuse and discrete input junctions to CA3 hippocampus.

Science.gov (United States)

Ascarrunz, F G; Kisley, M A; Flach, K A; Hamilton, R W; MacGregor, R J

1995-07-01

This paper applies a general mathematical system for characterizing and scaling functional connectivity and information flow across the diffuse (EC) and discrete (DG) input junctions to the CA3 hippocampus. Both gross connectivity and coordinated multiunit informational firing patterns are quantitatively characterized in terms of 32 defining parameters interrelated by 17 equations, and then scaled down according to rules for uniformly proportional scaling and for partial representation. The diffuse EC-CA3 junction is shown to be uniformly scalable with realistic representation of both essential spatiotemporal cooperativity and coordinated firing patterns down to populations of a few hundred neurons. Scaling of the discrete DG-CA3 junction can be effected with a two-step process, which necessarily deviates from uniform proportionality but nonetheless produces a valuable and readily interpretable reduced model, also utilizing a few hundred neurons in the receiving population. Partial representation produces a reduced model of only a portion of the full network where each model neuron corresponds directly to a biological neuron. The mathematical analysis illustrated here shows that although omissions and distortions are inescapable in such an application, satisfactorily complete and accurate models the size of pattern modules are possible. Finally, the mathematical characterization of these junctions generates a theory which sees the DG as a definer of the fine structure of embedded traces in the hippocampus and entire coordinated patterns of sequences of 14-cell links in CA3 as triggered by the firing of sequences of individual neurons in DG.

The Integration of Continuous and Discrete Latent Variable Models: Potential Problems and Promising Opportunities

Science.gov (United States)

Bauer, Daniel J.; Curran, Patrick J.

2004-01-01

Structural equation mixture modeling (SEMM) integrates continuous and discrete latent variable models. Drawing on prior research on the relationships between continuous and discrete latent variable models, the authors identify 3 conditions that may lead to the estimation of spurious latent classes in SEMM: misspecification of the structural model,…

Size and Topology Optimization for Trusses with Discrete Design Variables by Improved Firefly Algorithm

Directory of Open Access Journals (Sweden)

Yue Wu

2017-01-01

Full Text Available Firefly Algorithm (FA, for short is inspired by the social behavior of fireflies and their phenomenon of bioluminescent communication. Based on the fundamentals of FA, two improved strategies are proposed to conduct size and topology optimization for trusses with discrete design variables. Firstly, development of structural topology optimization method and the basic principle of standard FA are introduced in detail. Then, in order to apply the algorithm to optimization problems with discrete variables, the initial positions of fireflies and the position updating formula are discretized. By embedding the random-weight and enhancing the attractiveness, the performance of this algorithm is improved, and thus an Improved Firefly Algorithm (IFA, for short is proposed. Furthermore, using size variables which are capable of including topology variables and size and topology optimization for trusses with discrete variables is formulated based on the Ground Structure Approach. The essential techniques of variable elastic modulus technology and geometric construction analysis are applied in the structural analysis process. Subsequently, an optimization method for the size and topological design of trusses based on the IFA is introduced. Finally, two numerical examples are shown to verify the feasibility and efficiency of the proposed method by comparing with different deterministic methods.

A systematic method for constructing time discretizations of integrable lattice systems: local equations of motion

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2010-01-01

We propose a new method for discretizing the time variable in integrable lattice systems while maintaining the locality of the equations of motion. The method is based on the zero-curvature (Lax pair) representation and the lowest-order 'conservation laws'. In contrast to the pioneering work of Ablowitz and Ladik, our method allows the auxiliary dependent variables appearing in the stage of time discretization to be expressed locally in terms of the original dependent variables. The time-discretized lattice systems have the same set of conserved quantities and the same structures of the solutions as the continuous-time lattice systems; only the time evolution of the parameters in the solutions that correspond to the angle variables is discretized. The effectiveness of our method is illustrated using examples such as the Toda lattice, the Volterra lattice, the modified Volterra lattice, the Ablowitz-Ladik lattice (an integrable semi-discrete nonlinear Schroedinger system) and the lattice Heisenberg ferromagnet model. For the modified Volterra lattice, we also present its ultradiscrete analogue.

Classifier-guided sampling for discrete variable, discontinuous design space exploration: Convergence and computational performance

Energy Technology Data Exchange (ETDEWEB)

Backlund, Peter B. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Shahan, David W. [HRL Labs., LLC, Malibu, CA (United States); Seepersad, Carolyn Conner [Univ. of Texas, Austin, TX (United States)

2014-04-22

A classifier-guided sampling (CGS) method is introduced for solving engineering design optimization problems with discrete and/or continuous variables and continuous and/or discontinuous responses. The method merges concepts from metamodel-guided sampling and population-based optimization algorithms. The CGS method uses a Bayesian network classifier for predicting the performance of new designs based on a set of known observations or training points. Unlike most metamodeling techniques, however, the classifier assigns a categorical class label to a new design, rather than predicting the resulting response in continuous space, and thereby accommodates nondifferentiable and discontinuous functions of discrete or categorical variables. The CGS method uses these classifiers to guide a population-based sampling process towards combinations of discrete and/or continuous variable values with a high probability of yielding preferred performance. Accordingly, the CGS method is appropriate for discrete/discontinuous design problems that are ill-suited for conventional metamodeling techniques and too computationally expensive to be solved by population-based algorithms alone. In addition, the rates of convergence and computational properties of the CGS method are investigated when applied to a set of discrete variable optimization problems. Results show that the CGS method significantly improves the rate of convergence towards known global optima, on average, when compared to genetic algorithms.

Modeling biological tissue growth: discrete to continuum representations.

Science.gov (United States)

Hywood, Jack D; Hackett-Jones, Emily J; Landman, Kerry A

2013-09-01

There is much interest in building deterministic continuum models from discrete agent-based models governed by local stochastic rules where an agent represents a biological cell. In developmental biology, cells are able to move and undergo cell division on and within growing tissues. A growing tissue is itself made up of cells which undergo cell division, thereby providing a significant transport mechanism for other cells within it. We develop a discrete agent-based model where domain agents represent tissue cells. Each agent has the ability to undergo a proliferation event whereby an additional domain agent is incorporated into the lattice. If a probability distribution describes the waiting times between proliferation events for an individual agent, then the total length of the domain is a random variable. The average behavior of these stochastically proliferating agents defining the growing lattice is determined in terms of a Fokker-Planck equation, with an advection and diffusion term. The diffusion term differs from the one obtained Landman and Binder [J. Theor. Biol. 259, 541 (2009)] when the rate of growth of the domain is specified, but the choice of agents is random. This discrepancy is reconciled by determining a discrete-time master equation for this process and an associated asymmetric nonexclusion random walk, together with consideration of synchronous and asynchronous updating schemes. All theoretical results are confirmed with numerical simulations. This study furthers our understanding of the relationship between agent-based rules, their implementation, and their associated partial differential equations. Since tissue growth is a significant cellular transport mechanism during embryonic growth, it is important to use the correct partial differential equation description when combining with other cellular functions.

Discrete rate and variable power adaptation for underlay cognitive networks

KAUST Repository

Abdallah, Mohamed M.; Salem, Ahmed H.; Alouini, Mohamed-Slim; Qaraqe, Khalid A.

2010-01-01

We consider the problem of maximizing the average spectral efficiency of a secondary link in underlay cognitive networks. In particular, we consider the network setting whereby the secondary transmitter employs discrete rate and variable power

Poisson hierarchy of discrete strings

International Nuclear Information System (INIS)

Ioannidou, Theodora; Niemi, Antti J.

2016-01-01

The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

Poisson hierarchy of discrete strings

Energy Technology Data Exchange (ETDEWEB)

Ioannidou, Theodora, E-mail: ti3@auth.gr [Faculty of Civil Engineering, School of Engineering, Aristotle University of Thessaloniki, 54249, Thessaloniki (Greece); Niemi, Antti J., E-mail: Antti.Niemi@physics.uu.se [Department of Physics and Astronomy, Uppsala University, P.O. Box 803, S-75108, Uppsala (Sweden); Laboratoire de Mathematiques et Physique Theorique CNRS UMR 6083, Fédération Denis Poisson, Université de Tours, Parc de Grandmont, F37200, Tours (France); Department of Physics, Beijing Institute of Technology, Haidian District, Beijing 100081 (China)

2016-01-28

The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

Asymptotical representation of discrete groups

International Nuclear Information System (INIS)

Mishchenko, A.S.; Mohammad, N.

1995-08-01

If one has a unitary representation ρ: π → U(H) of the fundamental group π 1 (M) of the manifold M then one can do may useful things: 1. To construct a natural vector bundle over M; 2. To construct the cohomology groups with respect to the local system of coefficients; 3. To construct the signature of manifold M with respect to the local system of coefficients; and others. In particular, one can write the Hirzebruch formula which compares the signature with the characteristic classes of the manifold M, further based on this, find the homotopy invariant characteristic classes (i.e. the Novikov conjecture). Taking into account that the family of known representations is not sufficiently large, it would be interesting to extend this family to some larger one. Using the ideas of A.Connes, M.Gromov and H.Moscovici a proper notion of asymptotical representation is defined. (author). 7 refs

A Discrete Spectral Problem and Related Hierarchy of Discrete Hamiltonian Lattice Equations

International Nuclear Information System (INIS)

Xu Xixiang; Cao Weili

2007-01-01

Staring from a discrete matrix spectral problem, a hierarchy of lattice soliton equations is presented though discrete zero curvature representation. The resulting lattice soliton equations possess non-local Lax pairs. The Hamiltonian structures are established for the resulting hierarchy by the discrete trace identity. Liouville integrability of resulting hierarchy is demonstrated.

Discrete-time bidirectional associative memory neural networks with variable delays

International Nuclear Information System (INIS)

Liang Jinling; Cao Jinde; Ho, Daniel W.C.

2005-01-01

Based on the linear matrix inequality (LMI), some sufficient conditions are presented in this Letter for the existence, uniqueness and global exponential stability of the equilibrium point of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Some of the stability criteria obtained in this Letter are delay-dependent, and some of them are delay-independent, they are less conservative than the ones reported so far in the literature. Furthermore, the results provide one more set of easily verified criteria for determining the exponential stability of discrete-time BAM neural networks

Discrete-time bidirectional associative memory neural networks with variable delays

Science.gov (United States)

Liang, variable delays [rapid communication] J.; Cao, J.; Ho, D. W. C.

2005-02-01

Based on the linear matrix inequality (LMI), some sufficient conditions are presented in this Letter for the existence, uniqueness and global exponential stability of the equilibrium point of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Some of the stability criteria obtained in this Letter are delay-dependent, and some of them are delay-independent, they are less conservative than the ones reported so far in the literature. Furthermore, the results provide one more set of easily verified criteria for determining the exponential stability of discrete-time BAM neural networks.

Micro-macro multilevel latent class models with multiple discrete individual-level variables

NARCIS (Netherlands)

Bennink, M.; Croon, M.A.; Kroon, B.; Vermunt, J.K.

2016-01-01

An existing micro-macro method for a single individual-level variable is extended to the multivariate situation by presenting two multilevel latent class models in which multiple discrete individual-level variables are used to explain a group-level outcome. As in the univariate case, the

Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables

Directory of Open Access Journals (Sweden)

Hideki Katagiri

2017-10-01

Full Text Available This paper considers linear programming problems (LPPs where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables. New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments.

Statistical learning from nonrecurrent experience with discrete input variables and recursive-error-minimization equations

Science.gov (United States)

Carter, Jeffrey R.; Simon, Wayne E.

1990-08-01

Neural networks are trained using Recursive Error Minimization (REM) equations to perform statistical classification. Using REM equations with continuous input variables reduces the required number of training experiences by factors of one to two orders of magnitude over standard back propagation. Replacing the continuous input variables with discrete binary representations reduces the number of connections by a factor proportional to the number of variables reducing the required number of experiences by another order of magnitude. Undesirable effects of using recurrent experience to train neural networks for statistical classification problems are demonstrated and nonrecurrent experience used to avoid these undesirable effects. 1. THE 1-41 PROBLEM The statistical classification problem which we address is is that of assigning points in ddimensional space to one of two classes. The first class has a covariance matrix of I (the identity matrix) the covariance matrix of the second class is 41. For this reason the problem is known as the 1-41 problem. Both classes have equal probability of occurrence and samples from both classes may appear anywhere throughout the ddimensional space. Most samples near the origin of the coordinate system will be from the first class while most samples away from the origin will be from the second class. Since the two classes completely overlap it is impossible to have a classifier with zero error. The minimum possible error is known as the Bayes error and

Discrete model of opinion changes using knowledge and emotions as control variables.

Directory of Open Access Journals (Sweden)

Pawel Sobkowicz

Full Text Available We present a new model of opinion changes dependent on the agents emotional state and their information about the issue in question. Our goal is to construct a simple, yet nontrivial and flexible representation of individual attitude dynamics for agent based simulations, that could be used in a variety of social environments. The model is a discrete version of the cusp catastrophe model of opinion dynamics in which information is treated as the normal factor while emotional arousal (agitation level determining agent receptiveness and rationality is treated as the splitting factor. Both variables determine the resulting agent opinion, which itself can be in favor of the studied position, against it, or neutral. Thanks to the flexibility of implementing communication between the agents, the model is potentially applicable in a wide range of situations. As an example of the model application, we study the dynamics of a set of agents communicating among themselves via messages. In the example, we chose the simplest, fully connected communication topology, to focus on the effects of the individual opinion dynamics, and to look for stable final distributions of agents with different emotions, information and opinions. Even for such simplified system, the model shows complex behavior, including phase transitions due to symmetry breaking by external propaganda.

Discrete model of opinion changes using knowledge and emotions as control variables.

Science.gov (United States)

Sobkowicz, Pawel

2012-01-01

We present a new model of opinion changes dependent on the agents emotional state and their information about the issue in question. Our goal is to construct a simple, yet nontrivial and flexible representation of individual attitude dynamics for agent based simulations, that could be used in a variety of social environments. The model is a discrete version of the cusp catastrophe model of opinion dynamics in which information is treated as the normal factor while emotional arousal (agitation level determining agent receptiveness and rationality) is treated as the splitting factor. Both variables determine the resulting agent opinion, which itself can be in favor of the studied position, against it, or neutral. Thanks to the flexibility of implementing communication between the agents, the model is potentially applicable in a wide range of situations. As an example of the model application, we study the dynamics of a set of agents communicating among themselves via messages. In the example, we chose the simplest, fully connected communication topology, to focus on the effects of the individual opinion dynamics, and to look for stable final distributions of agents with different emotions, information and opinions. Even for such simplified system, the model shows complex behavior, including phase transitions due to symmetry breaking by external propaganda.

Discrete Model of Opinion Changes Using Knowledge and Emotions as Control Variables

Science.gov (United States)

Sobkowicz, Pawel

2012-01-01

We present a new model of opinion changes dependent on the agents emotional state and their information about the issue in question. Our goal is to construct a simple, yet nontrivial and flexible representation of individual attitude dynamics for agent based simulations, that could be used in a variety of social environments. The model is a discrete version of the cusp catastrophe model of opinion dynamics in which information is treated as the normal factor while emotional arousal (agitation level determining agent receptiveness and rationality) is treated as the splitting factor. Both variables determine the resulting agent opinion, which itself can be in favor of the studied position, against it, or neutral. Thanks to the flexibility of implementing communication between the agents, the model is potentially applicable in a wide range of situations. As an example of the model application, we study the dynamics of a set of agents communicating among themselves via messages. In the example, we chose the simplest, fully connected communication topology, to focus on the effects of the individual opinion dynamics, and to look for stable final distributions of agents with different emotions, information and opinions. Even for such simplified system, the model shows complex behavior, including phase transitions due to symmetry breaking by external propaganda. PMID:22984516

Geometry of the Borel - de Siebenthal discrete series

DEFF Research Database (Denmark)

Ørsted, Bent; Wolf, Joseph A

Let G0 be a connected, simply connected real simple Lie group. Suppose that G0 has a compact Cartan subgroup T0, so it has discrete series representations. Relative to T0 there is a distinguished positive root system + for which there is a unique noncompact simple root , the “Borel – de Siebenthal...... system”. There is a lot of fascinating geometry associated to the corresponding “Borel – de Siebenthal discrete series” representations of G0. In this paper we explore some of those geometric aspects and we work out the K0–spectra of the Borel – de Siebenthal discrete series representations. This has...

A collection of integrable systems of the Toda type in continuous and discrete time, with 2x2 Lax representations

OpenAIRE

Suris, Yuri B.

1997-01-01

A fairly complete list of Toda-like integrable lattice systems, both in the continuous and discrete time, is given. For each system the Newtonian, Lagrangian and Hamiltonian formulations are presented, as well as the 2x2 Lax representation and r-matrix structure. The material is given in the "no comment" style, in particular, all proofs are omitted.

Avoiding and Correcting Bias in Score-Based Latent Variable Regression with Discrete Manifest Items

Science.gov (United States)

Lu, Irene R. R.; Thomas, D. Roland

2008-01-01

This article considers models involving a single structural equation with latent explanatory and/or latent dependent variables where discrete items are used to measure the latent variables. Our primary focus is the use of scores as proxies for the latent variables and carrying out ordinary least squares (OLS) regression on such scores to estimate…

Group-theoretical aspects of the discrete sine-Gordon equation

International Nuclear Information System (INIS)

Orfanidis, S.J.

1980-01-01

The group-theoretical interpretation of the sine-Gordon equation in terms of connection forms on fiber bundles is extended to the discrete case. Solutions of the discrete sine-Gordon equation induce surfaces on a lattice in the SU(2) group space. The inverse scattering representation, expressing the parallel transport of fibers, is implemented by means of finite rotations. Discrete Baecklund transformations are realized as gauge transformations. The three-dimensional inverse scattering representation is used to derive a discrete nonlinear sigma model, and the corresponding Baecklund transformation and Pohlmeyer's R transformation are constructed

Discrete computational structures

CERN Document Server

Korfhage, Robert R

1974-01-01

Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasize

Reliability-Based Design Optimization of Trusses with Linked-Discrete Design Variables using the Improved Firefly Algorithm

Directory of Open Access Journals (Sweden)

N. M. Okasha

2016-04-01

Full Text Available In this paper, an approach for conducting a Reliability-Based Design Optimization (RBDO of truss structures with linked-discrete design variables is proposed. The sections of the truss members are selected from the AISC standard tables and thus the design variables that represent the properties of each section are linked. Latin hypercube sampling is used in the evaluation of the structural reliability. The improved firefly algorithm is used for the optimization solution process. It was found that in order to use the improved firefly algorithm for efficiently solving problems of reliability-based design optimization with linked-discrete design variables; it needs to be modified as proposed in this paper to accelerate its convergence.

Discrete repulsive oscillator wavefunctions

International Nuclear Information System (INIS)

Munoz, Carlos A; Rueda-Paz, Juvenal; Wolf, Kurt Bernardo

2009-01-01

For the study of infinite discrete systems on phase space, the three-dimensional Lorentz algebra and group, so(2,1) and SO(2,1), provide a discrete model of the repulsive oscillator. Its eigenfunctions are found in the principal irreducible representation series, where the compact generator-that we identify with the position operator-has the infinite discrete spectrum of the integers Z, while the spectrum of energies is a double continuum. The right- and left-moving wavefunctions are given by hypergeometric functions that form a Dirac basis for l 2 (Z). Under contraction, the discrete system limits to the well-known quantum repulsive oscillator. Numerical computations of finite approximations raise further questions on the use of Dirac bases for infinite discrete systems.

The selection of a mode of urban transportation: Integrating psychological variables to discrete choice models

International Nuclear Information System (INIS)

Cordoba Maquilon, Jorge E; Gonzalez Calderon, Carlos A; Posada Henao, John J

2011-01-01

A study using revealed preference surveys and psychological tests was conducted. Key psychological variables of behavior involved in the choice of transportation mode in a population sample of the Metropolitan Area of the Valle de Aburra were detected. The experiment used the random utility theory for discrete choice models and reasoned action in order to assess beliefs. This was used as a tool for analysis of the psychological variables using the sixteen personality factor questionnaire (16PF test). In addition to the revealed preference surveys, two other surveys were carried out: one with socio-economic characteristics and the other with latent indicators. This methodology allows for an integration of discrete choice models and latent variables. The integration makes the model operational and quantifies the unobservable psychological variables. The most relevant result obtained was that anxiety affects the choice of urban transportation mode and shows that physiological alterations, as well as problems in perception and beliefs, can affect the decision-making process.

Linear and nonlinear optical signals in probability and phase-space representations

International Nuclear Information System (INIS)

Man'ko, Margarita A

2006-01-01

Review of different representations of signals including the phase-space representations and tomographic representations is presented. The signals under consideration are either linear or nonlinear ones. The linear signals satisfy linear quantumlike Schroedinger and von Neumann equations. Nonlinear signals satisfy nonlinear Schroedinger equations as well as Gross-Pitaevskii equation describing solitons in Bose-Einstein condensate. The Ville-Wigner distributions for solitons are considered in comparison with tomographic-probability densities describing solitons completely. different kinds of tomographies - symplectic tomography, optical tomography and Fresnel tomography are reviewed. New kind of map of the signals onto probability distributions of discrete photon number-like variable is discussed. Mutual relations between different transformations of signal functions are established in explicit form. Such characteristics of the signal-probability distribution as entropy is discussed

Finite-dimensional reductions of the discrete Toda chain

International Nuclear Information System (INIS)

Kazakova, T G

2004-01-01

The problem of construction of integrable boundary conditions for the discrete Toda chain is considered. The restricted chains for properly chosen closure conditions are reduced to the well-known discrete Painleve equations dP III , dP V , dP VI . Lax representations for these discrete Painleve equations are found

Truss topology optimization with discrete design variables by outer approximation

DEFF Research Database (Denmark)

Stolpe, Mathias

2015-01-01

Several variants of an outer approximation method are proposed to solve truss topology optimization problems with discrete design variables to proven global optimality. The objective is to minimize the volume of the structure while satisfying constraints on the global stiffness of the structure...... for classical outer approximation approaches applied to optimal design problems. A set of two- and three-dimensional benchmark problems are solved and the numerical results suggest that the proposed approaches are competitive with other special-purpose global optimization methods for the considered class...... under the applied loads. We extend the natural problem formulation by adding redundant force variables and force equilibrium constraints. This guarantees that the designs suggested by the relaxed master problems are capable of carrying the applied loads, a property which is generally not satisfied...

A New Multidisciplinary Design Optimization Method Accounting for Discrete and Continuous Variables under Aleatory and Epistemic Uncertainties

Directory of Open Access Journals (Sweden)

Hong-Zhong Huang

2012-02-01

Full Text Available Various uncertainties are inevitable in complex engineered systems and must be carefully treated in design activities. Reliability-Based Multidisciplinary Design Optimization (RBMDO has been receiving increasing attention in the past decades to facilitate designing fully coupled systems but also achieving a desired reliability considering uncertainty. In this paper, a new formulation of multidisciplinary design optimization, namely RFCDV (random/fuzzy/continuous/discrete variables Multidisciplinary Design Optimization (RFCDV-MDO, is developed within the framework of Sequential Optimization and Reliability Assessment (SORA to deal with multidisciplinary design problems in which both aleatory and epistemic uncertainties are present. In addition, a hybrid discrete-continuous algorithm is put forth to efficiently solve problems where both discrete and continuous design variables exist. The effectiveness and computational efficiency of the proposed method are demonstrated via a mathematical problem and a pressure vessel design problem.

Size and Topology Optimization for Trusses with Discrete Design Variables by Improved Firefly Algorithm

NARCIS (Netherlands)

Wu, Yue; Li, Q.; Hu, Qingjie; Borgart, A.

2017-01-01

Firefly Algorithm (FA, for short) is inspired by the social behavior of fireflies and their phenomenon of bioluminescent communication. Based on the fundamentals of FA, two improved strategies are proposed to conduct size and topology optimization for trusses with discrete design variables. Firstly,

The representations of Lie groups and geometric quantizations

International Nuclear Information System (INIS)

Zhao Qiang

1998-01-01

In this paper we discuss the relation between representations of Lie groups and geometric quantizations. A series of representations of Lie groups are constructed by geometric quantization of coadjoint orbits. Particularly, all representations of compact Lie groups, holomorphic discrete series of representations and spherical representations of reductive Lie groups are constructed by geometric quantizations of elliptic and hyperbolic coadjoint orbits. (orig.)

The su(2)α Hahn oscillator and a discrete Fourier-Hahn transform

International Nuclear Information System (INIS)

Jafarov, E I; Stoilova, N I; Van der Jeugt, J

2011-01-01

We define the quadratic algebra su(2) α which is a one-parameter deformation of the Lie algebra su(2) extended by a parity operator. The odd-dimensional representations of su(2) (with representation label j, a positive integer) can be extended to representations of su(2) α . We investigate a model of the finite one-dimensional harmonic oscillator based upon this algebra su(2) α . It turns out that in this model the spectrum of the position and momentum operator can be computed explicitly, and that the corresponding (discrete) wavefunctions can be determined in terms of Hahn polynomials. The operation mapping position wavefunctions into momentum wavefunctions is studied, and this so-called discrete Fourier-Hahn transform is computed explicitly. The matrix of this discrete Fourier-Hahn transform has many interesting properties, similar to those of the traditional discrete Fourier transform. (paper)

State control of discrete-time linear systems to be bound in state variables by equality constraints

International Nuclear Information System (INIS)

Filasová, Anna; Krokavec, Dušan; Serbák, Vladimír

2014-01-01

The paper is concerned with the problem of designing the discrete-time equivalent PI controller to control the discrete-time linear systems in such a way that the closed-loop state variables satisfy the prescribed equality constraints. Since the problem is generally singular, using standard form of the Lyapunov function and a symmetric positive definite slack matrix, the design conditions are proposed in the form of the enhanced Lyapunov inequality. The results, offering the conditions of the control existence and the optimal performance with respect to the prescribed equality constraints for square discrete-time linear systems, are illustrated with the numerical example to note effectiveness and applicability of the considered approach

A highly efficient SDRAM controller supporting variable-length burst access and batch process for discrete reads

Science.gov (United States)

Li, Nan; Wang, Junzheng

2016-03-01

A highly efficient Synchronous Dynamic Random Access Memory (SDRAM) controller supporting variable-length burst access and batch process for discrete reads is proposed in this paper. Based on the Principle of Locality, command First In First Out (FIFO) and address range detector are designed within this controller to accelerate its responses to discrete read requests, which dramatically improves the average Effective Bus Utilization Ratio (EBUR) of SDRAM. Our controller is finally verified by driving the Micron 256-Mb SDRAM MT48LC16M16A2. Successful simulation and verification results show that our controller exhibits much higher EBUR than do most existing designs in case of discrete reads.

Learning word vector representations based on acoustic counts

OpenAIRE

Ribeiro, Sam; Watts, Oliver; Yamagishi, Junichi

2017-01-01

This paper presents a simple count-based approach to learning word vector representations by leveraging statistics of cooccurrences between text and speech. This type of representation requires two discrete sequences of units defined across modalities. Two possible methods for the discretization of an acoustic signal are presented, which are then applied to fundamental frequency and energy contours of a transcribed corpus of speech, yielding a sequence of textual objects (e.g. words, syllable...

Instrumental broadening of spectral line profiles due to discrete representation of a continuous physical quantity

International Nuclear Information System (INIS)

Dulov, E.N.; Khripunov, D.M.

2008-01-01

It is the usual situation in spectroscopy that a continuous physical quantity, which plays the role of a spectral function argument (i.e. the abscissa of a spectrum), is sampled electronically as discrete point clouds or channels. Each channel corresponds to the midpoint of a small interval of the continuous argument. The experimentally registered value of intensity in the channel describes the averaged spectral intensity in this interval. However, an approximation of spectra by a continuous theoretical model function often assumes that the interval is small enough, and tabulation of the theoretical model function may be used without appreciable disadvantages for the fitting results. At this point, a new type of approximation error appears, such as the error of midpoint approximation to a definite integral in the rectangle method of numeric integration. This paper aims at quantitative estimation of this error in the cases of a pure Lorentz lineshape and a generalized Voigt contour. It is shown that discrete representation of continuous spectral data leads to some non-physical broadening in comparison with the tabulated model function. As a first approximation it is normal broadening. We show that even in the case of a Lorentz true lineshape we must use the tabulated Voigt function measured in channels fixed Gauss linewidth rather than a tabulated Lorentzian. Application of the results of this paper is demonstrated on Moessbauer spectra

Multiobjective Two-Stage Stochastic Programming Problems with Interval Discrete Random Variables

Directory of Open Access Journals (Sweden)

S. K. Barik

2012-01-01

Full Text Available Most of the real-life decision-making problems have more than one conflicting and incommensurable objective functions. In this paper, we present a multiobjective two-stage stochastic linear programming problem considering some parameters of the linear constraints as interval type discrete random variables with known probability distribution. Randomness of the discrete intervals are considered for the model parameters. Further, the concepts of best optimum and worst optimum solution are analyzed in two-stage stochastic programming. To solve the stated problem, first we remove the randomness of the problem and formulate an equivalent deterministic linear programming model with multiobjective interval coefficients. Then the deterministic multiobjective model is solved using weighting method, where we apply the solution procedure of interval linear programming technique. We obtain the upper and lower bound of the objective function as the best and the worst value, respectively. It highlights the possible risk involved in the decision-making tool. A numerical example is presented to demonstrate the proposed solution procedure.

Global exponential stability for discrete-time neural networks with variable delays

International Nuclear Information System (INIS)

Chen Wuhua; Lu Xiaomei; Liang Dongying

2006-01-01

This Letter provides new exponential stability criteria for discrete-time neural networks with variable delays. The main technique is to reduce exponential convergence estimation of the neural network solution to that of one component of the corresponding solution by constructing Lyapunov function based on M-matrix. By introducing the tuning parameter diagonal matrix, the delay-independent and delay-dependent exponential stability conditions have been unified in the same mathematical formula. The effectiveness of the new results are illustrated by three examples

Study on the security of discrete-variable quantum key distribution over non-Markovian channels

International Nuclear Information System (INIS)

Huang Peng; Zhu Jun; He Guangqiang; Zeng Guihua

2012-01-01

The dynamic of the secret key rate of the discrete-variable quantum key distribution (QKD) protocol over the non-Markovian quantum channel is investigated. In particular, we calculate the secret key rate for the six-state protocol over non-Markovian depolarizing channels with coloured noise and Markovian depolarizing channels with Gaussian white noise, respectively. We find that the secure secret key rate for the non-Markovian depolarizing channel will be larger than the Markovian one under the same conditions even when their upper bounds of tolerable quantum bit error rate are equal. This indicates that this coloured noise in the non-Markovian depolarizing channel can enhance the security of communication. Moreover, we show that the secret key rate fluctuates near the secure point when the coupling strength of the system with the environment is high. The results demonstrate that the non-Markovian effects of the transmission channel can have a positive impact on the security of discrete-variable QKD. (paper)

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

Science.gov (United States)

Penney, Mark D.; Enshan Koh, Dax; Spekkens, Robert W.

2017-07-01

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits.

A fully discrete energy stable scheme for a phase filed moving contact line model with variable densities and viscosities

KAUST Repository

Zhu, Guangpu

2018-01-26

In this paper, a fully discrete scheme which considers temporal and spatial discretizations is presented for the coupled Cahn-Hilliard equation in conserved form with the dynamic contact line condition and the Navier-Stokes equation with the generalized Navier boundary condition. Variable densities and viscosities are incorporated in this model. A rigorous proof of energy stability is provided for the fully discrete scheme based on a semi-implicit temporal discretization and a finite difference method on the staggered grids for the spatial discretization. A splitting method based on the pressure stabilization is implemented to solve the Navier-Stokes equation, while the stabilization approach is also used for the Cahn-Hilliard equation. Numerical results in both 2-D and 3-D demonstrate the accuracy, efficiency and decaying property of discrete energy of the proposed scheme.

Exploring high dimensional data with Butterfly: a novel classification algorithm based on discrete dynamical systems.

Science.gov (United States)

Geraci, Joseph; Dharsee, Moyez; Nuin, Paulo; Haslehurst, Alexandria; Koti, Madhuri; Feilotter, Harriet E; Evans, Ken

2014-03-01

We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here. Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer

The discrete and localized nature of the variable emission from active regions

Science.gov (United States)

Arndt, Martina Belz; Habbal, Shadia Rifai; Karovska, Margarita

1994-01-01

Using data from the Extreme Ultraviolet (EUV) Spectroheliometer on Skylab, we study the empirical characteristics of the variable emission in active regions. These simultaneous multi-wavelength observations clearly confirm that active regions consist of a complex of loops at different temperatures. The variable emission from this complex has very well-defined properties that can be quantitatively summarized as follows: (1) It is localized predominantly around the footpoints where it occurs at discrete locations. (2) The strongest variability does not necessarily coincide with the most intense emission. (3) The fraction of the area of the footpoints, (delta n)/N, that exhibits variable emission, varies by +/- 15% as a function of time, at any of the wavelengths measured. It also varies very little from footpoint to footpoint. (4) This fractional variation is temperature dependent with a maximum around 10(exp 5) K. (5) The ratio of the intensity of the variable to the average background emission, (delta I)/(bar-I), also changes with temperature. In addition, we find that these distinctive characteristics persist even when flares occur within the active region.

The weak-scale hierarchy and discrete symmetries

International Nuclear Information System (INIS)

Haba, Naoyuki; Matsuoka, Takeo; Hattori, Chuichiro; Matsuda, Masahisa; Mochinaga, Daizo.

1996-01-01

In the underlying Planck scale theory, we introduce a certain type of discrete symmetry, which potentially brings the stability of the weak-scale hierarchy under control. Under the discrete symmetry the μ-problem and the tadpole problem can be solved simultaneously without relying on some fine-tuning of parameters. Instead, it is required that doublet Higgs and color-triplet Higgs fields reside in different irreducible representations of the gauge symmetry group at the Planck scale and that they have distinct charges of the discrete symmetry group. (author)

Darboux and binary Darboux transformations for discrete integrable systems I. Discrete potential KdV equation

International Nuclear Information System (INIS)

Shi, Ying; Zhang, Da-jun; Nimmo, Jonathan J C

2014-01-01

The Hirota–Miwa equation can be written in ‘nonlinear’ form in two ways: the discrete KP equation and, by using a compatible continuous variable, the discrete potential KP equation. For both systems, we consider the Darboux and binary Darboux transformations, expressed in terms of the continuous variable, and obtain exact solutions in Wronskian and Grammian form. We discuss reductions of both systems to the discrete KdV and discrete potential KdV equation, respectively, and exploit this connection to find the Darboux and binary Darboux transformations and exact solutions of these equations. (paper)

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

International Nuclear Information System (INIS)

Penney, Mark D; Koh, Dax Enshan; Spekkens, Robert W

2017-01-01

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits. (paper)

Transient Variable Caching in Java’s Stack-Based Intermediate Representation

Directory of Open Access Journals (Sweden)

Paul Týma

1999-01-01

Full Text Available Java’s stack‐based intermediate representation (IR is typically coerced to execute on register‐based architectures. Unoptimized compiled code dutifully replicates transient variable usage designated by the programmer and common optimization practices tend to introduce further usage (i.e., CSE, Loop‐invariant Code Motion, etc.. On register based machines, often transient variables are cached within registers (when available saving the expense of actually accessing memory. Unfortunately, in stack‐based environments because of the need to push and pop the transient values, further performance improvement is possible. This paper presents Transient Variable Caching (TVC, a technique for eliminating transient variable overhead whenever possible. This optimization would find a likely home in optimizers attached to the back of popular Java compilers. Side effects of the algorithm include significant instruction reordering and introduction of many stack‐manipulation operations. This combination has proven to greatly impede the ability to decompile stack‐based IR code sequences. The code that results from the transform is faster, smaller, and greatly impedes decompilation.

Discrete curved ray-tracing method for radiative transfer in an absorbing-emitting semitransparent slab with variable spatial refractive index

International Nuclear Information System (INIS)

Liu, L.H.

2004-01-01

A discrete curved ray-tracing method is developed to analyze the radiative transfer in one-dimensional absorbing-emitting semitransparent slab with variable spatial refractive index. The curved ray trajectory is locally treated as straight line and the complicated and time-consuming computation of ray trajectory is cut down. A problem of radiative equilibrium with linear variable spatial refractive index is taken as an example to examine the accuracy of the proposed method. The temperature distributions are determined by the proposed method and compared with the data in references, which are obtained by other different methods. The results show that the discrete curved ray-tracing method has a good accuracy in solving the radiative transfer in one-dimensional semitransparent slab with variable spatial refractive index

A Family of Integrable Rational Semi-Discrete Systems and Its Reduction

International Nuclear Information System (INIS)

Xu Xixiang

2010-01-01

Within framework of zero curvature representation theory, a family of integrahle rational semi-discrete systems is derived from a matrix spectral problem. The Hamiltonian forms of obtained semi-discrete systems are constructed by means of the discrete trace identity. The Liouville integrability for the obtained family is demonstrated. In the end, a reduced family of obtained semi-discrete systems and its Hamiltonian form are worked out. (general)

Discrete rate and variable power adaptation for underlay cognitive networks

KAUST Repository

Abdallah, Mohamed M.

2010-01-01

We consider the problem of maximizing the average spectral efficiency of a secondary link in underlay cognitive networks. In particular, we consider the network setting whereby the secondary transmitter employs discrete rate and variable power adaptation under the constraints of maximum average transmit power and maximum average interference power allowed at the primary receiver due to the existence of an interference link between the secondary transmitter and the primary receiver. We first find the optimal discrete rates assuming a predetermined partitioning of the signal-to-noise ratio (SNR) of both the secondary and interference links. We then present an iterative algorithm for finding a suboptimal partitioning of the SNR of the interference link assuming a fixed partitioning of the SNR of secondary link selected for the case where no interference link exists. Our numerical results show that the average spectral efficiency attained by using the iterative algorithm is close to that achieved by the computationally extensive exhaustive search method for the case of Rayleigh fading channels. In addition, our simulations show that selecting the optimal partitioning of the SNR of the secondary link assuming no interference link exists still achieves the maximum average spectral efficiency for the case where the average interference constraint is considered. © 2010 IEEE.

A uniaxial cyclic elastoplastic constitutive law with a discrete memory variable

International Nuclear Information System (INIS)

Taheri, S.

1991-01-01

At present, the study on cyclic elastoplastic constitutive laws is focused on nonproportional loading, but for uniaxial loading, some problems still exist. For example, the possibility for a law to describe simultaneously the ratcheting in nonsymmetrical load-controlled test, elastic and plastic shakedown in symmetrical and nonsymmetrical ones. Here a law is presented, which in addition to previous phenomena, describes the cyclic hardening in a pushpull test, the cyclic softening after overloading and also the dependence of cyclic strain-stress curves on the history of loading. These are the usual properties of 316 stainless steel at room temperature. This law uses an internal discrete memory variable: the plastic strain at the last unloading. On the other hand, the choice of all macroscopic variables is justified by a microscopic analysis. This law has been also extended to a three-dimensional case. Regarding the microstructure under cyclic loading, plastic shakedown and ratcheting are discussed. The definition of macroscopic variables taking account of microstructure and uniaxial constitutive law are described. (K.I.)

Mathematical aspects of the discrete space-time hypothesis

International Nuclear Information System (INIS)

Sardanashvili, G.A.

1979-01-01

A hypothesis of a microcosm space discreteness is considered from the theoretical-mathematical point of view. The type of topological spaces, which formalizes representations on the discrete space-time, is determined. It is explained, how these spaces arise in physical models. The physical task, in which the discrete space could arise as a version of its solution, is considered. It is shown that the discrete structure of space can arise with a certain interaction type in the system, for example, with its considerable self-shielding, which can take place, in particular, in the particles or in the cosmological and astrophysical singularities

Integrable semi-discretizations of the reduced Ostrovsky equation

International Nuclear Information System (INIS)

Feng, Bao-Feng; Maruno, Ken-ichi; Ohta, Yasuhiro

2015-01-01

Based on our previous work on the reduced Ostrovsky equation (J. Phys. A: Math. Theor. 45 355203), we construct its integrable semi-discretizations. Since the reduced Ostrovsky equation admits two alternative representations, one being its original form, the other the differentiated form (the short wave limit of the Degasperis–Procesi equation) two semi-discrete analogues of the reduced Ostrovsky equation are constructed possessing the same N-loop soliton solution. The relationship between these two versions of semi-discretizations is also clarified. (paper)

Discrete factor approximations in simultaneous equation models: estimating the impact of a dummy endogenous variable on a continuous outcome.

Science.gov (United States)

Mroz, T A

1999-10-01

This paper contains a Monte Carlo evaluation of estimators used to control for endogeneity of dummy explanatory variables in continuous outcome regression models. When the true model has bivariate normal disturbances, estimators using discrete factor approximations compare favorably to efficient estimators in terms of precision and bias; these approximation estimators dominate all the other estimators examined when the disturbances are non-normal. The experiments also indicate that one should liberally add points of support to the discrete factor distribution. The paper concludes with an application of the discrete factor approximation to the estimation of the impact of marriage on wages.

Optimization and Quantization in Gradient Symbol Systems: A Framework for Integrating the Continuous and the Discrete in Cognition

Science.gov (United States)

Smolensky, Paul; Goldrick, Matthew; Mathis, Donald

2014-01-01

Mental representations have continuous as well as discrete, combinatorial properties. For example, while predominantly discrete, phonological representations also vary continuously; this is reflected by gradient effects in instrumental studies of speech production. Can an integrated theoretical framework address both aspects of structure? The…

Intraclass Correlation Coefficients in Hierarchical Design Studies with Discrete Response Variables: A Note on a Direct Interval Estimation Procedure

Science.gov (United States)

Raykov, Tenko; Marcoulides, George A.

2015-01-01

A latent variable modeling procedure that can be used to evaluate intraclass correlation coefficients in two-level settings with discrete response variables is discussed. The approach is readily applied when the purpose is to furnish confidence intervals at prespecified confidence levels for these coefficients in setups with binary or ordinal…

A Quantized Boundary Representation of 2D Flows

KAUST Repository

Levine, J. A.

2012-06-01

Analysis and visualization of complex vector fields remain major challenges when studying large scale simulation of physical phenomena. The primary reason is the gap between the concepts of smooth vector field theory and their computational realization. In practice, researchers must choose between either numerical techniques, with limited or no guarantees on how they preserve fundamental invariants, or discrete techniques which limit the precision at which the vector field can be represented. We propose a new representation of vector fields that combines the advantages of both approaches. In particular, we represent a subset of possible streamlines by storing their paths as they traverse the edges of a triangulation. Using only a finite set of streamlines creates a fully discrete version of a vector field that nevertheless approximates the smooth flow up to a user controlled error bound. The discrete nature of our representation enables us to directly compute and classify analogues of critical points, closed orbits, and other common topological structures. Further, by varying the number of divisions (quantizations) used per edge, we vary the resolution used to represent the field, allowing for controlled precision. This representation is compact in memory and supports standard vector field operations.

Optimization and quantization in gradient symbol systems: a framework for integrating the continuous and the discrete in cognition.

Science.gov (United States)

Smolensky, Paul; Goldrick, Matthew; Mathis, Donald

2014-08-01

Mental representations have continuous as well as discrete, combinatorial properties. For example, while predominantly discrete, phonological representations also vary continuously; this is reflected by gradient effects in instrumental studies of speech production. Can an integrated theoretical framework address both aspects of structure? The framework we introduce here, Gradient Symbol Processing, characterizes the emergence of grammatical macrostructure from the Parallel Distributed Processing microstructure (McClelland, Rumelhart, & The PDP Research Group, 1986) of language processing. The mental representations that emerge, Distributed Symbol Systems, have both combinatorial and gradient structure. They are processed through Subsymbolic Optimization-Quantization, in which an optimization process favoring representations that satisfy well-formedness constraints operates in parallel with a distributed quantization process favoring discrete symbolic structures. We apply a particular instantiation of this framework, λ-Diffusion Theory, to phonological production. Simulations of the resulting model suggest that Gradient Symbol Processing offers a way to unify accounts of grammatical competence with both discrete and continuous patterns in language performance. Copyright © 2013 Cognitive Science Society, Inc.

3-D discrete analytical ridgelet transform.

Science.gov (United States)

Helbert, David; Carré, Philippe; Andres, Eric

2006-12-01

In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines: 3-D discrete radial lines going through the origin defined from their orthogonal projections and 3-D planes covered with 2-D discrete line segments. These discrete analytical lines have a parameter called arithmetical thickness, allowing us to define a 3-D DART adapted to a specific application. Indeed, the 3-D DART representation is not orthogonal, It is associated with a flexible redundancy factor. The 3-D DART has a very simple forward/inverse algorithm that provides an exact reconstruction without any iterative method. In order to illustrate the potentiality of this new discrete transform, we apply the 3-D DART and its extension to the Local-DART (with smooth windowing) to the denoising of 3-D image and color video. These experimental results show that the simple thresholding of the 3-D DART coefficients is efficient.

Violation of Continuous-Variable Einstein-Podolsky-Rosen Steering with Discrete Measurements

Science.gov (United States)

Schneeloch, James; Dixon, P. Ben; Howland, Gregory A.; Broadbent, Curtis J.; Howell, John C.

2013-03-01

In this Letter, we derive an entropic Einstein-Podolsky-Rosen (EPR) steering inequality for continuous-variable systems using only experimentally measured discrete probability distributions and details of the measurement apparatus. We use this inequality to witness EPR steering between the positions and momenta of photon pairs generated in spontaneous parametric down-conversion. We examine the asymmetry between parties in this inequality, and show that this asymmetry can be used to reduce the technical requirements of experimental setups intended to demonstrate the EPR paradox. Furthermore, we develop a more stringent steering inequality that is symmetric between parties, and use it to show that the down-converted photon pairs also exhibit symmetric EPR steering.

Discrete Ordinates Approximations to the First- and Second-Order Radiation Transport Equations

International Nuclear Information System (INIS)

FAN, WESLEY C.; DRUMM, CLIFTON R.; POWELL, JENNIFER L. email wcfan@sandia.gov

2002-01-01

The conventional discrete ordinates approximation to the Boltzmann transport equation can be described in a matrix form. Specifically, the within-group scattering integral can be represented by three components: a moment-to-discrete matrix, a scattering cross-section matrix and a discrete-to-moment matrix. Using and extending these entities, we derive and summarize the matrix representations of the second-order transport equations

Discrete Ordinates Approximations to the First- and Second-Order Radiation Transport Equations

CERN Document Server

Fan, W C; Powell, J L

2002-01-01

The conventional discrete ordinates approximation to the Boltzmann transport equation can be described in a matrix form. Specifically, the within-group scattering integral can be represented by three components: a moment-to-discrete matrix, a scattering cross-section matrix and a discrete-to-moment matrix. Using and extending these entities, we derive and summarize the matrix representations of the second-order transport equations.

Non-commutative representation for quantum systems on Lie groups

Energy Technology Data Exchange (ETDEWEB)

Raasakka, Matti Tapio

2014-01-27

space path integral with the help of the non-commutative dual variables. In studying the classical limit of the path integral, we show that we recover the correct classical equations of motion for the particle, if we account for the deformation of the phase space in the variational calculus. The non-commutative variables correspond in this limit to the classical momentum variables, further verifying their physical interpretation. We conclude that the non-commutative harmonic analysis facilitates a convenient study of the classical limit of quantum dynamics on a Lie group even if the group is compact, in which case variational calculus cannot easily be applied. As the second physics application, we repeat our above considerations for the case of Ponzano-Regge spin foam model for 3-dimensional quantum gravity. The non-commutative dual variables correspond in this case to discrete metric variables, thus illuminating the geometrical interpretation of the model. Again, we find that a convenient study of the classical limit is made possible through the non-commutative phase space path integral.

Non-commutative representation for quantum systems on Lie groups

International Nuclear Information System (INIS)

Raasakka, Matti Tapio

2014-01-01

integral with the help of the non-commutative dual variables. In studying the classical limit of the path integral, we show that we recover the correct classical equations of motion for the particle, if we account for the deformation of the phase space in the variational calculus. The non-commutative variables correspond in this limit to the classical momentum variables, further verifying their physical interpretation. We conclude that the non-commutative harmonic analysis facilitates a convenient study of the classical limit of quantum dynamics on a Lie group even if the group is compact, in which case variational calculus cannot easily be applied. As the second physics application, we repeat our above considerations for the case of Ponzano-Regge spin foam model for 3-dimensional quantum gravity. The non-commutative dual variables correspond in this case to discrete metric variables, thus illuminating the geometrical interpretation of the model. Again, we find that a convenient study of the classical limit is made possible through the non-commutative phase space path integral.

Tensor and Spin Representations of SO(4) and Discrete Quantum Gravity

Science.gov (United States)

Lorente, M.; Kramer, P.

Starting from the defining transformations of complex matrices for the SO(4) group, we construct the fundamental representation and the tensor and spinor representations of the group SO(4). Given the commutation relations for the corresponding algebra, the unitary representations of the group in terms of the generalized Euler angles are constructed. These mathematical results help us to a more complete description of the Barret-Crane model in Quantum Gravity. In particular a complete realization of the weight function for the partition function is given and a new geometrical interpretation of the asymptotic limit for the Regge action is presented.

The Propagation of Movement Variability in Time: A Methodological Approach for Discrete Movements with Multiple Degrees of Freedom

Science.gov (United States)

Krüger, Melanie; Straube, Andreas; Eggert, Thomas

2017-01-01

In recent years, theory-building in motor neuroscience and our understanding of the synergistic control of the redundant human motor system has significantly profited from the emergence of a range of different mathematical approaches to analyze the structure of movement variability. Approaches such as the Uncontrolled Manifold method or the Noise-Tolerance-Covariance decomposition method allow to detect and interpret changes in movement coordination due to e.g., learning, external task constraints or disease, by analyzing the structure of within-subject, inter-trial movement variability. Whereas, for cyclical movements (e.g., locomotion), mathematical approaches exist to investigate the propagation of movement variability in time (e.g., time series analysis), similar approaches are missing for discrete, goal-directed movements, such as reaching. Here, we propose canonical correlation analysis as a suitable method to analyze the propagation of within-subject variability across different time points during the execution of discrete movements. While similar analyses have already been applied for discrete movements with only one degree of freedom (DoF; e.g., Pearson's product-moment correlation), canonical correlation analysis allows to evaluate the coupling of inter-trial variability across different time points along the movement trajectory for multiple DoF-effector systems, such as the arm. The theoretical analysis is illustrated by empirical data from a study on reaching movements under normal and disturbed proprioception. The results show increased movement duration, decreased movement amplitude, as well as altered movement coordination under ischemia, which results in a reduced complexity of movement control. Movement endpoint variability is not increased under ischemia. This suggests that healthy adults are able to immediately and efficiently adjust the control of complex reaching movements to compensate for the loss of proprioceptive information. Further, it is

Discrete-feature modelling of the Aespoe Site: 1. Discrete-fracture network models for the repository scale

International Nuclear Information System (INIS)

Geier, J.E.; Thomas, A.L.

1996-08-01

This report describes the statistical derivation and partial validation of discrete-fracture network (DFN) models for the rock beneath the island of Aespoe in southeastern Sweden. The purpose was to develop DFN representations of the rock mass within a hypothetical, spent-fuel repository, located under Aespoe. Analyses are presented for four major lithologic types, with separate analyses of the rock within fracture zones, the rock excluding fracture zones, and all rock. Complete DFN models are proposed as descriptions of the rock mass in the near field. The procedure for validation, by comparison between actual and simulated packer tests, was found to be useful for discriminating among candidate DFN models. In particular, the validation approach was shown to be sensitive to a change in the fracture location (clustering) model, and to a change in the variance of single-fracture transmissivity. The proposed models are defined in terms of stochastic processes and statistical distributions, and thus are descriptive of the variability of the fracture system. This report includes discussion of the numerous sources of uncertainty in the models, including uncertainty that results from the variability of the natural system. 62 refs

Implementation of continuous-variable quantum key distribution with discrete modulation

Science.gov (United States)

Hirano, Takuya; Ichikawa, Tsubasa; Matsubara, Takuto; Ono, Motoharu; Oguri, Yusuke; Namiki, Ryo; Kasai, Kenta; Matsumoto, Ryutaroh; Tsurumaru, Toyohiro

2017-06-01

We have developed a continuous-variable quantum key distribution (CV-QKD) system that employs discrete quadrature-amplitude modulation and homodyne detection of coherent states of light. We experimentally demonstrated automated secure key generation with a rate of 50 kbps when a quantum channel is a 10 km optical fibre. The CV-QKD system utilises a four-state and post-selection protocol and generates a secure key against the entangling cloner attack. We used a pulsed light source of 1550 nm wavelength with a repetition rate of 10 MHz. A commercially available balanced receiver is used to realise shot-noise-limited pulsed homodyne detection. We used a non-binary LDPC code for error correction (reverse reconciliation) and the Toeplitz matrix multiplication for privacy amplification. A graphical processing unit card is used to accelerate the software-based post-processing.

A numerical method for the quasi-incompressible Cahn–Hilliard–Navier–Stokes equations for variable density flows with a discrete energy law

International Nuclear Information System (INIS)

Guo, Z.; Lin, P.; Lowengrub, J.S.

2014-01-01

In this paper, we investigate numerically a diffuse interface model for the Navier–Stokes equation with fluid–fluid interface when the fluids have different densities [48]. Under minor reformulation of the system, we show that there is a continuous energy law underlying the system, assuming that all variables have reasonable regularities. It is shown in the literature that an energy law preserving method will perform better for multiphase problems. Thus for the reformulated system, we design a C 0 finite element method and a special temporal scheme where the energy law is preserved at the discrete level. Such a discrete energy law (almost the same as the continuous energy law) for this variable density two-phase flow model has never been established before with C 0 finite element. A Newton method is introduced to linearise the highly non-linear system of our discretization scheme. Some numerical experiments are carried out using the adaptive mesh to investigate the scenario of coalescing and rising drops with differing density ratio. The snapshots for the evolution of the interface together with the adaptive mesh at different times are presented to show that the evolution, including the break-up/pinch-off of the drop, can be handled smoothly by our numerical scheme. The discrete energy functional for the system is examined to show that the energy law at the discrete level is preserved by our scheme

Current density and continuity in discretized models

International Nuclear Information System (INIS)

Boykin, Timothy B; Luisier, Mathieu; Klimeck, Gerhard

2010-01-01

Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schroedinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying discrete models, students can encounter conceptual difficulties with the representation of the current and its divergence because different finite-difference expressions, all of which reduce to the current density in the continuous limit, measure different physical quantities. Understanding these different discrete currents is essential and requires a careful analysis of the current operator, the divergence of the current and the continuity equation. Here we develop point forms of the current and its divergence valid for an arbitrary mesh and basis. We show that in discrete models currents exist only along lines joining atomic sites (or mesh points). Using these results, we derive a discrete analogue of the divergence theorem and demonstrate probability conservation in a purely localized-basis approach.

A discrete control model of PLANT

Science.gov (United States)

Mitchell, C. M.

1985-01-01

A model of the PLANT system using the discrete control modeling techniques developed by Miller is described. Discrete control models attempt to represent in a mathematical form how a human operator might decompose a complex system into simpler parts and how the control actions and system configuration are coordinated so that acceptable overall system performance is achieved. Basic questions include knowledge representation, information flow, and decision making in complex systems. The structure of the model is a general hierarchical/heterarchical scheme which structurally accounts for coordination and dynamic focus of attention. Mathematically, the discrete control model is defined in terms of a network of finite state systems. Specifically, the discrete control model accounts for how specific control actions are selected from information about the controlled system, the environment, and the context of the situation. The objective is to provide a plausible and empirically testable accounting and, if possible, explanation of control behavior.

The endoscopic classification of representations orthogonal and symplectic groups

CERN Document Server

Arthur, James

2013-01-01

Within the Langlands program, endoscopy is a fundamental process for relating automorphic representations of one group with those of another. In this book, Arthur establishes an endoscopic classification of automorphic representations of orthogonal and symplectic groups G. The representations are shown to occur in families (known as global L-packets and A-packets), which are parametrized by certain self-dual automorphic representations of an associated general linear group GL(N). The central result is a simple and explicit formula for the multiplicity in the automorphic discrete spectrum of G

Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials

International Nuclear Information System (INIS)

Tratnik, M.V.

1990-01-01

Several families of multivariable, biorthogonal, partly continuous and partly discrete, Wilson polynomials are presented. These yield limit cases that are purely continuous in some of the variables and purely discrete in the others, or purely discrete in all the variables. The latter are referred to as the multivariable biorthogonal Racah polynomials. Interesting further limit cases include the multivariable biorthogonal Hahn and dual Hahn polynomials

Infinitely many conservation laws for two integrable lattice hierarchies associated with a new discrete Schroedinger spectral problem

International Nuclear Information System (INIS)

Zhu, Zuo-nong; Tam, Hon-Wah; Ding, Qing

2003-01-01

In this Letter, by means of considering matrix form of a new Schroedinger discrete spectral operator equation, and constructing opportune time evolution equations, and using discrete zero curvature representation, two discrete integrable lattice hierarchies proposed by Boiti et al. [J. Phys. A: Math. Gen. 36 (2003) 139] are re-derived. From the matrix Lax representations, we demonstrate the existence of infinitely many conservation laws for the two lattice hierarchies and give the corresponding conserved densities and the associated fluxes by means of formulae. Thus their integrability is further confirmed. Specially we obtain the infinitely many conservation laws for a new discrete version of the KdV equation. A connection between the conservation laws of the discrete KdV equation and the ones of the KdV equation is discussed by two examples

Sampling-free Bayesian inversion with adaptive hierarchical tensor representations

Science.gov (United States)

Eigel, Martin; Marschall, Manuel; Schneider, Reinhold

2018-03-01

A sampling-free approach to Bayesian inversion with an explicit polynomial representation of the parameter densities is developed, based on an affine-parametric representation of a linear forward model. This becomes feasible due to the complete treatment in function spaces, which requires an efficient model reduction technique for numerical computations. The advocated perspective yields the crucial benefit that error bounds can be derived for all occuring approximations, leading to provable convergence subject to the discretization parameters. Moreover, it enables a fully adaptive a posteriori control with automatic problem-dependent adjustments of the employed discretizations. The method is discussed in the context of modern hierarchical tensor representations, which are used for the evaluation of a random PDE (the forward model) and the subsequent high-dimensional quadrature of the log-likelihood, alleviating the ‘curse of dimensionality’. Numerical experiments demonstrate the performance and confirm the theoretical results.

Improved method for solving the neutron transport problem by discretization of space and energy variables

International Nuclear Information System (INIS)

Bosevski, T.

1971-01-01

The polynomial interpolation of neutron flux between the chosen space and energy variables enabled transformation of the integral transport equation into a system of linear equations with constant coefficients. Solutions of this system are the needed values of flux for chosen values of space and energy variables. The proposed improved method for solving the neutron transport problem including the mathematical formalism is simple and efficient since the number of needed input data is decreased both in treating the spatial and energy variables. Mathematical method based on this approach gives more stable solutions with significantly decreased probability of numerical errors. Computer code based on the proposed method was used for calculations of one heavy water and one light water reactor cell, and the results were compared to results of other very precise calculations. The proposed method was better concerning convergence rate, decreased computing time and needed computer memory. Discretization of variables enabled direct comparison of theoretical and experimental results

Generalized Reduction Formula for Discrete Wigner Functions of Multiqubit Systems

Science.gov (United States)

Srinivasan, K.; Raghavan, G.

2018-03-01

Density matrices and Discrete Wigner Functions are equally valid representations of multiqubit quantum states. For density matrices, the partial trace operation is used to obtain the quantum state of subsystems, but an analogous prescription is not available for discrete Wigner Functions. Further, the discrete Wigner function corresponding to a density matrix is not unique but depends on the choice of the quantum net used for its reconstruction. In the present work, we derive a reduction formula for discrete Wigner functions of a general multiqubit state which works for arbitrary quantum nets. These results would be useful for the analysis and classification of entangled states and the study of decoherence purely in a discrete phase space setting and also in applications to quantum computing.

A discrete stress-strength interference model based on universal generating function

International Nuclear Information System (INIS)

An Zongwen; Huang Hongzhong; Liu Yu

2008-01-01

Continuous stress-strength interference (SSI) model regards stress and strength as continuous random variables with known probability density function. This, to some extent, results in a limitation of its application. In this paper, stress and strength are treated as discrete random variables, and a discrete SSI model is presented by using the universal generating function (UGF) method. Finally, case studies demonstrate the validity of the discrete model in a variety of circumstances, in which stress and strength can be represented by continuous random variables, discrete random variables, or two groups of experimental data

On the physical relevance of the discrete Fourier transform

CSIR Research Space (South Africa)

Greben, JM

1991-11-01

Full Text Available This paper originated from the author's dissatisfaction with the way the discrete Fourier transform is usually presented in the literature. Although mathematically correct, the physical meaning of the common representation is unsatisfactory...

Langevin dynamics for vector variables driven by multiplicative white noise: A functional formalism

Science.gov (United States)

Moreno, Miguel Vera; Arenas, Zochil González; Barci, Daniel G.

2015-04-01

We discuss general multidimensional stochastic processes driven by a system of Langevin equations with multiplicative white noise. In particular, we address the problem of how time reversal diffusion processes are affected by the variety of conventions available to deal with stochastic integrals. We present a functional formalism to build up the generating functional of correlation functions without any type of discretization of the Langevin equations at any intermediate step. The generating functional is characterized by a functional integration over two sets of commuting variables, as well as Grassmann variables. In this representation, time reversal transformation became a linear transformation in the extended variables, simplifying in this way the complexity introduced by the mixture of prescriptions and the associated calculus rules. The stochastic calculus is codified in our formalism in the structure of the Grassmann algebra. We study some examples such as higher order derivative Langevin equations and the functional representation of the micromagnetic stochastic Landau-Lifshitz-Gilbert equation.

Silicon photonic transceiver circuit for high-speed polarization-based discrete variable quantum key distribution.

Science.gov (United States)

Cai, Hong; Long, Christopher M; DeRose, Christopher T; Boynton, Nicholas; Urayama, Junji; Camacho, Ryan; Pomerene, Andrew; Starbuck, Andrew L; Trotter, Douglas C; Davids, Paul S; Lentine, Anthony L

2017-05-29

We demonstrate a silicon photonic transceiver circuit for high-speed discrete variable quantum key distribution that employs a common structure for transmit and receive functions. The device is intended for use in polarization-based quantum cryptographic protocols, such as BB84. Our characterization indicates that the circuit can generate the four BB84 states (TE/TM/45°/135° linear polarizations) with >30 dB polarization extinction ratios and gigabit per second modulation speed, and is capable of decoding any polarization bases differing by 90° with high extinction ratios.

Restriction of complementary series representations of O(1,N) to symmetric subgroups

DEFF Research Database (Denmark)

Möllers, Jan; Oshima, Yoshiki

by a direct integral of principal series representations whereas the discrete part consists of finitely many complementary series representations. The explicit Plancherel formula is computed on the Fourier transformed side of the non-compact realization of the complementary series by using the spectral...

Restriction of complementary series representations of $O(1,N)$ to symmetric subgroups

DEFF Research Database (Denmark)

Möllers, Jan; Oshima, Yoshiki

2012-01-01

is given by a direct integral of principal series representations whereas the discrete part consists of finitely many complementary series representations. The explicit Plancherel formula is computed on the Fourier transformed side of the non-compact realization of the complementary series by using...

Model predictive control-based scheduler for repetitive discrete event systems with capacity constraints

Directory of Open Access Journals (Sweden)

Hiroyuki Goto

2013-07-01

Full Text Available A model predictive control-based scheduler for a class of discrete event systems is designed and developed. We focus on repetitive, multiple-input, multiple-output, and directed acyclic graph structured systems on which capacity constraints can be imposed. The target system’s behaviour is described by linear equations in max-plus algebra, referred to as state-space representation. Assuming that the system’s performance can be improved by paying additional cost, we adjust the system parameters and determine control inputs for which the reference output signals can be observed. The main contribution of this research is twofold, 1: For systems with capacity constraints, we derived an output prediction equation as functions of adjustable variables in a recursive form, 2: Regarding the construct for the system’s representation, we improved the structure to accomplish general operations which are essential for adjusting the system parameters. The result of numerical simulation in a later section demonstrates the effectiveness of the developed controller.

Modelling Dowel Action of Discrete Reinforcing Bars in Cracked Concrete Structures

International Nuclear Information System (INIS)

Kwan, A. K. H.; Ng, P. L.; Lam, J. Y. K.

2010-01-01

Dowel action is one of the component actions for shear force transfer in cracked reinforced concrete. In finite element analysis of concrete structures, the use of discrete representation of reinforcing bars is considered advantageous over the smeared representation due to the relative ease of modelling the bond-slip behaviour. However, there is very limited research on how to simulate the dowel action of discrete reinforcing bars. Herein, a numerical model for dowel action of discrete reinforcing bars crossing cracks in concrete is developed. The model features the derivation of dowel stiffness matrix based on beam-on-elastic-foundation theory and the direct assemblage of dowel stiffness into the concrete element stiffness matrices. The dowel action model is incorporated in a nonlinear finite element programme with secant stiffness formulation. Deep beams tested in the literature are analysed and it is found that the incorporation of dowel action model improves the accuracy of analysis.

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis

Linear parameter varying representations for nonlinear control design

Science.gov (United States)

Carter, Lance Huntington

Linear parameter varying (LPV) systems are investigated as a framework for gain-scheduled control design and optimal hybrid control. An LPV system is defined as a linear system whose dynamics depend upon an a priori unknown but measurable exogenous parameter. A gain-scheduled autopilot design is presented for a bank-to-turn (BTT) missile. The method is novel in that the gain-scheduled design does not involve linearizations about operating points. Instead, the missile dynamics are brought to LPV form via a state transformation. This idea is applied to the design of a coupled longitudinal/lateral BTT missile autopilot. The pitch and yaw/roll dynamics are separately transformed to LPV form, where the cross axis states are treated as "exogenous" parameters. These are actually endogenous variables, so such a plant is called "quasi-LPV." Once in quasi-LPV form, a family of robust controllers using mu synthesis is designed for both the pitch and yaw/roll channels, using angle-of-attack and roll rate as the scheduling variables. The closed-loop time response is simulated using the original nonlinear model and also using perturbed aerodynamic coefficients. Modeling and control of engine idle speed is investigated using LPV methods. It is shown how generalized discrete nonlinear systems may be transformed into quasi-LPV form. A discrete nonlinear engine model is developed and expressed in quasi-LPV form with engine speed as the scheduling variable. An example control design is presented using linear quadratic methods. Simulations are shown comparing the LPV based controller performance to that using PID control. LPV representations are also shown to provide a setting for hybrid systems. A hybrid system is characterized by control inputs consisting of both analog signals and discrete actions. A solution is derived for the optimal control of hybrid systems with generalized cost functions. This is shown to be computationally intensive, so a suboptimal strategy is proposed that

Variable speed wind turbine control by discrete-time sliding mode approach.

Science.gov (United States)

Torchani, Borhen; Sellami, Anis; Garcia, Germain

2016-05-01

The aim of this paper is to propose a new design variable speed wind turbine control by discrete-time sliding mode approach. This methodology is designed for linear saturated system. The saturation constraint is reported on inputs vector. To this end, the back stepping design procedure is followed to construct a suitable sliding manifold that guarantees the attainment of a stabilization control objective. It is well known that the mechanisms are investigated in term of the most proposed assumptions to deal with the damping, shaft stiffness and inertia effect of the gear. The objectives are to synthesize robust controllers that maximize the energy extracted from wind, while reducing mechanical loads and rotor speed tracking combined with an electromagnetic torque. Simulation results of the proposed scheme are presented. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Application of an efficient Bayesian discretization method to biomedical data

Directory of Open Access Journals (Sweden)

Gopalakrishnan Vanathi

2011-07-01

Full Text Available Abstract Background Several data mining methods require data that are discrete, and other methods often perform better with discrete data. We introduce an efficient Bayesian discretization (EBD method for optimal discretization of variables that runs efficiently on high-dimensional biomedical datasets. The EBD method consists of two components, namely, a Bayesian score to evaluate discretizations and a dynamic programming search procedure to efficiently search the space of possible discretizations. We compared the performance of EBD to Fayyad and Irani's (FI discretization method, which is commonly used for discretization. Results On 24 biomedical datasets obtained from high-throughput transcriptomic and proteomic studies, the classification performances of the C4.5 classifier and the naïve Bayes classifier were statistically significantly better when the predictor variables were discretized using EBD over FI. EBD was statistically significantly more stable to the variability of the datasets than FI. However, EBD was less robust, though not statistically significantly so, than FI and produced slightly more complex discretizations than FI. Conclusions On a range of biomedical datasets, a Bayesian discretization method (EBD yielded better classification performance and stability but was less robust than the widely used FI discretization method. The EBD discretization method is easy to implement, permits the incorporation of prior knowledge and belief, and is sufficiently fast for application to high-dimensional data.

Improved Genetic Algorithm with Two-Level Approximation for Truss Optimization by Using Discrete Shape Variables

Directory of Open Access Journals (Sweden)

Shen-yan Chen

2015-01-01

Full Text Available This paper presents an Improved Genetic Algorithm with Two-Level Approximation (IGATA to minimize truss weight by simultaneously optimizing size, shape, and topology variables. On the basis of a previously presented truss sizing/topology optimization method based on two-level approximation and genetic algorithm (GA, a new method for adding shape variables is presented, in which the nodal positions are corresponding to a set of coordinate lists. A uniform optimization model including size/shape/topology variables is established. First, a first-level approximate problem is constructed to transform the original implicit problem to an explicit problem. To solve this explicit problem which involves size/shape/topology variables, GA is used to optimize individuals which include discrete topology variables and shape variables. When calculating the fitness value of each member in the current generation, a second-level approximation method is used to optimize the continuous size variables. With the introduction of shape variables, the original optimization algorithm was improved in individual coding strategy as well as GA execution techniques. Meanwhile, the update strategy of the first-level approximation problem was also improved. The results of numerical examples show that the proposed method is effective in dealing with the three kinds of design variables simultaneously, and the required computational cost for structural analysis is quite small.

Multidimensional digital image representations using generalized Kaiser-Bessel window functions.

Science.gov (United States)

Lewitt, R M

1990-10-01

Inverse problems that require the solution of integral equations are inherent in a number of indirect imaging applications, such as computerized tomography. Numerical solutions based on discretization of the mathematical model of the imaging process, or on discretization of analytic formulas for iterative inversion of the integral equations, require a discrete representation of an underlying continuous image. This paper describes discrete image representations, in n-dimensional space, that are constructed by the superposition of shifted copies of a rotationally symmetric basis function. The basis function is constructed using a generalization of the Kaiser-Bessel window function of digital signal processing. The generalization of the window function involves going from one dimension to a rotationally symmetric function in n dimensions and going from the zero-order modified Bessel function of the standard window to a function involving the modified Bessel function of order m. Three methods are given for the construction, in n-dimensional space, of basis functions having a specified (finite) number of continuous derivatives, and formulas are derived for the Fourier transform, the x-ray transform, the gradient, and the Laplacian of these basis functions. Properties of the new image representations using these basis functions are discussed, primarily in the context of two-dimensional and three-dimensional image reconstruction from line-integral data by iterative inversion of the x-ray transform. Potential applications to three-dimensional image display are also mentioned.

Discretization of 3d gravity in different polarizations

Science.gov (United States)

Dupuis, Maïté; Freidel, Laurent; Girelli, Florian

2017-10-01

We study the discretization of three-dimensional gravity with Λ =0 following the loop quantum gravity framework. In the process, we realize that different choices of polarization are possible. This allows us to introduce a new discretization based on the triad as opposed to the connection as in the standard loop quantum gravity framework. We also identify the classical nontrivial symmetries of discrete gravity, namely the Drinfeld double, given in terms of momentum maps. Another choice of polarization is given by the Chern-Simons formulation of gravity. Our framework also provides a new discretization scheme of Chern-Simons, which keeps track of the link between the continuum variables and the discrete ones. We show how the Poisson bracket we recover between the Chern-Simons holonomies allows us to recover the Goldman bracket. There is also a transparent link between the discrete Chern-Simons formulation and the discretization of gravity based on the connection (loop gravity) or triad variables (dual loop gravity).

A three dimensional elastoplastic cyclic constitutive law with a semi discrete variable and a ratchetting stress

International Nuclear Information System (INIS)

Geyer, P.; Proix, J.M.; Jayet-Gendrot, S.; Schoenberger, P.; Taheri, S.

1995-01-01

The study of cyclic elastoplastic constitutive law is, at the moment, focused on non proportional loadings, but for uniaxial loadings some problems remain, as for example the ability for a law to describe simultaneously ratcheting (constant increment of strain) in non symmetrical ones. We propose a law with a discrete memory variable, the plastic strain at the last unloading, and a ratchetting stress which, in addition to previous phenomena, describes the other hand the choice of all macroscopic variables is justified by a microscopic analysis. The extension to 3D situations of this law is proposed. The discrete nature of the memory leads to discontinuity problems for some loading paths, a modification is then proposed which uses a differential evolution law. For large enough uniaxial cycles, the uniaxial law is nevertheless recovered. An incremental form of he implicit evolution problem is given, and we describe the implementation of this model in the Code Aster a thermomechanical structural software using the f.e.m. developed at Electricite de France. For a 316 stainless steel we present comparisons between experiments and numerical results in uniaxial and biaxial ratchetting and non proportional strain controlled test (circular, square, stair loading). (authors). 13 refs., 10 figs

Anyonic order parameters for discrete gauge theories on the lattice

International Nuclear Information System (INIS)

Bais, F.A.; Romers, J.C.

2009-01-01

We present a new family of gauge invariant non-local order parameters Δ α A for (non-abelian) discrete gauge theories on a Euclidean lattice, which are in one-to-one correspondence with the excitation spectrum that follows from the representation theory of the quantum double D(H) of the finite group H. These combine magnetic flux-sector labeled by a conjugacy class with an electric representation of the centralizer subgroup that commutes with the flux. In particular, cases like the trivial class for magnetic flux, or the trivial irrep for electric charge, these order parameters reduce to the familiar Wilson and the 't Hooft operators, respectively. It is pointed out that these novel operators are crucial for probing the phase structure of a class of discrete lattice models we define, using Monte Carlo simulations.

Properties of the Simpson discrete fourier transform | Singh ...

African Journals Online (AJOL)

The Simpson discrete Fourier transform (SDFT) and its inverse are transformations relating the time and frequency domains. In this paper we state and prove the important properties of shift, circular convolution, conjugation, time reversal and Plancherel's theorem. In addition, we provide an alternative representation of the ...

Integrable discretization s of derivative nonlinear Schroedinger equations

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2002-01-01

We propose integrable discretizations of derivative nonlinear Schroedinger (DNLS) equations such as the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation by constructing Lax pairs. The discrete DNLS systems admit the reduction of complex conjugation between two dependent variables and possess bi-Hamiltonian structure. Through transformations of variables and reductions, we obtain novel integrable discretizations of the nonlinear Schroedinger (NLS), modified KdV (mKdV), mixed NLS, matrix NLS, matrix KdV, matrix mKdV, coupled NLS, coupled Hirota, coupled Sasa-Satsuma and Burgers equations. We also discuss integrable discretizations of the sine-Gordon equation, the massive Thirring model and their generalizations. (author)

Nonlinear nano-scale localized breather modes in a discrete weak ferromagnetic spin lattice

International Nuclear Information System (INIS)

Kavitha, L.; Parasuraman, E.; Gopi, D.; Prabhu, A.; Vicencio, Rodrigo A.

2016-01-01

We investigate the propagation dynamics of highly localized discrete breather modes in a weak ferromagnetic spin lattice with on-site easy axis anisotropy due to crystal field effect. We derive the discrete nonlinear equation of motion by employing boson mappings and p-representation. We explore the onset of modulational instability both analytically in the framework of linear stability analysis and numerically by means of molecular dynamics (MD) simulations, and a perfect agreement was demonstrated. It is also explored that how the antisymmetric nature of the canted ferromagnetic lattice supports highly localized discrete breather (DBs) modes as shown in the stability/instability windows. The energy exchange between low amplitude discrete breathers favours the growth of higher amplitude DBs, resulting eventually in the formation of few long-lived high amplitude DBs. - Highlights: • The effects of DM and anisotropy interaction on the DB modes are studied. • The antisymmetric nature of the canted ferromagnetic medium supports the DB modes. • Dynamics of ferromagnetic chain is governed by boson mappings and p-representation.

Affine Kac-Moody algebras and their representations

International Nuclear Information System (INIS)

Slansky, R.

1988-01-01

Highest weight representation theory of finite dimensional and affine Kac-Moody algebras is summarized from a unified point of view. Lattices of discrete additive quantum numbers and the presentation of Lie algebras on Cartan matrices are the central points of departure for the analysis. (author)

Snake representation of a superprocess in random environment

OpenAIRE

Mytnik, Leonid; Xiong, Jie; Zeitouni, Ofer

2011-01-01

We consider (discrete time) branching particles in a random environment which is i.i.d. in time and possibly spatially correlated. We prove a representation of the limit process by means of a Brownian snake in random environment.

Variationally derived coarse mesh methods using an alternative flux representation

International Nuclear Information System (INIS)

Wojtowicz, G.; Holloway, J.P.

1995-01-01

Investigation of a previously reported variational technique for the solution of the 1-D, 1-group neutron transport equation in reactor lattices has inspired the development of a finite element formulation of the method. Compared to conventional homogenization methods in which node homogenized cross sections are used, the coefficients describing this system take on greater spatial dependence. However, the methods employ an alternative flux representation which allows the transport equation to be cast into a form whose solution has only a slow spatial variation and, hence, requires relatively few variables to describe. This alternative flux representation and the stationary property of a variational principle define a class of coarse mesh discretizations of transport theory capable of achieving order of magnitude reductions of eigenvalue and pointwise scalar flux errors as compared with diffusion theory while retaining diffusion theory's relatively low cost. Initial results of a 1-D spectral element approach are reviewed and used to motivate the finite element implementation which is more efficient and almost as accurate; one and two group results of this method are described

Discrete non-parametric kernel estimation for global sensitivity analysis

International Nuclear Information System (INIS)

Senga Kiessé, Tristan; Ventura, Anne

2016-01-01

This work investigates the discrete kernel approach for evaluating the contribution of the variance of discrete input variables to the variance of model output, via analysis of variance (ANOVA) decomposition. Until recently only the continuous kernel approach has been applied as a metamodeling approach within sensitivity analysis framework, for both discrete and continuous input variables. Now the discrete kernel estimation is known to be suitable for smoothing discrete functions. We present a discrete non-parametric kernel estimator of ANOVA decomposition of a given model. An estimator of sensitivity indices is also presented with its asymtotic convergence rate. Some simulations on a test function analysis and a real case study from agricultural have shown that the discrete kernel approach outperforms the continuous kernel one for evaluating the contribution of moderate or most influential discrete parameters to the model output. - Highlights: • We study a discrete kernel estimation for sensitivity analysis of a model. • A discrete kernel estimator of ANOVA decomposition of the model is presented. • Sensitivity indices are calculated for discrete input parameters. • An estimator of sensitivity indices is also presented with its convergence rate. • An application is realized for improving the reliability of environmental models.

Numerical Integration Techniques for Curved-Element Discretizations of Molecule–Solvent Interfaces

Science.gov (United States)

Bardhan, Jaydeep P.; Altman, Michael D.; Willis, David J.; Lippow, Shaun M.; Tidor, Bruce; White, Jacob K.

2012-01-01

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, we have developed methods to model several important surface formulations using exact surface discretizations. Following and refining Zauhar’s work (J. Comp.-Aid. Mol. Des. 9:149-159, 1995), we define two classes of curved elements that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. We then present numerical integration techniques that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, we present a set of calculations that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planartriangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute–solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved

Toward a Unified Representation of Atmospheric Convection in Variable-Resolution Climate Models

Energy Technology Data Exchange (ETDEWEB)

Walko, Robert [Univ. of Miami, Coral Gables, FL (United States)

2016-11-07

The purpose of this project was to improve the representation of convection in atmospheric weather and climate models that employ computational grids with spatially-variable resolution. Specifically, our work targeted models whose grids are fine enough over selected regions that convection is resolved explicitly, while over other regions the grid is coarser and convection is represented as a subgrid-scale process. The working criterion for a successful scheme for representing convection over this range of grid resolution was that identical convective environments must produce very similar convective responses (i.e., the same precipitation amount, rate, and timing, and the same modification of the atmospheric profile) regardless of grid scale. The need for such a convective scheme has increased in recent years as more global weather and climate models have adopted variable resolution meshes that are often extended into the range of resolving convection in selected locations.

Two-Layer Variable Infiltration Capacity Land Surface Representation for General Circulation Models

Science.gov (United States)

Xu, L.

1994-01-01

A simple two-layer variable infiltration capacity (VIC-2L) land surface model suitable for incorporation in general circulation models (GCMs) is described. The model consists of a two-layer characterization of the soil within a GCM grid cell, and uses an aerodynamic representation of latent and sensible heat fluxes at the land surface. The effects of GCM spatial subgrid variability of soil moisture and a hydrologically realistic runoff mechanism are represented in the soil layers. The model was tested using long-term hydrologic and climatalogical data for Kings Creek, Kansas to estimate and validate the hydrological parameters. Surface flux data from three First International Satellite Land Surface Climatology Project Field Experiments (FIFE) intensive field compaigns in the summer and fall of 1987 in central Kansas, and from the Anglo-Brazilian Amazonian Climate Observation Study (ABRACOS) in Brazil were used to validate the mode-simulated surface energy fluxes and surface temperature.

First-order discrete Faddeev gravity at strongly varying fields

Science.gov (United States)

Khatsymovsky, V. M.

2017-11-01

We consider the Faddeev formulation of general relativity (GR), which can be characterized by a kind of d-dimensional tetrad (typically d = 10) and a non-Riemannian connection. This theory is invariant w.r.t. the global, but not local, rotations in the d-dimensional space. There can be configurations with a smooth or flat metric, but with the tetrad that changes abruptly at small distances, a kind of “antiferromagnetic” structure. Previously, we discussed a first-order representation for the Faddeev gravity, which uses the orthogonal connection in the d-dimensional space as an independent variable. Using the discrete form of this formulation, we considered the spectrum of (elementary) area. This spectrum turns out to be physically reasonable just on a classical background with large connection like rotations by π, that is, with such an “antiferromagnetic” structure. In the discrete first-order Faddeev gravity, we consider such a structure with periodic cells and large connection and strongly changing tetrad field inside the cell. We show that this system in the continuum limit reduces to a generalization of the Faddeev system. The action is a sum of related actions of the Faddeev type and is still reduced to the GR action.

Discrete-Time Systems

Indian Academy of Sciences (India)

We also describe discrete-time systems in terms of difference ... A more modern alternative, especially for larger systems, is to convert ... In other words, ..... picture?) State-variable equations are also called state-space equations because the ...

Anatomical variability in the cortical representation of first and second language.

Science.gov (United States)

Dehaene, S; Dupoux, E; Mehler, J; Cohen, L; Paulesu, E; Perani, D; van de Moortele, P F; Lehéricy, S; Le Bihan, D

1997-12-01

Functional magnetic resonance imaging was used to assess inter-subject variability in the cortical representation of language comprehension processes. Moderately fluent French-English bilinguals were scanned while they listened to stories in their first language (L1 = French) or in a second language (L2 = English) acquired at school after the age of seven. In all subjects, listening to L1 always activated a similar set of areas in the left temporal lobe, clustered along the left superior temporal sulcus. Listening to L2, however, activated a highly variable network of left and right temporal and frontal areas, sometimes restricted only to right-hemispheric regions. These results support the hypothesis that first language acquisition relies on a dedicated left-hemispheric cerebral network, while late second language acquisition is not necessarily associated with a reproducible biological substrate. The postulated contribution of the right hemisphere to L2 comprehension is found to hold only on average, individual subjects varying from complete right lateralization to standard left lateralization for L2.

Wavelets for Sparse Representation of Music

DEFF Research Database (Denmark)

Endelt, Line Ørtoft; Harbo, Anders La-Cour

2004-01-01

We are interested in obtaining a sparse representation of music signals by means of a discrete wavelet transform (DWT). That means we want the energy in the representation to be concentrated in few DWT coefficients. It is well-known that the decay of the DWT coefficients is strongly related...... to the number of vanishing moments of the mother wavelet, and to the smoothness of the signal. In this paper we present the result of applying two classical families of wavelets to a series of musical signals. The purpose is to determine a general relation between the number of vanishing moments of the wavelet...

Priming vs. Rhyming: Orthographic and Phonological Representations in the Left and Right Hemispheres

Science.gov (United States)

Lindell, Annukka K.; Lum, Jarrad A. G.

2008-01-01

The right cerebral hemisphere has long been argued to lack phonological processing capacity. Recently, however, a sex difference in the cortical representation of phonology has been proposed, suggesting discrete left hemisphere lateralization in males and more distributed, bilateral representation of function in females. To evaluate this…

An XML Representation for Crew Procedures

Science.gov (United States)

Simpson, Richard C.

2005-01-01

NASA ensures safe operation of complex systems through the use of formally-documented procedures, which encode the operational knowledge of the system as derived from system experts. Crew members use procedure documentation on the ground for training purposes and on-board space shuttle and space station to guide their activities. Investigators at JSC are developing a new representation for procedures that is content-based (as opposed to display-based). Instead of specifying how a procedure should look on the printed page, the content-based representation will identify the components of a procedure and (more importantly) how the components are related (e.g., how the activities within a procedure are sequenced; what resources need to be available for each activity). This approach will allow different sets of rules to be created for displaying procedures on a computer screen, on a hand-held personal digital assistant (PDA), verbally, or on a printed page, and will also allow intelligent reasoning processes to automatically interpret and use procedure definitions. During his NASA fellowship, Dr. Simpson examined how various industries represent procedures (also called business processes or workflows), in areas such as manufacturing, accounting, shipping, or customer service. A useful method for designing and evaluating workflow representation languages is by determining their ability to encode various workflow patterns, which depict abstract relationships between the components of a procedure removed from the context of a specific procedure or industry. Investigators have used this type of analysis to evaluate how well-suited existing workflow representation languages are for various industries based on the workflow patterns that commonly arise across industry-specific procedures. Based on this type of analysis, it is already clear that existing workflow representations capture discrete flow of control (i.e., when one activity should start and stop based on when other

A study of discrete nonlinear systems

International Nuclear Information System (INIS)

Dhillon, H.S.

2001-04-01

An investigation of various spatially discrete time-independent nonlinear models was undertaken. These models are generically applicable to many different physical systems including electron-phonon interactions in solids, magnetic multilayers, layered superconductors and classical lattice systems. To characterise the possible magnetic structures created on magnetic multilayers a model has been formulated and studied. The Euler-Lagrange equation for this model is a discrete version of the Sine-Gordon equation. Solutions of this equation are generated by applying the methods of Chaotic Dynamics - treating the space variable associated with the layer number as a discrete time variable. The states found indicate periodic, quasiperiodic and chaotic structures. Analytic solutions to the discrete nonlinear Schroedinger Equation (DNSE) with cubic nonlinearity are presented in the strong coupling limit. Using these as a starting point, a procedure is developed to determine the wave function and the energy eigenvalue for moderate coupling. The energy eigenvalues of the different structures of the wave function are found to be in excellent agreement with the exact strong coupling result. The solutions to the DNSE indicate commensurate and incommensurate spatial structures associated with different localisation patterns of the wave function. The states which arise may be fractal, periodic, quasiperiodic or chaotic. This work is then extended to solve a first order discrete nonlinear equation. The exact solutions for both the first and second order discrete nonlinear equations with cubic nonlinearity suggests that this method of studying discrete nonlinear equations may be applied to solve discrete equations with any order difference and cubic nonlinearity. (author)

Discrete vessel heat transfer in perfused tissue - model comparison

NARCIS (Netherlands)

Stanczyk, M.; Leeuwen, van G.M.J.; Steenhoven, van A.A.

2007-01-01

The aim of this paper is to compare two methods of calculating heat transfer in perfused biological tissue using a discrete vessel description. The methods differ in two important aspects: the representation of the vascular system and the algorithm for calculating the heat flux between tissue and

Spatial representation and cognitive modulation of response variability in the lateral intraparietal area priority map.

Science.gov (United States)

Falkner, Annegret L; Goldberg, Michael E; Krishna, B Suresh

2013-10-09

The lateral intraparietal area (LIP) in the macaque contains a priority-based representation of the visual scene. We previously showed that the mean spike rate of LIP neurons is strongly influenced by spatially wide-ranging surround suppression in a manner that effectively sharpens the priority map. Reducing response variability can also improve the precision of LIP's priority map. We show that when a monkey plans a visually guided delayed saccade with an intervening distractor, variability (measured by the Fano factor) decreases both for neurons representing the saccade goal and for neurons representing the broad spatial surround. The reduction in Fano factor is maximal for neurons representing the saccade goal and steadily decreases for neurons representing more distant locations. LIP Fano factor changes are behaviorally significant: increasing expected reward leads to lower variability for the LIP representation of both the target and distractor locations, and trials with shorter latency saccades are associated with lower Fano factors in neurons representing the surround. Thus, the LIP Fano factor reflects both stimulus and behavioral engagement. Quantitative modeling shows that the interaction between mean spike count and target-receptive field (RF) distance in the surround during the predistractor epoch is multiplicative: the Fano factor increases more steeply with mean spike count further away from the RF. A negative-binomial model for LIP spike counts captures these findings quantitatively, suggests underlying mechanisms based on trial-by-trial variations in mean spike rate or burst-firing patterns, and potentially provides a principled framework to account simultaneously for the previously observed unsystematic relationships between spike rate and variability in different brain areas.

Comparison of small-footprint discrete return and full waveform airborne lidar data for estimating multiple forest variables

OpenAIRE

Sumnall, Matthew J.; Hill, Ross A.; Hinsley, Shelley A.

2016-01-01

The quantification of forest ecosystems is important for a variety of purposes, including the assessment of wildlife habitat, nutrient cycles, timber yield and fire propagation. This research assesses the estimation of forest structure, composition and deadwood variables from small-footprint airborne lidar data, both discrete return (DR) and full waveform (FW), acquired under leaf-on and leaf-off conditions. The field site, in the New Forest, UK, includes managed plantation and ancient, se...

Providing a non-deterministic representation of spatial variability of precipitation in the Everest region

Directory of Open Access Journals (Sweden)

J. Eeckman

2017-09-01

Full Text Available This paper provides a new representation of the effect of altitude on precipitation that represents spatial and temporal variability in precipitation in the Everest region. Exclusive observation data are used to infer a piecewise linear function for the relation between altitude and precipitation and significant seasonal variations are highlighted. An original ensemble approach is applied to provide non-deterministic water budgets for middle and high-mountain catchments. Physical processes at the soil–atmosphere interface are represented through the Interactions Soil–Biosphere–Atmosphere (ISBA surface scheme. Uncertainties associated with the model parametrization are limited by the integration of in situ measurements of soils and vegetation properties. Uncertainties associated with the representation of the orographic effect are shown to account for up to 16 % of annual total precipitation. Annual evapotranspiration is shown to represent 26 % ± 1 % of annual total precipitation for the mid-altitude catchment and 34% ± 3 % for the high-altitude catchment. Snowfall contribution is shown to be neglectable for the mid-altitude catchment, and it represents up to 44 % ± 8 % of total precipitation for the high-altitude catchment. These simulations on the local scale enhance current knowledge of the spatial variability in hydroclimatic processes in high- and mid-altitude mountain environments.

A matrix problem over a discrete valuation ring

International Nuclear Information System (INIS)

Zavadskii, A G; Revitskaya, U S

1999-01-01

A flat matrix problem of mixed type (over a discrete valuation ring and its skew field of fractions) is considered which naturally arises in connection with several problems in the theory of integer-valued representations and in ring theory. For this problem, a criterion for module boundedness is proved, which is stated in terms of a pair of partially ordered sets (P(A),P(B)) associated with the pair of transforming algebras (A,B) defining the problem. The corresponding statement coincides in effect with the formulation of Kleiner's well-known finite-type criterion for representations of pairs of partially ordered sets over a field. The proof is based on a reduction (which uses the techniques of differentiation) to representations of semimaximal rings (tiled orders) and partially ordered sets

Introduction to computer data representation

CERN Document Server

Fenwick, Peter

2014-01-01

Introduction to Computer Data Representation introduces readers to the representation of data within computers. Starting from basic principles of number representation in computers, the book covers the representation of both integer and floating point numbers, and characters or text. It comprehensively explains the main techniques of computer arithmetic and logical manipulation. The book also features chapters covering the less usual topics of basic checksums and 'universal' or variable length representations for integers, with additional coverage of Gray Codes, BCD codes and logarithmic repre

DEVS representation of dynamical systems - Event-based intelligent control. [Discrete Event System Specification

Science.gov (United States)

Zeigler, Bernard P.

1989-01-01

It is shown how systems can be advantageously represented as discrete-event models by using DEVS (discrete-event system specification), a set-theoretic formalism. Such DEVS models provide a basis for the design of event-based logic control. In this control paradigm, the controller expects to receive confirming sensor responses to its control commands within definite time windows determined by its DEVS model of the system under control. The event-based contral paradigm is applied in advanced robotic and intelligent automation, showing how classical process control can be readily interfaced with rule-based symbolic reasoning systems.

Discrete structures in F-theory compactifications

Energy Technology Data Exchange (ETDEWEB)

Till, Oskar

2016-05-04

In this thesis we study global properties of F-theory compactifications on elliptically and genus-one fibered Calabi-Yau varieties. This is motivated by phenomenological considerations as well as by the need for a deeper understanding of the set of consistent F-theory vacua. The global geometric features arise from discrete and arithmetic structures in the torus fiber and can be studied in detail for fibrations over generic bases. In the case of elliptic fibrations we study the role of the torsion subgroup of the Mordell-Weil group of sections in four dimensional compactifications. We show how the existence of a torsional section restricts the admissible matter representations in the theory. This is shown to be equivalent to inducing a non-trivial fundamental group of the gauge group. Compactifying F-theory on genus-one fibrations with multisections gives rise to discrete selection rules. In field theory the discrete symmetry is a broken U(1) symmetry. In the geometry the higgsing corresponds to a conifold transition. We explain in detail the origin of the discrete symmetry from two different M-theory phases and put the result into the context of torsion homology. Finally we systematically construct consistent gauge fluxes on genus-one fibrations and show that these induce an anomaly free chiral spectrum.

Regular Discrete Cosine Transform and its Application to Digital Images Representation

Directory of Open Access Journals (Sweden)

Yuri A. Gadzhiev

2011-11-01

Full Text Available Discrete cosine transform dct-i, unlike dct-ii, does not concentrate the energy of a transformed vector sufficiently well, so it is not used practically for the purposes of digital image compression. By performing regular normalization of the basic cosine transform matrix, we obtain a discrete cosine transform which has the same cosine basis as dct-i, coincides as dct-i with its own inverse transform, but unlike dct-i, it does not reduce the proper ability of cosine transform to the energy concentration. In this paper we consider briefly the properties of this transform, its possible integer implementation for the case of 8x8-matrix, its applications to the image itself and to the preliminary rgb colour space transformations, further more we investigate some models of quantization, perform an experiment for the estimation of the level of digital images compression and the quality achieved by use of this transform. This experiment shows that the transform can be sufficiently effective for practical use, but the question of its comparative effectiveness with respect to dct-ii remains open.

Explaining Variability: Numerical Representations in 4- to 8-Year-Old Children

Science.gov (United States)

Friso-van den Bos, Ilona; Kolkman, Meijke E.; Kroesbergen, Evelyn H.; Leseman, Paul P. M.

2014-01-01

The present study aims to examine relations between number representations and various sources of individual differences within early stages of development of number representations. The mental number line has been found to develop from a logarithmic to a more linear representation. Sources under investigation are counting skills and executive…

Discretization of four types of Weyl group orbit functions

International Nuclear Information System (INIS)

Hrivnák, Jiří

2013-01-01

The discrete Fourier calculus of the four families of special functions, called C–, S–, S s – and S l -functions, is summarized. Functions from each of the four families of special functions are discretely orthogonal over a certain finite set of points. The generalizations of discrete cosine and sine transforms of one variable — the discrete S s – and S l -transforms of the group F 4 — are considered in detail required for their exploitation in discrete Fourier spectral methods. The continuous interpolations, induced by the discrete expansions, are presented

Laplacians on discrete and quantum geometries

International Nuclear Information System (INIS)

Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes

2013-01-01

We extend discrete calculus for arbitrary (p-form) fields on embedded lattices to abstract discrete geometries based on combinatorial complexes. We then provide a general definition of discrete Laplacian using both the primal cellular complex and its combinatorial dual. The precise implementation of geometric volume factors is not unique and, comparing the definition with a circumcentric and a barycentric dual, we argue that the latter is, in general, more appropriate because it induces a Laplacian with more desirable properties. We give the expression of the discrete Laplacian in several different sets of geometric variables, suitable for computations in different quantum gravity formalisms. Furthermore, we investigate the possibility of transforming from position to momentum space for scalar fields, thus setting the stage for the calculation of heat kernel and spectral dimension in discrete quantum geometries. (paper)

Uncertainty representation of grey numbers and grey sets.

Science.gov (United States)

Yang, Yingjie; Liu, Sifeng; John, Robert

2014-09-01

In the literature, there is a presumption that a grey set and an interval-valued fuzzy set are equivalent. This presumption ignores the existence of discrete components in a grey number. In this paper, new measurements of uncertainties of grey numbers and grey sets, consisting of both absolute and relative uncertainties, are defined to give a comprehensive representation of uncertainties in a grey number and a grey set. Some simple examples are provided to illustrate that the proposed uncertainty measurement can give an effective representation of both absolute and relative uncertainties in a grey number and a grey set. The relationships between grey sets and interval-valued fuzzy sets are also analyzed from the point of view of the proposed uncertainty representation. The analysis demonstrates that grey sets and interval-valued fuzzy sets provide different but overlapping models for uncertainty representation in sets.

Control of discrete event systems modeled as hierarchical state machines

Science.gov (United States)

Brave, Y.; Heymann, M.

1991-01-01

The authors examine a class of discrete event systems (DESs) modeled as asynchronous hierarchical state machines (AHSMs). For this class of DESs, they provide an efficient method for testing reachability, which is an essential step in many control synthesis procedures. This method utilizes the asynchronous nature and hierarchical structure of AHSMs, thereby illustrating the advantage of the AHSM representation as compared with its equivalent (flat) state machine representation. An application of the method is presented where an online minimally restrictive solution is proposed for the problem of maintaining a controlled AHSM within prescribed legal bounds.

Vector coherent state representations and their inner products

International Nuclear Information System (INIS)

Rowe, D J

2012-01-01

Several advances have extended the power and versatility of coherent state theory to the extent that it has become a vital tool in the representation theory of Lie groups and their Lie algebras. Representative applications are reviewed and some new developments are introduced. The examples given are chosen to illustrate special features of the scalar and vector coherent state constructions and how they work in practical situations. Comparisons are made with Mackey's theory of induced representations. For simplicity, we focus on square integrable (discrete series) unitary representations although many of the techniques apply more generally, with minor adjustment. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Coherent states: mathematical and physical aspects’. (review)

Realization and elimination in rational representations of behaviors

NARCIS (Netherlands)

Gottimukkala, Sasanka V.; Trentelman, Hendrikus; Fiaz, Shaik

This article deals with the relationship between rational representations of linear differential systems and their state representations. In particular we study the relationship between rational representations on the one hand, and output nulling and driving variable representations on the other. In

Interactions of Soliton Waves for a Generalized Discrete KdV Equation

International Nuclear Information System (INIS)

Zhou Tong; Zhu Zuo-Nong

2017-01-01

It is well known that soliton interactions in discrete integrable systems often possess new properties which are different from the continuous integrable systems, e.g., we found that there are such discrete solitons in a semidiscrete integrable system (the time variable is continuous and the space one is discrete) that the shorter solitary waves travel faster than the taller ones. Very recently, this kind of soliton was also observed in a full discrete generalized KdV system (the both of time and space variables are discrete) introduced by Kanki et al. In this paper, for the generalized discrete KdV (gdKdV) equation, we describe its richer structures of one-soliton solutions. The interactions of two-soliton waves to the gdKdV equation are studied. Some new features of the soliton interactions are proposed by rigorous theoretical analysis. (paper)

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

Science.gov (United States)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

Relativity and the question of discretization in astronomy

CERN Document Server

Edelen, Dominic G B

1970-01-01

Theoretical researches in general relativity and observational data from galactic astronomy combine in this volume in contributions to one of the oldest questions of natural philosophy: Is the structure of the physical world more adequately described by a continuous or a discrete mode of representation? Since the days of the Pythagoreans, this question has surfaced from time to time in various guises in science as well as in philosophy. One of the most bitterly contested and illuminating controversies between the continuous and the discrete viewpoints is to be found in the wave versus corpuscular description of optical phenom­ enae. This controversy was not resolved to the satisfaction of most of its protaganists until the development of the quantum theory. However, several obscurities that still becloud the question suggest that some deeper formulation may be necessary before more satisfactory answers can be given 1. The firm establishment of the validity of quantized structure and discrete energy distribut...

Quantum field theory on discrete space-time. II

International Nuclear Information System (INIS)

Yamamoto, H.

1985-01-01

A quantum field theory of bosons and fermions is formulated on discrete Lorentz space-time of four dimensions. The minimum intervals of space and time are assumed to have different values in this paper. As a result the difficulties encountered in the previous paper (complex energy, incompleteness of solutions, and inequivalence between phase representation and momentum representation) are removed. The problem in formulating a field theory of fermions is solved by introducing a new operator and considering a theorem of translation invariance. Any matrix element given by a Feynman diagram is calculated in this theory to give a finite value regardless of the kinds of particles concerned (massive and/or massless bosons and/or fermions)

Design of a Discrete Tracking Controller for a Magnetic Levitation System: A Nonlinear Rational Model Approach

Directory of Open Access Journals (Sweden)

Fernando Gómez-Salas

2015-01-01

Full Text Available This work proposes a discrete-time nonlinear rational approximate model for the unstable magnetic levitation system. Based on this model and as an application of the input-output linearization technique, a discrete-time tracking control design will be derived using the corresponding classical state space representation of the model. A simulation example illustrates the efficiency of the proposed methodology.

From ordinary to discrete quantum mechanics: The Charlier oscillator and its coalgebra symmetry

Energy Technology Data Exchange (ETDEWEB)

Latini, D., E-mail: latini@fis.uniroma3.it [Department of Mathematics and Physics and INFN, Roma Tre University, Via della Vasca Navale 84, I-00146 Rome (Italy); Riglioni, D. [Department of Mathematics and Physics, Roma Tre University, Via della Vasca Navale 84, I-00146 Rome (Italy)

2016-10-14

The coalgebraic structure of the harmonic oscillator is used to underline possible connections between continuous and discrete superintegrable models which can be described in terms of SUSY discrete quantum mechanics. A set of 1-parameter algebraic transformations is introduced in order to generate a discrete representation for the coalgebraic harmonic oscillator. This set of transformations is shown to play a role in the generalization of classical orthogonal polynomials to the realm of discrete orthogonal polynomials in the Askey scheme. As an explicit example the connection between Hermite and Charlier oscillators, that share the same coalgebraic structure, is presented and a two-dimensional maximally superintegrable version of the Charlier oscillator is constructed. - Highlights: • We construct a discrete quantum version of the harmonic oscillator. • We solve the spectral problem on the lattice. • We introduce the coalgebra symmetry in real discrete Quantum Mechanics (rdQM). • The coalgebra is used to extend the system to higher dimensions preserving its superintegrability. • We explicitly write down a discrete version of both the angular momentum and the Demkov–Fradkin Tensor.

Holographic representation of space-variant systems: system theory.

Science.gov (United States)

Marks Ii, R J; Krile, T F

1976-09-01

System theory for holographic representation of linear space-variant systems is derived. The utility of the resulting piecewise isoplanatic approximation (PIA) is illustrated by example application to the invariant system, ideal magnifier, and Fourier transformer. A method previously employed to holographically represent a space-variant system, the discrete approximation, is shown to be a special case of the PIA.

Geometric phases in discrete dynamical systems

Energy Technology Data Exchange (ETDEWEB)

Cartwright, Julyan H.E., E-mail: julyan.cartwright@csic.es [Instituto Andaluz de Ciencias de la Tierra, CSIC–Universidad de Granada, E-18100 Armilla, Granada (Spain); Instituto Carlos I de Física Teórica y Computacional, Universidad de Granada, E-18071 Granada (Spain); Piro, Nicolas, E-mail: nicolas.piro@epfl.ch [École Polytechnique Fédérale de Lausanne (EPFL), 1015 Lausanne (Switzerland); Piro, Oreste, E-mail: piro@imedea.uib-csic.es [Departamento de Física, Universitat de les Illes Balears, E-07122 Palma de Mallorca (Spain); Tuval, Idan, E-mail: ituval@imedea.uib-csic.es [Mediterranean Institute for Advanced Studies, CSIC–Universitat de les Illes Balears, E-07190 Mallorca (Spain)

2016-10-14

In order to study the behaviour of discrete dynamical systems under adiabatic cyclic variations of their parameters, we consider discrete versions of adiabatically-rotated rotators. Parallelling the studies in continuous systems, we generalize the concept of geometric phase to discrete dynamics and investigate its presence in these rotators. For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number of the system. For the discrete version of the rotated rotator considered by Berry, the rotated standard map, we further explore this connection as well as the role of the geometric phase at the onset of chaos. Further into the chaotic regime, we show that the geometric phase is also related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent. - Highlights: • We extend the concept of geometric phase to maps. • For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number. • For the rotated standard map, we explore the role of the geometric phase at the onset of chaos. • We show that the geometric phase is related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent.

Galerkin v. discrete-optimal projection in nonlinear model reduction

Energy Technology Data Exchange (ETDEWEB)

Carlberg, Kevin Thomas [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Barone, Matthew Franklin [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Antil, Harbir [George Mason Univ., Fairfax, VA (United States)

2015-04-01

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes. We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.

Climate SPHINX: High-resolution present-day and future climate simulations with an improved representation of small-scale variability

Science.gov (United States)

Davini, Paolo; von Hardenberg, Jost; Corti, Susanna; Subramanian, Aneesh; Weisheimer, Antje; Christensen, Hannah; Juricke, Stephan; Palmer, Tim

2016-04-01

The PRACE Climate SPHINX project investigates the sensitivity of climate simulations to model resolution and stochastic parameterization. The EC-Earth Earth-System Model is used to explore the impact of stochastic physics in 30-years climate integrations as a function of model resolution (from 80km up to 16km for the atmosphere). The experiments include more than 70 simulations in both a historical scenario (1979-2008) and a climate change projection (2039-2068), using RCP8.5 CMIP5 forcing. A total amount of 20 million core hours will be used at end of the project (March 2016) and about 150 TBytes of post-processed data will be available to the climate community. Preliminary results show a clear improvement in the representation of climate variability over the Euro-Atlantic following resolution increase. More specifically, the well-known atmospheric blocking negative bias over Europe is definitely resolved. High resolution runs also show improved fidelity in representation of tropical variability - such as the MJO and its propagation - over the low resolution simulations. It is shown that including stochastic parameterization in the low resolution runs help to improve some of the aspects of the MJO propagation further. These findings show the importance of representing the impact of small scale processes on the large scale climate variability either explicitly (with high resolution simulations) or stochastically (in low resolution simulations).

Discretization-induced delays and their role in the dynamics

International Nuclear Information System (INIS)

Ramani, A; Grammaticos, B; Satsuma, J; Willox, R

2008-01-01

We show that a discretization of a continuous system may entail 'hidden' delays and thus introduce instabilities. In this case, while the continuous system has an attractive fixed point, the instabilities present in the equivalent discrete one may lead to the appearance of a limit cycle. We explain that it is possible, thanks to the proper staggering of the discrete variables, to eliminate the hidden delay. However, in general, other instabilities may appear in the discrete system which can even lead to chaotic behaviour

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

Optimization of Operations Resources via Discrete Event Simulation Modeling

Science.gov (United States)

Joshi, B.; Morris, D.; White, N.; Unal, R.

1996-01-01

The resource levels required for operation and support of reusable launch vehicles are typically defined through discrete event simulation modeling. Minimizing these resources constitutes an optimization problem involving discrete variables and simulation. Conventional approaches to solve such optimization problems involving integer valued decision variables are the pattern search and statistical methods. However, in a simulation environment that is characterized by search spaces of unknown topology and stochastic measures, these optimization approaches often prove inadequate. In this paper, we have explored the applicability of genetic algorithms to the simulation domain. Genetic algorithms provide a robust search strategy that does not require continuity and differentiability of the problem domain. The genetic algorithm successfully minimized the operation and support activities for a space vehicle, through a discrete event simulation model. The practical issues associated with simulation optimization, such as stochastic variables and constraints, were also taken into consideration.

Symmetries and Laplacians introduction to harmonic analysis, group representations and applications

CERN Document Server

Gurarie, D

1992-01-01

Designed as an introduction to harmonic analysis and group representations,this book covers a wide range of topics rather than delving deeply into anyparticular one. In the words of H. Weyl ...it is primarily meant forthe humble, who want to learn as new the things set forth therein, rather thanfor the proud and learned who are already familiar with the subject and merelylook for quick and exact information.... The main objective is tointroduce the reader to concepts, ideas, results and techniques that evolvearound symmetry-groups, representations and Laplacians. Morespecifically, the main interest concerns geometrical objects and structures{X}, discrete or continuous, that possess sufficiently large symmetrygroup G, such as regular graphs (Platonic solids), lattices, andsymmetric Riemannian manifolds. All such objects have a natural Laplacian&Dgr;, a linear operator on functions over X, invariant underthe group action. There are many problems associated with Laplacians onX, such as continuous or discrete...

A representation independent propagator. Pt. 1. Compact Lie groups

International Nuclear Information System (INIS)

Tome, W.A.

1995-01-01

Conventional path integral expressions for propagators are representation dependent. Rather than having to adapt each propagator to the representation in question, it is shown that for compact Lie groups it is possible to introduce a propagator that is representation independent. For a given set of kinematical variables this propagator is a single function independent of any particular choice of fiducial vector, which monetheless, correctly propagates each element of the coherent state representation associated with these kinematical variables. Although the configuration space is in general curved, nevertheless the lattice phase-space path integral for the representation independent propagator has the form appropriate to flat space. To illustrate the general theory a representation independent propagator is explicitly constructed for the Lie group SU(2). (orig.)

Invariant differential operators on H-type groups and discrete components in restrictions of complementary series of rank one semisimple groups

DEFF Research Database (Denmark)

Möllers, Jan; Ørsted, Bent; Zhang, Genkai

2016-01-01

We explicitly construct a finite number of discrete components in the restriction of complementary series representations of rank one semisimple groups $G$ to rank one subgroups $G_1$. For this we use the realizations of complementary series representations of $G$ and $G_1$ on Sobolev spaces...

Roughness Versus Charge Contributions to Representative Discrete Heterogeneity Underlying Mechanistic Prediction of Colloid Attachment, Detachment and Breakthrough-Elution Behavior Under Environmental Conditions.

Science.gov (United States)

Johnson, William; Farnsworth, Anna; Vanness, Kurt; Hilpert, Markus

2017-04-01

The key element of a mechanistic theory to predict colloid attachment in porous media under environmental conditions where colloid-collector repulsion exists (unfavorable conditions for attachment) is representation of the nano-scale surface heterogeneity (herein called discrete heterogeneity) that drives colloid attachment under unfavorable conditions. The observed modes of colloid attachment under unfavorable conditions emerge from simulations that incorporate discrete heterogeneity. Quantitative prediction of attachment (and detachment) requires capturing the sizes, spatial frequencies, and other properties of roughness asperities and charge heterodomains in discrete heterogeneity representations of different surfaces. The fact that a given discrete heterogeneity representation will interact differently with different-sized colloids as well as different ionic strengths for a given sized colloid allows backing out representative discrete heterogeneity via comparison of simulations to experiments performed across a range of colloid size, solution IS, and fluid velocity. This has been achieved on unfavorable smooth surfaces yielding quantitative prediction of attachment, and qualitative prediction of detachment in response to ionic strength or flow perturbations. Extending this treatment to rough surfaces, and representing the contributions of nanoscale roughness as well as charge heterogeneity is a focus of this talk. Another focus of this talk is the upscaling the pore scale simulations to produce contrasting breakthrough-elution behaviors at the continuum (column) scale that are observed, for example, for different-sized colloids, or same-sized colloids under different ionic strength conditions. The outcome of mechanistic pore scale simulations incorporating discrete heterogeneity and subsequent upscaling is that temporal processes such as blocking and ripening will emerge organically from these simulations, since these processes fundamentally stem from the

Discrete Sparse Coding.

Science.gov (United States)

Exarchakis, Georgios; Lücke, Jörg

2017-11-01

Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.

Two hierarchies of integrable lattice equations associated with a discrete matrix spectral problem

International Nuclear Information System (INIS)

Li Xinyue; Xu Xixiang; Zhao Qiulan

2008-01-01

Two hierarchies of nonlinear integrable positive and negative lattice models are derived from a discrete spectral problem. The two lattice hierarchies are proved to have discrete zero curvature representations associated with a discrete spectral problem, which also shows that the positive and negative hierarchies correspond to positive and negative power expansions of Lax operators with respect to the spectral parameter, respectively. Moreover, the integrable lattice models in the positive hierarchy are of polynomial type, and the integrable lattice models in the negative hierarchy are of rational type. Further, we construct infinite conservation laws of the positive hierarchy, then, the integrable coupling systems of the positive hierarchy are derived from enlarging Lax pair

An integrable semi-discretization of the Boussinesq equation

International Nuclear Information System (INIS)

Zhang, Yingnan; Tian, Lixin

2016-01-01

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Modeling discrete and rhythmic movements through motor primitives: a review.

Science.gov (United States)

Degallier, Sarah; Ijspeert, Auke

2010-10-01

Rhythmic and discrete movements are frequently considered separately in motor control, probably because different techniques are commonly used to study and model them. Yet the increasing interest in finding a comprehensive model for movement generation requires bridging the different perspectives arising from the study of those two types of movements. In this article, we consider discrete and rhythmic movements within the framework of motor primitives, i.e., of modular generation of movements. In this way we hope to gain an insight into the functional relationships between discrete and rhythmic movements and thus into a suitable representation for both of them. Within this framework we can define four possible categories of modeling for discrete and rhythmic movements depending on the required command signals and on the spinal processes involved in the generation of the movements. These categories are first discussed in terms of biological concepts such as force fields and central pattern generators and then illustrated by several mathematical models based on dynamical system theory. A discussion on the plausibility of theses models concludes the work.

Rational solutions of the discrete time Toda lattice and the alternate discrete Painleve II equation

International Nuclear Information System (INIS)

Common, Alan K; Hone, Andrew N W

2008-01-01

The Yablonskii-Vorob'ev polynomials y n (t), which are defined by a second-order bilinear differential-difference equation, provide rational solutions of the Toda lattice. They are also polynomial tau-functions for the rational solutions of the second Painleve equation (P II ). Here we define two-variable polynomials Y n (t, h) on a lattice with spacing h, by considering rational solutions of the discrete time Toda lattice as introduced by Suris. These polynomials are shown to have many properties that are analogous to those of the Yablonskii-Vorob'ev polynomials, to which they reduce when h = 0. They also provide rational solutions for a particular discretization of P II , namely the so-called alternate discrete P II , and this connection leads to an expression in terms of the Umemura polynomials for the third Painleve equation (P III ). It is shown that the Baecklund transformation for the alternate discrete Painleve equation is a symplectic map, and the shift in time is also symplectic. Finally we present a Lax pair for the alternate discrete P II , which recovers Jimbo and Miwa's Lax pair for P II in the continuum limit h → 0

Galileo symmetries in polymer particle representation

International Nuclear Information System (INIS)

Chiou, D-W

2007-01-01

To illustrate the conceptual problems for the low-energy symmetries in the continuum of spacetime emerging from the discrete quantum geometry, Galileo symmetries are investigated in the polymer particle representation of a non-relativistic particle as a simple toy model. The complete Galileo transformations (translation, rotation and Galileo boost) are naturally defined in the polymer particle Hilbert space and Galileo symmetries are recovered with highly suppressed deviations in the low-energy regime from the underlying polymer particle description

Critical bifurcation surfaces of 3D discrete dynamics

Directory of Open Access Journals (Sweden)

Michael Sonis

2000-01-01

Full Text Available This paper deals with the analytical representation of bifurcations of each 3D discrete dynamics depending on the set of bifurcation parameters. The procedure of bifurcation analysis proposed in this paper represents the 3D elaboration and specification of the general algorithm of the n-dimensional linear bifurcation analysis proposed by the author earlier. It is proven that 3D domain of asymptotic stability (attraction of the fixed point for a given 3D discrete dynamics is bounded by three critical bifurcation surfaces: the divergence, flip and flutter surfaces. The analytical construction of these surfaces is achieved with the help of classical Routh–Hurvitz conditions of asymptotic stability. As an application the adjustment process proposed by T. Puu for the Cournot oligopoly model is considered in detail.

Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way postprocessing.

Science.gov (United States)

Scarani, Valerio; Renner, Renato

2008-05-23

We derive a bound for the security of quantum key distribution with finite resources under one-way postprocessing, based on a definition of security that is composable and has an operational meaning. While our proof relies on the assumption of collective attacks, unconditional security follows immediately for standard protocols such as Bennett-Brassard 1984 and six-states protocol. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N approximately 10(5) signals are exchanged and processed. For any other discrete-variable protocol, unconditional security can be obtained using the exponential de Finetti theorem, but the additional overhead leads to very pessimistic estimates.

Permutation representations of the orbits of the automorphism group ...

Indian Academy of Sciences (India)

Abstract. Consider a discrete valuation ring R whose residue field is finite of car- dinality at least 3. For a finite torsion module, we consider transitive subsets O under the action of the automorphism group of the module. We prove that the associated per- mutation representation on the complex vector space C[O] is multiplicity ...

Discrete gradients in discrete classical mechanics

International Nuclear Information System (INIS)

Renna, L.

1987-01-01

A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated

The discrete Toda equation revisited: dual β-Grothendieck polynomials, ultradiscretization, and static solitons

Science.gov (United States)

Iwao, Shinsuke; Nagai, Hidetomo

2018-04-01

This paper presents a study of the discrete Toda equation that was introduced in 1977. In this paper, it is proved that the determinantal solution of the discrete Toda equation, obtained via the Lax formalism, is naturally related to the dual Grothendieck polynomials, a K-theoretic generalization of the Schur polynomials. A tropical permanent solution to the ultradiscrete Toda equation is also derived. The proposed method gives a tropical algebraic representation of the static solitons. Lastly, a new cellular automaton realization of the ultradiscrete Toda equation is proposed.

On the phase space representations. 1

International Nuclear Information System (INIS)

Polubarinov, I.V.

1978-01-01

The Dirac representation theory deals usually with the amplitude formalism of the quantum theory. An introduction is given into a theory of some other representations, which are applicable in the density matrix formalism and can naturally be called phase space representations (PSR). They use terms of phase space variables (x and p simultaneously) and give a description, close to the classical phase space description. Definitions and algebraic properties are given in quantum mechanics for such PSRs as the Wigner representation, coherent state representation and others. Completeness relations of a matrix type are used as a starting point. The case of quantum field theory is also outlined

L^2-Betti numbers of rigid C*-tensor categories and discrete quantum groups

DEFF Research Database (Denmark)

Kyed, David; Raum, Sven; Vaes, Stefaan

2017-01-01

of the representation category $Rep(G)$ and thus, in particular, invariant under monoidal equivalence. As an application, we obtain several new computations of $L^2$-Betti numbers for discrete quantum groups, including the quantum permutation groups and the free wreath product groups. Finally, we obtain upper bounds...

The representation theory of the symmetry group of lattice fermions as a basis for kinematics in lattice QCD

International Nuclear Information System (INIS)

Joos, H.; Schaefer, M.

1987-01-01

The symmetry group of staggered lattice fermions is discussed as a discrete subgroup of the symmetry group of the Dirac-Kaehler equation. For the representation theory of this group, G. Mackey's generalization of E.P. Wigner's procedure for the construction of unitary representations of groups with normal subgroups is used. A complete classification of these irreducible representations by ''momentum stars'', ''flavour orbits'' and ''reduced spins'' is given. (orig.)

An integrable semi-discretization of the Boussinesq equation

Energy Technology Data Exchange (ETDEWEB)

Zhang, Yingnan, E-mail: ynzhang@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Tian, Lixin, E-mail: tianlixin@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Nonlinear Scientific Research Center, Jiangsu University, Zhenjiang, Jiangsu (China)

2016-10-23

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Discrete mKdV and discrete sine-Gordon flows on discrete space curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2014-01-01

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)

Which spatial discretization for distributed hydrological models? Proposition of a methodology and illustration for medium to large-scale catchments

Directory of Open Access Journals (Sweden)

J. Dehotin

2008-05-01

Full Text Available Distributed hydrological models are valuable tools to derive distributed estimation of water balance components or to study the impact of land-use or climate change on water resources and water quality. In these models, the choice of an appropriate spatial discretization is a crucial issue. It is obviously linked to the available data, their spatial resolution and the dominant hydrological processes. For a given catchment and a given data set, the "optimal" spatial discretization should be adapted to the modelling objectives, as the latter determine the dominant hydrological processes considered in the modelling. For small catchments, landscape heterogeneity can be represented explicitly, whereas for large catchments such fine representation is not feasible and simplification is needed. The question is thus: is it possible to design a flexible methodology to represent landscape heterogeneity efficiently, according to the problem to be solved? This methodology should allow a controlled and objective trade-off between available data, the scale of the dominant water cycle components and the modelling objectives.

In this paper, we propose a general methodology for such catchment discretization. It is based on the use of nested discretizations. The first level of discretization is composed of the sub-catchments, organised by the river network topology. The sub-catchment variability can be described using a second level of discretizations, which is called hydro-landscape units. This level of discretization is only performed if it is consistent with the modelling objectives, the active hydrological processes and data availability. The hydro-landscapes take into account different geophysical factors such as topography, land-use, pedology, but also suitable hydrological discontinuities such as ditches, hedges, dams, etc. For numerical reasons these hydro-landscapes can be further subdivided into smaller elements that will constitute the

Modeling of Macroeconomics by a Novel Discrete Nonlinear Fractional Dynamical System

Directory of Open Access Journals (Sweden)

Zhenhua Hu

2013-01-01

Full Text Available We propose a new nonlinear economic system with fractional derivative. According to the Jumarie’s definition of fractional derivative, we obtain a discrete fractional nonlinear economic system. Three variables, the gross domestic production, inflation, and unemployment rate, are considered by this nonlinear system. Based on the concrete macroeconomic data of USA, the coefficients of this nonlinear system are estimated by the method of least squares. The application of discrete fractional economic model with linear and nonlinear structure is shown to illustrate the efficiency of modeling the macroeconomic data with discrete fractional dynamical system. The empirical study suggests that the nonlinear discrete fractional dynamical system can describe the actual economic data accurately and predict the future behavior more reasonably than the linear dynamic system. The method proposed in this paper can be applied to investigate other macroeconomic variables of more states.

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-06-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads to great interest in studying discrete surfaces. With the rich smooth surface theory in hand, one would hope that this elegant theory can still be applied to the discrete counter part. Such a generalization, however, is not always successful. While discrete surfaces have the advantage of being finite dimensional, thus easier to treat, their geometric properties such as curvatures are not well defined in the classical sense. Furthermore, the powerful calculus tool can hardly be applied. The methods in this thesis, including angular defect formula, cotangent formula, parallel meshes, relative geometry etc. are approaches based on offset meshes or generalized offset meshes. As an important application, we discuss discrete minimal surfaces and discrete Koenigs meshes.

A new representation for ground states and its Legendre transforms

International Nuclear Information System (INIS)

Cedillo, A.

1994-01-01

The ground-state energy of an electronic system is a functional of the number of electrons (N) and the external potential (v): E = E(N,V), this is the energy representation for ground states. In 1982, Nalewajski defined the Legendre transforms of this representation, taking advantage of the strict concavity of E with respect to their variables (concave respect v and convex respect N), and he also constructed a scheme for the reduction of derivatives of his representations. Unfortunately, N and the electronic density (p) were the independent variables of one of these representations, but p depends explicitly on N. In this work, this problem is avoided using the energy per particle (ε) as the basic variables, and the Legendre transformations can be defined. A procedure for the reduction of derivatives is generated for the new four representations and, in contrast to the Nalewajski's procedure, it only includes derivatives of the four representations. Finally, the reduction of derivatives is used to test some relationships between the hardness and softness kernels

Discrete Quantum Gravity in the Regge Calculus Formalism

International Nuclear Information System (INIS)

Khatsymovsky, V.M.

2005-01-01

We discuss an approach to the discrete quantum gravity in the Regge calculus formalism that was developed in a number of our papers. The Regge calculus is general relativity for a subclass of general Riemannian manifolds called piecewise flat manifolds. The Regge calculus deals with a discrete set of variables, triangulation lengths, and contains continuous general relativity as a special limiting case where the lengths tend to zero. In our approach, the quantum length expectations are nonzero and of the order of the Plank scale, 10 -33 cm, implying a discrete spacetime structure on these scales

Discrete quantum gravitation in formalism of Regge calculus

International Nuclear Information System (INIS)

Khatsimovskij, V.M.

2005-01-01

One deals with approach to the discrete quantum gravitation in terms of the Regge calculus formalism. The Regge calculus represents the general relativity theory for the Riemann varieties - the piecewise planar varieties. The Regge calculus makes use of the discrete set of variables, triangulation lengths, and contains the continuous general relativity theory serving as a limiting special case when lengths tend to zero. In terms of our approach the quantum mean values of the mentioned lengths differ from zero and 10 -33 cm Planck length and it implies the discrete structure of space-time at the mentioned scales [ru

Challenges in the automated classification of variable stars in large databases

Directory of Open Access Journals (Sweden)

Graham Matthew

2017-01-01

Full Text Available With ever-increasing numbers of astrophysical transient surveys, new facilities and archives of astronomical time series, time domain astronomy is emerging as a mainstream discipline. However, the sheer volume of data alone - hundreds of observations for hundreds of millions of sources – necessitates advanced statistical and machine learning methodologies for scientific discovery: characterization, categorization, and classification. Whilst these techniques are slowly entering the astronomer’s toolkit, their application to astronomical problems is not without its issues. In this paper, we will review some of the challenges posed by trying to identify variable stars in large data collections, including appropriate feature representations, dealing with uncertainties, establishing ground truths, and simple discrete classes.

A cyclic constitutive law for metals with a semi-discrete memory variable for description of ratcheting phenomena

International Nuclear Information System (INIS)

Andrieux, S.; Schoenberger, P.; Taheri, S.

1993-01-01

The study of cyclic elastoplastic constitutive laws is, at the moment, focused on non proportional loadings, but for uniaxial loadings some problems remain, as for example the ability for a law to describe simultaneously ratcheting in non symmetrical load-controlled test, elastic and plastic shakedown in symmetrical and non symmetrical ones. We have proposed in a law with a discrete memory variable which, in addition to previous phenomena, describes the cyclic hardening in a pushpull test, and the cyclic softening after overloading. A modified law has been proposed to take into account the dependence of cyclic strain stress curve on the history of loading. The extension to 3D situations of this law is proposed. The discrete nature of the memory leads to discontinuity problems for some loading paths, a modification is then proposed which uses a differential evolution law. For large enough uniaxial cycles, the uniaxial law is nevertheless recovered. In this paper, an incremental form of the implicit evolution problem is given, and we describe the implementation of this model in the Code Aster - a thermomechanical structural software using the finite element method (f.e.m) developed at Electricite de France. Comparison between experiment and numerical results is given for uniaxial ratcheting, non proportional strain controlled test

Real-space quadrature: A convenient, efficient representation for multipole expansions

International Nuclear Information System (INIS)

Rogers, David M.

2015-01-01

Multipoles are central to the theory and modeling of polarizable and nonpolarizable molecular electrostatics. This has made a representation in terms of point charges a highly sought after goal, since rotation of multipoles is a bottleneck in molecular dynamics implementations. All known point charge representations are orders of magnitude less efficient than spherical harmonics due to either using too many fixed charge locations or due to nonlinear fitting of fewer charge locations. We present the first complete solution to this problem—completely replacing spherical harmonic basis functions by a dramatically simpler set of weights associated to fixed, discrete points on a sphere. This representation is shown to be space optimal. It reduces the spherical harmonic decomposition of Poisson’s operator to pairwise summations over the point set. As a corollary, we also shows exact quadrature-based formulas for contraction over trace-free supersymmetric 3D tensors. Moreover, multiplication of spherical harmonic basis functions translates to a direct product in this representation

Discrete Discriminant analysis based on tree-structured graphical models

DEFF Research Database (Denmark)

Perez de la Cruz, Gonzalo; Eslava, Guillermina

The purpose of this paper is to illustrate the potential use of discriminant analysis based on tree{structured graphical models for discrete variables. This is done by comparing its empirical performance using estimated error rates for real and simulated data. The results show that discriminant a...... analysis based on tree{structured graphical models is a simple nonlinear method competitive with, and sometimes superior to, other well{known linear methods like those assuming mutual independence between variables and linear logistic regression.......The purpose of this paper is to illustrate the potential use of discriminant analysis based on tree{structured graphical models for discrete variables. This is done by comparing its empirical performance using estimated error rates for real and simulated data. The results show that discriminant...

The discrete hungry Lotka Volterra system and a new algorithm for computing matrix eigenvalues

Science.gov (United States)

Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa

2009-01-01

The discrete hungry Lotka-Volterra (dhLV) system is a generalization of the discrete Lotka-Volterra (dLV) system which stands for a prey-predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix.

The discrete hungry Lotka–Volterra system and a new algorithm for computing matrix eigenvalues

International Nuclear Information System (INIS)

Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa

2009-01-01

The discrete hungry Lotka–Volterra (dhLV) system is a generalization of the discrete Lotka–Volterra (dLV) system which stands for a prey–predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix

On Drift Parameter Estimation in Models with Fractional Brownian Motion by Discrete Observations

Directory of Open Access Journals (Sweden)

Yuliya Mishura

2014-06-01

Full Text Available We study a problem of an unknown drift parameter estimation in a stochastic differen- tial equation driven by fractional Brownian motion. We represent the likelihood ratio as a function of the observable process. The form of this representation is in general rather complicated. However, in the simplest case it can be simplified and we can discretize it to establish the a. s. convergence of the discretized version of maximum likelihood estimator to the true value of parameter. We also investigate a non-standard estimator of the drift parameter showing further its strong consistency. 

An essay on discrete foundations for physics

International Nuclear Information System (INIS)

Noyes, H.P.; McGoveran, D.O.

1988-07-01

We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non-uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs

An essay on discrete foundations for physics

International Nuclear Information System (INIS)

Noyes, H.P.; McGoveran, D.O.

1988-01-01

We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non- uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs

Quantum cosmology based on discrete Feynman paths

International Nuclear Information System (INIS)

Chew, Geoffrey F.

2002-01-01

Although the rules for interpreting local quantum theory imply discretization of process, Lorentz covariance is usually regarded as precluding time quantization. Nevertheless a time-discretized quantum representation of redshifting spatially-homogeneous universe may be based on discrete-step Feynman paths carrying causal Lorentz-invariant action--paths that not only propagate the wave function but provide a phenomenologically-promising elementary-particle Hilbert-space basis. In a model under development, local path steps are at Planck scale while, at a much larger ''wave-function scale'', global steps separate successive wave-functions. Wave-function spacetime is but a tiny fraction of path spacetime. Electromagnetic and gravitational actions are ''at a distance'' in Wheeler-Feynman sense while strong (color) and weak (isospin) actions, as well as action of particle motion, are ''local'' in a sense paralleling the action of local field theory. ''Nonmaterial'' path segments and ''trivial events'' collaborate to define energy and gravity. Photons coupled to conserved electric charge enjoy privileged model status among elementary fermions and vector bosons. Although real path parameters provide no immediate meaning for ''measurement'', the phase of the complex wave function allows significance for ''information'' accumulated through ''gentle'' electromagnetic events involving charged matter and ''soft'' photons. Through its soft-photon content the wave function is an ''information reservoir''

An essay on discrete foundations for physics

Energy Technology Data Exchange (ETDEWEB)

Noyes, H.P.; McGoveran, D.O.

1988-07-01

We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non-uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs.

An essay on discrete foundations for physics

Energy Technology Data Exchange (ETDEWEB)

Noyes, H.P.; McGoveran, D.O.

1988-10-05

We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non- uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs.

Knowledge network model of the energy consumption in discrete manufacturing system

Science.gov (United States)

Xu, Binzi; Wang, Yan; Ji, Zhicheng

2017-07-01

Discrete manufacturing system generates a large amount of data and information because of the development of information technology. Hence, a management mechanism is urgently required. In order to incorporate knowledge generated from manufacturing data and production experience, a knowledge network model of the energy consumption in the discrete manufacturing system was put forward based on knowledge network theory and multi-granularity modular ontology technology. This model could provide a standard representation for concepts, terms and their relationships, which could be understood by both human and computer. Besides, the formal description of energy consumption knowledge elements (ECKEs) in the knowledge network was also given. Finally, an application example was used to verify the feasibility of the proposed method.

Representations of classical groups on the lattice and its application to the field theory on discrete space-time

OpenAIRE

Lorente, M.

2003-01-01

We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of any dimension invariant and apply these transformations to field equations.

Geometrical approach to the discrete Wigner function in prime power dimensions

International Nuclear Information System (INIS)

Klimov, A B; Munoz, C; Romero, J L

2006-01-01

We analyse the Wigner function in prime power dimensions constructed on the basis of the discrete rotation and displacement operators labelled with elements of the underlying finite field. We separately discuss the case of odd and even characteristics and analyse the algebraic origin of the non-uniqueness of the representation of the Wigner function. Explicit expressions for the Wigner kernel are given in both cases

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.

The Koslowski-Sahlmann representation: quantum configuration space

Science.gov (United States)

Campiglia, Miguel; Varadarajan, Madhavan

2014-09-01

The Koslowski-Sahlmann (KS) representation is a generalization of the representation underlying the discrete spatial geometry of loop quantum gravity (LQG), to accommodate states labelled by smooth spatial geometries. As shown recently, the KS representation supports, in addition to the action of the holonomy and flux operators, the action of operators which are the quantum counterparts of certain connection dependent functions known as ‘background exponentials’. Here we show that the KS representation displays the following properties which are the exact counterparts of LQG ones: (i) the abelian * algebra of SU(2) holonomies and ‘U(1)’ background exponentials can be completed to a C* algebra, (ii) the space of semianalytic SU(2) connections is topologically dense in the spectrum of this algebra, (iii) there exists a measure on this spectrum for which the KS Hilbert space is realized as the space of square integrable functions on the spectrum, (iv) the spectrum admits a characterization as a projective limit of finite numbers of copies of SU(2) and U(1), (v) the algebra underlying the KS representation is constructed from cylindrical functions and their derivations in exactly the same way as the LQG (holonomy-flux) algebra except that the KS cylindrical functions depend on the holonomies and the background exponentials, this extra dependence being responsible for the differences between the KS and LQG algebras. While these results are obtained for compact spaces, they are expected to be of use for the construction of the KS representation in the asymptotically flat case.

Energy-pointwise discrete ordinates transport methods

International Nuclear Information System (INIS)

Williams, M.L.; Asgari, M.; Tashakorri, R.

1997-01-01

A very brief description is given of a one-dimensional code, CENTRM, which computes a detailed, space-dependent flux spectrum in a pointwise-energy representation within the resolved resonance range. The code will become a component in the SCALE system to improve computation of self-shielded cross sections, thereby enhancing the accuracy of codes such as KENO. CENTRM uses discrete-ordinates transport theory with an arbitrary angular quadrature order and a Legendre expansion of scattering anisotropy for moderator materials and heavy nuclides. The CENTRM program provides capability to deterministically compute full energy range, space-dependent angular flux spectra, rigorously accounting for resonance fine-structure and scattering anisotropy effects

Analysis hierarchical model for discrete event systems

Science.gov (United States)

Ciortea, E. M.

2015-11-01

The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.

The quantum Rabi model and Lie algebra representations of sl2

International Nuclear Information System (INIS)

Wakayama, Masato; Yamasaki, Taishi

2014-01-01

The aim of the present paper is to understand the spectral problem of the quantum Rabi model in terms of Lie algebra representations of sl 2 (R). We define a second order element of the universal enveloping algebra U(sl 2 ) of sl 2 (R), which, through the image of a principal series representation of sl 2 (R), provides a picture equivalent to the quantum Rabi model drawn by confluent Heun differential equations. By this description, in particular, we give a representation theoretic interpretation of the degenerate part of the spectrum (i.e., Judd's eigenstates) of the Rabi Hamiltonian due to Kuś in 1985, which is a part of the exceptional spectrum parameterized by integers. We also discuss the non-degenerate part of the exceptional spectrum of the model, in addition to the Judd eigenstates, from a viewpoint of infinite dimensional irreducible submodules (or subquotients) of the non-unitary principal series such as holomorphic discrete series representations of sl 2 (R). (paper)

Discrete symmetries in the Weyl expansion for quantum billiards

International Nuclear Information System (INIS)

Pavloff, N.

1994-01-01

2 and 3 dimensional quantum billiards with discrete symmetries are considered. The boundary condition is either Dirichlet or Neumann. The first terms of the Weyl expansion are derived for the level density projected onto the irreducible representations of the symmetry group. The formulae require only the knowledge of the character table of the group and the geometrical properties (such as surface, perimeter etc.) of sub-parts of the billiard invariant under a group transformation. (author). 17 refs., 1 fig., 1 tab

Calculated Low-Speed Steady and Time-Dependent Aerodynamic Derivatives for Several Different Wings Using a Discrete Vortex Method

Science.gov (United States)

Riley, Donald R.

2016-01-01

Calculated numerical values for some aerodynamic terms and stability Derivatives for several different wings in unseparated inviscid incompressible flow were made using a discrete vortex method involving a limited number of horseshoe vortices. Both longitudinal and lateral-directional derivatives were calculated for steady conditions as well as for sinusoidal oscillatory motions. Variables included the number of vortices used and the rotation axis/moment center chordwise location. Frequencies considered were limited to the range of interest to vehicle dynamic stability (kb <.24 ). Comparisons of some calculated numerical results with experimental wind-tunnel measurements were in reasonable agreement in the low angle-of-attack range considering the differences existing between the mathematical representation and experimental wind-tunnel models tested. Of particular interest was the presence of induced drag for the oscillatory condition.

Fast Fourier and discrete wavelet transforms applied to sensorless vector control induction motor for rotor bar faults diagnosis.

Science.gov (United States)

Talhaoui, Hicham; Menacer, Arezki; Kessal, Abdelhalim; Kechida, Ridha

2014-09-01

This paper presents new techniques to evaluate faults in case of broken rotor bars of induction motors. Procedures are applied with closed-loop control. Electrical and mechanical variables are treated using fast Fourier transform (FFT), and discrete wavelet transform (DWT) at start-up and steady state. The wavelet transform has proven to be an excellent mathematical tool for the detection of the faults particularly broken rotor bars type. As a performance, DWT can provide a local representation of the non-stationary current signals for the healthy machine and with fault. For sensorless control, a Luenberger observer is applied; the estimation rotor speed is analyzed; the effect of the faults in the speed pulsation is compensated; a quadratic current appears and used for fault detection. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

Universal sequence map (USM of arbitrary discrete sequences

Directory of Open Access Journals (Sweden)

Almeida Jonas S

2002-02-01

Full Text Available Abstract Background For over a decade the idea of representing biological sequences in a continuous coordinate space has maintained its appeal but not been fully realized. The basic idea is that any sequence of symbols may define trajectories in the continuous space conserving all its statistical properties. Ideally, such a representation would allow scale independent sequence analysis – without the context of fixed memory length. A simple example would consist on being able to infer the homology between two sequences solely by comparing the coordinates of any two homologous units. Results We have successfully identified such an iterative function for bijective mappingψ of discrete sequences into objects of continuous state space that enable scale-independent sequence analysis. The technique, named Universal Sequence Mapping (USM, is applicable to sequences with an arbitrary length and arbitrary number of unique units and generates a representation where map distance estimates sequence similarity. The novel USM procedure is based on earlier work by these and other authors on the properties of Chaos Game Representation (CGR. The latter enables the representation of 4 unit type sequences (like DNA as an order free Markov Chain transition table. The properties of USM are illustrated with test data and can be verified for other data by using the accompanying web-based tool:http://bioinformatics.musc.edu/~jonas/usm/. Conclusions USM is shown to enable a statistical mechanics approach to sequence analysis. The scale independent representation frees sequence analysis from the need to assume a memory length in the investigation of syntactic rules.

Discrete finite nilpotent Lie analogs: New models for unified gauge field theory

International Nuclear Information System (INIS)

Kornacker, K.

1978-01-01

To each finite dimensional real Lie algebra with integer structure constants there corresponds a countable family of discrete finite nilpotent Lie analogs. Each finite Lie analog maps exponentially onto a finite unipotent group G, and is isomorphic to the Lie algebra of G. Reformulation of quantum field theory in discrete finite form, utilizing nilpotent Lie analogs, should elminate all divergence problems even though some non-Abelian gauge symmetry may not be spontaneously broken. Preliminary results in the new finite representation theory indicate that a natural hierarchy of spontaneously broken symmetries can arise from a single unbroken non-Abelian gauge symmetry, and suggest the possibility of a new unified group theoretic interpretation for hadron colors and flavors

Modeling discrete time-to-event data

CERN Document Server

Tutz, Gerhard

2016-01-01

This book focuses on statistical methods for the analysis of discrete failure times. Failure time analysis is one of the most important fields in statistical research, with applications affecting a wide range of disciplines, in particular, demography, econometrics, epidemiology and clinical research. Although there are a large variety of statistical methods for failure time analysis, many techniques are designed for failure times that are measured on a continuous scale. In empirical studies, however, failure times are often discrete, either because they have been measured in intervals (e.g., quarterly or yearly) or because they have been rounded or grouped. The book covers well-established methods like life-table analysis and discrete hazard regression models, but also introduces state-of-the art techniques for model evaluation, nonparametric estimation and variable selection. Throughout, the methods are illustrated by real life applications, and relationships to survival analysis in continuous time are expla...

Approximate representations of propagators in an external field

International Nuclear Information System (INIS)

Fried, H.M.

1979-01-01

A method of forming approximate representations for propagators with external field dependence is suggested and discussed in the context of potential scattering. An integro-differential equation in D+1 variables, where D represents the dimensionality of Euclidian space-time, is replaced by a Volterra equation in one variable. Approximate solutions to the latter provide a generalization of the Bloch-Nordsieck representation, containing the effects of all powers of hard-potential interactions, each modified by a characteristic soft-potential dependence [fr

Spaces of fractional quotients, discrete operators, and their applications. II

International Nuclear Information System (INIS)

Lifanov, I K; Poltavskii, L N

1999-01-01

The theory of discrete operators in spaces of fractional quotients is developed. A theorem on the stability of discrete operators under smooth perturbations is proved. On this basis, using special quadrature formulae of rectangular kind, the convergence of approximate solutions of hypersingular integral equations to their exact solutions is demonstrated and a mathematical substantiation of the method of closed discrete vortex frameworks is obtained. The same line of argument is also applied to difference equations arising in the solution of the homogeneous Dirichlet problem for a general second-order elliptic equation with variable coefficients

Group Representation of the Prompt Fission Neutron Spectrum of {sup 252}Cf

Energy Technology Data Exchange (ETDEWEB)

Croft, S.; Miller, K. A. [Safeguards Science and Technology Group (N-1), Nuclear Nonproliferation Division, Los Alamos National Laboratory, Los Alamos(United States)

2011-12-15

We review the spectral representation used for the prompt fission neutron spectrum of 252Cf in the International Organization for Standardization document ISO 8529-1. We find corrections to Table A.2, the discrete group structure form, of this report are needed. We describe the approach to generating replacement values and provide a new tabulation.

Numerical Method for Darcy Flow Derived Using Discrete Exterior Calculus

Science.gov (United States)

Hirani, A. N.; Nakshatrala, K. B.; Chaudhry, J. H.

2015-05-01

We derive a numerical method for Darcy flow, and also for Poisson's equation in mixed (first order) form, based on discrete exterior calculus (DEC). Exterior calculus is a generalization of vector calculus to smooth manifolds and DEC is one of its discretizations on simplicial complexes such as triangle and tetrahedral meshes. DEC is a coordinate invariant discretization, in that it does not depend on the embedding of the simplices or the whole mesh. We start by rewriting the governing equations of Darcy flow using the language of exterior calculus. This yields a formulation in terms of flux differential form and pressure. The numerical method is then derived by using the framework provided by DEC for discretizing differential forms and operators that act on forms. We also develop a discretization for a spatially dependent Hodge star that varies with the permeability of the medium. This also allows us to address discontinuous permeability. The matrix representation for our discrete non-homogeneous Hodge star is diagonal, with positive diagonal entries. The resulting linear system of equations for flux and pressure are saddle type, with a diagonal matrix as the top left block. The performance of the proposed numerical method is illustrated on many standard test problems. These include patch tests in two and three dimensions, comparison with analytically known solutions in two dimensions, layered medium with alternating permeability values, and a test with a change in permeability along the flow direction. We also show numerical evidence of convergence of the flux and the pressure. A convergence experiment is included for Darcy flow on a surface. A short introduction to the relevant parts of smooth and discrete exterior calculus is included in this article. We also include a discussion of the boundary condition in terms of exterior calculus.

Coexistence of unlimited bipartite and genuine multipartite entanglement: Promiscuous quantum correlations arising from discrete to continuous-variable systems

International Nuclear Information System (INIS)

Adesso, Gerardo; Ericsson, Marie; Illuminati, Fabrizio

2007-01-01

Quantum mechanics imposes 'monogamy' constraints on the sharing of entanglement. We show that, despite these limitations, entanglement can be fully 'promiscuous', i.e., simultaneously present in unlimited two-body and many-body forms in states living in an infinite-dimensional Hilbert space. Monogamy just bounds the divergence rate of the various entanglement contributions. This is demonstrated in simple families of N-mode (N≥4) Gaussian states of light fields or atomic ensembles, which therefore enable infinitely more freedom in the distribution of information, as opposed to systems of individual qubits. Such a finding is of importance for the quantification, understanding, and potential exploitation of shared quantum correlations in continuous variable systems. We discuss how promiscuity gradually arises when considering simple families of discrete variable states, with increasing Hilbert space dimension towards the continuous variable limit. Such models are somehow analogous to Gaussian states with asymptotically diverging, but finite, squeezing. In this respect, we find that non-Gaussian states (which in general are more entangled than Gaussian states) exhibit also the interesting feature that their entanglement is more shareable: in the non-Gaussian multipartite arena, unlimited promiscuity can be already achieved among three entangled parties, while this is impossible for Gaussian, even infinitely squeezed states

Learning modulation of odor representations: new findings from Arc-indexed networks

Directory of Open Access Journals (Sweden)

Qi eYuan

2014-12-01

Full Text Available We first review our understanding of odor representations in rodent olfactory bulb and anterior piriform cortex. We then consider learning-induced representation changes. Finally we describe the perspective on network representations gained from examining Arc-indexed odor networks of awake rats. Arc-indexed networks are sparse and distributed, consistent with current views. However Arc provides representations of repeated odors. Arc-indexed repeated odor representations are quite variable. Sparse representations are assumed to be compact and reliable memory codes. Arc suggests this is not necessarily the case. The variability seen is consistent with electrophysiology in awake animals and may reflect top down-cortical modulation of context. Arc-indexing shows that distinct odors share larger than predicted neuron pools. These may be low-threshold neuronal subsets.Learning’s effect on Arc-indexed representations is to increase the stable or overlapping component of rewarded odor representations. This component can decrease for similar odors when their discrimination is rewarded. The learning effects seen are supported by electrophysiology, but mechanisms remain to be elucidated.

Graph-cut based discrete-valued image reconstruction.

Science.gov (United States)

Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

2015-05-01

Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

Crowding in Visual Working Memory Reveals Its Spatial Resolution and the Nature of Its Representations.

Science.gov (United States)

Tamber-Rosenau, Benjamin J; Fintzi, Anat R; Marois, René

2015-09-01

Spatial resolution fundamentally limits any image representation. Although this limit has been extensively investigated for perceptual representations by assessing how neighboring flankers degrade the perception of a peripheral target with visual crowding, the corresponding limit for representations held in visual working memory (VWM) is unknown. In the present study, we evoked crowding in VWM and directly compared resolution in VWM and perception. Remarkably, the spatial resolution of VWM proved to be no worse than that of perception. However, mixture modeling of errors caused by crowding revealed the qualitatively distinct nature of these representations. Perceptual crowding errors arose from both increased imprecision in target representations and substitution of flankers for targets. By contrast, VWM crowding errors arose exclusively from substitutions, which suggests that VWM transforms analog perceptual representations into discrete items. Thus, although perception and VWM share a common resolution limit, exceeding this limit reveals distinct mechanisms for perceiving images and holding them in mind. © The Author(s) 2015.

True many-particle scattering theory in oscillator representation

International Nuclear Information System (INIS)

Smirnov, Yu.F.; Shirokov, A.M.

1988-01-01

The scattering theory in oscillator representation in case of true multiparticle scattering (TMS) is generalized. All necessary expressions to construct a wave function of several particles system in a discrete or continuous spectra at TMS approximation are obtained. Essential advantage of the method suggested lies in the fact that the most difficult part: construction and diagonolization of the Hamiltonian cutted matrix is to be carried out only once, and then the wave function can be calculated at any designed energy. 23 refs

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis.

Science.gov (United States)

Sakhanenko, Nikita A; Kunert-Graf, James; Galas, David J

2017-12-01

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. We present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discrete variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis-that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. We illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.

Discrete Ramanujan transform for distinguishing the protein coding regions from other regions.

Science.gov (United States)

Hua, Wei; Wang, Jiasong; Zhao, Jian

2014-01-01

Based on the study of Ramanujan sum and Ramanujan coefficient, this paper suggests the concepts of discrete Ramanujan transform and spectrum. Using Voss numerical representation, one maps a symbolic DNA strand as a numerical DNA sequence, and deduces the discrete Ramanujan spectrum of the numerical DNA sequence. It is well known that of discrete Fourier power spectrum of protein coding sequence has an important feature of 3-base periodicity, which is widely used for DNA sequence analysis by the technique of discrete Fourier transform. It is performed by testing the signal-to-noise ratio at frequency N/3 as a criterion for the analysis, where N is the length of the sequence. The results presented in this paper show that the property of 3-base periodicity can be only identified as a prominent spike of the discrete Ramanujan spectrum at period 3 for the protein coding regions. The signal-to-noise ratio for discrete Ramanujan spectrum is defined for numerical measurement. Therefore, the discrete Ramanujan spectrum and the signal-to-noise ratio of a DNA sequence can be used for distinguishing the protein coding regions from the noncoding regions. All the exon and intron sequences in whole chromosomes 1, 2, 3 and 4 of Caenorhabditis elegans have been tested and the histograms and tables from the computational results illustrate the reliability of our method. In addition, we have analyzed theoretically and gotten the conclusion that the algorithm for calculating discrete Ramanujan spectrum owns the lower computational complexity and higher computational accuracy. The computational experiments show that the technique by using discrete Ramanujan spectrum for classifying different DNA sequences is a fast and effective method. Copyright © 2014 Elsevier Ltd. All rights reserved.

Lattice fluid dynamics from perfect discretizations of continuum flows

International Nuclear Information System (INIS)

Katz, E.; Wiese, U.

1998-01-01

We use renormalization group methods to derive equations of motion for large scale variables in fluid dynamics. The large scale variables are averages of the underlying continuum variables over cubic volumes and naturally exist on a lattice. The resulting lattice dynamics represents a perfect discretization of continuum physics, i.e., grid artifacts are completely eliminated. Perfect equations of motion are derived for static, slow flows of incompressible, viscous fluids. For Hagen-Poiseuille flow in a channel with a square cross section the equations reduce to a perfect discretization of the Poisson equation for the velocity field with Dirichlet boundary conditions. The perfect large scale Poisson equation is used in a numerical simulation and is shown to represent the continuum flow exactly. For nonsquare cross sections one can use a numerical iterative procedure to derive flow equations that are approximately perfect. copyright 1998 The American Physical Society

Baecklund transformations for discrete Painleve equations: Discrete PII-PV

International Nuclear Information System (INIS)

Sakka, A.; Mugan, U.

2006-01-01

Transformation properties of discrete Painleve equations are investigated by using an algorithmic method. This method yields explicit transformations which relates the solutions of discrete Painleve equations, discrete P II -P V , with different values of parameters. The particular solutions which are expressible in terms of the discrete analogue of the classical special functions of discrete Painleve equations can also be obtained from these transformations

Spatial Treatment of the Slab-geometry Discrete Ordinates Equations Using Artificial Neural Networks

International Nuclear Information System (INIS)

Brantley, P S

2001-01-01

An artificial neural network (ANN) method is developed for treating the spatial variable of the one-group slab-geometry discrete ordinates (S N ) equations in a homogeneous medium with linearly anisotropic scattering. This ANN method takes advantage of the function approximation capability of multilayer ANNs. The discrete ordinates angular flux is approximated by a multilayer ANN with a single input representing the spatial variable x and N outputs representing the angular flux in each of the discrete ordinates angular directions. A global objective function is formulated which measures how accurately the output of the ANN approximates the solution of the discrete ordinates equations and boundary conditions at specified spatial points. Minimization of this objective function determines the appropriate values for the parameters of the ANN. Numerical results are presented demonstrating the accuracy of the method for both fixed source and incident angular flux problems

Discrete Emotion Effects on Lexical Decision Response Times

Science.gov (United States)

Briesemeister, Benny B.; Kuchinke, Lars; Jacobs, Arthur M.

2011-01-01

Our knowledge about affective processes, especially concerning effects on cognitive demands like word processing, is increasing steadily. Several studies consistently document valence and arousal effects, and although there is some debate on possible interactions and different notions of valence, broad agreement on a two dimensional model of affective space has been achieved. Alternative models like the discrete emotion theory have received little interest in word recognition research so far. Using backward elimination and multiple regression analyses, we show that five discrete emotions (i.e., happiness, disgust, fear, anger and sadness) explain as much variance as two published dimensional models assuming continuous or categorical valence, with the variables happiness, disgust and fear significantly contributing to this account. Moreover, these effects even persist in an experiment with discrete emotion conditions when the stimuli are controlled for emotional valence and arousal levels. We interpret this result as evidence for discrete emotion effects in visual word recognition that cannot be explained by the two dimensional affective space account. PMID:21887307

Bayesian estimation of the discrete coefficient of determination.

Science.gov (United States)

Chen, Ting; Braga-Neto, Ulisses M

2016-12-01

The discrete coefficient of determination (CoD) measures the nonlinear interaction between discrete predictor and target variables and has had far-reaching applications in Genomic Signal Processing. Previous work has addressed the inference of the discrete CoD using classical parametric and nonparametric approaches. In this paper, we introduce a Bayesian framework for the inference of the discrete CoD. We derive analytically the optimal minimum mean-square error (MMSE) CoD estimator, as well as a CoD estimator based on the Optimal Bayesian Predictor (OBP). For the latter estimator, exact expressions for its bias, variance, and root-mean-square (RMS) are given. The accuracy of both Bayesian CoD estimators with non-informative and informative priors, under fixed or random parameters, is studied via analytical and numerical approaches. We also demonstrate the application of the proposed Bayesian approach in the inference of gene regulatory networks, using gene-expression data from a previously published study on metastatic melanoma.

Discrete emotion effects on lexical decision response times.

Science.gov (United States)

Briesemeister, Benny B; Kuchinke, Lars; Jacobs, Arthur M

2011-01-01

Our knowledge about affective processes, especially concerning effects on cognitive demands like word processing, is increasing steadily. Several studies consistently document valence and arousal effects, and although there is some debate on possible interactions and different notions of valence, broad agreement on a two dimensional model of affective space has been achieved. Alternative models like the discrete emotion theory have received little interest in word recognition research so far. Using backward elimination and multiple regression analyses, we show that five discrete emotions (i.e., happiness, disgust, fear, anger and sadness) explain as much variance as two published dimensional models assuming continuous or categorical valence, with the variables happiness, disgust and fear significantly contributing to this account. Moreover, these effects even persist in an experiment with discrete emotion conditions when the stimuli are controlled for emotional valence and arousal levels. We interpret this result as evidence for discrete emotion effects in visual word recognition that cannot be explained by the two dimensional affective space account.

Discrete emotion effects on lexical decision response times.

Directory of Open Access Journals (Sweden)

Benny B Briesemeister

Full Text Available Our knowledge about affective processes, especially concerning effects on cognitive demands like word processing, is increasing steadily. Several studies consistently document valence and arousal effects, and although there is some debate on possible interactions and different notions of valence, broad agreement on a two dimensional model of affective space has been achieved. Alternative models like the discrete emotion theory have received little interest in word recognition research so far. Using backward elimination and multiple regression analyses, we show that five discrete emotions (i.e., happiness, disgust, fear, anger and sadness explain as much variance as two published dimensional models assuming continuous or categorical valence, with the variables happiness, disgust and fear significantly contributing to this account. Moreover, these effects even persist in an experiment with discrete emotion conditions when the stimuli are controlled for emotional valence and arousal levels. We interpret this result as evidence for discrete emotion effects in visual word recognition that cannot be explained by the two dimensional affective space account.

Operator algebras for general one-dimensional quantum mechanical potentials with discrete spectrum

International Nuclear Information System (INIS)

Wuensche, Alfred

2002-01-01

We define general lowering and raising operators of the eigenstates for one-dimensional quantum mechanical potential problems leading to discrete energy spectra and investigate their associative algebra. The Hamilton operator is quadratic in these lowering and raising operators and corresponding representations of operators for action and angle are found. The normally ordered representation of general operators using combinatorial elements such as partitions is derived. The introduction of generalized coherent states is discussed. Linear laws for the spacing of the energy eigenvalues lead to the Heisenberg-Weyl group and general quadratic laws of level spacing to unitary irreducible representations of the Lie group SU(1, 1) that is considered in detail together with a limiting transition from this group to the Heisenberg-Weyl group. The relation of the approach to quantum deformations is discussed. In two appendices, the classical and quantum mechanical treatment of the squared tangent potential is presented as a special case of a system with quadratic level spacing

Foundations of the probabilistic mechanics of discrete media

CERN Document Server

Axelrad, D R

1984-01-01

This latest volume in the Foundations & Philosophy of Science & Technology series provides an account of probabilistic functional analysis and shows its applicability in the formulation of the behaviour of discrete media with the inclusion of microstructural effects. Although quantum mechanics have long been recognized as a stochastic theory, the introduction of probabilistic concepts and principles to classical mechanics has in general not been attempted. In this study the author takes the view that the significant field quantities of a discrete medium are random variables or functions of s

A Derivation of a Microscopic Entropy and Time Irreversibility From the Discreteness of Time

Directory of Open Access Journals (Sweden)

Roland Riek

2014-06-01

Full Text Available The basic microsopic physical laws are time reversible. In contrast, the second law of thermodynamics, which is a macroscopic physical representation of the world, is able to describe irreversible processes in an isolated system through the change of entropy ΔS > 0. It is the attempt of the present manuscript to bridge the microscopic physical world with its macrosocpic one with an alternative approach than the statistical mechanics theory of Gibbs and Boltzmann. It is proposed that time is discrete with constant step size. Its consequence is the presence of time irreversibility at the microscopic level if the present force is of complex nature (F(r ≠ const. In order to compare this discrete time irreversible mechamics (for simplicity a “classical”, single particle in a one dimensional space is selected with its classical Newton analog, time reversibility is reintroduced by scaling the time steps for any given time step n by the variable sn leading to the Nosé-Hoover Lagrangian. The corresponding Nos´e-Hoover Hamiltonian comprises a term Ndf kB T ln sn (kB the Boltzmann constant, T the temperature, and Ndf the number of degrees of freedom which is defined as the microscopic entropy Sn at time point n multiplied by T. Upon ensemble averaging this microscopic entropy Sn in equilibrium for a system which does not have fast changing forces approximates its macroscopic counterpart known from thermodynamics. The presented derivation with the resulting analogy between the ensemble averaged microscopic entropy and its thermodynamic analog suggests that the original description of the entropy by Boltzmann and Gibbs is just an ensemble averaging of the time scaling variable sn which is in equilibrium close to 1, but that the entropy

A new quantum representation for canonical gravity and SU(2) Yang-Mills theory

International Nuclear Information System (INIS)

Loll, R.

1990-04-01

Starting from Rovelli-Smolin's infinite-dimensional graded Poisson-bracket algebra of loop variables, we propose a new way of constructing a corresponding quantum representation. After eliminating certain quadratic constraints, we 'integrate' an infinite-dimensional subalgebra of loop variables, using a formal group law expansion. With the help of techniques from the representation theory of semidirect-product groups, we find an exact quantum representation of the full classical Poisson-bracket algebra of loop variables, without any higher-order correction terms. This opens new ways of tackling the quantum dynamics for both canonical gravity and Yang-Mills theory. (orig.)

A new quantum representation for canonical gravity and SU(2) Yang-Mills theory

International Nuclear Information System (INIS)

Loll, R.

1991-01-01

Starting from Rovelli-Smolin's infinite-dimensional graded Poisson-bracket algebra of loop variables, we propose a new way of constructing a corresponding quantum representation. After eliminating certain quadratic constraints, we 'integrate' an infinite-dimensional subalgebra of loop variables, using a formal group law expansion. With the help of techniques from the representation theory of semidirect-product groups, we find an exact quantum representation of the full classical Poisson-bracket algebra of loop variables, without any higher-order correction terms. This opens new ways of tackling the quantum dynamics for both canonical gravity and Yang-Mills theory. (orig.)

Nonautonomous discrete bright soliton solutions and interaction management for the Ablowitz-Ladik equation.

Science.gov (United States)

Yu, Fajun

2015-03-01

We present the nonautonomous discrete bright soliton solutions and their interactions in the discrete Ablowitz-Ladik (DAL) equation with variable coefficients, which possesses complicated wave propagation in time and differs from the usual bright soliton waves. The differential-difference similarity transformation allows us to relate the discrete bright soliton solutions of the inhomogeneous DAL equation to the solutions of the homogeneous DAL equation. Propagation and interaction behaviors of the nonautonomous discrete solitons are analyzed through the one- and two-soliton solutions. We study the discrete snaking behaviors, parabolic behaviors, and interaction behaviors of the discrete solitons. In addition, the interaction management with free functions and dynamic behaviors of these solutions is investigated analytically, which have certain applications in electrical and optical systems.

Improved detection of congestive heart failure via probabilistic symbolic pattern recognition and heart rate variability metrics.

Science.gov (United States)

Mahajan, Ruhi; Viangteeravat, Teeradache; Akbilgic, Oguz

2017-12-01

A timely diagnosis of congestive heart failure (CHF) is crucial to evade a life-threatening event. This paper presents a novel probabilistic symbol pattern recognition (PSPR) approach to detect CHF in subjects from their cardiac interbeat (R-R) intervals. PSPR discretizes each continuous R-R interval time series by mapping them onto an eight-symbol alphabet and then models the pattern transition behavior in the symbolic representation of the series. The PSPR-based analysis of the discretized series from 107 subjects (69 normal and 38 CHF subjects) yielded discernible features to distinguish normal subjects and subjects with CHF. In addition to PSPR features, we also extracted features using the time-domain heart rate variability measures such as average and standard deviation of R-R intervals. An ensemble of bagged decision trees was used to classify two groups resulting in a five-fold cross-validation accuracy, specificity, and sensitivity of 98.1%, 100%, and 94.7%, respectively. However, a 20% holdout validation yielded an accuracy, specificity, and sensitivity of 99.5%, 100%, and 98.57%, respectively. Results from this study suggest that features obtained with the combination of PSPR and long-term heart rate variability measures can be used in developing automated CHF diagnosis tools. Copyright © 2017 Elsevier B.V. All rights reserved.

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

Energy Technology Data Exchange (ETDEWEB)

Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhou, Xinyang [University of Colorado; Liu, Zhiyuan [University of Colorado; Chen, Lijun [University of Colorado

2017-10-03

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together with pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-01-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads

Effects of Discrete Charge Clustering in Simulations of Charged Interfaces.

Science.gov (United States)

Grime, John M A; Khan, Malek O

2010-10-12

A system of counterions between charged surfaces is investigated, with the surfaces represented by uniform charged planes and three different arrangements of discrete surface charges - an equispaced grid and two different clustered arrangements. The behaviors of a series of systems with identical net surface charge density are examined, with particular emphasis placed on the long ranged corrections via the method of "charged slabs" and the effects of the simulation cell size. Marked differences are observed in counterion distributions and the osmotic pressure dependent on the particular representation of the charged surfaces; the uniformly charged surfaces and equispaced grids of discrete charge behave in a broadly similar manner, but the clustered systems display a pronounced decrease in osmotic pressure as the simulation size is increased. The influence of the long ranged correction is shown to be minimal for all but the very smallest of system sizes.

Peculiar symmetry structure of some known discrete nonautonomous equations

International Nuclear Information System (INIS)

Garifullin, R N; Habibullin, I T; Yamilov, R I

2015-01-01

We study the generalized symmetry structure of three known discrete nonautonomous equations. One of them is the semidiscrete dressing chain of Shabat. Two others are completely discrete equations defined on the square lattice. The first one is a discrete analogue of the dressing chain introduced by Levi and Yamilov. The second one is a nonautonomous generalization of the potential discrete KdV equation or, in other words, the H1 equation of the well-known Adler−Bobenko−Suris list. We demonstrate that these equations have generalized symmetries in both directions if and only if their coefficients, depending on the discrete variables, are periodic. The order of the simplest generalized symmetry in at least one direction depends on the period and may be arbitrarily high. We substantiate this picture by some theorems in the case of small periods. In case of an arbitrarily large period, we show that it is possible to construct two hierarchies of generalized symmetries and conservation laws. The same picture should take place in case of any nonautonomous equation of the Adler−Bobenko−Suris list. (paper)

The geological basis and the representation of spatial variability in sedimentary heterogeneous media

International Nuclear Information System (INIS)

Cliffe, K.A.; Franklin, D.J.; Jones, P.I.R.; Macleod, E.J.; Porter, J.D.

1998-01-01

The impact of different conceptual models was investigated of the heterogeneity of the Sherwood Sandstone Group (SSG) at Sellafield on calculations of flow and transport. Detailed models of the heterogeneity of the Undifferentiated St Bees Sandstone (USBS) of the SSG were produced. The models took into account directly the geological structures at the facies level. The software package STORM (STOchastic Reservoir Modelling), was used to construct the models. The data required by the model are those that characterise the geometry of the channel bodies and the properties of the various sub-facies within the channels. It was found that for the case in which all of the variability was within channels, the larger scale permeabilities did not exhibit any significant correlation structure. The up-scaled effective permeabilities also exhibited correlation lengths that were comparable with the channel dimensions. Flow and transport calculations were also performed on 90 realizations of a detailed facies scale three-dimensional representation of a larger block of the USBS. The results are broadly consistent with the analytical results for transport through a random permeability field. (R.P.)

Cognitive Variability

Science.gov (United States)

Siegler, Robert S.

2007-01-01

Children's thinking is highly variable at every level of analysis, from neural and associative levels to the level of strategies, theories, and other aspects of high-level cognition. This variability exists within people as well as between them; individual children often rely on different strategies or representations on closely related problems…

Magnetic translation groups in an n-dimensional torus and their representations

International Nuclear Information System (INIS)

Tanimura, Shogo

2002-01-01

A charged particle in a uniform magnetic field in a two-dimensional torus has a discrete noncommutative translation symmetry instead of a continuous commutative translation symmetry. We study topology and symmetry of a particle in a magnetic field in a torus of arbitrary dimensions. The magnetic translation group (MTG) is defined as a group of translations that leave the gauge field invariant. We show that the MTG in an n-dimensional torus is isomorphic to a central extension of a cyclic group Z ν 1 x···xZ ν 2l xT m by U(1) with 2l+m=n. We construct and classify irreducible unitary representations of the MTG in a three-torus and apply the representation theory to three examples. We briefly describe a representation theory for a general n-torus. The MTG in an n-torus can be regarded as a generalization of the so-called noncommutative torus

Simulation of multivariate stationary stochastic processes using dimension-reduction representation methods

Science.gov (United States)

Liu, Zhangjun; Liu, Zenghui; Peng, Yongbo

2018-03-01

In view of the Fourier-Stieltjes integral formula of multivariate stationary stochastic processes, a unified formulation accommodating spectral representation method (SRM) and proper orthogonal decomposition (POD) is deduced. By introducing random functions as constraints correlating the orthogonal random variables involved in the unified formulation, the dimension-reduction spectral representation method (DR-SRM) and the dimension-reduction proper orthogonal decomposition (DR-POD) are addressed. The proposed schemes are capable of representing the multivariate stationary stochastic process with a few elementary random variables, bypassing the challenges of high-dimensional random variables inherent in the conventional Monte Carlo methods. In order to accelerate the numerical simulation, the technique of Fast Fourier Transform (FFT) is integrated with the proposed schemes. For illustrative purposes, the simulation of horizontal wind velocity field along the deck of a large-span bridge is proceeded using the proposed methods containing 2 and 3 elementary random variables. Numerical simulation reveals the usefulness of the dimension-reduction representation methods.

On the convergence of multigroup discrete-ordinates approximations

International Nuclear Information System (INIS)

Victory, H.D. Jr.; Allen, E.J.; Ganguly, K.

1987-01-01

Our analysis is divided into two distinct parts which we label for convenience as Part A and Part B. In Part A, we demonstrate that the multigroup discrete-ordinates approximations are well-defined and converge to the exact transport solution in any subcritical setting. For the most part, we focus on transport in two-dimensional Cartesian geometry. A Nystroem technique is used to extend the discrete ordinates multigroup approximates to all values of the angular and energy variables. Such an extension enables us to employ collectively compact operator theory to deduce stability and convergence of the approximates. In Part B, we perform a thorough convergence analysis for the multigroup discrete-ordinates method for an anisotropically-scattering subcritical medium in slab geometry. The diamond-difference and step-characteristic spatial approximation methods are each studied. The multigroup neutron fluxes are shown to converge in a Banach space setting under realistic smoothness conditions on the solution. This is the first thorough convergence analysis for the fully-discretized multigroup neutron transport equations

Mimetic discretization methods

CERN Document Server

Castillo, Jose E

2013-01-01

To help solve physical and engineering problems, mimetic or compatible algebraic discretization methods employ discrete constructs to mimic the continuous identities and theorems found in vector calculus. Mimetic Discretization Methods focuses on the recent mimetic discretization method co-developed by the first author. Based on the Castillo-Grone operators, this simple mimetic discretization method is invariably valid for spatial dimensions no greater than three. The book also presents a numerical method for obtaining corresponding discrete operators that mimic the continuum differential and

Dynamics and elastic interactions of the discrete multi-dark soliton solutions for the Kaup-Newell lattice equation

Science.gov (United States)

Liu, Nan; Wen, Xiao-Yong

2018-03-01

Under consideration in this paper is the Kaup-Newell (KN) lattice equation which is an integrable discretization of the KN equation. Infinitely, many conservation laws and discrete N-fold Darboux transformation (DT) for this system are constructed and established based on its Lax representation. Via the resulting N-fold DT, the discrete multi-dark soliton solutions in terms of determinants are derived from non-vanishing background. Propagation and elastic interaction structures of such solitons are shown graphically. Overtaking interaction phenomena between/among the two, three and four solitons are discussed. Numerical simulations are used to explore their dynamical behaviors of such multi-dark solitons. Numerical results show that their evolutions are stable against a small noise. Results in this paper might be helpful for understanding the propagation of nonlinear Alfvén waves in plasmas.

Discrete ordinate solution of the radiative transfer equation in the 'polarization normal wave representation'

Science.gov (United States)

Kylling, A.

1991-01-01

The transfer equations for normal waves in finite, inhomogeneous and plane-parallel magnetoactive media are solved using the discrete ordinate method. The physical process of absorption, emission, and multiple scattering are accounted for, and the medium may be forced both at the top and bottom boundary by anisotropic radiation as well as by internal anisotropic sources. The computational procedure is numerically stable for arbitrarily large optical depths, and the computer time is independent of optical thickness.

A multidimensionally consistent version of Hirota’s discrete KdV equation

International Nuclear Information System (INIS)

Atkinson, James

2012-01-01

A multidimensionally consistent generalization of Hirota’s discrete KdV equation is proposed, it is a quad equation defined by a polynomial that is quadratic in each variable. Soliton solutions and interpretation of the model as superposition principle are given. It is discussed how an important property of the defining polynomial, a factorization of discriminants, appears also in the few other known discrete integrable multi-quadratic models. (fast track communication)

Boson representations of the real symplectic group and their applications to the nuclear collective model

International Nuclear Information System (INIS)

Deenen, J.; Quesne, C.

1985-01-01

Both non-Hermitian Dyson and Hermitian Holstein--Primakoff representations of the Sp(2d,R) algebra are obtained when the latter is restricted to a positive discrete series irreducible representation 1 +n/2>. For such purposes, some results for boson representations, recently deduced from a study of the Sp(2d,R) partially coherent states, are combined with some standard techniques of boson expansion theories. The introduction of Usui operators enables the establishment of useful relations between the various boson representations. Two Dyson representations of the Sp(2d,R) algebra are obtained in compact form in terms of ν = d(d+1)/2 pairs of boson creation and annihilation operators, and of an extra U(d) spin, characterized by the irreducible representation [lambda 1 xxxlambda/sub d/]. In contrast to what happens when lambda 1 = xxx = lambda/sub d/ = lambda, it is shown that the Holstein--Primakoff representation of the Sp(2d,R) algebra cannot be written in such a compact form for a generic irreducible representation. Explicit expansions are, however, obtained by extending the Marumori, Yamamura, and Tokunaga method of boson expansion theories. The Holstein--Primakoff representation is then used to prove that, when restricted to the Sp(2d,R) irreducible representation 1 +n/2>, the dn-dimensional harmonic oscillator Hamiltonian has a U(ν) x SU(d) symmetry group

Zero of the discrete beta function in SU(3) lattice gauge theory with color sextet fermions

International Nuclear Information System (INIS)

Shamir, Yigal; Svetitsky, Benjamin; DeGrand, Thomas

2008-01-01

We have carried out a Schrodinger functional calculation for the SU(3) lattice gauge theory with two flavors of Wilson fermions in the sextet representation of the gauge group. We find that the discrete beta function, which governs the change in the running coupling under a discrete change of spatial scale, changes sign when the Schrodinger functional renormalized coupling is in the neighborhood of g 2 =2.0. The simplest explanation is that the theory has an infrared-attractive fixed point, but more complicated possibilities are allowed by the data. While we compare rescalings by factors of 2 and 4/3, we work at a single lattice spacing.

Model-based Quantile Regression for Discrete Data

KAUST Repository

Padellini, Tullia

2018-04-10

Quantile regression is a class of methods voted to the modelling of conditional quantiles. In a Bayesian framework quantile regression has typically been carried out exploiting the Asymmetric Laplace Distribution as a working likelihood. Despite the fact that this leads to a proper posterior for the regression coefficients, the resulting posterior variance is however affected by an unidentifiable parameter, hence any inferential procedure beside point estimation is unreliable. We propose a model-based approach for quantile regression that considers quantiles of the generating distribution directly, and thus allows for a proper uncertainty quantification. We then create a link between quantile regression and generalised linear models by mapping the quantiles to the parameter of the response variable, and we exploit it to fit the model with R-INLA. We extend it also in the case of discrete responses, where there is no 1-to-1 relationship between quantiles and distribution\\'s parameter, by introducing continuous generalisations of the most common discrete variables (Poisson, Binomial and Negative Binomial) to be exploited in the fitting.

Fractional Delayer Utilizing Hermite Interpolation with Caratheodory Representation

Directory of Open Access Journals (Sweden)

Qiang DU

2018-04-01

Full Text Available Fractional delay is indispensable for many sorts of circuits and signal processing applications. Fractional delay filter (FDF utilizing Hermite interpolation with an analog differentiator is a straightforward way to delay discrete signals. This method has a low time-domain error, but a complicated sampling module than the Shannon sampling scheme. A simplified scheme, which is based on Shannon sampling and utilizing Hermite interpolation with a digital differentiator, will lead a much higher time-domain error when the signal frequency approaches the Nyquist rate. In this letter, we propose a novel fractional delayer utilizing Hermite interpolation with Caratheodory representation. The samples of differential signal are obtained by Caratheodory representation from the samples of the original signal only. So, only one sampler is needed and the sampling module is simple. Simulation results for four types of signals demonstrate that the proposed method has significantly higher interpolation accuracy than Hermite interpolation with digital differentiator.

Factorizations of rational matrix functions with application to discrete isomonodromic transformations and difference Painleve equations

International Nuclear Information System (INIS)

Dzhamay, Anton

2009-01-01

We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this space is given by a mix of residue eigenvectors of the matrix and its inverse. Our approach is motivated by the theory of discrete isomonodromic transformations and their relationship with difference Painleve equations. In particular, in these coordinates, basic isomonodromic transformations take the form of the discrete Euler-Lagrange equations. Secondly we show that dPV equations, previously obtained in this context by D Arinkin and A Borodin, can be understood as simple relationships between the residues of such matrices and their inverses.

Phase space density representations in fluid dynamics

International Nuclear Information System (INIS)

Ramshaw, J.D.

1989-01-01

Phase space density representations of inviscid fluid dynamics were recently discussed by Abarbanel and Rouhi. Here it is shown that such representations may be simply derived and interpreted by means of the Liouville equation corresponding to the dynamical system of ordinary differential equations that describes fluid particle trajectories. The Hamiltonian and Poisson bracket for the phase space density then emerge as immediate consequences of the corresponding structure of the dynamics. For barotropic fluids, this approach leads by direct construction to the formulation presented by Abarbanel and Rouhi. Extensions of this formulation to inhomogeneous incompressible fluids and to fluids in which the state equation involves an additional transported scalar variable are constructed by augmenting the single-particle dynamics and phase space to include the relevant additional variable

Continuous versus discrete structures II -- Discrete Hamiltonian systems and Helmholtz conditions

OpenAIRE

Cresson, Jacky; Pierret, Frédéric

2015-01-01

We define discrete Hamiltonian systems in the framework of discrete embeddings. An explicit comparison with previous attempts is given. We then solve the discrete Helmholtz's inverse problem for the discrete calculus of variation in the Hamiltonian setting. Several applications are discussed.

Secure Hashing of Dynamic Hand Signatures Using Wavelet-Fourier Compression with BioPhasor Mixing and Discretization

Directory of Open Access Journals (Sweden)

Wai Kuan Yip

2007-01-01

Full Text Available We introduce a novel method for secure computation of biometric hash on dynamic hand signatures using BioPhasor mixing and discretization. The use of BioPhasor as the mixing process provides a one-way transformation that precludes exact recovery of the biometric vector from compromised hashes and stolen tokens. In addition, our user-specific discretization acts both as an error correction step as well as a real-to-binary space converter. We also propose a new method of extracting compressed representation of dynamic hand signatures using discrete wavelet transform (DWT and discrete fourier transform (DFT. Without the conventional use of dynamic time warping, the proposed method avoids storage of user's hand signature template. This is an important consideration for protecting the privacy of the biometric owner. Our results show that the proposed method could produce stable and distinguishable bit strings with equal error rates (EERs of and for random and skilled forgeries for stolen token (worst case scenario, and for both forgeries in the genuine token (optimal scenario.

Discrete time duration models with group-level heterogeneity

DEFF Research Database (Denmark)

Frederiksen, Anders; Honoré, Bo; Hu, Loujia

2007-01-01

Dynamic discrete choice panel data models have received a great deal of attention. In those models, the dynamics is usually handled by including the lagged outcome as an explanatory variable. In this paper we consider an alternative model in which the dynamics is handled by using the duration...

Symmetries and conserved quantities of discrete wave equation associated with the Ablowitz—Ladik—Lattice system

International Nuclear Information System (INIS)

Fu Jing-Li; He Yu-Fang; Hong Fang-Yu; Song Duan; Fu Hao

2013-01-01

In this paper, we present a new method to obtain the Lie symmetries and conserved quantities of the discrete wave equation with the Ablowitz—Ladik—Lattice equations. Firstly, the wave equation is transformed into a simple difference equation with the Ablowitz—Ladik—Lattice method. Secondly, according to the invariance of the discrete wave equation and the Ablowitz—Ladik—Lattice equations under infinitesimal transformation of dependent and independent variables, we derive the discrete determining equation and the discrete restricted equations. Thirdly, a series of the discrete analogs of conserved quantities, the discrete analogs of Lie groups, and the characteristic equations are obtained for the wave equation. Finally, we study a model of a biological macromolecule chain of mechanical behaviors, the Lie symmetry theory of discrete wave equation with the Ablowitz—Ladik—Lattice method is verified. (general)

Digital Discretion

DEFF Research Database (Denmark)

Busch, Peter Andre; Zinner Henriksen, Helle

2018-01-01

discretion is suggested to reduce this footprint by influencing or replacing their discretionary practices using ICT. What is less researched is whether digital discretion can cause changes in public policy outcomes, and under what conditions such changes can occur. Using the concept of public service values......This study reviews 44 peer-reviewed articles on digital discretion published in the period from 1998 to January 2017. Street-level bureaucrats have traditionally had a wide ability to exercise discretion stirring debate since they can add their personal footprint on public policies. Digital......, we suggest that digital discretion can strengthen ethical and democratic values but weaken professional and relational values. Furthermore, we conclude that contextual factors such as considerations made by policy makers on the macro-level and the degree of professionalization of street...

General method to find the attractors of discrete dynamic models of biological systems

Science.gov (United States)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

General method to find the attractors of discrete dynamic models of biological systems.

Science.gov (United States)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

Discrete modelling of front propagation in backward piping erosion

Science.gov (United States)

Tran, Duc-Kien; Prime, Noémie; Froiio, Francesco; Callari, Carlo; Vincens, Eric

2017-06-01

A preliminary discrete numerical model of a REV at the front region of an erosion pipe in a cohesive granular soil is briefly presented. The results reported herein refer to a simulation carried out by coupling the Discrete Element Method (DEM) with the Lattice Boltzmann Method (LBM) for the representation of the granular and fluid phases, respectively. The numerical specimen, consisiting of bonded grains, is tested under fully-saturated conditions and increasing pressure difference between the inlet (confined) and the outlet (unconfined) flow regions. The key role of compression arches of force chains that transversely cross the sample and carry most part of the hydrodynamic actions is pointed out. These arches partition the REV into an upstream region that remains almost intact and a downstream region that gradually degrades and is subsequently eroded in the form of a cluster. Eventually, the collapse of the compression arches causes the upstream region to be also eroded, abruptly, as a whole. A complete presentation of the numerical model and of the results of the simulation can be found in [12].

The endogenous grid method for discrete-continuous dynamic choice models with (or without) taste shocks

DEFF Research Database (Denmark)

Iskhakov, Fedor; Jørgensen, Thomas H.; Rust, John

2017-01-01

We present a fast and accurate computational method for solving and estimating a class of dynamic programming models with discrete and continuous choice variables. The solution method we develop for structural estimation extends the endogenous grid-point method (EGM) to discrete-continuous (DC) p...

Discrete canonical transforms that are Hadamard matrices

International Nuclear Information System (INIS)

Healy, John J; Wolf, Kurt Bernardo

2011-01-01

The group Sp(2,R) of symplectic linear canonical transformations has an integral kernel which has quadratic and linear phases, and which is realized by the geometric paraxial optical model. The discrete counterpart of this model is a finite Hamiltonian system that acts on N-point signals through N x N matrices whose elements also have a constant absolute value, although they do not form a representation of that group. Those matrices that are also unitary are Hadamard matrices. We investigate the manifolds of these N x N matrices under the Sp(2,R) equivalence imposed by the model, and find them to be on two-sided cosets. By means of an algorithm we determine representatives that lead to collections of mutually unbiased bases.

A variable-order time-dependent neutron transport method for nuclear reactor kinetics using analytically-integrated space-time characteristics

International Nuclear Information System (INIS)

Hoffman, A. J.; Lee, J. C.

2013-01-01

A new time-dependent neutron transport method based on the method of characteristics (MOC) has been developed. Whereas most spatial kinetics methods treat time dependence through temporal discretization, this new method treats time dependence by defining the characteristics to span space and time. In this implementation regions are defined in space-time where the thickness of the region in time fulfills an analogous role to the time step in discretized methods. The time dependence of the local source is approximated using a truncated Taylor series expansion with high order derivatives approximated using backward differences, permitting the solution of the resulting space-time characteristic equation. To avoid a drastic increase in computational expense and memory requirements due to solving many discrete characteristics in the space-time planes, the temporal variation of the boundary source is similarly approximated. This allows the characteristics in the space-time plane to be represented analytically rather than discretely, resulting in an algorithm comparable in implementation and expense to one that arises from conventional time integration techniques. Furthermore, by defining the boundary flux time derivative in terms of the preceding local source time derivative and boundary flux time derivative, the need to store angularly-dependent data is avoided without approximating the angular dependence of the angular flux time derivative. The accuracy of this method is assessed through implementation in the neutron transport code DeCART. The method is employed with variable-order local source representation to model a TWIGL transient. The results demonstrate that this method is accurate and more efficient than the discretized method. (authors)

Leaping from Discrete to Continuous Independent Variables: Sixth Graders' Science Line Graph Interpretations

Science.gov (United States)

Boote, Stacy K.; Boote, David N.

2017-01-01

Students often struggle to interpret graphs correctly, despite emphasis on graphic literacy in U.S. education standards documents. The purpose of this study was to describe challenges sixth graders with varying levels of science and mathematics achievement encounter when transitioning from interpreting graphs having discrete independent variables…

Improved Discretization of Grounding Lines and Calving Fronts using an Embedded-Boundary Approach in BISICLES

Science.gov (United States)

Martin, D. F.; Cornford, S. L.; Schwartz, P.; Bhalla, A.; Johansen, H.; Ng, E.

2017-12-01

Correctly representing grounding line and calving-front dynamics is of fundamental importance in modeling marine ice sheets, since the configuration of these interfaces exerts a controlling influence on the dynamics of the ice sheet. Traditional ice sheet models have struggled to correctly represent these regions without very high spatial resolution. We have developed a front-tracking discretization for grounding lines and calving fronts based on the Chombo embedded-boundary cut-cell framework. This promises better representation of these interfaces vs. a traditional stair-step discretization on Cartesian meshes like those currently used in the block-structured AMR BISICLES code. The dynamic adaptivity of the BISICLES model complements the subgrid-scale discretizations of this scheme, producing a robust approach for tracking the evolution of these interfaces. Also, the fundamental discontinuous nature of flow across grounding lines is respected by mathematically treating it as a material phase change. We present examples of this approach to demonstrate its effectiveness.

Theory of discretely decomposable restrictions of unitary representations of semisimple lie groups and some applications

CERN Document Server

Kobayashi, T

2002-01-01

Based on an embedding formula of the CAR algebra into the Cuntz algebra ${\\mathcal O}_{2^p}$, properties of the CAR algebra are studied in detail by restricting those of the Cuntz algebra. Various $\\ast$-endomorphisms of the Cuntz algebra are explicitly constructed, and transcribed into those of the CAR algebra. In particular, a set of $\\ast$-endomorphisms of the CAR algebra into its even subalgebra are constructed. According to branching formulae, which are obtained by composing representations and $\\ast$-endomorphisms, it is shown that a KMS state of the CAR algebra is obtained through the above even-CAR endomorphisms from the Fock representation. A $U(2^p)$ action on ${\\mathcal O}_{2^p}$ induces $\\ast$-automorphisms of the CAR algebra, which are given by nonlinear transformations expressed in terms of polynomials in generators. It is shown that, among such $\\ast$-automorphisms of the CAR algebra, there exists a family of one-parameter groups of $\\ast$-automorphisms describing time evolutions of fermions, i...

Symmetries and discretizations of the O(3) nonlinear sigma model

Energy Technology Data Exchange (ETDEWEB)

Flore, Raphael [TPI, Universitaet Jena (Germany)

2011-07-01

Nonlinear sigma models possess many interesting properties like asymptotic freedom, confinement or dynamical mass generation, and hence serve as toy models for QCD and other theories. We derive a formulation of the N=2 supersymmetric extension of the O(3) nonlinear sigma model in terms of constrained field variables. Starting from this formulation, it is discussed how the model can be discretized in a way that maintains as many symmetries of the theory as possible. Finally, recent numerical results related to these discretizations are presented.

Strong Decomposition of Random Variables

DEFF Research Database (Denmark)

Hoffmann-Jørgensen, Jørgen; Kagan, Abram M.; Pitt, Loren D.

2007-01-01

A random variable X is stongly decomposable if X=Y+Z where Y=Φ(X) and Z=X-Φ(X) are independent non-degenerated random variables (called the components). It is shown that at least one of the components is singular, and we derive a necessary and sufficient condition for strong decomposability...... of a discrete random variable....

BioNSi: A Discrete Biological Network Simulator Tool.

Science.gov (United States)

Rubinstein, Amir; Bracha, Noga; Rudner, Liat; Zucker, Noga; Sloin, Hadas E; Chor, Benny

2016-08-05

Modeling and simulation of biological networks is an effective and widely used research methodology. The Biological Network Simulator (BioNSi) is a tool for modeling biological networks and simulating their discrete-time dynamics, implemented as a Cytoscape App. BioNSi includes a visual representation of the network that enables researchers to construct, set the parameters, and observe network behavior under various conditions. To construct a network instance in BioNSi, only partial, qualitative biological data suffices. The tool is aimed for use by experimental biologists and requires no prior computational or mathematical expertise. BioNSi is freely available at http://bionsi.wix.com/bionsi , where a complete user guide and a step-by-step manual can also be found.

Group theoretical approach to quantum fields in de Sitter space II. The complementary and discrete series

International Nuclear Information System (INIS)

Joung, Euihun; Mourad, Jihad; Parentani, Renaud

2007-01-01

We use an algebraic approach based on representations of de Sitter group to construct covariant quantum fields in arbitrary dimensions. We study the complementary and the discrete series which correspond to light and massless fields and which lead new feature with respect to the massive principal series we previously studied (hep-th/0606119). When considering the complementary series, we make use of a non-trivial scalar product in order to get local expressions in the position representation. Based on these, we construct a family of covariant canonical fields parametrized by SU(1, 1)/U(1). Each of these correspond to the dS invariant alpha-vacua. The behavior of the modes at asymptotic times brings another difficulty as it is incompatible with the usual definition of the in and out vacua. We propose a generalized notion of these vacua which reduces to the usual conformal vacuum in the conformally massless limit. When considering the massless discrete series we find that no covariant field obeys the canonical commutation relations. To further analyze this singular case, we consider the massless limit of the complementary scalar fields we previously found. We obtain canonical fields with a deformed representation by zero modes. The zero modes have a dS invariant vacuum with singular norm. We propose a regularization by a compactification of the scalar field and a dS invariant definition of the vertex operators. The resulting two-point functions are dS invariant and have a universal logarithmic infrared divergence

Representations of Lie algebras and partial differential equations

CERN Document Server

Xu, Xiaoping

2017-01-01

This book provides explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic codes, combinatorics and algebraic varieties, summarizing the author’s works and his joint works with his former students.  Further, it presents various oscillator generalizations of the classical representation theorem on harmonic polynomials, and highlights new functors from the representation category of a simple Lie algebra to that of another simple Lie algebra. Partial differential equations play a key role in solving certain representation problems. The weight matrices of the minimal and adjoint representations over the simple Lie algebras of types E and F are proved to generate ternary orthogonal linear codes with large minimal distances. New multi-variable hypergeometric functions related to the root systems of simple Lie algebras are introduced in connection with quantum many-body systems in one dimension. In addition, the book identifies certai...

The seasonal predictability of blocking frequency in two seasonal prediction systems (CMCC, Met-Office) and the associated representation of low-frequency variability.

Science.gov (United States)

Athanasiadis, Panos; Gualdi, Silvio; Scaife, Adam A.; Bellucci, Alessio; Hermanson, Leon; MacLachlan, Craig; Arribas, Alberto; Materia, Stefano; Borelli, Andrea

2014-05-01

Low-frequency variability is a fundamental component of the atmospheric circulation. Extratropical teleconnections, the occurrence of blocking and the slow modulation of the jet streams and storm tracks are all different aspects of low-frequency variability. Part of the latter is attributed to the chaotic nature of the atmosphere and is inherently unpredictable. On the other hand, primarily as a response to boundary forcings, tropospheric low-frequency variability includes components that are potentially predictable. Seasonal forecasting faces the difficult task of predicting these components. Particularly referring to the extratropics, the current generation of seasonal forecasting systems seem to be approaching this target by realistically initializing most components of the climate system, using higher resolution and utilizing large ensemble sizes. Two seasonal prediction systems (Met-Office GloSea and CMCC-SPS-v1.5) are analyzed in terms of their representation of different aspects of extratropical low-frequency variability. The current operational Met-Office system achieves unprecedented high scores in predicting the winter-mean phase of the North Atlantic Oscillation (NAO, corr. 0.74 at 500 hPa) and the Pacific-N. American pattern (PNA, corr. 0.82). The CMCC system, considering its small ensemble size and course resolution, also achieves good scores (0.42 for NAO, 0.51 for PNA). Despite these positive features, both models suffer from biases in low-frequency variance, particularly in the N. Atlantic. Consequently, it is found that their intrinsic variability patterns (sectoral EOFs) differ significantly from the observed, and the known teleconnections are underrepresented. Regarding the representation of N. hemisphere blocking, after bias correction both systems exhibit a realistic climatology of blocking frequency. In this assessment, instantaneous blocking and large-scale persistent blocking events are identified using daily geopotential height fields at

Stochastic analysis in discrete and continuous settings with normal martingales

CERN Document Server

Privault, Nicolas

2009-01-01

This volume gives a unified presentation of stochastic analysis for continuous and discontinuous stochastic processes, in both discrete and continuous time. It is mostly self-contained and accessible to graduate students and researchers having already received a basic training in probability. The simultaneous treatment of continuous and jump processes is done in the framework of normal martingales; that includes the Brownian motion and compensated Poisson processes as specific cases. In particular, the basic tools of stochastic analysis (chaos representation, gradient, divergence, integration by parts) are presented in this general setting. Applications are given to functional and deviation inequalities and mathematical finance.

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.

2017-05-23

A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy otherwise. The mimetic character of many of the DEC operators provides exact conservation of both mass and vorticity, in addition to superior kinetic energy conservation. The employment of barycentric Hodge star allows the discretization to admit arbitrary simplicial meshes. The discretization scheme is presented along with various numerical test cases demonstrating its main characteristics.

A Study on the Consistency of Discretization Equation in Unsteady Heat Transfer Calculations

Directory of Open Access Journals (Sweden)

Wenhua Zhang

2013-01-01

Full Text Available The previous studies on the consistency of discretization equation mainly focused on the finite difference method, but the issue of consistency still remains with several problems far from totally solved in the actual numerical computation. For instance, the consistency problem is involved in the numerical case where the boundary variables are solved explicitly while the variables away from the boundary are solved implicitly. And when the coefficient of discretization equation of nonlinear numerical case is the function of variables, calculating the coefficient explicitly and the variables implicitly might also give rise to consistency problem. Thus the present paper mainly researches the consistency problems involved in the explicit treatment of the second and third boundary conditions and that of thermal conductivity which is the function of temperature. The numerical results indicate that the consistency problem should be paid more attention and not be neglected in the practical computation.

Analysis of transverse vibration and stability issues of discrete-continuous elastic systems with nonlinearly variable parameters

Directory of Open Access Journals (Sweden)

Jaroszewicz Jerzy

2018-01-01

Full Text Available The work is devoted to methods of analysis of vibrations and stability of discrete-continuous, multi-parameter models of beams, shafts, rotors, vanes, converting to homogeneous and one-dimensional. The properties of Cauchy's influence function and the characteristic series method were used to solve the boundary problem. It has been shown that the methods are an effective tool for solving boundary problems described by ordinary fourth-and second-order differential equations with variable parameters. Particular attention should be paid to the solution of the border problem of two-parameter elastic systems with variable distribution of parameters. Universal beam-specific equations with typical support conditions including vertical support, which do not depend on beam shape and axial load type, are recorded. The shape and type of load are considered in the form of an impact function that corresponds to any change in cross-section of the support and continuous axial load, so that the functions describing the stiffness, the mass and the continuous load are complete. As a result of the solution of the boundary vibration problem of freely bent support and any change in its cross-section, loaded with any longitudinal load, arranged on the resilient substrate, strict relations between the own frequency parameters and the load parameters were derived. Using the methods, simple calculations were made, easy to use in engineering practice and conditions of use were given. Experimental studies have confirmed the high accuracy of theoretical calculations using the proposed methods and formulas.

A discrete single server queue with Markovian arrivals and phase type group services

Directory of Open Access Journals (Sweden)

Attahiru Sule Alfa

1995-01-01

Full Text Available We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.

Discrete scale-free distributions and associated limit theorems

International Nuclear Information System (INIS)

Hopcraft, K I; Jakeman, E; Matthews, J O

2004-01-01

Consideration is given to the convergence properties of sums of identical, independently distributed random variables drawn from a class of discrete distributions with power-law tails, which are relevant to scale-free networks. Different limiting distributions, and rates of convergence to these limits, are identified and depend on the index of the tail. For indices ≥2, the topology evolves to a random Poisson network, but the rate of convergence can be extraordinarily slow and unlikely to be yet evident for the current size of the WWW for example. It is shown that treating discrete scale-free behaviour with continuum or mean-field approximations can lead to incorrect results. (letter to the editor)

Time dependence linear transport III convergence of the discrete ordinate method

International Nuclear Information System (INIS)

Wilson, D.G.

1983-01-01

In this paper the uniform pointwise convergence of the discrete ordinate method for weak and strong solutions of the time dependent, linear transport equation posed in a multidimensional, rectangular parallelepiped with partially reflecting walls is established. The first result is that a sequence of discrete ordinate solutions converges uniformly on the quadrature points to a solution of the continuous problem provided that the corresponding sequence of truncation errors for the solution of the continuous problem converges to zero in the same manner. The second result is that continuity of the solution with respect to the velocity variables guarantees that the truncation erros in the quadrature formula go the zero and hence that the discrete ordinate approximations converge to the solution of the continuous problem as the discrete ordinate become dense. An existence theory for strong solutions of the the continuous problem follows as a result

Data-Driven Process Discovery: A Discrete Time Algebra for Relational Signal Analysis

National Research Council Canada - National Science Library

Conrad, David

1996-01-01

.... Proposed is a time series transformation that encodes and compresses real-valued data into a well defined, discrete-space of 13 primitive elements where comparative evaluation between variables...

Solution of neutron transport equation using Daubechies' wavelet expansion in the angular discretization

International Nuclear Information System (INIS)

Cao Liangzhi; Wu Hongchun; Zheng Youqi

2008-01-01

Daubechies' wavelet expansion is introduced to discretize the angular variables of the neutron transport equation when the neutron angular flux varies very acutely with the angular directions. An improvement is made by coupling one-dimensional wavelet expansion and discrete ordinate method to make two-dimensional angular discretization efficient and stable. The angular domain is divided into several subdomains for treating the vacuum boundary condition exactly in the unstructured geometry. A set of wavelet equations coupled with each other is obtained in each subdomain. An iterative method is utilized to decouple the wavelet moments. The numerical results of several benchmark problems demonstrate that the wavelet expansion method can provide more accurate results by lower-order expansion than other angular discretization methods

Projective Synchronization of Chaotic Discrete Dynamical Systems via Linear State Error Feedback Control

Directory of Open Access Journals (Sweden)

Baogui Xin

2015-04-01

Full Text Available A projective synchronization scheme for a kind of n-dimensional discrete dynamical system is proposed by means of a linear feedback control technique. The scheme consists of master and slave discrete dynamical systems coupled by linear state error variables. A kind of novel 3-D chaotic discrete system is constructed, to which the test for chaos is applied. By using the stability principles of an upper or lower triangular matrix, two controllers for achieving projective synchronization are designed and illustrated with the novel systems. Lastly some numerical simulations are employed to validate the effectiveness of the proposed projective synchronization scheme.

Modelling discrete choice variables in assessment of teaching staff work satisfaction.

Science.gov (United States)

Mieilă, Mihai; Popescu, Constanţa; Tudorache, Ana-Maria; Toplicianu, Valerică

2015-01-01

Levels of self-reported job satisfaction and motivation were measured by survey in a sample of 286 teachers. Using the discrete choice framework, the paper tries to assess the relevance of the considered indicators (demographic, social, motivational) in overall teaching work satisfaction. The findings provide evidence that job satisfaction is correlated significantly with level of university degree held by the teacher, type of secondary school where the teacher is enrolled, revenues, and salary-tasks adequacy. This is important for the Romanian economy, since the education system is expected to provide future human resources with enhanced skills and abilities.

Modelling discrete choice variables in assessment of teaching staff work satisfaction.

Directory of Open Access Journals (Sweden)

Mihai Mieilă

Full Text Available Levels of self-reported job satisfaction and motivation were measured by survey in a sample of 286 teachers. Using the discrete choice framework, the paper tries to assess the relevance of the considered indicators (demographic, social, motivational in overall teaching work satisfaction. The findings provide evidence that job satisfaction is correlated significantly with level of university degree held by the teacher, type of secondary school where the teacher is enrolled, revenues, and salary-tasks adequacy. This is important for the Romanian economy, since the education system is expected to provide future human resources with enhanced skills and abilities.

A fully discrete energy stable scheme for a phase filed moving contact line model with variable densities and viscosities

KAUST Repository

Zhu, Guangpu; Chen, Huangxin; Sun, Shuyu; Yao, Jun

2018-01-01

In this paper, a fully discrete scheme which considers temporal and spatial discretizations is presented for the coupled Cahn-Hilliard equation in conserved form with the dynamic contact line condition and the Navier-Stokes equation

Finite Volumes Discretization of Topology Optimization Problems

DEFF Research Database (Denmark)

Evgrafov, Anton; Gregersen, Misha Marie; Sørensen, Mads Peter

, FVMs represent a standard method of discretization within engineering communities dealing with computational uid dy- namics, transport, and convection-reaction problems. Among various avours of FVMs, cell based approaches, where all variables are associated only with cell centers, are particularly...... computations is done using nite element methods (FEMs). Despite some limited recent eorts [1, 2], we have only started to develop our understanding of the interplay between the control in the coecients and FVMs. Recent advances in discrete functional analysis allow us to analyze convergence of FVM...... of the induced parametrization of the design space that allows optimization algorithms to eciently explore it, and the ease of integration with existing computational codes in a variety of application areas, the simplicity and eciency of sensitivity analyses|all stemming from the use of the same grid throughout...

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.

The discrete adjoint method for parameter identification in multibody system dynamics.

Science.gov (United States)

Lauß, Thomas; Oberpeilsteiner, Stefan; Steiner, Wolfgang; Nachbagauer, Karin

2018-01-01

The adjoint method is an elegant approach for the computation of the gradient of a cost function to identify a set of parameters. An additional set of differential equations has to be solved to compute the adjoint variables, which are further used for the gradient computation. However, the accuracy of the numerical solution of the adjoint differential equation has a great impact on the gradient. Hence, an alternative approach is the discrete adjoint method , where the adjoint differential equations are replaced by algebraic equations. Therefore, a finite difference scheme is constructed for the adjoint system directly from the numerical time integration method. The method provides the exact gradient of the discretized cost function subjected to the discretized equations of motion.

Truss topology optimization with discrete design variables — Guaranteed global optimality and benchmark examples

DEFF Research Database (Denmark)

Achtziger, Wolfgang; Stolpe, Mathias

2007-01-01

this problem is well-studied for continuous bar areas, we consider in this study the case of discrete areas. This problem is of major practical relevance if the truss must be built from pre-produced bars with given areas. As a special case, we consider the design problem for a single available bar area, i.......e., a 0/1 problem. In contrast to the heuristic methods considered in many other approaches, our goal is to compute guaranteed globally optimal structures. This is done by a branch-and-bound method for which convergence can be proven. In this branch-and-bound framework, lower bounds of the optimal......-integer problems. The main intention of this paper is to provide optimal solutions for single and multiple load benchmark examples, which can be used for testing and validating other methods or heuristics for the treatment of this discrete topology design problem....

Affective norms of 875 Spanish words for five discrete emotional categories and two emotional dimensions.

Science.gov (United States)

Hinojosa, J A; Martínez-García, N; Villalba-García, C; Fernández-Folgueiras, U; Sánchez-Carmona, A; Pozo, M A; Montoro, P R

2016-03-01

In the present study, we introduce affective norms for a new set of Spanish words, the Madrid Affective Database for Spanish (MADS), that were scored on two emotional dimensions (valence and arousal) and on five discrete emotional categories (happiness, anger, sadness, fear, and disgust), as well as on concreteness, by 660 Spanish native speakers. Measures of several objective psycholinguistic variables--grammatical class, word frequency, number of letters, and number of syllables--for the words are also included. We observed high split-half reliabilities for every emotional variable and a strong quadratic relationship between valence and arousal. Additional analyses revealed several associations between the affective dimensions and discrete emotions, as well as with some psycholinguistic variables. This new corpus complements and extends prior databases in Spanish and allows for designing new experiments investigating the influence of affective content in language processing under both dimensional and discrete theoretical conceptions of emotion. These norms can be downloaded as supplemental materials for this article from www.dropbox.com/s/o6dpw3irk6utfhy/Hinojosa%20et%20al_Supplementary%20materials.xlsx?dl=0 .

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2017-01-01

A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy

A high-order method for the integration of the Galerkin semi-discretized nuclear reactor kinetics equations

International Nuclear Information System (INIS)

Vargas, L.

1988-01-01

The numerical approximate solution of the space-time nuclear reactor kinetics equation is investigated using a finite-element discretization of the space variable and a high order integration scheme for the resulting semi-discretized parabolic equation. The Galerkin method with spatial piecewise polynomial Lagrange basis functions are used to obtained a continuous time semi-discretized form of the space-time reactor kinetics equation. A temporal discretization is then carried out with a numerical scheme based on the Iterated Defect Correction (IDC) method using piecewise quadratic polynomials or exponential functions. The kinetics equations are thus solved with in a general finite element framework with respect to space as well as time variables in which the order of convergence of the spatial and temporal discretizations is consistently high. A computer code GALFEM/IDC is developed, to implement the numerical schemes described above. This issued to solve a one space dimensional benchmark problem. The results of the numerical experiments confirm the theoretical arguments and show that the convergence is very fast and the overall procedure is quite efficient. This is due to the good asymptotic properties of the numerical scheme which is of third order in the time interval

Modeling discrete and continuous entities with fractions and decimals.

Science.gov (United States)

Rapp, Monica; Bassok, Miriam; DeWolf, Melissa; Holyoak, Keith J

2015-03-01

When people use mathematics to model real-life situations, their use of mathematical expressions is often mediated by semantic alignment (Bassok, Chase, & Martin, 1998): The entities in a problem situation evoke semantic relations (e.g., tulips and vases evoke the functionally asymmetric "contain" relation), which people align with analogous mathematical relations (e.g., the noncommutative division operation, tulips/vases). Here we investigate the possibility that semantic alignment is also involved in the comprehension and use of rational numbers (fractions and decimals). A textbook analysis and results from two experiments revealed that both mathematic educators and college students tend to align the discreteness versus continuity of the entities in word problems (e.g., marbles vs. distance) with distinct symbolic representations of rational numbers--fractions versus decimals, respectively. In addition, fractions and decimals tend to be used with nonmetric units and metric units, respectively. We discuss the importance of the ontological distinction between continuous and discrete entities to mathematical cognition, the role of symbolic notations, and possible implications of our findings for the teaching of rational numbers. PsycINFO Database Record (c) 2015 APA, all rights reserved.

DISCRETE MATHEMATICS/NUMBER THEORY

OpenAIRE

Mrs. Manju Devi*

2017-01-01

Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics such as integers, graphs, and statements do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefore excludes topics in "continuous mathematics" such as calculus and analysis. Discrete objects can often be enumerated by ...

Continuum and discrete approach in modeling biofilm development and structure: a review.

Science.gov (United States)

Mattei, M R; Frunzo, L; D'Acunto, B; Pechaud, Y; Pirozzi, F; Esposito, G

2018-03-01

The scientific community has recognized that almost 99% of the microbial life on earth is represented by biofilms. Considering the impacts of their sessile lifestyle on both natural and human activities, extensive experimental activity has been carried out to understand how biofilms grow and interact with the environment. Many mathematical models have also been developed to simulate and elucidate the main processes characterizing the biofilm growth. Two main mathematical approaches for biomass representation can be distinguished: continuum and discrete. This review is aimed at exploring the main characteristics of each approach. Continuum models can simulate the biofilm processes in a quantitative and deterministic way. However, they require a multidimensional formulation to take into account the biofilm spatial heterogeneity, which makes the models quite complicated, requiring significant computational effort. Discrete models are more recent and can represent the typical multidimensional structural heterogeneity of biofilm reflecting the experimental expectations, but they generate computational results including elements of randomness and introduce stochastic effects into the solutions.

Resonance and web structure in discrete soliton systems: the two-dimensional Toda lattice and its fully discrete and ultra-discrete analogues

International Nuclear Information System (INIS)

Maruno, Ken-ichi; Biondini, Gino

2004-01-01

We present a class of solutions of the two-dimensional Toda lattice equation, its fully discrete analogue and its ultra-discrete limit. These solutions demonstrate the existence of soliton resonance and web-like structure in discrete integrable systems such as differential-difference equations, difference equations and cellular automata (ultra-discrete equations)

Geometric description of modular and weak values in discrete quantum systems using the Majorana representation

Science.gov (United States)

Cormann, Mirko; Caudano, Yves

2017-07-01

We express modular and weak values of observables of three- and higher-level quantum systems in their polar form. The Majorana representation of N-level systems in terms of symmetric states of N  -  1 qubits provides us with a description on the Bloch sphere. With this geometric approach, we find that modular and weak values of observables of N-level quantum systems can be factored in N  -  1 contributions. Their modulus is determined by the product of N  -  1 ratios involving projection probabilities between qubits, while their argument is deduced from a sum of N  -  1 solid angles on the Bloch sphere. These theoretical results allow us to study the geometric origin of the quantum phase discontinuity around singularities of weak values in three-level systems. We also analyze the three-box paradox (Aharonov and Vaidman 1991 J. Phys. A: Math. Gen. 24 2315-28) from the point of view of a bipartite quantum system. In the Majorana representation of this paradox, an observer comes to opposite conclusions about the entanglement state of the particles that were successfully pre- and postselected.

Discrete-time Calogero-Moser system and Lagrangian 1-form structure

International Nuclear Information System (INIS)

Yoo-Kong, Sikarin; Lobb, Sarah; Nijhoff, Frank

2011-01-01

We study the Lagrange formalism of the (rational) Calogero-Moser (CM) system, both in discrete time and continuous time, as a first example of a Lagrangian 1-form structure in the sense of the recent paper (Lobb and Nijhoff 2009 J. Phys. A: Math. Theor.42 454013). The discrete-time model of the CM system was established some time ago arising as a pole reduction of a semi-discrete version of the Kadomtsev-Petviashvili (KP) equation, and was shown to lead to an exactly integrable correspondence (multivalued map). In this paper, we present the full KP solution based on the commutativity of the discrete-time flows in the two discrete KP variables. The compatibility of the corresponding Lax matrices is shown to lead directly to the relevant closure relation on the level of the Lagrangians. Performing successive continuum limits on both the level of the KP equation and the level of the CM system, we establish the proper Lagrangian 1-form structure for the continuum case of the CM model. We use the example of the three-particle case to elucidate the implementation of the novel least-action principle, which was presented in Lobb and Nijhoff (2009), for the simpler case of Lagrangian 1-forms. (paper)

A discrete phase-space calculus for quantum spins based on a reconstruction method using coherent states

International Nuclear Information System (INIS)

Weigert, S.

1999-01-01

To reconstruct a mixed or pure quantum state of a spin s is possible through coherent states: its density matrix is fixed by the probabilities to measure the value s along 4s(s+1) appropriately chosen directions in space. Thus, after inverting the experimental data, the statistical operator is parametrized entirely by expectation values. On this basis, a symbolic calculus for quantum spins is developed, the e xpectation-value representation . It resembles the Moyal representation for SU(2) but two important differences exist. On the one hand, the symbols take values on a discrete set of points in phase space only. On the other hand, no quasi-probabilities - that is, phase-space distributions with negative values - are encountered in this approach. (Author)

Personal neglect-a disorder of body representation?

Science.gov (United States)

Baas, Ulrike; de Haan, Bianca; Grässli, Tanja; Karnath, Hans-Otto; Mueri, René; Perrig, Walter J; Wurtz, Pascal; Gutbrod, Klemens

2011-04-01

The cognitive mechanisms underlying personal neglect are not well known. One theory postulates that personal neglect is due to a disorder of contralesional body representation. In the present study, we have investigated whether personal neglect is best explained by impairments in the representation of the contralesional side of the body, in particular, or a dysfunction of the mental representation of the contralesional space in general. For this, 22 patients with right hemisphere cerebral lesions (7 with personal neglect, 15 without personal neglect) and 13 healthy controls have been studied using two experimental tasks measuring representation of the body and extrapersonal space. In the tasks, photographs of left and right hands as well as left and right rear-view mirrors presented from the front and the back had to be judged as left or right. Our results show that patients with personal neglect made more errors when asked to judge stimuli of left hands and left rear-view mirrors than either patients without personal neglect or healthy controls. Furthermore, regression analyses indicated that errors in interpreting left hands were the best predictor of personal neglect, while other variables such as extrapersonal neglect, somatosensory or motor impairments, or deficits in left extrapersonal space representation had no predictive value of personal neglect. These findings suggest that deficient body representation is the major mechanism underlying personal neglect. Copyright © 2011 Elsevier Ltd. All rights reserved.

On discrete 2D integrable equations of higher order

International Nuclear Information System (INIS)

Adler, V E; Postnikov, V V

2014-01-01

We study two-dimensional discrete integrable equations of order 1 with respect to one independent variable and m with respect to another one. A generalization of the multidimensional consistency property is proposed for this type of equations. The examples are related to the Bäcklund–Darboux transformations for the lattice equations of Bogoyavlensky type. (paper)

Discrete control systems

CERN Document Server

Okuyama, Yoshifumi

2014-01-01

Discrete Control Systems establishes a basis for the analysis and design of discretized/quantized control systemsfor continuous physical systems. Beginning with the necessary mathematical foundations and system-model descriptions, the text moves on to derive a robust stability condition. To keep a practical perspective on the uncertain physical systems considered, most of the methods treated are carried out in the frequency domain. As part of the design procedure, modified Nyquist–Hall and Nichols diagrams are presented and discretized proportional–integral–derivative control schemes are reconsidered. Schemes for model-reference feedback and discrete-type observers are proposed. Although single-loop feedback systems form the core of the text, some consideration is given to multiple loops and nonlinearities. The robust control performance and stability of interval systems (with multiple uncertainties) are outlined. Finally, the monograph describes the relationship between feedback-control and discrete ev...

Spiral waves are stable in discrete element models of two-dimensional homogeneous excitable media

Science.gov (United States)

Feldman, A. B.; Chernyak, Y. B.; Cohen, R. J.

1998-01-01

The spontaneous breakup of a single spiral wave of excitation into a turbulent wave pattern has been observed in both discrete element models and continuous reaction-diffusion models of spatially homogeneous 2D excitable media. These results have attracted considerable interest, since spiral breakup is thought to be an important mechanism of transition from the heart rhythm disturbance ventricular tachycardia to the fatal arrhythmia ventricular fibrillation. It is not known whether this process can occur in the absence of disease-induced spatial heterogeneity of the electrical properties of the ventricular tissue. Candidate mechanisms for spiral breakup in uniform 2D media have emerged, but the physical validity of the mechanisms and their applicability to myocardium require further scrutiny. In this letter, we examine the computer simulation results obtained in two discrete element models and show that the instability of each spiral is an artifact resulting from an unphysical dependence of wave speed on wave front curvature in the medium. We conclude that spiral breakup does not occur in these two models at the specified parameter values and that great care must be exercised in the representation of a continuous excitable medium via discrete elements.

Influence of spatial discretization, underground water storage and glacier melt on a physically-based hydrological model of the Upper Durance River basin

Science.gov (United States)

Lafaysse, M.; Hingray, B.; Etchevers, P.; Martin, E.; Obled, C.

2011-06-01

SummaryThe SAFRAN-ISBA-MODCOU hydrological model ( Habets et al., 2008) presents severe limitations for alpine catchments. Here we propose possible model adaptations. For the catchment discretization, Relatively Homogeneous Hydrological Units (RHHUs) are used instead of the classical 8 km square grid. They are defined from the dilineation of hydrological subbasins, elevation bands, and aspect classes. Glacierized and non-glacierized areas are also treated separately. In addition, new modules are included in the model for the simulation of glacier melt, and retention of underground water. The improvement resulting from each model modification is analysed for the Upper Durance basin. RHHUs allow the model to better account for the high spatial variability of the hydrological processes (e.g. snow cover). The timing and the intensity of the spring snowmelt floods are significantly improved owing to the representation of water retention by aquifers. Despite the relatively small area covered by glaciers, accounting for glacier melt is necessary for simulating the late summer low flows. The modified model is robust over a long simulation period and it produces a good reproduction of the intra and interannual variability of discharge, which is a necessary condition for its application in a modified climate context.

SL(2, 7) representations and their relevance to neutrino physics

Energy Technology Data Exchange (ETDEWEB)

Aliferis, G.; Vlachos, N.D. [University of Thessaloniki, Department of Nuclear and Particle Physics, Thessaloniki (Greece); Leontaris, G.K. [University of Ioannina, Physics Department, Ioannina (Greece); CERN, Department of Physics, Geneva 23 (Switzerland)

2017-06-15

The investigation of the role of finite groups in flavor physics and, particularly, in the interpretation of the neutrino data has been the subject of intensive research. Motivated by this fact, in this work we derive the three-dimensional unitary representations of the projective linear group PSL{sub 2}(7). Based on the observation that the generators of the group exhibit a Latin square pattern, we use available computational packages on discrete algebra to determine the generic properties of the group elements. We present analytical expressions and discuss several examples which reproduce the neutrino mixing angles in accordance with the experimental data. (orig.)

Consistency conditions and representations of a q-deformed Virasoro algebra

International Nuclear Information System (INIS)

Polychronakos, A.P.

1990-01-01

We derive deformations of the Virasoro algebra in terms of ''diffeomorphisms'' of functions on a discretized circle. The Curtright-Zachos deformation is recovered in one case, for deformation parameter a root of unity. Consistency conditions are then derived for this algebra by introducing the so-called ''braid-Jacobi'' identities. All the representations are subsequently found through use of these identities. Further, it is shown that no nontrivial central term can be incorporated, since it clashes with the consistency conditions. Finally, an alternative deformation is derived which generalizes the Drinfeld deformation of the Su(1,1) subgroup to the full algebra. 16 refs

Transitions between discrete and rhythmic primitives in a unimanual task

Science.gov (United States)

Sternad, Dagmar; Marino, Hamal; Charles, Steven K.; Duarte, Marcos; Dipietro, Laura; Hogan, Neville

2013-01-01

Given the vast complexity of human actions and interactions with objects, we proposed that control of sensorimotor behavior may utilize dynamic primitives. However, greater computational simplicity may come at the cost of reduced versatility. Evidence for primitives may be garnered by revealing such limitations. This study tested subjects performing a sequence of progressively faster discrete movements in order to “stress” the system. We hypothesized that the increasing pace would elicit a transition to rhythmic movements, assumed to be computationally and neurally more efficient. Abrupt transitions between the two types of movements would support the hypothesis that rhythmic and discrete movements are distinct primitives. Ten subjects performed planar point-to-point arm movements paced by a metronome: starting at 2 s, the metronome intervals decreased by 36 ms per cycle to 200 ms, stayed at 200 ms for several cycles, then increased by similar increments. Instructions emphasized to insert explicit stops between each movement with a duration that equaled the movement time. The experiment was performed with eyes open and closed, and with short and long metronome sounds, the latter explicitly specifying the dwell duration. Results showed that subjects matched instructed movement times but did not preserve the dwell times. Rather, they progressively reduced dwell time to zero, transitioning to continuous rhythmic movements before movement times reached their minimum. The acceleration profiles showed an abrupt change between discrete and rhythmic profiles. The loss of dwell time occurred earlier with long auditory specification, when subjects also showed evidence of predictive control. While evidence for hysteresis was weak, taken together, the results clearly indicated a transition between discrete and rhythmic movements, supporting the proposal that representation is based on primitives rather than on veridical internal models. PMID:23888139

Transitions between Discrete and Rhythmic Primitives in a Unimanual Task

Directory of Open Access Journals (Sweden)

Dagmar eSternad

2013-07-01

Full Text Available Given the vast complexity of human actions and interactions with objects, we proposed that control of sensorimotor behavior may utilize dynamic primitives. However, greater computational simplicity may come at the cost of reduced versatility. Evidence for primitives may be garnered by revealing such limitations. This study tested subjects performing a sequence of progressively faster discrete movements, in order to stress the system. We hypothesized that the increasing pace would elicit a transition to rhythmic movements, assumed to be computationally and neurally more efficient. Abrupt transitions between the two types of movements would support the hypothesis that rhythmic and discrete movements are distinct primitives. Ten subjects performed planar point-to-point arm movements paced by a metronome: Starting at 2s the metronome intervals decreased by 36ms per cycle to 200ms, stayed at 200ms for several cycles, then increased by similar increments. Instructions emphasized to insert explicit stops between each movement with a duration that equaled the movement time. The experiment was performed with eyes open and closed, and with short and long metronome sounds, the latter explicitly specifying the dwell duration. Results showed that subjects matched instructed movement times but did not preserve the dwell times. Rather, they progressively reduced dwell time to zero, transitioning to continuous rhythmic movements before movement times reached their minimum. The acceleration profiles showed an abrupt change between discrete and rhythmic profiles. The loss of dwell time occurred earlier with long auditory specification, when subjects also showed evidence of predictive control. While evidence for hysteresis was weak, taken together, the results clearly indicated a transition between discrete and rhythmic movements, supporting the proposal that representation is based on primitives rather than on veridical internal models.

HIGHLY-ACCURATE MODEL ORDER REDUCTION TECHNIQUE ON A DISCRETE DOMAIN

Directory of Open Access Journals (Sweden)

L. D. Ribeiro

2015-09-01

Full Text Available AbstractIn this work, we present a highly-accurate technique of model order reduction applied to staged processes. The proposed method reduces the dimension of the original system based on null values of moment-weighted sums of heat and mass balance residuals on real stages. To compute these sums of weighted residuals, a discrete form of Gauss-Lobatto quadrature was developed, allowing a high degree of accuracy in these calculations. The locations where the residuals are cancelled vary with time and operating conditions, characterizing a desirable adaptive nature of this technique. Balances related to upstream and downstream devices (such as condenser, reboiler, and feed tray of a distillation column are considered as boundary conditions of the corresponding difference-differential equations system. The chosen number of moments is the dimension of the reduced model being much lower than the dimension of the complete model and does not depend on the size of the original model. Scaling of the discrete independent variable related with the stages was crucial for the computational implementation of the proposed method, avoiding accumulation of round-off errors present even in low-degree polynomial approximations in the original discrete variable. Dynamical simulations of distillation columns were carried out to check the performance of the proposed model order reduction technique. The obtained results show the superiority of the proposed procedure in comparison with the orthogonal collocation method.

Discrete/Finite Element Modelling of Rock Cutting with a TBM Disc Cutter

Science.gov (United States)

Labra, Carlos; Rojek, Jerzy; Oñate, Eugenio

2017-03-01

This paper presents advanced computer simulation of rock cutting process typical for excavation works in civil engineering. Theoretical formulation of the hybrid discrete/finite element model has been presented. The discrete and finite element methods have been used in different subdomains of a rock sample according to expected material behaviour, the part which is fractured and damaged during cutting is discretized with the discrete elements while the other part is treated as a continuous body and it is modelled using the finite element method. In this way, an optimum model is created, enabling a proper representation of the physical phenomena during cutting and efficient numerical computation. The model has been applied to simulation of the laboratory test of rock cutting with a single TBM (tunnel boring machine) disc cutter. The micromechanical parameters have been determined using the dimensionless relationships between micro- and macroscopic parameters. A number of numerical simulations of the LCM test in the unrelieved and relieved cutting modes have been performed. Numerical results have been compared with available data from in-situ measurements in a real TBM as well as with the theoretical predictions showing quite a good agreement. The numerical model has provided a new insight into the cutting mechanism enabling us to investigate the stress and pressure distribution at the tool-rock interaction. Sensitivity analysis of rock cutting performed for different parameters including disc geometry, cutting velocity, disc penetration and spacing has shown that the presented numerical model is a suitable tool for the design and optimization of rock cutting process.

Contextual effects in visual working memory reveal hierarchically structured memory representations.

Science.gov (United States)

Brady, Timothy F; Alvarez, George A

2015-01-01

Influential slot and resource models of visual working memory make the assumption that items are stored in memory as independent units, and that there are no interactions between them. Consequently, these models predict that the number of items to be remembered (the set size) is the primary determinant of working memory performance, and therefore these models quantify memory capacity in terms of the number and quality of individual items that can be stored. Here we demonstrate that there is substantial variance in display difficulty within a single set size, suggesting that limits based on the number of individual items alone cannot explain working memory storage. We asked hundreds of participants to remember the same sets of displays, and discovered that participants were highly consistent in terms of which items and displays were hardest or easiest to remember. Although a simple grouping or chunking strategy could not explain this individual-display variability, a model with multiple, interacting levels of representation could explain some of the display-by-display differences. Specifically, a model that includes a hierarchical representation of items plus the mean and variance of sets of the colors on the display successfully accounts for some of the variability across displays. We conclude that working memory representations are composed only in part of individual, independent object representations, and that a major factor in how many items are remembered on a particular display is interitem representations such as perceptual grouping, ensemble, and texture representations.

Discrete Element Modeling

Energy Technology Data Exchange (ETDEWEB)

Morris, J; Johnson, S

2007-12-03

The Distinct Element Method (also frequently referred to as the Discrete Element Method) (DEM) is a Lagrangian numerical technique where the computational domain consists of discrete solid elements which interact via compliant contacts. This can be contrasted with Finite Element Methods where the computational domain is assumed to represent a continuum (although many modern implementations of the FEM can accommodate some Distinct Element capabilities). Often the terms Discrete Element Method and Distinct Element Method are used interchangeably in the literature, although Cundall and Hart (1992) suggested that Discrete Element Methods should be a more inclusive term covering Distinct Element Methods, Displacement Discontinuity Analysis and Modal Methods. In this work, DEM specifically refers to the Distinct Element Method, where the discrete elements interact via compliant contacts, in contrast with Displacement Discontinuity Analysis where the contacts are rigid and all compliance is taken up by the adjacent intact material.

DBKGrad: An R Package for Mortality Rates Graduation by Discrete Beta Kernel Techniques

Directory of Open Access Journals (Sweden)

Angelo Mazza

2014-04-01

Full Text Available We introduce the R package DBKGrad, conceived to facilitate the use of kernel smoothing in graduating mortality rates. The package implements univariate and bivariate adaptive discrete beta kernel estimators. Discrete kernels have been preferred because, in this context, variables such as age, calendar year and duration, are pragmatically considered as discrete and the use of beta kernels is motivated since it reduces boundary bias. Furthermore, when data on exposures to the risk of death are available, the use of adaptive bandwidth, that may be selected by cross-validation, can provide additional benefits. To exemplify the use of the package, an application to Italian mortality rates, for different ages and calendar years, is presented.

Discrete PID Tuning Using Artificial Intelligence Techniques

Directory of Open Access Journals (Sweden)

Petr DOLEŽEL

2009-06-01

Full Text Available PID controllers are widely used in industry these days due to their useful properties such as simple tuning or robustness. While they are applicable to many control problems, they can perform poorly in some applications. Highly nonlinear system control with constrained manipulated variable can be mentioned as an example. The point of the paper is to string together convenient qualities of conventional PID control and progressive techniques based on Artificial Intelligence. Proposed control method should deal with even highly nonlinear systems. To be more specific, there is described new method of discrete PID controller tuning in this paper. This method tunes discrete PID controller parameters online through the use of genetic algorithm and neural model of controlled system in order to control successfully even highly nonlinear systems. After method description and some discussion, there is performed control simulation and comparison to one chosen conventional control method.

Evolutionary design of discrete controllers for hybrid mechatronic systems

DEFF Research Database (Denmark)

Dupuis, Jean-Francois; Fan, Zhun; Goodman, Erik

2015-01-01

This paper investigates the issue of evolutionary design of controllers for hybrid mechatronic systems. Finite State Automaton (FSA) is selected as the representation for a discrete controller due to its interpretability, fast execution speed and natural extension to a statechart, which is very...... popular in industrial applications. A case study of a two-tank system is used to demonstrate that the proposed evolutionary approach can lead to a successful design of an FSA controller for the hybrid mechatronic system, represented by a hybrid bond graph. Generalisation of the evolved FSA controller...... of the evolutionary design of controllers for hybrid mechatronic systems. Finally, some important future research directions are pointed out, leading to the major work of the succeeding part of the research....

Introduction to digital image processing

CERN Document Server

Pratt, William K

2013-01-01

CONTINUOUS IMAGE CHARACTERIZATION Continuous Image Mathematical Characterization Image RepresentationTwo-Dimensional SystemsTwo-Dimensional Fourier TransformImage Stochastic CharacterizationPsychophysical Vision Properties Light PerceptionEye PhysiologyVisual PhenomenaMonochrome Vision ModelColor Vision ModelPhotometry and ColorimetryPhotometryColor MatchingColorimetry ConceptsColor SpacesDIGITAL IMAGE CHARACTERIZATION Image Sampling and Reconstruction Image Sampling and Reconstruction ConceptsMonochrome Image Sampling SystemsMonochrome Image Reconstruction SystemsColor Image Sampling SystemsImage QuantizationScalar QuantizationProcessing Quantized VariablesMonochrome and Color Image QuantizationDISCRETE TWO-DIMENSIONAL LINEAR PROCESSING Discrete Image Mathematical Characterization Vector-Space Image RepresentationGeneralized Two-Dimensional Linear OperatorImage Statistical CharacterizationImage Probability Density ModelsLinear Operator Statistical RepresentationSuperposition and ConvolutionFinite-Area Superp...

Control approach development for variable recruitment artificial muscles

Science.gov (United States)

Jenkins, Tyler E.; Chapman, Edward M.; Bryant, Matthew

2016-04-01

This study characterizes hybrid control approaches for the variable recruitment of fluidic artificial muscles with double acting (antagonistic) actuation. Fluidic artificial muscle actuators have been explored by researchers due to their natural compliance, high force-to-weight ratio, and low cost of fabrication. Previous studies have attempted to improve system efficiency of the actuators through variable recruitment, i.e. using discrete changes in the number of active actuators. While current variable recruitment research utilizes manual valve switching, this paper details the current development of an online variable recruitment control scheme. By continuously controlling applied pressure and discretely controlling the number of active actuators, operation in the lowest possible recruitment state is ensured and working fluid consumption is minimized. Results provide insight into switching control scheme effects on working fluids, fabrication material choices, actuator modeling, and controller development decisions.

The Fourier U(2 Group and Separation of Discrete Variables

Directory of Open Access Journals (Sweden)

Kurt Bernardo Wolf

2011-06-01

Full Text Available The linear canonical transformations of geometric optics on two-dimensional screens form the group Sp(4,R, whose maximal compact subgroup is the Fourier group U(2_F; this includes isotropic and anisotropic Fourier transforms, screen rotations and gyrations in the phase space of ray positions and optical momenta. Deforming classical optics into a Hamiltonian system whose positions and momenta range over a finite set of values, leads us to the finite oscillator model, which is ruled by the Lie algebra so(4. Two distinct subalgebra chains are used to model arrays of N^2 points placed along Cartesian or polar (radius and angle coordinates, thus realizing one case of separation in two discrete coordinates. The N^2-vectors in this space are digital (pixellated images on either of these two grids, related by a unitary transformation. Here we examine the unitary action of the analogue Fourier group on such images, whose rotations are particularly visible.

Performance on perceptual word identification is mediated by discrete states.

Science.gov (United States)

Swagman, April R; Province, Jordan M; Rouder, Jeffrey N

2015-02-01

We contrast predictions from discrete-state models of all-or-none information loss with signal-detection models of graded strength for the identification of briefly flashed English words. Previous assessments have focused on whether ROC curves are straight or not, which is a test of a discrete-state model where detection leads to the highest confidence response with certainty. We along with many others argue this certainty assumption is too constraining, and, consequently, the straight-line ROC test is too stringent. Instead, we assess a core property of discrete-state models, conditional independence, where the pattern of responses depends only on which state is entered. The conditional independence property implies that confidence ratings are a mixture of detect and guess state responses, and that stimulus strength factors, the duration of the flashed word in this report, affect only the probability of entering a state and not responses conditional on a state. To assess this mixture property, 50 participants saw words presented briefly on a computer screen at three variable flash durations followed by either a two-alternative confidence ratings task or a yes-no confidence ratings task. Comparable discrete-state and signal-detection models were fit to the data for each participant and task. The discrete-state models outperformed the signal detection models for 90 % of participants in the two-alternative task and for 68 % of participants in the yes-no task. We conclude discrete-state models are viable for predicting performance across stimulus conditions in a perceptual word identification task.

A schema for knowledge representation and its implementation in a computer-aided design and manufacturing system

Energy Technology Data Exchange (ETDEWEB)

Tamir, D.E.

1989-01-01

Modularity in the design and implementation of expert systems relies upon cooperation among the expert systems and communication of knowledge between them. A prerequisite for an effective modular approach is some standard for knowledge representation to be used by the developers of the different modules. In this work the author presents a schema for knowledge representation, and apply this schema in the design of a rule-based expert system. He also implements a cooperative expert system using the proposed knowledge representation method. A knowledge representation schema is a formal specification of the internal, conceptual, and external components of a knowledge base, each specified in a separate schema. The internal schema defines the structure of a knowledge base, the conceptual schema defines the concepts, and the external schema formalizes the pragmatics of a knowledge base. The schema is the basis for standardizing knowledge representation systems and it is used in the various phases of design and specification of the knowledge base. A new model of knowledge representation based on a pattern recognition interpretation of implications is developed. This model implements the concept of linguistic variables and can, therefore, emulate human reasoning with linguistic imprecision. The test case for the proposed schema of knowledge representation is a system is a cooperative expert system composed of two expert systems. This system applies a pattern recognition interpretation of a generalized one-variable implication with linguistic variables.

Approximate representation of optimal strategies from influence diagrams

DEFF Research Database (Denmark)

Jensen, Finn V.

2008-01-01

, and where the policy functions for the decisions have so large do- mains that they cannot be represented directly in a strategy tree. The approach is to have separate ID representations for each decision variable. In each representation the actual information is fully exploited, however the representation...... of policies for future decisions are approximations. We call the approximation information abstraction. It consists in introducing a dummy structure connecting the past with the decision. We study how to specify, implement and learn information abstraction.......There are three phases in the life of a decision problem, specification, solution, and rep- resentation of solution. The specification and solution phases are off-line, while the rep- resention of solution often shall serve an on-line situation with rather tough constraints on time and space. One...

Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

KAUST Repository

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-01-01

A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a

Asymptotic behavior of discrete holomorphic maps z^c, log(z) and discrete Painleve transcedents

OpenAIRE

Agafonov, S. I.

2005-01-01

It is shown that discrete analogs of z^c and log(z) have the same asymptotic behavior as their smooth counterparts. These discrete maps are described in terms of special solutions of discrete Painleve-II equations, asymptotics of these solutions providing the behaviour of discrete z^c and log(z) at infinity.

Wavelet-filtering of symbolic music representations for folk tune segmentation and classification

DEFF Research Database (Denmark)

Velarde, Gissel; Weyde, Tillman; Meredith, David

2013-01-01

The aim of this study is to evaluate a machine-learning method in which symbolic representations of folk songs are segmented and classified into tune families with Haar-wavelet filtering. The method is compared with previously proposed Gestalt based method. Melodies are represented as discrete...... coefficients’ local maxima to indicate local boundaries and classify segments by means of k-nearest neighbours based on standard vector-metrics (Euclidean, cityblock), and compare the results to a Gestalt-based segmentation method and metrics applied directly to the pitch signal. We found that the wavelet...

Estimating variability in placido-based topographic systems.

Science.gov (United States)

Kounis, George A; Tsilimbaris, Miltiadis K; Kymionis, George D; Ginis, Harilaos S; Pallikaris, Ioannis G

2007-10-01

To describe a new software tool for the detailed presentation of corneal topography measurements variability by means of color-coded maps. Software was developed in Visual Basic to analyze and process a series of 10 consecutive measurements obtained by a topographic system on calibration spheres, and individuals with emmetropic, low, high, and irregular astigmatic corneas. Corneal surface was segmented into 1200 segments and the coefficient of variance of each segment's keratometric dioptric power was used as the measure of variability. The results were presented graphically in color-coded maps (Variability Maps). Two topographic systems, the TechnoMed C-Scan and the TOMEY Topographic Modeling System (TMS-2N), were examined to demonstrate our method. Graphic representation of coefficient of variance offered a detailed representation of examination variability both in calibration surfaces and human corneas. It was easy to recognize an increase in variability, as the irregularity of examination surfaces increased. In individuals with high and irregular astigmatism, a variability pattern correlated with the pattern of corneal topography: steeper corneal areas possessed higher variability values compared with flatter areas of the same cornea. Numerical data permitted direct comparisons and statistical analysis. We propose a method that permits a detailed evaluation of the variability of corneal topography measurements. The representation of the results both graphically and quantitatively improves interpretability and facilitates a spatial correlation of variability maps with original topography maps. Given the popularity of topography based custom refractive ablations of the cornea, it is possible that variability maps may assist clinicians in the evaluation of corneal topography maps of patients with very irregular corneas, before custom ablation procedures.

Discrete integration of continuous Kalman filtering equations for time invariant second-order structural systems

Science.gov (United States)

Park, K. C.; Belvin, W. Keith

1990-01-01

A general form for the first-order representation of the continuous second-order linear structural-dynamics equations is introduced to derive a corresponding form of first-order continuous Kalman filtering equations. Time integration of the resulting equations is carried out via a set of linear multistep integration formulas. It is shown that a judicious combined selection of computational paths and the undetermined matrices introduced in the general form of the first-order linear structural systems leads to a class of second-order discrete Kalman filtering equations involving only symmetric sparse N x N solution matrices.

Learning dynamic Bayesian networks with mixed variables

DEFF Research Database (Denmark)

Bøttcher, Susanne Gammelgaard

This paper considers dynamic Bayesian networks for discrete and continuous variables. We only treat the case, where the distribution of the variables is conditional Gaussian. We show how to learn the parameters and structure of a dynamic Bayesian network and also how the Markov order can be learned...

Discrete port-Hamiltonian systems

NARCIS (Netherlands)

Talasila, V.; Clemente-Gallardo, J.; Schaft, A.J. van der

2006-01-01

Either from a control theoretic viewpoint or from an analysis viewpoint it is necessary to convert smooth systems to discrete systems, which can then be implemented on computers for numerical simulations. Discrete models can be obtained either by discretizing a smooth model, or by directly modeling

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

Time Discretization Techniques

KAUST Repository

Gottlieb, S.; Ketcheson, David I.

2016-01-01

The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include

Global optimization of discrete truss topology design problems using a parallel cut-and-branch method

DEFF Research Database (Denmark)

Rasmussen, Marie-Louise Højlund; Stolpe, Mathias

2008-01-01

the physics, and the cuts (Combinatorial Benders’ and projected Chvátal–Gomory) come from an understanding of the particular mathematical structure of the reformulation. The impact of a stronger representation is investigated on several truss topology optimization problems in two and three dimensions.......The subject of this article is solving discrete truss topology optimization problems with local stress and displacement constraints to global optimum. We consider a formulation based on the Simultaneous ANalysis and Design (SAND) approach. This intrinsically non-convex problem is reformulated...

Periodic, quasiperiodic, and chaotic breathers in two-dimensional discrete β-Fermi—Pasta—Ulam lattice

International Nuclear Information System (INIS)

Xu Quan; Tian Qiang

2013-01-01

Using numerical method, we investigate whether periodic, quasiperiodic, and chaotic breathers are supported by the two-dimensional discrete Fermi—Pasta—Ulam (FPU) lattice with linear dispersion term. The spatial profile and time evolution of the two-dimensional discrete β-FPU lattice are segregated by the method of separation of variables, and the numerical simulations suggest that the discrete breathers (DBs) are supported by the system. By introducing a periodic interaction into the linear interaction between the atoms, we achieve the coupling of two incommensurate frequencies for a single DB, and the numerical simulations suggest that the quasiperiodic and chaotic breathers are supported by the system, too. (condensed matter: structural, mechanical, and thermal properties)

Discrete Hamiltonian evolution and quantum gravity

International Nuclear Information System (INIS)

Husain, Viqar; Winkler, Oliver

2004-01-01

We study constrained Hamiltonian systems by utilizing general forms of time discretization. We show that for explicit discretizations, the requirement of preserving the canonical Poisson bracket under discrete evolution imposes strong conditions on both allowable discretizations and Hamiltonians. These conditions permit time discretizations for a limited class of Hamiltonians, which does not include homogeneous cosmological models. We also present two general classes of implicit discretizations which preserve Poisson brackets for any Hamiltonian. Both types of discretizations generically do not preserve first class constraint algebras. Using this observation, we show that time discretization provides a complicated time gauge fixing for quantum gravity models, which may be compared with the alternative procedure of gauge fixing before discretization

Lattice worldline representation of correlators in a background field

International Nuclear Information System (INIS)

Epelbaum, Thomas; Gelis, François; Wu, Bin

2015-01-01

We use a discrete worldline representation in order to study the continuum limit of the one-loop expectation value of dimension two and four local operators in a background field. We illustrate this technique in the case of a scalar field coupled to a non-Abelian background gauge field. The first two coefficients of the expansion in powers of the lattice spacing can be expressed as sums over random walks on a d-dimensional cubic lattice. Using combinatorial identities for the distribution of the areas of closed random walks on a lattice, these coefficients can be turned into simple integrals. Our results are valid for an anisotropic lattice, with arbitrary lattice spacings in each direction.

Relations between representational consistency, conceptual understanding of the force concept, and scientific reasoning

Directory of Open Access Journals (Sweden)

Pasi Nieminen

2012-05-01

Full Text Available Previous physics education research has raised the question of “hidden variables” behind students’ success in learning certain concepts. In the context of the force concept, it has been suggested that students’ reasoning ability is one such variable. Strong positive correlations between students’ preinstruction scores for reasoning ability (measured by Lawson’s Classroom Test of Scientific Reasoning and their learning of forces [measured by the Force Concept Inventory (FCI] have been reported in high school and university introductory courses. However, there is no published research concerning the relation between students’ ability to interpret multiple representations consistently (i.e., representational consistency and their learning of forces. To investigate this, we collected 131 high school students’ pre- and post-test data of the Representational Variant of the Force Concept Inventory (for representational consistency and the FCI. The students’ Lawson pretest data were also collected. We found that the preinstruction level of students’ representational consistency correlated strongly with student learning gain of forces. The correlation (0.51 was almost equal to the correlation between Lawson prescore and learning gain of forces (0.52. Our results support earlier findings which suggest that scientific reasoning ability is a hidden variable behind the learning of forces. In addition, we suggest that students’ representational consistency may also be such a factor, and that this should be recognized in physics teaching.

On Darboux-integrable semi-discrete chains

International Nuclear Information System (INIS)

Habibullin, Ismagil; Sakieva, Alfia; Zheltukhina, Natalya

2010-01-01

A differential-difference equation d/dx t (n+1,x) = f(x,t(n,x),t(n+1,x),d/dx t (n,x)) with unknown t(n, x) depending on the continuous and discrete variables x and n is studied. We call an equation of such kind Darboux integrable if there exist two functions (called integrals) F and I of a finite number of dynamical variables such that D x F = 0 and DI = I, where D x is the operator of total differentiation with respect to x and D is the shift operator: Dp(n) = p(n + 1). It is proved that the integrals can be brought to some canonical form. A method of construction of an explicit formula for a general solution to Darboux-integrable chains is discussed and such solutions are found for a class of chains.

Sexual orientation and education politics: gay and lesbian representation in American schools.

Science.gov (United States)

Wald, Kenneth D; Rienzo, Barbara A; Button, James W

2002-01-01

In what has sometimes provoked a "culture war" over America's schools, gays and lesbians have sought an expanded voice in the making of education policy. This paper explores the factors that promote gay representation on school boards, how this variable in turn influences gay representation in both administrative and teaching positions, and how all three forms of gay representation relate to school board policies regarding sexual orientation education. Three of the four models drawn from the social movement literature help to explain gay school board representation. In a manner similar to other minority groups, gay representation on school boards directly or indirectly promotes the appointment of gays to administrative and teaching positions and the adoption of policies that address the problems faced by gay and lesbian students in the public schools.

A Representation for Gaining Insight into Clinical Decision Models

Science.gov (United States)

Jimison, Holly B.

1988-01-01

For many medical domains uncertainty and patient preferences are important components of decision making. Decision theory is useful as a representation for such medical models in computer decision aids, but the methodology has typically had poor performance in the areas of explanation and user interface. The additional representation of probabilities and utilities as random variables serves to provide a framework for graphical and text insight into complicated decision models. The approach allows for efficient customization of a generic model that describes the general patient population of interest to a patient- specific model. Monte Carlo simulation is used to calculate the expected value of information and sensitivity for each model variable, thus providing a metric for deciding what to emphasize in the graphics and text summary. The computer-generated explanation includes variables that are sensitive with respect to the decision or that deviate significantly from what is typically observed. These techniques serve to keep the assessment and explanation of the patient's decision model concise, allowing the user to focus on the most important aspects for that patient.

Baikov-Lee representations of cut Feynman integrals

International Nuclear Information System (INIS)

Harley, Mark; Moriello, Francesco; Schabinger, Robert M.

2017-01-01

We develop a general framework for the evaluation of d-dimensional cut Feynman integrals based on the Baikov-Lee representation of purely-virtual Feynman integrals. We implement the generalized Cutkosky cutting rule using Cauchy’s residue theorem and identify a set of constraints which determine the integration domain. The method applies equally well to Feynman integrals with a unitarity cut in a single kinematic channel and to maximally-cut Feynman integrals. Our cut Baikov-Lee representation reproduces the expected relation between cuts and discontinuities in a given kinematic channel and furthermore makes the dependence on the kinematic variables manifest from the beginning. By combining the Baikov-Lee representation of maximally-cut Feynman integrals and the properties of periods of algebraic curves, we are able to obtain complete solution sets for the homogeneous differential equations satisfied by Feynman integrals which go beyond multiple polylogarithms. We apply our formalism to the direct evaluation of a number of interesting cut Feynman integrals.

Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

KAUST Repository

Mohamed, Mamdouh S.

2016-02-11

A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

Discrete exterior calculus discretization of incompressible Navier-Stokes equations over surface simplicial meshes

Science.gov (United States)

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-05-01

A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

Time Evolution Of The Wigner Function In Discrete Quantum Phase Space For A Soluble Quasi-spin Model

CERN Document Server

Galetti, D

2000-01-01

Summary: The discrete phase space approach to quantum mechanics of degrees of freedom without classical counterparts is applied to the many-fermions/quasi-spin Lipkin model. The Wigner function is written for some chosen states associated to discrete angle and angular momentum variables, and the time evolution is numerically calculated using the discrete von Neumann-Liouville equation. Direct evidences in the time evolution of the Wigner function are extracted that identify a tunnelling effect. A connection with an $SU(2)$-based semiclassical continuous approach to the Lipkin model is also presented.

Clebsch-Gordan coefficients of discrete groups in subgroup bases

Science.gov (United States)

Chen, Gaoli

2018-04-01

We express each Clebsch-Gordan (CG) coefficient of a discrete group as a product of a CG coefficient of its subgroup and a factor, which we call an embedding factor. With an appropriate definition, such factors are fixed up to phase ambiguities. Particularly, they are invariant under basis transformations of irreducible representations of both the group and its subgroup. We then impose on the embedding factors constraints, which relate them to their counterparts under complex conjugate and therefore restrict the phases of embedding factors. In some cases, the phase ambiguities are reduced to sign ambiguities. We describe the procedure of obtaining embedding factors and then calculate CG coefficients of the group 𝒫𝒮ℒ2(7) in terms of embedding factors of its subgroups S4 and 𝒯7.

Explicit solutions to the semi-discrete modified KdV equation and motion of discrete plane curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2012-01-01

We construct explicit solutions to continuous motion of discrete plane curves described by a semi-discrete potential modified KdV equation. Explicit formulas in terms of the τ function are presented. Bäcklund transformations of the discrete curves are also discussed. We finally consider the continuous limit of discrete motion of discrete plane curves described by the discrete potential modified KdV equation to motion of smooth plane curves characterized by the potential modified KdV equation. (paper)

Consequences of inelastic discrete-level neutron-collision mechanics for inelastic continuum scattering

Energy Technology Data Exchange (ETDEWEB)

Hoogenboom, J.E. (Technische Hogeschool Delft (Netherlands))

1983-01-01

From the collision mechanics of inelastic discrete-level scattering several properties are derived for the secondary-neutron energy distribution (SNED) for inelastic continuum scattering, when conceived as scattering with continuously-distributed inelastic levels. Using assumptions about the level density and neutron cross section the SNED can be calculated and some examples are shown. A formula is derived to calculate from a given inelastic continuum SNED a function, which is proportional to the level density and the neutron cross section. From this relation further conditions follow for the SNED. Representations for the inelastic continuum SNED currently in use do not, in general, satisfy most of the derived conditions.

Consequences of inelastic discrete-level neutron-collision mechanics for inelastic continuum scattering

International Nuclear Information System (INIS)

Hoogenboom, J.E.

1983-01-01

From the collision mechanics of inelastic discrete-level scattering several properties are derived for the secondary-neutron energy distribution (SNED) for inelastic continuum scattering, when conceived as scattering with continuously-distributed inelastic levels. Using assumptions about the level density and neutron cross section the SNED can be calculated and some examples are shown. A formula is derived to calculate from a given inelastic continuum SNED a function, which is proportional to the level density and the neutron cross section. From this relation further conditions follow for the SNED. Representations for the inelastic continuum SNED currently in use do not, in general, satisfy most of the derived conditions. (author)

Discrete- and finite-bandwidth-frequency distributions in nonlinear stability applications

Science.gov (United States)

Kuehl, Joseph J.

2017-02-01

A new "wave packet" formulation of the parabolized stability equations method is presented. This method accounts for the influence of finite-bandwidth-frequency distributions on nonlinear stability calculations. The methodology is motivated by convolution integrals and is found to appropriately represent nonlinear energy transfer between primary modes and harmonics, in particular nonlinear feedback, via a "nonlinear coupling coefficient." It is found that traditional discrete mode formulations overestimate nonlinear feedback by approximately 70%. This results in smaller maximum disturbance amplitudes than those observed experimentally. The new formulation corrects this overestimation, accounts for the generation of side lobes responsible for spectral broadening, and results in disturbance representation more consistent with the experiment than traditional formulations. A Mach 6 flared-cone example is presented.

MODELING OF DYNAMIC SYSTEMS WITH MODULATION BY MEANS OF KRONECKER VECTOR-MATRIX REPRESENTATION

Directory of Open Access Journals (Sweden)

A. S. Vasilyev

2015-09-01

Full Text Available The paper deals with modeling of dynamic systems with modulation by the possibilities of state-space method. This method, being the basis of modern control theory, is based on the possibilities of vector-matrix formalism of linear algebra and helps to solve various problems of technical control of continuous and discrete nature invariant with respect to the dimension of their “input-output” objects. Unfortunately, it turned its back on the wide group of control systems, which hardware environment modulates signals. The marked system deficiency is partially offset by this paper, which proposes Kronecker vector-matrix representations for purposes of system representation of processes with signal modulation. The main result is vector-matrix representation of processes with modulation with no formal difference from continuous systems. It has been found that abilities of these representations could be effectively used in research of systems with modulation. Obtained model representations of processes with modulation are best adapted to the state-space method. These approaches for counting eigenvalues of Kronecker matrix summaries, that are matrix basis of model representations of processes described by Kronecker vector products, give the possibility to use modal direction in research of dynamics for systems with modulation. It is shown that the use of controllability for eigenvalues of general matrixes applied to Kronecker structures enabled to divide successfully eigenvalue spectrum into directed and not directed components. Obtained findings including design problems for models of dynamic processes with modulation based on the features of Kronecker vector and matrix structures, invariant with respect to the dimension of input-output relations, are applicable in the development of alternate current servo drives.

General properties of solutions to inhomogeneous Black-Scholes equations with discontinuous maturity payoffs

Science.gov (United States)

O, Hyong-Chol; Jo, Jong-Jun; Kim, Ji-Sok

2016-02-01

We provide representations of solutions to terminal value problems of inhomogeneous Black-Scholes equations and study such general properties as min-max estimates, gradient estimates, monotonicity and convexity of the solutions with respect to the stock price variable, which are important for financial security pricing. In particular, we focus on finding representation of the gradient (with respect to the stock price variable) of solutions to the terminal value problems with discontinuous terminal payoffs or inhomogeneous terms. Such terminal value problems are often encountered in pricing problems of compound-like options such as Bermudan options or defaultable bonds with discrete default barrier, default intensity and endogenous default recovery. Our results can be used in pricing real defaultable bonds under consideration of existence of discrete coupons or taxes on coupons.

Advances in the discrete ordinates and finite volume methods for the solution of radiative heat transfer problems in participating media

International Nuclear Information System (INIS)

Coelho, Pedro J.

2014-01-01

Many methods are available for the solution of radiative heat transfer problems in participating media. Among these, the discrete ordinates method (DOM) and the finite volume method (FVM) are among the most widely used ones. They provide a good compromise between accuracy and computational requirements, and they are relatively easy to integrate in CFD codes. This paper surveys recent advances on these numerical methods. Developments concerning the grid structure (e.g., new formulations for axisymmetrical geometries, body-fitted structured and unstructured meshes, embedded boundaries, multi-block grids, local grid refinement), the spatial discretization scheme, and the angular discretization scheme are described. Progress related to the solution accuracy, solution algorithm, alternative formulations, such as the modified DOM and FVM, even-parity formulation, discrete-ordinates interpolation method and method of lines, and parallelization strategies is addressed. The application to non-gray media, variable refractive index media, and transient problems is also reviewed. - Highlights: • We survey recent advances in the discrete ordinates and finite volume methods. • Developments in spatial and angular discretization schemes are described. • Progress in solution algorithms and parallelization methods is reviewed. • Advances in the transient solution of the radiative transfer equation are appraised. • Non-gray media and variable refractive index media are briefly addressed

TIMEX: a time-dependent explicit discrete ordinates program for the solution of multigroup transport equations with delayed neutrons

International Nuclear Information System (INIS)

Hill, T.R.; Reed, W.H.

1976-01-01

TIMEX solves the time-dependent, one-dimensional multigroup transport equation with delayed neutrons in plane, cylindrical, spherical, and two-angle plane geometries. Both regular and adjoint, inhomogeneous and homogeneous problems subject to vacuum, reflective, periodic, white, albedo or inhomogeneous boundary flux conditions are solved. General anisotropic scattering is allowed and anisotropic inhomogeneous sources are permitted. The discrete ordinates approximation for the angular variable is used with the diamond (central) difference approximation for the angular extrapolation in curved geometries. A linear discontinuous finite element representation for the angular flux in each spatial mesh cell is used. The time variable is differenced by an explicit technique that is unconditionally stable so that arbitrarily large time steps can be taken. Because no iteration is performed the method is exceptionally fast in terms of computing time per time step. Two acceleration methods, exponential extrapolation and rebalance, are utilized to improve the accuracy of the time differencing scheme. Variable dimensioning is used so that any combination of problem parameters leading to a container array less than MAXCOR can be accommodated. The running time for TIMEX is highly problem-dependent, but varies almost linearly with the total number of unknowns and time steps. Provision is made for creation of standard interface output files for angular fluxes and angle-integrated fluxes. Five interface units (use of interface units is optional), five output units, and two system input/output units are required. A large bulk memory is desirable, but may be replaced by disk, drum, or tape storage. 13 tables, 9 figures

New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes

International Nuclear Information System (INIS)

Karras, D A; Mertzios, G B

2009-01-01

A novel approach is presented in this paper for improving anisotropic diffusion PDE models, based on the Perona–Malik equation. A solution is proposed from an engineering perspective to adaptively estimate the parameters of the regularizing function in this equation. The goal of such a new adaptive diffusion scheme is to better preserve edges when the anisotropic diffusion PDE models are applied to image enhancement tasks. The proposed adaptive parameter estimation in the anisotropic diffusion PDE model involves self-organizing maps and Bayesian inference to define edge probabilities accurately. The proposed modifications attempt to capture not only simple edges but also difficult textural edges and incorporate their probability in the anisotropic diffusion model. In the context of the application of PDE models to image processing such adaptive schemes are closely related to the discrete image representation problem and the investigation of more suitable discretization algorithms using constraints derived from image processing theory. The proposed adaptive anisotropic diffusion model illustrates these concepts when it is numerically approximated by various discretization schemes in a database of magnetic resonance images (MRI), where it is shown to be efficient in image filtering and restoration applications

A discrete exterior approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

NARCIS (Netherlands)

Seslija, Marko; Scherpen, Jacquelien M.A.; van der Schaft, Arjan

2011-01-01

This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce simplicial Dirac structures as discrete analogues of the Stokes-Dirac structure and demonstrate

Discrete integrable couplings associated with Toda-type lattice and two hierarchies of discrete soliton equations

International Nuclear Information System (INIS)

Zhang Yufeng; Fan Engui; Zhang Yongqing

2006-01-01

With the help of two semi-direct sum Lie algebras, an efficient way to construct discrete integrable couplings is proposed. As its applications, the discrete integrable couplings of the Toda-type lattice equations are obtained. The approach can be devoted to establishing other discrete integrable couplings of the discrete lattice integrable hierarchies of evolution equations

Discrete exterior geometry approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

NARCIS (Netherlands)

Seslija, Marko; van der Schaft, Arjan; Scherpen, Jacquelien M.A.

This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce a simplicial Dirac structure as a discrete analogue of the Stokes-Dirac structure and demonstrate

Control Synthesis of Discrete-Time T-S Fuzzy Systems: Reducing the Conservatism Whilst Alleviating the Computational Burden.

Science.gov (United States)

Xie, Xiangpeng; Yue, Dong; Zhang, Huaguang; Peng, Chen

2017-09-01

The augmented multi-indexed matrix approach acts as a powerful tool in reducing the conservatism of control synthesis of discrete-time Takagi-Sugeno fuzzy systems. However, its computational burden is sometimes too heavy as a tradeoff. Nowadays, reducing the conservatism whilst alleviating the computational burden becomes an ideal but very challenging problem. This paper is toward finding an efficient way to achieve one of satisfactory answers. Different from the augmented multi-indexed matrix approach in the literature, we aim to design a more efficient slack variable approach under a general framework of homogenous matrix polynomials. Thanks to the introduction of a new extended representation for homogeneous matrix polynomials, related matrices with the same coefficient are collected together into one sole set and thus those redundant terms of the augmented multi-indexed matrix approach can be removed, i.e., the computational burden can be alleviated in this paper. More importantly, due to the fact that more useful information is involved into control design, the conservatism of the proposed approach as well is less than the counterpart of the augmented multi-indexed matrix approach. Finally, numerical experiments are given to show the effectiveness of the proposed approach.

Towards Web-based representation and processing of health information

DEFF Research Database (Denmark)

Gao, S.; Mioc, Darka; Yi, X.L.

2009-01-01

facilitated the online processing, mapping and sharing of health information, with the use of HERXML and Open Geospatial Consortium (OGC) services. It brought a new solution in better health data representation and initial exploration of the Web-based processing of health information. Conclusion: The designed......Background: There is great concern within health surveillance, on how to grapple with environmental degradation, rapid urbanization, population mobility and growth. The Internet has emerged as an efficient way to share health information, enabling users to access and understand data....... For the representation of health information through Web-mapping applications, there still lacks a standard format to accommodate all fixed (such as location) and variable (such as age, gender, health outcome, etc) indicators in the representation of health information. Furthermore, net-centric computing has not been...

On the Two-Moment Approximation of the Discrete-Time GI/G/1 Queue with a Single Vacation

Directory of Open Access Journals (Sweden)

Doo Ho Lee

2016-01-01

Full Text Available We consider a discrete-time GI/G/1 queue in which the server takes exactly one vacation each time the system becomes empty. The interarrival times of arriving customers, the service times, and the vacation times are all generic discrete random variables. Under our study, we derive an exact transform-free expression for the stationary system size distribution through the modified supplementary variable technique. Utilizing obtained results, we introduce a simple two-moment approximation for the system size distribution. From this, approximations for the mean system size along with the system size distribution could be obtained. Finally, some numerical examples are given to validate the proposed approximation method.

The response matrix discrete ordinates solution to the 1D radiative transfer equation

International Nuclear Information System (INIS)

Ganapol, Barry D.

2015-01-01

The discrete ordinates method (DOM) of solution to the 1D radiative transfer equation has been an effective method of solution for nearly 70 years. During that time, the method has experienced numerous improvements as numerical and computational techniques have become more powerful and efficient. Here, we again consider the analytical solution to the discrete radiative transfer equation in a homogeneous medium by proposing a new, and consistent, form of solution that improves upon previous forms. Aided by a Wynn-epsilon convergence acceleration, its numerical evaluation can achieve extreme precision as demonstrated by comparison with published benchmarks. Finally, we readily extend the solution to a heterogeneous medium through the star product formulation producing a novel benchmark for closed form Henyey–Greenstein scattering as an example. - Highlights: • Presents a new solution to the RTE called the response matrix DOM (RM/DOM). • Solution representations avoid the instability common in exponential solutions. • Explicit form in terms of matrix hyperbolic functions. • Extreme accuracy through Wynn-epsilon acceleration checked by published benchmarks. • Provides a more transparent numerical evaluation than found previously

The Koslowski–Sahlmann representation: gauge and diffeomorphism invariance

International Nuclear Information System (INIS)

Campiglia, Miguel; Varadarajan, Madhavan

2014-01-01

The discrete spatial geometry underlying loop quantum gravity (LQG) is degenerate almost everywhere. This is at apparent odds with the non-degeneracy of asymptotically flat metrics near spatial infinity. Koslowski generalized the LQG representation so as to describe states labeled by smooth non-degenerate triad fields. His representation was further studied by Sahlmann with a view to imposing gauge and spatial diffeomorphism invariance through group averaging methods. Motivated by the desire to model asymptotically flat quantum geometry by states with triad labels which are non-degenerate at infinity but not necessarily so in the interior, we initiate a generalization of Sahlmann’s considerations to triads of varying degeneracy. In doing so, we include delicate phase contributions to the averaging procedure which are crucial for the correct implementation of the gauge and diffeomorphism constraints, and whose existence can be traced to the background exponential functions recently constructed by one of us. Our treatment emphasizes the role of symmetries of quantum states in the averaging procedure. Semianalyticity, influential in the proofs of the beautiful uniqueness results for LQG, plays a key role in our considerations. As a by product, we re-derive the group averaging map for standard LQG, highlighting the role of state symmetries and explicitly exhibiting the essential uniqueness of its specification. (paper)

A generalized endogenous grid method for discrete-continuous choice

OpenAIRE

John Rust; Bertel Schjerning; Fedor Iskhakov

2012-01-01

This paper extends Carroll's endogenous grid method (2006 "The method of endogenous gridpoints for solving dynamic stochastic optimization problems", Economic Letters) for models with sequential discrete and continuous choice. Unlike existing generalizations, we propose solution algorithm that inherits both advantages of the original method, namely it avoids all root finding operations, and also efficiently deals with restrictions on the continuous decision variable. To further speed up the s...

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2010-01-01

The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18...

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2010-01-01

The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15...

Two new discrete integrable systems

International Nuclear Information System (INIS)

Chen Xiao-Hong; Zhang Hong-Qing

2013-01-01

In this paper, we focus on the construction of new (1+1)-dimensional discrete integrable systems according to a subalgebra of loop algebra à 1 . By designing two new (1+1)-dimensional discrete spectral problems, two new discrete integrable systems are obtained, namely, a 2-field lattice hierarchy and a 3-field lattice hierarchy. When deriving the two new discrete integrable systems, we find the generalized relativistic Toda lattice hierarchy and the generalized modified Toda lattice hierarchy. Moreover, we also obtain the Hamiltonian structures of the two lattice hierarchies by means of the discrete trace identity

Space-Time Discrete KPZ Equation

Science.gov (United States)

Cannizzaro, G.; Matetski, K.

2018-03-01

We study a general family of space-time discretizations of the KPZ equation and show that they converge to its solution. The approach we follow makes use of basic elements of the theory of regularity structures (Hairer in Invent Math 198(2):269-504, 2014) as well as its discrete counterpart (Hairer and Matetski in Discretizations of rough stochastic PDEs, 2015. arXiv:1511.06937). Since the discretization is in both space and time and we allow non-standard discretization for the product, the methods mentioned above have to be suitably modified in order to accommodate the structure of the models under study.

Discrete density of states

International Nuclear Information System (INIS)

Aydin, Alhun; Sisman, Altug

2016-01-01

By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

Prediction of Nanoparticle and Colloid Attachment on Unfavorable Mineral Surfaces Using Representative Discrete Heterogeneity.

Science.gov (United States)

Trauscht, Jacob; Pazmino, Eddy; Johnson, William P

2015-09-01

Despite several decades of research there currently exists no mechanistic theory to predict colloid attachment in porous media under environmental conditions where colloid-collector repulsion exists (unfavorable conditions for attachment). It has long been inferred that nano- to microscale surface heterogeneity (herein called discrete heterogeneity) drives colloid attachment under unfavorable conditions. Incorporating discrete heterogeneity into colloid-collector interaction calculations in particle trajectory simulations predicts colloid attachment under unfavorable conditions. As yet, discrete heterogeneity cannot be independently measured by spectroscopic or other approaches in ways directly relevant to colloid-surface interaction. This, combined with the fact that a given discrete heterogeneity representation will interact differently with differently sized colloids as well as different ionic strengths for a given sized colloid, suggests a strategy to back out representative discrete heterogeneity by a comparison of simulations to experiments performed across a range of colloid size, solution IS, and fluid velocity. This has recently been performed for interaction of carboxylate-modified polystyrene latex (CML) microsphere attachment to soda lime glass at pH 6.7 with NaCl electrolyte. However, extension to other surfaces, pH values, and electrolytes is needed. For this reason, the attachment of CML (0.25, 1.1, and 2.0 μm diameters) from aqueous suspension onto a variety of unfavorable mineral surfaces (soda lime glass, muscovite, and albite) was examined for pH values of 6.7 and 8.0), fluid velocities (1.71 × 10(-3) and 5.94 × 10(-3) m s(-1)), IS (6.0 and 20 mM), and electrolytes (NaCl, CaSO4, and multivalent mixtures). The resulting representative heterogeneities (heterodomain size and surface coverage, where heterodomain refers to nano- to microscale attractive domains) yielded colloid attachment predictions that were compared to predictions from existing

Contextuality in canonical systems of random variables

Science.gov (United States)

Dzhafarov, Ehtibar N.; Cervantes, Víctor H.; Kujala, Janne V.

2017-10-01

Random variables representing measurements, broadly understood to include any responses to any inputs, form a system in which each of them is uniquely identified by its content (that which it measures) and its context (the conditions under which it is recorded). Two random variables are jointly distributed if and only if they share a context. In a canonical representation of a system, all random variables are binary, and every content-sharing pair of random variables has a unique maximal coupling (the joint distribution imposed on them so that they coincide with maximal possible probability). The system is contextual if these maximal couplings are incompatible with the joint distributions of the context-sharing random variables. We propose to represent any system of measurements in a canonical form and to consider the system contextual if and only if its canonical representation is contextual. As an illustration, we establish a criterion for contextuality of the canonical system consisting of all dichotomizations of a single pair of content-sharing categorical random variables. This article is part of the themed issue `Second quantum revolution: foundational questions'.

Discrete energy formulation of neutron transport theory applied to solving the discrete ordinates equations

International Nuclear Information System (INIS)

Ching, J.; Oblow, E.M.; Goldstein, H.

1976-01-01

An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated that allows the development of a discrete energy, discrete ordinates method for the solution of radiation transport problems. In the discrete energy method, the group averaging required in the cross-section processing for multigroup calculations is replaced by a faster numerical quadrature scheme capable of generating transfer cross sections describing all the physical processes of interest on a fine point-energy grid. Test calculations in which the discrete energy method is compared with the multigroup method show that, for the same energy grid, the discrete energy method is much faster, although somewhat less accurate, than the multigroup method. However, the accuracy of the discrete energy method increases rapidly as the spacing between energy grid points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum, the discrete energy method is therefore expected to be far more economical than the multigroup technique for equivalent accuracy solutions. This advantage of the point method is demonstrated by application to the study of neutron transport in a thick iron slab

3-D Discrete Analytical Ridgelet Transform

OpenAIRE

Helbert , David; Carré , Philippe; Andrès , Éric

2006-01-01

International audience; In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines:...

Discrete fractional calculus

CERN Document Server

Goodrich, Christopher

2015-01-01

This text provides the first comprehensive treatment of the discrete fractional calculus. Experienced researchers will find the text useful as a reference for discrete fractional calculus and topics of current interest. Students who are interested in learning about discrete fractional calculus will find this text to provide a useful starting point. Several exercises are offered at the end of each chapter and select answers have been provided at the end of the book. The presentation of the content is designed to give ample flexibility for potential use in a myriad of courses and for independent study. The novel approach taken by the authors includes a simultaneous treatment of the fractional- and integer-order difference calculus (on a variety of time scales, including both the usual forward and backwards difference operators). The reader will acquire a solid foundation in the classical topics of the discrete calculus while being introduced to exciting recent developments, bringing them to the frontiers of the...

Latent variables and route choice behavior

DEFF Research Database (Denmark)

Prato, Carlo Giacomo; Bekhor, Shlomo; Pronello, Cristina

2012-01-01

In the last decade, a broad array of disciplines has shown a general interest in enhancing discrete choice models by considering the incorporation of psychological factors affecting decision making. This paper provides insight into the comprehension of the determinants of route choice behavior...... and bound algorithm. A hybrid model consists of measurement equations, which relate latent variables to measurement indicators and utilities to choice indicators, and structural equations, which link travelers’ observable characteristics to latent variables and explanatory variables to utilities. Estimation...

Continuous-variable quantum homomorphic signature

Science.gov (United States)

Li, Ke; Shang, Tao; Liu, Jian-wei

2017-10-01

Quantum cryptography is believed to be unconditionally secure because its security is ensured by physical laws rather than computational complexity. According to spectrum characteristic, quantum information can be classified into two categories, namely discrete variables and continuous variables. Continuous-variable quantum protocols have gained much attention for their ability to transmit more information with lower cost. To verify the identities of different data sources in a quantum network, we propose a continuous-variable quantum homomorphic signature scheme. It is based on continuous-variable entanglement swapping and provides additive and subtractive homomorphism. Security analysis shows the proposed scheme is secure against replay, forgery and repudiation. Even under nonideal conditions, it supports effective verification within a certain verification threshold.

Airborne Lidar: Advances in Discrete Return Technology for 3D Vegetation Mapping

Directory of Open Access Journals (Sweden)

Valerie Ussyshkin

2011-02-01

Full Text Available Conventional discrete return airborne lidar systems, used in the commercial sector for efficient generation of high quality spatial data, have been considered for the past decade to be an ideal choice for various mapping applications. Unlike two-dimensional aerial imagery, the elevation component of airborne lidar data provides the ability to represent vertical structure details with very high precision, which is an advantage for many lidar applications focusing on the analysis of elevated features such as 3D vegetation mapping. However, the use of conventional airborne discrete return lidar systems for some of these applications has often been limited, mostly due to relatively coarse vertical resolution and insufficient number of multiple measurements in vertical domain. For this reason, full waveform airborne sensors providing more detailed representation of target vertical structure have often been considered as a preferable choice in some areas of 3D vegetation mapping application, such as forestry research. This paper presents an overview of the specific features of airborne lidar technology concerning 3D mapping applications, particularly vegetation mapping. Certain key performance characteristics of lidar sensors important for the quality of vegetation mapping are discussed and illustrated by the advanced capabilities of the ALTM-Orion, a new discrete return sensor manufactured by Optech Incorporated. It is demonstrated that advanced discrete return sensors with enhanced 3D mapping capabilities can produce data of enhanced quality, which can represent complex structures of vegetation targets at the level of details equivalent in some aspects to the content of full waveform data. It is also shown that recent advances in conventional airborne lidar technology bear the potential to create a new application niche, where high quality dense point clouds, enhanced by fully recorded intensity for multiple returns, may provide sufficient

Chaotic properties between the nonintegrable discrete nonlinear Schroedinger equation and a nonintegrable discrete Heisenberg model

International Nuclear Information System (INIS)

Ding Qing

2007-01-01

We prove that the integrable-nonintegrable discrete nonlinear Schroedinger equation (AL-DNLS) introduced by Cai, Bishop and Gronbech-Jensen (Phys. Rev. Lett. 72 591(1994)) is the discrete gauge equivalent to an integrable-nonintegrable discrete Heisenberg model from the geometric point of view. Then we study whether the transmission and bifurcation properties of the AL-DNLS equation are preserved under the action of discrete gauge transformations. Our results reveal that the transmission property of the AL-DNLS equation is completely preserved and the bifurcation property is conditionally preserved to those of the integrable-nonintegrable discrete Heisenberg model

CGBayesNets: conditional Gaussian Bayesian network learning and inference with mixed discrete and continuous data.

Science.gov (United States)

McGeachie, Michael J; Chang, Hsun-Hsien; Weiss, Scott T

2014-06-01

Bayesian Networks (BN) have been a popular predictive modeling formalism in bioinformatics, but their application in modern genomics has been slowed by an inability to cleanly handle domains with mixed discrete and continuous variables. Existing free BN software packages either discretize continuous variables, which can lead to information loss, or do not include inference routines, which makes prediction with the BN impossible. We present CGBayesNets, a BN package focused around prediction of a clinical phenotype from mixed discrete and continuous variables, which fills these gaps. CGBayesNets implements Bayesian likelihood and inference algorithms for the conditional Gaussian Bayesian network (CGBNs) formalism, one appropriate for predicting an outcome of interest from, e.g., multimodal genomic data. We provide four different network learning algorithms, each making a different tradeoff between computational cost and network likelihood. CGBayesNets provides a full suite of functions for model exploration and verification, including cross validation, bootstrapping, and AUC manipulation. We highlight several results obtained previously with CGBayesNets, including predictive models of wood properties from tree genomics, leukemia subtype classification from mixed genomic data, and robust prediction of intensive care unit mortality outcomes from metabolomic profiles. We also provide detailed example analysis on public metabolomic and gene expression datasets. CGBayesNets is implemented in MATLAB and available as MATLAB source code, under an Open Source license and anonymous download at http://www.cgbayesnets.com.

ADAM: analysis of discrete models of biological systems using computer algebra.

Science.gov (United States)

Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

2011-07-20

Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web

Discrete density of states

Energy Technology Data Exchange (ETDEWEB)

Aydin, Alhun; Sisman, Altug, E-mail: sismanal@itu.edu.tr

2016-03-22

By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

Homogenization of discrete media

International Nuclear Information System (INIS)

Pradel, F.; Sab, K.

1998-01-01

Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.)

Homogenization of discrete media

Energy Technology Data Exchange (ETDEWEB)

Pradel, F.; Sab, K. [CERAM-ENPC, Marne-la-Vallee (France)

1998-11-01

Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.) 7 refs.

A non-linear discrete transform for pattern recognition of discrete chaotic systems

International Nuclear Information System (INIS)

Karanikas, C.; Proios, G.

2003-01-01

It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter

A non-linear discrete transform for pattern recognition of discrete chaotic systems

CERN Document Server

Karanikas, C

2003-01-01

It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter.

A dynamic discretization method for reliability inference in Dynamic Bayesian Networks

International Nuclear Information System (INIS)

Zhu, Jiandao; Collette, Matthew

2015-01-01

The material and modeling parameters that drive structural reliability analysis for marine structures are subject to a significant uncertainty. This is especially true when time-dependent degradation mechanisms such as structural fatigue cracking are considered. Through inspection and monitoring, information such as crack location and size can be obtained to improve these parameters and the corresponding reliability estimates. Dynamic Bayesian Networks (DBNs) are a powerful and flexible tool to model dynamic system behavior and update reliability and uncertainty analysis with life cycle data for problems such as fatigue cracking. However, a central challenge in using DBNs is the need to discretize certain types of continuous random variables to perform network inference while still accurately tracking low-probability failure events. Most existing discretization methods focus on getting the overall shape of the distribution correct, with less emphasis on the tail region. Therefore, a novel scheme is presented specifically to estimate the likelihood of low-probability failure events. The scheme is an iterative algorithm which dynamically partitions the discretization intervals at each iteration. Through applications to two stochastic crack-growth example problems, the algorithm is shown to be robust and accurate. Comparisons are presented between the proposed approach and existing methods for the discretization problem. - Highlights: • A dynamic discretization method is developed for low-probability events in DBNs. • The method is compared to existing approaches on two crack growth problems. • The method is shown to improve on existing methods for low-probability events

A study of renal blood flow regulation using the discrete wavelet transform

Science.gov (United States)

Pavlov, Alexey N.; Pavlova, Olga N.; Mosekilde, Erik; Sosnovtseva, Olga V.

2010-02-01

In this paper we provide a way to distinguish features of renal blood flow autoregulation mechanisms in normotensive and hypertensive rats based on the discrete wavelet transform. Using the variability of the wavelet coefficients we show distinctions that occur between the normal and pathological states. A reduction of this variability in hypertension is observed on the microscopic level of the blood flow in efferent arteriole of single nephrons. This reduction is probably associated with higher flexibility of healthy cardiovascular system.

High dimensional model representation method for fuzzy structural dynamics

Science.gov (United States)

Adhikari, S.; Chowdhury, R.; Friswell, M. I.

2011-03-01

Uncertainty propagation in multi-parameter complex structures possess significant computational challenges. This paper investigates the possibility of using the High Dimensional Model Representation (HDMR) approach when uncertain system parameters are modeled using fuzzy variables. In particular, the application of HDMR is proposed for fuzzy finite element analysis of linear dynamical systems. The HDMR expansion is an efficient formulation for high-dimensional mapping in complex systems if the higher order variable correlations are weak, thereby permitting the input-output relationship behavior to be captured by the terms of low-order. The computational effort to determine the expansion functions using the α-cut method scales polynomically with the number of variables rather than exponentially. This logic is based on the fundamental assumption underlying the HDMR representation that only low-order correlations among the input variables are likely to have significant impacts upon the outputs for most high-dimensional complex systems. The proposed method is first illustrated for multi-parameter nonlinear mathematical test functions with fuzzy variables. The method is then integrated with a commercial finite element software (ADINA). Modal analysis of a simplified aircraft wing with fuzzy parameters has been used to illustrate the generality of the proposed approach. In the numerical examples, triangular membership functions have been used and the results have been validated against direct Monte Carlo simulations. It is shown that using the proposed HDMR approach, the number of finite element function calls can be reduced without significantly compromising the accuracy.

Discrete differential geometry. Consistency as integrability

OpenAIRE

Bobenko, Alexander I.; Suris, Yuri B.

2005-01-01

A new field of discrete differential geometry is presently emerging on the border between differential and discrete geometry. Whereas classical differential geometry investigates smooth geometric shapes (such as surfaces), and discrete geometry studies geometric shapes with finite number of elements (such as polyhedra), the discrete differential geometry aims at the development of discrete equivalents of notions and methods of smooth surface theory. Current interest in this field derives not ...

Advances in discrete differential geometry

CERN Document Server

2016-01-01

This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, ...

Linear representation of algebras with non-associative operations which are satisfy in the balanced functional equations

International Nuclear Information System (INIS)

Ehsani, Amir

2015-01-01

Algebras with a pair of non-associative binary operations (f, g) which are satisfy in the balanced quadratic functional equations with four object variables considered. First, we obtain a linear representation for the operations, of this kind of binary algebras (A,f,g), over an abelian group (A, +) and then we generalize the linear representation of operations, to an algebra (A,F) with non-associative binary operations which are satisfy in the balanced quadratic functional equations with four object variables. (paper)

Understanding decimal proportions: discrete representations, parallel access, and privileged processing of zero.

Science.gov (United States)

Varma, Sashank; Karl, Stacy R

2013-05-01

Much of the research on mathematical cognition has focused on the numbers 1, 2, 3, 4, 5, 6, 7, 8, and 9, with considerably less attention paid to more abstract number classes. The current research investigated how people understand decimal proportions--rational numbers between 0 and 1 expressed in the place-value symbol system. The results demonstrate that proportions are represented as discrete structures and processed in parallel. There was a semantic interference effect: When understanding a proportion expression (e.g., "0.29"), both the correct proportion referent (e.g., 0.29) and the incorrect natural number referent (e.g., 29) corresponding to the visually similar natural number expression (e.g., "29") are accessed in parallel, and when these referents lead to conflicting judgments, performance slows. There was also a syntactic interference effect, generalizing the unit-decade compatibility effect for natural numbers: When comparing two proportions, their tenths and hundredths components are processed in parallel, and when the different components lead to conflicting judgments, performance slows. The results also reveal that zero decimals--proportions ending in zero--serve multiple cognitive functions, including eliminating semantic interference and speeding processing. The current research also extends the distance, semantic congruence, and SNARC effects from natural numbers to decimal proportions. These findings inform how people understand the place-value symbol system, and the mental implementation of mathematical symbol systems more generally. Copyright © 2013 Elsevier Inc. All rights reserved.

Searching for Variables and Models to Investigate Mediators of Learning from Multiple Representations

Science.gov (United States)

Rau, Martina A.; Scheines, Richard

2012-01-01

Although learning from multiple representations has been shown to be effective in a variety of domains, little is known about the mechanisms by which it occurs. We analyzed log data on error-rate, hint-use, and time-spent obtained from two experiments with a Cognitive Tutor for fractions. The goal of the experiments was to compare learning from…

New Discrete Fibonacci Charge Pump Design, Evaluation and Measurement

Science.gov (United States)

Matoušek, David; Hospodka, Jiří; Šubrt, Ondřej

2017-06-01

This paper focuses on the practical aspects of the realisation of Dickson and Fibonacci charge pumps. Standard Dickson charge pump circuit solution and new Fibonacci charge pump implementation are compared. Both charge pumps were designed and then evaluated by LTspice XVII simulations and realised in a discrete form on printed circuit board (PCB). Finally, the key parameters as the output voltage, efficiency, rise time, variable power supply and clock frequency effects were measured.

Discrete elements method of neutron transport

International Nuclear Information System (INIS)

Mathews, K.A.

1988-01-01

In this paper a new neutron transport method, called discrete elements (L N ) is derived and compared to discrete ordinates methods, theoretically and by numerical experimentation. The discrete elements method is based on discretizing the Boltzmann equation over a set of elements of angle. The discrete elements method is shown to be more cost-effective than discrete ordinates, in terms of accuracy versus execution time and storage, for the cases tested. In a two-dimensional test case, a vacuum duct in a shield, the L N method is more consistently convergent toward a Monte Carlo benchmark solution

Geometric discretization of the multidimensional Dirac delta distribution - Application to the Poisson equation with singular source terms

Science.gov (United States)

Egan, Raphael; Gibou, Frédéric

2017-10-01

We present a discretization method for the multidimensional Dirac distribution. We show its applicability in the context of integration problems, and for discretizing Dirac-distributed source terms in Poisson equations with constant or variable diffusion coefficients. The discretization is cell-based and can thus be applied in a straightforward fashion to Quadtree/Octree grids. The method produces second-order accurate results for integration. Superlinear convergence is observed when it is used to model Dirac-distributed source terms in Poisson equations: the observed order of convergence is 2 or slightly smaller. The method is consistent with the discretization of Dirac delta distribution for codimension one surfaces presented in [1,2]. We present Quadtree/Octree construction procedures to preserve convergence and present various numerical examples, including multi-scale problems that are intractable with uniform grids.

A paradigm for discrete physics

International Nuclear Information System (INIS)

Noyes, H.P.; McGoveran, D.; Etter, T.; Manthey, M.J.; Gefwert, C.

1987-01-01

An example is outlined for constructing a discrete physics using as a starting point the insight from quantum physics that events are discrete, indivisible and non-local. Initial postulates are finiteness, discreteness, finite computability, absolute nonuniqueness (i.e., homogeneity in the absence of specific cause) and additivity

Discrete-Event Simulation

Directory of Open Access Journals (Sweden)

Prateek Sharma

2015-04-01

Full Text Available Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of events in time. So this paper aims at introducing about Discrete-Event Simulation and analyzing how it is beneficial to the real world systems.

Discrete breathers for a discrete nonlinear Schrödinger ring coupled to a central site.

Science.gov (United States)

Jason, Peter; Johansson, Magnus

2016-01-01

We examine the existence and properties of certain discrete breathers for a discrete nonlinear Schrödinger model where all but one site are placed in a ring and coupled to the additional central site. The discrete breathers we focus on are stationary solutions mainly localized on one or a few of the ring sites and possibly also the central site. By numerical methods, we trace out and study the continuous families the discrete breathers belong to. Our main result is the discovery of a split bifurcation at a critical value of the coupling between neighboring ring sites. Below this critical value, families form closed loops in a certain parameter space, implying that discrete breathers with and without central-site occupation belong to the same family. Above the split bifurcation the families split up into several separate ones, which bifurcate with solutions with constant ring amplitudes. For symmetry reasons, the families have different properties below the split bifurcation for even and odd numbers of sites. It is also determined under which conditions the discrete breathers are linearly stable. The dynamics of some simpler initial conditions that approximate the discrete breathers are also studied and the parameter regimes where the dynamics remain localized close to the initially excited ring site are related to the linear stability of the exact discrete breathers.

Less Conservative ℋ∞ Fuzzy Control for Discrete-Time Takagi-Sugeno Systems

Directory of Open Access Journals (Sweden)

Leonardo Amaral Mozelli

2011-01-01

Full Text Available New analysis and control design conditions of discrete-time fuzzy systems are proposed. Using fuzzy Lyapunov's functions and introducing slack variables, less conservative conditions are obtained. The controller guarantees system stabilization and ℋ∞ performance. Numerical tests and a practical experiment in Chua's circuit are presented to show the effectiveness.

Discrete dynamics versus analytic dynamics

DEFF Research Database (Denmark)

Toxværd, Søren

2014-01-01

For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent...... of such an analytic analogy, exists an exact hidden energy invariance E * for VA dynamics. The fact that the discrete VA dynamics has the same invariances as Newtonian dynamics raises the question, which of the formulations that are correct, or alternatively, the most appropriate formulation of classical dynamics....... In this context the relation between the discrete VA dynamics and the (general) discrete dynamics investigated by Lee [Phys. Lett. B122, 217 (1983)] is presented and discussed....

Flavored gauge mediation with discrete non-Abelian symmetries

Science.gov (United States)

Everett, Lisa L.; Garon, Todd S.

2018-05-01

We explore the model building and phenomenology of flavored gauge-mediation models of supersymmetry breaking in which the electroweak Higgs doublets and the S U (2 ) messenger doublets are connected by a discrete non-Abelian symmetry. The embedding of the Higgs and messenger fields into representations of this non-Abelian Higgs-messenger symmetry results in specific relations between the Standard Model Yukawa couplings and the messenger-matter Yukawa interactions. Taking the concrete example of an S3 Higgs-messenger symmetry, we demonstrate that, while the minimal implementation of this scenario suffers from a severe μ /Bμ problem that is well known from ordinary gauge mediation, expanding the Higgs-messenger field content allows for the possibility that μ and Bμ can be separately tuned, allowing for the possibility of phenomenologically viable models of the soft supersymmetry-breaking terms. We construct toy examples of this type that are consistent with the observed 125 GeV Higgs boson mass.

Analysis of Discrete Mittag - Leffler Functions

Directory of Open Access Journals (Sweden)

N. Shobanadevi

2015-03-01

Full Text Available Discrete Mittag - Leffler functions play a major role in the development of the theory of discrete fractional calculus. In the present article, we analyze qualitative properties of discrete Mittag - Leffler functions and establish sufficient conditions for convergence, oscillation and summability of the infinite series associated with discrete Mittag - Leffler functions.

Difference Discrete Variational Principles, Euler-Lagrange Cohomology and Symplectic, Multisymplectic Structures I: Difference Discrete Variational Principle

Institute of Scientific and Technical Information of China (English)

GUO Han-Ying,; LI Yu-Qi; WU Ke1; WANG Shi-Kun

2002-01-01

In this first paper of a series, we study the difference discrete variational principle in the framework of multi-parameter differential approach by regarding the forward difference as an entire geometric object in view of noncommutative differential geometry. Regarding the difference as an entire geometric object, the difference discrete version of Legendre transformation can be introduced. By virtue of this variational principle, we can discretely deal with the variation problems in both the Lagrangian and Hamiltonian formalisms to get difference discrete Euler-Lagrange equations and canonical ones for the difference discrete versions of the classical mechanics and classical field theory.

Stepwise latent class models for explaining group-level putcomes using discrete individual-level predictors

NARCIS (Netherlands)

Bennink, Margot; Croon, M.A.; Vermunt, J.K.

2015-01-01

Explaining group-level outcomes from individual-level predictors requires aggregating the individual-level scores to the group level and correcting the group-level estimates for measurement errors in the aggregated scores. However, for discrete variables it is not clear how to perform the

A network of spiking neurons for computing sparse representations in an energy-efficient way.

Science.gov (United States)

Hu, Tao; Genkin, Alexander; Chklovskii, Dmitri B

2012-11-01

Computing sparse redundant representations is an important problem in both applied mathematics and neuroscience. In many applications, this problem must be solved in an energy-efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating by low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, the operation is equivalent to a network of integrate-and-fire neurons, suggesting that HDA may serve as a model of neural computation. We show that the numerical performance of HDA is on par with existing algorithms. In the asymptotic regime, the representation error of HDA decays with time, t, as 1/t. HDA is stable against time-varying noise; specifically, the representation error decays as 1/√t for gaussian white noise.

Aspects of a representation of quantum theory in terms of classical probability theory by means of integration in Hilbert space

International Nuclear Information System (INIS)

Bach, A.

1981-01-01

A representation of quantum mechanics in terms of classical probability theory by means of integration in Hilbert space is discussed. This formal hidden-variables representation is analysed in the context of impossibility proofs concerning hidden-variables theories. The structural analogy of this formulation of quantum theory with classical statistical mechanics is used to elucidate the difference between classical mechanics and quantum mechanics. (author)

Discrete mechanics

CERN Document Server

Caltagirone, Jean-Paul

2014-01-01

This book presents the fundamental principles of mechanics to re-establish the equations of Discrete Mechanics. It introduces physics and thermodynamics associated to the physical modeling.  The development and the complementarity of sciences lead to review today the old concepts that were the basis for the development of continuum mechanics. The differential geometry is used to review the conservation laws of mechanics. For instance, this formalism requires a different location of vector and scalar quantities in space. The equations of Discrete Mechanics form a system of equations where the H

Discrete mechanics

International Nuclear Information System (INIS)

Lee, T.D.

1985-01-01

This paper reviews the role of time throughout all phases of mechanics: classical mechanics, non-relativistic quantum mechanics, and relativistic quantum theory. As an example of the relativistic quantum field theory, the case of a massless scalar field interacting with an arbitrary external current is discussed. The comparison between the new discrete theory and the usual continuum formalism is presented. An example is given of a two-dimensional random lattice and its duel. The author notes that there is no evidence that the discrete mechanics is more appropriate than the usual continuum mechanics

Solution of the time-dependent Schrodinger equation for highly symmetric potentials

Czech Academy of Sciences Publication Activity Database

Schmidt, B.; Kaprálová-Žďánská, Petra Ruth

2000-01-01

Roč. 127, 2-3 (2000), s. 290-308 ISSN 0010-4655 Institutional research plan: CEZ:AV0Z4040901 Keywords : DISCRETE VARIABLE REPRESENTATIONS * FILTER DIAGONALIZATION * MOLECULAR-DYNAMICS Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 1.090, year: 2000

Synchronization Techniques in Parallel Discrete Event Simulation

OpenAIRE

Lindén, Jonatan

2018-01-01

Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed. In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent ...

Orthogonal polynomials derived from the tridiagonal representation approach

Science.gov (United States)

Alhaidari, A. D.

2018-01-01

The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials whose properties give the structure and dynamics of the corresponding physical system. For a certain range of parameters, one of these polynomials has a mix of continuous and discrete spectra making it suitable for describing physical systems with both scattering and bound states. In this work, we define these polynomials by their recursion relations and highlight some of their properties using numerical means. Due to the prime significance of these polynomials in physics, we hope that our short expose will encourage experts in the field of orthogonal polynomials to study them and derive their properties (weight functions, generating functions, asymptotics, orthogonality relations, zeros, etc.) analytically.

New Discrete Fibonacci Charge Pump Design, Evaluation and Measurement

Directory of Open Access Journals (Sweden)

Matoušek David

2017-06-01

Full Text Available This paper focuses on the practical aspects of the realisation of Dickson and Fibonacci charge pumps. Standard Dickson charge pump circuit solution and new Fibonacci charge pump implementation are compared. Both charge pumps were designed and then evaluated by LTspice XVII simulations and realised in a discrete form on printed circuit board (PCB. Finally, the key parameters as the output voltage, efficiency, rise time, variable power supply and clock frequency effects were measured.

Discrete gauge symmetries in discrete MSSM-like orientifolds

International Nuclear Information System (INIS)

Ibáñez, L.E.; Schellekens, A.N.; Uranga, A.M.

2012-01-01

Motivated by the necessity of discrete Z N symmetries in the MSSM to insure baryon stability, we study the origin of discrete gauge symmetries from open string sector U(1)'s in orientifolds based on rational conformal field theory. By means of an explicit construction, we find an integral basis for the couplings of axions and U(1) factors for all simple current MIPFs and orientifolds of all 168 Gepner models, a total of 32 990 distinct cases. We discuss how the presence of discrete symmetries surviving as a subgroup of broken U(1)'s can be derived using this basis. We apply this procedure to models with MSSM chiral spectrum, concretely to all known U(3)×U(2)×U(1)×U(1) and U(3)×Sp(2)×U(1)×U(1) configurations with chiral bi-fundamentals, but no chiral tensors, as well as some SU(5) GUT models. We find examples of models with Z 2 (R-parity) and Z 3 symmetries that forbid certain B and/or L violating MSSM couplings. Their presence is however relatively rare, at the level of a few percent of all cases.

Boltzmann-Fokker-Planck calculations using standard discrete-ordinates codes

International Nuclear Information System (INIS)

Morel, J.E.

1987-01-01

The Boltzmann-Fokker-Planck (BFP) equation can be used to describe both neutral and charged-particle transport. Over the past several years, the author and several collaborators have developed methods for representing Fokker-Planck operators with standard multigroup-Legendre cross-section data. When these data are input to a standard S/sub n/ code such as ONETRAN, the code actually solves the Boltzmann-Fokker-Planck equation rather than the Boltzmann equation. This is achieved wihout any modification to the S/sub n/ codes. Because BFP calculations can be more demanding from a numerical viewpoint than standard neutronics calculations, we have found it useful to implement new quadrature methods ad convergence acceleration methods in the standard discrete-ordinates code, ONETRAN. We discuss our BFP cross-section representation techniques, our improved quadrature and acceleration techniques, and present results from BFP coupled electron-photon transport calculations performed with ONETRAN. 19 refs., 7 figs

Social Representations of Intelligence

Directory of Open Access Journals (Sweden)

Elena Zubieta

2016-02-01

Full Text Available The article stresses the relationship between Explicit and Implicit theories of Intelligence. Following the line of common sense epistemology and the theory of Social Representations, a study was carried out in order to analyze naive’s explanations about Intelligence Definitions. Based on Mugny & Carugati (1989 research, a self-administered questionnaire was designed and filled in by 286 subjects. Results are congruent with the main hyphotesis postulated: A general overlap between explicit and implicit theories showed up. According to the results Intelligence appears as both, a social attribute related to social adaptation and as a concept defined in relation with contextual variables similar to expert’s current discourses. Nevertheless, conceptions based on “gifted ideology” still are present stressing the main axes of Intelligence debate: biological and sociological determinism. In the same sense, unfamiliarity and social identity are reaffirmed as organizing principles of social representation. The distance with the object -measured as the belief in intelligence differences as a solve/non solve problem- and the level of implication with the topic -teachers/no teachers- appear as discriminating elements at the moment of supporting specific dimensions. 

A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

Science.gov (United States)

Rameshkumar, K.; Rajendran, C.

2018-02-01

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

Quantum Numbers and the Eigenfunction Approach to Obtain Symmetry Adapted Functions for Discrete Symmetries

Directory of Open Access Journals (Sweden)

Renato Lemus

2012-11-01

Full Text Available The eigenfunction approach used for discrete symmetries is deduced from the concept of quantum numbers. We show that the irreducible representations (irreps associated with the eigenfunctions are indeed a shorthand notation for the set of eigenvalues of the class operators (character table. The need of a canonical chain of groups to establish a complete set of commuting operators is emphasized. This analysis allows us to establish in natural form the connection between the quantum numbers and the eigenfunction method proposed by J.Q. Chen to obtain symmetry adapted functions. We then proceed to present a friendly version of the eigenfunction method to project functions.

A roadmap for improving the representation of photosynthesis in Earth system models.

Science.gov (United States)

Rogers, Alistair; Medlyn, Belinda E; Dukes, Jeffrey S; Bonan, Gordon; von Caemmerer, Susanne; Dietze, Michael C; Kattge, Jens; Leakey, Andrew D B; Mercado, Lina M; Niinemets, Ülo; Prentice, I Colin; Serbin, Shawn P; Sitch, Stephen; Way, Danielle A; Zaehle, Sönke

2017-01-01

Accurate representation of photosynthesis in terrestrial biosphere models (TBMs) is essential for robust projections of global change. However, current representations vary markedly between TBMs, contributing uncertainty to projections of global carbon fluxes. Here we compared the representation of photosynthesis in seven TBMs by examining leaf and canopy level responses of photosynthetic CO 2 assimilation (A) to key environmental variables: light, temperature, CO 2 concentration, vapor pressure deficit and soil water content. We identified research areas where limited process knowledge prevents inclusion of physiological phenomena in current TBMs and research areas where data are urgently needed for model parameterization or evaluation. We provide a roadmap for new science needed to improve the representation of photosynthesis in the next generation of terrestrial biosphere and Earth system models. No claim to original US Government works New Phytologist © 2016 New Phytologist Trust.

Finite Discrete Gabor Analysis

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2007-01-01

frequency bands at certain times. Gabor theory can be formulated for both functions on the real line and for discrete signals of finite length. The two theories are largely the same because many aspects come from the same underlying theory of locally compact Abelian groups. The two types of Gabor systems...... can also be related by sampling and periodization. This thesis extends on this theory by showing new results for window construction. It also provides a discussion of the problems associated to discrete Gabor bases. The sampling and periodization connection is handy because it allows Gabor systems...... on the real line to be well approximated by finite and discrete Gabor frames. This method of approximation is especially attractive because efficient numerical methods exists for doing computations with finite, discrete Gabor systems. This thesis presents new algorithms for the efficient computation of finite...

Adaptive Discrete Hypergraph Matching.

Science.gov (United States)

Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

2018-02-01

This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

A Model of Representational Spaces in Human Cortex.

Science.gov (United States)

Guntupalli, J Swaroop; Hanke, Michael; Halchenko, Yaroslav O; Connolly, Andrew C; Ramadge, Peter J; Haxby, James V

2016-06-01

Current models of the functional architecture of human cortex emphasize areas that capture coarse-scale features of cortical topography but provide no account for population responses that encode information in fine-scale patterns of activity. Here, we present a linear model of shared representational spaces in human cortex that captures fine-scale distinctions among population responses with response-tuning basis functions that are common across brains and models cortical patterns of neural responses with individual-specific topographic basis functions. We derive a common model space for the whole cortex using a new algorithm, searchlight hyperalignment, and complex, dynamic stimuli that provide a broad sampling of visual, auditory, and social percepts. The model aligns representations across brains in occipital, temporal, parietal, and prefrontal cortices, as shown by between-subject multivariate pattern classification and intersubject correlation of representational geometry, indicating that structural principles for shared neural representations apply across widely divergent domains of information. The model provides a rigorous account for individual variability of well-known coarse-scale topographies, such as retinotopy and category selectivity, and goes further to account for fine-scale patterns that are multiplexed with coarse-scale topographies and carry finer distinctions. © The Author 2016. Published by Oxford University Press.

Principles of discrete time mechanics

CERN Document Server

Jaroszkiewicz, George

2014-01-01

Could time be discrete on some unimaginably small scale? Exploring the idea in depth, this unique introduction to discrete time mechanics systematically builds the theory up from scratch, beginning with the historical, physical and mathematical background to the chronon hypothesis. Covering classical and quantum discrete time mechanics, this book presents all the tools needed to formulate and develop applications of discrete time mechanics in a number of areas, including spreadsheet mechanics, classical and quantum register mechanics, and classical and quantum mechanics and field theories. A consistent emphasis on contextuality and the observer-system relationship is maintained throughout.

Discrete Calculus by Analogy

CERN Document Server

Izadi, F A; Bagirov, G

2009-01-01

With its origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. The topics covered here usually arise in many branches of science and technology, especially in discrete mathematics, numerical analysis, statistics and probability theory as well as in electrical engineering, but our viewpoint here is that these topics belong to a much more general realm of mathematics; namely calculus and differential equations because of the remarkable analogy of the subject to this branch of mathemati

Discrete integrable systems and hodograph transformations arising from motions of discrete plane curves

International Nuclear Information System (INIS)

Feng Baofeng; Maruno, Ken-ichi; Inoguchi, Jun-ichi; Kajiwara, Kenji; Ohta, Yasuhiro

2011-01-01

We consider integrable discretizations of some soliton equations associated with the motions of plane curves: the Wadati-Konno-Ichikawa elastic beam equation, the complex Dym equation and the short pulse equation. They are related to the modified KdV or the sine-Gordon equations by the hodograph transformations. Based on the observation that the hodograph transformations are regarded as the Euler-Lagrange transformations of the curve motions, we construct the discrete analogues of the hodograph transformations, which yield integrable discretizations of those soliton equations. (paper)

Discrete Haar transform and protein structure.

Science.gov (United States)

Morosetti, S

1997-12-01

The discrete Haar transform of the sequence of the backbone dihedral angles (phi and psi) was performed over a set of X-ray protein structures of high resolution from the Brookhaven Protein Data Bank. Afterwards, the new dihedral angles were calculated by the inverse transform, using a growing number of Haar functions, from the lower to the higher degree. New structures were obtained using these dihedral angles, with standard values for bond lengths and angles, and with omega = 0 degree. The reconstructed structures were compared with the experimental ones, and analyzed by visual inspection and statistical analysis. When half of the Haar coefficients were used, all the reconstructed structures were not yet collapsed to a tertiary folding, but they showed yet realized most of the secondary motifs. These results indicate a substantial separation of structural information in the space of Haar transform, with the secondary structural information mainly present in the Haar coefficients of lower degrees, and the tertiary one present in the higher degree coefficients. Because of this separation, the representation of the folded structures in the space of Haar transform seems a promising candidate to encompass the problem of premature convergence in genetic algorithms.

Modern approaches to discrete curvature

CERN Document Server

Romon, Pascal

2017-01-01

 This book provides a valuable glimpse into discrete curvature, a rich new field of research which blends discrete mathematics, differential geometry, probability and computer graphics. It includes a vast collection of ideas and tools which will offer something new to all interested readers. Discrete geometry has arisen as much as a theoretical development as in response to unforeseen challenges coming from applications. Discrete and continuous geometries have turned out to be intimately connected. Discrete curvature is the key concept connecting them through many bridges in numerous fields: metric spaces, Riemannian and Euclidean geometries, geometric measure theory, topology, partial differential equations, calculus of variations, gradient flows, asymptotic analysis, probability, harmonic analysis, graph theory, etc. In spite of its crucial importance both in theoretical mathematics and in applications, up to now, almost no books have provided a coherent outlook on this emerging field.

The Representation of Older People in East Asian Television Advertisements.

Science.gov (United States)

Prieler, Michael; Ivanov, Alex; Hagiwara, Shigeru

2017-06-01

In this study, 432 television advertisements from Hong Kong, Japan, and South Korea were analyzed to determine their representations of older people. Findings demonstrate that in East Asian advertisements, older people are highly underrepresented, appear in major roles, mostly alongside younger people, and older men clearly outnumber older women. The other variables investigated (i.e., setting and product categories) led to no conclusive findings for the three societies. In short, our study, employing ethnolinguistic vitality theory to analyze television advertisements, demonstrates how East Asian societies greatly marginalize older people. Potential effects of such representations are discussed using social cognitive theory and cultivation theory.

An Arbitrary Lagrangian-Eulerian Discretization of MHD on 3D Unstructured Grids

Energy Technology Data Exchange (ETDEWEB)

Rieben, R N; White, D A; Wallin, B K; Solberg, J M

2006-06-12

We present an arbitrary Lagrangian-Eulerian (ALE) discretization of the equations of resistive magnetohydrodynamics (MHD) on unstructured hexahedral grids. The method is formulated using an operator-split approach with three distinct phases: electromagnetic diffusion, Lagrangian motion, and Eulerian advection. The resistive magnetic dynamo equation is discretized using a compatible mixed finite element method with a 2nd order accurate implicit time differencing scheme which preserves the divergence-free nature of the magnetic field. At each discrete time step, electromagnetic force and heat terms are calculated and coupled to the hydrodynamic equations to compute the Lagrangian motion of the conducting materials. By virtue of the compatible discretization method used, the invariants of Lagrangian MHD motion are preserved in a discrete sense. When the Lagrangian motion of the mesh causes significant distortion, that distortion is corrected with a relaxation of the mesh, followed by a 2nd order monotonic remap of the electromagnetic state variables. The remap is equivalent to Eulerian advection of the magnetic flux density with a fictitious mesh relaxation velocity. The magnetic advection is performed using a novel variant of constrained transport (CT) that is valid for unstructured hexahedral grids with arbitrary mesh velocities. The advection method maintains the divergence free nature of the magnetic field and is second order accurate in regions where the solution is sufficiently smooth. For regions in which the magnetic field is discontinuous (e.g. MHD shocks) the method is limited using a novel variant of algebraic flux correction (AFC) which is local extremum diminishing (LED) and divergence preserving. Finally, we verify each stage of the discretization via a set of numerical experiments.

Discrete Teaching-learning-based optimization Algorithm for Traveling Salesman Problems

Directory of Open Access Journals (Sweden)

Wu Lehui

2017-01-01

Full Text Available In this paper, a discrete variant of TLBO (DTLBO is proposed for solving the traveling salesman problem (TSP. In the proposed method, an effective learner representation scheme is redefined based on the characteristics of TSP problem. Moreover, all learners are randomly divided into several sub-swarms with equal amounts of learners so as to increase the diversity of population and reduce the probability of being trapped in local optimum. In each sub-swarm, the new positions of learners in the teaching phase and the learning phase are generated by the crossover operation, the legality detection and mutation operation, and then the offspring learners are determined based on greedy selection. Finally, to verify the performance of the proposed algorithm, benchmark TSP problems are examined and the results indicate that DTLBO is effective compared with other algorithms used for TSP problems.

Noether symmetries of discrete mechanico–electrical systems

International Nuclear Information System (INIS)

Fu Jingli; Xie Fengping; Chen Benyong

2008-01-01

This paper focuses on studying Noether symmetries and conservation laws of the discrete mechanico-electrical systems with the nonconservative and the dissipative forces. Based on the invariance of discrete Hamilton action of the systems under the infinitesimal transformation with respect to the generalized coordinates, the generalized electrical quantities and time, it presents the discrete analogue of variational principle, the discrete analogue of Lagrange–Maxwell equations, the discrete analogue of Noether theorems for Lagrange–Maxwell and Lagrange mechanico-electrical systems. Also, the discrete Noether operator identity and the discrete Noether-type conservation laws are obtained for these systems. An actual example is given to illustrate these results. (general)

Evidence for a time-invariant phase variable in human ankle control.

Directory of Open Access Journals (Sweden)

Robert D Gregg

Full Text Available Human locomotion is a rhythmic task in which patterns of muscle activity are modulated by state-dependent feedback to accommodate perturbations. Two popular theories have been proposed for the underlying embodiment of phase in the human pattern generator: a time-dependent internal representation or a time-invariant feedback representation (i.e., reflex mechanisms. In either case the neuromuscular system must update or represent the phase of locomotor patterns based on the system state, which can include measurements of hundreds of variables. However, a much simpler representation of phase has emerged in recent designs for legged robots, which control joint patterns as functions of a single monotonic mechanical variable, termed a phase variable. We propose that human joint patterns may similarly depend on a physical phase variable, specifically the heel-to-toe movement of the Center of Pressure under the foot. We found that when the ankle is unexpectedly rotated to a position it would have encountered later in the step, the Center of Pressure also shifts forward to the corresponding later position, and the remaining portion of the gait pattern ensues. This phase shift suggests that the progression of the stance ankle is controlled by a biomechanical phase variable, motivating future investigations of phase variables in human locomotor control.

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.

Spectral collocation method with a flexible angular discretization scheme for radiative transfer in multi-layer graded index medium

Science.gov (United States)

Wei, Linyang; Qi, Hong; Sun, Jianping; Ren, Yatao; Ruan, Liming

2017-05-01

The spectral collocation method (SCM) is employed to solve the radiative transfer in multi-layer semitransparent medium with graded index. A new flexible angular discretization scheme is employed to discretize the solid angle domain freely to overcome the limit of the number of discrete radiative direction when adopting traditional SN discrete ordinate scheme. Three radial basis function interpolation approaches, named as multi-quadric (MQ), inverse multi-quadric (IMQ) and inverse quadratic (IQ) interpolation, are employed to couple the radiative intensity at the interface between two adjacent layers and numerical experiments show that MQ interpolation has the highest accuracy and best stability. Variable radiative transfer problems in double-layer semitransparent media with different thermophysical properties are investigated and the influence of these thermophysical properties on the radiative transfer procedure in double-layer semitransparent media is also analyzed. All the simulated results show that the present SCM with the new angular discretization scheme can predict the radiative transfer in multi-layer semitransparent medium with graded index efficiently and accurately.

A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

DEFF Research Database (Denmark)

Stolpe, Mathias; Bendsøe, Martin P.

2007-01-01

This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

Factorizations and physical representations

International Nuclear Information System (INIS)

Revzen, M; Khanna, F C; Mann, A; Zak, J

2006-01-01

A Hilbert space in M dimensions is shown explicitly to accommodate representations that reflect the decomposition of M into prime numbers. Representations that exhibit the factorization of M into two relatively prime numbers: the kq representation (Zak J 1970 Phys. Today 23 51), and related representations termed q 1 q 2 representations (together with their conjugates) are analysed, as well as a representation that exhibits the complete factorization of M. In this latter representation each quantum number varies in a subspace that is associated with one of the prime numbers that make up M

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

Energy Technology Data Exchange (ETDEWEB)

Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com [Laboratoire de Probabilités et Modèles Aléatoires, CNRS, UMR 7599, Université Paris Diderot (France)

2016-12-15

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

International Nuclear Information System (INIS)

Pham, Huyên; Wei, Xiaoli

2016-01-01

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

Elementary exact calculations of degree growth and entropy for discrete equations.

Science.gov (United States)

Halburd, R G

2017-05-01

Second-order discrete equations are studied over the field of rational functions [Formula: see text], where z is a variable not appearing in the equation. The exact degree of each iterate as a function of z can be calculated easily using the standard calculations that arise in singularity confinement analysis, even when the singularities are not confined. This produces elementary yet rigorous entropy calculations.

Discrete Localized States and Localization Dynamics in Discrete Nonlinear Schrödinger Equations

DEFF Research Database (Denmark)

Christiansen, Peter Leth; Gaididei, Yu.B.; Mezentsev, V.K.

1996-01-01

Dynamics of two-dimensional discrete structures is studied in the framework of the generalized two-dimensional discrete nonlinear Schrodinger equation. The nonlinear coupling in the form of the Ablowitz-Ladik nonlinearity is taken into account. Stability properties of the stationary solutions...

Topology and layout optimization of discrete and continuum structures

Science.gov (United States)

Bendsoe, Martin P.; Kikuchi, Noboru

1993-01-01

The basic features of the ground structure method for truss structure an continuum problems are described. Problems with a large number of potential structural elements are considered using the compliance of the structure as the objective function. The design problem is the minimization of compliance for a given structural weight, and the design variables for truss problems are the cross-sectional areas of the individual truss members, while for continuum problems they are the variable densities of material in each of the elements of the FEM discretization. It is shown how homogenization theory can be applied to provide a relation between material density and the effective material properties of a periodic medium with a known microstructure of material and voids.

Analysis of graphical representation among freshmen in undergraduate physics laboratory

Science.gov (United States)

Adam, A. S.; Anggrayni, S.; Kholiq, A.; Putri, N. P.; Suprapto, N.

2018-03-01

Physics concept understanding is the importance of the physics laboratory among freshmen in the undergraduate program. These include the ability to interpret the meaning of the graph to make an appropriate conclusion. This particular study analyses the graphical representation among freshmen in an undergraduate physics laboratory. This study uses empirical study with quantitative approach. The graphical representation covers 3 physics topics: velocity of sound, simple pendulum and spring system. The result of this study shows most of the freshmen (90% of the sample) make a graph based on the data from physics laboratory. It means the transferring process of raw data which illustrated in the table to physics graph can be categorised. Most of the Freshmen use the proportional principle of the variable in graph analysis. However, Freshmen can't make the graph in an appropriate variable to gain more information and can't analyse the graph to obtain the useful information from the slope.

The Effect of Visual Variability on the Learning of Academic Concepts.

Science.gov (United States)

Bourgoyne, Ashley; Alt, Mary

2017-06-10

The purpose of this study was to identify effects of variability of visual input on development of conceptual representations of academic concepts for college-age students with normal language (NL) and those with language-learning disabilities (LLD). Students with NL (n = 11) and LLD (n = 11) participated in a computer-based training for introductory biology course concepts. Participants were trained on half the concepts under a low-variability condition and half under a high-variability condition. Participants completed a posttest in which they were asked to identify and rate the accuracy of novel and trained visual representations of the concepts. We performed separate repeated measures analyses of variance to examine the accuracy of identification and ratings. Participants were equally accurate on trained and novel items in the high-variability condition, but were less accurate on novel items only in the low-variability condition. The LLD group showed the same pattern as the NL group; they were just less accurate. Results indicated that high-variability visual input may facilitate the acquisition of academic concepts in college students with NL and LLD. High-variability visual input may be especially beneficial for generalization to novel representations of concepts. Implicit learning methods may be harnessed by college courses to provide students with basic conceptual knowledge when they are entering courses or beginning new units.

Analysis of graphic representation ability in oscillation phenomena

Science.gov (United States)

Dewi, A. R. C.; Putra, N. M. D.; Susilo

2018-03-01

This study aims to investigates how the ability of students to representation graphs of linear function and harmonic function in understanding of oscillation phenomena. Method of this research used mix methods with concurrent embedded design. The subjects were 35 students of class X MIA 3 SMA 1 Bae Kudus. Data collection through giving essays and interviews that lead to the ability to read and draw graphs in material of Hooke's law and oscillation characteristics. The results of study showed that most of the students had difficulty in drawing graph of linear function and harmonic function of deviation with time. Students’ difficulties in drawing the graph of linear function is the difficulty of analyzing the variable data needed in graph making, confusing the placement of variable data on the coordinate axis, the difficulty of determining the scale interval on each coordinate, and the variation of how to connect the dots forming the graph. Students’ difficulties in representing the graph of harmonic function is to determine the time interval of sine harmonic function, the difficulty to determine the initial deviation point of the drawing, the difficulty of finding the deviation equation of the case of oscillation characteristics and the confusion to different among the maximum deviation (amplitude) with the length of the spring caused the load.Complexity of the characteristic attributes of the oscillation phenomena graphs, students tend to show less well the ability of graphical representation of harmonic functions than the performance of the graphical representation of linear functions.

Neural Network Based Finite-Time Stabilization for Discrete-Time Markov Jump Nonlinear Systems with Time Delays

Directory of Open Access Journals (Sweden)

Fei Chen

2013-01-01

Full Text Available This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabilization of the closed-loop system. A numerical example is illustrated to verify the efficiency of the proposed technique.

Distinguishing Representations as Origin and Representations as Input: Roles for Individual Cells

Directory of Open Access Journals (Sweden)

Jonathan C.W. Edwards

2016-09-01

Full Text Available It is widely perceived that there is a problem in giving a naturalistic account of mental representation that deals adequately with meaning, interpretation or significance (semantic content. It is suggested here that this problem may arise partly from the conflation of two vernacular senses of representation: representation-as-origin and representation-as-input. The flash of a neon sign may in one sense represent a popular drink, but to function as representation it must provide an input to a ‘consumer’ in the street. The arguments presented draw on two principles – the neuron doctrine and the need for a venue for ‘presentation’ or ‘reception’ of a representation at a specified site, consistent with the locality principle. It is also argued that domains of representation cannot be defined by signal traffic, since they can be expected to include ‘null’ elements based on non-firing cells. In this analysis, mental representations-as-origin are distributed patterns of cell firing. Each firing cell is given semantic value in its own right - some form of atomic propositional significance – since different axonal branches may contribute to integration with different populations of signals at different downstream sites. Representations-as-input are patterns of local co-arrival of signals in the form of synaptic potentials in dendrites. Meaning then draws on the relationships between active and null inputs, forming ‘scenarios’ comprising a molecular combination of ‘premises’ from which a new output with atomic propositional significance is generated. In both types of representation, meaning, interpretation or significance pivots on events in an individual cell. (This analysis only applies to ‘occurrent’ representations based on current neural activity. The concept of representations-as-input emphasises the need for a ‘consumer’ of a representation and the dependence of meaning on the co-relationships involved in an

A combined model of sensory and cognitive representations underlying tonal expectations in music: from audio signals to behavior.

Science.gov (United States)

Collins, Tom; Tillmann, Barbara; Barrett, Frederick S; Delbé, Charles; Janata, Petr

2014-01-01

Listeners' expectations for melodies and harmonies in tonal music are perhaps the most studied aspect of music cognition. Long debated has been whether faster response times (RTs) to more strongly primed events (in a music theoretic sense) are driven by sensory or cognitive mechanisms, such as repetition of sensory information or activation of cognitive schemata that reflect learned tonal knowledge, respectively. We analyzed over 300 stimuli from 7 priming experiments comprising a broad range of musical material, using a model that transforms raw audio signals through a series of plausible physiological and psychological representations spanning a sensory-cognitive continuum. We show that RTs are modeled, in part, by information in periodicity pitch distributions, chroma vectors, and activations of tonal space--a representation on a toroidal surface of the major/minor key relationships in Western tonal music. We show that in tonal space, melodies are grouped by their tonal rather than timbral properties, whereas the reverse is true for the periodicity pitch representation. While tonal space variables explained more of the variation in RTs than did periodicity pitch variables, suggesting a greater contribution of cognitive influences to tonal expectation, a stepwise selection model contained variables from both representations and successfully explained the pattern of RTs across stimulus categories in 4 of the 7 experiments. The addition of closure--a cognitive representation of a specific syntactic relationship--succeeded in explaining results from all 7 experiments. We conclude that multiple representational stages along a sensory-cognitive continuum combine to shape tonal expectations in music. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Observability of discretized partial differential equations

Science.gov (United States)

Cohn, Stephen E.; Dee, Dick P.

1988-01-01

It is shown that complete observability of the discrete model used to assimilate data from a linear partial differential equation (PDE) system is necessary and sufficient for asymptotic stability of the data assimilation process. The observability theory for discrete systems is reviewed and applied to obtain simple observability tests for discretized constant-coefficient PDEs. Examples are used to show how numerical dispersion can result in discrete dynamics with multiple eigenvalues, thereby detracting from observability.

Reliability in the Location of Hindlimb Motor Representations in Fischer-344 Rats

Science.gov (United States)

Frost, Shawn B.; Iliakova, Maria; Dunham, Caleb; Barbay, Scott; Arnold, Paul; Nudo, Randolph J.

2014-01-01

Object The purpose of the present study was to determine the feasibility of using a common laboratory rat strain for locating cortical motor representations of the hindlimb reliably. Methods Intracortical Microstimulation (ICMS) techniques were used to derive detailed maps of the hindlimb motor representations in six adult Fischer-344 rats. Results The organization of the hindlimb movement representation, while variable across individuals in topographic detail, displayed several commonalities. The hindlimb representation was positioned posterior to the forelimb motor representation and postero-lateral to the motor trunk representation. The areal extent of the hindlimb representation across the cortical surface averaged 2.00 +/− 0.50 mm2. Superimposing individual maps revealed an overlapping area measuring 0.35 mm2, indicating that the location of the hindlimb representation can be predicted reliably based on stereotactic coordinates. Across the sample of rats, the hindlimb representation was found 1.25–3.75 mm posterior to Bregma, with an average center location ~ 2.6 mm posterior to Bregma. Likewise, the hindlimb representation was found 1–3.25 mm lateral to the midline, with an average center location ~ 2 mm lateral to midline. Conclusions The location of the cortical hindlimb motor representation in Fischer-344 rats can be reliably located based on its stereotactic position posterior to Bregma and lateral to the longitudinal skull suture at midline. The ability to accurately predict the cortical localization of functional hindlimb territories in a rodent model is important, as such animal models are being used increasingly in the development of brain-computer interfaces for restoration of function after spinal cord injury. PMID:23725395

Investigations on the discrete Gi(G)1 queue with and without loss

International Nuclear Information System (INIS)

Gergely, T.; Toeroek, T.L.

1975-12-01

A comprehensive discussion of the method for investigating queuing systems characterized by random variables of integer values is given. Specially the discrete GI(G)1 queuing systems are considered. The first part of the paper takes a short summary on the theory of discrete stochastic processes. In the second part the properties of the fundamental characteristics of the queuing system as the busy period, the waiting time and the output processes are discussed. In the last section some remarks are added to show the direction of further investigations. To demonstrated the simplicity of the relations verified in the paper some computed examples are presented in the appendix. The computations were performed with a mini-computer of 8K words memory. (Sz.Z.)

Discrete Mathematics Re "Tooled."

Science.gov (United States)

Grassl, Richard M.; Mingus, Tabitha T. Y.

1999-01-01

Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

Reexamining the language account of cross-national differences in base-10 number representations.

Science.gov (United States)

Vasilyeva, Marina; Laski, Elida V; Ermakova, Anna; Lai, Weng-Feng; Jeong, Yoonkyung; Hachigian, Amy

2015-01-01

East Asian students consistently outperform students from other nations in mathematics. One explanation for this advantage is a language account; East Asian languages, unlike most Western languages, provide cues about the base-10 structure of multi-digit numbers, facilitating the development of base-10 number representations. To test this view, the current study examined how kindergartners represented two-digit numbers using single unit-blocks and ten-blocks. The participants (N=272) were from four language groups (Korean, Mandarin, English, and Russian) that vary in the extent of "transparency" of the base-10 structure. In contrast to previous findings with older children, kindergartners showed no cross-language variability in the frequency of producing base-10 representations. Furthermore, they showed a pattern of within-language variability that was not consistent with the language account and was likely attributable to experiential factors. These findings suggest that language might not play as critical a role in the development of base-10 representations as suggested in earlier research. Copyright © 2014 Elsevier Inc. All rights reserved.

Variables cognitivas y metacognitivas en la resolución de problemas de química: propuesta de estrategias didácticas Cognitive and metacognitive variables in chemistry problem solving: a proposal of didactic strategies

Directory of Open Access Journals (Sweden)