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.

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.

Stochastic analysis in discrete and continuous settings with normal martingales

CERN Document Server

Privault, Nicolas

2009-01-01

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

A NEW STRATEGY FOR IMPROVING FEATURE SETS IN A DISCRETE HMM­BASED HANDWRITING RECOGNITION SYSTEM

NARCIS (Netherlands)

Grandidier, F.; Sabourin, R.; Suen, C.Y.; Gilloux, M.

2004-01-01

In this paper we introduce a new strategy for improving a discrete HMM­based handwriting recognition system, by integrating several information sources from specialized feature sets. For a given system, the basic idea is to keep the most discriminative features, and to replace the others with new

CD-Based Microfluidics for Primary Care in Extreme Point-of-Care Settings

Directory of Open Access Journals (Sweden)

Suzanne Smith

2016-01-01

Full Text Available We review the utility of centrifugal microfluidic technologies applied to point-of-care diagnosis in extremely under-resourced environments. The various challenges faced in these settings are showcased, using areas in India and Africa as examples. Measures for the ability of integrated devices to effectively address point-of-care challenges are highlighted, and centrifugal, often termed CD-based microfluidic technologies, technologies are presented as a promising platform to address these challenges. We describe the advantages of centrifugal liquid handling, as well as the ability of a standard CD player to perform a number of common laboratory tests, fulfilling the role of an integrated lab-on-a-CD. Innovative centrifugal approaches for point-of-care in extremely resource-poor settings are highlighted, including sensing and detection strategies, smart power sources and biomimetic inspiration for environmental control. The evolution of centrifugal microfluidics, along with examples of commercial and advanced prototype centrifugal microfluidic systems, is presented, illustrating the success of deployment at the point-of-care. A close fit of emerging centrifugal systems to address a critical panel of tests for under-resourced clinic settings, formulated by medical experts, is demonstrated. This emphasizes the potential of centrifugal microfluidic technologies to be applied effectively to extremely challenging point-of-care scenarios and in playing a role in improving primary care in resource-limited settings across the developing world.

Analysis model for forecasting extreme temperature using refined rank set pair

Directory of Open Access Journals (Sweden)

Qiao Ling-Xia

2013-01-01

Full Text Available In order to improve the precision of forecasting extreme temperature time series, a refined rank set pair analysis model with a refined rank transformation function is proposed to improve precision of its prediction. The measured values of the annual highest temperature of two China’s cities, Taiyuan and Shijiazhuang, in July are taken to examine the performance of a refined rank set pair model.

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

Theory and computation of disturbance invariant sets for discrete-time linear systems

Directory of Open Access Journals (Sweden)

Kolmanovsky Ilya

1998-01-01

Full Text Available This paper considers the characterization and computation of invariant sets for discrete-time, time-invariant, linear systems with disturbance inputs whose values are confined to a specified compact set but are otherwise unknown. The emphasis is on determining maximal disturbance-invariant sets X that belong to a specified subset Γ of the state space. Such d-invariant sets have important applications in control problems where there are pointwise-in-time state constraints of the form χ ( t ∈ Γ . One purpose of the paper is to unite and extend in a rigorous way disparate results from the prior literature. In addition there are entirely new results. Specific contributions include: exploitation of the Pontryagin set difference to clarify conceptual matters and simplify mathematical developments, special properties of maximal invariant sets and conditions for their finite determination, algorithms for generating concrete representations of maximal invariant sets, practical computational questions, extension of the main results to general Lyapunov stable systems, applications of the computational techniques to the bounding of state and output response. Results on Lyapunov stable systems are applied to the implementation of a logic-based, nonlinear multimode regulator. For plants with disturbance inputs and state-control constraints it enlarges the constraint-admissible domain of attraction. Numerical examples illustrate the various theoretical and computational results.

Thermodynamic framework for discrete optimal control in multiphase flow systems

Science.gov (United States)

Sieniutycz, Stanislaw

1999-08-01

Bellman's method of dynamic programming is used to synthesize diverse optimization approaches to active (work producing) and inactive (entropy generating) multiphase flow systems. Thermal machines, optimally controlled unit operations, nonlinear heat conduction, spontaneous relaxation processes, and self-propagating wave fronts are all shown to satisfy a discrete Hamilton-Jacobi-Bellman equation and a corresponding discrete optimization algorithm of Pontryagin's type, with the maximum principle for a Hamiltonian. The extremal structures are always canonical. A common unifying criterion is set for all considered systems, which is the criterion of a minimum generated entropy. It is shown that constraints can modify the entropy functionals in a different way for each group of the processes considered; thus the resulting structures of these functionals may differ significantly. Practical conclusions are formulated regarding the energy savings and energy policy in optimally controlled systems.

[Injury mechanisms in extreme violence settings].

Science.gov (United States)

Arcaute-Velazquez, Fernando Federico; García-Núñez, Luis Manuel; Noyola-Vilallobos, Héctor Faustino; Espinoza-Mercado, Fernando; Rodríguez-Vega, Carlos Eynar

2016-01-01

Extreme violence events are consequence of current world-wide economic, political and social conditions. Injury patterns found among victims of extreme violence events are very complex, obeying several high-energy injury mechanisms. In this article, we present the basic concepts of trauma kinematics that regulate the clinical approach to victims of extreme violence events, in the hope that clinicians increase their theoretical armamentarium, and reflecting on obtaining better outcomes. Copyright © 2016. Published by Masson Doyma México S.A.

Moved by words: Affective ratings for a set of 2,266 Spanish words in five discrete emotion categories.

Science.gov (United States)

Ferré, Pilar; Guasch, Marc; Martínez-García, Natalia; Fraga, Isabel; Hinojosa, José Antonio

2017-06-01

The two main theoretical accounts of the human affective space are the dimensional perspective and the discrete-emotion approach. In recent years, several affective norms have been developed from a dimensional perspective, including ratings for valence and arousal. In contrast, the number of published datasets relying on the discrete-emotion approach is much lower. There is a need to fill this gap, considering that discrete emotions have an effect on word processing above and beyond those of valence and arousal. In the present study, we present ratings from 1,380 participants for a set of 2,266 Spanish words in five discrete emotion categories: happiness, anger, fear, disgust, and sadness. This will be the largest dataset published to date containing ratings for discrete emotions. We also present, for the first time, a fine-grained analysis of the distribution of words into the five emotion categories. This analysis reveals that happiness words are the most consistently related to a single, discrete emotion category. In contrast, there is a tendency for many negative words to belong to more than one discrete emotion. The only exception is disgust words, which overlap least with the other negative emotions. Normative valence and arousal data already exist for all of the words included in this corpus. Thus, the present database will allow researchers to design studies to contrast the predictions of the two most influential theoretical perspectives in this field. These studies will undoubtedly contribute to a deeper understanding of the effects of emotion on word processing.

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.

Optimization with Extremal Dynamics

International Nuclear Information System (INIS)

Boettcher, Stefan; Percus, Allon G.

2001-01-01

We explore a new general-purpose heuristic for finding high-quality solutions to hard discrete optimization problems. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. Extremal optimization successively updates extremely undesirable variables of a single suboptimal solution, assigning them new, random values. Large fluctuations ensue, efficiently exploring many local optima. We use extremal optimization to elucidate the phase transition in the 3-coloring problem, and we provide independent confirmation of previously reported extrapolations for the ground-state energy of ±J spin glasses in d=3 and 4

Of overlapping Cantor sets and earthquakes: analysis of the discrete Chakrabarti-Stinchcombe model

Science.gov (United States)

Bhattacharyya, Pratip

2005-03-01

We report an exact analysis of a discrete form of the Chakrabarti-Stinchcombe model for earthquakes (Physica A 270 (1999) 27), which considers a pair of dynamically overlapping finite generations of the Cantor set as a prototype of geological faults. In this model the nth generation of the Cantor set shifts on its replica in discrete steps of the length of a line segment in that generation and periodic boundary conditions are assumed. We determine the general form of time sequences for the constant magnitude overlaps and, hence, obtain the complete time-series of overlaps by the superposition of these sequences for all overlap magnitudes. From the time-series we derive the exact frequency distribution of the overlap magnitudes. The corresponding probability distribution of the logarithm of overlap magnitudes for the nth generation is found to assume the form of the binomial distribution for n Bernoulli trials with probability {1}/{3} for the success of each trial. For an arbitrary pair of consecutive overlaps in the time-series where the magnitude of the earlier overlap is known, we find that the magnitude of the later overlap can be determined with a definite probability; the conditional probability for each possible magnitude of the later overlap follows the binomial distribution for k Bernoulli trials with probability {1}/{2} for the success of each trial and the number k is determined by the magnitude of the earlier overlap. Although this model does not produce the Gutenberg-Richter law for earthquakes, our results indicate that the fractal structure of faults admits a probabilistic prediction of earthquake magnitudes.

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)

Systemic characterization and evaluation of particle packings as initial sets for discrete element simulations

Science.gov (United States)

Morfa, Carlos Recarey; Cortés, Lucía Argüelles; Farias, Márcio Muniz de; Morales, Irvin Pablo Pérez; Valera, Roberto Roselló; Oñate, Eugenio

2018-07-01

A methodology that comprises several characterization properties for particle packings is proposed in this paper. The methodology takes into account factors such as dimension and shape of particles, space occupation, homogeneity, connectivity and isotropy, among others. This classification and integration of several properties allows to carry out a characterization process to systemically evaluate the particle packings in order to guarantee the quality of the initial meshes in discrete element simulations, in both the micro- and the macroscales. Several new properties were created, and improvements in existing ones are presented. Properties from other disciplines were adapted to be used in the evaluation of particle systems. The methodology allows to easily characterize media at the level of the microscale (continuous geometries—steels, rocks microstructures, etc., and discrete geometries) and the macroscale. A global, systemic and integral system for characterizing and evaluating particle sets, based on fuzzy logic, is presented. Such system allows researchers to have a unique evaluation criterion based on the aim of their research. Examples of applications are shown.

Systemic characterization and evaluation of particle packings as initial sets for discrete element simulations

Science.gov (United States)

Morfa, Carlos Recarey; Cortés, Lucía Argüelles; Farias, Márcio Muniz de; Morales, Irvin Pablo Pérez; Valera, Roberto Roselló; Oñate, Eugenio

2017-10-01

A methodology that comprises several characterization properties for particle packings is proposed in this paper. The methodology takes into account factors such as dimension and shape of particles, space occupation, homogeneity, connectivity and isotropy, among others. This classification and integration of several properties allows to carry out a characterization process to systemically evaluate the particle packings in order to guarantee the quality of the initial meshes in discrete element simulations, in both the micro- and the macroscales. Several new properties were created, and improvements in existing ones are presented. Properties from other disciplines were adapted to be used in the evaluation of particle systems. The methodology allows to easily characterize media at the level of the microscale (continuous geometries—steels, rocks microstructures, etc., and discrete geometries) and the macroscale. A global, systemic and integral system for characterizing and evaluating particle sets, based on fuzzy logic, is presented. Such system allows researchers to have a unique evaluation criterion based on the aim of their research. Examples of applications are shown.

Representation learning with deep extreme learning machines for efficient image set classification

KAUST Repository

Uzair, Muhammad

2016-12-09

Efficient and accurate representation of a collection of images, that belong to the same class, is a major research challenge for practical image set classification. Existing methods either make prior assumptions about the data structure, or perform heavy computations to learn structure from the data itself. In this paper, we propose an efficient image set representation that does not make any prior assumptions about the structure of the underlying data. We learn the nonlinear structure of image sets with deep extreme learning machines that are very efficient and generalize well even on a limited number of training samples. Extensive experiments on a broad range of public datasets for image set classification show that the proposed algorithm consistently outperforms state-of-the-art image set classification methods both in terms of speed and accuracy.

Representation learning with deep extreme learning machines for efficient image set classification

KAUST Repository

Uzair, Muhammad; Shafait, Faisal; Ghanem, Bernard; Mian, Ajmal

2016-01-01

Efficient and accurate representation of a collection of images, that belong to the same class, is a major research challenge for practical image set classification. Existing methods either make prior assumptions about the data structure, or perform heavy computations to learn structure from the data itself. In this paper, we propose an efficient image set representation that does not make any prior assumptions about the structure of the underlying data. We learn the nonlinear structure of image sets with deep extreme learning machines that are very efficient and generalize well even on a limited number of training samples. Extensive experiments on a broad range of public datasets for image set classification show that the proposed algorithm consistently outperforms state-of-the-art image set classification methods both in terms of speed and accuracy.

Controlling for the use of extreme weights in bank efficiency assessments during the financial crisis

DEFF Research Database (Denmark)

Asmild, Mette; Zhu, Minyan

2016-01-01

We propose a method for bank efficiency assessment, based on weight restricted DEA, that limits banks’ abilities to use extreme weights, corresponding to extreme judgements of the risk adjusted prices on funding sources and assets. Based on a data set comprising the largest European banks during...... the financial crisis, we illustrate the impact of the proposed weight restrictions in two different efficiency models; one related to banks’ funding mix and one related to their asset mix. The results show that using a more balanced set of weights tend to reduce the estimated efficiency scores more for those...... banks which were bailed out during the crisis, which confirms the potential bias within standard DEA that does not control for extreme weights applied by highly risky banks. We discuss the use of the proposed method as a regulatory tool to constrain discretion when complying with regulatory capital...

Discrete optimization in architecture extremely modular systems

CERN Document Server

Zawidzki, Machi

2017-01-01

This book is comprised of two parts, both of which explore modular systems: Pipe-Z (PZ) and Truss-Z (TZ), respectively. It presents several methods of creating PZ and TZ structures subjected to discrete optimization. The algorithms presented employ graph-theoretic and heuristic methods. The underlying idea of both systems is to create free-form structures using the minimal number of types of modular elements. PZ is more conceptual, as it forms single-branch mathematical knots with a single type of module. Conversely, TZ is a skeletal system for creating free-form pedestrian ramps and ramp networks among any number of terminals in space. In physical space, TZ uses two types of modules that are mirror reflections of each other. The optimization criteria discussed include: the minimal number of units, maximal adherence to the given guide paths, etc.

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

Existence for a class of discrete hyperbolic problems

Directory of Open Access Journals (Sweden)

Luca Rodica

2006-01-01

Full Text Available We investigate the existence and uniqueness of solutions to a class of discrete hyperbolic systems with some nonlinear extreme conditions and initial data, in a real Hilbert space.

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

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

Domination Game: Extremal Families for the 3/5-Conjecture for Forests

Directory of Open Access Journals (Sweden)

Henning Michael A.

2017-05-01

