Discretized energy minimization in a wave guide with point sources

Science.gov (United States)

Propst, G.

1994-01-01

An anti-noise problem on a finite time interval is solved by minimization of a quadratic functional on the Hilbert space of square integrable controls. To this end, the one-dimensional wave equation with point sources and pointwise reflecting boundary conditions is decomposed into a system for the two propagating components of waves. Wellposedness of this system is proved for a class of data that includes piecewise linear initial conditions and piecewise constant forcing functions. It is shown that for such data the optimal piecewise constant control is the solution of a sparse linear system. Methods for its computational treatment are presented as well as examples of their applicability. The convergence of discrete approximations to the general optimization problem is demonstrated by finite element methods.

Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

KAUST Repository

Migliorati, Giovanni; Nobile, Fabio; Tempone, Raul

2015-01-01

We study the accuracy of the discrete least-squares approximation on a finite dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability

A Comparison of Vibroacoustic Response of Isotropic Plate with Attached Discrete Patches and Point Masses Having Different Thickness Variation with Different Taper Ratios

Directory of Open Access Journals (Sweden)

Bipin Kumar

2016-01-01

Full Text Available A comparison of sound radiation behavior of plate in air medium with attached discrete patches/point masses having different thickness variations with different taper ratio of 0.3, 0.6, and 0.9 is analysed. Finite element method is used to find the vibration characteristics while Rayleigh integral is used to predict the sound radiation characteristics. Minimum peak sound power level obtained is at a taper ratio of 0.6 with parabolic increasing-decreasing thickness variation for plate with four discrete patches. At higher taper ratio, linearly increasing-decreasing thickness variation is another alternative for minimum peak sound power level suppression with discrete patches. It is found that, in low frequency range, average radiation efficiency remains almost the same, but near first peak, four patches or four point masses cause increase in average radiation efficiency; that is, redistribution of point masses/patches does have effect on average radiation efficiency at a given taper ratio.

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

Application of a discrete-energy, discrete-ordinates technique to the study of neutron transport in iron

International Nuclear Information System (INIS)

Ching, J.T.

1975-01-01

An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated which allows the development of a discrete-energy, discrete-ordinates method for the solution of radiation transport problems. The method utilizes a modified version of a cross section processing scheme devised for the moments method code BMT and the transport equation solution algorithm from the one-dimensional discrete-ordinates transport code ANISN. The combined system, identified as MOMANS, computes fluxes directly from point cross sections in a single operation. In the cross-section processing, the group averaging required for multigroup calculations is replaced by a fast numerical scheme capable of generating a set of transfer cross sections containing all the physical features of interest, thereby increasing the detail in the calculated results. Test calculations in which the discrete-energy method was compared with the multigroup method have shown that for the same energy grid (number of points = number of groups), the discrete-energy method is faster but somewhat less accurate than the multigroup method. However, the accuracy of the discrete-energy method increases rapidly as the spacing between energy points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum the discrete-energy method has therefore proven to be as accurate as, and more economical than, the multigroup technique. This was demonstrated by the application of the method to the study of the transport of neutrons in an iron sphere. Using the capability of the discrete-energy method for rapidly treating changes in cross-section sets, the propagation of neutrons from a 14 MeV source in a 22 cm radius sphere of iron was analyzed for sensitivity to changes in the microscopic scattering mechanisms

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.

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

Integrable structure in discrete shell membrane theory.

Science.gov (United States)

Schief, W K

2014-05-08

We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory.

Fermion systems in discrete space-time

International Nuclear Information System (INIS)

Finster, Felix

2007-01-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure

Fermion systems in discrete space-time

Energy Technology Data Exchange (ETDEWEB)

