Messier, Terri L; O'Neill, J Patrick; Finette, Barry A
2006-08-01
The V(D)J recombinase enzyme complex is responsible for the development of a diverse immune system by catalyzing intra-molecular rearrangements of immunoglobulin (Ig) and T cell receptor (TCR) genes at specific recombination signal sequences (RSSs). This enzyme complex has also been implicated in mediating pathologic and non-pathologic intra- and inter-molecular genomic rearrangements at cryptic (Psi) RSSs outside the immune system loci in lymphoid cells. We describe here two V(D)J recombinase mediated genomic rearrangements resulting in alterations at the HPRT locus in human T-cells. These are inter-chromosomal insertions in which DNA fragments are inserted at breakpoints generated by V(D)J recombinase cleavage at Psi RSS sites in the HPRT locus at Xq26. In the first, a TCR signal ended segment from chromosome 14q11 is inserted at a Psi RSS in intron 1 of the HPRT locus. In the second, a DNA fragment from 9q22 is integrated between the coding ends generated by a V(D)J recombinase mediated HPRT deletion. Identification of these in vivo V(D)J mediated inter-chromosomal insertions at Psi RSSs in the HPRT gene supports the accumulating evidence that V(D)J recombinase can mediate mutagenic rearrangements in humans with potential pathologic consequences.
Discrete low-discrepancy sequences
Angel, Omer; Martin, James B; Propp, James
2009-01-01
Holroyd and Propp used Hall's marriage theorem to show that, given a probability distribution pi on a finite set S, there exists an infinite sequence s_1,s_2,... in S such that for all integers k >= 1 and all s in S, the number of i in [1,k] with s_i = s differs from k pi(s) by at most 1. We prove a generalization of this result using a simple explicit algorithm. A special case of this algorithm yields an extension of Holroyd and Propp's result to the case of discrete probability distributions on infinite sets.
Interchromosomal huddle kickstarts antiviral defense.
Schoenfelder, Stefan; Fraser, Peter
2008-07-11
Long-distance chromosomal interactions are emerging as a potential mechanism of gene expression control. In this issue, Apostolou and Thanos (2008) describe how viral infection elicits interchromosomal associations between the interferon-beta (IFN-beta) gene enhancer and DNA binding sites of the transcription factor NF-kappaB, resulting in the initiation of transcription and an antiviral response.
Analysis of interchromosomal mitotic recombination.
McGill, C B; Shafer, B K; Higgins, D R; Strathern, J N
1990-07-01
A novel synthetic locus is described that provides a simple assay system for characterizing mitotic recombinants. The locus consists of the TRP1 and HIS3 genes inserted into chromosome III of S. cerevisiae between the CRY1 and MAT loci. Defined trp1 and his3 alleles have been generated that allow the selection of interchromosomal recombinants in this interval. Trp+ or His+ recombinants can be divided into several classes based on coupling of the other alleles in the interval. The tight linkage of the CRY1 and MAT loci, combined with the drug resistance and cell type phenotypes that they respectively control, facilitates the classification of the recombinants without resorting to tetrad dissection. We present the distribution of spontaneous recombinants among the classes defined by this analysis. The data suggest that the recombination intermediate can have regions of symmetric strand exchange and that co-conversion tracts can extend over 1-3 kb. Continuous conversion tracts are favored over discontinuous tracts. The distribution among the classes defined by this analysis is altered in recombinants induced by UV irradiation.
Insertion DNA Accelerates Meiotic Interchromosomal Recombination in Arabidopsis thaliana.
Sun, Xiao-Qin; Li, Ding-Hong; Xue, Jia-Yu; Yang, Si-Hai; Zhang, Yan-Mei; Li, Mi-Mi; Hang, Yue-Yu
2016-08-01
Nucleotide insertions/deletions are ubiquitous in eukaryotic genomes, and the resulting hemizygous (unpaired) DNA has significant, heritable effects on adjacent DNA. However, little is known about the genetic behavior of insertion DNA. Here, we describe a binary transgenic system to study the behavior of insertion DNA during meiosis. Transgenic Arabidopsis lines were generated to carry two different defective reporter genes on nonhomologous chromosomes, designated as "recipient" and "donor" lines. Double hemizygous plants (harboring unpaired DNA) were produced by crossing between the recipient and the donor, and double homozygous lines (harboring paired DNA) via self-pollination. The transfer of the donor's unmutated sequence to the recipient generated a functional β-glucuronidase gene, which could be visualized by histochemical staining and corroborated by polymerase chain reaction amplification and sequencing. More than 673 million seedlings were screened, and the results showed that meiotic ectopic recombination in the hemizygous lines occurred at a frequency >6.49-fold higher than that in the homozygous lines. Gene conversion might have been exclusively or predominantly responsible for the gene correction events. The direct measurement of ectopic recombination events provided evidence that an insertion, in the absence of an allelic counterpart, could scan the entire genome for homologous counterparts with which to pair. Furthermore, the unpaired (hemizygous) architectures could accelerate ectopic recombination between itself and interchromosomal counterparts. We suggest that the ectopic recombination accelerated by hemizygous architectures may be a general mechanism for interchromosomal recombination through ubiquitously dispersed repeat sequences in plants, ultimately contributing to genetic renovation and eukaryotic evolution.
Pseudo-Random Sequences Generator Based on Discrete Hyperchaotic Systems
李昌刚; 韩正之
2003-01-01
We first design a discrete hyperchaotic system via piecewise linear state feedback. The states of the closed loop system are locally expanding in two directions but absolutely bounded on the whole, which implies hyperchaos. Then, we use three suchlike hyperchaotie systems with different feedback gain matrices to design a pseudo-random sequence generator (PRSG). Through a threshold function, three sub-sequences generated from the output of piecewise linear functions are changed into 0-1 sequences. Then, followed by XOR operation, an unpredictable pseudo-random sequence (PRS) is ultimately obtained. The analysis and simulation results indicate that the PRS, generated with hyperchaotic systems, has desirable statistical features.
Cognitive processing in new and practiced discrete keying sequences
Willem B Verwey
2010-07-01
Full Text Available This study addresses the role of cognitive control in the initiation and execution of familiar and unfamiliar movement sequences. To become familiar with two movement sequences participants first practiced two discrete key press sequences by responding to two fixed series of 6 key specific stimuli. In the ensuing test phase they executed these two familiar and also two unfamiliar keying sequences while there was a two-third chance a tone was presented together with one randomly selected key specific stimulus in each sequence. In the counting condition of the test phase participants counted the low pitched (i.e., target tones. By and large the results support the dual processor model in which the prime role of the cognitive processor shifts from executing to initiating sequences while the gradual development of motor chunks allows a motor processor to execute the sequences. Yet, the results extend this simple model by suggesting that with little practice sequence execution is based also on some non-cognitive (perhaps associative learning mechanism and, for some participants, on the use of explicit sequence knowledge. Also, after extensive practice the cognitive processor appears to still contribute to slower responses. The occurrence of long interkey intervals was replicated suggesting that fixed 6-key sequences include several motor chunks. Yet, no indication was found that the cognitive processor is responsible for concatenating these chunks.
Dynamics of Sequence -Discrete Bacterial Populations Inferred Using Metagenomes
Stevens, Sarah; Bendall, Matthew; Kang, Dongwan; Froula, Jeff; Egan, Rob; Chan, Leong-Keat; Tringe, Susannah; McMahon, Katherine; Malmstrom, Rex
2014-03-14
From a multi-year metagenomic time series of two dissimilar Wisconsin lakes we have assembled dozens of genomes using a novel approach that bins contigs into distinct genome based on sequence composition, e.g. kmer frequencies, and contig coverage patterns at various times points. Next, we investigated how these genomes, which represent sequence-discrete bacterial populations, evolved over time and used the time series to discover the population dynamics. For example, we explored changes in single nucleotide polymorphism (SNP) frequencies as well as patterns of gene gain and loss in multiple populations. Interestingly, SNP diversity was purged at nearly every genome position in some populations during the course of this study, suggesting these populations may have experienced genome-wide selective sweeps. This represents the first direct, time-resolved observations of periodic selection in natural populations, a key process predicted by the ecotype model of bacterial diversification.
Control of automated behavior: insights from the discrete sequence production task
Abrahamse, E.L.; Ruitenberg, M.F.L.; de Kleine, Elian; Verwey, Willem B.
2013-01-01
Work with the discrete sequence production (DSP) task has provided a substantial literature on discrete sequencing skill over the last decades. The purpose of the current article is to provide a comprehensive overview of this literature and of the theoretical progress that it has prompted. We start
Grant, E.; Shallit, J.; Stoll, T.
Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show by combinatorial means that sequences cannot be "too" different, and by an explicit construction generalizing the Rudin-Shapiro sequence, we show that we can achieve the maximum possible difference.
Fibonacci Sequence, Recurrence Relations, Discrete Probability Distributions and Linear Convolution
Rajan, Arulalan; Rao, Ashok; Jamadagni, H S
2012-01-01
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer coe?cients from the point of view of probability distributions that they induce. We obtain the generalizations of some of the known limiting properties of these probability distributions and present certain optimal properties of the classical Fibonacci sequence in this context. In addition, we also look at the self linear convolution of linear recurrence relations with positive integer coefficients. Analysis of self linear convolution is focused towards locating the maximum in the resulting sequence. This analysis, also highlights the influence that the largest positive real root, of the "characteristic equation" of the linear recurrence relations with positive integer coefficients, has on the location of the maximum. In particular, when the largest positive real root is 2,the locatio...
Substitutive Arnoux-Rauzy sequences have pure discrete spectrum
Berthé, Valérie; Siegel, Anne
2011-01-01
We prove that the symbolic dynamical system generated by a purely substitutive Arnoux-Rauzy sequence is measurably conjugate to a toral translation. The proof is based on an explicit construction of a fundamental domain with fractal boundary (a Rauzy fractal) for this toral translation. Such a fractal is obtained as the Hausdorff limit of a sequence of compact planar sets, where each set is the projection of a finite union of faces of unit cubes generated by a multidimensional version of the underlying Arnoux-Rauzy substitution.
Huang Zhenkun [Department of Mathematics, School of Sciences, Zhejiang University, Hangzhou, Zhejiang 310027 (China) and School of Sciences, Jimei University, Xiamen, Fujian 361021 (China)]. E-mail: huangdoc@tom.com; Wang Xinghua [Department of Mathematics, School of Sciences, Zhejiang University, Hangzhou, Zhejiang 310027 (China); Gao Feng [School of Sciences, Jimei University, Xiamen, Fujian 361021 (China)
2006-02-06
In this Letter, we discuss discrete-time analogue of a continuous-time cellular neural network. Sufficient conditions are obtained for the existence of a unique almost periodic sequence solution which is globally attractive. Our results demonstrate dynamics of the formulated discrete-time analogue as mathematical models for the continuous-time cellular neural network in almost periodic case. Finally, a computer simulation illustrates the suitability of our discrete-time analogue as numerical algorithms in simulating the continuous-time cellular neural network conveniently.
Gabrieli, Paolo; Gomulski, Ludvik M; Bonomi, Angelica; Siciliano, Paolo; Scolari, Francesca; Franz, Gerald; Jessup, Andrew; Malacrida, Anna R; Gasperi, Giuliano
2011-03-07
Diptera have an extraordinary variety of sex determination mechanisms, and Drosophila melanogaster is the paradigm for this group. However, the Drosophila sex determination pathway is only partially conserved and the family Tephritidae affords an interesting example. The tephritid Y chromosome is postulated to be necessary to determine male development. Characterization of Y sequences, apart from elucidating the nature of the male determining factor, is also important to understand the evolutionary history of sex chromosomes within the Tephritidae. We studied the Y sequences from the olive fly, Bactrocera oleae. Its Y chromosome is minute and highly heterochromatic, and displays high heteromorphism with the X chromosome. A combined Representational Difference Analysis (RDA) and fluorescence in-situ hybridization (FISH) approach was used to investigate the Y chromosome to derive information on its sequence content. The Y chromosome is strewn with repetitive DNA sequences, the majority of which are also interdispersed in the pericentromeric regions of the autosomes. The Y chromosome appears to have accumulated small and large repetitive interchromosomal duplications. The large interchromosomal duplications harbour an importin-4-like gene fragment. Apart from these importin-4-like sequences, the other Y repetitive sequences are not shared with the X chromosome, suggesting molecular differentiation of these two chromosomes. Moreover, as the identified Y sequences were not detected on the Y chromosomes of closely related tephritids, we can infer divergence in the repetitive nature of their sequence contents. The identification of Y-linked sequences may tell us much about the repetitive nature, the origin and the evolution of Y chromosomes. We hypothesize how these repetitive sequences accumulated and were maintained on the Y chromosome during its evolutionary history. Our data reinforce the idea that the sex chromosomes of the Tephritidae may have distinct evolutionary
Paolo Gabrieli
Full Text Available BACKGROUND: Diptera have an extraordinary variety of sex determination mechanisms, and Drosophila melanogaster is the paradigm for this group. However, the Drosophila sex determination pathway is only partially conserved and the family Tephritidae affords an interesting example. The tephritid Y chromosome is postulated to be necessary to determine male development. Characterization of Y sequences, apart from elucidating the nature of the male determining factor, is also important to understand the evolutionary history of sex chromosomes within the Tephritidae. We studied the Y sequences from the olive fly, Bactrocera oleae. Its Y chromosome is minute and highly heterochromatic, and displays high heteromorphism with the X chromosome. METHODOLOGY/PRINCIPAL FINDINGS: A combined Representational Difference Analysis (RDA and fluorescence in-situ hybridization (FISH approach was used to investigate the Y chromosome to derive information on its sequence content. The Y chromosome is strewn with repetitive DNA sequences, the majority of which are also interdispersed in the pericentromeric regions of the autosomes. The Y chromosome appears to have accumulated small and large repetitive interchromosomal duplications. The large interchromosomal duplications harbour an importin-4-like gene fragment. Apart from these importin-4-like sequences, the other Y repetitive sequences are not shared with the X chromosome, suggesting molecular differentiation of these two chromosomes. Moreover, as the identified Y sequences were not detected on the Y chromosomes of closely related tephritids, we can infer divergence in the repetitive nature of their sequence contents. CONCLUSIONS/SIGNIFICANCE: The identification of Y-linked sequences may tell us much about the repetitive nature, the origin and the evolution of Y chromosomes. We hypothesize how these repetitive sequences accumulated and were maintained on the Y chromosome during its evolutionary history. Our data
Interpolation on a fixed interval discrete-valued sequence with random structure
D. H. Ilyasova
2011-06-01
Full Text Available Discrete-valued sequences with random structure are widely used to describe electronic systems that operate under a priori uncertainty. An optimal interpolation algorithm on a fixed interval discrete-valued sequence with random structure have been obtained considering the Markov property of an extended process, which includes the value of a discrete-type sequence and its structure. This algorithm is recursive, and describes the evolution of the joint interpolation probability of the extended process in reverse time. Analysis of the optimal interpolation algorithm on a fixed interval was implemented by the example of decoding of a convolutional code by means of statistical computer modeling. For this example interpolation algorithm reduces the bit error probability to 3-4 times compared with the algorithm of filtering due to the fact that it takes into account all the received observations. The increase of statistical dependence between input symbols leads to a decrease in bit error rate in filtration and interpolation algorithms.
Vinga Susana
2012-05-01
Full Text Available Abstract Background Chaos Game Representation (CGR is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2-L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations. Results The exploratory analysis described here consisted of selecting foundational string problems and refactoring them using CGR-based algorithms. We found that CGR can take the role of suffix trees and emulate sophisticated string algorithms, efficiently solving exact and approximate string matching problems such as finding all palindromes and tandem repeats, and matching with mismatches. The common feature of these problems is that they use longest common extension (LCE queries as subtasks of their procedures, which we show to have a constant time solution with CGR. Additionally, we show that CGR can be used as a rolling hash function within the Rabin-Karp algorithm. Conclusions The analysis of biological sequences relies on algorithmic foundations facing mounting challenges, both logistic (performance and analytical (lack of unifying mathematical framework. CGR is found to provide the latter and to promise the former: graph-based data structures for sequence analysis operations are entailed by numerical-based data structures produced by CGR maps, providing a unifying analytical framework for a diversity of pattern matching problems.
Saini, Shiwani; Dewan, Lillie
2016-01-01
This paper highlights the potential of discrete wavelet transforms in the analysis and comparison of genomic sequences of Mycobacterium tuberculosis (MTB) with different resistance characteristics. Graphical representations of wavelet coefficients and statistical estimates of their parameters have been used to determine the extent of similarity between different sequences of MTB without the use of conventional methods such as Basic Local Alignment Search Tool. Based on the calculation of the energy of wavelet decomposition coefficients of complete genomic sequences, their broad classification of the type of resistance can be done. All the given genomic sequences can be grouped into two broad categories wherein the drug resistant and drug susceptible sequences form one group while the multidrug resistant and extensive drug resistant sequences form the other group. This method of segregation of the sequences is faster than conventional laboratory methods which require 3-4 weeks of culture of sputum samples. Thus the proposed method can be used as a tool to enhance clinical diagnostic investigations in near real-time.
Temporal and Rate Coding for Discrete Event Sequences in the Hippocampus.
Terada, Satoshi; Sakurai, Yoshio; Nakahara, Hiroyuki; Fujisawa, Shigeyoshi
2017-06-21
Although the hippocampus is critical to episodic memory, neuronal representations supporting this role, especially relating to nonspatial information, remain elusive. Here, we investigated rate and temporal coding of hippocampal CA1 neurons in rats performing a cue-combination task that requires the integration of sequentially provided sound and odor cues. The majority of CA1 neurons displayed sensory cue-, combination-, or choice-specific (simply, "event"-specific) elevated discharge activities, which were sustained throughout the event period. These event cells underwent transient theta phase precession at event onset, followed by sustained phase locking to the early theta phases. As a result of this unique single neuron behavior, the theta sequences of CA1 cell assemblies of the event sequences had discrete representations. These results help to update the conceptual framework for space encoding toward a more general model of episodic event representations in the hippocampus. Copyright © 2017 Elsevier Inc. All rights reserved.
Getz, Neil H.
1993-11-01
The discrete wavelet transform (DWT) is adapted to functions on the discrete circle to create a discrete periodic wavelet transform (DPWT) for bounded periodic sequences. This extension also offers a solution to the problem of non-invertibility that arises in the application of the DWT to finite length sequences and provides the proper theoretical setting for the completion of some previous incomplete solutions to the invertibility problem. It is proven that the same filter coefficients used with the DWT to create orthonormal wavelets on compact support in l(infinity ) (Z) may be incorporated through the DPWT to create an orthonormal basis of discrete periodic wavelets. By exploiting transform symmetry and periodicity we arrive at easily implementable and fast synthesis and analysis algorithms.
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.
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.
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…
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…
Default cycle phases determined after modifying discrete DNA sequences in plant cells
Sans, J.; Leyton, C. [Universidad de Chile, Santiago (Chile). Facultad de Medicina; Gimenez-Abian, M.I.; Gimenez-Abian, J.F.; Aller, P.; De La Torre, C. [Centro de Investigaciones Biologicas, CSIC, Madrid (Spain)
1997-02-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{sub 1} phase to advance into S, while those in G{sub 2} remained in G{sub 2} and cells in prophase returned to G{sub 2} when both sets of sequences involved in the positive and negative controls were bromosubstituted and later irradiated. In this way, not only G{sub 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).
L. Kim (LarkKyun); E. Esplugues (Enric); C.E. Zorca (Cornelia); F. Parisi (Francesco); Y. Kluger (Yuval); T.H. Kim (Tae Hoon); N.J. Galjart (Niels); R.A. Flavell (Richard)
2014-01-01
textabstractInterchromosomal associations can regulate gene expression, but little is known about the molecular basis of such associations. In response to antigen stimulation, naive Tcells can differentiate into Th1, Th2, and Th17 cells expressing IFN-γ, IL-4, and IL-17, respectively. We previously
Waelbroeck, H
1999-01-01
We propose a theory of deterministic chaos for discrete systems, based on their representations in symbolic history spaces Ømega. These are spaces of semi-infinite sequences, as the one-sided shift spaces, but endowed with a more general topology which we call a semicausal topology. We show that define metrical properties, including the correlation dimension of the attractor. Examples are considered: Asymmetric neural networks and random cellular automata are not chaotic. A neural network model with memory, on the other hand, does appear to be an example of discrete chaos.
Gill, Wonpyong
2016-08-01
In a previous study, the crossing time for the overdominant case in an infinite population was found to be saturated at a long sequence length in the diploid, coupled, discrete-time, mutation-selection model. The present study focused on the effect of a finite population size on the crossing time for the overdominant case. The dependence of the crossing time on the sequence length was simulated for a range of dominance parameters and selective advantages by switching on a diploid, asymmetric, bridged landscape from an initial state, a steady state in a diploid, bridged landscape. The boundary between the deterministic and the stochastic regions in the diploid, coupled, discrete-time, mutation-selection model was characterized using the same formula as that in the haploid, coupled, discrete-time, mutation-selection model. The crossing time in a finite population with various population sizes, dominance parameters and selective advantages began to deviate from the crossing time for an infinite population at a critical sequence length. The crossing time for a finite population in the stochastic region was found to be an exponentially increasing function of the sequence length, whose rate was unchanged, regardless of changes in the population size, dominance parameter and selective advantage with a fixed extension parameter. Therefore, the saturation of the crossing time at a long sequence length, which was observed for the overdominant case in an infinite population, could not be realized for a finite population.
Pathak, Rupak; Koturbash, Igor; Hauer-Jensen, Martin
2017-01-11
Ionizing radiation (IR) induces numerous stable and unstable chromosomal aberrations. Unstable aberrations, where chromosome morphology is substantially compromised, can easily be identified by conventional chromosome staining techniques. However, detection of stable aberrations, which involve exchange or translocation of genetic materials without considerable modification in the chromosome morphology, requires sophisticated chromosome painting techniques that rely on in situ hybridization of fluorescently labeled DNA probes, a chromosome painting technique popularly known as fluorescence in situ hybridization (FISH). FISH probes can be specific for whole chromosome/s or precise sub-region on chromosome/s. The method not only allows visualization of stable aberrations, but it can also allow detection of the chromosome/s or specific DNA sequence/s involved in a particular aberration formation. A variety of chromosome painting techniques are available in cytogenetics; here two highly sensitive methods, multiple fluorescence in situ hybridization (mFISH) and spectral karyotyping (SKY), are discussed to identify inter-chromosomal stable aberrations that form in the bone marrow cells of mice after exposure to total body irradiation. Although both techniques rely on fluorescent labeled DNA probes, the method of detection and the process of image acquisition of the fluorescent signals are different. These two techniques have been used in various research areas, such as radiation biology, cancer cytogenetics, retrospective radiation biodosimetry, clinical cytogenetics, evolutionary cytogenetics, and comparative cytogenetics.
Laureano Lucimar AF
2009-12-01
Full Text Available Abstract Background Infertility is a natural mechanism of selection intended to prevent the delivery of a child with malformations or mental retardation. Male infertility is closely related to chromosomal abnormalities. This study was focused on the analysis of meiotic segregation involving a Robertsonian translocation, 45,XY,der(13;13 [56]/45,XY,der(13;14 [44] and the evaluation of possible interchromosomal effects. Results Hybridisation with LSI 13q14 and subtelomere 14q probes and WCP13 SpectrumGreen and WCP14 SpectrumOrange probes showed a high proportion of unbalanced gametes, corresponding to 71.2% of the spermatozoa. The disomic frequencies of the sexual chromosomes and chromosome 18 of the patient were higher (5.28% and 2.55%, respectively than those of the control (0.6% and 0.59%, respectively. Conclusion Meiotic segregation studies in sperm are an important tool for genetic counselling of chromosomal aberrations, allowing for a prediction of the risks and consequent implications for the reproductive life. The patient with this rare translocation exhibited meiotic segregation fidelity, and a high rate of unbalanced gametes with disomic spermatozoa.
Lindenbaum, R H; Hultén, M; McDermott, A; Seabright, M
1985-01-01
It has been suggested that translocations, and perhaps other chromosome rearrangements, disturb meiotic disjunction of uninvolved chromosome pairs and predispose to trisomic offspring. If so, then one would expect an excess of translocations not involving chromosome 21 among the parents of regular trisomic Down's syndrome patients. Such translocations have been reported, but mostly as anecdotal single case reports or very small series. In an attempt to collect a larger series, a collaborative study of regular Down's syndrome families was made in southern England. This was retrospective, and covered periods of 7 to 10 years since 1970. The number of regular trisomy families investigated was 1454. Only 945 of the 2908 parents were karyotyped, and 10 balanced reciprocal translocations not involving chromosome 21 were identified, together with one Robertsonian (13q14q). Expressing these as percentages of the parents tested (945), prevalences are as follows: reciprocals 1.06%, Robertsonians 0.11%, and all translocations 1.16%. Expressed as percentages of the total parents (2908), tested and untested, the prevalences are 0.34%, 0.03%, and 0.37% respectively. The 'true' prevalences, that is what would have been found had all parents been tested, must lie between these two sets of figures. The prevalence of reciprocal translocations exceeds that found for consecutive banded newborn infants, which is 0.16%, and this excess may reflect a real interchromosomal effect. Robertsonian translocations in the banded newborn series are at a frequency of 0.11%, identical to that found in the tested parents of regular trisomics. Interpretation of these figures is critically dependent upon the real prevalence of translocations among the newborn, estimates of which increase as technical methods are improving. PMID:3156995
无
2008-01-01
The inverse planning for a step-and-shoot plan in intensity-modulated radiotherapy(IMRT)is usually a multiple step process.Before being converted into the MLC segments,the optimum intensity profiles of beams,which are generated by an optimization algorithm,shall be discretized into a few intensity levels.The discretization process of the optimum intensity profiles can induce deviations in the final dose distribution from the original optimum dose distribution.This paper describes a genetic algorithm for the discredzation of given optimum intensity profiles.The algorithm minimizes an objective function written in terms of the intensity levels.Both the dose-based objective function,which is defined by the deviation between the dose distributions before and after the discretization,and the intensity-based objective function,which is defined by the deviation between the optimum intensity profiles and the discretization intensity profiles,have been adopted.To evaluate this algorithm,a series of simulation calculations had been carried out using the present algorithm,the even-spaced discredzation and the k-means clustering algorithm respectively.By comparing the resultant diseretization-induced deviations(DIDs)in intensity profiles and in dose distributions,we have found that the genetic algorithm induced less DIDs in comparison with that induced in the even-spaced discretization or the k-means clustering algorithm.Additionally,it has been found that the DIDs created in the genetic algorithm correlate with the complexity of the intensity profiles that is measured by the"fluence map complexity".
Konrad, Janusz
2004-01-01
Lifting-based implementations of various discrete wavelet transforms applied in the temporal direction under motion compensation have recently become a very powerful tool in video compression research. We present in this paper a theoretical analysis of motion compensation in both transversal and lifted implementations of such transforms. We derive conditions for perfect reconstruction in the case of motion-compensated transversal discrete wavelet transform. We also derive conditions on motion transformation assuring that a motion-compensated lifting scheme is exactly equivalent to its transversal counterpart. In general, these conditions require that motion transformation allow composition and be invertible. Unfortunately, many motion models do not obey these properties, thus inducing subband decomposition errors (prior to compression). We propose an alternative approach to motion compensation in the case of Haar transform. This new approach poses no constraints on motion; motion-compensated lifted Haar transform exactly implements its transversal implementation, and the latter obeys perfect reconstruction, both regardless of motion transformation used. This new approach, however, does not extend to the 5/3 or any higher-order discrete wavelet transform.
Hu, Burong; Zhu, Jiayun; Zhou, Hongning; Hei, Tom K.
2013-02-01
A major concern for bystander effects is the probability that normal healthy cells adjacent to the irradiated cells become genomically unstable and undergo further carcinogenesis after therapeutic irradiation or space mission where astronauts are exposed to low dose of heavy ions. Genomic instability is a hallmark of cancer cells. In the present study, two irradiation protocols were performed in order to ensure pure populations of bystander cells and the genomic instability in their progeny were investigated. After irradiation, chromosomal aberrations of cells were analyzed at designated time points using G2 phase premature chromosome condensation (G2-PCC) coupled with Giemsa staining and with multiplex fluorescent in situ hybridization (mFISH). Our Giemsa staining assay demonstrated that elevated yields of chromatid breaks were induced in the progeny of pure bystander primary fibroblasts up to 20 days after irradiation. mFISH assay showed no significant level of inheritable interchromosomal aberrations were induced in the progeny of the bystander cell groups, while the fractions of gross aberrations (chromatid breaks or chromosomal breaks) significantly increased in some bystander cell groups. These results suggest that genomic instability occurred in the progeny of the irradiation associated bystander normal fibroblasts exclude the inheritable interchromosomal aberration.
Hu, Burong; Zhu, Jiayun; Zhou, Hongning; Hei, Tom K.
2012-01-01
A major concern for bystander effects is the probability that normal healthy cells adjacent to the irradiated cells become genomically unstable and undergo further carcinogenesis after therapeutic irradiation or space mission where astronauts are exposed to low dose of heavy ions. Genomic instability is a hallmark of cancer cells. In the present study, two irradiation protocols were performed in order to ensure pure populations of bystander cells and the genomic instability in their progeny were investigated. After irradiation, chromosomal aberrations of cells were analyzed at designated time points using G2 phase premature chromosome condensation (G2-PCC) coupled with Giemsa staining and with multiplex fluorescent in situ hybridization (mFISH). Our Giemsa staining assay demonstrated that elevated yields of chromatid breaks were induced in the progeny of pure bystander primary fibroblasts up to 20 days after irradiation. MFISH assay showed no significant level of inheritable interchromosomal aberrations were induced in the progeny of the bystander cell groups, while the fractions of gross aberrations (chromatid breaks or chromosomal breaks) significantly increased in some bystander cell groups. These results suggest that genomic instability occurred in the progeny of the irradiation associated bystander normal fibroblasts exclude the inheritable interchromosomal aberration. PMID:23503090
Jia Chen; Ta-Yuan Chang; Bo-Liang Li; Xiao-Nan Zhao; Li Yang; Guang-Jing Hu; Ming Lu; Ying Xiong; Xin-Ying Yang; Catherine CY Chang; Bao-Liang Song
2008-01-01
We have previously reported that the human ACAT1 gene produces a chimeric mRNAthrough the interchromosomal processing of two discontinuous RNAs transcribed from chromosomes 1 and 7. The chimeric mRNA uses AUG1397-1399 and GGC1274-1276 as translation initiation codons to produce normal 50-kDa ACATI and a novel enzymatically active 56-kDa isoform,respectively,with the latter being authentically present in human cells,including human monocyte derived macrophages. In this work,we report that RNA secondary structures located in the vicinity,of the GGC1274-1276 codon are required for production of the 56-kDa isoform. The effects of the three predicted stem-loops (nt 1255-1268,1286-1342 and 1355-1384) were tested individually by transfecting expression plasmids into cells that contained the wild-type,deleted or mutant stem-loop sequences linked to a partial ACAT1 AUG open reading frame (ORF) or to theORFs of other genes. The expression patterns were monitored by western blot analyses. We found that the upstream stem-loop1255-1268 from chromosome 7 and downstream stem-loop1286-1342 from chromosome I were needed for production of the 56-kDa isoform,whereas the last stem-ioop1355-1384 from chromosome I was dispensable. The results of experi ments using both monocistronic and bicistronic vectors with a stable hairpin showed that translation initiation from the GGC1274-1276 codon was mediated by an internal ribosome entry site (IRES). Further experiments revealed that translation initiation from the GGC1274-1276 codon requires the upstream AU-constituted RNA secondary structure and the downstream GC-rich structure. This mechanistic work provides further support for the biological significance of the chimeric nature of the human ACATI transcript.
Per-Ole Nyman
2010-01-01
Full Text Available In this article we develop a method of solving general one-dimensional Linear Quadratic Regulator (LQR problems in optimal control theory, using a generalized form of Fibonacci numbers. We find the solution R(k of the corresponding discrete-time Riccati equation in terms of ratios of generalized Fibonacci numbers. An explicit Binet type formula for R(k is also found, removing the need for recursively finding the solution at a given timestep. Moreover, we show that it is also possible to express the feedback gain, the penalty functional and the controller state in terms of these ratios. A generalized golden ratio appears in the corresponding infinite horizon problem. Finally, we show the use of the method in a few examples.
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...
Flach, S
1998-01-01
Nonlinear classical Hamiltonian lattices exhibit generic solutions in the form of discrete breathers. These solutions are time-periodic and (typically exponentially) localized in space. The lattices exhibit discrete translational symmetry. Discrete breathers are not confined to certain lattice dimensions. Necessary ingredients for their occurence are the existence of upper bounds on the phonon spectrum (of small fluctuations around the groundstate) of the system as well as the nonlinearity in the differential equations. We will present existence proofs, formulate necessary existence conditions, and discuss structural stability of discrete breathers. The following results will be also discussed: the creation of breathers through tangent bifurcation of band edge plane waves; dynamical stability; details of the spatial decay; numerical methods of obtaining breathers; interaction of breathers with phonons and electrons; movability; influence of the lattice dimension on discrete breather properties; quantum lattic...
Discrete Stein characterizations and discrete information distances
Ley, Christophe
2012-01-01
We construct two different Stein characterizations of discrete distributions and use these to provide a natural connection between Stein characterizations for discrete distributions and discrete information functionals.
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...
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...
Samer Alfarawati
Full Text Available Balanced chromosomal rearrangements represent one of the most common forms of genetic abnormality affecting approximately 1 in every 500 (0.2% individuals. Difficulties processing the abnormal chromosomes during meiosis lead to an elevated risk of chromosomally abnormal gametes, resulting in high rates of miscarriage and/or children with congenital abnormalities. It has also been suggested that the presence of chromosome rearrangements may also cause an increase in aneuploidy affecting structurally normal chromosomes, due to disruption of chromosome alignment on the spindle or disturbance of other factors related to meiotic chromosome segregation. The existence of such a phenomenon (an inter-chromosomal effect--ICE remains controversial, with different studies presenting contradictory data. The current investigation aimed to demonstrate conclusively whether an ICE truly exists. For this purpose a comprehensive chromosome screening technique, optimized for analysis of minute amounts of tissue, was applied to a unique collection of samples consisting of 283 oocytes and early embryos derived from 44 patients carrying chromosome rearrangements. A further 5,078 oocytes and embryos, derived from chromosomally normal individuals of identical age, provided a robust control group for comparative analysis. A highly significant (P = 0.0002 increase in the rate of malsegregation affecting structurally normal chromosomes was observed in association with Robertsonian translocations. Surprisingly, the ICE was clearly detected in early embryos from female carriers, but not in oocytes, indicating the possibility of mitotic rather than the previously suggested meiotic origin. These findings have implications for our understanding of genetic stability during preimplantation development and are of clinical relevance for patients carrying a Robertsonian translocation. The results are also pertinent to other situations when cellular mechanisms for maintaining
Thermodynamics of discrete quantum processes
Anders, Janet; Giovannetti, Vittorio
2013-03-01
We define thermodynamic configurations and identify two primitives of discrete quantum processes between configurations for which heat and work can be defined in a natural way. This allows us to uncover a general second law for any discrete trajectory that consists of a sequence of these primitives, linking both equilibrium and non-equilibrium configurations. Moreover, in the limit of a discrete trajectory that passes through an infinite number of configurations, i.e. in the reversible limit, we recover the saturation of the second law. Finally, we show that for a discrete Carnot cycle operating between four configurations one recovers Carnot's thermal efficiency.
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.
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
Augusto Hernández Vidal
2011-12-01
Full Text Available In order to strengthen the concept of municipal autonomy, this essay proposes an extensive interpretation of administrative discretion. Discretion is the exercise of free judgment given by law to authorities for performing official acts. This legislative technique seems to be suitable whenever the legislative is intended to legislate over the essential core of municipal autonomy. This way, an eventual abuse of that autonomy could be avoided, for the disproportional restriction of the local faculty to oversee the local issues. This alternative is presented as a tool to provide with dynamism the performing of administrative activities as well, aiming to assimilate public administration new practices.
Sørensen, John Aasted
2011-01-01
examples on regular languages. Apply these concepts to new problems. Finite state machines: Define a finite state machine as a 6-tuble; describe simple finite state machines by tables and graphs; pattern recognition by finite state machines; minimizing the number of states in a finite state machine......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...... of natural numbers. Apply these concepts to new problems. Division and factorizing: Define a prime number and apply Euclid´s algorithm for factorizing an integer. Regular languages: Define a language from the elements of a set; define a regular language; form strings from a regular language; construct...
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
Firth, Jean M
1992-01-01
The analysis of signals and systems using transform methods is a very important aspect of the examination of processes and problems in an increasingly wide range of applications. Whereas the initial impetus in the development of methods appropriate for handling discrete sets of data occurred mainly in an electrical engineering context (for example in the design of digital filters), the same techniques are in use in such disciplines as cardiology, optics, speech analysis and management, as well as in other branches of science and engineering. This text is aimed at a readership whose mathematical background includes some acquaintance with complex numbers, linear differen tial equations, matrix algebra, and series. Specifically, a familiarity with Fourier series (in trigonometric and exponential forms) is assumed, and an exposure to the concept of a continuous integral transform is desirable. Such a background can be expected, for example, on completion of the first year of a science or engineering degree cour...
Solving discrete zero point problems
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 termi
Discretization of topological spaces
Amini, Massoud; Golestani, Nasser
2014-01-01
There are several compactification procedures in topology, but there is only one standard discretization, namely, replacing the original topology with the discrete topology. We give a notion of discretization which is dual (in categorical sense) to compactification and give examples of discretizations. Especially, a discretization functor from the category of $\\alpha$-scattered Stonean spaces to the category of discrete spaces is constructed which is the converse of the Stone-\\v{C}ech compact...
陶星月; 陶亮
2014-01-01
To reduce the high complexity of the window computation using the biorthogonal relationship between the analysis window and the synthesis window in the Real-valued Discrete Gabor Transform(RDGT)for infinite or long sequences, this paper presents a fast algorithm based on the Discrete Hartley Transform(DHT). By transforming the equa-tion set of the biorthogonal relationship into the form of DHT, the equation set can be separated into several independent sub-equation sets so that the computational complexity can be reduced. The experimental results also indicate that the pro-posed fast algorithm is correct and effective.%为了降低在无限（长）序列实值离散Gabor变换（RDGT）中利用分析窗与综合窗之间的双正交关系计算窗函数的复杂度，提出了一种基于离散Hartley变换（DHT）的快速求解算法。通过将双正交关系式写成离散Hartley变换的形式，原方程组可被分解成若干个独立的子方程组以降低计算的复杂度。实验结果也验证了提出的快速算法的正确性和有效性。
Discrete Curvatures and Discrete Minimal Surfaces
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 Information Signcryption Model Based on Complex Sequence Mapping
王海荣; 刘珂
2015-01-01
Peerless linear traditional certificateless signcryption scheme for free, there are secret vulnerability and signature selective forgery problem, it cannot guarantee the safety of information, in order to improve the information signcryption, proposed one kind based on complex sequence mapping of discrete information signcryption models using signcryption scheme, private key attributes unchanged, on the user privacy data private key attribute defines the length of ciphertext de-cryption plaintext matrix construction, high vitamin and rank in the fixed length of ciphertext case, random number genera-tion from the information source to replace key source, user's public key, the construction of the discrete information certifi-cateless signcryption security model, based on complex sequence mapping of discrete information signcryption model, us-ing complex sequence analysis and mapping confidentiality signature forgery analysis, to avoid the use of the random oracle model lead to information leakage, improve the discrete information sign safety dense, realize the algorithm improvement. Simulation results show that the algorithm reduces the queuing time data packets in the node, to a certain extent, balance the load, and has better information signcryption safety, provide a degree of support for QoS data transmission, which guar-antee the communication of information security.%传统的无双线性对的无证书签密方案,大都存在着机密性漏洞和签名选择性伪造问题,无法保证信息安全.为了提高信息签密安全,提出一种基于复杂序列映射的离散信息签密安全模型,采用私钥属性不变的签密方案,对用户隐私数据私钥属性限定密文长度,在固定密文长度情况下构建高维高秩的解密明文信息矩阵,生成的随机数对信源发出信源密钥,替换用户公钥,构建离散信息无证书签密安全模型,基于复杂序列映射的离散信息签密安全模型,采用复杂序列映射机密
Profe, Jörn; Neumann, Lena; Zolitschka, Bernd; Frechen, Manfred; Rolf, Christian; Barta, Gabriella; Novothny, Ágnes; Ohlendorf, Christian
2017-04-01
The up to 20 m thick loess-paleosol sequence (LPS) Süttő is located in the northwestern part of the Pannonian Basin in Hungary on a Danube terrace close to the Transdanubian Mountains. Different from other Hungarian LPS, Süttő comprises a quasi-continuous time sequence from MIS 6 to MIS 2 as documented by luminescence age estimates and supported by relative palaeointensity data (RPI). Therefore, it can be considered as a key site for paleoclimate reconstruction representative for the Little Hungarian Plain. Potential loess source areas include Alpine and Carpathian material first transported fluvially by the rivers Danube and the Bikol creek and subsequently by aeolian transport. The LPS was continuously sampled with 2 cm increments. We used an ITRAX XRF core-scanner to analyze each sample for its elemental composition from Al to U. Additionally, red green blue (RGB) color information was acquired for each sample. The resulting geochemical record with high spatial resolution enables new interpretation strategies. Summarizing all samples per lithological unit unravels geochemical variances within a lithological unit and may point to underlying geochemical and sedimentological processes such as weathering or dust-source changes. Moreover, clustering of the geochemical record by the Ward algorithm with 17 detectable elements provides a chemostratigraphy which is compared to lithology. Differences may indicate either transition zones or geochemical processes hidden by lithological parameters. Apart from that quantification of XRF-scanning results opens up the calculation of transfer functions aiming at quantifying paleo-precipitation and paleo-temperatures. First results show elevated contents in conservative elements such as Si, Zr and Y in MIS 5 paleosols suggesting a strong pedogenesis. In addition, MIS 6 loess seems to have different dust sources than younger loess as indicated by changes in the Ti/Zr ratio. Transfer functions checked against climate
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....
Groupoids, Discrete Mechanics, and Discrete Variation
GUO Jia-Feng; JIA Xiao-Yu; WU Ke; ZHAO Wei-Zhong
2008-01-01
After introducing some of the basic definitions and results from the theory of groupoid and Lie algebroid,we investigate the discrete Lagrangian mechanics from the viewpoint of groupoid theory and give the connection between groupoids variation and the methods of the first and second discrete variational principles.
Zhou, Jianqin
2011-01-01
The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In simulating the discrete cosine transform, we propose a generalized discrete cosine transform with three parameters, and prove its orthogonality for some new cases. A new type of discrete cosine transform is proposed and its orthogonality is proved. Finally, we propose a generalized discrete W transform with three parameters, and prove its orthogonality for some new cases.
Mimetic discretization methods
Castillo, Jose E
2013-01-01
To help solve physical and engineering problems, mimetic or compatible algebraic discretization methods employ discrete constructs to mimic the continuous identities and theorems found in vector calculus. Mimetic Discretization Methods focuses on the recent mimetic discretization method co-developed by the first author. Based on the Castillo-Grone operators, this simple mimetic discretization method is invariably valid for spatial dimensions no greater than three. The book also presents a numerical method for obtaining corresponding discrete operators that mimic the continuum differential and
Discrete mathematics, discrete physics and numerical methods
Felice Iavernaro
2007-12-01
Full Text Available Discrete mathematics has been neglected for a long time. It has been put in the shade by the striking success of continuous mathematics in the last two centuries, mainly because continuous models in physics proved very reliable, but also because of the greater difﬁculty in dealing with it. This perspective has been rapidly changing in the last years owing to the needs of the numerical analysis and, more recently, of the so called discrete physics. In this paper, starting from some sentences of Fichera about discrete and continuous world, we shall present some considerations about discrete phenomena which arise when designing numerical methods or discrete models for some classical physical problems.
Discrete Wigner function dynamics
Klimov, A B; Munoz, C [Departamento de Fisica, Universidad de Guadalajara, Revolucion 1500, 44410, Guadalajara, Jalisco (Mexico)
2005-12-01
We study the evolution of the discrete Wigner function for prime and the power of prime dimensions using the discrete version of the star-product operation. Exact and semiclassical dynamics in the limit of large dimensions are considered.
Seidl, Gerhart
2014-01-01
We present a simple generalization of Noether's theorem for discrete symmetries in relativistic continuum field theories. We calculate explicitly the conserved current for several discrete spacetime and internal symmetries. In addition, we formulate an analogue of the Ward-Takahashi identity for the Noether current associated with a discrete symmetry.
Ariwahjoedi, Seramika; Kosasih, Jusak Sali; Rovelli, Carlo; Zen, Freddy Permana
2016-01-01
Following our earlier work, we construct statistical discrete geometry by applying statistical mechanics to discrete (Regge) gravity. We propose a coarse-graining method for discrete geometry under the assumptions of atomism and background independence. To maintain these assumptions, restrictions are given to the theory by introducing cut-offs, both in ultraviolet and infrared regime. Having a well-defined statistical picture of discrete Regge geometry, we take the infinite degrees of freedom (large n) limit. We argue that the correct limit consistent with the restrictions and the background independence concept is not the continuum limit of statistical mechanics, but the thermodynamical limit.
Discrete mathematics, discrete physics and numerical methods
Felice Iavernaro; Donato Trigiante
2007-01-01
Discrete mathematics has been neglected for a long time. It has been put in the shade by the striking success of continuous mathematics in the last two centuries, mainly because continuous models in physics proved very reliable, but also because of the greater difﬁculty in dealing with it. This perspective has been rapidly changing in the last years owing to the needs of the numerical analysis and, more recently, of the so called discrete physics. In this paper, starting from some sentences o...
Finite Discrete Gabor Analysis
Søndergaard, Peter Lempel
2007-01-01
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...
Discrete Mathematics Re "Tooled."
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)
Chang, Lay Nam; Minic, Djordje; Takeuchi, Tatsu
2012-01-01
We construct a discrete quantum mechanics using a vector space over the Galois field GF(q). We find that the correlations in our model do not violate the Clauser-Horne-Shimony-Holt (CHSH) version of Bell's inequality, despite the fact that the predictions of this discrete quantum mechanics cannot be reproduced with any hidden variable theory.
Lee, Taeyoung; McClamroch, N Harris
2007-01-01
Discrete control systems, as considered here, refer to the control theory of discrete-time Lagrangian or Hamiltonian systems. These discrete-time models are based on a discrete variational principle, and are part of the broader field of geometric integration. Geometric integrators are numerical integration methods that preserve geometric properties of continuous systems, such as conservation of the symplectic form, momentum, and energy. They also guarantee that the discrete flow remains on the manifold on which the continuous system evolves, an important property in the case of rigid-body dynamics. In nonlinear control, one typically relies on differential geometric and dynamical systems techniques to prove properties such as stability, controllability, and optimality. More generally, the geometric structure of such systems plays a critical role in the nonlinear analysis of the corresponding control problems. Despite the critical role of geometry and mechanics in the analysis of nonlinear control systems, non...
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.
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...
Burgin, Mark
2010-01-01
Continuous models used in physics and other areas of mathematics applications become discrete when they are computerized, e.g., utilized for computations. Besides, computers are controlling processes in discrete spaces, such as films and television programs. At the same time, continuous models that are in the background of discrete representations use mathematical technology developed for continuous media. The most important example of such a technology is calculus, which is so useful in physics and other sciences. The main goal of this paper is to synthesize continuous features and powerful technology of the classical calculus with the discrete approach of numerical mathematics and computational physics. To do this, we further develop the theory of fuzzy continuous functions and apply this theory to functions defined on discrete sets. The main interest is the classical Intermediate Value theorem. Although the result of this theorem is completely based on continuity, utilization of a relaxed version of contin...
Torus Bifurcation Under Discretization
邹永魁; 黄明游
2002-01-01
Parameterized dynamical systems with a simple zero eigenvalue and a couple of purely imaginary eigenvalues are considered. It is proved that this type of eigen-structure leads to torns bifurcation under certain nondegenerate conditions. We show that the discrete systems, obtained by discretizing the ODEs using symmetric, eigen-structure preserving schemes, inherit the similar torus bifurcation properties. Fredholm theory in Banach spaces is applied to obtain the global torns bifurcation. Our results complement those on the study of discretization effects of global bifurcation.
Aydin, Alhun; Sisman, Altug
2016-03-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.
Realization of quantum discrete Fourier transform with NMR
无
2000-01-01
The pulse sequences of the logic operations used in quantum discrete Fourier transform are designed for the experiment of nuclear magnetic resonance(NMR), and 2-qubit discrete Fourier transforms are implemented experimentally with NMR. The experimental errors are examined and methods for reducing the errors are proposed.
Pearls of Discrete Mathematics
Erickson, Martin
2009-01-01
Presents methods for solving counting problems and other types of problems that involve discrete structures. This work illustrates the relationship of these structures to algebra, geometry, number theory and combinatorics. It addresses topics such as information and game theories
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...
The Discrete Wavelet Transform
1991-06-01
focuses on bringing together two separately motivated implementations of the wavelet transform , the algorithm a trous and Mallat’s multiresolution...decomposition. These algorithms are special cases of a single filter bank structure, the discrete wavelet transform , the behavior of which is governed by...nonorthogonal multiresolution algorithm for which the discrete wavelet transform is exact. Moreover, we show that the commonly used Lagrange a trous
Discrete computational structures
Korfhage, Robert R
1974-01-01
Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasize
Discrete-event control of stochastic networks multimodularity and regularity
Altman, Eitan; Hordijk, Arie
2003-01-01
Opening new directions in research in both discrete event dynamic systems as well as in stochastic control, this volume focuses on a wide class of control and of optimization problems over sequences of integer numbers. This is a counterpart of convex optimization in the setting of discrete optimization. The theory developed is applied to the control of stochastic discrete-event dynamic systems. Some applications are admission, routing, service allocation and vacation control in queueing networks. Pure and applied mathematicians will enjoy reading the book since it brings together many disciplines in mathematics: combinatorics, stochastic processes, stochastic control and optimization, discrete event dynamic systems, algebra.
Multiplexing of discrete chaotic signals in presence of noise.
Nagaraj, Nithin; Vaidya, Prabhakar G
2009-09-01
Multiplexing of discrete chaotic signals in presence of noise is investigated. The existing methods are based on chaotic synchronization, which is susceptible to noise, precision limitations, and requires more iterates. Furthermore, most of these methods fail for multiplexing more than two discrete chaotic signals. We propose novel methods to multiplex multiple discrete chaotic signals based on the principle of symbolic sequence invariance in presence of noise and finite precision implementation of finding the initial condition of an arbitrarily long symbolic sequence of a chaotic map. Our methods work for single precision and as less as 35 iterates. For two signals, our method is robust up to 50% noise level.
Kondakci, H Esat; Saleh, Bahaa E A
2016-01-01
When a disordered array of coupled waveguides is illuminated with an extended coherent optical field, discrete speckle develops: partially coherent light with a granular intensity distribution on the lattice sites. The same paradigm applies to a variety of other settings in photonics, such as imperfectly coupled resonators or fibers with randomly coupled cores. Through numerical simulations and analytical modeling, we uncover a set of surprising features that characterize discrete speckle in one- and two-dimensional lattices known to exhibit transverse Anderson localization. Firstly, the fingerprint of localization is embedded in the fluctuations of the discrete speckle and is revealed in the narrowing of the spatial coherence function. Secondly, the transverse coherence length (or speckle grain size) is frozen during propagation. Thirdly, the axial coherence depth is independent of the axial position, thereby resulting in a coherence voxel of fixed volume independently of position. We take these unique featu...
Discrete systems and integrability
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 Classical Electromagnetic Fields
De Souza, M M
1997-01-01
The classical electromagnetic field of a spinless point electron is described in a formalism with extended causality by discrete finite transverse point-vector fields with discrete and localized point interactions. These fields are taken as a classical representation of photons, ``classical photons". They are all transversal photons; there are no scalar nor longitudinal photons as these are definitely eliminated by the gauge condition. The angular distribution of emitted photons coincides with the directions of maximum emission in the standard formalism. The Maxwell formalism and its standard field are retrieved by the replacement of these discrete fields by their space-time averages, and in this process scalar and longitudinal photons are necessarily created and added. Divergences and singularities are by-products of this averaging process. This formalism enlighten the meaning and the origin of the non-physical photons, the ones that violate the Lorentz condition in manifestly covariant quantization methods.
Introductory discrete mathematics
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
Discrete breathers in crystals
Dmitriev, S. V.; Korznikova, E. A.; Baimova, Yu A.; Velarde, M. G.
2016-05-01
It is well known that periodic discrete defect-containing systems, in addition to traveling waves, support vibrational defect-localized modes. It turned out that if a periodic discrete system is nonlinear, it can support spatially localized vibrational modes as exact solutions even in the absence of defects. Since the nodes of the system are all on equal footing, it is only through the special choice of initial conditions that a group of nodes can be found on which such a mode, called a discrete breather (DB), will be excited. The DB frequency must be outside the frequency range of the small-amplitude traveling waves. Not resonating with and expending no energy on the excitation of traveling waves, a DB can theoretically conserve its vibrational energy forever provided no thermal vibrations or other perturbations are present. Crystals are nonlinear discrete systems, and the discovery in them of DBs was only a matter of time. It is well known that periodic discrete defect-containing systems support both traveling waves and vibrational defect-localized modes. It turns out that if a periodic discrete system is nonlinear, it can support spatially localized vibrational modes as exact solutions even in the absence of defects. Because the nodes of the system are all on equal footing, only a special choice of the initial conditions allows selecting a group of nodes on which such a mode, called a discrete breather (DB), can be excited. The DB frequency must be outside the frequency range of small-amplitude traveling waves. Not resonating with and expending no energy on the excitation of traveling waves, a DB can theoretically preserve its vibrational energy forever if no thermal vibrations or other perturbations are present. Crystals are nonlinear discrete systems, and the discovery of DBs in them was only a matter of time. Experimental studies of DBs encounter major technical difficulties, leaving atomistic computer simulations as the primary investigation tool. Despite
Discrete and computational geometry
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 a
Arzano, Michele; Kowalski-Glikman, Jerzy
2016-09-01
We construct discrete symmetry transformations for deformed relativistic kinematics based on group valued momenta. We focus on the specific example of κ-deformations of the Poincaré algebra with associated momenta living on (a sub-manifold of) de Sitter space. Our approach relies on the description of quantum states constructed from deformed kinematics and the observable charges associated with them. The results we present provide the first step towards the analysis of experimental bounds on the deformation parameter κ to be derived via precision measurements of discrete symmetries and CPT.
Quantum evolution by discrete measurements
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.
Dorlas, T. C.; Thomas, E. G. F.
2008-01-01
We construct a genuine Radon measure with values in B(l(2)(Z(d))) on the set of paths in Z(d) representing Feynman's integral for the discrete Laplacian on l(2)(Z(d)), and we prove the Feynman integral formula for the solutions of the Schrodinger equation with Hamiltonian H=-1/2 Delta+ V, where Delt
Bergstra, J.A.; Baeten, J.C.M.
1996-01-01
The axiom system ACP of [BeK84a] was extended with real time features in [BaB91]. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NiS94]. We present versions based on relative timing and on absolute timing. Both approaches are integrated using parametric timing. T
de Wild Propitius, M.D.F.; Bais, F.A.
1999-01-01
In these lectures, we present a self-contained treatment of planar gauge theories broken down to some finite residual gauge group $H$ via the Higgs mechanism. The main focus is on the discrete $H$ gauge theory describing the long distance physics of such a model. The spectrum features global $H$ cha
Discrete Feature Model (DFM) User Documentation
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 mathematics with applications
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*...
Brunner, Ilka; Plencner, Daniel
2014-01-01
Orbifolding two-dimensional quantum field theories by a symmetry group can involve a choice of discrete torsion. We apply the general formalism of `orbifolding defects' to study and elucidate discrete torsion for topological field theories. In the case of Landau-Ginzburg models only the bulk sector had been studied previously, and we re-derive all known results. We also introduce the notion of `projective matrix factorisations', show how they naturally describe boundary and defect sectors, and we further illustrate the efficiency of the defect-based approach by explicitly computing RR charges. Roughly half of our results are not restricted to Landau-Ginzburg models but hold more generally, for any topological field theory. In particular we prove that for a pivotal bicategory, any two objects of its orbifold completion that have the same base are orbifold equivalent. Equivalently, from any orbifold theory (including those based on nonabelian groups) the original unorbifolded theory can be be obtained by orbifo...
Discrete Variational Optimal Control
Jimenez, Fernando; de Diego, David Martin
2012-01-01
This paper develops numerical methods for optimal control of mechanical systems in the Lagrangian setting. It extends the theory of discrete mechanics to enable the solutions of optimal control problems through the discretization of variational principles. The key point is to solve the optimal control problem as a variational integrator of a specially constructed higher-dimensional system. The developed framework applies to systems on tangent bundles, Lie groups, underactuated and nonholonomic systems with symmetries, and can approximate either smooth or discontinuous control inputs. The resulting methods inherit the preservation properties of variational integrators and result in numerically robust and easily implementable algorithms. Several theoretical and a practical examples, e.g. the control of an underwater vehicle, will illustrate the application of the proposed approach.
Discrete Variational Optimal Control
Jiménez, Fernando; Kobilarov, Marin; Martín de Diego, David
2013-06-01
This paper develops numerical methods for optimal control of mechanical systems in the Lagrangian setting. It extends the theory of discrete mechanics to enable the solutions of optimal control problems through the discretization of variational principles. The key point is to solve the optimal control problem as a variational integrator of a specially constructed higher dimensional system. The developed framework applies to systems on tangent bundles, Lie groups, and underactuated and nonholonomic systems with symmetries, and can approximate either smooth or discontinuous control inputs. The resulting methods inherit the preservation properties of variational integrators and result in numerically robust and easily implementable algorithms. Several theoretical examples and a practical one, the control of an underwater vehicle, illustrate the application of the proposed approach.
Salinelli, Ernesto
2014-01-01
This book provides an introduction to the analysis of discrete dynamical systems. The content is presented by an unitary approach that blends the perspective of mathematical modeling together with the ones of several discipline as Mathematical Analysis, Linear Algebra, Numerical Analysis, Systems Theory and Probability. After a preliminary discussion of several models, the main tools for the study of linear and non-linear scalar dynamical systems are presented, paying particular attention to the stability analysis. Linear difference equations are studied in detail and an elementary introduction of Z and Discrete Fourier Transform is presented. A whole chapter is devoted to the study of bifurcations and chaotic dynamics. One-step vector-valued dynamical systems are the subject of three chapters, where the reader can find the applications to positive systems, Markov chains, networks and search engines. The book is addressed mainly to students in Mathematics, Engineering, Physics, Chemistry, Biology and Economic...
Time Discretization Techniques
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.
Linearity stabilizes discrete breathers
T R Krishna Mohan; Surajit Sen
2011-11-01
The study of the dynamics of 1D chains with both harmonic and nonlinear interactions, as in the Fermi–Pasta–Ulam (FPU) and related problems, has played a central role in efforts to identify the broad consequences of nonlinearity in these systems. Here we study the dynamics of highly localized excitations, or discrete breathers, which are known to be initiated by the quasistatic stretching of bonds between adjacent particles. We show via dynamical simulations that acoustic waves introduced by the harmonic term stabilize the discrete breather by suppressing the breather’s tendency to delocalize and disperse. We conclude that the harmonic term, and hence acoustic waves, are essential for the existence of localized breathers in these systems.
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...
Steerable Discrete Cosine Transform
Fracastoro, Giulia; Fosson, Sophie; Magli, Enrico
2017-01-01
In image compression, classical block-based separable transforms tend to be inefficient when image blocks contain arbitrarily shaped discontinuities. For this reason, transforms incorporating directional information are an appealing alternative. In this paper, we propose a new approach to this problem, namely, a discrete cosine transform (DCT) that can be steered in any chosen direction. Such transform, called steerable DCT (SDCT), allows to rotate in a flexible way pairs of basis vectors, an...
Odake, Satoru; Sasaki, Ryu
2011-01-01
A comprehensive review of the discrete quantum mechanics with the pure imaginary shifts and the real shifts is presented in parallel with the corresponding results in the ordinary quantum mechanics. The main subjects to be covered are the factorised Hamiltonians, the general structure of the solution spaces of the Schroedinger equation (Crum's theorem and its modification), the shape invariance, the exact solvability in the Schroedinger picture as well as in the Heisenberg picture, the creati...
Cortical Neural Computation by Discrete Results Hypothesis
Castejon, Carlos; Nuñez, Angel
2016-01-01
One of the most challenging problems we face in neuroscience is to understand how the cortex performs computations. There is increasing evidence that the power of the cortical processing is produced by populations of neurons forming dynamic neuronal ensembles. Theoretical proposals and multineuronal experimental studies have revealed that ensembles of neurons can form emergent functional units. However, how these ensembles are implicated in cortical computations is still a mystery. Although cell ensembles have been associated with brain rhythms, the functional interaction remains largely unclear. It is still unknown how spatially distributed neuronal activity can be temporally integrated to contribute to cortical computations. A theoretical explanation integrating spatial and temporal aspects of cortical processing is still lacking. In this Hypothesis and Theory article, we propose a new functional theoretical framework to explain the computational roles of these ensembles in cortical processing. We suggest that complex neural computations underlying cortical processing could be temporally discrete and that sensory information would need to be quantized to be computed by the cerebral cortex. Accordingly, we propose that cortical processing is produced by the computation of discrete spatio-temporal functional units that we have called “Discrete Results” (Discrete Results Hypothesis). This hypothesis represents a novel functional mechanism by which information processing is computed in the cortex. Furthermore, we propose that precise dynamic sequences of “Discrete Results” is the mechanism used by the cortex to extract, code, memorize and transmit neural information. The novel “Discrete Results” concept has the ability to match the spatial and temporal aspects of cortical processing. We discuss the possible neural underpinnings of these functional computational units and describe the empirical evidence supporting our hypothesis. We propose that fast
Discretized representations of harmonic variables by bilateral Jacobi operators
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.
Discrete Fresnel Transform and Its Circular Convolution
Ouyang, Xing; Gunning, Fatima; Zhang, Hongyu; Guan, Yong Liang
2015-01-01
Discrete trigonometric transformations, such as the discrete Fourier and cosine/sine transforms, are important in a variety of applications due to their useful properties. For example, one well-known property is the convolution theorem for Fourier transform. In this letter, we derive a discrete Fresnel transform (DFnT) from the infinitely periodic optical gratings, as a linear trigonometric transform. Compared to the previous formulations of DFnT, the DFnT in this letter has no degeneracy, which hinders its mathematic applications, due to destructive interferences. The circular convolution property of the DFnT is studied for the first time. It is proved that the DFnT of a circular convolution of two sequences equals either one circularly convolving with the DFnT of the other. As circular convolution is a fundamental process in discrete systems, the DFnT not only gives the coefficients of the Talbot image, but can also be useful for optical and digital signal processing and numerical evaluation of the Fresnel ...
A Dynamics for Discrete Quantum Gravity
Gudder, Stan
2013-01-01
This paper is based on the causal set approach to discrete quantum gravity. We first describe a classical sequential growth process (CSGP) in which the universe grows one element at a time in discrete steps. At each step the process has the form of a causal set (causet) and the "completed" universe is given by a path through a discretely growing chain of causets. We then quantize the CSGP by forming a Hilbert space $H$ on the set of paths. The quantum dynamics is governed by a sequence of positive operators $\\rho_n$ on $H$ that satisfy normalization and consistency conditions. The pair $(H,\\brac{\\rho_n})$ is called a quantum sequential growth process (QSGP). We next discuss a concrete realization of a QSGP in terms of a natural quantum action. This gives an amplitude process related to the sum over histories" approach to quantum mechanics. Finally, we briefly discuss a discrete form of Einstein's field equation and speculate how this may be employed to compare the present framework with classical general rela...
Background Comparative genomics is a powerful tool to transfer genomic information from model species to related non-model species. Channel catfish (Ictalurus punctatus) is the primary aquaculture species in the United States. Its existing genome resources such as genomic sequences generated from n...
On Approximation of Lie Groups by Discrete Subgroups
Hatem Hamrouni; Salah Souissi
2014-02-01
A locally compact group is said to be approximated by discrete sub-groups (in the sense of Tôyama) if there is a sequence of discrete subgroups of that converges to in the Chabauty topology (or equivalently, in the Vietoris topology). The notion of approximation of Lie groups by discrete subgroups was introduced by Tôyama in Kodai Math. Sem. Rep. 1 (1949) 36–37 and investigated in detail by Kuranishi in Nagoya Math. J. 2 (1951) 63–71. It is known as a theorem of Tôyama that any connected Lie group approximated by discrete subgroups is nilpotent. The converse, in general, does not hold. For example, a connected simply connected nilpotent Lie group is approximated by discrete subgroups if and only if has a rational structure. On the other hand, if is a discrete uniform subgroup of a connected, simply connected nilpotent Lie group then is approximated by discrete subgroups $_n$ containing . The proof of the above result is by induction on the dimension of , and gives an algorithm for inductively determining $_n$. The purpose of this paper is to give another proof in which we present an explicit formula for the sequence $(_n)_{n≥ 0}$ in terms of . Several applications are given.
Brauer, Fred; Feng, Zhilan; Castillo-Chavez, Carlos
2010-01-01
The mathematical theory of single outbreak epidemic models really began with the work of Kermack and Mackendrick about decades ago. This gave a simple answer to the long-standing question of why epidemics woould appear suddenly and then disappear just as suddenly without having infected an entire population. Therefore it seemed natural to expect that theoreticians would immediately proceed to expand this mathematical framework both because the need to handle recurrent single infectious disease outbreaks has always been a priority for public health officials and because theoreticians often try to push the limits of exiting theories. However, the expansion of the theory via the inclusion of refined epidemiological classifications or through the incorporation of categories that are essential for the evaluation of intervention strategies, in the context of ongoing epidemic outbreaks, did not materialize. It was the global threat posed by SARS in that caused theoreticians to expand the Kermack-McKendrick single-outbreak framework. Most recently, efforts to connect theoretical work to data have exploded as attempts to deal with the threat of emergent and re-emergent diseases including the most recent H1N1 influenza pandemic, have marched to the forefront of our global priorities. Since data are collected and/or reported over discrete units of time, developing single outbreak models that fit collected data naturally is relevant. In this note, we introduce a discrete-epidemic framework and highlight, through our analyses, the similarities between single-outbreak comparable classical continuous-time epidemic models and the discrete-time models introduced in this note. The emphasis is on comparisons driven by expressions for the final epidemic size.
Wuensche, Andrew
DDLab is interactive graphics software for creating, visualizing, and analyzing many aspects of Cellular Automata, Random Boolean Networks, and Discrete Dynamical Networks in general and studying their behavior, both from the time-series perspective — space-time patterns, and from the state-space perspective — attractor basins. DDLab is relevant to research, applications, and education in the fields of complexity, self-organization, emergent phenomena, chaos, collision-based computing, neural networks, content addressable memory, genetic regulatory networks, dynamical encryption, generative art and music, and the study of the abstract mathematical/physical/dynamical phenomena in their own right.
Difference Discrete Variational Principle in Discrete Mechanics and Symplectic Algorithm
LUO Xu-Dong; GUO Han-Ying; LI Yu-Qi; WU Ke
2004-01-01
We propose the difference discrete variational principle in discrete mechanics and symplectic algorithmwith variable step-length of time in finite duration based upon a noncommutative differential calculus established inthis paper. This approach keeps both symplecticity and energy conservation discretely. We show that there exists thediscrete version of the Euler-Lagrange cohomology in these discrete systems. We also discuss the solution existencein finite time-length and its site density in continuous limit, and apply our approach to the pendulum with periodicperturbation. The numerical results are satisfactory.
Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations
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.
Poisson hierarchy of discrete strings
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.
Advances in discrete differential geometry
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 R Symmetries and Anomalies
Michael Dine(Santa Cruz Institute for Particle Physics and Department of Physics, Santa Cruz CA 95064, U.S.A.); Angelo Monteux(Santa Cruz Institute for Particle Physics, University of California Santa Cruz, 1156 High Street, Santa Cruz, U.S.A.)
2012-01-01
We comment on aspects of discrete anomaly conditions focussing particularly on $R$ symmetries. We review the Green-Schwarz cancellation of discrete anomalies, providing a heuristic explanation why, in the heterotic string, only the "model-independent dilaton" transforms non-linearly under discrete symmetries; this argument suggests that, in other theories, multiple fields might play a role in anomaly cancellations, further weakening any anomaly constraints at low energies. We provide examples...
Steerable Discrete Cosine Transform
Fracastoro, Giulia; Fosson, Sophie M.; Magli, Enrico
2017-01-01
In image compression, classical block-based separable transforms tend to be inefficient when image blocks contain arbitrarily shaped discontinuities. For this reason, transforms incorporating directional information are an appealing alternative. In this paper, we propose a new approach to this problem, namely a discrete cosine transform (DCT) that can be steered in any chosen direction. Such transform, called steerable DCT (SDCT), allows to rotate in a flexible way pairs of basis vectors, and enables precise matching of directionality in each image block, achieving improved coding efficiency. The optimal rotation angles for SDCT can be represented as solution of a suitable rate-distortion (RD) problem. We propose iterative methods to search such solution, and we develop a fully fledged image encoder to practically compare our techniques with other competing transforms. Analytical and numerical results prove that SDCT outperforms both DCT and state-of-the-art directional transforms.
Discrete Thermodynamics of Lasers
Zilbergleyt, B
2007-01-01
The paper offers a discrete thermodynamic model of lasers. Laser is an open system; its equilibrium is based on a balance of two thermodynamic forces, one related to the incoming pumping power and another to the emitted light. The basic expression for such equilibrium is a logistic map, graphical solutions to which are pitchfork bifurcation diagrams. As pumping force increases, the relative populations on the ground and lasing branches tend to zero and unity correspondingly. An interesting feature of this model is the line spectrum of the up and down transitions between the branches beyond bifurcation point. Even in a simple case of 2-level laser with only 2 possible transition types (up and down), the spectra look like sets of the line packets, starting well before the population inversion. This effect is an independent confirmation of the Einstein's prohibition on practical realization of 2-level laser. Multilevel lasers may be approached by employing the idea of thermodynamic activity for the emitting atom...
Noyes, H. Pierre; Starson, Scott
1991-03-01
Discrete physics, because it replaces time evolution generated by the energy operator with a global bit-string generator (program universe) and replaces fields with the relativistic Wheeler-Feynman action at a distance, allows the consistent formulation of the concept of signed gravitational charge for massive particles. The resulting prediction made by this version of the theory is that free anti-particles near the surface of the earth will fall up with the same acceleration that the corresponding particles fall down. So far as we can see, no current experimental information is in conflict with this prediction of our theory. The experiment crusis will be one of the anti-proton or anti-hydrogen experiments at CERN. Our prediction should be much easier to test than the small effects which those experiments are currently designed to detect or bound.
Noyes, H.P. (Stanford Linear Accelerator Center, Menlo Park, CA (USA)); Starson, S. (STARSON Corp. (USA))
1991-03-01
Discrete physics, because it replaces time evolution generated by the energy operator with a global bit-string generator (program universe) and replaces fields'' with the relativistic Wheeler-Feynman action at a distance,'' allows the consistent formulation of the concept of signed gravitational charge for massive particles. The resulting prediction made by this version of the theory is that free anti-particles near the surface of the earth will fall'' up with the same acceleration that the corresponding particles fall down. So far as we can see, no current experimental information is in conflict with this prediction of our theory. The experiment crusis will be one of the anti-proton or anti-hydrogen experiments at CERN. Our prediction should be much easier to test than the small effects which those experiments are currently designed to detect or bound. 23 refs.
Discrete Pearson distributions
Bowman, K.O. [Oak Ridge National Lab., TN (United States); Shenton, L.R. [Georgia Univ., Athens, GA (United States); Kastenbaum, M.A. [Kastenbaum (M.A.), Basye, VA (United States)
1991-11-01
These distributions are generated by a first order recursive scheme which equates the ratio of successive probabilities to the ratio of two corresponding quadratics. The use of a linearized form of this model will produce equations in the unknowns matched by an appropriate set of moments (assumed to exist). Given the moments we may find valid solutions. These are two cases; (1) distributions defined on the non-negative integers (finite or infinite) and (2) distributions defined on negative integers as well. For (1), given the first four moments, it is possible to set this up as equations of finite or infinite degree in the probability of a zero occurrence, the sth component being a product of s ratios of linear forms in this probability in general. For (2) the equation for the zero probability is purely linear but may involve slowly converging series; here a particular case is the discrete normal. Regions of validity are being studied. 11 refs.
Immigration and Prosecutorial Discretion.
Apollonio, Dorie; Lochner, Todd; Heddens, Myriah
Immigration has become an increasingly salient national issue in the US, and the Department of Justice recently increased federal efforts to prosecute immigration offenses. This shift, however, relies on the cooperation of US attorneys and their assistants. Traditionally federal prosecutors have enjoyed enormous discretion and have been responsive to local concerns. To consider how the centralized goal of immigration enforcement may have influenced federal prosecutors in regional offices, we review their prosecution of immigration offenses in California using over a decade's worth of data. Our findings suggest that although centralizing forces influence immigration prosecutions, individual US attorneys' offices retain distinct characteristics. Local factors influence federal prosecutors' behavior in different ways depending on the office. Contrary to expectations, unemployment rates did not affect prosecutors' willingness to pursue immigration offenses, nor did local popular opinion about illegal immigration.
McKenzie, Alan
2016-01-01
The Many Worlds Interpretation (MWI) famously avoids the issue of wave function collapse. Different MWI trees representing the same quantum events can have different topologies, depending upon the observer. However, they are all isomorphic to the group of block universes containing all of the outcomes of all of the events, and so, in that sense, the group of block universes is a more fundamental representation. Different branches of the MWI tree, representing different universes in MWI, ultimately share the same quantum state in a common ancestor branch. This branching topology is incompatible with that of the Minkowski block universe; the resolution is to replace the branches with discrete, parallel block universes, each of which extends from the trunk to the outermost twigs. The number of universes in a branch is proportional to its thickness which, in turn, depends upon the absolute square of the probability amplitude for the state in that branch. Every quantum event may be represented by a kernel of unive...
Principles of discrete time mechanics
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.
A short course in discrete mathematics
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 dynamics versus analytic dynamics
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...
Discretization error of Stochastic Integrals
Fukasawa, Masaaki
2010-01-01
Asymptotic error distribution for approximation of a stochastic integral with respect to continuous semimartingale by Riemann sum with general stochastic partition is studied. Effective discretization schemes of which asymptotic conditional mean-squared error attains a lower bound are constructed. Two applications are given; efficient delta hedging strategies with transaction costs and effective discretization schemes for the Euler-Maruyama approximation are constructed.
Discrete Mathematics and Its Applications
Oxley, Alan
2010-01-01
The article gives ideas that lecturers of undergraduate Discrete Mathematics courses can use in order to make the subject more interesting for students and encourage them to undertake further studies in the subject. It is possible to teach Discrete Mathematics with little or no reference to computing. However, students are more likely to be…
Discretization and implicit mapping dynamics
Luo, Albert C J
2015-01-01
This unique book presents the discretization of continuous systems and implicit mapping dynamics of periodic motions to chaos in continuous nonlinear systems. The stability and bifurcation theory of fixed points in discrete nonlinear dynamical systems is reviewed, and the explicit and implicit maps of continuous dynamical systems are developed through the single-step and multi-step discretizations. The implicit dynamics of period-m solutions in discrete nonlinear systems are discussed. The book also offers a generalized approach to finding analytical and numerical solutions of stable and unstable periodic flows to chaos in nonlinear systems with/without time-delay. The bifurcation trees of periodic motions to chaos in the Duffing oscillator are shown as a sample problem, while the discrete Fourier series of periodic motions and chaos are also presented. The book offers a valuable resource for university students, professors, researchers and engineers in the fields of applied mathematics, physics, mechanics,...
Inferring gene networks from discrete expression data
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.
Vasconcelos, Emanuelle Varão; de Andrade Fonsêca, Artur Fellipe; Pedrosa-Harand, Andrea; de Andrade Bortoleti, Kyria Cilene; Benko-Iseppon, Ana Maria; da Costa, Antônio Félix; Brasileiro-Vidal, Ana Christina
2015-06-01
Cowpea (Vigna unguiculata) is an annual legume grown in tropical and subtropical regions, which is economically relevant due to high protein content in dried beans, green pods, and leaves. In this work, a comparative cytogenetic study between V. unguiculata and Phaseolus vulgaris (common bean) was conducted using BAC-FISH. Sequences previously mapped in P. vulgaris chromosomes (Pv) were used as probes in V. unguiculata chromosomes (Vu), contributing to the analysis of macrosynteny between both legumes. Thirty-seven clones from P. vulgaris 'BAT93' BAC library, corresponding to its 11 linkage groups, were hybridized in situ. Several chromosomal rearrangements were identified, such as translocations (between BACs from Pv1 and Pv8; Pv2 and Pv3; as well as Pv2 and Pv11), duplications (BAC from Pv3), as well as paracentric and pericentric inversions (BACs from Pv3, and Pv4, respectively). Two BACs (from Pv2 and Pv7), which hybridized at terminal regions in almost all P. vulgaris chromosomes, showed single-copy signal in Vu. Additionally, 17 BACs showed no signal in V. unguiculata chromosomes. The present results demonstrate the feasibility of using BAC libraries in comparative chromosomal mapping and karyotype evolution studies between Phaseolus and Vigna species, and revealed several macrosynteny and collinearity breaks among both legumes.
Reachability analysis of switched linear discrete singular systems
无
2006-01-01
This paper studies the reachability problem of the switched linear discrete singular (SLDS) systems. Under the condition that all subsystems are regular, the reachability of the SLDS systems is characterized based on a peculiar repeatedly introduced switching sequence. The necessary and sufficient conditions are obtained for the reachability of the SLDS systems.
Model Reduction of Linear Switched Systems by Restricting Discrete Dynamics
Bastug, Mert; Petreczky, Mihaly; Wisniewski, Rafal
2014-01-01
We present a procedure for reducing the number of continuous states of discrete-time linear switched systems, such that the reduced system has the same behavior as the original system for a subset of switching sequences. The proposed method is expected to be useful for abstraction based control s...
Discrete Darboux transformation for discrete polynomials of hypergeometric type
Bangerezako, Gaspard
1998-03-01
The Darboux transformation, well known in second-order differential operator theory, is applied to the difference equations satisfied by the discrete hypergeometric polynomials (Charlier, Meixner-Kravchuk, Hahn).
The origin of discrete particles
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
Universal Denoising of Discrete-time Continuous-Amplitude Signals
Sivaramakrishnan, Kamakshi
2008-01-01
We consider the problem of reconstructing a discrete-time signal (sequence) with continuous-valued components corrupted by a known memoryless channel. When performance is measured using a per-symbol loss function satisfying mild regularity conditions, we develop a sequence of denoisers that, although independent of the distribution of the underlying `clean' sequence, is universally optimal in the limit of large sequence length. This sequence of denoisers is universal in the sense of performing as well as any sliding window denoising scheme which may be optimized for the underlying clean signal. Our results are initially developed in a ``semi-stochastic'' setting, where the noiseless signal is an unknown individual sequence, and the only source of randomness is due to the channel noise. It is subsequently shown that in the fully stochastic setting, where the noiseless sequence is a stationary stochastic process, our schemes universally attain optimum performance. The proposed schemes draw from nonparametric de...
The Relations between Discrete Frames and Continuous Frames with Respect to (N, µ)
LIU Chun-tai
2013-01-01
The discrete frame and the continuous frame in a Hilbert space are discussed. By the tool excess of a sequence, a sufficient and necessary condition is presented under which a discrete frame is equivalent to a continuous frame with respect to the whole natural numbers with a positive Borel measure. And some examples are given to illuminate the condition.
A Joint Criterion for Reachability and Observability of Nonuniformly Sampled Discrete Systems
Fúster-Sabater, Amparo
2010-01-01
A joint characterization of reachability (controllability) and observability (constructibility) for linear SISO nonuniformly sampled discrete systems is presented. The work generalizes to the nonuniform sampling the criterion known for the uniform sampling. Emphasis is on the nonuniform sampling sequence, which is believed to be an additional element for analysis and handling of discrete systems.
Automated DNA Sequencing System
Armstrong, G.A.; Ekkebus, C.P.; Hauser, L.J.; Kress, R.L.; Mural, R.J.
1999-04-25
Oak Ridge National Laboratory (ORNL) is developing a core DNA sequencing facility to support biological research endeavors at ORNL and to conduct basic sequencing automation research. This facility is novel because its development is based on existing standard biology laboratory equipment; thus, the development process is of interest to the many small laboratories trying to use automation to control costs and increase throughput. Before automation, biology Laboratory personnel purified DNA, completed cycle sequencing, and prepared 96-well sample plates with commercially available hardware designed specifically for each step in the process. Following purification and thermal cycling, an automated sequencing machine was used for the sequencing. A technician handled all movement of the 96-well sample plates between machines. To automate the process, ORNL is adding a CRS Robotics A- 465 arm, ABI 377 sequencing machine, automated centrifuge, automated refrigerator, and possibly an automated SpeedVac. The entire system will be integrated with one central controller that will direct each machine and the robot. The goal of this system is to completely automate the sequencing procedure from bacterial cell samples through ready-to-be-sequenced DNA and ultimately to completed sequence. The system will be flexible and will accommodate different chemistries than existing automated sequencing lines. The system will be expanded in the future to include colony picking and/or actual sequencing. This discrete event, DNA sequencing system will demonstrate that smaller sequencing labs can achieve cost-effective the laboratory grow.
Discrete geodesics and cellular automata
Arrighi, Pablo
2015-01-01
This paper proposes a dynamical notion of discrete geodesics, understood as straightest trajectories in discretized curved spacetime. The notion is generic, as it is formulated in terms of a general deviation function, but readily specializes to metric spaces such as discretized pseudo-riemannian manifolds. It is effective: an algorithm for computing these geodesics naturally follows, which allows numerical validation---as shown by computing the perihelion shift of a Mercury-like planet. It is consistent, in the continuum limit, with the standard notion of timelike geodesics in a pseudo-riemannian manifold. Whether the algorithm fits within the framework of cellular automata is discussed at length. KEYWORDS: Discrete connection, parallel transport, general relativity, Regge calculus.
Exact analysis of discrete data
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...
Causal Dynamics of Discrete Surfaces
Pablo Arrighi
2014-03-01
Full Text Available We formalize the intuitive idea of a labelled discrete surface which evolves in time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same.
Discrete Event Programming with Simkit
Buss, Arnold
2001-01-01
This paper is a brief introduction to the use of Simkit, a software package for implementing Discrete Event Simulation (DES) models. Simkit is written in Java (for any operating system with Java 2TM ).
Multiscale expansions in discrete world
Ömer Ünsal; Filiz Taşcan; Mehmet Naci Özer
2014-07-01
In this paper, we show the attainability of KdV equation from some types of nonlinear Schrödinger equation by using multiscale expansions discretely. The power of this manageable method is confirmed by applying it to two selected nonlinear Schrödinger evolution equations. This approach can also be applied to other nonlinear discrete evolution equations. All the computations have been made with Maple computer packet program.
Discrete solitons in graphene metamaterials
Bludov, Yuliy V.; Smirnova, Daria A.; Kivshar, Yuri S.; Peres, N. M. R.; Vasilevskiy, Mikhail
2014-01-01
We study nonlinear properties of multilayer metamaterials created by graphene sheets separated by dielectric layers. We demonstrate that such structures can support localized nonlinear modes described by the discrete nonlinear Schr\\"{o}dinger equation and that its solutions are associated with stable discrete plasmon solitons. We also analyze the nonlinear surface modes in truncated graphene metamaterials being a nonlinear analog of surface Tamm states. Fundação para a Ciência e a Tecnolog...
Discrete solitons in graphene metamaterials
Bludov, Yu. V.; Smirnova, D. A.; Kivshar, Yu. S.; Peres, N. M. R.; Vasilevskiy, M. I.
2015-01-01
We study nonlinear properties of multilayer metamaterials created by graphene sheets separated by dielectric layers. We demonstrate that such structures can support localized nonlinear modes described by the discrete nonlinear Schrödinger equation and that its solutions are associated with stable discrete plasmon solitons. We also analyze the nonlinear surface modes in truncated graphene metamaterials being a nonlinear analog of surface Tamm states.
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...
Brewer, Megan H.; Chaudhry, Rabia; Qi, Jessica; Kidambi, Aditi; Drew, Alexander P.; Ryan, Monique M.; Subramanian, Gopinath M.; Young, Helen K.; Zuchner, Stephan; Reddel, Stephen W.; Nicholson, Garth A.; Kennerson, Marina L.
2016-01-01
With the advent of whole exome sequencing, cases where no pathogenic coding mutations can be found are increasingly being observed in many diseases. In two large, distantly-related families that mapped to the Charcot-Marie-Tooth neuropathy CMTX3 locus at chromosome Xq26.3-q27.3, all coding mutations were excluded. Using whole genome sequencing we found a large DNA interchromosomal insertion within the CMTX3 locus. The 78 kb insertion originates from chromosome 8q24.3, segregates fully with the disease in the two families, and is absent from the general population as well as 627 neurologically normal chromosomes from in-house controls. Large insertions into chromosome Xq27.1 are known to cause a range of diseases and this is the first neuropathy phenotype caused by an interchromosomal insertion at this locus. The CMTX3 insertion represents an understudied pathogenic structural variation mechanism for inherited peripheral neuropathies. Our finding highlights the importance of considering all structural variation types when studying unsolved inherited peripheral neuropathy cases with no pathogenic coding mutations. PMID:27438001
Initial data generating bounded solutions of linear discrete equations
Jaromír Baštinec
2006-01-01
Full Text Available A lot of papers are devoted to the investigation of the problem of prescribed behavior of solutions of discrete equations and in numerous results sufficient conditions for existence of at least one solution of discrete equations having prescribed asymptotic behavior are indicated. Not so much attention has been paid to the problem of determining corresponding initial data generating such solutions. We fill this gap for the case of linear equations in this paper. The initial data mentioned are constructed with use of two convergent monotone sequences. An illustrative example is considered, too.
Discrete Curvature Theories and Applications
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
Analysis of Discrete Mittag - Leffler Functions
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.
NAFASS: Discrete spectroscopy of random signals
Nigmatullin, R.R., E-mail: nigmat@knet.r [Institute of Physics, Kazan (Volga Region) Federal University, Kremlevskaya str.18, Kazan, Tatarstan 420008 (Russian Federation); Osokin, S.I. [Institute of Physics, Kazan (Volga Region) Federal University, Kremlevskaya str.18, Kazan, Tatarstan 420008 (Russian Federation); Toboev, V.A. [Department of Mathematics, Chuvash State University, Moskovskiy pr., 15, Cheboksary 428015 (Russian Federation)
2011-04-15
Research highlights: The successful solution of the Prony's problem has been obtained. It means that for any random signal its amplitude-frequency response can be found. This solution opens quite new possibilities in creation of new discrete spectroscopy in analysis of different nanoscopic and intermolecular signals. Real NIR spectra and biological data were considered and analyzed as examples. The conception of the pseudo-ergodic noise is introduced. It helps to fit the auto-correlation function that is related to remnant function. The three basic principles of the fluctuation metrology are formulated. - Abstract: In this paper we suggest a new discrete spectroscopy for analysis of random signals and fluctuations. This discrete spectroscopy is based on successful solution of the modified Prony's problem for the strongly-correlated random sequences. As opposed to the general Prony's problem where the set of frequencies is supposed to be unknown in the new approach suggested the distribution of the unknown frequencies can be found for the strongly-correlated random sequences. Preliminary information about the frequency distribution facilitates the calculations and attaches an additional stability in the presence of a noise. This spectroscopy uses only the informative-significant frequency band that helps to fit the given signal with high accuracy. It means that any random signal measured in t-domain can be 'read' in terms of its amplitude-frequency response (AFR) without model assumptions related to the behavior of this signal in the frequency region. The method overcomes some essential drawbacks of the conventional Prony's method and can be determined as the non-orthogonal amplitude frequency analysis of the smoothed sequences (NAFASS). In this paper we outline the basic principles of the NAFASS procedure and show its high potential possibilities based on analysis of some actual NIR data. The AFR obtained serves as a specific
Extensional Elastica in large deformation as $Gamma $ Γ -limit of a discrete 1D mechanical system
Alibert, Jean-Jacques; Della Corte, Alessandro; Giorgio, Ivan; Battista, Antonio
2017-04-01
The present paper deals with the rigorous homogenization of a discrete system consisting of extensible rods linked by rotational springs. Specifically, a Γ -convergence result is proven for a sequence of discrete measure functionals En, describing the energy of the discrete system, toward the continuous energy functional for the extensible Euler beam model ( Elastica) in large deformation regime. A relative compactness result for the sequence En is also proven. Moreover, numerical results are shown on the deformed shape and on the total energy of the system when the number of elements of the discrete system increases. The numerical convergence of the energy to a definite value is shown in two cases. The results provide rigorous justification of a very commonly used algorithm for the discretization of the extensible Euler beam, namely Hencky-type beam model.
Minisuperspace models of discrete systems
Baytaş, Bekir
2016-01-01
A discrete quantum spin system is presented in which several modern methods of canonical quantum gravity can be tested with promising results. In particular, features of interacting dynamics are analyzed with an emphasis on homogeneous configurations and the dynamical building-up and stability of long-range correlations. Different types of homogeneous minisuperspace models are introduced for the system, including one based on condensate states, and shown to capture different aspects of the discrete system. They are evaluated with effective methods and by means of continuum limits, showing good agreement with operator calculations whenever the latter are available. As a possibly quite general result, it is concluded that an analysis of the building-up of long-range correlations in discrete systems requires non-perturbative solutions of the dynamical equations. Some questions related to stability can be analyzed perturbatively, but suggest that matter couplings may be relevant for this question in the context o...
Interference in discrete Wigner functions
Cormick, C; Cormick, Cecilia; Paz, Juan Pablo
2006-01-01
We analyse some features of the class of discrete Wigner functions that was recently introduced by Gibbons et al. to represent quantum states of systems with power-of-prime dimensional Hilbert spaces [Phys. Rev. A 70, 062101 (2004)]. We consider "cat" states obtained as coherent superpositions of states with positive Wigner function; for such states we show that the oscillations of the discrete Wigner function typically spread over the entire discrete phase-space (including the regions where the two interfering states are localized). This is a generic property which is in sharp contrast with the usual attributes of Wigner functions that make them useful candidates to display the existence of quantum coherence through oscillations. However, it is possible to find subsets of cat states with a natural phase-space representation, in which the oscillatory regions remain localized. We show that this can be done for interesting families of stabilizer states used in quantum error-correcting codes, and illustrate this...
Geometry of discrete quantum computing
Hanson, Andrew J.; Ortiz, Gerardo; Sabry, Amr; Tai, Yu-Tsung
2013-05-01
Conventional quantum computing entails a geometry based on the description of an n-qubit state using 2n infinite precision complex numbers denoting a vector in a Hilbert space. Such numbers are in general uncomputable using any real-world resources, and, if we have the idea of physical law as some kind of computational algorithm of the universe, we would be compelled to alter our descriptions of physics to be consistent with computable numbers. Our purpose here is to examine the geometric implications of using finite fields Fp and finite complexified fields \\mathbf {F}_{p^2} (based on primes p congruent to 3 (mod4)) as the basis for computations in a theory of discrete quantum computing, which would therefore become a computable theory. Because the states of a discrete n-qubit system are in principle enumerable, we are able to determine the proportions of entangled and unentangled states. In particular, we extend the Hopf fibration that defines the irreducible state space of conventional continuous n-qubit theories (which is the complex projective space \\mathbf {CP}^{2^{n}-1}) to an analogous discrete geometry in which the Hopf circle for any n is found to be a discrete set of p + 1 points. The tally of unit-length n-qubit states is given, and reduced via the generalized Hopf fibration to \\mathbf {DCP}^{2^{n}-1}, the discrete analogue of the complex projective space, which has p^{2^{n}-1} (p-1)\\,\\prod _{k=1}^{n-1} ( p^{2^{k}}+1) irreducible states. Using a measure of entanglement, the purity, we explore the entanglement features of discrete quantum states and find that the n-qubit states based on the complexified field \\mathbf {F}_{p^2} have pn(p - 1)n unentangled states (the product of the tally for a single qubit) with purity 1, and they have pn + 1(p - 1)(p + 1)n - 1 maximally entangled states with purity zero.
DISCRETE ROTATIONS AND CELLULAR AUTOMATA
Nouvel, Bertrand
2006-01-01
In a discrete space, such as the set of integer-coordinate points, the modelization of isotropy may lead to noticeable theoretical difficulties. At this time, we do not know any gerometric theory on $\\ZZ^n$ that would be suitable to describe the isotropy the same way it is perceived by Euclidean geometry. With respect to this problematic, our aim is to describe some algorithms that would give to the discrete rotations some properties that would be similar to the properties of the Euclidean ro...
Stable discrete surface light bullets.
Mihalache, Dumitru; Mazilu, Dumitru; Lederer, Falk; Kivshar, Yuri S
2007-01-22
We analyze spatiotemporal light localization near the edge of a semi-infinite array of weakly coupled nonlinear optical waveguides and demonstrate the existence of a novel class of continuous-discrete spatiotemporal solitons, the so-called discrete surface light bullets. We show that their properties are strongly affected by the presence of the surface. To this end the crossover between surface and quasi-bulk bullets is studied by analyzing the families of solitons propagating at different distances from the edge of the waveguide array.
Discrete Hamiltonian for General Relativity
Ziprick, Jonathan
2015-01-01
Beginning from canonical general relativity written in terms of Ashtekar variables, we derive a discrete phase space with a physical Hamiltonian for gravity. The key idea is to define the gravitational fields within a complex of three-dimensional cells such that the dynamics is completely described by discrete boundary variables, and the full theory is recovered in the continuum limit. Canonical quantization is attainable within the loop quantum gravity framework, and we believe this will lead to a promising candidate for quantum gravity.
Some discrete multiple orthogonal polynomials
Arvesú, J.; Coussement, J.; van Assche, W.
2003-04-01
In this paper, we extend the theory of discrete orthogonal polynomials (on a linear lattice) to polynomials satisfying orthogonality conditions with respect to r positive discrete measures. First we recall the known results of the classical orthogonal polynomials of Charlier, Meixner, Kravchuk and Hahn (T.S. Chihara, An Introduction to Orthogonal Polynomials, Gordon and Breach, New York, 1978; R. Koekoek and R.F. Swarttouw, Reports of the Faculty of Technical Mathematics and Informatics No. 98-17, Delft, 1998; A.F. Nikiforov et al., Classical Orthogonal Polynomials of a Discrete Variable, Springer, Berlin, 1991). These polynomials have a lowering and raising operator, which give rise to a Rodrigues formula, a second order difference equation, and an explicit expression from which the coefficients of the three-term recurrence relation can be obtained. Then we consider r positive discrete measures and define two types of multiple orthogonal polynomials. The continuous case (Jacobi, Laguerre, Hermite, etc.) was studied by Van Assche and Coussement (J. Comput. Appl. Math. 127 (2001) 317-347) and Aptekarev et al. (Multiple orthogonal polynomials for classical weights, manuscript). The families of multiple orthogonal polynomials (of type II) that we will study have a raising operator and hence a Rodrigues formula. This will give us an explicit formula for the polynomials. Finally, there also exists a recurrence relation of order r+1 for these multiple orthogonal polynomials of type II. We compute the coefficients of the recurrence relation explicitly when r=2.
A nonlocal discretization of fields
Campos, R G; Pimentel, L O; Campos, Rafael G.; Tututi, Eduardo S.
2001-01-01
A nonlocal method to obtain discrete classical fields is presented. This technique relies on well-behaved matrix representations of the derivatives constructed on a non--equispaced lattice. The drawbacks of lattice theory like the fermion doubling or the breaking of chiral symmetry for the massless case, are absent in this method.
Discrete breathers in Josephson ladders
Trias, E.; Mazo, J.J.; Brinkman, A.; Orlando, T.P.
2001-01-01
We present a study of nonlinear localized excitations called discrete breathers in a superconducting array. These localized solutions were recently observed in Josephson-junction ladder arrays by two different experimental groups [Phys. Rev. Lett. 84 (2000) 741; Phys. Rev. Lett. 84 (2000) 745; Phys.
Discrete implementations of scale transform
Djurdjanovic, Dragan; Williams, William J.; Koh, Christopher K.
1999-11-01
Scale as a physical quantity is a recently developed concept. The scale transform can be viewed as a special case of the more general Mellin transform and its mathematical properties are very applicable in the analysis and interpretation of the signals subject to scale changes. A number of single-dimensional applications of scale concept have been made in speech analysis, processing of biological signals, machine vibration analysis and other areas. Recently, the scale transform was also applied in multi-dimensional signal processing and used for image filtering and denoising. Discrete implementation of the scale transform can be carried out using logarithmic sampling and the well-known fast Fourier transform. Nevertheless, in the case of the uniformly sampled signals, this implementation involves resampling. An algorithm not involving resampling of the uniformly sampled signals has been derived too. In this paper, a modification of the later algorithm for discrete implementation of the direct scale transform is presented. In addition, similar concept was used to improve a recently introduced discrete implementation of the inverse scale transform. Estimation of the absolute discretization errors showed that the modified algorithms have a desirable property of yielding a smaller region of possible error magnitudes. Experimental results are obtained using artificial signals as well as signals evoked from the temporomandibular joint. In addition, discrete implementations for the separable two-dimensional direct and inverse scale transforms are derived. Experiments with image restoration and scaling through two-dimensional scale domain using the novel implementation of the separable two-dimensional scale transform pair are presented.
Discrete Multiscale Analysis: A Biatomic Lattice System
Contra, G A Cassatella; 10.1142/S1402925110000957
2010-01-01
We discuss a discrete approach to the multiscale reductive perturbative method and apply it to a biatomic chain with a nonlinear interaction between the atoms. This system is important to describe the time evolution of localized solitonic excitations. We require that also the reduced equation be discrete. To do so coherently we need to discretize the time variable to be able to get asymptotic discrete waves and carry out a discrete multiscale expansion around them. Our resulting nonlinear equation will be a kind of discrete Nonlinear Schr\\"odinger equation. If we make its continuum limit, we obtain the standard Nonlinear Schr\\"odinger differential equation.
A discrete Fourier transform for virtual memory machines
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.
Discrete Gauge Symmetries in Discrete MSSM-like Orientifolds
Ibanez, L E; 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 32990 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)xU(2)xU(1)xU(1) and U(3)xSp(2)xU(1)xU(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.
Discrete gauge symmetries in discrete MSSM-like orientifolds
Ibáñez, L. E.; Schellekens, A. N.; Uranga, A. M.
2012-12-01
Motivated by the necessity of discrete ZN 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 Z2 (R-parity) and Z3 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.
Models of optimum discrete signals on the vector combinatorial configurations
V. V. Riznyk
2016-06-01
Full Text Available Method for construction of optimum discrete signals, based on a new conceptual combinatorial model of the systems - Ideal Ring Vector sequences (clusters of the IRV is proposed. IRV clusters are cyclic ordered sequences of t- integer sub-sequences of sequence, which form perfect relationships of t-dimensional partitions over a virtual t-dimensional lattice covered surface of a finite space interval. The sums of connected sub-sequences of an IRV enumerate the set of t- coordinates specified with respect to cyclic frame reference exactly R-times. This property makes IRVs useful in applications, which need to partition multidimensional objects with the smallest possible number of intersections. There are discover a great class of new two- and multidimensional combinatorial constructions, which being in excess classic models of discrete systems with respect to number and combinatorial varieties with theoretically non-limited values of upper boundaries on order of dimensionality –IRV. It shows that remarkable properties of IRVs encoded in fine structure of torus circular symmetry. There are regarded basic properties these models and made shortest comparative analysis of the models with classical models. Indicate that the IRVs to be in exceed of difference sets multiply, and set of the classical difference sets is subset of the IRVs. Some of useful examples for constructing of the optimum discrete signals, error-correcting codes, and ring monolithic optimum vector codes using IRVs are considered. The problem statement involves development the regular method for construction of the optimum discrete signals using two- and multidimensional IRVs. The favorable technical merits of IRVs sets named “Gloria to Ukraine Stars”, which remarkable properties hold for the same set of the IRVs in varieties permutations of its terms is demonstrated, and method for design of two- or multidimensional vector signals coded based on the optimum binary monolithic
Discretizing a backward stochastic differential equation
Yinnan Zhang; Weian Zheng
2002-01-01
We show a simple method to discretize Pardoux-Peng's nonlinear backward stochastic differential equation. This discretization scheme also gives a numerical method to solve a class of semi-linear PDEs.
Discrete and Continuous Linearizable Equations
Lafortune, S; Ramani, A
1998-01-01
We study the projective systems in both continuous and discrete settings. These systems are linearizable by construction and thus, obviously, integrable. We show that in the continuous case it is possible to eliminate all variables but one and reduce the system to a single differential equation. This equation is of the form of those singled-out by Painlevé in his quest for integrable forms. In the discrete case, we extend previous results of ours showing that, again by elimination of variables, the general projective system can be written as a mapping for a single variable. We show that this mapping is a member of the family of multilinear systems (which is not integrable in general). The continuous limit of multilinear mappings is also discussed.
Discrete mathematics using a computer
Hall, Cordelia
2000-01-01
Several areas of mathematics find application throughout computer science, and all students of computer science need a practical working understanding of them. These core subjects are centred on logic, sets, recursion, induction, relations and functions. The material is often called discrete mathematics, to distinguish it from the traditional topics of continuous mathematics such as integration and differential equations. The central theme of this book is the connection between computing and discrete mathematics. This connection is useful in both directions: • Mathematics is used in many branches of computer science, in applica tions including program specification, datastructures,design and analysis of algorithms, database systems, hardware design, reasoning about the correctness of implementations, and much more; • Computers can help to make the mathematics easier to learn and use, by making mathematical terms executable, making abstract concepts more concrete, and through the use of software tools su...
Discrete Scalar Quantum Field Theory
Gudder, Stan
2016-01-01
We begin with a description of spacetime by a 4-dimensional cubic lattice $\\sscript$. It follows from this framework that the the speed of light is the only nonzero instantaneous speed for a particle. The dual space $\\sscripthat$ corresponds to a cubic lattice of energy-momentum. This description implies that there is a discrete set of possible particle masses. We then define discrete scalar quantum fields on $\\sscript$. These fields are employed to define interaction Hamiltonians and scattering operators. Although the scattering operator $S$ cannot be computed exactly, approximations are possible. Whether $S$ is unitary is an unsolved problem. Besides the definitions of these operators, our main assumption is conservation of energy-momentum for a scattering process. This article concludes with various examples of perturbation approximations. These include simplified versions of electron-electron and electron-proton scattering as well as simple decay processes. We also define scattering cross-sections, decay ...
Discrete fields on the lightcone
De Souza, M M
1997-01-01
We introduce a classical field theory based on a concept of extended causality that mimics the causality of a point- particle Classical Mechanics by imposing constraints that are equivalent to a particle initial position and velocity. It results on a description of discrete (pointwise) interactions in terms of localized particle-like fields. We find the propagators of these particle-like fields and discuss their physical meaning, properties and consequences. They are conformally invariant, singularity-free, and describing a manifestly covariant $(1+1)$-dimensional dynamics in a $(3+1)$ spacetime. Remarkably this conformal symmetry remains even for the propagation of a massive field in four spacetime dimensions. The standard formalism with its distributed fields is retrieved in terms of spacetime average of the discrete fields. Singularities are the by-products of the averaging proccess. This new formalism enlighten the meaning and the problems of field theory, and may allow a softer transition to a quantum th...
Applied geometry and discrete mathematics
Sturm; Gritzmann, Peter; Sturmfels, Bernd
1991-01-01
This volume, published jointly with the Association for Computing Machinery, comprises a collection of research articles celebrating the occasion of Victor Klee's sixty-fifth birthday in September 1990. During his long career, Klee has made contributions to a wide variety of areas, such as discrete and computational geometry, convexity, combinatorics, graph theory, functional analysis, mathematical programming and optimization, and theoretical computer science. In addition, Klee made important contributions to mathematics education, mathematical methods in economics and the decision sciences, applications of discrete mathematics in the biological and social sciences, and the transfer of knowledge from applied mathematics to industry. In honor of Klee's achievements, this volume presents more than forty papers on topics related to Klee's research. While the majority of the papers are research articles, a number of survey articles are also included. Mirroring the breadth of Klee's mathematical contributions, th...
Discrete symmetries in the MSSM
Schieren, Roland
2010-12-02
The use of discrete symmetries, especially abelian ones, in physics beyond the standard model of particle physics is discussed. A method is developed how a general, abelian, discrete symmetry can be obtained via spontaneous symmetry breaking. In addition, anomalies are treated in the path integral approach with special attention to anomaly cancellation via the Green-Schwarz mechanism. All this is applied to the minimal supersymmetric standard model. A unique Z{sup R}{sub 4} symmetry is discovered which solves the {mu}-problem as well as problems with proton decay and allows to embed the standard model gauge group into a simple group, i.e. the Z{sup R}{sub 4} is compatible with grand unification. Also the flavor problem in the context of minimal flavor violation is addressed. Finally, a string theory model is presented which exhibits the mentioned Z{sup R}{sub 4} symmetry and other desirable features. (orig.)
Discrete range clustering using Monte Carlo methods
Chatterji, G. B.; Sridhar, B.
1993-01-01
For automatic obstacle avoidance guidance during rotorcraft low altitude flight, a reliable model of the nearby environment is needed. Such a model may be constructed by applying surface fitting techniques to the dense range map obtained by active sensing using radars. However, for covertness, passive sensing techniques using electro-optic sensors are desirable. As opposed to the dense range map obtained via active sensing, passive sensing algorithms produce reliable range at sparse locations, and therefore, surface fitting techniques to fill the gaps in the range measurement are not directly applicable. Both for automatic guidance and as a display for aiding the pilot, these discrete ranges need to be grouped into sets which correspond to objects in the nearby environment. The focus of this paper is on using Monte Carlo methods for clustering range points into meaningful groups. One of the aims of the paper is to explore whether simulated annealing methods offer significant advantage over the basic Monte Carlo method for this class of problems. We compare three different approaches and present application results of these algorithms to a laboratory image sequence and a helicopter flight sequence.
Discrete mathematics: methods and challenges
Alon, Noga
2002-01-01
Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. One of the main reasons for this growth is the tight connection between Discrete Mathematics and Theoretical Computer Science, and the rapid development of the latter. While in the past many of the basic combinatorial results were obtained mainly by ingenuity and detailed reasoning, the modern theory has grown ...
The remarkable discreteness of being
Bahram Houchmandzadeh
2014-04-01
Life is a discrete, stochastic phenomenon: for a biological organism, the time of the two most important events of its life (reproduction and death) is random and these events change the number of individuals of the species by single units. These facts can have surprising, counterintuitive consequences. I review here three examples where these facts play, or could play, important roles: the spatial distribution of species, the structuring of biodiversity and the (Darwinian) evolution of altruistic behaviour.
Manpower Analysis Using Discrete Simulation
2015-12-01
Course STA-21 Seaman to Admiral (21st century) SQL Structured Query Language TOS Time on Station xiv THIS PAGE INTENTIONALLY LEFT BLANK...using Simkit—a widely available library based in the Java programming language for building Discrete Event Simulation (DES) models. By overriding...intervals (i.e., quarterly), while holding attrition negligible. For the purposes of modeling each new accession to the system, the Arrival
Invariants of broken discrete symmetries
Kalozoumis, P; Diakonos, F K; Schmelcher, P
2014-01-01
The parity and Bloch theorems are generalized to the case of broken global symmetry. Local inversion or translation symmetries are shown to yield invariant currents that characterize wave propagation. These currents map the wave function from an arbitrary spatial domain to any symmetry-related domain. Our approach addresses any combination of local symmetries, thus applying in particular to acoustic, optical and matter waves. Nonvanishing values of the invariant currents provide a systematic pathway to the breaking of discrete global symmetries.
The remarkable discreteness of being
Houchmandzadeh, Bahram
2013-01-01
Life is a discrete, stochastic phenomena : for a biological organism, the time of the two most important events of its life (reproduction and death) is random and these events change the number of individuals of the species by single units. These facts can have surprising, counter-intuitive consequences. I review here three examples where these facts play, or could play, important roles : the spatial distribution of species, the biodiversity and the (Darwinian) evolution of altruistic behavior.
Discretized configurations and partial partitions
Abrams, Aaron; Hower, Valerie
2010-01-01
We show that the discretized configuration space of $k$ points in the $n$-simplex is homotopy equivalent to a wedge of spheres of dimension $n-k+1$. This space is homeomorphic to the order complex of the poset of ordered partial partitions of $\\{1,\\...,n+1\\}$ with exactly $k$ parts. We also compute the Euler characteristic in two different ways, thereby obtaining a topological proof of a combinatorial recurrence satisfied by the Stirling numbers of the second kind.
Observability of discretized partial differential equations
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.
Discretization of Preisach hysteresis model
安凯; 蔡国平
2015-01-01
In order to reduce the partial derivative errors in Preisach hysteresis model caused by inaccurate experimental data, the concept and correlative method of discretization of Preisach hysteresis model are proposed, the essential of which is to centralize the distribution density of Preisach hysteresis model in local region as an integral, which is defined as the weight of a certain point in that region. For the input composed of an ascending segment and a descending segment, a method to determine the initial weights together with an additional method to determine present weights is given according to the number of input ascending segments. If the number of input ascending segments increases, the weights of the corresponding points in updating rectangle are updated by adding the initial weights of corresponding points. A prominent advantage of discrete Preisach hysteresis model is its memory efficiency. Another advantage of discrete Preisach hysteresis model is that there is no function in the model, and thus, it can be expediently operated using a computer. By generalizing the above updating rectangle method to the continuous Preisach hysteresis model, identification method of distribution density can be given as well.
Modelling Mobility: A Discrete Revolution
Clementi, Andrea; Silvestri, Riccardo
2010-01-01
We introduce a new approach to model and analyze \\emph{Mobility}. It is fully based on discrete mathematics and yields a class of mobility models, called the \\emph{Markov Trace} Model. This model can be seen as the discrete version of the \\emph{Random Trip} Model including all variants of the \\emph{Random Way-Point} Model \\cite{L06}. We derive fundamental properties and \\emph{explicit} analytical formulas for the \\emph{stationary distributions} yielded by the Markov Trace Model. Such results can be exploited to compute formulas and properties for concrete cases of the Markov Trace Model by just applying counting arguments. We apply the above general results to the discrete version of the \\emph{Manhattan Random Way-Point} over a square of bounded size. We get formulas for the total stationary distribution and for two important \\emph{conditional} ones: the agent spatial and destination distributions. Our method makes the analysis of complex mobile systems a feasible task. As a further evidence of this important...
Discrete port-Hamiltonian systems : mixed interconnections
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
Inflation and Dirac in the Causal Set Approach to Discrete Quantum Gravity
Gudder, Stan
2015-01-01
In this approach to discrete quantum gravity the basic structural element is a covariant causal set ($c$-causet). The geometry of a $c$-causet is described by a shell-sequence that determines the discrete gravity of a universe. In this growth model, universes evolve in discrete time by adding new vertices to their generating $c$-causet. We first describe an inflationary period that is common to all universes. After this very brief cycle, the model enters a multiverse period in which the system diverges in various ways forming paths of $c$-causets. At the beginning of the multiverse period, the structure of a four-dimensional discrete manifold emerges and quantum mechanics enters the picture. A natural Hilbert space is defined and a discrete, free Dirac operator is introduced. We determine the eigenvalues and eigenvectors of this operator. Finally, we propose values for coupling constants that determine multiverse probabilities. These probabilities predict the dominance of pulsating universes.
Geometry and Hamiltonian mechanics on discrete spaces
Talasila, V.; Clemente-Gallardo, J.; van der Schaft, A. J.
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...
Processing modes and parallel processors in producing familiar keying sequences
Verwey, Willem B.
2003-01-01
Recent theorizing indicates that the acquisition of movement sequence skill involves the development of several independent sequence representations at the same time. To examine this for the discrete sequence production task, participants in Experiment 1 produced a highly practiced sequence of six k
Viability decision of linear discrete-time stochastic systems with probability criterion
Wansheng TANG; Jun ZHENG; Jianxiong ZHANG
2009-01-01
In this paper,the optimal viability decision problem of linear discrete-time stochastic systems with probability criterion is investigated.Under the condition of sequence-reachable discrete-time dynamic systems,the existence theorem of optimal viability strategy is given and the solving procedure of the optimal strategy is provided based on dynamic programming.A numerical example shows the effectiveness of the proposed methods.
A Discrete Equivalent of the Logistic Equation
Petropoulou EugeniaN
2010-01-01
Full Text Available A discrete equivalent and not analogue of the well-known logistic differential equation is proposed. This discrete equivalent logistic equation is of the Volterra convolution type, is obtained by use of a functional-analytic method, and is explicitly solved using the -transform method. The connection of the solution of the discrete equivalent logistic equation with the solution of the logistic differential equation is discussed. Also, some differences of the discrete equivalent logistic equation and the well-known discrete analogue of the logistic equation are mentioned. It is hoped that this discrete equivalent of the logistic equation could be a better choice for the modelling of various problems, where different versions of known discrete logistic equations are used until nowadays.
A Discrete SIRS Model with Kicked Loss of Immunity and Infection Probability
Paladini, F.; Renna, I.; Renna, L.
2011-03-01
A discrete-time deterministic epidemic model is proposed with the aim of reproducing the behaviour observed in the incidence of real infectious diseases, such as oscillations and irregularities. For this purpose we introduce, in a naïve discrete-time SIRS model, seasonal variability in the loss of immunity and in the infection probability, modelled by sequences of kicks. Restrictive assumptions are made on the parameters of the models, in order to guarantee that the transitions are determined by true probabilities, so that comparisons with stochastic discrete-time previsions can be also provided. Numerical simulations show that the characteristics of real infectious diseases can be adequately modeled.
A Discrete SIRS Model with Kicked Loss of Immunity and Infection Probability
Paladini, F; Renna, L [Dipartimento di Fisica dell' Universita del Salento, 73100 Lecce (Italy); Renna, I, E-mail: luigi.renna@le.infn.it [ISIR, Universite Pierre et Marie Curie/CNRS, F-75005 Paris (France)
2011-03-01
A discrete-time deterministic epidemic model is proposed with the aim of reproducing the behaviour observed in the incidence of real infectious diseases, such as oscillations and irregularities. For this purpose we introduce, in a naive discrete-time SIRS model, seasonal variability in the loss of immunity and in the infection probability, modelled by sequences of kicks. Restrictive assumptions are made on the parameters of the models, in order to guarantee that the transitions are determined by true probabilities, so that comparisons with stochastic discrete-time previsions can be also provided. Numerical simulations show that the characteristics of real infectious diseases can be adequately modeled.
Discrete Torsion and Symmetric Products
Dijkgraaf, R
1999-01-01
In this note we point out that a symmetric product orbifold CFT can be twisted by a unique nontrivial two-cocycle of the permutation group. This discrete torsion changes the spins and statistics of corresponding second-quantized string theory making it essentially ``supersymmetric.'' The long strings of even length become fermionic (or ghosts), those of odd length bosonic. The partition function and elliptic genus can be described by a sum over stringy spin structures. The usual cubic interaction vertex is odd and nilpotent, so this construction gives rise to a DLCQ string theory with a leading quartic interaction.
Radiative transfer on discrete spaces
Preisendorfer, Rudolph W; Stark, M; Ulam, S
1965-01-01
Pure and Applied Mathematics, Volume 74: Radiative Transfer on Discrete Spaces presents the geometrical structure of natural light fields. This book describes in detail with mathematical precision the radiometric interactions of light-scattering media in terms of a few well established principles.Organized into four parts encompassing 15 chapters, this volume begins with an overview of the derivations of the practical formulas and the arrangement of formulas leading to numerical solution procedures of radiative transfer problems in plane-parallel media. This text then constructs radiative tran
Invariants of Broken Discrete Symmetries
Kalozoumis, P. A.; Morfonios, C.; Diakonos, F. K.; Schmelcher, P.
2014-08-01
The parity and Bloch theorems are generalized to the case of broken global symmetry. Local inversion or translation symmetries in one dimension are shown to yield invariant currents that characterize wave propagation. These currents map the wave function from an arbitrary spatial domain to any symmetry-related domain. Our approach addresses any combination of local symmetries, thus applying, in particular, to acoustic, optical, and matter waves. Nonvanishing values of the invariant currents provide a systematic pathway to the breaking of discrete global symmetries.
Discrete geometric structures for architecture
Pottmann, Helmut
2010-06-13
The emergence of freeform structures in contemporary architecture raises numerous challenging research problems, most of which are related to the actual fabrication and are a rich source of research topics in geometry and geometric computing. The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization of supporting beams and nodes. A study of quadrilateral meshes with planar faces reveals beautiful relations to discrete differential geometry. In particular, we discuss meshes which discretize the network of principal curvature lines. Conical meshes are among these meshes; they possess conical offset meshes at a constant face/face distance, which in turn leads to a supporting beam layout with so-called torsion free nodes. This work can be generalized to a variety of multilayer structures and laid the ground for an adapted curvature theory for these meshes. There are also efforts on segmenting surfaces into planar hexagonal panels. Though these are less constrained than planar quadrilateral panels, this problem is still waiting for an elegant solution. Inspired by freeform designs in architecture which involve circles and spheres, we present a new kind of triangle mesh whose faces\\' in-circles form a packing, i.e., the in-circles of two triangles with a common edge have the same contact point on that edge. These "circle packing (CP) meshes" exhibit an aesthetic balance of shape and size of their faces. They are closely tied to sphere packings on surfaces and to various remarkable structures and patterns which are of interest in art, architecture, and design. CP meshes constitute a new link between architectural freeform design and computational conformal geometry. Recently, certain timber structures motivated us to study discrete patterns of geodesics on surfaces. This
Discrete and finite General Relativity
De Souza, M M; Souza, Manoelito M. de; Silveira, Robson N.
1999-01-01
We develop the General Theory of Relativity in a formalism with extended causality that describes physical interaction through discrete, transversal and localized pointlike fields. The homogeneous field equations are then solved for a finite, singularity-free, point-like field that we associate to a ``classical graviton". The standard Einstein's continuous formalism is retrieved by means of an averaging process, and its continuous solutions are determined by the chsosen imposed symetry. The Schwarzschild metric is obtained by the imposition of spherical symmetry on the averaged field.
Fundamental approach to discrete mathematics
Acharjya, DP
2009-01-01
About the Book: The book `Fundamental Approach to Discrete Mathematics` is a required part of pursuing a computer science degree at most universities. It provides in-depth knowledge to the subject for beginners and stimulates further interest in the topic. The salient features of this book include: Strong coverage of key topics involving recurrence relation, combinatorics, Boolean algebra, graph theory and fuzzy set theory. Algorithms and examples integrated throughout the book to bring clarity to the fundamental concepts. Each concept and definition is followed by thoughtful examples.
Discrete gravity from statistical mechanics
Romano, Antonio Enea
2011-01-01
We show how to construct space time lattices with a Regge action proportional to the energy of a given Ising or Potts model macrostate. This allows to take advantage of the existence of exact solutions for these models to calculate the quantum wave function of the universe using the sum over the histories approach to quantum gravity. Motivated by this isomorphism we show how the Regge equations, i.e. the discrete equivalent of the vacuum Einstein equations, can be derived using statistical mechanics under the assumption that the energy of a given space time geometry is proportional to the Regge action.
Paterson Andrew H
2009-11-01
Full Text Available Abstract Background The Brassica species, related to Arabidopsis thaliana, include an important group of crops and represent an excellent system for studying the evolutionary consequences of polyploidy. Previous studies have led to a proposed structure for an ancestral karyotype and models for the evolution of the B. rapa genome by triplication and segmental rearrangement, but these have not been validated at the sequence level. Results We developed computational tools to analyse the public collection of B. rapa BAC end sequence, in order to identify candidates for representing collinearity discontinuities between the genomes of B. rapa and A. thaliana. For each putative discontinuity, one of the BACs was sequenced and analysed for collinearity with the genome of A. thaliana. Additional BAC clones were identified and sequenced as part of ongoing efforts to sequence four chromosomes of B. rapa. Strikingly few of the 19 inter-chromosomal rearrangements corresponded to the set of collinearity discontinuities anticipated on the basis of previous studies. Our analyses revealed numerous instances of newly detected collinearity blocks. For B. rapa linkage group A8, we were able to develop a model for the derivation of the chromosome from the ancestral karyotype. We were also able to identify a rearrangement event in the ancestor of B. rapa that was not shared with the ancestor of A. thaliana, and is represented in triplicate in the B. rapa genome. In addition to inter-chromosomal rearrangements, we identified and analysed 32 BACs containing the end points of segmental inversion events. Conclusion Our results show that previous studies of segmental collinearity between the A. thaliana, Brassica and ancestral karyotype genomes, although very useful, represent over-simplifications of their true relationships. The presence of numerous cryptic collinear genome segments and the frequent occurrence of segmental inversions mean that inference of the positions
A non-linear discrete transform for pattern recognition of discrete chaotic systems
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.
Entwinement in discretely gauged theories
Balasubramanian, V.; Bernamonti, A.; Craps, B.; De Jonckheere, T.; Galli, F.
2016-12-01
We develop the notion of "entwinement" to characterize the amount of quantum entanglement between internal, discretely gauged degrees of freedom in a quantum field theory. This concept originated in the program of reconstructing spacetime from entanglement in holographic duality. We define entwinement formally in terms of a novel replica method which uses twist operators charged in a representation of the discrete gauge group. In terms of these twist operators we define a non-local, gauge-invariant object whose expectation value computes entwinement in a standard replica limit. We apply our method to the computation of entwinement in symmetric orbifold conformal field theories in 1+1 dimensions, which have an S N gauging. Such a theory appears in the weak coupling limit of the D1-D5 string theory which is dual to AdS3 at strong coupling. In this context, we show how certain kinds of entwinement measure the lengths, in units of the AdS scale, of non-minimal geodesics present in certain excited states of the system which are gravitationally described as conical defects and the M = 0 BTZ black hole. The possible types of entwinement that can be computed define a very large new class of quantities characterizing the fine structure of quantum wavefunctions.
Supervised Discrete Hashing With Relaxation.
Gui, Jie; Liu, Tongliang; Sun, Zhenan; Tao, Dacheng; Tan, Tieniu
2016-12-29
Data-dependent hashing has recently attracted attention due to being able to support efficient retrieval and storage of high-dimensional data, such as documents, images, and videos. In this paper, we propose a novel learning-based hashing method called ''supervised discrete hashing with relaxation'' (SDHR) based on ''supervised discrete hashing'' (SDH). SDH uses ordinary least squares regression and traditional zero-one matrix encoding of class label information as the regression target (code words), thus fixing the regression target. In SDHR, the regression target is instead optimized. The optimized regression target matrix satisfies a large margin constraint for correct classification of each example. Compared with SDH, which uses the traditional zero-one matrix, SDHR utilizes the learned regression target matrix and, therefore, more accurately measures the classification error of the regression model and is more flexible. As expected, SDHR generally outperforms SDH. Experimental results on two large-scale image data sets (CIFAR-10 and MNIST) and a large-scale and challenging face data set (FRGC) demonstrate the effectiveness and efficiency of SDHR.
Entwinement in discretely gauged theories
Balasubramanian, V; Craps, B; De Jonckheere, T; Galli, F
2016-01-01
We develop the notion of entwinement to characterize the amount of quantum entanglement between internal, discretely gauged degrees of freedom in a quantum field theory. This concept originated in the program of reconstructing spacetime from entanglement in holographic duality. We define entwinement formally in terms of a novel replica method which uses twist operators charged in a representation of the discrete gauge group. In terms of these twist operators we define a non-local, gauge-invariant object whose expectation value computes entwinement in a standard replica limit. We apply our method to the computation of entwinement in symmetric orbifold conformal field theories in 1+1 dimensions, which have an $S_N$ gauging. Such a theory appears in the weak coupling limit of the D1-D5 string theory which is dual to AdS$_3$ at strong coupling. In this context, we show how certain kinds of entwinement measure the lengths, in units of the AdS scale, of non-minimal geodesics present in certain excited states of the...
Discrete auroras and magnetotail processes.
Lyons, L. R.
Important information about magnetospheric phenomena associated with auroras and substorms can be inferred from low-altitude auroral observations. Satellite observations have shown that discrete auroral arcs lie within a boundary plasma sheet (BPS) region that is outside the central plasma sheet (CPS). The observations imply that arcs are generated along BPS field lines by magnetospheric processes that form large, perpendicular electric field structures. The BPS and the arc generation processes apparently lie along field lines that are in the vicinity of the boundary between open and closed field lines and cross the tail (or magnetopause) current sheet. Ground-based observations show that the first indication of a substorm onset is the brightening of a quiet, discrete arc. This suggests that substorms are initiated along the BPS field lines associated with arc generation, and not within the CPS. Finally, auroral observations have shown that the area of open, polar-cap field lines varies considerably during periods of geomagnetic activity. Expansion of the polar cap has the potential for releasing trapped plasma sheet particles along freshly open field lines. The resulting evacuation of field lines has the potential for being an important loss process for the plasma sheet and for being a source of tailward flows and energetic particle bursts in the tail.
Input-output identification of controlled discrete manufacturing systems
Estrada-Vargas, Ana Paula; López-Mellado, Ernesto; Lesage, Jean-Jacques
2014-03-01
The automated construction of discrete event models from observations of external system's behaviour is addressed. This problem, often referred to as system identification, allows obtaining models of ill-known (or even unknown) systems. In this article, an identification method for discrete event systems (DESs) controlled by a programmable logic controller is presented. The method allows processing a large quantity of observed long sequences of input/output signals generated by the controller and yields an interpreted Petri net model describing the closed-loop behaviour of the automated DESs. The proposed technique allows the identification of actual complex systems because it is sufficiently efficient and well adapted to cope with both the technological characteristics of industrial controllers and data collection requirements. Based on polynomial-time algorithms, the method is implemented as an efficient software tool which constructs and draws the model automatically; an overview of this tool is given through a case study dealing with an automated manufacturing system.
Chaos for Discrete Dynamical System
Lidong Wang
2013-01-01
Full Text Available We prove that a dynamical system is chaotic in the sense of Martelli and Wiggins, when it is a transitive distributively chaotic in a sequence. Then, we give a sufficient condition for the dynamical system to be chaotic in the strong sense of Li-Yorke. We also prove that a dynamical system is distributively chaotic in a sequence, when it is chaotic in the strong sense of Li-Yorke.
LAN attack detection using Discrete Event Systems.
Hubballi, Neminath; Biswas, Santosh; Roopa, S; Ratti, Ritesh; Nandi, Sukumar
2011-01-01
Address Resolution Protocol (ARP) is used for determining the link layer or Medium Access Control (MAC) address of a network host, given its Internet Layer (IP) or Network Layer address. ARP is a stateless protocol and any IP-MAC pairing sent by a host is accepted without verification. This weakness in the ARP may be exploited by malicious hosts in a Local Area Network (LAN) by spoofing IP-MAC pairs. Several schemes have been proposed in the literature to circumvent these attacks; however, these techniques either make IP-MAC pairing static, modify the existing ARP, patch operating systems of all the hosts etc. In this paper we propose a Discrete Event System (DES) approach for Intrusion Detection System (IDS) for LAN specific attacks which do not require any extra constraint like static IP-MAC, changing the ARP etc. A DES model is built for the LAN under both a normal and compromised (i.e., spoofed request/response) situation based on the sequences of ARP related packets. Sequences of ARP events in normal and spoofed scenarios are similar thereby rendering the same DES models for both the cases. To create different ARP events under normal and spoofed conditions the proposed technique uses active ARP probing. However, this probing adds extra ARP traffic in the LAN. Following that a DES detector is built to determine from observed ARP related events, whether the LAN is operating under a normal or compromised situation. The scheme also minimizes extra ARP traffic by probing the source IP-MAC pair of only those ARP packets which are yet to be determined as genuine/spoofed by the detector. Also, spoofed IP-MAC pairs determined by the detector are stored in tables to detect other LAN attacks triggered by spoofing namely, man-in-the-middle (MiTM), denial of service etc. The scheme is successfully validated in a test bed.
Discrete extrinsic curvatures and approximation of surfaces by polar polyhedra
Garanzha, V. A.
2010-01-01
Duality principle for approximation of geometrical objects (also known as Eu-doxus exhaustion method) was extended and perfected by Archimedes in his famous tractate “Measurement of circle”. The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygons (polyhedra) which approximate curvilinear convex body. This sequence allows to approximate length of curve, as well as area and volume of the bodies and to obtain error estimates for approximation. In this work it is shown that a sequence of pairs of locally polar polyhedra allows to construct piecewise-affine approximation to spherical Gauss map, to construct convergent point-wise approximations to mean and Gauss curvature, as well as to obtain natural discretizations of bending energies. The Suggested approach can be applied to nonconvex surfaces and in the case of multiple dimensions.
Discrete quantum geometries and their effective dimension
Thürigen, 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 ef...
A Note on Discrete Einstein Metric
Ge, Huabin
2015-01-01
In this short note, we prove that the space of all admissible piecewise linear metrics parameterized by length square on a triangulated manifolds is a convex cone. We further study Regge's Einstein-Hilbert action and give a much more reasonable definition of discrete Einstein metric than our former version in \\cite{G}. Finally, we introduce a discrete Ricci flow for three dimensional triangulated manifolds, which is closely related to the existence of discrete Einstein metrics.
Discrete complex analysis on isoradial graphs
Chelkak, Dmitry; Smirnov, Stanislav
2008-01-01
We study discrete complex analysis and potential theory on a large family of planar graphs, the so-called isoradial ones. Along with discrete analogues of several classical results, we prove uniform convergence of discrete harmonic measures, Green's functions and Poisson kernels to their continuous counterparts. Among other applications, the results can be used to establish universality of the critical Ising and other lattice models.
Discrete calculus methods for counting
Mariconda, Carlo
2016-01-01
This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii’s theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications. Although several books touch on one or more of these aspects, precious few cover all of them. The authors, both pure mathematicians, have attempted to develop methods that will allow the student to formulate a given problem in a precise mathematical framework. The aim is to equip readers with a sound strategy for classifying and solving problems by pursuing a mathematically rigorous yet ...
Modeling discrete competitive facility location
Karakitsiou, Athanasia
2015-01-01
This book presents an up-to-date review of modeling and optimization approaches for location problems along with a new bi-level programming methodology which captures the effect of competition of both producers and customers on facility location decisions. While many optimization approaches simplify location problems by assuming decision making in isolation, this monograph focuses on models which take into account the competitive environment in which such decisions are made. New insights in modeling, algorithmic and theoretical possibilities are opened by this approach and new applications are possible. Competition on equal term plus competition between market leader and followers are considered in this study, consequently bi-level optimization methodology is emphasized and further developed. This book provides insights regarding modeling complexity and algorithmic approaches to discrete competitive location problems. In traditional location modeling, assignment of customer demands to supply sources are made ...
Efficient Discretization of Stochastic Integrals
Fukasawa, Masaaki
2012-01-01
Sharp asymptotic lower bounds of the expected quadratic variation of discretization error in stochastic integration are given. The theory relies on inequalities for the kurtosis and skewness of a general random variable which are themselves seemingly new. Asymptotically efficient schemes which attain the lower bounds are constructed explicitly. The result is directly applicable to practical hedging problem in mathematical finance; it gives an asymptotically optimal way to choose rebalancing dates and portofolios with respect to transaction costs. The asymptotically efficient strategies in fact reflect the structure of transaction costs. In particular a specific biased rebalancing scheme is shown to be superior to unbiased schemes if transaction costs follow a convex model. The problem is discussed also in terms of the exponential utility maximization.
Discretized Volumes in Numerical Methods
Antal, Miklós
2007-01-01
We present two techniques novel in numerical methods. The first technique compiles the domain of the numerical methods as a discretized volume. Congruent elements are glued together to compile the domain over which the solution of a boundary value problem is sought. We associate a group and a graph to that volume. When the group is symmetry of the boundary value problem under investigation, one can specify the structure of the solution, and find out if there are equispectral volumes of a given type. The second technique uses a complex mapping to transplant the solution from volume to volume and a correction function. Equation for the correction function is given. A simple example demonstrates the feasibility of the suggested method.
Lepton mixing and discrete symmetries
Hernandez, D.; Smirnov, A. Yu.
2012-09-01
The pattern of lepton mixing can emerge from breaking a flavor symmetry in different ways in the neutrino and charged lepton Yukawa sectors. In this framework, we derive the model-independent conditions imposed on the mixing matrix by the structure of discrete groups of the von Dyck type which include A4, S4, and A5. We show that, in general, these conditions lead to at least two equations for the mixing parameters (angles and CP phase δ). These constraints, which correspond to unbroken residual symmetries, are consistent with nonzero 13 mixing and deviations from maximal 2-3 mixing. For the simplest case, which leads to an S4 model and reproduces the allowed values of the mixing angles, we predict δ=(90°-120°).
Weak complementarity from discrete symmetries
Merlo, Luca
2009-01-01
The neutrino oscillation data find a good approximation in the so-called tri-bimaximal pattern. Recently a paper appeared showing that also the bimaximal pattern, which is already ruled out by the measurements, could be a very good starting point in order to describe the lepton mixing. In this paper I review both the flavour structures and then I present an explicit flavour model based on the discrete group S4, in which the PMNS mixing matrix is of the bimaximal form in first approximation and after it receives corrections which bring it in agreement with the data. The resulting spectrum of light neutrinos shows a moderate normal hierarchy and is compatible, within large ambiguities, with the constraints from leptogenesis as an explanation of the baryon asymmetry in the Universe.
On the geometry of discret Michell trusses
Almegaard, Henrik
2011-01-01
given by Michell in 1904. A set of simple design rules are extracted and it is indicated how these rules can be used to construct discrete Michell truss geometries. A number of geometrical optimized discrete examples of known Michell trusses are presented and they meet these design rules very well.......This paper concerns design of two-dimensional minimum weight trusses with a limited number of bars and nodes, so called discrete Michell trusses. It is shown that the geometrical properties for such discrete systems found by Prager in 1978, is analogues to the properties for continuous systems...
Estimation of the TQ-complexity of chaotic sequences
Makarenko, A V
2015-01-01
A new approach is proposed to the quantitative estimation of the complexity of multidimensional discrete sequences in terms of the shapes of their trajectories in the extended space of states. This approach is based on the study of the structural properties of sequences and is suitable for estimating the complexity of both chaotic and stochastic sequences. It is constructed on the method, proposed earlier by the author, of symbolic CTQ-analysis of multidimensional discrete sequences and mappings. The algorithm proposed manipulates not only the frequency of occurrence of symbols, but also takes into account their sequence order. An example (financial time series) is given that demonstrates the application of the tools developed.
Discrete Meyer Wavelet Transform Features For online Hangul Script Recognition
Jing Lu
2012-09-01
Full Text Available Online hangul script recognition is important when writers input characters into computer and communication apparatus (such as PDA, Mobile Phone. In this study, a Wavelet Transform Features-based method for performance improvement of online handwritten hangul character recognition is proposed. The main idea is applying the Discrete Wavelet Transform (DWT spectral analysis to the recognition of online hangul script. This method is based on the fact that online scripts offer space and time information. Locations of sample points belonging to a script give only space information and the order of occurrences of sample points provides time information. Given an online handwritten character sample, after a series of preprocessing, we obtain a 64×64 normalized online hangul handwritten script with the time information. The order of sample points can be the index of sequences. One sequence is the vertical coordinate of sample points. The second sequence is the horizontal coordinate of sample points. The third sequence is the product of the vertical coordinate and horizontal coordinate of sample points. The fourth sequence is the ratio between the vertical coordinate difference and horizontal coordinate difference of two sample points. The four sequences are combined as a vector whose size is 512. The vector is convoluted with the Meyer Wavelet and its dimension is reduced from 512 to 128 by Linear Discriminant Analysis (LDA scheme. Modified Quadratic Discriminant Functions (MQDF is utilized as the classifier for charter recognition. The Experiment results demonstrate that the method can improve the accuracy of character recognition.
Botnan, Magnus Bakke
2011-01-01
We study persistent homology, methods in discrete differential geometry and discrete Morse theory. Persistent homology is applied to computational biology and range image analysis. Theory from differential geometry is used to define curvature estimates of triangulated hypersurfaces. In particular, a well-known method for triangulated surfacesis generalised to hypersurfaces of any dimension. The thesis concludesby discussing a discrete analogue of Morse theory.
Noncommutative Differential Calculus and Its Application on Discrete Spaces
WANG Ming-Liang; LIU Zhen; ZHANG Jin-Liang; BAI Yong-Qiang; LI Xiang-Zheng; WU Ke; GUO Han-Ying
2008-01-01
We present the noncommutative differential calculus on the function space of the infinite set and construct a homotopy operator to prove the analogue of the Poincar(e) lemma for the difference complex. Then the horizontal and vertical complexes are introduced with the total differential map and vertical exterior derivative. As the application of the differential calculus, we derive the schemes with the conservation of symplecticity and energy for Hamiltonian system and a two-dimensional integral models with infinite sequence of conserved currents. Then an Euler Lagrange cohomology with symplectic structure-preserving is given in the discrete classical mechanics.
Geometry and Hamiltonian mechanics on discrete spaces
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
Current Density and Continuity in Discretized Models
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
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…
Ensemble simulations with discrete classical dynamics
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...
Discretization vs. Rounding Error in Euler's Method
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…
Discrete integrable system and its integrable coupling
LI Zhu
2009-01-01
This paper derives new discrete integrable system based on discrete isospectral problem. It shows that the hierarchy is completely integrable in the Liouville sense and possesses bi-Hamiltonian structure. Finally, integrable couplings of the obtained system is given by means of semi-direct sums of Lie algebras.
Type IIB orientifolds with discrete torsion
Karp, R L; Witten, Louis; Karp, Robert L; Witten, Louis
2001-01-01
We consider compact four-dimensional ${\\bf Z_N}\\times {\\bf Z_M}$ type IIB orientifolds, for certain values of $N$ and $M$. We allow the additional feature of discrete torsion and discuss the modification of the consistency conditions arising from tadpole cancellation. We point out the differences between the cases with and without discrete torsion.
Quantum dynamical entropies in discrete classical chaos
Benatti, Fabio [Dipartimento di Fisica Teorica, Universita di Trieste, Strada Costiera 11, 34014 Trieste (Italy); Cappellini, Valerio [Dipartimento di Fisica Teorica, Universita di Trieste, Strada Costiera 11, 34014 Trieste (Italy); Zertuche, Federico [Instituto de Matematicas, UNAM, Unidad Cuernavaca, AP 273-3, Admon. 3, 62251 Cuernavaca, Morelos (Mexico)
2004-01-09
We discuss certain analogies between quantization and discretization of classical systems on manifolds. In particular, we will apply the quantum dynamical entropy of Alicki and Fannes to numerically study the footprints of chaos in discretized versions of hyperbolic maps on the torus.
Discrete Riccati equation solutions: Distributed algorithms
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.
Crum's Theorem for `Discrete' Quantum Mechanics
Odake, Satoru; Sasaki, Ryu
2009-01-01
In one-dimensional quantum mechanics, or the Sturm-Liouville theory, Crum's theorem describes the relationship between the original and the associated Hamiltonian systems, which are iso-spectral except for the lowest energy state. Its counterpart in `discrete' quantum mechanics is formulated algebraically, elucidating the basic structure of the discrete quantum mechanics, whose Schr\\"odinger equation is a difference equation.
Nonlocality and discrete cellular methods in optics
Wijers, C.M.J.; Boeij, de P.L.
2001-01-01
A subdivision of space into discrete cells underlies the traditional discrete dipole model. This model presumes that only nonlocal electric interactions between cells govern the electromagnetic response of a condensed matter system. Apart from the case of simple dielectrics, this is not realistic. C
Geometry and Hamiltonian mechanics on discrete spaces
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 p
Geometry and Hamiltonian mechanics on discrete spaces
Talasila, V.; Clemente-Gallardo, J.; Schaft, van der A.J.
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 p
Interface discrete light bullets in waveguide arrays.
Mihalache, Dumitru; Mazilu, Dumitru; Lederer, Falk; Kivshar, Yuri S
2007-08-01
We analyze spatiotemporal light localization at the interface separating two different periodic photonic lattices. We demonstrate the existence of a novel class of continuous-discrete spatiotemporal solitons propagating along the interface, including hybrid staggered-unstaggered discrete light bullets with tails belonging to spectral gaps of different types.
Discrete/PWM Ballast-Resistor Controller
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.
Standing waves for discrete nonlinear Schrodinger equations
Ming Jia
2016-01-01
The discrete nonlinear Schrodinger equation is a nonlinear lattice system that appears in many areas of physics such as nonlinear optics, biomolecular chains and Bose-Einstein condensates. By using critical point theory, we establish some new sufficient conditions on the existence results of standing waves for the discrete nonlinear Schrodinger equations. We give an appropriate example to illustrate the conclusion obtained.
Conservative discretization of the Landau collision integral
Hirvijoki, Eero
2016-01-01
We describe a density, momentum, and energy conserving discretization of the nonlinear Landau collision integral. Our algorithm is suitable for both the finite-element and discontinuous Galerkin methods and does not require structured meshes. The conservation laws for the discretization are proven algebraically and demonstrated numerically for an axially symmetric nonlinear relaxation problem.
Neutrino mass, mixing and discrete symmetries
Smirnov, Alexei Y
2013-01-01
Status of the discrete symmetry approach to explanation of the lepton masses and mixing is summarized in view of recent experimental results, in particular, establishing relatively large 1-3 mixing. The lepton mixing can originate from breaking of discrete flavor symmetry $G_f$ to different residual symmetries $G_{\\ell}$ and $G_\
Quantum-like diffusion over discrete sets
Battaglia, Demian; Rasetti, Mario
2003-06-23
In the present Letter, a discrete differential calculus is introduced and used to describe dynamical systems over arbitrary graphs. The discretization of space and time allows the derivation of Heisenberg-like uncertainty inequalities and of a Schroedinger-like equation of motion, without need of any quantization procedure.
Continuous Attributes Discretization Algorithm based on FPGA
Guoqiang Sun
2013-07-01
Full Text Available The paper addresses the problem of Discretization of continuous attributes in rough set. Discretization of continuous attributes is an important part of rough set theory because most of data that we usually gain are continuous data. In order to improve processing speed of discretization, we propose a FPGA-based discretization algorithm of continuous attributes making use of the speed advantage of FPGA. Combined attributes dependency degree of rough ret, the discretization system was divided into eight modules according to block design. This method can save much time of pretreatment in rough set and improve operation efficiency. Extensive experiments on a certain fighter fault diagnosis validate the effectiveness of the algorithm.
Handbook on modelling for discrete optimization
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...
Quantum Mechanics on discrete space and time
Lorente, M
2004-01-01
We propose the assumption of quantum mechanics on a discrete space and time, which implies the modification of mathematical expressions for some postulates of quantum mechanics. In particular we have a Hilbert space where the vectors are complex functions of discrete variable. As a concrete example we develop a discrete analog of the one-dimensional quantum harmonic oscillator, using the dependence of the Wigner functions in terms of Kravchuk polynomials. In this model the position operator has a discrete spectrum given by one index of the Wigner functions, in the same way that the energy eigenvalues are given by the other matricial index. Similar picture can be made for other models where the differential equation and their solutions correspond to the continuous limit of some difference operator and orthogonal polynomial of discrete variable.
Generalized exponential function and discrete growth models
Souto Martinez, Alexandre; Silva González, Rodrigo; Lauri Espíndola, Aquino
2009-07-01
Here we show that a particular one-parameter generalization of the exponential function is suitable to unify most of the popular one-species discrete population dynamic models into a simple formula. A physical interpretation is given to this new introduced parameter in the context of the continuous Richards model, which remains valid for the discrete case. From the discretization of the continuous Richards’ model (generalization of the Gompertz and Verhulst models), one obtains a generalized logistic map and we briefly study its properties. Notice, however that the physical interpretation for the introduced parameter persists valid for the discrete case. Next, we generalize the (scramble competition) θ-Ricker discrete model and analytically calculate the fixed points as well as their stabilities. In contrast to previous generalizations, from the generalized θ-Ricker model one is able to retrieve either scramble or contest models.
Discrete multiscale wavelet shrinkage and integrodifferential equations
Didas, S.; Steidl, G.; Weickert, J.
2008-04-01
We investigate the relation between discrete wavelet shrinkage and integrodifferential equations in the context of simplification and denoising of one-dimensional signals. In the continuous setting, strong connections between these two approaches were discovered in 6 (see references). The key observation is that the wavelet transform can be understood as derivative operator after the convolution with a smoothing kernel. In this paper, we extend these ideas to the practically relevant discrete setting with both orthogonal and biorthogonal wavelets. In the discrete case, the behaviour of the smoothing kernels for different scales requires additional investigation. The results of discrete multiscale wavelet shrinkage and related discrete versions of integrodifferential equations are compared with respect to their denoising quality by numerical experiments.
Haeseler, Friedrich
2003-01-01
Automatic sequences are sequences which are produced by a finite automaton. Although they are not random they may look as being random. They are complicated, in the sense of not being not ultimately periodic, they may look rather complicated, in the sense that it may not be easy to name the rule by which the sequence is generated, however there exists a rule which generates the sequence. The concept automatic sequences has special applications in algebra, number theory, finite automata and formal languages, combinatorics on words. The text deals with different aspects of automatic sequences, in particular:· a general introduction to automatic sequences· the basic (combinatorial) properties of automatic sequences· the algebraic approach to automatic sequences· geometric objects related to automatic sequences.
Succinct Sampling from Discrete Distributions
Bringmann, Karl; Larsen, Kasper Green
2013-01-01
We revisit the classic problem of sampling from a discrete distribution: Given n non-negative w-bit integers x_1,...,x_n, the task is to build a data structure that allows sampling i with probability proportional to x_i. The classic solution is Walker's alias method that takes, when implemented...... on a Word RAM, O(n) preprocessing time, O(1) expected query time for one sample, and n(w+2 lg n+o(1)) bits of space. Using the terminology of succinct data structures, this solution has redundancy 2n lg n+o(n) bits, i.e., it uses 2n lg n+o(n) bits in addition to the information theoretic minimum required...... requirement of the classic solution for a fundamental sampling problem, on the other hand, they provide the strongest known separation between the systematic and non-systematic case for any data structure problem. Finally, we also believe our upper bounds are practically efficient and simpler than Walker...
Succinct Sampling from Discrete Distributions
Bringmann, Karl; Larsen, Kasper Green
2013-01-01
We revisit the classic problem of sampling from a discrete distribution: Given n non-negative w-bit integers x_1,...,x_n, the task is to build a data structure that allows sampling i with probability proportional to x_i. The classic solution is Walker's alias method that takes, when implemented...... on a Word RAM, O(n) preprocessing time, O(1) expected query time for one sample, and n(w+2 lg n+o(1)) bits of space. Using the terminology of succinct data structures, this solution has redundancy 2n lg n+o(n) bits, i.e., it uses 2n lg n+o(n) bits in addition to the information theoretic minimum required...... in redundancy by a factor of Omega(log n) over the alias method for r = n, even though the alias method is not systematic. Moreover, we complement our data structure with a lower bound showing that this trade-off is tight for systematic data structures. In the non-systematic case, in which the input numbers may...
XU Quan; TIAN Qiang
2007-01-01
@@ Compact-like discrete breathers in discrete one-dimensional monatomic chains are investigated by discussing a generalized discrete one-dimensional monatomic model. It is proven that compact-like discrete breathers exist not only in soft φ4 potential but also in hard φ4 potential and K4 chains. The measurements of compact-like discrete breathers' core in soft and hard φ4 potential are determined by coupling parameter K4, while the measurements of compact-like discrete breathers' core in K4 chains are not related to coupling parameter K4. The stabilities of compact-like discrete breathers correlate closely to coupling parameter K4 and the boundary condition of lattice.
Compatible Spatial Discretizations for Partial Differential Equations
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
Transitions between Discrete and Rhythmic Primitives in a Unimanual Task
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 (h,k-Dichotomy and Remarks on the Boundedness of the Projections
Mihai-Gabriel Babuţia
2014-01-01
Full Text Available The present paper treats a concept of (h,k-dichotomy for linear discrete systems. Sufficient conditions for the k-boundedness of the projection sequences that give the dichotomy are presented and an illustrative example shows the connection between the growth of the system and the bound of the sequence of projections. Thus the growth of the system that is assumed in the theorems is essential.
Higher dimensional discrete Cheeger inequalities
Anna Gundert
2015-01-01
Full Text Available For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of which states that $\\lambda(G \\leq h(G$, where $\\lambda(G$ is the second smallest eigenvalue of the Laplacian of a graph $G$ and $h(G$ is the Cheeger constant measuring the edge expansion of $G$. We are interested in generalizations of expansion properties to finite simplicial complexes of higher dimension (or uniform hypergraphs. Whereas higher dimensional Laplacians were introduced already in 1945 by Eckmann, the generalization of edge expansion to simplicial complexes is not straightforward. Recently, a topologically motivated notion analogous to edge expansion that is based on $\\mathbb{Z}_2$-cohomology was introduced by Gromov and independently by Linial, Meshulam and Wallach. It is known that for this generalization there is no direct higher dimensional analogue of the lower bound of the Cheeger inequality. A different, combinatorially motivated generalization of the Cheeger constant, denoted by $h(X$, was studied by Parzanchevski, Rosenthal and Tessler. They showed that indeed $\\lambda(X \\leq h(X$, where $\\lambda(X$ is the smallest non-trivial eigenvalue of the ($(k-1$-dimensional upper Laplacian, for the case of $k$-dimensional simplicial complexes $X$ with complete $(k-1$-skeleton. Whether this inequality also holds for $k$-dimensional complexes with non-com\\-plete$(k-1$-skeleton has been an open question.We give two proofs of the inequality for arbitrary complexes. The proofs differ strongly in the methods and structures employed,and each allows for a different kind of additional strengthening of the original result.
DISCRETE-TIME STOCHASTIC EQUILIBRIUM WITH INFINITE HORIZON INCOMPLETE ASSET MARKETS
ZhangShunming
2001-01-01
Abstract. This paper examines the existence of general equilibrium in a discrete time economywith the infinite horizon incomplete markets. There is a single good at each node in the eventtree. The existence of general equilibrium for the infinite horizon economy is proved by takinglimit of equilibria in truncated economies in which trade stops at a sequence of dates.
Reliability Assessment of Distribution System Based on Discrete-event System
丁屹峰; 程浩忠; 陈春霖; 江峰青; 房龄峰
2004-01-01
Discrete-event system simulation technology is used to analyze distribution system reliability in this paper. A simulation model, including entity state models, system state models, state transition models, reliability criterion model, is ciple of simulator clock to determine the sequence of random event occurrence dynamically. The results show this method is feasible.
Discretization behavior analysis of a switching control system from a unified mathematical approach
Xinghuo YU; Ling YANG; Guanrong CHEN
2003-01-01
A useful unified analysis framework is proposed for exploring the intriguing behaviors of a second-order switching control system. Complex discretization behaviors of the switching control system are explored in detail, and some intrinsic relationships between the system periodic behaviors and their associated symbolic sequences are studied.
Hoffmann, Tim
1999-01-01
The equivalence of the discrete isotropic Heisenberg magnet (IHM) model and the discrete nonlinear Schr\\"odinger equation (NLSE) given by Ablowitz and Ladik is shown. This is used to derive the equivalence of their discretization with the one by Izergin and Korepin. Moreover a doubly discrete IHM is presented that is equivalent to Ablowitz' and Ladiks doubly discrete NLSE.
Pan, Sung B.; Park, Rae-Hong
1997-12-01
A two-dimensional (2-D) very large scale integration (VLSI) architecture using a unified systolic array for fast computation of the discrete cosine transform (DCT), the discrete sine transform (DST), and the discrete Hartley transform (DHT) is proposed. The N-point discrete transform is decomposed into even- and odd-numbered frequency samples and they are computed independently at the same time. The proposed unified systolic array architecture can compute the DCT, the DST, and the DHT by defining different coefficient values specific for each transform. We also present another architecture for computation of the DHT, a modified version of the unified systolic array structure, which is faster than the unified architecture by a factor of 2. In addition, the proposed unified architecture can be employed for computation of the inverse DCT (IDCT), the inverse DST (IDST), and the inverse DHT (IDHT) with some modifications.
Approximability of the discrete Fréchet distance
Karl Bringmann
2015-12-01
Full Text Available The Fréchet distance is a popular and widespread distance measure for point sequences and for curves. About two years ago, Agarwal et al. [SIAM J. Comput. 2014] presented a new (mildly subquadratic algorithm for the discrete version of the problem. This spawned a flurry of activity that has led to several new algorithms and lower bounds.In this paper, we study the approximability of the discrete Fréchet distance. Building on a recent result by Bringmann [FOCS 2014], we present a new conditional lower bound showing that strongly subquadratic algorithms for the discrete Fréchet distance are unlikely to exist, even in the one-dimensional case and even if the solution may be approximated up to a factor of 1.399.This raises the question of how well we can approximate the Fréchet distance (of two given $d$-dimensional point sequences of length $n$ in strongly subquadratic time. Previously, no general results were known. We present the first such algorithm by analysing the approximation ratio of a simple, linear-time greedy algorithm to be $2^{\\Theta(n}$. Moreover, we design an $\\alpha$-approximation algorithm that runs in time $O(n\\log n + n^2/\\alpha$, for any $\\alpha\\in [1, n]$. Hence, an $n^\\varepsilon$-approximation of the Fréchet distance can be computed in strongly subquadratic time, for any $\\varepsilon > 0$.
Hairs of discrete symmetries and gravity
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.
Discrete continuous-phase superresolving filters.
Zhou, Sumei; Zhou, Changhe
2004-12-01
A new type of phase-only superresolving pupil filter with a discrete continuous-phase profile is presented that is a combination of discrete multilevel-phase modulation and continuous-phase modulation. This type of filter can achieve better superresolution performance than the continuous-phase filters reported in Opt. Lett. 28, 607 (2003). Therefore, with regard to the superresolution effect, this type of filter deserves study for practical applications. More importantly, the diffraction performance of this type of filter can explain the effect of a discrete-phase filter illuminated with a continuous wave front, whose superresolving performance cannot be analyzed with previous superresolution methods.
Discrete flavour symmetries from the Heisenberg group
Floratos, E. G.; Leontaris, G. K.
2016-04-01
Non-abelian discrete symmetries are of particular importance in model building. They are mainly invoked to explain the various fermion mass hierarchies and forbid dangerous superpotential terms. In string models they are usually associated to the geometry of the compactification manifold and more particularly to the magnetised branes in toroidal compactifications. Motivated by these facts, in this note we propose a unified framework to construct representations of finite discrete family groups based on the automorphisms of the discrete and finite Heisenberg group. We focus in particular, on the PSL2 (p) groups which contain the phenomenologically interesting cases.
Discrete Flavour Symmetries from the Heisenberg Group
Floratos, E G
2015-01-01
Non-abelian discrete symmetries are of particular importance in model building. They are mainly invoked to explain the various fermion mass hierarchies and forbid dangerous superpotential terms. In string models they are usually associated to the geometry of the compactification manifold and more particularly to the magnetised branes in toroidal compactifications. Motivated by these facts, in this note we propose a unified framework to construct representations of finite discrete family groups based on the automorphisms of the discrete and finite Heisenberg group. We focus in particular in the $PSL_2(p)$ groups which contain the phenomenologically interesting cases.
Hairs of discrete symmetries and gravity
Choi, Kang Sin; Kim, Jihn E.; Kyae, Bumseok; Nam, Soonkeon
2017-06-01
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.
On Discrete Differential Geometry in Twistor Space
2011-01-01
In this paper we introduce a discrete integrable system generalizing the discrete (real) cross-ratio system in $S^4$ to complex values of a generalized cross-ratio by considering $S^4$ as a real section of the complex Pl\\"ucker quadric, realized as the space of two-spheres in $S^4.$ We develop the geometry of the Pl\\"ucker quadric by examining the novel contact properties of two-spheres in $S^4,$ generalizing classical Lie geometry in $S^3.$ Discrete differential geometry aims to develop disc...
On Discreteness of the Hopf Equation
2008-01-01
The principle aim of this essay is to illustrate how different phenomena is captured by different discretizations of the Hopf equation and general hyperbolic conservation laws. This includes dispersive schemes, shock capturing schemes as well as schemes for computing multi-valued solutions of the underlying equation. We introduce some model equations which describe the behavior of the discrete equation more accurate than the original equation. These model equations can either be conveniently discretized for producing novel numerical schemes or further analyzed to enrich the theory of nonlinear partial differential equations.
Scheibye-Alsing, Karsten; Hoffmann, S.; Frankel, Annett Maria
2009-01-01
Despite the rapidly increasing number of sequenced and re-sequenced genomes, many issues regarding the computational assembly of large-scale sequencing data have remain unresolved. Computational assembly is crucial in large genome projects as well for the evolving high-throughput technologies...
Comparing the Discrete and Continuous Logistic Models
Gordon, Sheldon P.
2008-01-01
The solutions of the discrete logistic growth model based on a difference equation and the continuous logistic growth model based on a differential equation are compared and contrasted. The investigation is conducted using a dynamic interactive spreadsheet. (Contains 5 figures.)
Discrete-time nonlinear sliding mode controller
user
: Discrete-time delay system, Sliding mode control, nonlinear sliding ... The concept of the sliding mode control in recent years has drawn the ...... His area of interest is dc-dc converters, electrical vehicle and distributed generation application.
Radix Representation of Triangular Discrete Grid System
Ben, J.; Li, Y. L.; Wang, R.
2016-11-01
Discrete Global Grid Systems (DGGSs) are spatial references that use a hierarchical tessellation of cells to partition and address the entire globe. It provides an organizational structure that permits fast integration between multiple sources of large and variable geospatial data. Although many endeavors have been done to describe certain discrete grid systems, there still lack of a uniform mathematical framework for them. This paper simplifies the planar class I aperture 4 triangular discrete grid system into a hierarchical lattice model which is proved to be a radix system in the complex number plane. Mathematical properties of the radix system reveal the discrete grid system is equivalent to the set of complex numbers with special form. The conclusion provides a potential way to build a uniform mathematical framework of DGGS and can be used to design efficient encoding and spatial operation scheme for DGGS.
Memorized discrete systems and time-delay
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.
Local discrete symmetries from superstring derived models
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.
Breatherlike impurity modes in discrete nonlinear lattices
Hennig, D.; Rasmussen, Kim; Tsironis, G. P.
1995-01-01
We investigate the properties of a disordered generalized discrete nonlinear Schrodinger equation, containing both diagonal and nondiagonal nonlinear terms. The equation models a Linear host lattice doped with nonlinear impurities. We find different types of impurity states that form itinerant...
Running Parallel Discrete Event Simulators on Sierra
Barnes, P. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Jefferson, D. R. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-12-03
In this proposal we consider porting the ROSS/Charm++ simulator and the discrete event models that run under its control so that they run on the Sierra architecture and make efficient use of the Volta GPUs.
Comparing the Discrete and Continuous Logistic Models
Gordon, Sheldon P.
2008-01-01
The solutions of the discrete logistic growth model based on a difference equation and the continuous logistic growth model based on a differential equation are compared and contrasted. The investigation is conducted using a dynamic interactive spreadsheet. (Contains 5 figures.)
Local discrete symmetries from superstring derived models
Faraggi, Alon E.
1997-02-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 I illustrate 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.
Local discrete symmetries from superstring derived models
Faraggi, A E
1996-01-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 I illustrate 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.
POINTWISE AND UPWIND DISCRETIZATIONS OF SOURCE TERMS IN OPEN-CHANNEL FLOOD ROUTING
MENG Jian; CAO Zhi-xian; CARLING Paul A.
2006-01-01
Upwind algorithms are becoming progressively popular for river flood routing due to their capability of resolving trans-critical flow regimes. For consistency, these algorithms suggest natural upwind discretization of the source term, which may be essential for natural channels with irregular geometry. Yet applications of these upwind algorithms to natural river flows are rare, and in such applications the traditional and simpler pointwise, rather than upwind discretization of the source term is used. Within the framework of a first-order upwind algorithm, this paper presents a comparison of upwind and pointwise discretizations of the source term. Numerical simulations were carried out for a selected irregular channel comprising a pool-riffle sequence in the River Lune, England with observed data. It is shown that the impact of pointwise discretization, compared to the upwind, is appreciable mainly in flow zones with the Froude number closer to or larger than unity. The discrepancy due to pointwise and upwind discretizations of the source term is negligible in flow depth and hence in water surface elevation, but well manifested in mean velocity and derived flow quantities. Also the occurrence of flow reversal and equalisation over the pool-riffle sequence in response to increasing discharges is demonstrated.
Discrete Event Simulation: State of the Art
Eduard Babulak; Ming Wang
2010-01-01
Discrete event simulation technologies have been up and down as global manufacturing industries went through radical changes. The changes have created new problems, challenges and opportunities to the discrete event simulation. On manufacturing applications, it is no longer an isolated model but the distributed modeling and simulation along the supply-chain. In order to study the hybrid manufacturing systems, it is critical to have capability to model human performance with different level of...
Degrees of freedom in discrete geometry
Ariwahjoedi, Seramika; Rovelli, Carlo; Zen, Freddy P
2016-01-01
Following recent developments in discrete gravity, we study geometrical variables (angles and forms) of simplices in the discrete geometry point of view. Some of our relatively new results include: new ways of writing a set of simplices using vectorial (differential form) and coordinate-free pictures, and a consistent procedure to couple particles of space, together with a method to calculate the degrees of freedom of the system of 'quanta' of space in the classical framework.
Survey on Discrete Surface Ricci Flow
Min Zhang; Wei Zeng; Ren Guo; Feng Luo; Xianfeng David Gu
2015-01-01
Ricci flow deforms the Riemannian metric proportionally to the curvature, such that the curvature evolves according to a nonlinear heat diffusion process, and becomes constant eventually. Ricci flow is a powerful computational tool to design Riemannian metrics by prescribed curvatures. Surface Ricci flow has been generalized to the discrete setting. This work surveys the theory of discrete surface Ricci flow, its computational algorithms, and the applications for surface registration and shape analysis.
MESOSCOPIC ELECTRIC CIRCUITS WITH CHARGE DISCRETIZATION
2004-01-01
MESOSCOPIC ELECTRIC CIRCUITS WITH CHARGE DISCRETIZATION Nanoscience is a modern aspect of electronic engineering with significant projections for applications on new devices. This project allowed presenting an innovative language and a rigorous vision on aspects of nanoscience. The theory of quantum electrical circuits with discrete charge corresponds to the description (in simple terms) of some aspects of nanoscience. Our results gather aspects of quantum mechanics, electrical circuit...
Discrete Surface Modelling Using Partial Differential Equations.
Xu, Guoliang; Pan, Qing; Bajaj, Chandrajit L
2006-02-01
We use various nonlinear partial differential equations to efficiently solve several surface modelling problems, including surface blending, N-sided hole filling and free-form surface fitting. The nonlinear equations used include two second order flows, two fourth order flows and two sixth order flows. These nonlinear equations are discretized based on discrete differential geometry operators. The proposed approach is simple, efficient and gives very desirable results, for a range of surface models, possibly having sharp creases and corners.
Quantum Measurement, Complexity and Discrete Physics
Leckey, Martin
2003-01-01
This paper presents a new modified quantum mechanics, Critical Complexity Quantum Mechanics, which includes a new account of wavefunction collapse. This modified quantum mechanics is shown to arise naturally from a fully discrete physics, where all physical quantities are discrete rather than continuous. I compare this theory with the spontaneous collapse theories of Ghirardi, Rimini, Weber and Pearle and discuss some implications of the theory for a realist view of the quantum realm.
Center for Efficient Exascale Discretizations Software Suite
2017-08-30
The CEED Software suite is a collection of generally applicable software tools focusing on the following computational motives: PDE discretizations on unstructured meshes, high-order finite element and spectral element methods and unstructured adaptive mesh refinement. All of this software is being developed as part of CEED, a co-design Center for Efficient Exascale Discretizations, within DOE's Exascale Computing Project (ECP) program.
Standing waves for discrete nonlinear Schrodinger equations
Ming Jia
2016-07-01
Full Text Available The discrete nonlinear Schrodinger equation is a nonlinear lattice system that appears in many areas of physics such as nonlinear optics, biomolecular chains and Bose-Einstein condensates. By using critical point theory, we establish some new sufficient conditions on the existence results of standing waves for the discrete nonlinear Schrodinger equations. We give an appropriate example to illustrate the conclusion obtained.
Fast Generation of Discrete Random Variables
George Marsaglia
2004-07-01
Full Text Available We describe two methods and provide C programs for generating discrete random variables with functions that are simple and fast, averaging ten times as fast as published methods and more than five times as fast as the fastest of those. We provide general procedures for implementing the two methods, as well as specific procedures for three of the most important discrete distributions: Poisson, binomial and hypergeometric.
Polarization for arbitrary discrete memoryless channels
Sasoglu, Eren; Telatar, Emre; Arikan, Erdal
2009-01-01
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for the binary case leads to polarization. This method can be extended to channels of composite input alphabet sizes by decomposing such channels into a set of channels with prime input alphabet sizes. It is also shown that all discrete memoryless channels can...
Mohamed, Mamdouh S; Samtaney, Ravi
2015-01-01
A conservative discretization of incompressible Navier-Stokes equations on simplicial meshes is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the contraction 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 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 ord...
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 Calculus as a Bridge between Scales
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
Discrete differential geometry: the nonplanar quadrilateral mesh.
Twining, Carole J; Marsland, Stephen
2012-06-01
We consider the problem of constructing a discrete differential geometry defined on nonplanar quadrilateral meshes. Physical models on discrete nonflat spaces are of inherent interest, as well as being used in applications such as computation for electromagnetism, fluid mechanics, and image analysis. However, the majority of analysis has focused on triangulated meshes. We consider two approaches: discretizing the tensor calculus, and a discrete mesh version of differential forms. While these two approaches are equivalent in the continuum, we show that this is not true in the discrete case. Nevertheless, we show that it is possible to construct mesh versions of the Levi-Civita connection (and hence the tensorial covariant derivative and the associated covariant exterior derivative), the torsion, and the curvature. We show how discrete analogs of the usual vector integral theorems are constructed in such a way that the appropriate conservation laws hold exactly on the mesh, rather than only as approximations to the continuum limit. We demonstrate the success of our method by constructing a mesh version of classical electromagnetism and discuss how our formalism could be used to deal with other physical models, such as fluids.
Theoretical Basics of Teaching Discrete Mathematics
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.
Textbook of Semi-discrete Calculus
Shachar, Amir
2010-01-01
Ever since the early 1980's, computer scientists have been using an algorithm named "Summed Area Table", also known as "Integral Image". This algorithm was shown to provide a tremendous computational gain, since it fits precisely to the needs of discrete geometry researchers, due to its discrete nature. It was first introduced in 1984 by Crow, and was reintroduced to the computer vision community in 2001 by Viola and Jones. In 2007, Wang and his colleagues suggested a semi-discrete, semi-continuous formulation of an extension to this algorithm (discrete Green's theorem), and in this book it is suggested that a decisive parameter at the formulation of the theorem can be naturally defined via a simple pointwise operator. The main operator of this theory is defined by a mixture of the discrete and continuous, to form a semi discrete and efficient operator, given that one aims at classification of monotony. This approach to analyze the monotony of functions is hence suitable for computers (in order to save comput...
HEURISTIC DISCRETIZATION METHOD FOR BAYESIAN NETWORKS
Mariana D.C. Lima
2014-01-01
Full Text Available Bayesian Network (BN is a classification technique widely used in Artificial Intelligence. Its structure is a Direct Acyclic Graph (DAG used to model the association of categorical variables. However, in cases where the variables are numerical, a previous discretization is necessary. Discretization methods are usually based on a statistical approach using the data distribution, such as division by quartiles. In this article we present a discretization using a heuristic that identifies events called peak and valley. Genetic Algorithm was used to identify these events having the minimization of the error between the estimated average for BN and the actual value of the numeric variable output as the objective function. The BN has been modeled from a database of Bit’s Rate of Penetration of the Brazilian pre-salt layer with 5 numerical variables and one categorical variable, using the proposed discretization and the division of the data by the quartiles. The results show that the proposed heuristic discretization has higher accuracy than the quartiles discretization.
Compact-like discrete breather and its stability in a discrete monatomic Klein-Gordon chain
Xu Quan; Tian Qiang
2008-01-01
This paper studies a discrete one-dimensional monatomie Klein-Gordon chain with only quartic nearest-neighbour interactions, in which the compact-like discrete breathers can be explicitly constructed by an exact separation of their time and space dependence. Introducing the trying method, it proves that compact-like discrete breathers exist in this nonlinear system. It also discusses the linear stability of the compact-like discrete breathers, when the coefficient (β)of quartic on-site potential and the coupling constant (K4) of quartic interactive potential satisfy the given conditions,they are linearly stable.
Generalized locally Toeplitz sequences theory and applications
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 integrable systems and deformations of associative algebras
Konopelchenko, B G [Dipartimento di Fisica, Universita del Salento and INFN, Sezione di Lecce, 73100 Lecce (Italy)], E-mail: konopel@le.infn.it
2009-10-30
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.
Teresa Sibillano
2010-04-01
Full Text Available The plasma optical radiation emitted during CO2 laser welding of stainless steel samples has been detected with a Si-PIN photodiode and analyzed under different process conditions. The discrete wavelet transform (DWT has been used to decompose the optical signal into various discrete series of sequences over different frequency bands. The results show that changes of the process settings may yield different signal features in the range of frequencies between 200 Hz and 30 kHz. Potential applications of this method to monitor in real time the laser welding processes are also discussed.
Sibillano, Teresa; Ancona, Antonio; Rizzi, Domenico; Lupo, Valentina; Tricarico, Luigi; Lugarà, Pietro Mario
2010-01-01
The plasma optical radiation emitted during CO2 laser welding of stainless steel samples has been detected with a Si-PIN photodiode and analyzed under different process conditions. The discrete wavelet transform (DWT) has been used to decompose the optical signal into various discrete series of sequences over different frequency bands. The results show that changes of the process settings may yield different signal features in the range of frequencies between 200 Hz and 30 kHz. Potential applications of this method to monitor in real time the laser welding processes are also discussed. PMID:22319311
Sato, Shusei; Andersen, Stig Uggerhøj
2014-01-01
The current Lotus japonicus reference genome sequence is based on a hybrid assembly of Sanger TAC/BAC, Sanger shotgun and Illumina shotgun sequencing data generated from the Miyakojima-MG20 accession. It covers nearly all expressed L. japonicus genes and has been annotated mainly based on transcr......The current Lotus japonicus reference genome sequence is based on a hybrid assembly of Sanger TAC/BAC, Sanger shotgun and Illumina shotgun sequencing data generated from the Miyakojima-MG20 accession. It covers nearly all expressed L. japonicus genes and has been annotated mainly based...
Discrete Rogue waves in an array of waveguides
Efe, S
2015-01-01
We study discrete rogue waves in an array of nonlinear waveguides. We show that very small degree of disorder due to experimental imperfection has a deep effect on the formation of discrete rogue waves. We predict long-living discrete rogue wave solution of the discrete nonlinear Schrodinger equation.
Geometric formulations and variational integrators of discrete autonomous Birkhoff systems
Liu Shi-Xing; Liu Chang; Guo Yong-Xin
2011-01-01
The variational integrators of autonomous Birkhoff systems are obtained by the discrete variational principle. The geometric structure of the discrete autonomous Birkhoff system is formulated. The discretization of mathematical pendulum shows that the discrete variational method is as effective as symplectic scheme for the autonomous Birkhoff systems.
Positivity for Convective Semi-discretizations
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.
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 effort now underway to…
Exact discrete soliton solutions of quintic discrete nonlinear Schr(o)dinger equation
Li Hua-Mei; Wu Feng-Min
2005-01-01
By using the extended hyperbolic function approach, we have studied a quintic discrete nonlinear Schrodinger equation and obtained new exact localized solutions, including the discrete bright soliton solution, dark soliton solution,alternating phase bright soliton solution and alternating phase dark soliton solution, if a special constraint is imposed on the coefficients of the equation.
Noether symmetries of discrete mechanico-electrical systems
Fu Jing-Li; Chen Ben-Yong; Xie Feng-Ping
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.
Multi-site Compact-Like Discrete Breather in Discrete One-Dimensional Monatomic Chains
XU Quan; TIAN Qiang
2007-01-01
Multi-site compact-like discrete breathers in djscrete one-dimensional monatomic chains are irIvestigated by discussing a generalized discrete one-dimensional monatomic model.We obtain that the two-site compact-like discrete breathers with codes σ={0,…,0,1,1,0…,0}and codes σ={0,…,0,1,-1,0…,0}can exist in discrete one-dimensional monatomic chain with quartic on-site and inter-site potentials.However,the former can only exist in hard quartic on-site potential and cannot exist in soft quartic on-site potential,whereas the latter is just reversed.All of the two-site Compact-like discrete breathers with codes σ={0,…,0,1,1,0,…,0}and σ={0,…,0,1,-1,0…,0}cannot exist in a pure K4 chain.
DENG Shu-xian; DING Yu; GE Lei
2008-01-01
We usually describle a comparatively more complex control system, especially a multi-inputs and multioutputs system by time domation analytical procedure. While the system's controllability means whether the system is controllable according to certain requirements. It involves not only the system's outputs' controllability but also the controllability of the system's partial or total conditions. The movement is described by difference equation in the linear discrete-time system. Therefore, the problem of controllability of the linear discrete-time system has been converted into a problem of the controllability of discrete-time difference equation. The thesis makes out the determination method of the discrete-time system's controllability and puts forward the sufficient and necessary conditions to determine it's controllability by making a study on the controllability of the linear discrete-time equation.
Equivalent Hamiltonians with additional discrete states
Chinn, C.R. (Physics Department, Lawrence Livermore National Laboratory, Livermore, CA (USA)); Thaler, R.M. (Los Alamos National Laboratory, Los Alamos, NM (USA) Department of Physics, Case Western Reserve University, Cleveland, OH (USA))
1991-01-01
Given a particular Hamiltonian {ital H}, we present a method to generate a new Hamiltonian {ital {tilde H}}, which has the same discrete energy eigenvalues and the same continuum phase shifts as {ital H}, but which also has additional given discrete eigenstates. This method is used to generate a Hamiltonian {ital h}{sub 1}, which gives rise to a complete orthonormal set of basis states, which contain a given set of biorthonormal discrete states, the continuum states of which are asymptotic to plane waves (have zero phase shifts). Such a set of states may be helpful in representing the medium modification of the Green's function due to the Pauli principle, as well as including Pauli exclusion effects into scattering calculations.
Equivalent Hamiltonians with additional discrete states
Chinn, C. R.; Thaler, R. M.
1991-01-01
Given a particular Hamiltonian H, we present a method to generate a new Hamiltonian H~, which has the same discrete energy eigenvalues and the same continuum phase shifts as H, but which also has additional given discrete eigenstates. This method is used to generate a Hamiltonian h1, which gives rise to a complete orthonormal set of basis states, which contain a given set of biorthonormal discrete states, the continuum states of which are asymptotic to plane waves (have zero phase shifts). Such a set of states may be helpful in representing the medium modification of the Green's function due to the Pauli principle, as well as including Pauli exclusion effects into scattering calculations.
An algebra of discrete event processes
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.
Discrete Time Crystals: Rigidity, Criticality, and Realizations
Yao, N. Y.; Potter, A. C.; Potirniche, I.-D.; Vishwanath, A.
2017-01-01
Despite being forbidden in equilibrium, spontaneous breaking of time translation symmetry can occur in periodically driven, Floquet systems with discrete time-translation symmetry. The period of the resulting discrete time crystal is quantized to an integer multiple of the drive period, arising from a combination of collective synchronization and many body localization. Here, we consider a simple model for a one-dimensional discrete time crystal which explicitly reveals the rigidity of the emergent oscillations as the drive is varied. We numerically map out its phase diagram and compute the properties of the dynamical phase transition where the time crystal melts into a trivial Floquet insulator. Moreover, we demonstrate that the model can be realized with current experimental technologies and propose a blueprint based upon a one dimensional chain of trapped ions. Using experimental parameters (featuring long-range interactions), we identify the phase boundaries of the ion-time-crystal and propose a measurable signature of the symmetry breaking phase transition.
Fast Mojette Transform for Discrete Tomography
Chandra, Shekhar S; Kingston, Andrew; Guédon, Jeanpierre; Svalbe, Imants
2010-01-01
A new algorithm for reconstructing a two dimensional object from a set of one dimensional projected views is presented that is both computationally exact and experimentally practical. The algorithm has a computational complexity of O(n log2 n) with n = N^2 for an NxN image, is robust in the presence of noise and produces no artefacts in the reconstruction process, as is the case with conventional tomographic methods. The reconstruction process is approximation free because the object is assumed to be discrete and utilizes fully discrete Radon transforms. Noise in the projection data can be suppressed further by introducing redundancy in the reconstruction. The number of projections required for exact reconstruction and the response to noise can be controlled without comprising the digital nature of the algorithm. The digital projections are those of the Mojette Transform, a form of discrete linogram. A simple analytical mapping is developed that compacts these projections exactly into symmetric periodic slice...
Formalising the Continuous/Discrete Modeling Step
Wen Su
2011-06-01
Full Text Available Formally capturing the transition from a continuous model to a discrete model is investigated using model based refinement techniques. A very simple model for stopping (eg. of a train is developed in both the continuous and discrete domains. The difference between the two is quantified using generic results from ODE theory, and these estimates can be compared with the exact solutions. Such results do not fit well into a conventional model based refinement framework; however they can be accommodated into a model based retrenchment. The retrenchment is described, and the way it can interface to refinement development on both the continuous and discrete sides is outlined. The approach is compared to what can be achieved using hybrid systems techniques.
Formalising the Continuous/Discrete Modeling Step
Banach, Richard; Su, Wen; Huang, Runlei; 10.4204/EPTCS.55.8
2011-01-01
Formally capturing the transition from a continuous model to a discrete model is investigated using model based refinement techniques. A very simple model for stopping (eg. of a train) is developed in both the continuous and discrete domains. The difference between the two is quantified using generic results from ODE theory, and these estimates can be compared with the exact solutions. Such results do not fit well into a conventional model based refinement framework; however they can be accommodated into a model based retrenchment. The retrenchment is described, and the way it can interface to refinement development on both the continuous and discrete sides is outlined. The approach is compared to what can be achieved using hybrid systems techniques.
Discrete Time Crystals: Rigidity, Criticality, and Realizations.
Yao, N Y; Potter, A C; Potirniche, I-D; Vishwanath, A
2017-01-20
Despite being forbidden in equilibrium, spontaneous breaking of time translation symmetry can occur in periodically driven, Floquet systems with discrete time-translation symmetry. The period of the resulting discrete time crystal is quantized to an integer multiple of the drive period, arising from a combination of collective synchronization and many body localization. Here, we consider a simple model for a one-dimensional discrete time crystal which explicitly reveals the rigidity of the emergent oscillations as the drive is varied. We numerically map out its phase diagram and compute the properties of the dynamical phase transition where the time crystal melts into a trivial Floquet insulator. Moreover, we demonstrate that the model can be realized with current experimental technologies and propose a blueprint based upon a one dimensional chain of trapped ions. Using experimental parameters (featuring long-range interactions), we identify the phase boundaries of the ion-time-crystal and propose a measurable signature of the symmetry breaking phase transition.
Is Fitts' law continuous in discrete aiming?
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.
Gabor systems on discrete periodic sets
2009-01-01
Due to its good potential for digital signal processing, discrete Gabor analysis has interested some mathematicians. This paper addresses Gabor systems on discrete periodic sets, which can model signals to appear periodically but intermittently. Complete Gabor systems and Gabor frames on discrete periodic sets are characterized; a sufficient and necessary condition on what periodic sets admit complete Gabor systems is obtained; this condition is also proved to be sufficient and necessary for the existence of sets E such that the Gabor systems generated by χE are tight frames on these periodic sets; our proof is constructive, and all tight frames of the above form with a special frame bound can be obtained by our method; periodic sets admitting Gabor Riesz bases are characterized; some examples are also provided to illustrate the general theory.
The ultimatum game: Discrete vs. continuous offers
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.
Permutation Symmetry Determines the Discrete Wigner Function
Zhu, Huangjun
2016-01-01
The Wigner function provides a useful quasiprobability representation of quantum mechanics, with applications in various branches of physics. Many nice properties of the Wigner function are intimately connected with the high symmetry of the underlying operator basis composed of phase point operators: any pair of phase point operators can be transformed to any other pair by a unitary symmetry transformation. We prove that, in the discrete scenario, this permutation symmetry is equivalent to the symmetry group being a unitary 2 design. Such a highly symmetric representation can only appear in odd prime power dimensions besides dimensions 2 and 8. It suffices to single out a unique discrete Wigner function among all possible quasiprobability representations. In the course of our study, we show that this discrete Wigner function is uniquely determined by Clifford covariance, while no Wigner function is Clifford covariant in any even prime power dimension.
Discrete breathers in hexagonal dusty plasma lattices.
Koukouloyannis, V; Kourakis, I
2009-08-01
The occurrence of single-site or multisite localized vibrational modes, also called discrete breathers, in two-dimensional hexagonal dusty plasma lattices is investigated. The system is described by a Klein-Gordon hexagonal lattice characterized by a negative coupling parameter epsilon in account of its inverse dispersive behavior. A theoretical analysis is performed in order to establish the possibility of existence of single as well as three-site discrete breathers in such systems. The study is complemented by a numerical investigation based on experimentally provided potential forms. This investigation shows that a dusty plasma lattice can support single-site discrete breathers, while three-site in phase breathers could exist if specific conditions, about the intergrain interaction strength, would hold. On the other hand, out of phase and vortex three-site breathers cannot be supported since they are highly unstable.
Natural discretization in noncommutative field theory
Acatrinei, Ciprian Sorin, E-mail: acatrine@theory.nipne.ro [Department of Theoretical Physics, Horia Hulubei National Institute for Nuclear Physics, Bucharest (Romania)
2015-12-07
A discretization scheme for field theory is developed, in which the space time coordinates are assumed to be operators forming a noncommutative algebra. Generic waves without rotational symmetry are studied in (2+1) - dimensional scalar field theory with Heisenberg-type noncommutativity. In the representation chosen, the radial coordinate is naturally rendered discrete. Nonlocality along this coordinate, induced by noncommutativity, accounts for the angular dependence of the fields. A complete solution and the interpretation of its nonlocal features are given. The exact form of standing and propagating waves on such a discrete space is found in terms of finite series. A precise correspondence is established between the degree of nonlocality and the angular momentum of a field configuration. At small distance no classical singularities appear, even at the location of the sources. At large radius one recovers the usual commutative/continuum behaviour.
Natural discretization in noncommutative field theory
Acatrinei, Ciprian Sorin
2015-12-01
A discretization scheme for field theory is developed, in which the space time coordinates are assumed to be operators forming a noncommutative algebra. Generic waves without rotational symmetry are studied in (2+1) - dimensional scalar field theory with Heisenberg-type noncommutativity. In the representation chosen, the radial coordinate is naturally rendered discrete. Nonlocality along this coordinate, induced by noncommutativity, accounts for the angular dependence of the fields. A complete solution and the interpretation of its nonlocal features are given. The exact form of standing and propagating waves on such a discrete space is found in terms of finite series. A precise correspondence is established between the degree of nonlocality and the angular momentum of a field configuration. At small distance no classical singularities appear, even at the location of the sources. At large radius one recovers the usual commutative/continuum behaviour.
Numerical discretization for nonlinear diffusion filter
Mustaffa, I.; Mizuar, I.; Aminuddin, M. M. M.; Dasril, Y.
2015-05-01
Nonlinear diffusion filters are famously used in machine vision for image denoising and restoration. This paper presents a study on the effects of different numerical discretization of nonlinear diffusion filter. Several numerical discretization schemes are presented; namely semi-implicit, AOS, and fully implicit schemes. The results of these schemes are compared by visual results, objective measurement e.g. PSNR and MSE. The results are also compared to a Daubechies wavelet denoising method. It is acknowledged that the two preceding scheme have already been discussed in literature, however comparison to the latter scheme has not been made. The semi-implicit scheme uses an additive operator splitting (AOS) developed to overcome the shortcoming of the explicit scheme i.e., stability for very small time steps. Although AOS has proven to be efficient, from the nonlinear diffusion filter results with different discretization schemes, examples shows that implicit schemes are worth pursuing.
Discrete time queues with phase dependent arrivals
Daigle, J. N.; Lee, Y.; Magalhaes, M. N.
1994-02-01
The queueing behavior of many communication systems is well modeled by a queueing system in which time is slotted, and the number of entities that arrive during a slot is dependent upon the state of a discrete time, discrete state Markov chain. Techniques for analyzing such systems have appeared in the literature from time to time, but distributions have been presented in only rare instances. In this paper, we present the probability generating function (PGF) for joint and marginal buffer occupancy distributions of statistical time division multiplexing systems in this class. We discuss inversion of the PGF using discrete Fourier transforms, and also discuss a simple technique for obtaining moments of the queue length distribution. Numerical results, including queue length distributions for some special cases, are presented.
Gabor systems on discrete periodic sets
LI YunZhang; LIAN QiaoFang
2009-01-01
Due to its good potential for digital signal processing,discrete Gabor analysis has inter ested some mathematicians.This paper addresses Gabor systems on discrete periodic sets,which can model signals to appear periodically but intermittently.Complete Gabor systems and Gabor frames on discrete periodic sets are characterized; a sufficient and necessary condition on what periodic sets admit complete Gabor systems is obtained; this condition is also proved to be sufficient and necessary for the existence of sets E such that the Gabor systems generated by XE are tight frames on these periodic sets; our proof is constructive,and all tight frames of the above form with a special frame bound can be obtained by our method; periodic sets admitting Gabor Riesz bases are characterized;some examples are also provided to illustrate the general theory.
Modeling discrete time-to-event data
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...
Computing the Discrete Compactness of Orthogonal Pseudo-Polytopes via Their D-EVM Representation
Ricardo Pérez-Aguila
2010-01-01
Full Text Available This work is devoted to present a methodology for the computation of Discrete Compactness in -dimensional orthogonal pseudo-polytopes. The proposed procedures take in account compactness' definitions originally presented for the 2D and 3D cases and extend them directly for considering the D case. There are introduced efficient algorithms for computing discrete compactness which are based on an orthogonal polytopes representation scheme known as the Extreme Vertices Model in the -Dimensional Space (D-EVM. It will be shown the potential of the application of Discrete Compactness in higher-dimensional contexts by applying it, through EVM-based algorithms, in the classification of video sequences, associated to the monitoring of a volcano's activity, which are expressed as 4D orthogonal polytopes in the space-color-time geometry.
Lie symmetries and conserved quantities of discrete nonholonomic Hamiltonian systems
Wang Xing-Zhong; Fu Hao; Fu Jing-Li
2012-01-01
This paper focuses on studying Lie symmetries and conserved quantities of discrete nonholonomic Hamiltonian systems.Firstly,the discrete generalized Hamiltonian canonical equations and discrete energy equation of nonholonomic Hamiltonian systems are derived from discrete Hamiltonian action.Secondly,the determining equations and structure equation of Lie symmetry of the system are obtained.Thirdly,the Lie theorems and the conservation quantities are given for the discrete nonholonomic Hamiltonian systems.Finally,an example is discussed to illustrate the application of the results.
Digital Watermarks Using Discrete Wavelet Transformation and Spectrum Spreading
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.
Digital Watermarks Using Discrete Wavelet Transformation and Spectrum Spreading
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.
The discrete regime of flame propagation
Tang, Francois-David; Goroshin, Samuel; Higgins, Andrew
The propagation of laminar dust flames in iron dust clouds was studied in a low-gravity envi-ronment on-board a parabolic flight aircraft. The elimination of buoyancy-induced convection and particle settling permitted measurements of fundamental combustion parameters such as the burning velocity and the flame quenching distance over a wide range of particle sizes and in different gaseous mixtures. The discrete regime of flame propagation was observed by substitut-ing nitrogen present in air with xenon, an inert gas with a significantly lower heat conductivity. Flame propagation in the discrete regime is controlled by the heat transfer between neighbor-ing particles, rather than by the particle burning rate used by traditional continuum models of heterogeneous flames. The propagation mechanism of discrete flames depends on the spa-tial distribution of particles, and thus such flames are strongly influenced by local fluctuations in the fuel concentration. Constant pressure laminar dust flames were observed inside 70 cm long, 5 cm diameter Pyrex tubes. Equally-spaced plate assemblies forming rectangular chan-nels were placed inside each tube to determine the quenching distance defined as the minimum channel width through which a flame can successfully propagate. High-speed video cameras were used to measure the flame speed and a fiber optic spectrometer was used to measure the flame temperature. Experimental results were compared with predictions obtained from a numerical model of a three-dimensional flame developed to capture both the discrete nature and the random distribution of particles in the flame. Though good qualitative agreement was obtained between model predictions and experimental observations, residual g-jitters and the short reduced-gravity periods prevented further investigations of propagation limits in the dis-crete regime. The full exploration of the discrete flame phenomenon would require high-quality, long duration reduced gravity environment
Discrete quantum geometries and their effective dimension
Thuerigen, Johannes
2015-07-02
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.
Logic and discrete mathematics a concise introduction
Conradie, Willem
2015-01-01
A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy
Continuous-Discrete Path Integral Filtering
Bhashyam Balaji
2009-08-01
Full Text Available A summary of the relationship between the Langevin equation, Fokker-Planck-Kolmogorov forward equation (FPKfe and the Feynman path integral descriptions of stochastic processes relevant for the solution of the continuous-discrete filtering problem is provided in this paper. The practical utility of the path integral formula is demonstrated via some nontrivial examples. Specifically, it is shown that the simplest approximation of the path integral formula for the fundamental solution of the FPKfe can be applied to solve nonlinear continuous-discrete filtering problems quite accurately. The Dirac-Feynman path integral filtering algorithm is quite simple, and is suitable for real-time implementation.
Digital and discrete geometry theory and algorithms
Chen, Li
2014-01-01
This book provides comprehensive coverage of the modern methods for geometric problems in the computing sciences. It also covers concurrent topics in data sciences including geometric processing, manifold learning, Google search, cloud data, and R-tree for wireless networks and BigData.The author investigates digital geometry and its related constructive methods in discrete geometry, offering detailed methods and algorithms. The book is divided into five sections: basic geometry; digital curves, surfaces and manifolds; discretely represented objects; geometric computation and processing; and a
Hybrid Discrete-Continuous Markov Decision Processes
Feng, Zhengzhu; Dearden, Richard; Meuleau, Nicholas; Washington, Rich
2003-01-01
This paper proposes a Markov decision process (MDP) model that features both discrete and continuous state variables. We extend previous work by Boyan and Littman on the mono-dimensional time-dependent MDP to multiple dimensions. We present the principle of lazy discretization, and piecewise constant and linear approximations of the model. Having to deal with several continuous dimensions raises several new problems that require new solutions. In the (piecewise) linear case, we use techniques from partially- observable MDPs (POMDPS) to represent value functions as sets of linear functions attached to different partitions of the state space.
Volume Effects in Discrete beta functions
Liu, Yuzhi; Zou, Haiyuan
2011-01-01
We calculate discrete beta functions corresponding to the two-lattice matching for the 2D O(N) models and Dyson's hierarchical model. We describe and explain finite-size effects such as the appearance of a nontrivial infrared fixed point that goes to infinity at infinite volume or the merging of an infrared and an ultraviolet fixed point. We present extensions of the RG flows to the complex coupling plane. We discuss the possibility of constructing a continuous beta function from the discrete one by using functional conjugation methods. We briefly discuss the relevance of these findings for the search of nontrivial fixed points in multiflavor lattice gauge theory models.
Optical Planar Discrete Fourier and Wavelet Transforms
Cincotti, Gabriella; Moreolo, Michela Svaluto; Neri, Alessandro
2007-10-01
We present all-optical architectures to perform discrete wavelet transform (DWT), wavelet packet (WP) decomposition and discrete Fourier transform (DFT) using planar lightwave circuits (PLC) technology. Any compact-support wavelet filter can be implemented as an optical planar two-port lattice-form device, and different subband filtering schemes are possible to denoise, or multiplex optical signals. We consider both parallel and serial input cases. We design a multiport decoder/decoder that is able to generate/process optical codes simultaneously and a flexible logarithmic wavelength multiplexer, with flat top profile and reduced crosstalk.
Modeling and simulation of discrete event systems
Choi, Byoung Kyu
2013-01-01
Computer modeling and simulation (M&S) allows engineers to study and analyze complex systems. Discrete-event system (DES)-M&S is used in modern management, industrial engineering, computer science, and the military. As computer speeds and memory capacity increase, so DES-M&S tools become more powerful and more widely used in solving real-life problems. Based on over 20 years of evolution within a classroom environment, as well as on decades-long experience in developing simulation-based solutions for high-tech industries, Modeling and Simulation of Discrete-Event Systems is the only book on
Discrete, Continuous, and Hybrid Petri Nets
David, Rene
2010-01-01
Petri Nets were introduced and still successfully used to analyze and model discrete event systems especially in engineering and computer sciences such as in automatic control. Recently this discrete Petri Nets formalism was successfully extended to continuous and hybrid systems. This monograph presents a well written and clearly organized introduction in the standard methods of Petri Nets with the aim to reach an accurate understanding of continuous and hybrid Petri Nets, while preserving the consistency of basic concepts throughout the book. The book is a monograph as well as a didactic tool
Discrete fractional Radon transforms and quadratic forms
Pierce, Lillian B
2010-01-01
We consider discrete analogues of fractional Radon transforms involving integration over paraboloids defined by positive definite quadratic forms. We prove sharp results for this class of discrete operators in all dimensions, providing necessary and sufficient conditions for them to extend to bounded operators from $\\ell^p$ to $\\ell^q$. The method involves an intricate spectral decomposition according to major and minor arcs, motivated by ideas from the circle method of Hardy and Littlewood. Techniques from harmonic analysis, in particular Fourier transform methods and oscillatory integrals, as well as the number theoretic structure of quadratic forms, exponential sums, and theta functions, play key roles in the proof.
1-D EQUILIBRIUM DISCRETE DIFFUSION MONTE CARLO
T. EVANS; ET AL
2000-08-01
We present a new hybrid Monte Carlo method for 1-D equilibrium diffusion problems in which the radiation field coexists with matter in local thermodynamic equilibrium. This method, the Equilibrium Discrete Diffusion Monte Carlo (EqDDMC) method, combines Monte Carlo particles with spatially discrete diffusion solutions. We verify the EqDDMC method with computational results from three slab problems. The EqDDMC method represents an incremental step toward applying this hybrid methodology to non-equilibrium diffusion, where it could be simultaneously coupled to Monte Carlo transport.
Discrete dispersion models and their Tweedie asymptotics
Jørgensen, Bent; Kokonendji, Célestin C.
2016-01-01
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...
Elementary Particles and the Causet Approach to Discrete Quantum Gravity
Gudder, Stan
2014-01-01
In a previous paper, the author introduced a covariant causet ($c$-causet) approach to discrete quantum gravity. A $c$-causet is a finite partially ordered set that is invariant under labeling. The invariant labeling of a $c$-causet $x$ enables us to uniquely specify $x$ by a sequence $\\brac{s_j(x)}$, $j=0,1,2,\\ldots$, of positive integers called a shell sequence of $x$. A $c$-causet $x$ describes the microscopic structure of a possible universe at a particular time step. In general, $x$ represents one of many universes in a multiverse and $x$ grows by a single element at each time step. Since early stages of a universe were probably composed of elementary particles, we propose that elementary particles can be described by simple $c$-causets. Although we do not have a rigorous theory for such a description, we present our guess as to how it might appear. The shell sequence can be applied to find theoretical masses of particles and these seem to approximately agree with known masses. We point out that the caus...
Haydock's recursive solution of self-adjoint problems. Discrete spectrum
Moroz, Alexander
2014-12-01
Haydock's recursive solution is shown to underline a number of different concepts such as (i) quasi-exactly solvable models, (ii) exactly solvable models, (iii) three-term recurrence solutions based on Schweber's quantization criterion in Hilbert spaces of entire analytic functions, and (iv) a discrete quantum mechanics of Odake and Sasaki. A recurrent theme of Haydock's recursive solution is that the spectral properties of any self-adjoint problem can be mapped onto a corresponding sequence of polynomials {pn(E) } in energy variable E. The polynomials {pn(E) } are orthonormal with respect to the density of states n0(E) and energy eigenstate | E > is the generating function of {pn(E) } . The generality of Haydock's recursive solution enables one to see the different concepts from a unified perspective and mutually benefiting from each other. Some results obtained within the particular framework of any of (i) to (iv) may have much broader significance.
Price clustering and discreteness: is there chaos behind the noise?
Antoniou, Antonios; Vorlow, Constantinos E.
2005-03-01
We investigate the “compass rose” patterns introduced by Crack and Ledoit (J. Finance 51(2)(1996) 751) as revealed in phase portraits (delay plots) of stock returns. The structures observed in these diagrams have been attributed mainly to price clustering and discreteness and the tick size. Using wavelet-based denoising, we examine the noise-free versions of a set of FTSE100 stock returns time series. We reveal evidence of non-periodic cyclical dynamics. As a second stage we apply surrogate data analysis on the original and denoised stock returns. Our results suggest that there is a strong nonlinear and possibly deterministic signature in the data generating processes of the stock returns sequences.
The dynamics of binary alternatives for a discrete pregeometry
Krugly, Alexey L
2012-01-01
A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the graph are added one by one. The probability of each step depends on the structure of existed graph. The particular case of dynamics is based on binary alternatives. Each directed path is considered as a sequence of outcomes of binary alternatives. The probabilities of a stochastic sequential growth are functions of these paths. The goal is to describe physical objects as some self-organized structures of the graph. A problem to find self-organized structures is discussed.
Safety Discrete Event Models for Holonic Cyclic Manufacturing Systems
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.
Radix-3 Algorithm for Realization of Discrete Fourier Transform
M.Narayan Murty
2016-07-01
Full Text Available In this paper, a new radix-3 algorithm for realization of discrete Fourier transform (DFT of length N = 3m (m = 1, 2, 3,... is presented. The DFT of length N can be realized from three DFT sequences, each of length N/3. If the input signal has length N, direct calculation of DFT requires O (N 2 complex multiplications (4N 2 real multiplications and some additions. This radix-3 algorithm reduces the number of multiplications required for realizing DFT. For example, the number of complex multiplications required for realizing 9-point DFT using the proposed radix-3 algorithm is 60. Thus, saving in time can be achieved in the realization of proposed algorithm.
Tabor, Stanley; Richardson, Charles C.
1995-04-25
A method for sequencing a strand of DNA, including the steps off: providing the strand of DNA; annealing the strand with a primer able to hybridize to the strand to give an annealed mixture; incubating the mixture with four deoxyribonucleoside triphosphates, a DNA polymerase, and at least three deoxyribonucleoside triphosphates in different amounts, under conditions in favoring primer extension to form nucleic acid fragments complementory to the DNA to be sequenced; labelling the nucleic and fragments; separating them and determining the position of the deoxyribonucleoside triphosphates by differences in the intensity of the labels, thereby to determine the DNA sequence.
Discrete variable representation for singular Hamiltonians
Schneider, B. I.; Nygaard, Nicolai
2004-01-01
We discuss the application of the discrete variable representation (DVR) to Schrodinger problems which involve singular Hamiltonians. Unlike recent authors who invoke transformations to rid the eigenvalue equation of singularities at the cost of added complexity, we show that an approach based...
A Discrete Dynamical Model of Signed Partitions
G. Chiaselotti
2013-01-01
Full Text Available We use a discrete dynamical model with three evolution rules in order to analyze the structure of a partially ordered set of signed integer partitions whose main properties are actually not known. This model is related to the study of some extremal combinatorial sum problems.
Electroless plating apparatus for discrete microsized particles
Mayer, Anton
1978-01-01
Method and apparatus are disclosed for producing very uniform coatings of a desired material on discrete microsized particles by electroless techniques. Agglomeration or bridging of the particles during the deposition process is prevented by imparting a sufficiently random motion to the particles that they are not in contact with each other for a time sufficient for such to occur.
Cuspidal discrete series for projective hyperbolic spaces
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 a...
Discrete-signal analysis and design
Sabin, William E
2008-01-01
William E. Sabin, MSEE, Life Member IEEE, has worked at a professional engineering level in the electronics industry for forty years in almost all areas of signal processing, including analog, discrete, and digital. He has coedited three books on the subject of radio systems and circuits and is the author of about forty technical articles in electronics journals.
Discrete element modeling of subglacial sediment deformation
Damsgaard, Anders; Egholm, David L.; Piotrowski, Jan A.
2013-01-01
The Discrete Element Method (DEM) is used in this study to explore the highly nonlinear dynamics of a granular bed when exposed to stress conditions comparable to those at the bed of warm-based glaciers. Complementary to analog experiments, the numerical approach allows a detailed analysis of the...
Stable discrete representation of relativistically drifting plasmas
Kirchen, Manuel; Godfrey, Brendan B; Dornmair, Irene; Jalas, Soeren; Peters, Kevin; Vay, Jean-Luc; Maier, Andreas R
2016-01-01
Representing the electrodynamics of relativistically drifting particle ensembles in discrete, co-propagating Galilean coordinates enables the derivation of a Particle-in-Cell algorithm that is intrinsically free of the Numerical Cherenkov Instability, for plasmas flowing at a uniform velocity. Application of the method is shown by modeling plasma accelerators in a Lorentz-transformed optimal frame of reference.
The Discrete Site Sticky Wall Model.
1986-05-27
TECHNICAL REPORT #23 THE DISCRETE SITE STICKY WALL tMDEL by J.P. Badiali Laboratoire Propre No 15 de CNRS Physique des Liquides et Electrochimie Tour 22, 5e...Liquides et Electrochimie NTIS CRA&I DTIC TAB 5 Tour 22, 5e Etage, 4 Place Jussieu U’annou;.ced . J ’ tificatlo rn
A Note on Discrete Mathematics and Calculus.
O'Reilly, Thomas J.
1987-01-01
Much of the current literature on the topic of discrete mathematics and calculus during the first two years of an undergraduate mathematics curriculum is cited. A relationship between the recursive integration formulas and recursively defined polynomials is described. A Pascal program is included. (Author/RH)
Teaching Discrete Mathematics with Graphing Calculators.
Masat, Francis E.
Graphing calculator use is often thought of in terms of pre-calculus or continuous topics in mathematics. This paper contains examples and activities that demonstrate useful, interesting, and easy ways to use a graphing calculator with discrete topics. Examples are given for each of the following topics: functions, mathematical induction and…
Fair value accounting and managerial discretion
Byrne, A.; Clacher, I.; Hillier, D.; Hodgson, A.
2008-01-01
We analyse the extent to which managers exercise discretion under fair value accounting and the value relevance of these disclosures. Utilising a sample of firms that apply the UK fair value pension accounting standard, (FRS-17), we examine the main determinants of the assumptions managers use to ar
A Cyclic Representation of Discrete Coordination Procedures
Agaev, Rafig
2011-01-01
We show that any discrete opinion pooling procedure with positive weights can be asymptotically approximated by DeGroot's procedure whose communication digraph is a Hamiltonian cycle with loops. In this cycle, the weight of each arc (which is not a loop) is inversely proportional to the influence of the agent the arc leads to.
Conjugacy classes in discrete Heisenberg groups
Budylin, R Ya [Steklov Mathematical Institute of Russian Academy of Sciences (Russian Federation)
2014-08-01
We study an extension of a discrete Heisenberg group coming from the theory of loop groups and find invariants of conjugacy classes in this group. In some cases, including the case of the integer Heisenberg group, we make these invariants more explicit. Bibliography: 4 titles.
Stability Criterion for Discrete-Time Systems
K. Ratchagit
2010-01-01
Full Text Available This paper is concerned with the problem of delay-dependent stability analysis for discrete-time systems with interval-like time-varying delays. The problem is solved by applying a novel Lyapunov functional, and an improved delay-dependent stability criterion is obtained in terms of a linear matrix inequality.
Web-Based Implementation of Discrete Mathematics
Love, Tanzy; Keinert, Fritz; Shelley, Mack
2006-01-01
The Department of Mathematics at Iowa State University teaches a freshman-level Discrete Mathematics course with total enrollment of about 1,800 students per year. The traditional format includes large lectures, with about 150 students each, taught by faculty and temporary instructors in two class sessions per week and recitation sections, with…
Imposing det E > 0 in discrete
Loll, R.
2006-01-01
We point out that the inequality detE > 0 distinguishes the kinematical phase space of canonical connection gravity from that of a gauge field theory, and characterize the eigen- vectors with positive, negative and zero-eigenvalue of the corresponding quantum operator in a lattice-discretized versio
A Simple Discrete System with Chaotic Behavior
Asveld, Peter R.J.
1988-01-01
We discuss the behavior of a particular discrete system, viz. Post's system of tag with alphabet $\\{0,1\\}$, deletion number $d=3$, and rules: $0\\rightarrow 00$, $1\\rightarrow 1101$. As initial strings we consider all strings of length less than or equal to 15 as well as all 'worst case' inputs of t
Conservation of wave action under multisymplectic discretizations
Frank, J.E.
2006-01-01
In this paper we discuss the conservation of wave action under numerical discretization by variational and multisymplectic methods. Both the abstract wave action conservation defined with respect to a smooth, periodic, one-parameter ensemble of flow realizations and the specific wave action based on
Analysis hierarchical model for discrete event systems
Ciortea, E. M.
2015-11-01
The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.
Two modified discrete chirp Fourier transform schemes
樊平毅; 夏香根
2001-01-01
This paper presents two modified discrete chirp Fourier transform (MDCFT) schemes.Some matched filter properties such as the optimal selection of the transform length, and its relationship to analog chirp-Fourier transform are studied. Compared to the DCFT proposed previously, theoretical and simulation results have shown that the two MDCFTs can further improve the chirp rate resolution of the detected signals.
Fair value accounting and managerial discretion
Byrne, A.; Clacher, I.; Hillier, D.; Hodgson, A.
2008-01-01
We analyse the extent to which managers exercise discretion under fair value accounting and the value relevance of these disclosures. Utilising a sample of firms that apply the UK fair value pension accounting standard, (FRS-17), we examine the main determinants of the assumptions managers use to ar
Optimizing discrete control systems with phase limitations
Shakhverdian, S.B.; Abramian, A.K.
1981-01-01
A new method is proposed for solving discrete problems of optimizing control systems with limitations on the phase coordinates. Results are given from experimental research which demonstrate the need to introduce tangential limitations independent of the method of accounting for the phase limitations.
Discrete design optimization accounting for practical constraints
Schevenels, M.; McGinn, S.; Rolvink, A.; Coenders, J.L.
2013-01-01
This paper presents a heuristic algorithm for discrete design optimization, based on the optimality criteria method. Practical applicability is the first concern; special attention is therefore paid to the implementation of technological constraints. The method is generally applicable, but in order
Fair value accounting and managerial discretion
Byrne, A.; Clacher, I.; Hillier, D.; Hodgson, A.
2008-01-01
We analyse the extent to which managers exercise discretion under fair value accounting and the value relevance of these disclosures. Utilising a sample of firms that apply the UK fair value pension accounting standard, (FRS-17), we examine the main determinants of the assumptions managers use to
Symmetry-preserving discretization for DNS
Verstappen, R.W.C.P.; Dröge, M.T.; Veldman, A.E.P.; Friedrich, R; Geurts, BJ; Metais, O
2004-01-01
This paper describes a numerical method for solving the (incompressible) Navier-Stokes equations that is based on the idea that the motivation for discretizing differential operators should be to mimic their fundamental conservation and dissipation properties. Therefore, the symmetry of the underlyi
Models for neutrino mass with discrete symmetries
Morisi, S.
2011-08-01
Discrete non-abelian flavor symmetries give in a natural way tri-bimaximal (TBM) mixing as showed in a prototype model. However neutrino mass matrix pattern may be very different from the tri-bimaximal one if small deviations of TBM will be observed. We give the result of a model independent analysis for TBM neutrino mass pattern.
Models for neutrino mass with discrete symmetries
Morisi, S
2010-01-01
Discrete non-abelian flavor symmetries give in a natural way tri-bimaximal (TBM) mixing as showed in a prototype model. However neutrino mass matrix pattern may be very different from the tri-bimaximal one if small deviations of TBM will be observed. We give the result of a model independent analysis for TBM neutrino mass pattern.
Discrete structures in F-theory compactifications
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.
PHASE CHAOS IN THE DISCRETE KURAMOTO MODEL
Maistrenko, V.; Vasylenko, A.; Maistrenko, Y.;
2010-01-01
The paper describes the appearance of a novel, high-dimensional chaotic regime, called phase chaos, in a time-discrete Kuramoto model of globally coupled phase oscillators. This type of chaos is observed at small and intermediate values of the coupling strength. It arises from the nonlinear inter...
Geometric phases in discrete dynamical systems
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.
Discrete control of resonant wave energy devices.
Clément, A H; Babarit, A
2012-01-28
Aiming at amplifying the energy productive motion of wave energy converters (WECs) in response to irregular sea waves, the strategies of discrete control presented here feature some major advantages over continuous control, which is known to require, for optimal operation, a bidirectional power take-off able to re-inject energy into the WEC system during parts of the oscillation cycles. Three different discrete control strategies are described: latching control, declutching control and the combination of both, which we term latched-operating-declutched control. It is shown that any of these methods can be applied with great benefit, not only to mono-resonant WEC oscillators, but also to bi-resonant and multi-resonant systems. For some of these applications, it is shown how these three discrete control strategies can be optimally defined, either by analytical solution for regular waves, or numerically, by applying the optimal command theory in irregular waves. Applied to a model of a seven degree-of-freedom system (the SEAREV WEC) to estimate its annual production on several production sites, the most efficient of these discrete control strategies was shown to double the energy production, regardless of the resource level of the site, which may be considered as a real breakthrough, rather than a marginal improvement.
Discrete homology theory for metric spaces
H. Barcelo (Hélène); V. Capraro (Valerio); J. A. White; H. Barcelo (Hélène)
2014-01-01
htmlabstractWe define and study a notion of discrete homology theory for metric spaces. Instead of working with simplicial homology, our chain complexes are given by Lipschitz maps from an n n -dimensional cube to a fixed metric space. We prove that the resulting homology theory satisfies a
Symmetric products, permutation orbifolds and discrete torsion
Bántay, P
2000-01-01
Symmetric product orbifolds, i.e. permutation orbifolds of the full symmetric group S_{n} are considered by applying the general techniques of permutation orbifolds. Generating functions for various quantities, e.g. the torus partition functions and the Klein-bottle amplitudes are presented, as well as a simple expression for the discrete torsion coefficients.
A discrete anisotropic model for Scheibe aggregates
O. Bang
1991-05-01
Full Text Available A discrete anisotropic nonlinear model for the dynamics of Scheibe aggregates is investigated. The collapse of the collective excitations found by Möbius and Kuhn is described as a shrinking ring wave, which is eventually absorbed by an acceptor molecule. An optimal acceptor loss is found.
Discrete Tomography and Imaging of Polycrystalline Structures
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...
The Pairing Matrix in Discrete Electromagnetism On the Geometry of Discrete de Rham Currents
Auchmann, B
2007-01-01
We introduce pairing matrices on simplicial cell complexes in discrete electromagnetism as a means to avoid the explicit construction of a topologically dual complex. Interestingly, the Finite Element Method with first-order Whitney elements â when it is looked upon from a cell-method perspective â features pairing matrices and thus an implicitly defined dual mesh. We show that the pairing matrix can be used to construct discrete energy products. In this exercise we find that different formalisms lead to equivalent matrix representations. Discrete de Rham currents are an elegant way to subsume these geometrically equivalent but formally distinct ways of defining energy-products.
Continuous versus discrete for interacting carbon nanostructures
Hilder, Tamsyn A.; Hill, James M.
2007-04-01
Intermolecular forces between two interacting nanostructures can be obtained by either summing over all the individual atomic interactions or by using a continuum or continuous approach, where the number of atoms situated at discrete locations is averaged over the surface of each molecule. This paper aims to undertake a limited comparison of the continuum approach, the discrete atom-atom formulation and a hybrid discrete-continuum formulation for a range of molecular interactions involving a carbon nanotube, including interactions with another carbon nanotube and the fullerenes C60, C70 and C80. In the hybrid approach only one of the interacting molecules is discretized and the other is considered to be continuous. The hybrid discrete-continuum formulation would enable non-regular shaped molecules to be described, particularly useful for drug delivery systems which employ carbon nanotubes as carriers. The present investigation is important to obtain a rough estimate of the anticipated percentage errors which may occur between the various approaches in any specific application. Although our investigation is by no means comprehensive, overall we show that typically the interaction energies for these three approaches differ on average by at most 10% and the forces by 5%, with the exception of the C80 fullerene. For the C80 fullerene, while the intermolecular forces and the suction energies are in reasonable overall agreement, the point-wise energies can be significantly different. This may in part be due to differences in modelling the geometry of the C80 fullerene, but also the suction energies involve integrals of the energy, and therefore any errors or discrepancies in the point-wise energy tend to be smoothed out to give reasonable overall agreement for the former quantities.
Simple Sequence Repeat Genetic Linkage Maps of A-genome Diploid Cotton (Gossypium arboreum)
Xue-Xia Ma; Bao-Liang Zhou; Yan-Hui Lü; Wang-Zhen Guo; Tian-Zhen Zhang
2008-01-01
This study introduces the construction of the first intraspacific genetic linkage map of the A-genome diploid cotton with newly developed simple sequence repeat (SSR) markers using 189 F2 plants derived from the cross of two Asiatic parents were detected using 6 092 pairs of SSR primers. Two-hundred and sixty-eight pairs of SSR pdmers with better polymorphisms were picked out to analyze the F2 population. In total, 320 polymorphic bands were generated and used to construct a linkage map with JoinMap3.0. Two-hundred and sixty-seven loci, Including three phenotypic traits were mapped at a logarithms of odds ratio (LOD) ≥ 3.0 on 13 linkage groups. The total length of the map was 2 508.71 cM, and the average distance between adjacent markers was 9.40 cM. Chromosome assignments were according to the association of linkages with our backbone tetraploid specific map using the 89 similar SSR loci. Comparisons among the 13 suites of orthologous linkage groups revealed that the A-genome chromosomes are largely collinear with the At and Dt sub-genome chromosomes. Chromosomes associated with inversions suggested that allopolyploidization was accompanied by homologous chromosomal rearrangement. The inter-chromosomal duplicated loci supply molecular evidence that the A-genome diploid Asiatic cotton is paleopolyploid.
Exterior difference systems and invariance properties of discrete mechanics
Xie Zheng; Xie Duanqiang; Li Hongbo [Center of Mathematical Sciences, Zhejiang University, Zhejiang 310027 (China); Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing 100080 (China)], E-mail: lenozhengxie@yahoo.com.cn
2008-06-27
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.
Relation between Type-II Discrete Sine Transform and Type -I Discrete Hartley Transform
M.Narayan Murty
2017-06-01
Full Text Available In this paper, a relation for finding type-II discrete sine transform (DST from type-I discrete Hartley transform (DHT has been derived. The transform length N is taken as even. Using this relation, the (N - 1 output components of DST can be realized from DHT. The DHT is one of the transforms used for converting data in time domain into frequency domain using only real values.
Landmine detection using mixture of discrete hidden Markov models
Frigui, Hichem; Hamdi, Anis; Missaoui, Oualid; Gader, Paul
2009-05-01
We propose a landmine detection algorithm that uses a mixture of discrete hidden Markov models. We hypothesize that the data are generated by K models. These different models reflect the fact that mines and clutter objects have different characteristics depending on the mine type, soil and weather conditions, and burial depth. Model identification could be achieved through clustering in the parameters space or in the feature space. However, this approach is inappropriate as it is not trivial to define a meaningful distance metric for model parameters or sequence comparison. Our proposed approach is based on clustering in the log-likelihood space, and has two main steps. First, one HMM is fit to each of the R individual sequence. For each fitted model, we evaluate the log-likelihood of each sequence. This will result in an R×R log-likelihood distance matrix that will be partitioned into K groups using a hierarchical clustering algorithm. In the second step, we pool the sequences, according to which cluster they belong, into K groups, and we fit one HMM to each group. The mixture of these K HMMs would be used to build a descriptive model of the data. An artificial neural networks is then used to fuse the output of the K models. Results on large and diverse Ground Penetrating Radar data collections show that the proposed method can identify meaningful and coherent HMM models that describe different properties of the data. Each HMM models a group of alarm signatures that share common attributes such as clutter, mine type, and burial depth. Our initial experiments have also indicated that the proposed mixture model outperform the baseline HMM that uses one model for the mine and one model for the background.
Moment-based method for computing the two-dimensional discrete Hartley transform
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.
Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
Gicquel, Céline; Minoux, Michel
2015-01-01
International audience; We consider a problem arising in the context of industrial production planning, namely the multi-product discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. We aim at developing an exact solution approach based on a Cut & Branch procedure for this combinatorial optimization problem. To achieve this, we propose a new family of multi-product valid inequalities which corresponds to taking into account the conflicts between different produc...
Global Analysis of Almost Periodic Solution of a Discrete Multispecies Mutualism System
Hui Zhang
2014-01-01
of the system. Assuming that the coefficients in the system are almost periodic sequences, we obtain the sufficient conditions for the existence of a unique almost periodic solution which is globally attractive. In particular, for the discrete two-species Lotka-Volterra mutualism system, the sufficient conditions for the existence of a unique uniformly asymptotically stable almost periodic solution are obtained. An example together with numerical simulation indicates the feasibility of the main result.
Application of an efficient Bayesian discretization method to biomedical data
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.
Okuno, Miki; Kajitani, Rei; Ryusui, Rie; Morimoto, Hiroya; Kodama, Yukiko; Itoh, Takehiko
2016-02-01
The lager beer yeast Saccharomyces pastorianus is considered an allopolyploid hybrid species between S. cerevisiae and S. eubayanus. Many S. pastorianus strains have been isolated and classified into two groups according to geographical origin, but this classification remains controversial. Hybridization analyses and partial PCR-based sequence data have indicated a separate origin of these two groups, whereas a recent intertranslocation analysis suggested a single origin. To clarify the evolutionary history of this species, we analysed 10 S. pastorianus strains and the S. eubayanus type strain as a likely parent by Illumina next-generation sequencing. In addition to assembling the genomes of five of the strains, we obtained information on interchromosomal translocation, ploidy, and single-nucleotide variants (SNVs). Collectively, these results indicated that the two groups of strains share S. cerevisiae haploid chromosomes. We therefore conclude that both groups of S. pastorianus strains share at least one interspecific hybridization event and originated from a common parental species and that differences in ploidy and SNVs between the groups can be explained by chromosomal deletion or loss of heterozygosity.
Breatherlike excitations in discrete lattices with noise and nonlinear damping
Christiansen, Peter Leth; Gaididei, Yuri B.; Johansson, Magnus
1997-01-01
We discuss the stability of highly localized, ''breatherlike,'' excitations in discrete nonlinear lattices under the influence of thermal fluctuations. The particular model considered is the discrete nonlinear Schrodinger equation in the regime of high nonlinearity, where temperature effects...
Is Discrete Mathematics the New Math of the Eighties?
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)
Convergence of posteriors for discretized log Gaussian Cox processes
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...
Reducing pressure oscillations in discrete fluid power systems
Hansen, Anders Hedegaard; Pedersen, Henrik Clemmensen
2016-01-01
Discrete fluid power systems featuring transmission lines inherently include pressure oscillations. Experimental verification of a discrete fluid power power take off system for wave energy converters has shown the cylinder pressure to oscillate as force shifts are performed. This article...
Discrete coherent states for higher Landau levels
Abreu, L. D.; Balazs, P.; de Gosson, M.; Mouayn, Z.
2015-12-01
We consider the quantum dynamics of a charged particle evolving under the action of a constant homogeneous magnetic field, with emphasis on the discrete subgroups of the Heisenberg group (in the Euclidean case) and of the SL(2 , R) group (in the Hyperbolic case). We investigate completeness properties of discrete coherent states associated with higher order Euclidean and hyperbolic Landau levels, partially extending classic results of Perelomov and of Bargmann, Butera, Girardello and Klauder. In the Euclidean case, our results follow from identifying the completeness problem with known results from the theory of Gabor frames. The results for the hyperbolic setting follow by using a combination of methods from coherent states, time-scale analysis and the theory of Fuchsian groups and their associated automorphic forms.
Discrete and continuous simulation theory and practice
Bandyopadhyay, Susmita
2014-01-01
When it comes to discovering glitches inherent in complex systems-be it a railway or banking, chemical production, medical, manufacturing, or inventory control system-developing a simulation of a system can identify problems with less time, effort, and disruption than it would take to employ the original. Advantageous to both academic and industrial practitioners, Discrete and Continuous Simulation: Theory and Practice offers a detailed view of simulation that is useful in several fields of study.This text concentrates on the simulation of complex systems, covering the basics in detail and exploring the diverse aspects, including continuous event simulation and optimization with simulation. It explores the connections between discrete and continuous simulation, and applies a specific focus to simulation in the supply chain and manufacturing field. It discusses the Monte Carlo simulation, which is the basic and traditional form of simulation. It addresses future trends and technologies for simulation, with par...
Testing Preference Axioms in Discrete Choice experiments
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...... addressed in these studies which preference models are actually being tested, and the connection between the statistical tests performed and the relevant underlying models of respondent behavior has not been explored further. This paper tries to fill that gap. We specifically analyze the meaning and role...... 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...
Nonlinear Control and Discrete Event Systems
Meyer, George; Null, Cynthia H. (Technical Monitor)
1995-01-01
As the operation of large systems becomes ever more dependent on extensive automation, the need for an effective solution to the problem of design and validation of the underlying software becomes more critical. Large systems possesses much detailed structure, typically hierarchical, and they are hybrid. Information processing at the top of the hierarchy is by means of formal logic and sentences; on the bottom it is by means of simple scalar differential equations and functions of time; and in the middle it is by an interacting mix of nonlinear multi-axis differential equations and automata, and functions of time and discrete events. The lecture will address the overall problem as it relates to flight vehicle management, describe the middle level, and offer a design approach that is based on Differential Geometry and Discrete Event Dynamic Systems Theory.
Discrete PID Tuning Using Artificial Intelligence Techniques
Petr DOLEŽEL
2009-06-01
Full Text Available PID controllers are widely used in industry these days due to their useful properties such as simple tuning or robustness. While they are applicable to many control problems, they can perform poorly in some applications. Highly nonlinear system control with constrained manipulated variable can be mentioned as an example. The point of the paper is to string together convenient qualities of conventional PID control and progressive techniques based on Artificial Intelligence. Proposed control method should deal with even highly nonlinear systems. To be more specific, there is described new method of discrete PID controller tuning in this paper. This method tunes discrete PID controller parameters online through the use of genetic algorithm and neural model of controlled system in order to control successfully even highly nonlinear systems. After method description and some discussion, there is performed control simulation and comparison to one chosen conventional control method.
A Factoring and Discrete Logarithm based Cryptosystem
Ciss, Abdoul Aziz; Sow, Djiby
2012-01-01
This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined dur- ing the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient public key cryptosystem. To break the scheme, an adversary may solve the IFP and the DLP separately which is computationally infeasible. The key gen- eration is a simple operation based on the discrete logarithm modulo a composite moduli. The encryption phase is based both on the cube root computation and the DLP. These operations are computationally efficient.
Early Universes with Effective Discrete Time
Baulieu, Laurent
2016-01-01
The mechanism for triggering the universe inflation could be that at very early periods the time variable was discrete instead of smooth. Alternatively, and perhaps equivalently, it could be the consequence that the metrics of the early universe was a strongly concentrated gravitational coherent state with very high frequency oscillations, allowing local pair creations by a generalisation to gravity of the Schwinger mechanism, perhaps by creation of black holes of masses superior to the Planck scale. The lattice spacing between two clicks in the discrete time picture corresponds to the inverse frequency of the gravitational coherent state in the other picture. In both cases, a much lower time than the Planck time might represent a new fundamental scale, giving new type of physics. To make possible a concrete estimation of the pair production probability, we propose that the oscillating coherent state metrics that defines this very early geometry minimises the Einstein gravity action coupled to interacting 1-,...
Teaching Formal Methods and Discrete Mathematics
Mathieu Jaume
2014-04-01
Full Text Available Despite significant advancements in the conception of (formal integrated development environments, applying formal methods in software industry is still perceived as a difficult task. To make the task easier, providing tools that help during the development cycle is essential but we think that education of computer scientists and software engineers is also an important challenge to take up. Indeed, we believe that formal methods courses do not appear sufficiently early in compter science curricula and thus are not widely used and perceived as a valid professional skill. In this paper, we claim that teaching formal methods could be done at the undergraduate level by mixing formal methods and discrete mathematics courses and we illustrate such an approach with a small develop- ment within FoCaLiZe. We also believe that this could considerably benefit the learning of discrete mathematics.
Strong coupling, discrete symmetry and flavour
Abel, Steven
2010-01-01
We show how two principles - strong coupling and discrete symmetry - can work together to generate the flavour structure of the Standard Model. We propose that in the UV the full theory has a discrete flavour symmetry, typically only associated with tribimaximal mixing in the neutrino sector. Hierarchies in the particle masses and mixing matrices then emerge from multiple strongly coupled sectors that break this symmetry. This allows for a realistic flavour structure, even in models built around an underlying grand unified theory. We use two different techniques to understand the strongly coupled physics: confinement in N=1 supersymmetry and the AdS/CFT correspondence. Both approaches yield equivalent results and can be represented in a clear, graphical way where the flavour symmetry is realised geometrically.
Observation of a Discrete Time Crystal
Zhang, J; Kyprianidis, A; Becker, P; Lee, A; Smith, J; Pagano, G; Potirniche, I -D; Potter, A C; Vishwanath, A; Yao, N Y; Monroe, C
2016-01-01
Spontaneous symmetry breaking is a fundamental concept in many areas of physics, ranging from cosmology and particle physics to condensed matter. A prime example is the breaking of spatial translation symmetry, which underlies the formation of crystals and the phase transition from liquid to solid. Analogous to crystals in space, the breaking of translation symmetry in time and the emergence of a "time crystal" was recently proposed, but later shown to be forbidden in thermal equilibrium. However, non-equilibrium Floquet systems subject to a periodic drive can exhibit persistent time-correlations at an emergent sub-harmonic frequency. This new phase of matter has been dubbed a "discrete time crystal" (DTC). Here, we present the first experimental observation of a discrete time crystal, in an interacting spin chain of trapped atomic ions. We apply a periodic Hamiltonian to the system under many-body localization (MBL) conditions, and observe a sub-harmonic temporal response that is robust to external perturbat...
Discrete event systems diagnosis and diagnosability
Sayed-Mouchaweh, Moamar
2014-01-01
Discrete Event Systems: Diagnosis and Diagnosability addresses the problem of fault diagnosis of Discrete Event Systems (DES). This book provides the basic techniques and approaches necessary for the design of an efficient fault diagnosis system for a wide range of modern engineering applications. The different techniques and approaches are classified according to several criteria such as: modeling tools (Automata, Petri nets) that is used to construct the model; the information (qualitative based on events occurrences and/or states outputs, quantitative based on signal processing and data analysis) that is needed to analyze and achieve the diagnosis; the decision structure (centralized, decentralized) that is required to achieve the diagnosis. The goal of this classification is to select the efficient method to achieve the fault diagnosis according to the application constraints. This book focuses on the centralized and decentralized event based diagnosis approaches using formal language and automata as mode...
Integral and discrete inequalities and their applications
Qin, Yuming
2016-01-01
This book focuses on one- and multi-dimensional linear integral and discrete Gronwall-Bellman type inequalities. It provides a useful collection and systematic presentation of known and new results, as well as many applications to differential (ODE and PDE), difference, and integral equations. With this work the author fills a gap in the literature on inequalities, offering an ideal source for researchers in these topics. The present volume is part 1 of the author’s two-volume work on inequalities. Integral and discrete inequalities are a very important tool in classical analysis and play a crucial role in establishing the well-posedness of the related equations, i.e., differential, difference and integral equations.
Discrete Spectrum Reconstruction Using Integral Approximation Algorithm.
Sizikov, Valery; Sidorov, Denis
2017-07-01
An inverse problem in spectroscopy is considered. The objective is to restore the discrete spectrum from observed spectrum data, taking into account the spectrometer's line spread function. The problem is reduced to solution of a system of linear-nonlinear equations (SLNE) with respect to intensities and frequencies of the discrete spectral lines. The SLNE is linear with respect to lines' intensities and nonlinear with respect to the lines' frequencies. The integral approximation algorithm is proposed for the solution of this SLNE. The algorithm combines solution of linear integral equations with solution of a system of linear algebraic equations and avoids nonlinear equations. Numerical examples of the application of the technique, both to synthetic and experimental spectra, demonstrate the efficacy of the proposed approach in enabling an effective enhancement of the spectrometer's resolution.
Zhao Zhi-Jin; Zheng Shi-Lian; Xu Chun-Yun; Kong Xian-Zheng
2007-01-01
Hidden Markov models (HMMs) have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm (GA) and simulated annealing (SA) to train HMM for discrete channel modelling. The proposed method is compared with pure GA, and experimental results show that the HMMs trained by the hybrid method can better describe the error sequences due to SA's ability of facilitating hill-climbing at the later stage of the search. The burst error statistics of the HMMs trained by the proposed method and the corresponding error sequences are also presented to validate the proposed method.
Parametric estimation of discretely sampled Gamma-OU processes
ZHANG Shibin; ZHANG Xinsheng; SUN Shuguang
2006-01-01
The stationary Gamma-OU processes are recommended to be the volatility of the financial assets. A parametric estimation for the Gamma-OU processes based on the discrete observations is considered in this paper. The estimator of an intensity parameter λ and its convergence result are given, and the simulations show that the estimation is quite accurate. Assuming that the parameter λ is estimated, the maximum likelihood estimation of shape parameter c and scale parameter α, whose likelihood function is not explicitly computable, is considered. By means of the Gaver-Stehfest algorithm, we construct an explicit sequence of approximations to the likelihood function and show that it converges the true (but unkown) one. Maximizing the sequence results in an estimator that converges to the true maximum likelihood estimator and the approximation shares the asymptotic properties of the true maximum likelihood estimator. Some simulation experiments reveal that this method is still quite accurate in most of rational situations for the background of volatility.
CORBA-Based Discrete Event Simulation System
无
2001-01-01
The CORBA technique is an integration of the object-oriented conception and distributed computing technique. It can make the application within distributed heterogeneous environments reusable, portable and interoperable.The architecture of CORBA-based discrete event simulation systems is presented and the interface of distributed simulation objects (DSO) is defined in this paper after the DSO is identified and the sysnchronization mechanism among DSO is discussed.``
Discrete equations and the singular manifold method
Estévez, P G
1999-01-01
The Painleve expansion for the second Painleve equation (PII) and fourth Painleve equation (PIV) have two branches. The singular manifold method therefore requires two singular manifolds. The double singular manifold method is used to derive Miura transformations from PII and PIV to modified Painleve type equations for which auto-Backlund transformations are obtained. These auto-Backlund transformations can be used to obtain discrete equations.
Hyponormal differential operators with discrete spectrum
Zameddin I. Ismailov
2010-01-01
Full Text Available In this work, we first describe all the maximal hyponormal extensions of a minimal operator generated by a linear differential-operator expression of the first-order in the Hilbert space of vector-functions in a finite interval. Next, we investigate the discreteness of the spectrum and the asymptotical behavior of the modules of the eigenvalues for these maximal hyponormal extensions.
DOS: the discrete-ordinates system. [LMFBR
Rhoades, W. A.; Emmett, M. B.
1982-09-01
The Discrete Ordinates System determines the flux of neutrons or photons due either to fixed sources specified by the user or to sources generated by particle interaction with the problem materials. It also determines numerous secondary results which depend upon flux. Criticality searches can be performed. Numerous input, output, and file manipulation facilities are provided. The DOS driver program reads the problem specification from an input file and calls various program modules into execution as specified by the input file.
Security Analysis of Discrete Logarithm Based Cryptosystems
WANG Yuzhu; LIAO Xiaofeng
2006-01-01
Discrete logarithm based cryptosystems have subtle problems that make the schemes vulnerable. This paper gives a comprehensive listing of security issues in the systems and analyzes three classes of attacks which are based on mathematical structure of the group which is used in the schemes, the disclosed information of the subgroup and implementation details respectively. The analysis will, in turn, allow us to motivate protocol design and implementation decisions.
Compact phase space, cosmological constant, discrete time
Rovelli, Carlo
2015-01-01
We study the quantization of geometry in the presence of a cosmological constant, using a discretiza- tion with constant-curvature simplices. Phase space turns out to be compact and the Hilbert space finite dimensional for each link. Not only the intrinsic, but also the extrinsic geometry turns out to be discrete, pointing to discreetness of time, in addition to space. We work in 2+1 dimensions, but these results may be relevant also for the physical 3+1 case.
Discrete Tolerance Allocation for Product Families
Lööf, Johan; Söderberg, Rikard
2011-01-01
Abstract This paper extends earlier research on the discrete tolerance allocation problem in order to optimize an entire product family simultaneously. This methodology enables top-down tolerancing approach where requirements on assembly level on products within a family are allocated to single part requirements. The proposed solution has been implemented as an interface with an optimization algorithm coupled with a variation simulation software. The paper also consists of an exten...
Discrete Mathematics for Computer Science, Some Notes
Gallier, Jean
2008-01-01
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. Indeed I begin with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural deduction system ``a la Prawitz''. The rest of the material is more or less traditional but I emphasize partial functions more than usual (after all, programs may not terminate for all input) and I provide a fairly complete account of the basic concepts of graph theory.
On the ranges of discrete exponentials
Florin Caragiu
2004-01-01
Full Text Available Let a>1 be a fixed integer. We prove that there is no first-order formula ϕ(X in one free variable X, written in the language of rings, such that for any prime p with gcd(a,p=1 the set of all elements in the finite prime field Fp satisfying ϕ coincides with the range of the discrete exponential function t↦at(modp.
Discrete Motor Coordinates for Vowel Production
María Florencia Assaneo; Trevisan, Marcos A.; Mindlin, Gabriel B.
2013-01-01
Current models of human vocal production that capture peripheral dynamics in speech require large dimensional measurements of the neural activity, which are mapped into equally complex motor gestures. In this work we present a motor description for vowels as points in a discrete low-dimensional space. We monitor the dynamics of 3 points at the oral cavity using Hall-effect transducers and magnets, describing the resulting signals during normal utterances in terms of active...
Discrete Tolerance Allocation for Product Families
Lööf, Johan; Söderberg, Rikard
2011-01-01
Abstract This paper extends earlier research on the discrete tolerance allocation problem in order to optimize an entire product family simultaneously. This methodology enables top-down tolerancing approach where requirements on assembly level on products within a family are allocated to single part requirements. The proposed solution has been implemented as an interface with an optimization algorithm coupled with a variation simulation software. The paper also consists of an exten...
Discrete and continuum modelling of soil cutting
Coetzee, C. J.
2014-12-01
Both continuum and discrete methods are used to investigate the soil cutting process. The Discrete Element Method ( dem) is used for the discrete modelling and the Material-Point Method ( mpm) is used for continuum modelling. M pmis a so-called particle method or meshless finite element method. Standard finite element methods have difficulty in modelling the entire cutting process due to large displacements and deformation of the mesh. The use of meshless methods overcomes this problem. M pm can model large deformations, frictional contact at the soil-tool interface, and dynamic effects (inertia forces). In granular materials the discreteness of the system is often important and rotational degrees of freedom are active, which might require enhanced theoretical approaches like polar continua. In polar continuum theories, the material points are considered to possess orientations. A material point has three degrees-of-freedom for rigid rotations, in addition to the three classic translational degrees-of-freedom. The Cosserat continuum is the most transparent and straightforward extension of the nonpolar (classic) continuum. Two-dimensional dem and mpm (polar and nonpolar) simulations of the cutting problem are compared to experiments. The drag force and flow patterns are compared using cohesionless corn grains as material. The corn macro (continuum) and micro ( dem) properties were obtained from shear and oedometer tests. Results show that the dilatancy angle plays a significant role in the flow of material but has less of an influence on the draft force. Nonpolar mpm is the most accurate in predicting blade forces, blade-soil interface stresses and the position and orientation of shear bands. Polar mpm fails in predicting the orientation of the shear band, but is less sensitive to mesh size and mesh orientation compared to nonpolar mpm. dem simulations show less material dilation than observed during experiments.
Bimaximal Neutrino Mixing with Discrete Flavour Symmetries
Merlo, Luca
2011-01-01
In view of the fact that the data on neutrino mixing are still compatible with a situation where Bimaximal mixing is valid in first approximation and it is then corrected by terms of order of the Cabibbo angle, we present examples where these properties are naturally realized. The models are supersymmetric in 4-dimensions and based on the discrete non-Abelian flavour symmetry S4.
Scale-space for discrete signals
Lindeberg, Tony
1990-01-01
This article addresses the formulation of a scale-space theory for discrete signals. In one dimension it is possible to characterize the smoothing transformations completely and an exhaustive treatment is given, answering the following two main questions: Which linear transformations remove structure in the sense that the number of local extrema (or zero-crossings) in the output signal does not exceed the number of local extrema (or zero-crossings) in the original signal? How should one creat...
Flavor Unification and Discrete Nonabelian Symmetries
Kaplan, D B; Kaplan, David B.; Schmaltz, Martin
1994-01-01
Grand unified theories with fermions transforming as irreducible representations of a discrete nonabelian flavor symmetry can lead to realistic fermion masses, without requiring very small fundamental parameters. We construct a specific example of a supersymmetric GUT based on the flavor symmetry $\\Delta(75)$ --- a subgroup of $SU(3)$ --- which can explain the observed quark and lepton masses and mixing angles. The model predicts $\\tan\\beta \\simeq 2-5$ and gives a $\\tau$ neutrino mass $m_\
Online Learning in Discrete Hidden Markov Models
Alamino, Roberto C.; Caticha, Nestor
2007-01-01
We present and analyse three online algorithms for learning in discrete Hidden Markov Models (HMMs) and compare them with the Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalisation error we draw learning curves in simplified situations. The performance for learning drifting concepts of one of the presented algorithms is analysed and compared with the Baldi-Chauvin algorithm in the same situations. A brief discussion about learning and symmetry breaking b...
Controlling hopf bifurcations: Discrete-time systems
Guanrong Chen
2000-01-01
Full Text Available Bifurcation control has attracted increasing attention in recent years. A simple and unified state-feedback methodology is developed in this paper for Hopf bifurcation control for discrete-time systems. The control task can be either shifting an existing Hopf bifurcation or creating a new Hopf bifurcation. Some computer simulations are included to illustrate the methodology and to verify the theoretical results.
Dimension Reduction and Discretization in Stochastic Problems by Regression Method
Ditlevsen, Ove Dalager
1996-01-01
The chapter mainly deals with dimension reduction and field discretizations based directly on the concept of linear regression. Several examples of interesting applications in stochastic mechanics are also given.Keywords: Random fields discretization, Linear regression, Stochastic interpolation, ......, Slepian models, Stochastic finite elements.......The chapter mainly deals with dimension reduction and field discretizations based directly on the concept of linear regression. Several examples of interesting applications in stochastic mechanics are also given.Keywords: Random fields discretization, Linear regression, Stochastic interpolation...
On adaptive refinements in discrete probabilistic fracture models
J. Eliáš
2017-01-01
Full Text Available The possibility to adaptively change discretization density is a well acknowledged and used feature of many continuum models. It is employed to save computational time and increase solution accuracy. Recently, adaptivity has been introduced also for discrete particle models. This contribution applies adaptive technique in probabilistic discrete modelling where material properties are varying in space according to a random field. The random field discretization is adaptively refined hand in hand with the model geometry.
Hamiltonian Forms for a Hierarchy of Discrete Integrable Coupling Systems
XU Xi-Xiang; YANG Hong-Xiang; LU Rong-Wu
2008-01-01
A semi-direct sum of two Lie algebras of four-by-four matrices is presented, and a discrete four-by-fore matrix spectral problem is introduced. A hierarchy of discrete integrable coupling systems is derived. The obtained integrable coupling systems are all written in their Hamiltonian forms by the discrete variational identity. Finally, we prove that the lattice equations in the obtained integrable coupling systems are all Liouville integrable discrete Hamiltonian systems.
ATTRACTORS FOR DISCRETIZATION OF GINZBURG-LANDAU-BBM EQUATIONS
Mu-rong Jiang; Bo-ling Guo
2001-01-01
In this paper, Ginzburg-Landau equation coupled with BBM equationwith periodic initial boundary value conditions are discreted by the finite difference method in spatial direction. Existence of the attractors for the spatially discreted Ginzburg-Landau-BBM equations is proved. For each mesh size, there exist attractors for the discretized system. Moreover, finite Hausdorff and fractal dimensions of the discrete attractors are obtained and the bounds are independent of the mesh sizes.
p-form electromagnetism on discrete spacetimes
Wise, Derek K [Department of Mathematics, University of California, Riverside, CA 92521 (United States)
2006-09-07
We investigate p-form electromagnetism-with the Maxwell and Kalb-Ramond fields as lowest-order cases-on discrete spacetimes, including not only the regular lattices commonly used in lattice gauge theory, but also more general examples. After constructing a maximally general model of discrete spacetime suitable for our purpose-a chain complex equipped with an inner product on (p + 1)-cochains-we study both the classical and quantum versions of the theory, with either R or U(1) as gauge group. We find results-such as a 'p-form Bohm-Aharonov effect'-that depend in interesting ways on the cohomology of spacetime. We quantize the theory via the Euclidean path integral formalism, where the natural kernels in the U(1) theory are not Gaussians but theta functions. As a special case of the general theory, we show that p-form electromagnetism in p + 1 dimensions has an exact solution which reduces when p = 1 to the Abelian case of 2D Yang-Mills theory as studied by Migdal and Witten. Our main result describes p-form electromagnetism as a 'chain field theory'-a theory analogous to a topological quantum field theory, but with chain complexes replacing manifolds. This makes precise a notion of time evolution in the context of discrete spacetimes of arbitrary topology.
Police investigations: discretion denied yet undeniably exercised
Belur, J.; Tilley, N.; Osrin, D.; Daruwalla, N.; Kumar, M.; Tiwari, V.
2014-01-01
Police investigations involve determining whether a crime has been committed, and if so what type of crime, who has committed it and whether there is the evidence to charge the perpetrators. Drawing on fieldwork in Delhi and Mumbai, this paper explores how police investigations unfolded in the specific context of women’s deaths by burning in India. In particular, it focuses on the use of discretion despite its denial by those exercising it. In India, there are distinctive statutes relating to women’s suspicious deaths, reflecting the widespread expectation that the bride’s family will pay a dowry to the groom’s family and the tensions to which this may on occasion give rise in the early years of a marriage. Often, there are conflicting claims influencing how the woman’s death is classified. These in turn affect police investigation. The nature and direction of police discretion in investigating women’s deaths by burning reflect in part the unique nature of the legislation and the particular sensitivities in relation to these types of death. They also highlight processes that are liable to be at work in any crime investigation. It was found that police officers exercised unacknowledged discretion at seven specific points in the investigative process, with potentially significant consequences for the achievement of just outcomes: first response, recording the victim’s ‘dying declaration’, inquest, registering of the ‘First Information Report’, collecting evidence, arrest and framing of the charges. PMID:26376482
An essay on discrete foundations for physics
Noyes, H.P.; McGoveran, D.O.
1988-07-01
We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non-uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs.
Entropic Phase Maps in Discrete Quantum Gravity
Benjamin F. Dribus
2017-06-01
Full Text Available Path summation offers a flexible general approach to quantum theory, including quantum gravity. In the latter setting, summation is performed over a space of evolutionary pathways in a history configuration space. Discrete causal histories called acyclic directed sets offer certain advantages over similar models appearing in the literature, such as causal sets. Path summation defined in terms of these histories enables derivation of discrete Schrödinger-type equations describing quantum spacetime dynamics for any suitable choice of algebraic quantities associated with each evolutionary pathway. These quantities, called phases, collectively define a phase map from the space of evolutionary pathways to a target object, such as the unit circle S 1 ⊂ C , or an analogue such as S 3 or S 7 . This paper explores the problem of identifying suitable phase maps for discrete quantum gravity, focusing on a class of S 1 -valued maps defined in terms of “structural increments” of histories, called terminal states. Invariants such as state automorphism groups determine multiplicities of states, and induce families of natural entropy functions. A phase map defined in terms of such a function is called an entropic phase map. The associated dynamical law may be viewed as an abstract combination of Schrödinger’s equation and the second law of thermodynamics.
An essay on discrete foundations for physics
Noyes, H.P.; McGoveran, D.O.
1988-10-05
We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non- uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs.
A Hybrid Evolutionary Algorithm for Discrete Optimization
J. Bhuvana
2015-03-01
Full Text Available Most of the real world multi-objective problems demand us to choose one Pareto optimal solution out of a finite set of choices. Flexible job shop scheduling problem is one such problem whose solutions are required to be selected from a discrete solution space. In this study we have designed a hybrid genetic algorithm to solve this scheduling problem. Hybrid genetic algorithms combine both the aspects of the search, exploration and exploitation of the search space. Proposed algorithm, Hybrid GA with Discrete Local Search, performs global search through the GA and exploits the locality through discrete local search. Proposed hybrid algorithm not only has the ability to generate Pareto optimal solutions and also identifies them with less computation. Five different benchmark test instances are used to evaluate the performance of the proposed algorithm. Results observed shown that the proposed algorithm has produced the known Pareto optimal solutions through exploration and exploitation of the search space with less number of functional evaluations.
Discrete resource allocation in visual working memory.
Barton, Brian; Ester, Edward F; Awh, Edward
2009-10-01
Are resources in visual working memory allocated in a continuous or a discrete fashion? On one hand, flexible resource models suggest that capacity is determined by a central resource pool that can be flexibly divided such that items of greater complexity receive a larger share of resources. On the other hand, if capacity in working memory is defined in terms of discrete storage "slots," then observers may be able to determine which items are assigned to a slot but not how resources are divided between stored items. To test these predictions, the authors manipulated the relative complexity of the items to be stored while holding the number items constant. Although mnemonic resolution declined when set size increased (Experiment 1), resolution for a given item was unaffected by large variations in the complexity of the other items to be stored when set size was held constant (Experiments 2-4). Thus, resources in visual working memory are distributed in a discrete slot-based fashion, even when interitem variations in complexity motivate an asymmetrical division of resources across items. PsycINFO Database Record (c) 2009 APA, all rights reserved.
Mittag-Leffler function for discrete fractional modelling
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.
Variational principle and dynamical equations of discrete nonconservative holonomic systems
Liu Rong-Wan; Zhang Hong-Bin; Chen Li-Qun
2006-01-01
By analogue with the methods and processes in continuous mechanics, a Lagrangian formulation and a Hamiltonian formulation of discrete mechanics are obtained. The dynamical equations including Euler-Lagrange equations and Hamilton's canonical equations of the discrete nonconservative holonomic systems are derived on a discrete variational principle. Some illustrative examples are also given.
First integrals of the discrete nonconservative and nonholonomic systems
Zhang Hong-Bin; Chen Li-Qun; Liu Rong-Wan
2005-01-01
In this paper we show that the first integrals of the discrete equation of motion for nonconservative and non holonomic mechanical systems can be determined explicitly by investigating the invariance properties of the discrete Lagrangian. The result obtained is a discrete analogue of the generalized theorem of Noether in the Calculus of variations.
The discrete variational principle in Hamiltonian formalism and first integrals
Zhang Hong-Bin; Chen Li-Qun; Liu Rong-Wan
2005-01-01
The aim of this paper is to show that first integrals of discrete equation of motion for Hamiltonian systems can be determined explicitly by investigating the invariance properties of the discrete Lagrangian in phase space. The result obtained is a discrete analog of the theorem of Noether in the calculus of variations.
Probabilistic methods for discrete nonlinear Schr\\"odinger equations
Chatterjee, Sourav
2010-01-01
Using techniques from probability theory, we show that the thermodynamics of the focusing cubic discrete nonlinear Schrodinger equation (NLS) are exactly solvable in dimensions three and higher. A number of explicit formulas are derived. The probabilistic results, combined with dynamical information, prove the existence and typicality of solutions to the discrete NLS with highly stable localized modes that are sometimes called discrete breathers.
A Baecklund transformation between two integrable discrete hungry systems
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.
Full Text Available Sequences Nucleotide Sequence Nucleotide sequence of full length cDNA (trimmed sequence) kome_ine_full_seq...uence_db.fasta.zip kome_ine_full_sequence_db.zip kome_ine_full_sequence_db ...
Cryptographic pseudo-random sequences from the chaotic Hénon map
Madhekar Suneel
2009-10-01
A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity proﬁle, correlation and auto-correlation are investigated. All these properties of the sequences suggest a strong resemblance to random sequences. Results of statistical testing of the sequences are found encouraging. An estimate of the keyspace size is presented.
Seslija, Marko; van der Schaft, Arjan; Scherpen, Jacquelien M.A.
2012-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 a simplicial Dirac structure as a discrete analogue of the Stokes-Dirac structure and demonstrate
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 t
Pirastru, Monica; Multineddu, Chiara; Mereu, Paolo; Sannai, Mara; El Sherbini, El Said; Hadjisterkotis, Eleftherios; Nàhlik, Andràs; Franceschi, Paul; Manca, Laura; Masala, Bruno
2009-09-01
In order to investigate the polymorphism of ?-globin chain of hemoglobin amongst caprines, the linked (I)? and (II)? globin genes of Barbary sheep (Ammotragus lervia), goat (Capra hircus), European mouflon (Ovis aries musimon), and Cyprus mouflon (Ovis aries ophion) were completely sequenced, including the 5? and 3? untranslated regions. European and Cyprus mouflons, which do not show polymorphic ? globin chains, had almost identical ? globin genes, whereas Barbary sheep exhibit two different chains encoded by two nonallelic genes. Four different ? genes were observed and sequenced in goat, validating previous observations of the existence of allelic and nonallelic polymorphism. As in other vertebrates, interchromosomal gene conversion appears to be responsible for such polymorphism. Evaluation of nucleotide sequences at the level of molecular evolution of the (I)?-globin gene family in the caprine taxa suggests a closer relationship between the genus Ammotragus and Capra. Molecular clock estimates suggest sheep-mouflon, goat-aoudad, and ancestor-caprine divergences of 2.8, 5.7, and 7.1 MYBP, respectively.
Noether's theory of Lagrange systems in discrete case
Lu Hong-Sheng; Zhang-Hong-Bin; Gu Shu-Long
2011-01-01
In this paper, Noether theory of Lagrange systems in discrete case are studied. First, we briefly overview the wellknown Noether theory of Lagrange system in the continuous case. Then, we introduce some definitions and notations,such as the operators of discrete translation to the right and the left and the operators of discrete differentiation to the right and the left, and give the conditions for the invariance of the difference functional on the uniform lattice and the non-uniform one, respectively. We also deduce the discrete analog of the Noether-type identity. Finally, the discrete analog of Noether's theorem is presented. An example was discussed to illustrate these results.
Continuum limit of discrete Sommerfeld problems on square lattice
BASANT LAL SHARMA
2017-05-01
A low-frequency approximation of the discrete Sommerfeld diffraction problems, involving the scattering of a time harmonic lattice wave incident on square lattice by a discrete Dirichlet or a discrete Neumann half-plane, is investigated. It is established that the exact solution of the discrete model converges to the solution of the continuum model, i.e., the continuous Sommerfeld problem, in the discrete Sobolev space defined by Hackbusch. A proof of convergence has been provided for both types of boundary conditions when the imaginary part of incident wavenumber is positive.
Projected discrete ordinates methods for numerical transport problems
Larsen, E.W.
1985-01-01
A class of Projected Discrete-Ordinates (PDO) methods is described for obtaining iterative solutions of discrete-ordinates problems with convergence rates comparable to those observed using Diffusion Synthetic Acceleration (DSA). The spatially discretized PDO solutions are generally not equal to the DSA solutions, but unlike DSA, which requires great care in the use of spatial discretizations to preserve stability, the PDO solutions remain stable and rapidly convergent with essentially arbitrary spatial discretizations. Numerical results are presented which illustrate the rapid convergence and the accuracy of solutions obtained using PDO methods with commonplace differencing methods.
Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing
Jones, Robert L.; Goode, Plesent W. (Technical Monitor)
2000-01-01
The Petri net formalism is useful in studying many discrete-state, discrete-event systems exhibiting concurrency, synchronization, and other complex behavior. As a bipartite graph, the net can conveniently capture salient aspects of the system. As a mathematical tool, the net can specify an analyzable state space. Indeed, one can reason about certain qualitative properties (from state occupancies) and how they arise (the sequence of events leading there). By introducing deterministic or random delays, the model is forced to sojourn in states some amount of time, giving rise to an underlying stochastic process, one that can be specified in a compact way and capable of providing quantitative, probabilistic measures. We formalize a new non-Markovian extension to the Petri net that captures both discrete and continuous timing in the same model. The approach affords efficient, stationary analysis in most cases and efficient transient analysis under certain restrictions. Moreover, this new formalism has the added benefit in modeling fidelity stemming from the simultaneous capture of discrete- and continuous-time events (as opposed to capturing only one and approximating the other). We show how the underlying stochastic process, which is non-Markovian, can be resolved into simpler Markovian problems that enjoy efficient solutions. Solution algorithms are provided that can be easily programmed.
The Random Discrete Action for 2-Dimensional Spacetime
Benincasa, Dionigi M T; Schmitzer, Bernhard
2010-01-01
A one-parameter family of random variables, called the Discrete Action, is defined for a 2-dimensional Lorentzian spacetime of finite volume. The single parameter is a discreteness scale. The expectation value of this Discrete Action is calculated for various regions of 2D Minkowski spacetime. When a causally convex region of 2D Minkowski spacetime is divided into subregions using null lines the mean of the Discrete Action is equal to the alternating sum of the numbers of vertices, edges and faces of the null tiling, up to corrections that tend to zero as the discreteness scale is taken to zero. This result is used to predict that the mean of the Discrete Action of the flat Lorentzian cylinder is zero up to corrections, which is verified. The ``topological'' character of the Discrete Action breaks down for causally convex regions of the flat trousers spacetime that contain the singularity and for non-causally convex rectangles.
The random discrete action for two-dimensional spacetime
Benincasa, Dionigi M. T.; Dowker, Fay; Schmitzer, Bernhard
2011-05-01
A one-parameter family of random variables, called the Discrete Action, is defined for a two-dimensional Lorentzian spacetime of finite volume. The single parameter is a discreteness scale. The expectation value of this discrete action is calculated for various regions of 2D Minkowski spacetime, {M}^2. When a causally convex region of {M}^2 is divided into subregions using null lines the mean of the discrete action is equal to the alternating sum of the numbers of vertices, edges and faces of the null tiling, up to corrections that tend to 0 as the discreteness scale is taken to 0. This result is used to predict that the mean of the discrete action of the flat Lorentzian cylinder is zero up to corrections, which is verified. The 'topological' character of the discrete action breaks down for causally convex regions of the flat trousers spacetime that contain the singularity and for non-causally convex rectangles.
Discrete fields, general relativity, other possible implications and experimental evidences
De Souza, M M
2001-01-01
The physical meaning, the properties and the consequences of a discrete scalar field are discussed; limits for the validity of a mathematical description of fundamental physics in terms of continuous fields are a natural outcome of discrete fields with discrete interactions. The discrete scalar field is ultimately the gravitational field of general relativity, necessarily, and there is no place for any other fundamental scalar field, in this context. Part of the paper comprehends a more generic discussion about the nature, if continuous or discrete, of fundamental interactions. There is a critical point defined by the equivalence between the two descriptions. Discrepancies between them can be observed far away from this point as a continuous-interaction is always stronger below it and weaker above it than a discrete one. It is possible that some discrete-field manifestations have already been observed in the flat rotation curves of galaxies and in the apparent anomalous acceleration of the Pioneer spacecrafts...
Deakin, Janine E; Edwards, Melanie J; Patel, Hardip; O'Meally, Denis; Lian, Jinmin; Stenhouse, Rachael; Ryan, Sam; Livernois, Alexandra M; Azad, Bhumika; Holleley, Clare E; Li, Qiye; Georges, Arthur
2016-06-10
Squamates (lizards and snakes) are a speciose lineage of reptiles displaying considerable karyotypic diversity, particularly among lizards. Understanding the evolution of this diversity requires comparison of genome organisation between species. Although the genomes of several squamate species have now been sequenced, only the green anole lizard has any sequence anchored to chromosomes. There is only limited gene mapping data available for five other squamates. This makes it difficult to reconstruct the events that have led to extant squamate karyotypic diversity. The purpose of this study was to anchor the recently sequenced central bearded dragon (Pogona vitticeps) genome to chromosomes to trace the evolution of squamate chromosomes. Assigning sequence to sex chromosomes was of particular interest for identifying candidate sex determining genes. By using two different approaches to map conserved blocks of genes, we were able to anchor approximately 42 % of the dragon genome sequence to chromosomes. We constructed detailed comparative maps between dragon, anole and chicken genomes, and where possible, made broader comparisons across Squamata using cytogenetic mapping information for five other species. We show that squamate macrochromosomes are relatively well conserved between species, supporting findings from previous molecular cytogenetic studies. Macrochromosome diversity between members of the Toxicofera clade has been generated by intrachromosomal, and a small number of interchromosomal, rearrangements. We reconstructed the ancestral squamate macrochromosomes by drawing upon comparative cytogenetic mapping data from seven squamate species and propose the events leading to the arrangements observed in representative species. In addition, we assigned over 8 Mbp of sequence containing 219 genes to the Z chromosome, providing a list of genes to begin testing as candidate sex determining genes. Anchoring of the dragon genome has provided substantial insight into
Hiroshi Miki
2012-02-01
Full Text Available Discrete spectral transformations of skew orthogonal polynomials are presented. From these spectral transformations, it is shown that the corresponding discrete integrable systems are derived both in 1+1 dimension and in 2+1 dimension. Especially in the (2+1-dimensional case, the corresponding system can be extended to 2×2 matrix form. The factorization theorem of the Christoffel kernel for skew orthogonal polynomials in random matrix theory is presented as a by-product of these transformations.
Discrete Localized States and Localization Dynamics in Discrete Nonlinear Schrödinger Equations
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...... are examined. The importance of the existence of stable immobile solitons in the two-dimensional dynamics of the travelling pulses is demonstrated. The process of forming narrow states from initially broad standing or moving excitations through the quasi-collapse mechanism is analyzed. The typical scenario...
Efficient discretization in finite difference method
Rozos, Evangelos; Koussis, Antonis; Koutsoyiannis, Demetris
2015-04-01
Finite difference method (FDM) is a plausible and simple method for solving partial differential equations. The standard practice is to use an orthogonal discretization to form algebraic approximate formulations of the derivatives of the unknown function and a grid, much like raster maps, to represent the properties of the function domain. For example, for the solution of the groundwater flow equation, a raster map is required for the characterization of the discretization cells (flow cell, no-flow cell, boundary cell, etc.), and two raster maps are required for the hydraulic conductivity and the storage coefficient. Unfortunately, this simple approach to describe the topology comes along with the known disadvantages of the FDM (rough representation of the geometry of the boundaries, wasted computational resources in the unavoidable expansion of the grid refinement in all cells of the same column and row, etc.). To overcome these disadvantages, Hunt has suggested an alternative approach to describe the topology, the use of an array of neighbours. This limits the need for discretization nodes only for the representation of the boundary conditions and the flow domain. Furthermore, the geometry of the boundaries is described more accurately using a vector representation. Most importantly, graded meshes can be employed, which are capable of restricting grid refinement only in the areas of interest (e.g. regions where hydraulic head varies rapidly, locations of pumping wells, etc.). In this study, we test the Hunt approach against MODFLOW, a well established finite difference model, and the Finite Volume Method with Simplified Integration (FVMSI). The results of this comparison are examined and critically discussed.
Efficient Associative Computation with Discrete Synapses.
Knoblauch, Andreas
2016-01-01
Neural associative networks are a promising computational paradigm for both modeling neural circuits of the brain and implementing associative memory and Hebbian cell assemblies in parallel VLSI or nanoscale hardware. Previous work has extensively investigated synaptic learning in linear models of the Hopfield type and simple nonlinear models of the Steinbuch/Willshaw type. Optimized Hopfield networks of size n can store a large number of about n(2)/k memories of size k (or associations between them) but require real-valued synapses, which are expensive to implement and can store at most C = 0.72 bits per synapse. Willshaw networks can store a much smaller number of about n(2)/k(2) memories but get along with much cheaper binary synapses. Here I present a learning model employing synapses with discrete synaptic weights. For optimal discretization parameters, this model can store, up to a factor ζ close to one, the same number of memories as for optimized Hopfield-type learning--for example, ζ = 0.64 for binary synapses, ζ = 0.88 for 2 bit (four-state) synapses, ζ = 0.96 for 3 bit (8-state) synapses, and ζ > 0.99 for 4 bit (16-state) synapses. The model also provides the theoretical framework to determine optimal discretization parameters for computer implementations or brainlike parallel hardware including structural plasticity. In particular, as recently shown for the Willshaw network, it is possible to store C(I) = 1 bit per computer bit and up to C(S) = log n bits per nonsilent synapse, whereas the absolute number of stored memories can be much larger than for the Willshaw model.
Quantum cosmology based on discrete Feynman paths
Chew, Geoffrey F.
2002-10-10
Although the rules for interpreting local quantum theory imply discretization of process, Lorentz covariance is usually regarded as precluding time quantization. Nevertheless a time-discretized quantum representation of redshifting spatially-homogeneous universe may be based on discrete-step Feynman paths carrying causal Lorentz-invariant action--paths that not only propagate the wave function but provide a phenomenologically-promising elementary-particle Hilbert-space basis. In a model under development, local path steps are at Planck scale while, at a much larger ''wave-function scale'', global steps separate successive wave-functions. Wave-function spacetime is but a tiny fraction of path spacetime. Electromagnetic and gravitational actions are ''at a distance'' in Wheeler-Feynman sense while strong (color) and weak (isospin) actions, as well as action of particle motion, are ''local'' in a sense paralleling the action of local field theory. ''Nonmaterial'' path segments and ''trivial events'' collaborate to define energy and gravity. Photons coupled to conserved electric charge enjoy privileged model status among elementary fermions and vector bosons. Although real path parameters provide no immediate meaning for ''measurement'', the phase of the complex wave function allows significance for ''information'' accumulated through ''gentle'' electromagnetic events involving charged matter and ''soft'' photons. Through its soft-photon content the wave function is an ''information reservoir''.
A priori discretization error metrics for distributed hydrologic modeling applications
Liu, Hongli; Tolson, Bryan A.; Craig, James R.; Shafii, Mahyar
2016-12-01
Watershed spatial discretization is an important step in developing a distributed hydrologic model. A key difficulty in the spatial discretization process is maintaining a balance between the aggregation-induced information loss and the increase in computational burden caused by the inclusion of additional computational units. Objective identification of an appropriate discretization scheme still remains a challenge, in part because of the lack of quantitative measures for assessing discretization quality, particularly prior to simulation. This study proposes a priori discretization error metrics to quantify the information loss of any candidate discretization scheme without having to run and calibrate a hydrologic model. These error metrics are applicable to multi-variable and multi-site discretization evaluation and provide directly interpretable information to the hydrologic modeler about discretization quality. The first metric, a subbasin error metric, quantifies the routing information loss from discretization, and the second, a hydrological response unit (HRU) error metric, improves upon existing a priori metrics by quantifying the information loss due to changes in land cover or soil type property aggregation. The metrics are straightforward to understand and easy to recode. Informed by the error metrics, a two-step discretization decision-making approach is proposed with the advantage of reducing extreme errors and meeting the user-specified discretization error targets. The metrics and decision-making approach are applied to the discretization of the Grand River watershed in Ontario, Canada. Results show that information loss increases as discretization gets coarser. Moreover, results help to explain the modeling difficulties associated with smaller upstream subbasins since the worst discretization errors and highest error variability appear in smaller upstream areas instead of larger downstream drainage areas. Hydrologic modeling experiments under
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.
Image Compression Using Discrete Wavelet Transform
Mohammad Mozammel Hoque Chowdhury
2012-07-01
Full Text Available Image compression is a key technology in transmission and storage of digital images because of vast data associated with them. This research suggests a new image compression scheme with pruning proposal based on discrete wavelet transformation (DWT. The effectiveness of the algorithm has been justified over some real images, and the performance of the algorithm has been compared with other common compression standards. The algorithm has been implemented using Visual C++ and tested on a Pentium Core 2 Duo 2.1 GHz PC with 1 GB RAM. Experimental results demonstrate that the proposed technique provides sufficient high compression ratios compared to other compression techniques.
Chaos in discrete fractional difference equations
AMEY DESHPANDE; VARSHA DAFTARDAR-GEJJI
2016-10-01
Recently, the discrete fractional calculus (DFC) is receiving attention due to its potential applications in the mathematical modelling of real-world phenomena with memory effects. In the present paper, the chaotic behaviour of fractional difference equations for the tent map, Gauss map and 2x(mod 1) map are studied numerically. We analyse the chaotic behaviour of these fractional difference equations and compare them with their integer counterparts. It is observed that fractional difference equations for the Gauss and tent maps are more stable compared to their integer-order version.
Discrete analog computing with rotor-routers.
Propp, James
2010-09-01
Rotor-routing is a procedure for routing tokens through a network that can implement certain kinds of computation. These computations are inherently asynchronous (the order in which tokens are routed makes no difference) and distributed (information is spread throughout the system). It is also possible to efficiently check that a computation has been carried out correctly in less time than the computation itself required, provided one has a certificate that can itself be computed by the rotor-router network. Rotor-router networks can be viewed as both discrete analogs of continuous linear systems and deterministic analogs of stochastic processes.
Discrete solitons in coupled active lasing cavities
Prilepsky, Jaroslaw E; Johansson, Magnus; Derevyanko, Stanislav A
2012-01-01
We examine the existence and stability of discrete spatial solitons in coupled nonlinear lasing cavities (waveguide resonators), addressing the case of active media, where the gain exceeds damping in the linear limit. A zoo of stable localized structures is found and classified: these are bright and grey cavity solitons with different symmetry. It is shown that several new types of solitons with a nontrivial intensity distribution pattern can emerge in the coupled cavities due to the stability of a periodic extended state. The latter can be stable even when a bistability of homogenous states is absent.
Newnes passive and discrete circuits pocket book
MARSTON, R M
2000-01-01
Newnes Passive and Discrete Circuits Pocket Book is aimed at all engineers, technicians, students and experimenters who can build a design directly from a circuit diagram. In a highly concise form Ray Marston presents a huge compendium of circuits that can be built as they appear, adapted or used as building blocks. The devices used have been carefully chosen for their ease of availability and reasonable price. The selection of devices has been thoroughly updated for the second edition, which has also been expanded to cover the latest ICs.The three sections of the book cover: Moder
Compartmentalization analysis using discrete fracture network models
La Pointe, P.R.; Eiben, T.; Dershowitz, W. [Golder Associates, Redmond, VA (United States); Wadleigh, E. [Marathon Oil Co., Midland, TX (United States)
1997-08-01
This paper illustrates how Discrete Fracture Network (DFN) technology can serve as a basis for the calculation of reservoir engineering parameters for the development of fractured reservoirs. It describes the development of quantitative techniques for defining the geometry and volume of structurally controlled compartments. These techniques are based on a combination of stochastic geometry, computational geometry, and graph the theory. The parameters addressed are compartment size, matrix block size and tributary drainage volume. The concept of DFN models is explained and methodologies to compute these parameters are demonstrated.
Discrete Element Analysis of Huangtupo Landslide
无
2002-01-01
On the basis of the deep geology and the geological structure of Huangtupo landslide, an ancient landslide in the reservoir of the Three Gorges, the geo-environmental model of the landslide is established to analyze quantitatively the sliding mechanism by using the discrete element method. It is concluded that interbedding structure of soft and hard formation consists of the main geological background,which induced the arching of the formation under gravity. Stability analysis of different loadings shows that the ground building weight on the middle slope may restrain the extension of shear sliding zone below, but may activate the foot area which will reduce the safety factor of the front.
Valuation of Discrete Barrier American Options
Carlos Patrício Samanez
2009-09-01
Full Text Available This article presents an approach and a model to valuing discrete barrier American options. The developed model consists of an adaptation of the method of Grant, Vora and Weeks (1997, in order to allow to incorporate the barriers. The Hybrid Quasi-Monte Carlo method was used in the simulations and the Bisection method in the definition of the options trigger curves. The results found in the application of the developed model were compared with the estimated by the Adaptive Mesh Model, developed by Ahn et al (1999. In addition, the sensitivity of the options price relative to changes in inputs parameters was analyzed, confirming the consistence of the model.
Ordinal Welfare Comparisons with Multiple Discrete Indicators
Arndt, Channing; Distante, Roberta; Hussain, M. Azhar;
We develop an ordinal method for making welfare comparisons between populations with multidimensional discrete well-being indicators observed at the micro level. The approach assumes that, for each well-being indicator, the levels can be ranked from worse to better; however, no assumptions are ma...... another on the basis of available binary indicators by drawing upon linear programming theory. These approaches are applied to household survey data from Vietnam and Mozambique with a focus on child poverty comparisons over time and between regions....
Quantum Discrete Cosine Transform for Image Compression
Pang, C Y; Guo, G C; Pang, Chao Yang; Zhou, Zheng Wei; Guo, Guang Can
2006-01-01
Discrete Cosine Transform (DCT) is very important in image compression. Classical 1-D DCT and 2-D DCT has time complexity O(NlogN) and O(N²logN) respectively. This paper presents a quantum DCT iteration, and constructs a quantum 1-D and 2-D DCT algorithm for image compression by using the iteration. The presented 1-D and 2-D DCT has time complexity O(sqrt(N)) and O(N) respectively. In addition, the method presented in this paper generalizes the famous Grover's algorithm to solve complex unstructured search problem.
Discrete cosine transform algorithms, advantages, applications
Rao, K R
1990-01-01
This is the first comprehensive treatment of the theoretical aspects of the discrete cosine transform (DCT), which is being recommended by various standards organizations, such as the CCITT, ISO etc., as the primary compression tool in digital image coding. The main purpose of the book is to provide a complete source for the user of this signal processing tool, where both the basics and the applications are detailed. An extensive bibliography covers both the theory and applications of the DCT. The novice will find the book useful in its self-contained treatment of the theory of the DCT, the de
Proportional hazards models with discrete frailty.
Caroni, Chrys; Crowder, Martin; Kimber, Alan
2010-07-01
We extend proportional hazards frailty models for lifetime data to allow a negative binomial, Poisson, Geometric or other discrete distribution of the frailty variable. This might represent, for example, the unknown number of flaws in an item under test. Zero frailty corresponds to a limited failure model containing a proportion of units that never fail (long-term survivors). Ways of modifying the model to avoid this are discussed. The models are illustrated on a previously published set of data on failures of printed circuit boards and on new data on breaking strengths of samples of cord.
Witnessing Continuous Variable Entanglement with Discrete Measurements
Schneeloch, James; Howland, Gregory A; Broadbent, Curtis J; Howell, John C
2012-01-01
In this Letter, we derive an entropic Einstein-Podolsky-Rosen (EPR) steering inequality for continuous variable (CV) systems using only experimentally measured discrete probability distributions and details of the measurement apparatus. We use this inequality to witness entanglement between the positions and momenta of photon pairs generated in spontaneous parametric downconversion (SPDC). We examine the asymmetry between parties in this inequality, and show that this asymmetry can be used to reduce the technical requirements of experimental setups intended to witness entanglement. Furthermore, we develop a more stringent steering inequality that is symmetric between parties, and use it to witness symmetric EPR steering.
Enriched vibrational resonance in certain discrete systems
A Jeevarekha; M Santhiah; P Philominathan
2014-10-01
We wish to report the occurrence of vibrational resonance in certain discrete systems like sine square map and sine circle map, in a unique fashion, comprising of multiple resonant peaks which pave the way for enrichment. As the systems of our choice are capable of exhibiting vibrational resonance behaviour unlike the earlier reports, they are taken for investigation and the necessary numerical and analytical results are presented. Further, we study the effect of external forcing on various attractors of these systems with appropriate bifurcation and Lyapunov exponent diagrams.
Statistical mechanics of a discrete nonlinear system
Rasmussen; Cretegny; Kevrekidis; Gronbech-Jensen
2000-04-24
Statistical mechanics of the discrete nonlinear Schrodinger equation is studied by means of analytical and numerical techniques. The lower bound of the Hamiltonian permits the construction of standard Gibbsian equilibrium measures for positive temperatures. Beyond the line of T = infinity, we identify a phase transition through a discontinuity in the partition function. The phase transition is demonstrated to manifest itself in the creation of breatherlike localized excitations. Interrelation between the statistical mechanics and the nonlinear dynamics of the system is explored numerically in both regimes.
Angular Distributions of Discrete Mesoscale Mapping Functions
Kroszczyński Krzysztof
2015-08-01
Full Text Available The paper presents the results of analyses of numerical experiments concerning GPS signal propagation delays in the atmosphere and the discrete mapping functions defined on their basis. The delays were determined using data from the mesoscale non-hydrostatic weather model operated in the Centre of Applied Geomatics, Military University of Technology. A special attention was paid to investigating angular characteristics of GPS slant delays for low angles of elevation. The investigation proved that the temporal and spatial variability of the slant delays depends to a large extent on current weather conditions
A discrete transition to advanced mathematics
Richmond, Bettina
2009-01-01
As the title indicates, this book is intended for courses aimed at bridging the gap between lower-level mathematics and advanced mathematics. The text provides a careful introduction to techniques for writing proofs and a logical development of topics based on intuitive understanding of concepts. The authors utilize a clear writing style and a wealth of examples to develop an understanding of discrete mathematics and critical thinking skills. While including many traditional topics, the text offers innovative material throughout. Surprising results are used to motivate the reader. The last thr
Discrete flavor symmetry and minimal seesaw mechanism
Nam, K H; Siyeon, Kim
2011-01-01
This work proposes a neutrino mass model that is derived using the minimal seesaw mechanism which contains only two right-handed neutrinos, under the non-abelian discrete flavor symmetry $\\mathbb{S}_4\\otimes\\mathbb{Z}_2$. Two standard model doublets, $L_\\mu$ and $L_\\tau$, are assigned simultaneously to a $\\mathbf{2}$ representation of $\\mathbb{S}_4$. When the scalar fields introduced in this model, addition to the Standard Model Higgs, and the leptons are coupled within the symmetry, the seesaw mechanism results in the tri-bi-maximal neutrino mixing. This study examined the possible deviations from TBM mixing related to the experimental data.
Finite Volumes Discretization of Topology Optimization Problems
Evgrafov, Anton; Gregersen, Misha Marie; Sørensen, Mads Peter
such a mature and versatile technique for discretiz- ing partial dierential equations in the form of conservation laws of varying types. Advantages of FVMs include the simplicity of implementation, their local conservation properties, and the ease of coupling various PDEs in a multi-physics setting. In fact...... attractive, as all involved PDEs on a given domain are discretized using the same and the low- est possible number of degrees of freedom. In spite of their numerous favourable advantages, FVMs have seen very little adoption within the topology optimization community, where the absolute majority of numerical...
Yu, Jinchen; Peng, Mingshu
2016-10-01
In this paper, a Kaldor-Kalecki model of business cycle with both discrete and distributed delays is considered. With the corresponding characteristic equation analyzed, the local stability of the positive equilibrium is investigated. It is found that there exist Hopf bifurcations when the discrete time delay passes a sequence of critical values. By applying the method of multiple scales, the explicit formulae which determine the direction of Hopf bifurcation and the stability of bifurcating periodic solutions are derived. Finally, numerical simulations are carried out to illustrate our main results.
Mutations of the cluster algebra of type {A}_{1}^{(1)} and the periodic discrete Toda lattice
Nobe, Atsushi
2016-07-01
A direct connection between two sequences of points, one of which is generated by seed mutations of the cluster algebra of type {A}1(1) and the other by time evolutions of the periodic discrete Toda lattice, is explicitly given. In this construction, each of them is realized as an orbit of a QRT map, and specialization of the parameters in the maps and appropriate choices of the initial points relate them. The connection with the periodic discrete Toda lattice enables us a geometric interpretation of the seed mutations of the cluster algebra of type {A}1(1) as an addition of points on an elliptic curve.
Discretization analysis of bifurcation based nonlinear amplifiers
Feldkord, Sven; Reit, Marco; Mathis, Wolfgang
2017-09-01
Recently, for modeling biological amplification processes, nonlinear amplifiers based on the supercritical Andronov-Hopf bifurcation have been widely analyzed analytically. For technical realizations, digital systems have become the most relevant systems in signal processing applications. The underlying continuous-time systems are transferred to the discrete-time domain using numerical integration methods. Within this contribution, effects on the qualitative behavior of the Andronov-Hopf bifurcation based systems concerning numerical integration methods are analyzed. It is shown exemplarily that explicit Runge-Kutta methods transform the truncated normalform equation of the Andronov-Hopf bifurcation into the normalform equation of the Neimark-Sacker bifurcation. Dependent on the order of the integration method, higher order terms are added during this transformation.A rescaled normalform equation of the Neimark-Sacker bifurcation is introduced that allows a parametric design of a discrete-time system which corresponds to the rescaled Andronov-Hopf system. This system approximates the characteristics of the rescaled Hopf-type amplifier for a large range of parameters. The natural frequency and the peak amplitude are preserved for every set of parameters. The Neimark-Sacker bifurcation based systems avoid large computational effort that would be caused by applying higher order integration methods to the continuous-time normalform equations.
Concordance correlation coefficient applied to discrete data.
Carrasco, Josep L; Jover, Lluis
2005-12-30
In any field in which decisions are subject to measurements, interchangeability between the methods used to obtain these measurements is essential. To consider methods as interchangeable, a certain degree of agreement is needed between the measurements they provide. The concordance correlation coefficient is an index that assesses the strength of agreement and it has been widely applied in situations in which measurements are made on a continuous scale. Recently the concordance correlation coefficient has been defined as a specific intraclass correlation coefficient estimated by the variance components of a Normal-Normal mixed linear model. Although this coefficient was defined for the continuous scale case, it may also be used with a discrete scale. In this case the data are often transformed and normalized, and the concordance correlation is applied. This study discusses the expression of the concordance correlation coefficient for discrete Poisson data by means of the Poisson-Normal generalized linear mixed model. The behaviour of the concordance correlation coefficient estimate is assessed by means of a simulation study, in which the estimates were compared using four models: three Normal-Normal mixed models with raw data, log-transformed data and square-root transformed data, and the Poisson-Normal generalized linear mixed model. An example is provided in which two different methods are used to measure CD34+ cells.
Analysis of discretization errors in LES
Ghosal, Sandip
1995-01-01
All numerical simulations of turbulence (DNS or LES) involve some discretization errors. The integrity of such simulations therefore depend on our ability to quantify and control such errors. In the classical literature on analysis of errors in partial differential equations, one typically studies simple linear equations (such as the wave equation or Laplace's equation). The qualitative insight gained from studying such simple situations is then used to design numerical methods for more complex problems such as the Navier-Stokes equations. Though such an approach may seem reasonable as a first approximation, it should be recognized that strongly nonlinear problems, such as turbulence, have a feature that is absent in linear problems. This feature is the simultaneous presence of a continuum of space and time scales. Thus, in an analysis of errors in the one dimensional wave equation, one may, without loss of generality, rescale the equations so that the dependent variable is always of order unity. This is not possible in the turbulence problem since the amplitudes of the Fourier modes of the velocity field have a continuous distribution. The objective of the present research is to provide some quantitative measures of numerical errors in such situations. Though the focus of this work is LES, the methods introduced here can be just as easily applied to DNS. Errors due to discretization of the time-variable are neglected for the purpose of this analysis.
Discrete quantum spectrum of black holes
Lochan, Kinjalk, E-mail: kinjalk@iucaa.in; Chakraborty, Sumanta, E-mail: sumanta@iucaa.in
2016-04-10
The quantum genesis of Hawking radiation is a long-standing puzzle in black hole physics. Semi-classically one can argue that the spectrum of radiation emitted by a black hole look very much sparse unlike what is expected from a thermal object. It was demonstrated through a simple quantum model that a quantum black hole will retain a discrete profile, at least in the weak energy regime. However, it was suggested that this discreteness might be an artifact of the simplicity of eigen-spectrum of the model considered. Different quantum theories can, in principle, give rise to different complicated spectra and make the radiation from black hole dense enough in transition lines, to make them look continuous in profile. We show that such a hope from a geometry-quantized black hole is not realized as long as large enough black holes are dubbed with a classical mass area relation in any gravity theory ranging from GR, Lanczos–Lovelock to f(R) gravity. We show that the smallest frequency of emission from black hole in any quantum description, is bounded from below, to be of the order of its inverse mass. That leaves the emission with only two possibilities. It can either be non-thermal, or it can be thermal only with the temperature being much larger than 1/M.
Emotional Aging: A Discrete Emotions Perspective
Ute eKunzmann
2014-05-01
Full Text Available Perhaps the most important single finding in the field of emotional aging has been that the overall quality of affective experience steadily improves during adulthood and can be maintained into old age. Recent lifespan developmental theories have provided motivation- and experience-based explanations for this phenomenon. These theories suggest that, as individuals grow older, they become increasingly motivated and able to regulate their emotions, which could result in reduced negativity and enhanced positivity. The objective of this paper is to expand existing theories and empirical research on emotional aging by presenting a discrete emotions perspective. To illustrate the usefulness of this approach, we focus on a discussion of the literature examining age differences in anger and sadness. These two negative emotions have been subsumed under the singular concept of negative affect. From a discrete emotions perspective, however, they are highly distinct. Sadness is elicited by an irreversible loss and associated with low situational control, high goal adjustment tendencies, and the motivation to search for social support. The experience of anger, by contrast, is typically triggered by other individuals who intentio