Full Text Available In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γg(G. Kinnersley, West and Zamani [SIAM J. Discrete Math. 27 (2013 2090-2107] posted their 3/5-Conjecture that γg(G ≤ ⅗n for every isolate-free forest on n vertices. Brešar, Klavžar, Košmrlj and Rall [Discrete Appl. Math. 161 (2013 1308-1316] presented a construction that yields an infinite family of trees that attain the conjectured 3/5-bound. In this paper, we provide a much larger, but simpler, construction of extremal trees. We conjecture that if G is an isolate-free forest on n vertices satisfying γg(G = ⅗n, then every component of G belongs to our construction.

Coupled hydromechanical paleoclimate analyses of density-dependant groundwater flow in discretely fractured crystalline rock settings

Science.gov (United States)

Normani, S. D.; Sykes, J. F.; Jensen, M. R.

2009-04-01

A high resolution sub-regional scale (84 km2) density-dependent, fracture zone network groundwater flow model with hydromechanical coupling and pseudo-permafrost, was developed from a larger 5734 km2 regional scale groundwater flow model of a Canadian Shield setting in fractured crystalline rock. The objective of the work is to illustrate aspects of regional and sub-regional groundwater flow that are relevant to the long-term performance of a hypothetical nuclear fuel repository. The discrete fracture dual continuum numerical model FRAC3DVS-OPG was used for all simulations. A discrete fracture zone network model delineated from surface features was superimposed onto an 789887 element flow domain mesh. Orthogonal fracture faces (between adjacent finite element grid blocks) were used to best represent the irregular discrete fracture zone network. The crystalline rock between these structural discontinuities was assigned properties characteristic of those reported for the Canadian Shield at the Underground Research Laboratory at Pinawa, Manitoba. Interconnectivity of permeable fracture features is an important pathway for the possibly relatively rapid migration of average water particles and subsequent reduction in residence times. The multiple 121000 year North American continental scale paleoclimate simulations are provided by W.R. Peltier using the University of Toronto Glacial Systems Model (UofT GSM). Values of ice sheet normal stress, and proglacial lake depth from the UofT GSM are applied to the sub-regional model as surface boundary conditions, using a freshwater head equivalent to the normal stress imposed by the ice sheet at its base. Permafrost depth is applied as a permeability reduction to both three-dimensional grid blocks and fractures that lie within the time varying permafrost zone. Two different paleoclimate simulations are applied to the sub-regional model to investigate the effect on the depth of glacial meltwater migration into the subsurface. In

Chaos Enhanced Differential Evolution in the Task of Evolutionary Control of Selected Set of Discrete Chaotic Systems

Directory of Open Access Journals (Sweden)

Roman Senkerik

2014-01-01

Full Text Available Evolutionary technique differential evolution (DE is used for the evolutionary tuning of controller parameters for the stabilization of set of different chaotic systems. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used also as the chaotic pseudorandom number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. The optimizations were performed for three different chaotic systems, two types of case studies and developed cost functions.

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.

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.

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

Quadratic Term Structure Models in Discrete Time

OpenAIRE

Marco Realdon

2006-01-01

This paper extends the results on quadratic term structure models in continuos time to the discrete time setting. The continuos time setting can be seen as a special case of the discrete time one. Recursive closed form solutions for zero coupon bonds are provided even in the presence of multiple correlated underlying factors. Pricing bond options requires simple integration. Model parameters may well be time dependent without scuppering such tractability. Model estimation does not require a r...

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

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.

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

On some properties of the discrete Lyapunov exponent

International Nuclear Information System (INIS)

Amigo, Jose M.; Kocarev, Ljupco; Szczepanski, Janusz

2008-01-01

One of the possible by-products of discrete chaos is the application of its tools, in particular of the discrete Lyapunov exponent, to cryptography. In this Letter we explore this question in a very general setting

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.

Methods of mathematical modeling using polynomials of algebra of sets

Science.gov (United States)

Kazanskiy, Alexandr; Kochetkov, Ivan

2018-03-01

The article deals with the construction of discrete mathematical models for solving applied problems arising from the operation of building structures. Security issues in modern high-rise buildings are extremely serious and relevant, and there is no doubt that interest in them will only increase. The territory of the building is divided into zones for which it is necessary to observe. Zones can overlap and have different priorities. Such situations can be described using formulas algebra of sets. Formulas can be programmed, which makes it possible to work with them using computer models.

Eliciting preferences for priority setting in genetic testing: a pilot study comparing best-worst scaling and discrete-choice experiments

OpenAIRE

Severin, Franziska; Schmidtke, Jörg; Mühlbacher, Axel; Rogowski, Wolf H

2013-01-01

Given the increasing number of genetic tests available, decisions have to be made on how to allocate limited health-care resources to them. Different criteria have been proposed to guide priority setting. However, their relative importance is unclear. Discrete-choice experiments (DCEs) and best-worst scaling experiments (BWSs) are methods used to identify and weight various criteria that influence orders of priority. This study tests whether these preference eliciting techniques can be used f...

Lectures on discrete geometry

CERN Document Server

2002-01-01

Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields such as computational geometry or combinatorial optimization. This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections and thus it can serve as a collection of surveys in several narrower subfields. The main topics include: basics on convex sets, convex polytopes, and hyperplane arrangements; combinatorial complexity of geometric configurations; intersection patterns and transversals of convex sets; geometric Ramsey-type results; polyhedral combinatorics and high-dimensional convexity; and lastly, embeddings of finite metric spaces into normed spaces. Jiri Matousek is Professor of Com...

Comparison of different statistical methods for estimation of extreme sea levels with wave set-up contribution

Science.gov (United States)

Kergadallan, Xavier; Bernardara, Pietro; Benoit, Michel; Andreewsky, Marc; Weiss, Jérôme

2013-04-01

Estimating the probability of occurrence of extreme sea levels is a central issue for the protection of the coast. Return periods of sea level with wave set-up contribution are estimated here in one site : Cherbourg in France in the English Channel. The methodology follows two steps : the first one is computation of joint probability of simultaneous wave height and still sea level, the second one is interpretation of that joint probabilities to assess a sea level for a given return period. Two different approaches were evaluated to compute joint probability of simultaneous wave height and still sea level : the first one is multivariate extreme values distributions of logistic type in which all components of the variables become large simultaneously, the second one is conditional approach for multivariate extreme values in which only one component of the variables have to be large. Two different methods were applied to estimate sea level with wave set-up contribution for a given return period : Monte-Carlo simulation in which estimation is more accurate but needs higher calculation time and classical ocean engineering design contours of type inverse-FORM in which the method is simpler and allows more complex estimation of wave setup part (wave propagation to the coast for example). We compare results from the two different approaches with the two different methods. To be able to use both Monte-Carlo simulation and design contours methods, wave setup is estimated with an simple empirical formula. We show advantages of the conditional approach compared to the multivariate extreme values approach when extreme sea-level occurs when either surge or wave height is large. We discuss the validity of the ocean engineering design contours method which is an alternative when computation of sea levels is too complex to use Monte-Carlo simulation method.

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

Error estimates for discretized quantum stochastic differential inclusions

International Nuclear Information System (INIS)

Ayoola, E.O.

2001-09-01

This paper is concerned with the error estimates involved in the solution of a discrete approximation of a quantum stochastic differential inclusion (QSDI). Our main results rely on certain properties of the averaged modulus of continuity for multivalued sesquilinear forms associated with QSDI. We obtained results concerning the estimates of the Hausdorff distance between the set of solutions of the QSDI and the set of solutions of its discrete approximation. This extend the results of Dontchev and Farkhi concerning classical differential inclusions to the present noncommutative Quantum setting involving inclusions in certain locally convex space. (author)

Discrete and structurally unique proteins (tāpirins) mediate attachment of extremely thermophilic Caldicellulosiruptor species to cellulose.

Science.gov (United States)

Blumer-Schuette, Sara E; Alahuhta, Markus; Conway, Jonathan M; Lee, Laura L; Zurawski, Jeffrey V; Giannone, Richard J; Hettich, Robert L; Lunin, Vladimir V; Himmel, Michael E; Kelly, Robert M

2015-04-24

A variety of catalytic and noncatalytic protein domains are deployed by select microorganisms to deconstruct lignocellulose. These extracellular proteins are used to attach to, modify, and hydrolyze the complex polysaccharides present in plant cell walls. Cellulolytic enzymes, often containing carbohydrate-binding modules, are key to this process; however, these enzymes are not solely responsible for attachment. Few mechanisms of attachment have been discovered among bacteria that do not form large polypeptide structures, called cellulosomes, to deconstruct biomass. In this study, bioinformatics and proteomics analyses identified unique, discrete, hypothetical proteins ("tāpirins," origin from Māori: to join), not directly associated with cellulases, that mediate attachment to cellulose by species in the noncellulosomal, extremely thermophilic bacterial genus Caldicellulosiruptor. Two tāpirin genes are located directly downstream of a type IV pilus operon in strongly cellulolytic members of the genus, whereas homologs are absent from the weakly cellulolytic Caldicellulosiruptor species. Based on their amino acid sequence, tāpirins are specific to these extreme thermophiles. Tāpirins are also unusual in that they share no detectable protein domain signatures with known polysaccharide-binding proteins. Adsorption isotherm and trans vivo analyses demonstrated the carbohydrate-binding module-like affinity of the tāpirins for cellulose. Crystallization of a cellulose-binding truncation from one tāpirin indicated that these proteins form a long β-helix core with a shielded hydrophobic face. Furthermore, they are structurally unique and define a new class of polysaccharide adhesins. Strongly cellulolytic Caldicellulosiruptor species employ tāpirins to complement substrate-binding proteins from the ATP-binding cassette transporters and multidomain extracellular and S-layer-associated glycoside hydrolases to process the carbohydrate content of lignocellulose. �

Novel method of finding extreme edges in a convex set of N-dimension vectors

Science.gov (United States)

Hu, Chia-Lun J.

2001-11-01

As we published in the last few years, for a binary neural network pattern recognition system to learn a given mapping {Um mapped to Vm, m=1 to M} where um is an N- dimension analog (pattern) vector, Vm is a P-bit binary (classification) vector, the if-and-only-if (IFF) condition that this network can learn this mapping is that each i-set in {Ymi, m=1 to M} (where Ymithere existsVmiUm and Vmi=+1 or -1, is the i-th bit of VR-m).)(i=1 to P and there are P sets included here.) Is POSITIVELY, LINEARLY, INDEPENDENT or PLI. We have shown that this PLI condition is MORE GENERAL than the convexity condition applied to a set of N-vectors. In the design of old learning machines, we know that if a set of N-dimension analog vectors form a convex set, and if the machine can learn the boundary vectors (or extreme edges) of this set, then it can definitely learn the inside vectors contained in this POLYHEDRON CONE. This paper reports a new method and new algorithm to find the boundary vectors of a convex set of ND analog vectors.

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)

Classification of breast masses in ultrasound images using self-adaptive differential evolution extreme learning machine and rough set feature selection.

Science.gov (United States)

Prabusankarlal, Kadayanallur Mahadevan; Thirumoorthy, Palanisamy; Manavalan, Radhakrishnan

2017-04-01

A method using rough set feature selection and extreme learning machine (ELM) whose learning strategy and hidden node parameters are optimized by self-adaptive differential evolution (SaDE) algorithm for classification of breast masses is investigated. A pathologically proven database of 140 breast ultrasound images, including 80 benign and 60 malignant, is used for this study. A fast nonlocal means algorithm is applied for speckle noise removal, and multiresolution analysis of undecimated discrete wavelet transform is used for accurate segmentation of breast lesions. A total of 34 features, including 29 textural and five morphological, are applied to a [Formula: see text]-fold cross-validation scheme, in which more relevant features are selected by quick-reduct algorithm, and the breast masses are discriminated into benign or malignant using SaDE-ELM classifier. The diagnosis accuracy of the system is assessed using parameters, such as accuracy (Ac), sensitivity (Se), specificity (Sp), positive predictive value (PPV), negative predictive value (NPV), Matthew's correlation coefficient (MCC), and area ([Formula: see text]) under receiver operating characteristics curve. The performance of the proposed system is also compared with other classifiers, such as support vector machine and ELM. The results indicated that the proposed SaDE algorithm has superior performance with [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text] compared to other classifiers.

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

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.

On the convergence of multigroup discrete-ordinates approximations

International Nuclear Information System (INIS)

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

1987-01-01

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

Bayesian inference from count data using discrete uniform priors.

Directory of Open Access Journals (Sweden)

Federico Comoglio

Full Text Available We consider a set of sample counts obtained by sampling arbitrary fractions of a finite volume containing an homogeneously dispersed population of identical objects. We report a Bayesian derivation of the posterior probability distribution of the population size using a binomial likelihood and non-conjugate, discrete uniform priors under sampling with or without replacement. Our derivation yields a computationally feasible formula that can prove useful in a variety of statistical problems involving absolute quantification under uncertainty. We implemented our algorithm in the R package dupiR and compared it with a previously proposed Bayesian method based on a Gamma prior. As a showcase, we demonstrate that our inference framework can be used to estimate bacterial survival curves from measurements characterized by extremely low or zero counts and rather high sampling fractions. All in all, we provide a versatile, general purpose algorithm to infer population sizes from count data, which can find application in a broad spectrum of biological and physical problems.

Discrete ambiguities in CP-violating asymmetries in B decays

International Nuclear Information System (INIS)

London, David

1998-01-01

The CP-angles α, β and γ can be extracted from CP-violating asymmetries in the B system, but only up to discrete ambiguities. These discrete ambiguities make it difficult to determine with certainty whether or not new physics is present. I show that, if the condition α+β+γ=π is imposed, there remains a twofold ambiguity in the CP-angle set (α,β,γ), and I discuss ways to cleanly resolve this final discrete ambiguity

Surviving at any cost: guilt expression following extreme ethical conflicts in a virtual setting.

Science.gov (United States)

Cristofari, Cécile; Guitton, Matthieu J

2014-01-01

Studying human behavior in response to large-scale catastrophic events, particularly how moral challenges would be undertaken under extreme conditions, is an important preoccupation for contemporary scientists and decision leaders. However, researching this issue was hindered by the lack of readily available models. Immersive virtual worlds could represent a solution, by providing ways to test human behavior in controlled life-threatening situations. Using a massively multi-player zombie apocalypse setting, we analysed spontaneously reported feelings of guilt following ethically questionable actions related to survival. The occurrence and magnitude of guilt depended on the nature of the consequences of the action. Furthermore, feelings of guilt predicted long-lasting changes in behavior, displayed as compensatory actions. Finally, actions inflicting immediate harm to others appeared mostly prompted by panic and were more commonly regretted. Thus, extreme conditions trigger a reduction of the impact of ethical norms in decision making, although awareness of ethicality is retained to a surprising extent.

Surviving at any cost: guilt expression following extreme ethical conflicts in a virtual setting.

Directory of Open Access Journals (Sweden)

Cécile Cristofari

Full Text Available Studying human behavior in response to large-scale catastrophic events, particularly how moral challenges would be undertaken under extreme conditions, is an important preoccupation for contemporary scientists and decision leaders. However, researching this issue was hindered by the lack of readily available models. Immersive virtual worlds could represent a solution, by providing ways to test human behavior in controlled life-threatening situations. Using a massively multi-player zombie apocalypse setting, we analysed spontaneously reported feelings of guilt following ethically questionable actions related to survival. The occurrence and magnitude of guilt depended on the nature of the consequences of the action. Furthermore, feelings of guilt predicted long-lasting changes in behavior, displayed as compensatory actions. Finally, actions inflicting immediate harm to others appeared mostly prompted by panic and were more commonly regretted. Thus, extreme conditions trigger a reduction of the impact of ethical norms in decision making, although awareness of ethicality is retained to a surprising extent.

A discrete-time adaptive control scheme for robot manipulators

Science.gov (United States)

Tarokh, M.

1990-01-01

A discrete-time model reference adaptive control scheme is developed for trajectory tracking of robot manipulators. The scheme utilizes feedback, feedforward, and auxiliary signals, obtained from joint angle measurement through simple expressions. Hyperstability theory is utilized to derive the adaptation laws for the controller gain matrices. It is shown that trajectory tracking is achieved despite gross robot parameter variation and uncertainties. The method offers considerable design flexibility and enables the designer to improve the performance of the control system by adjusting free design parameters. The discrete-time adaptation algorithm is extremely simple and is therefore suitable for real-time implementation. Simulations and experimental results are given to demonstrate the performance of the scheme.

Asymptotic behavior of dynamical and control systems under perturbation and discretization

CERN Document Server

Grüne, Lars

2002-01-01

This book provides an approach to the study of perturbation and discretization effects on the long-time behavior of dynamical and control systems. It analyzes the impact of time and space discretizations on asymptotically stable attracting sets, attractors, asumptotically controllable sets and their respective domains of attractions and reachable sets. Combining robust stability concepts from nonlinear control theory, techniques from optimal control and differential games and methods from nonsmooth analysis, both qualitative and quantitative results are obtained and new algorithms are developed, analyzed and illustrated by examples.

Discrete Quantum Gravity in the Regge Calculus Formalism

International Nuclear Information System (INIS)

Khatsymovsky, V.M.

2005-01-01

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

Discrete quantum gravitation in formalism of Regge calculus

International Nuclear Information System (INIS)

Khatsimovskij, V.M.

2005-01-01

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

Discrete-Slots Models of Visual Working-Memory Response Times

Science.gov (United States)

Donkin, Christopher; Nosofsky, Robert M.; Gold, Jason M.; Shiffrin, Richard M.

2014-01-01

Much recent research has aimed to establish whether visual working memory (WM) is better characterized by a limited number of discrete all-or-none slots or by a continuous sharing of memory resources. To date, however, researchers have not considered the response-time (RT) predictions of discrete-slots versus shared-resources models. To complement the past research in this field, we formalize a family of mixed-state, discrete-slots models for explaining choice and RTs in tasks of visual WM change detection. In the tasks under investigation, a small set of visual items is presented, followed by a test item in 1 of the studied positions for which a change judgment must be made. According to the models, if the studied item in that position is retained in 1 of the discrete slots, then a memory-based evidence-accumulation process determines the choice and the RT; if the studied item in that position is missing, then a guessing-based accumulation process operates. Observed RT distributions are therefore theorized to arise as probabilistic mixtures of the memory-based and guessing distributions. We formalize an analogous set of continuous shared-resources models. The model classes are tested on individual subjects with both qualitative contrasts and quantitative fits to RT-distribution data. The discrete-slots models provide much better qualitative and quantitative accounts of the RT and choice data than do the shared-resources models, although there is some evidence for “slots plus resources” when memory set size is very small. PMID:24015956

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2016-10-14

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

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

Cone penetrometer testing and discrete-depth groundwater sampling techniques: A cost-effective method of site characterization in a multiple-aquifer setting

International Nuclear Information System (INIS)

Zemo, D.A.; Pierce, Y.G.; Gallinatti, J.D.

1992-01-01

Cone penetrometer testing (CPT), combined with discrete-depth groundwater sampling methods, can reduce significantly the time and expense required to characterize large sites that have multiple aquifers. Results from the screening site characterization can be used to design and install a cost-effective monitoring well network. At a site in northern California, it was necessary to characterize the stratigraphy and the distribution of volatile organic compounds (VOCs) to a depth of 80 feet within a 1/2 mile-by-1/4-mile residential and commercial area in a complex alluvial fan setting. To expedite site characterization, a five-week field screening program was implemented that consisted of a shallow groundwater survey, CPT soundings, and discrete-depth groundwater sampling. Based on continuous lithologic information provided by the CPT soundings, four coarse-grained water-yielding sedimentary packages were identified. Eighty-three discrete-depth groundwater samples were collected using shallow groundwater survey techniques, the BAT Enviroprobe, or the QED HydroPunch 1, depending on subsurface conditions. A 20-well monitoring network was designed and installed to monitor critical points within each sedimentary package. Understanding the vertical VOC distribution and concentrations produced substantial cost savings by minimizing the number of permanent monitoring wells and reducing the number of costly conductor casings to be installed. Significant long-term cost savings will result from reduced sampling costs. Where total VOC concentrations exceeded 20 φg/l in the screening samples, a good correlation was found between the discrete-depth screening data and data from monitoring wells. Using a screening program to characterize the site before installing monitoring wells resulted in an estimated 50-percent reduction in costs for site characterization, 65-percent reduction in time for site characterization, and 50-percent reduction in long-term monitoring costs

Entropic Phase Maps in Discrete Quantum Gravity

Directory of Open Access Journals (Sweden)

Benjamin F. Dribus

2017-06-01

Full Text Available Path summation offers a flexible general approach to quantum theory, including quantum gravity. In the latter setting, summation is performed over a space of evolutionary pathways in a history configuration space. Discrete causal histories called acyclic directed sets offer certain advantages over similar models appearing in the literature, such as causal sets. Path summation defined in terms of these histories enables derivation of discrete Schrödinger-type equations describing quantum spacetime dynamics for any suitable choice of algebraic quantities associated with each evolutionary pathway. These quantities, called phases, collectively define a phase map from the space of evolutionary pathways to a target object, such as the unit circle S 1 ⊂ C , or an analogue such as S 3 or S 7 . This paper explores the problem of identifying suitable phase maps for discrete quantum gravity, focusing on a class of S 1 -valued maps defined in terms of “structural increments” of histories, called terminal states. Invariants such as state automorphism groups determine multiplicities of states, and induce families of natural entropy functions. A phase map defined in terms of such a function is called an entropic phase map. The associated dynamical law may be viewed as an abstract combination of Schrödinger’s equation and the second law of thermodynamics.

Generalized Reduction Formula for Discrete Wigner Functions of Multiqubit Systems

Science.gov (United States)

Srinivasan, K.; Raghavan, G.

2018-03-01

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

Choice certainty in Discrete Choice Experiments

DEFF Research Database (Denmark)

Uggeldahl, Kennet Christian; Jacobsen, Catrine; Lundhede, Thomas

2016-01-01

In this study, we conduct a Discrete Choice Experiment (DCE) using eye tracking technology to investigate if eye movements during the completion of choice sets reveal information about respondents’ choice certainty. We hypothesise that the number of times that respondents shift their visual...

Mei symmetry and conservation laws of discrete nonholonomic dynamical systems with regular and irregular lattices

International Nuclear Information System (INIS)

Zhao Gang-Ling; Chen Li-Qun; Fu Jing-Li; Hong Fang-Yu

2013-01-01

In this paper, Noether symmetry and Mei symmetry of discrete nonholonomic dynamical systems with regular and the irregular lattices are investigated. Firstly, the equations of motion of discrete nonholonomic systems are introduced for regular and irregular lattices. Secondly, for cases of the two lattices, based on the invariance of the Hamiltomian functional under the infinitesimal transformation of time and generalized coordinates, we present the quasi-extremal equation, the discrete analogues of Noether identity, Noether theorems, and the Noether conservation laws of the systems. Thirdly, in cases of the two lattices, we study the Mei symmetry in which we give the discrete analogues of the criterion, the theorem, and the conservative laws of Mei symmetry for the systems. Finally, an example is discussed for the application of the results

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

Amplifying (Im)perfection: The Impact of Crystallinity in Discrete and Disperse Block Co-oligomers.

Science.gov (United States)

van Genabeek, Bas; Lamers, Brigitte A G; de Waal, Bas F M; van Son, Martin H C; Palmans, Anja R A; Meijer, E W

2017-10-25

Crystallinity is seldomly utilized as part of the microphase segregation process in ultralow-molecular-weight block copolymers. Here, we show the preparation of two types of discrete, semicrystalline block co-oligomers, comprising an amorphous oligodimethylsiloxane block and a crystalline oligo-l-lactic acid or oligomethylene block. The self-assembly of these discrete materials results in lamellar structures with unforeseen uniformity in the domain spacing. A systematic introduction of dispersity reveals the extreme sensitivity of the microphase segregation process toward chain length dispersity in the crystalline block.

Compatible Spatial Discretizations for Partial Differential Equations

Energy Technology Data Exchange (ETDEWEB)

Arnold, Douglas, N, ed.

2004-11-25

simulations. + Identification and design of compatible spatial discretizations of PDEs, their classification, analysis, and relations. + Relationships between different compatible spatial discretization methods and concepts which have been developed; + Impact of compatible spatial discretizations upon physical fidelity, verification and validation of simulations, especially in large-scale, multiphysics settings. + How solvers address the demands placed upon them by compatible spatial discretizations. This report provides information about the program and abstracts of all the presentations.

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

Science.gov (United States)

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

2018-01-01

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

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

Duality for discrete integrable systems

International Nuclear Information System (INIS)

Quispel, G R W; Capel, H W; Roberts, J A G

2005-01-01

A new class of discrete dynamical systems is introduced via a duality relation for discrete dynamical systems with a number of explicitly known integrals. The dual equation can be defined via the difference of an arbitrary linear combination of integrals and its upshifted version. We give an example of an integrable mapping with two parameters and four integrals leading to a (four-dimensional) dual mapping with four parameters and two integrals. We also consider a more general class of higher-dimensional mappings arising via a travelling-wave reduction from the (integrable) MKdV partial-difference equation. By differencing the trace of the monodromy matrix we obtain a class of novel dual mappings which is shown to be integrable as level-set-dependent versions of the original ones

Discrete and continuous time dynamic mean-variance analysis

OpenAIRE

Reiss, Ariane

1999-01-01

Contrary to static mean-variance analysis, very few papers have dealt with dynamic mean-variance analysis. Here, the mean-variance efficient self-financing portfolio strategy is derived for n risky assets in discrete and continuous time. In the discrete setting, the resulting portfolio is mean-variance efficient in a dynamic sense. It is shown that the optimal strategy for n risky assets may be dominated if the expected terminal wealth is constrained to exactly attain a certain goal instead o...

Multivariate Discrete First Order Stochastic Dominance

DEFF Research Database (Denmark)

Tarp, Finn; Østerdal, Lars Peter

This paper characterizes the principle of first order stochastic dominance in a multivariate discrete setting. We show that a distribution  f first order stochastic dominates distribution g if and only if  f can be obtained from g by iteratively shifting density from one outcome to another...

Example of a Non-standard Extreme Value Law

Czech Academy of Sciences Publication Activity Database

Haydn, N.; Kupsa, Michal

2015-01-01

Roč. 35, č. 6 (2015), s. 1902-1912 ISSN 0143-3857 Institutional support: RVO:67985556 Keywords : extreme-value law * rotations of unit circle * non-mixing systems * discrete law * Gumbel distribution * Weibull distribution * Frechet distribution * return times Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.983, year: 2015 http://library.utia.cas.cz/separaty/2014/SI/kupsa-0434480.pdf

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

Filtering of Discrete-Time Switched Neural Networks Ensuring Exponential Dissipative and $l_{2}$ - $l_{\\infty }$ Performances.

Science.gov (United States)

Choi, Hyun Duck; Ahn, Choon Ki; Karimi, Hamid Reza; Lim, Myo Taeg

2017-10-01

This paper studies delay-dependent exponential dissipative and l 2 - l ∞ filtering problems for discrete-time switched neural networks (DSNNs) including time-delayed states. By introducing a novel discrete-time inequality, which is a discrete-time version of the continuous-time Wirtinger-type inequality, we establish new sets of linear matrix inequality (LMI) criteria such that discrete-time filtering error systems are exponentially stable with guaranteed performances in the exponential dissipative and l 2 - l ∞ senses. The design of the desired exponential dissipative and l 2 - l ∞ filters for DSNNs can be achieved by solving the proposed sets of LMI conditions. Via numerical simulation results, we show the validity of the desired discrete-time filter design approach.

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

Science.gov (United States)

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

2012-01-01

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

Inference of Boundaries in Causal Sets

OpenAIRE

Cunningham, William

2017-01-01

We investigate the extrinsic geometry of causal sets in $(1+1)$-dimensional Minkowski spacetime. The properties of boundaries in an embedding space can be used not only to measure observables, but also to supplement the discrete action in the partition function via discretized Gibbons-Hawking-York boundary terms. We define several ways to represent a causal set using overlapping subsets, which then allows us to distinguish between null and non-null bounding hypersurfaces in an embedding space...

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.

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.

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

Fast and Epsilon-Optimal Discretized Pursuit Learning Automata.

Science.gov (United States)

Zhang, JunQi; Wang, Cheng; Zhou, MengChu

2015-10-01

Learning automata (LA) are powerful tools for reinforcement learning. A discretized pursuit LA is the most popular one among them. During an iteration its operation consists of three basic phases: 1) selecting the next action; 2) finding the optimal estimated action; and 3) updating the state probability. However, when the number of actions is large, the learning becomes extremely slow because there are too many updates to be made at each iteration. The increased updates are mostly from phases 1 and 3. A new fast discretized pursuit LA with assured ε -optimality is proposed to perform both phases 1 and 3 with the computational complexity independent of the number of actions. Apart from its low computational complexity, it achieves faster convergence speed than the classical one when operating in stationary environments. This paper can promote the applications of LA toward the large-scale-action oriented area that requires efficient reinforcement learning tools with assured ε -optimality, fast convergence speed, and low computational complexity for each iteration.

Differential-discrete mathematical model of two phase flow heat exchanger

International Nuclear Information System (INIS)

Debeljkovic, D.Lj.; Zitek, Pavel; Simeunovic, G.; Inard, Christian

2007-01-01

A dynamic thermal-hydraulic mathematical model of evaporator dynamics of a once - through sub critical steam generator is derived and presented. This model allows the investigation of evaporator dynamics including its transients responses. The evaporator was considered as a part of three-section (economizer, evaporator and super-heater) model with time varying phase boundaries and is described by a set of linearized discrete - difference equations which, with some other algebraic equations, constitutes a closed system of equations possible for exact computer solution. This model has been derived upon the fundamental equations of mass, energy and momentum balance. For the first time, a discrete differential approach has been applied in order to investigate such complex, two phase processes. Namely, this approach allows one to escape from the model of this process usually described by a set of partial differential equations and enables one, using this method, to simulate evaporators dynamics in an extraordinarily simple way. In current literature this approach is sometimes called physical discretization. (author)

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.

Gravity Cutoff in Theories with Large Discrete Symmetries

International Nuclear Information System (INIS)

Dvali, Gia; Redi, Michele; Sibiryakov, Sergey; Vainshtein, Arkady

2008-01-01

We set an upper bound on the gravitational cutoff in theories with exact quantum numbers of large N periodicity, such as Z N discrete symmetries. The bound stems from black hole physics. It is similar to the bound appearing in theories with N particle species, though a priori, a large discrete symmetry does not imply a large number of species. Thus, there emerges a potentially wide class of new theories that address the hierarchy problem by lowering the gravitational cutoff due to the existence of large Z 10 32 -type symmetries

Discrete and mesoscopic regimes of finite-size wave turbulence

International Nuclear Information System (INIS)

L'vov, V. S.; Nazarenko, S.

2010-01-01

Bounding volume results in discreteness of eigenmodes in wave systems. This leads to a depletion or complete loss of wave resonances (three-wave, four-wave, etc.), which has a strong effect on wave turbulence (WT) i.e., on the statistical behavior of broadband sets of weakly nonlinear waves. This paper describes three different regimes of WT realizable for different levels of the wave excitations: discrete, mesoscopic and kinetic WT. Discrete WT comprises chaotic dynamics of interacting wave 'clusters' consisting of discrete (often finite) number of connected resonant wave triads (or quarters). Kinetic WT refers to the infinite-box theory, described by well-known wave-kinetic equations. Mesoscopic WT is a regime in which either the discrete and the kinetic evolutions alternate or when none of these two types is purely realized. We argue that in mesoscopic systems the wave spectrum experiences a sandpile behavior. Importantly, the mesoscopic regime is realized for a broad range of wave amplitudes which typically spans over several orders on magnitude, and not just for a particular intermediate level.

Out-of-order parallel discrete event simulation for electronic system-level design

CERN Document Server

Chen, Weiwei

2014-01-01

This book offers readers a set of new approaches and tools a set of tools and techniques for facing challenges in parallelization with design of embedded systems.? It provides an advanced parallel simulation infrastructure for efficient and effective system-level model validation and development so as to build better products in less time.? Since parallel discrete event simulation (PDES) has the potential to exploit the underlying parallel computational capability in today's multi-core simulation hosts, the author begins by reviewing the parallelization of discrete event simulation, identifyin

Implementation of quantum and classical discrete fractional Fourier transforms

Science.gov (United States)

Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N.; Szameit, Alexander

2016-01-01

Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools. PMID:27006089

Implementation of quantum and classical discrete fractional Fourier transforms.

Science.gov (United States)

Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N; Szameit, Alexander

2016-03-23

Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.

Low energy nuclear reactions driven by discrete breathers

OpenAIRE

Dubinko, Vladimir

2014-01-01

A new mechanism of LENR in solids is proposed, which is based on the large amplitude anharmonic lattice vibrations, a.k.a. intrinsic localized modes or discrete breathers (DBs). In particular, so called gap DBs, which can arise in diatomic crystals such as metal hydrides, are argued to be the LENR catalyzers. The large mass difference between H or D and the metal atoms provides a gap in phonon spectrum, in which DBs can be excited in the H/D sub-lattice resulting in extreme dynamic closing of...

A scheme for designing extreme multistable discrete dynamical ...

Indian Academy of Sciences (India)

PRIYANKA CHAKRABORTY

2017-08-21

Aug 21, 2017 ... tems [12,13], in neuron dynamics [14], in climate dynamics [15–18], in social systems [19,20] etc. A multistable dynamical system is one that possesses a large number of asymptotic stable states for a fixed set of parameters depending on initial conditions. Triv- ial multistability of a system can be considered ...

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.

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

International Nuclear Information System (INIS)

Ganapol, Barry D.

2015-01-01

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

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.

Discrete time and continuous time dynamic mean-variance analysis

OpenAIRE

Reiss, Ariane

1999-01-01

Contrary to static mean-variance analysis, very few papers have dealt with dynamic mean-variance analysis. Here, the mean-variance efficient self-financing portfolio strategy is derived for n risky assets in discrete and continuous time. In the discrete setting, the resulting portfolio is mean-variance efficient in a dynamic sense. It is shown that the optimal strategy for n risky assets may be dominated if the expected terminal wealth is constrained to exactly attain a certain goal instead o...

Recovery of an initial temperature from discrete sampling

KAUST Repository

DeVore, Ronald; Zuazua, Enrique

2014-01-01

The problem of recovering the initial temperature of a body from discrete temperature measurements made at later times is studied. While this problem has a general formulation, the results of this paper are only given in the simplest setting of a

Connecting numbers to discrete quantification: a step in the child's construction of integer concepts.

Science.gov (United States)

Slusser, Emily; Ditta, Annie; Sarnecka, Barbara

2013-10-01

The present study asks when young children understand that number words quantify over sets of discrete individuals. For this study, 2- to 4-year-old children were asked to extend the number word five or six either to a cup containing discrete objects (e.g., blocks) or to a cup containing a continuous substance (e.g., water). In Experiment 1, only children who knew the exact meanings of the words one, two and three extended higher number words (five or six) to sets of discrete objects. In Experiment 2, children who only knew the exact meaning of one extended higher number words to discrete objects under the right conditions (i.e., when the problem was first presented with the number words one and two). These results show that children have some understanding that number words pertain to discrete quantification from very early on, but that this knowledge becomes more robust as children learn the exact, cardinal meanings of individual number words. Copyright © 2013 Elsevier B.V. All rights reserved.

Level Set Structure of an Integrable Cellular Automaton

Directory of Open Access Journals (Sweden)

Taichiro Takagi

2010-03-01

Full Text Available Based on a group theoretical setting a sort of discrete dynamical system is constructed and applied to a combinatorial dynamical system defined on the set of certain Bethe ansatz related objects known as the rigged configurations. This system is then used to study a one-dimensional periodic cellular automaton related to discrete Toda lattice. It is shown for the first time that the level set of this cellular automaton is decomposed into connected components and every such component is a torus.

Logic and discrete mathematics a concise introduction : solutions manual

CERN Document Server

Conradie, Willem; Robinson, Claudette

2015-01-01

Solutions manual to accompany Logic and Discrete Mathematics: A Concise Introduction This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in this accompanying solutions manual.

Evaluation of the Utility of a Discrete-Trial Functional Analysis in Early Intervention Classrooms

Science.gov (United States)

Kodak, Tiffany; Fisher, Wayne W.; Paden, Amber; Dickes, Nitasha

2013-01-01

We evaluated a discrete-trial functional analysis implemented by regular classroom staff in a classroom setting. The results suggest that the discrete-trial functional analysis identified a social function for each participant and may require fewer staff than standard functional analysis procedures.

Rules versus Discretion in Loan Rate Setting

NARCIS (Netherlands)

Cerqueiro, G.M.; Degryse, H.A.; Ongena, S.

2007-01-01

We propose a heteroscedastic regression model to identify the determinants of the dispersion in interest rates on loans granted to small and medium sized enterprises. We interpret unexplained deviations as evidence of the banks’ discretionary use of market power in the loan rate setting process.

Norms for 10,491 Spanish words for five discrete emotions: Happiness, disgust, anger, fear, and sadness.

Science.gov (United States)

Stadthagen-González, Hans; Ferré, Pilar; Pérez-Sánchez, Miguel A; Imbault, Constance; Hinojosa, José Antonio

2017-09-18

The discrete emotion theory proposes that affective experiences can be reduced to a limited set of universal "basic" emotions, most commonly identified as happiness, sadness, anger, fear, and disgust. Here we present norms for 10,491 Spanish words for those five discrete emotions collected from a total of 2,010 native speakers, making it the largest set of norms for discrete emotions in any language to date. When used in conjunction with the norms from Hinojosa, Martínez-García et al. (Behavior Research Methods, 48, 272-284, 2016) and Ferré, Guasch, Martínez-García, Fraga, & Hinojosa (Behavior Research Methods, 49, 1082-1094, 2017), researchers now have access to ratings of discrete emotions for 13,633 Spanish words. Our norms show a high degree of inter-rater reliability and correlate highly with those from Ferré et al. (2017). Our exploration of the relationship between the five discrete emotions and relevant lexical and emotional variables confirmed findings of previous studies conducted with smaller datasets. The availability of such large set of norms will greatly facilitate the study of emotion, language and related fields. The norms are available as supplementary materials to this article.

From Discrete Space-Time to Minkowski Space: Basic Mechanisms, Methods and Perspectives

Science.gov (United States)

Finster, Felix

This survey article reviews recent results on fermion systems in discrete space-time and corresponding systems in Minkowski space. After a basic introduction to the discrete setting, we explain a mechanism of spontaneous symmetry breaking which leads to the emergence of a discrete causal structure. As methods to study the transition between discrete space-time and Minkowski space, we describe a lattice model for a static and isotropic space-time, outline the analysis of regularization tails of vacuum Dirac sea configurations, and introduce a Lorentz invariant action for the masses of the Dirac seas. We mention the method of the continuum limit, which allows to analyze interacting systems. Open problems are discussed.

An Einstein equation for discrete quantum gravity

OpenAIRE

Gudder, Stan

2012-01-01

The basic framework for this article is the causal set approach to discrete quantum gravity (DQG). Let $Q_n$ be the collection of causal sets with cardinality not greater than $n$ and let $K_n$ be the standard Hilbert space of complex-valued functions on $Q_n$. The formalism of DQG presents us with a decoherence matrix $D_n(x,y)$, $x,y\\in Q_n$. There is a growth order in $Q_n$ and a path in $Q_n$ is a maximal chain relative to this order. We denote the set of paths in $Q_n$ by $\\Omega_n$. For...

Discrete cosine and sine transforms general properties, fast algorithms and integer approximations

CERN Document Server

Britanak, Vladimir; Rao, K R; Rao, K R

2006-01-01

The Discrete Cosine Transform (DCT) is used in many applications by the scientific, engineering and research communities and in data compression in particular. Fast algorithms and applications of the DCT Type II (DCT-II) have become the heart of many established international image/video coding standards. Since then other forms of the DCT and Discrete Sine Transform (DST) have been investigated in detail. This new edition presents the complete set of DCT and DST discrete trigonometric transforms, including their definitions, general mathematical properties, and relations to the optimal Karhune

Discrete mathematics using a computer

CERN Document Server

Hall, Cordelia

2000-01-01

Several areas of mathematics find application throughout computer science, and all students of computer science need a practical working understanding of them. These core subjects are centred on logic, sets, recursion, induction, relations and functions. The material is often called discrete mathematics, to distinguish it from the traditional topics of continuous mathematics such as integration and differential equations. The central theme of this book is the connection between computing and discrete mathematics. This connection is useful in both directions: • Mathematics is used in many branches of computer science, in applica­ tions including program specification, datastructures,design and analysis of algorithms, database systems, hardware design, reasoning about the correctness of implementations, and much more; • Computers can help to make the mathematics easier to learn and use, by making mathematical terms executable, making abstract concepts more concrete, and through the use of software tools su...

Parisian ruin for the dual risk process in discrete-time

OpenAIRE

Palmowski, Zbigniew; Ramsden, Lewis; Papaioannou, Apostolos D.

2017-01-01

In this paper we consider the Parisian ruin probabilities for the dual risk model in a discrete-time setting. By exploiting the strong Markov property of the risk process we derive a recursive expression for the fnite-time Parisian ruin probability, in terms of classic discrete-time dual ruin probabilities. Moreover, we obtain an explicit expression for the corresponding infnite-time Parisian ruin probability as a limiting case. In order to obtain more analytic results, we employ a conditioni...

Discrete symmetries and the complex structure of Calabi-Yau manifolds

International Nuclear Information System (INIS)

Ross, G.G.

1988-01-01

We show how the discrete symmetries, which may be present after Calabi-Yau compactification for specific choices of the complex structure, extend to the h 2,1 moduli - the scalar fields whose vacuum expectation values determine the complex structure. This allows us to determine much about the coupling of the moduli and hence the energetically favoured complex structure. The discrete symmetry transformation properties of the moduli are worked out in detail for a three-generation Calabi-Yau model and it is shown how minimization of the effective potential involving these fields selects the complex structure which leaves unbroken a set of discrete symmetries. The phenomenological implications of the symmetries are briefly discussed. (orig.)

A latent class multiple constraint multiple discrete-continuous extreme value model of time use and goods consumption.

Science.gov (United States)

2016-06-01

This paper develops a microeconomic theory-based multiple discrete continuous choice model that considers: (a) that both goods consumption and time allocations (to work and non-work activities) enter separately as decision variables in the utility fu...

Discrete Mathematics and the Secondary Mathematics Curriculum.

Science.gov (United States)

Dossey, John

Discrete mathematics, the mathematics of decision making for finite settings, is a topic of great interest in mathematics education at all levels. Attention is being focused on resolving the diversity of opinion concerning the exact nature of the subject, what content the curriculum should contain, who should study that material, and how that…

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

On the path independence conditions for discrete-continuous demand

DEFF Research Database (Denmark)

Batley, Richard; Ibáñez Rivas, Juan Nicolás

2013-01-01

We consider the manner in which the well-established path independence conditions apply to Small and Rosen's (1981) problem of discrete-continuous demand, focussing especially upon the restricted case of discrete choice (probabilistic) demand. We note that the consumer surplus measure promoted...... by Small and Rosen, which is specific to the probabilistic demand, imposes path independence to price changes a priori. We find that path independence to income changes can further be imposed provided a numeraire good is available in the consumption set. We show that, for practical purposes, Mc...

Asymptotic analysis of spatial discretizations in implicit Monte Carlo

International Nuclear Information System (INIS)

Densmore, Jeffery D.

2009-01-01

We perform an asymptotic analysis of spatial discretizations in Implicit Monte Carlo (IMC). We consider two asymptotic scalings: one that represents a time step that resolves the mean-free time, and one that corresponds to a fixed, optically large time step. We show that only the latter scaling results in a valid spatial discretization of the proper diffusion equation, and thus we conclude that IMC only yields accurate solutions when using optically large spatial cells if time steps are also optically large. We demonstrate the validity of our analysis with a set of numerical examples.

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

Discrete geometry: speculations on a new framework for classical electrodynamics

International Nuclear Information System (INIS)

Hemion, G.

1988-01-01

An attempt is made to describe the basic principles of physics in terms of discrete partially ordered sets. Geometric ideas are introduced by means of an action at a distance formulation of classical electrodynamics. The speculations are in two main directions: (i) Gravity, one of the four elementary forces of nature, seems to be fundamentally different from the other three forces. Could it be that gravity can be explained as a natural consequence of the discrete structure? (ii) The problem of the observer in quantum mechanics continues to cause conceptual problems. Can quantum statistics be explained in terms of finite ensembles of possible partially ordered sets? The development is guided at all stages by reference to the simplest, and most well-established principles of physics

Mining the multigroup-discrete ordinates algorithm for high quality solutions

International Nuclear Information System (INIS)

Ganapol, B.D.; Kornreich, D.E.

2005-01-01

A novel approach to the numerical solution of the neutron transport equation via the discrete ordinates (SN) method is presented. The new technique is referred to as 'mining' low order (SN) numerical solutions to obtain high order accuracy. The new numerical method, called the Multigroup Converged SN (MGCSN) algorithm, is a combination of several sequence accelerators: Romberg and Wynn-epsilon. The extreme accuracy obtained by the method is demonstrated through self consistency and comparison to the independent semi-analytical benchmark BLUE. (authors)

A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals

Directory of Open Access Journals (Sweden)

Pablo Soto-Quiros

2015-01-01

Full Text Available This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT: the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, and implementation of parallel algorithms in multicore processors. In this work, an implementation and experimental investigation of the mathematical framework are performed using MATLAB with the Parallel Computing Toolbox. We found that there is advantage to use multicore processors and a parallel computing environment to minimize the high execution time. Additionally, speedup increases when the number of logical processors and length of the signal increase.

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)

