Whole genome duplication of intra- and inter-chromosomes in the tomato genome.

Science.gov (United States)

Song, Chi; Guo, Juan; Sun, Wei; Wang, Ying

2012-07-20

Whole genome duplication (WGD) events have been proven to occur in the evolutionary history of most angiosperms. Tomato is considered a model species of the Solanaceae family. In this study, we describe the details of the evolutionary process of the tomato genome by detecting collinearity blocks and dating the WGD events on the tree of life by combining two different methods: synonymous substitution rates (Ks) and phylogenetic trees. In total, 593 collinearity blocks were discovered out of 12 pseudo-chromosomes constructed. It was evident that chromosome 2 had experienced an intra-chromosomal duplication event. Major inter-chromosomal duplication occurred among all the pseudo-chromosome. We calculated the Ks value of these collinearity blocks. Two peaks of Ks distribution were found, corresponding to two WGD events occurring approximately 36-82 million years ago (MYA) and 148-205 MYA. Additionally, the results of phylogenetic trees suggested that the more recent WGD event may have occurred after the divergence of the rosid-asterid clade, but before the major diversification in Solanaceae. The older WGD event was shown to have occurred before the divergence of the rosid-asterid clade and after the divergence of rice-Arabidopsis (monocot-dicot). Copyright © 2012. Published by Elsevier Ltd.

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

Science.gov (United States)

Hua, Wei; Wang, Jiasong; Zhao, Jian

2014-01-01

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

Utilization of a cloned alphoid repeating sequence of human DNA in the study of polymorphism of chromosomal heterochromatin regions

International Nuclear Information System (INIS)

Kruminya, A.R.; Kroshkina, V.G.; Yurov, Yu.B.; Aleksandrov, I.A.; Mitkevich, S.P.; Gindilis, V.M.

1988-01-01

The chromosomal distribution of the cloned PHS05 fragment of human alphoid DNA was studied by in situ hybridization in 38 individuals. It was shown that this DNA fraction is primarily localized in the pericentric regions of practically all chromosomes of the set. Significant interchromosomal differences and a weakly expressed interindividual polymorphism were discovered in the copying ability of this class of repeating DNA sequences; associations were not found between the results of hybridization and the pattern of Q-polymorphism

GraphTeams: a method for discovering spatial gene clusters in Hi-C sequencing data.

Science.gov (United States)

Schulz, Tizian; Stoye, Jens; Doerr, Daniel

2018-05-08

Hi-C sequencing offers novel, cost-effective means to study the spatial conformation of chromosomes. We use data obtained from Hi-C experiments to provide new evidence for the existence of spatial gene clusters. These are sets of genes with associated functionality that exhibit close proximity to each other in the spatial conformation of chromosomes across several related species. We present the first gene cluster model capable of handling spatial data. Our model generalizes a popular computational model for gene cluster prediction, called δ-teams, from sequences to graphs. Following previous lines of research, we subsequently extend our model to allow for several vertices being associated with the same label. The model, called δ-teams with families, is particular suitable for our application as it enables handling of gene duplicates. We develop algorithmic solutions for both models. We implemented the algorithm for discovering δ-teams with families and integrated it into a fully automated workflow for discovering gene clusters in Hi-C data, called GraphTeams. We applied it to human and mouse data to find intra- and interchromosomal gene cluster candidates. The results include intrachromosomal clusters that seem to exhibit a closer proximity in space than on their chromosomal DNA sequence. We further discovered interchromosomal gene clusters that contain genes from different chromosomes within the human genome, but are located on a single chromosome in mouse. By identifying δ-teams with families, we provide a flexible model to discover gene cluster candidates in Hi-C data. Our analysis of Hi-C data from human and mouse reveals several known gene clusters (thus validating our approach), but also few sparsely studied or possibly unknown gene cluster candidates that could be the source of further experimental investigations.

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

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.

Maximum-likelihood model averaging to profile clustering of site types across discrete linear sequences.

Directory of Open Access Journals (Sweden)

Zhang Zhang

2009-06-01

Full Text Available A major analytical challenge in computational biology is the detection and description of clusters of specified site types, such as polymorphic or substituted sites within DNA or protein sequences. Progress has been stymied by a lack of suitable methods to detect clusters and to estimate the extent of clustering in discrete linear sequences, particularly when there is no a priori specification of cluster size or cluster count. Here we derive and demonstrate a maximum likelihood method of hierarchical clustering. Our method incorporates a tripartite divide-and-conquer strategy that models sequence heterogeneity, delineates clusters, and yields a profile of the level of clustering associated with each site. The clustering model may be evaluated via model selection using the Akaike Information Criterion, the corrected Akaike Information Criterion, and the Bayesian Information Criterion. Furthermore, model averaging using weighted model likelihoods may be applied to incorporate model uncertainty into the profile of heterogeneity across sites. We evaluated our method by examining its performance on a number of simulated datasets as well as on empirical polymorphism data from diverse natural alleles of the Drosophila alcohol dehydrogenase gene. Our method yielded greater power for the detection of clustered sites across a breadth of parameter ranges, and achieved better accuracy and precision of estimation of clusters, than did the existing empirical cumulative distribution function statistics.

The discrete spectrum in azimuthally dependent transport theory

International Nuclear Information System (INIS)

Garcia, R.D.M.; Siewert, C.E.

1989-01-01