Finster, Felix [NWF I - Mathematik, Universitaet Regensburg, 93040 Regensburg (Germany)

2007-05-15

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Fermion Systems in Discrete Space-Time

OpenAIRE

Finster, Felix

2006-01-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Fermion systems in discrete space-time

Science.gov (United States)

Finster, Felix

2007-05-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Discrete-event simulation of coordinated multi-point joint transmission in LTE-Advanced with constrained backhaul

DEFF Research Database (Denmark)

Artuso, Matteo; Christiansen, Henrik Lehrmann

2014-01-01

Inter-cell interference in LTE-Advanced can be mitigated using coordinated multi-point (CoMP) techniques with joint transmission of user data . However, this requires tight coordination of the eNodeBs, usin g the X2 interface. In this paper we use discrete-event simulation to evaluate the latency...... requirements for the X2 interface and investigate the consequences of a constrained ba ckhaul. Our simulation results show a gain of the system throug hput of up to 120% compared to the case without CoMP for low-latency backhaul. With X2 latencies above 5 ms CoMP is no longer a benefit to the network....

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

Perfect discretization of path integrals

International Nuclear Information System (INIS)

Steinhaus, Sebastian

2012-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Perfect discretization of path integrals

Science.gov (United States)

Steinhaus, Sebastian

2012-05-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Gauge origin of discrete flavor symmetries in heterotic orbifolds

Directory of Open Access Journals (Sweden)

Florian Beye

2014-09-01

Full Text Available We show that non-Abelian discrete symmetries in orbifold string models have a gauge origin. This can be understood when looking at the vicinity of a symmetry enhanced point in moduli space. At such an enhanced point, orbifold fixed points are characterized by an enhanced gauge symmetry. This gauge symmetry can be broken to a discrete subgroup by a nontrivial vacuum expectation value of the Kähler modulus T. Using this mechanism it is shown that the Δ(54 non-Abelian discrete symmetry group originates from a SU(3 gauge symmetry, whereas the D4 symmetry group is obtained from a SU(2 gauge symmetry.

A Variational Approach to Perturbed Discrete Anisotropic Equations

Directory of Open Access Journals (Sweden)

Amjad Salari

2016-01-01

Full Text Available We continue the study of discrete anisotropic equations and we will provide new multiplicity results of the solutions for a discrete anisotropic equation. We investigate the existence of infinitely many solutions for a perturbed discrete anisotropic boundary value problem. The approach is based on variational methods and critical point theory.

Process algebra with timing : real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.; Bergstra, J.A.; Ponse, A.J.; Smolka, S.A.

2001-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The starting-point is a new real time version with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

The Predominance Of Integrative Tests Over Discrete Point Tests In Evaluating The Medical Students' General English Knowledge

Directory of Open Access Journals (Sweden)

maryam Heydarpour Meymeh

2009-03-01

Full Text Available Background and purpose: Multiple choice tests are the most common type of tests used in evaluating the general English knowledge of the students in most medical universities, however the efficacy of these tests are not examined precisely. Wecompare and examine the integrative tests and discrete point tests as measures of the English language knowledge of medical students.Methods: Three tests were given to 60 undergraduate physiotherapy and Audiology students in their second year of study (after passing their general English course. They were divided into 2 groups.The first test for both groups was an integrative test, writing. The second test was a multiple - choice test 0.(prepositions for group one and a multiple - choice test of tensesfor group two. The same items which were mostfi-equently used wrongly in thefirst test were used in the items of the second test. A third test, a TOEFL, was given to the subjects in order to estimate the correlation between this test and tests one and two.Results: The students performed better in the second test, discrete point test rather than the first which was an integrative test. The same grammatical mistakes in the composition were used correctly in the multiple choice tests by the students.Conclusion:Our findings show that student perform better in non-productive rather than productive test. Since being competent English language user is an expected outcome of university language courses it seems warranted to switch to integrative tests as a measure of English language competency.Keywords: INTEGRATIVE TESTS, ENGLISH LANGUAGE FOR MEDICINE, ACADEMIC ENGLISH

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

Current Density and Continuity in Discretized Models

Science.gov (United States)

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 Schrodinger 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…

Perfect discretization of path integrals

OpenAIRE

Steinhaus, Sebastian

2011-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discu...

Integrable Seven-Point Discrete Equations and Second-Order Evolution Chains

Science.gov (United States)

Adler, V. E.

2018-04-01

We consider differential-difference equations defining continuous symmetries for discrete equations on a triangular lattice. We show that a certain combination of continuous flows can be represented as a secondorder scalar evolution chain. We illustrate the general construction with a set of examples including an analogue of the elliptic Yamilov chain.

Limit sets for the discrete spectrum of complex Jacobi matrices

International Nuclear Information System (INIS)

Golinskii, L B; Egorova, I E

2005-01-01

The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete Laplacian is studied. The precise stabilization rate (in the sense of order) of the matrix elements ensuring the finiteness of the discrete spectrum is found. An example of a Jacobi matrix with discrete spectrum having a unique limit point is constructed. These results are discrete analogues of Pavlov's well-known results on Schroedinger operators with complex potential on a half-axis.

Discrete systems and integrability

CERN Document Server

Hietarinta, J; Nijhoff, F W

2016-01-01

This first introductory text to discrete integrable systems introduces key notions of integrability from the vantage point of discrete systems, also making connections with the continuous theory where relevant. While treating the material at an elementary level, the book also highlights many recent developments. Topics include: Darboux and Bäcklund transformations; difference equations and special functions; multidimensional consistency of integrable lattice equations; associated linear problems (Lax pairs); connections with Padé approximants and convergence algorithms; singularities and geometry; Hirota's bilinear formalism for lattices; intriguing properties of discrete Painlevé equations; and the novel theory of Lagrangian multiforms. The book builds the material in an organic way, emphasizing interconnections between the various approaches, while the exposition is mostly done through explicit computations on key examples. Written by respected experts in the field, the numerous exercises and the thoroug...

Discrete Model Predictive Control-Based Maximum Power Point Tracking for PV Systems: Overview and Evaluation

DEFF Research Database (Denmark)

Lashab, Abderezak; Sera, Dezso; Guerrero, Josep M.

2018-01-01

The main objective of this work is to provide an overview and evaluation of discrete model predictive controlbased maximum power point tracking (MPPT) for PV systems. A large number of MPC based MPPT methods have been recently introduced in the literature with very promising performance, however......, an in-depth investigation and comparison of these methods have not been carried out yet. Therefore, this paper has set out to provide an in-depth analysis and evaluation of MPC based MPPT methods applied to various common power converter topologies. The performance of MPC based MPPT is directly linked...... with the converter topology, and it is also affected by the accurate determination of the converter parameters, sensitivity to converter parameter variations is also investigated. The static and dynamic performance of the trackers are assessed according to the EN 50530 standard, using detailed simulation models...

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

Discrete approximations to vector spin models

Energy Technology Data Exchange (ETDEWEB)

Van Enter, Aernout C D [University of Groningen, Johann Bernoulli Institute of Mathematics and Computing Science, Postbus 407, 9700 AK Groningen (Netherlands); Kuelske, Christof [Ruhr-Universitaet Bochum, Fakultaet fuer Mathematik, D44801 Bochum (Germany); Opoku, Alex A, E-mail: A.C.D.v.Enter@math.rug.nl, E-mail: Christof.Kuelske@ruhr-uni-bochum.de, E-mail: opoku@math.leidenuniv.nl [Mathematisch Instituut, Universiteit Leiden, Postbus 9512, 2300 RA, Leiden (Netherlands)

2011-11-25

We strengthen a result from Kuelske and Opoku (2008 Electron. J. Probab. 13 1307-44) on the existence of effective interactions for discretized continuous-spin models. We also point out that such an interaction cannot exist at very low temperatures. Moreover, we compare two ways of discretizing continuous-spin models, and show that except for very low temperatures, they behave similarly in two dimensions. We also discuss some possibilities in higher dimensions. (paper)

Discrete approximations to vector spin models

International Nuclear Information System (INIS)

Van Enter, Aernout C D; Külske, Christof; Opoku, Alex A

2011-01-01

We strengthen a result from Külske and Opoku (2008 Electron. J. Probab. 13 1307–44) on the existence of effective interactions for discretized continuous-spin models. We also point out that such an interaction cannot exist at very low temperatures. Moreover, we compare two ways of discretizing continuous-spin models, and show that except for very low temperatures, they behave similarly in two dimensions. We also discuss some possibilities in higher dimensions. (paper)

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

On E-discretization of tori of compact simple Lie groups. II

Science.gov (United States)

Hrivnák, Jiří; Juránek, Michal

2017-10-01

Ten types of discrete Fourier transforms of Weyl orbit functions are developed. Generalizing one-dimensional cosine, sine, and exponential, each type of the Weyl orbit function represents an exponential symmetrized with respect to a subgroup of the Weyl group. Fundamental domains of even affine and dual even affine Weyl groups, governing the argument and label symmetries of the even orbit functions, are determined. The discrete orthogonality relations are formulated on finite sets of points from the refinements of the dual weight lattices. Explicit counting formulas for the number of points of the discrete transforms are deduced. Real-valued Hartley orbit functions are introduced, and all ten types of the corresponding discrete Hartley transforms are detailed.

Spatially localized, temporally quasiperiodic, discrete nonlinear excitations

International Nuclear Information System (INIS)

Cai, D.; Bishop, A.R.; Gronbech-Jensen, N.

1995-01-01

In contrast to the commonly discussed discrete breather, which is a spatially localized, time-periodic solution, we present an exact solution of a discrete nonlinear Schroedinger breather which is a spatially localized, temporally quasiperiodic nonlinear coherent excitation. This breather is a multiple-soliton solution in the sense of the inverse scattering transform. A discrete breather of multiple frequencies is conceptually important in studies of nonlinear lattice systems. We point out that, for this breather, the incommensurability of its frequencies is a discrete lattice effect and these frequencies become commensurate in the continuum limit. To understand the dynamical properties of the breather, we also discuss its stability and its behavior in the presence of an external potential. Finally, we indicate how to obtain an exact N-soliton breather as a discrete generalization of the continuum multiple-soliton solution

Generalised discrete torsion and mirror symmetry for G2 manifolds

International Nuclear Information System (INIS)

Gaberdiel, Matthias R.; Kaste, Peter

2004-01-01

A generalisation of discrete torsion is introduced in which different discrete torsion phases are considered for the different fixed points or twist fields of a twisted sector. The constraints that arise from modular invariance are analysed carefully. As an application we show how all the different resolutions of the T 7 /Z 2 3 orbifold of Joyce have an interpretation in terms of such generalised discrete torsion orbifolds. Furthermore, we show that these manifolds are pairwise identified under G 2 mirror symmetry. From a conformal field theory point of view, this mirror symmetry arises from an automorphism of the extended chiral algebra of the G 2 compactification. (author)

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

Discrete approach to complex planar geometries

International Nuclear Information System (INIS)

Cupini, E.; De Matteis, A.

1974-01-01

Planar regions in Monte Carlo transport problems have been represented by a finite set of points with a corresponding region index for each. The simulation of particle free-flight reduces then to the simple operations necessary for scanning appropriate grid points to determine whether a region other than the starting one is encountered. When the complexity of the geometry is restricted to only some regions of the assembly examined, a mixed discrete-continuous philosophy may be adopted. By this approach, the lattice of a thermal reactor has been treated, discretizing only the central regions of the cell containing the fuel rods. Excellent agreement with experimental results has been obtained in the computation of cell parameters in the energy range from fission to thermalization through the 238 U resonance region. (U.S.)

Discrete variable theory of triatomic photodissociation

International Nuclear Information System (INIS)

Heather, R.W.; Light, J.C.

1983-01-01

The coupled equations describing the photodissociation process are expressed in the discrete variable representation (DVR) in which the coupled equations are labeled by quadrature points rather than by internal basis functions. A large reduction in the dimensionality of the coupled equations can be realized since the spatially localized bound state nuclear wave function vanishes at most of the quadrature points, making only certain orientations of the fragments important in the region of strong interaction (small separation). The discrete variable theory of photodissociation is applied to the model dissociation of bent HCN in which the CN fragment is treated as a rigid rotor. The truncated DVR rotational distributions are compared with the exact close coupled rotational distributions, and excellent agreement with greatly reduced dimensionality of the equations is found

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)

Non-Lipschitz Dynamics Approach to Discrete Event Systems

Science.gov (United States)

Zak, M.; Meyers, R.

1995-01-01

This paper presents and discusses a mathematical formalism for simulation of discrete event dynamics (DED) - a special type of 'man- made' system designed to aid specific areas of information processing. A main objective is to demonstrate that the mathematical formalism for DED can be based upon the terminal model of Newtonian dynamics which allows one to relax Lipschitz conditions at some discrete points.

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.

Discrete Symmetries Analysis and Exact Solutions of the Inviscid Burgers Equation

Directory of Open Access Journals (Sweden)

Hongwei Yang

2012-01-01

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

Discrete Feature Approach for Heterogeneous Reservoir Production Enhancement

Energy Technology Data Exchange (ETDEWEB)

Dershowitz, William S.; Cladouhos, Trenton

2001-09-06

This progress report describes activities during the period January 1, 1999 to June 30, 1999. Work was carried out on 21 tasks. The major activity during the reporting period was the development and preliminary application of discrete fracture network (DFN) models for Stoney Point, South Oregon Basin, and North Oregon Basins project study sites. In addition, research was carried out on analysis algorithms for discrete future orientation.

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 Wigner function and quantum-state tomography

Science.gov (United States)

Leonhardt, Ulf

1996-05-01

The theory of discrete Wigner functions and of discrete quantum-state tomography [U. Leonhardt, Phys. Rev. Lett. 74, 4101 (1995)] is studied in more detail guided by the picture of precession tomography. Odd- and even-dimensional systems (angular momenta and spins, bosons, and fermions) are considered separately. Relations between simple number theory and the quantum mechanics of finite-dimensional systems are pointed out. In particular, the multicomplementarity of the precession states distinguishes prime dimensions from composite ones.

Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

KAUST Repository

Migliorati, Giovanni

2015-08-28

We study the accuracy of the discrete least-squares approximation on a finite dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability measure. The convergence estimates are given in mean-square sense with respect to the sampling measure. The noise may be correlated with the location of the evaluation and may have nonzero mean (offset). We consider both cases of bounded or square-integrable noise / offset. We prove conditions between the number of sampling points and the dimension of the underlying approximation space that ensure a stable and accurate approximation. Particular focus is on deriving estimates in probability within a given confidence level. We analyze how the best approximation error and the noise terms affect the convergence rate and the overall confidence level achieved by the convergence estimate. The proofs of our convergence estimates in probability use arguments from the theory of large deviations to bound the noise term. Finally we address the particular case of multivariate polynomial approximation spaces with any density in the beta family, including uniform and Chebyshev.

Semiclassical expanding discrete space-times

International Nuclear Information System (INIS)

Cobb, W.K.; Smalley, L.L.

1981-01-01

Given the close ties between general relativity and geometry one might reasonably expect that quantum effects associated with gravitation might also be tied to the geometry of space-time, namely, to some sort of discreteness in space-time itself. In particular it is supposed that space-time consists of a discrete lattice of points rather than the usual continuum. Since astronomical evidence seems to suggest that the universe is expanding, the lattice must also expand. Some of the implications of such a model are that the proton should presently be stable, and the universe should be closed although the mechanism for closure is quantum mechanical. (author)

Computing the Gromov hyperbolicity of a discrete metric space

KAUST Repository

Fournier, Hervé ; Ismail, Anas; Vigneron, Antoine E.

2015-01-01

We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space. We observe that computing the Gromov hyperbolicity from a fixed base-point reduces to a (max,min) matrix product. Hence, using

Stable grid refinement and singular source discretization for seismic wave simulations

Energy Technology Data Exchange (ETDEWEB)

Petersson, N A; Sjogreen, B

2009-10-30

An energy conserving discretization of the elastic wave equation in second order formulation is developed for a composite grid, consisting of a set of structured rectangular component grids with hanging nodes on the grid refinement interface. Previously developed summation-by-parts properties are generalized to devise a stable second order accurate coupling of the solution across mesh refinement interfaces. The discretization of singular source terms of point force and point moment tensor type are also studied. Based on enforcing discrete moment conditions that mimic properties of the Dirac distribution and its gradient, previous single grid formulas are generalized to work in the vicinity of grid refinement interfaces. These source discretization formulas are shown to give second order accuracy in the solution, with the error being essentially independent of the distance between the source and the grid refinement boundary. Several numerical examples are given to illustrate the properties of the proposed method.

Numerical methods for finding periodic points in discrete maps. High order islands chains and noble barriers in a toroidal magnetic configuration

Energy Technology Data Exchange (ETDEWEB)

Steinbrecher, G. [Association Euratom-Nasti Romania, Dept. of Theoretical Physics, Physics Faculty, University of Craiova (Romania); Reuss, J.D.; Misguich, J.H. [Association Euratom-CEA Cadarache, 13 - Saint-Paul-lez-Durance (France). Dept. de Recherches sur la Fusion Controlee

2001-11-01

We first remind usual physical and mathematical concepts involved in the dynamics of Hamiltonian systems, and namely in chaotic systems described by discrete 2D maps (representing the intersection points of toroidal magnetic lines in a poloidal plane in situations of incomplete magnetic chaos in Tokamaks). Finding the periodic points characterizing chains of magnetic islands is an essential step not only to determine the skeleton of the phase space picture, but also to determine the flux of magnetic lines across semi-permeable barriers like Cantori. We discuss here several computational methods used to determine periodic points in N dimensions, which amounts to solve a set of N nonlinear coupled equations: Newton method, minimization techniques, Laplace or steepest descend method, conjugated direction method and Fletcher-Reeves method. We have succeeded to improve this last method in an important way, without modifying its useful double-exponential convergence. This improved method has been tested and applied to finding periodic points of high order m in the 2D 'Tokamap' mapping, for values of m along rational chains of winding number n/m converging towards a noble value where a Cantorus exists. Such precise positions of periodic points have been used in the calculation of the flux across this Cantorus. (authors)

On the Importance of Both Dimensional and Discrete Models of Emotion.

Science.gov (United States)

Harmon-Jones, Eddie; Harmon-Jones, Cindy; Summerell, Elizabeth

2017-09-29

We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1) how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2) that anger (and other emotional states) should be considered as a discrete emotion but there are dimensions around and within anger; (3) that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4) that discrete emotions and broad dimensions of emotions both have unique functions; and (5) evidence that a "new" discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions.

On the Importance of Both Dimensional and Discrete Models of Emotion

Science.gov (United States)

Harmon-Jones, Eddie

2017-01-01

We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1) how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2) that anger (and other emotional states) should be considered as a discrete emotion but there are dimensions around and within anger; (3) that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4) that discrete emotions and broad dimensions of emotions both have unique functions; and (5) evidence that a “new” discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions. PMID:28961185

Discrete dislocation modelling of submicron indentation

NARCIS (Netherlands)

Widjaja, A; Van der Giessen, E; Needleman, A

2005-01-01

Indentation of a planar single crystal by a circular rigid indenter is analyzed using discrete dislocation plasticity. The crystal has three slip systems and is initially dislocation-free, but edge dislocations can nucleate from point sources inside the crystal. The lattice resistance to dislocation

Discretizing the transcritical and pitchfork bifurcations – conjugacy results

KAUST Repository

Lóczi, Lajos

2015-01-07

© 2015 Taylor & Francis. We present two case studies in one-dimensional dynamics concerning the discretization of transcritical (TC) and pitchfork (PF) bifurcations. In the vicinity of a TC or PF bifurcation point and under some natural assumptions on the one-step discretization method of order (Formula presented.) , we show that the time- (Formula presented.) exact and the step-size- (Formula presented.) discretized dynamics are topologically equivalent by constructing a two-parameter family of conjugacies in each case. As a main result, we prove that the constructed conjugacy maps are (Formula presented.) -close to the identity and these estimates are optimal.

Discrete expansions of continuum wave functions

International Nuclear Information System (INIS)

Bang, J.; Ershov, S.N.; Gareev, F.A.; Kazacha, G.S.

1980-01-01

Different methods of expanding continuum wave functions in terms of discrete basis sets are discussed. The convergence properties of these expansions are investigated, both from a mathematical and a numerical point of view, for the case of potentials of Woods-Saxon and square well type. (orig.)

On the Importance of Both Dimensional and Discrete Models of Emotion

Directory of Open Access Journals (Sweden)

Eddie Harmon-Jones

2017-09-01

Full Text Available We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1 how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2 that anger (and other emotional states should be considered as a discrete emotion but there are dimensions around and within anger; (3 that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4 that discrete emotions and broad dimensions of emotions both have unique functions; and (5 evidence that a “new” discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions.

Convergence of Cell Based Finite Volume Discretizations for Problems of Control in the Conduction Coefficients

DEFF Research Database (Denmark)

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

2011-01-01

We present a convergence analysis of a cell-based finite volume (FV) discretization scheme applied to a problem of control in the coefficients of a generalized Laplace equation modelling, for example, a steady state heat conduction. Such problems arise in applications dealing with geometric optimal......, whereas the convergence of the coefficients happens only with respect to the "volumetric" Lebesgue measure. Additionally, depending on whether the stationarity conditions are stated for the discretized or the original continuous problem, two distinct concepts of stationarity at a discrete level arise. We...... provide characterizations of limit points, with respect to FV mesh size, of globally optimal solutions and two types of stationary points to the discretized problems. We illustrate the practical behaviour of our cell-based FV discretization algorithm on a numerical example....

Ewald Electrostatics for Mixtures of Point and Continuous Line Charges.

Science.gov (United States)

Antila, Hanne S; Tassel, Paul R Van; Sammalkorpi, Maria

2015-10-15

Many charged macro- or supramolecular systems, such as DNA, are approximately rod-shaped and, to the lowest order, may be treated as continuous line charges. However, the standard method used to calculate electrostatics in molecular simulation, the Ewald summation, is designed to treat systems of point charges. We extend the Ewald concept to a hybrid system containing both point charges and continuous line charges. We find the calculated force between a point charge and (i) a continuous line charge and (ii) a discrete line charge consisting of uniformly spaced point charges to be numerically equivalent when the separation greatly exceeds the discretization length. At shorter separations, discretization induces deviations in the force and energy, and point charge-point charge correlation effects. Because significant computational savings are also possible, the continuous line charge Ewald method presented here offers the possibility of accurate and efficient electrostatic calculations.

Existence and multiplicity of solutions for nonlinear discrete inclusions

Directory of Open Access Journals (Sweden)

Nicu Marcu

2012-11-01

Full Text Available A non-smooth abstract result is used for proving the existence of at least one nontrivial solution of an algebraic discrete inclusion. Successively, a multiplicity theorem for the same class of discrete problems is also established by using a locally Lipschitz continuous version of the famous Brezis-Nirenberg theoretical result in presence of splitting. Some applications to tridiagonal, fourth-order and partial difference inclusions are pointed out.

Compatible Spatial Discretizations for Partial Differential Equations

Energy Technology Data Exchange (ETDEWEB)

Arnold, Douglas, N, ed.

2004-11-25

From May 11--15, 2004, the Institute for Mathematics and its Applications held a hot topics workshop on Compatible Spatial Discretizations for Partial Differential Equations. The numerical solution of partial differential equations (PDE) is a fundamental task in science and engineering. The goal of the workshop was to bring together a spectrum of scientists at the forefront of the research in the numerical solution of PDEs to discuss compatible spatial discretizations. We define compatible spatial discretizations as those that inherit or mimic fundamental properties of the PDE such as topology, conservation, symmetries, and positivity structures and maximum principles. A wide variety of discretization methods applied across a wide range of scientific and engineering applications have been designed to or found to inherit or mimic intrinsic spatial structure and reproduce fundamental properties of the solution of the continuous PDE model at the finite dimensional level. A profusion of such methods and concepts relevant to understanding them have been developed and explored: mixed finite element methods, mimetic finite differences, support operator methods, control volume methods, discrete differential forms, Whitney forms, conservative differencing, discrete Hodge operators, discrete Helmholtz decomposition, finite integration techniques, staggered grid and dual grid methods, etc. This workshop seeks to foster communication among the diverse groups of researchers designing, applying, and studying such methods as well as researchers involved in practical solution of large scale problems that may benefit from advancements in such discretizations; to help elucidate the relations between the different methods and concepts; and to generally advance our understanding in the area of compatible spatial discretization methods for PDE. Particular points of emphasis included: + Identification of intrinsic properties of PDE models that are critical for the fidelity of numerical

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

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

Existence results for anisotropic discrete boundary value problems

Directory of Open Access Journals (Sweden)

Avci Avci

2016-06-01

Full Text Available In this article, we prove the existence of nontrivial weak solutions for a class of discrete boundary value problems. The main tools used here are the variational principle and critical point theory.

Discrete Weighted Pseudo Asymptotic Periodicity of Second Order Difference Equations

Directory of Open Access Journals (Sweden)

Zhinan Xia

2014-01-01

Full Text Available We define the concept of discrete weighted pseudo-S-asymptotically periodic function and prove some basic results including composition theorem. We investigate the existence, and uniqueness of discrete weighted pseudo-S-asymptotically periodic solution to nonautonomous semilinear difference equations. Furthermore, an application to scalar second order difference equations is given. The working tools are based on the exponential dichotomy theory and fixed point theorem.

Post-Processing in the Material-Point Method

DEFF Research Database (Denmark)

Andersen, Søren; Andersen, Lars Vabbersgaard

The material-point method (MPM) is a numerical method for dynamic or static analysis of solids using a discretization in time and space. The method has shown to be successful in modelling physical problems involving large deformations, which are difficult to model with traditional numerical tools...... such as the finite element method. In the material-point method, a set of material points is utilized to track the problem in time and space, while a computational background grid is utilized to obtain spatial derivatives relevant to the physical problem. Currently, the research within the material-point method......-point method. The first idea involves associating a volume with each material point and displaying the deformation of this volume. In the discretization process, the physical domain is divided into a number of smaller volumes each represented by a simple shape; here quadrilaterals are chosen for the presented...

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

Distinct timing mechanisms produce discrete and continuous movements.

Directory of Open Access Journals (Sweden)

Raoul Huys

2008-04-01

Full Text Available The differentiation of discrete and continuous movement is one of the pillars of motor behavior classification. Discrete movements have a definite beginning and end, whereas continuous movements do not have such discriminable end points. In the past decade there has been vigorous debate whether this classification implies different control processes. This debate up until the present has been empirically based. Here, we present an unambiguous non-empirical classification based on theorems in dynamical system theory that sets discrete and continuous movements apart. Through computational simulations of representative modes of each class and topological analysis of the flow in state space, we show that distinct control mechanisms underwrite discrete and fast rhythmic movements. In particular, we demonstrate that discrete movements require a time keeper while fast rhythmic movements do not. We validate our computational findings experimentally using a behavioral paradigm in which human participants performed finger flexion-extension movements at various movement paces and under different instructions. Our results demonstrate that the human motor system employs different timing control mechanisms (presumably via differential recruitment of neural subsystems to accomplish varying behavioral functions such as speed constraints.

Natural Preconditioning and Iterative Methods for Saddle Point Systems

KAUST Repository

Pestana, Jennifer; Wathen, Andrew J.

2015-01-01

or the discrete setting, so saddle point systems arising from the discretization of partial differential equation problems, such as those describing electromagnetic problems or incompressible flow, lead to equations with this structure, as do, for example

Method for coupling two-dimensional to three-dimensional discrete ordinates calculations

International Nuclear Information System (INIS)

Thompson, J.L.; Emmett, M.B.; Rhoades, W.A.; Dodds, H.L. Jr.

1985-01-01

A three-dimensional (3-D) discrete ordinates transport code, TORT, has been developed at the Oak Ridge National Laboratory for radiation penetration studies. It is not feasible to solve some 3-D penetration problems with TORT, such as a building located a large distance from a point source, because (a) the discretized 3-D problem is simply too big to fit on the computer or (b) the computing time (and corresponding cost) is prohibitive. Fortunately, such problems can be solved with a hybrid approach by coupling a two-dimensional (2-D) description of the point source, which is assumed to be azimuthally symmetric, to a 3-D description of the building, the region of interest. The purpose of this paper is to describe this hybrid methodology along with its implementation and evaluation in the DOTTOR (Discrete Ordinates to Three-dimensional Oak Ridge Transport) code

Discrete variable representation for singular Hamiltonians

DEFF Research Database (Denmark)

Schneider, B. I.; Nygaard, Nicolai

2004-01-01

We discuss the application of the discrete variable representation (DVR) to Schrodinger problems which involve singular Hamiltonians. Unlike recent authors who invoke transformations to rid the eigenvalue equation of singularities at the cost of added complexity, we show that an approach based...... solely on an orthogonal polynomial basis is adequate, provided the Gauss-Lobatto or Gauss-Radau quadrature rule is used. This ensures that the mesh contains the singular points and by simply discarding the DVR functions corresponding to those points, all matrix elements become well behaved. the boundary...

A class of conservative Hamiltonians with exactly integrable discrete two-dimensional parametric maps

International Nuclear Information System (INIS)

Dikande, Alain M; Njumbe, E Epie

2010-01-01

A class of discrete conservative Hamiltonians with completely integrable two-dimensional (2D) mappings is constructed whose generic models are three families of non-integrable discrete Hamiltonians with on-site potentials whose double-well shapes vary. Unlike the discrete 2D mappings associated with the generic models, which all display pitchfork bifurcations towards randomly pinned states with chaotic features, for the derived models the pitchfork bifurcation leads to fixed points always surrounded by periodic trajectories. A nonlinear stability analysis reveals a finite crossover on the bifurcation line at which the pitchfork transition takes the maps from regular real periodic trajectories towards a regime dominated by a cluster of periodic point trajectories representing the allowed real solutions. The rich variety of structures displayed by the new class of discrete maps, combined with their complete integrability, offer rich perspectives for theoretical modelling of a wide class of systems undergoing structural instabilities without noticeable chaotic precursors.

Convergence of discrete Aubry–Mather model in the continuous limit

Science.gov (United States)

Su, Xifeng; Thieullen, Philippe

2018-05-01

We develop two approximation schemes for solving the cell equation and the discounted cell equation using Aubry–Mather–Fathi theory. The Hamiltonian is supposed to be Tonelli, time-independent and periodic in space. By Legendre transform it is equivalent to find a fixed point of some nonlinear operator, called Lax-Oleinik operator, which may be discounted or not. By discretizing in time, we are led to solve an additive eigenvalue problem involving a discrete Lax–Oleinik operator. We show how to approximate the effective Hamiltonian and some weak KAM solutions by letting the time step in the discrete model tend to zero. We also obtain a selected discrete weak KAM solution as in Davini et al (2016 Invent. Math. 206 29–55), and show that it converges to a particular solution of the cell equation. In order to unify the two settings, continuous and discrete, we develop a more general formalism of the short-range interactions.

Generalized synchronization in discrete maps. New point of view on weak and strong synchronization

International Nuclear Information System (INIS)

Koronovskii, Alexey A.; Moskalenko, Olga I.; Shurygina, Svetlana A.; Hramov, Alexander E.

2013-01-01

In the present Letter we show that the concept of the generalized synchronization regime in discrete maps needs refining in the same way as it has been done for the flow systems Koronovskii et al. [Koronovskii AA, Moskalenko OI, Hramov AE. Nearest neighbors, phase tubes, and generalized synchronization. Phys Rev E 2011;84:037201]. We have shown that, in the general case, when the relationship between state vectors of the interacting chaotic maps are considered, the prehistory must be taken into account. We extend the phase tube approach to the systems with a discrete time coupled both unidirectionally and mutually and analyze the essence of the generalized synchronization by means of this technique. Obtained results show that the division of the generalized synchronization into the weak and the strong ones also must be reconsidered. Unidirectionally coupled logistic maps and Hénon maps coupled mutually are used as sample systems.

Domain Discretization and Circle Packings

DEFF Research Database (Denmark)

Dias, Kealey

A circle packing is a configuration of circles which are tangent with one another in a prescribed pattern determined by a combinatorial triangulation, where the configuration fills a planar domain or a two-dimensional surface. The vertices in the triangulation correspond to centers of circles...... to domain discretization problems such as triangulation and unstructured mesh generation techniques. We wish to ask ourselves the question: given a cloud of points in the plane (we restrict ourselves to planar domains), is it possible to construct a circle packing preserving the positions of the vertices...... and constrained meshes having predefined vertices as constraints. A standard method of two-dimensional mesh generation involves conformal mapping of the surface or domain to standardized shapes, such as a disk. Since circle packing is a new technique for constructing discrete conformal mappings, it is possible...

Emissions of Photonic Crystal Waveguides with Discretely Modulated Surfaces

International Nuclear Information System (INIS)

Dong-Hua, Tang; Li-Xue, Chen; Yan, Liu; Xiu-Dong, Sun; Wei-Qiang, Ding

2009-01-01

Transmission properties of photonic crystal (PC) waveguides with discretely modulated exit surfaces are investigated numerically using the unite-difference time-domain (FDTD) method. Unlike the case of periodically modulated surfaces, where the transmission beam tends to be a single and directional beam, when the exit surfaces are modulated only at several discrete points, the emission power tends to split into multiple and directional beams. We explain this phenomenon using a multiple point source interference model. Based on these results, we propose a 1-to-N beam splitter, and numerically realized high efficiency coupling between a PC sub-wavelength waveguide and three traditional dielectric waveguides with a total efficiency larger than 92%. This simple, easy fabrication, and controllable mechanism may find more potential applications in integrated optical circuits. (fundamental areas of phenomenology(including applications))

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.

Cycles of a discrete time bipolar artificial neural network

International Nuclear Information System (INIS)

Cheng Suisun; Chen, J.-S.; Yueh, W.-C.

2009-01-01

A discrete time bipolar neural network depending on two parameters is studied. It is observed that its dynamical behaviors can be classified into six cases. For each case, the long time behaviors can be summarized in terms of fixed points, periodic points, basin of attractions, and related initial distributions. Mathematical reasons are supplied for these observations and applications in cellular automata are illustrated.

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

Discrete-time control system design with applications

CERN Document Server

Rabbath, C A

2014-01-01

This book presents practical techniques of discrete-time control system design. In general, the design techniques lead to low-order dynamic compensators that ensure satisfactory closed-loop performance for a wide range of sampling rates. The theory is given in the form of theorems, lemmas, and propositions. The design of the control systems is presented as step-by-step procedures and algorithms. The proposed feedback control schemes are applied to well-known dynamic system models. This book also discusses: Closed-loop performance of generic models of mobile robot and airborne pursuer dynamic systems under discrete-time feedback control with limited computing capabilities Concepts of discrete-time models and sampled-data models of continuous-time systems, for both single- and dual-rate operation Local versus global digital redesign Optimal, closed-loop digital redesign methods Plant input mapping design Generalized holds and samplers for use in feedback control loops, Numerical simulation of fixed-point arithm...

Digital Resonant Controller based on Modified Tustin Discretization Method

Directory of Open Access Journals (Sweden)

STOJIC, D.

2016-11-01

Full Text Available Resonant controllers are used in power converter voltage and current control due to their simplicity and accuracy. However, digital implementation of resonant controllers introduces problems related to zero and pole mapping from the continuous to the discrete time domain. Namely, some discretization methods introduce significant errors in the digital controller resonant frequency, resulting in the loss of the asymptotic AC reference tracking, especially at high resonant frequencies. The delay compensation typical for resonant controllers can also be compromised. Based on the existing analysis, it can be concluded that the Tustin discretization with frequency prewarping represents a preferable choice from the point of view of the resonant frequency accuracy. However, this discretization method has a shortcoming in applications that require real-time frequency adaptation, since complex trigonometric evaluation is required for each frequency change. In order to overcome this problem, in this paper the modified Tustin discretization method is proposed based on the Taylor series approximation of the frequency prewarping function. By comparing the novel discretization method with commonly used two-integrator-based proportional-resonant (PR digital controllers, it is shown that the resulting digital controller resonant frequency and time delay compensation errors are significantly reduced for the novel controller.

Stability Analysis of Continuous-Time and Discrete-Time Quaternion-Valued Neural Networks With Linear Threshold Neurons.

Science.gov (United States)

Chen, Xiaofeng; Song, Qiankun; Li, Zhongshan; Zhao, Zhenjiang; Liu, Yurong

2018-07-01

This paper addresses the problem of stability for continuous-time and discrete-time quaternion-valued neural networks (QVNNs) with linear threshold neurons. Applying the semidiscretization technique to the continuous-time QVNNs, the discrete-time analogs are obtained, which preserve the dynamical characteristics of their continuous-time counterparts. Via the plural decomposition method of quaternion, homeomorphic mapping theorem, as well as Lyapunov theorem, some sufficient conditions on the existence, uniqueness, and global asymptotical stability of the equilibrium point are derived for the continuous-time QVNNs and their discrete-time analogs, respectively. Furthermore, a uniform sufficient condition on the existence, uniqueness, and global asymptotical stability of the equilibrium point is obtained for both continuous-time QVNNs and their discrete-time version. Finally, two numerical examples are provided to substantiate the effectiveness of the proposed results.

On a discrete version of the CP 1 sigma model and surfaces immersed in R3

International Nuclear Information System (INIS)

Grundland, A M; Levi, D; Martina, L

2003-01-01

We present a discretization of the CP 1 sigma model. We show that the discrete CP 1 sigma model is described by a nonlinear partial second-order difference equation with rational nonlinearity. To derive discrete surfaces immersed in three-dimensional Euclidean space a 'complex' lattice is introduced. The so-obtained surfaces are characterized in terms of the quadrilateral cross-ratio of four surface points. In this way we prove that all surfaces associated with the discrete CP 1 sigma model are of constant mean curvature. An explicit example of such discrete surfaces is constructed

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.

Discretizing the transcritical and pitchfork bifurcations – conjugacy results

KAUST Repository

Ló czi, Lajos

2015-01-01

© 2015 Taylor & Francis. We present two case studies in one-dimensional dynamics concerning the discretization of transcritical (TC) and pitchfork (PF) bifurcations. In the vicinity of a TC or PF bifurcation point and under some natural assumptions

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

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

Development of discrete gas kinetic scheme for simulation of 3D viscous incompressible and compressible flows

Science.gov (United States)

Yang, L. M.; Shu, C.; Wang, Y.; Sun, Y.

2016-08-01

The sphere function-based gas kinetic scheme (GKS), which was presented by Shu and his coworkers [23] for simulation of inviscid compressible flows, is extended to simulate 3D viscous incompressible and compressible flows in this work. Firstly, we use certain discrete points to represent the spherical surface in the phase velocity space. Then, integrals along the spherical surface for conservation forms of moments, which are needed to recover 3D Navier-Stokes equations, are approximated by integral quadrature. The basic requirement is that these conservation forms of moments can be exactly satisfied by weighted summation of distribution functions at discrete points. It was found that the integral quadrature by eight discrete points on the spherical surface, which forms the D3Q8 discrete velocity model, can exactly match the integral. In this way, the conservative variables and numerical fluxes can be computed by weighted summation of distribution functions at eight discrete points. That is, the application of complicated formulations resultant from integrals can be replaced by a simple solution process. Several numerical examples including laminar flat plate boundary layer, 3D lid-driven cavity flow, steady flow through a 90° bending square duct, transonic flow around DPW-W1 wing and supersonic flow around NACA0012 airfoil are chosen to validate the proposed scheme. Numerical results demonstrate that the present scheme can provide reasonable numerical results for 3D viscous flows.

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

Effect of the surface charge discretization on electric double layers. A Monte Carlo simulation study

OpenAIRE

Madurga Díez, Sergio; Martín-Molina, Alberto; Vilaseca i Font, Eudald; Mas i Pujadas, Francesc; Quesada-Pérez, Manuel

2007-01-01

The structure of the electric double layer in contact with discrete and continuously charged planar surfaces is studied within the framework of the primitive model through Monte Carlo simulations. Three different discretization models are considered together with the case of uniform distribution. The effect of discreteness is analyzed in terms of charge density profiles. For point surface groups,a complete equivalence with the situation of uniformly distributed charge is found if profiles are...

Data visualization for ONEDANT and TWODANT discrete ordinates codes

International Nuclear Information System (INIS)

Lee, C.L.

1993-01-01

Effective graphical display of code calculations allow for efficient analysis of results. This is especially true in the case of discrete ordinates transport codes, which can generate thousands of flux or reaction rate data points per calculation. For this reason, a package of portable interface programs called OTTUI (ONEDANT-TWODANT-Tecplot trademark Unix-Based Interface) has been developed at Los Alamos National Laboratory to permit rapid visualization of ONEDANT and TWODANT discrete ordinates results using the graphics package Tecplot. This paper describes the various uses of OTTUI for display of ONEDANT and TWODANT problem geometries and calculational results

From discrete particles to continuum fields near a boundary

NARCIS (Netherlands)

Weinhart, Thomas; Thornton, Anthony Richard; Luding, Stefan; Bokhove, Onno

An expression for the stress tensor near an external boundary of a discrete mechanical system is derived explicitly in terms of the constituents’ degrees of freedom and interaction forces. Starting point is the exact and general coarse graining formulation presented by Goldhirsch in [I.Goldhirsch,

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.

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

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

Finite discrete field theory

International Nuclear Information System (INIS)

Souza, Manoelito M. de

1997-01-01

We discuss the physical meaning and the geometric interpretation of implementation in classical field theories. The origin of infinities and other inconsistencies in field theories is traced to fields defined with support on the light cone; a finite and consistent field theory requires a light-cone generator as the field support. Then, we introduce a classical field theory with support on the light cone generators. It results on a description of discrete (point-like) interactions in terms of localized particle-like fields. We find the propagators of these particle-like fields and discuss their physical meaning, properties and consequences. They are conformally invariant, singularity-free, and describing a manifestly covariant (1 + 1)-dimensional dynamics in a (3 = 1) spacetime. Remarkably this conformal symmetry remains even for the propagation of a massive field in four spacetime dimensions. We apply this formalism to Classical electrodynamics and to the General Relativity Theory. The standard formalism with its distributed fields is retrieved in terms of spacetime average of the discrete field. Singularities are the by-products of the averaging process. This new formalism enlighten the meaning and the problem of field theory, and may allow a softer transition to a quantum theory. (author)

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

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)

VT Mile Points - 1/10-Mile Intervals

Data.gov (United States)

Vermont Center for Geographic Information — The mile points data layer is comprised of discrete locations based on specific measured intervals along a route. These intervals are represented along a...

Global exponential stability of mixed discrete and distributively delayed cellular neural network

International Nuclear Information System (INIS)

Yao Hong-Xing; Zhou Jia-Yan

2011-01-01

This paper concernes analysis for the global exponential stability of a class of recurrent neural networks with mixed discrete and distributed delays. It first proves the existence and uniqueness of the balance point, then by employing the Lyapunov—Krasovskii functional and Young inequality, it gives the sufficient condition of global exponential stability of cellular neural network with mixed discrete and distributed delays, in addition, the example is provided to illustrate the applicability of the result. (general)

Gaussian quadrature and lattice discretization of the Fermi-Dirac distribution for graphene

OpenAIRE

Oettinger, D.; Mendoza, M.; Herrmann, H. J.

2013-01-01

We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use these polynomials to expand the respective distribution in a moving frame, for both cases, undoped and doped graphene. In order to discretize the Boltzmann equation and make feasible the numerical implementation, we reduce the number of discrete points in m...

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

KAUST Repository

Cortes, Adriano Mauricio

2016-10-01

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity-pressure pairs for viscous incompressible flows that are at the same time inf−supinf−sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show how the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.

Discretion in the “Backyard of Law”: Case Handling of Debt Relief in Sweden

Directory of Open Access Journals (Sweden)

Bengt Larsson

2013-04-01

Full Text Available This article explores discretion in welfare professional work. The aim is to analyse what room for discretionary decision-making that exist in case handling of debt relief at the Swedish Enforcement Authority (SEA. The analysis is guided by a conceptual distinction between structural and epistemic aspects of discretion, as well as between substantive and procedural aspects. The data comprises official and internal SEA documents, interviews with management and staff and field notes from observations. The analysis points to a change in the balance between standards and discretion in relation to the on-going formalization of case handling at the SEA, though not in the simplistic sense that discretion is diminished through formalization. When taking into account the different analytical aspects of discretion, it is concluded that discretion is narrowed only in some respects. There is still space for case officers in selecting and interpreting information and assess-ing the conditions regarding subject matter.

Analysis of the stability and accuracy of the discrete least-squares approximation on multivariate polynomial spaces

KAUST Repository

Migliorati, Giovanni

2016-01-05

We review the main results achieved in the analysis of the stability and accuracy of the discrete leastsquares approximation on multivariate polynomial spaces, with noiseless evaluations at random points, noiseless evaluations at low-discrepancy point sets, and noisy evaluations at random points.

Discrete Orthogonal Transforms and Neural Networks for Image Interpolation

Directory of Open Access Journals (Sweden)

J. Polec

1999-09-01

Full Text Available In this contribution we present transform and neural network approaches to the interpolation of images. From transform point of view, the principles from [1] are modified for 1st and 2nd order interpolation. We present several new interpolation discrete orthogonal transforms. From neural network point of view, we present interpolation possibilities of multilayer perceptrons. We use various configurations of neural networks for 1st and 2nd order interpolation. The results are compared by means of tables.

Lie Symmetry Analysis of the Inhomogeneous Toda Lattice Equation via Semi-Discrete Exterior Calculus

International Nuclear Information System (INIS)

Liu Jiang; Wang Deng-Shan; Yin Yan-Bin

2017-01-01

In this work, the Lie point symmetries of the inhomogeneous Toda lattice equation are obtained by semi-discrete exterior calculus, which is a semi-discrete version of Harrison and Estabrook’s geometric approach. A four-dimensional Lie algebra and its one-, two- and three-dimensional subalgebras are given. Two similarity reductions of the inhomogeneous Toda lattice equation are obtained by using the symmetry vectors. (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...

Flocking with discrete symmetry: The two-dimensional active Ising model.

Science.gov (United States)

Solon, A P; Tailleur, J

2015-10-01

We study in detail the active Ising model, a stochastic lattice gas where collective motion emerges from the spontaneous breaking of a discrete symmetry. On a two-dimensional lattice, active particles undergo a diffusion biased in one of two possible directions (left and right) and align ferromagnetically their direction of motion, hence yielding a minimal flocking model with discrete rotational symmetry. We show that the transition to collective motion amounts in this model to a bona fide liquid-gas phase transition in the canonical ensemble. The phase diagram in the density-velocity parameter plane has a critical point at zero velocity which belongs to the Ising universality class. In the density-temperature "canonical" ensemble, the usual critical point of the equilibrium liquid-gas transition is sent to infinite density because the different symmetries between liquid and gas phases preclude a supercritical region. We build a continuum theory which reproduces qualitatively the behavior of the microscopic model. In particular, we predict analytically the shapes of the phase diagrams in the vicinity of the critical points, the binodal and spinodal densities at coexistence, and the speeds and shapes of the phase-separated profiles.

Dynamic nonlinear interaction of elastic plates on discrete supports

International Nuclear Information System (INIS)

Coutinho, A.L.G.A.; Landau, L.; Lima, E.C.P. de; Ebecken, N.F.F.

1984-01-01

A study on the dynamic nonlinear interaction of elastic plates using the finite element method is presented. The elastic plate is discretized by 4-node isoparametric Mindlin elements. The constitutive relation of the discrete supports can be any nonlinear curve given by pairs of force-displacement points. The nonlinear behaviour is represented by the overlay approach. This model also allows the simulation of a progressive decrease on the supports stiffnesses during load cycles. The dynamic nonlinear incremental movement equations are integrated by the Newmark implicit operator. Two alternatives for the incremental-iterative formulation are compared. The paper ends with a discussion of the advantages and limitations of the presented numerical models. (Author) [pt

Effect of the surface charge discretization on electric double layers: a Monte Carlo simulation study.

Science.gov (United States)

Madurga, Sergio; Martín-Molina, Alberto; Vilaseca, Eudald; Mas, Francesc; Quesada-Pérez, Manuel

2007-06-21

The structure of the electric double layer in contact with discrete and continuously charged planar surfaces is studied within the framework of the primitive model through Monte Carlo simulations. Three different discretization models are considered together with the case of uniform distribution. The effect of discreteness is analyzed in terms of charge density profiles. For point surface groups, a complete equivalence with the situation of uniformly distributed charge is found if profiles are exclusively analyzed as a function of the distance to the charged surface. However, some differences are observed moving parallel to the surface. Significant discrepancies with approaches that do not account for discreteness are reported if charge sites of finite size placed on the surface are considered.

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.

Development of a discrete gas-kinetic scheme for simulation of two-dimensional viscous incompressible and compressible flows.

Science.gov (United States)

Yang, L M; Shu, C; Wang, Y

2016-03-01

In this work, a discrete gas-kinetic scheme (DGKS) is presented for simulation of two-dimensional viscous incompressible and compressible flows. This scheme is developed from the circular function-based GKS, which was recently proposed by Shu and his co-workers [L. M. Yang, C. Shu, and J. Wu, J. Comput. Phys. 274, 611 (2014)]. For the circular function-based GKS, the integrals for conservation forms of moments in the infinity domain for the Maxwellian function-based GKS are simplified to those integrals along the circle. As a result, the explicit formulations of conservative variables and fluxes are derived. However, these explicit formulations of circular function-based GKS for viscous flows are still complicated, which may not be easy for the application by new users. By using certain discrete points to represent the circle in the phase velocity space, the complicated formulations can be replaced by a simple solution process. The basic requirement is that the conservation forms of moments for the circular function-based GKS can be accurately satisfied by weighted summation of distribution functions at discrete points. In this work, it is shown that integral quadrature by four discrete points on the circle, which forms the D2Q4 discrete velocity model, can exactly match the integrals. Numerical results showed that the present scheme can provide accurate numerical results for incompressible and compressible viscous flows with roughly the same computational cost as that needed by the Roe scheme.

Zak Phase in Discrete-Time Quantum Walks

OpenAIRE

Puentes, G.; Santillán, O.

2015-01-01

We report on a simple scheme that may present a non-trivial geometric Zak phase ($\\Phi_{Zak}$) structure, which is based on a discrete-time quantum walk architecture. By detecting the Zak phase difference between two trajectories connecting adjacent Dirac points where the quasi-energy gap closes for opposite values of quasi-momentum ($k$), it is possible to identify geometric invariants. These geometric invariants correspond to $|\\Phi_{Zak}^{+(-)}-\\Phi_{Zak}^{-(+)}|=\\pi$ and $|\\Phi_{Zak}^{+(-...

Physiological modules for generating discrete and rhythmic movements: component analysis of EMG signals.

Science.gov (United States)

Bengoetxea, Ana; Leurs, Françoise; Hoellinger, Thomas; Cebolla, Ana Maria; Dan, Bernard; Cheron, Guy; McIntyre, Joseph

2014-01-01

A central question in Neuroscience is that of how the nervous system generates the spatiotemporal commands needed to realize complex gestures, such as handwriting. A key postulate is that the central nervous system (CNS) builds up complex movements from a set of simpler motor primitives or control modules. In this study we examined the control modules underlying the generation of muscle activations when performing different types of movement: discrete, point-to-point movements in eight different directions and continuous figure-eight movements in both the normal, upright orientation and rotated 90°. To test for the effects of biomechanical constraints, movements were performed in the frontal-parallel or sagittal planes, corresponding to two different nominal flexion/abduction postures of the shoulder. In all cases we measured limb kinematics and surface electromyographic activity (EMG) signals for seven different muscles acting around the shoulder. We first performed principal component analysis (PCA) of the EMG signals on a movement-by-movement basis. We found a surprisingly consistent pattern of muscle groupings across movement types and movement planes, although we could detect systematic differences between the PCs derived from movements performed in each shoulder posture and between the principal components associated with the different orientations of the figure. Unexpectedly we found no systematic differences between the figure eights and the point-to-point movements. The first three principal components could be associated with a general co-contraction of all seven muscles plus two patterns of reciprocal activation. From these results, we surmise that both "discrete-rhythmic movements" such as the figure eight, and discrete point-to-point movement may be constructed from three different fundamental modules, one regulating the impedance of the limb over the time span of the movement and two others operating to generate movement, one aligned with the

Discrete quark-lepton symmetry need not pose a cosmological domain wall problem

International Nuclear Information System (INIS)

Lew, H.; Volkas, R.R.

1992-01-01

Quarks and leptons may be related to each other through a spontaneously broken discrete symmetry. Models with acceptable and interesting collider phenomenology have been constructed which incorporate this idea. However, the standard Hot Big Bang model of cosmology is generally considered to eschew spontaneously broken discrete symmetries because they often lead to the formation of unacceptably massive domain walls. It is pointed out that there are a number of plausible quark-lepton symmetric models in nature which do not produce cosmologically troublesome domain walls. 30 refs

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.

Natural Preconditioning and Iterative Methods for Saddle Point Systems

KAUST Repository

Pestana, Jennifer

2015-01-01

© 2015 Society for Industrial and Applied Mathematics. The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints gives rise to linear systems in saddle point form. This is true whether in the continuous or the discrete setting, so saddle point systems arising from the discretization of partial differential equation problems, such as those describing electromagnetic problems or incompressible flow, lead to equations with this structure, as do, for example, interior point methods and the sequential quadratic programming approach to nonlinear optimization. This survey concerns iterative solution methods for these problems and, in particular, shows how the problem formulation leads to natural preconditioners which guarantee a fast rate of convergence of the relevant iterative methods. These preconditioners are related to the original extremum problem and their effectiveness - in terms of rapidity of convergence - is established here via a proof of general bounds on the eigenvalues of the preconditioned saddle point matrix on which iteration convergence depends.

Quantification of discreteness effects in cosmological N-body simulations: Initial conditions

International Nuclear Information System (INIS)

Joyce, M.; Marcos, B.

2007-01-01

The relation between the results of cosmological N-body simulations, and the continuum theoretical models they simulate, is currently not understood in a way which allows a quantification of N dependent effects. In this first of a series of papers on this issue, we consider the quantification of such effects in the initial conditions of such simulations. A general formalism developed in [A. Gabrielli, Phys. Rev. E 70, 066131 (2004).] allows us to write down an exact expression for the power spectrum of the point distributions generated by the standard algorithm for generating such initial conditions. Expanded perturbatively in the amplitude of the input (i.e. theoretical, continuum) power spectrum, we obtain at linear order the input power spectrum, plus two terms which arise from discreteness and contribute at large wave numbers. For cosmological type power spectra, one obtains as expected, the input spectrum for wave numbers k smaller than that characteristic of the discreteness. The comparison of real space correlation properties is more subtle because the discreteness corrections are not as strongly localized in real space. For cosmological type spectra the theoretical mass variance in spheres and two-point correlation function are well approximated above a finite distance. For typical initial amplitudes this distance is a few times the interparticle distance, but it diverges as this amplitude (or, equivalently, the initial redshift of the cosmological simulation) goes to zero, at fixed particle density. We discuss briefly the physical significance of these discreteness terms in the initial conditions, in particular, with respect to the definition of the continuum limit of N-body simulations

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.

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

Indirect adaptive control of discrete chaotic systems

International Nuclear Information System (INIS)

Salarieh, Hassan; Shahrokhi, Mohammad

2007-01-01

In this paper an indirect adaptive control algorithm is proposed to stabilize the fixed points of discrete chaotic systems. It is assumed that the functionality of the chaotic dynamics is known but the system parameters are unknown. This assumption is usually applicable to many chaotic systems, such as the Henon map, logistic and many other nonlinear maps. Using the recursive-least squares technique, the system parameters are identified and based on the feedback linearization method an adaptive controller is designed for stabilizing the fixed points, or unstable periodic orbits of the chaotic maps. The stability of the proposed scheme has been shown and the effectiveness of the control algorithm has been demonstrated through computer simulations

Distance of Sample Measurement Points to Prototype Catalog Curve

DEFF Research Database (Denmark)

Hjorth, Poul G.; Karamehmedovic, Mirza; Perram, John

2006-01-01

We discuss strategies for comparing discrete data points to a catalog (reference) curve by means of the Euclidean distance from each point to the curve in a pump's head H vs. flow Qdiagram. In particular we find that a method currently in use is inaccurate. We propose several alternatives...

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.

Fermion Systems in Discrete Space-Time Exemplifying the Spontaneous Generation of a Causal Structure

Science.gov (United States)

Diethert, A.; Finster, F.; Schiefeneder, D.

As toy models for space-time at the Planck scale, we consider examples of fermion systems in discrete space-time which are composed of one or two particles defined on two up to nine space-time points. We study the self-organization of the particles as described by a variational principle both analytically and numerically. We find an effect of spontaneous symmetry breaking which leads to the emergence of a discrete causal structure.

The inverse of winnowing: a FORTRAN subroutine and discussion of unwinnowing discrete data

Science.gov (United States)

Bracken, Robert E.

2004-01-01

This report describes an unwinnowing algorithm that utilizes a discrete Fourier transform, and a resulting Fortran subroutine that winnows or unwinnows a 1-dimensional stream of discrete data; the source code is included. The unwinnowing algorithm effectively increases (by integral factors) the number of available data points while maintaining the original frequency spectrum of a data stream. This has utility when an increased data density is required together with an availability of higher order derivatives that honor the original data.

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 coherent and squeezed states of many-qudit systems

International Nuclear Information System (INIS)

Klimov, Andrei B.; Munoz, Carlos; Sanchez-Soto, Luis L.

2009-01-01

We consider the phase space for n identical qudits (each one of dimension d, with d a primer number) as a grid of d n xd n points and use the finite Galois field GF(d n ) to label the corresponding axes. The associated displacement operators permit to define s-parametrized quasidistributions on this grid, with properties analogous to their continuous counterparts. These displacements allow also for the construction of finite coherent states, once a fiducial state is fixed. We take this reference as one eigenstate of the discrete Fourier transform and study the factorization properties of the resulting coherent states. We extend these ideas to include discrete squeezed states, and show their intriguing relation with entangled states of different qudits.

Comprehensive Interpretation of a Three-Point Gauss Quadrature with Variable Sampling Points and Its Application to Integration for Discrete Data

Directory of Open Access Journals (Sweden)

Young-Doo Kwon

2013-01-01

Full Text Available This study examined the characteristics of a variable three-point Gauss quadrature using a variable set of weighting factors and corresponding optimal sampling points. The major findings were as follows. The one-point, two-point, and three-point Gauss quadratures that adopt the Legendre sampling points and the well-known Simpson’s 1/3 rule were found to be special cases of the variable three-point Gauss quadrature. In addition, the three-point Gauss quadrature may have out-of-domain sampling points beyond the domain end points. By applying the quadratically extrapolated integrals and nonlinearity index, the accuracy of the integration could be increased significantly for evenly acquired data, which is popular with modern sophisticated digital data acquisition systems, without using higher-order extrapolation polynomials.

Equations for arithmetic pointed tori

NARCIS (Netherlands)

Sijsling, J.R.

2010-01-01

In 1983, Kisao Takeuchi enumerated all 71 arithmetic (1;e)-groups. This is a special set of discrete subgroups of SL(2,R) of finite covolume and signature (1;e). The corresponding quotients of the upper half plane (called (1;e)-curves) have genus equal to 1 and a single elliptic point of order e.

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

The limits on prosecutorial discretion in Singapore: Past, present, and future

Directory of Open Access Journals (Sweden)

Siyuan Chen

2013-02-01

Full Text Available The exercise of prosecutorial discretion is a unique executive act that continues to be very well-protected from public scrutiny in many jurisdictions throughout the world. In this article, I attempt to survey virtually the entire body of case law on the limits of prosecutorial discretion in Singapore. Probably because prosecutorial discretion is protected by the Constitution, it took a while for the Singapore courts to retreat from its initial characterisation of the discretion as absolute and outside the scope of any form of review. Against a wider backdrop of increasing rights-consciousness (especially within the courts and the public demand for transparency and accountability, the legal position has evolved to its current and more legally defensible form, viz, prosecutorial discretion is not absolute, and can be subject to, inter alia, constitutional challenge. It may well be a while before this position evolves again, but the natural progression from this, as seen in other jurisdictions, is the public release of general guidelines for prosecution. While such a progression brings about certain benefits, it is not without its challenges and may be motivated (though not exclusively by extra-legal considerations such as politics and populism. Ultimately, only the state and its people can decide on the conception of the rule of law that it subscribes to, and it is with humble hope that this article may be used as a reference point when future issues pertaining to prosecutorial discretion are considered.

Boundary Fixed Points, Enhanced Gauge Symmetry and Singular Bundles on K3

CERN Document Server

Fuchs, J; Lerche, Wolfgang; Lütken, C A; Schweigert, C; Walcher, J

2001-01-01

We investigate certain fixed points in the boundary conformal field theory representation of type IIA D-branes on Gepner points of K3. They correspond geometrically to degenerate brane configurations, and physically lead to enhanced gauge symmetries on the world-volume. Non-abelian gauge groups arise if the stabilizer group of the fixed points is realized projectively, which is similar to D-branes on orbifolds with discrete torsion. Moreover, the fixed point boundary states can be resolved into several irreducible components. These correspond to bound states at threshold and can be viewed as (non-locally free) sub-sheaves of semi-stable sheaves. Thus, the BCFT fixed points appear to carry two-fold geometrical information: on the one hand they probe the boundary of the instanton moduli space on K3, on the other hand they probe discrete torsion in D-geometry.

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.

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.

Computational domain discretization in numerical analysis of flow within granular materials

Science.gov (United States)

Sosnowski, Marcin

2018-06-01

The discretization of computational domain is a crucial step in Computational Fluid Dynamics (CFD) because it influences not only the numerical stability of the analysed model but also the agreement of obtained results and real data. Modelling flow in packed beds of granular materials is a very challenging task in terms of discretization due to the existence of narrow spaces between spherical granules contacting tangentially in a single point. Standard approach to this issue results in a low quality mesh and unreliable results in consequence. Therefore the common method is to reduce the diameter of the modelled granules in order to eliminate the single-point contact between the individual granules. The drawback of such method is the adulteration of flow and contact heat resistance among others. Therefore an innovative method is proposed in the paper: single-point contact is extended to a cylinder-shaped volume contact. Such approach eliminates the low quality mesh elements and simultaneously introduces only slight distortion to the flow as well as contact heat transfer. The performed analysis of numerous test cases prove the great potential of the proposed method of meshing the packed beds of granular materials.

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

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.

Discrete instability in the DNA double helix

International Nuclear Information System (INIS)

Tabi, Conrad Bertrand; Mohamadou, Alidou; Kofane, Timoleon Crepin

2009-06-01

Modulational instability (MI) is explored in the framework of the base-rotor model of DNA dynamics. We show in fact that, the helicoidal coupling introduced in the spin model of DNA reduces the system to a modified discrete sine-Gordon (sG) equation. The MI criterion is thus modified and displays interesting features because of the helicoidal coupling. This is confirmed in the numerical analysis where a critical value of the helicoidal coupling constant is derived. In the simulations, we have found that a train of pulses are generated when the lattice is subjected to MI, in agreement with analytical results obtained in a modified discrete sG equation. Also, the competitive effects of the harmonic longitudinal and helicoidal constants on the dynamics of the system are notably pointed out. In the same way, it is shown that MI can lead to energy localization which is high for some values of the helicoidal coupling constant. (author)

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)

Multiple periodic solutions for a fourth-order discrete Hamiltonian system

Directory of Open Access Journals (Sweden)

Yongkun Li

2010-12-01

Full Text Available By means of a three critical points theorem proposed by Brezis and Nirenberg and a general version of Mountain Pass Theorem, we obtain some multiplicity results for periodic solutions of a fourth-order discrete Hamiltonian system Δ4u(t-2+∇ F(t,u(t=0 for all t∈ Z.

Combined discrete nebulization and microextraction process for molybdenum determination by flame atomic absorption spectrometry (FAAS)

International Nuclear Information System (INIS)

Oviedo, Jenny A.; Jesus, Amanda M.D. de; Fialho, Lucimar L.; Pereira-Filho, Edenir R.

2014-01-01

Simple and sensitive procedures for the extraction/preconcentration of molybdenum based on vortex-assisted solidified floating organic drop microextraction (VA-SFODME) and cloud point combined with flame absorption atomic spectrometry (FAAS) and discrete nebulization were developed. The influence of the discrete nebulization on the sensitivity of the molybdenum preconcentration processes was studied. An injection volume of 200 μ resulted in a lower relative standard deviation with both preconcentration procedures. Enrichment factors of 31 and 67 and limits of detection of 25 and 5 μ L -1 were obtained for cloud point and VA-SFODME, respectively. The developed procedures were applied to the determination of Mo in mineral water and multivitamin samples. (author)

Multi-Agent Rendezvousing with a Finite Set of Candidate Rendezvous Points

NARCIS (Netherlands)

Fang, J.; Morse, A. S.; Cao, M.

2008-01-01

The discrete multi-agent rendezvous problem we consider in this paper is concerned with a specified set of points in the plane, called “dwell-points,” and a set of mobile autonomous agents with limited sensing range. Each agent is initially positioned at some dwell-point, and is able to determine

Kato's chaos in set-valued discrete systems

International Nuclear Information System (INIS)

Gu Rongbao

2007-01-01

In this paper, we investigate the relationships between Kato's chaoticity of a dynamical system (X,f) and Kato's chaoticity of the set-valued discrete system (K(X),f-bar ) associated to (X,f), where X is a compact metric space and f:X->X is a continuous map. We show that Kato's chaoticity of (K(X),f-bar ) implies the Kato's chaoticity of (X,f) in general and (X,f) is chaotic in the sense of Kato if and only if (K(X),f-bar ) is Kato chaotic in w e -topology. We also show that Ruelle-Takens' chaoticity implies Kato's chaoticity for a continuous map with a fixed point from a complete metric space without isolated point into itself

Computing the Gromov hyperbolicity constant of a discrete metric space

KAUST Repository

Ismail, Anas

2012-07-01

Although it was invented by Mikhail Gromov, in 1987, to describe some family of groups[1], the notion of Gromov hyperbolicity has many applications and interpretations in different fields. It has applications in Biology, Networking, Graph Theory, and many other areas of research. The Gromov hyperbolicity constant of several families of graphs and geometric spaces has been determined. However, so far, the only known algorithm for calculating the Gromov hyperbolicity constant δ of a discrete metric space is the brute force algorithm with running time O (n4) using the four-point condition. In this thesis, we first introduce an approximation algorithm which calculates a O (log n)-approximation of the hyperbolicity constant δ, based on a layering approach, in time O(n2), where n is the number of points in the metric space. We also calculate the fixed base point hyperbolicity constant δr for a fixed point r using a (max, min)−matrix multiplication algorithm by Duan in time O(n2.688)[2]. We use this result to present a 2-approximation algorithm for calculating the hyper-bolicity constant in time O(n2.688). We also provide an exact algorithm to compute the hyperbolicity constant δ in time O(n3.688) for a discrete metric space. We then present some partial results we obtained for designing some approximation algorithms to compute the hyperbolicity constant δ.

Examining Passenger Flow Choke Points at Airports Using Discrete Event Simulation

Science.gov (United States)

Brown, Jeremy R.; Madhavan, Poomima

2011-01-01

The movement of passengers through an airport quickly, safely, and efficiently is the main function of the various checkpoints (check-in, security. etc) found in airports. Human error combined with other breakdowns in the complex system of the airport can disrupt passenger flow through the airport leading to lengthy waiting times, missing luggage and missed flights. In this paper we present a model of passenger flow through an airport using discrete event simulation that will provide a closer look into the possible reasons for breakdowns and their implications for passenger flow. The simulation is based on data collected at Norfolk International Airport (ORF). The primary goal of this simulation is to present ways to optimize the work force to keep passenger flow smooth even during peak travel times and for emergency preparedness at ORF in case of adverse events. In this simulation we ran three different scenarios: real world, increased check-in stations, and multiple waiting lines. Increased check-in stations increased waiting time and instantaneous utilization. while the multiple waiting lines decreased both the waiting time and instantaneous utilization. This simulation was able to show how different changes affected the passenger flow through the airport.

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

Allee effect in a discrete-time predator-prey system

International Nuclear Information System (INIS)

Celik, Canan; Duman, Oktay

2009-01-01

In this paper, we study the stability of a discrete-time predator-prey system with and without Allee effect. By analyzing both systems, we first obtain local stability conditions of the equilibrium points without the Allee effect and then exhibit the impact of the Allee effect on stability when it is imposed on prey population. We also show the stabilizing effect of Allee effect by numerical simulations and verify that when the prey population is subject to an Allee effect, the trajectory of the solutions approximates to the corresponding equilibrium point much faster. Furthermore, for some fixed parameter values satisfying necessary conditions, we show that the corresponding equilibrium point moves from instability to stability under the Allee effect on prey population.

Theory and simulation of discrete kinetic beta induced Alfven eigenmode in tokamak plasmas

International Nuclear Information System (INIS)

Wang, X; Zonca, F; Chen, L

2010-01-01

It is shown, both analytically and by numerical simulations, that, in the presence of thermal ion kinetic effects, the beta induced Alfven eigenmode (BAE)-shear Alfven wave continuous spectrum can be discretized into radially trapped eigenstates known as kinetic BAE (KBAE). While thermal ion compressibility gives rise to finite BAE accumulation point frequency, the discretization occurs via the finite Larmor radius and finite orbit width effects. Simulations and analytical theories agree both qualitatively and quantitatively. Simulations also demonstrate that KBAE can be readily excited by the finite radial gradients of energetic particles.

TMACS I/O termination point listing. Revision 1

Energy Technology Data Exchange (ETDEWEB)

Scaief, C.C. III

1994-09-13

This document provides a listing of all analog and discrete input/output (I/O) points connected to the Tank Monitor and Control System (TMACS). The list also provides other information such as the point tag name, termination location, description, drawing references and other parameters. The purpose is to define each point`s unique tag name and to cross reference the point with other associated information that may be necessary for activities such as maintenance, calibration, diagnostics, or design changes. It provides a list in one document of all I/O points that would otherwise only be available by referring to all I/O termination drawings.

Explore Stochastic Instabilities of Periodic Points by Transition Path Theory

Science.gov (United States)

Cao, Yu; Lin, Ling; Zhou, Xiang

2016-06-01

We consider the noise-induced transitions from a linearly stable periodic orbit consisting of T periodic points in randomly perturbed discrete logistic map. Traditional large deviation theory and asymptotic analysis at small noise limit cannot distinguish the quantitative difference in noise-induced stochastic instabilities among the T periodic points. To attack this problem, we generalize the transition path theory to the discrete-time continuous-space stochastic process. In our first criterion to quantify the relative instability among T periodic points, we use the distribution of the last passage location related to the transitions from the whole periodic orbit to a prescribed disjoint set. This distribution is related to individual contributions to the transition rate from each periodic points. The second criterion is based on the competency of the transition paths associated with each periodic point. Both criteria utilize the reactive probability current in the transition path theory. Our numerical results for the logistic map reveal the transition mechanism of escaping from the stable periodic orbit and identify which periodic point is more prone to lose stability so as to make successful transitions under random perturbations.

Rainbow-shift mechanism behind discrete optical-potential ambiguities

International Nuclear Information System (INIS)

Brandan, M.E.; McVoy, K.W.

1991-01-01

Some years ago, Drisko et al. suggested that the discrete ambiguity often encountered for elastic scattering optical potentials could be understood as being due to the interior or small-l S-matrix elements for two ''equivalent'' potentials differing in phase by 2π, l-by-l. We point out that the absence of this phase change for peripheral partial waves is equally essential, and suggest that a deeper understanding of the ambiguity may be achieved by viewing it as a consequence of a farside interference between interior and peripheral partial waves. It is this interference which produces the broad ''Airy maxima'' of a nuclear rainbow, and we show that a Drisko-type phase-shift increment δ l →(δ l +π) for low-l phases relative to the high-l ones is exactly what is needed to shift a farside rainbow pattern by one Airy maximum, thus providing an equivalent ''rainbow-shift'' interpretation of the discrete ambiguity. The physical importance of both interpretations lies in the fact that the existence of discrete ambiguities (as well as of nuclear rainbows) is explicit evidence for low-l transparency in nucleus-nucleus collisions. The essential role played by low partial waves explains why peripheral reactions have generally not proven helpful in resolving this ambiguity

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.

Discrete-to-continuum modelling of weakly interacting incommensurate two-dimensional lattices.

Science.gov (United States)

Español, Malena I; Golovaty, Dmitry; Wilber, J Patrick

2018-01-01

In this paper, we derive a continuum variational model for a two-dimensional deformable lattice of atoms interacting with a two-dimensional rigid lattice. The starting point is a discrete atomistic model for the two lattices which are assumed to have slightly different lattice parameters and, possibly, a small relative rotation. This is a prototypical example of a three-dimensional system consisting of a graphene sheet suspended over a substrate. We use a discrete-to-continuum procedure to obtain the continuum model which recovers both qualitatively and quantitatively the behaviour observed in the corresponding discrete model. The continuum model predicts that the deformable lattice develops a network of domain walls characterized by large shearing, stretching and bending deformation that accommodates the misalignment and/or mismatch between the deformable and rigid lattices. Two integer-valued parameters, which can be identified with the components of a Burgers vector, describe the mismatch between the lattices and determine the geometry and the details of the deformation associated with the domain walls.

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.

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

Benchmarking of EPRI-cell epithermal methods with the point-energy discrete-ordinates code (OZMA)

International Nuclear Information System (INIS)

Williams, M.L.; Wright, R.Q.; Barhen, J.; Rothenstein, W.

1982-01-01

The purpose of the present study is to benchmark E-C resonance-shielding and cell-averaging methods against a rigorous deterministic solution on a fine-group level (approx. 30 groups between 1 eV and 5.5 keV). The benchmark code used is OZMA, which solves the space-dependent slowing-down equations using continuous-energy discrete ordinates or integral transport theory to produce fine-group cross sections. Results are given for three water-moderated lattices - a mixed oxide, a uranium method, and a tight-pitch high-conversion uranium oxide configuration. The latter two lattices were chosen because of the strong self shielding of the 238 U resonances

Discrete geometric structures for architecture

KAUST Repository

Pottmann, Helmut

2010-06-13

The emergence of freeform structures in contemporary architecture raises numerous challenging research problems, most of which are related to the actual fabrication and are a rich source of research topics in geometry and geometric computing. The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization of supporting beams and nodes. A study of quadrilateral meshes with planar faces reveals beautiful relations to discrete differential geometry. In particular, we discuss meshes which discretize the network of principal curvature lines. Conical meshes are among these meshes; they possess conical offset meshes at a constant face/face distance, which in turn leads to a supporting beam layout with so-called torsion free nodes. This work can be generalized to a variety of multilayer structures and laid the ground for an adapted curvature theory for these meshes. There are also efforts on segmenting surfaces into planar hexagonal panels. Though these are less constrained than planar quadrilateral panels, this problem is still waiting for an elegant solution. Inspired by freeform designs in architecture which involve circles and spheres, we present a new kind of triangle mesh whose faces\\' in-circles form a packing, i.e., the in-circles of two triangles with a common edge have the same contact point on that edge. These "circle packing (CP) meshes" exhibit an aesthetic balance of shape and size of their faces. They are closely tied to sphere packings on surfaces and to various remarkable structures and patterns which are of interest in art, architecture, and design. CP meshes constitute a new link between architectural freeform design and computational conformal geometry. Recently, certain timber structures motivated us to study discrete patterns of geodesics on surfaces. This

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.

Notes on qubit phase space and discrete symplectic structures

International Nuclear Information System (INIS)

Livine, Etera R

2010-01-01

We start from Wootter's construction of discrete phase spaces and Wigner functions for qubits and more generally for finite-dimensional Hilbert spaces. We look at this framework from a non-commutative space perspective and we focus on the Moyal product and the differential calculus on these discrete phase spaces. In particular, the qubit phase space provides the simplest example of a four-point non-commutative phase space. We give an explicit expression of the Moyal bracket as a differential operator. We then compare the quantum dynamics encoded by the Moyal bracket to the classical dynamics: we show that the classical Poisson bracket does not satisfy the Jacobi identity thus leaving the Moyal bracket as the only consistent symplectic structure. We finally generalize our analysis to Hilbert spaces of prime dimensions d and their associated d x d phase spaces.

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

TMACS I/O termination point listing. Revision 1

International Nuclear Information System (INIS)

Scaief, C.C. III.

1994-01-01

This document provides a listing of all analog and discrete input/output (I/O) points connected to the Tank Monitor and Control System (TMACS). The list also provides other information such as the point tag name, termination location, description, drawing references and other parameters. The purpose is to define each point's unique tag name and to cross reference the point with other associated information that may be necessary for activities such as maintenance, calibration, diagnostics, or design changes. It provides a list in one document of all I/O points that would otherwise only be available by referring to all I/O termination drawings

Computing the Gromov hyperbolicity of a discrete metric space

KAUST Repository

Fournier, Hervé

2015-02-12

We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space. We observe that computing the Gromov hyperbolicity from a fixed base-point reduces to a (max,min) matrix product. Hence, using the (max,min) matrix product algorithm by Duan and Pettie, the fixed base-point hyperbolicity can be determined in O(n2.69) time. It follows that the Gromov hyperbolicity can be computed in O(n3.69) time, and a 2-approximation can be found in O(n2.69) time. We also give a (2log2⁡n)-approximation algorithm that runs in O(n2) time, based on a tree-metric embedding by Gromov. We also show that hyperbolicity at a fixed base-point cannot be computed in O(n2.05) time, unless there exists a faster algorithm for (max,min) matrix multiplication than currently known.

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

Parametric statistical change point analysis

CERN Document Server

Chen, Jie

2000-01-01

This work is an in-depth study of the change point problem from a general point of view and a further examination of change point analysis of the most commonly used statistical models Change point problems are encountered in such disciplines as economics, finance, medicine, psychology, signal processing, and geology, to mention only several The exposition is clear and systematic, with a great deal of introductory material included Different models are presented in each chapter, including gamma and exponential models, rarely examined thus far in the literature Other models covered in detail are the multivariate normal, univariate normal, regression, and discrete models Extensive examples throughout the text emphasize key concepts and different methodologies are used, namely the likelihood ratio criterion, and the Bayesian and information criterion approaches A comprehensive bibliography and two indices complete the study

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.

Police investigations: discretion denied yet undeniably exercised

Science.gov (United States)

Belur, J.; Tilley, N.; Osrin, D.; Daruwalla, N.; Kumar, M.; Tiwari, V.

2014-01-01

Police investigations involve determining whether a crime has been committed, and if so what type of crime, who has committed it and whether there is the evidence to charge the perpetrators. Drawing on fieldwork in Delhi and Mumbai, this paper explores how police investigations unfolded in the specific context of women’s deaths by burning in India. In particular, it focuses on the use of discretion despite its denial by those exercising it. In India, there are distinctive statutes relating to women’s suspicious deaths, reflecting the widespread expectation that the bride’s family will pay a dowry to the groom’s family and the tensions to which this may on occasion give rise in the early years of a marriage. Often, there are conflicting claims influencing how the woman’s death is classified. These in turn affect police investigation. The nature and direction of police discretion in investigating women’s deaths by burning reflect in part the unique nature of the legislation and the particular sensitivities in relation to these types of death. They also highlight processes that are liable to be at work in any crime investigation. It was found that police officers exercised unacknowledged discretion at seven specific points in the investigative process, with potentially significant consequences for the achievement of just outcomes: first response, recording the victim’s ‘dying declaration’, inquest, registering of the ‘First Information Report’, collecting evidence, arrest and framing of the charges. PMID:26376482

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.

Bifurcation Analysis and Chaos Control in a Discrete Epidemic System

Directory of Open Access Journals (Sweden)

Wei Tan

2015-01-01

Full Text Available The dynamics of discrete SI epidemic model, which has been obtained by the forward Euler scheme, is investigated in detail. By using the center manifold theorem and bifurcation theorem in the interior R+2, the specific conditions for the existence of flip bifurcation and Neimark-Sacker bifurcation have been derived. Numerical simulation not only presents our theoretical analysis but also exhibits rich and complex dynamical behavior existing in the case of the windows of period-1, period-3, period-5, period-6, period-7, period-9, period-11, period-15, period-19, period-23, period-34, period-42, and period-53 orbits. Meanwhile, there appears the cascade of period-doubling 2, 4, 8 bifurcation and chaos sets from the fixed point. These results show the discrete model has more richer dynamics compared with the continuous model. The computations of the largest Lyapunov exponents more than 0 confirm the chaotic behaviors of the system x→x+δ[rN(1-N/K-βxy/N-(μ+mx], y→y+δ[βxy/N-(μ+dy]. Specifically, the chaotic orbits at an unstable fixed point are stabilized by using the feedback control method.

SURFACE FITTING FILTERING OF LIDAR POINT CLOUD WITH WAVEFORM INFORMATION

Directory of Open Access Journals (Sweden)

S. Xing

2017-09-01

Full Text Available Full-waveform LiDAR is an active technology of photogrammetry and remote sensing. It provides more detailed information about objects along the path of a laser pulse than discrete-return topographic LiDAR. The point cloud and waveform information with high quality can be obtained by waveform decomposition, which could make contributions to accurate filtering. The surface fitting filtering method with waveform information is proposed to present such advantage. Firstly, discrete point cloud and waveform parameters are resolved by global convergent Levenberg Marquardt decomposition. Secondly, the ground seed points are selected, of which the abnormal ones are detected by waveform parameters and robust estimation. Thirdly, the terrain surface is fitted and the height difference threshold is determined in consideration of window size and mean square error. Finally, the points are classified gradually with the rising of window size. The filtering process is finished until window size is larger than threshold. The waveform data in urban, farmland and mountain areas from “WATER (Watershed Allied Telemetry Experimental Research” are selected for experiments. Results prove that compared with traditional method, the accuracy of point cloud filtering is further improved and the proposed method has highly practical value.

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.

Using high-order methods on adaptively refined block-structured meshes - discretizations, interpolations, and filters.

Energy Technology Data Exchange (ETDEWEB)

Ray, Jaideep; Lefantzi, Sophia; Najm, Habib N.; Kennedy, Christopher A.

2006-01-01

Block-structured adaptively refined meshes (SAMR) strive for efficient resolution of partial differential equations (PDEs) solved on large computational domains by clustering mesh points only where required by large gradients. Previous work has indicated that fourth-order convergence can be achieved on such meshes by using a suitable combination of high-order discretizations, interpolations, and filters and can deliver significant computational savings over conventional second-order methods at engineering error tolerances. In this paper, we explore the interactions between the errors introduced by discretizations, interpolations and filters. We develop general expressions for high-order discretizations, interpolations, and filters, in multiple dimensions, using a Fourier approach, facilitating the high-order SAMR implementation. We derive a formulation for the necessary interpolation order for given discretization and derivative orders. We also illustrate this order relationship empirically using one and two-dimensional model problems on refined meshes. We study the observed increase in accuracy with increasing interpolation order. We also examine the empirically observed order of convergence, as the effective resolution of the mesh is increased by successively adding levels of refinement, with different orders of discretization, interpolation, or filtering.

Controlling the chaotic discrete-Hénon system using a feedforward neural network with an adaptive learning rate

OpenAIRE

GÖKCE, Kürşad; UYAROĞLU, Yılmaz

2013-01-01

This paper proposes a feedforward neural network-based control scheme to control the chaotic trajectories of a discrete-Hénon map in order to stay within an acceptable distance from the stable fixed point. An adaptive learning back propagation algorithm with online training is employed to improve the effectiveness of the proposed method. The simulation study carried in the discrete-Hénon system verifies the validity of the proposed control system.

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.

A simple method of chaos control for a class of chaotic discrete-time systems

International Nuclear Information System (INIS)

Jiang Guoping; Zheng Weixing

2005-01-01

In this paper, a simple method is proposed for chaos control for a class of discrete-time chaotic systems. The proposed method is built upon the state feedback control and the characteristic of ergodicity of chaos. The feedback gain matrix of the controller is designed using a simple criterion, so that control parameters can be selected via the pole placement technique of linear control theory. The new controller has a feature that it only uses the state variable for control and does not require the target equilibrium point in the feedback path. Moreover, the proposed control method cannot only overcome the so-called 'odd eigenvalues number limitation' of delayed feedback control, but also control the chaotic systems to the specified equilibrium points. The effectiveness of the proposed method is demonstrated by a two-dimensional discrete-time chaotic system

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

Coupled Hybrid Continuum-Discrete Model of Tumor Angiogenesis and Growth.

Directory of Open Access Journals (Sweden)

Jie Lyu

Full Text Available The processes governing tumor growth and angiogenesis are codependent. To study the relationship between them, we proposed a coupled hybrid continuum-discrete model. In this model, tumor cells, their microenvironment (extracellular matrixes, matrix-degrading enzymes, and tumor angiogenic factors, and their network of blood vessels, described by a series of discrete points, were considered. The results of numerical simulation reveal the process of tumor growth and the change in microenvironment from avascular to vascular stage, indicating that the network of blood vessels develops gradually as the tumor grows. Our findings also reveal that a tumor is divided into three regions: necrotic, semi-necrotic, and well-vascularized. The results agree well with the previous relevant studies and physiological facts, and this model represents a platform for further investigations of tumor therapy.

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.

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.

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.

Gaussian quadrature and lattice discretization of the Fermi-Dirac distribution for graphene.

Science.gov (United States)

Oettinger, D; Mendoza, M; Herrmann, H J

2013-07-01

We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as the weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use these polynomials to expand the respective distribution in a moving frame, for both cases, undoped and doped graphene. In order to discretize the Boltzmann equation and make feasible the numerical implementation, we reduce the number of discrete points in momentum space to 18 by applying a Gaussian quadrature, finding that the family of representative wave (2+1)-vectors, which satisfies the quadrature, reconstructs a honeycomb lattice. The procedure and discrete model are validated by solving the Riemann problem, finding excellent agreement with other numerical models. In addition, we have extended the Riemann problem to the case of different dopings, finding that by increasing the chemical potential the electronic fluid behaves as if it increases its effective viscosity.

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

Discrete least squares polynomial approximation with random evaluations - application to PDEs with Random parameters

KAUST Repository

Nobile, Fabio

2015-01-01

the parameter-to-solution map u(y) from random noise-free or noisy observations in random points by discrete least squares on polynomial spaces. The noise-free case is relevant whenever the technique is used to construct metamodels, based on polynomial

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

Anisotropy, propagation failure, and wave speedup in traveling waves of discretizations of a Nagumo PDE

International Nuclear Information System (INIS)

Elmer, Christopher E.; Vleck, Erik S. van

2003-01-01

This article is concerned with effect of spatial and temporal discretizations on traveling wave solutions to parabolic PDEs (Nagumo type) possessing piecewise linear bistable nonlinearities. Solution behavior is compared in terms of waveforms and in terms of the so-called (a,c) relationship where a is a parameter controlling the bistable nonlinearity by varying the potential energy difference of the two phases and c is the wave speed of the traveling wave. Uniform spatial discretizations and A(α) stable linear multistep methods in time are considered. Results obtained show that although the traveling wave solutions to parabolic PDEs are stationary for only one value of the parameter a,a 0 , spatial discretization of these PDEs produce traveling waves which are stationary for a nontrivial interval of a values which include a 0 , i.e., failure of the solution to propagate in the presence of a driving force. This is true no matter how wide the interface is with respect to the discretization. For temporal discretizations at large wave speeds the set of parameter a values for which there are traveling wave solutions is constrained. An analysis of a complete discretization points out the potential for nonuniqueness in the (a,c) relationship

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.

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)

On the stability analysis of a general discrete-time population model involving predation and Allee effects

International Nuclear Information System (INIS)

Merdan, H.; Duman, O.

2009-01-01

This paper presents the stability analysis of equilibrium points of a general discrete-time population dynamics involving predation with and without Allee effects which occur at low population density. The mathematical analysis and numerical simulations show that the Allee effect has a stabilizing role on the local stability of the positive equilibrium points of this model.

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.

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)

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.

One-dimensional Schroedinger operators with interactions singular on a discrete set

International Nuclear Information System (INIS)

Gesztesy, F.; Kirsch, W.

We study the self-adjointness of Schroedinger operators -d 2 /dx 2 +V(x) on an arbitrary interval, (a,b) with V(x) locally integrable on (a,b)inverse slantX where X is a discrete set. The treatment of quantum mechanical systems describing point interactions or periodic (possibly strongly singular) potentials is thereby included and explicit examples are presented. (orig.)

Analysis of the stability and accuracy of the discrete least-squares approximation on multivariate polynomial spaces

KAUST Repository

Migliorati, Giovanni

2016-01-01

We review the main results achieved in the analysis of the stability and accuracy of the discrete leastsquares approximation on multivariate polynomial spaces, with noiseless evaluations at random points, noiseless evaluations at low

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)

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.

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

KAUST Repository

Migliorati, Giovanni; Nobile, Fabio; von Schwerin, Erik; Tempone, Raul

2014-01-01

We analyze the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is uncertainty quantification for computational models. We prove an optimal convergence estimate, up to a logarithmic factor, in the univariate case, when the observation points are sampled in a bounded domain from a probability density function bounded away from zero and bounded from above, provided the number of samples scales quadratically with the dimension of the polynomial space. Optimality is meant in the sense that the weighted L2 norm of the error committed by the random discrete projection is bounded with high probability from above by the best L∞ error achievable in the given polynomial space, up to logarithmic factors. Several numerical tests are presented in both the univariate and multivariate cases, confirming our theoretical estimates. The numerical tests also clarify how the convergence rate depends on the number of sampling points, on the polynomial degree, and on the smoothness of the target function. © 2014 SFoCM.

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

KAUST Repository

Migliorati, Giovanni

2014-03-05

We analyze the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is uncertainty quantification for computational models. We prove an optimal convergence estimate, up to a logarithmic factor, in the univariate case, when the observation points are sampled in a bounded domain from a probability density function bounded away from zero and bounded from above, provided the number of samples scales quadratically with the dimension of the polynomial space. Optimality is meant in the sense that the weighted L2 norm of the error committed by the random discrete projection is bounded with high probability from above by the best L∞ error achievable in the given polynomial space, up to logarithmic factors. Several numerical tests are presented in both the univariate and multivariate cases, confirming our theoretical estimates. The numerical tests also clarify how the convergence rate depends on the number of sampling points, on the polynomial degree, and on the smoothness of the target function. © 2014 SFoCM.

TQ-bifurcations in discrete dynamical systems: Analysis of qualitative rearrangements of the oscillation mode

Energy Technology Data Exchange (ETDEWEB)

Makarenko, A. V., E-mail: avm.science@mail.ru [Constructive Cybernetics Research Group (Russian Federation)

2016-10-15

A new class of bifurcations is defined in discrete dynamical systems, and methods for their diagnostics and the analysis of their properties are presented. The TQ-bifurcations considered are implemented in discrete mappings and are related to the qualitative rearrangement of the shape of trajectories in an extended space of states. Within the demonstration of the main capabilities of the toolkit, an analysis is carried out of a logistic mapping in a domain to the right of the period-doubling limit point. Five critical values of the parameter are found for which the geometric structure of the trajectories of the mapping experiences a qualitative rearrangement. In addition, an analysis is carried out of the so-called “trace map,” which arises in the problems of quantum-mechanical description of various properties of discrete crystalline and quasicrystalline lattices.

Discretization and Numerical Solution of a Plane Problem in the Mechanics of Interfacial Cracks

Science.gov (United States)

Khoroshun, L. P.

2017-01-01

The Fourier transform is used to reduce the linear plane problem of the tension of a body with an interfacial crack to a system of dual equations for the transformed stresses and, then, to a system of integro-differential equations for the difference of displacements of the crack faces. After discretization, this latter system transforms into a system of algebraic equations for displacements of the crack faces. The effect of the bielastic constant and the number of discretization points on the half-length of the crack faces and the distribution of stresses at the interface is studied

Critical points for finite Fibonacci chains of point delta-interactions and orthogonal polynomials

International Nuclear Information System (INIS)

De Prunele, E

2011-01-01

For a one-dimensional Schroedinger operator with a finite number n of point delta-interactions with a common intensity, the parameters are the intensity, the n - 1 intercenter distances and the mass. Critical points are points in the parameters space of the Hamiltonian where one bound state appears or disappears. The study of critical points for Hamiltonians with point delta-interactions arranged along a Fibonacci chain is shown to be closely related to the study of the so-called Fibonacci operator, a discrete one-dimensional Schroedinger-type operator, which occurs in the context of tight binding Hamiltonians. These critical points are the zeros of orthogonal polynomials previously studied in the context of special diatomic linear chains with elastic nearest-neighbor interaction. Properties of the zeros (location, asymptotic behavior, gaps, ...) are investigated. The perturbation series from the solvable periodic case is determined. The measure which yields orthogonality is investigated numerically from the zeros. It is shown that the transmission coefficient at zero energy can be expressed in terms of the orthogonal polynomials and their associated polynomials. In particular, it is shown that when the number of point delta-interactions is equal to a Fibonacci number minus 1, i.e. when the intervals between point delta-interactions form a palindrome, all the Fibonacci chains at critical points are completely transparent at zero energy. (paper)

Dynamic generation of light states with discrete symmetries

Science.gov (United States)

Cordero, S.; Nahmad-Achar, E.; Castaños, O.; López-Peña, R.

2018-01-01

A dynamic procedure is established within the generalized Tavis-Cummings model to generate light states with discrete point symmetries, given by the cyclic group Cn. We consider arbitrary dipolar coupling strengths of the atoms with a one-mode electromagnetic field in a cavity. The method uses mainly the matter-field entanglement properties of the system, which can be extended to any number of three-level atoms. An initial state constituted by the superposition of two states with definite total excitation numbers, |ψ〉 M1,and |ψ〉 M 2, is considered. It can be generated by the proper selection of the time of flight of an atom passing through the cavity. We demonstrate that the resulting Husimi function of the light is invariant under cyclic point transformations of order n =| M1-M2| .

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

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.

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.

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.

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)

Euler-Poincare reduction for discrete field theories

International Nuclear Information System (INIS)

Vankerschaver, Joris

2007-01-01

In this note, we develop a theory of Euler-Poincare reduction for discrete Lagrangian field theories. We introduce the concept of Euler-Poincare equations for discrete field theories, as well as a natural extension of the Moser-Veselov scheme, and show that both are equivalent. The resulting discrete field equations are interpreted in terms of discrete differential geometry. An application to the theory of discrete harmonic mappings is also briefly discussed

Positivity for Convective Semi-discretizations

KAUST Repository

Fekete, Imre

2017-04-19

We propose a technique for investigating stability properties like positivity and forward invariance of an interval for method-of-lines discretizations, and apply the technique to study positivity preservation for a class of TVD semi-discretizations of 1D scalar hyperbolic conservation laws. This technique is a generalization of the approach suggested in Khalsaraei (J Comput Appl Math 235(1): 137–143, 2010). We give more relaxed conditions on the time-step for positivity preservation for slope-limited semi-discretizations integrated in time with explicit Runge–Kutta methods. We show that the step-size restrictions derived are sharp in a certain sense, and that many higher-order explicit Runge–Kutta methods, including the classical 4th-order method and all non-confluent methods with a negative Butcher coefficient, cannot generally maintain positivity for these semi-discretizations under any positive step size. We also apply the proposed technique to centered finite difference discretizations of scalar hyperbolic and parabolic problems.

Integrable discretizations of the short pulse equation

International Nuclear Information System (INIS)

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

2010-01-01

In this paper, we propose integrable semi-discrete and full-discrete analogues of the short pulse (SP) equation. The key construction is the bilinear form and determinant structure of solutions of the SP equation. We also give the determinant formulas of N-soliton solutions of the semi-discrete and full-discrete analogues of the SP equations, from which the multi-loop and multi-breather solutions can be generated. In the continuous limit, the full-discrete SP equation converges to the semi-discrete SP equation, and then to the continuous SP equation. Based on the semi-discrete SP equation, an integrable numerical scheme, i.e. a self-adaptive moving mesh scheme, is proposed and used for the numerical computation of the short pulse equation.

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

Discrete integrable systems and deformations of associative algebras

International Nuclear Information System (INIS)

Konopelchenko, B G

2009-01-01

Interrelations between discrete deformations of the structure constants for associative algebras and discrete integrable systems are reviewed. Theory of deformations for associative algebras is presented. Closed left ideal generated by the elements representing the multiplication table plays a central role in this theory. Deformations of the structure constants are generated by the deformation driving algebra and governed by the central system of equations. It is demonstrated that many discrete equations such as discrete Boussinesq equation, discrete WDVV equation, discrete Schwarzian KP and BKP equations, discrete Hirota-Miwa equations for KP and BKP hierarchies are particular realizations of the central system. An interaction between the theories of discrete integrable systems and discrete deformations of associative algebras is reciprocal and fruitful. An interpretation of the Menelaus relation (discrete Schwarzian KP equation), discrete Hirota-Miwa equation for KP hierarchy, consistency around the cube as the associativity conditions and the concept of gauge equivalence, for instance, between the Menelaus and KP configurations are particular examples.

Four point functions in the SL(2,R) WZW model

Energy Technology Data Exchange (ETDEWEB)

Minces, Pablo [Instituto de Astronomia y Fisica del Espacio (IAFE), C.C. 67 Suc. 28, 1428 Buenos Aires (Argentina)]. E-mail: minces@iafe.uba.ar; Nunez, Carmen [Instituto de Astronomia y Fisica del Espacio (IAFE), C.C. 67 Suc. 28, 1428 Buenos Aires (Argentina) and Physics Department, University of Buenos Aires, Ciudad Universitaria, Pab. I, 1428 Buenos Aires (Argentina)]. E-mail: carmen@iafe.uba.ar

2007-04-19

We consider winding conserving four point functions in the SL(2,R) WZW model for states in arbitrary spectral flow sectors. We compute the leading order contribution to the expansion of the amplitudes in powers of the cross ratio of the four points on the worldsheet, both in the m- and x-basis, with at least one state in the spectral flow image of the highest weight discrete representation. We also perform certain consistency check on the winding conserving three point functions.

Four point functions in the SL(2,R) WZW model

International Nuclear Information System (INIS)

Minces, Pablo; Nunez, Carmen

2007-01-01

We consider winding conserving four point functions in the SL(2,R) WZW model for states in arbitrary spectral flow sectors. We compute the leading order contribution to the expansion of the amplitudes in powers of the cross ratio of the four points on the worldsheet, both in the m- and x-basis, with at least one state in the spectral flow image of the highest weight discrete representation. We also perform certain consistency check on the winding conserving three point functions

Geometry and Hamiltonian mechanics on discrete spaces

International Nuclear Information System (INIS)

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

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to provide a discrete analogue of differential geometry, and to define on these discrete models a formal discrete Hamiltonian structure-in doing so we try to bring together various fundamental concepts from numerical analysis, differential geometry, algebraic geometry, simplicial homology and classical Hamiltonian mechanics. For example, the concept of a twisted derivation is borrowed from algebraic geometry for developing a discrete calculus. The theory is applied to a nonlinear pendulum and we compare the dynamics obtained through a discrete modelling approach with the dynamics obtained via the usual discretization procedures. Also an example of an energy-conserving algorithm on a simple harmonic oscillator is presented, and its effect on the Poisson structure is discussed

A Price-Based Demand Response Scheme for Discrete Manufacturing in Smart Grids

Directory of Open Access Journals (Sweden)

Zhe Luo

2016-08-01

Full Text Available Demand response (DR is a key technique in smart grid (SG technologies for reducing energy costs and maintaining the stability of electrical grids. Since manufacturing is one of the major consumers of electrical energy, implementing DR in factory energy management systems (FEMSs provides an effective way to manage energy in manufacturing processes. Although previous studies have investigated DR applications in process manufacturing, they were not conducted for discrete manufacturing. In this study, the state-task network (STN model is implemented to represent a discrete manufacturing system. On this basis, a DR scheme with a specific DR algorithm is applied to a typical discrete manufacturing—automobile manufacturing—and operational scenarios are established for the stamping process of the automobile production line. The DR scheme determines the optimal operating points for the stamping process using mixed integer linear programming (MILP. The results show that parts of the electricity demand can be shifted from peak to off-peak periods, reducing a significant overall energy costs without degrading production processes.

Discrete port-Hamiltonian systems : mixed interconnections

NARCIS (Netherlands)

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

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

Parity-breaking front bifurcation in bistable media: link between discrete and continuous versions

International Nuclear Information System (INIS)

Pazo, Diego; Deza, Roberto R.; Perez-Munuzuri, Vicente

2005-01-01

The effect of space-discretization in the onset of traveling fronts in symmetrically bistable media is studied. For the FitzHugh-Nagumo model stable standing and propagating front solutions coexist. In the continuum limit this region of coexistence shrinks to a (double-zero eigenvalue) point. The unfolding of this point severely restricts the possible scenarios for the transition from standing to propagating fronts, such that the route described here and the one reported in [Phys. Rev. E 64 (2001) 065203(R)] are the most typical scenarios

Discrete Model for the Structure and Strength of Cementitious Materials

Science.gov (United States)

Balopoulos, Victor D.; Archontas, Nikolaos; Pantazopoulou, Stavroula J.

2017-12-01

Cementitious materials are characterized by brittle behavior in direct tension and by transverse dilatation (due to microcracking) under compression. Microcracking causes increasingly larger transverse strains and a phenomenological Poisson's ratio that gradually increases to about ν =0.5 and beyond, at the limit point in compression. This behavior is due to the underlying structure of cementitious pastes which is simulated here with a discrete physical model. The computational model is generic, assembled from a statistically generated, continuous network of flaky dendrites consisting of cement hydrates that emanate from partially hydrated cement grains. In the actual amorphous material, the dendrites constitute the solid phase of the cement gel and interconnect to provide the strength and stiffness against load. The idealized dendrite solid is loaded in compression and tension to compute values for strength and Poisson's effects. Parametric studies are conducted, to calibrate the statistical parameters of the discrete model with the physical and mechanical characteristics of the material, so that the familiar experimental trends may be reproduced. The model provides a framework for the study of the mechanical behavior of the material under various states of stress and strain and can be used to model the effects of additives (e.g., fibers) that may be explicitly simulated in the discrete structure.

Lie Symmetry Analysis of the Inhomogeneous Toda Lattice Equation via Semi-Discrete Exterior Calculus

Science.gov (United States)

Liu, Jiang; Wang, Deng-Shan; Yin, Yan-Bin

2017-06-01

In this work, the Lie point symmetries of the inhomogeneous Toda lattice equation are obtained by semi-discrete exterior calculus, which is a semi-discrete version of Harrison and Estabrook’s geometric approach. A four-dimensional Lie algebra and its one-, two- and three-dimensional subalgebras are given. Two similarity reductions of the inhomogeneous Toda lattice equation are obtained by using the symmetry vectors. Supported by National Natural Science Foundation of China under Grant Nos. 11375030, 11472315, and Department of Science and Technology of Henan Province under Grant No. 162300410223 and Beijing Finance Funds of Natural Science Program for Excellent Talents under Grant No. 2014000026833ZK19

Introductory discrete mathematics

CERN Document Server

Balakrishnan, V K

2010-01-01

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.Chapters 0-3 cover fundamental operations involv

Bayesian inference for multivariate point processes observed at sparsely distributed times

DEFF Research Database (Denmark)

Rasmussen, Jakob Gulddahl; Møller, Jesper; Aukema, B.H.

We consider statistical and computational aspects of simulation-based Bayesian inference for a multivariate point process which is only observed at sparsely distributed times. For specicity we consider a particular data set which has earlier been analyzed by a discrete time model involving unknown...... normalizing constants. We discuss the advantages and disadvantages of using continuous time processes compared to discrete time processes in the setting of the present paper as well as other spatial-temporal situations. Keywords: Bark beetle, conditional intensity, forest entomology, Markov chain Monte Carlo...

PLOTTAB, Curve and Point Plotting with Error Bars

International Nuclear Information System (INIS)

1999-01-01

1 - Description of program or function: PLOTTAB is designed to plot any combination of continuous curves and/or discrete points (with associated error bars) using user supplied titles and X and Y axis labels and units. If curves are plotted, the first curve may be used as a standard; the data and the ratio of the data to the standard will be plotted. 2 - Method of solution: PLOTTAB: The program has no idea of what data is being plotted and yet by supplying titles, X and Y axis labels and units the user can produce any number of plots with each plot containing almost any combination of curves and points with each plot properly identified. In order to define a continuous curve between tabulated points, this program must know how to interpolate between points. By input the user may specify either the default option of linear x versus linear y interpolation or alternatively log x and/or log Y interpolation. In all cases, regardless of the interpolation specified, the program will always interpolate the data to the plane of the plot (linear or log x and y plane) in order to present the true variation of the data between tabulated points, based on the user specified interpolation law. Tabulated points should be tabulated at a sufficient number of x values to insure that the difference between the specified interpolation and the 'true' variation of a curve between tabulated values is relatively small. 3 - Restrictions on the complexity of the problem: A combination of up to 30 curves and sets of discrete points may appear on each plot. If the user wishes to use this program to compare different sets of data, all of the data must be in the same units

Diffraction efficiency of photothermoplastic layers for the recording of discrete holograms

Science.gov (United States)

Koreshev, S. N.; Cherkasov, Yu. A.; Kislovskiy, I. L.

1987-01-01

An experimental and theoretical study of the dependence of eta of a digital phase Fourier hologram of a point object on the amount of deformation delta and the discrete-structure parameters representing the hologram is detailed. An expression is given for eta. Experiments were performed on photothermoplastic layers based on polyvinyl carbazole and trinitrofluorenone charge transfer complexes. The maximum eta, 2%, is found at delta = 0.56 micron.

Spiral patterns near Turing instability in a discrete reaction diffusion system

International Nuclear Information System (INIS)

Li, Meifeng; Han, Bo; Xu, Li; Zhang, Guang

2013-01-01

In this paper, linear stability analysis is applied to an exponential discrete Lotka–Volterra system, which describes the competition between two identical species. Conditions for the Turing instability are obtained and the emergence of spiral patterns is demonstrated by means of numerical simulations in the vicinity of the bifurcation point. Moreover, the impact of crucial system parameters on the stability and coherence of spiral patterns is illustrated on several examples

Flows about a rotating circular cylinder by the discrete-vortex method

Science.gov (United States)

Kimura, Takeyoshi; Tsutahara, Michihisa

1987-01-01

A numerical study has been conducted for flows past a rotating circular cylinder at high Reynolds numbers, using the discrete-vortex method. It is noted that the reverse Magnus effect is caused by the retreat of the separation point on the acceleration side. At high rotating speed, the nascent vortices of opposite directions are mixed faster, the wake becomes narrower, and predominating frequencies in the lift force disappear.

ANALISA BREAK EVENT POINT (BEP TERHADAP LABA PERUSAHAAN

Directory of Open Access Journals (Sweden)

Muhammad Yusuf

2015-09-01

Full Text Available Break event point or the break-even point can be defined as a situation where the operating company does not make a profit and not a loss. The goal is to provide the knowledge to increase knowledge about the break event point (the point of principal and its relationship with the company profit and to know how the results of the. Analysis break event point is very important for the leadership of the company to determine the production rate how much the cost will be equal to the amount of sales or in other words to determine the break event point we will determine the relationship between sales, production, selling price, cost, loss or profit, making it easier for leaders to take discretion.DOI: 10.15408/ess.v4i1.1955 

Adaptive Dynamic Programming for Discrete-Time Zero-Sum Games.

Science.gov (United States)

Wei, Qinglai; Liu, Derong; Lin, Qiao; Song, Ruizhuo

2018-04-01

In this paper, a novel adaptive dynamic programming (ADP) algorithm, called "iterative zero-sum ADP algorithm," is developed to solve infinite-horizon discrete-time two-player zero-sum games of nonlinear systems. The present iterative zero-sum ADP algorithm permits arbitrary positive semidefinite functions to initialize the upper and lower iterations. A novel convergence analysis is developed to guarantee the upper and lower iterative value functions to converge to the upper and lower optimums, respectively. When the saddle-point equilibrium exists, it is emphasized that both the upper and lower iterative value functions are proved to converge to the optimal solution of the zero-sum game, where the existence criteria of the saddle-point equilibrium are not required. If the saddle-point equilibrium does not exist, the upper and lower optimal performance index functions are obtained, respectively, where the upper and lower performance index functions are proved to be not equivalent. Finally, simulation results and comparisons are shown to illustrate the performance of the present method.

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)

Cuspidal discrete series for projective hyperbolic spaces

DEFF Research Database (Denmark)

Andersen, Nils Byrial; Flensted-Jensen, Mogens

2013-01-01

Abstract. We have in [1] proposed a definition of cusp forms on semisimple symmetric spaces G/H, involving the notion of a Radon transform and a related Abel transform. For the real non-Riemannian hyperbolic spaces, we showed that there exists an infinite number of cuspidal discrete series......, and at most finitely many non-cuspidal discrete series, including in particular the spherical discrete series. For the projective spaces, the spherical discrete series are the only non-cuspidal discrete series. Below, we extend these results to the other hyperbolic spaces, and we also study the question...

Sparse signal reconstruction from polychromatic X-ray CT measurements via mass attenuation discretization

International Nuclear Information System (INIS)

Gu, Renliang; Dogandžić, Aleksandar

2014-01-01

We propose a method for reconstructing sparse images from polychromatic x-ray computed tomography (ct) measurements via mass attenuation coefficient discretization. The material of the inspected object and the incident spectrum are assumed to be unknown. We rewrite the Lambert-Beer’s law in terms of integral expressions of mass attenuation and discretize the resulting integrals. We then present a penalized constrained least-squares optimization approach for reconstructing the underlying object from log-domain measurements, where an active set approach is employed to estimate incident energy density parameters and the nonnegativity and sparsity of the image density map are imposed using negative-energy and smooth ℓ 1 -norm penalty terms. We propose a two-step scheme for refining the mass attenuation discretization grid by using higher sampling rate over the range with higher photon energy, and eliminating the discretization points that have little effect on accuracy of the forward projection model. This refinement allows us to successfully handle the characteristic lines (Dirac impulses) in the incident energy density spectrum. We compare the proposed method with the standard filtered backprojection, which ignores the polychromatic nature of the measurements and sparsity of the image density map. Numerical simulations using both realistic simulated and real x-ray ct data are presented

Local and global dynamics of Ramsey model: From continuous to discrete time.

Science.gov (United States)

Guzowska, Malgorzata; Michetti, Elisabetta

2018-05-01

The choice of time as a discrete or continuous variable may radically affect equilibrium stability in an endogenous growth model with durable consumption. In the continuous-time Ramsey model [F. P. Ramsey, Econ. J. 38(152), 543-559 (1928)], the steady state is locally saddle-path stable with monotonic convergence. However, in the discrete-time version, the steady state may be unstable or saddle-path stable with monotonic or oscillatory convergence or periodic solutions [see R.-A. Dana et al., Handbook on Optimal Growth 1 (Springer, 2006) and G. Sorger, Working Paper No. 1505 (2015)]. When this occurs, the discrete-time counterpart of the continuous-time model is not consistent with the initial framework. In order to obtain a discrete-time Ramsey model preserving the main properties of the continuous-time counterpart, we use a general backward and forward discretisation as initially proposed by Bosi and Ragot [Theor. Econ. Lett. 2(1), 10-15 (2012)]. The main result of the study here presented is that, with this hybrid discretisation method, fixed points and local dynamics do not change. For what it concerns global dynamics, i.e., long-run behavior for initial conditions taken on the state space, we mainly perform numerical analysis with the main scope of comparing both qualitative and quantitative evolution of the two systems, also varying some parameters of interest.

On stability of fixed points and chaos in fractional systems.

Science.gov (United States)

Edelman, Mark

2018-02-01

In this paper, we propose a method to calculate asymptotically period two sinks and define the range of stability of fixed points for a variety of discrete fractional systems of the order 0chaos is impossible in the corresponding continuous fractional systems.

Discrete-Event Simulation

OpenAIRE

Prateek Sharma

2015-01-01

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

Positivity for Convective Semi-discretizations

KAUST Repository

Fekete, Imre; Ketcheson, David I.; Loczi, Lajos

2017-01-01

We propose a technique for investigating stability properties like positivity and forward invariance of an interval for method-of-lines discretizations, and apply the technique to study positivity preservation for a class of TVD semi-discretizations

Discrete symmetries in periodic-orbit theory

International Nuclear Information System (INIS)

Robbins, J.M.

1989-01-01

The application of periodic-orbit theory to systems which possess a discrete symmetry is considered. A semiclassical expression for the symmetry-projected Green's function is obtained; it involves a sum over classical periodic orbits on a symmetry-reduced phase space, weighted by characters of the symmetry group. These periodic orbits correspond to trajectories on the full phase space which are not necessarily periodic, but whose end points are related by symmetry. If the symmetry-projected Green's functions are summed, the contributions of the unperiodic orbits cancel, and one recovers the usual periodic-orbit sum for the full Green's function. Several examples are considered, including the stadium billiard, a particle in a periodic potential, the Sinai billiard, the quartic oscillator, and the rotational spectrum of SF 6

Perfect discretization of reparametrization invariant path integrals

International Nuclear Information System (INIS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-01-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Perfect discretization of reparametrization invariant path integrals

Science.gov (United States)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

High-temperature discrete dislocation plasticity

Science.gov (United States)

Keralavarma, S. M.; Benzerga, A. A.

2015-09-01

A framework for solving problems of dislocation-mediated plasticity coupled with point-defect diffusion is presented. The dislocations are modeled as line singularities embedded in a linear elastic medium while the point defects are represented by a concentration field as in continuum diffusion theory. Plastic flow arises due to the collective motion of a large number of dislocations. Both conservative (glide) and nonconservative (diffusion-mediated climb) motions are accounted for. Time scale separation is contingent upon the existence of quasi-equilibrium dislocation configurations. A variational principle is used to derive the coupled governing equations for point-defect diffusion and dislocation climb. Superposition is used to obtain the mechanical fields in terms of the infinite-medium discrete dislocation fields and an image field that enforces the boundary conditions while the point-defect concentration is obtained by solving the stress-dependent diffusion equations on the same finite-element grid. Core-level boundary conditions for the concentration field are avoided by invoking an approximate, yet robust kinetic law. Aspects of the formulation are general but its implementation in a simple plane strain model enables the modeling of high-temperature phenomena such as creep, recovery and relaxation in crystalline materials. With emphasis laid on lattice vacancies, the creep response of planar single crystals in simple tension emerges as a natural outcome in the simulations. A large number of boundary-value problem solutions are obtained which depict transitions from diffusional to power-law creep, in keeping with long-standing phenomenological theories of creep. In addition, some unique experimental aspects of creep in small scale specimens are also reproduced in the simulations.

Pilot points method for conditioning multiple-point statistical facies simulation on flow data

Science.gov (United States)

Ma, Wei; Jafarpour, Behnam

2018-05-01

We propose a new pilot points method for conditioning discrete multiple-point statistical (MPS) facies simulation on dynamic flow data. While conditioning MPS simulation on static hard data is straightforward, their calibration against nonlinear flow data is nontrivial. The proposed method generates conditional models from a conceptual model of geologic connectivity, known as a training image (TI), by strategically placing and estimating pilot points. To place pilot points, a score map is generated based on three sources of information: (i) the uncertainty in facies distribution, (ii) the model response sensitivity information, and (iii) the observed flow data. Once the pilot points are placed, the facies values at these points are inferred from production data and then are used, along with available hard data at well locations, to simulate a new set of conditional facies realizations. While facies estimation at the pilot points can be performed using different inversion algorithms, in this study the ensemble smoother (ES) is adopted to update permeability maps from production data, which are then used to statistically infer facies types at the pilot point locations. The developed method combines the information in the flow data and the TI by using the former to infer facies values at selected locations away from the wells and the latter to ensure consistent facies structure and connectivity where away from measurement locations. Several numerical experiments are used to evaluate the performance of the developed method and to discuss its important properties.

Discrete Curvature Theories and Applications

KAUST Repository

Sun, Xiang

2016-08-25

Discrete Di erential Geometry (DDG) concerns discrete counterparts of notions and methods in di erential geometry. This thesis deals with a core subject in DDG, discrete curvature theories on various types of polyhedral surfaces that are practically important for free-form architecture, sunlight-redirecting shading systems, and face recognition. Modeled as polyhedral surfaces, the shapes of free-form structures may have to satisfy di erent geometric or physical constraints. We study a combination of geometry and physics { the discrete surfaces that can stand on their own, as well as having proper shapes for the manufacture. These proper shapes, known as circular and conical meshes, are closely related to discrete principal curvatures. We study curvature theories that make such surfaces possible. Shading systems of freeform building skins are new types of energy-saving structures that can re-direct the sunlight. From these systems, discrete line congruences across polyhedral surfaces can be abstracted. We develop a new curvature theory for polyhedral surfaces equipped with normal congruences { a particular type of congruences de ned by linear interpolation of vertex normals. The main results are a discussion of various de nitions of normality, a detailed study of the geometry of such congruences, and a concept of curvatures and shape operators associated with the faces of a triangle mesh. These curvatures are compatible with both normal congruences and the Steiner formula. In addition to architecture, we consider the role of discrete curvatures in face recognition. We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold, which is an extension of the classical notion of asymptotic directions. We get a simple expression of these cones for polyhedral surfaces, as well as convergence and approximation theorems. We use the asymptotic cones as facial descriptors and demonstrate the

Schroedinger operators with point interactions and short range expansions

International Nuclear Information System (INIS)

Albeverio, S.; Hoeegh-Krohn, R.; Oslo Univ.

1984-01-01

We give a survey of recent results concerning Schroedinger operators with point interactions in R 3 . In the case where the point interactions are located at a discrete set of points we discuss results about the resolvent, the spectrum, the resonances and the scattering quantities. We also discuss the approximation of point interactions by short range local potentials (short range or low energy expansions) and the one electron model of a 3-dimensional crystal. Moreover we discuss Schroedinger operators with Coulomb plus point interactions, with applications to the determination of scattering lengths and of level shifts in mesic atoms. Further applications to the multiple well problem, to multiparticle systems, to crystals with random impurities, to polymers and quantum fields are also briefly discussed. (orig.)

Second-degree discrete Painleve equations conceal first-degree ones

International Nuclear Information System (INIS)

Ramani, A; Grammaticos, B; Joshi, N

2010-01-01

We examine various second-degree difference equations which have been proposed over the years and according to their authors' claims should be integrable. This study is motivated by the fact that we consider that second-degree discrete systems cannot be integrable due to the proliferation of the images (and pre-images) of the initial point. We show that in the present cases no contradiction exists. In all cases examined, we show that there exists an underlying integrable first-degree mapping which allows us to obtain an appropriate solution of the second-degree one.

Orthogonal functions, discrete variable representation, and generalized gauss quadratures

DEFF Research Database (Denmark)

Schneider, B. I.; Nygaard, Nicolai

2002-01-01

in the original representation. This has been exploited in bound-state, scattering, and time-dependent problems using the so-called, discrete variable representation (DVR). At the core of this approach is the mathematical three-term recursion relationship satisfied by the classical orthogonal functions...... functions, this is not the case. However, they may be computed in a stable numerical fashion, via the recursion. In essence, this is an application of the well-known Lanczos recursion approach. Once the recursion coefficients are known, it is possible to compute the points and weights of quadratures on...

Control of Discrete Event Systems

NARCIS (Netherlands)

Smedinga, Rein

1989-01-01

Systemen met discrete gebeurtenissen spelen in vele gebieden een rol. In dit proefschrift staat de volgorde van gebeurtenissen centraal en worden tijdsaspecten buiten beschouwing gelaten. In dat geval kunnen systemen met discrete gebeurtenissen goed worden gemodelleerd door gebruik te maken van

Connections on discrete fibre bundles

International Nuclear Information System (INIS)

Manton, N.S.; Cambridge Univ.

1987-01-01

A new approach to gauge fields on a discrete space-time is proposed, in which the fundamental object is a discrete version of a principal fibre bundle. If the bundle is twisted, the gauge fields are topologically non-trivial automatically. (orig.)

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

IDENTIFYING FRACTURE ORIGIN IN CERAMICS BY COMBINATION OF NONDESTRUCTIVE TESTING AND DISCRETE ELEMENT ANALYSIS

International Nuclear Information System (INIS)

Senapati, Rajeev; Zhang Jianmei

2010-01-01

Advanced ceramic materials have been extensively applied in aerospace, automobile and other industries. However, the reliability of the advanced ceramics is a major concern because of the brittle nature of the materials. In this paper, combination of nondestructive testing and numerical modeling Discrete Element Method is proposed to identify the fracture origin in ceramics. The nondestructive testing--laser scattering technology is first performed on the ceramic components to reveal the machining-induced damage such as cracks and the material-inherent flaws such as voids, then followed by the four point bending test. Discrete Element software package PFC 2D is used to simulate the four point bending test and try to identify where the fractures start. The numerical representation of the ceramic materials is done by generating a densely packed particle system using the specimen genesis procedure and then applying the suitable microparameters to the particle system. Simulation of four point bending test is performed on materials having no defects, materials having manufacturing-induced defects like cracks, and materials having material-inherent flaws like voids. The initiation and propagation of defects is modeled and the mean contact force on the loading ball is also plotted. The simulation prediction results are well in accordance with the nondestructive testing results.

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

Handbook on modelling for discrete optimization

CERN Document Server

Pitsoulis, Leonidas; Williams, H

2006-01-01

The primary objective underlying the Handbook on Modelling for Discrete Optimization is to demonstrate and detail the pervasive nature of Discrete Optimization. While its applications cut across an incredibly wide range of activities, many of the applications are only known to specialists. It is the aim of this handbook to correct this. It has long been recognized that "modelling" is a critically important mathematical activity in designing algorithms for solving these discrete optimization problems. Nevertheless solving the resultant models is also often far from straightforward. In recent years it has become possible to solve many large-scale discrete optimization problems. However, some problems remain a challenge, even though advances in mathematical methods, hardware, and software technology have pushed the frontiers forward. This handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It will be done in an academic handbook treatment...

Discrete Gabor transform and discrete Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Namazi, N.M.; Matthews, K.

1996-01-01

Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e. the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of

Statistical and Probabilistic Extensions to Ground Operations' Discrete Event Simulation Modeling

Science.gov (United States)

Trocine, Linda; Cummings, Nicholas H.; Bazzana, Ashley M.; Rychlik, Nathan; LeCroy, Kenneth L.; Cates, Grant R.

2010-01-01

NASA's human exploration initiatives will invest in technologies, public/private partnerships, and infrastructure, paving the way for the expansion of human civilization into the solar system and beyond. As it is has been for the past half century, the Kennedy Space Center will be the embarkation point for humankind's journey into the cosmos. Functioning as a next generation space launch complex, Kennedy's launch pads, integration facilities, processing areas, launch and recovery ranges will bustle with the activities of the world's space transportation providers. In developing this complex, KSC teams work through the potential operational scenarios: conducting trade studies, planning and budgeting for expensive and limited resources, and simulating alternative operational schemes. Numerous tools, among them discrete event simulation (DES), were matured during the Constellation Program to conduct such analyses with the purpose of optimizing the launch complex for maximum efficiency, safety, and flexibility while minimizing life cycle costs. Discrete event simulation is a computer-based modeling technique for complex and dynamic systems where the state of the system changes at discrete points in time and whose inputs may include random variables. DES is used to assess timelines and throughput, and to support operability studies and contingency analyses. It is applicable to any space launch campaign and informs decision-makers of the effects of varying numbers of expensive resources and the impact of off nominal scenarios on measures of performance. In order to develop representative DES models, methods were adopted, exploited, or created to extend traditional uses of DES. The Delphi method was adopted and utilized for task duration estimation. DES software was exploited for probabilistic event variation. A roll-up process was used, which was developed to reuse models and model elements in other less - detailed models. The DES team continues to innovate and expand

Discrete Feature Model (DFM) User Documentation

Energy Technology Data Exchange (ETDEWEB)

Geier, Joel (Clearwater Hardrock Consulting, Corvallis, OR (United States))

2008-06-15

This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this

Discrete Feature Model (DFM) User Documentation

International Nuclear Information System (INIS)

Geier, Joel

2008-06-01

This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this software, the

Introduction to the discrete Fourier series considering both mathematical and engineering aspects - A linear-algebra approach

Directory of Open Access Journals (Sweden)

Ludwig Kohaupt

2015-12-01

Full Text Available The discrete Fourier series is a valuable tool developed and used by mathematicians and engineers alike. One of the most prominent applications is signal processing. Usually, it is important that the signals be transmitted fast, for example, when transmitting images over large distances such as between the moon and the earth or when generating images in computer tomography. In order to achieve this, appropriate algorithms are necessary. In this context, the fast Fourier transform (FFT plays a key role which is an algorithm for calculating the discrete Fourier transform (DFT; this, in turn, is tightly connected with the discrete Fourier series. The last one itself is the discrete analog of the common (continuous-time Fourier series and is usually learned by mathematics students from a theoretical point of view. The aim of this expository/pedagogical paper is to give an introduction to the discrete Fourier series for both mathematics and engineering students. It is intended to expand the purely mathematical view; the engineering aspect is taken into account by applying the FFT to an example from signal processing that is small enough to be used in class-room teaching and elementary enough to be understood also by mathematics students. The MATLAB program is employed to do the computations.

A novel least-square Fourier algorithm for decomposition of discrete, non-equidistant acquisition data

CERN Document Server

Bouthéon, M; Potier, J P

1977-01-01

A novel procedure for evaluating directly the Fourier series coefficients of a function described by unequally spaced but symmetrically disposed interval discrete points is given and an example illustrated. The procedure's simplicity enables it to be used for harmonic analyses of non-equidistant interval data without using the intermediate curve-fitting techniques. (2 refs).

A constrained Delaunay discretization method for adaptively meshing highly discontinuous geological media

Science.gov (United States)

Wang, Yang; Ma, Guowei; Ren, Feng; Li, Tuo

2017-12-01

A constrained Delaunay discretization method is developed to generate high-quality doubly adaptive meshes of highly discontinuous geological media. Complex features such as three-dimensional discrete fracture networks (DFNs), tunnels, shafts, slopes, boreholes, water curtains, and drainage systems are taken into account in the mesh generation. The constrained Delaunay triangulation method is used to create adaptive triangular elements on planar fractures. Persson's algorithm (Persson, 2005), based on an analogy between triangular elements and spring networks, is enriched to automatically discretize a planar fracture into mesh points with varying density and smooth-quality gradient. The triangulated planar fractures are treated as planar straight-line graphs (PSLGs) to construct piecewise-linear complex (PLC) for constrained Delaunay tetrahedralization. This guarantees the doubly adaptive characteristic of the resulted mesh: the mesh is adaptive not only along fractures but also in space. The quality of elements is compared with the results from an existing method. It is verified that the present method can generate smoother elements and a better distribution of element aspect ratios. Two numerical simulations are implemented to demonstrate that the present method can be applied to various simulations of complex geological media that contain a large number of discontinuities.

Determination of point isotropic buildup factors of gamma rays including incoherent and coherent scattering for aluminum, iron, lead, and water by discrete ordinates method

International Nuclear Information System (INIS)

Kitsos, S.; Assad, A.; Diop, C.M.; Nimal, J.C.

1994-01-01

Exposure and energy absorption buildup factors for aluminum, iron, lead, and water are calculated by the SNID discrete ordinates code for an isotropic point source in a homogeneous medium. The calculation of the buildup factors takes into account the effects of both bound-electron Compton (incoherent) and coherent (Rayleigh) scattering. A comparison with buildup factors from the literature shows that these two effects greatly increase the buildup factors for energies below a few hundred kilo-electron-volts, and thus the new results are improved relative to the experiment. This greater accuracy is due to the increase in the linear attenuation coefficient, which leads to the calculation of the buildup factors for a mean free path with a smaller shield thickness. On the other hand, for the same shield thickness, exposure increases when only incoherent scattering is included and decreases when only coherent scattering is included, so that the exposure finally decreases when both effects are included. Great care must also be taken when checking the approximations for gamma-ray deep-penetration transport calculations, as well as for the cross-section treatment and origin

A Discrete Numerical Scheme of Modified Leslie-Gower With Harvesting Model

Directory of Open Access Journals (Sweden)

Riski Nur Istiqomah Dinnullah

2018-05-01

Full Text Available Recently, exploitation of biological resources and the harvesting of two populations or more are widely practiced, such as fishery or foresty. The simplest way to describe the interaction of two species is by using predator prey model, that is one species feeds on another. The Leslie-Gower predator prey model has been studied in many works. In this paper, we use Euler method to discretisize the modified Leslie-Gower with harvesting model. The model consists of two simultanious predator prey equations. We show numerically that this discrete numerical scheme model is dynamically consistent with its continuous model only for relatively small step-size. By using computer simulation software, we show that equlibrium points can be stable, saddles, and unstable. It is shown that the numerical simulations not only illustrate the results, but also show the rich dynamics behaviors of the discrete system.

Discrete-Time Biomedical Signal Encryption

Directory of Open Access Journals (Sweden)

Victor Grigoraş

2017-12-01

Full Text Available Chaotic modulation is a strong method of improving communication security. Analog and discrete chaotic systems are presented in actual literature. Due to the expansion of digital communication, discrete-time systems become more efficient and closer to actual technology. The present contribution offers an in-depth analysis of the effects chaos encryption produce on 1D and 2D biomedical signals. The performed simulations show that modulating signals are precisely recovered by the synchronizing receiver if discrete systems are digitally implemented and the coefficients precisely correspond. Channel noise is also applied and its effects on biomedical signal demodulation are highlighted.

The origin of discrete particles

CERN Document Server

Bastin, T

2009-01-01

This book is a unique summary of the results of a long research project undertaken by the authors on discreteness in modern physics. In contrast with the usual expectation that discreteness is the result of mathematical tools for insertion into a continuous theory, this more basic treatment builds up the world from the discrimination of discrete entities. This gives an algebraic structure in which certain fixed numbers arise. As such, one agrees with the measured value of the fine-structure constant to one part in 10,000,000 (10 7 ). Sample Chapter(s). Foreword (56 KB). Chapter 1: Introduction

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea; Kyza, Irene; Nochetto, Ricardo H.

2013-01-01

on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time

Discrete Data Qualification System and Method Comprising Noise Series Fault Detection

Science.gov (United States)

Fulton, Christopher; Wong, Edmond; Melcher, Kevin; Bickford, Randall

2013-01-01

A Sensor Data Qualification (SDQ) function has been developed that allows the onboard flight computers on NASA s launch vehicles to determine the validity of sensor data to ensure that critical safety and operational decisions are not based on faulty sensor data. This SDQ function includes a novel noise series fault detection algorithm for qualification of the output data from LO2 and LH2 low-level liquid sensors. These sensors are positioned in a launch vehicle s propellant tanks in order to detect propellant depletion during a rocket engine s boost operating phase. This detection capability can prevent the catastrophic situation where the engine operates without propellant. The output from each LO2 and LH2 low-level liquid sensor is a discrete valued signal that is expected to be in either of two states, depending on whether the sensor is immersed (wet) or exposed (dry). Conventional methods for sensor data qualification, such as threshold limit checking, are not effective for this type of signal due to its discrete binary-state nature. To address this data qualification challenge, a noise computation and evaluation method, also known as a noise fault detector, was developed to detect unreasonable statistical characteristics in the discrete data stream. The method operates on a time series of discrete data observations over a moving window of data points and performs a continuous examination of the resulting observation stream to identify the presence of anomalous characteristics. If the method determines the existence of anomalous results, the data from the sensor is disqualified for use by other monitoring or control functions.

Discrete ellipsoidal statistical BGK model and Burnett equations

Science.gov (United States)

Zhang, Yu-Dong; Xu, Ai-Guo; Zhang, Guang-Cai; Chen, Zhi-Hua; Wang, Pei

2018-06-01

A new discrete Boltzmann model, the discrete ellipsoidal statistical Bhatnagar-Gross-Krook (ESBGK) model, is proposed to simulate nonequilibrium compressible flows. Compared with the original discrete BGK model, the discrete ES-BGK has a flexible Prandtl number. For the discrete ES-BGK model in the Burnett level, two kinds of discrete velocity model are introduced and the relations between nonequilibrium quantities and the viscous stress and heat flux in the Burnett level are established. The model is verified via four benchmark tests. In addition, a new idea is introduced to recover the actual distribution function through the macroscopic quantities and their space derivatives. The recovery scheme works not only for discrete Boltzmann simulation but also for hydrodynamic ones, for example, those based on the Navier-Stokes or the Burnett equations.

Memorized discrete systems and time-delay

CERN Document Server

Luo, Albert C J

2017-01-01

This book examines discrete dynamical systems with memory—nonlinear systems that exist extensively in biological organisms and financial and economic organizations, and time-delay systems that can be discretized into the memorized, discrete dynamical systems. It book further discusses stability and bifurcations of time-delay dynamical systems that can be investigated through memorized dynamical systems as well as bifurcations of memorized nonlinear dynamical systems, discretization methods of time-delay systems, and periodic motions to chaos in nonlinear time-delay systems. The book helps readers find analytical solutions of MDS, change traditional perturbation analysis in time-delay systems, detect motion complexity and singularity in MDS; and determine stability, bifurcation, and chaos in any time-delay system.

Discrete Mathematics and Curriculum Reform.

Science.gov (United States)

Kenney, Margaret J.

1996-01-01

Defines discrete mathematics as the mathematics necessary to effect reasoned decision making in finite situations and explains how its use supports the current view of mathematics education. Discrete mathematics can be used by curriculum developers to improve the curriculum for students of all ages and abilities. (SLD)

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

Computing the discrete fréchet distance with imprecise input

KAUST Repository

Ahn, Heekap

2012-02-01

We consider the problem of computing the discrete Frechet distance between two polyg- onal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in dimension d, we present an algorithm for this problem that returns in time 2 O (d 2)m 2n 2 log 2 (mn) the minimum Frechet distance between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algorithm for the pla- nar case with running time O(mnlog 3 (mn)+(m 2 +n 2) log(mn)). In the d-dimensional orthogonal case, where points are modelled as axis-parallel boxes, and we use the L∞ distance, we give an O(dmnlog(dmn))-time algorithm. We also give effcient O(dmn)-time algorithms to approximate the maximum Frechet distance, as well as the minimum and maximum Frechet distance under translation. These algorithms achieve constant factor approximation ratios in \\ ealistic" settings (such as when the radii of the balls modelling the imprecise points are roughly of the same size). © 2012 World Scientific Publishing Company.

Finite Volume Element (FVE) discretization and multilevel solution of the axisymmetric heat equation

Science.gov (United States)

Litaker, Eric T.

1994-12-01

The axisymmetric heat equation, resulting from a point-source of heat applied to a metal block, is solved numerically; both iterative and multilevel solutions are computed in order to compare the two processes. The continuum problem is discretized in two stages: finite differences are used to discretize the time derivatives, resulting is a fully implicit backward time-stepping scheme, and the Finite Volume Element (FVE) method is used to discretize the spatial derivatives. The application of the FVE method to a problem in cylindrical coordinates is new, and results in stencils which are analyzed extensively. Several iteration schemes are considered, including both Jacobi and Gauss-Seidel; a thorough analysis of these schemes is done, using both the spectral radii of the iteration matrices and local mode analysis. Using this discretization, a Gauss-Seidel relaxation scheme is used to solve the heat equation iteratively. A multilevel solution process is then constructed, including the development of intergrid transfer and coarse grid operators. Local mode analysis is performed on the components of the amplification matrix, resulting in the two-level convergence factors for various combinations of the operators. A multilevel solution process is implemented by using multigrid V-cycles; the iterative and multilevel results are compared and discussed in detail. The computational savings resulting from the multilevel process are then discussed.

A geometric realization of the periodic discrete Toda lattice and its tropicalization

International Nuclear Information System (INIS)

Nobe, Atsushi

2013-01-01

An explicit formula concerning curve intersections equivalent to the time evolution of the periodic discrete Toda lattice (pdTL) is presented. First, the time evolution is realized as a point addition on a hyperelliptic curve, which is the spectral curve of the pdTL, then the point addition is translated into curve intersections. Next, it is shown that the curves which appear in the curve intersections are explicitly given by using the conserved quantities of the pdTL. Finally, the formulation is lifted to the framework of tropical geometry and a tropical geometric realization of the periodic box–ball system is constructed via tropical curve intersections. (paper)

On the discrete Frobenius-Perron operator of the Bernoulli map

International Nuclear Information System (INIS)

Bai Zaiqiao

2006-01-01

We study the spectra of a finite-dimensional Frobenius-Perron operator (matrix) of the Bernoulli map derived from phase space discretization. The eigenvalues and (right and left) eigenvectors are analytically calculated, which are closely related to periodic orbits on the partition points. In the degenerate case, Jordan decomposition of the matrix is explicitly constructed. Except for the isolated eigenvalue 1, there is no definite limit with respect to eigenvalues when n → ∞. The behaviour of the eigenvectors is discussed in the limit of large n

Discrete Fourier Transform in a Complex Vector Space

Science.gov (United States)

Dean, Bruce H. (Inventor)

2015-01-01

An image-based phase retrieval technique has been developed that can be used on board a space based iterative transformation system. Image-based wavefront sensing is computationally demanding due to the floating-point nature of the process. The discrete Fourier transform (DFT) calculation is presented in "diagonal" form. By diagonal we mean that a transformation of basis is introduced by an application of the similarity transform of linear algebra. The current method exploits the diagonal structure of the DFT in a special way, particularly when parts of the calculation do not have to be repeated at each iteration to converge to an acceptable solution in order to focus an image.

A Discrete Model for Color Naming

Science.gov (United States)

Menegaz, G.; Le Troter, A.; Sequeira, J.; Boi, J. M.

2006-12-01

The ability to associate labels to colors is very natural for human beings. Though, this apparently simple task hides very complex and still unsolved problems, spreading over many different disciplines ranging from neurophysiology to psychology and imaging. In this paper, we propose a discrete model for computational color categorization and naming. Starting from the 424 color specimens of the OSA-UCS set, we propose a fuzzy partitioning of the color space. Each of the 11 basic color categories identified by Berlin and Kay is modeled as a fuzzy set whose membership function is implicitly defined by fitting the model to the results of an ad hoc psychophysical experiment (Experiment 1). Each OSA-UCS sample is represented by a feature vector whose components are the memberships to the different categories. The discrete model consists of a three-dimensional Delaunay triangulation of the CIELAB color space which associates each OSA-UCS sample to a vertex of a 3D tetrahedron. Linear interpolation is used to estimate the membership values of any other point in the color space. Model validation is performed both directly, through the comparison of the predicted membership values to the subjective counterparts, as evaluated via another psychophysical test (Experiment 2), and indirectly, through the investigation of its exploitability for image segmentation. The model has proved to be successful in both cases, providing an estimation of the membership values in good agreement with the subjective measures as well as a semantically meaningful color-based segmentation map.

Discrete Painlevé equations: an integrability paradigm

International Nuclear Information System (INIS)

Grammaticos, B; Ramani, A

2014-01-01

In this paper we present a review of results on discrete Painlevé equations. We begin with an introduction which serves as a refresher on the continuous Painlevé equations. Next, in the first, main part of the paper, we introduce the discrete Painlevé equations, the various methods for their derivation, and their properties as well as their classification scheme. Along the way we present a brief summary of the two major discrete integrability detectors and of Quispel–Roberts–Thompson mapping, which plays a primordial role in the derivation of discrete Painlevé equations. The second part of the paper is more technical and focuses on the presentation of new results on what are called asymmetric discrete Painlevé equations. (comment)

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.

From the continuous PV to discrete Painleve equations

International Nuclear Information System (INIS)

Tokihiro, T.; Grammaticos, B.; Ramani, A.

2002-01-01

We study the discrete transformations that are associated with the auto-Baecklund of the (continuous) P V equation. We show that several two-parameter discrete Painleve equations can be obtained as contiguity relations of P V . Among them we find the asymmetric d-P II equation which is a well-known form of discrete P III . The relation between the ternary P I (previously obtained through the discrete dressing approach) and P V is also established. A new discrete Painleve equation is also derived. (author)

Non-Gaussian bias: insights from discrete density peaks

CERN Document Server

Desjacques, Vincent; Riotto, Antonio

2013-01-01

Corrections induced by primordial non-Gaussianity to the linear halo bias can be computed from a peak-background split or the widespread local bias model. However, numerical simulations clearly support the prediction of the former, in which the non-Gaussian amplitude is proportional to the linear halo bias. To understand better the reasons behind the failure of standard Lagrangian local bias, in which the halo overdensity is a function of the local mass overdensity only, we explore the effect of a primordial bispectrum on the 2-point correlation of discrete density peaks. We show that the effective local bias expansion to peak clustering vastly simplifies the calculation. We generalize this approach to excursion set peaks and demonstrate that the resulting non-Gaussian amplitude, which is a weighted sum of quadratic bias factors, precisely agrees with the peak-background split expectation, which is a logarithmic derivative of the halo mass function with respect to the normalisation amplitude. We point out tha...

Model Predictive Control of a Wave Energy Converter with Discrete Fluid Power Power Take-Off System

Directory of Open Access Journals (Sweden)

Anders Hedegaard Hansen

2018-03-01

Full Text Available Wave power extraction algorithms for wave energy converters are normally designed without taking system losses into account leading to suboptimal power extraction. In the current work, a model predictive power extraction algorithm is designed for a discretized power take of system. It is shown how the quantized nature of a discrete fluid power system may be included in a new model predictive control algorithm leading to a significant increase in the harvested power. A detailed investigation of the influence of the prediction horizon and the time step is reported. Furthermore, it is shown how the inclusion of a loss model may increase the energy output. Based on the presented results it is concluded that power extraction algorithms based on model predictive control principles are both feasible and favorable for use in a discrete fluid power power take-off system for point absorber wave energy converters.

Discretely Conservative Finite-Difference Formulations for Nonlinear Conservation Laws in Split Form: Theory and Boundary Conditions

Science.gov (United States)

Fisher, Travis C.; Carpenter, Mark H.; Nordstroem, Jan; Yamaleev, Nail K.; Swanson, R. Charles

2011-01-01

Simulations of nonlinear conservation laws that admit discontinuous solutions are typically restricted to discretizations of equations that are explicitly written in divergence form. This restriction is, however, unnecessary. Herein, linear combinations of divergence and product rule forms that have been discretized using diagonal-norm skew-symmetric summation-by-parts (SBP) operators, are shown to satisfy the sufficient conditions of the Lax-Wendroff theorem and thus are appropriate for simulations of discontinuous physical phenomena. Furthermore, special treatments are not required at the points that are near physical boundaries (i.e., discrete conservation is achieved throughout the entire computational domain, including the boundaries). Examples are presented of a fourth-order, SBP finite-difference operator with second-order boundary closures. Sixth- and eighth-order constructions are derived, and included in E. Narrow-stencil difference operators for linear viscous terms are also derived; these guarantee the conservative form of the combined operator.

Discrete Routh reduction

International Nuclear Information System (INIS)

Jalnapurkar, Sameer M; Leok, Melvin; Marsden, Jerrold E; West, Matthew

2006-01-01

This paper develops the theory of Abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with Abelian symmetry. The reduction of variational Runge-Kutta discretizations is considered, as well as the extent to which symmetry reduction and discretization commute. These reduced methods allow the direct simulation of dynamical features such as relative equilibria and relative periodic orbits that can be obscured or difficult to identify in the unreduced dynamics. The methods are demonstrated for the dynamics of an Earth orbiting satellite with a non-spherical J 2 correction, as well as the double spherical pendulum. The J 2 problem is interesting because in the unreduced picture, geometric phases inherent in the model and those due to numerical discretization can be hard to distinguish, but this issue does not appear in the reduced algorithm, where one can directly observe interesting dynamical structures in the reduced phase space (the cotangent bundle of shape space), in which the geometric phases have been removed. The main feature of the double spherical pendulum example is that it has a non-trivial magnetic term in its reduced symplectic form. Our method is still efficient as it can directly handle the essential non-canonical nature of the symplectic structure. In contrast, a traditional symplectic method for canonical systems could require repeated coordinate changes if one is evoking Darboux' theorem to transform the symplectic structure into canonical form, thereby incurring additional computational cost. Our method allows one to design reduced symplectic integrators in a natural way, despite the non-canonical nature of the symplectic structure

Foundations of a discrete physics

International Nuclear Information System (INIS)

McGoveran, D.; Noyes, P.

1988-01-01

Starting from the principles of finiteness, discreteness, finite computability and absolute nonuniqueness, we develop the ordering operator calculus, a strictly constructive mathematical system having the empirical properties required by quantum mechanical and special relativistic phenomena. We show how to construct discrete distance functions, and both rectangular and spherical coordinate systems(with a discrete version of ''π''). The richest discrete space constructible without a preferred axis and preserving translational and rotational invariance is shown to be a discrete 3-space with the usual symmetries. We introduce a local ordering parameter with local (proper) time-like properties and universal ordering parameters with global (cosmological) time-like properties. Constructed ''attribute velocities'' connect ensembles with attributes that are invariant as the appropriate time-like parameter increases. For each such attribute, we show how to construct attribute velocities which must satisfy the '' relativistic Doppler shift'' and the ''relativistic velocity composition law,'' as well as the Lorentz transformations. By construction, these velocities have finite maximum and minimum values. In the space of all attributes, the minimum of these maximum velocities will predominate in all multiple attribute computations, and hence can be identified as a fundamental limiting velocity, General commutation relations are constructed which under the physical interpretation are shown to reduce to the usual quantum mechanical commutation relations. 50 refs., 18 figs

Efficient triangulation of Poisson-disk sampled point sets

KAUST Repository

Guo, Jianwei

2014-05-06

In this paper, we present a simple yet efficient algorithm for triangulating a 2D input domain containing a Poisson-disk sampled point set. The proposed algorithm combines a regular grid and a discrete clustering approach to speedup the triangulation. Moreover, our triangulation algorithm is flexible and performs well on more general point sets such as adaptive, non-maximal Poisson-disk sets. The experimental results demonstrate that our algorithm is robust for a wide range of input domains and achieves significant performance improvement compared to the current state-of-the-art approaches. © 2014 Springer-Verlag Berlin Heidelberg.

Performance evaluation of block-diagonal preconditioners for the divergence-conforming B-spline discretization of the Stokes system

KAUST Repository

Cô rtes, A.M.A.; Coutinho, A.L.G.A.; Dalcin, L.; Calo, Victor M.

2015-01-01

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf-sup stable and pointwise divergence-free. When applied to discretized Stokes equations, these spaces generate a symmetric and indefinite saddle-point linear system. Krylov subspace methods are usually the most efficient procedures to solve such systems. One of such methods, for symmetric systems, is the Minimum Residual Method (MINRES). However, the efficiency and robustness of Krylov subspace methods is closely tied to appropriate preconditioning strategies. For the discrete Stokes system, in particular, block-diagonal strategies provide efficient preconditioners. In this article, we compare the performance of block-diagonal preconditioners for several block choices. We verify how the eigenvalue clustering promoted by the preconditioning strategies affects MINRES convergence. We also compare the number of iterations and wall-clock timings. We conclude that among the building blocks we tested, the strategy with relaxed inner conjugate gradients preconditioned with incomplete Cholesky provided the best results.

Performance evaluation of block-diagonal preconditioners for the divergence-conforming B-spline discretization of the Stokes system

KAUST Repository

Côrtes, A.M.A.

2015-02-20

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf-sup stable and pointwise divergence-free. When applied to discretized Stokes equations, these spaces generate a symmetric and indefinite saddle-point linear system. Krylov subspace methods are usually the most efficient procedures to solve such systems. One of such methods, for symmetric systems, is the Minimum Residual Method (MINRES). However, the efficiency and robustness of Krylov subspace methods is closely tied to appropriate preconditioning strategies. For the discrete Stokes system, in particular, block-diagonal strategies provide efficient preconditioners. In this article, we compare the performance of block-diagonal preconditioners for several block choices. We verify how the eigenvalue clustering promoted by the preconditioning strategies affects MINRES convergence. We also compare the number of iterations and wall-clock timings. We conclude that among the building blocks we tested, the strategy with relaxed inner conjugate gradients preconditioned with incomplete Cholesky provided the best results.

Disease-induced mortality in density-dependent discrete-time S-I-S epidemic models.

Science.gov (United States)

Franke, John E; Yakubu, Abdul-Aziz

2008-12-01

The dynamics of simple discrete-time epidemic models without disease-induced mortality are typically characterized by global transcritical bifurcation. We prove that in corresponding models with disease-induced mortality a tiny number of infectious individuals can drive an otherwise persistent population to extinction. Our model with disease-induced mortality supports multiple attractors. In addition, we use a Ricker recruitment function in an SIS model and obtained a three component discrete Hopf (Neimark-Sacker) cycle attractor coexisting with a fixed point attractor. The basin boundaries of the coexisting attractors are fractal in nature, and the example exhibits sensitive dependence of the long-term disease dynamics on initial conditions. Furthermore, we show that in contrast to corresponding models without disease-induced mortality, the disease-free state dynamics do not drive the disease dynamics.

(Small) Resonant non-Gaussianities: Signatures of a Discrete Shift Symmetry in the Effective Field Theory of Inflation

Energy Technology Data Exchange (ETDEWEB)

Behbahani, Siavosh R.; /SLAC /Stanford U., Phys. Dept. /Boston U.; Dymarsky, Anatoly; /Princeton, Inst. Advanced Study; Mirbabayi, Mehrdad; /New York U., CCPP /New York U.; Senatore, Leonardo; /Stanford U., Phys. Dept. /KIPAC, Menlo Park

2012-06-06

We apply the Effective Field Theory of Inflation to study the case where the continuous shift symmetry of the Goldstone boson {pi} is softly broken to a discrete subgroup. This case includes and generalizes recently proposed String Theory inspired models of Inflation based on Axion Monodromy. The models we study have the property that the 2-point function oscillates as a function of the wavenumber, leading to oscillations in the CMB power spectrum. The non-linear realization of time diffeomorphisms induces some self-interactions for the Goldstone boson that lead to a peculiar non-Gaussianity whose shape oscillates as a function of the wavenumber. We find that in the regime of validity of the effective theory, the oscillatory signal contained in the n-point correlation functions, with n > 2, is smaller than the one contained in the 2-point function, implying that the signature of oscillations, if ever detected, will be easier to find first in the 2-point function, and only then in the higher order correlation functions. Still the signal contained in higher-order correlation functions, that we study here in generality, could be detected at a subleading level, providing a very compelling consistency check for an approximate discrete shift symmetry being realized during inflation.

Theoretical Basics of Teaching Discrete Mathematics

Directory of Open Access Journals (Sweden)

Y. A. Perminov

2012-01-01

Full Text Available  The paper deals with the research findings concerning the process of mastering the theoretical basics of discrete mathematics by the students of vocational pedagogic profile. The methodological analysis is based on the subject and functions of the modern discrete mathematics and its role in mathematical modeling and computing. The modern discrete mathematics (i.e. mathematics of the finite type structures plays the important role in modernization of vocational training. It is especially rele- vant to training students for vocational pedagogic qualifications, as in the future they will be responsible for training the middle and the senior level specialists in engineer- ing and technical spheres. Nowadays in different industries, there arise the problems which require for their solving both continual – based on the classical mathematical methods – and discrete modeling. The teaching course of discrete mathematics for the future vocational teachers should be relevant to the target qualification and aimed at mastering the mathematical modeling, systems of computer mathematics and computer technologies. The author emphasizes the fundamental role of mastering the language of algebraic and serial structures, as well as the logical, algorithmic, combinatory schemes dominating in dis- crete mathematics. The guidelines for selecting the content of the course in discrete mathematics are specified. The theoretical findings of the research can be put into practice whilst developing curricula and working programs for bachelors and masters’ training. 

Discrete symmetries and their stringy origin

International Nuclear Information System (INIS)

Mayorga Pena, Damian Kaloni

2014-05-01

Discrete symmetries have proven to be very useful in controlling the phenomenology of theories beyond the standard model. In this work we explore how these symmetries emerge from string compactifications. Our approach is twofold: On the one hand, we consider the heterotic string on orbifold backgrounds. In this case the discrete symmetries can be derived from the orbifold conformal field theory, and it can be shown that they are in close relation with the orbifold geometry. We devote special attention to R-symmetries, which arise from discrete remnants of the Lorentz group in compact space. Further we discuss the physical implications of these symmetries both in the heterotic mini-landscape and in newly constructed models based on the Z 2 x Z 4 orbifold. In both cases we observe that the discrete symmetries favor particular locations in the orbifold where the particles of standard model should live. On the other hand we consider a class of F-theory models exhibiting an SU(5) gauge group, times additional U(1) symmetries. In this case, the smooth compactification background does not permit us to track the discrete symmetries as transparently as in orbifold models. Hence, we follow a different approach and search for discrete subgroups emerging after the U(1)s are broken. We observe that in this approach it is possible to obtain the standard Z 2 matter parity of the MSSM.

Exterior difference systems and invariance properties of discrete mechanics

International Nuclear Information System (INIS)

Xie Zheng; Xie Duanqiang; Li Hongbo

2008-01-01

Invariance properties describe the fundamental physical laws in discrete mechanics. Can those properties be described in a geometric way? We investigate an exterior difference system called the discrete Euler-Lagrange system, whose solution has one-to-one correspondence with solutions of discrete Euler-Lagrange equations, and use it to define the first integrals. The preservation of the discrete symplectic form along the discrete Hamilton phase flows and the discrete Noether's theorem is also described in the language of difference forms

Study of intermittent bifurcations and chaos in boost PFC converters by nonlinear discrete models

International Nuclear Information System (INIS)

Zhang Hao; Ma Xikui; Xue Bianling; Liu Weizeng

2005-01-01

This paper mainly deals with nonlinear phenomena like intermittent bifurcations and chaos in boost PFC converters under peak-current control mode. Two nonlinear models in the form of discrete maps are derived to describe precisely the nonlinear dynamics of boost PFC converters from two points of view, i.e., low- and high-frequency regimes. Based on the presented discrete models, both the evolution of intermittent behavior and the periodicity of intermittency are investigated in detail from the fast and slow-scale aspects, respectively. Numerical results show that the occurrence of intermittent bifurcations and chaos with half one line period is one of the most distinguished dynamical characteristics. Finally, we make some instructive conclusions, which prove to be helpful in improving the performances of practical circuits

Discrete breathers in graphane: Effect of temperature

Energy Technology Data Exchange (ETDEWEB)

Baimova, J. A., E-mail: julia.a.baimova@gmail.com [Russian Academy of Sciences, Institute of Metal Physics, Ural Branch (Russian Federation); Murzaev, R. T.; Lobzenko, I. P.; Dmitriev, S. V. [Russian Academy of Sciences, Institute for Metals Superplasticity Problems (Russian Federation); Zhou, Kun [Nanyang Technological University, School of Mechanical and Aerospace Engineering (Singapore)

2016-05-15

The discrete breathers in graphane in thermodynamic equilibrium in the temperature range 50–600 K are studied by molecular dynamics simulation. A discrete breather is a hydrogen atom vibrating along the normal to a sheet of graphane at a high amplitude. As was found earlier, the lifetime of a discrete breather at zero temperature corresponds to several tens of thousands of vibrations. The effect of temperature on the decay time of discrete breathers and the probability of their detachment from a sheet of graphane are studied in this work. It is shown that closely spaced breathers can exchange energy with each other at zero temperature. The data obtained suggest that thermally activated discrete breathers can be involved in the dehydrogenation of graphane, which is important for hydrogen energetics.

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.

Latvian education's uneasy course / Ben Nimmo

Index Scriptorium Estoniae

Nimmo, Ben

2005-01-01

Läti Haridus- ja Teadusministeeriumi andmetel õppis 2004.-2005. õppeaastal 55 protsenti Läti üliõpilastest ärinduse, õiguse ja majandusega seotud erialasid. Haridusministeeriumi kõrghariduse osakonna juhataja Janis Cakste ja Läti Kaubandus- ja Tööstuskoja tegevdirektor Janis Leja annavad ülevaate sellise olukorra põhjustest ning selgitavad insenerierialade populariseerimise vajadust

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.

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

Discrete fractional solutions of a Legendre equation

Science.gov (United States)

Yılmazer, Resat

2018-01-01

One of the most popular research interests of science and engineering is the fractional calculus theory in recent times. Discrete fractional calculus has also an important position in fractional calculus. In this work, we acquire new discrete fractional solutions of the homogeneous and non homogeneous Legendre differential equation by using discrete fractional nabla operator.

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

Science.gov (United States)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2018-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

International Nuclear Information System (INIS)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2016-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

Energy Technology Data Exchange (ETDEWEB)

Mishchenko, Michael I., E-mail: michael.i.mishchenko@nasa.gov [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Dlugach, Janna M. [Main Astronomical Observatory of the National Academy of Sciences of Ukraine, 27 Zabolotny Str., 03680, Kyiv (Ukraine); Yurkin, Maxim A. [Voevodsky Institute of Chemical Kinetics and Combustion, SB RAS, Institutskaya str. 3, 630090 Novosibirsk (Russian Federation); Novosibirsk State University, Pirogova 2, 630090 Novosibirsk (Russian Federation); Bi, Lei [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Cairns, Brian [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Liu, Li [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Columbia University, 2880 Broadway, New York, NY 10025 (United States); Panetta, R. Lee [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Travis, Larry D. [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Yang, Ping [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Zakharova, Nadezhda T. [Trinnovim LLC, 2880 Broadway, New York, NY 10025 (United States)

2016-05-16

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-Principles Modeling Of Electromagnetic Scattering By Discrete and Discretely Heterogeneous Random Media

Science.gov (United States)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2016-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell's equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell- Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell-Lorentz equations, we trace the development of

Discrete Mathematics and Its Applications

Science.gov (United States)

Oxley, Alan

2010-01-01

The article gives ideas that lecturers of undergraduate Discrete Mathematics courses can use in order to make the subject more interesting for students and encourage them to undertake further studies in the subject. It is possible to teach Discrete Mathematics with little or no reference to computing. However, students are more likely to be…

Discrete Calculus as a Bridge between Scales

Science.gov (United States)

Degiuli, Eric; McElwaine, Jim

2012-02-01

Understanding how continuum descriptions of disordered media emerge from the microscopic scale is a fundamental challenge in condensed matter physics. In many systems, it is necessary to coarse-grain balance equations at the microscopic scale to obtain macroscopic equations. We report development of an exact, discrete calculus, which allows identification of discrete microscopic equations with their continuum equivalent [1]. This allows the application of powerful techniques of calculus, such as the Helmholtz decomposition, the Divergence Theorem, and Stokes' Theorem. We illustrate our results with granular materials. In particular, we show how Newton's laws for a single grain reproduce their continuum equivalent in the calculus. This allows introduction of a discrete Airy stress function, exactly as in the continuum. As an application of the formalism, we show how these results give the natural mean-field variation of discrete quantities, in agreement with numerical simulations. The discrete calculus thus acts as a bridge between discrete microscale quantities and continuous macroscale quantities. [4pt] [1] E. DeGiuli & J. McElwaine, PRE 2011. doi: 10.1103/PhysRevE.84.041310

Toward Optimal Manifold Hashing via Discrete Locally Linear Embedding.

Science.gov (United States)

Rongrong Ji; Hong Liu; Liujuan Cao; Di Liu; Yongjian Wu; Feiyue Huang

2017-11-01

Binary code learning, also known as hashing, has received increasing attention in large-scale visual search. By transforming high-dimensional features to binary codes, the original Euclidean distance is approximated via Hamming distance. More recently, it is advocated that it is the manifold distance, rather than the Euclidean distance, that should be preserved in the Hamming space. However, it retains as an open problem to directly preserve the manifold structure by hashing. In particular, it first needs to build the local linear embedding in the original feature space, and then quantize such embedding to binary codes. Such a two-step coding is problematic and less optimized. Besides, the off-line learning is extremely time and memory consuming, which needs to calculate the similarity matrix of the original data. In this paper, we propose a novel hashing algorithm, termed discrete locality linear embedding hashing (DLLH), which well addresses the above challenges. The DLLH directly reconstructs the manifold structure in the Hamming space, which learns optimal hash codes to maintain the local linear relationship of data points. To learn discrete locally linear embeddingcodes, we further propose a discrete optimization algorithm with an iterative parameters updating scheme. Moreover, an anchor-based acceleration scheme, termed Anchor-DLLH, is further introduced, which approximates the large similarity matrix by the product of two low-rank matrices. Experimental results on three widely used benchmark data sets, i.e., CIFAR10, NUS-WIDE, and YouTube Face, have shown superior performance of the proposed DLLH over the state-of-the-art approaches.

Integrals of Motion for Discrete-Time Optimal Control Problems

OpenAIRE

Torres, Delfim F. M.

2003-01-01

We obtain a discrete time analog of E. Noether's theorem in Optimal Control, asserting that integrals of motion associated to the discrete time Pontryagin Maximum Principle can be computed from the quasi-invariance properties of the discrete time Lagrangian and discrete time control system. As corollaries, results for first-order and higher-order discrete problems of the calculus of variations are obtained.

Effective Hamiltonian for travelling discrete breathers

Science.gov (United States)

MacKay, Robert S.; Sepulchre, Jacques-Alexandre

2002-05-01

Hamiltonian chains of oscillators in general probably do not sustain exact travelling discrete breathers. However solutions which look like moving discrete breathers for some time are not difficult to observe in numerics. In this paper we propose an abstract framework for the description of approximate travelling discrete breathers in Hamiltonian chains of oscillators. The method is based on the construction of an effective Hamiltonian enabling one to describe the dynamics of the translation degree of freedom of moving breathers. Error estimate on the approximate dynamics is also studied. The concept of the Peierls-Nabarro barrier can be made clear in this framework. We illustrate the method with two simple examples, namely the Salerno model which interpolates between the Ablowitz-Ladik lattice and the discrete nonlinear Schrödinger system, and the Fermi-Pasta-Ulam chain.

Multilevel discretized random field models with 'spin' correlations for the simulation of environmental spatial data

Science.gov (United States)

Žukovič, Milan; Hristopulos, Dionissios T.

2009-02-01

A current problem of practical significance is how to analyze large, spatially distributed, environmental data sets. The problem is more challenging for variables that follow non-Gaussian distributions. We show by means of numerical simulations that the spatial correlations between variables can be captured by interactions between 'spins'. The spins represent multilevel discretizations of environmental variables with respect to a number of pre-defined thresholds. The spatial dependence between the 'spins' is imposed by means of short-range interactions. We present two approaches, inspired by the Ising and Potts models, that generate conditional simulations of spatially distributed variables from samples with missing data. Currently, the sampling and simulation points are assumed to be at the nodes of a regular grid. The conditional simulations of the 'spin system' are forced to respect locally the sample values and the system statistics globally. The second constraint is enforced by minimizing a cost function representing the deviation between normalized correlation energies of the simulated and the sample distributions. In the approach based on the Nc-state Potts model, each point is assigned to one of Nc classes. The interactions involve all the points simultaneously. In the Ising model approach, a sequential simulation scheme is used: the discretization at each simulation level is binomial (i.e., ± 1). Information propagates from lower to higher levels as the simulation proceeds. We compare the two approaches in terms of their ability to reproduce the target statistics (e.g., the histogram and the variogram of the sample distribution), to predict data at unsampled locations, as well as in terms of their computational complexity. The comparison is based on a non-Gaussian data set (derived from a digital elevation model of the Walker Lake area, Nevada, USA). We discuss the impact of relevant simulation parameters, such as the domain size, the number of

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.

Mittag-Leffler function for discrete fractional modelling

Directory of Open Access Journals (Sweden)

Guo-Cheng Wu

2016-01-01

Full Text Available From the difference equations on discrete time scales, this paper numerically investigates one discrete fractional difference equation in the Caputo delta’s sense which has an explicit solution in form of the discrete Mittag-Leffler function. The exact numerical values of the solutions are given in comparison with the truncated Mittag-Leffler function.

Discrete/PWM Ballast-Resistor Controller

Science.gov (United States)

King, Roger J.

1994-01-01

Circuit offers low switching loss and automatic compensation for failure of ballast resistor. Discrete/PWM ballast-resistor controller improved shunt voltage-regulator circuit designed to supply power from high-resistance source to low-impedance bus. Provides both coarse discrete voltage levels (by switching of ballast resistors) and continuous fine control of voltage via pulse-width modulation.

Quantum phase space points for Wigner functions in finite-dimensional spaces

OpenAIRE

Luis Aina, Alfredo

2004-01-01

We introduce quantum states associated with single phase space points in the Wigner formalism for finite-dimensional spaces. We consider both continuous and discrete Wigner functions. This analysis provides a procedure for a direct practical observation of the Wigner functions for states and transformations without inversion formulas.

Quantum phase space points for Wigner functions in finite-dimensional spaces

International Nuclear Information System (INIS)

Luis, Alfredo

2004-01-01

We introduce quantum states associated with single phase space points in the Wigner formalism for finite-dimensional spaces. We consider both continuous and discrete Wigner functions. This analysis provides a procedure for a direct practical observation of the Wigner functions for states and transformations without inversion formulas

Discrete elements method of neutral particle transport

International Nuclear Information System (INIS)

Mathews, K.A.

1983-01-01

A new discrete elements (L/sub N/) transport method is derived and compared to the discrete ordinates S/sub N/ method, theoretically and by numerical experimentation. The discrete elements method is more accurate than discrete ordinates and strongly ameliorates ray effects for the practical problems studied. The discrete elements method is shown to be more cost effective, in terms of execution time with comparable storage to attain the same accuracy, for a one-dimensional test case using linear characteristic spatial quadrature. In a two-dimensional test case, a vacuum duct in a shield, L/sub N/ is more consistently convergent toward a Monte Carlo benchmark solution than S/sub N/, using step characteristic spatial quadrature. An analysis of the interaction of angular and spatial quadrature in xy-geometry indicates the desirability of using linear characteristic spatial quadrature with the L/sub N/ method

On stability of fixed points and chaos in fractional systems

Science.gov (United States)

Edelman, Mark

2018-02-01

In this paper, we propose a method to calculate asymptotically period two sinks and define the range of stability of fixed points for a variety of discrete fractional systems of the order 0 logistic maps. Based on our analysis, we make a conjecture that chaos is impossible in the corresponding continuous fractional systems.

The discrete dynamics of symmetric competition in the plane.

Science.gov (United States)

Jiang, H; Rogers, T D

1987-01-01

We consider the generalized Lotka-Volterra two-species system xn + 1 = xn exp(r1(1 - xn) - s1yn) yn + 1 = yn exp(r2(1 - yn) - s2xn) originally proposed by R. M. May as a model for competitive interaction. In the symmetric case that r1 = r2 and s1 = s2, a region of ultimate confinement is found and the dynamics therein are described in some detail. The bifurcations of periodic points of low period are studied, and a cascade of period-doubling bifurcations is indicated. Within the confinement region, a parameter region is determined for the stable Hopf bifurcation of a pair of symmetrically placed period-two points, which imposes a second component of oscillation near the stable cycles. It is suggested that the symmetric competitive model contains much of the dynamical complexity to be expected in any discrete two-dimensional competitive model.

Angular discretization errors in transport theory

International Nuclear Information System (INIS)

Nelson, P.; Yu, F.

1992-01-01

Elements of the information-based complexity theory are computed for several types of information and associated algorithms for angular approximations in the setting of a on-dimensional model problem. For point-evaluation information, the local and global radii of information are computed, a (trivial) optimal algorithm is determined, and the local and global error of a discrete ordinates algorithm are shown to be infinite. For average cone-integral information, the local and global radii of information are computed, the local and global error tends to zero as the underlying partition is indefinitely refined. A central algorithm for such information and an optimal partition (of given cardinality) are described. It is further shown that the analytic first-collision source method has zero error (for the purely absorbing model problem). Implications of the restricted problem domains suitable for the various types of information are discussed

On organizing principles of discrete differential geometry. Geometry of spheres

International Nuclear Information System (INIS)

Bobenko, Alexander I; Suris, Yury B

2007-01-01

Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. This survey contains a discussion of the following two fundamental discretization principles: the transformation group principle (smooth geometric objects and their discretizations are invariant with respect to the same transformation group) and the consistency principle (discretizations of smooth parametrized geometries can be extended to multidimensional consistent nets). The main concrete geometric problem treated here is discretization of curvature-line parametrized surfaces in Lie geometry. Systematic use of the discretization principles leads to a discretization of curvature-line parametrization which unifies circular and conical nets.

Mathematical Modeling of Contact Problems of Elasticity Theory with Unilateral Discrete Contact

Directory of Open Access Journals (Sweden)

I. V. Stankevich

2015-01-01

Full Text Available Development and operation of modern machinery and latest technology require reliable estimates of the strength characteristics of the critical elements of structures and technological equipment under the impact of high-intensity thermomechanical loading, accompanied, as a rule, by complex contact interaction. Mathematical modeling of stress-strain state of such parts and components in the contact area, based on adequate mathematical models, modern numerical methods and efficient algorithms that implement the direct determination of displacement fields, strains and stresses, is the main tool that allows fast acquisition of data required for the calculations of strength and durability. The paper considers an algorithm for constructing the numerical solution of the contact problem of elasticity theory in relation to the body, which has an obvious one-sided discrete contact interaction with an elastic half-space. The proposed algorithm is specially designed to have a correction of the tangential forces at discrete contact points, allowing us to achieve sufficiently accurate implementation of the adopted law of friction. The algorithm is embedded in a general finite element technology, with which the application code is generated. Numerical study of discrete unilateral contact interaction of an elastic plate and a rigid half-space showed a high efficiency of the developed algorithm and the application code that implements it.

Effective lagrangian description on discrete gauge symmetries

International Nuclear Information System (INIS)

Banks, T.

1989-01-01

We exhibit a simple low-energy lagrangian which describes a system with a discrete remnant of a spontaneously broken continuous gauge symmetry. The lagrangian gives a simple description of the effects ascribed to such systems by Krauss and Wilczek: black holes carry discrete hair and interact with cosmic strings, and wormholes cannot lead to violation of discrete gauge symmetries. (orig.)

Discrete Lattice effect of various forcing methods of body force on immersed Boundary-Lattice Boltzmann method

Energy Technology Data Exchange (ETDEWEB)

Son, Sung Wan; Ha, Man Yeong; Yoon, Hyun Sik [Pusan National University, Busan (Korea, Republic of); Jeong, Hae Kwon [POSCO, Pohang (Korea, Republic of); Balachandar, S. [University of Florida, Florida (United States)

2013-02-15

We investigate the discrete lattice effect of various forcing methods in the lattice Boltzmann method (LBM) to include the body force obtained from the immersed boundary method (IBM). In the immersed boundary lattice Boltzmann method (IB-LBM), the LBM needs a forcing method to involve the body force on a forcing point near the immersed boundary that is calculated by IBM. The proper forcing method in LBM is derived to include the body force, which appears to resolve problems such as multiphase flow, non-ideal gas behavior, etc. Many researchers have adopted different forcing methods in LBM to involve the body force from IBM, even when they solved similar problems. However, it is necessary to evaluate the discrete lattice effect, which originates from different forcing methods in LBM, to include the effect of the body force from IBM on the results. Consequently, in this study, a rigorous analysis of the discrete lattice effect for different forcing methods in IB-LBM is performed by solving various problems.

Discrete Lattice effect of various forcing methods of body force on immersed Boundary-Lattice Boltzmann method

International Nuclear Information System (INIS)

Son, Sung Wan; Ha, Man Yeong; Yoon, Hyun Sik; Jeong, Hae Kwon; Balachandar, S.

2013-01-01

We investigate the discrete lattice effect of various forcing methods in the lattice Boltzmann method (LBM) to include the body force obtained from the immersed boundary method (IBM). In the immersed boundary lattice Boltzmann method (IB-LBM), the LBM needs a forcing method to involve the body force on a forcing point near the immersed boundary that is calculated by IBM. The proper forcing method in LBM is derived to include the body force, which appears to resolve problems such as multiphase flow, non-ideal gas behavior, etc. Many researchers have adopted different forcing methods in LBM to involve the body force from IBM, even when they solved similar problems. However, it is necessary to evaluate the discrete lattice effect, which originates from different forcing methods in LBM, to include the effect of the body force from IBM on the results. Consequently, in this study, a rigorous analysis of the discrete lattice effect for different forcing methods in IB-LBM is performed by solving various problems.

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.

Point defects dynamics in a stress field

International Nuclear Information System (INIS)

Smetniansky de De Grande, Nelida.

1989-01-01

The dependence of anisotropic defect diffusion on stress is studied for a hexagonal close packed (hcp) material under irradiation and uniaxially stressed. The diffusion is described as a discrete process of thermally activated jumps. It is shown that the presence of an external stress field enhances the intrinsic anisotropic diffusion, being this variation determined by the defect dipole tensors' symmetry in the equilibrium and saddle point configurations. Also, the point defect diffusion equations to sinks, like edge dislocations and spherical cavities, are solved and the sink strengths are calculated. The conclusion is that the dynamics of the interaction between defects and sinks is controlled by the changes in diffusivity induced by stress fields. (Author) [es

A 2+1 non-isospectral discrete integrable system and its discrete integrable coupling system

International Nuclear Information System (INIS)

Yu Fajun; Zhang Hongqing

2006-01-01

In this Letter by considering a (2+1)-dimensional discrete non-isospectral linear problem, a new (2+1)-dimensional integrable lattice hierarchy is constructed. It shows that generalization of the Blaszak-Marciniak lattice hierarchy can be obtained as a reduction. Then an extended algebraic system X-bar of X is presented, from which the integrable coupling system of the (2+1)-dimensional discrete non-isospectral Blaszak-Marciniak lattice equations are obtained

Hairs of discrete symmetries and gravity

Energy Technology Data Exchange (ETDEWEB)

Choi, Kang Sin [Scranton Honors Program, Ewha Womans University, Seodaemun-Gu, Seoul 03760 (Korea, Republic of); Center for Fields, Gravity and Strings, CTPU, Institute for Basic Sciences, Yuseong-Gu, Daejeon 34047 (Korea, Republic of); Kim, Jihn E., E-mail: jihnekim@gmail.com [Department of Physics, Kyung Hee University, 26 Gyungheedaero, Dongdaemun-Gu, Seoul 02447 (Korea, Republic of); Center for Axion and Precision Physics Research (IBS), 291 Daehakro, Yuseong-Gu, Daejeon 34141 (Korea, Republic of); Kyae, Bumseok [Department of Physics, Pusan National University, 2 Busandaehakro-63-Gil, Geumjeong-Gu, Busan 46241 (Korea, Republic of); Nam, Soonkeon [Department of Physics, Kyung Hee University, 26 Gyungheedaero, Dongdaemun-Gu, Seoul 02447 (Korea, Republic of)

2017-06-10

Gauge symmetries are known to be respected by gravity because gauge charges carry flux lines, but global charges do not carry flux lines and are not conserved by gravitational interaction. For discrete symmetries, they are spontaneously broken in the Universe, forming domain walls. Since the realization of discrete symmetries in the Universe must involve the vacuum expectation values of Higgs fields, a string-like configuration (hair) at the intersection of domain walls in the Higgs vacua can be realized. Therefore, we argue that discrete charges are also respected by gravity.

Hairs of discrete symmetries and gravity

Directory of Open Access Journals (Sweden)

Kang Sin Choi

2017-06-01

Full Text Available Gauge symmetries are known to be respected by gravity because gauge charges carry flux lines, but global charges do not carry flux lines and are not conserved by gravitational interaction. For discrete symmetries, they are spontaneously broken in the Universe, forming domain walls. Since the realization of discrete symmetries in the Universe must involve the vacuum expectation values of Higgs fields, a string-like configuration (hair at the intersection of domain walls in the Higgs vacua can be realized. Therefore, we argue that discrete charges are also respected by gravity.

SMART POINT CLOUD: DEFINITION AND REMAINING CHALLENGES

Directory of Open Access Journals (Sweden)

F. Poux

2016-10-01

Full Text Available Dealing with coloured point cloud acquired from terrestrial laser scanner, this paper identifies remaining challenges for a new data structure: the smart point cloud. This concept arises with the statement that massive and discretized spatial information from active remote sensing technology is often underused due to data mining limitations. The generalisation of point cloud data associated with the heterogeneity and temporality of such datasets is the main issue regarding structure, segmentation, classification, and interaction for an immediate understanding. We propose to use both point cloud properties and human knowledge through machine learning to rapidly extract pertinent information, using user-centered information (smart data rather than raw data. A review of feature detection, machine learning frameworks and database systems indexed both for mining queries and data visualisation is studied. Based on existing approaches, we propose a new 3-block flexible framework around device expertise, analytic expertise and domain base reflexion. This contribution serves as the first step for the realisation of a comprehensive smart point cloud data structure.

Dissolved inorganic carbon, pH, alkalinity, temperature, salinity and other variables collected from discrete sample and profile observations using Alkalinity titrator, CTD and other instruments from NOAA Ship FAIRWEATHER and POINT SUR in the Columbia River estuary - Washington/Oregon, Gulf of the Farallones National Marine Sanctuary and others from 2013-08-03 to 2013-08-29 (NCEI Accession 0157622)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — NCEI Accession 0157622 includes biological, chemical, discrete sample, physical and profile data collected from NOAA Ship FAIRWEATHER and POINT SUR in the Columbia...

Discrete tomography in neutron radiography

International Nuclear Information System (INIS)

Kuba, Attila; Rodek, Lajos; Kiss, Zoltan; Rusko, Laszlo; Nagy, Antal; Balasko, Marton

2005-01-01

Discrete tomography (DT) is an imaging technique for reconstructing discrete images from their projections using the knowledge that the object to be reconstructed contains only a few homogeneous materials characterized by known discrete absorption values. One of the main reasons for applying DT is that we will hopefully require relatively few projections. Using discreteness and some a priori information (such as an approximate shape of the object) we can apply two DT methods in neutron imaging by reducing the problem to an optimization task. The first method is a special one because it is only suitable if the object is composed of cylinders and sphere shapes. The second method is a general one in the sense that it can be used for reconstructing objects of any shape. Software was developed and physical experiments performed in order to investigate the effects of several reconstruction parameters: the number of projections, noise levels, and complexity of the object to be reconstructed. We give a summary of the experimental results and make a comparison of the results obtained using a classical reconstruction technique (FBP). The programs we developed are available in our DT reconstruction program package DIRECT

A Discrete Model for Color Naming

Directory of Open Access Journals (Sweden)

J. M. Boi

2007-01-01

Full Text Available The ability to associate labels to colors is very natural for human beings. Though, this apparently simple task hides very complex and still unsolved problems, spreading over many different disciplines ranging from neurophysiology to psychology and imaging. In this paper, we propose a discrete model for computational color categorization and naming. Starting from the 424 color specimens of the OSA-UCS set, we propose a fuzzy partitioning of the color space. Each of the 11 basic color categories identified by Berlin and Kay is modeled as a fuzzy set whose membership function is implicitly defined by fitting the model to the results of an ad hoc psychophysical experiment (Experiment 1. Each OSA-UCS sample is represented by a feature vector whose components are the memberships to the different categories. The discrete model consists of a three-dimensional Delaunay triangulation of the CIELAB color space which associates each OSA-UCS sample to a vertex of a 3D tetrahedron. Linear interpolation is used to estimate the membership values of any other point in the color space. Model validation is performed both directly, through the comparison of the predicted membership values to the subjective counterparts, as evaluated via another psychophysical test (Experiment 2, and indirectly, through the investigation of its exploitability for image segmentation. The model has proved to be successful in both cases, providing an estimation of the membership values in good agreement with the subjective measures as well as a semantically meaningful color-based segmentation map.

How Triage Nurses Use Discretion: a Literature Review

Directory of Open Access Journals (Sweden)

Lars Emil Fagernes Johannessen

2016-02-01

Full Text Available Discretion is quintessential for professional work. This review aims to understand how nurses use discretion when they perform urgency assessments in emergency departments with formalised triage systems—systems that are intended to reduce nurses’ use of discretion. Because little research has dealt explicitly with this topic, this review addresses the discretionary aspects of triage by reinterpreting qualitative studies of how triage nurses perform urgency assessments. The review shows (a how inexhaustive guidelines and a hectic work environment are factors that necessitate nurses’ use of discretion and (b how nurses reason within this discretionary space by relying on their experience and intuition, judging patients according to criteria such as appropriateness and believability, and creating urgency ratings together with their patients. The review also offers a synthesis of the findings’ discretionary aspects and suggests a new interactionist dimension of discretion.Keywords: Triage, discretion, emergency department, meta-ethnography, review, decision-making

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.

Bifurcation and complex dynamics of a discrete-time predator-prey system involving group defense

Directory of Open Access Journals (Sweden)

S. M. Sohel Rana

2015-09-01

Full Text Available In this paper, we investigate the dynamics of a discrete-time predator-prey system involving group defense. The existence and local stability of positive fixed point of the discrete dynamical system is analyzed algebraically. It is shown that the system undergoes a flip bifurcation and a Neimark-Sacker bifurcation in the interior of R+2 by using bifurcation theory. Numerical simulation results not only show the consistence with the theoretical analysis but also display the new and interesting dynamical behaviors, including phase portraits, period-7, 20-orbits, attracting invariant circle, cascade of period-doubling bifurcation from period-20 leading to chaos, quasi-periodic orbits, and sudden disappearance of the chaotic dynamics and attracting chaotic set. The Lyapunov exponents are numerically computed to characterize the complexity of the dynamical behaviors.

Discrete Riccati equation solutions: Distributed algorithms

Directory of Open Access Journals (Sweden)

D. G. Lainiotis

1996-01-01

Full Text Available In this paper new distributed algorithms for the solution of the discrete Riccati equation are introduced. The algorithms are used to provide robust and computational efficient solutions to the discrete Riccati equation. The proposed distributed algorithms are theoretically interesting and computationally attractive.

Discrete Fourier analysis of multigrid algorithms

NARCIS (Netherlands)

van der Vegt, Jacobus J.W.; Rhebergen, Sander

2011-01-01

The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential equations. Special attention is given to the

Time Discretization Techniques

KAUST Repository

Gottlieb, S.

2016-10-12

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 multistep, multistage, or multiderivative methods, as well as a combination of these approaches. The time step constraint is mainly a result of the absolute stability requirement, as well as additional conditions that mimic physical properties of the solution, such as positivity or total variation stability. These conditions may be required for stability when the solution develops shocks or sharp gradients. This chapter contains a review of some of the methods historically used for the evolution of hyperbolic PDEs, as well as cutting edge methods that are now commonly used.

Ensemble simulations with discrete classical dynamics

DEFF Research Database (Denmark)

Toxværd, Søren

2013-01-01

For discrete classical Molecular dynamics (MD) obtained by the "Verlet" algorithm (VA) with the time increment $h$ there exist a shadow Hamiltonian $\\tilde{H}$ with energy $\\tilde{E}(h)$, for which the discrete particle positions lie on the analytic trajectories for $\\tilde{H}$. $\\tilde......{E}(h)$ is employed to determine the relation with the corresponding energy, $E$ for the analytic dynamics with $h=0$ and the zero-order estimate $E_0(h)$ of the energy for discrete dynamics, appearing in the literature for MD with VA. We derive a corresponding time reversible VA algorithm for canonical dynamics...

Discrete symmetries and de Sitter spacetime

Energy Technology Data Exchange (ETDEWEB)

Cotăescu, Ion I., E-mail: gpascu@physics.uvt.ro; Pascu, Gabriel, E-mail: gpascu@physics.uvt.ro [West University of Timişoara, V. Pârvan Ave. 4, RO-300223 Timişoara (Romania)

2014-11-24

Aspects of the ambiguity in defining quantum modes on de Sitter spacetime using a commuting system composed only of differential operators are discussed. Discrete symmetries and their actions on the wavefunction in commonly used coordinate charts are reviewed. It is argued that the system of commuting operators can be supplemented by requiring the invariance of the wavefunction to combined discrete symmetries- a criterion which selects a single state out of the α-vacuum family. Two such members of this family are singled out by particular combined discrete symmetries- states between which exists a well-known thermality relation.

Discrete convolution-operators and radioactive disintegration. [Numerical solution

Energy Technology Data Exchange (ETDEWEB)

Kalla, S L; VALENTINUZZI, M E [UNIVERSIDAD NACIONAL DE TUCUMAN (ARGENTINA). FACULTAD DE CIENCIAS EXACTAS Y TECNOLOGIA

1975-08-01

The basic concepts of discrete convolution and discrete convolution-operators are briefly described. Then, using the discrete convolution - operators, the differential equations associated with the process of radioactive disintegration are numerically solved. The importance of the method is emphasized to solve numerically, differential and integral equations.

Periodic, quasiperiodic and chaotic discrete breathers in a parametrical driven two-dimensional discrete diatomic Klein–Gordon lattice

International Nuclear Information System (INIS)

Quan, Xu; Qiang, Tian

2009-01-01

We study a two-dimensional (2D) diatomic lattice of anharmonic oscillators with only quartic nearest-neighbor interactions, in which discrete breathers (DBs) can be explicitly constructed by an exact separation of their time and space dependence. DBs can stably exist in the 2D discrete diatomic Klein–Gordon lattice with hard and soft on-site potentials. When a parametric driving term is introduced in the factor multiplying the harmonic part of the on-site potential of the system, we can obtain the stable quasiperiodic discrete breathers (QDBs) and chaotic discrete breathers (CDBs) by changing the amplitude of the driver. But the DBs and QDBs with symmetric and anti-symmetric profiles that are centered at a heavy atom are more stable than at a light atom, because the frequencies of the DBs and QDBs centered at a heavy atom are lower than those centered at a light atom

Discrete-Time Nonlinear Control of VSC-HVDC System

Directory of Open Access Journals (Sweden)

TianTian Qian

2015-01-01

Full Text Available Because VSC-HVDC is a kind of strong nonlinear, coupling, and multi-input multioutput (MIMO system, its control problem is always attracting much attention from scholars. And a lot of papers have done research on its control strategy in the continuous-time domain. But the control system is implemented through the computer discrete sampling in practical engineering. It is necessary to study the mathematical model and control algorithm in the discrete-time domain. The discrete mathematical model based on output feedback linearization and discrete sliding mode control algorithm is proposed in this paper. And to ensure the effectiveness of the control system in the quasi sliding mode state, the fast output sampling method is used in the output feedback. The results from simulation experiment in MATLAB/SIMULINK prove that the proposed discrete control algorithm can make the VSC-HVDC system have good static, dynamic, and robust characteristics in discrete-time domain.

Discrete modeling considerations in multiphase fluid dynamics

International Nuclear Information System (INIS)

Ransom, V.H.; Ramshaw, J.D.

1988-01-01

The modeling of multiphase flows play a fundamental role in light water reactor safety. The main ingredients in our discrete modeling Weltanschauung are the following considerations: (1) Any physical model must be cast into discrete form for a digital computer. (2) The usual approach of formulating models in differential form and then discretizing them is potentially hazardous. It may be preferable to formulate the model in discrete terms from the outset. (3) Computer time and storage constraints limit the resolution that can be employed in practical calculations. These limits effectively define the physical phenomena, length scales, and time scales which cannot be directly represented in the calculation and therefore must be modeled. This information should be injected into the model formulation process at an early stage. (4) Practical resolution limits are generally so coarse that traditional convergence and truncation-error analyses become irrelevant. (5) A discrete model constitutes a reduced description of a physical system, from which fine-scale details are eliminated. This elimination creates a statistical closure problem. Methods from statistical physics may therefore be useful in the formulation of discrete models. In the present paper we elaborate on these themes and illustrate them with simple examples. 48 refs

Particular solution of the discrete-ordinate method.

Science.gov (United States)

Qin, Yi; Box, Michael A; Jupp, David L

2004-06-20

We present two methods that can be used to derive the particular solution of the discrete-ordinate method (DOM) for an arbitrary source in a plane-parallel atmosphere, which allows us to solve the transfer equation 12-18% faster in the case of a single beam source and is even faster for the atmosphere thermal emission source. We also remove the divide by zero problem that occurs when a beam source coincides with a Gaussian quadrature point. In our implementation, solution for multiple sources can be obtained simultaneously. For each extra source, it costs only 1.3-3.6% CPU time required for a full solution. The GDOM code that we developed previously has been revised to integrate with the DOM. Therefore we are now able to compute the Green's function and DOM solutions simultaneously.

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.

Identification of parameters of discrete-continuous models

International Nuclear Information System (INIS)

Cekus, Dawid; Warys, Pawel

2015-01-01

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible

Identification of parameters of discrete-continuous models

Energy Technology Data Exchange (ETDEWEB)

Cekus, Dawid, E-mail: cekus@imipkm.pcz.pl; Warys, Pawel, E-mail: warys@imipkm.pcz.pl [Institute of Mechanics and Machine Design Foundations, Czestochowa University of Technology, Dabrowskiego 73, 42-201 Czestochowa (Poland)

2015-03-10

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible.

Discrete Mathematics in the Schools. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 36.

Science.gov (United States)

Rosenstein, Joseph G., Ed.; Franzblau, Deborah S., Ed.; Roberts, Fred S., Ed.

This book is a collection of articles by experienced educators and explains why and how discrete mathematics should be taught in K-12 classrooms. It includes evidence for "why" and practical guidance for "how" and also discusses how discrete mathematics can be used as a vehicle for achieving the broader goals of the major…

A method for accurate computation of elastic and discrete inelastic scattering transfer matrix

International Nuclear Information System (INIS)

Garcia, R.D.M.; Santina, M.D.

1986-05-01

A method for accurate computation of elastic and discrete inelastic scattering transfer matrices is discussed. In particular, a partition scheme for the source energy range that avoids integration over intervals containing points where the integrand has discontinuous derivative is developed. Five-figure accurate numerical results are obtained for several test problems with the TRAMA program which incorporates the porposed method. A comparison with numerical results from existing processing codes is also presented. (author) [pt

Symmetries in discrete-time mechanics

International Nuclear Information System (INIS)

Khorrami, M.

1996-01-01

Based on a general formulation for discrete-time quantum mechanics, introduced by M. Khorrami (Annals Phys. 224 (1995), 101), symmetries in discrete-time quantum mechanics are investigated. It is shown that any classical continuous symmetry leads to a conserved quantity in classical mechanics, as well as quantum mechanics. The transformed wave function, however, has the correct evolution if and only if the symmetry is nonanomalous. Copyright copyright 1996 Academic Press, Inc

Classical solutions for discrete potential boundary value problems with generalized Leray-Lions type operator and variable exponent

Directory of Open Access Journals (Sweden)

Bila Adolphe Kyelem

2017-04-01

Full Text Available In this article, we prove the existence of solutions for some discrete nonlinear difference equations subjected to a potential boundary type condition. We use a variational technique that relies on Szulkin's critical point theory, which ensures the existence of solutions by ground state and mountain pass methods.

A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

International Nuclear Information System (INIS)

Vishnampet, Ramanathan; Bodony, Daniel J.; Freund, Jonathan B.

2015-01-01

Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space–time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge–Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that

Application of the nudged elastic band method to the point-to-point radio wave ray tracing in IRI modeled ionosphere

Science.gov (United States)

Nosikov, I. A.; Klimenko, M. V.; Bessarab, P. F.; Zhbankov, G. A.

2017-07-01

Point-to-point ray tracing is an important problem in many fields of science. While direct variational methods where some trajectory is transformed to an optimal one are routinely used in calculations of pathways of seismic waves, chemical reactions, diffusion processes, etc., this approach is not widely known in ionospheric point-to-point ray tracing. We apply the Nudged Elastic Band (NEB) method to a radio wave propagation problem. In the NEB method, a chain of points which gives a discrete representation of the radio wave ray is adjusted iteratively to an optimal configuration satisfying the Fermat's principle, while the endpoints of the trajectory are kept fixed according to the boundary conditions. Transverse displacements define the radio ray trajectory, while springs between the points control their distribution along the ray. The method is applied to a study of point-to-point ionospheric ray tracing, where the propagation medium is obtained with the International Reference Ionosphere model taking into account traveling ionospheric disturbances. A 2-dimensional representation of the optical path functional is developed and used to gain insight into the fundamental difference between high and low rays. We conclude that high and low rays are minima and saddle points of the optical path functional, respectively.

Einstein causal quantum fields on lattices with discrete Lorentz invariance

International Nuclear Information System (INIS)

Baumgaertel, H.

1986-01-01

Results on rigorous construction of quantum fields on the hypercubic lattice Z 4 considered as a lattice in the Minkowski space R 4 are presented. Two associated fields are constructed: The first one having on the lattice points of Z 4 is causal and Poincare invariant in the discrete sense. The second one is an interpolating field over R 4 which is pointlike, translationally covariant and spectral in such a manner that the 'real' lattices field is the restriction of the interpolating field to Z 4 . Furthermore, results on a rigorous perturbation theory of such fields are mentioned

Design of Experiment Using Simulation of a Discrete Dynamical System

Directory of Open Access Journals (Sweden)

Mašek Jan

2016-12-01

Full Text Available The topic of the presented paper is a promising approach to achieve optimal Design of Experiment (DoE, i.e. spreading of points within a design domain, using a simulation of a discrete dynamical system of interacting particles within an n-dimensional design space. The system of mutually repelling particles represents a physical analogy of the Audze-Eglājs (AE optimization criterion and its periodical modification (PAE, respectively. The paper compares the performance of two approaches to implementation: a single-thread process using the JAVA language environment and a massively parallel solution employing the nVidia CUDA platform.

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

Preferences for treatment of Attention-Deficit/Hyperactivity Disorder (ADHD: a discrete choice experiment

Directory of Open Access Journals (Sweden)

Lincke Hans-Joachim

2009-08-01

Full Text Available Abstract Background While there is an increasing emphasis on patient empowerment and shared decision-making, subjective values for attributes associated with their treatment still need to be measured and considered. This contribution seeks to define properties of an ideal drug treatment of individuals concerned with Attention-Deficit/Hyperactivity Disorder (ADHD. Because of the lack of information on patient needs in the decision-makers assessment of health services, the individuals' preferences often play a subordinate role at present. Discrete Choice Experiments offer strategies for eliciting subjective values and making them accessible for physicians and other health care professionals. Methods The evidence comes from a Discrete Choice Experiments (DCE performed in 2007. After reviewing the literature about preferences of ADHS we conducted a qualitative study with four focus groups consisting of five to eleven ADHS-patients each. In order to achieve content validity, we aimed at collecting all relevant factors for an ideal ADHS treatment. In a subsequent quantitative study phase (n = 219, data was collected in an online or paper-pencil self-completed questionnaire. It included sociodemographic data, health status and patients' preferences of therapy characteristics using direct measurement (23 items on a five-point Likert-scale as well as a Discrete-Choice-Experiment (DCE, six factors in a fold-over design. Results Those concerned were capable of clearly defining success criteria and expectations. In the direct assessment and the DCE, respondents attached special significance to the improvement of their social situation and emotional state (relative importance 40%. Another essential factor was the desire for drugs with a long-lasting effect over the day (relative importance 18%. Other criteria, such as flexibility and discretion, were less important to the respondents (6% and 9%, respectively. Conclusion Results point out that ADHD patients

Convergence of posteriors for discretized log Gaussian Cox processes

DEFF Research Database (Denmark)

Waagepetersen, Rasmus Plenge

2004-01-01

In Markov chain Monte Carlo posterior computation for log Gaussian Cox processes (LGCPs) a discretization of the continuously indexed Gaussian field is required. It is demonstrated that approximate posterior expectations computed from discretized LGCPs converge to the exact posterior expectations...... when the cell sizes of the discretization tends to zero. The effect of discretization is studied in a data example....

Numerical Simulation of Antennae by Discrete Exterior Calculus

International Nuclear Information System (INIS)

Xie Zheng; Ye Zheng; Ma Yujie

2009-01-01

Numerical simulation of antennae is a topic in computational electromagnetism, which is concerned with the numerical study of Maxwell equations. By discrete exterior calculus and the lattice gauge theory with coefficient R, we obtain the Bianchi identity on prism lattice. By defining an inner product of discrete differential forms, we derive the source equation and continuity equation. Those equations compose the discrete Maxwell equations in vacuum case on discrete manifold, which are implemented on Java development platform to simulate the Gaussian pulse radiation on antennaes. (electromagnetism, optics, acoustics, heat transfer, classical mechanics, and fluid dynamics)

Three-dimensional discrete-time Lotka-Volterra models with an application to industrial clusters

Science.gov (United States)

Bischi, G. I.; Tramontana, F.

2010-10-01

We consider a three-dimensional discrete dynamical system that describes an application to economics of a generalization of the Lotka-Volterra prey-predator model. The dynamic model proposed is used to describe the interactions among industrial clusters (or districts), following a suggestion given by [23]. After studying some local and global properties and bifurcations in bidimensional Lotka-Volterra maps, by numerical explorations we show how some of them can be extended to their three-dimensional counterparts, even if their analytic and geometric characterization becomes much more difficult and challenging. We also show a global bifurcation of the three-dimensional system that has no two-dimensional analogue. Besides the particular economic application considered, the study of the discrete version of Lotka-Volterra dynamical systems turns out to be a quite rich and interesting topic by itself, i.e. from a purely mathematical point of view.

Variance Swap Replication: Discrete or Continuous?

Directory of Open Access Journals (Sweden)

Fabien Le Floc’h

2018-02-01

Full Text Available The popular replication formula to price variance swaps assumes continuity of traded option strikes. In practice, however, there is only a discrete set of option strikes traded on the market. We present here different discrete replication strategies and explain why the continuous replication price is more relevant.

On an elastic dissipation model as continuous approximation for discrete media

Directory of Open Access Journals (Sweden)

I. V. Andrianov

2006-01-01

Full Text Available Construction of an accurate continuous model for discrete media is an important topic in various fields of science. We deal with a 1D differential-difference equation governing the behavior of an n-mass oscillator with linear relaxation. It is known that a string-type approximation is justified for low part of frequency spectra of a continuous model, but for free and forced vibrations a solution of discrete and continuous models can be quite different. A difference operator makes analysis difficult due to its nonlocal form. Approximate equations can be obtained by replacing the difference operators via a local derivative operator. Although application of a model with derivative of more than second order improves the continuous model, a higher order of approximated differential equation seriously complicates a solution of continuous problem. It is known that accuracy of the approximation can dramatically increase using Padé approximations. In this paper, one- and two-point Padé approximations suitable for justify choice of structural damping models are used.

Lax Pairs for Discrete Integrable Equations via Darboux Transformations

International Nuclear Information System (INIS)

Cao Ce-Wen; Zhang Guang-Yao

2012-01-01

A method is developed to construct discrete Lax pairs using Darboux transformations. More kinds of Lax pairs are found for some newly appeared discrete integrable equations, including the H1, the special H3 and the Q1 models in the Adler—Bobenko—Suris list and the closely related discrete and semi-discrete pKdV, pMKdV, SG and Liouville equations. (general)

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.

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

A Simple Estimation of Coupling Loss Factors for Two Flexible Subsystems Connected via Discrete Interfaces

Directory of Open Access Journals (Sweden)

Jun Zhang

2016-01-01

Full Text Available A simple formula is proposed to estimate the Statistical Energy Analysis (SEA coupling loss factors (CLFs for two flexible subsystems connected via discrete interfaces. First, the dynamic interactions between two discretely connected subsystems are described as a set of intermodal coupling stiffness terms. It is then found that if both subsystems are of high modal density and meanwhile the interface points all act independently, the intermodal dynamic couplings become dominated by only those between different subsystem mode sets. If ensemble- and frequency-averaged, the intermodal coupling stiffness terms can simply reduce to a function of the characteristic dynamic properties of each subsystem and the subsystem mass, as well as the number of interface points. The results can thus be accommodated within the theoretical frame of conventional SEA theory to yield a simple CLF formula. Meanwhile, the approach allows the weak coupling region between the two SEA subsystems to be distinguished simply and explicitly. The consistency and difference of the present technique with and from the traditional wave-based SEA solutions are discussed. Finally, numerical examples are given to illustrate the good performance of the present technique.

Computational and analytical comparison of flux discretizations for the semiconductor device equations beyond Boltzmann statistics

International Nuclear Information System (INIS)

Farrell, Patricio; Koprucki, Thomas; Fuhrmann, Jürgen

2017-01-01

We compare three thermodynamically consistent numerical fluxes known in the literature, appearing in a Voronoï finite volume discretization of the van Roosbroeck system with general charge carrier statistics. Our discussion includes an extension of the Scharfetter–Gummel scheme to non-Boltzmann (e.g. Fermi–Dirac) statistics. It is based on the analytical solution of a two-point boundary value problem obtained by projecting the continuous differential equation onto the interval between neighboring collocation points. Hence, it serves as a reference flux. The exact solution of the boundary value problem can be approximated by computationally cheaper fluxes which modify certain physical quantities. One alternative scheme averages the nonlinear diffusion (caused by the non-Boltzmann nature of the problem), another one modifies the effective density of states. To study the differences between these three schemes, we analyze the Taylor expansions, derive an error estimate, visualize the flux error and show how the schemes perform for a carefully designed p-i-n benchmark simulation. We present strong evidence that the flux discretization based on averaging the nonlinear diffusion has an edge over the scheme based on modifying the effective density of states.

Computational and analytical comparison of flux discretizations for the semiconductor device equations beyond Boltzmann statistics

Science.gov (United States)

Farrell, Patricio; Koprucki, Thomas; Fuhrmann, Jürgen

2017-10-01

We compare three thermodynamically consistent numerical fluxes known in the literature, appearing in a Voronoï finite volume discretization of the van Roosbroeck system with general charge carrier statistics. Our discussion includes an extension of the Scharfetter-Gummel scheme to non-Boltzmann (e.g. Fermi-Dirac) statistics. It is based on the analytical solution of a two-point boundary value problem obtained by projecting the continuous differential equation onto the interval between neighboring collocation points. Hence, it serves as a reference flux. The exact solution of the boundary value problem can be approximated by computationally cheaper fluxes which modify certain physical quantities. One alternative scheme averages the nonlinear diffusion (caused by the non-Boltzmann nature of the problem), another one modifies the effective density of states. To study the differences between these three schemes, we analyze the Taylor expansions, derive an error estimate, visualize the flux error and show how the schemes perform for a carefully designed p-i-n benchmark simulation. We present strong evidence that the flux discretization based on averaging the nonlinear diffusion has an edge over the scheme based on modifying the effective density of states.

Quantum mechanics of a free particle on a plane with an extracted point

International Nuclear Information System (INIS)

Kowalski, K.; Podlaski, K.; Rembielinski, J.

2002-01-01

A detailed study of a quantum free particle on a pointed plane is presented in this paper. In particular, some questions posed in the very recent paper by M. A. Cirone et al, Phys. Rev. A 65, 022101 (2002) are clarified. Namely, the topological effects related to extracting a point from a plane are indicated. The proposed results are introduced concerning self-adjoint extensions of operators describing the free particle on a pointed plane as well as the role played by discrete symmetries in the analysis of such extensions

Thermal conductivity at a disordered quantum critical point

International Nuclear Information System (INIS)

Hartnoll, Sean A.; Ramirez, David M.; Santos, Jorge E.

2016-01-01

Strongly disordered and strongly interacting quantum critical points are difficult to access with conventional field theoretic methods. They are, however, both experimentally important and theoretically interesting. In particular, they are expected to realize universal incoherent transport. Such disordered quantum critical theories have recently been constructed holographically by deforming a CFT by marginally relevant disorder. In this paper we find additional disordered fixed points via relevant disordered deformations of a holographic CFT. Using recently developed methods in holographic transport, we characterize the thermal conductivity in both sets of theories in 1+1 dimensions. The thermal conductivity is found to tend to a constant at low temperatures in one class of fixed points, and to scale as T"0"."3 in the other. Furthermore, in all cases the thermal conductivity exhibits discrete scale invariance, with logarithmic in temperature oscillations superimposed on the low temperature scaling behavior. At no point do we use the replica trick.

Discrete Morse functions for graph configuration spaces

International Nuclear Information System (INIS)

Sawicki, A

2012-01-01

We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions, which have a nice physical interpretation as two-body potentials constructed from one-body potentials. We also give a brief introduction to discrete Morse theory. Our motivation comes from the problem of quantum statistics for particles on networks, for which generalized versions of anyon statistics can appear. (paper)

The Role of Discrete Global Grid Systems in the Global Statistical Geospatial Framework

Science.gov (United States)

Purss, M. B. J.; Peterson, P.; Minchin, S. A.; Bermudez, L. E.

2016-12-01

The United Nations Committee of Experts on Global Geospatial Information Management (UN-GGIM) has proposed the development of a Global Statistical Geospatial Framework (GSGF) as a mechanism for the establishment of common analytical systems that enable the integration of statistical and geospatial information. Conventional coordinate reference systems address the globe with a continuous field of points suitable for repeatable navigation and analytical geometry. While this continuous field is represented on a computer in a digitized and discrete fashion by tuples of fixed-precision floating point values, it is a non-trivial exercise to relate point observations spatially referenced in this way to areal coverages on the surface of the Earth. The GSGF states the need to move to gridded data delivery and the importance of using common geographies and geocoding. The challenges associated with meeting these goals are not new and there has been a significant effort within the geospatial community to develop nested gridding standards to tackle these issues over many years. These efforts have recently culminated in the development of a Discrete Global Grid Systems (DGGS) standard which has been developed under the auspices of Open Geospatial Consortium (OGC). DGGS provide a fixed areal based geospatial reference frame for the persistent location of measured Earth observations, feature interpretations, and modelled predictions. DGGS address the entire planet by partitioning it into a discrete hierarchical tessellation of progressively finer resolution cells, which are referenced by a unique index that facilitates rapid computation, query and analysis. The geometry and location of the cell is the principle aspect of a DGGS. Data integration, decomposition, and aggregation is optimised in the DGGS hierarchical structure and can be exploited for efficient multi-source data processing, storage, discovery, transmission, visualization, computation, analysis, and modelling. During

Information-Theoretic Analysis of a Family of Improper Discrete Constellations

Directory of Open Access Journals (Sweden)

Ignacio Santamaria

2018-01-01

Full Text Available Non-circular or improper Gaussian signaling has proven beneficial in several interference-limited wireless networks. However, all implementable coding schemes are based on finite discrete constellations rather than Gaussian signals. In this paper, we propose a new family of improper constellations generated by widely linear processing of a square M-QAM (quadrature amplitude modulation signal. This family of discrete constellations is parameterized by κ , the circularity coefficient and a phase ϕ . For uncoded communication systems, this phase should be optimized as ϕ * ( κ to maximize the minimum Euclidean distance between points of the improper constellation, therefore minimizing the bit error rate (BER. For the more relevant case of coded communications, where the coded symbols are constrained to be in this family of improper constellations using ϕ * ( κ , it is shown theoretically and further corroborated by simulations that, except for a shaping loss of 1.53 dB encountered at a high signal-to-noise ratio (snr, there is no rate loss with respect to the improper Gaussian capacity. In this sense, the proposed family of constellations can be viewed as the improper counterpart of the standard proper M-QAM constellations widely used in coded communication systems.

A point-centered diffusion differencing for unstructured meshes in 3-D

International Nuclear Information System (INIS)

Palmer, T.S.

1994-01-01

We describe a point-centered diffusion discretization for 3-D unstructured meshes of polyhedra. The method has several attractive qualities, including second-order accuracy and preservation of linear solutions. A potential drawback to the scheme is that the diffusion matrix is asymmetric, in general. Results of numerical test problems illustrate the behavior of the scheme

Digital Watermarks Using Discrete Wavelet Transformation and Spectrum Spreading

Directory of Open Access Journals (Sweden)

Ryousuke Takai

2003-12-01

Full Text Available In recent tears, digital media makes rapid progress through the development of digital technology. Digital media normally assures fairly high quality, nevertheless can be easily reproduced in a perfect form. This perfect reproducibility takes and advantage from a certain point of view, while it produces an essential disadvantage, since digital media is frequently copied illegally. Thus the problem of the copyright protection becomes a very important issue. A solution of this problem is to embed digital watermarks that is not perceived clearly by usual people, but represents the proper right of original product. In our method, the images data in the frequency domain are transformed by the Discrete Wavelet Transform and analyzed by the multi resolution approximation, [1]. Further, the spectrum spreading is executed by using PN-sequences. Choi and Aizawa [7] embed watermarks by using block correlation of DCT coefficients. Thus, we apply Discrete Cosine Transformation, abbreviated to DCT, instead of the Fourier transformation in order to embed watermarks.If the value of this variance is high then we decide that the block has bigger magnitude for visual fluctuations. Henceforth, we may embed stronger watermarks, which gives resistance for images processing, such as attacks and/or compressions.

Manifestly gauge invariant discretizations of the Schrödinger equation

International Nuclear Information System (INIS)

Halvorsen, Tore Gunnar; Kvaal, Simen

2012-01-01

Grid-based discretizations of the time dependent Schrödinger equation coupled to an external magnetic field are converted to manifest gauge invariant discretizations. This is done using generalizations of ideas used in classical lattice gauge theory, and the process defined is applicable to a large class of discretized differential operators. In particular, popular discretizations such as pseudospectral discretizations using the fast Fourier transform can be transformed to gauge invariant schemes. Also generic gauge invariant versions of generic time integration methods are considered, enabling completely gauge invariant calculations of the time dependent Schrödinger equation. Numerical examples illuminating the differences between a gauge invariant discretization and conventional discretization procedures are also presented. -- Highlights: ► We investigate the Schrödinger equation coupled to an external magnetic field. ► Any grid-based discretization is made trivially gauge invariant. ► An extension of classical lattice gauge theory.

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

A new criterion to global exponential periodicity for discrete-time BAM neural network with infinite delays

International Nuclear Information System (INIS)

Zhou Tiejun; Liu Yuehua; Li Xiaoping; Liu Yirong

2009-01-01

The discrete-time bidirectional associative memory neural network with periodic coefficients and infinite delays is studied. And not by employing the continuation theorem of coincidence degree theory as other literatures, but by constructing suitable Liapunov function, using fixed point theorem and some analysis techniques, a sufficient criterion is obtained which ensures the existence and global exponential stability of periodic solution for the type of discrete-time BAM neural network. The obtained result is less restrictive to the BAM neural networks than previously known criteria. Furthermore, it can be applied to the BAM neural network which signal transfer functions are neither bounded nor differentiable. In addition, an example and its numerical simulation are given to illustrate the effectiveness of the obtained result

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)

Network Science Research Laboratory (NSRL) Discrete Event Toolkit

Science.gov (United States)

2016-01-01

ARL-TR-7579 ● JAN 2016 US Army Research Laboratory Network Science Research Laboratory (NSRL) Discrete Event Toolkit by...Laboratory (NSRL) Discrete Event Toolkit by Theron Trout and Andrew J Toth Computational and Information Sciences Directorate, ARL...Research Laboratory (NSRL) Discrete Event Toolkit 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Theron Trout

Lax pairs for ultra-discrete Painleve cellular automata

International Nuclear Information System (INIS)

Joshi, N; Nijhoff, F W; Ormerod, C

2004-01-01

Ultra-discrete versions of the discrete Painleve equations are well known. However, evidence for their integrability has so far been restricted. In this letter, we show that their Lax pairs can be constructed and, furthermore, that compatibility conditions of the result yield the ultra-discrete Painleve equation. For conciseness, we restrict our attention to a new d-P III . (letter to the editor)

Constitutive equations for discrete electromagnetic problems over polyhedral grids

International Nuclear Information System (INIS)

Codecasa, Lorenzo; Trevisan, Francesco

2007-01-01

In this paper a novel approach is proposed for constructing discrete counterparts of constitutive equations over polyhedral grids which ensure both consistency and stability of the algebraic equations discretizing an electromagnetic field problem. The idea is to construct discrete constitutive equations preserving the thermodynamic relations for constitutive equations. In this way, consistency and stability of the discrete equations are ensured. At the base, a purely geometric condition between the primal and the dual grids has to be satisfied for a given primal polyhedral grid, by properly choosing the dual grid. Numerical experiments demonstrate that the proposed discrete constitutive equations lead to accurate approximations of the electromagnetic field

Discrete least squares polynomial approximation with random evaluations - application to PDEs with Random parameters

KAUST Repository

Nobile, Fabio

2015-01-07

We consider a general problem F(u, y) = 0 where u is the unknown solution, possibly Hilbert space valued, and y a set of uncertain parameters. We specifically address the situation in which the parameterto-solution map u(y) is smooth, however y could be very high (or even infinite) dimensional. In particular, we are interested in cases in which F is a differential operator, u a Hilbert space valued function and y a distributed, space and/or time varying, random field. We aim at reconstructing the parameter-to-solution map u(y) from random noise-free or noisy observations in random points by discrete least squares on polynomial spaces. The noise-free case is relevant whenever the technique is used to construct metamodels, based on polynomial expansions, for the output of computer experiments. In the case of PDEs with random parameters, the metamodel is then used to approximate statistics of the output quantity. We discuss the stability of discrete least squares on random points show convergence estimates both in expectation and probability. We also present possible strategies to select, either a-priori or by adaptive algorithms, sequences of approximating polynomial spaces that allow to reduce, and in some cases break, the curse of dimensionality

Multilevel discretized random field models with 'spin' correlations for the simulation of environmental spatial data

International Nuclear Information System (INIS)

Žukovič, Milan; Hristopulos, Dionissios T

2009-01-01

A current problem of practical significance is how to analyze large, spatially distributed, environmental data sets. The problem is more challenging for variables that follow non-Gaussian distributions. We show by means of numerical simulations that the spatial correlations between variables can be captured by interactions between 'spins'. The spins represent multilevel discretizations of environmental variables with respect to a number of pre-defined thresholds. The spatial dependence between the 'spins' is imposed by means of short-range interactions. We present two approaches, inspired by the Ising and Potts models, that generate conditional simulations of spatially distributed variables from samples with missing data. Currently, the sampling and simulation points are assumed to be at the nodes of a regular grid. The conditional simulations of the 'spin system' are forced to respect locally the sample values and the system statistics globally. The second constraint is enforced by minimizing a cost function representing the deviation between normalized correlation energies of the simulated and the sample distributions. In the approach based on the N c -state Potts model, each point is assigned to one of N c classes. The interactions involve all the points simultaneously. In the Ising model approach, a sequential simulation scheme is used: the discretization at each simulation level is binomial (i.e., ± 1). Information propagates from lower to higher levels as the simulation proceeds. We compare the two approaches in terms of their ability to reproduce the target statistics (e.g., the histogram and the variogram of the sample distribution), to predict data at unsampled locations, as well as in terms of their computational complexity. The comparison is based on a non-Gaussian data set (derived from a digital elevation model of the Walker Lake area, Nevada, USA). We discuss the impact of relevant simulation parameters, such as the domain size, the number of

Painleve test and discrete Boltzmann equations

International Nuclear Information System (INIS)

Euler, N.; Steeb, W.H.

1989-01-01

The Painleve test for various discrete Boltzmann equations is performed. The connection with integrability is discussed. Furthermore the Lie symmetry vector fields are derived and group-theoretical reduction of the discrete Boltzmann equations to ordinary differentiable equations is performed. Lie Backlund transformations are gained by performing the Painleve analysis for the ordinary differential equations. 16 refs

Recent developments in discrete ordinates electron transport

International Nuclear Information System (INIS)

Morel, J.E.; Lorence, L.J. Jr.

1986-01-01

The discrete ordinates method is a deterministic method for numerically solving the Boltzmann equation. It was originally developed for neutron transport calculations, but is routinely used for photon and coupled neutron-photon transport calculations as well. The computational state of the art for coupled electron-photon transport (CEPT) calculations is not as developed as that for neutron transport calculations. The only production codes currently available for CEPT calculations are condensed-history Monte Carlo codes such as the ETRAN and ITS codes. A deterministic capability for production calculations is clearly needed. In response to this need, we have begun the development of a production discrete ordinates code for CEPT calculations. The purpose of this paper is to describe the basic approach we are taking, discuss the current status of the project, and present some new computational results. Although further characterization of the coupled electron-photon discrete ordinates method remains to be done, the results to date indicate that the discrete ordinates method can be just as accurate and from 10 to 100 times faster than the Monte Carlo method for a wide variety of problems. We stress that these results are obtained with standard discrete ordinates codes such as ONETRAN. It is clear that even greater efficiency can be obtained by developing a new generation of production discrete ordinates codes specifically designed to solve the Boltzmann-Fokker-Planck equation. However, the prospects for such development in the near future appear to be remote

Discrete quantum gravity

International Nuclear Information System (INIS)

Williams, Ruth M

2006-01-01

A review is given of a number of approaches to discrete quantum gravity, with a restriction to those likely to be relevant in four dimensions. This paper is dedicated to Rafael Sorkin on the occasion of his sixtieth birthday

Integrable discretizations of the (2+1)-dimensional sinh-Gordon equation

International Nuclear Information System (INIS)

Hu, Xing-Biao; Yu, Guo-Fu

2007-01-01

In this paper, we propose two semi-discrete equations and one fully discrete equation and study them by Hirota's bilinear method. These equations have continuum limits into a system which admits the (2+1)-dimensional generalization of the sinh-Gordon equation. As a result, two integrable semi-discrete versions and one fully discrete version for the sinh-Gordon equation are found. Baecklund transformations, nonlinear superposition formulae, determinant solution and Lax pairs for these discrete versions are presented

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)

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

A numerical method for eigenvalue problems in modeling liquid crystals

Energy Technology Data Exchange (ETDEWEB)

Baglama, J.; Farrell, P.A.; Reichel, L.; Ruttan, A. [Kent State Univ., OH (United States); Calvetti, D. [Stevens Inst. of Technology, Hoboken, NJ (United States)

1996-12-31

Equilibrium configurations of liquid crystals in finite containments are minimizers of the thermodynamic free energy of the system. It is important to be able to track the equilibrium configurations as the temperature of the liquid crystals decreases. The path of the minimal energy configuration at bifurcation points can be computed from the null space of a large sparse symmetric matrix. We describe a new variant of the implicitly restarted Lanczos method that is well suited for the computation of extreme eigenvalues of a large sparse symmetric matrix, and we use this method to determine the desired null space. Our implicitly restarted Lanczos method determines adoptively a polynomial filter by using Leja shifts, and does not require factorization of the matrix. The storage requirement of the method is small, and this makes it attractive to use for the present application.

Degree distribution in discrete case

International Nuclear Information System (INIS)

Wang, Li-Na; Chen, Bin; Yan, Zai-Zai

2011-01-01

Vertex degree of many network models and real-life networks is limited to non-negative integer. By means of measure and integral, the relation of the degree distribution and the cumulative degree distribution in discrete case is analyzed. The degree distribution, obtained by the differential of its cumulative, is only suitable for continuous case or discrete case with constant degree change. When degree change is not a constant but proportional to degree itself, power-law degree distribution and its cumulative have the same exponent and the mean value is finite for power-law exponent greater than 1. -- Highlights: → Degree change is the crux for using the cumulative degree distribution method. → It suits for discrete case with constant degree change. → If degree change is proportional to degree, power-law degree distribution and its cumulative have the same exponent. → In addition, the mean value is finite for power-law exponent greater than 1.

Time dependent and asymptotic neutron number probability distribution calculation using discrete Fourier transform

International Nuclear Information System (INIS)

Humbert, Ph.

2005-01-01

In this paper we consider the probability distribution of neutrons in a multiplying assembly. The problem is studied using a space independent one group neutron point reactor model without delayed neutrons. We recall the generating function methodology and analytical results obtained by G.I. Bell when the c 2 approximation is used and we present numerical solutions in the general case, without this approximation. The neutron source induced distribution is calculated using the single initial neutron distribution which satisfies a master (Kolmogorov backward) equation. This equation is solved using the generating function method. The generating function satisfies a differential equation and the probability distribution is derived by inversion of the generating function. Numerical results are obtained using the same methodology where the generating function is the Fourier transform of the probability distribution. Discrete Fourier transforms are used to calculate the discrete time dependent distributions and continuous Fourier transforms are used to calculate the asymptotic continuous probability distributions. Numerical applications are presented to illustrate the method. (author)

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

Direct Discrete Method for Neutronic Calculations

International Nuclear Information System (INIS)

Vosoughi, Naser; Akbar Salehi, Ali; Shahriari, Majid

2002-01-01

The objective of this paper is to introduce a new direct method for neutronic calculations. This method which is named Direct Discrete Method, is simpler than the neutron Transport equation and also more compatible with physical meaning of problems. This method is based on physic of problem and with meshing of the desired geometry, writing the balance equation for each mesh intervals and with notice to the conjunction between these mesh intervals, produce the final discrete equations series without production of neutron transport differential equation and mandatory passing from differential equation bridge. We have produced neutron discrete equations for a cylindrical shape with two boundary conditions in one group energy. The correction of the results from this method are tested with MCNP-4B code execution. (authors)

On the discrete Gabor transform and the discrete Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Geilen, M.C.W.

1996-01-01

Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal (or synthesis window) and the inverse operation -- the Gabor transform -- with which Gabor's expansion coefficients can be determined, are introduced. It is shown how, in the case of a

Discrete Choice and Rational Inattention

DEFF Research Database (Denmark)

Fosgerau, Mogens; Melo, Emerson; de Palma, André

2017-01-01

This paper establishes a general equivalence between discrete choice and rational inattention models. Matejka and McKay (2015, AER) showed that when information costs are modelled using the Shannon entropy, the result- ing choice probabilities in the rational inattention model take the multinomial...... logit form. We show that when information costs are modelled using a class of generalized entropies, then the choice probabilities in any rational inattention model are observationally equivalent to some additive random utility discrete choice model and vice versa. This equivalence arises from convex...

Process algebra with timing: Real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.

1999-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint is a new real time version with absolute timing, called ACPsat , featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

A hierarchy of Liouville integrable discrete Hamiltonian equations

Energy Technology Data Exchange (ETDEWEB)

Xu Xixiang [College of Science, Shandong University of Science and Technology, Qingdao 266510 (China)], E-mail: xixiang_xu@yahoo.com.cn

2008-05-12

Based on a discrete four-by-four matrix spectral problem, a hierarchy of Lax integrable lattice equations with two potentials is derived. Two Hamiltonian forms are constructed for each lattice equation in the resulting hierarchy by means of the discrete variational identity. A strong symmetry operator of the resulting hierarchy is given. Finally, it is shown that the resulting lattice equations are all Liouville integrable discrete Hamiltonian systems.

The parallel algorithm for the 2D discrete wavelet transform

Science.gov (United States)

Barina, David; Najman, Pavel; Kleparnik, Petr; Kula, Michal; Zemcik, Pavel

2018-04-01

The discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the lifting scheme consists of a small number of operations, it is preferred for processing using single-core CPUs. However, considering a parallel processing using multi-core processors, this scheme is inappropriate due to a large number of steps. On such architectures, the number of steps corresponds to the number of points that represent the exchange of data. Consequently, these points often form a performance bottleneck. Our approach appropriately rearranges calculations inside the transform, and thereby reduces the number of steps. In other words, we propose a new scheme that is friendly to parallel environments. When evaluating on multi-core CPUs, we consistently overcome the original lifting scheme. The evaluation was performed on 61-core Intel Xeon Phi and 8-core Intel Xeon processors.

Variational discretization of the nonequilibrium thermodynamics of simple systems

Science.gov (United States)

Gay-Balmaz, François; Yoshimura, Hiroaki

2018-04-01

In this paper, we develop variational integrators for the nonequilibrium thermodynamics of simple closed systems. These integrators are obtained by a discretization of the Lagrangian variational formulation of nonequilibrium thermodynamics developed in (Gay-Balmaz and Yoshimura 2017a J. Geom. Phys. part I 111 169–93 Gay-Balmaz and Yoshimura 2017b J. Geom. Phys. part II 111 194–212) and thus extend the variational integrators of Lagrangian mechanics, to include irreversible processes. In the continuous setting, we derive the structure preserving property of the flow of such systems. This property is an extension of the symplectic property of the flow of the Euler–Lagrange equations. In the discrete setting, we show that the discrete flow solution of our numerical scheme verifies a discrete version of this property. We also present the regularity conditions which ensure the existence of the discrete flow. We finally illustrate our discrete variational schemes with the implementation of an example of a simple and closed system.

History Matching Through a Smooth Formulation of Multiple-Point Statistics

DEFF Research Database (Denmark)

Melnikova, Yulia; Zunino, Andrea; Lange, Katrine

2014-01-01

and the mismatch with multiple-point statistics. As a result, in the framework of the Bayesian approach, such a solution belongs to a high posterior region. The methodology, while applicable to any inverse problem with a training-image-based prior, is especially beneficial for problems which require expensive......We propose a smooth formulation of multiple-point statistics that enables us to solve inverse problems using gradient-based optimization techniques. We introduce a differentiable function that quantifies the mismatch between multiple-point statistics of a training image and of a given model. We...... show that, by minimizing this function, any continuous image can be gradually transformed into an image that honors the multiple-point statistics of the discrete training image. The solution to an inverse problem is then found by minimizing the sum of two mismatches: the mismatch with data...

Minimum Energy Control of 2D Positive Continuous-Discrete Linear Systems

Directory of Open Access Journals (Sweden)

Kaczorek Tadeusz

2014-09-01

Full Text Available The minimum energy control problem for the 2D positive continuous-discrete linear systems is formulated and solved. Necessary and sufficient conditions for the reachability at the point of the systems are given. Sufficient conditions for the existence of solution to the problem are established. It is shown that if the system is reachable then there exists an optimal input that steers the state from zero boundary conditions to given final state and minimizing the performance index for only one step (q = 1. A procedure for solving of the problem is proposed and illustrated by a numerical example.

Discrete breathers in Bose–Einstein condensates

International Nuclear Information System (INIS)

Franzosi, Roberto; Politi, Antonio; Livi, Roberto; Oppo, Gian-Luca

2011-01-01

Discrete breathers, originally introduced in the context of biopolymers and coupled nonlinear oscillators, are also localized modes of excitation of Bose–Einstein condensates (BEC) in periodic potentials such as those generated by counter-propagating laser beams in an optical lattice. Static and dynamical properties of breather states are analysed in the discrete nonlinear Schrödinger equation that is derived in the limit of deep potential wells, tight-binding and the superfluid regime of the condensate. Static and mobile breathers can be formed by progressive re-shaping of initial Gaussian wave-packets or by transporting atomic density towards dissipative boundaries of the lattice. Static breathers generated via boundary dissipations are determined via a transfer-matrix approach and discussed in the two analytic limits of highly localized and very broad profiles. Mobile breathers that move across the lattice are well approximated by modified analytical expressions derived from integrable models with two independent parameters: the core-phase gradient and the peak amplitude. Finally, possible experimental realizations of discrete breathers in BEC in optical lattices are discussed in the presence of residual harmonic trapping and in interferometry configurations suitable to investigate discrete breathers' interactions. (invited article)

Continuous- and Discrete-Time Stimulus Sequences for High Stimulus Rate Paradigm in Evoked Potential Studies

Directory of Open Access Journals (Sweden)

Tao Wang

2013-01-01

Full Text Available To obtain reliable transient auditory evoked potentials (AEPs from EEGs recorded using high stimulus rate (HSR paradigm, it is critical to design the stimulus sequences of appropriate frequency properties. Traditionally, the individual stimulus events in a stimulus sequence occur only at discrete time points dependent on the sampling frequency of the recording system and the duration of stimulus sequence. This dependency likely causes the implementation of suboptimal stimulus sequences, sacrificing the reliability of resulting AEPs. In this paper, we explicate the use of continuous-time stimulus sequence for HSR paradigm, which is independent of the discrete electroencephalogram (EEG recording system. We employ simulation studies to examine the applicability of the continuous-time stimulus sequences and the impacts of sampling frequency on AEPs in traditional studies using discrete-time design. Results from these studies show that the continuous-time sequences can offer better frequency properties and improve the reliability of recovered AEPs. Furthermore, we find that the errors in the recovered AEPs depend critically on the sampling frequencies of experimental systems, and their relationship can be fitted using a reciprocal function. As such, our study contributes to the literature by demonstrating the applicability and advantages of continuous-time stimulus sequences for HSR paradigm and by revealing the relationship between the reliability of AEPs and sampling frequencies of the experimental systems when discrete-time stimulus sequences are used in traditional manner for the HSR paradigm.

Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System

Directory of Open Access Journals (Sweden)

Jie Ran

2015-01-01

Full Text Available The dynamics of a discrete-time hyperchaotic system and the amplitude control of Hopf bifurcation for a stochastic discrete-time hyperchaotic system are investigated in this paper. Numerical simulations are presented to exhibit the complex dynamical behaviors in the discrete-time hyperchaotic system. Furthermore, the stochastic discrete-time hyperchaotic system with random parameters is transformed into its equivalent deterministic system with the orthogonal polynomial theory of discrete random function. In addition, the dynamical features of the discrete-time hyperchaotic system with random disturbances are obtained through its equivalent deterministic system. By using the Hopf bifurcation conditions of the deterministic discrete-time system, the specific conditions for the existence of Hopf bifurcation in the equivalent deterministic system are derived. And the amplitude control with random intensity is discussed in detail. Finally, the feasibility of the control method is demonstrated by numerical simulations.

Discrete event simulation of the Defense Waste Processing Facility (DWPF) analytical laboratory

International Nuclear Information System (INIS)

Shanahan, K.L.

1992-02-01

A discrete event simulation of the Savannah River Site (SRS) Defense Waste Processing Facility (DWPF) analytical laboratory has been constructed in the GPSS language. It was used to estimate laboratory analysis times at process analytical hold points and to study the effect of sample number on those times. Typical results are presented for three different simultaneous representing increasing levels of complexity, and for different sampling schemes. Example equipment utilization time plots are also included. SRS DWPF laboratory management and chemists found the simulations very useful for resource and schedule planning

Discrete mathematics in the high school curriculum

NARCIS (Netherlands)

Anderson, I.; Asch, van A.G.; van Lint, J.H.

2004-01-01

In this paper we present some topics from the field of discrete mathematics which might be suitable for the high school curriculum. These topics yield both easy to understand challenging problems and important applications of discrete mathematics. We choose elements from number theory and various

Hybrid discrete-time neural networks.

Science.gov (United States)

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

Stochastic Kuramoto oscillators with discrete phase states

Science.gov (United States)

Jörg, David J.

2017-09-01

We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

Stochastic Kuramoto oscillators with discrete phase states.

Science.gov (United States)

Jörg, David J

2017-09-01

We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

Cone-beam tomography with discrete data sets

International Nuclear Information System (INIS)

Barrett, H.H.

1994-01-01

Sufficiently conditions for cone-beam data are well known for the case of continuous data collection along a cone-vortex curve with continuous detectors. These continuous conditions are inadequate for real-world data where discrete vertex geometries and discrete detector arrays are used. In this paper we present a theoretical formulation of cone-beam tomography with arbitrary discrete arrays of detectors and vertices. The theory models the imaging system as a linear continuous-to-discrete mapping and represents the continuous object exactly as a Fourier series. The reconstruction problem is posed as the estimation of some subset of the Fourier coefficients. The main goal of the theory is to determine which Fourier coefficients can be reliably determined from the data delivered by a specific discrete design. A fourier component will be well determined by the data if it satisfies two conditions: it makes a strong contribution to the data, and this contribution is relatively independent of the contribution of other Fourier components. To make these considerations precise, we introduce a concept called the cross-talk matrix. A diagonal element of this matrix measures the strength of a Fourier component in the data, while an off-diagonal element quantifies the dependence or aliasing of two different components. (Author)

On discrete models of space-time

International Nuclear Information System (INIS)

Horzela, A.; Kempczynski, J.; Kapuscik, E.; Georgia Univ., Athens, GA; Uzes, Ch.

1992-02-01

Analyzing the Einstein radiolocation method we come to the conclusion that results of any measurement of space-time coordinates should be expressed in terms of rational numbers. We show that this property is Lorentz invariant and may be used in the construction of discrete models of space-time different from the models of the lattice type constructed in the process of discretization of continuous models. (author)

Reflectionless discrete Schr\\"odinger operators are spectrally atypical

OpenAIRE

VandenBoom, Tom

2017-01-01

We prove that, if an isospectral torus contains a discrete Schr\\"odinger operator with nonconstant potential, the shift dynamics on that torus cannot be minimal. Consequently, we specify a generic sense in which finite unions of nondegenerate closed intervals having capacity one are not the spectrum of any reflectionless discrete Schr\\"odinger operator. We also show that the only reflectionless discrete Schr\\"odinger operators having zero, one, or two spectral gaps are periodic.

A Baecklund transformation between two integrable discrete hungry systems

International Nuclear Information System (INIS)

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

2011-01-01

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

A Baecklund transformation between two integrable discrete hungry systems

Energy Technology Data Exchange (ETDEWEB)

Fukuda, Akiko, E-mail: j1409704@ed.kagu.tus.ac.j [Department of Mathematical Information Science, Graduate School of Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Yamamoto, Yusaku [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 (Japan); Iwasaki, Masashi [Department of Informatics and Environmental Science, Kyoto Prefectural University, 1-5, Nakaragi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522 (Japan); Ishiwata, Emiko [Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Nakamura, Yoshimasa [Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)

2011-01-17

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

An introduction to non-Abelian discrete symmetries for particle physicists

CERN Document Server

Ishimori, Hajime; Ohki, Hiroshi; Okada, Hiroshi; Shimizu, Yusuke; Tanimoto, Morimitsu

2012-01-01

These lecture notes provide a tutorial review of non-Abelian discrete groups and show some applications to issues in physics where discrete symmetries constitute an important principle for model building in particle physics. While Abelian discrete symmetries are often imposed in order to control couplings for particle physics - in particular model building beyond the standard model - non-Abelian discrete symmetries have been applied to understand the three-generation flavor structure in particular. Indeed, non-Abelian discrete symmetries are considered to be the most attractive choice for the flavor sector: model builders have tried to derive experimental values of quark and lepton masses, and mixing angles by assuming non-Abelian discrete flavor symmetries of quarks and leptons, yet, lepton mixing has already been intensively discussed in this context, as well. The possible origins of the non-Abelian discrete symmetry for flavors is another topic of interest, as they can arise from an underlying theory -...

Partition-based discrete-time quantum walks

Science.gov (United States)

Konno, Norio; Portugal, Renato; Sato, Iwao; Segawa, Etsuo

2018-04-01

We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.

Stabilizing the discrete vortex of topological charge S=2

International Nuclear Information System (INIS)

Kevrekidis, P.G.; Frantzeskakis, D.J.

2005-01-01

We study the instability of the discrete vortex with topological charge S=2 in a prototypical lattice model and observe its mediation through the central lattice site. Motivated by this finding, we analyze the model with the central site being inert. We identify analytically and observe numerically the existence of a range of linearly stable discrete vortices with S=2 in the latter model. The range of stability is comparable to that of the recently observed experimentally S=1 discrete vortex, suggesting the potential for observation of such higher charge discrete vortices

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

An analysis of global robust stability of uncertain cellular neural networks with discrete and distributed delays

International Nuclear Information System (INIS)

Park, Ju H.

2007-01-01

This paper considers the robust stability analysis of cellular neural networks with discrete and distributed delays. Based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, a novel stability criterion guaranteeing the global robust convergence of the equilibrium point is derived. The criterion can be solved easily by various convex optimization algorithms. An example is given to illustrate the usefulness of our results

Solitonlike solutions of the generalized discrete nonlinear Schrödinger equation

DEFF Research Database (Denmark)

Rasmussen, Kim; Henning, D.; Gabriel, H.

1996-01-01

We investigate the solution properties oi. a generalized discrete nonlinear Schrodinger equation describing a nonlinear lattice chain. The generalized equation interpolates between the integrable discrete Ablowitz-Ladik equation and the nonintegrable discrete Schrodinger equation. Special interes...... nonlinear Schrodinger equation. In this way eve are able to construct coherent solitonlike structures of profile determined by the map parameters.......We investigate the solution properties oi. a generalized discrete nonlinear Schrodinger equation describing a nonlinear lattice chain. The generalized equation interpolates between the integrable discrete Ablowitz-Ladik equation and the nonintegrable discrete Schrodinger equation. Special interest...

Local discrete symmetries from superstring derived models

International Nuclear Information System (INIS)

Faraggi, A.E.

1996-10-01

Discrete and global symmetries play an essential role in many extensions of the Standard Model, for example, to preserve the proton lifetime, to prevent flavor changing neutral currents, etc. An important question is how can such symmetries survive in a theory of quantum gravity, like superstring theory. In a specific string model the author illustrates how local discrete symmetries may arise in string models and play an important role in preventing fast proton decay and flavor changing neutral currents. The local discrete symmetry arises due to the breaking of the non-Abelian gauge symmetries by Wilson lines in the superstring models and forbids, for example dimension five operators which mediate rapid proton decay, to all orders of nonrenormalizable terms. In the context of models of unification of the gauge and gravitational interactions, it is precisely this type of local discrete symmetries that must be found in order to insure that a given model is not in conflict with experimental observations

Discrete dispersion models and their Tweedie asymptotics

DEFF Research Database (Denmark)

Jørgensen, Bent; Kokonendji, Célestin C.

2016-01-01

The paper introduce a class of two-parameter discrete dispersion models, obtained by combining convolution with a factorial tilting operation, similar to exponential dispersion models which combine convolution and exponential tilting. The equidispersed Poisson model has a special place in this ap......The paper introduce a class of two-parameter discrete dispersion models, obtained by combining convolution with a factorial tilting operation, similar to exponential dispersion models which combine convolution and exponential tilting. The equidispersed Poisson model has a special place...... in this approach, whereas several overdispersed discrete distributions, such as the Neyman Type A, Pólya-Aeppli, negative binomial and Poisson-inverse Gaussian, turn out to be Poisson-Tweedie factorial dispersion models with power dispersion functions, analogous to ordinary Tweedie exponential dispersion models...... with power variance functions. Using the factorial cumulant generating function as tool, we introduce a dilation operation as a discrete analogue of scaling, generalizing binomial thinning. The Poisson-Tweedie factorial dispersion models are closed under dilation, which in turn leads to a Poisson...

Use cases of discrete event simulation. Appliance and research

Energy Technology Data Exchange (ETDEWEB)

Bangsow, Steffen (ed.)

2012-11-01

Use Cases of Discrete Event Simulation. Includes case studies from various important industries such as automotive, aerospace, robotics, production industry. Written by leading experts in the field. Over the last decades Discrete Event Simulation has conquered many different application areas. This trend is, on the one hand, driven by an ever wider use of this technology in different fields of science and on the other hand by an incredibly creative use of available software programs through dedicated experts. This book contains articles from scientists and experts from 10 countries. They illuminate the width of application of this technology and the quality of problems solved using Discrete Event Simulation. Practical applications of simulation dominate in the present book. The book is aimed to researchers and students who deal in their work with Discrete Event Simulation and which want to inform them about current applications. By focusing on discrete event simulation, this book can also serve as an inspiration source for practitioners for solving specific problems during their work. Decision makers who deal with the question of the introduction of discrete event simulation for planning support and optimization this book provides a contribution to the orientation, what specific problems could be solved with the help of Discrete Event Simulation within the organization.

Discrete Pathophysiology is Uncommon in Patients with Nonspecific Arm Pain.

Science.gov (United States)

Kortlever, Joost T P; Janssen, Stein J; Molleman, Jeroen; Hageman, Michiel G J S; Ring, David

2016-06-01

Nonspecific symptoms are common in all areas of medicine. Patients and caregivers can be frustrated when an illness cannot be reduced to a discrete pathophysiological process that corresponds with the symptoms. We therefore asked the following questions: 1) Which demographic factors and psychological comorbidities are associated with change from an initial diagnosis of nonspecific arm pain to eventual identification of discrete pathophysiology that corresponds with symptoms? 2) What is the percentage of patients eventually diagnosed with discrete pathophysiology, what are those pathologies, and do they account for the symptoms? We evaluated 634 patients with an isolated diagnosis of nonspecific upper extremity pain to see if discrete pathophysiology was diagnosed on subsequent visits to the same hand surgeon, a different hand surgeon, or any physician within our health system for the same pain. There were too few patients with discrete pathophysiology at follow-up to address the primary study question. Definite discrete pathophysiology that corresponded with the symptoms was identified in subsequent evaluations by the index surgeon in one patient (0.16% of all patients) and cured with surgery (nodular fasciitis). Subsequent doctors identified possible discrete pathophysiology in one patient and speculative pathophysiology in four patients and the index surgeon identified possible discrete pathophysiology in four patients, but the five discrete diagnoses accounted for only a fraction of the symptoms. Nonspecific diagnoses are not harmful. Prospective randomized research is merited to determine if nonspecific, descriptive diagnoses are better for patients than specific diagnoses that imply pathophysiology in the absence of discrete verifiable pathophysiology.

Implementing the Standards. Teaching Discrete Mathematics in Grades 7-12.

Science.gov (United States)

Hart, Eric W.; And Others

1990-01-01

Discrete mathematics are defined briefly. A course in discrete mathematics for high school students and teaching discrete mathematics in grades 7 and 8 including finite differences, recursion, and graph theory are discussed. (CW)

Surface Design Based on Discrete Conformal Transformations

Science.gov (United States)

Duque, Carlos; Santangelo, Christian; Vouga, Etienne

Conformal transformations are angle-preserving maps from one domain to another. Although angles are preserved, the lengths between arbitrary points are not generally conserved. As a consequence there is always a given amount of distortion associated to any conformal map. Different uses of such transformations can be found in various fields, but have been used by us to program non-uniformly swellable gel sheets to buckle into prescribed three dimensional shapes. In this work we apply circle packings as a kind of discrete conformal map in order to find conformal maps from the sphere to the plane that can be used as nearly uniform swelling patterns to program non-Euclidean sheets to buckle into spheres. We explore the possibility of tuning the area distortion to fit the experimental range of minimum and maximum swelling by modifying the boundary of the planar domain through the introduction of different cutting schemes.

Discretized representations of harmonic variables by bilateral Jacobi operators

Directory of Open Access Journals (Sweden)

Andreas Ruffing

2000-01-01

Full Text Available Starting from a discrete Heisenberg algebra we solve several representation problems for a discretized quantum oscillator in a weighted sequence space. The Schrödinger operator for a discrete harmonic oscillator is derived. The representation problem for a q-oscillator algebra is studied in detail. The main result of the article is the fact that the energy representation for the discretized momentum operator can be interpreted as follows: It allows to calculate quantum properties of a large number of non-interacting harmonic oscillators at the same time. The results can be directly related to current research on squeezed laser states in quantum optics. They reveal and confirm the observation that discrete versions of continuum Schrodinger operators allow more structural freedom than their continuum analogs do.

Accuracy Evaluation of The Depth of Six Kinds of Sperm Counting Chambers for both Manual and Computer-Aided Semen Analyses

Directory of Open Access Journals (Sweden)

Jin-Chun Lu

2016-12-01

Full Text Available Background: Although the depth of the counting chamber is an important factor influencing sperm counting, no research has yet been reported on the measurement and comparison of the depth of the chamber. We measured the exact depths of six kinds of sperm counting chambers and evaluated their accuracy. Materials and Methods: In this prospective study, the depths of six kinds of sperm counting chambers for both manual and computer-aided semen analyses, including Makler (n=24, Macro (n=32, Geoffrey (n=34, GoldCyto (n=20, Leja (n=20 and Cell-VU (n=20, were measured with the Filmetrics F20 Spectral Reflectance Thin-Film Measurement System, then the mean depth, the range and the coefficient of variation (CV of each chamber, and the mean depth, relative deviation and acceptability of each kind of chamber were calculated by the closeness to the nominal value. Among the 24 Makler chambers, 5 were new and 19 were used, and the other five kinds were all new chambers. Results: The depths (mean ± SD, μm of Makler (new, Macro and Geoffrey chambers were 11.07 ± 0.41, 10.19 ± 0.48 and 10.00 ± 0.28, respectively, while those of GoldCyto, Leja and Cell-VU chambers were 23.76 ± 2.15, 20.49 ± 0.22 and 24.22 ± 2.58, respectively. The acceptability of Geoffrey chambers was the highest (94.12%, followed by Macro (65.63%, Leja (35% and Makler (20%, while that of the other two kinds and the used Makler chamber was zero. Conclusion: There existed some difference between the actual depth and the corresponding nominal value for sperm counting chambers, and the overall acceptability was very low. Moreover, the abrasion caused by the long use, as of Makler chamber, for example, may result in unacceptability of the chamber. In order to ensure the accuracy and repeatability of sperm concentration results, the depth of the sperm counting chamber must be checked regularly.

Discretization vs. Rounding Error in Euler's Method

Science.gov (United States)

Borges, Carlos F.

2011-01-01

Euler's method for solving initial value problems is an excellent vehicle for observing the relationship between discretization error and rounding error in numerical computation. Reductions in stepsize, in order to decrease discretization error, necessarily increase the number of steps and so introduce additional rounding error. The problem is…

Bifurcation and complex dynamics of a discrete-time predator-prey system

Directory of Open Access Journals (Sweden)

S. M. Sohel Rana

2015-06-01

Full Text Available In this paper, we investigate the dynamics of a discrete-time predator-prey system of Holling-I type in the closed first quadrant R+2. The existence and local stability of positive fixed point of the discrete dynamical system is analyzed algebraically. It is shown that the system undergoes a flip bifurcation and a Neimark-Sacker bifurcation in the interior of R+2 by using bifurcation theory. It has been found that the dynamical behavior of the model is very sensitive to the parameter values and the initial conditions. Numerical simulation results not only show the consistence with the theoretical analysis but also display the new and interesting dynamic behaviors, including phase portraits, period-9, 10, 20-orbits, attracting invariant circle, cascade of period-doubling bifurcation from period-20 leading to chaos, quasi-periodic orbits, and sudden disappearance of the chaotic dynamics and attracting chaotic set. In particular, we observe that when the prey is in chaotic dynamic, the predator can tend to extinction or to a stable equilibrium. The Lyapunov exponents are numerically computed to characterize the complexity of the dynamical behaviors. The analysis and results in this paper are interesting in mathematics and biology.

Solution algorithms for a PN-1 - Equivalent SN angular discretization of the transport equation in one-dimensional spherical coordinates

International Nuclear Information System (INIS)

Warsa, J. S.; Morel, J. E.

2007-01-01

Angular discretizations of the S N transport equation in curvilinear coordinate systems may result in a streaming-plus-removal operator that is dense in the angular variable or that is not lower-triangular. We investigate numerical solution algorithms for such angular discretizations using relationships given by Chandrasekhar to compute the angular derivatives in the one-dimensional S N transport equation in spherical coordinates with Gauss quadrature. This discretization makes the S N transport equation P N-1 - equivalent, but it also makes the sweep operator dense at every spatial point because the N angular derivatives are expressed in terms of the N angular fluxes. To avoid having to invert the sweep operator directly, we must work with the angular fluxes to solve the equations iteratively. We show how we can use approximations to the sweep operator to precondition the full P N-1 equivalent S N equations. We show that these pre-conditioners affect the operator enough such that convergence of a Krylov iterative method improves. (authors)

The correlation function for density perturbations in an expanding universe. III The three-point and predictions of the four-point and higher order correlation functions

Science.gov (United States)

Mcclelland, J.; Silk, J.

1978-01-01

Higher-order correlation functions for the large-scale distribution of galaxies in space are investigated. It is demonstrated that the three-point correlation function observed by Peebles and Groth (1975) is not consistent with a distribution of perturbations that at present are randomly distributed in space. The two-point correlation function is shown to be independent of how the perturbations are distributed spatially, and a model of clustered perturbations is developed which incorporates a nonuniform perturbation distribution and which explains the three-point correlation function. A model with hierarchical perturbations incorporating the same nonuniform distribution is also constructed; it is found that this model also explains the three-point correlation function, but predicts different results for the four-point and higher-order correlation functions than does the model with clustered perturbations. It is suggested that the model of hierarchical perturbations might be explained by the single assumption of having density fluctuations or discrete objects all of the same mass randomly placed at some initial epoch.

Discretization-dependent model for weakly connected excitable media

Science.gov (United States)

Arroyo, Pedro André; Alonso, Sergio; Weber dos Santos, Rodrigo

2018-03-01

Pattern formation has been widely observed in extended chemical and biological processes. Although the biochemical systems are highly heterogeneous, homogenized continuum approaches formed by partial differential equations have been employed frequently. Such approaches are usually justified by the difference of scales between the heterogeneities and the characteristic spatial size of the patterns. Under different conditions, for example, under weak coupling, discrete models are more adequate. However, discrete models may be less manageable, for instance, in terms of numerical implementation and mesh generation, than the associated continuum models. Here we study a model to approach discreteness which permits the computer implementation on general unstructured meshes. The model is cast as a partial differential equation but with a parameter that depends not only on heterogeneities sizes, as in the case of quasicontinuum models, but also on the discretization mesh. Therefore, we refer to it as a discretization-dependent model. We validate the approach in a generic excitable media that simulates three different phenomena: the propagation of action membrane potential in cardiac tissue, in myelinated axons of neurons, and concentration waves in chemical microemulsions.

Discrete Variational Approach for Modeling Laser-Plasma Interactions

Science.gov (United States)

Reyes, J. Paxon; Shadwick, B. A.

2014-10-01

The traditional approach for fluid models of laser-plasma interactions begins by approximating fields and derivatives on a grid in space and time, leading to difference equations that are manipulated to create a time-advance algorithm. In contrast, by introducing the spatial discretization at the level of the action, the resulting Euler-Lagrange equations have particular differencing approximations that will exactly satisfy discrete versions of the relevant conservation laws. For example, applying a spatial discretization in the Lagrangian density leads to continuous-time, discrete-space equations and exact energy conservation regardless of the spatial grid resolution. We compare the results of two discrete variational methods using the variational principles from Chen and Sudan and Brizard. Since the fluid system conserves energy and momentum, the relative errors in these conserved quantities are well-motivated physically as figures of merit for a particular method. This work was supported by the U. S. Department of Energy under Contract No. DE-SC0008382 and by the National Science Foundation under Contract No. PHY-1104683.

Constructing Quality Adjusted Price Indexes: a Comparison of Hedonic and Discrete Choice Models

OpenAIRE

N. Jonker

2001-01-01

The Boskin report (1996) concluded that the US consumer price index (CPI) overestimated the inflation by 1.1 percentage points. This was due to several measurement errors in the CPI. One of them is called quality change bias. In this paper two methods are compared which can be used to eliminate quality change bias, namely the hedonic method and a method based on the use of discrete choice models. The underlying micro-economic fundations of the two methods are compared as well as their empiric...

Discrete dislocation plasticity analysis of loading rate-dependent static friction.

Science.gov (United States)

Song, H; Deshpande, V S; Van der Giessen, E

2016-08-01

From a microscopic point of view, the frictional force associated with the relative sliding of rough surfaces originates from deformation of the material in contact, by adhesion in the contact interface or both. We know that plastic deformation at the size scale of micrometres is not only dependent on the size of the contact, but also on the rate of deformation. Moreover, depending on its physical origin, adhesion can also be size and rate dependent, albeit different from plasticity. We present a two-dimensional model that incorporates both discrete dislocation plasticity inside a face-centred cubic crystal and adhesion in the interface to understand the rate dependence of friction caused by micrometre-size asperities. The friction strength is the outcome of the competition between adhesion and discrete dislocation plasticity. As a function of contact size, the friction strength contains two plateaus: at small contact length [Formula: see text], the onset of sliding is fully controlled by adhesion while for large contact length [Formula: see text], the friction strength approaches the size-independent plastic shear yield strength. The transition regime at intermediate contact size is a result of partial de-cohesion and size-dependent dislocation plasticity, and is determined by dislocation properties, interfacial properties as well as by the loading rate.

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

Discrete Tomography and Imaging of Polycrystalline Structures

DEFF Research Database (Denmark)

Alpers, Andreas

High resolution transmission electron microscopy is commonly considered as the standard application for discrete tomography. While this has yet to be technically realized, new applications with a similar flavor have emerged in materials science. In our group at Ris� DTU (Denmark's National...... Laboratory for Sustainable Energy), for instance, we study polycrystalline materials via synchrotron X-ray diffraction. Several reconstruction problems arise, most of them exhibit inherently discrete aspects. In this talk I want to give a concise mathematical introduction to some of these reconstruction...... problems. Special focus is on their relationship to classical discrete tomography. Several open mathematical questions will be mentioned along the way....

Cuspidal discrete series for semisimple symmetric spaces

DEFF Research Database (Denmark)

Andersen, Nils Byrial; Flensted-Jensen, Mogens; Schlichtkrull, Henrik

2012-01-01

We propose a notion of cusp forms on semisimple symmetric spaces. We then study the real hyperbolic spaces in detail, and show that there exists both cuspidal and non-cuspidal discrete series. In particular, we show that all the spherical discrete series are non-cuspidal. (C) 2012 Elsevier Inc. All...

Geometry and Hamiltonian mechanics on discrete spaces

NARCIS (Netherlands)

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

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to

Characterizing a discrete-to-discrete X-ray transform for iterative image reconstruction with limited angular-range scanning in CT

DEFF Research Database (Denmark)

Sidky, Emil; Jørgensen, Jakob Heide; Pan, Xiaochuan

2012-01-01

Iterative image reconstruction in computed tomography often employs a discrete-to-discrete (DD) linear data model, and many of the aspects of the image recovery relate directly to the properties of this linear model. While much is known about the properties of the continuous X-ray, the correspond...

An innovative discrete multilevel sampler design

International Nuclear Information System (INIS)

Marvin, B.K.; De Clercq, P.J.; Taylor, B.B.; Mauro, D.M.

1995-01-01

An innovative, small-diameter PVC discrete multilevel sampler (DMLS) was designed for the Electric Power Research Institute (EPRI) to provide low-cost, discrete groundwater samples from shallow aquifers. When combined with appropriately-sized direct push soil sampling technologies, high resolution aquifer characterization can be achieved during initial site assessment or remediation monitoring activities. The sampler is constructed from 1-inch diameter PVC well materials, containing polyethylene tubing threaded through PVC disks. Self-expanding annular and internal bentonite seals were developed which isolate discrete sampling zones. The DMLS design allows customization of sampling and isolation zone lengths to suit site-specific goals. Installation of the DMLS is achieved using a temporary, expendable-tipped casting driven by direct push methods. This technique minimizes mobilization costs, site and soil column disturbances, and allows rapid installation in areas of limited overhead clearance. Successful pilot installations of the DMLS prototype have been made at a former manufactured gas plant (MGP) site and a diesel fuel spill site. Analysis of groundwater samples from these sites, using relative compound distributions and contaminant concentration profiling, confirmed that representative discrete samples were collected. This design provides both economical and versatile groundwater monitoring during all phases of site assessment and remediation

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.

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.

Mapping of uncertainty relations between continuous and discrete time.

Science.gov (United States)

Chiuchiù, Davide; Pigolotti, Simone

2018-03-01

Lower bounds on fluctuations of thermodynamic currents depend on the nature of time, discrete or continuous. To understand the physical reason, we compare current fluctuations in discrete-time Markov chains and continuous-time master equations. We prove that current fluctuations in the master equations are always more likely, due to random timings of transitions. This comparison leads to a mapping of the moments of a current between discrete and continuous time. We exploit this mapping to obtain uncertainty bounds. Our results reduce the quests for uncertainty bounds in discrete and continuous time to a single problem.

Discrete stochastic analogs of Erlang epidemic models.

Science.gov (United States)

Getz, Wayne M; Dougherty, Eric R

2018-12-01