The discrete additive Weibull distribution: A bathtub-shaped hazard for discontinuous failure data

International Nuclear Information System (INIS)

Bebbington, Mark; Lai, Chin-Diew; Wellington, Morgan; Zitikis, Ričardas

2012-01-01

Although failure data are usually treated as being continuous, they may have been collected in a discrete manner, or in fact be discrete in nature. Reliability models with bathtub-shaped hazard rate are fundamental to the concepts of burn-in and maintenance, but how well do they incorporate discrete data? We explore discrete versions of the additive Weibull distribution, which has the twin virtues of mathematical tractability and the ability to produce bathtub-shaped hazard rate functions. We derive conditions on the parameters for the hazard rate function to be increasing, decreasing, or bathtub shaped. While discrete versions may have the same shaped hazard rate for the same parameter values, we find that when fitted to data the fitted hazard rate shapes can vary between versions. Our results are illustrated using several real-life data sets, and the implications of using continuous models for discrete data discussed.

Nonparametric volatility density estimation for discrete time models

NARCIS (Netherlands)

Es, van Bert; Spreij, P.J.C.; Zanten, van J.H.

2005-01-01

We consider discrete time models for asset prices with a stationary volatility process. We aim at estimating the multivariate density of this process at a set of consecutive time instants. A Fourier-type deconvolution kernel density estimator based on the logarithm of the squared process is proposed

Bankruptcy Prediction with Rough Sets

NARCIS (Netherlands)

J.C. Bioch (Cor); V. Popova (Viara)

2001-01-01

textabstractThe bankruptcy prediction problem can be considered an or dinal classification problem. The classical theory of Rough Sets describes objects by discrete attributes, and does not take into account the order- ing of the attributes values. This paper proposes a modification of the Rough Set

Theoretical foundation for the discrete dynamics of physicochemical systems: Chaos, self-organization, time and space in complex systems

Directory of Open Access Journals (Sweden)

V. Gontar

1997-01-01

Full Text Available A new theoretical foundation for the discrete dynamics of physicochemical systems is presented. Based on the analogy between the π-theorem of the theory of dimensionality, the second law of thermodynamics and the stoichiometry of complex physicochemical reactions, basic dynamic equations and an extreme principle were formulated. The meaning of discrete time and space in the proposed equations is discussed. Some results of numerical calculations are presented to demonstrate the potential of the proposed approach to the mathematical simulation of spatiotemporal physicochemical reaction dynamics.

Emissivity of discretized diffusion problems

International Nuclear Information System (INIS)

Densmore, Jeffery D.; Davidson, Gregory; Carrington, David B.

2006-01-01

The numerical modeling of radiative transfer by the diffusion approximation can produce artificially damped radiation propagation if spatial cells are too optically thick. In this paper, we investigate this nonphysical behavior at external problem boundaries by examining the emissivity of the discretized diffusion approximation. We demonstrate that the standard cell-centered discretization produces an emissivity that is too low for optically thick cells, a situation that leads to the lack of radiation propagation. We then present a modified boundary condition that yields an accurate emissivity regardless of cell size. This modified boundary condition can be used with a deterministic calculation or as part of a hybrid transport-diffusion method for increasing the efficiency of Monte Carlo simulations. We also discuss the range of applicability, as a function of cell size and material properties, when this modified boundary condition is employed in a hybrid technique. With a set of numerical calculations, we demonstrate the accuracy and usefulness of this modified boundary condition

Discrete phase space based on finite fields

International Nuclear Information System (INIS)

Gibbons, Kathleen S.; Hoffman, Matthew J.; Wootters, William K.

2004-01-01

The original Wigner function provides a way of representing in phase space the quantum states of systems with continuous degrees of freedom. Wigner functions have also been developed for discrete quantum systems, one popular version being defined on a 2Nx2N discrete phase space for a system with N orthogonal states. Here we investigate an alternative class of discrete Wigner functions, in which the field of real numbers that labels the axes of continuous phase space is replaced by a finite field having N elements. There exists such a field if and only if N is a power of a prime; so our formulation can be applied directly only to systems for which the state-space dimension takes such a value. Though this condition may seem limiting, we note that any quantum computer based on qubits meets the condition and can thus be accommodated within our scheme. The geometry of our NxN phase space also leads naturally to a method of constructing a complete set of N+1 mutually unbiased bases for the state space

Linear deformations of discrete groups and constructions of multivalued groups

International Nuclear Information System (INIS)

Yagodovskii, Petr V

2000-01-01

We construct deformations of discrete multivalued groups described as special deformations of their group algebras in the class of finite-dimensional associative algebras. We show that the deformations of ordinary groups producing multivalued groups are defined by cocycles with coefficients in the group algebra of the original group and obtain classification theorems on these deformations. We indicate a connection between the linear deformations of discrete groups introduced in this paper and the well-known constructions of multivalued groups. We describe the manifold of three-dimensional associative commutative algebras with identity element, fixed basis, and a constant number of values. The group algebras of n-valued groups of order three (three-dimensional n-group algebras) form a discrete set in this manifold

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

Discrete rate and variable power adaptation for underlay cognitive networks

KAUST Repository

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

2010-01-01

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

Reprogramming the body weight set point by a reciprocal interaction of hypothalamic leptin sensitivity and Pomc gene expression reverts extreme obesity

Directory of Open Access Journals (Sweden)

Kavaljit H. Chhabra

2016-10-01

Conclusions: Pomc reactivation in previously obese, calorie-restricted ArcPomc−/− mice normalized energy homeostasis, suggesting that their body weight set point was restored to control levels. In contrast, massively obese and hyperleptinemic ArcPomc−/− mice or those weight-matched and treated with PASylated leptin to maintain extreme hyperleptinemia prior to Pomc reactivation converged to an intermediate set point relative to lean control and obese ArcPomc−/− mice. We conclude that restoration of hypothalamic leptin sensitivity and Pomc expression is necessary for obese ArcPomc−/− mice to achieve and sustain normal metabolic homeostasis; whereas deficits in either parameter set a maladaptive allostatic balance that defends increased adiposity and body weight.

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.

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.

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.

GDSCalc: A Web-Based Application for Evaluating Discrete Graph Dynamical Systems.

Science.gov (United States)

Elmeligy Abdelhamid, Sherif H; Kuhlman, Chris J; Marathe, Madhav V; Mortveit, Henning S; Ravi, S S

2015-01-01

Discrete dynamical systems are used to model various realistic systems in network science, from social unrest in human populations to regulation in biological networks. A common approach is to model the agents of a system as vertices of a graph, and the pairwise interactions between agents as edges. Agents are in one of a finite set of states at each discrete time step and are assigned functions that describe how their states change based on neighborhood relations. Full characterization of state transitions of one system can give insights into fundamental behaviors of other dynamical systems. In this paper, we describe a discrete graph dynamical systems (GDSs) application called GDSCalc for computing and characterizing system dynamics. It is an open access system that is used through a web interface. We provide an overview of GDS theory. This theory is the basis of the web application; i.e., an understanding of GDS provides an understanding of the software features, while abstracting away implementation details. We present a set of illustrative examples to demonstrate its use in education and research. Finally, we compare GDSCalc with other discrete dynamical system software tools. Our perspective is that no single software tool will perform all computations that may be required by all users; tools typically have particular features that are more suitable for some tasks. We situate GDSCalc within this space of software tools.

Multipartite Bell-type inequalities for arbitrary numbers of settings and outcomes per site

International Nuclear Information System (INIS)

Loubenets, Elena R

2008-01-01

We introduce a single general representation incorporating in a unique manner all Bell-type inequalities for a multipartite correlation scenario with an arbitrary number of settings and any spectral type of outcomes at each site. Specifying this general representation for correlation functions, we prove that the form of any correlation Bell-type inequality does not depend on spectral types of outcomes, in particular, on their numbers at different sites, and is determined only by extremal values of outcomes at each site. We also specify the general form of bounds in Bell-type inequalities on joint probabilities. Our approach to the derivation of Bell-type inequalities is universal, concise and can be applied to a multipartite correlation experiment with outcomes of any spectral type, discrete or continuous. We, in particular, prove that, for an N-partite quantum state, possibly, infinite dimensional, admitting the N{2 x ... x 2}-setting LHV description, the Mermin-Klyshko inequality holds for any two bounded quantum observables per site, not necessarily dichotomic

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.

Computing discrete signed distance fields from triangle meshes

DEFF Research Database (Denmark)

Bærentzen, Jakob Andreas; Aanæs, Henrik

2002-01-01

A method for generating a discrete, signed 3D distance field is proposed. Distance fields are used in a number of contexts. In particular the popular level set method is usually initialized by a distance field. The main focus of our work is on simplifying the computation of the sign when generating...

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

International Nuclear Information System (INIS)

Cao Liangzhi; Wu Hongchun; Zheng Youqi

2008-01-01

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

Fully discrete Galerkin schemes for the nonlinear and nonlocal Hartree equation

Directory of Open Access Journals (Sweden)

Walter H. Aschbacher

2009-01-01

Full Text Available We study the time dependent Hartree equation in the continuum, the semidiscrete, and the fully discrete setting. We prove existence-uniqueness, regularity, and approximation properties for the respective schemes, and set the stage for a controlled numerical computation of delicate nonlinear and nonlocal features of the Hartree dynamics in various physical applications.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds.

Science.gov (United States)

Uher, Vojtěch; Gajdoš, Petr; Radecký, Michal; Snášel, Václav

2016-01-01

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds.

Dihomotopy classes of dipaths in the geometric realization of a cubical set: from discrete to continuous and back again

DEFF Research Database (Denmark)

Fajstrup, Lisbeth

2005-01-01

model and give the corresponding discrete objects. We prove that this is in fact the case for the models considered: Each dipath is dihomotopic to a combinatorial dipath and if two combinatorial dipaths are dihomotopic, then they are combinatorially equivalent. Moreover, the notions of dihomotopy (LF......The geometric models of concurrency - Dijkstra's PV-models and V. Pratt's Higher Dimensional Automata - rely on a translation of discrete or algebraic information to geometry. In both these cases, the translation is the geometric realisation of a semi cubical complex, which is then a locally...... partially ordered space, an lpo space. The aim is to use the algebraic topology machinery, suitably adapted to the fact that there is a preferred time direction. Then the results - for instance dihomotopy classes of dipaths, which model the number of inequivalent computations should be used on the discrete...

Discrete choice experiments of pharmacy services: a systematic review.

Science.gov (United States)

Vass, Caroline; Gray, Ewan; Payne, Katherine

2016-06-01

Background Two previous systematic reviews have summarised the application of discrete choice experiments to value preferences for pharmacy services. These reviews identified a total of twelve studies and described how discrete choice experiments have been used to value pharmacy services but did not describe or discuss the application of methods used in the design or analysis. Aims (1) To update the most recent systematic review and critically appraise current discrete choice experiments of pharmacy services in line with published reporting criteria and; (2) To provide an overview of key methodological developments in the design and analysis of discrete choice experiments. Methods The review used a comprehensive strategy to identify eligible studies (published between 1990 and 2015) by searching electronic databases for key terms related to discrete choice and best-worst scaling (BWS) experiments. All healthcare choice experiments were then hand-searched for key terms relating to pharmacy. Data were extracted using a published checklist. Results A total of 17 discrete choice experiments eliciting preferences for pharmacy services were identified for inclusion in the review. No BWS studies were identified. The studies elicited preferences from a variety of populations (pharmacists, patients, students) for a range of pharmacy services. Most studies were from a United Kingdom setting, although examples from Europe, Australia and North America were also identified. Discrete choice experiments for pharmacy services tended to include more attributes than non-pharmacy choice experiments. Few studies reported the use of qualitative research methods in the design and interpretation of the experiments (n = 9) or use of new methods of analysis to identify and quantify preference and scale heterogeneity (n = 4). No studies reported the use of Bayesian methods in their experimental design. Conclusion Incorporating more sophisticated methods in the design of pharmacy

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

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

International Nuclear Information System (INIS)

Cao Cewen; Cao Jianli

2007-01-01

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

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.

Inference of boundaries in causal sets

Science.gov (United States)

Cunningham, William J.

2018-05-01

We investigate the extrinsic geometry of causal sets in (1+1) -dimensional Minkowski spacetime. The properties of boundaries in an embedding space can be used not only to measure observables, but also to supplement the discrete action in the partition function via discretized Gibbons–Hawking–York boundary terms. We define several ways to represent a causal set using overlapping subsets, which then allows us to distinguish between null and non-null bounding hypersurfaces in an embedding space. We discuss algorithms to differentiate between different types of regions, consider when these distinctions are possible, and then apply the algorithms to several spacetime regions. Numerical results indicate the volumes of timelike boundaries can be measured to within 0.5% accuracy for flat boundaries and within 10% accuracy for highly curved boundaries for medium-sized causal sets with N  =  214 spacetime elements.

Heavy Tail Behavior of Rainfall Extremes across Germany

Science.gov (United States)

Castellarin, A.; Kreibich, H.; Vorogushyn, S.; Merz, B.

2017-12-01

Distributions are termed heavy-tailed if extreme values are more likely than would be predicted by probability distributions that have exponential asymptotic behavior. Heavy-tail behavior often leads to surprise, because historical observations can be a poor guide for the future. Heavy-tail behavior seems to be widespread for hydro-meteorological extremes, such as extreme rainfall and flood events. To date there have been only vague hints to explain under which conditions these extremes show heavy-tail behavior. We use an observational data set consisting of 11 climate variables at 1440 stations across Germany. This homogenized, gap-free data set covers 110 years (1901-2010) at daily resolution. We estimate the upper tail behavior, including its uncertainty interval, of daily precipitation extremes for the 1,440 stations at the annual and seasonal time scales. Different tail indicators are tested, including the shape parameter of the Generalized Extreme Value distribution, the upper tail ratio and the obesity index. In a further step, we explore to which extent the tail behavior can be explained by geographical and climate factors. A large number of characteristics is derived, such as station elevation, degree of continentality, aridity, measures for quantifying the variability of humidity and wind velocity, or event-triggering large-scale atmospheric situation. The link between the upper tail behavior and these characteristics is investigated via data mining methods capable of detecting non-linear relationships in large data sets. This exceptionally rich observational data set, in terms of number of stations, length of time series and number of explaining variables, allows insights into the upper tail behavior which is rarely possible given the typical observational data sets available.

A new intelligent classifier for breast cancer diagnosis based on a rough set and extreme learning machine: RS + ELM

OpenAIRE

KAYA, Yılmaz

2014-01-01

Breast cancer is one of the leading causes of death among women all around the world. Therefore, true and early diagnosis of breast cancer is an important problem. The rough set (RS) and extreme learning machine (ELM) methods were used collectively in this study for the diagnosis of breast cancer. The unnecessary attributes were discarded from the dataset by means of the RS approach. The classification process by means of ELM was performed using the remaining attributes. The Wisconsin B...

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

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

On the Extreme Wave Height Analysis

DEFF Research Database (Denmark)

Burcharth, H. F.; Liu, Zhou

1994-01-01

The determination of the design wave height is usually based on the statistical analysis of long-term extreme wave height measurements. After an introduction to the procedure of the extreme wave height analysis, the paper presents new development concerning various aspects of the extreme wave...... height analysis. Finally, the paper gives a practical example based on a data set of the hindcasted wave heights for a deep water location in the Mediterranean Sea....

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.

A robust and efficient finite volume scheme for the discretization of diffusive flux on extremely skewed meshes in complex geometries

Science.gov (United States)

Traoré, Philippe; Ahipo, Yves Marcel; Louste, Christophe

2009-08-01

In this paper an improved finite volume scheme to discretize diffusive flux on a non-orthogonal mesh is proposed. This approach, based on an iterative technique initially suggested by Khosla [P.K. Khosla, S.G. Rubin, A diagonally dominant second-order accurate implicit scheme, Computers and Fluids 2 (1974) 207-209] and known as deferred correction, has been intensively utilized by Muzaferija [S. Muzaferija, Adaptative finite volume method for flow prediction using unstructured meshes and multigrid approach, Ph.D. Thesis, Imperial College, 1994] and later Fergizer and Peric [J.H. Fergizer, M. Peric, Computational Methods for Fluid Dynamics, Springer, 2002] to deal with the non-orthogonality of the control volumes. Using a more suitable decomposition of the normal gradient, our scheme gives accurate solutions in geometries where the basic idea of Muzaferija fails. First the performances of both schemes are compared for a Poisson problem solved in quadrangular domains where control volumes are increasingly skewed in order to test their robustness and efficiency. It is shown that convergence properties and the accuracy order of the solution are not degraded even on extremely skewed mesh. Next, the very stable behavior of the method is successfully demonstrated on a randomly distorted grid as well as on an anisotropically distorted one. Finally we compare the solution obtained for quadrilateral control volumes to the ones obtained with a finite element code and with an unstructured version of our finite volume code for triangular control volumes. No differences can be observed between the different solutions, which demonstrates the effectiveness of our approach.

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.

Coarse-mesh discretized low-order quasi-diffusion equations for subregion averaged scalar fluxes

International Nuclear Information System (INIS)

Anistratov, D. Y.

2004-01-01

In this paper we develop homogenization procedure and discretization for the low-order quasi-diffusion equations on coarse grids for core-level reactor calculations. The system of discretized equations of the proposed method is formulated in terms of the subregion averaged group scalar fluxes. The coarse-mesh solution is consistent with a given fine-mesh discretization of the transport equation in the sense that it preserves a set of average values of the fine-mesh transport scalar flux over subregions of coarse-mesh cells as well as the surface currents, and eigenvalue. The developed method generates numerical solution that mimics the large-scale behavior of the transport solution within assemblies. (authors)

Discrete computational mechanics for stiff phenomena

KAUST Repository

Michels, Dominik L.

2016-11-28

Many natural phenomena which occur in the realm of visual computing and computational physics, like the dynamics of cloth, fibers, fluids, and solids as well as collision scenarios are described by stiff Hamiltonian equations of motion, i.e. differential equations whose solution spectra simultaneously contain extremely high and low frequencies. This usually impedes the development of physically accurate and at the same time efficient integration algorithms. We present a straightforward computationally oriented introduction to advanced concepts from classical mechanics. We provide an easy to understand step-by-step introduction from variational principles over the Euler-Lagrange formalism and the Legendre transformation to Hamiltonian mechanics. Based on such solid theoretical foundations, we study the underlying geometric structure of Hamiltonian systems as well as their discrete counterparts in order to develop sophisticated structure preserving integration algorithms to efficiently perform high fidelity simulations.

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)