The discrete spectrum for each component of a Fourier decomposition of the azimuthally dependent transport equation is analyzed. For a non-multiplying medium described by an L th -order scattering law, the problem of determining the zeros of the dispersion function for the m th Fourier component is formulated in terms of Sturm sequences. In particular, a straightforward application of the Sturm-sequence property is used to compute the number of discrete eigenvalue pairs κ m and to show that either κ m = γ m or κ m = γ m + 1, where γ m denotes the number of zeros of the Chandrasekhar polynomial g m L+1 (ξ) which are greater than unity. It is also shown how Sturm sequences can be used to construct effective algorithms to compute and to refine estimates of the discrete eigenvalues. Results are presented for a test problem. (author) [pt

sequenceMiner algorithm

Data.gov (United States)

National Aeronautics and Space Administration — Detecting and describing anomalies in large repositories of discrete symbol sequences. sequenceMiner has been open-sourced! Download the file below to try it out....

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.

Solving discrete zero point problems

NARCIS (Netherlands)

van der Laan, G.; Talman, A.J.J.; Yang, Z.F.

2004-01-01

In this paper an algorithm is proposed to .nd a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space IRn.Starting with a given integral point, the algorithm generates a .nite sequence of adjacent integral simplices of varying dimension and

Time dependence linear transport III convergence of the discrete ordinate method

International Nuclear Information System (INIS)

Wilson, D.G.

1983-01-01

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

Large-scale chromosome folding versus genomic DNA sequences: A discrete double Fourier transform technique.

Science.gov (United States)

Chechetkin, V R; Lobzin, V V

2017-08-07

Using state-of-the-art techniques combining imaging methods and high-throughput genomic mapping tools leaded to the significant progress in detailing chromosome architecture of various organisms. However, a gap still remains between the rapidly growing structural data on the chromosome folding and the large-scale genome organization. Could a part of information on the chromosome folding be obtained directly from underlying genomic DNA sequences abundantly stored in the databanks? To answer this question, we developed an original discrete double Fourier transform (DDFT). DDFT serves for the detection of large-scale genome regularities associated with domains/units at the different levels of hierarchical chromosome folding. The method is versatile and can be applied to both genomic DNA sequences and corresponding physico-chemical parameters such as base-pairing free energy. The latter characteristic is closely related to the replication and transcription and can also be used for the assessment of temperature or supercoiling effects on the chromosome folding. We tested the method on the genome of E. coli K-12 and found good correspondence with the annotated domains/units established experimentally. As a brief illustration of further abilities of DDFT, the study of large-scale genome organization for bacteriophage PHIX174 and bacterium Caulobacter crescentus was also added. The combined experimental, modeling, and bioinformatic DDFT analysis should yield more complete knowledge on the chromosome architecture and genome organization. Copyright © 2017 Elsevier Ltd. All rights reserved.

Inferring gene networks from discrete expression data

KAUST Repository

Zhang, L.; Mallick, B. K.

2013-01-01

graphical models applied to continuous data, which give a closedformmarginal likelihood. In this paper,we extend network modeling to discrete data, specifically data from serial analysis of gene expression, and RNA-sequencing experiments, both of which

Two sequence-ready contigs spanning the two copies of a 200-kb duplication on human 21q: partial sequence and polymorphisms.

Science.gov (United States)

Potier, M; Dutriaux, A; Orti, R; Groet, J; Gibelin, N; Karadima, G; Lutfalla, G; Lynn, A; Van Broeckhoven, C; Chakravarti, A; Petersen, M; Nizetic, D; Delabar, J; Rossier, J

1998-08-01

Physical mapping across a duplication can be a tour de force if the region is larger than the size of a bacterial clone. This was the case of the 170- to 275-kb duplication present on the long arm of chromosome 21 in normal human at 21q11.1 (proximal region) and at 21q22.1 (distal region), which we described previously. We have constructed sequence-ready contigs of the two copies of the duplication of which all the clones are genuine representatives of one copy or the other. This required the identification of four duplicon polymorphisms that are copy-specific and nonallelic variations in the sequence of the STSs. Thirteen STSs were mapped inside the duplicated region and 5 outside but close to the boundaries. Among these STSs 10 were end clones from YACs, PACs, or cosmids, and the average interval between two markers in the duplicated region was 16 kb. Eight PACs and cosmids showing minimal overlaps were selected in both copies of the duplication. Comparative sequence analysis along the duplication showed three single-basepair changes between the two copies over 659 bp sequenced (4 STSs), suggesting that the duplication is recent (less than 4 mya). Two CpG islands were located in the duplication, but no genes were identified after a 36-kb cosmid from the proximal copy of the duplication was sequenced. The homology of this chromosome 21 duplicated region with the pericentromeric regions of chromosomes 13, 2, and 18 suggests that the mechanism involved is probably similar to pericentromeric-directed mechanisms described in interchromosomal duplications. Copyright 1998 Academic Press.

Discretized representations of harmonic variables by bilateral Jacobi operators

Directory of Open Access Journals (Sweden)

Andreas Ruffing

2000-01-01

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

Interchromosomal insertions. Identification of five cases and a review.

Science.gov (United States)

Van Hemel, J O; Eussen, H J

2000-11-01

In five families with questionable chromosome rearrangements, we identified an interchromosomal insertion by fluorescent in situ hybridization (FISH). In case 1 with a dir ins (5;11)(p14;q14q24) in three generations, the mentally retarded and microcephalic proband showed a 5p14-->pter deletion. In case 2, a duplication (13)(q21.31--> q31.2) combined with a deletion (11)(q14-->q22) segregated from a reciprocal ins(11;13)(q14q122)(q21.32q31.2), causing a mixed phenotype with psychomotor retardation, caput quadratum, choanal atresia, and pes equinovarus. In case 3, a dir ins (18;5)(q21.3;p13.1p14) was associated with spontaneous abortions, in case 4, the proband with mental retardation, microcephaly, and a heart defect showed a pure trisomy of (12)(q13-->q15), which had segregated from a carrier of an ins (18;12)(p11.3;q13q15). In case 5, a duplication of (10)(q26.3-->q25.2) segregated from an inv ins(5;10)(q15;q26.3q25.2), which was passed on directly from a mother to her son,with mental retardation. In all families the elucidation of the insertional translocation (IT) considerably increased the associated genetic risks of carriers. For the review, we collected data from 81 articles on 87 IT probands on ascertainment, origin, familial transmittance, progeny, and genetic risks of IT carriers. We also discussed the recombinant chromosomes and complex rearrangements associated with ITs, and listed chromosome regions occurring solely as deletions, or solely as duplications, or as both to facilitate genotype/phenotype correlations. We conclude that ITs are rare chromosomal rearrangements with an 1:80,000 incidence, of which nearly 80% were referred because of congenital abnormalities and mental retardation. A maternal origin was seen in 59.5%, a paternal origin in 26.6%, and 13.9% were de novo. No notable difference in fertility between male and female IT carriers was noticed. Bias of ascertainment was excluded in 15 familial cases and led to an estimate of the genetic

40 CFR 1033.515 - Discrete-mode steady-state emission tests of locomotives and locomotive engines.

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 32 2010-07-01 2010-07-01 false Discrete-mode steady-state emission... Procedures § 1033.515 Discrete-mode steady-state emission tests of locomotives and locomotive engines. This... a warm-up followed by a sequence of nominally steady-state discrete test modes, as described in...

Discrete gradients in discrete classical mechanics

International Nuclear Information System (INIS)

Renna, L.

1987-01-01

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

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

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 Feature Model (DFM) User Documentation

Energy Technology Data Exchange (ETDEWEB)

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

2008-06-15

software, the geometry of discrete features and their hydrologic properties are defined as a mesh composed of triangular, finite elements. Hydrologic boundary conditions arc prescribed as a simulation sequence, which permits specification of conditions ranging from simple, steady-state flow to complex situations where both the magnitude and type of boundary conditions may vary over time

Discrete Feature Model (DFM) User Documentation

International Nuclear Information System (INIS)

Geier, Joel

2008-06-01

geometry of discrete features and their hydrologic properties are defined as a mesh composed of triangular, finite elements. Hydrologic boundary conditions arc prescribed as a simulation sequence, which permits specification of conditions ranging from simple, steady-state flow to complex situations where both the magnitude and type of boundary conditions may vary over time

Lyapunov equation for infinite-dimensional discrete bilinear systems

International Nuclear Information System (INIS)

Costa, O.L.V.; Kubrusly, C.S.

1991-03-01

Mean-square stability for discrete systems requires that uniform convergence is preserved between input and state correlation sequences. Such a convergence preserving property holds for an infinite-dimensional bilinear system if and only if the associate Lyapunov equation has a unique strictly positive solution. (author)

Discrete Hilbert transformation and its application to estimate the wind speed in Hong Kong

Energy Technology Data Exchange (ETDEWEB)

Zhu, Zuojin [Department of Thermal Science and Energy Engineering, Institute of Engineering Science, University of Science and Technology of China, Hefei, Anhui (China); Yang, Hongxing [Department of Building Services Engineering, The Hong Kong Polytechnic University, Hong Kong (Hong Kong)

2002-01-01

Discrete Hilbert Transform (DHT) has been applied to estimate the wind speed with the sample data sequence selected from the data record observed by the observatory in Hong Kong in June 1989, during which the data pertain to deep valleys and sharp crests due to manifold weather conditions in this region. To confirm the performance of the discrete Hilbert transformer, two harmonic input sequences were used to inspect the output signals, whether good agreement with the theoretical results is obtained. It was found that the energy spectrum and the outputs for the two different harmonic discrete waves are certainly correct. After the inspection of the DHT filter, the sample data for wind speed in Hong Kong were used for wind speed forecasting. For zero mean input sequence, the variance of the output is the same as that of the input signals, and so is the energy spectrum. The DHT of an individual input sample can really reflect the local variation performance, since it is the convolution with the reciprocal of time and the input data sequence, but there exists phase shift. For harmonic signals, the output signal holds a 90 phase delay.

Fractal sets generated by chemical reactions discrete chaotic dynamics

International Nuclear Information System (INIS)

Gontar, V.; Grechko, O.

2007-01-01

Fractal sets composed by the parameters values of difference equations derived from chemical reactions discrete chaotic dynamics (DCD) and corresponding to the sequences of symmetrical patterns were obtained in this work. Examples of fractal sets with the corresponding symmetrical patterns have been presented

Generalized locally Toeplitz sequences theory and applications

CERN Document Server

Garoni, Carlo

2017-01-01

Based on their research experience, the authors propose a reference textbook in two volumes on the theory of generalized locally Toeplitz sequences and their applications. This first volume focuses on the univariate version of the theory and the related applications in the unidimensional setting, while the second volume, which addresses the multivariate case, is mainly devoted to concrete PDE applications. This book systematically develops the theory of generalized locally Toeplitz (GLT) sequences and presents some of its main applications, with a particular focus on the numerical discretization of differential equations (DEs). It is the first book to address the relatively new field of GLT sequences, which occur in numerous scientific applications and are especially dominant in the context of DE discretizations. Written for applied mathematicians, engineers, physicists, and scientists who (perhaps unknowingly) encounter GLT sequences in their research, it is also of interest to those working in the fields of...

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

Cryptographic pseudo-random sequences from the chaotic Hénon ...

Indian Academy of Sciences (India)

dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences suggest a ...

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

Discrete-Trial Functional Analysis and Functional Communication Training with Three Adults with Intellectual Disabilities and Problem Behavior

Science.gov (United States)

Chezan, Laura C.; Drasgow, Erik; Martin, Christian A.

2014-01-01

We conducted a sequence of two studies on the use of discrete-trial functional analysis and functional communication training. First, we used discrete-trial functional analysis (DTFA) to identify the function of problem behavior in three adults with intellectual disabilities and problem behavior. Results indicated clear patterns of problem…

Optical movie encryption based on a discrete multiple-parameter fractional Fourier transform

International Nuclear Information System (INIS)

Zhong, Zhi; Zhang, Yujie; Shan, Mingguang; Wang, Ying; Zhang, Yabin; Xie, Hong

2014-01-01

A movie encryption scheme is proposed using a discrete multiple-parameter fractional Fourier transform and theta modulation. After being modulated by sinusoidal amplitude grating, each frame of the movie is transformed by a filtering procedure and then multiplexed into a complex signal. The complex signal is multiplied by a pixel scrambling operation and random phase mask, and then encrypted by a discrete multiple-parameter fractional Fourier transform. The movie can be retrieved by using the correct keys, such as a random phase mask, a pixel scrambling operation, the parameters in a discrete multiple-parameter fractional Fourier transform and a time sequence. Numerical simulations have been performed to demonstrate the validity and the security of the proposed method. (paper)

Advances in Discrete-Event Simulation for MSL Command Validation

Science.gov (United States)

Patrikalakis, Alexander; O'Reilly, Taifun

2013-01-01

In the last five years, the discrete event simulator, SEQuence GENerator (SEQGEN), developed at the Jet Propulsion Laboratory to plan deep-space missions, has greatly increased uplink operations capacity to deal with increasingly complicated missions. In this paper, we describe how the Mars Science Laboratory (MSL) project makes full use of an interpreted environment to simulate change in more than fifty thousand flight software parameters and conditional command sequences to predict the result of executing a conditional branch in a command sequence, and enable the ability to warn users whenever one or more simulated spacecraft states change in an unexpected manner. Using these new SEQGEN features, operators plan more activities in one sol than ever before.

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

Inferring gene networks from discrete expression data

KAUST Repository

Zhang, L.

2013-07-18

The modeling of gene networks from transcriptional expression data is an important tool in biomedical research to reveal signaling pathways and to identify treatment targets. Current gene network modeling is primarily based on the use of Gaussian graphical models applied to continuous data, which give a closedformmarginal likelihood. In this paper,we extend network modeling to discrete data, specifically data from serial analysis of gene expression, and RNA-sequencing experiments, both of which generate counts of mRNAtranscripts in cell samples.We propose a generalized linear model to fit the discrete gene expression data and assume that the log ratios of the mean expression levels follow a Gaussian distribution.We restrict the gene network structures to decomposable graphs and derive the graphs by selecting the covariance matrix of the Gaussian distribution with the hyper-inverse Wishart priors. Furthermore, we incorporate prior network models based on gene ontology information, which avails existing biological information on the genes of interest. We conduct simulation studies to examine the performance of our discrete graphical model and apply the method to two real datasets for gene network inference. © The Author 2013. Published by Oxford University Press. All rights reserved.

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.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

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

Digital Discretion

DEFF Research Database (Denmark)

Busch, Peter Andre; Zinner Henriksen, Helle

2018-01-01

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

Persistence Probabilities of Two-Sided (Integrated) Sums of Correlated Stationary Gaussian Sequences

Science.gov (United States)

Aurzada, Frank; Buck, Micha

2018-02-01

We study the persistence probability for some two-sided, discrete-time Gaussian sequences that are discrete-time analogues of fractional Brownian motion and integrated fractional Brownian motion, respectively. Our results extend the corresponding ones in continuous time in Molchan (Commun Math Phys 205(1):97-111, 1999) and Molchan (J Stat Phys 167(6):1546-1554, 2017) to a wide class of discrete-time processes.

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

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.

2017-05-23

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

A discrete Fourier transform for virtual memory machines

Science.gov (United States)

Galant, David C.

1992-01-01

An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of the details of the theory leads to a computationally efficient fast Fourier transform for the use on computers with virtual memory. Such an algorithm is of great use on modern desktop machines. A FORTRAN coded version of the algorithm is given for the case when the sequence of numbers to be transformed is a power of two.

Parsing a perceptual decision into a sequence of moments of thought

Directory of Open Access Journals (Sweden)

Martin eGraziano

2011-09-01

Full Text Available Theoretical, computational and experimental studies have converged to a model of decision-making in which sensory evidence is stochastically integrated to a threshold, implementing a shift from an analog to a discrete form of computation. Understanding how this process can be chained and sequenced - as virtually all real-life tasks involve a sequence of decisions - remains an open question in neuroscience. We reasoned that incorporating a virtual continuum of possible behavioral outcomes in a simple decision task- a fundamental ingredient of real-life decision making – should result in a progressive sequential approximation to the correct response. We used real-time tracking of motor action in a decision task, as a measure of cognitive states reflecting an internal decision process. We found that response trajectories were spontaneously segmented into a discrete sequence of explorations separated by brief stops (about 200 ms – which remained unconscious to the participants. The characteristics of these stops were indicative of a decision process - a moment of thought: their duration correlated with the difficulty of the decision and with the efficiency of the subsequent exploration. Our findings suggest that simple navigation in an abstract space involves a discrete sequence of explorations and stops and, moreover, that these stops reveal a fingerprint of moments of thought.

Frequency response testing at Experimental Breeder Reactor II using discrete-level periodic signals

International Nuclear Information System (INIS)

Rhodes, W.D.; Larson, H.A.

1990-01-01

The Experimental Breeder Reactor 2 (EBR-2) reactivity-to-power frequency-response function was measured with pseudo-random, discrete-level, periodic signals. The reactor power deviation was small with insignificant perturbation of normal operation and in-place irradiation experiments. Comparison of results with measured rod oscillator data and with theoretical predictions show good agreement. Moreover, measures of input signal quality (autocorrelation function and energy spectra) confirm the ability to enable this type of frequency response determination at EBR-2. Measurements were made with the pseudo-random binary sequence, quadratic residue binary sequence, pseudo-random ternary sequence, and the multifrequency binary sequence. 10 refs., 7 figs., 3 tabs

Effective Approach to Calculate Analysis Window in Infinite Discrete Gabor Transform

Directory of Open Access Journals (Sweden)

Rui Li

2018-01-01

Full Text Available The long-periodic/infinite discrete Gabor transform (DGT is more effective than the periodic/finite one in many applications. In this paper, a fast and effective approach is presented to efficiently compute the Gabor analysis window for arbitrary given synthesis window in DGT of long-periodic/infinite sequences, in which the new orthogonality constraint between analysis window and synthesis window in DGT for long-periodic/infinite sequences is derived and proved to be equivalent to the completeness condition of the long-periodic/infinite DGT. By using the property of delta function, the original orthogonality can be expressed as a certain number of linear equation sets in both the critical sampling case and the oversampling case, which can be fast and efficiently calculated by fast discrete Fourier transform (FFT. The computational complexity of the proposed approach is analyzed and compared with that of the existing canonical algorithms. The numerical results indicate that the proposed approach is efficient and fast for computing Gabor analysis window in both the critical sampling case and the oversampling case in comparison to existing algorithms.

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

Image compression-encryption algorithms by combining hyper-chaotic system with discrete fractional random transform

Science.gov (United States)

Gong, Lihua; Deng, Chengzhi; Pan, Shumin; Zhou, Nanrun

2018-07-01

Based on hyper-chaotic system and discrete fractional random transform, an image compression-encryption algorithm is designed. The original image is first transformed into a spectrum by the discrete cosine transform and the resulting spectrum is compressed according to the method of spectrum cutting. The random matrix of the discrete fractional random transform is controlled by a chaotic sequence originated from the high dimensional hyper-chaotic system. Then the compressed spectrum is encrypted by the discrete fractional random transform. The order of DFrRT and the parameters of the hyper-chaotic system are the main keys of this image compression and encryption algorithm. The proposed algorithm can compress and encrypt image signal, especially can encrypt multiple images once. To achieve the compression of multiple images, the images are transformed into spectra by the discrete cosine transform, and then the spectra are incised and spliced into a composite spectrum by Zigzag scanning. Simulation results demonstrate that the proposed image compression and encryption algorithm is of high security and good compression performance.

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)

Quantum evolution by discrete measurements

International Nuclear Information System (INIS)

Roa, L; Guevara, M L Ladron de; Delgado, A; Olivares-RenterIa, G; Klimov, A B

2007-01-01

In this article we review two ways of driving a quantum system to a known pure state via a sequence discrete of von Neumann measurements. The first of them assumes that the initial state of the system is unknown, and the evolution is attained only with the help of two non-commuting observables. For this method, the overall success probability is maximized when the eigentstates of the involved observables constitute mutually unbiased bases. The second method assumes the initial state is known and it uses N observables which are consecutively measured to make the state of the system approach the target state. The probability of success of this procedure converges to 1 as the number of observables increases

Quantum evolution by discrete measurements

Energy Technology Data Exchange (ETDEWEB)

Roa, L [Center for Quantum Optics and Quantum Information, Departamento de Fisica, Universidad de Concepcion, Casilla 160-C, Concepcion (Chile); Guevara, M L Ladron de [Departamento de Fisica, Universidad Catolica del Norte, Casilla 1280, Antofagasta (Chile); Delgado, A [Center for Quantum Optics and Quantum Information, Departamento de Fisica, Universidad de Concepcion, Casilla 160-C, Concepcion (Chile); Olivares-RenterIa, G [Center for Quantum Optics and Quantum Information, Departamento de Fisica, Universidad de Concepcion, Casilla 160-C, Concepcion (Chile); Klimov, A B [Departamento de Fisica, Universidad de Guadalajara, Revolucion 1500, 44420 Guadalajara, Jalisco (Mexico)

2007-10-15

In this article we review two ways of driving a quantum system to a known pure state via a sequence discrete of von Neumann measurements. The first of them assumes that the initial state of the system is unknown, and the evolution is attained only with the help of two non-commuting observables. For this method, the overall success probability is maximized when the eigentstates of the involved observables constitute mutually unbiased bases. The second method assumes the initial state is known and it uses N observables which are consecutively measured to make the state of the system approach the target state. The probability of success of this procedure converges to 1 as the number of observables increases.

Observation of Discrete-Time-Crystal Signatures in an Ordered Dipolar Many-Body System

Science.gov (United States)

Rovny, Jared; Blum, Robert L.; Barrett, Sean E.

2018-05-01

A discrete time crystal (DTC) is a robust phase of driven systems that breaks the discrete time translation symmetry of the driving Hamiltonian. Recent experiments have observed DTC signatures in two distinct systems. Here we show nuclear magnetic resonance observations of DTC signatures in a third, strikingly different system: an ordered spatial crystal. We use a novel DTC echo experiment to probe the coherence of the driven system. Finally, we show that interactions during the pulse of the DTC sequence contribute to the decay of the signal, complicating attempts to measure the intrinsic lifetime of the DTC.

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

International Nuclear Information System (INIS)

Karanikas, C.; Proios, G.

2003-01-01

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

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

CERN Document Server

Karanikas, C

2003-01-01

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

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

Discrete Self-Similarity in Interfacial Hydrodynamics and the Formation of Iterated Structures.

Science.gov (United States)

Dallaston, Michael C; Fontelos, Marco A; Tseluiko, Dmitri; Kalliadasis, Serafim

2018-01-19

The formation of iterated structures, such as satellite and subsatellite drops, filaments, and bubbles, is a common feature in interfacial hydrodynamics. Here we undertake a computational and theoretical study of their origin in the case of thin films of viscous fluids that are destabilized by long-range molecular or other forces. We demonstrate that iterated structures appear as a consequence of discrete self-similarity, where certain patterns repeat themselves, subject to rescaling, periodically in a logarithmic time scale. The result is an infinite sequence of ridges and filaments with similarity properties. The character of these discretely self-similar solutions as the result of a Hopf bifurcation from ordinarily self-similar solutions is also described.

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

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.

Discrete port-Hamiltonian systems

NARCIS (Netherlands)

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

2006-01-01

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

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

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

Time Discretization Techniques

KAUST Repository

Gottlieb, S.; Ketcheson, David I.

2016-01-01

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

Default cycle phases determined after modifying discrete DNA sequences in plant cells

International Nuclear Information System (INIS)

Sans, J.; Leyton, C.

1997-01-01

After bromosubstituting DNA sequences replicated in the first, second, or third part of the S phase, in Allium cepa L. meristematic cells, radiation at 313 nm wavelength under anoxia allowed ascription of different sequences to both the positive and negative regulation of some cycle phase transitions. The present report shows that the radiation forced cells in late G 1 phase to advance into S, while those in G 2 remained in G 2 and cells in prophase returned to G 2 when both sets of sequences involved in the positive and negative controls were bromosubstituted and later irradiated. In this way, not only G 2 but also the S phase behaved as cycle phases where cells accumulated by default when signals of different sign functionally cancelled out. The treatment did not halt the rates of replication or transcription of plant bromosubstituted DNA. The irradiation under hypoxia apparently prevents the binding of regulatory proteins to Br-DNA. (author)

Multiscale analysis for ill-posed problems with semi-discrete Tikhonov regularization

International Nuclear Information System (INIS)

Zhong, Min; Lu, Shuai; Cheng, Jin

2012-01-01

Using compactly supported radial basis functions of varying radii, Wendland has shown how a multiscale analysis can be applied to the approximation of Sobolev functions on a bounded domain, when the available data are discrete and noisy. Here, we examine the application of this analysis to the solution of linear moderately ill-posed problems using semi-discrete Tikhonov–Phillips regularization. As in Wendland’s work, the actual multiscale approximation is constructed by a sequence of residual corrections, where different support radii are employed to accommodate different scales. The convergence of the algorithm for noise-free data is given. Based on the Morozov discrepancy principle, a posteriori parameter choice rule and error estimates for the noisy data are derived. Two numerical examples are presented to illustrate the appropriateness of the proposed method. (paper)

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.

Probing Efimov discrete scaling in an atom-molecule collision

Science.gov (United States)

Shalchi, M. A.; Yamashita, M. T.; Hadizadeh, M. R.; Garrido, E.; Tomio, Lauro; Frederico, T.

2018-01-01

The discrete Efimov scaling behavior, well known in the low-energy spectrum of three-body bound systems for large scattering lengths (unitary limit), is identified in the energy dependence of an atom-molecule elastic cross section in mass-imbalanced systems. That happens in the collision of a heavy atom with mass mH with a weakly bound dimer formed by the heavy atom and a lighter one with mass mL≪mH . Approaching the heavy-light unitary limit, the s -wave elastic cross section σ will present a sequence of zeros or minima at collision energies following closely the Efimov geometrical law. Our results, obtained with Faddeev calculations and supplemented by a Born-Oppenheimer analysis, open a perspective to detecting the discrete scaling behavior from low-energy scattering data, which is timely in view of the ongoing experiments with ultracold binary mixtures having strong mass asymmetries, such as lithium and cesium or lithium and ytterbium.

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.

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)

Irreducibility and co-primeness as an integrability criterion for discrete equations

International Nuclear Information System (INIS)

Kanki, Masataka; Mada, Jun; Mase, Takafumi; Tokihiro, Tetsuji

2014-01-01

We study the Laurent property, the irreducibility and co-primeness of discrete integrable and non-integrable equations. First we study a discrete integrable equation related to the Somos-4 sequence, and also a non-integrable equation as a comparison. We prove that the conditions of irreducibility and co-primeness hold only in the integrable case. Next, we generalize our previous results on the singularities of the discrete Korteweg–de Vries (dKdV) equation. In our previous paper (Kanki et al 2014 J. Phys. A: Math. Theor. 47 065201) we described the singularity confinement test (one of the integrability criteria) using the Laurent property, and the irreducibility, and co-primeness of the terms in the bilinear dKdV equation, in which we only considered simplified boundary conditions. This restriction was needed to obtain simple (monomial) relations between the bilinear form and the nonlinear form of the dKdV equation. In this paper, we prove the co-primeness of the terms in the nonlinear dKdV equation for general initial conditions and boundary conditions, by using the localization of Laurent rings and the interchange of the axes. We assert that co-primeness of the terms can be used as a new integrability criterion, which is a mathematical re-interpretation of the confinement of singularities in the case of discrete equations. (paper)

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

Science.gov (United States)

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

2017-07-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

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

International Nuclear Information System (INIS)

Zhang Yufeng; Fan Engui; Zhang Yongqing

2006-01-01

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

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

NARCIS (Netherlands)

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

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

Integration deficiencies associated with continuous limb movement sequences in Parkinson's disease.

Science.gov (United States)

Park, Jin-Hoon; Stelmach, George E

2009-11-01

The present study examined the extent to which Parkinson's disease (PD) influences integration of continuous limb movement sequences. Eight patients with idiopathic PD and 8 age-matched normal subjects were instructed to perform repetitive sequential aiming movements to specified targets under three-accuracy constraints: 1) low accuracy (W = 7 cm) - minimal accuracy constraint, 2) high accuracy (W = 0.64 cm) - maximum accuracy constraint, and 3) mixed accuracy constraint - one target of high accuracy and another target of low accuracy. The characteristic of sequential movements in the low accuracy condition was mostly cyclical, whereas in the high accuracy condition it was discrete in both groups. When the accuracy constraint was mixed, the sequential movements were executed by assembling discrete and cyclical movements in both groups, suggesting that for PD patients the capability to combine discrete and cyclical movements to meet a task requirement appears to be intact. However, such functional linkage was not as pronounced as was in normal subjects. Close examination of movement from the mixed accuracy condition revealed marked movement hesitations in the vicinity of the large target in PD patients, resulting in a bias toward discrete movement. These results suggest that PD patients may have deficits in ongoing planning and organizing processes during movement execution when the tasks require to assemble various accuracy requirements into more complex movement sequences.

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)

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.

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.

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

International Nuclear Information System (INIS)

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

1976-01-01

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

3-D Discrete Analytical Ridgelet Transform

OpenAIRE

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

2006-01-01

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

Discrete fractional calculus

CERN Document Server

Goodrich, Christopher

2015-01-01

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

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)

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

Structure of the human chromosome interaction network.

Directory of Open Access Journals (Sweden)

Sergio Sarnataro

Full Text Available New Hi-C technologies have revealed that chromosomes have a complex network of spatial contacts in the cell nucleus of higher organisms, whose organisation is only partially understood. Here, we investigate the structure of such a network in human GM12878 cells, to derive a large scale picture of nuclear architecture. We find that the intensity of intra-chromosomal interactions is power-law distributed. Inter-chromosomal interactions are two orders of magnitude weaker and exponentially distributed, yet they are not randomly arranged along the genomic sequence. Intra-chromosomal contacts broadly occur between epigenomically homologous regions, whereas inter-chromosomal contacts are especially associated with regions rich in highly expressed genes. Overall, genomic contacts in the nucleus appear to be structured as a network of networks where a set of strongly individual chromosomal units, as envisaged in the 'chromosomal territory' scenario derived from microscopy, interact with each other via on average weaker, yet far from random and functionally important interactions.

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.

Sequences, groups, and number theory

CERN Document Server

Rigo, Michel

2018-01-01

This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups.  This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

Stability and bifurcation of a discrete BAM neural network model with delays

International Nuclear Information System (INIS)

Zheng Baodong; Zhang Yang; Zhang Chunrui

2008-01-01

A map modelling a discrete bidirectional associative memory neural network with delays is investigated. Its dynamics is studied in terms of local analysis and Hopf bifurcation analysis. By analyzing the associated characteristic equation, its linear stability is investigated and Hopf bifurcations are demonstrated. It is found that there exist Hopf bifurcations when the delay passes a sequence of critical values. Numerical simulation is performed to verify the analytical results

Societal preferences for the return of incidental findings from clinical genomic sequencing: a discrete-choice experiment.

Science.gov (United States)

Regier, Dean A; Peacock, Stuart J; Pataky, Reka; van der Hoek, Kimberly; Jarvik, Gail P; Hoch, Jeffrey; Veenstra, David

2015-04-07

An important challenge with the application of next-generation sequencing technology is the possibility of uncovering incidental genomic findings. A paucity of evidence on personal utility for incidental findings has hindered clinical guidelines. Our objective was to estimate personal utility for complex information derived from incidental genomic findings. We used a discrete-choice experiment to evaluate participants' personal utility for the following attributes: disease penetrance, disease treatability, disease severity, carrier status and cost. Study participants were drawn from the Canadian public. We analyzed the data with a mixed logit model. In total, 1200 participants completed our questionnaire (available in English and French). Participants valued receiving information about high-penetrance disorders but expressed disutility for receiving information on low-penetrance disorders. The average willingness to pay was $445 (95% confidence interval [CI] $322-$567) to receive incidental findings in a scenario where clinicians returned information about high-penetrance, medically treatable disorders, but only 66% of participants (95% CI 63%-71%) indicated that they would choose to receive information in that scenario. On average, participants placed an important value ($725, 95% CI $600-$850) on having a choice about what type of findings they would receive, including receipt of information about high-penetrance, treatable disorders or receipt of information about high-penetrance disorders with or without available treatment. The predicted uptake of that scenario was 76% (95% CI 72%-79%). Most participants valued receiving incidental findings, but personal utility depended on the type of finding, and not all participants wanted to receive incidental results, regardless of the potential health implications. These results indicate that to maximize benefit, participant-level preferences should inform the decision about whether to return incidental findings. © 2015

A dispersion-balanced Discrete Fourier Transform of repetitive pulse sequences using temporal Talbot effect

Science.gov (United States)

Fernández-Pousa, Carlos R.

2017-11-01

We propose a processor based on the concatenation of two fractional temporal Talbot dispersive lines with balanced dispersion to perform the DFT of a repetitive electrical sequence, for its use as a controlled source of optical pulse sequences. The electrical sequence is used to impart the amplitude and phase of a coherent train of optical pulses by use of a modulator placed between the two Talbot lines. The proposal has been built on a representation of the action of fractional Talbot effect on repetitive pulse sequences and a comparison with related results and proposals. It is shown that the proposed system is reconfigurable within a few repetition periods, has the same processing rate as the input optical pulse train, and requires the same technical complexity in terms of dispersion and pulse width as the standard, passive pulse-repetition rate multipliers based on fractional Talbot effect.

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

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

A birth-death process suggested by a chain sequence

NARCIS (Netherlands)

Lenin, R.B.; Parthasarathy, P.R.

2000-01-01

We consider a birth-death process whose birth and death rates are suggested by a chain sequence. We use an elegant transformation to find the transition probabilities in a simple closed form. We also find an explicit expression for time-dependent mean. We find parallel results in discrete time.

Applications of a Sequence of Points in Teaching Linear Algebra, Numerical Methods and Discrete Mathematics

Science.gov (United States)

Shi, Yixun

2009-01-01

Based on a sequence of points and a particular linear transformation generalized from this sequence, two recent papers (E. Mauch and Y. Shi, "Using a sequence of number pairs as an example in teaching mathematics". Math. Comput. Educ., 39 (2005), pp. 198-205; Y. Shi, "Case study projects for college mathematics courses based on a particular…

Image encryption using random sequence generated from generalized information domain

International Nuclear Information System (INIS)

Zhang Xia-Yan; Wu Jie-Hua; Zhang Guo-Ji; Li Xuan; Ren Ya-Zhou

2016-01-01

A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security. (paper)

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.

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

Measuring patterns in team interaction sequences using a discrete recurrence approach.

Science.gov (United States)

Gorman, Jamie C; Cooke, Nancy J; Amazeen, Polemnia G; Fouse, Shannon

2012-08-01

Recurrence-based measures of communication determinism and pattern information are described and validated using previously collected team interaction data. Team coordination dynamics has revealed that"mixing" team membership can lead to flexible interaction processes, but keeping a team "intact" can lead to rigid interaction processes. We hypothesized that communication of intact teams would have greater determinism and higher pattern information compared to that of mixed teams. Determinism and pattern information were measured from three-person Uninhabited Air Vehicle team communication sequences over a series of 40-minute missions. Because team members communicated using push-to-talk buttons, communication sequences were automatically generated during each mission. The Composition x Mission determinism effect was significant. Intact teams' determinism increased over missions, whereas mixed teams' determinism did not change. Intact teams had significantly higher maximum pattern information than mixed teams. Results from these new communication analysis methods converge with content-based methods and support our hypotheses. Because they are not content based, and because they are automatic and fast, these new methods may be amenable to real-time communication pattern analysis.

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.

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.

Analysis of Discrete Mittag - Leffler Functions

Directory of Open Access Journals (Sweden)

N. Shobanadevi

2015-03-01

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

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

Institute of Scientific and Technical Information of China (English)

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

2002-01-01

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

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

Moment-based method for computing the two-dimensional discrete Hartley transform

Science.gov (United States)

Dong, Zhifang; Wu, Jiasong; Shu, Huazhong

2009-10-01

In this paper, we present a fast algorithm for computing the two-dimensional (2-D) discrete Hartley transform (DHT). By using kernel transform and Taylor expansion, the 2-D DHT is approximated by a linear sum of 2-D geometric moments. This enables us to use the fast algorithms developed for computing the 2-D moments to efficiently calculate the 2-D DHT. The proposed method achieves a simple computational structure and is suitable to deal with any sequence lengths.

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

FLT3 and JAK2 Mutations in Acute Myeloid Leukemia Promote Interchromosomal Homologous Recombination and the Potential for Copy Neutral Loss of Heterozygosity.

Science.gov (United States)

Gaymes, Terry J; Mohamedali, Azim; Eiliazadeh, Anthony L; Darling, David; Mufti, Ghulam J

2017-04-01

Acquired copy neutral LOH (CN-LOH) is a frequent occurrence in myeloid malignancies and is often associated with resistance to standard therapeutic modalities and poor survival. Here, we show that constitutive signaling driven by mutated FLT3 and JAK2 confers interchromosomal homologous recombination (iHR), a precedent for CN-LOH. Using a targeted recombination assay, we determined significant iHR activity in internal tandem duplication FLT3 (FLT3-ITD) and JAK2V617F-mutated cells. Sister chromatid exchanges, a surrogate measure of iHR, was significantly elevated in primary FLT3-ITD normal karyotype acute myeloid leukemia (NK-AML) compared with wild-type FLT3 NK-AML. HR was harmonized to S phase of the cell cycle to repair broken chromatids and prevent iHR. Increased HR activity in G 0 arrested primary FLT3-ITD NK-AML in contrast to wild-type FLT3 NK-AML. Cells expressing mutated FLT3-ITD demonstrated a relative increase in mutation frequency as detected by thymidine kinase (TK) gene mutation assay. Moreover, resistance was associated with CN-LOH at the TK locus. Treatment of FLT3-ITD- and JAK2V617F-mutant cells with the antioxidant N -acetylcysteine diminished reactive oxygen species (ROS), restoring iHR and HR levels. Our findings show that mutated FLT3-ITD and JAK2 augment ROS production and HR, shifting the cellular milieu toward illegitimate recombination events such as iHR and CN-LOH. Therapeutic reduction of ROS may thus prevent leukemic progression and relapse in myeloid malignancies. Cancer Res; 77(7); 1697-708. ©2017 AACR . ©2017 American Association for Cancer Research.

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)

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

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)

Basic problems solving for two-dimensional discrete 3 × 4 order hidden markov model

International Nuclear Information System (INIS)

Wang, Guo-gang; Gan, Zong-liang; Tang, Gui-jin; Cui, Zi-guan; Zhu, Xiu-chang

2016-01-01

A novel model is proposed to overcome the shortages of the classical hypothesis of the two-dimensional discrete hidden Markov model. In the proposed model, the state transition probability depends on not only immediate horizontal and vertical states but also on immediate diagonal state, and the observation symbol probability depends on not only current state but also on immediate horizontal, vertical and diagonal states. This paper defines the structure of the model, and studies the three basic problems of the model, including probability calculation, path backtracking and parameters estimation. By exploiting the idea that the sequences of states on rows or columns of the model can be seen as states of a one-dimensional discrete 1 × 2 order hidden Markov model, several algorithms solving the three questions are theoretically derived. Simulation results further demonstrate the performance of the algorithms. Compared with the two-dimensional discrete hidden Markov model, there are more statistical characteristics in the structure of the proposed model, therefore the proposed model theoretically can more accurately describe some practical problems.

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

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)

Euler-Poincare reduction for discrete field theories

International Nuclear Information System (INIS)

Vankerschaver, Joris

2007-01-01

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

Positivity for Convective Semi-discretizations

KAUST Repository

Fekete, Imre

2017-04-19

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

Integrable discretizations of the short pulse equation

International Nuclear Information System (INIS)

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

2010-01-01

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

Discrete computational structures

CERN Document Server

Korfhage, Robert R

1974-01-01

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

Combining Orthogonal Chain-End Deprotections and Thiol-Maleimide Michael Coupling: Engineering Discrete Oligomers by an Iterative Growth Strategy.

Science.gov (United States)

Huang, Zhihao; Zhao, Junfei; Wang, Zimu; Meng, Fanying; Ding, Kunshan; Pan, Xiangqiang; Zhou, Nianchen; Li, Xiaopeng; Zhang, Zhengbiao; Zhu, Xiulin

2017-10-23

Orthogonal maleimide and thiol deprotections were combined with thiol-maleimide coupling to synthesize discrete oligomers/macromolecules on a gram scale with molecular weights up to 27.4 kDa (128mer, 7.9 g) using an iterative exponential growth strategy with a degree of polymerization (DP) of 2 n -1. Using the same chemistry, a "readable" sequence-defined oligomer and a discrete cyclic topology were also created. Furthermore, uniform dendrons were fabricated using sequential growth (DP=2 n -1) or double exponential dendrimer growth approaches (DP=22n -1) with significantly accelerated growth rates. A versatile, efficient, and metal-free method for construction of discrete oligomers with tailored structures and a high growth rate would greatly facilitate research into the structure-property relationships of sophisticated polymeric materials. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

A difference tracking algorithm based on discrete sine transform

Science.gov (United States)

Liu, HaoPeng; Yao, Yong; Lei, HeBing; Wu, HaoKun

2018-04-01

Target tracking is an important field of computer vision. The template matching tracking algorithm based on squared difference matching (SSD) and standard correlation coefficient (NCC) matching is very sensitive to the gray change of image. When the brightness or gray change, the tracking algorithm will be affected by high-frequency information. Tracking accuracy is reduced, resulting in loss of tracking target. In this paper, a differential tracking algorithm based on discrete sine transform is proposed to reduce the influence of image gray or brightness change. The algorithm that combines the discrete sine transform and the difference algorithm maps the target image into a image digital sequence. The Kalman filter predicts the target position. Using the Hamming distance determines the degree of similarity between the target and the template. The window closest to the template is determined the target to be tracked. The target to be tracked updates the template. Based on the above achieve target tracking. The algorithm is tested in this paper. Compared with SSD and NCC template matching algorithms, the algorithm tracks target stably when image gray or brightness change. And the tracking speed can meet the read-time requirement.

Safety Discrete Event Models for Holonic Cyclic Manufacturing Systems

Science.gov (United States)

Ciufudean, Calin; Filote, Constantin

In this paper the expression “holonic cyclic manufacturing systems” refers to complex assembly/disassembly systems or fork/join systems, kanban systems, and in general, to any discrete event system that transforms raw material and/or components into products. Such a system is said to be cyclic if it provides the same sequence of products indefinitely. This paper considers the scheduling of holonic cyclic manufacturing systems and describes a new approach using Petri nets formalism. We propose an approach to frame the optimum schedule of holonic cyclic manufacturing systems in order to maximize the throughput while minimize the work in process. We also propose an algorithm to verify the optimum schedule.

Transitions between discrete and rhythmic primitives in a unimanual task

Science.gov (United States)

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

2013-01-01

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

Transitions between Discrete and Rhythmic Primitives in a Unimanual Task

Directory of Open Access Journals (Sweden)

Dagmar eSternad

2013-07-01

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

Discrete 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

NFATC3-PLA2G15 Fusion Transcript Identified by RNA Sequencing Promotes Tumor Invasion and Proliferation in Colorectal Cancer Cell Lines.

Science.gov (United States)

Jang, Jee-Eun; Kim, Hwang-Phill; Han, Sae-Won; Jang, Hoon; Lee, Si-Hyun; Song, Sang-Hyun; Bang, Duhee; Kim, Tae-You

2018-06-14

This study was designed to identify novel fusion transcripts (FTs) and their functional significance in colorectal cancer lines. We performed paired-end RNA sequencing of 28 colorectal cancer (CRC) cell lines. FT candidates were identified using TopHat-fusion, ChimeraScan, and FusionMap tools and further experimental validation was conducted through reverse transcription-polymerase chain reaction and Sanger sequencing. FT was depleted in human CRC line and the effects on cell proliferation, cell migration, and cell invasion were analyzed. 1,380 FT candidates were detected through bioinformatics filtering. We selected 6 candidate FTs, including 4 inter-chromosomal and 2 intra-chromosomal FTs and each FT was found in at least 1 of the 28 cell lines. Moreover, when we tested 19 pairs of CRC tumor and adjacent normal tissue samples, NFATC3-PLA2G15 FT was found in 2. Knockdown of NFATC3-PLA2G15 using siRNA reduced mRNA expression of epithelial-mesenchymal transition (EMT) markers such as vimentin, twist, and fibronectin and increased mesenchymal-epithelial transition markers of E-cadherin, claudin-1, and FOXC2 in colo-320 cell line harboring NFATC3-PLA2G15 FT. The NFATC3-PLA2G15 knockdown also inhibited invasion, colony formation capacity, and cell proliferation. These results suggest that that NFATC3-PLA2G15 FTs may contribute to tumor progression by enhancing invasion by EMT and proliferation.

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.

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

An Investigation of the Sequence of Catalan Numbers with Activities for Prospective Teachers.

Science.gov (United States)

Koker, John; Kuenzi, Norbert J.; Oktac, Asuman; Carmony, Lowell; Leibowitz, Rochelle

1998-01-01

Investigates several problems with the sequences of numbers known as the Catalan numbers and the Bell numbers. Finds that the problems are appropriate for both pre- and in-service teachers, as well as students studying discrete mathematics. (Author/CCM)

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

Model-based quality assessment and base-calling for second-generation sequencing data.

Science.gov (United States)

Bravo, Héctor Corrada; Irizarry, Rafael A

2010-09-01

Second-generation sequencing (sec-gen) technology can sequence millions of short fragments of DNA in parallel, making it capable of assembling complex genomes for a small fraction of the price and time of previous technologies. In fact, a recently formed international consortium, the 1000 Genomes Project, plans to fully sequence the genomes of approximately 1200 people. The prospect of comparative analysis at the sequence level of a large number of samples across multiple populations may be achieved within the next five years. These data present unprecedented challenges in statistical analysis. For instance, analysis operates on millions of short nucleotide sequences, or reads-strings of A,C,G, or T's, between 30 and 100 characters long-which are the result of complex processing of noisy continuous fluorescence intensity measurements known as base-calling. The complexity of the base-calling discretization process results in reads of widely varying quality within and across sequence samples. This variation in processing quality results in infrequent but systematic errors that we have found to mislead downstream analysis of the discretized sequence read data. For instance, a central goal of the 1000 Genomes Project is to quantify across-sample variation at the single nucleotide level. At this resolution, small error rates in sequencing prove significant, especially for rare variants. Sec-gen sequencing is a relatively new technology for which potential biases and sources of obscuring variation are not yet fully understood. Therefore, modeling and quantifying the uncertainty inherent in the generation of sequence reads is of utmost importance. In this article, we present a simple model to capture uncertainty arising in the base-calling procedure of the Illumina/Solexa GA platform. Model parameters have a straightforward interpretation in terms of the chemistry of base-calling allowing for informative and easily interpretable metrics that capture the variability in

Laplacians on discrete and quantum geometries

International Nuclear Information System (INIS)

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

2013-01-01

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

Cuspidal discrete series for projective hyperbolic spaces

DEFF Research Database (Denmark)

Andersen, Nils Byrial; Flensted-Jensen, Mogens

2013-01-01

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

Targeted DNA Methylation Analysis by High Throughput Sequencing in Porcine Peri-attachment Embryos

OpenAIRE

MORRILL, Benson H.; COX, Lindsay; WARD, Anika; HEYWOOD, Sierra; PRATHER, Randall S.; ISOM, S. Clay

2013-01-01

Abstract The purpose of this experiment was to implement and evaluate the effectiveness of a next-generation sequencing-based method for DNA methylation analysis in porcine embryonic samples. Fourteen discrete genomic regions were amplified by PCR using bisulfite-converted genomic DNA derived from day 14 in vivo-derived (IVV) and parthenogenetic (PA) porcine embryos as template DNA. Resulting PCR products were subjected to high-throughput sequencing using the Illumina Genome Analyzer IIx plat...

Whole genome re-sequencing reveals genome-wide variations among parental lines of 16 mapping populations in chickpea (Cicer arietinum L.).

Science.gov (United States)

Thudi, Mahendar; Khan, Aamir W; Kumar, Vinay; Gaur, Pooran M; Katta, Krishnamohan; Garg, Vanika; Roorkiwal, Manish; Samineni, Srinivasan; Varshney, Rajeev K

2016-01-27

Chickpea (Cicer arietinum L.) is the second most important grain legume cultivated by resource poor farmers in South Asia and Sub-Saharan Africa. In order to harness the untapped genetic potential available for chickpea improvement, we re-sequenced 35 chickpea genotypes representing parental lines of 16 mapping populations segregating for abiotic (drought, heat, salinity), biotic stresses (Fusarium wilt, Ascochyta blight, Botrytis grey mould, Helicoverpa armigera) and nutritionally important (protein content) traits using whole genome re-sequencing approach. A total of 192.19 Gb data, generated on 35 genotypes of chickpea, comprising 973.13 million reads, with an average sequencing depth of ~10 X for each line. On an average 92.18 % reads from each genotype were aligned to the chickpea reference genome with 82.17 % coverage. A total of 2,058,566 unique single nucleotide polymorphisms (SNPs) and 292,588 Indels were detected while comparing with the reference chickpea genome. Highest number of SNPs were identified on the Ca4 pseudomolecule. In addition, copy number variations (CNVs) such as gene deletions and duplications were identified across the chickpea parental genotypes, which were minimum in PI 489777 (1 gene deletion) and maximum in JG 74 (1,497). A total of 164,856 line specific variations (144,888 SNPs and 19,968 Indels) with the highest percentage were identified in coding regions in ICC 1496 (21 %) followed by ICCV 97105 (12 %). Of 539 miscellaneous variations, 339, 138 and 62 were inter-chromosomal variations (CTX), intra-chromosomal variations (ITX) and inversions (INV) respectively. Genome-wide SNPs, Indels, CNVs, PAVs, and miscellaneous variations identified in different mapping populations are a valuable resource in genetic research and helpful in locating genes/genomic segments responsible for economically important traits. Further, the genome-wide variations identified in the present study can be used for developing high density SNP arrays for

h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems

Science.gov (United States)

Botti, L.; Colombo, A.; Bassi, F.

2017-10-01

In this work we exploit agglomeration based h-multigrid preconditioners to speed-up the iterative solution of discontinuous Galerkin discretizations of the Stokes and Navier-Stokes equations. As a distinctive feature h-coarsened mesh sequences are generated by recursive agglomeration of a fine grid, admitting arbitrarily unstructured grids of complex domains, and agglomeration based discontinuous Galerkin discretizations are employed to deal with agglomerated elements of coarse levels. Both the expense of building coarse grid operators and the performance of the resulting multigrid iteration are investigated. For the sake of efficiency coarse grid operators are inherited through element-by-element L2 projections, avoiding the cost of numerical integration over agglomerated elements. Specific care is devoted to the projection of viscous terms discretized by means of the BR2 dG method. We demonstrate that enforcing the correct amount of stabilization on coarse grids levels is mandatory for achieving uniform convergence with respect to the number of levels. The numerical solution of steady and unsteady, linear and non-linear problems is considered tackling challenging 2D test cases and 3D real life computations on parallel architectures. Significant execution time gains are documented.

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)

Implementation in an FPGA circuit of Edge detection algorithm based on the Discrete Wavelet Transforms

Science.gov (United States)

Bouganssa, Issam; Sbihi, Mohamed; Zaim, Mounia

2017-07-01

The 2D Discrete Wavelet Transform (DWT) is a computationally intensive task that is usually implemented on specific architectures in many imaging systems in real time. In this paper, a high throughput edge or contour detection algorithm is proposed based on the discrete wavelet transform. A technique for applying the filters on the three directions (Horizontal, Vertical and Diagonal) of the image is used to present the maximum of the existing contours. The proposed architectures were designed in VHDL and mapped to a Xilinx Sparten6 FPGA. The results of the synthesis show that the proposed architecture has a low area cost and can operate up to 100 MHz, which can perform 2D wavelet analysis for a sequence of images while maintaining the flexibility of the system to support an adaptive algorithm.

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

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

Compatible Spatial Discretizations for Partial Differential Equations

Energy Technology Data Exchange (ETDEWEB)

Arnold, Douglas, N, ed.

2004-11-25

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

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.

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

Iterative normalization technique for reference sequence generation for zero-tail discrete fourier transform spread orthogonal frequency division multiplexing

DEFF Research Database (Denmark)

2017-01-01

, and performing an iterative manipulation of the input sequence. The performing of the iterative manipulation of the input sequence may include, for example: computing frequency domain response of the sequence, normalizing elements of the computed frequency domain sequence to unitary power while maintaining phase...

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

Conditions for extinction events in chemical reaction networks with discrete state spaces.

Science.gov (United States)

Johnston, Matthew D; Anderson, David F; Craciun, Gheorghe; Brijder, Robert

2018-05-01

We study chemical reaction networks with discrete state spaces and present sufficient conditions on the structure of the network that guarantee the system exhibits an extinction event. The conditions we derive involve creating a modified chemical reaction network called a domination-expanded reaction network and then checking properties of this network. Unlike previous results, our analysis allows algorithmic implementation via systems of equalities and inequalities and suggests sequences of reactions which may lead to extinction events. We apply the results to several networks including an EnvZ-OmpR signaling pathway in Escherichia coli.

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

SU-F-T-350: Continuous Leaf Optimization (CLO) for IMRT Leaf Sequencing

Energy Technology Data Exchange (ETDEWEB)

Long, T; Chen, M; Jiang, S; Lu, W [UT Southwestern Medical Center, Dallas, TX (United States)

2016-06-15

Purpose: To study a new step-and-shoot IMRT leaf sequencing model that avoids the two main pitfalls of conventional leaf sequencing: (1) target fluence being stratified into a fixed number of discrete levels and/or (2) aperture leaf positions being restricted to a discrete set of locations. These assumptions induce error into the sequence or reduce the feasible region of potential plans, respectively. Methods: We develop a one-dimensional (single leaf pair) methodology that does not make assumptions (1) or (2) that can be easily extended to a multi-row model. The proposed continuous leaf optimization (CLO) methodology takes in an existing set of apertures and associated intensities, or solution “seed,” and improves the plan without the restrictiveness of 1or (2). It then uses a first-order descent algorithm to converge onto a locally optimal solution. A seed solution can come from models that assume (1) and (2), thus allowing the CLO model to improve upon existing leaf sequencing methodologies. Results: The CLO model was applied to 208 generated target fluence maps in one dimension. In all cases for all tested sequencing strategies, the CLO model made improvements on the starting seed objective function. The CLO model also was able to keep MUs low. Conclusion: The CLO model can improve upon existing leaf sequencing methods by avoiding the restrictions of (1) and (2). By allowing for more flexible leaf positioning, error can be reduced when matching some target fluence. This study lays the foundation for future models and solution methodologies that can incorporate continuous leaf positions explicitly into the IMRT treatment planning model. Supported by Cancer Prevention & Research Institute of Texas (CPRIT) - ID RP150485.

Digital Watermarks Using Discrete Wavelet Transformation and Spectrum Spreading

Directory of Open Access Journals (Sweden)

Ryousuke Takai

2003-12-01

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

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

Discrete sequence production with and without a pause: the role of cortex, basal ganglia and cerebellum

NARCIS (Netherlands)

Jouen, A.-L.; Verwey, Willem B.; van der Helden, J.; Scheiber, C.; Neveu, R.; Dominey, P.F.; Ventre-Dominey, J.

2013-01-01

Our sensorimotor experience unfolds in sequences over time. We hypothesize that the processing of movement sequences with and without a temporal pause will recruit distinct but cooperating neural processes, including cortico-striatal and cortico-cerebellar networks. We thus, compare neural activity

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

Fermion systems in discrete space-time

International Nuclear Information System (INIS)

Finster, Felix

2007-01-01

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

Fermion systems in discrete space-time

Energy Technology Data Exchange (ETDEWEB)

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

2007-05-15

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

Fermion Systems in Discrete Space-Time

OpenAIRE

Finster, Felix

2006-01-01

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

Fermion systems in discrete space-time

Science.gov (United States)

Finster, Felix

2007-05-01

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

Discrete ellipsoidal statistical BGK model and Burnett equations

Science.gov (United States)

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

2018-06-01

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

Memorized discrete systems and time-delay

CERN Document Server

Luo, Albert C J

2017-01-01

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

Discrete Mathematics and Curriculum Reform.

Science.gov (United States)

Kenney, Margaret J.

1996-01-01

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

Exact analysis of discrete data

CERN Document Server

Hirji, Karim F

2005-01-01

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

The male-specific region of the human Y chromosome is a mosaic of discrete sequence classes

NARCIS (Netherlands)

Skaletsky, Helen; Kuroda-Kawaguchi, Tomoko; Minx, Patrick J.; Cordum, Holland S.; Hillier, LaDeana; Brown, Laura G.; Repping, Sjoerd; Pyntikova, Tatyana; Ali, Johar; Bieri, Tamberlyn; Chinwalla, Asif; Delehaunty, Andrew; Delehaunty, Kim; Du, Hui; Fewell, Ginger; Fulton, Lucinda; Fulton, Robert; Graves, Tina; Hou, Shun-Fang; Latrielle, Philip; Leonard, Shawn; Mardis, Elaine; Maupin, Rachel; McPherson, John; Miner, Tracie; Nash, William; Nguyen, Christine; Ozersky, Philip; Pepin, Kymberlie; Rock, Susan; Rohlfing, Tracy; Scott, Kelsi; Schultz, Brian; Strong, Cindy; Tin-Wollam, Aye; Yang, Shiaw-Pyng; Waterston, Robert H.; Wilson, Richard K.; Rozen, Steve; Page, David C.

2003-01-01

The male-specific region of the Y chromosome, the MSY, differentiates the sexes and comprises 95% of the chromosome's length. Here, we report that the MSY is a mosaic of heterochromatic sequences and three classes of euchromatic sequences: X-transposed, X-degenerate and ampliconic. These classes

Discrete systems and integrability

CERN Document Server

Hietarinta, J; Nijhoff, F W

2016-01-01

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

Discrete Painlevé equations: an integrability paradigm

International Nuclear Information System (INIS)

Grammaticos, B; Ramani, A

2014-01-01

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

Discrete non-parametric kernel estimation for global sensitivity analysis

International Nuclear Information System (INIS)

Senga Kiessé, Tristan; Ventura, Anne

2016-01-01

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

From the continuous PV to discrete Painleve equations

International Nuclear Information System (INIS)

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

2002-01-01

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

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

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

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.

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

Nonlinear Estimation of Discrete-Time Signals Under Random Observation Delay

International Nuclear Information System (INIS)

Caballero-Aguila, R.; Jimenez-Lopez, J. D.; Hermoso-Carazo, A.; Linares-Perez, J.; Nakamori, S.

2008-01-01

This paper presents an approximation to the nonlinear least-squares estimation problem of discrete-time stochastic signals using nonlinear observations with additive white noise which can be randomly delayed by one sampling time. The observation delay is modelled by a sequence of independent Bernoulli random variables whose values, zero or one, indicate that the real observation arrives on time or it is delayed and, hence, the available measurement to estimate the signal is not up-to-date. Assuming that the state-space model generating the signal is unknown and only the covariance functions of the processes involved in the observation equation are ready for use, a filtering algorithm based on linear approximations of the real observations is proposed.

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…

Association testing for next-generation sequencing data using score statistics

DEFF Research Database (Denmark)

Skotte, Line; Korneliussen, Thorfinn Sand; Albrechtsen, Anders

2012-01-01

computationally feasible due to the use of score statistics. As part of the joint likelihood, we model the distribution of the phenotypes using a generalized linear model framework, which works for both quantitative and discrete phenotypes. Thus, the method presented here is applicable to case-control studies...... of genotype calls into account have been proposed; most require numerical optimization which for large-scale data is not always computationally feasible. We show that using a score statistic for the joint likelihood of observed phenotypes and observed sequencing data provides an attractive approach...... to association testing for next-generation sequencing data. The joint model accounts for the genotype classification uncertainty via the posterior probabilities of the genotypes given the observed sequencing data, which gives the approach higher power than methods based on called genotypes. This strategy remains...

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

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.

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.

Ruin Probabilities in a Dependent Discrete-Time Risk Model With Gamma-Like Tailed Insurance Risks

Directory of Open Access Journals (Sweden)

Xing-Fang Huang

2017-03-01

Full Text Available This paper considered a dependent discrete-time risk model, in which the insurance risks are represented by a sequence of independent and identically distributed real-valued random variables with a common Gamma-like tailed distribution; the financial risks are denoted by another sequence of independent and identically distributed positive random variables with a finite upper endpoint, but a general dependence structure exists between each pair of the insurance risks and the financial risks. Following the works of Yang and Yuen in 2016, we derive some asymptotic relations for the finite-time and infinite-time ruin probabilities. As a complement, we demonstrate our obtained result through a Crude Monte Carlo (CMC simulation with asymptotics.

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.

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

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

Chaos Enhanced Differential Evolution in the Task of Evolutionary Control of Discrete Chaotic LOZI Map

Directory of Open Access Journals (Sweden)

Roman Senkerik

2016-01-01

Full Text Available In this paper, evolutionary technique Differential Evolution (DE is used for the evolutionary tuning of controller parameters for the stabilization of selected discrete chaotic system, which is the two-dimensional Lozi map. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used within Chaos enhanced heuristic concept as the chaotic pseudo-random number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudo-random sequences given by chaotic map to help Differential evolution algorithm in searching for the best controller settings for the same chaotic system. The optimizations were performed for three different required final behavior of the chaotic system, and two types of developed cost function. To confirm the robustness of presented approach, comparisons with canonical DE strategy and PSO algorithm have been performed.

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

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.

Golay sequences coded coherent optical OFDM for long-haul transmission

Science.gov (United States)

Qin, Cui; Ma, Xiangrong; Hua, Tao; Zhao, Jing; Yu, Huilong; Zhang, Jian

2017-09-01

We propose to use binary Golay sequences in coherent optical orthogonal frequency division multiplexing (CO-OFDM) to improve the long-haul transmission performance. The Golay sequences are generated by binary Reed-Muller codes, which have low peak-to-average power ratio and certain error correction capability. A low-complexity decoding algorithm for the Golay sequences is then proposed to recover the signal. Under same spectral efficiency, the QPSK modulated OFDM with binary Golay sequences coding with and without discrete Fourier transform (DFT) spreading (DFTS-QPSK-GOFDM and QPSK-GOFDM) are compared with the normal BPSK modulated OFDM with and without DFT spreading (DFTS-BPSK-OFDM and BPSK-OFDM) after long-haul transmission. At a 7% forward error correction code threshold (Q2 factor of 8.5 dB), it is shown that DFTS-QPSK-GOFDM outperforms DFTS-BPSK-OFDM by extending the transmission distance by 29% and 18%, in non-dispersion managed and dispersion managed links, respectively.

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

Suboptimal Partial Transmit Sequence-Active Interference Cancellation with Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Tarasak Poramate

2010-01-01

Full Text Available Active interference cancellation (AIC is an effective technique to provide interference avoidance feature for an ultrawideband (UWB OFDM transmitter. Partial transmit sequence-AIC (PTS-AIC, which was recently proposed as an improvement of AIC, requires high computational complexity by doing the exhaustive search of all possible weighting factors whose number grows exponentially with the number of subblocks used. To reduce the complexity of PTS-AIC, this paper proposes a suboptimal way, called particle swarm optimization (PSO, to choose the weighting factors suboptimally without much performance degradation. Both continuous and discrete versions of PSO have been evaluated, and it has been shown that the discrete PSO is able to reduce the complexity significantly without sacrificing the performance of PTS-AIC in many cases.

A Three-Dimensional Model of the Yeast Genome

Science.gov (United States)

Noble, William; Duan, Zhi-Jun; Andronescu, Mirela; Schutz, Kevin; McIlwain, Sean; Kim, Yoo Jung; Lee, Choli; Shendure, Jay; Fields, Stanley; Blau, C. Anthony

Layered on top of information conveyed by DNA sequence and chromatin are higher order structures that encompass portions of chromosomes, entire chromosomes, and even whole genomes. Interphase chromosomes are not positioned randomly within the nucleus, but instead adopt preferred conformations. Disparate DNA elements co-localize into functionally defined aggregates or factories for transcription and DNA replication. In budding yeast, Drosophila and many other eukaryotes, chromosomes adopt a Rabl configuration, with arms extending from centromeres adjacent to the spindle pole body to telomeres that abut the nuclear envelope. Nonetheless, the topologies and spatial relationships of chromosomes remain poorly understood. Here we developed a method to globally capture intra- and inter-chromosomal interactions, and applied it to generate a map at kilobase resolution of the haploid genome of Saccharomyces cerevisiae. The map recapitulates known features of genome organization, thereby validating the method, and identifies new features. Extensive regional and higher order folding of individual chromosomes is observed. Chromosome XII exhibits a striking conformation that implicates the nucleolus as a formidable barrier to interaction between DNA sequences at either end. Inter-chromosomal contacts are anchored by centromeres and include interactions among transfer RNA genes, among origins of early DNA replication and among sites where chromosomal breakpoints occur. Finally, we constructed a three-dimensional model of the yeast genome. Our findings provide a glimpse of the interface between the form and function of a eukaryotic genome.

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

Fault location in underground cables using ANFIS nets and discrete wavelet transform

Directory of Open Access Journals (Sweden)

Shimaa Barakat

2014-12-01

Full Text Available This paper presents an accurate algorithm for locating faults in a medium voltage underground power cable using a combination of Adaptive Network-Based Fuzzy Inference System (ANFIS and discrete wavelet transform (DWT. The proposed method uses five ANFIS networks and consists of 2 stages, including fault type classification and exact fault location. In the first part, an ANFIS is used to determine the fault type, applying four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents. Other four ANFIS networks are utilized to pinpoint the faults (one for each fault type. Four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents, are used to train the neuro-fuzzy inference systems in order to accurately locate the faults on the cable. The proposed method is evaluated under different fault conditions such as different fault locations, different fault inception angles and different fault resistances.

Whole-genome sequence of the Tibetan frog Nanorana parkeri and the comparative evolution of tetrapod genomes.

Science.gov (United States)

Sun, Yan-Bo; Xiong, Zi-Jun; Xiang, Xue-Yan; Liu, Shi-Ping; Zhou, Wei-Wei; Tu, Xiao-Long; Zhong, Li; Wang, Lu; Wu, Dong-Dong; Zhang, Bao-Lin; Zhu, Chun-Ling; Yang, Min-Min; Chen, Hong-Man; Li, Fang; Zhou, Long; Feng, Shao-Hong; Huang, Chao; Zhang, Guo-Jie; Irwin, David; Hillis, David M; Murphy, Robert W; Yang, Huan-Ming; Che, Jing; Wang, Jun; Zhang, Ya-Ping

2015-03-17

The development of efficient sequencing techniques has resulted in large numbers of genomes being available for evolutionary studies. However, only one genome is available for all amphibians, that of Xenopus tropicalis, which is distantly related from the majority of frogs. More than 96% of frogs belong to the Neobatrachia, and no genome exists for this group. This dearth of amphibian genomes greatly restricts genomic studies of amphibians and, more generally, our understanding of tetrapod genome evolution. To fill this gap, we provide the de novo genome of a Tibetan Plateau frog, Nanorana parkeri, and compare it to that of X. tropicalis and other vertebrates. This genome encodes more than 20,000 protein-coding genes, a number similar to that of Xenopus. Although the genome size of Nanorana is considerably larger than that of Xenopus (2.3 vs. 1.5 Gb), most of the difference is due to the respective number of transposable elements in the two genomes. The two frogs exhibit considerable conserved whole-genome synteny despite having diverged approximately 266 Ma, indicating a slow rate of DNA structural evolution in anurans. Multigenome synteny blocks further show that amphibians have fewer interchromosomal rearrangements than mammals but have a comparable rate of intrachromosomal rearrangements. Our analysis also identifies 11 Mb of anuran-specific highly conserved elements that will be useful for comparative genomic analyses of frogs. The Nanorana genome offers an improved understanding of evolution of tetrapod genomes and also provides a genomic reference for other evolutionary studies.

How Triage Nurses Use Discretion: a Literature Review

Directory of Open Access Journals (Sweden)

Lars Emil Fagernes Johannessen

2016-02-01

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

Application of an efficient Bayesian discretization method to biomedical data

Directory of Open Access Journals (Sweden)

Gopalakrishnan Vanathi

2011-07-01

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

Discrete Riccati equation solutions: Distributed algorithms

Directory of Open Access Journals (Sweden)

D. G. Lainiotis

1996-01-01

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

Discrete Fourier analysis of multigrid algorithms

NARCIS (Netherlands)

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

2011-01-01

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

Time Discretization Techniques

KAUST Repository

Gottlieb, S.

2016-10-12

The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include multistep, multistage, or multiderivative methods, as well as a combination of these approaches. The time step constraint is mainly a result of the absolute stability requirement, as well as additional conditions that mimic physical properties of the solution, such as positivity or total variation stability. These conditions may be required for stability when the solution develops shocks or sharp gradients. This chapter contains a review of some of the methods historically used for the evolution of hyperbolic PDEs, as well as cutting edge methods that are now commonly used.

Ensemble simulations with discrete classical dynamics

DEFF Research Database (Denmark)

Toxværd, Søren

2013-01-01

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

Discrete symmetries and de Sitter spacetime

Energy Technology Data Exchange (ETDEWEB)

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

2014-11-24

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

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.

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.

Optimal sequence of landfills in solid waste management

Energy Technology Data Exchange (ETDEWEB)

Andre, F.J. [Universidad Pablo de Olavide (Spain); Cerda, E. [Universidad Complutense de Madrid (Spain)

2001-07-01

Given that landfills are depletable and replaceable resources, the right approach, when dealing with landfill management, is that of designing an optimal sequence of landfills rather than designing every single landfill separately. In this paper, we use Optimal Control models, with mixed elements of both continuous-and discrete-time problems, to determine an optimal sequence of landfills, as regarding their capacity and lifetime. The resulting optimization problems involve splitting a time horizon of planning into several subintervals, the length of which has to be decided. In each of the subintervals some costs, the amount of which depends on the value of the decision variables, have to be borne. The obtained results may be applied to other economic problems such as private and public investments, consumption decisions on durable goods, etc. (Author)

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

International Nuclear Information System (INIS)

Quan, Xu; Qiang, Tian

2009-01-01

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

Discrete-Time Nonlinear Control of VSC-HVDC System

Directory of Open Access Journals (Sweden)

TianTian Qian

2015-01-01

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

Discrete modeling considerations in multiphase fluid dynamics

International Nuclear Information System (INIS)

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

1988-01-01

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

Arnold tongues and the Devil's Staircase in a discrete-time Hindmarsh–Rose neuron model

International Nuclear Information System (INIS)

Felicio, Carolini C.; Rech, Paulo C.

2015-01-01

We investigate a three-dimensional discrete-time dynamical system, described by a three-dimensional map derived from a continuous-time Hindmarsh–Rose neuron model by the forward Euler method. For a fixed integration step size, we report a two-dimensional parameter-space for this system, where periodic structures, the so-called Arnold tongues, can be seen with periods organized in a Farey tree sequence. We also report possible modifications in this parameter-space, as a function of the integration step size. - Highlights: • We investigate the parameter-space of a particular 3D map. • Periodic structures, namely Arnold tongues, can be seen there. • They are organized in a Farey tree sequence. • The map was derived from a continuous-time Hindmarsh–Rose neuron model. • The forward Euler method was used for such purpose.

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

A Sequence-Specific Interaction between the Saccharomyces cerevisiae rRNA Gene Repeats and a Locus Encoding an RNA Polymerase I Subunit Affects Ribosomal DNA Stability

Science.gov (United States)

Cahyani, Inswasti; Cridge, Andrew G.; Engelke, David R.; Ganley, Austen R. D.

2014-01-01

The spatial organization of eukaryotic genomes is linked to their functions. However, how individual features of the global spatial structure contribute to nuclear function remains largely unknown. We previously identified a high-frequency interchromosomal interaction within the Saccharomyces cerevisiae genome that occurs between the intergenic spacer of the ribosomal DNA (rDNA) repeats and the intergenic sequence between the locus encoding the second largest RNA polymerase I subunit and a lysine tRNA gene [i.e., RPA135-tK(CUU)P]. Here, we used quantitative chromosome conformation capture in combination with replacement mapping to identify a 75-bp sequence within the RPA135-tK(CUU)P intergenic region that is involved in the interaction. We demonstrate that the RPA135-IGS1 interaction is dependent on the rDNA copy number and the Msn2 protein. Surprisingly, we found that the interaction does not govern RPA135 transcription. Instead, replacement of a 605-bp region within the RPA135-tK(CUU)P intergenic region results in a reduction in the RPA135-IGS1 interaction level and fluctuations in rDNA copy number. We conclude that the chromosomal interaction that occurs between the RPA135-tK(CUU)P and rDNA IGS1 loci stabilizes rDNA repeat number and contributes to the maintenance of nucleolar stability. Our results provide evidence that the DNA loci involved in chromosomal interactions are composite elements, sections of which function in stabilizing the interaction or mediating a functional outcome. PMID:25421713

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

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)

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.

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.

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

Discrete-State-Based Vision Navigation Control Algorithm for One Bipedal Robot

Directory of Open Access Journals (Sweden)

Dunwen Wei

2015-01-01

Full Text Available Navigation with the specific objective can be defined by specifying desired timed trajectory. The concept of desired direction field is proposed to deal with such navigation problem. To lay down a principled discussion of the accuracy and efficiency of navigation algorithms, strictly quantitative definitions of tracking error, actuator effect, and time efficiency are established. In this paper, one vision navigation control method based on desired direction field is proposed. This proposed method uses discrete image sequences to form discrete state space, which is especially suitable for bipedal walking robots with single camera walking on a free-barrier plane surface to track the specific objective without overshoot. The shortest path method (SPM is proposed to design such direction field with the highest time efficiency. However, one improved control method called canonical piecewise-linear function (PLF is proposed. In order to restrain the noise disturbance from the camera sensor, the band width control method is presented to significantly decrease the error influence. The robustness and efficiency of the proposed algorithm are illustrated through a number of computer simulations considering the error from camera sensor. Simulation results show that the robustness and efficiency can be balanced by choosing the proper controlling value of band width.

Lax Pairs for Discrete Integrable Equations via Darboux Transformations

International Nuclear Information System (INIS)

Cao Ce-Wen; Zhang Guang-Yao

2012-01-01

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

Graph-cut based discrete-valued image reconstruction.

Science.gov (United States)

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

2015-05-01

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

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

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

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)

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.

Mathematical aspects of the discrete space-time hypothesis

International Nuclear Information System (INIS)

Sardanashvili, G.A.

1979-01-01

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

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

Science.gov (United States)

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

1995-07-01

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

Discrete-Time Systems

Indian Academy of Sciences (India)

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

A Local Poisson Graphical Model for inferring networks from sequencing data.

Science.gov (United States)

Allen, Genevera I; Liu, Zhandong

2013-09-01

Gaussian graphical models, a class of undirected graphs or Markov Networks, are often used to infer gene networks based on microarray expression data. Many scientists, however, have begun using high-throughput sequencing technologies such as RNA-sequencing or next generation sequencing to measure gene expression. As the resulting data consists of counts of sequencing reads for each gene, Gaussian graphical models are not optimal for this discrete data. In this paper, we propose a novel method for inferring gene networks from sequencing data: the Local Poisson Graphical Model. Our model assumes a Local Markov property where each variable conditional on all other variables is Poisson distributed. We develop a neighborhood selection algorithm to fit our model locally by performing a series of l1 penalized Poisson, or log-linear, regressions. This yields a fast parallel algorithm for estimating networks from next generation sequencing data. In simulations, we illustrate the effectiveness of our methods for recovering network structure from count data. A case study on breast cancer microRNAs (miRNAs), a novel application of graphical models, finds known regulators of breast cancer genes and discovers novel miRNA clusters and hubs that are targets for future research.

The weak-scale hierarchy and discrete symmetries

International Nuclear Information System (INIS)

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

1996-01-01

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

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.

Network Science Research Laboratory (NSRL) Discrete Event Toolkit

Science.gov (United States)

2016-01-01

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

Lax pairs for ultra-discrete Painleve cellular automata

International Nuclear Information System (INIS)

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

2004-01-01

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

Constitutive equations for discrete electromagnetic problems over polyhedral grids

International Nuclear Information System (INIS)

Codecasa, Lorenzo; Trevisan, Francesco

2007-01-01

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

Painleve test and discrete Boltzmann equations

International Nuclear Information System (INIS)

Euler, N.; Steeb, W.H.

1989-01-01

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

Spectral sum rules and search for periodicities in DNA sequences

International Nuclear Information System (INIS)

Chechetkin, V.R.

2011-01-01

Periodic patterns play the important regulatory and structural roles in genomic DNA sequences. Commonly, the underlying periodicities should be understood in a broad statistical sense, since the corresponding periodic patterns have been strongly distorted by the random point mutations and insertions/deletions during molecular evolution. The latent periodicities in DNA sequences can be efficiently displayed by Fourier transform. The criteria of significance for observed periodicities are obtained via the comparison versus the counterpart characteristics of the reference random sequences. We show that the restrictions imposed on the significance criteria by the rigorous spectral sum rules can be rationally described with De Finetti distribution. This distribution provides the convenient intermediate asymptotic form between Rayleigh distribution and exact combinatoric theory. - Highlights: → We study the significance criteria for latent periodicities in DNA sequences. → The constraints imposed by sum rules can be described with De Finetti distribution. → It is intermediate between Rayleigh distribution and exact combinatoric theory. → Theory is applicable to the study of correlations between different periodicities. → The approach can be generalized to the arbitrary discrete Fourier transform.

Recent developments in discrete ordinates electron transport

International Nuclear Information System (INIS)

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

1986-01-01

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

RNA Secondary Structure Prediction by Using Discrete Mathematics: An Interdisciplinary Research Experience for Undergraduate Students

Science.gov (United States)

Ellington, Roni; Wachira, James

2010-01-01

The focus of this Research Experience for Undergraduates (REU) project was on RNA secondary structure prediction by using a lattice walk approach. The lattice walk approach is a combinatorial and computational biology method used to enumerate possible secondary structures and predict RNA secondary structure from RNA sequences. The method uses discrete mathematical techniques and identifies specified base pairs as parameters. The goal of the REU was to introduce upper-level undergraduate students to the principles and challenges of interdisciplinary research in molecular biology and discrete mathematics. At the beginning of the project, students from the biology and mathematics departments of a mid-sized university received instruction on the role of secondary structure in the function of eukaryotic RNAs and RNA viruses, RNA related to combinatorics, and the National Center for Biotechnology Information resources. The student research projects focused on RNA secondary structure prediction on a regulatory region of the yellow fever virus RNA genome and on an untranslated region of an mRNA of a gene associated with the neurological disorder epilepsy. At the end of the project, the REU students gave poster and oral presentations, and they submitted written final project reports to the program director. The outcome of the REU was that the students gained transferable knowledge and skills in bioinformatics and an awareness of the applications of discrete mathematics to biological research problems. PMID:20810968

RNA secondary structure prediction by using discrete mathematics: an interdisciplinary research experience for undergraduate students.

Science.gov (United States)

Ellington, Roni; Wachira, James; Nkwanta, Asamoah

2010-01-01

The focus of this Research Experience for Undergraduates (REU) project was on RNA secondary structure prediction by using a lattice walk approach. The lattice walk approach is a combinatorial and computational biology method used to enumerate possible secondary structures and predict RNA secondary structure from RNA sequences. The method uses discrete mathematical techniques and identifies specified base pairs as parameters. The goal of the REU was to introduce upper-level undergraduate students to the principles and challenges of interdisciplinary research in molecular biology and discrete mathematics. At the beginning of the project, students from the biology and mathematics departments of a mid-sized university received instruction on the role of secondary structure in the function of eukaryotic RNAs and RNA viruses, RNA related to combinatorics, and the National Center for Biotechnology Information resources. The student research projects focused on RNA secondary structure prediction on a regulatory region of the yellow fever virus RNA genome and on an untranslated region of an mRNA of a gene associated with the neurological disorder epilepsy. At the end of the project, the REU students gave poster and oral presentations, and they submitted written final project reports to the program director. The outcome of the REU was that the students gained transferable knowledge and skills in bioinformatics and an awareness of the applications of discrete mathematics to biological research problems.

Discrete quantum gravity

International Nuclear Information System (INIS)

Williams, Ruth M

2006-01-01

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

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

International Nuclear Information System (INIS)

Hu, Xing-Biao; Yu, Guo-Fu

2007-01-01

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

Sequence analysis by iterated maps, a review.

Science.gov (United States)

Almeida, Jonas S

2014-05-01

Among alignment-free methods, Iterated Maps (IMs) are on a particular extreme: they are also scale free (order free). The use of IMs for sequence analysis is also distinct from other alignment-free methodologies in being rooted in statistical mechanics instead of computational linguistics. Both of these roots go back over two decades to the use of fractal geometry in the characterization of phase-space representations. The time series analysis origin of the field is betrayed by the title of the manuscript that started this alignment-free subdomain in 1990, 'Chaos Game Representation'. The clash between the analysis of sequences as continuous series and the better established use of Markovian approaches to discrete series was almost immediate, with a defining critique published in same journal 2 years later. The rest of that decade would go by before the scale-free nature of the IM space was uncovered. The ensuing decade saw this scalability generalized for non-genomic alphabets as well as an interest in its use for graphic representation of biological sequences. Finally, in the past couple of years, in step with the emergence of BigData and MapReduce as a new computational paradigm, there is a surprising third act in the IM story. Multiple reports have described gains in computational efficiency of multiple orders of magnitude over more conventional sequence analysis methodologies. The stage appears to be now set for a recasting of IMs with a central role in processing nextgen sequencing results.

Integrable discretization s of derivative nonlinear Schroedinger equations

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2002-01-01

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

Algebraic solution of the synthesis problem for coded sequences

International Nuclear Information System (INIS)

Leukhin, Anatolii N

2005-01-01

The algebraic solution of a 'complex' problem of synthesis of phase-coded (PC) sequences with the zero level of side lobes of the cyclic autocorrelation function (ACF) is proposed. It is shown that the solution of the synthesis problem is connected with the existence of difference sets for a given code dimension. The problem of estimating the number of possible code combinations for a given code dimension is solved. It is pointed out that the problem of synthesis of PC sequences is related to the fundamental problems of discrete mathematics and, first of all, to a number of combinatorial problems, which can be solved, as the number factorisation problem, by algebraic methods by using the theory of Galois fields and groups. (fourth seminar to the memory of d.n. klyshko)

Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials

International Nuclear Information System (INIS)

Tratnik, M.V.

1990-01-01

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

Degree distribution in discrete case

International Nuclear Information System (INIS)

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

2011-01-01

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

Minimization of Linear Functionals Defined on| Solutions of Large-Scale Discrete Ill-Posed Problems

DEFF Research Database (Denmark)

Elden, Lars; Hansen, Per Christian; Rojas, Marielba

2003-01-01

The minimization of linear functionals de ned on the solutions of discrete ill-posed problems arises, e.g., in the computation of con dence intervals for these solutions. In 1990, Elden proposed an algorithm for this minimization problem based on a parametric-programming reformulation involving...... the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper, we describe MLFIP, a large-scale version of this algorithm where a limited-memory trust-region solver is used on the subproblems. We illustrate the use of our algorithm in connection with an inverse heat...

Direct Discrete Method for Neutronic Calculations

International Nuclear Information System (INIS)

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

2002-01-01

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

Mode locking and quasiperiodicity in a discrete-time Chialvo neuron model

Science.gov (United States)

Wang, Fengjuan; Cao, Hongjun

2018-03-01

The two-dimensional parameter spaces of a discrete-time Chialvo neuron model are investigated. Our studies demonstrate that for all our choice of two parameters (i) the fixed point is destabilized via Neimark-Sacker bifurcation; (ii) there exist mode locking structures like Arnold tongues and shrimps, with periods organized in a Farey tree sequence, embedded in quasiperiodic/chaotic region. We determine analytically the location of the parameter sets where Neimark-Sacker bifurcation occurs, and the location on this curve where Arnold tongues of arbitrary period are born. Properties of the transition that follows the so-called two-torus from quasiperiodicity to chaos are presented clearly and proved strictly by using numerical simulations such as bifurcation diagrams, the largest Lyapunov exponent diagram on MATLAB and C++.

On the discrete Gabor transform and the discrete Zak transform

NARCIS (Netherlands)

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

1996-01-01

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

Discrete Haar transform and protein structure.

Science.gov (United States)

Morosetti, S

1997-12-01

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

Discrete Choice and Rational Inattention

DEFF Research Database (Denmark)

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

2017-01-01

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

Process algebra with timing : real time and discrete time

NARCIS (Netherlands)

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

2001-01-01

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

Process algebra with timing: Real time and discrete time

NARCIS (Netherlands)

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

1999-01-01

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

A hierarchy of Liouville integrable discrete Hamiltonian equations

Energy Technology Data Exchange (ETDEWEB)

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

2008-05-12

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

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.

Discrete breathers in Bose–Einstein condensates

International Nuclear Information System (INIS)

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

2011-01-01

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

Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System

Directory of Open Access Journals (Sweden)

Jie Ran

2015-01-01

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

Discretization-induced delays and their role in the dynamics

International Nuclear Information System (INIS)

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

2008-01-01

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

Discrete mathematics in the high school curriculum

NARCIS (Netherlands)

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

2004-01-01

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

Hybrid discrete-time neural networks.

Science.gov (United States)

Cao, Hongjun; Ibarz, Borja

2010-11-13

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

Stochastic Kuramoto oscillators with discrete phase states

Science.gov (United States)

Jörg, David J.

2017-09-01

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

Stochastic Kuramoto oscillators with discrete phase states.

Science.gov (United States)

Jörg, David J

2017-09-01

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

Cone-beam tomography with discrete data sets

International Nuclear Information System (INIS)

Barrett, H.H.

1994-01-01

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

On discrete models of space-time

International Nuclear Information System (INIS)

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

1992-02-01

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

Reflectionless discrete Schr\\"odinger operators are spectrally atypical

OpenAIRE

VandenBoom, Tom

2017-01-01

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

Context-dependent motor skill: perceptual processing in memory-based sequence production.

Science.gov (United States)

Ruitenberg, Marit F L; Abrahamse, Elger L; De Kleine, Elian; Verwey, Willem B

2012-10-01

Previous studies have shown that motor sequencing skill can benefit from the reinstatement of the learning context-even with respect to features that are formally not required for appropriate task performance. The present study explored whether such context-dependence develops when sequence execution is fully memory-based-and thus no longer assisted by stimulus-response translations. Specifically, we aimed to distinguish between preparation and execution processes. Participants performed two keying sequences in a go/no-go version of the discrete sequence production task in which the context consisted of the color in which the target keys of a particular sequence were displayed. In a subsequent test phase, these colors either were the same as during practice, were reversed for the two sequences or were novel. Results showed that, irrespective of the amount of practice, performance across all key presses in the reversed context condition was impaired relative to performance in the same and novel contexts. This suggests that the online preparation and/or execution of single key presses of the sequence is context-dependent. We propose that a cognitive processor is responsible both for these online processes and for advance sequence preparation and that combined findings from the current and previous studies build toward the notion that the cognitive processor is highly sensitive to changes in context across the various roles that it performs.

Identification "boîte-noire" des systèmes automatisés à événements discrets

OpenAIRE

Estrada Vargas , Ana Paula

2013-01-01

This thesis deals with the identification of automated discrete event systems (DES) operating in an industrial context. In particular the work focuses on the systems composed by a plant and a programmable logic controller (PLC) operating in a closed loop- the identification consists in obtaining an approximate model expressed in interpreted Petri nets (IPN) from the observed behaviour given under the form of a single sequence of input-output vectors of the PLC. First, an overview of previous ...

A Baecklund transformation between two integrable discrete hungry systems

International Nuclear Information System (INIS)

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

2011-01-01

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

A Baecklund transformation between two integrable discrete hungry systems

Energy Technology Data Exchange (ETDEWEB)

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

2011-01-17

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

A Discrete Dynamical System Approach to Pathway Activation Profiles of Signaling Cascades.

Science.gov (United States)

Catozzi, S; Sepulchre, J-A

2017-08-01

In living organisms, cascades of covalent modification cycles are one of the major intracellular signaling mechanisms, allowing to transduce physical or chemical stimuli of the external world into variations of activated biochemical species within the cell. In this paper, we develop a novel method to study the stimulus-response of signaling cascades and overall the concept of pathway activation profile which is, for a given stimulus, the sequence of activated proteins at each tier of the cascade. Our approach is based on a correspondence that we establish between the stationary states of a cascade and pieces of orbits of a 2D discrete dynamical system. The study of its possible phase portraits in function of the biochemical parameters, and in particular of the contraction/expansion properties around the fixed points of this discrete map, as well as their bifurcations, yields a classification of the cascade tiers into three main types, whose biological impact within a signaling network is examined. In particular, our approach enables to discuss quantitatively the notion of cascade amplification/attenuation from this new perspective. The method allows also to study the interplay between forward and "retroactive" signaling, i.e., the upstream influence of an inhibiting drug bound to the last tier of the cascade.

An introduction to non-Abelian discrete symmetries for particle physicists

CERN Document Server

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

2012-01-01

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

Partition-based discrete-time quantum walks

Science.gov (United States)

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

2018-04-01

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

Stabilizing the discrete vortex of topological charge S=2

International Nuclear Information System (INIS)

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

2005-01-01

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

Group-theoretical aspects of the discrete sine-Gordon equation

International Nuclear Information System (INIS)

Orfanidis, S.J.

1980-01-01

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

Solitonlike solutions of the generalized discrete nonlinear Schrödinger equation

DEFF Research Database (Denmark)

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

1996-01-01

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

Local discrete symmetries from superstring derived models

International Nuclear Information System (INIS)

Faraggi, A.E.

1996-10-01

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

Discrete dispersion models and their Tweedie asymptotics

DEFF Research Database (Denmark)

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

2016-01-01

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

Use cases of discrete event simulation. Appliance and research

Energy Technology Data Exchange (ETDEWEB)

Bangsow, Steffen (ed.)

2012-11-01

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

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

Science.gov (United States)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

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

Discrete Pathophysiology is Uncommon in Patients with Nonspecific Arm Pain.

Science.gov (United States)

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

2016-06-01

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

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

Science.gov (United States)

Hart, Eric W.; And Others

1990-01-01

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

Current Density and Continuity in Discretized Models

Science.gov (United States)

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

2010-01-01

Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schrodinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying…

Discretization vs. Rounding Error in Euler's Method

Science.gov (United States)

Borges, Carlos F.

2011-01-01

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

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

Science.gov (United States)

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

2017-09-29

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

On the Importance of Both Dimensional and Discrete Models of Emotion

Science.gov (United States)

Harmon-Jones, Eddie

2017-01-01

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

Discretization-dependent model for weakly connected excitable media

Science.gov (United States)

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

2018-03-01

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

Discrete Variational Approach for Modeling Laser-Plasma Interactions

Science.gov (United States)

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

2014-10-01

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

A Global Network Alignment Method Using Discrete Particle Swarm Optimization.

Science.gov (United States)

Huang, Jiaxiang; Gong, Maoguo; Ma, Lijia

2016-10-19

Molecular interactions data increase exponentially with the advance of biotechnology. This makes it possible and necessary to comparatively analyse the different data at a network level. Global network alignment is an important network comparison approach to identify conserved subnetworks and get insight into evolutionary relationship across species. Network alignment which is analogous to subgraph isomorphism is known to be an NP-hard problem. In this paper, we introduce a novel heuristic Particle-Swarm-Optimization based Network Aligner (PSONA), which optimizes a weighted global alignment model considering both protein sequence similarity and interaction conservations. The particle statuses and status updating rules are redefined in a discrete form by using permutation. A seed-and-extend strategy is employed to guide the searching for the superior alignment. The proposed initialization method "seeds" matches with high sequence similarity into the alignment, which guarantees the functional coherence of the mapping nodes. A greedy local search method is designed as the "extension" procedure to iteratively optimize the edge conservations. PSONA is compared with several state-of-art methods on ten network pairs combined by five species. The experimental results demonstrate that the proposed aligner can map the proteins with high functional coherence and can be used as a booster to effectively refine the well-studied aligners.

Arnold tongues and the Devil's Staircase in a discrete-time Hindmarsh–Rose neuron model

Energy Technology Data Exchange (ETDEWEB)

Felicio, Carolini C., E-mail: carolini.cf@gmail.com; Rech, Paulo C., E-mail: paulo.rech@udesc.br

2015-11-06

We investigate a three-dimensional discrete-time dynamical system, described by a three-dimensional map derived from a continuous-time Hindmarsh–Rose neuron model by the forward Euler method. For a fixed integration step size, we report a two-dimensional parameter-space for this system, where periodic structures, the so-called Arnold tongues, can be seen with periods organized in a Farey tree sequence. We also report possible modifications in this parameter-space, as a function of the integration step size. - Highlights: • We investigate the parameter-space of a particular 3D map. • Periodic structures, namely Arnold tongues, can be seen there. • They are organized in a Farey tree sequence. • The map was derived from a continuous-time Hindmarsh–Rose neuron model. • The forward Euler method was used for such purpose.

Discrete Tomography and Imaging of Polycrystalline Structures

DEFF Research Database (Denmark)

Alpers, Andreas

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

Sequence heterogeneity accelerates protein search for targets on DNA

International Nuclear Information System (INIS)

Shvets, Alexey A.; Kolomeisky, Anatoly B.

2015-01-01

The process of protein search for specific binding sites on DNA is fundamentally important since it marks the beginning of all major biological processes. We present a theoretical investigation that probes the role of DNA sequence symmetry, heterogeneity, and chemical composition in the protein search dynamics. Using a discrete-state stochastic approach with a first-passage events analysis, which takes into account the most relevant physical-chemical processes, a full analytical description of the search dynamics is obtained. It is found that, contrary to existing views, the protein search is generally faster on DNA with more heterogeneous sequences. In addition, the search dynamics might be affected by the chemical composition near the target site. The physical origins of these phenomena are discussed. Our results suggest that biological processes might be effectively regulated by modifying chemical composition, symmetry, and heterogeneity of a genome

Sequence heterogeneity accelerates protein search for targets on DNA

Energy Technology Data Exchange (ETDEWEB)

Shvets, Alexey A.; Kolomeisky, Anatoly B., E-mail: tolya@rice.edu [Department of Chemistry and Center for Theoretical Biological Physics, Rice University, Houston, Texas 77005 (United States)

2015-12-28

The process of protein search for specific binding sites on DNA is fundamentally important since it marks the beginning of all major biological processes. We present a theoretical investigation that probes the role of DNA sequence symmetry, heterogeneity, and chemical composition in the protein search dynamics. Using a discrete-state stochastic approach with a first-passage events analysis, which takes into account the most relevant physical-chemical processes, a full analytical description of the search dynamics is obtained. It is found that, contrary to existing views, the protein search is generally faster on DNA with more heterogeneous sequences. In addition, the search dynamics might be affected by the chemical composition near the target site. The physical origins of these phenomena are discussed. Our results suggest that biological processes might be effectively regulated by modifying chemical composition, symmetry, and heterogeneity of a genome.

Cuspidal discrete series for semisimple symmetric spaces

DEFF Research Database (Denmark)

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

2012-01-01

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

Geometry and Hamiltonian mechanics on discrete spaces

NARCIS (Netherlands)

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

2004-01-01

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

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

DEFF Research Database (Denmark)

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

2012-01-01

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

An innovative discrete multilevel sampler design

International Nuclear Information System (INIS)

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

1995-01-01

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

Discrete structures in F-theory compactifications

Energy Technology Data Exchange (ETDEWEB)

Till, Oskar

2016-05-04

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

Geometric phases in discrete dynamical systems

Energy Technology Data Exchange (ETDEWEB)

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

2016-10-14

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

Mapping of uncertainty relations between continuous and discrete time.

Science.gov (United States)

Chiuchiù, Davide; Pigolotti, Simone

2018-03-01

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

Discrete stochastic analogs of Erlang epidemic models.

Science.gov (United States)

Getz, Wayne M; Dougherty, Eric R

2018-12-01

Erlang differential equation models of epidemic processes provide more realistic disease-class transition dynamics from susceptible (S) to exposed (E) to infectious (I) and removed (R) categories than the ubiquitous SEIR model. The latter is itself is at one end of the spectrum of Erlang SE[Formula: see text]I[Formula: see text]R models with [Formula: see text] concatenated E compartments and [Formula: see text] concatenated I compartments. Discrete-time models, however, are computationally much simpler to simulate and fit to epidemic outbreak data than continuous-time differential equations, and are also much more readily extended to include demographic and other types of stochasticity. Here we formulate discrete-time deterministic analogs of the Erlang models, and their stochastic extension, based on a time-to-go distributional principle. Depending on which distributions are used (e.g. discretized Erlang, Gamma, Beta, or Uniform distributions), we demonstrate that our formulation represents both a discretization of Erlang epidemic models and generalizations thereof. We consider the challenges of fitting SE[Formula: see text]I[Formula: see text]R models and our discrete-time analog to data (the recent outbreak of Ebola in Liberia). We demonstrate that the latter performs much better than the former; although confining fits to strict SEIR formulations reduces the numerical challenges, but sacrifices best-fit likelihood scores by at least 7%.

Integrable semi-discretizations of the reduced Ostrovsky equation

International Nuclear Information System (INIS)

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

2015-01-01

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

An algebra of discrete event processes

Science.gov (United States)

Heymann, Michael; Meyer, George

1991-01-01

This report deals with an algebraic framework for modeling and control of discrete event processes. The report consists of two parts. The first part is introductory, and consists of a tutorial survey of the theory of concurrency in the spirit of Hoare's CSP, and an examination of the suitability of such an algebraic framework for dealing with various aspects of discrete event control. To this end a new concurrency operator is introduced and it is shown how the resulting framework can be applied. It is further shown that a suitable theory that deals with the new concurrency operator must be developed. In the second part of the report the formal algebra of discrete event control is developed. At the present time the second part of the report is still an incomplete and occasionally tentative working paper.

The discretized Schroedinger equation and simple models for semiconductor quantum wells

International Nuclear Information System (INIS)

Boykin, Timothy B; Klimeck, Gerhard

2004-01-01

The discretized Schroedinger equation is one of the most commonly employed methods for solving one-dimensional quantum mechanics problems on the computer, yet many of its characteristics remain poorly understood. The differences with the continuous Schroedinger equation are generally viewed as shortcomings of the discrete model and are typically described in purely mathematical terms. This is unfortunate since the discretized equation is more productively viewed from the perspective of solid-state physics, which naturally links the discrete model to realistic semiconductor quantum wells and nanoelectronic devices. While the relationship between the discrete model and a one-dimensional tight-binding model has been known for some time, the fact that the discrete Schroedinger equation admits analytic solutions for quantum wells has gone unnoted. Here we present a solution to this new analytically solvable problem. We show that the differences between the discrete and continuous models are due to their fundamentally different bandstructures, and present evidence for our belief that the discrete model is the more physically reasonable one

On the Importance of Both Dimensional and Discrete Models of Emotion

Directory of Open Access Journals (Sweden)

Eddie Harmon-Jones

2017-09-01

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

Comparison of discrete Hodge star operators for surfaces

KAUST Repository

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

2016-01-01

We investigate the performance of various discrete Hodge star operators for discrete exterior calculus (DEC) using circumcentric and barycentric dual meshes. The performance is evaluated through the DEC solution of Darcy and incompressible Navier

Properties of wavelet discretization of Black-Scholes equation

Science.gov (United States)

Finěk, Václav

2017-07-01

Using wavelet methods, the continuous problem is transformed into a well-conditioned discrete problem. And once a non-symmetric problem is given, squaring yields a symmetric positive definite formulation. However squaring usually makes the condition number of discrete problems substantially worse. This note is concerned with a wavelet based numerical solution of the Black-Scholes equation for pricing European options. We show here that in wavelet coordinates a symmetric part of the discretized equation dominates over an unsymmetric part in the standard economic environment with low interest rates. It provides some justification for using a fractional step method with implicit treatment of the symmetric part of the weak form of the Black-Scholes operator and with explicit treatment of its unsymmetric part. Then a well-conditioned discrete problem is obtained.

Discrete symmetries and solar neutrino mixing

Energy Technology Data Exchange (ETDEWEB)

Kapetanakis, D.; Mayr, P.; Nilles, H.P. (Physik Dept., Technische Univ. Muenchen, Garching (Germany) Max-Planck-Inst. fuer Physik, Werner-Heisenberg-Inst., Muenchen (Germany))

1992-05-21

We study the question of resonant solar neutrino mixing in the framework of the supersymmetric extension of the standard model. Discrete symmetries that are consistent with solar neutrino mixing and proton stability are classified. In the minimal model they are shown to lead to two distinct patterns of allowed dimension-four operators. Imposing anomaly freedom, only three different discrete Z{sub N}-symmetries (with N=2, 3, 6) are found to be phenomenologically acceptable. (orig.).

Discrete symmetries and solar neutrino mixing

International Nuclear Information System (INIS)

Kapetanakis, D.; Mayr, P.; Nilles, H.P.

1992-01-01

We study the question of resonant solar neutrino mixing in the framework of the supersymmetric extension of the standard model. Discrete symmetries that are consistent with solar neutrino mixing and proton stability are classified. In the minimal model they are shown to lead to two distinct patterns of allowed dimension-four operators. Imposing anomaly freedom, only three different discrete Z N -symmetries (with N=2, 3, 6) are found to be phenomenologically acceptable. (orig.)

Discrete approximations to vector spin models

Energy Technology Data Exchange (ETDEWEB)

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

2011-11-25

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

Discrete approximations to vector spin models

International Nuclear Information System (INIS)

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

2011-01-01

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

Geometry and Hamiltonian mechanics on discrete spaces

NARCIS (Netherlands)

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

On localization in the discrete nonlinear Schrödinger equation

DEFF Research Database (Denmark)

Bang, O.; Juul Rasmussen, J.; Christiansen, P.L.

1993-01-01

For some values of the grid resolution, depending on the nonlinearity, the discrete nonlinear Schrodinger equation with arbitrary power nonlinearity can be approximated by the corresponding continuum version of the equation. When the discretization becomes too coarse, the discrete equation exhibits...

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

Discrete-time inverse optimal control for nonlinear systems

CERN Document Server

Sanchez, Edgar N

2013-01-01

Discrete-Time Inverse Optimal Control for Nonlinear Systems proposes a novel inverse optimal control scheme for stabilization and trajectory tracking of discrete-time nonlinear systems. This avoids the need to solve the associated Hamilton-Jacobi-Bellman equation and minimizes a cost functional, resulting in a more efficient controller. Design More Efficient Controllers for Stabilization and Trajectory Tracking of Discrete-Time Nonlinear Systems The book presents two approaches for controller synthesis: the first based on passivity theory and the second on a control Lyapunov function (CLF). Th

Multilevel Fast Multipole Method for Higher Order Discretizations

DEFF Research Database (Denmark)

Borries, Oscar Peter; Meincke, Peter; Jorgensen, Erik

2014-01-01

The multi-level fast multipole method (MLFMM) for a higher order (HO) discretization is demonstrated on high-frequency (HF) problems, illustrating for the first time how an efficient MLFMM for HO can be achieved even for very large groups. Applying several novel ideas, beneficial to both lower...... order and higher order discretizations, results from a low-memory, high-speed MLFMM implementation of a HO hierarchical discretization are shown. These results challenge the general view that the benefits of HO and HF-MLFMM cannot be combined....

Discrete quantum geometries and their effective dimension

International Nuclear Information System (INIS)

Thuerigen, Johannes

2015-01-01

In several approaches towards a quantum theory of gravity, such as group field theory and loop quantum gravity, quantum states and histories of the geometric degrees of freedom turn out to be based on discrete spacetime. The most pressing issue is then how the smooth geometries of general relativity, expressed in terms of suitable geometric observables, arise from such discrete quantum geometries in some semiclassical and continuum limit. In this thesis I tackle the question of suitable observables focusing on the effective dimension of discrete quantum geometries. For this purpose I give a purely combinatorial description of the discrete structures which these geometries have support on. As a side topic, this allows to present an extension of group field theory to cover the combinatorially larger kinematical state space of loop quantum gravity. Moreover, I introduce a discrete calculus for fields on such fundamentally discrete geometries with a particular focus on the Laplacian. This permits to define the effective-dimension observables for quantum geometries. Analysing various classes of quantum geometries, I find as a general result that the spectral dimension is more sensitive to the underlying combinatorial structure than to the details of the additional geometric data thereon. Semiclassical states in loop quantum gravity approximate the classical geometries they are peaking on rather well and there are no indications for stronger quantum effects. On the other hand, in the context of a more general model of states which are superposition over a large number of complexes, based on analytic solutions, there is a flow of the spectral dimension from the topological dimension d on low energy scales to a real number between 0 and d on high energy scales. In the particular case of 1 these results allow to understand the quantum geometry as effectively fractal.

New non-structured discretizations for fluid flows with reinforced incompressibility

International Nuclear Information System (INIS)

Heib, S.

2003-01-01

This work deals with the discretization of Stokes and Navier-Stokes equations modeling the flow of incompressible fluids on 2-D or 3-D non-structured meshes. Triangles and tetrahedrons are used for 2-D and 3-D meshes, respectively. The developments and calculations are performed with the code Priceles (fast CEA-EdF industrial platform for large Eddy simulation). This code allows to perform simulations both on structured and non-structured meshes. A finite-volume resolution method is used: a finite difference volume (FDV) method is used for the structured meshes and a finite element volume (FEV) method is used for the non-structured meshes. The finite element used in the beginning of this work has several defects. Starting from this situation, the discretization is improved by adding modifications to this element and the new elements introduced are analyzed theoretically. In parallel to these analyses, the new discretizations are implemented in order to test them numerically and to confirm the theoretical analyses. The first chapter presents the physical and mathematical modeling used in this work. The second chapter treats of the discretization of Stokes equations and presents the FEV resolution method. Chapter 3 presents a first attempt of improvement of this finite element and leads to the proposal of a new element which is presented in details. The problem encountered with the new discretization leads to a modification presented in chapter 4. This new discretization gives all the expected convergence results and sometimes shows super-convergence properties. Chapter 5 deals with the study and discretization of the Navier-Stokes equations. The study of the filtered Navier-Stokes equations, used for large Eddy simulations, requires to give a particular attention to the discretization of the diffusive terms. Then, the convective terms are considered. The effects of the convective terms in the initial discretization and in the improved method are compared. The use of

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

Discrimination between discrete and continuum scattering from the sub-seafloor.

Science.gov (United States)

Holland, Charles W; Steininger, Gavin; Dosso, Stan E

2015-08-01

There is growing evidence that seabed scattering is often dominated by heterogeneities within the sediment volume as opposed to seafloor roughness. From a theoretical viewpoint, sediment volume heterogeneities can be described either by a fluctuation continuum or by discrete particles. In at-sea experiments, heterogeneity characteristics generally are not known a priori. Thus, an uninformed model selection is generally made, i.e., the researcher must arbitrarily select either a discrete or continuum model. It is shown here that it is possible to (acoustically) discriminate between continuum and discrete heterogeneities in some instances. For example, when the spectral exponent γ3>4, the volume scattering cannot be described by discrete particles. Conversely, when γ3≤2, the heterogeneities likely arise from discrete particles. Furthermore, in the range 2discrete vs continuum heterogeneities via acoustic remote sensing may lead to improved observations and concomitant increased understanding of the marine benthic environment.

Discrete singular convolution method for the analysis of Mindlin plates on elastic foundations

International Nuclear Information System (INIS)

Civalek, Omer; Acar, Mustafa Hilmi

2007-01-01

The method of discrete singular convolution (DSC) is used for the bending analysis of Mindlin plates on two-parameter elastic foundations for the first time. Two different realizations of singular kernels, such as the regularized Shannon's delta (RSD) kernel and Lagrange delta sequence (LDS) kernel, are selected as singular convolution to illustrate the present algorithm. The methodology and procedures are presented and bending problems of thick plates on elastic foundations are studied for different boundary conditions. The influence of foundation parameters and shear deformation on the stress resultants and deflections of the plate have been investigated. Numerical studies are performed and the DSC results are compared well with other analytical solutions and some numerical results

Discrete-time optimal control and games on large intervals

CERN Document Server

Zaslavski, Alexander J

2017-01-01

Devoted to the structure of approximate solutions of discrete-time optimal control problems and approximate solutions of dynamic discrete-time two-player zero-sum games, this book presents results on properties of approximate solutions in an interval that is independent lengthwise, for all sufficiently large intervals. Results concerning the so-called turnpike property of optimal control problems and zero-sum games in the regions close to the endpoints of the time intervals are the main focus of this book. The description of the structure of approximate solutions on sufficiently large intervals and its stability will interest graduate students and mathematicians in optimal control and game theory, engineering, and economics. This book begins with a brief overview and moves on to analyze the structure of approximate solutions of autonomous nonconcave discrete-time optimal control Lagrange problems.Next the structures of approximate solutions of autonomous discrete-time optimal control problems that are discret...

Discrete Bose-Einstein spectra

International Nuclear Information System (INIS)

Vlad, Valentin I.; Ionescu-Pallas, Nicholas

2001-03-01

The Bose-Einstein energy spectrum of a quantum gas, confined in a rigid cubic box, is shown to become discrete and strongly dependent on the box geometry (size L), temperature, T and atomic mass number, A at , in the region of small γ=A at TV 1/3 . This behavior is the consequence of the random state degeneracy in the box. Furthermore, we demonstrate that the total energy does not obey the conventional law any longer, but a new law, which depends on γ and on the quantum gas fugacity. This energy law imposes a faster decrease to zero than it is classically expected, for γ→0. The lighter the gas atoms, the higher the temperatures or the box size, for the same effects in the discrete Bose-Einstein regime. (author)

THREE DISCRETE GROUPS WITH HOMOGENEOUS CHEMISTRY ALONG THE RED GIANT BRANCH IN THE GLOBULAR CLUSTER NGC 2808

International Nuclear Information System (INIS)

Carretta, E.

2014-01-01

We present the homogeneous reanalysis of Mg and Al abundances from high resolution UVES/FLAMES spectra for 31 red giants in the globular cluster NGC 2808. We found a well defined Mg-Al anticorrelation reaching a regime of subsolar Mg abundance ratios, with a spread of about 1.4 dex in [Al/Fe]. The main result from the improved statistics of our sample is that the distribution of stars is not continuous along the anticorrelation because they are neatly clustered into three distinct clumps, each with different chemical compositions. One group (P) shows a primordial composition of field stars of similar metallicity, and the other two (I and E) have increasing abundances of Al and decreasing abundances of Mg. The fraction of stars we found in the three components (P: 68%, I: 19%, E: 13%) is in excellent agreement with the ratios computed for the three distinct main sequences in NGC 2808: for the first time there is a clear correspondence between discrete photometric sequences of dwarfs and distinct groups of giants with homogeneous chemistry. The composition of the I group cannot be reproduced by mixing of matter with extreme processing in hot H-burning and gas with pristine, unprocessed composition, as also found in the recent analysis of three discrete groups in NGC 6752. This finding suggests that different classes of polluters were probably at work in NGC 2808 as well

Nonlinear integrodifferential equations as discrete systems

Science.gov (United States)

Tamizhmani, K. M.; Satsuma, J.; Grammaticos, B.; Ramani, A.

1999-06-01

We analyse a class of integrodifferential equations of the `intermediate long wave' (ILW) type. We show that these equations can be formally interpreted as discrete, differential-difference systems. This allows us to link equations of this type with previous results of ours involving differential-delay equations and, on the basis of this, propose new integrable equations of ILW type. Finally, we extend this approach to pure difference equations and propose ILW forms for the discrete lattice KdV equation.

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.

A Markov chain Monte Carlo Expectation Maximization Algorithm for Statistical Analysis of DNA Sequence Evolution with Neighbor-Dependent Substitution Rates

DEFF Research Database (Denmark)

Hobolth, Asger

2008-01-01

The evolution of DNA sequences can be described by discrete state continuous time Markov processes on a phylogenetic tree. We consider neighbor-dependent evolutionary models where the instantaneous rate of substitution at a site depends on the states of the neighboring sites. Neighbor...

String constraints on discrete symmetries in MSSM type II quivers

Energy Technology Data Exchange (ETDEWEB)

Anastasopoulos, Pascal [Technische Univ. Wien (Austria). Inst. fur Theor. Phys.; Cvetic, Mirjam [Univ. of Pennsylvania, Philadelphia PA (United States). Dept. of Physics and Astronomy; Univ. of Maribor (Slovenia). Center for Applied Mathematics and Theoretical Physics; Richter, Robert [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Vaudrevange, Patrick K.S. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

2012-11-15

We study the presence of discrete gauge symmetries in D-brane semirealistic compactifications. After establishing the constraints on the transformation behaviour of the chiral matter for the presence of a discrete gauge symmetry we perform a systematic search for discrete gauge symmetries within semi-realistic D-brane realizations, based on four D-brane stacks, of the MSSM and the MSSM with three right-handed neutrinos. The systematic search reveals that Proton hexality, a discrete symmetry which ensures the absence of R-parity violating terms as well as the absence of dangerous dimension 5 proton decay operators, is only rarely realized. Moreover, none of the semi-realistic local D-brane configurations exhibit any family dependent discrete gauge symmetry.

Modeling discrete time-to-event data

CERN Document Server

Tutz, Gerhard

2016-01-01

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

Image Retrieval Algorithm Based on Discrete Fractional Transforms

Science.gov (United States)

Jindal, Neeru; Singh, Kulbir

2013-06-01

The discrete fractional transforms is a signal processing tool which suggests computational algorithms and solutions to various sophisticated applications. In this paper, a new technique to retrieve the encrypted and scrambled image based on discrete fractional transforms has been proposed. Two-dimensional image was encrypted using discrete fractional transforms with three fractional orders and two random phase masks placed in the two intermediate planes. The significant feature of discrete fractional transforms benefits from its extra degree of freedom that is provided by its fractional orders. Security strength was enhanced (1024!)4 times by scrambling the encrypted image. In decryption process, image retrieval is sensitive for both correct fractional order keys and scrambling algorithm. The proposed approach make the brute force attack infeasible. Mean square error and relative error are the recital parameters to verify validity of proposed method.

An extended discrete gradient formula for oscillatory Hamiltonian systems

International Nuclear Information System (INIS)

Liu Kai; Shi Wei; Wu Xinyuan

2013-01-01

In this paper, incorporating the idea of the discrete gradient method into the extended Runge–Kutta–Nyström integrator, we derive and analyze an extended discrete gradient formula for the oscillatory Hamiltonian system with the Hamiltonian H(p,q)= 1/2 p T p+ 1/2 q T Mq+U(q), where q:R→R d represents generalized positions, p:R→R d represents generalized momenta and M is an element of R dxd is a symmetric and positive semi-definite matrix. The solution of this system is a nonlinear oscillator. Basically, many nonlinear oscillatory mechanical systems with a partitioned Hamiltonian function lend themselves to this approach. The extended discrete gradient formula presented in this paper exactly preserves the energy H(p, q). We derive some properties of the new formula. The convergence is analyzed for the implicit schemes based on the discrete gradient formula, and it turns out that the convergence of the implicit schemes based on the extended discrete gradient formula is independent of ‖M‖, which is a significant property for the oscillatory Hamiltonian system. Thus, it transpires that a larger step size can be chosen for the new energy-preserving schemes than that for the traditional discrete gradient methods when applied to the oscillatory Hamiltonian system. Illustrative examples show the competence and efficiency of the new schemes in comparison with the traditional discrete gradient methods in the scientific literature. (paper)

Galerkin v. discrete-optimal projection in nonlinear model reduction

Energy Technology Data Exchange (ETDEWEB)

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

2015-04-01

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

Discrete inverse scattering theory and the continuum limit

International Nuclear Information System (INIS)

Berryman, J.G.; Greene, R.R.

1978-01-01

The class of satisfactory difference approximations for the Schroedinger equation in discrete inverse scattering theory is shown smaller than previously supposed. A fast algorithm (analogous to the Levinson algorithm for Toeplitz matrices) is found for solving the discrete inverse problem. (Auth.)

Supporting scalable Bayesian networks using configurable discretizer actuators

CSIR Research Space (South Africa)

Osunmakinde, I

2009-04-01

Full Text Available The authors propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Their solution is based on a concurrent distribution of the actuators and uses dynamic...

Beta oscillations define discrete perceptual cycles in the somatosensory domain.

Science.gov (United States)

Baumgarten, Thomas J; Schnitzler, Alfons; Lange, Joachim

2015-09-29

Whether seeing a movie, listening to a song, or feeling a breeze on the skin, we coherently experience these stimuli as continuous, seamless percepts. However, there are rare perceptual phenomena that argue against continuous perception but, instead, suggest discrete processing of sensory input. Empirical evidence supporting such a discrete mechanism, however, remains scarce and comes entirely from the visual domain. Here, we demonstrate compelling evidence for discrete perceptual sampling in the somatosensory domain. Using magnetoencephalography (MEG) and a tactile temporal discrimination task in humans, we find that oscillatory alpha- and low beta-band (8-20 Hz) cycles in primary somatosensory cortex represent neurophysiological correlates of discrete perceptual cycles. Our results agree with several theoretical concepts of discrete perceptual sampling and empirical evidence of perceptual cycles in the visual domain. Critically, these results show that discrete perceptual cycles are not domain-specific, and thus restricted to the visual domain, but extend to the somatosensory domain.

Switching dynamics in reaction networks induced by molecular discreteness

International Nuclear Information System (INIS)

Togashi, Yuichi; Kaneko, Kunihiko

2007-01-01

To study the fluctuations and dynamics in chemical reaction processes, stochastic differential equations based on the rate equation involving chemical concentrations are often adopted. When the number of molecules is very small, however, the discreteness in the number of molecules cannot be neglected since the number of molecules must be an integer. This discreteness can be important in biochemical reactions, where the total number of molecules is not significantly larger than the number of chemical species. To elucidate the effects of such discreteness, we study autocatalytic reaction systems comprising several chemical species through stochastic particle simulations. The generation of novel states is observed; it is caused by the extinction of some molecular species due to the discreteness in their number. We demonstrate that the reaction dynamics are switched by a single molecule, which leads to the reconstruction of the acting network structure. We also show the strong dependence of the chemical concentrations on the system size, which is caused by transitions to discreteness-induced novel states

Use Cases of Discrete Event Simulation Appliance and Research

CERN Document Server

2012-01-01

Over the last decades Discrete Event Simulation has conquered many different application areas. This trend is, on the one hand, driven by an ever wider use of this technology in different fields of science and on the other hand by an incredibly creative use of available software programs through dedicated experts. This book contains articles from scientists and experts from 10 countries. They illuminate the width of application of this technology and the quality of problems solved using Discrete Event Simulation. Practical applications of simulation dominate in the present book.   The book is aimed to researchers and students who deal in their work with Discrete Event Simulation and which want to inform them about current applications. By focusing on discrete event simulation, this book can also serve as an inspiration source for practitioners for solving specific problems during their work. Decision makers who deal with the question of the introduction of discrete event simulation for planning support and o...

Semiclassical expanding discrete space-times

International Nuclear Information System (INIS)

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

1981-01-01

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

A Low Complexity Discrete Radiosity Method

OpenAIRE

Chatelier , Pierre Yves; Malgouyres , Rémy

2006-01-01

International audience; Rather than using Monte Carlo sampling techniques or patch projections to compute radiosity, it is possible to use a discretization of a scene into voxels and perform some discrete geometry calculus to quickly compute visibility information. In such a framework , the radiosity method may be as precise as a patch-based radiosity using hemicube computation for form-factors, but it lowers the overall theoretical complexity to an O(N log N) + O(N), where the O(N) is largel...

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.

Modelling and real-time simulation of continuous-discrete systems in mechatronics

Energy Technology Data Exchange (ETDEWEB)

Lindow, H. [Rostocker, Magdeburg (Germany)

1996-12-31

This work presents a methodology for simulation and modelling of systems with continuous - discrete dynamics. It derives hybrid discrete event models from Lagrange`s equations of motion. This method combines continuous mechanical, electrical and thermodynamical submodels on one hand with discrete event models an the other hand into a hybrid discrete event model. This straight forward software development avoids numeric overhead.

The boundary value problem for discrete analytic functions

KAUST Repository

Skopenkov, Mikhail

2013-01-01

This paper is on further development of discrete complex analysis introduced by R.Isaacs, J.Ferrand, R.Duffin, and C.Mercat. We consider a graph lying in the complex plane and having quadrilateral faces. A function on the vertices is called discrete

Discrete symmetries and coset space dimensional reduction

International Nuclear Information System (INIS)

Kapetanakis, D.; Zoupanos, G.

1989-01-01

We consider the discrete symmetries of all the six-dimensional coset spaces and we apply them in gauge theories defined in ten dimensions which are dimensionally reduced over these homogeneous spaces. Particular emphasis is given in the consequences of the discrete symmetries on the particle content as well as on the symmetry breaking a la Hosotani of the resulting four-dimensional theory. (orig.)

An Integrable Discrete Generalized Nonlinear Schrödinger Equation and Its Reductions

International Nuclear Information System (INIS)

Li Hong-Min; Li Yu-Qi; Chen Yong

2014-01-01

An integrable discrete system obtained by the algebraization of the difference operator is studied. The system is named discrete generalized nonlinear Schrödinger (GNLS) equation, which can be reduced to classical discrete nonlinear Schrödinger (NLS) equation. Furthermore, all of the linear reductions for the discrete GNLS equation are given through the theory of circulant matrices and the discrete NLS equation is obtained by one of the reductions. At the same time, the recursion operator and symmetries of continuous GNLS equation are successfully recovered by its corresponding discrete ones. (general)

Symmetric, discrete fractional splines and Gabor systems

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2006-01-01

In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing the continu......In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing...... the continuous splines, and one is a truly finite, discrete construction. We discuss the properties of these splines and their usefulness as windows for Gabor frames and Wilson bases....

Acceleration techniques for the discrete ordinate method

International Nuclear Information System (INIS)

Efremenko, Dmitry; Doicu, Adrian; Loyola, Diego; Trautmann, Thomas

2013-01-01

In this paper we analyze several acceleration techniques for the discrete ordinate method with matrix exponential and the small-angle modification of the radiative transfer equation. These techniques include the left eigenvectors matrix approach for computing the inverse of the right eigenvectors matrix, the telescoping technique, and the method of false discrete ordinate. The numerical simulations have shown that on average, the relative speedup of the left eigenvector matrix approach and the telescoping technique are of about 15% and 30%, respectively. -- Highlights: ► We presented the left eigenvector matrix approach. ► We analyzed the method of false discrete ordinate. ► The telescoping technique is applied for matrix operator method. ► Considered techniques accelerate the computations by 20% in average.

Digital Resonant Controller based on Modified Tustin Discretization Method

Directory of Open Access Journals (Sweden)

STOJIC, D.

2016-11-01

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

Discrete pseudo-integrals

Czech Academy of Sciences Publication Activity Database

Mesiar, Radko; Li, J.; Pap, E.

2013-01-01

Roč. 54, č. 3 (2013), s. 357-364 ISSN 0888-613X R&D Projects: GA ČR GAP402/11/0378 Institutional support: RVO:67985556 Keywords : concave integral * pseudo-addition * pseudo-multiplication Subject RIV: BA - General Mathematics Impact factor: 1.977, year: 2013 http://library.utia.cas.cz/separaty/2013/E/mesiar-discrete pseudo-integrals.pdf

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

Discrete and computational geometry

CERN Document Server

Devadoss, Satyan L

2011-01-01

Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also fe...

Discrete mathematics with applications

CERN Document Server

Koshy, Thomas

2003-01-01

This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations* Weaves numerous applications into the text* Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects*...

A note on inconsistent families of discrete multivariate distributions

KAUST Repository

Ghosh, Sugata; Dutta, Subhajit; Genton, Marc G.

2017-01-01

We construct a d-dimensional discrete multivariate distribution for which any proper subset of its components belongs to a specific family of distributions. However, the joint d-dimensional distribution fails to belong to that family and in other words, it is ‘inconsistent’ with the distribution of these subsets. We also address preservation of this ‘inconsistency’ property for the symmetric Binomial distribution, and some discrete distributions arising from the multivariate discrete normal distribution.

A note on inconsistent families of discrete multivariate distributions

KAUST Repository

Ghosh, Sugata

2017-07-05

We construct a d-dimensional discrete multivariate distribution for which any proper subset of its components belongs to a specific family of distributions. However, the joint d-dimensional distribution fails to belong to that family and in other words, it is ‘inconsistent’ with the distribution of these subsets. We also address preservation of this ‘inconsistency’ property for the symmetric Binomial distribution, and some discrete distributions arising from the multivariate discrete normal distribution.

Chaos of discrete dynamical systems in complete metric spaces

International Nuclear Information System (INIS)

Shi Yuming; Chen Guanrong

2004-01-01

This paper is concerned with chaos of discrete dynamical systems in complete metric spaces. Discrete dynamical systems governed by continuous maps in general complete metric spaces are first discussed, and two criteria of chaos are then established. As a special case, two corresponding criteria of chaos for discrete dynamical systems in compact subsets of metric spaces are obtained. These results have extended and improved the existing relevant results of chaos in finite-dimensional Euclidean spaces

A scheme for designing extreme multistable discrete dynamical ...

Indian Academy of Sciences (India)

A scheme for designing extreme multistable discrete dynamical systems ... Abstract. In this paper, we propose a scheme for designing discrete extreme multistable systems coupling two identical dynamical systems. Existence ... Department of Applied Mathematics, University of Calcutta, 92 APC Road, Kolkata 700 009, India ...

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

International Nuclear Information System (INIS)

Xu Xixiang

2010-01-01

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

Discrete 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

Analysis of correlations between sites in models of protein sequences

International Nuclear Information System (INIS)

Giraud, B.G.; Lapedes, A.; Liu, L.C.

1998-01-01

A criterion based on conditional probabilities, related to the concept of algorithmic distance, is used to detect correlated mutations at noncontiguous sites on sequences. We apply this criterion to the problem of analyzing correlations between sites in protein sequences; however, the analysis applies generally to networks of interacting sites with discrete states at each site. Elementary models, where explicit results can be derived easily, are introduced. The number of states per site considered ranges from 2, illustrating the relation to familiar classical spin systems, to 20 states, suitable for representing amino acids. Numerical simulations show that the criterion remains valid even when the genetic history of the data samples (e.g., protein sequences), as represented by a phylogenetic tree, introduces nonindependence between samples. Statistical fluctuations due to finite sampling are also investigated and do not invalidate the criterion. A subsidiary result is found: The more homogeneous a population, the more easily its average properties can drift from the properties of its ancestor. copyright 1998 The American Physical Society

Infant differential behavioral responding to discrete emotions.

Science.gov (United States)

Walle, Eric A; Reschke, Peter J; Camras, Linda A; Campos, Joseph J

2017-10-01

Emotional communication regulates the behaviors of social partners. Research on individuals' responding to others' emotions typically compares responses to a single negative emotion compared with responses to a neutral or positive emotion. Furthermore, coding of such responses routinely measure surface level features of the behavior (e.g., approach vs. avoidance) rather than its underlying function (e.g., the goal of the approach or avoidant behavior). This investigation examined infants' responding to others' emotional displays across 5 discrete emotions: joy, sadness, fear, anger, and disgust. Specifically, 16-, 19-, and 24-month-old infants observed an adult communicate a discrete emotion toward a stimulus during a naturalistic interaction. Infants' responses were coded to capture the function of their behaviors (e.g., exploration, prosocial behavior, and security seeking). The results revealed a number of instances indicating that infants use different functional behaviors in response to discrete emotions. Differences in behaviors across emotions were clearest in the 24-month-old infants, though younger infants also demonstrated some differential use of behaviors in response to discrete emotions. This is the first comprehensive study to identify differences in how infants respond with goal-directed behaviors to discrete emotions. Additionally, the inclusion of a function-based coding scheme and interpersonal paradigms may be informative for future emotion research with children and adults. Possible developmental accounts for the observed behaviors and the benefits of coding techniques emphasizing the function of social behavior over their form are discussed. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Discrete-continuous analysis of optimal equipment replacement

OpenAIRE

YATSENKO, Yuri; HRITONENKO, Natali

2008-01-01

In Operations Research, the equipment replacement process is usually modeled in discrete time. The optimal replacement strategies are found from discrete (or integer) programming problems, well known for their analytic and computational complexity. An alternative approach is represented by continuous-time vintage capital models that explicitly involve the equipment lifetime and are described by nonlinear integral equations. Then the optimal replacement is determined via the opt...

Definable maximal discrete sets in forcing extensions

DEFF Research Database (Denmark)

Törnquist, Asger Dag; Schrittesser, David

2018-01-01

Let  be a Σ11 binary relation, and recall that a set A is -discrete if no two elements of A are related by . We show that in the Sacks and Miller forcing extensions of L there is a Δ12 maximal -discrete set. We use this to answer in the negative the main question posed in [5] by showing...

Prolongation Structure of Semi-discrete Nonlinear Evolution Equations

International Nuclear Information System (INIS)

Bai Yongqiang; Wu Ke; Zhao Weizhong; Guo Hanying

2007-01-01

Based on noncommutative differential calculus, we present a theory of prolongation structure for semi-discrete nonlinear evolution equations. As an illustrative example, a semi-discrete model of the nonlinear Schroedinger equation is discussed in terms of this theory and the corresponding Lax pairs are also given.

Probabilistic Power Flow Method Considering Continuous and Discrete Variables

Directory of Open Access Journals (Sweden)

Xuexia Zhang

2017-04-01

Full Text Available This paper proposes a probabilistic power flow (PPF method considering continuous and discrete variables (continuous and discrete power flow, CDPF for power systems. The proposed method—based on the cumulant method (CM and multiple deterministic power flow (MDPF calculations—can deal with continuous variables such as wind power generation (WPG and loads, and discrete variables such as fuel cell generation (FCG. In this paper, continuous variables follow a normal distribution (loads or a non-normal distribution (WPG, and discrete variables follow a binomial distribution (FCG. Through testing on IEEE 14-bus and IEEE 118-bus power systems, the proposed method (CDPF has better accuracy compared with the CM, and higher efficiency compared with the Monte Carlo simulation method (MCSM.

Discrete Emotion Effects on Lexical Decision Response Times

Science.gov (United States)

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

2011-01-01

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

Bayesian estimation of the discrete coefficient of determination.

Science.gov (United States)

Chen, Ting; Braga-Neto, Ulisses M

2016-12-01

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

Discrete emotion effects on lexical decision response times.

Science.gov (United States)

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

2011-01-01

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

Discrete emotion effects on lexical decision response times.

Directory of Open Access Journals (Sweden)

Benny B Briesemeister

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

Difference Discrete Variational Principle,EULER-Lagrange Cohomology and Symplectic, Multisymplectic Structures

OpenAIRE

Guo, H. Y.; Li, Y. Q.; Wu, K.; Wang, S. K.

2001-01-01

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 noncomutative differential geometry. By virtue of this variational principle, we get the difference discrete Euler-Lagrange equations and canonical ones for the difference discrete versions of the classical mechanics and classical field theory. We also explore the difference discrete versions for the Euler...

Reflectionless Discrete Schrödinger Operators are Spectrally Atypical

Science.gov (United States)

VandenBoom, Tom

2017-12-01

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

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

Discrete nonlinear Schrodinger equations with arbitrarily high-order nonlinearities

DEFF Research Database (Denmark)

Khare, A.; Rasmussen, Kim Ø; Salerno, M.

2006-01-01

-Ladik equation. As a common property, these equations possess three kinds of exact analytical stationary solutions for which the Peierls-Nabarro barrier is zero. Several properties of these solutions, including stability, discrete breathers, and moving solutions, are investigated.......A class of discrete nonlinear Schrodinger equations with arbitrarily high-order nonlinearities is introduced. These equations are derived from the same Hamiltonian using different Poisson brackets and include as particular cases the saturable discrete nonlinear Schrodinger equation and the Ablowitz...

DNA suspension arrays: silencing discrete artifacts for high-sensitivity applications.

Directory of Open Access Journals (Sweden)

Matthew S Lalonde

2010-11-01

Full Text Available Detection of low frequency single nucleotide polymorphisms (SNPs has important implications in early screening for tumorgenesis, genetic disorders and pathogen drug resistance. Nucleic acid arrays are a powerful tool for genome-scale SNP analysis, but detection of low-frequency SNPs in a mixed population on an array is problematic. We demonstrate a model assay for HIV-1 drug resistance mutations, wherein ligase discrimination products are collected on a suspension array. In developing this system, we discovered that signal from multiple polymorphisms was obscured by two discrete hybridization artifacts. Specifically: 1 tethering of unligated probes on the template DNA elicited false signal and 2 unpredictable probe secondary structures impaired probe capture and suppressed legitimate signal from the array. Two sets of oligonucleotides were used to disrupt these structures; one to displace unligated reporter labels from the bead-bound species and another to occupy sequences which interfered with array hybridization. This artifact silencing system resulted in a mean 21-fold increased sensitivity for 29 minority variants of 17 codons in our model assay for mutations most commonly associated with HIV-1 drug resistance. Furthermore, since the artifacts we characterized are not unique to our system, their specific inhibition might improve the quality of data from solid-state microarrays as well as from the growing number of multiple analyte suspension arrays relying on sequence-specific nucleic acid target capture.

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

Science.gov (United States)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

International Conference eXtended Discretization MethodS

CERN Document Server

Benvenuti, Elena

2016-01-01

This book gathers selected contributions on emerging research work presented at the International Conference eXtended Discretization MethodS (X-DMS), held in Ferrara in September 2015. It highlights the most relevant advances made at the international level in the context of expanding classical discretization methods, like finite elements, to the numerical analysis of a variety of physical problems. The improvements are intended to achieve higher computational efficiency and to account for special features of the solution directly in the approximation space and/or in the discretization procedure. The methods described include, among others, partition of unity methods (meshfree, XFEM, GFEM), virtual element methods, fictitious domain methods, and special techniques for static and evolving interfaces. The uniting feature of all contributions is the direct link between computational methodologies and their application to different engineering areas.

The ultimatum game: Discrete vs. continuous offers

Science.gov (United States)

Dishon-Berkovits, Miriam; Berkovits, Richard

2014-09-01

In many experimental setups in social-sciences, psychology and economy the subjects are requested to accept or dispense monetary compensation which is usually given in discrete units. Using computer and mathematical modeling we show that in the framework of studying the dynamics of acceptance of proposals in the ultimatum game, the long time dynamics of acceptance of offers in the game are completely different for discrete vs. continuous offers. For discrete values the dynamics follow an exponential behavior. However, for continuous offers the dynamics are described by a power-law. This is shown using an agent based computer simulation as well as by utilizing an analytical solution of a mean-field equation describing the model. These findings have implications to the design and interpretation of socio-economical experiments beyond the ultimatum game.

Applications of exterior difference systems to variations in discrete mechanics

International Nuclear Information System (INIS)

Xie Zheng; Li Hongbo

2008-01-01

In discrete mechanics, difference equations describe the fundamental physical laws and exhibit many geometric properties. Can these equations be obtained in a geometric way? Using some techniques in exterior difference systems, we investigate the discrete variational problem. As an application, we give a positive answer to the above question for the discrete Newton's, Euler-Lagrange, and Hamilton's equations

Asymptotic analysis of discrete schemes for non-equilibrium radiation diffusion

International Nuclear Information System (INIS)

Cui, Xia; Yuan, Guang-wei; Shen, Zhi-jun

2016-01-01

Motivated by providing well-behaved fully discrete schemes in practice, this paper extends the asymptotic analysis on time integration methods for non-equilibrium radiation diffusion in [2] to space discretizations. Therein studies were carried out on a two-temperature model with Larsen's flux-limited diffusion operator, both the implicitly balanced (IB) and linearly implicit (LI) methods were shown asymptotic-preserving. In this paper, we focus on asymptotic analysis for space discrete schemes in dimensions one and two. First, in construction of the schemes, in contrast to traditional first-order approximations, asymmetric second-order accurate spatial approximations are devised for flux-limiters on boundary, and discrete schemes with second-order accuracy on global spatial domain are acquired consequently. Then by employing formal asymptotic analysis, the first-order asymptotic-preserving property for these schemes and furthermore for the fully discrete schemes is shown. Finally, with the help of manufactured solutions, numerical tests are performed, which demonstrate quantitatively the fully discrete schemes with IB time evolution indeed have the accuracy and asymptotic convergence as theory predicts, hence are well qualified for both non-equilibrium and equilibrium radiation diffusion. - Highlights: • Provide AP fully discrete schemes for non-equilibrium radiation diffusion. • Propose second order accurate schemes by asymmetric approach for boundary flux-limiter. • Show first order AP property of spatially and fully discrete schemes with IB evolution. • Devise subtle artificial solutions; verify accuracy and AP property quantitatively. • Ideas can be generalized to 3-dimensional problems and higher order implicit schemes.

Peculiar symmetry structure of some known discrete nonautonomous equations

International Nuclear Information System (INIS)

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

2015-01-01

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

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.

Sequence-specific procedural learning deficits in children with specific language impairment.

Science.gov (United States)

Hsu, Hsinjen Julie; Bishop, Dorothy V M

2014-05-01

This study tested the procedural deficit hypothesis of specific language impairment (SLI) by comparing children's performance in two motor procedural learning tasks and an implicit verbal sequence learning task. Participants were 7- to 11-year-old children with SLI (n = 48), typically developing age-matched children (n = 20) and younger typically developing children matched for receptive grammar (n = 28). In a serial reaction time task, the children with SLI performed at the same level as the grammar-matched children, but poorer than age-matched controls in learning motor sequences. When tested with a motor procedural learning task that did not involve learning sequential relationships between discrete elements (i.e. pursuit rotor), the children with SLI performed comparably with age-matched children and better than younger grammar-matched controls. In addition, poor implicit learning of word sequences in a verbal memory task (the Hebb effect) was found in the children with SLI. Together, these findings suggest that SLI might be characterized by deficits in learning sequence-specific information, rather than generally weak procedural learning. © 2014 The Authors. Developmental Science Published by John Wiley & Sons Ltd.

Is Discrete Mathematics the New Math of the Eighties?

Science.gov (United States)

Hart, Eric W.

1985-01-01

Considered are what discrete mathematics includes, some parallels and differences between new math and discrete mathematics (listed in a table), and lessons to be learned. A list of references is included. (MNS)

Interactions of Soliton Waves for a Generalized Discrete KdV Equation

International Nuclear Information System (INIS)

Zhou Tong; Zhu Zuo-Nong

2017-01-01

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

repDNA: a Python package to generate various modes of feature vectors for DNA sequences by incorporating user-defined physicochemical properties and sequence-order effects.

Science.gov (United States)

Liu, Bin; Liu, Fule; Fang, Longyun; Wang, Xiaolong; Chou, Kuo-Chen

2015-04-15

In order to develop powerful computational predictors for identifying the biological features or attributes of DNAs, one of the most challenging problems is to find a suitable approach to effectively represent the DNA sequences. To facilitate the studies of DNAs and nucleotides, we developed a Python package called representations of DNAs (repDNA) for generating the widely used features reflecting the physicochemical properties and sequence-order effects of DNAs and nucleotides. There are three feature groups composed of 15 features. The first group calculates three nucleic acid composition features describing the local sequence information by means of kmers; the second group calculates six autocorrelation features describing the level of correlation between two oligonucleotides along a DNA sequence in terms of their specific physicochemical properties; the third group calculates six pseudo nucleotide composition features, which can be used to represent a DNA sequence with a discrete model or vector yet still keep considerable sequence-order information via the physicochemical properties of its constituent oligonucleotides. In addition, these features can be easily calculated based on both the built-in and user-defined properties via using repDNA. The repDNA Python package is freely accessible to the public at http://bioinformatics.hitsz.edu.cn/repDNA/. bliu@insun.hit.edu.cn or kcchou@gordonlifescience.org Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Commutative discrete filtering on unstructured grids based on least-squares techniques

International Nuclear Information System (INIS)

Haselbacher, Andreas; Vasilyev, Oleg V.

2003-01-01

The present work is concerned with the development of commutative discrete filters for unstructured grids and contains two main contributions. First, building on the work of Marsden et al. [J. Comp. Phys. 175 (2002) 584], a new commutative discrete filter based on least-squares techniques is constructed. Second, a new analysis of the discrete commutation error is carried out. The analysis indicates that the discrete commutation error is not only dependent on the number of vanishing moments of the filter weights, but also on the order of accuracy of the discrete gradient operator. The results of the analysis are confirmed by grid-refinement studies

Performance analysis of chi models using discrete-time probabilistic reward graphs

NARCIS (Netherlands)

Trcka, N.; Georgievska, S.; Markovski, J.; Andova, S.; Vink, de E.P.

2008-01-01

We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance analysis of systems exhibiting discrete deterministic time delays and probabilistic behavior, via their interpretation as discrete-time Markov reward chains, full-fledged platform for qualitative and

Testing Preference Axioms in Discrete Choice experiments

DEFF Research Database (Denmark)

Hougaard, Jens Leth; Østerdal, Lars Peter; Tjur, Tue

Recent studies have tested the preference axioms of completeness and transitivity, and have detected other preference phenomena such as unstability, learning- and tiredness effects, ordering effects and dominance, in stated preference discrete choice experiments. However, it has not been explicitly...... of the preference axioms and other preference phenomena in the context of stated preference discrete choice experiments, and examine whether or how these can be subject to meaningful (statistical) tests...

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

Science.gov (United States)

Sasaki, Ryu

2011-03-28

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

Discrete linear canonical transform computation by adaptive method.

Science.gov (United States)

Zhang, Feng; Tao, Ran; Wang, Yue

2013-07-29

The linear canonical transform (LCT) describes the effect of quadratic phase systems on a wavefield and generalizes many optical transforms. In this paper, the computation method for the discrete LCT using the adaptive least-mean-square (LMS) algorithm is presented. The computation approaches of the block-based discrete LCT and the stream-based discrete LCT using the LMS algorithm are derived, and the implementation structures of these approaches by the adaptive filter system are considered. The proposed computation approaches have the inherent parallel structures which make them suitable for efficient VLSI implementations, and are robust to the propagation of possible errors in the computation process.

Geometry of the Borel - de Siebenthal discrete series

DEFF Research Database (Denmark)

Ørsted, Bent; Wolf, Joseph A

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

A discrete-space urban model with environmental amenities

Science.gov (United States)

Liaila Tajibaeva; Robert G. Haight; Stephen Polasky

2008-01-01

This paper analyzes the effects of providing environmental amenities associated with open space in a discrete-space urban model and characterizes optimal provision of open space across a metropolitan area. The discrete-space model assumes distinct neighborhoods in which developable land is homogeneous within a neighborhood but heterogeneous across neighborhoods. Open...

Synchronous Parallel Emulation and Discrete Event Simulation System with Self-Contained Simulation Objects and Active Event Objects

Science.gov (United States)

Steinman, Jeffrey S. (Inventor)

1998-01-01

The present invention is embodied in a method of performing object-oriented simulation and a system having inter-connected processor nodes operating in parallel to simulate mutual interactions of a set of discrete simulation objects distributed among the nodes as a sequence of discrete events changing state variables of respective simulation objects so as to generate new event-defining messages addressed to respective ones of the nodes. The object-oriented simulation is performed at each one of the nodes by assigning passive self-contained simulation objects to each one of the nodes, responding to messages received at one node by generating corresponding active event objects having user-defined inherent capabilities and individual time stamps and corresponding to respective events affecting one of the passive self-contained simulation objects of the one node, restricting the respective passive self-contained simulation objects to only providing and receiving information from die respective active event objects, requesting information and changing variables within a passive self-contained simulation object by the active event object, and producing corresponding messages specifying events resulting therefrom by the active event objects.

MARKOV GRAPHS OF ONE–DIMENSIONAL DYNAMICAL SYSTEMS AND THEIR DISCRETE ANALOGUES AND THEIR DISCRETE ANALOGUES

Directory of Open Access Journals (Sweden)

SERGIY KOZERENKO

2016-04-01

Full Text Available One feature of the famous Sharkovsky’s theorem is that it can be proved using digraphs of a special type (the so–called Markov graphs. The most general definition assigns a Markov graph to every continuous map from the topological graph to itself. We show that this definition is too broad, i.e. every finite digraph can be viewed as a Markov graph of some one–dimensional dynamical system on a tree. We therefore consider discrete analogues of Markov graphs for vertex maps on combinatorial trees and characterize all maps on trees whose discrete Markov graphs are of the following types: complete, complete bipartite, the disjoint union of cycles, with every arc being a loop.

Multiband discrete ordinates method: formalism and results; Methode multibande aux ordonnees discretes: formalisme et resultats

Energy Technology Data Exchange (ETDEWEB)

Luneville, L

1998-06-01

The multigroup discrete ordinates method is a classical way to solve transport equation (Boltzmann) for neutral particles. Self-shielding effects are not correctly treated due to large variations of cross sections in a group (in the resonance range). To treat the resonance domain, the multiband method is introduced. The main idea is to divide the cross section domain into bands. We obtain the multiband parameters using the moment method; the code CALENDF provides probability tables for these parameters. We present our implementation in an existing discrete ordinates code: SN1D. We study deep penetration benchmarks and show the improvement of the method in the treatment of self-shielding effects. (author) 15 refs.

Discrete optimization

CERN Document Server

Parker, R Gary

1988-01-01

This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.Several appendixes are included which review the fundamental ideas o

Applying Multivariate Discrete Distributions to Genetically Informative Count Data.

Science.gov (United States)

Kirkpatrick, Robert M; Neale, Michael C

2016-03-01

We present a novel method of conducting biometric analysis of twin data when the phenotypes are integer-valued counts, which often show an L-shaped distribution. Monte Carlo simulation is used to compare five likelihood-based approaches to modeling: our multivariate discrete method, when its distributional assumptions are correct, when they are incorrect, and three other methods in common use. With data simulated from a skewed discrete distribution, recovery of twin correlations and proportions of additive genetic and common environment variance was generally poor for the Normal, Lognormal and Ordinal models, but good for the two discrete models. Sex-separate applications to substance-use data from twins in the Minnesota Twin Family Study showed superior performance of two discrete models. The new methods are implemented using R and OpenMx and are freely available.

Search Parameter Optimization for Discrete, Bayesian, and Continuous Search Algorithms

Science.gov (United States)

2017-09-01

NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CONTINUOUS SEARCH ALGORITHMS by...to 09-22-2017 4. TITLE AND SUBTITLE SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CON- TINUOUS SEARCH ALGORITHMS 5. FUNDING NUMBERS 6...simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and

The discrete Painleve II equations: Miura and auto-Baecklund transformations

International Nuclear Information System (INIS)

Carstea, A S; Ramani, A; Willox, R; Grammaticos, B

2003-01-01

We present Miura transformations for all discrete Painleve II equations known to date. We then use these Miuras to derive special solutions in terms of discrete Airy functions and to construct auto-Baecklund transformations for the discrete Painleve equations. These transformations are then used to generate rational solutions. Some new forms of d-P II and d-P 34 are obtained as well

Implementation of 2D Discrete Wavelet Transform by Number Theoretic Transform and 2D Overlap-Save Method

Directory of Open Access Journals (Sweden)

Lina Yang

2014-01-01

Full Text Available To reduce the computation complexity of wavelet transform, this paper presents a novel approach to be implemented. It consists of two key techniques: (1 fast number theoretic transform(FNTT In the FNTT, linear convolution is replaced by the circular one. It can speed up the computation of 2D discrete wavelet transform. (2 In two-dimensional overlap-save method directly calculating the FNTT to the whole input sequence may meet two difficulties; namely, a big modulo obstructs the effective implementation of the FNTT and a long input sequence slows the computation of the FNTT down. To fight with such deficiencies, a new technique which is referred to as 2D overlap-save method is developed. Experiments have been conducted. The fast number theoretic transform and 2D overlap-method have been used to implement the dyadic wavelet transform and applied to contour extraction in pattern recognition.

Generalized Detectability for Discrete Event Systems

Science.gov (United States)

Shu, Shaolong; Lin, Feng

2011-01-01

In our previous work, we investigated detectability of discrete event systems, which is defined as the ability to determine the current and subsequent states of a system based on observation. For different applications, we defined four types of detectabilities: (weak) detectability, strong detectability, (weak) periodic detectability, and strong periodic detectability. In this paper, we extend our results in three aspects. (1) We extend detectability from deterministic systems to nondeterministic systems. Such a generalization is necessary because there are many systems that need to be modeled as nondeterministic discrete event systems. (2) We develop polynomial algorithms to check strong detectability. The previous algorithms are based on observer whose construction is of exponential complexity, while the new algorithms are based on a new automaton called detector. (3) We extend detectability to D-detectability. While detectability requires determining the exact state of a system, D-detectability relaxes this requirement by asking only to distinguish certain pairs of states. With these extensions, the theory on detectability of discrete event systems becomes more applicable in solving many practical problems. PMID:21691432

CDM: Teaching Discrete Mathematics to Computer Science Majors

Science.gov (United States)

Sutner, Klaus

2005-01-01

CDM, for computational discrete mathematics, is a course that attempts to teach a number of topics in discrete mathematics to computer science majors. The course abandons the classical definition-theorem-proof model, and instead relies heavily on computation as a source of motivation and also for experimentation and illustration. The emphasis on…

Sputtering calculations with the discrete ordinated method

International Nuclear Information System (INIS)

Hoffman, T.J.; Dodds, H.L. Jr.; Robinson, M.T.; Holmes, D.K.

1977-01-01

The purpose of this work is to investigate the applicability of the discrete ordinates (S/sub N/) method to light ion sputtering problems. In particular, the neutral particle discrete ordinates computer code, ANISN, was used to calculate sputtering yields. No modifications to this code were necessary to treat charged particle transport. However, a cross section processing code was written for the generation of multigroup cross sections; these cross sections include a modification to the total macroscopic cross section to account for electronic interactions and small-scattering-angle elastic interactions. The discrete ordinates approach enables calculation of the sputtering yield as functions of incident energy and angle and of many related quantities such as ion reflection coefficients, angular and energy distributions of sputtering particles, the behavior of beams penetrating thin foils, etc. The results of several sputtering problems as calculated with ANISN are presented

Decomposing a Utility Function Based on Discrete Distribution Independence

DEFF Research Database (Denmark)

He, Ying; Dyer, James; Butler, John

2014-01-01

For two-attribute decision-making problems, the multilinear utility model cannot be applied when the risk aversion on one attribute depends on the level of the other attribute. We propose a family of general preference conditions called nth-degree discrete distribution independence that can...... accommodate a variety of dependence relationships between two attributes. The special case of second-degree discrete distribution independence is equivalent to the utility independence condition. We focus on third-degree discrete distribution independence that leads to a decomposition formula that contains...

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

KAUST Repository

Nobile, Fabio

2015-01-07

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

Illustrating chaos: a schematic discretization of the general three-body problem in Newtonian gravity

Science.gov (United States)

Leigh, Nathan W. C.; Wegsman, Shalma

2018-05-01

We present a formalism for constructing schematic diagrams to depict chaotic three-body interactions in Newtonian gravity. This is done by decomposing each interaction into a series of discrete transformations in energy- and angular momentum-space. Each time a transformation is applied, the system changes state as the particles re-distribute their energy and angular momenta. These diagrams have the virtue of containing all of the quantitative information needed to fully characterize most bound or unbound interactions through time and space, including the total duration of the interaction, the initial and final stable states in addition to every intervening temporary meta-stable state. As shown via an illustrative example for the bound case, prolonged excursions of one of the particles, which by far dominates the computational cost of the simulations, are reduced to a single discrete transformation in energy- and angular momentum-space, thereby potentially mitigating any computational expense. We further generalize our formalism to sequences of (unbound) three-body interactions, as occur in dense stellar environments during binary hardening. Finally, we provide a method for dynamically evolving entire populations of binaries via three-body scattering interactions, using a purely analytic formalism. In principle, the techniques presented here are adaptable to other three-body problems that conserve energy and angular momentum.

Application of multivariate splines to discrete mathematics

OpenAIRE

Xu, Zhiqiang

2005-01-01

Using methods developed in multivariate splines, we present an explicit formula for discrete truncated powers, which are defined as the number of non-negative integer solutions of linear Diophantine equations. We further use the formula to study some classical problems in discrete mathematics as follows. First, we extend the partition function of integers in number theory. Second, we exploit the relation between the relative volume of convex polytopes and multivariate truncated powers and giv...

Discrete Weighted Pseudo-Almost Automorphy and Applications

Directory of Open Access Journals (Sweden)

Zhinan Xia

2014-01-01

Full Text Available We deal with discrete weighted pseudo almost automorphy which extends some classical concepts and systematically explore its properties in Banach space including a composition result. As an application, we establish some sufficient criteria for the existence and uniqueness of the discrete weighted pseudo almost automorphic solutions to the Volterra difference equations of convolution type and also to nonautonomous semilinear difference equations. Some examples are presented to illustrate the main findings.

Discrete frequency identification using the HP 5451B Fourier analyser

International Nuclear Information System (INIS)

Holland, L.; Barry, P.

1977-01-01

The frequency analysis by the HP5451B discrete frequency Fourier analyser is studied. The advantages of cross correlation analysis to identify discrete frequencies in a background noise are discussed in conjuction with the elimination of aliasing and wraparound error. Discrete frequency identification is illustrated by a series of graphs giving the results of analysing 'electrical' and 'acoustical' white noise and sinusoidal signals [pt

Semi-Discrete Ingham-Type Inequalities

International Nuclear Information System (INIS)

Komornik, Vilmos; Loreti, Paola

2007-01-01

One of the general methods in linear control theory is based on harmonic and non-harmonic Fourier series. The key of this approach is the establishment of various suitable adaptations and generalizations of the classical Parseval equality. A new and systematic approach was begun in our papers in collaboration with Baiocchi. Many recent results of this kind, obtained through various Ingham-type theorems, were exposed recently. Although this work concentrated on continuous models, in connection with numerical simulations a natural question is whether these results also admit useful discrete versions. The purpose of this paper is to establish discrete versions of various Ingham-type theorems by using our approach. They imply the earlier continuous results by a simple limit process

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

A discrete dislocation–transformation model for austenitic single crystals

International Nuclear Information System (INIS)

Shi, J; Turteltaub, S; Remmers, J J C; Van der Giessen, E

2008-01-01

A discrete model for analyzing the interaction between plastic flow and martensitic phase transformations is developed. The model is intended for simulating the microstructure evolution in a single crystal of austenite that transforms non-homogeneously into martensite. The plastic flow in the untransformed austenite is simulated using a plane-strain discrete dislocation model. The phase transformation is modeled via the nucleation and growth of discrete martensitic regions embedded in the austenitic single crystal. At each instant during loading, the coupled elasto-plasto-transformation problem is solved using the superposition of analytical solutions for the discrete dislocations and discrete transformation regions embedded in an infinite homogeneous medium and the numerical solution of a complementary problem used to enforce the actual boundary conditions and the heterogeneities in the medium. In order to describe the nucleation and growth of martensitic regions, a nucleation criterion and a kinetic law suitable for discrete regions are specified. The constitutive rules used in discrete dislocation simulations are supplemented with additional evolution rules to account for the phase transformation. To illustrate the basic features of the model, simulations of specimens under plane-strain uniaxial extension and contraction are analyzed. The simulations indicate that plastic flow reduces the average stress at which transformation begins, but it also reduces the transformation rate when compared with benchmark simulations without plasticity. Furthermore, due to local stress fluctuations caused by dislocations, martensitic systems can be activated even though transformation would not appear to be favorable based on the average stress. Conversely, the simulations indicate that the plastic hardening behavior is influenced by the reduction in the effective austenitic grain size due to the evolution of transformation. During cyclic simulations, the coupled plasticity

3D imaging of nanomaterials by discrete tomography.

Science.gov (United States)

Batenburg, K J; Bals, S; Sijbers, J; Kübel, C; Midgley, P A; Hernandez, J C; Kaiser, U; Encina, E R; Coronado, E A; Van Tendeloo, G

2009-05-01

The field of discrete tomography focuses on the reconstruction of samples that consist of only a few different materials. Ideally, a three-dimensional (3D) reconstruction of such a sample should contain only one grey level for each of the compositions in the sample. By exploiting this property in the reconstruction algorithm, either the quality of the reconstruction can be improved significantly, or the number of required projection images can be reduced. The discrete reconstruction typically contains fewer artifacts and does not have to be segmented, as it already contains one grey level for each composition. Recently, a new algorithm, called discrete algebraic reconstruction technique (DART), has been proposed that can be used effectively on experimental electron tomography datasets. In this paper, we propose discrete tomography as a general reconstruction method for electron tomography in materials science. We describe the basic principles of DART and show that it can be applied successfully to three different types of samples, consisting of embedded ErSi(2) nanocrystals, a carbon nanotube grown from a catalyst particle and a single gold nanoparticle, respectively.

3D imaging of nanomaterials by discrete tomography

International Nuclear Information System (INIS)

Batenburg, K.J.; Bals, S.; Sijbers, J.; Kuebel, C.; Midgley, P.A.; Hernandez, J.C.; Kaiser, U.; Encina, E.R.; Coronado, E.A.; Van Tendeloo, G.

2009-01-01

The field of discrete tomography focuses on the reconstruction of samples that consist of only a few different materials. Ideally, a three-dimensional (3D) reconstruction of such a sample should contain only one grey level for each of the compositions in the sample. By exploiting this property in the reconstruction algorithm, either the quality of the reconstruction can be improved significantly, or the number of required projection images can be reduced. The discrete reconstruction typically contains fewer artifacts and does not have to be segmented, as it already contains one grey level for each composition. Recently, a new algorithm, called discrete algebraic reconstruction technique (DART), has been proposed that can be used effectively on experimental electron tomography datasets. In this paper, we propose discrete tomography as a general reconstruction method for electron tomography in materials science. We describe the basic principles of DART and show that it can be applied successfully to three different types of samples, consisting of embedded ErSi 2 nanocrystals, a carbon nanotube grown from a catalyst particle and a single gold nanoparticle, respectively.

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

21 CFR 862.2160 - Discrete photometric chemistry analyzer for clinical use.

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Discrete photometric chemistry analyzer for... Clinical Laboratory Instruments § 862.2160 Discrete photometric chemistry analyzer for clinical use. (a) Identification. A discrete photometric chemistry analyzer for clinical use is a device intended to duplicate...

Compensatory neurofuzzy model for discrete data classification in biomedical

Science.gov (United States)

Ceylan, Rahime

2015-03-01

Biomedical data is separated to two main sections: signals and discrete data. So, studies in this area are about biomedical signal classification or biomedical discrete data classification. There are artificial intelligence models which are relevant to classification of ECG, EMG or EEG signals. In same way, in literature, many models exist for classification of discrete data taken as value of samples which can be results of blood analysis or biopsy in medical process. Each algorithm could not achieve high accuracy rate on classification of signal and discrete data. In this study, compensatory neurofuzzy network model is presented for classification of discrete data in biomedical pattern recognition area. The compensatory neurofuzzy network has a hybrid and binary classifier. In this system, the parameters of fuzzy systems are updated by backpropagation algorithm. The realized classifier model is conducted to two benchmark datasets (Wisconsin Breast Cancer dataset and Pima Indian Diabetes dataset). Experimental studies show that compensatory neurofuzzy network model achieved 96.11% accuracy rate in classification of breast cancer dataset and 69.08% accuracy rate was obtained in experiments made on diabetes dataset with only 10 iterations.

Quasicanonical structure of optimal control in constrained discrete systems

Science.gov (United States)

Sieniutycz, S.

2003-06-01

This paper considers discrete processes governed by difference rather than differential equations for the state transformation. The basic question asked is if and when Hamiltonian canonical structures are possible in optimal discrete systems. Considering constrained discrete control, general optimization algorithms are derived that constitute suitable theoretical and computational tools when evaluating extremum properties of constrained physical models. The mathematical basis of the general theory is the Bellman method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage criterion which allows a variation of the terminal state that is otherwise fixed in the Bellman's method. Two relatively unknown, powerful optimization algorithms are obtained: an unconventional discrete formalism of optimization based on a Hamiltonian for multistage systems with unconstrained intervals of holdup time, and the time interval constrained extension of the formalism. These results are general; namely, one arrives at: the discrete canonical Hamilton equations, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory along with all basic results of variational calculus. Vast spectrum of applications of the theory is briefly discussed.

Adjoint Based A Posteriori Analysis of Multiscale Mortar Discretizations with Multinumerics

KAUST Repository

Tavener, Simon

2013-01-01

In this paper we derive a posteriori error estimates for linear functionals of the solution to an elliptic problem discretized using a multiscale nonoverlapping domain decomposition method. The error estimates are based on the solution of an appropriately defined adjoint problem. We present a general framework that allows us to consider both primal and mixed formulations of the forward and adjoint problems within each subdomain. The primal subdomains are discretized using either an interior penalty discontinuous Galerkin method or a continuous Galerkin method with weakly imposed Dirichlet conditions. The mixed subdomains are discretized using Raviart- Thomas mixed finite elements. The a posteriori error estimate also accounts for the errors due to adjoint-inconsistent subdomain discretizations. The coupling between the subdomain discretizations is achieved via a mortar space. We show that the numerical discretization error can be broken down into subdomain and mortar components which may be used to drive adaptive refinement.Copyright © by SIAM.

Testing the discreteness of spacetime at low energies

International Nuclear Information System (INIS)

Chardin, G.

1994-01-01

Expected at the Planck scale, the discreteness of spacetime can hardly be tested at such high energies in a foreseable future. However, the Bekenstein relation suggests another approach, based on the study of time-asymmetry. After a brief introduction to discrete physics, the relation between gravitation and discreteness on the one hand, and between gravitation and time-asymmetry on the other was investigated. These relations have led to reconsider the possibility that CP violation in the neutral kaon system, the only known microscopic 'arrow of time', could be attributed to gravitation. The arguments suggesting that 'antigravity' could occur for antimatter and could even be expected in General Relativity itself are summarized. Experimental tests are proposed. (author). 48 refs

Testing the discreteness of spacetime at low energies

Energy Technology Data Exchange (ETDEWEB)

Chardin, G. [CEA Centre d`Etudes de Saclay, 91 - Gif-sur-Yvette (France). Dept. d`Astrophysique, de la Physique des Particules, de la Physique Nucleaire et de l`Instrumentation Associee

1994-12-31

Expected at the Planck scale, the discreteness of spacetime can hardly be tested at such high energies in a foreseable future. However, the Bekenstein relation suggests another approach, based on the study of time-asymmetry. After a brief introduction to discrete physics, the relation between gravitation and discreteness on the one hand, and between gravitation and time-asymmetry on the other was investigated. These relations have led to reconsider the possibility that CP violation in the neutral kaon system, the only known microscopic `arrow of time`, could be attributed to gravitation. The arguments suggesting that `antigravity` could occur for antimatter and could even be expected in General Relativity itself are summarized. Experimental tests are proposed. (author). 48 refs.

Synchronization Of Parallel Discrete Event Simulations

Science.gov (United States)

Steinman, Jeffrey S.

1992-01-01

Adaptive, parallel, discrete-event-simulation-synchronization algorithm, Breathing Time Buckets, developed in Synchronous Parallel Environment for Emulation and Discrete Event Simulation (SPEEDES) operating system. Algorithm allows parallel simulations to process events optimistically in fluctuating time cycles that naturally adapt while simulation in progress. Combines best of optimistic and conservative synchronization strategies while avoiding major disadvantages. Algorithm processes events optimistically in time cycles adapting while simulation in progress. Well suited for modeling communication networks, for large-scale war games, for simulated flights of aircraft, for simulations of computer equipment, for mathematical modeling, for interactive engineering simulations, and for depictions of flows of information.

Systematization of Accurate Discrete Optimization Methods

Directory of Open Access Journals (Sweden)

V. A. Ovchinnikov

2015-01-01

Full Text Available The object of study of this paper is to define accurate methods for solving combinatorial optimization problems of structural synthesis. The aim of the work is to systemize the exact methods of discrete optimization and define their applicability to solve practical problems.The article presents the analysis, generalization and systematization of classical methods and algorithms described in the educational and scientific literature.As a result of research a systematic presentation of combinatorial methods for discrete optimization described in various sources is given, their capabilities are described and properties of the tasks to be solved using the appropriate methods are specified.

Multidimensional electron-photon transport with standard discrete ordinates codes

International Nuclear Information System (INIS)

Drumm, C.R.

1995-01-01

A method is described for generating electron cross sections that are compatible with standard discrete ordinates codes without modification. There are many advantages of using an established discrete ordinates solver, e.g. immediately available adjoint capability. Coupled electron-photon transport capability is needed for many applications, including the modeling of the response of electronics components to space and man-made radiation environments. The cross sections have been successfully used in the DORT, TWODANT and TORT discrete ordinates codes. The cross sections are shown to provide accurate and efficient solutions to certain multidimensional electronphoton transport problems

How Bob Barker Would (Probably) Teach Discrete Mathematics

Science.gov (United States)

Urness, Timothy

2010-01-01

This article proposes a discrete mathematics course in which games from "The Price Is Right" are used to engage students in a deeper, practical study of discrete mathematics. The games themselves are not the focus of the course; rather, the mathematical principles of the games give motivation for the concepts being taught. The game examples are…

On various integrable discretizations of a general two-component Volterra system

International Nuclear Information System (INIS)

Babalic, Corina N; Carstea, A S

2013-01-01

We present two integrable discretizations of a general differential–difference bicomponent Volterra system. The results are obtained by discretizing directly the corresponding Hirota bilinear equations in two different ways. Multisoliton solutions are presented together with a new discrete form of Lotka–Volterra equation obtained by an alternative bilinearization. (paper)

ToPS: a framework to manipulate probabilistic models of sequence data.

Directory of Open Access Journals (Sweden)

André Yoshiaki Kashiwabara

Full Text Available Discrete Markovian models can be used to characterize patterns in sequences of values and have many applications in biological sequence analysis, including gene prediction, CpG island detection, alignment, and protein profiling. We present ToPS, a computational framework that can be used to implement different applications in bioinformatics analysis by combining eight kinds of models: (i independent and identically distributed process; (ii variable-length Markov chain; (iii inhomogeneous Markov chain; (iv hidden Markov model; (v profile hidden Markov model; (vi pair hidden Markov model; (vii generalized hidden Markov model; and (viii similarity based sequence weighting. The framework includes functionality for training, simulation and decoding of the models. Additionally, it provides two methods to help parameter setting: Akaike and Bayesian information criteria (AIC and BIC. The models can be used stand-alone, combined in Bayesian classifiers, or included in more complex, multi-model, probabilistic architectures using GHMMs. In particular the framework provides a novel, flexible, implementation of decoding in GHMMs that detects when the architecture can be traversed efficiently.

Control of Discrete-Event Systems Automata and Petri Net Perspectives

CERN Document Server

Silva, Manuel; Schuppen, Jan

2013-01-01

Control of Discrete-event Systems provides a survey of the most important topics in the discrete-event systems theory with particular focus on finite-state automata, Petri nets and max-plus algebra. Coverage ranges from introductory material on the basic notions and definitions of discrete-event systems to more recent results. Special attention is given to results on supervisory control, state estimation and fault diagnosis of both centralized and distributed/decentralized systems developed in the framework of the Distributed Supervisory Control of Large Plants (DISC) project. Later parts of the text are devoted to the study of congested systems though fluidization, an over approximation allowing a much more efficient study of observation and control problems of timed Petri nets. Finally, the max-plus algebraic approach to the analysis and control of choice-free systems is also considered. Control of Discrete-event Systems provides an introduction to discrete-event systems for readers that are not familiar wi...

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.

Meteor localization via statistical analysis of spatially temporal fluctuations in image sequences

Science.gov (United States)

Kukal, Jaromír.; Klimt, Martin; Šihlík, Jan; Fliegel, Karel

2015-09-01

Meteor detection is one of the most important procedures in astronomical imaging. Meteor path in Earth's atmosphere is traditionally reconstructed from double station video observation system generating 2D image sequences. However, the atmospheric turbulence and other factors cause spatially-temporal fluctuations of image background, which makes the localization of meteor path more difficult. Our approach is based on nonlinear preprocessing of image intensity using Box-Cox and logarithmic transform as its particular case. The transformed image sequences are then differentiated along discrete coordinates to obtain statistical description of sky background fluctuations, which can be modeled by multivariate normal distribution. After verification and hypothesis testing, we use the statistical model for outlier detection. Meanwhile the isolated outlier points are ignored, the compact cluster of outliers indicates the presence of meteoroids after ignition.

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

Discrete Wigner function and quantum-state tomography

Science.gov (United States)

Leonhardt, Ulf

1996-05-01

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

Stabilization of discrete-time LTI positive systems

Directory of Open Access Journals (Sweden)

Krokavec Dušan

2017-12-01

Full Text Available The paper mitigates the existing conditions reported in the previous literature for control design of discrete-time linear positive systems. Incorporating an associated structure of linear matrix inequalities, combined with the Lyapunov inequality guaranteing asymptotic stability of discrete-time positive system structures, new conditions are presented with which the state-feedback controllers and the system state observers can be designed. Associated solutions of the proposed design conditions are illustrated by numerical illustrative examples.

Discrete Lorentzian quantum gravity

NARCIS (Netherlands)

Loll, R.

2000-01-01

Just as for non-abelian gauge theories at strong coupling, discrete lattice methods are a natural tool in the study of non-perturbative quantum gravity. They have to reflect the fact that the geometric degrees of freedom are dynamical, and that therefore also the lattice theory must be formulated

Is Fitts' law continuous in discrete aiming?

Directory of Open Access Journals (Sweden)

Rita Sleimen-Malkoun

Full Text Available The lawful continuous linear relation between movement time and task difficulty (i.e., index of difficulty; ID in a goal-directed rapid aiming task (Fitts' law has been recently challenged in reciprocal performance. Specifically, a discontinuity was observed at critical ID and was attributed to a transition between two distinct dynamic regimes that occurs with increasing difficulty. In the present paper, we show that such a discontinuity is also present in discrete aiming when ID is manipulated via target width (experiment 1 but not via target distance (experiment 2. Fitts' law's discontinuity appears, therefore, to be a suitable indicator of the underlying functional adaptations of the neuro-muscular-skeletal system to task properties/requirements, independently of reciprocal or discrete nature of the task. These findings open new perspectives to the study of dynamic regimes involved in discrete aiming and sensori-motor mechanisms underlying the speed-accuracy trade-off.

Comparative study of discretization methods of microarray data for inferring transcriptional regulatory networks

Directory of Open Access Journals (Sweden)

Ji Wei

2010-10-01

Full Text Available Abstract Background Microarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are used to discretize microarray data. Selection of the discretization method is often arbitrary and no systematic comparison of different discretization has been conducted, in the context of gene regulatory network inference from time series gene expression data. Results In this study, we propose a new discretization method "bikmeans", and compare its performance with four other widely-used discretization methods using different datasets, modeling algorithms and number of intervals. Sensitivities, specificities and total accuracies were calculated and statistical analysis was carried out. Bikmeans method always gave high total accuracies. Conclusions Our results indicate that proper discretization methods can consistently improve gene regulatory network inference independent of network modeling algorithms and datasets. Our new method, bikmeans, resulted in significant better total accuracies than other methods.

Integer valued autoregressive processes with generalized discrete Mittag-Leffler marginals

Directory of Open Access Journals (Sweden)

Kanichukattu K. Jose

2013-05-01

Full Text Available In this paper we consider a generalization of discrete Mittag-Leffler distributions. We introduce and study the properties of a new distribution called geometric generalized discrete Mittag-Leffler distribution. Autoregressive processes with geometric generalized discrete Mittag-Leffler distributions are developed and studied. The distributions are further extended to develop a more general class of geometric generalized discrete semi-Mittag-Leffler distributions. The processes are extended to higher orders also. An application with respect to an empirical data on customer arrivals in a bank counter is also given. Various areas of potential applications like human resource development, insect growth, epidemic modeling, industrial risk modeling, insurance and actuaries, town planning etc are also discussed.

Local bounds preserving stabilization for continuous Galerkin discretization of hyperbolic systems

Science.gov (United States)

Mabuza, Sibusiso; Shadid, John N.; Kuzmin, Dmitri

2018-05-01

The objective of this paper is to present a local bounds preserving stabilized finite element scheme for hyperbolic systems on unstructured meshes based on continuous Galerkin (CG) discretization in space. A CG semi-discrete scheme with low order artificial dissipation that satisfies the local extremum diminishing (LED) condition for systems is used to discretize a system of conservation equations in space. The low order artificial diffusion is based on approximate Riemann solvers for hyperbolic conservation laws. In this case we consider both Rusanov and Roe artificial diffusion operators. In the Rusanov case, two designs are considered, a nodal based diffusion operator and a local projection stabilization operator. The result is a discretization that is LED and has first order convergence behavior. To achieve high resolution, limited antidiffusion is added back to the semi-discrete form where the limiter is constructed from a linearity preserving local projection stabilization operator. The procedure follows the algebraic flux correction procedure usually used in flux corrected transport algorithms. To further deal with phase errors (or terracing) common in FCT type methods, high order background dissipation is added to the antidiffusive correction. The resulting stabilized semi-discrete scheme can be discretized in time using a wide variety of time integrators. Numerical examples involving nonlinear scalar Burgers equation, and several shock hydrodynamics simulations for the Euler system are considered to demonstrate the performance of the method. For time discretization, Crank-Nicolson scheme and backward Euler scheme are utilized.

Discrete spectroscopy in {sup 180}Os at high spins

Energy Technology Data Exchange (ETDEWEB)

Marti, G; Venkova, Ts; Morek, T; Schnare, H; Gast, W; Georgiev, A; Spohr, K M; Lieder, R M [Institut fuer Kernphysik, KFA-Juelich (Germany); Maier, K H [Hahn-Meitner-Institut Berlin GmbH (Germany); Zell, K O [Institut fuer Kernphysik, Universitaet Koeln (Germany)

1992-08-01

New information on rotational bands in {sup 180}Os was obtained from a discrete spectroscopy experiment in which the final nucleus was populated through the {sup 150}Nd({sup 36}S,6n) reaction at 177 MeV. A new strongly-coupled rotational band starting at a relatively high excitation energy was found. The observation and placement of the 185.6 keV in the level scheme gives strong support to a hypothetical 2-quasineutron configuration assigned to the 7{sup -} isomeric bands in {sup 180}Os and the isotone {sup 178}W. Band mixing between the (-,1){sub 1} and (-,1){sub 3} bands of same parity and signature was observed, and the interaction strength was estimated from experimental branching ratios. The authors` results confirm a previous assignment for the yrast and yrare sequences in this nucleus. With the identification of new transitions above the states with I {approx_equal} 24, previously assigned bands had to be revised, with the result that the second band crossing vanishes. 23 refs., 3 figs.

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

International Nuclear Information System (INIS)

An Zongwen; Huang Hongzhong; Liu Yu

2008-01-01

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