Application of network methods for understanding evolutionary dynamics in discrete habitats.

Science.gov (United States)

Greenbaum, Gili; Fefferman, Nina H

2017-06-01

In populations occupying discrete habitat patches, gene flow between habitat patches may form an intricate population structure. In such structures, the evolutionary dynamics resulting from interaction of gene-flow patterns with other evolutionary forces may be exceedingly complex. Several models describing gene flow between discrete habitat patches have been presented in the population-genetics literature; however, these models have usually addressed relatively simple settings of habitable patches and have stopped short of providing general methodologies for addressing nontrivial gene-flow patterns. In the last decades, network theory - a branch of discrete mathematics concerned with complex interactions between discrete elements - has been applied to address several problems in population genetics by modelling gene flow between habitat patches using networks. Here, we present the idea and concepts of modelling complex gene flows in discrete habitats using networks. Our goal is to raise awareness to existing network theory applications in molecular ecology studies, as well as to outline the current and potential contribution of network methods to the understanding of evolutionary dynamics in discrete habitats. We review the main branches of network theory that have been, or that we believe potentially could be, applied to population genetics and molecular ecology research. We address applications to theoretical modelling and to empirical population-genetic studies, and we highlight future directions for extending the integration of network science with molecular ecology. © 2017 John Wiley & Sons Ltd.

Estimation of system parameters in discrete dynamical systems from time series

International Nuclear Information System (INIS)

Palaniyandi, P.; Lakshmanan, M.

2005-01-01

We propose a simple method to estimate the parameters involved in discrete dynamical systems from time series. The method is based on the concept of controlling chaos by constant feedback. The major advantages of the method are that it needs a minimal number of time series data (either vector or scalar) and is applicable to dynamical systems of any dimension. The method also works extremely well even in the presence of noise in the time series. The method is specifically illustrated by means of logistic and Henon maps

An Approximate Method for Solving Optimal Control Problems for Discrete Systems Based on Local Approximation of an Attainability Set

Directory of Open Access Journals (Sweden)

V. A. Baturin

2017-03-01

Full Text Available An optimal control problem for discrete systems is considered. A method of successive improvements along with its modernization based on the expansion of the main structures of the core algorithm about the parameter is suggested. The idea of the method is based on local approximation of attainability set, which is described by the zeros of the Bellman function in the special problem of optimal control. The essence of the problem is as follows: from the end point of the phase is required to find a path that minimizes functional deviations of the norm from the initial state. If the initial point belongs to the attainability set of the original controlled system, the value of the Bellman function equal to zero, otherwise the value of the Bellman function is greater than zero. For this special task Bellman equation is considered. The support approximation and Bellman equation are selected. The Bellman function is approximated by quadratic terms. Along the allowable trajectory, this approximation gives nothing, because Bellman function and its expansion coefficients are zero. We used a special trick: an additional variable is introduced, which characterizes the degree of deviation of the system from the initial state, thus it is obtained expanded original chain. For the new variable initial nonzero conditions is selected, thus obtained trajectory is lying outside attainability set and relevant Bellman function is greater than zero, which allows it to hold a non-trivial approximation. As a result of these procedures algorithms of successive improvements is designed. Conditions for relaxation algorithms and conditions for the necessary conditions of optimality are also obtained.

An Efficient Approach for Identifying Stable Lobes with Discretization Method

Directory of Open Access Journals (Sweden)

Baohai Wu

2013-01-01

Full Text Available This paper presents a new approach for quick identification of chatter stability lobes with discretization method. Firstly, three different kinds of stability regions are defined: absolute stable region, valid region, and invalid region. Secondly, while identifying the chatter stability lobes, three different regions within the chatter stability lobes are identified with relatively large time intervals. Thirdly, stability boundary within the valid regions is finely calculated to get exact chatter stability lobes. The proposed method only needs to test a small portion of spindle speed and cutting depth set; about 89% computation time is savedcompared with full discretization method. It spends only about10 minutes to get exact chatter stability lobes. Since, based on discretization method, the proposed method can be used for different immersion cutting including low immersion cutting process, the proposed method can be directly implemented in the workshop to promote machining parameters selection efficiency.

On causality of extreme events

Directory of Open Access Journals (Sweden)

Massimiliano Zanin

2016-06-01

Full Text Available Multiple metrics have been developed to detect causality relations between data describing the elements constituting complex systems, all of them considering their evolution through time. Here we propose a metric able to detect causality within static data sets, by analysing how extreme events in one element correspond to the appearance of extreme events in a second one. The metric is able to detect non-linear causalities; to analyse both cross-sectional and longitudinal data sets; and to discriminate between real causalities and correlations caused by confounding factors. We validate the metric through synthetic data, dynamical and chaotic systems, and data representing the human brain activity in a cognitive task. We further show how the proposed metric is able to outperform classical causality metrics, provided non-linear relationships are present and large enough data sets are available.

Analysis hierarchical model for discrete event systems

Science.gov (United States)

Ciortea, E. M.

2015-11-01

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

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

Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem

Directory of Open Access Journals (Sweden)

S Sarathambekai

2017-03-01

Full Text Available Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization is the most commonly used method in majority of the evolutionary algorithms to generate solutions in the initial population. The initial good quality solutions can facilitate the algorithm to locate the optimal solution or else it may prevent the algorithm from finding the optimal solution. Intelligence should be incorporated to generate the initial population in order to avoid the premature convergence. This article presents a discrete particle swarm optimization algorithm, which incorporates opposition-based technique to generate initial population and greedy algorithm to balance the load of the processors. Make span, flow time, and reliability cost are three different measures used to evaluate the efficiency of the proposed discrete particle swarm optimization algorithm for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the proposed algorithm.

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

Feature Extraction from 3D Point Cloud Data Based on Discrete Curves

Directory of Open Access Journals (Sweden)

Yi An

2013-01-01

Full Text Available Reliable feature extraction from 3D point cloud data is an important problem in many application domains, such as reverse engineering, object recognition, industrial inspection, and autonomous navigation. In this paper, a novel method is proposed for extracting the geometric features from 3D point cloud data based on discrete curves. We extract the discrete curves from 3D point cloud data and research the behaviors of chord lengths, angle variations, and principal curvatures at the geometric features in the discrete curves. Then, the corresponding similarity indicators are defined. Based on the similarity indicators, the geometric features can be extracted from the discrete curves, which are also the geometric features of 3D point cloud data. The threshold values of the similarity indicators are taken from [0,1], which characterize the relative relationship and make the threshold setting easier and more reasonable. The experimental results demonstrate that the proposed method is efficient and reliable.

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.

Nonlinear wave propagation in discrete and continuous systems

Science.gov (United States)

Rothos, V. M.

2016-09-01

In this review we try to capture some of the recent excitement induced by a large volume of theoretical and computational studies addressing nonlinear Schrödinger models (discrete and continuous) and the localized structures that they support. We focus on some prototypical structures, namely the breather solutions and solitary waves. In particular, we investigate the bifurcation of travelling wave solution in Discrete NLS system applying dynamical systems methods. Next, we examine the combined effects of cubic and quintic terms of the long range type in the dynamics of a double well potential. The relevant bifurcations, the stability of the branches and their dynamical implications are examined both in the reduced (ODE) and in the full (PDE) setting. We also offer an outlook on interesting possibilities for future work on this theme.

Thermodynamics of extremal rotating thin shells in an extremal BTZ spacetime and the extremal black hole entropy

Science.gov (United States)

Lemos, José P. S.; Minamitsuji, Masato; Zaslavskii, Oleg B.

2017-02-01

In a (2 +1 )-dimensional spacetime with a negative cosmological constant, the thermodynamics and the entropy of an extremal rotating thin shell, i.e., an extremal rotating ring, are investigated. The outer and inner regions with respect to the shell are taken to be the Bañados-Teitelbom-Zanelli (BTZ) spacetime and the vacuum ground state anti-de Sitter spacetime, respectively. By applying the first law of thermodynamics to the extremal thin shell, one shows that the entropy of the shell is an arbitrary well-behaved function of the gravitational area A+ alone, S =S (A+). When the thin shell approaches its own gravitational radius r+ and turns into an extremal rotating BTZ black hole, it is found that the entropy of the spacetime remains such a function of A+, both when the local temperature of the shell at the gravitational radius is zero and nonzero. It is thus vindicated by this analysis that extremal black holes, here extremal BTZ black holes, have different properties from the corresponding nonextremal black holes, which have a definite entropy, the Bekenstein-Hawking entropy S (A+)=A/+4G , where G is the gravitational constant. It is argued that for extremal black holes, in particular for extremal BTZ black holes, one should set 0 ≤S (A+)≤A/+4G;i.e., the extremal black hole entropy has values in between zero and the maximum Bekenstein-Hawking entropy A/+4 G . Thus, rather than having just two entropies for extremal black holes, as previous results have debated, namely, 0 and A/+4 G , it is shown here that extremal black holes, in particular extremal BTZ black holes, may have a continuous range of entropies, limited by precisely those two entropies. Surely, the entropy that a particular extremal black hole picks must depend on past processes, notably on how it was formed. A remarkable relation between the third law of thermodynamics and the impossibility for a massive body to reach the velocity of light is also found. In addition, in the procedure, it

Generalized Second-Order Parametric Optimality Conditions in Semiinfinite Discrete Minmax Fractional Programming and Second-Order Univexity

Directory of Open Access Journals (Sweden)

Ram Verma

2016-02-01

Full Text Available This paper deals with mainly establishing numerous sets of generalized second order paramertic sufficient optimality conditions for a semiinfinite discrete minmax fractional programming problem, while the results on semiinfinite discrete minmax fractional programming problem achieved based on some partitioning schemes under various types of generalized second order univexity assumptions. 

Flexible Visual Quality Inspection in Discrete Manufacturing

OpenAIRE

Petković, Tomislav; Jurić, Darko; Lončarić, Sven

2013-01-01

Most visual quality inspections in discrete manufacturing are composed of length, surface, angle or intensity measurements. Those are implemented as end-user configurable inspection tools that should not require an image processing expert to set up. Currently available software solutions providing such capability use a flowchart based programming environment, but do not fully address an inspection flowchart robustness and can require a redefinition of the flowchart if a small variation is int...

Photoabsorption in molecular nitrogen: A moment analysis of discrete-basis-set calculations in the static-exchange approximation

International Nuclear Information System (INIS)

Rescigno, T.N.; Bender, C.F.; McKoy, B.V.; Langhoff, P.W.

1978-01-01

Theoretical investigations of photoexcitation and ionization cross sections in molecular nitrogen are reported employing the recently devised Stieltjes--Tchebycheff moment-theory technique in the static-exchange approximation. The coupled-channel equations for photoabsorption are separated approximately by identifying the important physically distinct excitation processes associated with formation of the three lowest electronic states of the parent molecular ion. Approximate Rydberg series and pseudospectra of transition frequencies and oscillator strengths are constructed for the seven individual channel components identified using Hartree--Fock ionic core functions and normalizable Gaussian orbitals to describe the photoexcited and ejected electrons. Detailed comparisons of the theoretically determined discrete excitation series with available spectral data indicate general accord between the calculated and observed excitation frequencies and oscillator strengths, although there are some discrepancies and certain Rydberg series have apparently not yet been identified in the measured spectra. The total Stieltjes--Tchebycheff vertical photoionization cross section obtained from the discrete pseudospectra is in excellent agreement with recent electron--ion coincidence measurement of the cross section for parent--ion production from threshold to 50 eV excitation energy. Similarly, e calculated vertical partial cross sections for the production of the three lowest electronic states in the parent molecular ion are in excellent accord with the results of recent electron--electron coincidence and synchrotron--radiation branching ratio measurements. The origins of particularly intense resonancelike features in the discrete and continuum portions of the photoabsorption cross sections are discussed in terms of excitations into valencelike molecular orbitals

Priority setting in the Austrian healthcare system: results from a discrete choice experiment and implications for mental health.

Science.gov (United States)

Mentzakis, Emmanouil; Paolucci, Francesco; Rubicko, Georg

2014-06-01

The impact of mental conditions is expected to be among the highest ranked causes of illness in high income countries by 2020. With changing health needs, policy makers have to make choices in an environment with increasingly constrained resources and competing demands. Discrete choice experiments have been identified as a useful approach to inform and support decision-making in health care systems and, in particular, its rationing. Policymakers, researchers and health practitioners from Austria participated in an experiment designed to elicit preferences for efficiency and equity in a generic priority setting framework. Using aggregate criteria an empirical measure of the efficiency/equity trade-off is calculated and a selection of health care interventions, including mental health, are ranked in composite league tables (CLTs). With the exception of severity of the condition, all equity parameters decrease attractiveness of an intervention, whereas the opposite holds for all three efficiency criteria. The efficiency/equity ratio (i.e. decision-makers' preference for efficiency over equity) is 3.5 and 5 for interventions targeted at younger and middle age populations, respectively, while for older populations this ratio is negative implying a rejection of all equity criteria. Irrespective of such differences interventions targeting mental health rank highly on all CLTs. Based on system-wide generic decision making criteria, mental health is shown to be a top priority for Austria. Preference-based approaches might offer complementary information to policymakers in priority setting decisions and a useful tool to support rationale rather than ad hoc decision-making.

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.

Moment problems and the causal set approach to quantum gravity

International Nuclear Information System (INIS)

Ash, Avner; McDonald, Patrick

2003-01-01

We study a collection of discrete Markov chains related to the causal set approach to modeling discrete theories of quantum gravity. The transition probabilities of these chains satisfy a general covariance principle, a causality principle, and a renormalizability condition. The corresponding dynamics are completely determined by a sequence of non-negative real coupling constants. Using techniques related to the classical moment problem, we give a complete description of any such sequence of coupling constants. We prove a representation theorem: every discrete theory of quantum gravity arising from causal set dynamics satisfying covariance, causality, and renormalizability corresponds to a unique probability distribution function on the non-negative real numbers, with the coupling constants defining the theory given by the moments of the distribution

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.

On discrete symmetries for a whole Abelian model

International Nuclear Information System (INIS)

Chauca, J.; Doria, R.

2012-01-01

Considering the whole concept applied to gauge theory a nonlinear abelian model is derived. A next step is to understand on the model properties. At this work, it will be devoted to discrete symmetries. For this, we will work based in two fields reference systems. This whole gauge symmetry allows to be analyzed through different sets which are the constructor basis {D μ ,X i μ } and the physical basis {G μI }. Taking as fields reference system the diagonalized spin-1 sector, P, C, T and PCT symmetries are analyzed. They show that under this systemic model there are conservation laws driven for the parts and for the whole. It develops the meaning of whole-parity, field-parity and so on. However it is the whole symmetry that rules. This means that usually forbidden particles as pseudovector photons can be introduced through such whole abelian system. As result, one notices that the fields whole {G μI } manifest a quanta diversity. It involves particles with different spins, masses and discrete quantum numbers under a same gauge symmetry. It says that without violating PCT symmetry different possibilities on discrete symmetries can be accommodated.

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

International Nuclear Information System (INIS)

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

1976-01-01

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

Discrete rough set analysis of two different soil-behavior-induced landslides in National Shei-Pa Park, Taiwan

Directory of Open Access Journals (Sweden)

Shih-Hsun Chang

2015-11-01

Full Text Available The governing factors that influence landslide occurrences are complicated by the different soil conditions at various sites. To resolve the problem, this study focused on spatial information technology to collect data and information on geology. GIS, remote sensing and digital elevation model (DEM were used in combination to extract the attribute values of the surface material in the vast study area of Shei-Pa National Park, Taiwan. The factors influencing landslides were collected and quantification values computed. The major soil component of loam and gravel in the Shei-Pa area resulted in different landslide problems. The major factors were successfully extracted from the influencing factors. Finally, the discrete rough set (DRS classifier was used as a tool to find the threshold of each attribute contributing to landslide occurrence, based upon the knowledge database. This rule-based knowledge database provides an effective and urgent system to manage landslides. NDVI (Normalized Difference Vegetation Index, VI (Vegetation Index, elevation, and distance from the road are the four major influencing factors for landslide occurrence. The landslide hazard potential diagrams (landslide susceptibility maps were drawn and a rational accuracy rate of landslide was calculated. This study thus offers a systematic solution to the investigation of landslide disasters.

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

Controlling extreme events on complex networks

Science.gov (United States)

Chen, Yu-Zhong; Huang, Zi-Gang; Lai, Ying-Cheng

2014-08-01

Extreme events, a type of collective behavior in complex networked dynamical systems, often can have catastrophic consequences. To develop effective strategies to control extreme events is of fundamental importance and practical interest. Utilizing transportation dynamics on complex networks as a prototypical setting, we find that making the network ``mobile'' can effectively suppress extreme events. A striking, resonance-like phenomenon is uncovered, where an optimal degree of mobility exists for which the probability of extreme events is minimized. We derive an analytic theory to understand the mechanism of control at a detailed and quantitative level, and validate the theory numerically. Implications of our finding to current areas such as cybersecurity are discussed.

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

Matrix albedo for discrete ordinates infinite-medium boundary condition

International Nuclear Information System (INIS)

Mathews, K.; Dishaw, J.

2007-01-01

Discrete ordinates problems with an infinite exterior medium (reflector) can be more efficiently computed by eliminating grid cells in the exterior medium and applying a matrix albedo boundary condition. The albedo matrix is a discretized bidirectional reflection distribution function (BRDF) that accounts for the angular quadrature set, spatial quadrature method, and spatial grid that would have been used to model a portion of the exterior medium. The method is exact in slab geometry, and could be used as an approximation in multiple dimensions or curvilinear coordinates. We present an adequate method for computing albedo matrices and demonstrate their use in verifying a discrete ordinates code in slab geometry by comparison with Ganapol's infinite medium semi-analytic TIEL benchmark. With sufficient resolution in the spatial and angular grids and iteration tolerance to yield solutions converged to 6 digits, the conventional (scalar) albedo boundary condition yielded 2-digit accuracy at the boundary, but the matrix albedo solution reproduced the benchmark scalar flux at the boundary to all 6 digits. (authors)

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

Discrete transforms

CERN Document Server

Firth, Jean M

1992-01-01

The analysis of signals and systems using transform methods is a very important aspect of the examination of processes and problems in an increasingly wide range of applications. Whereas the initial impetus in the development of methods appropriate for handling discrete sets of data occurred mainly in an electrical engineering context (for example in the design of digital filters), the same techniques are in use in such disciplines as cardiology, optics, speech analysis and management, as well as in other branches of science and engineering. This text is aimed at a readership whose mathematical background includes some acquaintance with complex numbers, linear differen­ tial equations, matrix algebra, and series. Specifically, a familiarity with Fourier series (in trigonometric and exponential forms) is assumed, and an exposure to the concept of a continuous integral transform is desirable. Such a background can be expected, for example, on completion of the first year of a science or engineering degree cour...

Essential uncontrollability of discrete linear, time-invariant, dynamical systems

Science.gov (United States)

Cliff, E. M.

1975-01-01

The concept of a 'best approximating m-dimensional subspace' for a given set of vectors in n-dimensional whole space is introduced. Such a subspace is easily described in terms of the eigenvectors of an associated Gram matrix. This technique is used to approximate an achievable set for a discrete linear time-invariant dynamical system. This approximation characterizes the part of the state space that may be reached using modest levels of control. If the achievable set can be closely approximated by a proper subspace of the whole space then the system is 'essentially uncontrollable'. The notion finds application in studies of failure-tolerant systems, and in decoupling.

Discrete density of states

Energy Technology Data Exchange (ETDEWEB)

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

2016-03-22

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

Homogenization of discrete media

International Nuclear Information System (INIS)

Pradel, F.; Sab, K.

1998-01-01

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

Homogenization of discrete media

Energy Technology Data Exchange (ETDEWEB)

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

1998-11-01

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

Histogram plots and cutoff energies for nuclear discrete levels

International Nuclear Information System (INIS)

Belgya, T.; Molnar, G.; Fazekas, B.; Oestoer, J.

1997-05-01

Discrete level schemes for 1277 nuclei, from 6 Li through 251 Es, extracted from the Evaluated Nuclear Structure Data File were analyzed. Cutoff energies (U max ), indicating the upper limit of level scheme completeness, were deduced from the inspection of histograms of the cumulative number of levels. Parameters of the constant-temperature level density formula (nuclear temperature T and energy shift U 0 ) were obtained by means of the least square fit of the formula to the known levels below cutoff energy. The results are tabulated for all 1277 nuclei allowing for an easy and reliable application of the constant-temperature level density approach. A complete set of cumulative plots of discrete levels is also provided. (author). 5 figs, 2 tabs

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.

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.

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

A short course in discrete mathematics

CERN Document Server

Bender, Edward A

2004-01-01

What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, seq

Lectures on financial mathematics discrete asset pricing

CERN Document Server

Anderson, Greg

2010-01-01

This is a short book on the fundamental concepts of the no-arbitrage theory of pricing financial derivatives. Its scope is limited to the general discrete setting of models for which the set of possible states is finite and so is the set of possible trading times--this includes the popular binomial tree model. This setting has the advantage of being fairly general while not requiring a sophisticated understanding of analysis at the graduate level. Topics include understanding the several variants of "arbitrage", the fundamental theorems of asset pricing in terms of martingale measures, and applications to forwards and futures. The authors' motivation is to present the material in a way that clarifies as much as possible why the often confusing basic facts are true. Therefore the ideas are organized from a mathematical point of view with the emphasis on understanding exactly what is under the hood and how it works. Every effort is made to include complete explanations and proofs, and the reader is encouraged t...

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

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Science.gov (United States)

2014-01-01

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Directory of Open Access Journals (Sweden)

Shih-Wei Lin

2014-01-01

Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

A Progressive Approach to Discrete Trial Teaching: Some Current Guidelines

Science.gov (United States)

Leaf, Justin B.; Cihon, Joseph H.; Leaf, Ronald; McEachin, John; Taubman, Mitchell

2016-01-01

Discrete trial teaching (DTT) is one of the cornerstones of applied behavior analysis (ABA) based interventions. Conventionally, DTT is commonly implemented within a prescribed, fixed manner in which the therapist is governed by a strict set of rules. In contrast to conventional DTT, a progressive approach to DTT allows the therapist to remain…

Discrete-Event Simulation

Directory of Open Access Journals (Sweden)

Prateek Sharma

2015-04-01

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

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

Science.gov (United States)

Jason, Peter; Johansson, Magnus

2016-01-01

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

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

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2010-01-01

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

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

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.

Regional tendencies of extreme wind characteristics in Hungary

Science.gov (United States)

Radics, Dr.; Bartholy, Dr.; Péliné

2009-09-01

Human activities have substantial effects on climate system. It has already accepted that change in the long-term climatic mean state will have significant consequences in the global economy and society, but the most important effects of climate change may come from changes in the intensity and frequency of climatic extremes. It is therefore of great interest to document the extremes of surface wind that could assist in estimating the regional effects of climate change. The research presented is based on 34-year-long (1975-2008) wind (speed, direction, and wind gust) data sets of 36 Hungarian synoptic meteorological stations. After processing (including digitalisation of old instrumental records, quality control and homogenisation of wind time series) the measured wind data sets, time series and complex wind climate analysis were carried out. Spatial and temporal distributions of mean and extreme wind climate characteristics were estimated, wind extremes and trends were interpolated and mapped over the country. Finally, measured and reanalysed (ERA40) wind data were compared over Hungary, in order to verify not only the validity of ERA40 reanalysed data sets, but the adaptability of climate simulation results in estimation of regional climate change effects.

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.

Desktop Modeling and Simulation: Parsimonious, yet Effective Discrete-Event Simulation Analysis

Science.gov (United States)

Bradley, James R.

2012-01-01

This paper evaluates how quickly students can be trained to construct useful discrete-event simulation models using Excel The typical supply chain used by many large national retailers is described, and an Excel-based simulation model is constructed of it The set of programming and simulation skills required for development of that model are then determined we conclude that six hours of training are required to teach the skills to MBA students . The simulation presented here contains all fundamental functionallty of a simulation model, and so our result holds for any discrete-event simulation model. We argue therefore that Industry workers with the same technical skill set as students having completed one year in an MBA program can be quickly trained to construct simulation models. This result gives credence to the efficacy of Desktop Modeling and Simulation whereby simulation analyses can be quickly developed, run, and analyzed with widely available software, namely Excel.

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.

Distortional solutions for loaded semi-discretized thin-walled beams

DEFF Research Database (Denmark)

Andreassen, Michael Joachim; Jönsson, Jeppe

2012-01-01

distortional displacement fields which decouple the reduced order differential equations. In this process the cross section is discretized into finite cross-section elements, and the natural distortional modes as well as the related axial variations are found as solutions to the established coupled fourth...... order homogeneous differential equations of GBT.In this paper the non-homogeneous distortional differential equations of GBT are formulated using this novel semi-discretization process. Transforming these non-homogeneous distortional differential equations into the natural eigenmode space by using...... the distortional modal matrix found for the homogeneous system, we get the uncoupled set of differential equations including the distributed loads. This uncoupling is very important in GBT, since the shear stiffness contribution from St. Venant torsional shear stress as well as “Bredt's shear flow” cannot...

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

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

Interaction between hopping and static spins in a discrete network

Energy Technology Data Exchange (ETDEWEB)

Ciccarello, Francesco, E-mail: francesco.ciccarello@sns.it [CNISM and Dipartimento di Fisica, Universita' degli Studi di Palermo, Viale delle Scienze, Edificio 18, I-90128 Palermo (Italy); NEST, Scuola Normale Superiore and Istituto Nanoscienze-CNR, Piazza dei Cavalieri 7, I-56126 Pisa (Italy)

2011-06-27

We consider a process where a spin hops across a discrete network and at certain sites couples to static spins. While this setting is implementable in various scenarios (e.g. quantum dots or coupled cavities) the physics of such processes is still basically unknown. Here, we take a first step along this line by scrutinizing a two-site and a three-site lattices, each with two static spins. Despite a generally complex dynamics occurs, we show a regime such that the spin dynamics is described by an effective three-spin chain. Tasks such as entanglement generation and quantum state transfer can be achieved accordingly. -- Highlights: → We study mobile spins hopping in a discrete network and coupled to static spins. → This setting can be implemented in various scenarios. → We address a two-site and a three-site lattice, each with two static spins. → We show a regime where the setup can be described by an effective three-spin chain. → Accordingly, it is prone to be exploited for some QIP applications.

Discrete Element Method simulations of standing jumps in granular flows down inclines

Directory of Open Access Journals (Sweden)

Méjean Ségolène

2017-01-01

Full Text Available This paper describes a numerical set-up which uses Discrete Element Method to produce standing jumps in flows of dry granular materials down a slope in two dimensions. The grain-scale force interactions are modeled by a visco-elastic normal force and an elastic tangential force with a Coulomb threshold. We will show how it is possible to reproduce all the shapes of the jumps observed in a previous laboratory study: diffuse versus steep jumps and compressible versus incompressible jumps. Moreover, we will discuss the additional measurements that can be done thanks to discrete element modelling.

Evolution caused by extreme events.

Science.gov (United States)

Grant, Peter R; Grant, B Rosemary; Huey, Raymond B; Johnson, Marc T J; Knoll, Andrew H; Schmitt, Johanna

2017-06-19

Extreme events can be a major driver of evolutionary change over geological and contemporary timescales. Outstanding examples are evolutionary diversification following mass extinctions caused by extreme volcanism or asteroid impact. The evolution of organisms in contemporary time is typically viewed as a gradual and incremental process that results from genetic change, environmental perturbation or both. However, contemporary environments occasionally experience strong perturbations such as heat waves, floods, hurricanes, droughts and pest outbreaks. These extreme events set up strong selection pressures on organisms, and are small-scale analogues of the dramatic changes documented in the fossil record. Because extreme events are rare, almost by definition, they are difficult to study. So far most attention has been given to their ecological rather than to their evolutionary consequences. We review several case studies of contemporary evolution in response to two types of extreme environmental perturbations, episodic (pulse) or prolonged (press). Evolution is most likely to occur when extreme events alter community composition. We encourage investigators to be prepared for evolutionary change in response to rare events during long-term field studies.This article is part of the themed issue 'Behavioural, ecological and evolutionary responses to extreme climatic events'. © 2017 The Author(s).

Ultradiscrete sine-Gordon Equation over Symmetrized Max-Plus Algebra, and Noncommutative Discrete and Ultradiscrete sine-Gordon Equations

Directory of Open Access Journals (Sweden)

Kenichi Kondo

2013-11-01

Full Text Available Ultradiscretization with negative values is a long-standing problem and several attempts have been made to solve it. Among others, we focus on the symmetrized max-plus algebra, with which we ultradiscretize the discrete sine-Gordon equation. Another ultradiscretization of the discrete sine-Gordon equation has already been proposed by previous studies, but the equation and the solutions obtained here are considered to directly correspond to the discrete counterpart. We also propose a noncommutative discrete analogue of the sine-Gordon equation, reveal its relations to other integrable systems including the noncommutative discrete KP equation, and construct multisoliton solutions by a repeated application of Darboux transformations. Moreover, we derive a noncommutative ultradiscrete analogue of the sine-Gordon equation and its 1-soliton and 2-soliton solutions, using the symmetrized max-plus algebra. As a result, we have a complete set of commutative and noncommutative versions of continuous, discrete, and ultradiscrete sine-Gordon equations.

An analysis on equal width quantization and linearly separable subcode encoding-based discretization and its performance resemblances

Directory of Open Access Journals (Sweden)

Lim Meng-Hui

2011-01-01

Full Text Available Abstract Biometric discretization extracts a binary string from a set of real-valued features per user. This representative string can be used as a cryptographic key in many security applications upon error correction. Discretization performance should not degrade from the actual continuous features-based classification performance significantly. However, numerous discretization approaches based on ineffective encoding schemes have been put forward. Therefore, the correlation between such discretization and classification has never been made clear. In this article, we aim to bridge the gap between continuous and Hamming domains, and provide a revelation upon how discretization based on equal-width quantization and linearly separable subcode encoding could affect the classification performance in the Hamming domain. We further illustrate how such discretization can be applied in order to obtain a highly resembled classification performance under the general Lp distance and the inner product metrics. Finally, empirical studies conducted on two benchmark face datasets vindicate our analysis results.

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)

A matrix problem over a discrete valuation ring

International Nuclear Information System (INIS)

Zavadskii, A G; Revitskaya, U S

1999-01-01

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

Finite Discrete Gabor Analysis

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2007-01-01

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

Adaptive Discrete Hypergraph Matching.

Science.gov (United States)

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

2018-02-01

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

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

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

Science.gov (United States)

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

2011-07-20

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

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.

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)

Quasi-stationary distributions for reducible absorbing Markov chains in discrete time

NARCIS (Netherlands)

van Doorn, Erik A.; Pollett, P.K.

2009-01-01

We consider discrete-time Markov chains with one coffin state and a finite set $S$ of transient states, and are interested in the limiting behaviour of such a chain as time $n \\to \\infty,$ conditional on survival up to $n$. It is known that, when $S$ is irreducible, the limiting conditional

Combinatorics of finite sets

CERN Document Server

Anderson, Ian

2011-01-01

Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result concerning k-saturated chain partitions of general partially ordered sets. Connections with Dilworth's theorem, the marriage problem, and probability are also discussed. Each chapter ends with a helpful series of exercises and outline solutions appear at the end. ""An excellent text for a topics course in discrete mathematics."" - Bulletin of the Ame

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.

The discrete ordinates method for solving the azimuthally dependent transport equation in plane geometry

International Nuclear Information System (INIS)

Chalhoub, Ezzat Selim

1997-01-01

The method of discrete ordinates is applied to the solution of the slab albedo problem with azimuthal dependence in transport theory. A new set of quadratures appropriate to the problem is introduced. In addition to the ANISN code, modified to include the proposed formalism, two new programs, PEESNC and PEESNA, which were created on the basis of the discrete ordinates formalism, using the direct integration method and the analytic solution method respectively, are used in the generation of results for a few sample problems. Program PEESNC was created to validate the results obtained with the discrete ordinates method and the finite difference approximation (ANISN), while program PEESNA was developed in order to implement an analytical discrete ordinates formalism, which provides more accurate results. The obtained results for selected sample problems are compared with highly accurate numerical results published in the literature. Compared to ANISN and PEESNC, program PEESNA presents a greater efficiency in execution time and much more precise numerical results. (author)

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

Discrete-Time LPV Current Control of an Induction Motor

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon; Trangbæk, Klaus

2003-01-01

In this paper we apply a new method for gain-scheduled output feedback control of nonlinear systems to current control of an induction motor. The method relies on recently developed controller synthesis results for linear parameter-varying (LPV) systems, where the controller synthesis is formulated...... as a set of linear matrix inequalities with full-block multipliers. A standard nonlinear model of the motor is constructed and written on LPV form. We then show that, although originally developed in continuous time, the controller synthesis results can be applied to a discrete-time model as well without...... further complications. The synthesis method is applied to the model, yielding an LPV discrete-time controller. Finally, the efficiency of the control scheme is validated via simulations as well as on the actual induction motor, both in open-loop current control and when an outer speed control loop...

Challenges and Opportunities of Centrifugal Microfluidics for Extreme Point-of-Care Testing

Directory of Open Access Journals (Sweden)

Issac J. Michael

2016-02-01

Full Text Available The advantages offered by centrifugal microfluidic systems have encouraged its rapid adaptation in the fields of in vitro diagnostics, clinical chemistry, immunoassays, and nucleic acid tests. Centrifugal microfluidic devices are currently used in both clinical and point-of-care settings. Recent studies have shown that this new diagnostic platform could be potentially used in extreme point-of-care settings like remote villages in the Indian subcontinent and in Africa. Several technological inventions have decentralized diagnostics in developing countries; however, very few microfluidic technologies have been successful in meeting the demand. By identifying the finest difference between the point-of-care testing and extreme point-of-care infrastructure, this review captures the evolving diagnostic needs of developing countries paired with infrastructural challenges with technological hurdles to healthcare delivery in extreme point-of-care settings. In particular, the requirements for making centrifugal diagnostic devices viable in developing countries are discussed based on a detailed analysis of the demands in different clinical settings including the distinctive needs of extreme point-of-care settings.

Direct Adaptive Control of a Class of Nonlinear Discrete-Time Systems

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon

2004-01-01

In this paper we deal with direct adaptive control of a specific class of discrete-time SISO systems, where the nonlinearities are convex and an upper bound is known. We use a control law based on a linear combination of a set of globally uniformly bounded basis functions with compact support, wh...

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

Deterministic absorbed dose estimation in computed tomography using a discrete ordinates method

International Nuclear Information System (INIS)

Norris, Edward T.; Liu, Xin; Hsieh, Jiang

2015-01-01

Purpose: Organ dose estimation for a patient undergoing computed tomography (CT) scanning is very important. Although Monte Carlo methods are considered gold-standard in patient dose estimation, the computation time required is formidable for routine clinical calculations. Here, the authors instigate a deterministic method for estimating an absorbed dose more efficiently. Methods: Compared with current Monte Carlo methods, a more efficient approach to estimating the absorbed dose is to solve the linear Boltzmann equation numerically. In this study, an axial CT scan was modeled with a software package, Denovo, which solved the linear Boltzmann equation using the discrete ordinates method. The CT scanning configuration included 16 x-ray source positions, beam collimators, flat filters, and bowtie filters. The phantom was the standard 32 cm CT dose index (CTDI) phantom. Four different Denovo simulations were performed with different simulation parameters, including the number of quadrature sets and the order of Legendre polynomial expansions. A Monte Carlo simulation was also performed for benchmarking the Denovo simulations. A quantitative comparison was made of the simulation results obtained by the Denovo and the Monte Carlo methods. Results: The difference in the simulation results of the discrete ordinates method and those of the Monte Carlo methods was found to be small, with a root-mean-square difference of around 2.4%. It was found that the discrete ordinates method, with a higher order of Legendre polynomial expansions, underestimated the absorbed dose near the center of the phantom (i.e., low dose region). Simulations of the quadrature set 8 and the first order of the Legendre polynomial expansions proved to be the most efficient computation method in the authors’ study. The single-thread computation time of the deterministic simulation of the quadrature set 8 and the first order of the Legendre polynomial expansions was 21 min on a personal computer

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

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

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

Science.gov (United States)

Zeigler, Bernard P.

1989-01-01

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

Methodology for featuring and assessing extreme climatic events

International Nuclear Information System (INIS)

Malleron, N.; Bernardara, P.; Benoit, M.; Parey, S.; Perret, C.

2013-01-01

The setting up of a nuclear power plant on a particular site requires the assessment of risks linked to extreme natural events like flooding or earthquakes. As a consequence of the Fukushima accident EDF proposes to take into account even rarer events in order to improve the robustness of the facility all over its operating life. This article presents the methodology used by EDF to analyse a set of data in a statistical way in order to extract extreme values. This analysis is based on the theory of extreme values and is applied to the extreme values of the flow rate in the case of a river overflowing. This methodology is made of 6 steps: 1) selection of the event, of its featuring parameter and of its probability, for instance the question is what is the flow rate of a flooding that has a probability of 10 -3 to happen, 2) to collect data over a long period of time (or to recover data from past periods), 3) to extract extreme values from the data, 4) to find an adequate statistical law that fits the spreading of the extreme values, 5) the selected statistical law must be validated through visual or statistical tests, and 6) the computation of the flow rate of the event itself. (A.C.)

Diabatic potential-optimized discrete variable representation: application to photodissociation process of the CO molecule

International Nuclear Information System (INIS)

Bitencourt, Ana Carla P; Prudente, Frederico V; Vianna, Jose David M

2007-01-01

We propose a new numerically optimized discrete variable representation using eigenstates of diabatic Hamiltonians. This procedure provides an efficient method to solve non-adiabatic coupling problems since the generated basis sets take into account information on the diabatic potentials. The method is applied to the B 1 Σ + - D' 1 Σ + Rydberg-valence predissociation interaction in the CO molecule. Here we give an account of the discrete variable representation and present the procedure for the calculation of its optimized version, which we apply to obtain the total photodissociation cross sections of the CO molecule

In search of informed discretion: an experimental investigation of fairness and trust reciprocity

NARCIS (Netherlands)

Maas, V.S.; van Rinsum, M.; Towry, K.

2009-01-01

This paper investigates managerial discretion in compensation decisions in a team (i.e., joint production) setting. Specifically, we investigate the conditions under which managers tasked with allocating a discretionary bonus pool are willing to incur a personal cost to obtain ex post

In search of informed discretion: an experimental investigation of fairness and trust reciprocity

NARCIS (Netherlands)

Maas, V.; van Rinsum, M.; Towry, K.

2012-01-01

This paper investigates managerial discretion in compensation decisions in a team setting, in which a measure of the team's aggregate performance is readily available from the accounting system. Specifically, we examine the willingness of managers to obtain additional, costly information that would

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.

On the effects of the degree of discretion in reporting managerial performance

NARCIS (Netherlands)

De Waegenaere, A.M.B.; Wielhouwer, J.L.

2011-01-01

We consider a principal-agent setting in which a manager’s compensation depends on a noisy performance signal, and the manager is granted the right to choose an (accounting) method to determine the value of the performance signal. We study the effect of the degree of such reporting discretion,

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

Discrete competing risk model with application to modeling bus-motor failure data

International Nuclear Information System (INIS)

Jiang, R.

2010-01-01

Failure data are often modeled using continuous distributions. However, a discrete distribution can be appropriate for modeling interval or grouped data. When failure data come from a complex system, a simple discrete model can be inappropriate for modeling such data. This paper presents two types of discrete distributions. One is formed by exponentiating an underlying distribution, and the other is a two-fold competing risk model. The paper focuses on two special distributions: (a) exponentiated Poisson distribution and (b) competing risk model involving a geometric distribution and an exponentiated Poisson distribution. The competing risk model has a decreasing-followed-by-unimodal mass function and a bathtub-shaped failure rate. Five classical data sets on bus-motor failures can be simultaneously and appropriately fitted by a general 5-parameter competing risk model with the parameters being functions of the number of successive failures. The lifetime and aging characteristics of the fitted distribution are analyzed.

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

Risk factors for lower-extremity injuries among contemporary dance students

NARCIS (Netherlands)

van Seters, Christine; van Rijn, Rogier M; van Middelkoop, Marienke; Stubbe, Janine H

2017-01-01

OBJECTIVE: To determine whether student characteristics, lower-extremity kinematics, and strength are risk factors for sustaining lower-extremity injuries in preprofessional contemporary dancers. DESIGN: Prospective cohort study. SETTING: Codarts University of the Arts. PATIENTS: Forty-five

Selection and storage of perceptual groups is constrained by a discrete resource in working memory.

Science.gov (United States)

Anderson, David E; Vogel, Edward K; Awh, Edward

2013-06-01

Perceptual grouping can lead observers to perceive a multielement scene as a smaller number of hierarchical units. Past work has shown that grouping enables more elements to be stored in visual working memory (WM). Although this may appear to contradict so-called discrete resource models that argue for fixed item limits in WM storage, it is also possible that grouping reduces the effective number of "items" in the display. To test this hypothesis, we examined how mnemonic resolution declined as the number of items to be stored increased. Discrete resource models predict that precision will reach a stable plateau at relatively early set sizes, because no further items can be stored once putative item limits are exceeded. Thus, we examined whether the precision by set size function was bilinear when storage was enhanced via perceptual grouping. In line with the hypothesis that each perceptual group counted as a single "item," precision still reached a clear plateau at a set size determined by the number of stored groups. Moreover, the maximum number of elements stored was doubled, and electrophysiological measures showed that selection and storage-related neural responses were the same for a single element and a multielement perceptual group. Thus, perceptual grouping allows more elements to be held in working memory while storage is still constrained by a discrete item limit.

Skeletonization and Partitioning of Digital Images Using Discrete Morse Theory.

Science.gov (United States)

Delgado-Friedrichs, Olaf; Robins, Vanessa; Sheppard, Adrian

2015-03-01

We show how discrete Morse theory provides a rigorous and unifying foundation for defining skeletons and partitions of grayscale digital images. We model a grayscale image as a cubical complex with a real-valued function defined on its vertices (the voxel values). This function is extended to a discrete gradient vector field using the algorithm presented in Robins, Wood, Sheppard TPAMI 33:1646 (2011). In the current paper we define basins (the building blocks of a partition) and segments of the skeleton using the stable and unstable sets associated with critical cells. The natural connection between Morse theory and homology allows us to prove the topological validity of these constructions; for example, that the skeleton is homotopic to the initial object. We simplify the basins and skeletons via Morse-theoretic cancellation of critical cells in the discrete gradient vector field using a strategy informed by persistent homology. Simple working Python code for our algorithms for efficient vector field traversal is included. Example data are taken from micro-CT images of porous materials, an application area where accurate topological models of pore connectivity are vital for fluid-flow modelling.

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

Teaching Proofs and Algorithms in Discrete Mathematics with Online Visual Logic Puzzles

Science.gov (United States)

Cigas, John; Hsin, Wen-Jung

2005-01-01

Visual logic puzzles provide a fertile environment for teaching multiple topics in discrete mathematics. Many puzzles can be solved by the repeated application of a small, finite set of strategies. Explicitly reasoning from a strategy to a new puzzle state illustrates theorems, proofs, and logic principles. These provide valuable, concrete…

On the Effects of the Degree of Discretion in Reporting Managerial performance

NARCIS (Netherlands)

De Waegenaere, A.M.B.; Wielhouwer, J.L.

2008-01-01

We consider a principal-agent setting in which a manager’s compensation de- pends on a noisy performance signal, and the manager is granted the right to choose an (accounting) method to determine the value of the performance signal. We study the effect of the degree of such reporting discretion,

Extreme Value Theory Approach to Simultaneous Monitoring and Thresholding of Multiple Risk Indicators

NARCIS (Netherlands)

Einmahl, J.H.J.; Li, J.; Liu, R.Y.

2006-01-01

Risk assessments often encounter extreme settings with very few or no occurrences in reality.Inferences about risk indicators in such settings face the problem of insufficient data.Extreme value theory is particularly well suited for handling this type of problems.This paper uses a multivariate

Random walkers with extreme value memory: modelling the peak-end rule

Science.gov (United States)

Harris, Rosemary J.

2015-05-01

Motivated by the psychological literature on the ‘peak-end rule’ for remembered experience, we perform an analysis within a random walk framework of a discrete choice model where agents’ future choices depend on the peak memory of their past experiences. In particular, we use this approach to investigate whether increased noise/disruption always leads to more switching between decisions. Here extreme value theory illuminates different classes of dynamics indicating that the long-time behaviour is dependent on the scale used for reflection; this could have implications, for example, in questionnaire design.

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

Science.gov (United States)

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

2017-07-01

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

Derivation of new 3D discrete ordinate equations

International Nuclear Information System (INIS)

Ahrens, C. D.

2012-01-01

The Sn equations have been the workhorse of deterministic radiation transport calculations for many years. Here we derive two new angular discretizations of the 3D transport equation. The first set of equations, derived using Lagrange interpolation and collocation, retains the classical Sn structure, with the main difference being how the scattering source is calculated. Because of the formal similarity with the classical S n equations, it should be possible to modify existing computer codes to take advantage of the new formulation. In addition, the new S n-like equations correctly capture delta function scattering. The second set of equations, derived using a Galerkin technique, does not retain the classical Sn structure because the streaming term is not diagonal. However, these equations can be cast into a form similar to existing methods developed to reduce ray effects. Numerical investigation of both sets of equations is under way. (authors)

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

Energy Technology Data Exchange (ETDEWEB)

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

2006-06-12

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

Hydrologic extremes - an intercomparison of multiple gridded statistical downscaling methods

Science.gov (United States)

Werner, Arelia T.; Cannon, Alex J.

2016-04-01

Gridded statistical downscaling methods are the main means of preparing climate model data to drive distributed hydrological models. Past work on the validation of climate downscaling methods has focused on temperature and precipitation, with less attention paid to the ultimate outputs from hydrological models. Also, as attention shifts towards projections of extreme events, downscaling comparisons now commonly assess methods in terms of climate extremes, but hydrologic extremes are less well explored. Here, we test the ability of gridded downscaling models to replicate historical properties of climate and hydrologic extremes, as measured in terms of temporal sequencing (i.e. correlation tests) and distributional properties (i.e. tests for equality of probability distributions). Outputs from seven downscaling methods - bias correction constructed analogues (BCCA), double BCCA (DBCCA), BCCA with quantile mapping reordering (BCCAQ), bias correction spatial disaggregation (BCSD), BCSD using minimum/maximum temperature (BCSDX), the climate imprint delta method (CI), and bias corrected CI (BCCI) - are used to drive the Variable Infiltration Capacity (VIC) model over the snow-dominated Peace River basin, British Columbia. Outputs are tested using split-sample validation on 26 climate extremes indices (ClimDEX) and two hydrologic extremes indices (3-day peak flow and 7-day peak flow). To characterize observational uncertainty, four atmospheric reanalyses are used as climate model surrogates and two gridded observational data sets are used as downscaling target data. The skill of the downscaling methods generally depended on reanalysis and gridded observational data set. However, CI failed to reproduce the distribution and BCSD and BCSDX the timing of winter 7-day low-flow events, regardless of reanalysis or observational data set. Overall, DBCCA passed the greatest number of tests for the ClimDEX indices, while BCCAQ, which is designed to more accurately resolve event

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

State estimation for discrete-time Markovian jumping neural networks with mixed mode-dependent delays

International Nuclear Information System (INIS)

Liu Yurong; Wang Zidong; Liu Xiaohui

2008-01-01

In this Letter, we investigate the state estimation problem for a new class of discrete-time neural networks with Markovian jumping parameters as well as mode-dependent mixed time-delays. The parameters of the discrete-time neural networks are subject to the switching from one mode to another at different times according to a Markov chain, and the mixed time-delays consist of both discrete and distributed delays that are dependent on the Markovian jumping mode. New techniques are developed to deal with the mixed time-delays in the discrete-time setting, and a novel Lyapunov-Krasovskii functional is put forward to reflect the mode-dependent time-delays. Sufficient conditions are established in terms of linear matrix inequalities (LMIs) that guarantee the existence of the state estimators. We show that both the existence conditions and the explicit expression of the desired estimator can be characterized in terms of the solution to an LMI. A numerical example is exploited to show the usefulness of the derived LMI-based conditions

Efficacy of Lower-Extremity Venous Thrombolysis in the Setting of Congenital Absence or Atresia of the Inferior Vena Cava

International Nuclear Information System (INIS)

Ganguli, Suvranu; Kalva, Sanjeeva; Oklu, Rahmi; Walker, T. Gregory; Datta, Neil; Grabowski, Eric F.; Wicky, Stephan

2012-01-01

Purpose: A rare but described risk factor for deep venous thrombosis (DVT), predominately in the young, is congenital agenesis or atresia of the inferior vena cava (IVC). The optimal management for DVT in this subset of patients is unknown. We evaluated the efficacy of pharmacomechanical catheter-directed thrombolysis (PCDT) followed by systemic anticoagulation in the treatment of acute lower-extremity DVT in the setting of congenital IVC agenesis or atresia. Materials and Methods: Between November of 2005 and May of 2010, six patients (three women [average age 21 years]) were referred to our department with acute lower-extremity DVT and subsequently found to have IVC agenesis or atresia on magnetic resonance imaging. A standardized technique for PCDT (the Angiojet Rheolytic Thrombectomy System followed by the EKOS Microsonic Accelerated Thrombolysis System) was used for all subjects. Successful thrombolysis was followed by systemic heparinization with transition to Coumadin or low molecular-weight heparin and compression stockings. Subjects were followed-up at 1, 3, and then every 6 months after the procedure with clinical assessment and bilateral lower-extremity venous ultrasound. Results: All PCDT procedures were technically successful. No venous stenting or angioplasty was performed. The average thrombolysis time was 28.6 h (range 12–72). Two patients experienced heparin-induced thrombocytopenia, and one patient developed a self-limited knee hemarthrosis, No patients were lost to follow-up. The average length of follow-up was 25.8 ± 20.2 months (range 3.8–54.8). No incidence of recurrent DVT was identified. There were no manifestations of postthrombotic syndrome. Conclusions: PCDT followed by systemic anticoagulation and the use of compression stockings appears to be safe and effective in relatively long-term follow-up treatment of patients who present with acute DVT and IVC agenesis or atresia.

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

Discrete Wigner functions and quantum computation

International Nuclear Information System (INIS)

Galvao, E.

2005-01-01

Full text: Gibbons et al. have recently defined a class of discrete Wigner functions W to represent quantum states in a finite Hilbert space dimension d. I characterize the set C d of states having non-negative W simultaneously in all definitions of W in this class. I then argue that states in this set behave classically in a well-defined computational sense. I show that one-qubit states in C 2 do not provide for universal computation in a recent model proposed by Bravyi and Kitaev [quant-ph/0403025]. More generally, I show that the only pure states in C d are stabilizer states, which have an efficient description using the stabilizer formalism. This result shows that two different notions of 'classical' states coincide: states with non-negative Wigner functions are those which have an efficient description. This suggests that negativity of W may be necessary for exponential speed-up in pure-state quantum computation. (author)

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

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.

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)

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

International Nuclear Information System (INIS)

Densmore, Jeffery D.; Warsa, James S.; Lowrie, Robert B.; Morel, Jim E.

2009-01-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

Energy Technology Data Exchange (ETDEWEB)

Densmore, Jeffery D [Los Alamos National Laboratory; Warsa, James S [Los Alamos National Laboratory; Lowrie, Robert B [Los Alamos National Laboratory; Morel, Jim E [TEXAS A& M UNIV

2008-01-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

Science.gov (United States)

Densmore, Jeffery D.; Warsa, James S.; Lowrie, Robert B.; Morel, Jim E.

2009-09-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

An example of numerical simulation in causal set dynamics

International Nuclear Information System (INIS)

Krugly, Alexey L; Tserkovnikov, Ivan A

2013-01-01

The model of a discrete pregeometry on a microscopic scale is an x-graph. This is a directed acyclic graph. An outdegree and an indegree of each vertex are not more than 2. The sets of vertices and edges of x-graph are particular cases of causal sets. The sequential growth of a graph is an addition of new vertices one by one. A simple stochastic algorithm of sequential growth of x-graph are considered. It is based on a random walk at the x-graph. The particles in this model must be self-organized repetitive structures. We introduce the method of search of such repetitive structures. It is based on a discrete Fourier transformation. An example of numerical simulation is introduced.

Effect of Delayed Reinforcement on Skill Acquisition during Discrete-Trial Instruction: Implications for Treatment-Integrity Errors in Academic Settings

Science.gov (United States)

Carroll, Regina A.; Kodak, Tiffany; Adolf, Kari J.

2016-01-01

We used an adapted alternating treatments design to compare skill acquisition during discrete-trial instruction using immediate reinforcement, delayed reinforcement with immediate praise, and delayed reinforcement for 2 children with autism spectrum disorder. Participants acquired the skills taught with immediate reinforcement; however, delayed…

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

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.

Current concepts in repair of extremity venous injury.

Science.gov (United States)

Williams, Timothy K; Clouse, W Darrin

2016-04-01

Extremity venous injury management remains controversial. The purpose of this communication is to offer perspective as well as experiential and technical insight into extremity venous injury repair. Available literature is reviewed and discussed. Historical context is provided. Indication, the decision process for repair, including technical conduct, is delineated. In particular, the authors' experiences in both civilian and wartime injury are used for perspective. Extremity venous injury repair was championed within data from the Vietnam Vascular Registry. However, patterns of extremity venous injury differ between combat and civilian settings. Since Vietnam, civilian descriptive series opine the benefits and potential complications associated with both venous injury repair and ligation. These surround extremity edema, chronic venous insufficiency, thromboembolism, and limb loss. Whereas no clear superiority in either approach has been identified to date, there appears to be no increased risk of pulmonary embolism or chronic venous changes with repair. Newer data from the wars in Iraq and Afghanistan and meta-analysis have reinforced this and also have suggested limb salvage benefit for extremity venous repair in combined arterial and venous injuries in modern settings. The patient's physiologic state and associated injury drive five triage categories suggesting vein injury management. Vein repair thrombosis occurs in a significant proportion, yet many recanalize and possibly have a positive impact on limb venous return. Further, early decompression favors reduced blood loss, acute edema, and inflammation, supporting collateral development. Large soft tissue injury minimizing collateral capacity increases the importance of repair. Constructs of repair are varied with modest differences in patency. Venous shunting is feasible, but specific roles remain nebulous. An aggressive posture toward extremity venous injury repair seems justified today because of the likely

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

Directory of Open Access Journals (Sweden)

Hideki Katagiri

2017-10-01

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

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

Optimized waveform relaxation domain decomposition method for discrete finite volume non stationary convection diffusion equation

International Nuclear Information System (INIS)

Berthe, P.M.

2013-01-01

In the context of nuclear waste repositories, we consider the numerical discretization of the non stationary convection diffusion equation. Discontinuous physical parameters and heterogeneous space and time scales lead us to use different space and time discretizations in different parts of the domain. In this work, we choose the discrete duality finite volume (DDFV) scheme and the discontinuous Galerkin scheme in time, coupled by an optimized Schwarz waveform relaxation (OSWR) domain decomposition method, because this allows the use of non-conforming space-time meshes. The main difficulty lies in finding an upwind discretization of the convective flux which remains local to a sub-domain and such that the multi domain scheme is equivalent to the mono domain one. These difficulties are first dealt with in the one-dimensional context, where different discretizations are studied. The chosen scheme introduces a hybrid unknown on the cell interfaces. The idea of up winding with respect to this hybrid unknown is extended to the DDFV scheme in the two-dimensional setting. The well-posedness of the scheme and of an equivalent multi domain scheme is shown. The latter is solved by an OSWR algorithm, the convergence of which is proved. The optimized parameters in the Robin transmission conditions are obtained by studying the continuous or discrete convergence rates. Several test-cases, one of which inspired by nuclear waste repositories, illustrate these results. (author) [fr

Cyclic loading tests on ceramic breeder pebble bed by discrete element modeling

Energy Technology Data Exchange (ETDEWEB)

Zhang, Hao [School of Nuclear Science and Technology, University of Science and Technology of China, Hefei 230027 (China); Institute of Nuclear Physics and Chemistry, China Academy of Engineering Physics, Mianyang 621900 (China); Guo, Haibing; Shi, Tao [Institute of Nuclear Physics and Chemistry, China Academy of Engineering Physics, Mianyang 621900 (China); Ye, Minyou [School of Nuclear Science and Technology, University of Science and Technology of China, Hefei 230027 (China); Huang, Hongwen, E-mail: hhw@caep.cn [Institute of Nuclear Physics and Chemistry, China Academy of Engineering Physics, Mianyang 621900 (China); Li, Zhenghong, E-mail: inpcnyb@sina.com [Institute of Nuclear Physics and Chemistry, China Academy of Engineering Physics, Mianyang 621900 (China); University of Science and Technology of China, Hefei 230027 (China)

2017-05-15

Highlights: • Methods of cyclic loading tests on the pebble beds were developed in DEM. • Size distribution and sphericity of the pebbles were considered for the specimen. • Mechanical responses of the pebble beds under cyclic loading tests were assessed. - Abstract: Complex mechanics and packing instability can be induced by loading operation on ceramic breeder pebble bed for its discrete nature. A numerical approach using discrete element method (DEM) is applied to study the mechanical performance of the ceramic breeder pebble bed under quasi-static and cyclic loads. A preloaded specimen can be made with servo-control mechanism, the quasi-static and dynamic stress-strain performances are studied during the tests. It is found that the normalized normal contact forces under quasi-static loads have the similar distributions, and increase with increasing loads. Furthermore, the relatively low volumetric strain can be absorbed by pebble bed after several loading and unloading cycles, but the peak normal contact force can be extremely high during the first cycle. Cyclic loading with target pressure is recommended for densely packing, irreversible volume reduction gradually increase with cycles, and the normal contact forces decrease with cycles.

Cyclic loading tests on ceramic breeder pebble bed by discrete element modeling

International Nuclear Information System (INIS)

Zhang, Hao; Guo, Haibing; Shi, Tao; Ye, Minyou; Huang, Hongwen; Li, Zhenghong

2017-01-01

Highlights: • Methods of cyclic loading tests on the pebble beds were developed in DEM. • Size distribution and sphericity of the pebbles were considered for the specimen. • Mechanical responses of the pebble beds under cyclic loading tests were assessed. - Abstract: Complex mechanics and packing instability can be induced by loading operation on ceramic breeder pebble bed for its discrete nature. A numerical approach using discrete element method (DEM) is applied to study the mechanical performance of the ceramic breeder pebble bed under quasi-static and cyclic loads. A preloaded specimen can be made with servo-control mechanism, the quasi-static and dynamic stress-strain performances are studied during the tests. It is found that the normalized normal contact forces under quasi-static loads have the similar distributions, and increase with increasing loads. Furthermore, the relatively low volumetric strain can be absorbed by pebble bed after several loading and unloading cycles, but the peak normal contact force can be extremely high during the first cycle. Cyclic loading with target pressure is recommended for densely packing, irreversible volume reduction gradually increase with cycles, and the normal contact forces decrease with cycles.

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

Rational Calibration of Four IEC 61400-1 Extreme External Conditions

DEFF Research Database (Denmark)

Larsen, Gunner Chr.; Hansen, Kurt Schaldemose

2008-01-01

Based on a set of asymptotic statistical models on closed form this paper presents a rational and consistent calibration of four extreme external conditions defined in the International Electrotechnical Commission (IEC) 61400-1 standard: extreme operating gust, extreme wind shear, extreme coheren...... and proposed specifications of the magnitudes of the extreme external wind conditions are highlighted and discussed using an illustrative example based on two selected terrain types. Copyright © 2008 John Wiley & Sons, Ltd....... gust with direction change and extreme wind direction change. These four extreme external conditions are used in the definition of six of the IEC 61400-1 ultimate load cases. The statistical models are based on simple and easily accessible mean wind speed and turbulence characteristics...

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

Perturbation-Based Regularization for Signal Estimation in Linear Discrete Ill-posed Problems

KAUST Repository

Suliman, Mohamed Abdalla Elhag; Ballal, Tarig; Al-Naffouri, Tareq Y.

2016-01-01

Estimating the values of unknown parameters from corrupted measured data faces a lot of challenges in ill-posed problems. In such problems, many fundamental estimation methods fail to provide a meaningful stabilized solution. In this work, we propose a new regularization approach and a new regularization parameter selection approach for linear least-squares discrete ill-posed problems. The proposed approach is based on enhancing the singular-value structure of the ill-posed model matrix to acquire a better solution. Unlike many other regularization algorithms that seek to minimize the estimated data error, the proposed approach is developed to minimize the mean-squared error of the estimator which is the objective in many typical estimation scenarios. The performance of the proposed approach is demonstrated by applying it to a large set of real-world discrete ill-posed problems. Simulation results demonstrate that the proposed approach outperforms a set of benchmark regularization methods in most cases. In addition, the approach also enjoys the lowest runtime and offers the highest level of robustness amongst all the tested benchmark regularization methods.

Perturbation-Based Regularization for Signal Estimation in Linear Discrete Ill-posed Problems

KAUST Repository

Suliman, Mohamed Abdalla Elhag

2016-11-29

Estimating the values of unknown parameters from corrupted measured data faces a lot of challenges in ill-posed problems. In such problems, many fundamental estimation methods fail to provide a meaningful stabilized solution. In this work, we propose a new regularization approach and a new regularization parameter selection approach for linear least-squares discrete ill-posed problems. The proposed approach is based on enhancing the singular-value structure of the ill-posed model matrix to acquire a better solution. Unlike many other regularization algorithms that seek to minimize the estimated data error, the proposed approach is developed to minimize the mean-squared error of the estimator which is the objective in many typical estimation scenarios. The performance of the proposed approach is demonstrated by applying it to a large set of real-world discrete ill-posed problems. Simulation results demonstrate that the proposed approach outperforms a set of benchmark regularization methods in most cases. In addition, the approach also enjoys the lowest runtime and offers the highest level of robustness amongst all the tested benchmark regularization methods.

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

International Nuclear Information System (INIS)

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

2017-01-01

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

Novel CFT duals for extreme black holes

International Nuclear Information System (INIS)

Chen Bin; Zhang Jiaju

2012-01-01

In this paper, we study the CFT duals for extreme black holes in the stretched horizon formalism. We consider the extremal RN, Kerr-Newman-AdS-dS, as well as the higher dimensional Kerr-AdS-dS black holes. In all these cases, we reproduce the well-established CFT duals. Actually we show that for stationary extreme black holes, the stretched horizon formalism always gives rise to the same dual CFT pictures as the ones suggested by ASG of corresponding near horizon geometries. Furthermore, we propose new CFT duals for 4D Kerr-Newman-AdS-dS and higher dimensional Kerr-AdS-dS black holes. We find that every dual CFT is defined with respect to a rotation in certain angular direction, along which the translation defines a U(1) Killing symmetry. In the presence of two sets of U(1) symmetry, the novel CFT duals are generated by the modular group SL(2,Z), and for n sets of U(1) symmetry there are general CFT duals generated by T-duality group SL(n,Z).

German Value Set for the EQ-5D-5L.

Science.gov (United States)

Ludwig, Kristina; Graf von der Schulenburg, J-Matthias; Greiner, Wolfgang

2018-06-01

The objective of this study was to develop a value set for EQ-5D-5L based on the societal preferences of the German population. As the first country to do so, the study design used the improved EQ-5D-5L valuation protocol 2.0 developed by the EuroQol Group, including a feedback module as internal validation and a quality control process that was missing in the first wave of EQ-5D-5L valuation studies. A representative sample of the general German population (n = 1158) was interviewed using a composite time trade-off and a discrete choice experiment under close quality control. Econometric modeling was used to estimate values for all 3125 possible health states described by EQ-5D-5L. The value set was based on a hybrid model including all available information from the composite time trade-off and discrete choice experiment valuations without any exclusions due to data issues. The final German value set was constructed from a combination of a conditional logit model for the discrete choice experiment data and a censored at -1 Tobit model for the composite time trade-off data, correcting for heteroskedasticity. The value set had logically consistent parameter estimates (p German version of EQ-5D-5L representing the preferences of the German population. The study successfully employed for the first time worldwide the improved protocol 2.0. The value set enables the use of the EQ-5D-5L instrument in economic evaluations and in clinical studies.

Is undifferentiated spondyloarthritis a discrete entity? A debate.

Science.gov (United States)

Deodhar, Atul; Miossec, Pierre; Baraliakos, Xenofon

2018-01-01

The concept of undifferentiated spondyloarthritis has been introduced recently to describe a clinical setting where the classical features of spondyloarthritis (SpA) are not fully present. Whether this is a discrete entity was the basis of a debate during the 4th International Congress on Controversies in Rheumatology & Autoimmunity held in Bologna, Italy 9-11 March 2017. The pro and con aspects of the debate are presented. The implications of the debate are important ranging from diagnostic aspects to consequences for the society and the payers. Copyright © 2017 Elsevier B.V. All rights reserved.

The discrete Fourier transform theory, algorithms and applications

CERN Document Server

Sundaraajan, D

2001-01-01

This authoritative book provides comprehensive coverage of practical Fourier analysis. It develops the concepts right from the basics and gradually guides the reader to the advanced topics. It presents the latest and practically efficient DFT algorithms, as well as the computation of discrete cosine and Walsh-Hadamard transforms. The large number of visual aids such as figures, flow graphs and flow charts makes the mathematical topic easy to understand. In addition, the numerous examples and the set of C-language programs (a supplement to the book) help greatly in understanding the theory and

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

Discrete event simulation for exploring strategies: an urban water management case.

Science.gov (United States)

Huang, Dong-Bin; Scholz, Roland W; Gujer, Willi; Chitwood, Derek E; Loukopoulos, Peter; Schertenleib, Roland; Siegrist, Hansruedi

2007-02-01

This paper presents a model structure aimed at offering an overview of the various elements of a strategy and exploring their multidimensional effects through time in an efficient way. It treats a strategy as a set of discrete events planned to achieve a certain strategic goal and develops a new form of causal networks as an interfacing component between decision makers and environment models, e.g., life cycle inventory and material flow models. The causal network receives a strategic plan as input in a discrete manner and then outputs the updated parameter sets to the subsequent environmental models. Accordingly, the potential dynamic evolution of environmental systems caused by various strategies can be stepwise simulated. It enables a way to incorporate discontinuous change in models for environmental strategy analysis, and enhances the interpretability and extendibility of a complex model by its cellular constructs. It is exemplified using an urban water management case in Kunming, a major city in Southwest China. By utilizing the presented method, the case study modeled the cross-scale interdependencies of the urban drainage system and regional water balance systems, and evaluated the effectiveness of various strategies for improving the situation of Dianchi Lake.

A progressive approach to discrete trial teaching: Some current guidelines

Directory of Open Access Journals (Sweden)

Justin B. Leaf

2016-12-01

Full Text Available Discrete trial teaching (DTT is one of the cornerstones of applied behavior analysis (ABA based interventions. Conventionally, DTT is commonly implemented within a prescribed, fixed manner in which the therapist is governed by a strict set of rules. In contrast to conventional DTT, a progressive approach to DTT allows the therapist to remain flexible, making in-the-moment analyses and changes based on several variables (e.g., individual responding, current and previous history. The present paper will describe some guidelines to a progressive approach to DTT. The guidelines presented here should not be taken as a set of rules or as an exhaustive list.

A Progressive Approach to Discrete Trial Teaching: Some Current Guidelines

Directory of Open Access Journals (Sweden)

Justin B. LEAF

2016-12-01

Full Text Available Discrete trial teaching (DTT is one of the cornerstones of applied behavior analysis (ABA based interventions. Conventionally, DTT is commonly implemented within a prescribed, fixed manner in which the therapist is governed by a strict set of rules. In contrast to conventional DTT, a progressive approach to DTT allows the therapist to remain flexible, making in-the-moment analyses and changes based on several variables (e.g., individual responding, current and previous history. The present paper will describe some guidelines to a progressive approach to DTT. The guidelines presented here should not be taken as a set of rules or as an exhaustive list.

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

Set operads in combinatorics and computer science

CERN Document Server

Méndez, Miguel A

2015-01-01

This monograph has two main objectives. The first one is to give a self-contained exposition of the relevant facts about set operads, in the context of combinatorial species and its operations. This approach has various advantages: one of them is that the definition of combinatorial operations on species, product, sum, substitution and derivative, are simple and natural. They were designed as the set theoretical counterparts of the homonym operations on exponential generating functions, giving an immediate insight on the combinatorial meaning of them. The second objective is more ambitious. Before formulating it, authors present a brief historic account on the sources of decomposition theory. For more than forty years decompositions of discrete structures have been studied in different branches of discrete mathematics: combinatorial optimization, network and graph theory, switching design or boolean functions, simple multi-person games and clutters, etc.

Examining personal values in extreme environment contexts: Revisiting the question of generalizability

Science.gov (United States)

Smith, N.; Sandal, G. M.; Leon, G. R.; Kjærgaard, A.

2017-08-01

Land-based extreme environments (e.g. polar expeditions, Antarctic research stations, confinement chambers) have often been used as analog settings for spaceflight. These settings share similarities with the conditions experienced during space missions, including confinement, isolation and limited possibilities for evacuation. To determine the utility of analog settings for understanding human spaceflight, researchers have examined the extent to which the individual characteristics (e.g., personality) of people operating in extreme environments can be generalized across contexts (Sandal, 2000) [1]. Building on previous work, and utilising new and pre-existing data, the present study examined the extent to which personal value motives could be generalized across extreme environments. Four populations were assessed; mountaineers (N =59), military personnel (N = 25), Antarctic over-winterers (N = 21) and Mars simulation participants (N = 12). All participants completed the Portrait Values Questionnaire (PVQ; Schwartz; 2) capturing information on 10 personal values. Rank scores suggest that all groups identified Self-direction, Stimulation, Universalism and Benevolence as important values and acknowledged Power and Tradition as being low priorities. Results from difference testing suggest the extreme environment groups were most comparable on Self-direction, Stimulation, Benevolence, Tradition and Security. There were significant between-group differences on five of the ten values. Overall, findings pinpointed specific values that may be important for functioning in challenging environments. However, the differences that emerged on certain values highlight the importance of considering the specific population when comparing results across extreme settings. We recommend that further research examine the impact of personal value motives on indicators of adjustment, group working, and performance. Information from such studies could then be used to aid selection and

Robust uniform persistence in discrete and continuous dynamical systems using Lyapunov exponents.

Science.gov (United States)

Salceanu, Paul L

2011-07-01

This paper extends the work of Salceanu and Smith [12, 13] where Lyapunov exponents were used to obtain conditions for uniform persistence ina class of dissipative discrete-time dynamical systems on the positive orthant of R(m), generated by maps. Here a united approach is taken, for both discrete and continuous time, and the dissipativity assumption is relaxed. Sufficient conditions are given for compact subsets of an invariant part of the boundary of R(m+) to be robust uniform weak repellers. These conditions require Lyapunov exponents be positive on such sets. It is shown how this leads to robust uniform persistence. The results apply to the investigation of robust uniform persistence of the disease in host populations, as shown in an application.

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)

Discrete-Feature Model Implementation of SDM-Site Forsmark

Energy Technology Data Exchange (ETDEWEB)

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

2010-03-15

A discrete-feature model (DFM) was implemented for the Forsmark repository site based on the final site descriptive model from surface based investigations. The discrete-feature conceptual model represents deformation zones, individual fractures, and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which, in the present study, is treated as impermeable. This approximation is reasonable for sites in crystalline rock which has very low permeability, apart from that which results from macroscopic fracturing. Models are constructed based on the geological and hydrogeological description of the sites and engineering designs. Hydraulic heads and flows through the network of water-conducting features are calculated by the finite-element method, and are used in turn to simulate migration of non-reacting solute by a particle-tracking method, in order to estimate the properties of pathways by which radionuclides could be released to the biosphere. Stochastic simulation is used to evaluate portions of the model that can only be characterized in statistical terms, since many water-conducting features within the model volume cannot be characterized deterministically. Chapter 2 describes the methodology by which discrete features are derived to represent water-conducting features around the hypothetical repository at Forsmark (including both natural features and features that result from the disturbance of excavation), and then assembled to produce a discrete-feature network model for numerical simulation of flow and transport. Chapter 3 describes how site-specific data and repository design are adapted to produce the discrete-feature model. Chapter 4 presents results of the calculations. These include utilization factors for deposition tunnels based on the emplacement criteria that have been set forth by the implementers, flow distributions to the deposition holes, and calculated properties of discharge paths as well as

Discrete-Feature Model Implementation of SDM-Site Forsmark

International Nuclear Information System (INIS)

Geier, Joel

2010-03-01

A discrete-feature model (DFM) was implemented for the Forsmark repository site based on the final site descriptive model from surface based investigations. The discrete-feature conceptual model represents deformation zones, individual fractures, and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which, in the present study, is treated as impermeable. This approximation is reasonable for sites in crystalline rock which has very low permeability, apart from that which results from macroscopic fracturing. Models are constructed based on the geological and hydrogeological description of the sites and engineering designs. Hydraulic heads and flows through the network of water-conducting features are calculated by the finite-element method, and are used in turn to simulate migration of non-reacting solute by a particle-tracking method, in order to estimate the properties of pathways by which radionuclides could be released to the biosphere. Stochastic simulation is used to evaluate portions of the model that can only be characterized in statistical terms, since many water-conducting features within the model volume cannot be characterized deterministically. Chapter 2 describes the methodology by which discrete features are derived to represent water-conducting features around the hypothetical repository at Forsmark (including both natural features and features that result from the disturbance of excavation), and then assembled to produce a discrete-feature network model for numerical simulation of flow and transport. Chapter 3 describes how site-specific data and repository design are adapted to produce the discrete-feature model. Chapter 4 presents results of the calculations. These include utilization factors for deposition tunnels based on the emplacement criteria that have been set forth by the implementers, flow distributions to the deposition holes, and calculated properties of discharge paths as well as

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

Low-frequency logarithmic discretization of the reservoir spectrum for improving the efficiency of hierarchical equations of motion approach.

Science.gov (United States)

Ye, LvZhou; Zhang, Hou-Dao; Wang, Yao; Zheng, Xiao; Yan, YiJing

2017-08-21

An efficient low-frequency logarithmic discretization (LFLD) scheme for the decomposition of fermionic reservoir spectrum is proposed for the investigation of quantum impurity systems. The scheme combines the Padé spectrum decomposition (PSD) and a logarithmic discretization of the residual part in which the parameters are determined based on an extension of the recently developed minimum-dissipaton ansatz [J. J. Ding et al., J. Chem. Phys. 145, 204110 (2016)]. A hierarchical equations of motion (HEOM) approach is then employed to validate the proposed scheme by examining the static and dynamic system properties in both the Kondo and noninteracting regimes. The LFLD scheme requires a much smaller number of exponential functions than the conventional PSD scheme to reproduce the reservoir correlation function and thus facilitates the efficient implementation of the HEOM approach in extremely low temperature regimes.

A compressed sensing based approach on Discrete Algebraic Reconstruction Technique.

Science.gov (United States)

Demircan-Tureyen, Ezgi; Kamasak, Mustafa E

2015-01-01

Discrete tomography (DT) techniques are capable of computing better results, even using less number of projections than the continuous tomography techniques. Discrete Algebraic Reconstruction Technique (DART) is an iterative reconstruction method proposed to achieve this goal by exploiting a prior knowledge on the gray levels and assuming that the scanned object is composed from a few different densities. In this paper, DART method is combined with an initial total variation minimization (TvMin) phase to ensure a better initial guess and extended with a segmentation procedure in which the threshold values are estimated from a finite set of candidates to minimize both the projection error and the total variation (TV) simultaneously. The accuracy and the robustness of the algorithm is compared with the original DART by the simulation experiments which are done under (1) limited number of projections, (2) limited view problem and (3) noisy projections conditions.

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

Extremely high frequency RF effects on electronics.

Energy Technology Data Exchange (ETDEWEB)

Loubriel, Guillermo Manuel; Vigliano, David; Coleman, Phillip Dale; Williams, Jeffery Thomas; Wouters, Gregg A.; Bacon, Larry Donald; Mar, Alan

2012-01-01

The objective of this work was to understand the fundamental physics of extremely high frequency RF effects on electronics. To accomplish this objective, we produced models, conducted simulations, and performed measurements to identify the mechanisms of effects as frequency increases into the millimeter-wave regime. Our purpose was to answer the questions, 'What are the tradeoffs between coupling, transmission losses, and device responses as frequency increases?', and, 'How high in frequency do effects on electronic systems continue to occur?' Using full wave electromagnetics codes and a transmission-line/circuit code, we investigated how extremely high-frequency RF propagates on wires and printed circuit board traces. We investigated both field-to-wire coupling and direct illumination of printed circuit boards to determine the significant mechanisms for inducing currents at device terminals. We measured coupling to wires and attenuation along wires for comparison to the simulations, looking at plane-wave coupling as it launches modes onto single and multiconductor structures. We simulated the response of discrete and integrated circuit semiconductor devices to those high-frequency currents and voltages, using SGFramework, the open-source General-purpose Semiconductor Simulator (gss), and Sandia's Charon semiconductor device physics codes. This report documents our findings.

Developing a discrete choice experiment in Malawi: eliciting preferences for breast cancer early detection services.

Science.gov (United States)

Kohler, Racquel E; Lee, Clara N; Gopal, Satish; Reeve, Bryce B; Weiner, Bryan J; Wheeler, Stephanie B

2015-01-01

In Malawi, routine breast cancer screening is not available and little is known about women's preferences regarding early detection services. Discrete choice experiments are increasingly used to reveal preferences about new health services; however, selecting appropriate attributes that describe a new health service is imperative to ensure validity of the choice experiment. To identify important factors that are relevant to Malawian women's preferences for breast cancer detection services and to select attributes and levels for a discrete choice experiment in a setting where both breast cancer early detection and choice experiments are rare. We reviewed the literature to establish an initial list of potential attributes and levels for a discrete choice experiment and conducted qualitative interviews with health workers and community women to explore relevant local factors affecting decisions to use cancer detection services. We tested the design through cognitive interviews and refined the levels, descriptions, and designs. Themes that emerged from interviews provided critical information about breast cancer detection services, specifically, that breast cancer interventions should be integrated into other health services because asymptomatic screening may not be practical as an individual service. Based on participants' responses, the final attributes of the choice experiment included travel time, health encounter, health worker type and sex, and breast cancer early detection strategy. Cognitive testing confirmed the acceptability of the final attributes, comprehension of choice tasks, and women's abilities to make trade-offs. Applying a discrete choice experiment for breast cancer early detection was feasible with appropriate tailoring for a low-income, low-literacy African setting.

On the information content of discrete phylogenetic characters.

Science.gov (United States)

Bordewich, Magnus; Deutschmann, Ina Maria; Fischer, Mareike; Kasbohm, Elisa; Semple, Charles; Steel, Mike

2017-12-16

Phylogenetic inference aims to reconstruct the evolutionary relationships of different species based on genetic (or other) data. Discrete characters are a particular type of data, which contain information on how the species should be grouped together. However, it has long been known that some characters contain more information than others. For instance, a character that assigns the same state to each species groups all of them together and so provides no insight into the relationships of the species considered. At the other extreme, a character that assigns a different state to each species also conveys no phylogenetic signal. In this manuscript, we study a natural combinatorial measure of the information content of an individual character and analyse properties of characters that provide the maximum phylogenetic information, particularly, the number of states such a character uses and how the different states have to be distributed among the species or taxa of the phylogenetic tree.

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

Extreme events in total ozone over Arosa – Part 1: Application of extreme value theory

Directory of Open Access Journals (Sweden)

H. E. Rieder

2010-10-01

Full Text Available In this study ideas from extreme value theory are for the first time applied in the field of stratospheric ozone research, because statistical analysis showed that previously used concepts assuming a Gaussian distribution (e.g. fixed deviations from mean values of total ozone data do not adequately address the structure of the extremes. We show that statistical extreme value methods are appropriate to identify ozone extremes and to describe the tails of the Arosa (Switzerland total ozone time series. In order to accommodate the seasonal cycle in total ozone, a daily moving threshold was determined and used, with tools from extreme value theory, to analyse the frequency of days with extreme low (termed ELOs and high (termed EHOs total ozone at Arosa. The analysis shows that the Generalized Pareto Distribution (GPD provides an appropriate model for the frequency distribution of total ozone above or below a mathematically well-defined threshold, thus providing a statistical description of ELOs and EHOs. The results show an increase in ELOs and a decrease in EHOs during the last decades. The fitted model represents the tails of the total ozone data set with high accuracy over the entire range (including absolute monthly minima and maxima, and enables a precise computation of the frequency distribution of ozone mini-holes (using constant thresholds. Analyzing the tails instead of a small fraction of days below constant thresholds provides deeper insight into the time series properties. Fingerprints of dynamical (e.g. ENSO, NAO and chemical features (e.g. strong polar vortex ozone loss, and major volcanic eruptions, can be identified in the observed frequency of extreme events throughout the time series. Overall the new approach to analysis of extremes provides more information on time series properties and variability than previous approaches that use only monthly averages and/or mini-holes and mini-highs.

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.

Parallel discrete event simulation using shared memory

Science.gov (United States)

Reed, Daniel A.; Malony, Allen D.; Mccredie, Bradley D.

1988-01-01

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network 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)

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

Changes in the probability of co-occurring extreme climate events

Science.gov (United States)

Diffenbaugh, N. S.

2017-12-01

Extreme climate events such as floods, droughts, heatwaves, and severe storms exert acute stresses on natural and human systems. When multiple extreme events co-occur, either in space or time, the impacts can be substantially compounded. A diverse set of human interests - including supply chains, agricultural commodities markets, reinsurance, and deployment of humanitarian aid - have historically relied on the rarity of extreme events to provide a geographic hedge against the compounded impacts of co-occuring extremes. However, changes in the frequency of extreme events in recent decades imply that the probability of co-occuring extremes is also changing, and is likely to continue to change in the future in response to additional global warming. This presentation will review the evidence for historical changes in extreme climate events and the response of extreme events to continued global warming, and will provide some perspective on methods for quantifying changes in the probability of co-occurring extremes in the past and future.

Quantitative release planning in extreme programming

NARCIS (Netherlands)

van Valkenhoef, Gert; Tervonen, Tommi; de Brock, Bert; Postmus, Douwe

Context: Extreme Programming (XP) is one of the most popular agile software development methodologies. XP is defined as a consistent set of values and practices designed to work well together, but lacks practices for project management and especially for supporting the customer role. The customer

Quantitative release planning in extreme programming

NARCIS (Netherlands)

van Valkenhoef, Gert; Tervonen, Tommi; de Brock, Bert; Postmus, Douwe

2011-01-01

Context: Extreme Programming (XP) is one of the most popular agile software development methodologies. XP is defined as a consistent set of values and practices designed to work well together, but lacks practices for project management and especially for supporting the customer role. The customer

Extreme Programming: Maestro Style

Science.gov (United States)

Norris, Jeffrey; Fox, Jason; Rabe, Kenneth; Shu, I-Hsiang; Powell, Mark

2009-01-01

"Extreme Programming: Maestro Style" is the name of a computer programming methodology that has evolved as a custom version of a methodology, called extreme programming that has been practiced in the software industry since the late 1990s. The name of this version reflects its origin in the work of the Maestro team at NASA's Jet Propulsion Laboratory that develops software for Mars exploration missions. Extreme programming is oriented toward agile development of software resting on values of simplicity, communication, testing, and aggressiveness. Extreme programming involves use of methods of rapidly building and disseminating institutional knowledge among members of a computer-programming team to give all the members a shared view that matches the view of the customers for whom the software system is to be developed. Extreme programming includes frequent planning by programmers in collaboration with customers, continually examining and rewriting code in striving for the simplest workable software designs, a system metaphor (basically, an abstraction of the system that provides easy-to-remember software-naming conventions and insight into the architecture of the system), programmers working in pairs, adherence to a set of coding standards, collaboration of customers and programmers, frequent verbal communication, frequent releases of software in small increments of development, repeated testing of the developmental software by both programmers and customers, and continuous interaction between the team and the customers. The environment in which the Maestro team works requires the team to quickly adapt to changing needs of its customers. In addition, the team cannot afford to accept unnecessary development risk. Extreme programming enables the Maestro team to remain agile and provide high-quality software and service to its customers. However, several factors in the Maestro environment have made it necessary to modify some of the conventional extreme

Evaluation of satellite-retrieved extreme precipitation using gauge observations

Science.gov (United States)

Lockhoff, M.; Zolina, O.; Simmer, C.; Schulz, J.

2012-04-01

Precipitation extremes have already been intensively studied employing rain gauge datasets. Their main advantage is that they represent a direct measurement with a relatively high temporal coverage. Their main limitation however is their poor spatial coverage and thus a low representativeness in many parts of the world. In contrast, satellites can provide global coverage and there are meanwhile data sets available that are on one hand long enough to be used for extreme value analysis and that have on the other hand the necessary spatial and temporal resolution to capture extremes. However, satellite observations provide only an indirect mean to determine precipitation and there are many potential observational and methodological weaknesses in particular over land surfaces that may constitute doubts concerning their usability for the analysis of precipitation extremes. By comparing basic climatological metrics of precipitation (totals, intensities, number of wet days) as well as respective characteristics of PDFs, absolute and relative extremes of satellite and observational data this paper aims at assessing to which extent satellite products are suitable for analysing extreme precipitation events. In a first step the assessment focuses on Europe taking into consideration various satellite products available, e.g. data sets provided by the Global Precipitation Climatology Project (GPCP). First results indicate that satellite-based estimates do not only represent the monthly averaged precipitation very similar to rain gauge estimates but they also capture the day-to-day occurrence fairly well. Larger differences can be found though when looking at the corresponding intensities.

Special relativity with a discrete spectrum of singular velocities

International Nuclear Information System (INIS)

Gonzales Gascon, F.

1977-01-01

The introduction of real transformation formulae containing a whole discrete spectrum of singularities is suggested. Some phenomenological hypotheses are introduced and the group property is substituted by weaker conditions. The first singular speed (c 1 =c) is invariant with respect to the measures of it from subluminal frames, but the remaining speeds are not invariant. The proposed transformations do not form a closed set (for the superluminal speeds) and, therefore, the problem of having (within this framework) a principle of relativity valid for any velocity remains open

Identification of discrete vascular lesions in the extremities using post-mortem computed tomography angiography – Case reports

NARCIS (Netherlands)

Haakma, Wieke; Rohde, Marianne; Uhrenholt, Lars; Pedersen, Michael; Boel, Lene Warner Thorup

2017-01-01

In this case report, we introduced post-mortem computed tomography angiography (PMCTA) in three cases suffering from vascular lesions in the upper extremities. In each subject, the third part of the axillary arteries and veins were used to catheterize the arms. The vessels were filled with a barium

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

Assessing the ability of operational snow models to predict snowmelt runoff extremes (Invited)

Science.gov (United States)

Wood, A. W.; Restrepo, P. J.; Clark, M. P.

2013-12-01

In the western US, the snow accumulation and melt cycle of winter and spring plays a critical role in the region's water management strategies. Consequently, the ability to predict snowmelt runoff at time scales from days to seasons is a key input for decisions in reservoir management, whether for avoiding flood hazards or supporting environmental flows through the scheduling of releases in spring, or for allocating releases for multi-state water distribution in dry seasons of year (using reservoir systems to provide an invaluable buffer for many sectors against drought). Runoff forecasts thus have important benefits at both wet and dry extremes of the climatological spectrum. The importance of the prediction of the snow cycle motivates an assessment of the strengths and weaknesses of the US's central operational snow model, SNOW17, in contrast to process-modeling alternatives, as they relate to simulating observed snowmelt variability and extremes. To this end, we use a flexible modeling approach that enables an investigation of different choices in model structure, including model physics, parameterization and degree of spatiotemporal discretization. We draw from examples of recent extreme events in western US watersheds and an overall assessment of retrospective model performance to identify fruitful avenues for advancing the modeling basis for the operational prediction of snow-related runoff extremes.

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.

Hidden conformal symmetry of extremal black holes

International Nuclear Information System (INIS)

Chen Bin; Long Jiang; Zhang Jiaju

2010-01-01

We study the hidden conformal symmetry of extremal black holes. We introduce a new set of conformal coordinates to write the SL(2,R) generators. We find that the Laplacian of the scalar field in many extremal black holes, including Kerr(-Newman), Reissner-Nordstrom, warped AdS 3 , and null warped black holes, could be written in terms of the SL(2,R) quadratic Casimir. This suggests that there exist dual conformal field theory (CFT) descriptions of these black holes. From the conformal coordinates, the temperatures of the dual CFTs could be read directly. For the extremal black hole, the Hawking temperature is vanishing. Correspondingly, only the left (right) temperature of the dual CFT is nonvanishing, and the excitations of the other sector are suppressed. In the probe limit, we compute the scattering amplitudes of the scalar off the extremal black holes and find perfect agreement with the CFT prediction.

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…

Discretization analysis of bifurcation based nonlinear amplifiers

Science.gov (United States)

Feldkord, Sven; Reit, Marco; Mathis, Wolfgang

2017-09-01

Recently, for modeling biological amplification processes, nonlinear amplifiers based on the supercritical Andronov-Hopf bifurcation have been widely analyzed analytically. For technical realizations, digital systems have become the most relevant systems in signal processing applications. The underlying continuous-time systems are transferred to the discrete-time domain using numerical integration methods. Within this contribution, effects on the qualitative behavior of the Andronov-Hopf bifurcation based systems concerning numerical integration methods are analyzed. It is shown exemplarily that explicit Runge-Kutta methods transform the truncated normalform equation of the Andronov-Hopf bifurcation into the normalform equation of the Neimark-Sacker bifurcation. Dependent on the order of the integration method, higher order terms are added during this transformation.A rescaled normalform equation of the Neimark-Sacker bifurcation is introduced that allows a parametric design of a discrete-time system which corresponds to the rescaled Andronov-Hopf system. This system approximates the characteristics of the rescaled Hopf-type amplifier for a large range of parameters. The natural frequency and the peak amplitude are preserved for every set of parameters. The Neimark-Sacker bifurcation based systems avoid large computational effort that would be caused by applying higher order integration methods to the continuous-time normalform equations.

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.

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

Invariant object recognition based on the generalized discrete radon transform

Science.gov (United States)

Easley, Glenn R.; Colonna, Flavia

2004-04-01

We introduce a method for classifying objects based on special cases of the generalized discrete Radon transform. We adjust the transform and the corresponding ridgelet transform by means of circular shifting and a singular value decomposition (SVD) to obtain a translation, rotation and scaling invariant set of feature vectors. We then use a back-propagation neural network to classify the input feature vectors. We conclude with experimental results and compare these with other invariant recognition methods.

Characterization of the Nencki Affective Picture System by discrete emotional categories (NAPS BE).

Science.gov (United States)

Riegel, Monika; Żurawski, Łukasz; Wierzba, Małgorzata; Moslehi, Abnoss; Klocek, Łukasz; Horvat, Marko; Grabowska, Anna; Michałowski, Jarosław; Jednoróg, Katarzyna; Marchewka, Artur

2016-06-01

The Nencki Affective Picture System (NAPS; Marchewka, Żurawski, Jednoróg, & Grabowska, Behavior Research Methods, 2014) is a standardized set of 1,356 realistic, high-quality photographs divided into five categories (people, faces, animals, objects, and landscapes). NAPS has been primarily standardized along the affective dimensions of valence, arousal, and approach-avoidance, yet the characteristics of discrete emotions expressed by the images have not been investigated thus far. The aim of the present study was to collect normative ratings according to categorical models of emotions. A subset of 510 images from the original NAPS set was selected in order to proportionally cover the whole dimensional affective space. Among these, using three available classification methods, we identified images eliciting distinguishable discrete emotions. We introduce the basic-emotion normative ratings for the Nencki Affective Picture System (NAPS BE), which will allow researchers to control and manipulate stimulus properties specifically for their experimental questions of interest. The NAPS BE system is freely accessible to the scientific community for noncommercial use as supplementary materials to this article.

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.

Opacity calculations for extreme physical systems: code RACHEL

Science.gov (United States)

Drska, Ladislav; Sinor, Milan

1996-08-01

Computer simulations of physical systems under extreme conditions (high density, temperature, etc.) require the availability of extensive sets of atomic data. This paper presents basic information on a self-consistent approach to calculations of radiative opacity, one of the key characteristics of such systems. After a short explanation of general concepts of the atomic physics of extreme systems, the structure of the opacity code RACHEL is discussed and some of its applications are presented.

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.

A discrete-choice model with social interactions : With an application to high school teen behavior

NARCIS (Netherlands)

Soetevent, Adriaan R.; Kooreman, Peter

2007-01-01

We develop an empirical discrete-choice interaction model with a finite number of agents. We characterize its equilibrium properties-in particular the correspondence between interaction strength, number of agents, and the set of equilibria-and propose to estimate the model by means of simulation

A discrete choice model with social interactions; with an application to high school teen behavior

NARCIS (Netherlands)

Soetevent, Adriaan R.; Kooreman, Peter

2004-01-01

We develop an empirical discrete choice interaction model with a finite number of agents. We characterize its equilibrium properties - in particular the correspondence between the interaction strength, the number of agents, and the set of equilibria - and propose to estimate the model by means of

A discrete choice model with social interactions; with an application to high school teen behavior

NARCIS (Netherlands)

Soetevent, A.R.; Kooreman, P.

2007-01-01

We develop an empirical discrete-choice interaction model with a finite number of agents. We characterize its equilibrium properties - in particular the correspondence between interaction strength, number of agents, and the set of equilibria - and propose to estimate the model by means of simulation

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.

Extreme-value dependence: An application to exchange rate markets

Science.gov (United States)

Fernandez, Viviana

2007-04-01

Extreme value theory (EVT) focuses on modeling the tail behavior of a loss distribution using only extreme values rather than the whole data set. For a sample of 10 countries with dirty/free float regimes, we investigate whether paired currencies exhibit a pattern of asymptotic dependence. That is, whether an extremely large appreciation or depreciation in the nominal exchange rate of one country might transmit to another. In general, after controlling for volatility clustering and inertia in returns, we do not find evidence of extreme-value dependence between paired exchange rates. However, for asymptotic-independent paired returns, we find that tail dependency of exchange rates is stronger under large appreciations than under large depreciations.

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

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

The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS

Directory of Open Access Journals (Sweden)

Stephan Friedrichs

2016-05-01

Full Text Available In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP we are given an $x$-monotone chain of line segments in $R^2$ (the terrain $T$, and ask for the minimum number of guards (located anywhere on $T$ required to guard all of $T$. We construct guard candidate and witness sets $G, W \\subset T$ of polynomial size such that any feasible (optimal guard cover $G^* \\subseteq G$ for $W$ is also feasible (optimal for the continuous TGP. This discretization allows us to: (1 settle NP-completeness for the continuous TGP; (2 provide a Polynomial Time Approximation Scheme (PTAS for the continuous TGP using the PTAS for the discrete TGP by Gibson et al.; (3 formulate the continuous TGP as an Integer Linear Program (IP. Furthermore, we propose several filtering techniques reducing the size of our discretization, allowing us to devise an efficient IP-based algorithm that reliably provides optimal guard placements for terrains with up to $10^6$ vertices within minutes on a standard desktop computer.

Hydraulic tomography of discrete networks of conduits and fractures in a karstic aquifer by using a deterministic inversion algorithm

Science.gov (United States)

Fischer, P.; Jardani, A.; Lecoq, N.

2018-02-01

In this paper, we present a novel inverse modeling method called Discrete Network Deterministic Inversion (DNDI) for mapping the geometry and property of the discrete network of conduits and fractures in the karstified aquifers. The DNDI algorithm is based on a coupled discrete-continuum concept to simulate numerically water flows in a model and a deterministic optimization algorithm to invert a set of observed piezometric data recorded during multiple pumping tests. In this method, the model is partioned in subspaces piloted by a set of parameters (matrix transmissivity, and geometry and equivalent transmissivity of the conduits) that are considered as unknown. In this way, the deterministic optimization process can iteratively correct the geometry of the network and the values of the properties, until it converges to a global network geometry in a solution model able to reproduce the set of data. An uncertainty analysis of this result can be performed from the maps of posterior uncertainties on the network geometry or on the property values. This method has been successfully tested for three different theoretical and simplified study cases with hydraulic responses data generated from hypothetical karstic models with an increasing complexity of the network geometry, and of the matrix heterogeneity.

Performance of Portable Ventilators Following Storage at Temperature Extremes.

Science.gov (United States)

Blakeman, Thomas C; Rodriquez, Dario; Britton, Tyler J; Johannigman, Jay A; Petro, Michael C; Branson, Richard D

2016-05-01

In the current theater of operation, medical devices are often shipped and stored at ambient conditions. The effect of storage at hot and cold temperature extremes on ventilator performance is unknown. We evaluated three portable ventilators currently in use or being evaluated for use by the Department of Defense (731, Impact Instrumentation; T1, Hamilton Medical; and Revel, CareFusion) at temperature extremes in a laboratory setting. The ventilators were stored at temperatures of 60°C and -35°C for 24 hours and were allowed to acclimate to room temperature for 30 minutes before evaluation. The T1 required an extra 15 to 30 minutes of acclimation to room temperature before the ventilator would deliver breaths. All delivered tidal volumes at room temperature and after storage at temperature extremes were less than the ±10% American Society for Testing and Materials standard with the Revel. Delivered tidal volumes at the pediatric settings were less than the ±10% threshold after storage at both temperatures and at room temperature with the 731. Storage at extreme temperature affected the performance of the portable ventilators tested. This study showed that portable ventilators may need an hour or more of acclimation time at room temperature after storage at temperature extremes to operate as intended. Reprint & Copyright © 2016 Association of Military Surgeons of the U.S.

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.

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

Theory and computation of disturbance invariant sets for discrete-time linear systems

Directory of Open Access Journals (Sweden)

Ilya Kolmanovsky

1998-01-01

. One purpose of the paper is to unite and extend in a rigorous way disparate results from the prior literature. In addition there are entirely new results. Specific contributions include: exploitation of the Pontryagin set difference to clarify conceptual matters and simplify mathematical developments, special properties of maximal invariant sets and conditions for their finite determination, algorithms for generating concrete representations of maximal invariant sets, practical computational questions, extension of the main results to general Lyapunov stable systems, applications of the computational techniques to the bounding of state and output response. Results on Lyapunov stable systems are applied to the implementation of a logic-based, nonlinear multimode regulator. For plants with disturbance inputs and state-control constraints it enlarges the constraint-admissible domain of attraction. Numerical examples illustrate the various theoretical and computational results.

Optimal structural inference of signaling pathways from unordered and overlapping gene sets.

Science.gov (United States)

Acharya, Lipi R; Judeh, Thair; Wang, Guangdi; Zhu, Dongxiao

2012-02-15

A plethora of bioinformatics analysis has led to the discovery of numerous gene sets, which can be interpreted as discrete measurements emitted from latent signaling pathways. Their potential to infer signaling pathway structures, however, has not been sufficiently exploited. Existing methods accommodating discrete data do not explicitly consider signal cascading mechanisms that characterize a signaling pathway. Novel computational methods are thus needed to fully utilize gene sets and broaden the scope from focusing only on pairwise interactions to the more general cascading events in the inference of signaling pathway structures. We propose a gene set based simulated annealing (SA) algorithm for the reconstruction of signaling pathway structures. A signaling pathway structure is a directed graph containing up to a few hundred nodes and many overlapping signal cascades, where each cascade represents a chain of molecular interactions from the cell surface to the nucleus. Gene sets in our context refer to discrete sets of genes participating in signal cascades, the basic building blocks of a signaling pathway, with no prior information about gene orderings in the cascades. From a compendium of gene sets related to a pathway, SA aims to search for signal cascades that characterize the optimal signaling pathway structure. In the search process, the extent of overlap among signal cascades is used to measure the optimality of a structure. Throughout, we treat gene sets as random samples from a first-order Markov chain model. We evaluated the performance of SA in three case studies. In the first study conducted on 83 KEGG pathways, SA demonstrated a significantly better performance than Bayesian network methods. Since both SA and Bayesian network methods accommodate discrete data, use a 'search and score' network learning strategy and output a directed network, they can be compared in terms of performance and computational time. In the second study, we compared SA and

A comparison of extreme rainfall characteristics in the Brazilian Amazon derived from two gridded data sets and a national rain gauge network

Science.gov (United States)

Clarke, Robin T.; Bulhoes Mendes, Carlos Andre; Costa Buarque, Diogo

2010-07-01

Two issues of particular importance for the Amazon watershed are: whether annual maxima obtained from reanalysis and raingauge records agree well enough for the former to be useful in extending records of the latter; and whether reported trends in Amazon annual rainfall are reflected in the behavior of annual extremes in precipitation estimated from reanalyses and raingauge records. To explore these issues, three sets of daily precipitation data (1979-2001) from the Brazilian Amazon were analyzed (NCEP/NCAR and ERA-40 reanalyses, and records from the raingauge network of the Brazilian water resources agency - ANA), using the following variables: (1) mean annual maximum precipitation totals, accumulated over one, two, three and five days; (2) linear trends in these variables; (3) mean length of longest within-year "dry" spell; (4) linear trends in these variables. Comparisons between variables obtained from all three data sources showed that reanalyses underestimated time-trends and mean annual maximum precipitation (over durations of one to five days), and the correlations between reanalysis and spatially-interpolated raingauge estimates were small for these two variables. Both reanalyses over-estimated mean lengths of dry period relative to the mean length recorded by the raingauge network. Correlations between the trends calculated from all three data sources were small. Time-trends averaged over the reanalysis grid-squares, and spatially-interpolated time trends from raingauge data, were all clustered around zero. In conclusion, although the NCEP/NCAR and ERA-40 gridded data-sets may be valuable for studies of inter-annual variability in precipitation totals, they were found to be inappropriate for analysis of precipitation extremes.

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.

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.

Extreme climatic events constrain space use and survival of a ground-nesting bird.

Science.gov (United States)

Tanner, Evan P; Elmore, R Dwayne; Fuhlendorf, Samuel D; Davis, Craig A; Dahlgren, David K; Orange, Jeremy P

2017-05-01

Two fundamental issues in ecology are understanding what influences the distribution and abundance of organisms through space and time. While it is well established that broad-scale patterns of abiotic and biotic conditions affect organisms' distributions and population fluctuations, discrete events may be important drivers of space use, survival, and persistence. These discrete extreme climatic events can constrain populations and space use at fine scales beyond that which is typically measured in ecological studies. Recently, a growing body of literature has identified thermal stress as a potential mechanism in determining space use and survival. We sought to determine how ambient temperature at fine temporal scales affected survival and space use for a ground-nesting quail species (Colinus virginianus; northern bobwhite). We modeled space use across an ambient temperature gradient (ranging from -20 to 38 °C) through a maxent algorithm. We also used Andersen-Gill proportional hazard models to assess the influence of ambient temperature-related variables on survival through time. Estimated available useable space ranged from 18.6% to 57.1% of the landscape depending on ambient temperature. The lowest and highest ambient temperature categories (35 °C, respectively) were associated with the least amount of estimated useable space (18.6% and 24.6%, respectively). Range overlap analysis indicated dissimilarity in areas where Colinus virginianus were restricted during times of thermal extremes (range overlap = 0.38). This suggests that habitat under a given condition is not necessarily a habitat under alternative conditions. Further, we found survival was most influenced by weekly minimum ambient temperatures. Our results demonstrate that ecological constraints can occur along a thermal gradient and that understanding the effects of these discrete events and how they change over time may be more important to conservation of organisms than are average and broad

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

Developing a discrete choice experiment in Malawi: eliciting preferences for breast cancer early detection services

Directory of Open Access Journals (Sweden)

Kohler RE

2015-10-01

Full Text Available Racquel E Kohler,1 Clara N Lee,2 Satish Gopal,3 Bryce B Reeve,1 Bryan J Weiner,1 Stephanie B Wheeler11Department of Health Policy and Management, Gillings School of Global Public Health, 2Lineberger Comprehensive Cancer Center, University of North Carolina at Chapel Hill, Chapel Hill, NC, USA; 3UNC Project-Malawi, Tidziwe Center, Lilongwe, MalawiBackground: In Malawi, routine breast cancer screening is not available and little is known about women’s preferences regarding early detection services. Discrete choice experiments are increasingly used to reveal preferences about new health services; however, selecting appropriate attributes that describe a new health service is imperative to ensure validity of the choice experiment.Objective: To identify important factors that are relevant to Malawian women’s preferences for breast cancer detection services and to select attributes and levels for a discrete choice experiment in a setting where both breast cancer early detection and choice experiments are rare.Methods: We reviewed the literature to establish an initial list of potential attributes and levels for a discrete choice experiment and conducted qualitative interviews with health workers and community women to explore relevant local factors affecting decisions to use cancer detection services. We tested the design through cognitive interviews and refined the levels, descriptions, and designs.Results: Themes that emerged from interviews provided critical information about breast cancer detection services, specifically, that breast cancer interventions should be integrated into other health services because asymptomatic screening may not be practical as an individual service. Based on participants’ responses, the final attributes of the choice experiment included travel time, health encounter, health worker type and sex, and breast cancer early detection strategy. Cognitive testing confirmed the acceptability of the final attributes

Dynamical Properties of Discrete-Time Background Neural Networks with Uniform Firing Rate

Directory of Open Access Journals (Sweden)

Min Wan

2013-01-01

Full Text Available The dynamics of a discrete-time background network with uniform firing rate and background input is investigated. The conditions for stability are firstly derived. An invariant set is then obtained so that the nondivergence of the network can be guaranteed. In the invariant set, it is proved that all trajectories of the network starting from any nonnegative value will converge to a fixed point under some conditions. In addition, bifurcation and chaos are discussed. It is shown that the network can engender bifurcation and chaos with the increase of background input. The computations of Lyapunov exponents confirm the chaotic behaviors.

Inferring network structure in non-normal and mixed discrete-continuous genomic data.

Science.gov (United States)

Bhadra, Anindya; Rao, Arvind; Baladandayuthapani, Veerabhadran

2018-03-01

Inferring dependence structure through undirected graphs is crucial for uncovering the major modes of multivariate interaction among high-dimensional genomic markers that are potentially associated with cancer. Traditionally, conditional independence has been studied using sparse Gaussian graphical models for continuous data and sparse Ising models for discrete data. However, there are two clear situations when these approaches are inadequate. The first occurs when the data are continuous but display non-normal marginal behavior such as heavy tails or skewness, rendering an assumption of normality inappropriate. The second occurs when a part of the data is ordinal or discrete (e.g., presence or absence of a mutation) and the other part is continuous (e.g., expression levels of genes or proteins). In this case, the existing Bayesian approaches typically employ a latent variable framework for the discrete part that precludes inferring conditional independence among the data that are actually observed. The current article overcomes these two challenges in a unified framework using Gaussian scale mixtures. Our framework is able to handle continuous data that are not normal and data that are of mixed continuous and discrete nature, while still being able to infer a sparse conditional sign independence structure among the observed data. Extensive performance comparison in simulations with alternative techniques and an analysis of a real cancer genomics data set demonstrate the effectiveness of the proposed approach. © 2017, The International Biometric Society.

Penalized linear regression for discrete ill-posed problems: A hybrid least-squares and mean-squared error approach

KAUST Repository

Suliman, Mohamed Abdalla Elhag

2016-12-19

This paper proposes a new approach to find the regularization parameter for linear least-squares discrete ill-posed problems. In the proposed approach, an artificial perturbation matrix with a bounded norm is forced into the discrete ill-posed model matrix. This perturbation is introduced to enhance the singular-value (SV) structure of the matrix and hence to provide a better solution. The proposed approach is derived to select the regularization parameter in a way that minimizes the mean-squared error (MSE) of the estimator. Numerical results demonstrate that the proposed approach outperforms a set of benchmark methods in most cases when applied to different scenarios of discrete ill-posed problems. Jointly, the proposed approach enjoys the lowest run-time and offers the highest level of robustness amongst all the tested methods.

Integrable lattices and their sublattices: From the discrete Moutard (discrete Cauchy-Riemann) 4-point equation to the self-adjoint 5-point scheme

International Nuclear Information System (INIS)

Doliwa, A.; Grinevich, P.; Nieszporski, M.; Santini, P. M.

2007-01-01

We present the sublattice approach, a procedure to generate, from a given integrable lattice, a sublattice which inherits its integrability features. We consider, as illustrative example of this approach, the discrete Moutard 4-point equation and its sublattice, the self-adjoint 5-point scheme on the star of the square lattice, which are relevant in the theory of the integrable discrete geometries and in the theory of discrete holomorphic and harmonic functions (in this last context, the discrete Moutard equation is called discrete Cauchy-Riemann equation). Therefore an integrable, at one energy, discretization of elliptic two-dimensional operators is considered. We use the sublattice point of view to derive, from the Darboux transformations and superposition formulas of the discrete Moutard equation, the Darboux transformations and superposition formulas of the self-adjoint 5-point scheme. We also construct, from algebro-geometric solutions of the discrete Moutard equation, algebro-geometric solutions of the self-adjoint 5-point scheme. In particular, we show that the corresponding restrictions on the finite-gap data are of the same type as those for the fixed energy problem for the two-dimensional Schroedinger operator. We finally use these solutions to construct explicit examples of discrete holomorphic and harmonic functions, as well as examples of quadrilateral surfaces in R 3

Exponential stability result for discrete-time stochastic fuzzy uncertain neural networks

International Nuclear Information System (INIS)

Mathiyalagan, K.; Sakthivel, R.; Marshal Anthoni, S.

2012-01-01

This Letter addresses the stability analysis problem for a class of uncertain discrete-time stochastic fuzzy neural networks (DSFNNs) with time-varying delays. By constructing a new Lyapunov–Krasovskii functional combined with the free weighting matrix technique, a new set of delay-dependent sufficient conditions for the robust exponential stability of the considered DSFNNs is established in terms of Linear Matrix Inequalities (LMIs). Finally, numerical examples with simulation results are provided to illustrate the applicability and usefulness of the obtained theory. -- Highlights: ► Applications of neural networks require the knowledge of dynamic behaviors. ► Exponential stability of discrete-time stochastic fuzzy neural networks is studied. ► Linear matrix inequality optimization approach is used to obtain the result. ► Delay-dependent stability criterion is established in terms of LMIs. ► Examples with simulation are provided to show the effectiveness of the result.

A note on identification in discrete choice models with partial observability

DEFF Research Database (Denmark)

Fosgerau, Mogens; Ranjan, Abhishek

2017-01-01

This note establishes a new identification result for additive random utility discrete choice models. A decision-maker associates a random utility Uj+ mj to each alternative in a finite set j∈ {1 , … , J} , where U= {U1, … , UJ} is unobserved by the researcher and random with an unknown joint dis...... for applications where choices are observed aggregated into groups while prices and attributes vary at the level of individual alternatives....

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

Study of the performance of collision short time approximation for neutron scattering using discrete frequency distribution

International Nuclear Information System (INIS)

D'Oliveira, A.B.; Amorim, E.S. do; Galvao, O.B.

1981-03-01

Double differential cross sections for thermal neutrons, based on incoherent approximation, using continum distribution as discrete frequency set are theoretically estimated, regarding two models previously done. The FASTT computer program is used in order to obtain a numerical estimation. (L.C.) [pt

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.

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

Is prescribed lower extremity weight-bearing status after geriatric lower extremity trauma associated with increased mortality?

Science.gov (United States)

Gitajn, Ida Leah; Connelly, Daniel; Mascarenhas, Daniel; Breazeale, Stephen; Berger, Peter; Schoonover, Carrie; Martin, Brook; O'Toole, Robert V; Pensy, Raymond; Sciadini, Marcus

2018-02-01

Evaluate whether mortality after discharge is elevated in geriatric fracture patients whose lower extremity weight-bearing is restricted. Retrospective cohort study SETTING: Urban Level 1 trauma center PATIENTS/PARTICIPANTS: 1746 patients >65 years of age INTERVENTION: Post-operative lower extremity weight-bearing status MAIN OUTCOME MEASURE: Mortality, as determined by the Social Security Death Index RESULTS: Univariate analysis demonstrated that patients who were weight-bearing as tolerated on bilateral lower extremities (BLE) had significantly higher 5-year mortality compared to patients with restricted weight-bearing on one lower extremity and restricted weight-bearing on BLE (30%, 21% and 22% respectively, p bearing as tolerated on BLE, restricted weight-bearing on one lower extremity had a hazard ratio (HR) of 0.97 (95% confidence interval 0.78 to 1.20, p = 0.76) and restricted weight-bearing in BLE had a HR of 0.91 (95% confidence interval 0.60 to 1.36, p = 0.73). In geriatric patients, prescribed weight-bearing status did not have a statistically significant association with mortality after discharge, when controlling for age, sex, body mass index, medical comorbidities, Injury Severity Scale (ISS), mechanism of injury, nonoperative treatment and admission GCS. This remained true in when the analysis was restricted to operative injuries only. Copyright © 2017 Elsevier Ltd. All rights reserved.

Application of an efficient Bayesian discretization method to biomedical data

Directory of Open Access Journals (Sweden)

Gopalakrishnan Vanathi

2011-07-01

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

Neutrino oscillations in discrete-time quantum walk framework

Energy Technology Data Exchange (ETDEWEB)

Mallick, Arindam; Mandal, Sanjoy; Chandrashekar, C.M. [C. I. T. Campus, The Institute of Mathematical Sciences, Chennai (India); Homi Bhabha National Institute, Training School Complex, Mumbai (India)

2017-02-15

Here we present neutrino oscillation in the framework of quantum walks. Starting from a one spatial dimensional discrete-time quantum walk we present a scheme of evolutions that will simulate neutrino oscillation. The set of quantum walk parameters which is required to reproduce the oscillation probability profile obtained in both, long range and short range neutrino experiment is explicitly presented. Our scheme to simulate three-generation neutrino oscillation from quantum walk evolution operators can be physically realized in any low energy experimental set-up with access to control a single six-level system, a multiparticle three-qubit or a qubit-qutrit system. We also present the entanglement between spins and position space, during neutrino propagation that will quantify the wave function delocalization around instantaneous average position of the neutrino. This work will contribute towards understanding neutrino oscillation in the framework of the quantum information perspective. (orig.)

Comparison of the auxiliary function method and the discrete-ordinate method for solving the radiative transfer equation for light scattering.

Science.gov (United States)

da Silva, Anabela; Elias, Mady; Andraud, Christine; Lafait, Jacques

2003-12-01

Two methods for solving the radiative transfer equation are compared with the aim of computing the angular distribution of the light scattered by a heterogeneous scattering medium composed of a single flat layer or a multilayer. The first method [auxiliary function method (AFM)], recently developed, uses an auxiliary function and leads to an exact solution; the second [discrete-ordinate method (DOM)] is based on the channel concept and needs an angular discretization. The comparison is applied to two different media presenting two typical and extreme scattering behaviors: Rayleigh and Mie scattering with smooth or very anisotropic phase functions, respectively. A very good agreement between the predictions of the two methods is observed in both cases. The larger the number of channels used in the DOM, the better the agreement. The principal advantages and limitations of each method are also listed.

Survival of extremely low-birth-weight infants

African Journals Online (AJOL)

Survival of extremely low-birth-weight (ELBW) infants in a resource-limited public hospital setting is still low in South. Africa. is study aimed ... Mortality as a result of prematurity is the major contributor to .... reported from a large cohort study that.

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

Uncertainty representation of grey numbers and grey sets.

Science.gov (United States)

Yang, Yingjie; Liu, Sifeng; John, Robert

2014-09-01

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

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.

Identifying nuclear power plant transients using the Discrete Binary Artificial Bee Colony (DBABC) algorithm

Energy Technology Data Exchange (ETDEWEB)

Oliveira, Iona M.S. de; Schirru, Roberto, E-mail: ioliveira@con.ufrj.br, E-mail: schirru@lmp.ufrj.br [Coordenacoa dos Programas de Pos-Graduacao em Engenharia (UFRJ/PEN/COPPE), Rio de Janeiro, RJ (Brazil). Programa de Engenharia Nuclear

2011-07-01

The identification of possible transients in a nuclear power plant is a highly relevant problem. This is mainly due to the fact that the operation of a nuclear power plant involves a large number of state variables whose behaviors are extremely dynamic. In risk situations, besides the huge cognitive overload that operators are submitted to, there is also the problem related with the considerable decrease in the effective time for correct decision making. To minimize these problems and help operators to make the corrective actions in due time, this paper presents a new contribution in this area and introduces an experimental transient identification system based exclusively on the abilities of the Discrete Binary Artificial Bee Colony (DBABC) algorithm to find the best centroid positions that correctly identifies a transient in a nuclear power plant. The DBABC is a reworking of the Artificial Bee Colony (ABC) algorithm which presents the advantage of operating in both continuous and discrete search spaces. Through the analysis of experimental results, the effective performance of the proposed DBABC algorithm is shown against some well known best performing algorithms from the literature. (author)

Identifying nuclear power plant transients using the Discrete Binary Artificial Bee Colony (DBABC) algorithm

International Nuclear Information System (INIS)

Oliveira, Iona M.S. de; Schirru, Roberto

2011-01-01

The identification of possible transients in a nuclear power plant is a highly relevant problem. This is mainly due to the fact that the operation of a nuclear power plant involves a large number of state variables whose behaviors are extremely dynamic. In risk situations, besides the huge cognitive overload that operators are submitted to, there is also the problem related with the considerable decrease in the effective time for correct decision making. To minimize these problems and help operators to make the corrective actions in due time, this paper presents a new contribution in this area and introduces an experimental transient identification system based exclusively on the abilities of the Discrete Binary Artificial Bee Colony (DBABC) algorithm to find the best centroid positions that correctly identifies a transient in a nuclear power plant. The DBABC is a reworking of the Artificial Bee Colony (ABC) algorithm which presents the advantage of operating in both continuous and discrete search spaces. Through the analysis of experimental results, the effective performance of the proposed DBABC algorithm is shown against some well known best performing algorithms from the literature. (author)

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.

On Bitopological Supra B-Open Sets

OpenAIRE

M.Lellis Thivagar; B.Meera Devi

2012-01-01

In this paper, we introduce and investigate a new class of sets and maps be- tween bitopological spaces called supra(1,2) b-open, and supra (1,2) b-continuous maps, respectively. Furthermore, we introduce the concepts of supra(1,2) locally-closed, supra(1,2) locally b-closed sets. We also introduce supra(1,2) extremely disconnected. Finally, additional properties of these sets are investigated.

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

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…

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

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

Directory of Open Access Journals (Sweden)

Werner Hürlimann

2015-01-01

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

On some interconnections between combinatorial optimization and extremal graph theory

Directory of Open Access Journals (Sweden)

Cvetković Dragoš M.

2004-01-01

Full Text Available The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.

Extreme Energy Events Monitoring report

CERN Document Server

Baimukhamedova, Nigina

2015-01-01

Following paper reflects the progress I made on Summer Student Program within Extreme Energy Events Monitor project I was working on. During 8 week period I managed to build a simple detector system that is capable of triggering events similar to explosions (sudden change in sound levels) and measuring approximate location of the event. Source codes are available upon request and settings described further.

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

On the discrete version of Gabor's signal expansion, the Gabor transform, and the Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Veen, J.P.

1996-01-01

Gabors 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

(When and where) Do extreme climate events trigger extreme ecosystem responses? - Development and initial results of a holistic analysis framework

Science.gov (United States)

Hauber, Eva K.; Donner, Reik V.

2015-04-01

a seasonal cycle for each quantile of the distribution, which can be used for a fully data-adaptive definition of extremes as exceedances above this time-dependent quantile function. (2) Having thus identified the extreme events, their distribution is analyzed in both space and time. Following a procedure recently proposed by Lloyd-Hughes (2012) and further exploited by Zscheischler et al. (2013), extremes observed at neighboring points in space and time are considered to form connected sets. Investigating the size distribution of these sets provides novel insights into the development and dynamical characteristics of spatio-temporally extended climate and ecosystem extremes. (3) Finally, the timing of such spatio-temporally extended extremes in different climatic as well as ecological variables is tested pairwise to rule out that co-occurrences of extremes have emerged solely due to chance. For this purpose, the recently developed framework of coincidence analysis (Donges et al., 2011; Rammig et al. 2014) is applied. The corresponding analysis allows identifying potential causal linkages between climatic extremes and extreme ecosystem responses and, thus, to study their mechanisms and spatial as well as seasonal distribution in great detail. In this work, the described method is exemplified by using different climate data from the ERA-Interim reanalysis as well as remote sensing-based land surface temperature data. References: Donges et al., PNAS, 108, 20422, 2011 Lloyd-Hughes, Int. J. Climatol., 32, 406, 2012 Rammig et al., Biogeosc. Disc., 11, 2537, 2014 Zscheischler et al., Ecol. Inform., 15, 66, 2013

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.

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)

Solution Algorithm for a New Bi-Level Discrete Network Design Problem

Directory of Open Access Journals (Sweden)

Qun Chen

2013-12-01

Full Text Available A new discrete network design problem (DNDP was pro-posed in this paper, where the variables can be a series of integers rather than just 0-1. The new DNDP can determine both capacity improvement grades of reconstruction roads and locations and capacity grades of newly added roads, and thus complies with the practical projects where road capacity can only be some discrete levels corresponding to the number of lanes of roads. This paper designed a solution algorithm combining branch-and-bound with Hooke-Jeeves algorithm, where feasible integer solutions are recorded in searching the process of Hooke-Jeeves algorithm, lend -ing itself to determine the upper bound of the upper-level problem. The thresholds for branch cutting and ending were set for earlier convergence. Numerical examples are given to demonstrate the efficiency of the proposed algorithm.

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.

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

Capturing spatial and temporal patterns of widespread, extreme flooding across Europe

Science.gov (United States)

Busby, Kathryn; Raven, Emma; Liu, Ye

2013-04-01

Statistical characterisation of physical hazards is an integral part of probabilistic catastrophe models used by the reinsurance industry to estimate losses from large scale events. Extreme flood events are not restricted by country boundaries which poses an issue for reinsurance companies as their exposures often extend beyond them. We discuss challenges and solutions that allow us to appropriately capture the spatial and temporal dependence of extreme hydrological events on a continental-scale, which in turn enables us to generate an industry-standard stochastic event set for estimating financial losses for widespread flooding. By presenting our event set methodology, we focus on explaining how extreme value theory (EVT) and dependence modelling are used to account for short, inconsistent hydrological data from different countries, and how to make appropriate statistical decisions that best characterise the nature of flooding across Europe. The consistency of input data is of vital importance when identifying historical flood patterns. Collating data from numerous sources inherently causes inconsistencies and we demonstrate our robust approach to assessing the data and refining it to compile a single consistent dataset. This dataset is then extrapolated using a parameterised EVT distribution to estimate extremes. Our method then captures the dependence of flood events across countries using an advanced multivariate extreme value model. Throughout, important statistical decisions are explored including: (1) distribution choice; (2) the threshold to apply for extracting extreme data points; (3) a regional analysis; (4) the definition of a flood event, which is often linked with reinsurance industry's hour's clause; and (5) handling of missing values. Finally, having modelled the historical patterns of flooding across Europe, we sample from this model to generate our stochastic event set comprising of thousands of events over thousands of years. We then briefly

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.

A Bernstein-Von Mises Theorem for discrete probability distributions

OpenAIRE

Boucheron, S.; Gassiat, E.

2008-01-01

We investigate the asymptotic normality of the posterior distribution in the discrete setting, when model dimension increases with sample size. We consider a probability mass function θ0 on ℕ∖{0} and a sequence of truncation levels (kn)n satisfying kn3≤ninf i≤knθ0(i). Let θ̂ denote the maximum likelihood estimate of (θ0(i))i≤kn and let Δn(θ0) denote the kn-dimensional vector which i-th coordinate is defined by $\\sqrt{n}(\\hat{\\theta}_{n}(i)-\\theta_{0}(i))$ for 1≤i≤kn. We check that under mild ...

Infinitely many conservation laws for the discrete KdV equation

International Nuclear Information System (INIS)

Rasin, Alexander G; Schiff, Jeremy

2009-01-01

Rasin and Hydon (2007 J. Phys. A: Math. Theor. 40 12763-73) suggested a way to construct an infinite number of conservation laws for the discrete KdV equation (dKdV), by repeated application of a certain symmetry to a known conservation law. It was not decided, however, whether the resulting conservation laws were distinct and nontrivial. In this paper we obtain the following results: (1) we give an alternative method to construct an infinite number of conservation laws using a discrete version of the Gardner transformation. (2) We give a direct proof that the conservation laws obtained by the method of Rasin and Hydon are indeed distinct and nontrivial. (3) We consider a continuum limit in which the dKdV equation becomes a first-order eikonal equation. In this limit the two sets of conservation laws become the same, and are evidently distinct and nontrivial. This proves the nontriviality of the conservation laws constructed by the Gardner method, and gives an alternative proof of the nontriviality of the conservation laws constructed by the method of Rasin and Hydon

Spatial hypersurfaces in causal set cosmology

International Nuclear Information System (INIS)

Major, Seth A; Rideout, David; Surya, Sumati

2006-01-01

Within the causal set approach to quantum gravity, a discrete analogue of a spacelike region is a set of unrelated elements, or an antichain. In the continuum approximation of the theory, a moment-of-time hypersurface is well represented by an inextendible antichain. We construct a richer structure corresponding to a thickening of this antichain containing non-trivial geometric and topological information. We find that covariant observables can be associated with such thickened antichains and transitions between them, in classical sequential growth models of causal sets. This construction highlights the difference between the covariant measure on causal set cosmology and the standard sum-over-histories approach: the measure is assigned to completed histories rather than to histories on a restricted spacetime region. The resulting re-phrasing of the sum-over-histories may be fruitful in other approaches to quantum gravity

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)

An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers

Directory of Open Access Journals (Sweden)

Guanlong Deng

2016-01-01

Full Text Available This paper presents an enhanced discrete artificial bee colony algorithm for minimizing the total flow time in the flow shop scheduling problem with buffer capacity. First, the solution in the algorithm is represented as discrete job permutation to directly convert to active schedule. Then, we present a simple and effective scheme called best insertion for the employed bee and onlooker bee and introduce a combined local search exploring both insertion and swap neighborhood. To validate the performance of the presented algorithm, a computational campaign is carried out on the Taillard benchmark instances, and computations and comparisons show that the proposed algorithm is not only capable of solving the benchmark set better than the existing discrete differential evolution algorithm and iterated greedy algorithm, but also capable of performing better than two recently proposed discrete artificial bee colony algorithms.

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.

Eliciting preferences for priority setting in genetic testing: a pilot study comparing best-worst scaling and discrete-choice experiments.

Science.gov (United States)

Severin, Franziska; Schmidtke, Jörg; Mühlbacher, Axel; Rogowski, Wolf H

2013-11-01

Given the increasing number of genetic tests available, decisions have to be made on how to allocate limited health-care resources to them. Different criteria have been proposed to guide priority setting. However, their relative importance is unclear. Discrete-choice experiments (DCEs) and best-worst scaling experiments (BWSs) are methods used to identify and weight various criteria that influence orders of priority. This study tests whether these preference eliciting techniques can be used for prioritising genetic tests and compares the empirical findings resulting from these two approaches. Pilot DCE and BWS questionnaires were developed for the same criteria: prevalence, severity, clinical utility, alternatives to genetic testing available, infrastructure for testing and care established, and urgency of care. Interview-style experiments were carried out among different genetics professionals (mainly clinical geneticists, researchers and biologists). A total of 31 respondents completed the DCE and 26 completed the BWS experiment. Weights for the levels of the six attributes were estimated by conditional logit models. Although the results derived from the DCE and BWS experiments differed in detail, we found similar valuation patterns in the DCE and BWS experiments. The respondents attached greatest value to tests with high clinical utility (defined by the availability of treatments that reduce mortality and morbidity) and to testing for highly prevalent conditions. The findings from this study exemplify how decision makers can use quantitative preference eliciting methods to measure aggregated preferences in order to prioritise alternative clinical interventions. Further research is necessary to confirm the survey results.