WorldWideScience

Sample records for self-dual codes discrete

  1. An Efficient Construction of Self-Dual Codes

    OpenAIRE

    Lee, Yoonjin; Kim, Jon-Lark

    2012-01-01

    We complete the building-up construction for self-dual codes by resolving the open cases over $GF(q)$ with $q \\equiv 3 \\pmod 4$, and over $\\Z_{p^m}$ and Galois rings $\\GR(p^m,r)$ with an odd prime $p$ satisfying $p \\equiv 3 \\pmod 4$ with $r$ odd. We also extend the building-up construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we construct 945 new extremal self-dual ternary $[32,16,9]$ codes, each ...

  2. Construction of MDS self-dual codes from orthogonal matrices

    OpenAIRE

    Shi, Minjia; Sok, Lin; Solé, Patrick

    2016-01-01

    In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS self-dual codes over both small and large prime fields are constructed.

  3. Hermitian self-dual quasi-abelian codes

    Directory of Open Access Journals (Sweden)

    Herbert S. Palines

    2017-12-01

    Full Text Available Quasi-abelian codes constitute an important class of linear codes containing theoretically and practically interesting codes such as quasi-cyclic codes, abelian codes, and cyclic codes. In particular, the sub-class consisting of 1-generator quasi-abelian codes contains large families of good codes. Based on the well-known decomposition of quasi-abelian codes, the characterization and enumeration of Hermitian self-dual quasi-abelian codes are given. In the case of 1-generator quasi-abelian codes, we offer necessary and sufficient conditions for such codes to be Hermitian self-dual and give a formula for the number of these codes. In the case where the underlying groups are some $p$-groups, the actual number of resulting Hermitian self-dual quasi-abelian codes are determined.

  4. New MDS or near MDS self-dual codes over finite fields

    OpenAIRE

    Tong, Hongxi; Wang, Xiaoqing

    2016-01-01

    The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of $q-$ary MDS self-dual codes for various lengths. There are not existence of $q-$ary MDS self-dual codes of some lengths, even these lengths $< q$. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain many new near MDS isodual codes from extended negacyclic duadic codes and we obtain many new M...

  5. Soft decoding a self-dual (48, 24; 12) code

    Science.gov (United States)

    Solomon, G.

    1993-01-01

    A self-dual (48,24;12) code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix, adding an eighth all-zero column, and then adjoining six dimensions to this extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. A soft decoding using these properties and approximating maximum likelihood is presented here. This is preliminary to a possible soft decoding of the box (72,36;15) code that promises a 7.7-dB theoretical coding under maximum likelihood.

  6. Low Complexity Tail-Biting Trellises for Some Extremal Self-Dual Codes

    OpenAIRE

    Olocco , Grégory; Otmani , Ayoub

    2002-01-01

    International audience; We obtain low complexity tail-biting trellises for some extremal self-dual codes for various lengths and fields such as the [12,6,6] ternary Golay code and a [24,12,8] Hermitian self-dual code over GF(4). These codes are obtained from a particular family of cyclic Tanner graphs called necklace factor graphs.

  7. New extremal binary self-dual codes of lengths 64 and 66 from bicubic planar graphs

    OpenAIRE

    Kaya, Abidin

    2016-01-01

    In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R_2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreover, 10 new codes of length 66 were obtained by applying a building-up construction to the binary codes. Code...

  8. Construction of self-dual codes in the Rosenbloom-Tsfasman metric

    Science.gov (United States)

    Krisnawati, Vira Hari; Nisa, Anzi Lina Ukhtin

    2017-12-01

    Linear code is a very basic code and very useful in coding theory. Generally, linear code is a code over finite field in Hamming metric. Among the most interesting families of codes, the family of self-dual code is a very important one, because it is the best known error-correcting code. The concept of Hamming metric is develop into Rosenbloom-Tsfasman metric (RT-metric). The inner product in RT-metric is different from Euclid inner product that is used to define duality in Hamming metric. Most of the codes which are self-dual in Hamming metric are not so in RT-metric. And, generator matrix is very important to construct a code because it contains basis of the code. Therefore in this paper, we give some theorems and methods to construct self-dual codes in RT-metric by considering properties of the inner product and generator matrix. Also, we illustrate some examples for every kind of the construction.

  9. Self-dual form of Ruijsenaars–Schneider models and ILW equation with discrete Laplacian

    Directory of Open Access Journals (Sweden)

    A. Zabrodin

    2018-02-01

    Full Text Available We discuss a self-dual form or the Bäcklund transformations for the continuous (in time variable glN Ruijsenaars–Schneider model. It is based on the first order equations in N+M complex variables which include N positions of particles and M dual variables. The latter satisfy equations of motion of the glM Ruijsenaars–Schneider model. In the elliptic case it holds M=N while for the rational and trigonometric models M is not necessarily equal to N. Our consideration is similar to the previously obtained results for the Calogero–Moser models which are recovered in the non-relativistic limit. We also show that the self-dual description of the Ruijsenaars–Schneider models can be derived from complexified intermediate long wave equation with discrete Laplacian by means of the simple pole ansatz likewise the Calogero–Moser models arise from ordinary intermediate long wave and Benjamin–Ono equations.

  10. Discrete Sparse Coding.

    Science.gov (United States)

    Exarchakis, Georgios; Lücke, Jörg

    2017-11-01

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

  11. Criticality of the discrete N-vector ferromagnet in planar self-dual lattices

    International Nuclear Information System (INIS)

    Mariz, A.M.; Silva, L.R. da; Stella, A.; Tsallis, C.

    1989-01-01

    An extended version of the discrete N-vector (or cubic) ferromagnetic model withon a real space renormalization group approach which preserves the two-spin correlation function is studied. The N-evolution (for real values of N) of the Wheatstone-bridge hierarchical lattice phase diagram, which presents paramagnetic, intermediate (nematic-like) and ferromagnetic phases, as well as of the thermal υ and crossover φ critical exponents, is presented. The self-avoiding walk problem is recovered in the N → O limit, and the so called ''corner-rule'' is reobtained in a larger context. The Ising, N- and 2N-state Potts ferromagnets are recovered as particular cases. An interchange of stability occurs at N=N* ≅ 6.9 in such a way that the 2N-state Potts special point (were all three existing phases join) is a multicritical one if N N* (consistently φ(N*)=O). For the cubic model, υ(N) presents a maximum at N=N max ≅1.5. The results are exact, for all N, for the Wheatstone-bridge hierarchical lattice, and approximate, for N≤ 2, for the square lattice. The connection between the present approach and the phenomenological renormalization group, is discussed. (author) [pt

  12. Lee weight enumerators of self-dual codes and theta functions

    NARCIS (Netherlands)

    Asch, van A.G.; Martens, F.J.L.

    2008-01-01

    The theory of modular forms, in particular theta functions, and coding theory are in a remarkable way connected. The connection is established by defining a suitable lattice corresponding to the given code, and considering its theta function. First we define some special theta functions, and

  13. A note on the minimum Lee distance of certain self-dual modular codes

    NARCIS (Netherlands)

    Asch, van A.G.; Martens, F.J.L.

    2012-01-01

    In a former paper we investigated the connection between p -ary linear codes, p prime, and theta functions. Corresponding to a given code a suitable lattice and its associated theta function were defined. Using results from the theory of modular forms we got an algorithm to determine an upper bound

  14. Self-dual random-plaquette gauge model and the quantum toric code

    Science.gov (United States)

    Takeda, Koujin; Nishimori, Hidetoshi

    2004-05-01

    We study the four-dimensional Z2 random-plaquette lattice gauge theory as a model of topological quantum memory, the toric code in particular. In this model, the procedure of quantum error correction works properly in the ordered (Higgs) phase, and phase boundary between the ordered (Higgs) and disordered (confinement) phases gives the accuracy threshold of error correction. Using self-duality of the model in conjunction with the replica method, we show that this model has exactly the same mathematical structure as that of the two-dimensional random-bond Ising model, which has been studied very extensively. This observation enables us to derive a conjecture on the exact location of the multicritical point (accuracy threshold) of the model, pc=0.889972…, and leads to several nontrivial results including bounds on the accuracy threshold in three dimensions.

  15. Self-dual random-plaquette gauge model and the quantum toric code

    International Nuclear Information System (INIS)

    Takeda, Koujin; Nishimori, Hidetoshi

    2004-01-01

    We study the four-dimensional Z 2 random-plaquette lattice gauge theory as a model of topological quantum memory, the toric code in particular. In this model, the procedure of quantum error correction works properly in the ordered (Higgs) phase, and phase boundary between the ordered (Higgs) and disordered (confinement) phases gives the accuracy threshold of error correction. Using self-duality of the model in conjunction with the replica method, we show that this model has exactly the same mathematical structure as that of the two-dimensional random-bond Ising model, which has been studied very extensively. This observation enables us to derive a conjecture on the exact location of the multicritical point (accuracy threshold) of the model, p c =0.889972..., and leads to several nontrivial results including bounds on the accuracy threshold in three dimensions

  16. spinning self-dual particles

    International Nuclear Information System (INIS)

    Gamboa, J.; Rivelles, V.O.

    1989-01-01

    Self-dual particles in two-dimensions are presented. They were obtained from chiral boson particle by square root technique. The propagator of spinning self-dual particle is calculated using the BFV formalism. (M.C.K.)

  17. Self-dual Hopf quivers

    International Nuclear Information System (INIS)

    Huang Hualin; Li Libin; Ye Yu

    2004-07-01

    We study pointed graded self-dual Hopf algebras with a help of the dual Gabriel theorem for pointed Hopf algebras. Quivers of such Hopf algebras are said to be self-dual. An explicit classification of self-dual Hopf quivers is obtained. We also prove that finite dimensional coradically graded pointed self-dual Hopf algebras are generated by group-like and skew-primitive elements as associative algebras. This partially justifies a conjecture of Andruskiewitsch and Schneider and may help to classify finite dimensional self-dual pointed Hopf algebras

  18. Spinning self-dual particles

    International Nuclear Information System (INIS)

    Gamboa, J.; Rivelles, V.O.

    1989-02-01

    We study spinning self-dual particles in two dimensions. They are obtained from the chiral bosonic particle through the square root technique. We show that the resulting field theory can be either fermionic or bosonic and that the associated self-dual field reveals its Lorentz tensor structure which remains hidden in the usual formulations. We also calculate the spinning self-dual particle propagators using the BFV formalism. (author) [pt

  19. Self-dual metrics with self-dual Killing vectors

    International Nuclear Information System (INIS)

    Tod, K.P.; Ward, R.S.

    1979-01-01

    Twistor methods are used to derive a class of solutions to Einstein's vacuum equations, with anti-self dual Weyl tensor. In particular, all metrics with a Killing vector whose derivative is anti-self-dual and which admit a real positive-definite section are exhibited and shown to coincide with the metrics of Hawking. (author)

  20. Multidimensional electron-photon transport with standard discrete ordinates codes

    International Nuclear Information System (INIS)

    Drumm, C.R.

    1995-01-01

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

  1. Data visualization for ONEDANT and TWODANT discrete ordinates codes

    International Nuclear Information System (INIS)

    Lee, C.L.

    1993-01-01

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

  2. An Application of Discrete Mathematics to Coding Theory.

    Science.gov (United States)

    Donohoe, L. Joyce

    1992-01-01

    Presents a public-key cryptosystem application to introduce students to several topics in discrete mathematics. A computer algorithms using recursive methods is presented to solve a problem in which one person wants to send a coded message to a second person while keeping the message secret from a third person. (MDH)

  3. Multidimensional electron-photon transport with standard discrete ordinates codes

    International Nuclear Information System (INIS)

    Drumm, C.R.

    1997-01-01

    A method is described for generating electron cross sections that are comparable with standard discrete ordinates codes without modification. There are many advantages of using an established discrete ordinates solver, e.g. immediately available adjoint capability. Coupled electron-photon transport capability is needed for many applications, including the modeling of the response of electronics components to space and man-made radiation environments. The cross sections have been successfully used in the DORT, TWODANT and TORT discrete ordinates codes. The cross sections are shown to provide accurate and efficient solutions to certain multidimensional electron-photon transport problems. The key to the method is a simultaneous solution of the continuous-slowing-down (CSD) portion and elastic-scattering portion of the scattering source by the Goudsmit-Saunderson theory. The resulting multigroup-Legendre cross sections are much smaller than the true scattering cross sections that they represent. Under certain conditions, the cross sections are guaranteed positive and converge with a low-order Legendre expansion

  4. Multidimensional electron-photon transport with standard discrete ordinates codes

    International Nuclear Information System (INIS)

    Drumm, C.R.

    1997-01-01

    A method is described for generating electron cross sections that are compatible with standard discrete ordinates codes without modification. There are many advantages to using an established discrete ordinates solver, e.g., immediately available adjoint capability. Coupled electron-photon transport capability is needed for many applications, including the modeling of the response of electronics components to space and synthetic radiation environments. The cross sections have been successfully used in the DORT, TWODANT, and TORT discrete ordinates codes. The cross sections are shown to provide accurate and efficient solutions to certain multidimensional electron-photon transport problems. The key to the method is a simultaneous solution of the continuous-slowing-down and elastic-scattering portions of the scattering source by the Goudsmit-Saunderson theory. The resulting multigroup-Legendre cross sections are much smaller than the true scattering cross sections that they represent. Under certain conditions, the cross sections are guaranteed positive and converge with a low-order Legendre expansion

  5. Adaptive discrete cosine transform coding algorithm for digital mammography

    Science.gov (United States)

    Baskurt, Atilla M.; Magnin, Isabelle E.; Goutte, Robert

    1992-09-01

    The need for storage, transmission, and archiving of medical images has led researchers to develop adaptive and efficient data compression techniques. Among medical images, x-ray radiographs of the breast are especially difficult to process because of their particularly low contrast and very fine structures. A block adaptive coding algorithm based on the discrete cosine transform to compress digitized mammograms is described. A homogeneous repartition of the degradation in the decoded images is obtained using a spatially adaptive threshold. This threshold depends on the coding error associated with each block of the image. The proposed method is tested on a limited number of pathological mammograms including opacities and microcalcifications. A comparative visual analysis is performed between the original and the decoded images. Finally, it is shown that data compression with rather high compression rates (11 to 26) is possible in the mammography field.

  6. Self-dual gauge theories

    International Nuclear Information System (INIS)

    Zet, G.

    2002-01-01

    The self-duality equations are important in gauge theories because they show the connection between gauge models with internal symmetry groups and gauge theory of gravity. They are differential equations of the first order and it is easier to investigate the solutions for different particular configurations of the gauge fields and of space-times.One of the most important property of the self-duality equations is that they imply the Yang-Mills field equations. In this paper we will prove this property for the general case of a gauge theory with compact Lie group of symmetry over a 4-dimensional space-time manifold. It is important to remark that there are 3m independent self-duality equations (of the first order) while the number of Yang-Mills equations is equal to 4m, where m is the dimension of the gauge group. Both of them have 4m unknown functions which are the gauge potentials A μ a (x), a = 1, 2, ....,m; μ = 0, 1, 2, 3. But, we have, in addition, m gauge conditions for A μ a (x), (for example Coulomb, Lorentz or axial gauge) which together with the selfduality equation constitute a system of 4m equations. The Bianchi identities for the self-dual stress tensor F μν a coincide with the Yang-Mills equations and do not imply therefore supplementary conditions. We use the axial gauge in order to obtain the self duality equations for a SU(2) gauge theory over a curved space-time. The compatibility between self-duality and Yang-Mills equations is studied and some classes of solutions are obtained. In fact, we will write the Einstein-Yang-Mills equations and we will analyse only the Yang-Mills sector. The Einstein equations can not be obtained of course from self-duality. They should be obtained if we would consider a gauge theory having P x SU(2) as symmetry group, where P is the Poincare group. More generally, a gauge theory of N-extended supersymmetry can be developed by imposing the self-duality condition. (author)

  7. Non-self-dual nonlinear gravitons

    International Nuclear Information System (INIS)

    Yasskin, P.B.; Isenberg, J.A.

    1982-01-01

    Penrose has given a twistor description of all self-dual complex Riemannian space-times. This construction is modified to characterize all complex Riemannian space-times and all complex teleparallel space-times. This construction may be useful in finding non-self-dual solutions to the gravitational field equations (Einstein's or otherwise) without or with sources. It may also lead to a nonperturbative method for computing path integrals. Whereas Penrose shows that a self-dual space-time may be specified by a deformation of projective twistor space (the set of α planes in complex Minkowski space), it is found that a Riemannian or teleparallel space-time may be described by a deformation of projective ambitwistor space (the set of null geodesics in complex Minkowski space). (author)

  8. Streamline processing of discrete nuclear spectra by means of authoregularized iteration process (the KOLOBOK code)

    International Nuclear Information System (INIS)

    Gadzhokov, V.; Penev, I.; Aleksandrov, L.

    1979-01-01

    A brief description of the KOLOBOK computer code designed for streamline processing of discrete nuclear spectra with symmetric Gaussian shape of the single line on computers of the ES series, models 1020 and above, is given. The program solves the stream of discrete-spectrometry generated nonlinear problems by means of authoregularized iteration process. The Fortran-4 text of the code is reported in an Appendix

  9. Twisted covariant noncommutative self-dual gravity

    International Nuclear Information System (INIS)

    Estrada-Jimenez, S.; Garcia-Compean, H.; Obregon, O.; Ramirez, C.

    2008-01-01

    A twisted covariant formulation of noncommutative self-dual gravity is presented. The formulation for constructing twisted noncommutative Yang-Mills theories is used. It is shown that the noncommutative torsion is solved at any order of the θ expansion in terms of the tetrad and some extra fields of the theory. In the process the first order expansion in θ for the Plebanski action is explicitly obtained.

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

    Science.gov (United States)

    Hua, Wei; Wang, Jiasong; Zhao, Jian

    2014-01-01

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

  11. Generating Importance Map for Geometry Splitting using Discrete Ordinates Code in Deep Shielding Problem

    International Nuclear Information System (INIS)

    Kim, Jong Woon; Lee, Young Ouk

    2016-01-01

    When we use MCNP code for a deep shielding problem, we prefer to use variance reduction technique such as geometry splitting, or weight window, or source biasing to have relative error within reliable confidence interval. To generate importance map for geometry splitting in MCNP calculation, we should know the track entering number and previous importance on each cells since a new importance is calculated based on these information. If a problem is deep shielding problem such that we have zero tracks entering on a cell, we cannot generate new importance map. In this case, discrete ordinates code can provide information to generate importance map easily. In this paper, we use AETIUS code as a discrete ordinates code. Importance map for MCNP is generated based on a zone average flux of AETIUS calculation. The discretization of space, angle, and energy is not necessary for MCNP calculation. This is the big merit of MCNP code compared to the deterministic code. However, deterministic code (i.e., AETIUS) can provide a rough estimate of the flux throughout a problem relatively quickly. This can help MCNP by providing variance reduction parameters. Recently, ADVANTG code is released. This is an automated tool for generating variance reduction parameters for fixed-source continuous-energy Monte Carlo simulations with MCNP5 v1.60

  12. Timing comparison of two-dimensional discrete-ordinates codes for criticality calculations

    International Nuclear Information System (INIS)

    Miller, W.F. Jr.; Alcouffe, R.E.; Bosler, G.E.; Brinkley, F.W. Jr.; O'dell, R.D.

    1979-01-01

    The authors compare two-dimensional discrete-ordinates neutron transport computer codes to solve reactor criticality problems. The fundamental interest is in determining which code requires the minimum Central Processing Unit (CPU) time for a given numerical model of a reasonably realistic fast reactor core and peripherals. The computer codes considered are the most advanced available and, in three cases, are not officially released. The conclusion, based on the study of four fast reactor core models, is that for this class of problems the diffusion synthetic accelerated version of TWOTRAN, labeled TWOTRAN-DA, is superior to the other codes in terms of CPU requirements

  13. CEPXS/ONELD: A one-dimensional coupled electron-photon discrete ordinates code package

    International Nuclear Information System (INIS)

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

    1992-01-01

    CEPXS/ONELD is a discrete ordinates transport code package that can model the electron-photon cascade from 100 MeV to 1 keV. The CEPXS code generates fully-coupled multigroup-Legendre cross section data. This data is used by the general-purpose discrete ordinates code, ONELD, which is derived from the Los Alamos ONEDANT and ONBTRAN codes. Version 1.0 of CEPXS/ONELD was released in 1989 and has been primarily used to analyze the effect of radiation environments on electronics. Version 2.0 is under development and will include user-friendly features such as the automatic selection of group structure, spatial mesh structure, and S N order

  14. Self-dual monopoles and toda molecules

    Science.gov (United States)

    Ganoulis, N.; Goddard, P.; Olive, D.

    1982-07-01

    Stable static solutions to a gauge field theory with a Higgs field in the adjoint representation and with vanishing self-coupling are self-dual in the sense of Bogomolny. Leznov and Saveliev showed that a specific form of spherical symmetry reduces these equations to a modified form of the Toda molecule equations associated with the overall gauge symmetry G. Values of the constants of integration are found in terms of the distant Higgs field, guaranteeing regularity of the solution at the origin. The expressions hold for any simple Lie group G, depending on G via its root system.

  15. Review of finite fields: Applications to discrete Fourier, transforms and Reed-Solomon coding

    Science.gov (United States)

    Wong, J. S. L.; Truong, T. K.; Benjauthrit, B.; Mulhall, B. D. L.; Reed, I. S.

    1977-01-01

    An attempt is made to provide a step-by-step approach to the subject of finite fields. Rigorous proofs and highly theoretical materials are avoided. The simple concepts of groups, rings, and fields are discussed and developed more or less heuristically. Examples are used liberally to illustrate the meaning of definitions and theories. Applications include discrete Fourier transforms and Reed-Solomon coding.

  16. BALTORO a general purpose code for coupling discrete ordinates and Monte-Carlo radiation transport calculations

    International Nuclear Information System (INIS)

    Zazula, J.M.

    1983-01-01

    The general purpose code BALTORO was written for coupling the three-dimensional Monte-Carlo /MC/ with the one-dimensional Discrete Ordinates /DO/ radiation transport calculations. The quantity of a radiation-induced /neutrons or gamma-rays/ nuclear effect or the score from a radiation-yielding nuclear effect can be analysed in this way. (author)

  17. The discrete-dipole-approximation code ADDA: capabilities and known limitations

    NARCIS (Netherlands)

    Yurkin, M.A.; Hoekstra, A.G.

    2011-01-01

    The open-source code ADDA is described, which implements the discrete dipole approximation (DDA), a method to simulate light scattering by finite 3D objects of arbitrary shape and composition. Besides standard sequential execution, ADDA can run on a multiprocessor distributed-memory system,

  18. Warped Discrete Cosine Transform-Based Low Bit-Rate Block Coding Using Image Downsampling

    Directory of Open Access Journals (Sweden)

    Ertürk Sarp

    2007-01-01

    Full Text Available This paper presents warped discrete cosine transform (WDCT-based low bit-rate block coding using image downsampling. While WDCT aims to improve the performance of conventional DCT by frequency warping, the WDCT has only been applicable to high bit-rate coding applications because of the overhead required to define the parameters of the warping filter. Recently, low bit-rate block coding based on image downsampling prior to block coding followed by upsampling after the decoding process is proposed to improve the compression performance for low bit-rate block coders. This paper demonstrates that a superior performance can be achieved if WDCT is used in conjunction with image downsampling-based block coding for low bit-rate applications.

  19. Conformal transformation and symplectic structure of self-dual fields

    International Nuclear Information System (INIS)

    Yang Kongqing; Luo Yan

    1996-01-01

    Considered two dimensional self-dual fields, the symplectic structure on the space of solutions is given. It is shown that this structure is Poincare invariant. The Lagrangian of two dimensional self-dual field is invariant under infinite one component conformal group, then this symplectic structure is also invariant under this conformal group. The conserved currents in geometrical formalism are also obtained

  20. STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM

    Directory of Open Access Journals (Sweden)

    H. Prashantha Kumar

    2012-03-01

    Full Text Available The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decoding of block codes using tree structure. Many good block codes are presently known. Several of them have been used in applications ranging from deep space communication to error control in storage systems. But the primary difficulty with applying Viterbi or BCJR algorithms to decode of block codes is that, even though they are optimum decoding methods, the promised bit error rates are not achieved in practice at data rates close to capacity. This is because the decoding effort is fixed and grows with block length, and thus only short block length codes can be used. Therefore, an important practical question is whether a suboptimal realizable soft decision decoding method can be found for block codes. A noteworthy result which provides a partial answer to this question is described in the following sections. This result of near optimum decoding will be used as motivation for the investigation of different soft decision decoding methods for linear block codes which can lead to the development of efficient decoding algorithms. The code tree can be treated as an expanded version of the trellis, where every path is totally distinct from every other path. We have derived the tree structure for (8, 4 and (16, 11 extended Hamming codes and have succeeded in implementing the soft decision stack algorithm to decode them. For the discrete memoryless channel, gains in excess of 1.5dB at a bit error rate of 10-5 with respect to conventional hard decision decoding are demonstrated for these codes.

  1. Near-Capacity Coding for Discrete Multitone Systems with Impulse Noise

    Directory of Open Access Journals (Sweden)

    Kschischang Frank R

    2006-01-01

    Full Text Available We consider the design of near-capacity-achieving error-correcting codes for a discrete multitone (DMT system in the presence of both additive white Gaussian noise and impulse noise. Impulse noise is one of the main channel impairments for digital subscriber lines (DSL. One way to combat impulse noise is to detect the presence of the impulses and to declare an erasure when an impulse occurs. In this paper, we propose a coding system based on low-density parity-check (LDPC codes and bit-interleaved coded modulation that is capable of taking advantage of the knowledge of erasures. We show that by carefully choosing the degree distribution of an irregular LDPC code, both the additive noise and the erasures can be handled by a single code, thus eliminating the need for an outer code. Such a system can perform close to the capacity of the channel and for the same redundancy is significantly more immune to the impulse noise than existing methods based on an outer Reed-Solomon (RS code. The proposed method has a lower implementation complexity than the concatenated coding approach.

  2. The three-dimensional, discrete ordinates neutral particle transport code TORT: An overview

    International Nuclear Information System (INIS)

    Azmy, Y.Y.

    1996-01-01

    The centerpiece of the Discrete Ordinates Oak Ridge System (DOORS), the three-dimensional neutral particle transport code TORT is reviewed. Its most prominent features pertaining to large applications, such as adjustable problem parameters, memory management, and coarse mesh methods, are described. Advanced, state-of-the-art capabilities including acceleration and multiprocessing are summarized here. Future enhancement of existing graphics and visualization tools is briefly presented

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

    International Nuclear Information System (INIS)

    Morel, J.E.

    1987-01-01

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

  4. Verification of three dimensional triangular prismatic discrete ordinates transport code ENSEMBLE-TRIZ by comparison with Monte Carlo code GMVP

    International Nuclear Information System (INIS)

    Homma, Y.; Moriwaki, H.; Ikeda, K.; Ohdi, S.

    2013-01-01

    This paper deals with the verification of the 3 dimensional triangular prismatic discrete ordinates transport calculation code ENSEMBLE-TRIZ by comparison with the multi-group Monte Carlo calculation code GMVP in a large fast breeder reactor. The reactor is a 750 MWe electric power sodium cooled reactor. Nuclear characteristics are calculated at the beginning of cycle of an initial core and at the beginning and the end of cycle of an equilibrium core. According to the calculations, the differences between the two methodologies are smaller than 0.0002 Δk in the multiplication factor, relatively about 1% in the control rod reactivity, and 1% in the sodium void reactivity. (authors)

  5. Discrete-ordinates electron transport calculations using standard neutron transport codes

    International Nuclear Information System (INIS)

    Morel, J.E.

    1979-01-01

    The primary purpose of this work was to develop a method for using standard neutron transport codes to perform electron transport calculations. The method is to develop approximate electron cross sections which are sufficiently well-behaved to be treated with standard S/sub n/ methods, but which nonetheless yield flux solutions which are very similar to the exact solutions. The main advantage of this approach is that, once the approximate cross sections are constructed, their multigroup Legendre expansion coefficients can be calculated and input to any standard S/sub n/ code. Discrete-ordinates calculations were performed to determine the accuracy of the flux solutions for problems corresponding to 1.0-MeV electrons incident upon slabs of aluminum and gold. All S/sub n/ calculations were compared with similar calculations performed with an electron Monte Carlo code, considered to be exact. In all cases, the discrete-ordinates solutions for integral flux quantities (i.e., scalar flux, energy deposition profiles, etc.) are generally in agreement with the Monte Carlo solutions to within approximately 5% or less. The central conclusion is that integral electron flux quantities can be efficiently and accurately calculated using standard S/sub n/ codes in conjunction with approximate cross sections. Furthermore, if group structures and approximate cross section construction are optimized, accurate differential flux energy spectra may also be obtainable without having to use an inordinately large number of energy groups. 1 figure

  6. Kaehler-Dirac ghosts for self-dual fields

    International Nuclear Information System (INIS)

    Labastida, J.M.F.; Pernici, M.

    1988-01-01

    We present the generalization to spacetime dimension D=4n+2 of the Lorentz covariant quadratic lagrangian for pairs of (anti)self-dual fields previously obtained by the authors in D=2. In the process of BRST quantizing this lagrangian a first-order quadratic lagrangian for ghost (anti)self-dual fields is found which, after gauge fixing, can be written in terms of bispinors and it turns out to be a Kaehler-Dirac lagrangian. The coupling to gravity is straightforward and the gravitational anomaly due to (anti)self-dual fields is obtained directly from an action principle. (orig.)

  7. Pin cell discontinuity factors in the transient 3-D discrete ordinates code TORT-TD - 237

    International Nuclear Information System (INIS)

    Seubert, A.

    2010-01-01

    This paper describes the application of generalized equivalence theory to the time-dependent 3-D discrete ordinates neutron transport code TORT-TD. The introduction of pin cell discontinuity factors into the discrete ordinates transport equation is described by assuming a linear dependence of the homogenized neutron angular flux within a pin cell which may be discontinuous at the interfaces to adjacent cells. The homogenized flux discontinuity at cell interfaces is expressed by pin cell discontinuity factors which in turn are determined from fuel assembly lattice calculations using HELIOS. Application of TORT-TD to the all rods in state of the PWR MOX/UO 2 Core Transient Benchmark with pin cell homogenized nuclear cross sections demonstrate the potential of pin cell discontinuity factors to reduce pin cell homogenization errors. (authors)

  8. Coding Model and Mapping Method of Spherical Diamond Discrete Grids Based on Icosahedron

    Directory of Open Access Journals (Sweden)

    LIN Bingxian

    2016-12-01

    Full Text Available Discrete Global Grid(DGG provides a fundamental environment for global-scale spatial data's organization and management. DGG's encoding scheme, which blocks coordinate transformation between different coordination reference frames and reduces the complexity of spatial analysis, contributes a lot to the multi-scale expression and unified modeling of spatial data. Compared with other kinds of DGGs, Diamond Discrete Global Grid(DDGG based on icosahedron is beneficial to the spherical spatial data's integration and expression for much better geometric properties. However, its structure seems more complicated than DDGG on octahedron due to its initial diamond's edges cannot fit meridian and parallel. New challenges are posed when it comes to the construction of hierarchical encoding system and mapping relationship with geographic coordinates. On this issue, this paper presents a DDGG's coding system based on the Hilbert curve and designs conversion methods between codes and geographical coordinates. The study results indicate that this encoding system based on the Hilbert curve can express space scale and location information implicitly with the similarity between DDG and planar grid put into practice, and balances efficiency and accuracy of conversion between codes and geographical coordinates in order to support global massive spatial data's modeling, integrated management and all kinds of spatial analysis.

  9. Interference of Spin-2 Self-Dual Modes

    OpenAIRE

    Ilha, Anderson; Wotzasek, Clovis

    2001-01-01

    We study the effects of interference between the self-dual and anti self-dual massive modes of the linearized Einstein-Chern-Simons topological gravity. The dual models to be used in the interference process are carefully analyzed with special emphasis on their propagating spectrum. We identify the opposite dual aspects, necessary for the application of the interference formalism on this model. The soldered theory so obtained displays explicitly massive modes of the Proca type. It may also be...

  10. Self-dual solutions to Euclidean Yang-Mills equations

    International Nuclear Information System (INIS)

    Corrigan, E.

    1979-01-01

    The paper provides an introduction to two approaches towards understanding the classical Yang-Mills field equations. On the one hand, the work of Atiyah and Ward showed that the self-dual equations, which are non-linear, could be regarded as a set of linear equations which turned out to be related to each other by Baecklund transformations. Fundamental to their procedure was the observation that the information carried by the vector potential could be coded into the structure of certain analytic vector bundles over a three dimensional projective space. The classification of these bundles and the subsequent recovery of the gauge field led to the infinite set of ansaetze, corresponding to the sets of linear equation mentioned already. On the other hand, Atiyah, Hitchin, Drinfeld and Manin have recently constructed, completely algebraically, the bundles of interest and indicated how the Yang-Mills potential may be obtained. Remarkably, their construction differs very little as the gauge group is changed (to any of the classical compact groups) and, uses only the elementary operations of linear algebra to yield potentials as rational functions of the spatial coordinates. (Auth.)

  11. A Complete Video Coding Chain Based on Multi-Dimensional Discrete Cosine Transform

    Directory of Open Access Journals (Sweden)

    T. Fryza

    2010-09-01

    Full Text Available The paper deals with a video compression method based on the multi-dimensional discrete cosine transform. In the text, the encoder and decoder architectures including the definitions of all mathematical operations like the forward and inverse 3-D DCT, quantization and thresholding are presented. According to the particular number of currently processed pictures, the new quantization tables and entropy code dictionaries are proposed in the paper. The practical properties of the 3-D DCT coding chain compared with the modern video compression methods (such as H.264 and WebM and the computing complexity are presented as well. It will be proved the best compress properties could be achieved by complex H.264 codec. On the other hand the computing complexity - especially on the encoding side - is lower for the 3-D DCT method.

  12. Non-trivial self-dual gluon configurations in lattice QCD

    International Nuclear Information System (INIS)

    Bilson-Thompson, S.; Bowman, P.; Bonnet, F.; Leinweber, D.; Williams, A.; Dunne, G.

    2000-01-01

    Full text: We have investigated the smoothing of gauge fields in SU(3) using a variety of cooling algorithms. A topic of particular interest to such investigations is the behaviour of self-dual field configurations over a large number of cooling sweeps. It is well known that cooling based upon the standard Wilson action is affected by excessively large discretisation errors, leading in the long-term to trivial configurations. This has shifted the research emphasis onto improved actions, which are designed to minimise the discretisation errors that arise on the lattice. The cooling schemes we have investigated have been designed to eliminate O(a 2 ) and O(a 4 ) discretization errors producing an action accurate to order O(a 6 ). An analogously defined improved topological charge operator is used to investigate vacuum instanton dynamics. We used these operators to construct self-dual gluon configurations by cooling until the duality condition S/S 0 |Q| (where S 0 is the single instanton action and Q is the topological charge) is reached. As it is expected from theoretical grounds that Q is always an integer, a range of different actions and topological charge operators are assessed to determine which combination produced a result closest to what we would expect in the continuum. As our lattices have (untwisted) periodic boundary conditions we are particularly interested in investigating the relevance of the Nahm transformation to our results. This is a duality transformation which maps a self-dual SU(N) configuration with topological charge Q on the 4-torus to a self-dual SU(Q) configuration with topological charge N on the dual 4-torus. As there are no instanton solutions in SU(1), the Nahm transformation appears to preclude the existence of a |Q| = 1 self-dual solution on the 4-torus. We have investigated this on the lattice by finding |Q| = 1 configurations and assessing the behaviour of the action and the stability of the topological charge as they cool towards

  13. Euclidean supersymmetric solutions with the self-dual Weyl tensor

    Directory of Open Access Journals (Sweden)

    Masato Nozawa

    2017-07-01

    Full Text Available We explore the Euclidean supersymmetric solutions admitting the self-dual gauge field in the framework of N=2 minimal gauged supergravity in four dimensions. According to the classification scheme utilizing the spinorial geometry or the bilinears of Killing spinors, the general solution preserves one quarter of supersymmetry and is described by the Przanowski–Tod class with the self-dual Weyl tensor. We demonstrate that there exists an additional Killing spinor, provided the Przanowski–Tod metric admits a Killing vector that commutes with the principal one. The proof proceeds by recasting the metric into another Przanowski–Tod form. This formalism enables us to show that the self-dual Reissner–Nordström–Taub–NUT–AdS metric possesses a second Killing spinor, which has been missed over many years. We also address the supersymmetry when the Przanowski–Tod space is conformal to each of the self-dual ambi-toric Kähler metrics. It turns out that three classes of solutions are all reduced to the self-dual Carter family, by virtue of the nondegenerate Killing–Yano tensor.

  14. On the scalar curvature of self-dual manifolds

    International Nuclear Information System (INIS)

    Kim, J.

    1992-08-01

    We generalize LeBrun's explicit ''hyperbolic ansatz'' construction of self-dual metrics on connected sums of conformally flat manifolds and CP 2 's through a systematic use of the theory of hyperbolic geometry and Kleinian groups. (This construction produces, for example, all self-dual manifolds with semi-free S 1 -action and with either nonnegative scalar curvature or positive-definite intersection form.) We then point out a simple criterion for determining the sign of the scalar curvature of these conformal metrics. Exploiting this, we then show that the sign of the scalar curvature can change on connected components of the moduli space of self-dual metrics, thereby answering a question raised by King and Kotschick. (author). Refs

  15. The discrete-dipole-approximation code ADDA: Capabilities and known limitations

    International Nuclear Information System (INIS)

    Yurkin, Maxim A.; Hoekstra, Alfons G.

    2011-01-01

    The open-source code ADDA is described, which implements the discrete dipole approximation (DDA), a method to simulate light scattering by finite 3D objects of arbitrary shape and composition. Besides standard sequential execution, ADDA can run on a multiprocessor distributed-memory system, parallelizing a single DDA calculation. Hence the size parameter of the scatterer is in principle limited only by total available memory and computational speed. ADDA is written in C99 and is highly portable. It provides full control over the scattering geometry (particle morphology and orientation, and incident beam) and allows one to calculate a wide variety of integral and angle-resolved scattering quantities (cross sections, the Mueller matrix, etc.). Moreover, ADDA incorporates a range of state-of-the-art DDA improvements, aimed at increasing the accuracy and computational speed of the method. We discuss both physical and computational aspects of the DDA simulations and provide a practical introduction into performing such simulations with the ADDA code. We also present several simulation results, in particular, for a sphere with size parameter 320 (100-wavelength diameter) and refractive index 1.05.

  16. The TORT three-dimensional discrete ordinates neutron/photon transport code (TORT version 3)

    Energy Technology Data Exchange (ETDEWEB)

    Rhoades, W.A.; Simpson, D.B.

    1997-10-01

    TORT calculates the flux or fluence of neutrons and/or photons throughout three-dimensional systems due to particles incident upon the system`s external boundaries, due to fixed internal sources, or due to sources generated by interaction with the system materials. The transport process is represented by the Boltzman transport equation. The method of discrete ordinates is used to treat the directional variable, and a multigroup formulation treats the energy dependence. Anisotropic scattering is treated using a Legendre expansion. Various methods are used to treat spatial dependence, including nodal and characteristic procedures that have been especially adapted to resist numerical distortion. A method of body overlay assists in material zone specification, or the specification can be generated by an external code supplied by the user. Several special features are designed to concentrate machine resources where they are most needed. The directional quadrature and Legendre expansion can vary with energy group. A discontinuous mesh capability has been shown to reduce the size of large problems by a factor of roughly three in some cases. The emphasis in this code is a robust, adaptable application of time-tested methods, together with a few well-tested extensions.

  17. Euclidean self-dual Yang-Mills field configurations

    International Nuclear Information System (INIS)

    Sartori, G.

    1980-01-01

    The determination of a large class of regular and singular Euclidean self-dual Yang-Mills field configurations is reduced to the solution of a set of linear algebraic equations. The matrix of the coefficients is a polynomial functions of x and the rules for its construction are elementary. (author)

  18. Covariant heterotic strings and odd self-dual lattices

    International Nuclear Information System (INIS)

    Lerche, W.; Luest, D.

    1987-01-01

    We investigate the implications of modular invariance for covariantly formulated heterotic strings. It is shown that modular invariant heterotic strings are characterized by odd self-dual lorentzian lattices which include charges of the bosonized superconformal ghosts. The proof of modular invariance involves the anomaly in the ghost number current in a crucial way. (orig.)

  19. Couplings of self-dual tensor multiplet in six dimensions

    NARCIS (Netherlands)

    Bergshoeff, E.; Sezgin, E.; Sokatchev, E.

    1996-01-01

    The (1, 0) supersymmetry in six dimensions admits a tensor multiplet which contains a second-rank antisymmetric tensor field with a self-dual field strength and a dilaton. We describe the fully supersymmetric coupling of this multiplet to a Yang–Mills multiplet, in the absence of supergravity. The

  20. Optimization and Openmp Parallelization of a Discrete Element Code for Convex Polyhedra on Multi-Core Machines

    Science.gov (United States)

    Chen, Jian; Matuttis, Hans-Georg

    2013-02-01

    We report our experiences with the optimization and parallelization of a discrete element code for convex polyhedra on multi-core machines and introduce a novel variant of the sort-and-sweep neighborhood algorithm. While in theory the whole code in itself parallelizes ideally, in practice the results on different architectures with different compilers and performance measurement tools depend very much on the particle number and optimization of the code. After difficulties with the interpretation of the data for speedup and efficiency are overcome, respectable parallelization speedups could be obtained.

  1. Discrete neurochemical coding of distinguishable motivational processes: insights from nucleus accumbens control of feeding.

    Science.gov (United States)

    Baldo, Brian A; Kelley, Ann E

    2007-04-01

    The idea that nucleus accumbens (Acb) dopamine transmission contributes to the neural mediation of reward, at least in a general sense, has achieved wide acceptance. Nevertheless, debate remains over the precise nature of dopamine's role in reward and even over the nature of reward itself. In the present article, evidence is reviewed from studies of food intake, feeding microstructure, instrumental responding for food reinforcement, and dopamine efflux associated with feeding, which suggests that reward processing in the Acb is best understood as an interaction among distinct processes coded by discrete neurotransmitter systems. In agreement with several theories of Acb dopamine function, it is proposed here that allocation of motor effort in seeking food or food-associated conditioned stimuli can be dissociated from computations relevant to the hedonic evaluation of food during the consummatory act. The former appears to depend upon Acb dopamine transmission and the latter upon striatal opioid peptide release. Moreover, dopamine transmission may play a role in 'stamping in' associations between motor acts and goal attainment and perhaps also neural representations corresponding to rewarding outcomes. Finally, evidence is reviewed that amino acid transmission specifically in the Acb shell acts as a central 'circuit breaker' to flexibly enable or terminate the consummatory act, via descending connections to hypothalamic feeding control systems. The heuristic framework outlined above may help explain why dopamine-compromising manipulations that strongly diminish instrumental goal-seeking behaviors leave consummatory activity relatively unaffected.

  2. Word attributes and lateralization revisited: implications for dual coding and discrete versus continuous processing.

    Science.gov (United States)

    Boles, D B

    1989-01-01

    Three attributes of words are their imageability, concreteness, and familiarity. From a literature review and several experiments, I previously concluded (Boles, 1983a) that only familiarity affects the overall near-threshold recognition of words, and that none of the attributes affects right-visual-field superiority for word recognition. Here these conclusions are modified by two experiments demonstrating a critical mediating influence of intentional versus incidental memory instructions. In Experiment 1, subjects were instructed to remember the words they were shown, for subsequent recall. The results showed effects of both imageability and familiarity on overall recognition, as well as an effect of imageability on lateralization. In Experiment 2, word-memory instructions were deleted and the results essentially reinstated the findings of Boles (1983a). It is concluded that right-hemisphere imagery processes can participate in word recognition under intentional memory instructions. Within the dual coding theory (Paivio, 1971), the results argue that both discrete and continuous processing modes are available, that the modes can be used strategically, and that continuous processing can occur prior to response stages.

  3. C5 Benchmark Problem with Discrete Ordinate Radiation Transport Code DENOVO

    Energy Technology Data Exchange (ETDEWEB)

    Yesilyurt, Gokhan [ORNL; Clarno, Kevin T [ORNL; Evans, Thomas M [ORNL; Davidson, Gregory G [ORNL; Fox, Patricia B [ORNL

    2011-01-01

    The C5 benchmark problem proposed by the Organisation for Economic Co-operation and Development/Nuclear Energy Agency was modeled to examine the capabilities of Denovo, a three-dimensional (3-D) parallel discrete ordinates (S{sub N}) radiation transport code, for problems with no spatial homogenization. Denovo uses state-of-the-art numerical methods to obtain accurate solutions to the Boltzmann transport equation. Problems were run in parallel on Jaguar, a high-performance supercomputer located at Oak Ridge National Laboratory. Both the two-dimensional (2-D) and 3-D configurations were analyzed, and the results were compared with the reference MCNP Monte Carlo calculations. For an additional comparison, SCALE/KENO-V.a Monte Carlo solutions were also included. In addition, a sensitivity analysis was performed for the optimal angular quadrature and mesh resolution for both the 2-D and 3-D infinite lattices of UO{sub 2} fuel pin cells. Denovo was verified with the C5 problem. The effective multiplication factors, pin powers, and assembly powers were found to be in good agreement with the reference MCNP and SCALE/KENO-V.a Monte Carlo calculations.

  4. The CNCSN: one, two- and three-dimensional coupled neutral and charged particle discrete ordinates code package

    International Nuclear Information System (INIS)

    Voloschenko, A.M.; Gukov, S.V.; Kryuchkov, V.P.; Dubinin, A.A.; Sumaneev, O.V.

    2005-01-01

    The CNCSN package is composed of the following codes: -) KATRIN-2.0: a three-dimensional neutral and charged particle transport code; -) KASKAD-S-2.5: a two-dimensional neutral and charged particle transport code; -) ROZ-6.6: a one-dimensional neutral and charged particle transport code; -) ARVES-2.5: a preprocessor for the working macroscopic cross-section format FMAC-M for transport calculations; -) MIXERM: a utility code for preparing mixtures on the base of multigroup cross-section libraries in ANISN format; -) CEPXS-BFP: a version of the Sandia National Lab. multigroup coupled electron-photon cross-section generating code CEPXS, adapted for solving the charged particles transport in the Boltzmann-Fokker-Planck formulation with the use of discrete ordinate method; -) SADCO-2.4: Institute for High-Energy Physics modular system for generating coupled nuclear data libraries to provide high-energy particles transport calculations by multigroup method; -) KATRIF: the post-processor for the KATRIN code; -) KASF: the post-processor for the KASKAD-S code; and ROZ6F: the post-processor for the ROZ-6 code. The coding language is Fortran-90

  5. Quantum tunneling radiation from self-dual black holes

    International Nuclear Information System (INIS)

    Silva, C.A.S.; Brito, F.A.

    2013-01-01

    Black holes are considered as objects that can reveal quantum aspects of spacetime. Loop Quantum Gravity (LQG) is a theory that propose a way to model the quantum spacetime behavior revealed by a black hole. One recent prediction of this theory is the existence of sub-Planckian black holes, which have the interesting property of self-duality. This property removes the black hole singularity and replaces it with another asymptotically flat region. In this work, we obtain the thermodynamical properties of this kind of black holes, called self-dual black holes, using the Hamilton–Jacobi version of the tunneling formalism. Moreover, using the tools of the tunneling approach, we investigate the emission spectrum of self-dual black holes, and investigate if some information about the black hole initial state can be recovered during the evaporation process. Back-reaction effects are included

  6. Non self-dual Yang-Mills fields

    International Nuclear Information System (INIS)

    Bor, G.

    1991-01-01

    The purpose of the thesis is to prove the existence of a new family of non self-dual finite-energy solutions to the Yang-Mills equations on Euclidean four-space, with SU(2) as a gauge group. The approach is that of equivalent geometry: attention is restricted to a special class of fields, those that satisfy a certain kind of rotational symmetry which it is proved that (1) a solution to the Yang-Mills equations exists for among them, and (2) no solution to the self-duality equations exists among them. The first assertion is proved by an application of the direct method of the calculus of variations (existence and regularity of minimizers), and the second assertion by showing that the self-duality equations, linearized at a symmetric self-dual solution, cannot possess the required symmetry

  7. Yang-Mills fields which are not self-dual

    International Nuclear Information System (INIS)

    Bor, G.

    1992-01-01

    The purpose of this paper is to prove the existence of a new family of non-self-dual finite-energy solutions to the Yang-Mills equations on Euclidean four-space, with SU(2) as a gauge group. The approach is that of 'equivariant geometry': Attention is restricted to a special class of fields, those that satisfy a certain kind of rotational symmetry, for which it is proved that (1) a solution to the Yang-Mills equations exists among them; and (2) no solution to the self-duality equations exists among them. The first assertion is proved by an application of the direct method of the calculus of variations (existence and regularity of minimizers), and the second assertion by studying the symmetry properties of the linearized-self-duality equations. The same technique yields a new family of non-self-dual solutions on the complex projective plane. (orig.)

  8. Perturbative construction of self-dual configurations on the torus

    International Nuclear Information System (INIS)

    Garcia Perez, M.; Gonzalez-Arroyo, A.; Pena, C.

    2000-01-01

    We develop a perturbative expansion which allows the construction of non-abelian self-dual SU(2) Yang-Mills field configurations on the four-dimensional torus with topological charge 1/2. The expansion is performed around the constant field strength abelian solutions found by 't Hooft. Next to leading order calculations are compared with numerical results obtained with lattice gauge theory techniques. (author)

  9. Von Neuman representations on self-dual Hilbert W* moduli

    International Nuclear Information System (INIS)

    Frank, M.

    1987-01-01

    Von Neumann algebras M of bounded operators on self-dual Hilbert W* moduli H possessing a cyclic-separating element x-bar in H are considered. The close relation of them to certain real subspaces of H is established. Under the supposition that the underlying W*-algebra is commutative, a Tomita-Takesaki type theorem is stated. The natural cone in H arising from the pair (M, x-bar) is investigated and its properties are obtained

  10. Loop quantum cosmology with self-dual variables

    Science.gov (United States)

    Wilson-Ewing, Edward

    2015-12-01

    Using the complex-valued self-dual connection variables, the loop quantum cosmology of a closed Friedmann space-time coupled to a massless scalar field is studied. It is shown how the reality conditions can be imposed in the quantum theory by choosing a particular inner product for the kinematical Hilbert space. While holonomies of the self-dual Ashtekar connection are not well defined in the kinematical Hilbert space, it is possible to introduce a family of generalized holonomylike operators of which some are well defined; these operators in turn are used in the definition of the Hamiltonian constraint operator where the scalar field can be used as a relational clock. The resulting quantum theory is closely related, although not identical, to standard loop quantum cosmology constructed from the Ashtekar-Barbero variables with a real Immirzi parameter. Effective Friedmann equations are derived which provide a good approximation to the full quantum dynamics for sharply peaked states whose volume remains much larger than the Planck volume, and they show that for these states quantum gravity effects resolve the big-bang and big-crunch singularities and replace them by a nonsingular bounce. Finally, the loop quantization in self-dual variables of a flat Friedmann space-time is recovered in the limit of zero spatial curvature and is identical to the standard loop quantization in terms of the real-valued Ashtekar-Barbero variables.

  11. The matreoshka of supersymmetric self-dual theories

    International Nuclear Information System (INIS)

    Devchand, C.; Ogievetsky, V.

    1993-06-01

    Extended super self-dual systems have a structure reminiscent of a 'matreoshka'. For instance, solutions for N=0 are embedded in solutions for N=1, which are in turn embedded in solutions for N=2, and so on. Consequences of this phenomenon are explored. In particular, we present an explicit construction of local solutions of the higher-N super self-duality equations starting from any N=0 self-dual solution. Our construction uses N=0 solution data to produce N=1 solution data, which in turn yields N=2 solution data, and so on; each stage introducing a dependence of the solution on sufficiently many additional arbitrary functions to yield the most general supersymmetric solution having the initial N=0 solution as the helicity +1 component. The problem of finding the general local solution of the N>0 super self-duality equations. Another consequence of the matreoshka phenomenon is the vanishing of many conserved currents, including the supercurrents, for super self-dual systems. (orig.)

  12. TDTORT: Time-Dependent, 3-D, Discrete Ordinates, Neutron Transport Code System with Delayed Neutrons

    International Nuclear Information System (INIS)

    2002-01-01

    1 - Description of program or function: TDTORT solves the time-dependent, three-dimensional neutron transport equation with explicit representation of delayed neutrons to estimate the fission yield from fissionable material transients. This release includes a modified version of TORT from the C00650MFMWS01 DOORS3.1 code package plus the time-dependent TDTORT code. GIP is also included for cross-section preparation. TORT calculates the flux or fluence of particles due to particles incident upon the system from extraneous sources or generated internally as a result of interaction with the system in two- or three-dimensional geometric systems. The principle application is to the deep-penetration transport of neutrons and photons. Reactor eigenvalue problems can also be solved. Numerous printed edits of the results are available, and results can be transferred to output files for subsequent analysis. TDTORT reads ANISN-format cross-section libraries, which are not included in the package. Users may choose from several available in RSICC's data library collection which can be identified by the keyword 'ANISN FORMAT'. 2 - Methods:The time-dependent spatial flux is expressed as a product of a space-, energy-, and angle-dependent shape function, which is usually slowly varying in time and a purely time-dependent amplitude function. The shape equation is solved for the shape using TORT; and the result is used to calculate the point kinetics parameters (e.g., reactivity) by using their inner product definitions, which are then used to solve the time-dependent amplitude and precursor equations. The amplitude function is calculated by solving the kinetics equations using the LSODE solver. When a new shape calculation is needed, the flux is calculated using the newly computed amplitude function. The Boltzmann transport equation is solved using the method of discrete ordinates to treat the directional variable and weighted finite-difference methods, in addition to Linear Nodal

  13. Pin cell discontinuity factors in the transient 3-D discrete ordinates code TORT-TD

    International Nuclear Information System (INIS)

    Seubert, A.

    2010-01-01

    Even with the rapid increase of computing power, whole core transient and accident analyses based on the direct solution of the 3-D neutron transport equation with a large number of energy groups and a detailed heterogeneous description of the core still remain computationally challenging. Current industrial methods for reactor core calculations therefore involve a two step approach in which lattice (assembly) depletion transport methods are used to prepare energy collapsed and fuel assembly or pin cell homogenized cross sections for subsequent whole core transport calculations. Spatial homogenization, in principal, requires the knowledge of both the actual boundary condition (local core environment) of the fuel assembly and the exact heterogeneous flux distribution (reference solution) of the whole core problem within that fuel assembly. Since, in particular, the latter is not known a priori, an infinite medium (zero net current) condition is used in the lattice calculations. It is well known that this approximation may lead to undesirable errors in cores in which large flux gradients are present across the fuel assemblies. This is the case in cores that have high heterogeneity and/or strong local absorbers, e.g. PWRs with partial MOX loading and inserted control rod clusters. There are two major approaches to mitigate spatial homogenization errors, superhomogenization (SPH) factors, and discontinuity factors within the scope of equivalence theory (ET) and generalized equivalence theory (GET). Although discontinuity factors are usually applied at the level of fuel assembly node size (assembly discontinuity factors, ADF), the methodology can be extended to pin cell homogenized whole core calculations involving pin cell discontinuity factors (PDF). There are also further developments for both the diffusion and the simplified transport (SP3) equation. In this paper, PDFs are introduced into the time-dependent 3-D discrete ordinates code TORT-TD in order to reduce the

  14. Kneser-Hecke-operators in coding theory

    OpenAIRE

    Nebe, Gabriele

    2005-01-01

    The Kneser-Hecke-operator is a linear operator defined on the complex vector space spanned by the equivalence classes of a family of self-dual codes of fixed length. It maps a linear self-dual code $C$ over a finite field to the formal sum of the equivalence classes of those self-dual codes that intersect $C$ in a codimension 1 subspace. The eigenspaces of this self-adjoint linear operator may be described in terms of a coding-theory analogue of the Siegel $\\Phi $-operator.

  15. Modification of the SAS4A Safety Analysis Code for Integration with the ADAPT Discrete Dynamic Event Tree Framework.

    Energy Technology Data Exchange (ETDEWEB)

    Jankovsky, Zachary Kyle [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Denman, Matthew R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2017-05-01

    It is difficult to assess the consequences of a transient in a sodium-cooled fast reactor (SFR) using traditional probabilistic risk assessment (PRA) methods, as numerous safety-related sys- tems have passive characteristics. Often there is significant dependence on the value of con- tinuous stochastic parameters rather than binary success/failure determinations. One form of dynamic PRA uses a system simulator to represent the progression of a transient, tracking events through time in a discrete dynamic event tree (DDET). In order to function in a DDET environment, a simulator must have characteristics that make it amenable to changing physical parameters midway through the analysis. The SAS4A SFR system analysis code did not have these characteristics as received. This report describes the code modifications made to allow dynamic operation as well as the linking to a Sandia DDET driver code. A test case is briefly described to demonstrate the utility of the changes.

  16. On self-dual Yang-Mills hierarchy

    International Nuclear Information System (INIS)

    Nakamura, Yoshimasa

    1989-01-01

    In this note, motivated by the Kadomtsev-Petviashvili (KP) hierarchy of integrable nonlinear evolution equations, a GL(n,C) self-dual Yang-Mills (SDYM) hierarchy is presented; it is an infinite system of SDYM equations having an infinite number of independent variables and being outside of the KP hierarchy. A relationship between the KP hierarchy and the SDYM hierarchy is discussed. It is also shown that GL(∞) SDYM equations introduced in this note are reduced to the GL(n,C) SDYM hierarchy by imposing an algebraic constraint. (orig.)

  17. Self-dual geometry of generalized Hermitian surfaces

    International Nuclear Information System (INIS)

    Arsen'eva, O E; Kirichenko, V F

    1998-01-01

    Several results on the geometry of conformally semiflat Hermitian surfaces of both classical and hyperbolic types (generalized Hermitian surfaces) are obtained. Some of these results are generalizations and clarifications of already known results in this direction due to Koda, Itoh, and other authors. They reveal some unexpected beautiful connections between such classical characteristics of conformally semiflat (generalized) Hermitian surfaces as the Einstein property, the constancy of the holomorphic sectional curvature, and so on. A complete classification of compact self-dual Hermitian RK-surfaces that are at the same time generalized Hopf manifolds is obtained. This provides a complete solution of the Chen problem in this class of Hermitian surfaces

  18. Self-dual spin-3 and 4 theories

    International Nuclear Information System (INIS)

    Aragone, C.; Khoudeir, A.

    1991-08-01

    We present self-dual pure spin-3 and 4 actions using the physical relevant Dreibein fields. Since these actions start with a Chern-Simons like kinetic term (and therefore cannot be obtained through dimensional reduction) one might wonder whether they need the presence of auxiliary, ghost-killing fields. It turns out that they must contain, also in this three dimensional case, auxiliary fields. Auxiliary scalars do not break self-duality; their free action does not contain kinetic terms. (author). 12 refs

  19. Supersymmetric self-dual Yang-Mills fields

    International Nuclear Information System (INIS)

    Zhao Liu

    1994-01-01

    A new four dimensional (4d) N = 1 supersymmetric integrable model, i.e. the supersymmetric self-dual Yang-Mills model is constructed. The equations of motion for this model are shown to be equivalent to the zero curvature condition on some superplane in the 4d superspace, the superplane being characterized by a point in the project space CP 3,4 . The linear systems are established according to this geometrical interpretation, and the effective action is also proposed in order to explain the dynamical content of the model

  20. General heavenly equation governs anti-self-dual gravity

    Energy Technology Data Exchange (ETDEWEB)

    Malykh, A A [Department of Numerical Modelling, Russian State Hydrometeorlogical University, Malookhtinsky pr 98, 195196 St Petersburg (Russian Federation); Sheftel, M B, E-mail: andrei-malykh@mail.ru, E-mail: mikhail.sheftel@boun.edu.tr [Department of Physics, Bogazici University, 34342 Bebek, Istanbul (Turkey)

    2011-04-15

    We show that the general heavenly equation, suggested recently by Doubrov and Ferapontov (2010 arXiv:0910.3407v2 [math.DG]), governs anti-self-dual (ASD) gravity. We derive ASD Ricci-flat vacuum metric governed by the general heavenly equation, null tetrad and basis of 1-forms for this metric. We present algebraic exact solutions of the general heavenly equation as a set of zeros of homogeneous polynomials in independent and dependent variables. A real solution is obtained for the case of a neutral signature.

  1. Synchronization Control for a Class of Discrete-Time Dynamical Networks With Packet Dropouts: A Coding-Decoding-Based Approach.

    Science.gov (United States)

    Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

    2017-09-06

    The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.

  2. The theta/gamma discrete phase code occuring during the hippocampal phase precession may be a more general brain coding scheme.

    Science.gov (United States)

    Lisman, John

    2005-01-01

    In the hippocampus, oscillations in the theta and gamma frequency range occur together and interact in several ways, indicating that they are part of a common functional system. It is argued that these oscillations form a coding scheme that is used in the hippocampus to organize the readout from long-term memory of the discrete sequence of upcoming places, as cued by current position. This readout of place cells has been analyzed in several ways. First, plots of the theta phase of spikes vs. position on a track show a systematic progression of phase as rats run through a place field. This is termed the phase precession. Second, two cells with nearby place fields have a systematic difference in phase, as indicated by a cross-correlation having a peak with a temporal offset that is a significant fraction of a theta cycle. Third, several different decoding algorithms demonstrate the information content of theta phase in predicting the animal's position. It appears that small phase differences corresponding to jitter within a gamma cycle do not carry information. This evidence, together with the finding that principle cells fire preferentially at a given gamma phase, supports the concept of theta/gamma coding: a given place is encoded by the spatial pattern of neurons that fire in a given gamma cycle (the exact timing within a gamma cycle being unimportant); sequential places are encoded in sequential gamma subcycles of the theta cycle (i.e., with different discrete theta phase). It appears that this general form of coding is not restricted to readout of information from long-term memory in the hippocampus because similar patterns of theta/gamma oscillations have been observed in multiple brain regions, including regions involved in working memory and sensory integration. It is suggested that dual oscillations serve a general function: the encoding of multiple units of information (items) in a way that preserves their serial order. The relationship of such coding to

  3. R=0 spacetimes and self-dual Lorentzian wormholes

    International Nuclear Information System (INIS)

    Dadhich, Naresh; Kar, Sayan; Mukherjee, Sailajananda; Visser, Matt

    2002-01-01

    A two-parameter family of spherically symmetric, static Lorentzian wormholes is obtained as the general solution of the equation ρ=ρ t =0, where ρ=T ij u i u j , ρ t =(T ij -(1/2)Tg ij )u i u j , and u i u i =-1. This equation characterizes a class of spacetimes which are 'self-dual' (in the sense of electrogravity duality). The class includes the Schwarzschild black hole, a family of naked singularities, and a disjoint family of Lorentzian wormholes, all of which have a vanishing scalar curvature (R=0). The properties of these spacetimes are discussed. Using isotropic coordinates we delineate clearly the domains of parameter space for which wormholes, nakedly singular spacetimes and the Schwarzschild black hole can be obtained. A model for the required 'exotic' stress-energy is discussed, and the notion of traversability for the wormholes is also examined

  4. Algebraic solutions of anti-self-dual gravity

    International Nuclear Information System (INIS)

    Sheftel, M.B.

    2011-01-01

    Full text: (author)It is considered a four-dimensional PDE: complex Monge-Amp'ere equation (CMA), solutions of which govern anti-self-dual gravity, i.e. determine anti-self-dual Ricci-flat Kahler metrics, solutions of the vacuum Einstein equations with the Euclidean signature. It is used simultaneously two mutually complex conjugate pairs of partner symmetries of CMA related by a recursion relation. For both pairs of partner symmetries, using Lie equations, it is introduced explicitly group parameters as additional variables, replacing symmetry characteristics and their complex conjugates by derivatives of the unknown with respect to group parameters. It is studied the resulting system of six equations in the eight-dimensional space, that includes CMA, four equations of the recursion between partner symmetries and one integrability condition of this system. It is used point symmetries of this extended system for performing its symmetry reduction with respect to group parameters that facilitates solving the extended system. This procedure does not imply a reduction in the number of physical variables and hence it is ended up with orbits of non-invariant solutions of CMA, generated by one partner symmetry, not used in the reduction. These solutions are determined by six linear equations with constant coefficients in the five-dimensional space which are obtained by a three-dimensional Legendre transformation of the reduced extended system. It is presented an example of algebraic solutions that govern Legendre-transformed Ricci-flat Kahler metrics with no Killing vectors. It is defined as a set of roots of a homogeneous polynomial of degree 6 in the six complex variables which determines a four-dimensional compact manifold in a five-dimensional complex projective space

  5. Self-dual Skyrmions on the spheres S2 N +1

    Science.gov (United States)

    Amari, Y.; Ferreira, L. A.

    2018-04-01

    We construct self-dual sectors for scalar field theories on a (2 N +2 )-dimensional Minkowski space-time with the target space being the 2 N +1 -dimensional sphere S2 N +1. The construction of such self-dual sectors is made possible by the introduction of an extra functional in the action that renders the static energy and the self-duality equations conformally invariant on the (2 N +1 )-dimensional spatial submanifold. The conformal and target-space symmetries are used to build an ansatz that leads to an infinite number of exact self-dual solutions with arbitrary values of the topological charge. The five-dimensional case is discussed in detail, where it is shown that two types of theories admit self-dual sectors. Our work generalizes the known results in the three-dimensional case that lead to an infinite set of self-dual Skyrmion solutions.

  6. TRIDENT: a two-dimensional, multigroup, triangular mesh discrete ordinates, explicit neutron transport code

    International Nuclear Information System (INIS)

    Seed, T.J.; Miller, W.F. Jr.; Brinkley, F.W. Jr.

    1977-03-01

    TRIDENT solves the two-dimensional-multigroup-transport equations in rectangular (x-y) and cylindrical (r-z) geometries using a regular triangular mesh. Regular and adjoint, inhomogeneous and homogeneous (k/sub eff/ and eigenvalue searches) problems subject to vacuum, reflective, white, or source boundary conditions are solved. General anisotropic scattering is allowed and anisotropic-distributed sources are permitted. The discrete-ordinates approximation is used for the neutron directional variables. An option is included to append a fictitious source to the discrete-ordinates equations that is defined such that spherical-harmonics solutions (in x-y geometry) or spherical-harmonics-like solutions (in r-z geometry) are obtained. A spatial-finite-element method is used in which the angular flux is expressed as a linear polynomial in each triangle that is discontinous at triangle boundaries. Unusual Features of the program: Provision is made for creation of standard interface output files for S/sub N/ constants, angle-integrated (scalar) fluxes, and angular fluxes. Standard interface input files for S/sub N/ constants, inhomogeneous sources, cross sections, and the scalar flux may be read. Flexible edit options as well as a dump and restart capability are provided

  7. Discrete processes modelling and geometry description in RTS and T code

    International Nuclear Information System (INIS)

    Degtyarev, I.I.; Liashenko, O.A.; Lokhovitskii, A.E.; Yazynin, I.A.; Belyakov-Bodin, V.I.; Blokhin, A.I.

    2001-01-01

    This paper describes the recent version of the RTS and T code system. RTS and T performs detailed simulations of many types of particles transport in complex 3D geometries in the energy range from a part of eV up to 20 TeV. A description of the main processes is given. (author)

  8. PowderSim: Lagrangian Discrete and Mesh-Free Continuum Simulation Code for Cohesive Soils

    Science.gov (United States)

    Johnson, Scott; Walton, Otis; Settgast, Randolph

    2013-01-01

    PowderSim is a calculation tool that combines a discrete-element method (DEM) module, including calibrated interparticle-interaction relationships, with a mesh-free, continuum, SPH (smoothed-particle hydrodynamics) based module that utilizes enhanced, calibrated, constitutive models capable of mimicking both large deformations and the flow behavior of regolith simulants and lunar regolith under conditions anticipated during in situ resource utilization (ISRU) operations. The major innovation introduced in PowderSim is to use a mesh-free method (SPH-based) with a calibrated and slightly modified critical-state soil mechanics constitutive model to extend the ability of the simulation tool to also address full-scale engineering systems in the continuum sense. The PowderSim software maintains the ability to address particle-scale problems, like size segregation, in selected regions with a traditional DEM module, which has improved contact physics and electrostatic interaction models.

  9. A parallel 3-D discrete wavelet transform architecture using pipelined lifting scheme approach for video coding

    Science.gov (United States)

    Hegde, Ganapathi; Vaya, Pukhraj

    2013-10-01

    This article presents a parallel architecture for 3-D discrete wavelet transform (3-DDWT). The proposed design is based on the 1-D pipelined lifting scheme. The architecture is fully scalable beyond the present coherent Daubechies filter bank (9, 7). This 3-DDWT architecture has advantages such as no group of pictures restriction and reduced memory referencing. It offers low power consumption, low latency and high throughput. The computing technique is based on the concept that lifting scheme minimises the storage requirement. The application specific integrated circuit implementation of the proposed architecture is done by synthesising it using 65 nm Taiwan Semiconductor Manufacturing Company standard cell library. It offers a speed of 486 MHz with a power consumption of 2.56 mW. This architecture is suitable for real-time video compression even with large frame dimensions.

  10. The time-dependent 3D discrete ordinates code TORT-TD with thermal-hydraulic feedback by ATHLET models

    International Nuclear Information System (INIS)

    Seubert, A.; Velkov, K.; Langenbuch, S.

    2008-01-01

    This paper describes the time-dependent 3D discrete ordinates transport code TORT-TD. Thermal-hydraulic feedback is considered by coupling TORT-TD with the thermal-hydraulics system code ATHLET. The coupled code TORT-TD/ATHLET allows 3D pin-by-pin analyses of transients in few energy groups and anisotropic scattering by solving the time-dependent transport equation using the unconditionally stable implicit method. The nuclear cross sections are interpolated between pre-calculated table values of fuel temperature, moderator density and boron concentration. For verification of the implementation, selected test cases have been calculated by TORT-TD/ATHLET. They include a control rod ejection transient in a small PWR fuel assembly arrangement and a local boron concentration change in a single PWR fuel assembly. In the latter, special attention has been paid to study the influence of the thermal-hydraulic feedback modelling in ATHLET. The results obtained for a control rod ejection accident in a PWR quarter core demonstrate the applicability of TORT-TD/ATHLET. (authors)

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

    International Nuclear Information System (INIS)

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

    1982-01-01

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

  12. Spinors in self-dual Yang-Mills fields in minkowski space

    International Nuclear Information System (INIS)

    Pervushin, V.N.

    1981-01-01

    Yang-Mills theory with infrared divergences removed by spontaneous vacuum symmetry breaking is considered. The corresponding vacuum fields are self-dual and are defined in the Minkowski space. The complete set of solutions of Dirac equations with self-dual fields, depending on certain arbitrary function, is found. Physical observables (charge, energy, spin) for the spinor fields within the self-dual vacuum are calculated and a Hermitean Hamiltonian is obtained. The physical picture corresponds to a relativistic generalization of the hadron bag model [ru

  13. A new approach to the self-dual Yang-Mills equations

    International Nuclear Information System (INIS)

    Takasaki, K.

    1984-01-01

    Inspired by Sato's new theory for soliton equations, we find a new approach to the self-dual Yang-Mills equations. We first establish a correspondence of solutions between the self-dual Yang-Mills equations and a new system of equations with infinitely many unknown functions. It then turns out that the latter equations can be easily solved by a simple explicit procedure. This leads to an explicit description of a very broad class of solutions to the self-dual Yang-Mills equations, and also to a construction of transformations acting on these solutions. (orig.)

  14. Reduction of 4-dim self dual super Yang-Mills onto super Riemann surfaces

    International Nuclear Information System (INIS)

    Mendoza, A.; Restuccia, A.; Martin, I.

    1990-05-01

    Recently self dual super Yang-Mills over a super Riemann surface was obtained as the zero set of a moment map on the space of superconnections to the dual of the super Lie algebra of gauge transformations. We present a new formulation of 4-dim Euclidean self dual super Yang-Mills in terms of constraints on the supercurvature. By dimensional reduction we obtain the same set of superconformal field equations which define self dual connections on a super Riemann surface. (author). 10 refs

  15. LQG for the bewildered the self-dual approach revisited

    CERN Document Server

    Vaid, Deepak

    2017-01-01

    This primer offers a concise introduction to Loop Quantum Gravity (LQG) - a theoretical framework for uniting Quantum Mechanics (QM) with General Relativity (GR). The emphasis is on the physical aspects of the framework and its historical development in terms of self-dual variables, still most suited for a first, pedagogical encounter with LQG. The text starts by reviewing GR and the very basics of Quantum Field Theory (QFT), and then explains in a concise and clear manner the steps leading from the Einstein-Hilbert action for gravity to the construction of the quantum states of geometry, known as spin-networks, and which provide the basis for the kinematical Hilbert space of quantum general relativity. Along the way the various associated concepts of tetrads, spin-connection and holonomies are introduced. Having thus provided a minimal introduction to the LQG framework, some applications to the problems of black hole entropy and of quantum cosmology are briefly surveyed. Last but not least, a list of the m...

  16. Discrete rod burnup analysis capability in the Westinghouse advanced nodal code

    International Nuclear Information System (INIS)

    Buechel, R.J.; Fetterman, R.J.; Petrunyak, M.A.

    1992-01-01

    Core design analysis in the last several years has evolved toward the adoption of nodal-based methods to replace traditional fine-mesh models as the standard neutronic tool for first core and reload design applications throughout the nuclear industry. The accuracy, speed, and reduction in computation requirements associated with the nodal methods have made three-dimensional modeling the preferred approach to obtain the most realistic core model. These methods incorporate detailed rod power reconstruction as well. Certain design applications such as confirmation of fuel rod design limits and fuel reconstitution considerations, for example, require knowledge of the rodwise burnup distribution to avoid unnecessary conservatism in design analyses. The Westinghouse Advanced Nodal Code (ANC) incorporates the capability to generate the intra-assembly pin burnup distribution using an efficient algorithm

  17. Nontopological bare solutions in the relativistic self-dual Maxwell-Chern-Simons-Higgs model

    International Nuclear Information System (INIS)

    Han, Jongmin; Jang, Jaeduk

    2005-01-01

    In this paper we prove the existence of the radially symmetric nontopological bare solutions in the relativistic self-dual Maxwell-Chern-Simons-Higgs model. We also verify the Chern-Simons limit for those solutions

  18. Interacting fields of arbitrary spin and N > 4 supersymmetric self-dual Yang-Mills equations

    International Nuclear Information System (INIS)

    Devchand, Ch.; Ogievetsky, V.

    1996-06-01

    We show that the self-dual Yang-Mills equations afford supersymmetrization to systems of equations invariant under global N-extended super-Poincare transformations for arbitrary values of N, without the limitation (N ≤ 4) applicable to standard non-self-dual Yang-Mills theories. These systems of equations provide novel classically consistent interactions for vector supermultiplets containing fields of spin up to N-2/2. The equations of motion of the component fields of spin greater than 1/2 are interacting variants of the first-order Dirac-Fierz equations for zero rest-mass fields of arbitrary spin. The interactions are governed by conserved currents which are constructed by an iterative procedure. In (arbitrarily extended) chiral superspace, the equations of motion for the (arbitrarily large) self-dual supermultiplet are shown to be completely equivalent to the set of algebraic supercurvature defining the self-dual superconnection. (author). 25 refs

  19. Z flux-line lattices and self-dual equations in the standard model

    International Nuclear Information System (INIS)

    Bimonte, G.; Lozano, G.

    1994-04-01

    We derive gauge covariant self-dual equations for the SU(2) x U(1) y theory of electroweak interactions and show that they admit solutions describing a periodic lattice of Z-strings. (author). 14 refs

  20. Self-dual monopoles in a seven-dimensional gauge theory

    International Nuclear Information System (INIS)

    Yang Yisong

    1990-01-01

    The existence of self-dual or anti-self-dual monopoles of a seven-dimensional generalized Yang-Mills-Higgs theory is proved using the second-order equations of motion. The behavior of solutions can be used to recognize self- or anti-self-duality. Moreover, it is shwon that, in the class of the field configurations under discussion, the solutions are, in fact, unique. (orig.)

  1. Connection between Einstein equations, nonlinear sigma models, and self-dual Yang-Mills theory

    International Nuclear Information System (INIS)

    Sanchez, N.; Whiting, B.

    1986-01-01

    The authors analyze the connection between nonlinear sigma models self-dual Yang-Mills theory, and general relativity (self-dual and non-self-dual, with and without killing vectors), both at the level of the equations and at the level of the different type of solutions (solitons and calorons) of these theories. They give a manifestly gauge invariant formulation of the self-dual gravitational field analogous to that given by Yang for the self-dual Yang-Mills field. This formulation connects in a direct and explicit way the self-dual Yang-Mills and the general relativity equations. They give the ''R gauge'' parametrization of the self-dual gravitational field (which corresponds to modified Yang's-type and Ernst equations) and analyze the correspondence between their different types of solutions. No assumption about the existence of symmetries in the space-time is needed. For the general case (non-self-dual), they show that the Einstein equations contain an O nonlinear sigma model. This connection with the sigma model holds irrespective of the presence of symmetries in the space-time. They found a new class of solutions of Einstein equations depending on holomorphic and antiholomorphic functions and we relate some subclasses of these solutions to solutions of simpler nonlinear field equations that are well known in other branches of physics, like sigma models, SineGordon, and Liouville equations. They include gravitational plane wave solutions. They analyze the response of different accelerated quantum detector models, compare them to the case when the detectors are linterial in an ordinary Planckian gas at a given temperature, and discuss the anisotropy of the detected response for Rindler observers

  2. A Deep Penetration Problem Calculation Using AETIUS:An Easy Modeling Discrete Ordinates Transport Code UsIng Unstructured Tetrahedral Mesh, Shared Memory Parallel

    Science.gov (United States)

    KIM, Jong Woon; LEE, Young-Ouk

    2017-09-01

    As computing power gets better and better, computer codes that use a deterministic method seem to be less useful than those using the Monte Carlo method. In addition, users do not like to think about space, angles, and energy discretization for deterministic codes. However, a deterministic method is still powerful in that we can obtain a solution of the flux throughout the problem, particularly as when particles can barely penetrate, such as in a deep penetration problem with small detection volumes. Recently, a new state-of-the-art discrete-ordinates code, ATTILA, was developed and has been widely used in several applications. ATTILA provides the capabilities to solve geometrically complex 3-D transport problems by using an unstructured tetrahedral mesh. Since 2009, we have been developing our own code by benchmarking ATTILA. AETIUS is a discrete ordinates code that uses an unstructured tetrahedral mesh such as ATTILA. For pre- and post- processing, Gmsh is used to generate an unstructured tetrahedral mesh by importing a CAD file (*.step) and visualizing the calculation results of AETIUS. Using a CAD tool, the geometry can be modeled very easily. In this paper, we describe a brief overview of AETIUS and provide numerical results from both AETIUS and a Monte Carlo code, MCNP5, in a deep penetration problem with small detection volumes. The results demonstrate the effectiveness and efficiency of AETIUS for such calculations.

  3. Neutronics analysis of the International Thermonuclear Experimental Reactor (ITER) MCNP ''Benchmark CAD Model'' with the ATTILA discrete ordinance code

    International Nuclear Information System (INIS)

    Youssef, M.Z.; Feder, R.; Davis, I.

    2007-01-01

    The ITER IT has adopted the newly developed FEM, 3-D, and CAD-based Discrete Ordinates code, ATTILA for the neutronics studies contingent on its success in predicting key neutronics parameters and nuclear field according to the stringent QA requirements set forth by the Management and Quality Program (MQP). ATTILA has the advantage of providing a full flux and response functions mapping everywhere in one run where components subjected to excessive radiation level and strong streaming paths can be identified. The ITER neutronics community had agreed to use a standard CAD model of ITER (40 degree sector, denoted ''Benchmark CAD Model'') to compare results for several responses selected for calculation benchmarking purposes to test the efficiency and accuracy of the CAD-MCNP approach developed by each party. Since ATTILA seems to lend itself as a powerful design tool with minimal turnaround time, it was decided to benchmark this model with ATTILA as well and compare the results to those obtained with the CAD MCNP calculations. In this paper we report such comparison for five responses, namely: (1) Neutron wall load on the surface of the 18 shield blanket module (SBM), (2) Neutron flux and nuclear heating rate in the divertor cassette, (3) nuclear heating rate in the winding pack of the inner leg of the TF coil, (4) Radial flux profile across dummy port plug and shield plug placed in the equatorial port, and (5) Flux at seven point locations situated behind the equatorial port plug. (orig.)

  4. High-temperature expansion along the self-dual line of three-dimensional Z(2) spin-gauge theory

    International Nuclear Information System (INIS)

    Bhanot, G.

    1981-01-01

    We exploit the self-duality of the three-dimensional Ising spin-gauge theory to develop an eighth-order high-temperature expansion for the partition function along the self-dual line. This generates a high-temperature series for the gauge-invariant, nearest-neighbor spin-spin correlation function. A Pade analysis of this series reveals a pole along the self-dual line. Recent Monte Carlo simulations indicate that this theory has a first-order self-dual line emerging from a triple point. We interpret the Pade pole as a theoretical estimate of the end point of this self-dual line

  5. Quantum Codes From Negacyclic Codes over Group Ring ( Fq + υFq) G

    International Nuclear Information System (INIS)

    Koroglu, Mehmet E.; Siap, Irfan

    2016-01-01

    In this paper, we determine self dual and self orthogonal codes arising from negacyclic codes over the group ring ( F q + υF q ) G . By taking a suitable Gray image of these codes we obtain many good parameter quantum error-correcting codes over F q . (paper)

  6. Green functions in a super self-dual Yang-Mills background

    International Nuclear Information System (INIS)

    McArthur, I.N.

    1984-01-01

    In euclidean supersymmetric theories of chiral superfields and vector superfields coupled to a super-self-dual Yang-Mills background, we define Green functions for the Laplace-type differential operators which are obtained from the quadratic parot the action. These Green functions are expressed in terms of the Green function on the space of right chiral superfields, and an explicit expression for the right chiral Green function in the fundamental representation of an SU(n) gauge group is presented using the supersymmetric version of the ADHM formalism. The superfield kernels associated with the Laplace-type operators are used to obtain the one-loop quantum corrections to the super-self-dual Yang-Mills action, and also to provide a superfield version of the super-index theorems for the components of chiral superfields in a self-dual background. (orig.)

  7. Hamiltonian quantization of self-dual tensor fields and a bosonic Nielsen-Ninomiya theorem

    International Nuclear Information System (INIS)

    Tang Waikeung

    1989-01-01

    The quantization of self-dual tensor fields is carried out following the procedure of Batalin and Fradkin. The (anti) self-duality constraints (either fermionic or bosonic) in the action leads to the gravitational anomaly. In the process of gauge fixing, the impossibility of the co-existence of a positive hamiltonian and covariant action is shown. A version of the Nielsen-Ninomiya theorem applies to self-dual tensor fields viz. the lattice version of the theory shows species doubling with zero net chirality. (orig.)

  8. On a gauge theory of the self-dual field and its quantization

    International Nuclear Information System (INIS)

    Srivastava, P.P.

    1990-01-01

    A gauge theory of self-dual fields is constructed by adding a Wess-Zumino term to the recently studied formulation based on a second-order scalar field lagrangian carrying with it an auxiliary vector field to take care of the self-duality constraint in a linear fashion. The two versions are quantized using the BRST formulation following the BFV procedure. No violation of microcausality occurs and the action of the ordinary scalar field may not be written as the sum of the actions of the self- and anti-self-dual fields. (orig.)

  9. Symmetry and conservation law structures of some anti-self-dual ...

    Indian Academy of Sciences (India)

    2016-09-28

    Sep 28, 2016 ... (2016) 87: 64 c Indian Academy of Sciences. DOI 10.1007/s12043-016-1258-y. Symmetry and conservation law structures of some anti-self-dual (ASD) manifolds. J BASINGWA1, A H KARA1,∗, ASHFAQUE H BOKHARI2, R A MOUSA2 and F D ZAMAN2. 1School of Mathematics, University of the ...

  10. Constant self-dual Abelian gauge fields and fermions in SU(2) gauge theory

    International Nuclear Information System (INIS)

    Kay, D.; Parthasarathy, R.; Viswanathan, K.S.

    1983-01-01

    Fermion one-loop corrections to the effective action in a self-dual Abelian background field are calculated for an SU(2) gauge theory. It is found that these corrections for massless fermions tend to destabilize the vacuum. The quantitative and qualitative features of such corrections for the case of massive fermions are discussed

  11. Static, self-dual, finite action SU(3) gauge fields in the de Sitter space

    International Nuclear Information System (INIS)

    Chakrabarti, A.; Comtet, A.; Viswanathan, K.S.; Simon Fraser Univ., Burnaby, British Columbia

    1980-01-01

    Static, self-dual, finite action SU(3) gauge fields are constructed on the euclidean section of the positive curvature de Sitter metric with periodic time. Their relation to known time dependent flat space solutions is pointed out. Their significances and possible applications are indicated. (orig.)

  12. Two general classes of self dual, Minkowski propagating wave solutions in Yang Mills gauge theory

    International Nuclear Information System (INIS)

    Kovacs, E.; Lo, S.Y.

    1979-01-01

    Two classes of self dual propogating wave solutions to the sourceless field equations in Minkowski space are presented. Some of these solutions can be linearly superposed. These waves can propogate at either the speed of light or at a speed less than that of light

  13. N = (2,0) self-dual non-Abelian tensor multiplet in D = 3 + 3 generates N = (1,1) self-dual systems in D = 2 + 2

    Science.gov (United States)

    Nishino, Hitoshi; Rajpoot, Subhash

    2018-03-01

    We formulate an N = (2 , 0) system in D = 3 + 3 dimensions consisting of a Yang-Mills (YM)-multiplet (ˆ μ ˆ IA, λˆI), a self-dual non-Abelian tensor multiplet (ˆ μ ˆ ν ˆ IB, χˆI ,φˆI), and an extra vector multiplet (C ˆ μ ˆ IC, ρˆI). We next perform the dimensional reductions of this system into D = 2 + 2, and obtain N = (1 , 1) systems with a self-dual YM-multiplet (AIμ ,λI), a self-dual tensor multiplet (BIμν , χI , φI), and an extra vector multiplet (CIμ , ρI). In D = 2 + 2, we reach two distinct theories: 'Theory-I' and 'Theory-II'. The former has the self-dual field-strength Hμν(+)I of CIμ already presented in our recent paper, while the latter has anti-self-dual field strength Hμν(-)I. As an application, we show that Theory-II actually generates supersymmetric-KdV equations in D = 1 + 1. Our result leads to a new conclusion that the D = 3 + 3 theory with non-Abelian tensor multiplet can be a 'Grand Master Theory' for self-dual multiplet and self-dual YM-multiplet in D = 2 + 2, that in turn has been conjectured to be the 'Master Theory' for all supersymmetric integrable theories in D ≤ 3.

  14. Killing–Yano tensor and supersymmetry of the self-dual Plebański–Demiański solution

    International Nuclear Information System (INIS)

    Nozawa, Masato; Houri, Tsuyoshi

    2016-01-01

    We explore various aspects of the self-dual Plebański–Demiański (PD) family in the Euclidean Einstein–Maxwell-Λ system. The Killing–Yano tensor which was recently found by Yasui and one of the present authors allows us to prove that the self-dual PD metric can be brought into the self-dual Carter metric by an orientation-reversing coordinate transformation. We show that the self-dual PD solution admits two independent Killing spinors in the framework of N = 2 minimal gauged supergravity, whereas the non-self-dual solution admits only a single Killing spinor. This can be demonstrated by casting the self-dual PD metric into two distinct Przanowski–Tod forms. As a by-product, a new example of the three-dimensional Einstein–Weyl space is presented. We also prove that the self-dual PD metric falls into two different Calderbank–Pedersen families, which are determined by a single function subjected to a linear equation on the two-dimensional hyperbolic space. Furthermore, we consider the hyper-Kähler case for which the metric falls into the Gibbons–Hawking class. We find that the condition for the nonexistence of the Dirac–Misner string enforces the solution with a nonvanishing acceleration parameter to the Eguchi–Hanson space. (paper)

  15. ANISN-L, a CDC-7600 code which solves the one-dimensional, multigroup, time dependent transport equation by the method of discrete ordinates

    Energy Technology Data Exchange (ETDEWEB)

    Wilcox, T. P.

    1973-09-20

    The code ANISN-L solves the one-dimensional, multigroup, time-independent Boltzmann transport equation by the method of discrete ordinates. In problems involving a fissionable system, it can calculate the system multiplication or alpha. In such cases, it is also capable of determining isotopic concentrations, radii, zone widths, or buckling in order to achieve a given multiplication or alpha. The code may also calculate fluxes caused by a specified fixed source. Neutron, gamma, and coupled neutron--gamma problems may be solved in either the forward or adjoint (backward) modes. Cross sections describing upscatter, as well as the usual downscatter, may be employed. This report describes the use of ANISN-L; this is a revised version of ANISN which handles both large and small problems efficiently on CDC-7600 computers. (RWR)

  16. Production of neutronic discrete equations for a cylindrical geometry in one group energy and benchmark the results with MCNP-4B code with one group energy library

    International Nuclear Information System (INIS)

    Salehi, A. A.; Vosoughi, N.; Shahriari, M.

    2002-01-01

    In reactor core neutronic calculations, we usually choose a control volume and investigate about the input, output, production and absorption inside it. Finally, we derive neutron transport equation. This equation is not easy to solve for simple and symmetrical geometry. The objective of this paper is to introduce a new direct method for neutronic calculations. This method is based on physics of problem and with meshing of the desired geometry, writing the balance equation for each mesh intervals and with notice to the conjunction between these mesh intervals, produce the final discrete equation series without production of neutron transport differential equation and mandatory passing form differential equation bridge. This method, which is named Direct Discrete Method, was applied in static state, for a cylindrical geometry in one group energy. The validity of the results from this new method are tested with MCNP-4B code with a one group energy library. One energy group direct discrete equation produces excellent results, which can be compared with the results of MCNP-4B

  17. Thomson scattering of chiral tensors and scalars against a self-dual string

    International Nuclear Information System (INIS)

    Arvidsson, Paer; Flink, Erik; Henningson, Maans

    2002-01-01

    We give a non-technical outline of a program to study the (2,0) theories in six space-time dimensions. Away from the origin of their moduli space, these theories describe the interactions of tensor multiplets and self-dual spinning strings. We argue that if the ratio between the square of the energy of a process and the string tension is taken to be small, it should be possible to study the dynamics of such a system perturbatively in this parameter. As a first step in this direction, we perform a classical computation of the amplitude for scattering chiral tensor and scalar fields (i.e. the bosonic part of a tensor multiplet) against a self-dual spinnless string. (author)

  18. Almost commuting self-adjoint matrices: The real and self-dual cases

    Science.gov (United States)

    Loring, Terry A.; Sørensen, Adam P. W.

    2016-08-01

    We show that a pair of almost commuting self-adjoint, symmetric matrices is close to a pair of commuting self-adjoint, symmetric matrices (in a uniform way). Moreover, we prove that the same holds with self-dual in place of symmetric and also for paths of self-adjoint matrices. Since a symmetric, self-adjoint matrix is real, we get a real version of Huaxin Lin’s famous theorem on almost commuting matrices. Similarly, the self-dual case gives a version for matrices over the quaternions. To prove these results, we develop a theory of semiprojectivity for real C*-algebras and also examine various definitions of low-rank for real C*-algebras.

  19. Vortex dynamics in self-dual Chern-Simons-Higgs systems

    International Nuclear Information System (INIS)

    Kim, Y.; Lee, K.

    1994-01-01

    We consider vortex dynamics in self-dual Chern-Simons-Higgs systems. We show that the naive Aharonov-Bohm phase is the inverse of the statistical phase expected from the vortex spin, and that the self-dual configurations of vortices are degenerate in energy but not in angular momentum. We also use the path integral formalism to derive the dual formulation of Chern-Simons-Higgs systems in which vortices appear as charged particles. We argue that in addition to the electromagnetic interaction, there is an additional interaction between vortices, the so-called Magnus force, and that these forces can be put together into a single ''dual electromagnetic'' interaction. This dual electromagnetic interaction leads to the right statistical phase. We also derive and study the effective action for slowly moving vortices, which contains terms both linear and quadratic in the vortex velocity. We show that vortices can be bounded to each other by the Magnus force

  20. Self-dual gauge field, its quantum fluctuations, and interacting fermions

    International Nuclear Information System (INIS)

    Flory, C.A.

    1983-01-01

    The quantum fluctuations about a self-dual background field in SU(2) are computed. The background field consists of parallel and equal uniform chromomagnetic and chromoelectric fields. Determination of the gluon fluctuations about this field yields zero modes, which are naturally regularized by the introduction of massless fermions. This regularization makes the integrals over all fluctuations convergent, and allows a simple computation of the vacuum energy which is shown to be lower than the energy of the configuration of zero field strength. The regularization of the zero modes also facilitates the introduction of heavy test charges which can interact with the classical background field and also exchange virtual quanta. The formalism for introducing these heavy test charges could be a good starting point for investigating the relevant physics of the self-dual background field beyond the classical level

  1. The CNCSN-2: One, two-and three-dimensional coupled neutral and charged particle discrete ordinates code system

    International Nuclear Information System (INIS)

    Voloschenko, A. M.; Gukov, S. V.; Russkov, A. A.; Gurevich, M. I.; Shkarovsky, D. A.; Kryuchkov, V. P.; Sumaneev, O. V.; Dubinin, A. A.

    2009-01-01

    KATRIN, KASKAD-Sand ROZ-6 codes solve the multigroup transport equation for neutrons, photons and charged particles in 3D. BOT3P-5., ConDat can be used as preprocessor. ARVES-2.5, a cross-section preprocessor (the package of utilities for operating with the cross section file in FMAC-M format) is included. Auxiliary codes MIXERM, CEPXS-BFP, CEPXS-BFP, SADCO-2.4 and CNCSN-2 are used

  2. Self-dual configurations in Abelian Higgs models with k-generalized gauge field dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Casana, R.; Cavalcante, A. [Departamento de Física, Universidade Federal do Maranhão,65080-805, São Luís, Maranhão (Brazil); Hora, E. da [Departamento de Física, Universidade Federal do Maranhão,65080-805, São Luís, Maranhão (Brazil); Coordenadoria Interdisciplinar de Ciência e Tecnologia, Universidade Federal do Maranhão,65080-805, São Luís, Maranhão (Brazil)

    2016-12-14

    We have shown the existence of self-dual solutions in new Maxwell-Higgs scenarios where the gauge field possesses a k-generalized dynamic, i.e., the kinetic term of gauge field is a highly nonlinear function of F{sub μν}F{sup μν}. We have implemented our proposal by means of a k-generalized model displaying the spontaneous symmetry breaking phenomenon. We implement consistently the Bogomol’nyi-Prasad-Sommerfield formalism providing highly nonlinear self-dual equations whose solutions are electrically neutral possessing total energy proportional to the magnetic flux. Among the infinite set of possible configurations, we have found families of k-generalized models whose self-dual equations have a form mathematically similar to the ones arising in the Maxwell-Higgs or Chern-Simons-Higgs models. Furthermore, we have verified that our proposal also supports infinite twinlike models with |ϕ|{sup 4}-potential or |ϕ|{sup 6}-potential. With the aim to show explicitly that the BPS equations are able to provide well-behaved configurations, we have considered a test model in order to study axially symmetric vortices. By depending of the self-dual potential, we have shown that the k-generalized model is able to produce solutions that for long distances have a exponential decay (as Abrikosov-Nielsen-Olesen vortices) or have a power-law decay (characterizing delocalized vortices). In all cases, we observe that the generalization modifies the vortex core size, the magnetic field amplitude and the bosonic masses but the total energy remains proportional to the quantized magnetic flux.

  3. On the algebraic structure of self-dual gauge fields and sigma models

    International Nuclear Information System (INIS)

    Bais, F.A.; Sasaki, R.

    1983-01-01

    An extensive and detailed analysis of self-dual gauge fields, in particular with axial symmetry, is presented, culminating in a purely algebraic procedure to generate solutions. The method which is particularly suited for the construction of multimonopole solutions for a theory with arbitrary G, is also applicable to a wide class of non-linear sigma models. The relevant symmetries as well as the associated linear problems which underly the exact solubility of the problem, are constructed and discussed in detail. (orig.)

  4. Some New Integrable Equations from the Self-Dual Yang-Mills Equations

    International Nuclear Information System (INIS)

    Ivanova, T.A.; Popov, A.D.

    1994-01-01

    Using the symmetry reductions of the self-dual Yang-Mills (SDYM) equations in (2+2) dimensions, we introduce new integrable equations which are 'deformations' of the chiral model in (2+1) dimensions, generalized nonlinear Schroedinger, Korteweg-de Vries, Toda lattice, Garnier, Euler-Arnold, generalized Calogero-Moser and Euler-Calogero-Moser equations. The Lax pairs for all of these equations are derived by the symmetry reductions of the Lax pair for the SDYM equations. 34 refs

  5. Diffeomorphism-type symmetries of the self-dual Yang-Mills equations

    International Nuclear Information System (INIS)

    Ivanova, T.A.

    1998-01-01

    The infinite-dimensional algebra of diffeomorphism-type symmetries of the self-dual Yang-Mills equations is described as the algebra of 0-cochains with values in a sheaf of germs of holomorphic sections of the (1,0) tangent bundle over the twistor space. It is shown that the extended conformal symmetries are obtained as particular cases of the aforementioned algebra

  6. SLE in self-dual critical Z(N) spin systems: CFT predictions

    International Nuclear Information System (INIS)

    Santachiara, Raoul

    2008-01-01

    The Schramm-Loewner evolution (SLE) describes the continuum limit of domain walls at phase transitions in two-dimensional statistical systems. We consider here the SLE in Z(N) spin models at their self-dual critical point. For N=2 and N=3 these models correspond to the Ising and three-state Potts model. For N≥4 the critical self-dual Z(N) spin models are described in the continuum limit by non-minimal conformal field theories with central charge c≥1. By studying the representations of the corresponding chiral algebra, we show that two particular operators satisfy a two level null vector condition which, for N≥4, presents an additional term coming from the extra symmetry currents action. For N=2,3 these operators correspond to the boundary conditions changing operators associated to the SLE 16/3 (Ising model) and to the SLE 24/5 and SLE 10/3 (three-state Potts model). We suggest a definition of the interfaces within the Z(N) lattice models. The scaling limit of these interfaces is expected to be described at the self-dual critical point and for N≥4 by the SLE 4(N+1)/(N+2) and SLE 4(N+2)/(N+1) processes

  7. Exact effective actions for quarks in pure and self-dual mean fields

    International Nuclear Information System (INIS)

    Elizalde, E.; Soto, J.

    1985-01-01

    The QCD effective action for ordinary quarks in the presence of a constant self-dual, pure colormagnetic or pure color-electric background created by themselves is calculated at all loop orders. This is done in a very simple way, by using zeta-function regularization and the fact that the dependence of the effective action on the background can be factorized in these three cases, leaving a well-defined constant factor. The zero mode problem and the imaginary contributions are seen to be mere one-loop artifacts which automatically vanish when the exact calculation is carried out. (orig.)

  8. Self-dual Yang-Mills equation and deformation of surfaces

    International Nuclear Information System (INIS)

    Serikbaev, N.S.; Myrzakul, K.; Sajymbetova, S.K.; Koshkinbaev, A.D.; Myrzakulov, R.

    2003-01-01

    We show that many integrable systems and integrable spin systems in 2+1 dimensions can be obtained from the (2+1)- dimensional Gauss-Mainardi-Codazzi and Gauss-Weingarten equations, respectively. We also show that the (2+1)-dimensional Gauss-Mainardi-Codazzi equation which describes the deformation (motion) of surfaces is the exact reduction of the Yang-Mills-Higgs-Bogomolny and self-dual Yang-Mills equations. On the basis of this observation, we suggest that the (2+1)-dimensional Gauss-Mainardi-Codazzi equation is a candidate to be integrable, and the associated linear problem (Lax representation) with the spectral parameter is presented. (author)

  9. Moduli space of self-dual connections in dimension greater than four for abelian Gauge groups

    OpenAIRE

    Cappelle, Natacha

    2018-01-01

    In 1954, C. Yang and R. Mills created a Gauge Theory for strong interaction of Elementary Particles. More generally, they proved that it is possible to define a Gauge Theory with an arbitrary compact Lie group as Gauge group. Within this context, it is interesting to find critical values of a functional defined on the space of connections: the Yang-Mills functional. If the based manifold is four dimensional, there exists a natural notion of (anti-)self-dual 2-form, which gives a natural notio...

  10. Canonical formulation of the self-dual Yang-Mills system: Algebras and hierarchies

    International Nuclear Information System (INIS)

    Chau, L.; Yamanaka, I.

    1992-01-01

    We construct a canonical formulation of the self-dual Yang-Mills system formulated in the gauge-invariant group-valued J fields and derive their Hamiltonian and the quadratic algebras of the fundamental Dirac brackets. We also show that the quadratic algebras satisfy Jacobi identities and their structure matrices satisfy modified Yang-Baxter equations. From these quadratic algebras, we construct Kac-Moody-like and Virasoro-like algebras. We also discuss their related symmetries, involutive conserved quantities, and hierarchies of nonlinear and linear equations

  11. BRST Formalism in Self-Dual Chern-Simons Theory with Matter Fields

    Science.gov (United States)

    Dai, Jialiang; Fan, Engui

    2018-04-01

    We apply BRST method to the self-dual Chern-Simons gauge theory with matter fields and the generators of symmetries of the system from an elegant Lie algebra structure under the operation of Poisson bracket. We discuss four different cases: abelian, nonabelian, relativistic, and nonrelativistic situations and extend the system to the whole phase space including ghost fields. In addition, we obtain the BRST charge of the field system and check its nilpotence of the BRST transformation which plays an important role such as in topological quantum field theory and string theory.

  12. Benchmarking the cad-based attila discrete ordinates code with experimental data of fusion experiments and to the results of MCNP code in simulating ITER

    International Nuclear Information System (INIS)

    Youssef, M. Z.

    2007-01-01

    Attila is a newly developed finite element code based on Sn neutron, gamma, and charged particle transport in 3-D geometry in which unstructured tetrahedral meshes are generated to describe complex geometry that is based on CAD input (Solid Works, Pro/Engineer, etc). In the present work we benchmark its calculation accuracy by comparing its prediction to the measured data inside two experimental mock-ups bombarded with 14 MeV neutrons. The results are also compared to those based on MCNP calculations. The experimental mock-ups simulate parts of the International Thermonuclear Experimental Reactor (ITER) in-vessel components, namely: (1) the Tungsten mockup configuration (54.3 cm x 46.8 cm x 45 cm), and (2) the ITER shielding blanket followed by the SCM region (simulated by alternating layers of SS316 and copper). In the latter configuration, a high aspect ratio rectangular streaming channel was introduced (to simulate steaming paths between ITER blanket modules) which ends with a rectangular cavity. The experiments on these two fusion-oriented integral experiments were performed at the Fusion Neutron Generator (FNG) facility, Frascati, Italy. In addition, the nuclear performance of the ITER MCNP 'Benchmark' CAD model has been performed with Attila to compare its results to those obtained with CAD-based MCNP approach developed by several ITER participants. The objective of this paper is to compare results based on two distinctive 3-D calculation tools using the same nuclear data, FENDL2.1, and the same response functions of several reaction rates measured in ITER mock-ups and to enhance confidence from the international neutronics community in the Attila code and how it can precisely quantify the nuclear field in large and complex systems, such as ITER. Attila has the advantage of providing a full flux mapping visualization everywhere in one run where components subjected to excessive radiation level and strong streaming paths can be identified. In addition, the

  13. Some Evolution Hierarchies Derived from Self-dual Yang-Mills Equations

    International Nuclear Information System (INIS)

    Zhang Yufeng; Hon, Y.C.

    2011-01-01

    We develop in this paper a new method to construct two explicit Lie algebras E and F. By using a loop algebra Ē of the Lie algebra E and the reduced self-dual Yang-Mills equations, we obtain an expanding integrable model of the Giachetti-Johnson (GJ) hierarchy whose Hamiltonian structure can also be derived by using the trace identity. This provides a much simpler construction method in comparing with the tedious variational identity approach. Furthermore, the nonlinear integrable coupling of the GJ hierarchy is readily obtained by introducing the Lie algebra g N . As an application, we apply the loop algebra E-tilde of the Lie algebra E to obtain a kind of expanding integrable model of the Kaup-Newell (KN) hierarchy which, consisting of two arbitrary parameters α and β, can be reduced to two nonlinear evolution equations. In addition, we use a loop algebra F of the Lie algebra F to obtain an expanding integrable model of the BT hierarchy whose Hamiltonian structure is the same as using the trace identity. Finally, we deduce five integrable systems in R 3 based on the self-dual Yang-Mills equations, which include Poisson structures, irregular lines, and the reduced equations. (general)

  14. A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control

    DEFF Research Database (Denmark)

    Sokoler, Leo Emil; Frison, Gianluca; Skajaa, Anders

    2015-01-01

    We develop an efficient homogeneous and self-dual interior-point method (IPM) for the linear programs arising in economic model predictive control of constrained linear systems with linear objective functions. The algorithm is based on a Riccati iteration procedure, which is adapted to the linear...... system of equations solved in homogeneous and self-dual IPMs. Fast convergence is further achieved using a warm-start strategy. We implement the algorithm in MATLAB and C. Its performance is tested using a conceptual power management case study. Closed loop simulations show that 1) the proposed algorithm...

  15. Majorana fermion codes

    International Nuclear Information System (INIS)

    Bravyi, Sergey; Terhal, Barbara M; Leemhuis, Bernhard

    2010-01-01

    We initiate the study of Majorana fermion codes (MFCs). These codes can be viewed as extensions of Kitaev's one-dimensional (1D) model of unpaired Majorana fermions in quantum wires to higher spatial dimensions and interacting fermions. The purpose of MFCs is to protect quantum information against low-weight fermionic errors, that is, operators acting on sufficiently small subsets of fermionic modes. We examine to what extent MFCs can surpass qubit stabilizer codes in terms of their stability properties. A general construction of 2D MFCs is proposed that combines topological protection based on a macroscopic code distance with protection based on fermionic parity conservation. Finally, we use MFCs to show how to transform any qubit stabilizer code to a weakly self-dual CSS code.

  16. The electrically charged BTZ black hole with self (anti-self) dual Maxwell field

    International Nuclear Information System (INIS)

    Kamata, M.; Koikawa, T.

    1995-04-01

    The Einstein-Maxwell equations with a negative cosmological constant Λ in 2 + 1 spacetime dimensions discussed by Banados, Teitelboim and Zanelli are solved by assuming a self (anti-self) dual equation E r-circumflex = ± B -circumflex , which is imposed on the orthonormal basis components of the electric field E r-circumflex and the magnetic field B -circumflex . This solution describes an electrically charged extra black hole with mass M=8πGQ 2 e , angular momentum J = ±8πGQ 2 e / modul Λ 1/2 and electric charge Q e . Although the coordinate components of the electric field E r and the magnetic field B have singularities on the horizon at r (4πGQ 2 e / modul Λ) 1/2 , the spacetime has the same value of constant negative curvature R = 6Λ as that of Banados et al. (author). 5 refs

  17. Kaehler-Chern-Simons theory and symmetries of anti-self-dual gauge fields

    International Nuclear Information System (INIS)

    Nair, V.P.; Schiff, J.

    1992-01-01

    Kaehler-Chern-Simons theory, which was proposed as a generalization of ordinary Chern-Simons theory, is explored in more detail. The theory describes anti-self-dual instantons on a four-dimensional Kaehler manifold. The phase space is the space of gauge potentials, whose symplectic reduction by the constraints of anti-self-duality leads to the moduli space of instantons. We show that infinitesimal Baecklund transformations, previously related to 'hidden symmetries' of instantons, are canonical transformations generated by the anti-self-duality constraints. The quantum wave functions naturally lead to a generalized Wess-Zumino-Witten action, which in turn has associated chiral current algebras. The dimensional reduction of the anti-self-duality equations leading to integrable two-dimensional theories is briefly discussed in this framework. (orig.)

  18. Emitter and absorber assembly for multiple self-dual operation and directional transparency

    Science.gov (United States)

    Kalozoumis, P. A.; Morfonios, C. V.; Kodaxis, G.; Diakonos, F. K.; Schmelcher, P.

    2017-03-01

    We demonstrate how to systematically design wave scattering systems with simultaneous coherent perfect absorbing and lasing operation at multiple and prescribed frequencies. The approach is based on the recursive assembly of non-Hermitian emitter and absorber units into self-dual emitter-absorber trimers at different composition levels, exploiting the simple structure of the corresponding transfer matrices. In particular, lifting the restriction to parity-time-symmetric setups enables the realization of emitter and absorber action at distinct frequencies and provides flexibility with respect to the choice of realistic parameters. We further show how the same assembled scatterers can be rearranged to produce unidirectional and bidirectional transparency at the selected frequencies. With the design procedure being generically applicable to wave scattering in single-channel settings, we demonstrate it with concrete examples of photonic multilayer setups.

  19. A Riccati Based Homogeneous and Self-Dual Interior-Point Method for Linear Economic Model Predictive Control

    DEFF Research Database (Denmark)

    Sokoler, Leo Emil; Frison, Gianluca; Edlund, Kristian

    2013-01-01

    In this paper, we develop an efficient interior-point method (IPM) for the linear programs arising in economic model predictive control of linear systems. The novelty of our algorithm is that it combines a homogeneous and self-dual model, and a specialized Riccati iteration procedure. We test...

  20. Discrete fracture network code development

    Energy Technology Data Exchange (ETDEWEB)

    Dershowitz, W.; Doe, T.; Shuttle, D.; Eiben, T.; Fox, A.; Emsley, S.; Ahlstrom, E. [Golder Associates Inc., Redmond, Washington (United States)

    1999-02-01

    This report presents the results of fracture flow model development and application performed by Golder Associates Inc. during the fiscal year 1998. The primary objective of the Golder Associates work scope was to provide theoretical and modelling support to the JNC performance assessment effort in fiscal year 2000. In addition, Golder Associates provided technical support to JNC for the Aespoe project. Major efforts for performance assessment support included extensive flow and transport simulations, analysis of pathway simplification, research on excavation damage zone effects, software verification and cross-verification, and analysis of confidence bounds on Monte Carlo simulations. In addition, a Fickian diffusion algorithm was implemented for Laplace Transform Galerkin solute transport. Support for the Aespoe project included predictive modelling of sorbing tracer transport in the TRUE-1 rock block, analysis of 1 km geochemical transport pathways for Task 5', and data analysis and experimental design for the TRUE Block Scale experiment. Technical information about Golder Associates support to JNC is provided in the appendices to this report. (author)

  1. (3+1)-dimensional topological phases and self-dual quantum geometries encoded on Heegaard surfaces

    Energy Technology Data Exchange (ETDEWEB)

    Dittrich, Bianca [Perimeter Institute for Theoretical Physics,31 Caroline Street North, Waterloo, Ontario N2L 2Y5 (Canada)

    2017-05-22

    We apply the recently suggested strategy to lift state spaces and operators for (2+1)-dimensional topological quantum field theories to state spaces and operators for a (3+1)-dimensional TQFT with defects. We start from the (2+1)-dimensional Turaev-Viro theory and obtain a state space, consistent with the state space expected from the Crane-Yetter model with line defects. This work has important applications for quantum gravity as well as the theory of topological phases in (3+1) dimensions. It provides a self-dual quantum geometry realization based on a vacuum state peaked on a homogeneously curved geometry. The state spaces and operators we construct here provide also an improved version of the Walker-Wang model, and simplify its analysis considerably. We in particular show that the fusion bases of the (2+1)-dimensional theory lead to a rich set of bases for the (3+1)-dimensional theory. This includes a quantum deformed spin network basis, which in a loop quantum gravity context diagonalizes spatial geometry operators. We also obtain a dual curvature basis, that diagonalizes the Walker-Wang Hamiltonian. Furthermore, the construction presented here can be generalized to provide state spaces for the recently introduced dichromatic four-dimensional manifold invariants.

  2. Self-dual phase space for (3 +1 )-dimensional lattice Yang-Mills theory

    Science.gov (United States)

    Riello, Aldo

    2018-01-01

    I propose a self-dual deformation of the classical phase space of lattice Yang-Mills theory, in which both the electric and magnetic fluxes take value in the compact gauge Lie group. A local construction of the deformed phase space requires the machinery of "quasi-Hamiltonian spaces" by Alekseev et al., which is reviewed here. The results is a full-fledged finite-dimensional and gauge-invariant phase space, the self-duality properties of which are largely enhanced in (3 +1 ) spacetime dimensions. This enhancement is due to a correspondence with the moduli space of an auxiliary noncommutative flat connection living on a Riemann surface defined from the lattice itself, which in turn equips the duality between electric and magnetic fluxes with a neat geometrical interpretation in terms of a Heegaard splitting of the space manifold. Finally, I discuss the consequences of the proposed deformation on the quantization of the phase space, its quantum gravitational interpretation, as well as its relevance for the construction of (3 +1 )-dimensional topological field theories with defects.

  3. Higher groupoid bundles, higher spaces, and self-dual tensor field equations

    Energy Technology Data Exchange (ETDEWEB)

    Jurco, Branislav [Charles University in Prague, Faculty of Mathematics and Physics, Mathematical Institute, Prague (Czech Republic); Saemann, Christian [Maxwell Institute for Mathematical Sciences, Department of Mathematics, Heriot-Watt University, Edinburgh (United Kingdom); Wolf, Martin [Department of Mathematics, University of Surrey, Guildford (United Kingdom)

    2016-08-15

    We develop a description of higher gauge theory with higher groupoids as gauge structure from first principles. This approach captures ordinary gauge theories and gauged sigma models as well as their categorifications on a very general class of (higher) spaces comprising presentable differentiable stacks, as e.g. orbifolds. We start off with a self-contained review on simplicial sets as models of (∞, 1)-categories. We then discuss principal bundles in terms of simplicial maps and their homotopies. We explain in detail a differentiation procedure, suggested by Severa, that maps higher groupoids to L{sub ∞}-algebroids. Generalising this procedure, we define connections for higher groupoid bundles. As an application, we obtain six-dimensional superconformal field theories via a Penrose-Ward transform of higher groupoid bundles over a twistor space. This construction reduces the search for non-Abelian self-dual tensor field equations in six dimensions to a search for the appropriate (higher) gauge structure. The treatment aims to be accessible to theoretical physicists. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  4. Higher groupoid bundles, higher spaces, and self-dual tensor field equations

    International Nuclear Information System (INIS)

    Jurco, Branislav; Saemann, Christian; Wolf, Martin

    2016-01-01

    We develop a description of higher gauge theory with higher groupoids as gauge structure from first principles. This approach captures ordinary gauge theories and gauged sigma models as well as their categorifications on a very general class of (higher) spaces comprising presentable differentiable stacks, as e.g. orbifolds. We start off with a self-contained review on simplicial sets as models of (∞, 1)-categories. We then discuss principal bundles in terms of simplicial maps and their homotopies. We explain in detail a differentiation procedure, suggested by Severa, that maps higher groupoids to L ∞ -algebroids. Generalising this procedure, we define connections for higher groupoid bundles. As an application, we obtain six-dimensional superconformal field theories via a Penrose-Ward transform of higher groupoid bundles over a twistor space. This construction reduces the search for non-Abelian self-dual tensor field equations in six dimensions to a search for the appropriate (higher) gauge structure. The treatment aims to be accessible to theoretical physicists. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  5. Orbifold constructions and the classification of self-dual c=24 conformal field theories

    International Nuclear Information System (INIS)

    Montague, P.S.

    1994-01-01

    We discuss questions arising from the work of Schellekens [A.N. Schellekens, Phys. Lett. B 277 (1992) 277; Meromorphic c=24 conformal field theories, CERN-TH.6478/92, 1992.] After introducing the concept of complementary representations, we examine Z 2 -orbifold constructions in general, and propose a technique for identifying the orbifold theory without knowledge of its explicit construction. This technique is then generalised to twists of order 3, 5 and 7, and we proceed to apply our considerations to the FKS constructions H (Λ) (Λ an even self-dual lattice) and the reflection-twisted orbifold theories and H ;(Λ), which together remain the only c=24 theories which have so far been proven to exist [L. Dolan, P. Goddard and P. Montague, Nucl. Phys. B 338 (1990) 529.] We also make, in the course of our arguments, some comments on the automorphism groups of the theories H (Λ) and and H ;(Λ), and of meromorphic theories in general, introducing the concept of deterministic theories. ((orig.))

  6. Analytical evidence for the absence of spin glass transition on self-dual lattices

    International Nuclear Information System (INIS)

    Ohzeki, Masayuki; Nishimori, Hidetoshi

    2009-01-01

    We show strong evidence for the absence of a finite-temperature spin glass transition for the random-bond Ising model on self-dual lattices. The analysis is performed by an application of duality relations, which enables us to derive a precise but approximate location of the multicritical point on the Nishimori line. This method can be systematically improved to presumably give the exact result asymptotically. The duality analysis, in conjunction with the relationship between the multicritical point and the spin glass transition point for the symmetric distribution function of randomness, leads to the conclusion of the absence of a finite-temperature spin glass transition for the case of symmetric distribution. The result is applicable to the random-bond Ising model with ±J or Gaussian distribution and the Potts gauge glass on the square, triangular and hexagonal lattices as well as the random three-body Ising model on the triangular and the Union-Jack lattices and the four-dimensional random plaquette gauge model. This conclusion is exact provided that the replica method is valid and the asymptotic limit of the duality analysis yields the exact location of the multicritical point. (fast track communication)

  7. Supersymmetric Dirac-Born-Infeld action with self-dual mass term

    International Nuclear Information System (INIS)

    Nishino, Hitoshi; Rajpoot, Subhash; Reed, Kevin

    2005-01-01

    We introduce a Dirac-Born-Infeld action to a self-dual N = 1 supersymmetric vector multiplet in three dimensions. This action is based on the supersymmetric generalized self-duality in odd dimensions developed originally by Townsend, Pilch and van Nieuwenhuizen. Even though such a self-duality had been supposed to be very difficult to generalize to a supersymmetrically interacting system, we show that the Dirac-Born-Infeld action is actually compatible with supersymmetry and self-duality in three dimensions, even though the original self-duality receives corrections by the Dirac-Born-Infeld action. The interactions can be further generalized to arbitrary (non)polynomial interactions. As a by-product, we also show that a third-rank field strength leads to a more natural formulation of self-duality in 3D. We also show an interesting role played by the third-rank field strength leading to supersymmetry breaking, in addition to accommodating a Chern-Simons form

  8. Baeklund transformations, conservation laws and linearization of the self-dual Yang-Mills and chiral fields

    International Nuclear Information System (INIS)

    Wang, L.C.

    1980-01-01

    Baecklund Transformations (BT) and the derivation of local conservation laws are first reviewed in the classic case of the Sine-Gordon equation. The BT, conservation laws (local and nonlocal), and the inverse-scattering formulation are discussed for the chiral and the self-dual Yang-Mills fields. Their possible applications to the loop formulation for the Yang-Mills fields are mentioned. 55 references, 1 figure

  9. Dual mass, H-script-spaces, self-dual gauge connections, and nonlinear gravitons with topological origin

    International Nuclear Information System (INIS)

    Magnon, A.; Departement de Mathematiques, Universite de Clermont-Fd. 63170 Aubiere, France)

    1986-01-01

    An analogy between source-free, asymptotically Taub--NUT magnetic monopole solutions to Einstein's equation and self-(anti-self-) dual gauge connections is displayed, which finds its origin in the first Chern class of these space-times. A definition of asymptotic graviton modes is proposed that suggests that a subclass of Penrose's nonlinear gravitons or Newman's H-script-spaces could emerge from nontrivial space-time topologies

  10. Self-Dual Configurations in a Generalized Abelian Chern-Simons-Higgs Model with Explicit Breaking of the Lorentz Covariance

    International Nuclear Information System (INIS)

    Sourrouille, Lucas; Casana, Rodolfo

    2016-01-01

    We have studied the existence of self-dual solitonic solutions in a generalization of the Abelian Chern-Simons-Higgs model. Such a generalization introduces two different nonnegative functions, ω_1(|ϕ|) and ω(|ϕ|), which split the kinetic term of the Higgs field, |D_μϕ|"2→ω_1(|ϕ|)|D_0ϕ|"2-ω(|ϕ|)|D_kϕ|"2, breaking explicitly the Lorentz covariance. We have shown that a clean implementation of the Bogomolnyi procedure only can be implemented whether ω(|ϕ|)∝β|ϕ|"2"β"-"2 with β≥1. The self-dual or Bogomolnyi equations produce an infinity number of soliton solutions by choosing conveniently the generalizing function ω_1(|ϕ|) which must be able to provide a finite magnetic field. Also, we have shown that by properly choosing the generalizing functions it is possible to reproduce the Bogomolnyi equations of the Abelian Maxwell-Higgs and Chern-Simons-Higgs models. Finally, some new self-dual |ϕ|"6-vortex solutions have been analyzed from both theoretical and numerical point of view.

  11. The critical behaviour of self-dual Z(N) spin systems - Finite size scaling and conformal invariance

    International Nuclear Information System (INIS)

    Alcaraz, F.C.

    1986-01-01

    Critical properties of a family of self-dual two dimensional Z(N) models whose bulk free energy is exacly known at the self-dual point are studied. The analysis is performed by studing the finite size behaviour of the corresponding one dimensional quantum Hamiltonians which also possess an exact solution at their self-dual point. By exploring finite size scaling ideas and the conformal invariance of the critical infinite system the critical temperature and critical exponents as well as the central charge associated with the underlying conformal algebra are calculated for N up to 8. The results strongly suggest that the recently constructed Z(N) quantum field theory of Zamolodchikov and Fateev (1985) is the underlying field theory associated with these statistical mechanical systems. It is also tested, for the Z(5) case, the conjecture that these models correspond to the bifurcation points, in the phase diagram of the general Z(N) spin model, where a massless phase originates. (Author) [pt

  12. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2011-01-01

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

  13. Comprehensive Benchmark Suite for Simulation of Particle Laden Flows Using the Discrete Element Method with Performance Profiles from the Multiphase Flow with Interface eXchanges (MFiX) Code

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Peiyuan [Univ. of Colorado, Boulder, CO (United States); Brown, Timothy [Univ. of Colorado, Boulder, CO (United States); Fullmer, William D. [Univ. of Colorado, Boulder, CO (United States); Hauser, Thomas [Univ. of Colorado, Boulder, CO (United States); Hrenya, Christine [Univ. of Colorado, Boulder, CO (United States); Grout, Ray [National Renewable Energy Lab. (NREL), Golden, CO (United States); Sitaraman, Hariswaran [National Renewable Energy Lab. (NREL), Golden, CO (United States)

    2016-01-29

    Five benchmark problems are developed and simulated with the computational fluid dynamics and discrete element model code MFiX. The benchmark problems span dilute and dense regimes, consider statistically homogeneous and inhomogeneous (both clusters and bubbles) particle concentrations and a range of particle and fluid dynamic computational loads. Several variations of the benchmark problems are also discussed to extend the computational phase space to cover granular (particles only), bidisperse and heat transfer cases. A weak scaling analysis is performed for each benchmark problem and, in most cases, the scalability of the code appears reasonable up to approx. 103 cores. Profiling of the benchmark problems indicate that the most substantial computational time is being spent on particle-particle force calculations, drag force calculations and interpolating between discrete particle and continuum fields. Hardware performance analysis was also carried out showing significant Level 2 cache miss ratios and a rather low degree of vectorization. These results are intended to serve as a baseline for future developments to the code as well as a preliminary indicator of where to best focus performance optimizations.

  14. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2011-01-01

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

  15. Digital Discretion

    DEFF Research Database (Denmark)

    Busch, Peter Andre; Zinner Henriksen, Helle

    2018-01-01

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

  16. SURF: a subroutine code to draw the axonometric projection of a surface generated by a scalar function over a discretized plane domain using finite element computations

    International Nuclear Information System (INIS)

    Giuliani, Giovanni; Giuliani, Silvano.

    1980-01-01

    The FORTRAN IV subroutine SURF has been designed to help visualising the results of Finite Element computations. It drawns the axonometric projection of a surface generated in 3-dimensional space by a scalar function over a discretized plane domain. The most important characteristic of the routine is to remove the hidden lines and in this way it enables a clear vision of the details of the generated surface

  17. Short-time dynamics of random-bond Potts ferromagnet with continuous self-dual quenched disorders

    OpenAIRE

    Pan, Z. Q.; Ying, H. P.; Gu, D. W.

    2001-01-01

    We present Monte Carlo simulation results of random-bond Potts ferromagnet with the Olson-Young self-dual distribution of quenched disorders in two-dimensions. By exploring the short-time scaling dynamics, we find universal power-law critical behavior of the magnetization and Binder cumulant at the critical point, and thus obtain estimates of the dynamic exponent $z$ and magnetic exponent $\\eta$, as well as the exponent $\\theta$. Our special attention is paid to the dynamic process for the $q...

  18. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2010-01-01

    The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: 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...

  19. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2010-01-01

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

  20. Study of Anti-Sliding Stability of a Dam Foundation Based on the Fracture Flow Method with 3D Discrete Element Code

    Directory of Open Access Journals (Sweden)

    Chong Shi

    2017-10-01

    Full Text Available Fractured seepage is an important factor affecting the interface stability of rock mass. It is closely related to fracture properties and hydraulic conditions. In this study, the law of seepage in a single fracture surface based on modified cubic law is described, and the three-dimensional discrete element method is used to simulate the dam foundation structure of the Capulin San Pablo (Costa Rica hydropower station. The effect of construction joints and developed structure on dam stability is studied, and its permeability law and sliding stability are also evaluated. It is found that the hydraulic-mechanical coupling with strength reduction method in DEM is more appropriate to use to study the seepage-related problems of fractured rock mass, which considers practical conditions, such as the roughness of and the width of fracture. The strength reduction method provides a more accurate safety factor of dam when considering the deformation coordination with bedrocks. It is an important method with which to study the stability of seepage conditions in complex structures. The discrete method also provided an effective and reasonable way of determining seepage control measures.

  1. A Deep Penetration Problem Calculation Using AETIUS:An Easy Modeling Discrete Ordinates Ṯransport Code UsIng Unstructured Tetrahedral Mesh, Shared Memory Parallel

    Directory of Open Access Journals (Sweden)

    KIM Jong Woon

    2017-01-01

    In this paper, we describe a brief overview of AETIUS and provide numerical results from both AETIUS and a Monte Carlo code, MCNP5, in a deep penetration problem with small detection volumes. The results demonstrate the effectiveness and efficiency of AETIUS for such calculations.

  2. The Classification of Complementary Information Set Codes of Lengths 14 and 16

    OpenAIRE

    Freibert, Finley

    2012-01-01

    In the paper "A new class of codes for Boolean masking of cryptographic computations," Carlet, Gaborit, Kim, and Sol\\'{e} defined a new class of rate one-half binary codes called \\emph{complementary information set} (or CIS) codes. The authors then classified all CIS codes of length less than or equal to 12. CIS codes have relations to classical Coding Theory as they are a generalization of self-dual codes. As stated in the paper, CIS codes also have important practical applications as they m...

  3. Discrete mechanics

    CERN Document Server

    Caltagirone, Jean-Paul

    2014-01-01

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

  4. Discrete mechanics

    International Nuclear Information System (INIS)

    Lee, T.D.

    1985-01-01

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

  5. MPEG-compliant joint source/channel coding using discrete cosine transform and substream scheduling for visual communication over packet networks

    Science.gov (United States)

    Kim, Seong-Whan; Suthaharan, Shan; Lee, Heung-Kyu; Rao, K. R.

    2001-01-01

    Quality of Service (QoS)-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channel coding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, first, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Second, we designed a classification scheme to partition the packet stream into multiple substreams which have their own QoS requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other two popular techniques by simulation and real video experiments on the TCP/IP environment.

  6. Nuclear GUI: a Graphical User Interface for 3D discrete ordinates neutral particle transport codes in the doors and BOT3P packages

    International Nuclear Information System (INIS)

    Saintagne, P.W.; Azmy, Y.Y.

    2005-01-01

    A GUI (Graphical User Interface) provides a graphical, interactive and intuitive link between the user and the software. It translates the user'actions into information, e.g; input data that is interpretable by the software. In order to develop an efficient GUI, it is important to master the target computational code. An initial version of a complete GUI for the DOORS and BOT3P packages for solving neutral particle transport problems in 3-dimensional geometry has been completed. This GUI is made of 4 components. The first component GipGui aims at handling cross-sections by mixing microscopic cross-sections from different libraries. The second component TORT-GUI provides the user a simple way to create or modify input files for the TORT codes that is a general purpose neutral transport code able to solve large problems with complex configurations. The third component GGTM-GUI prepares the data describing the problem configuration like the geometrical data, material assignment or key flux positions. The fourth component DTM3-GUI helps the user to visualize TORT results by providing data for a graphics post-processor

  7. Canonical reduction of self-dual Yang-Mills equations to Fitzhugh-Nagumo equation and exact solutions

    Energy Technology Data Exchange (ETDEWEB)

    Sayed, S.M. [Mathematics Department, Faculty of Science, Beni-Suef University, Beni-Suef (Egypt); Mathematics Department, P.O. Box 1144, Tabouk Teacher College, Ministry of Education (Saudi Arabia)], E-mail: eaashour@lycos.com; Gharib, G.M. [Mathematics Department, P.O. Box 1144, Tabouk Teacher College, Ministry of Education (Saudi Arabia)

    2009-01-30

    The (constrained) canonical reduction of four-dimensional self-dual Yang-Mills theory to two-dimensional Fitzhugh-Nagumo and the real Newell-Whitehead equations are considered. On the other hand, other methods and transformations are developed to obtain exact solutions for the original two-dimensional Fitzhugh-Nagumo and Newell-Whitehead equations. The corresponding gauge potential A{sub {mu}} and the gauge field strengths F{sub {mu}}{sub {nu}} are also obtained. New explicit and exact traveling wave and solitary solutions (for Fitzhugh-Nagumo and Newell-Whitehead equations) are obtained by using an improved sine-cosine method and the Wu's elimination method with the aid of Mathematica.

  8. Canonical reduction of self-dual Yang-Mills equations to Fitzhugh-Nagumo equation and exact solutions

    International Nuclear Information System (INIS)

    Sayed, S.M.; Gharib, G.M.

    2009-01-01

    The (constrained) canonical reduction of four-dimensional self-dual Yang-Mills theory to two-dimensional Fitzhugh-Nagumo and the real Newell-Whitehead equations are considered. On the other hand, other methods and transformations are developed to obtain exact solutions for the original two-dimensional Fitzhugh-Nagumo and Newell-Whitehead equations. The corresponding gauge potential A μ and the gauge field strengths F μν are also obtained. New explicit and exact traveling wave and solitary solutions (for Fitzhugh-Nagumo and Newell-Whitehead equations) are obtained by using an improved sine-cosine method and the Wu's elimination method with the aid of Mathematica.

  9. Self-dual cluster renormalization group approach for the square lattice Ising model specific heat and magnetization

    International Nuclear Information System (INIS)

    Martin, H.O.; Tsallis, C.

    1981-01-01

    A simple renormalization group approach based on self-dual clusters is proposed for two-dimensional nearest-neighbour 1/2 - spin Ising model on the square lattice; it reproduces the exact critical point. The internal energy and the specific heat for vanishing external magnetic field, spontaneous magnetization and the thermal (Y sub(T)) and magnetic (Y sub(H)) critical exponents are calculated. The results obtained from the first four smallest cluster sizes strongly suggest the convergence towards the exact values when the cluster sizes increases. Even for the smallest cluster, where the calculation is very simple, the results are quite accurate, particularly in the neighbourhood of the critical point. (Author) [pt

  10. Local solutions of harmonical and Bi-harmonical equations, universal field equation and self-dual configurations of Yang-Mills fields in four dimensions

    International Nuclear Information System (INIS)

    Leznov, A.N.

    1994-01-01

    A general method for the construction of solutions of the d'Alamberian and double d'Alamberian (harmonic and bi-harmonic) equations with local dependence of arbitrary functions upon two independent arguments is proposed. The connection between solutions of this kind and self-dual configurations of gauge fields having no singularities is established. 5 refs

  11. Discrete optimization

    CERN Document Server

    Parker, R Gary

    1988-01-01

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

  12. Discrete gradients in discrete classical mechanics

    International Nuclear Information System (INIS)

    Renna, L.

    1987-01-01

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

  13. Discrete transforms

    CERN Document Server

    Firth, Jean M

    1992-01-01

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

  14. Classical boundary-value problem in Riemannian quantum gravity and self-dual Taub-NUT-(anti)de Sitter geometries

    International Nuclear Information System (INIS)

    Akbar, M.M.; D'Eath, P.D.

    2003-01-01

    The classical boundary-value problem of the Einstein field equations is studied with an arbitrary cosmological constant, in the case of a compact (S 3 ) boundary given a biaxial Bianchi-IX positive-definite three-metric, specified by two radii (a,b). For the simplest, four-ball, topology of the manifold with this boundary, the regular classical solutions are found within the family of Taub-NUT-(anti)de Sitter metrics with self-dual Weyl curvature. For arbitrary choice of positive radii (a,b), we find that there are three solutions for the infilling geometry of this type. We obtain exact solutions for them and for their Euclidean actions. The case of negative cosmological constant is investigated further. For reasonable squashing of the three-sphere, all three infilling solutions have real-valued actions which possess a 'cusp catastrophe' structure with a non-self-intersecting 'catastrophe manifold' implying that the dominant contribution comes from the unique real positive-definite solution on the ball. The positive-definite solution exists even for larger deformations of the three-sphere, as long as a certain inequality between a and b holds. The action of this solution is proportional to -a 3 for large a (∼b) and hence larger radii are favoured. The same boundary-value problem with more complicated interior topology containing a 'bolt' is investigated in a forthcoming paper

  15. Recent developments in discrete ordinates electron transport

    International Nuclear Information System (INIS)

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

    1986-01-01

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

  16. Duality in non-linear B and F models: equivalence between self-dual and topologically massive Born-Infeld B and F models

    International Nuclear Information System (INIS)

    Menezes, R.; Nascimento, J.R.S.; Ribeiro, R.F.; Wotzasek, C.

    2002-01-01

    We study the dual equivalence between the non-linear generalization of the self-dual (NSD BF ) and the topologically massive B and F models with particular emphasis on the non-linear electrodynamics proposed by Born and Infeld. This is done through a dynamical gauge embedding of the non-linear self-dual model yielding to a gauge invariant and dynamically equivalent theory. We clearly show that non-polinomial NSD BF models can be map, through a properly defined duality transformation into TM BF actions. The general result obtained is then particularized for a number of examples, including the Born-Infeld-BF (BIBF) model that has experienced a revival in the recent literature

  17. On quadratic residue codes and hyperelliptic curves

    Directory of Open Access Journals (Sweden)

    David Joyner

    2008-01-01

    Full Text Available For an odd prime p and each non-empty subset S⊂GF(p, consider the hyperelliptic curve X S defined by y 2 =f S (x, where f S (x = ∏ a∈S (x-a. Using a connection between binary quadratic residue codes and hyperelliptic curves over GF(p, this paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufficiently large primes p there exists a subset S⊂GF(p for which the bound |X S (GF(p| > 1.39p holds. We also use the quasi-quadratic residue codes defined below to construct an example of a formally self-dual optimal code whose zeta function does not satisfy the ``Riemann hypothesis.''

  18. Applied algebra codes, ciphers and discrete algorithms

    CERN Document Server

    Hardy, Darel W; Walker, Carol L

    2009-01-01

    This book attempts to show the power of algebra in a relatively simple setting.-Mathematical Reviews, 2010… The book supports learning by doing. In each section we can find many examples which clarify the mathematics introduced in the section and each section is followed by a series of exercises of which approximately half are solved in the end of the book. Additional the book comes with a CD-ROM containing an interactive version of the book powered by the computer algebra system Scientific Notebook. … the mathematics in the book are developed as needed and the focus of the book lies clearly o

  19. Discrete Curvatures and Discrete Minimal Surfaces

    KAUST Repository

    Sun, Xiang

    2012-01-01

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

  20. Discrete Curvatures and Discrete Minimal Surfaces

    KAUST Repository

    Sun, Xiang

    2012-06-01

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

  1. Infinite-Dimensional Symmetry Algebras as a Help Toward Solutions of the Self-Dual Field Equations with One Killing Vector

    Science.gov (United States)

    Finley, Daniel; McIver, John K.

    2002-12-01

    The sDiff(2) Toda equation determines all self-dual, vacuum solutions of the Einstein field equations with one rotational Killing vector. Some history of the searches for non-trivial solutions is given, including those that begin with the limit as n → ∞ of the An Toda lattice equations. That approach is applied here to the known prolongation structure for the Toda lattice, hoping to use Bäcklund transformations to generate new solutions. Although this attempt has not yet succeeded, new faithful (tangent-vector) realizations of A∞ are described, and a direct approach via the continuum Lie algebras of Saveliev and Leznov is given.

  2. The topological B-model on fattened complex manifolds and subsectors of N=4 self-dual Yang-Mills theory

    International Nuclear Information System (INIS)

    Saemann, Christian

    2005-01-01

    In this paper, we propose so-called fattened complex manifolds as target spaces for the topological B-model. We naturally obtain these manifolds by restricting the structure sheaf of the N=4 supertwistor space, a process, which can be understood as a fermionic dimensional reduction. Using the twistorial description of these fattened complex manifolds, we construct Penrose-Ward transforms between solutions to the holomorphic Chern-Simons equations on these spaces and bosonic subsectors of solutions to the N=4 self-dual Yang-Mills equations on C 4 or R 4 . Furthermore, we comment on Yau's theorem for these spaces. (author)

  3. Critical surface of the quenched bond-diluted cubic model in self-dual lattice: renormalisation group approach

    International Nuclear Information System (INIS)

    Silva, E.P. da; Tsallis, C.

    1991-01-01

    We propose a quite simple real space renormalisation group which enables us to calculate (for the first time as far as we know, and presumably with high precision) the critical surface of the quenched bond-diluted discrete N-vector ferromagnet. (author)

  4. Sputtering calculations with the discrete ordinated method

    International Nuclear Information System (INIS)

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

    1977-01-01

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

  5. Mimetic discretization methods

    CERN Document Server

    Castillo, Jose E

    2013-01-01

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

  6. The OSp(32 vertical stroke 1) versus OSp(8 vertical stroke 2) supersymmetric M-brane action from self-dual (2,2) strings

    International Nuclear Information System (INIS)

    Ketov, S.V.

    1996-09-01

    Taking the (2,2) strings as a starting point, we discuss the equivalent self-dual field theories and analyze their symmetry structure in 2+2 dimensions from the viewpoint of string/membrane unification. Requiring the 'Lorentz' invariance and supersymmetry in the (2,2) string target space leads to an extension of the (2,2) string theory to a theory of 2+2 dimensional supermembranes (M-branes) propagating in a higher dimensional target space. The origin of the hidden target space dimensions of the M-brane is related to the maximally extended supersymmetry implied by the 'Lorentz' covariance and dimensional reasons. The Kaehler-Chern-Simons-type action describing the self-dual gravity in 2+2 dimensions is proposed. Its maximal supersymmetrization (of the Green-Schwarz-type) naturally leads to the 2+10 (or higher) dimensions for the M-brane target space. The proposed OSp(32 vertical stroke 1) supersymmetric action gives the pre-geometrical description of M-branes, which may be useful for a fundamental formulation of F and M theory. (orig.)

  7. Multiband discrete ordinates method: formalism and results

    International Nuclear Information System (INIS)

    Luneville, L.

    1998-06-01

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

  8. Baecklund transformation for supersymmetric self-dual theories for semisimple gauge groups and a hierarchy of A1 solutions

    International Nuclear Information System (INIS)

    Devchand, C.

    1994-01-01

    We present a Baecklund transformation (a discrete symmetry transformation) for the self-duality equations for supersymmetric gauge theories in N-extended super-Minkowski space M 4vertical stroke 4N for an arbitrary semisimple gauge group. For the case of an A 1 gauge algebra we integrate the transformation starting with a given solution and iterating the process we construct a hierarchy of explicit solutions. (orig.)

  9. Time Discretization Techniques

    KAUST Repository

    Gottlieb, S.; Ketcheson, David I.

    2016-01-01

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

  10. Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes

    Science.gov (United States)

    Harrington, James William

    Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present

  11. Methodology for solving the equation of transport ordered discrete TORT code in the reactor IPEN/MB-01; Metodologia para resolver la ecuacion del transporte con el codigo de Ordenadas Discretas TORT en el reactor IPEN/MB-01

    Energy Technology Data Exchange (ETDEWEB)

    Bernal, A.; Abarca, A.; Barrachina, T.; Miro, R.; Verdu, G.

    2013-07-01

    The resolution of the neutron transport equation in steady state in pool-type nuclear reactors, is normally achieved through 2 different numerical methods: Monte Carlo (stochastic) and discrete ordinates (deterministic). The discrete ordinates method solves the neutron transport equation for a set of specific addresses, obtaining a set of equations and solutions for each direction, where the solution for each direction is the angular flux. With the aim of treating energy dependence, used energy multigroup approximation, thus obtaining a set of equations that depends on the number of energy groups considered.

  12. Nuclear data preparation and discrete ordinates calculation

    International Nuclear Information System (INIS)

    Carmignani, B.

    1980-01-01

    These lectures deal with the use of the GAM-GATHER and GAM-THERMOS chains for the calculation of lattice cross sections and within use of the discrete ordinates one dimensional ANISN code for the calculation of criticality and flux distribution of the cell and of the whole reactor. As an example the codes are applied to the calculation of a PWR. Results of different approximations are compared. (author)

  13. Joint source-channel coding using variable length codes

    NARCIS (Netherlands)

    Balakirsky, V.B.

    2001-01-01

    We address the problem of joint source-channel coding when variable-length codes are used for information transmission over a discrete memoryless channel. Data transmitted over the channel are interpreted as pairs (m k ,t k ), where m k is a message generated by the source and t k is a time instant

  14. The K-Z Equation and the Quantum-Group Difference Equation in Quantum Self-dual Yang-Mills Theory

    OpenAIRE

    Chau, Ling-Lie; Yamanaka, Itaru

    1995-01-01

    From the time-independent current $\\tcj(\\bar y,\\bar k)$ in the quantum self-dual Yang-Mills (SDYM) theory, we construct new group-valued quantum fields $\\tilde U(\\bar y,\\bar k)$ and $\\bar U^{-1}(\\bar y,\\bar k)$ which satisfy a set of exchange algebras such that fields of $\\tcj(\\bar y,\\bar k)\\sim\\tilde U(\\bar y,\\bar k)~\\partial\\bar y~\\tilde U^{-1}(\\bar y,\\bar k)$ satisfy the original time-independent current algebras. For the correlation functions of the products of the $\\tilde U(\\bar y,\\bar k...

  15. Baecklund transformations for discrete Painleve equations: Discrete PII-PV

    International Nuclear Information System (INIS)

    Sakka, A.; Mugan, U.

    2006-01-01

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

  16. Discrete Gabor transform and discrete Zak transform

    NARCIS (Netherlands)

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

    1996-01-01

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

  17. Fracture flow code

    International Nuclear Information System (INIS)

    Dershowitz, W; Herbert, A.; Long, J.

    1989-03-01

    The hydrology of the SCV site will be modelled utilizing discrete fracture flow models. These models are complex, and can not be fully cerified by comparison to analytical solutions. The best approach for verification of these codes is therefore cross-verification between different codes. This is complicated by the variation in assumptions and solution techniques utilized in different codes. Cross-verification procedures are defined which allow comparison of the codes developed by Harwell Laboratory, Lawrence Berkeley Laboratory, and Golder Associates Inc. Six cross-verification datasets are defined for deterministic and stochastic verification of geometric and flow features of the codes. Additional datasets for verification of transport features will be documented in a future report. (13 figs., 7 tabs., 10 refs.) (authors)

  18. Discrete Mathematics Re "Tooled."

    Science.gov (United States)

    Grassl, Richard M.; Mingus, Tabitha T. Y.

    1999-01-01

    Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

  19. Homogenization of discrete media

    International Nuclear Information System (INIS)

    Pradel, F.; Sab, K.

    1998-01-01

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

  20. Discrete density of states

    International Nuclear Information System (INIS)

    Aydin, Alhun; Sisman, Altug

    2016-01-01

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

  1. Discrete density of states

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-03-22

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

  2. Discrete control systems

    CERN Document Server

    Okuyama, Yoshifumi

    2014-01-01

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

  3. Discrete repulsive oscillator wavefunctions

    International Nuclear Information System (INIS)

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

    2009-01-01

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

  4. Discrete Element Modeling

    Energy Technology Data Exchange (ETDEWEB)

    Morris, J; Johnson, S

    2007-12-03

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

  5. Code Cactus; Code Cactus

    Energy Technology Data Exchange (ETDEWEB)

    Fajeau, M; Nguyen, L T; Saunier, J [Commissariat a l' Energie Atomique, Centre d' Etudes Nucleaires de Saclay, 91 - Gif-sur-Yvette (France)

    1966-09-01

    This code handles the following problems: -1) Analysis of thermal experiments on a water loop at high or low pressure; steady state or transient behavior; -2) Analysis of thermal and hydrodynamic behavior of water-cooled and moderated reactors, at either high or low pressure, with boiling permitted; fuel elements are assumed to be flat plates: - Flowrate in parallel channels coupled or not by conduction across plates, with conditions of pressure drops or flowrate, variable or not with respect to time is given; the power can be coupled to reactor kinetics calculation or supplied by the code user. The code, containing a schematic representation of safety rod behavior, is a one dimensional, multi-channel code, and has as its complement (FLID), a one-channel, two-dimensional code. (authors) [French] Ce code permet de traiter les problemes ci-dessous: 1. Depouillement d'essais thermiques sur boucle a eau, haute ou basse pression, en regime permanent ou transitoire; 2. Etudes thermiques et hydrauliques de reacteurs a eau, a plaques, a haute ou basse pression, ebullition permise: - repartition entre canaux paralleles, couples on non par conduction a travers plaques, pour des conditions de debit ou de pertes de charge imposees, variables ou non dans le temps; - la puissance peut etre couplee a la neutronique et une representation schematique des actions de securite est prevue. Ce code (Cactus) a une dimension d'espace et plusieurs canaux, a pour complement Flid qui traite l'etude d'un seul canal a deux dimensions. (auteurs)

  6. Infant differential behavioral responding to discrete emotions.

    Science.gov (United States)

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

    2017-10-01

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

  7. Discrete Calculus by Analogy

    CERN Document Server

    Izadi, F A; Bagirov, G

    2009-01-01

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

  8. Direct Discrete Method for Neutronic Calculations

    International Nuclear Information System (INIS)

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

    2002-01-01

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

  9. Finite Discrete Gabor Analysis

    DEFF Research Database (Denmark)

    Søndergaard, Peter Lempel

    2007-01-01

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

  10. Adaptive Discrete Hypergraph Matching.

    Science.gov (United States)

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

    2018-02-01

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

  11. Discrete fractional calculus

    CERN Document Server

    Goodrich, Christopher

    2015-01-01

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

  12. Discrete quantum gravity

    International Nuclear Information System (INIS)

    Williams, Ruth M

    2006-01-01

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

  13. Discrete computational structures

    CERN Document Server

    Korfhage, Robert R

    1974-01-01

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

  14. Discrete stochastic processes and applications

    CERN Document Server

    Collet, Jean-François

    2018-01-01

    This unique text for beginning graduate students gives a self-contained introduction to the mathematical properties of stochastics and presents their applications to Markov processes, coding theory, population dynamics, and search engine design. The book is ideal for a newly designed course in an introduction to probability and information theory. Prerequisites include working knowledge of linear algebra, calculus, and probability theory. The first part of the text focuses on the rigorous theory of Markov processes on countable spaces (Markov chains) and provides the basis to developing solid probabilistic intuition without the need for a course in measure theory. The approach taken is gradual beginning with the case of discrete time and moving on to that of continuous time. The second part of this text is more applied; its core introduces various uses of convexity in probability and presents a nice treatment of entropy.

  15. Discrete Alfven waves in the TORTUS tokamak

    International Nuclear Information System (INIS)

    Amagishi, Y.; Ballico, M.J.; Cross, R.C.; Donnely, I.J.

    1989-01-01

    Discrete Alfven Waves (DAWs) have been observed as antenna resistance peaks and as enhanced edge fields in the TORTUS tokamak during Alfven wave heating experiments. A kinetic theory code has been used to calculate the antenna loading and the structure of the DAW fields for a range of plasma current and density profiles. There is fair agreement between the measured and predicted amplitude of the DAW fields in the plasma edge when both are normalized to the same antenna power

  16. Homogenization of discrete media

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-11-01

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

  17. DISCRETE MATHEMATICS/NUMBER THEORY

    OpenAIRE

    Mrs. Manju Devi*

    2017-01-01

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

  18. Discrete-Event Simulation

    Directory of Open Access Journals (Sweden)

    Prateek Sharma

    2015-04-01

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

  19. Discrete systems and integrability

    CERN Document Server

    Hietarinta, J; Nijhoff, F W

    2016-01-01

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

  20. Introductory discrete mathematics

    CERN Document Server

    Balakrishnan, V K

    2010-01-01

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

  1. Discrete-Event Simulation

    OpenAIRE

    Prateek Sharma

    2015-01-01

    Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of ev...

  2. SPANDOM - source projection analytic nodal discrete ordinates method

    International Nuclear Information System (INIS)

    Kim, Tae Hyeong; Cho, Nam Zin

    1994-01-01

    We describe a new discrete ordinates nodal method for the two-dimensional transport equation. We solve the discrete ordinates equation analytically after the source term is projected and represented in polynomials. The method is applied to two fast reactor benchmark problems and compared with the TWOHEX code. The results indicate that the present method accurately predicts not only multiplication factor but also flux distribution

  3. Discrete Feature Model (DFM) User Documentation

    International Nuclear Information System (INIS)

    Geier, Joel

    2008-06-01

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

  4. Discrete Feature Model (DFM) User Documentation

    Energy Technology Data Exchange (ETDEWEB)

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

    2008-06-15

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

  5. Discrete-Time Systems

    Indian Academy of Sciences (India)

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

  6. Discrete Lorentzian quantum gravity

    NARCIS (Netherlands)

    Loll, R.

    2000-01-01

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

  7. What Is Discrete Mathematics?

    Science.gov (United States)

    Sharp, Karen Tobey

    This paper cites information received from a number of sources, e.g., mathematics teachers in two-year colleges, publishers, and convention speakers, about the nature of discrete mathematics and about what topics a course in this subject should contain. Note is taken of the book edited by Ralston and Young which discusses the future of college…

  8. Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

    KAUST Repository

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

    2017-01-01

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

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

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  10. Energy-pointwise discrete ordinates transport methods

    International Nuclear Information System (INIS)

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

    1997-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Luneville, L

    1998-06-01

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

  12. Generalized hypercube graph $\\Q_n(S$, graph products and self-orthogonal codes

    Directory of Open Access Journals (Sweden)

    Pani Seneviratne

    2016-01-01

    Full Text Available A generalized hypercube graph $\\Q_n(S$ has $\\F_{2}^{n}=\\{0,1\\}^n$ as the vertex set and two vertices being adjacent whenever their mutual Hamming distance belongs to $S$, where $n \\ge 1$ and $S\\subseteq \\{1,2,\\ldots, n\\}$. The graph $\\Q_n(\\{1\\}$ is the $n$-cube, usually denoted by $\\Q_n$.We study graph boolean products $G_1 = \\Q_n(S\\times \\Q_1, G_2 = \\Q_{n}(S\\wedge \\Q_1$, $G_3 = \\Q_{n}(S[\\Q_1]$ and show that binary codes from neighborhood designs of $G_1, G_2$ and $G_3$ are self-orthogonal for all choices of $n$ and $S$. More over, we show that the class of codes $C_1$ are self-dual. Further we find subgroups of the automorphism group of these graphs and use these subgroups to obtain PD-sets for permutation decoding. As an example we find a full error-correcting PD set for the binary $[32, 16, 8]$ extremal self-dual code.

  13. Discrete mathematics with applications

    CERN Document Server

    Koshy, Thomas

    2003-01-01

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

  14. Discrete and computational geometry

    CERN Document Server

    Devadoss, Satyan L

    2011-01-01

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

  15. Lectures on discrete geometry

    CERN Document Server

    2002-01-01

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

  16. Time Discretization Techniques

    KAUST Repository

    Gottlieb, S.

    2016-10-12

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

  17. Discrete pseudo-integrals

    Czech Academy of Sciences Publication Activity Database

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

    2013-01-01

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

  18. Discrete variational Hamiltonian mechanics

    International Nuclear Information System (INIS)

    Lall, S; West, M

    2006-01-01

    The main contribution of this paper is to present a canonical choice of a Hamiltonian theory corresponding to the theory of discrete Lagrangian mechanics. We make use of Lagrange duality and follow a path parallel to that used for construction of the Pontryagin principle in optimal control theory. We use duality results regarding sensitivity and separability to show the relationship between generating functions and symplectic integrators. We also discuss connections to optimal control theory and numerical algorithms

  19. Discrete Routh reduction

    International Nuclear Information System (INIS)

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

    2006-01-01

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

  20. Discrete port-Hamiltonian systems

    NARCIS (Netherlands)

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

    2006-01-01

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

  1. A paradigm for discrete physics

    International Nuclear Information System (INIS)

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

    1987-01-01

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

  2. Finite Volumes Discretization of Topology Optimization Problems

    DEFF Research Database (Denmark)

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

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

  3. Coding Partitions

    Directory of Open Access Journals (Sweden)

    Fabio Burderi

    2007-05-01

    Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.

  4. Two new discrete integrable systems

    International Nuclear Information System (INIS)

    Chen Xiao-Hong; Zhang Hong-Qing

    2013-01-01

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

  5. Discrete dark matter

    CERN Document Server

    Hirsch, M; Peinado, E; Valle, J W F

    2010-01-01

    We propose a new motivation for the stability of dark matter (DM). We suggest that the same non-abelian discrete flavor symmetry which accounts for the observed pattern of neutrino oscillations, spontaneously breaks to a Z2 subgroup which renders DM stable. The simplest scheme leads to a scalar doublet DM potentially detectable in nuclear recoil experiments, inverse neutrino mass hierarchy, hence a neutrinoless double beta decay rate accessible to upcoming searches, while reactor angle equal to zero gives no CP violation in neutrino oscillations.

  6. Discrete Dynamics Lab

    Science.gov (United States)

    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.

  7. Generation of discrete inelastic and elastic transfer matrix

    International Nuclear Information System (INIS)

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

    1985-01-01

    A technique developed for the calculation of the isotropic and linearly anisotropic components components of elastic and discrete inelastic transfer matrices is presented in this work. The implementation of the technique is discussed in detail and numerical results obtained for some examples are compared with results reported in the literature or generated with the use of several processing codes. (author) [pt

  8. DOMINO, Coupling of Discrete Ordinate Program DOT with Monte-Carlo Program MORSE

    International Nuclear Information System (INIS)

    1974-01-01

    1 - Nature of physical problem solved: DOMINO is a general purpose code for coupling discrete ordinates and Monte Carlo radiation transport calculations. 2 - Method of solution: DOMINO transforms the angular flux as a function of energy group, mesh interval and discrete angle into current and subsequently into normalized probability distributions. 3 - Restrictions on the complexity of the problem: The discrete ordinates calculation is limited to an r-z geometry

  9. Finite discrete field theory

    International Nuclear Information System (INIS)

    Souza, Manoelito M. de

    1997-01-01

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

  10. Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

    KAUST Repository

    Mohamed, Mamdouh S.

    2017-05-23

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

  11. A new computer code for discrete fracture network modelling

    Science.gov (United States)

    Xu, Chaoshui; Dowd, Peter

    2010-03-01

    The authors describe a comprehensive software package for two- and three-dimensional stochastic rock fracture simulation using marked point processes. Fracture locations can be modelled by a Poisson, a non-homogeneous, a cluster or a Cox point process; fracture geometries and properties are modelled by their respective probability distributions. Virtual sampling tools such as plane, window and scanline sampling are included in the software together with a comprehensive set of statistical tools including histogram analysis, probability plots, rose diagrams and hemispherical projections. The paper describes in detail the theoretical basis of the implementation and provides a case study in rock fracture modelling to demonstrate the application of the software.

  12. Application of methods of discrete mathematics at modular synthesis of mechatronic devices

    OpenAIRE

    Nikiforov, S.; Nikiforov, B.; Mandarov, E.; Rabdanova, N.

    2010-01-01

    The article is devoted to application of methods of discrete mathematics (the theory of counts, the method of matrix code and others) and synthesis of executive mechanisms of mechatronic handling devices

  13. Advances in discrete differential geometry

    CERN Document Server

    2016-01-01

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

  14. Poisson hierarchy of discrete strings

    International Nuclear Information System (INIS)

    Ioannidou, Theodora; Niemi, Antti J.

    2016-01-01

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

  15. Poisson hierarchy of discrete strings

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-01-28

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

  16. Computer code ANISN multiplying media and shielding calculation II. Code description (input/output)

    International Nuclear Information System (INIS)

    Maiorino, J.R.

    1990-01-01

    The user manual of the ANISN computer code describing input and output subroutines is presented. ANISN code was developed to solve one-dimensional transport equation for neutron or gamma rays in slab, sphere or cylinder geometry with general anisotropic scattering. The solution technique is the discrete ordinate method. (M.C.K.)

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

    International Nuclear Information System (INIS)

    Ching, J.T.

    1975-01-01

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

  18. Principles of discrete time mechanics

    CERN Document Server

    Jaroszkiewicz, George

    2014-01-01

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

  19. Dark discrete gauge symmetries

    International Nuclear Information System (INIS)

    Batell, Brian

    2011-01-01

    We investigate scenarios in which dark matter is stabilized by an Abelian Z N discrete gauge symmetry. Models are surveyed according to symmetries and matter content. Multicomponent dark matter arises when N is not prime and Z N contains one or more subgroups. The dark sector interacts with the visible sector through the renormalizable kinetic mixing and Higgs portal operators, and we highlight the basic phenomenology in these scenarios. In particular, multiple species of dark matter can lead to an unconventional nuclear recoil spectrum in direct detection experiments, while the presence of new light states in the dark sector can dramatically affect the decays of the Higgs at the Tevatron and LHC, thus providing a window into the gauge origin of the stability of dark matter.

  20. Discrete anti-gravity

    International Nuclear Information System (INIS)

    Noyes, H.P.; Starson, S.

    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

  1. The computer code system for reactor radiation shielding in design of nuclear power plant

    International Nuclear Information System (INIS)

    Li Chunhuai; Fu Shouxin; Liu Guilian

    1995-01-01

    The computer code system used in reactor radiation shielding design of nuclear power plant includes the source term codes, discrete ordinate transport codes, Monte Carlo and Albedo Monte Carlo codes, kernel integration codes, optimization code, temperature field code, skyshine code, coupling calculation codes and some processing codes for data libraries. This computer code system has more satisfactory variety of codes and complete sets of data library. It is widely used in reactor radiation shielding design and safety analysis of nuclear power plant and other nuclear facilities

  2. Speaking Code

    DEFF Research Database (Denmark)

    Cox, Geoff

    Speaking Code begins by invoking the “Hello World” convention used by programmers when learning a new language, helping to establish the interplay of text and code that runs through the book. Interweaving the voice of critical writing from the humanities with the tradition of computing and software...

  3. Control of Discrete Event Systems

    NARCIS (Netherlands)

    Smedinga, Rein

    1989-01-01

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

  4. Discrete Mathematics and Its Applications

    Science.gov (United States)

    Oxley, Alan

    2010-01-01

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

  5. Discrete Mathematics and Curriculum Reform.

    Science.gov (United States)

    Kenney, Margaret J.

    1996-01-01

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

  6. Connections on discrete fibre bundles

    International Nuclear Information System (INIS)

    Manton, N.S.; Cambridge Univ.

    1987-01-01

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

  7. LDPC Code Design for Nonuniform Power-Line Channels

    Directory of Open Access Journals (Sweden)

    Sanaei Ali

    2007-01-01

    Full Text Available We investigate low-density parity-check code design for discrete multitone channels over power lines. Discrete multitone channels are well modeled as nonuniform channels, that is, different bits experience various channel parameters. We propose a coding system for discrete multitone channels that allows for using a single code over a nonuniform channel. The number of code parameters for the proposed system is much greater than the number of code parameters in conventional channel. Therefore, search-based optimization methods are impractical. We first formulate the problem of optimizing the rate of an irregular low-density parity-check code, with guaranteed convergence over a general nonuniform channel, as an iterative linear programming which is significantly more efficient than search-based methods. Then we use this technique for a typical power-line channel. The methodology of this paper is directly applicable to all decoding algorithms for which a density evolution analysis is possible.

  8. Discrete dynamics versus analytic dynamics

    DEFF Research Database (Denmark)

    Toxværd, Søren

    2014-01-01

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

  9. Modern approaches to discrete curvature

    CERN Document Server

    Romon, Pascal

    2017-01-01

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

  10. Approximate Schur complement preconditioning of the lowest order nodal discretizations

    Energy Technology Data Exchange (ETDEWEB)

    Moulton, J.D.; Ascher, U.M. [Univ. of British Columbia, Vancouver, British Columbia (Canada); Morel, J.E. [Los Alamos National Lab., NM (United States)

    1996-12-31

    Particular classes of nodal methods and mixed hybrid finite element methods lead to equivalent, robust and accurate discretizations of 2nd order elliptic PDEs. However, widespread popularity of these discretizations has been hindered by the awkward linear systems which result. The present work exploits this awkwardness, which provides a natural partitioning of the linear system, by defining two optimal preconditioners based on approximate Schur complements. Central to the optimal performance of these preconditioners is their sparsity structure which is compatible with Dendy`s black box multigrid code.

  11. Discretion and Disproportionality

    Directory of Open Access Journals (Sweden)

    Jason A. Grissom

    2015-12-01

    Full Text Available Students of color are underrepresented in gifted programs relative to White students, but the reasons for this underrepresentation are poorly understood. We investigate the predictors of gifted assignment using nationally representative, longitudinal data on elementary students. We document that even among students with high standardized test scores, Black students are less likely to be assigned to gifted services in both math and reading, a pattern that persists when controlling for other background factors, such as health and socioeconomic status, and characteristics of classrooms and schools. We then investigate the role of teacher discretion, leveraging research from political science suggesting that clients of government services from traditionally underrepresented groups benefit from diversity in the providers of those services, including teachers. Even after conditioning on test scores and other factors, Black students indeed are referred to gifted programs, particularly in reading, at significantly lower rates when taught by non-Black teachers, a concerning result given the relatively low incidence of assignment to own-race teachers among Black students.

  12. Discrete Planck spectra

    International Nuclear Information System (INIS)

    Vlad, Valentin I.; Ionescu-Pallas, Nicholas

    2000-10-01

    The Planck radiation spectrum of ideal cubic and spherical cavities, in the region of small adiabatic invariance, γ = TV 1/3 , is shown to be discrete and strongly dependent on the cavity geometry and temperature. This behavior is the consequence of the random distribution of the state weights in the cubic cavity and of the random overlapping of the successive multiplet components, for the spherical cavity. The total energy (obtained by summing up the exact contributions of the eigenvalues and their weights, for low values of the adiabatic invariance) does not obey any longer Stefan-Boltzmann law. The new law includes a corrective factor depending on γ and imposes a faster decrease of the total energy to zero, for γ → 0. We have defined the double quantized regime both for cubic and spherical cavities by the superior and inferior limits put on the principal quantum numbers or the adiabatic invariance. The total energy of the double quantized cavities shows large differences from the classical calculations over unexpected large intervals, which are measurable and put in evidence important macroscopic quantum effects. (author)

  13. Quantum BCH Codes Based on Spectral Techniques

    International Nuclear Information System (INIS)

    Guo Ying; Zeng Guihua

    2006-01-01

    When the time variable in quantum signal processing is discrete, the Fourier transform exists on the vector space of n-tuples over the Galois field F 2 , which plays an important role in the investigation of quantum signals. By using Fourier transforms, the idea of quantum coding theory can be described in a setting that is much different from that seen that far. Quantum BCH codes can be defined as codes whose quantum states have certain specified consecutive spectral components equal to zero and the error-correcting ability is also described by the number of the consecutive zeros. Moreover, the decoding of quantum codes can be described spectrally with more efficiency.

  14. Coding Labour

    Directory of Open Access Journals (Sweden)

    Anthony McCosker

    2014-03-01

    Full Text Available As well as introducing the Coding Labour section, the authors explore the diffusion of code across the material contexts of everyday life, through the objects and tools of mediation, the systems and practices of cultural production and organisational management, and in the material conditions of labour. Taking code beyond computation and software, their specific focus is on the increasingly familiar connections between code and labour with a focus on the codification and modulation of affect through technologies and practices of management within the contemporary work organisation. In the grey literature of spreadsheets, minutes, workload models, email and the like they identify a violence of forms through which workplace affect, in its constant flux of crisis and ‘prodromal’ modes, is regulated and governed.

  15. Perfect discretization of path integrals

    International Nuclear Information System (INIS)

    Steinhaus, Sebastian

    2012-01-01

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

  16. Perfect discretization of path integrals

    Science.gov (United States)

    Steinhaus, Sebastian

    2012-05-01

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

  17. The origin of discrete particles

    CERN Document Server

    Bastin, T

    2009-01-01

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

  18. Synchronization Techniques in Parallel Discrete Event Simulation

    OpenAIRE

    Lindén, Jonatan

    2018-01-01

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

  19. 3-D Discrete Analytical Ridgelet Transform

    OpenAIRE

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

    2006-01-01

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

  20. Multiuser Random Coding Techniques for Mismatched Decoding

    OpenAIRE

    Scarlett, Jonathan; Martinez, Alfonso; Guillén i Fàbregas, Albert

    2016-01-01

    This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth...

  1. Speech coding

    Energy Technology Data Exchange (ETDEWEB)

    Ravishankar, C., Hughes Network Systems, Germantown, MD

    1998-05-08

    Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the

  2. Exact analysis of discrete data

    CERN Document Server

    Hirji, Karim F

    2005-01-01

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

  3. Discrete geometric structures for architecture

    KAUST Repository

    Pottmann, Helmut

    2010-01-01

    . 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

  4. Causal Dynamics of Discrete Surfaces

    Directory of Open Access Journals (Sweden)

    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.

  5. Optimal codes as Tanner codes with cyclic component codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Pinero, Fernando; Zeng, Peng

    2014-01-01

    In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe ...

  6. Perfect discretization of path integrals

    OpenAIRE

    Steinhaus, Sebastian

    2011-01-01

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

  7. Applied discrete-time queues

    CERN Document Server

    Alfa, Attahiru S

    2016-01-01

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

  8. Aztheca Code

    International Nuclear Information System (INIS)

    Quezada G, S.; Espinosa P, G.; Centeno P, J.; Sanchez M, H.

    2017-09-01

    This paper presents the Aztheca code, which is formed by the mathematical models of neutron kinetics, power generation, heat transfer, core thermo-hydraulics, recirculation systems, dynamic pressure and level models and control system. The Aztheca code is validated with plant data, as well as with predictions from the manufacturer when the reactor operates in a stationary state. On the other hand, to demonstrate that the model is applicable during a transient, an event occurred in a nuclear power plant with a BWR reactor is selected. The plant data are compared with the results obtained with RELAP-5 and the Aztheca model. The results show that both RELAP-5 and the Aztheca code have the ability to adequately predict the behavior of the reactor. (Author)

  9. MAGNETOHYDRODYNAMIC EQUATIONS (MHD GENERATION CODE

    Directory of Open Access Journals (Sweden)

    Francisco Frutos Alfaro

    2017-04-01

    Full Text Available A program to generate codes in Fortran and C of the full magnetohydrodynamic equations is shown. The program uses the free computer algebra system software REDUCE. This software has a package called EXCALC, which is an exterior calculus program. The advantage of this program is that it can be modified to include another complex metric or spacetime. The output of this program is modified by means of a LINUX script which creates a new REDUCE program to manipulate the magnetohydrodynamic equations to obtain a code that can be used as a seed for a magnetohydrodynamic code for numerical applications. As an example, we present part of the output of our programs for Cartesian coordinates and how to do the discretization.

  10. Vocable Code

    DEFF Research Database (Denmark)

    Soon, Winnie; Cox, Geoff

    2018-01-01

    a computational and poetic composition for two screens: on one of these, texts and voices are repeated and disrupted by mathematical chaos, together exploring the performativity of code and language; on the other, is a mix of a computer programming syntax and human language. In this sense queer code can...... be understood as both an object and subject of study that intervenes in the world’s ‘becoming' and how material bodies are produced via human and nonhuman practices. Through mixing the natural and computer language, this article presents a script in six parts from a performative lecture for two persons...

  11. NSURE code

    International Nuclear Information System (INIS)

    Rattan, D.S.

    1993-11-01

    NSURE stands for Near-Surface Repository code. NSURE is a performance assessment code. developed for the safety assessment of near-surface disposal facilities for low-level radioactive waste (LLRW). Part one of this report documents the NSURE model, governing equations and formulation of the mathematical models, and their implementation under the SYVAC3 executive. The NSURE model simulates the release of nuclides from an engineered vault, their subsequent transport via the groundwater and surface water pathways tot he biosphere, and predicts the resulting dose rate to a critical individual. Part two of this report consists of a User's manual, describing simulation procedures, input data preparation, output and example test cases

  12. Simplified discrete ordinates method in spherical geometry

    International Nuclear Information System (INIS)

    Elsawi, M.A.; Abdurrahman, N.M.; Yavuz, M.

    1999-01-01

    The authors extend the method of simplified discrete ordinates (SS N ) to spherical geometry. The motivation for such an extension is that the appearance of the angular derivative (redistribution) term in the spherical geometry transport equation makes it difficult to decide which differencing scheme best approximates this term. In the present method, the angular derivative term is treated implicitly and thus avoids the need for the approximation of such term. This method can be considered to be analytic in nature with the advantage of being free from spatial truncation errors from which most of the existing transport codes suffer. In addition, it treats the angular redistribution term implicitly with the advantage of avoiding approximations to that term. The method also can handle scattering in a very general manner with the advantage of spending almost the same computational effort for all scattering modes. Moreover, the methods can easily be applied to higher-order S N calculations

  13. Discussion of discrete D shape toroidal coil

    International Nuclear Information System (INIS)

    Kaiho, Katsuyuki; Ohara, Takeshi; Agatsuma, Ko; Onishi, Toshitada

    1988-01-01

    A novel design for a toroidal coil, called the D shape coil, was reported by J. File. The coil conductors are in pure tension and then subject to no bending moment. This leads to a smaller number of emf supports in a simpler configuration than that with the conventional toroidal coil of circular cross-section. The contours of the D shape are given as solutions of a differential equation. This equation includes the function of the magnetic field distribution in the conductor region which is inversely proportional to the winding radius. It is therefore important to use the exact magnetic field distribution. However the magnetic field distribution becomes complicated when the D shape toroidal coil is comprised of discrete coils and also depends on the D shape configuration. A theory and a computer program for designing the practical pure-tension toroidal coil are developed. Using this computer code, D shape conductors are calculated for various numbers of discrete coils and the results are compared. Electromagnetic forces in the coils are also calculated. It is shown that the hoop stress in the conductors depends only on the total ampere-turns of the coil when the contours of the D shape are similar. (author)

  14. Mattson Solomon transform and algebra codes

    DEFF Research Database (Denmark)

    Martínez-Moro, E.; Benito, Diego Ruano

    2009-01-01

    In this note we review some results of the first author on the structure of codes defined as subalgebras of a commutative semisimple algebra over a finite field (see Martínez-Moro in Algebra Discrete Math. 3:99-112, 2007). Generator theory and those aspects related to the theory of Gröbner bases ...

  15. The Aster code; Code Aster

    Energy Technology Data Exchange (ETDEWEB)

    Delbecq, J.M

    1999-07-01

    The Aster code is a 2D or 3D finite-element calculation code for structures developed by the R and D direction of Electricite de France (EdF). This dossier presents a complete overview of the characteristics and uses of the Aster code: introduction of version 4; the context of Aster (organisation of the code development, versions, systems and interfaces, development tools, quality assurance, independent validation); static mechanics (linear thermo-elasticity, Euler buckling, cables, Zarka-Casier method); non-linear mechanics (materials behaviour, big deformations, specific loads, unloading and loss of load proportionality indicators, global algorithm, contact and friction); rupture mechanics (G energy restitution level, restitution level in thermo-elasto-plasticity, 3D local energy restitution level, KI and KII stress intensity factors, calculation of limit loads for structures), specific treatments (fatigue, rupture, wear, error estimation); meshes and models (mesh generation, modeling, loads and boundary conditions, links between different modeling processes, resolution of linear systems, display of results etc..); vibration mechanics (modal and harmonic analysis, dynamics with shocks, direct transient dynamics, seismic analysis and aleatory dynamics, non-linear dynamics, dynamical sub-structuring); fluid-structure interactions (internal acoustics, mass, rigidity and damping); linear and non-linear thermal analysis; steels and metal industry (structure transformations); coupled problems (internal chaining, internal thermo-hydro-mechanical coupling, chaining with other codes); products and services. (J.S.)

  16. Approximating the Analytic Fourier Transform with the Discrete Fourier Transform

    OpenAIRE

    Axelrod, Jeremy

    2015-01-01

    The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more rapidly than via a direct matrix multiplication. Advantages and limitations of using this method to approximate the Fourier transform are discussed, and prototypical MATLAB codes implementing the method are presented.

  17. A discrete Fourier transform for virtual memory machines

    Science.gov (United States)

    Galant, David C.

    1992-01-01

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

  18. Coding Class

    DEFF Research Database (Denmark)

    Ejsing-Duun, Stine; Hansbøl, Mikala

    Denne rapport rummer evaluering og dokumentation af Coding Class projektet1. Coding Class projektet blev igangsat i skoleåret 2016/2017 af IT-Branchen i samarbejde med en række medlemsvirksomheder, Københavns kommune, Vejle Kommune, Styrelsen for IT- og Læring (STIL) og den frivillige forening...... Coding Pirates2. Rapporten er forfattet af Docent i digitale læringsressourcer og forskningskoordinator for forsknings- og udviklingsmiljøet Digitalisering i Skolen (DiS), Mikala Hansbøl, fra Institut for Skole og Læring ved Professionshøjskolen Metropol; og Lektor i læringsteknologi, interaktionsdesign......, design tænkning og design-pædagogik, Stine Ejsing-Duun fra Forskningslab: It og Læringsdesign (ILD-LAB) ved Institut for kommunikation og psykologi, Aalborg Universitet i København. Vi har fulgt og gennemført evaluering og dokumentation af Coding Class projektet i perioden november 2016 til maj 2017...

  19. Uplink Coding

    Science.gov (United States)

    Andrews, Ken; Divsalar, Dariush; Dolinar, Sam; Moision, Bruce; Hamkins, Jon; Pollara, Fabrizio

    2007-01-01

    This slide presentation reviews the objectives, meeting goals and overall NASA goals for the NASA Data Standards Working Group. The presentation includes information on the technical progress surrounding the objective, short LDPC codes, and the general results on the Pu-Pw tradeoff.

  20. ANIMAL code

    International Nuclear Information System (INIS)

    Lindemuth, I.R.

    1979-01-01

    This report describes ANIMAL, a two-dimensional Eulerian magnetohydrodynamic computer code. ANIMAL's physical model also appears. Formulated are temporal and spatial finite-difference equations in a manner that facilitates implementation of the algorithm. Outlined are the functions of the algorithm's FORTRAN subroutines and variables

  1. Network Coding

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 15; Issue 7. Network Coding. K V Rashmi Nihar B Shah P Vijay Kumar. General Article Volume 15 Issue 7 July 2010 pp 604-621. Fulltext. Click here to view fulltext PDF. Permanent link: https://www.ias.ac.in/article/fulltext/reso/015/07/0604-0621 ...

  2. MCNP code

    International Nuclear Information System (INIS)

    Cramer, S.N.

    1984-01-01

    The MCNP code is the major Monte Carlo coupled neutron-photon transport research tool at the Los Alamos National Laboratory, and it represents the most extensive Monte Carlo development program in the United States which is available in the public domain. The present code is the direct descendent of the original Monte Carlo work of Fermi, von Neumaum, and Ulam at Los Alamos in the 1940s. Development has continued uninterrupted since that time, and the current version of MCNP (or its predecessors) has always included state-of-the-art methods in the Monte Carlo simulation of radiation transport, basic cross section data, geometry capability, variance reduction, and estimation procedures. The authors of the present code have oriented its development toward general user application. The documentation, though extensive, is presented in a clear and simple manner with many examples, illustrations, and sample problems. In addition to providing the desired results, the output listings give a a wealth of detailed information (some optional) concerning each state of the calculation. The code system is continually updated to take advantage of advances in computer hardware and software, including interactive modes of operation, diagnostic interrupts and restarts, and a variety of graphical and video aids

  3. Expander Codes

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 10; Issue 1. Expander Codes - The Sipser–Spielman Construction. Priti Shankar. General Article Volume 10 ... Author Affiliations. Priti Shankar1. Department of Computer Science and Automation, Indian Institute of Science Bangalore 560 012, India.

  4. High order backward discretization of the neutron diffusion equation

    Energy Technology Data Exchange (ETDEWEB)

    Ginestar, D.; Bru, R.; Marin, J. [Universidad Politecnica de Valencia (Spain). Departamento de Matematica Aplicada; Verdu, G.; Munoz-Cobo, J.L. [Universidad Politecnica de Valencia (Spain). Departamento de Ingenieria Quimica y Nuclear; Vidal, V. [Universidad Politecnica de Valencia (Spain). Departamento de Sistemas Informaticos y Computacion

    1997-11-21

    Fast codes capable of dealing with three-dimensional geometries, are needed to be able to simulate spatially complicated transients in a nuclear reactor. We propose a new discretization technique for the time integration of the neutron diffusion equation, based on the backward difference formulas for systems of stiff ordinary differential equations. This method needs to solve a system of linear equations for each integration step, and for this purpose, we have developed an iterative block algorithm combined with a variational acceleration technique. We tested the algorithm with two benchmark problems, and compared the results with those provided by other codes, concluding that the performance and overall agreement are very good. (author).

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

    Science.gov (United States)

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

    2016-01-01

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

  6. Discrete Curvature Theories and Applications

    KAUST Repository

    Sun, Xiang

    2016-08-25

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

  7. Analysis of Discrete Mittag - Leffler Functions

    Directory of Open Access Journals (Sweden)

    N. Shobanadevi

    2015-03-01

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

  8. Foundations of a discrete physics

    International Nuclear Information System (INIS)

    McGoveran, D.; Noyes, P.

    1988-01-01

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

  9. The nodal discrete-ordinate transport calculation of anisotropy scattering problem in three-dimensional cartesian geometry

    International Nuclear Information System (INIS)

    Wu Hongchun; Xie Zhongsheng; Zhu Xuehua

    1994-01-01

    The nodal discrete-ordinate transport calculating model of anisotropy scattering problem in three-dimensional cartesian geometry is given. The computing code NOTRAN/3D has been encoded and the satisfied conclusion is gained

  10. Panda code

    International Nuclear Information System (INIS)

    Altomare, S.; Minton, G.

    1975-02-01

    PANDA is a new two-group one-dimensional (slab/cylinder) neutron diffusion code designed to replace and extend the FAB series. PANDA allows for the nonlinear effects of xenon, enthalpy and Doppler. Fuel depletion is allowed. PANDA has a completely general search facility which will seek criticality, maximize reactivity, or minimize peaking. Any single parameter may be varied in a search. PANDA is written in FORTRAN IV, and as such is nearly machine independent. However, PANDA has been written with the present limitations of the Westinghouse CDC-6600 system in mind. Most computation loops are very short, and the code is less than half the useful 6600 memory size so that two jobs can reside in the core at once. (auth)

  11. Decoding LDPC Convolutional Codes on Markov Channels

    Directory of Open Access Journals (Sweden)

    Kashyap Manohar

    2008-01-01

    Full Text Available Abstract This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.

  12. Decoding LDPC Convolutional Codes on Markov Channels

    Directory of Open Access Journals (Sweden)

    Chris Winstead

    2008-04-01

    Full Text Available This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.

  13. Discrete differential geometry. Consistency as integrability

    OpenAIRE

    Bobenko, Alexander I.; Suris, Yuri B.

    2005-01-01

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

  14. Integrable structure in discrete shell membrane theory.

    Science.gov (United States)

    Schief, W K

    2014-05-08

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

  15. CANAL code

    International Nuclear Information System (INIS)

    Gara, P.; Martin, E.

    1983-01-01

    The CANAL code presented here optimizes a realistic iron free extraction channel which has to provide a given transversal magnetic field law in the median plane: the current bars may be curved, have finite lengths and cooling ducts and move in a restricted transversal area; terminal connectors may be added, images of the bars in pole pieces may be included. A special option optimizes a real set of circular coils [fr

  16. Application of the three-dimensional Oak Ridge transport code

    International Nuclear Information System (INIS)

    Rhoades, W.A.; Childs, R.L.; Emmett, M.B.; Cramer, S.N.

    1984-01-01

    TORT, a 3-d extension of the DOT discrete ordinates transport code is now in production use for studies of radiation penetration into large concrete and masonry structures. This paper discusses certain features of the new code and shows representative results, including comparisons with Monte Carlo calculations

  17. Degree distribution in discrete case

    International Nuclear Information System (INIS)

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

    2011-01-01

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

  18. Toward Optimal Manifold Hashing via Discrete Locally Linear Embedding.

    Science.gov (United States)

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

    2017-11-01

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

  19. A Fast Optimization Method for General Binary Code Learning.

    Science.gov (United States)

    Shen, Fumin; Zhou, Xiang; Yang, Yang; Song, Jingkuan; Shen, Heng; Tao, Dacheng

    2016-09-22

    Hashing or binary code learning has been recognized to accomplish efficient near neighbor search, and has thus attracted broad interests in recent retrieval, vision and learning studies. One main challenge of learning to hash arises from the involvement of discrete variables in binary code optimization. While the widely-used continuous relaxation may achieve high learning efficiency, the pursued codes are typically less effective due to accumulated quantization error. In this work, we propose a novel binary code optimization method, dubbed Discrete Proximal Linearized Minimization (DPLM), which directly handles the discrete constraints during the learning process. Specifically, the discrete (thus nonsmooth nonconvex) problem is reformulated as minimizing the sum of a smooth loss term with a nonsmooth indicator function. The obtained problem is then efficiently solved by an iterative procedure with each iteration admitting an analytical discrete solution, which is thus shown to converge very fast. In addition, the proposed method supports a large family of empirical loss functions, which is particularly instantiated in this work by both a supervised and an unsupervised hashing losses, together with the bits uncorrelation and balance constraints. In particular, the proposed DPLM with a supervised `2 loss encodes the whole NUS-WIDE database into 64-bit binary codes within 10 seconds on a standard desktop computer. The proposed approach is extensively evaluated on several large-scale datasets and the generated binary codes are shown to achieve very promising results on both retrieval and classification tasks.

  20. On the discrete Gabor transform and the discrete Zak transform

    NARCIS (Netherlands)

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

    1996-01-01

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

  1. Discrete Choice and Rational Inattention

    DEFF Research Database (Denmark)

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

    2017-01-01

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

  2. Application of direct discrete method (DDM) to multigroup neutron transport problems

    International Nuclear Information System (INIS)

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

    2003-01-01

    The Direct Discrete Method (DDM), which produced excellent results for one-group neutron transport problems, has been developed for multigroup energy. A multigroup neutron transport discrete equation has been produced for a cylindrical shape fuel element with and without associated coolant regions with two boundary conditions. The calculations are illustrated for two-group energy by graphs showing the fast and thermal fluxes. The validity of the results are tested against the results obtained by the ANISN code. (author)

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

    Science.gov (United States)

    Bracken, Robert E.

    2004-01-01

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

  4. Discrete Hamiltonian evolution and quantum gravity

    International Nuclear Information System (INIS)

    Husain, Viqar; Winkler, Oliver

    2004-01-01

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

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

    KAUST Repository

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

    2016-01-01

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

  6. Solving discrete zero point problems

    NARCIS (Netherlands)

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

    2004-01-01

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

  7. Succinct Sampling from Discrete Distributions

    DEFF Research Database (Denmark)

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

  8. Symplectomorphisms and discrete braid invariants

    NARCIS (Netherlands)

    Czechowski, Aleksander; Vandervorst, Robert

    2017-01-01

    Area and orientation preserving diffeomorphisms of the standard 2-disc, referred to as symplectomorphisms of D2, allow decompositions in terms of positive twist diffeomorphisms. Using the latter decomposition, we utilize the Conley index theory of discrete braid classes as introduced in Ghrist et

  9. The remarkable discreteness of being

    Indian Academy of Sciences (India)

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

  10. Discrete tomography in neutron radiography

    International Nuclear Information System (INIS)

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

    2005-01-01

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

  11. Numerical computation of discrete differential scattering cross sections for Monte Carlo charged particle transport

    International Nuclear Information System (INIS)

    Walsh, Jonathan A.; Palmer, Todd S.; Urbatsch, Todd J.

    2015-01-01

    Highlights: • Generation of discrete differential scattering angle and energy loss cross sections. • Gauss–Radau quadrature utilizing numerically computed cross section moments. • Development of a charged particle transport capability in the Milagro IMC code. • Integration of cross section generation and charged particle transport capabilities. - Abstract: We investigate a method for numerically generating discrete scattering cross sections for use in charged particle transport simulations. We describe the cross section generation procedure and compare it to existing methods used to obtain discrete cross sections. The numerical approach presented here is generalized to allow greater flexibility in choosing a cross section model from which to derive discrete values. Cross section data computed with this method compare favorably with discrete data generated with an existing method. Additionally, a charged particle transport capability is demonstrated in the time-dependent Implicit Monte Carlo radiative transfer code, Milagro. We verify the implementation of charged particle transport in Milagro with analytic test problems and we compare calculated electron depth–dose profiles with another particle transport code that has a validated electron transport capability. Finally, we investigate the integration of the new discrete cross section generation method with the charged particle transport capability in Milagro.

  12. From concatenated codes to graph codes

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom

    2004-01-01

    We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...

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

    CERN Document Server

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

    2006-01-01

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

  14. Normal scheme for solving the transport equation independently of spatial discretization

    International Nuclear Information System (INIS)

    Zamonsky, O.M.

    1993-01-01

    To solve the discrete ordinates neutron transport equation, a general order nodal scheme is used, where nodes are allowed to have different orders of approximation and the whole system reaches a final order distribution. Independence in the election of system discretization and order of approximation is obtained without loss of accuracy. The final equations and the iterative method to reach a converged order solution were implemented in a two-dimensional computer code to solve monoenergetic, isotropic scattering, external source problems. Two benchmark problems were solved using different automatic selection order methods. Results show accurate solutions without spatial discretization, regardless of the initial selection of distribution order. (author)

  15. Discrete elements method of neutron transport

    International Nuclear Information System (INIS)

    Mathews, K.A.

    1988-01-01

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

  16. CTCN: Colloid transport code -- nuclear

    International Nuclear Information System (INIS)

    Jain, R.

    1993-01-01

    This report describes the CTCN computer code, designed to solve the equations of transient colloidal transport of radionuclides in porous and fractured media. This Fortran 77 package solves systems of coupled nonlinear differential-algebraic equations with a wide range of boundary conditions. The package uses the Method of Lines technique with a special section which forms finite-difference discretizations in up to four spatial dimensions to automatically convert the system into a set of ordinary differential equations. The CTCN code then solves these equations using a robust, efficient ODE solver. Thus CTCN can be used to solve population balance equations along with the usual transport equations to model colloid transport processes or as a general problem solver to treat up to four-dimensional differential-algebraic systems

  17. The APOLLO assembly spectrum code

    International Nuclear Information System (INIS)

    Kavenoky, A.; Sanchez, R.

    1987-04-01

    The APOLLO code was originally developed as a design tool for HTR's, later it was aimed at the calculation of PWR lattices. APOLLO is a general purpose assembly spectrum code based on the multigroup integral transport equation; refined collision probability modules allow the computation of 1D geometries with linearly anisotropic scattering and two term flux expansion. In 2D geometries modules based on the substructure method provide fast and accurate design calculations and a module based on a direct discretization is devoted to reference calculations. The SPH homogenization technique provides corrected cross sections performing an equivalence between coarse and refined calculations. The post processing module of APOLLO generate either APOLLIB to be used by APOLLO or NEPLIB for reactor diffusion calculation. The cross section library of APOLLO contains data and self-shielding data for more than 400 isotopes. APOLLO is able to compute the depletion of any medium accounting for any heavy isotope or fission product chain. 21 refs

  18. Discrete diffusion Lyman α radiative transfer

    Science.gov (United States)

    Smith, Aaron; Tsang, Benny T.-H.; Bromm, Volker; Milosavljević, Miloš

    2018-06-01

    Due to its accuracy and generality, Monte Carlo radiative transfer (MCRT) has emerged as the prevalent method for Lyα radiative transfer in arbitrary geometries. The standard MCRT encounters a significant efficiency barrier in the high optical depth, diffusion regime. Multiple acceleration schemes have been developed to improve the efficiency of MCRT but the noise from photon packet discretization remains a challenge. The discrete diffusion Monte Carlo (DDMC) scheme has been successfully applied in state-of-the-art radiation hydrodynamics (RHD) simulations. Still, the established framework is not optimal for resonant line transfer. Inspired by the DDMC paradigm, we present a novel extension to resonant DDMC (rDDMC) in which diffusion in space and frequency are treated on equal footing. We explore the robustness of our new method and demonstrate a level of performance that justifies incorporating the method into existing Lyα codes. We present computational speedups of ˜102-106 relative to contemporary MCRT implementations with schemes that skip scattering in the core of the line profile. This is because the rDDMC runtime scales with the spatial and frequency resolution rather than the number of scatterings—the latter is typically ∝τ0 for static media, or ∝(aτ0)2/3 with core-skipping. We anticipate new frontiers in which on-the-fly Lyα radiative transfer calculations are feasible in 3D RHD. More generally, rDDMC is transferable to any computationally demanding problem amenable to a Fokker-Planck approximation of frequency redistribution.

  19. Detailed resonance absorption calculations with the Monte Carlo code MCNP and collision probability version of the slowing down code ROLAIDS

    International Nuclear Information System (INIS)

    Kruijf, W.J.M. de; Janssen, A.J.

    1994-01-01

    Very accurate Mote Carlo calculations with Monte Carlo Code have been performed to serve as reference for benchmark calculations on resonance absorption by U 238 in a typical PWR pin-cell geometry. Calculations with the energy-pointwise slowing down code calculates the resonance absorption accurately. Calculations with the multigroup discrete ordinates code XSDRN show that accurate results can only be achieved with a very fine energy mesh. (authors). 9 refs., 5 figs., 2 tabs

  20. Local stabilizer codes in three dimensions without string logical operators

    International Nuclear Information System (INIS)

    Haah, Jeongwan

    2011-01-01

    We suggest concrete models for self-correcting quantum memory by reporting examples of local stabilizer codes in 3D that have no string logical operators. Previously known local stabilizer codes in 3D all have stringlike logical operators, which make the codes non-self-correcting. We introduce a notion of ''logical string segments'' to avoid difficulties in defining one-dimensional objects in discrete lattices. We prove that every stringlike logical operator of our code can be deformed to a disjoint union of short segments, each of which is in the stabilizer group. The code has surfacelike logical operators whose partial implementation has unsatisfied stabilizers along its boundary.

  1. Recent developments in the Los Alamos radiation transport code system

    International Nuclear Information System (INIS)

    Forster, R.A.; Parsons, K.

    1997-01-01

    A brief progress report on updates to the Los Alamos Radiation Transport Code System (LARTCS) for solving criticality and fixed-source problems is provided. LARTCS integrates the Diffusion Accelerated Neutral Transport (DANT) discrete ordinates codes with the Monte Carlo N-Particle (MCNP) code. The LARCTS code is being developed with a graphical user interface for problem setup and analysis. Progress in the DANT system for criticality applications include a two-dimensional module which can be linked to a mesh-generation code and a faster iteration scheme. Updates to MCNP Version 4A allow statistical checks of calculated Monte Carlo results

  2. Discrete gauge symmetries in discrete MSSM-like orientifolds

    International Nuclear Information System (INIS)

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

    2012-01-01

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

  3. A progressive data compression scheme based upon adaptive transform coding: Mixture block coding of natural images

    Science.gov (United States)

    Rost, Martin C.; Sayood, Khalid

    1991-01-01

    A method for efficiently coding natural images using a vector-quantized variable-blocksized transform source coder is presented. The method, mixture block coding (MBC), incorporates variable-rate coding by using a mixture of discrete cosine transform (DCT) source coders. Which coders are selected to code any given image region is made through a threshold driven distortion criterion. In this paper, MBC is used in two different applications. The base method is concerned with single-pass low-rate image data compression. The second is a natural extension of the base method which allows for low-rate progressive transmission (PT). Since the base method adapts easily to progressive coding, it offers the aesthetic advantage of progressive coding without incorporating extensive channel overhead. Image compression rates of approximately 0.5 bit/pel are demonstrated for both monochrome and color images.

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

    International Nuclear Information System (INIS)

    Karanikas, C.; Proios, G.

    2003-01-01

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

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

    CERN Document Server

    Karanikas, C

    2003-01-01

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

  6. Clique-Based Neural Associative Memories with Local Coding and Precoding.

    Science.gov (United States)

    Mofrad, Asieh Abolpour; Parker, Matthew G; Ferdosi, Zahra; Tadayon, Mohammad H

    2016-08-01

    Techniques from coding theory are able to improve the efficiency of neuroinspired and neural associative memories by forcing some construction and constraints on the network. In this letter, the approach is to embed coding techniques into neural associative memory in order to increase their performance in the presence of partial erasures. The motivation comes from recent work by Gripon, Berrou, and coauthors, which revisited Willshaw networks and presented a neural network with interacting neurons that partitioned into clusters. The model introduced stores patterns as small-size cliques that can be retrieved in spite of partial error. We focus on improving the success of retrieval by applying two techniques: doing a local coding in each cluster and then applying a precoding step. We use a slightly different decoding scheme, which is appropriate for partial erasures and converges faster. Although the ideas of local coding and precoding are not new, the way we apply them is different. Simulations show an increase in the pattern retrieval capacity for both techniques. Moreover, we use self-dual additive codes over field [Formula: see text], which have very interesting properties and a simple-graph representation.

  7. Positivity for Convective Semi-discretizations

    KAUST Repository

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

    2017-01-01

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

  8. Quantum chaos on discrete graphs

    International Nuclear Information System (INIS)

    Smilansky, Uzy

    2007-01-01

    Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

  9. Dark energy from discrete spacetime.

    Directory of Open Access Journals (Sweden)

    Aaron D Trout

    Full Text Available Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, [Formula: see text] in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies.

  10. Applied geometry and discrete mathematics

    CERN Document Server

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

  11. Emissivity of discretized diffusion problems

    International Nuclear Information System (INIS)

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

    2006-01-01

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

  12. Discrete symmetries in the MSSM

    Energy Technology Data Exchange (ETDEWEB)

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

  13. Domain Discretization and Circle Packings

    DEFF Research Database (Denmark)

    Dias, Kealey

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

  14. Discrete Bose-Einstein spectra

    International Nuclear Information System (INIS)

    Vlad, Valentin I.; Ionescu-Pallas, Nicholas

    2001-03-01

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

  15. Discrete symmetries in the MSSM

    International Nuclear Information System (INIS)

    Schieren, Roland

    2010-01-01

    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 R 4 symmetry is discovered which solves the μ-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 R 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 R 4 symmetry and other desirable features. (orig.)

  16. Dark energy from discrete spacetime.

    Science.gov (United States)

    Trout, Aaron D

    2013-01-01

    Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT) model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, [Formula: see text] in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies.

  17. Discrete mathematics using a computer

    CERN Document Server

    Hall, Cordelia

    2000-01-01

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

  18. Duality for discrete integrable systems

    International Nuclear Information System (INIS)

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

    2005-01-01

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

  19. Observability of discretized partial differential equations

    Science.gov (United States)

    Cohn, Stephen E.; Dee, Dick P.

    1988-01-01

    It is shown that complete observability of the discrete model used to assimilate data from a linear partial differential equation (PDE) system is necessary and sufficient for asymptotic stability of the data assimilation process. The observability theory for discrete systems is reviewed and applied to obtain simple observability tests for discretized constant-coefficient PDEs. Examples are used to show how numerical dispersion can result in discrete dynamics with multiple eigenvalues, thereby detracting from observability.

  20. Verification of a neutronic code for transient analysis in reactors with Hex-z geometry

    Energy Technology Data Exchange (ETDEWEB)

    Gonzalez-Pintor, S.; Verdu, G. [Departamento de Ingenieria Quimica Y Nuclear, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain); Ginestar, D. [Departamento de Matematica Aplicada, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain)

    2012-07-01

    Due to the geometry of the fuel bundles, to simulate reactors such as VVER reactors it is necessary to develop methods that can deal with hexagonal prisms as basic elements of the spatial discretization. The main features of a code based on a high order finite element method for the spatial discretization of the neutron diffusion equation and an implicit difference method for the time discretization of this equation are presented and the performance of the code is tested solving the first exercise of the AER transient benchmark. The obtained results are compared with the reference results of the benchmark and with the results provided by PARCS code. (authors)

  1. Effective lagrangian description on discrete gauge symmetries

    International Nuclear Information System (INIS)

    Banks, T.

    1989-01-01

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

  2. Discrete port-Hamiltonian systems : mixed interconnections

    NARCIS (Netherlands)

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

    2005-01-01

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

  3. Discrete fractional solutions of a Legendre equation

    Science.gov (United States)

    Yılmazer, Resat

    2018-01-01

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

  4. Utilizing GPUs to Accelerate Turbomachinery CFD Codes

    Science.gov (United States)

    MacCalla, Weylin; Kulkarni, Sameer

    2016-01-01

    GPU computing has established itself as a way to accelerate parallel codes in the high performance computing world. This work focuses on speeding up APNASA, a legacy CFD code used at NASA Glenn Research Center, while also drawing conclusions about the nature of GPU computing and the requirements to make GPGPU worthwhile on legacy codes. Rewriting and restructuring of the source code was avoided to limit the introduction of new bugs. The code was profiled and investigated for parallelization potential, then OpenACC directives were used to indicate parallel parts of the code. The use of OpenACC directives was not able to reduce the runtime of APNASA on either the NVIDIA Tesla discrete graphics card, or the AMD accelerated processing unit. Additionally, it was found that in order to justify the use of GPGPU, the amount of parallel work being done within a kernel would have to greatly exceed the work being done by any one portion of the APNASA code. It was determined that in order for an application like APNASA to be accelerated on the GPU, it should not be modular in nature, and the parallel portions of the code must contain a large portion of the code's computation time.

  5. Computation of the Genetic Code

    Science.gov (United States)

    Kozlov, Nicolay N.; Kozlova, Olga N.

    2018-03-01

    One of the problems in the development of mathematical theory of the genetic code (summary is presented in [1], the detailed -to [2]) is the problem of the calculation of the genetic code. Similar problems in the world is unknown and could be delivered only in the 21st century. One approach to solving this problem is devoted to this work. For the first time provides a detailed description of the method of calculation of the genetic code, the idea of which was first published earlier [3]), and the choice of one of the most important sets for the calculation was based on an article [4]. Such a set of amino acid corresponds to a complete set of representations of the plurality of overlapping triple gene belonging to the same DNA strand. A separate issue was the initial point, triggering an iterative search process all codes submitted by the initial data. Mathematical analysis has shown that the said set contains some ambiguities, which have been founded because of our proposed compressed representation of the set. As a result, the developed method of calculation was limited to the two main stages of research, where the first stage only the of the area were used in the calculations. The proposed approach will significantly reduce the amount of computations at each step in this complex discrete structure.

  6. New non-structured discretizations for fluid flows with reinforced incompressibility

    International Nuclear Information System (INIS)

    Heib, S.

    2003-01-01

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

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

    OpenAIRE

    Cresson, Jacky; Pierret, Frédéric

    2015-01-01

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

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

    OpenAIRE

    Agafonov, S. I.

    2005-01-01

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

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

    International Nuclear Information System (INIS)

    Zhang Yufeng; Fan Engui; Zhang Yongqing

    2006-01-01

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

  10. Automatic coding method of the ACR Code

    International Nuclear Information System (INIS)

    Park, Kwi Ae; Ihm, Jong Sool; Ahn, Woo Hyun; Baik, Seung Kook; Choi, Han Yong; Kim, Bong Gi

    1993-01-01

    The authors developed a computer program for automatic coding of ACR(American College of Radiology) code. The automatic coding of the ACR code is essential for computerization of the data in the department of radiology. This program was written in foxbase language and has been used for automatic coding of diagnosis in the Department of Radiology, Wallace Memorial Baptist since May 1992. The ACR dictionary files consisted of 11 files, one for the organ code and the others for the pathology code. The organ code was obtained by typing organ name or code number itself among the upper and lower level codes of the selected one that were simultaneous displayed on the screen. According to the first number of the selected organ code, the corresponding pathology code file was chosen automatically. By the similar fashion of organ code selection, the proper pathologic dode was obtained. An example of obtained ACR code is '131.3661'. This procedure was reproducible regardless of the number of fields of data. Because this program was written in 'User's Defined Function' from, decoding of the stored ACR code was achieved by this same program and incorporation of this program into program in to another data processing was possible. This program had merits of simple operation, accurate and detail coding, and easy adjustment for another program. Therefore, this program can be used for automation of routine work in the department of radiology

  11. Error-correction coding

    Science.gov (United States)

    Hinds, Erold W. (Principal Investigator)

    1996-01-01

    This report describes the progress made towards the completion of a specific task on error-correcting coding. The proposed research consisted of investigating the use of modulation block codes as the inner code of a concatenated coding system in order to improve the overall space link communications performance. The study proposed to identify and analyze candidate codes that will complement the performance of the overall coding system which uses the interleaved RS (255,223) code as the outer code.

  12. Cuspidal discrete series for projective hyperbolic spaces

    DEFF Research Database (Denmark)

    Andersen, Nils Byrial; Flensted-Jensen, Mogens

    2013-01-01

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

  13. Space-Time Discrete KPZ Equation

    Science.gov (United States)

    Cannizzaro, G.; Matetski, K.

    2018-03-01

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

  14. Dynamic Shannon Coding

    OpenAIRE

    Gagie, Travis

    2005-01-01

    We present a new algorithm for dynamic prefix-free coding, based on Shannon coding. We give a simple analysis and prove a better upper bound on the length of the encoding produced than the corresponding bound for dynamic Huffman coding. We show how our algorithm can be modified for efficient length-restricted coding, alphabetic coding and coding with unequal letter costs.

  15. Fundamentals of convolutional coding

    CERN Document Server

    Johannesson, Rolf

    2015-01-01

    Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field * Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding * Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes * Distance properties of convolutional codes * Includes a downloadable solutions manual

  16. Codes Over Hyperfields

    Directory of Open Access Journals (Sweden)

    Atamewoue Surdive

    2017-12-01

    Full Text Available In this paper, we define linear codes and cyclic codes over a finite Krasner hyperfield and we characterize these codes by their generator matrices and parity check matrices. We also demonstrate that codes over finite Krasner hyperfields are more interesting for code theory than codes over classical finite fields.

  17. Integrable discretizations of the short pulse equation

    International Nuclear Information System (INIS)

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

    2010-01-01

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

  18. Discrete-ordinates finite-element method for atmospheric radiative transfer and remote sensing

    International Nuclear Information System (INIS)

    Gerstl, S.A.W.; Zardecki, A.

    1985-01-01

    Advantages and disadvantages of modern discrete-ordinates finite-element methods for the solution of radiative transfer problems in meteorology, climatology, and remote sensing applications are evaluated. After the common basis of the formulation of radiative transfer problems in the fields of neutron transport and atmospheric optics is established, the essential features of the discrete-ordinates finite-element method are described including the limitations of the method and their remedies. Numerical results are presented for 1-D and 2-D atmospheric radiative transfer problems where integral as well as angular dependent quantities are compared with published results from other calculations and with measured data. These comparisons provide a verification of the discrete-ordinates results for a wide spectrum of cases with varying degrees of absorption, scattering, and anisotropic phase functions. Accuracy and computational speed are also discussed. Since practically all discrete-ordinates codes offer a builtin adjoint capability, the general concept of the adjoint method is described and illustrated by sample problems. Our general conclusion is that the strengths of the discrete-ordinates finite-element method outweight its weaknesses. We demonstrate that existing general-purpose discrete-ordinates codes can provide a powerful tool to analyze radiative transfer problems through the atmosphere, especially when 2-D geometries must be considered

  19. Estimation of effective block conductivities based on discrete network analyses using data from the Aespoe site

    International Nuclear Information System (INIS)

    La Pointe, P.R.; Wallmann, P.; Follin, S.

    1995-09-01

    Numerical continuum codes may be used for assessing the role of regional groundwater flow in far-field safety analyses of a nuclear waste repository at depth. The focus of this project is to develop and evaluate one method based on Discrete Fracture Network (DFN) models to estimate block-scale permeability values for continuum codes. Data from the Aespoe HRL and surrounding area are used. 57 refs, 76 figs, 15 tabs

  20. Discrete geometric structures for architecture

    KAUST Repository

    Pottmann, Helmut

    2010-06-13

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

  1. Radiative transfer on discrete spaces

    CERN Document Server

    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

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

    International Nuclear Information System (INIS)

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

    1985-01-01

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

  3. Novel Iris Biometric Watermarking Based on Singular Value Decomposition and Discrete Cosine Transform

    Directory of Open Access Journals (Sweden)

    Jinyu Lu

    2014-01-01

    Full Text Available A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the singular values of each host image's coefficients which are obtained through discrete cosine transform (DCT. Numerical results reveal that proposed method can extract the watermark effectively and illustrate its security and robustness.

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

    International Nuclear Information System (INIS)

    Chalhoub, Ezzat Selim

    1997-01-01

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

  5. Vector Network Coding Algorithms

    OpenAIRE

    Ebrahimi, Javad; Fragouli, Christina

    2010-01-01

    We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding c in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algori...

  6. 3-D discrete analytical ridgelet transform.

    Science.gov (United States)

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

    2006-12-01

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

  7. Homological stabilizer codes

    Energy Technology Data Exchange (ETDEWEB)

    Anderson, Jonas T., E-mail: jonastyleranderson@gmail.com

    2013-03-15

    In this paper we define homological stabilizer codes on qubits which encompass codes such as Kitaev's toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev's toric code or to the topological color codes. - Highlights: Black-Right-Pointing-Pointer We show that Kitaev's toric codes are equivalent to homological stabilizer codes on 4-valent graphs. Black-Right-Pointing-Pointer We show that toric codes and color codes correspond to homological stabilizer codes on distinct graphs. Black-Right-Pointing-Pointer We find and classify all 2D homological stabilizer codes. Black-Right-Pointing-Pointer We find optimal codes among the homological stabilizer codes.

  8. FLP: a field line plotting code for bundle divertor design

    International Nuclear Information System (INIS)

    Ruchti, C.

    1981-01-01

    A computer code was developed to aid in the design of bundle divertors. The code can handle discrete toroidal field coils and various divertor coil configurations. All coils must be composed of straight line segments. The code runs on the PDP-10 and displays plots of the configuration, field lines, and field ripple. It automatically chooses the coil currents to connect the separatrix produced by the divertor to the outer edge of the plasma and calculates the required coil cross sections. Several divertor designs are illustrated to show how the code works

  9. Implementation of the kinetics in the transport code AZTRAN

    International Nuclear Information System (INIS)

    Duran G, J. A.; Del Valle G, E.; Gomez T, A. M.

    2017-09-01

    This paper shows the implementation of the time dependence in the three-dimensional transport code AZTRAN (AZtlan TRANsport), which belongs to the AZTLAN platform, for the analysis of nuclear reactors (currently under development). The AZTRAN code with this implementation is able to numerically solve the time-dependent transport equation in XYZ geometry, for several energy groups, using the discrete ordinate method S n for the discretization of the angular variable, the nodal method RTN-0 for spatial discretization and method 0 for discretization in time. Initially, the code only solved the neutrons transport equation in steady state, so the implementation of the temporal part was made integrating the neutrons transport equation with respect to time and balance equations corresponding to the concentrations of delayed neutron precursors, for which method 0 was applied. After having directly implemented code kinetics, the improved quasi-static method was implemented, which is a tool for reducing computation time, where the angular flow is factored by the product of two functions called shape function and amplitude function, where the first is calculated for long time steps, called macro-steps and the second is resolved for small time steps called micro-steps. In the new version of AZTRAN several Benchmark problems that were taken from the literature were simulated, the problems used are of two and three dimensions which allowed corroborating the accuracy and stability of the code, showing in general in the reference tests a good behavior. (Author)

  10. Medical images storage using discrete cosine transform

    International Nuclear Information System (INIS)

    Arhouma, Ali M.; Ajaal, Tawfik; Marghani, Khaled

    2010-01-01

    The advances in technology during the last decades have made the use of digital images as one of the common things in everyday life. While the application of digital images in communicating information is very important, the cost of storing and transmitting images is much larger compared to storage and transmission of text. The main problem with all of the images was the fact that they take large size of memory space, large transmission bandwidth and long transmission time. Image data compression is needed to reduce the storage space,transmission bandwidth and transmission time. Medical image compression plays a key role as hospitals move towards filmless imaging and go completely digital. Image compression allows Picture Archiving and Communication Systems (PACS) to reduce the file size on their storage requirements while maintaining relevant diagnostic information. The reduced image file size yield reduced transmission times. Even as the capacity of storage media continues to increase, it is expected that the volume of uncompressed data produced by hospitals will exceed capacity of storage and drive up costs. This paper proposes a Discrete Cosine Transform (DCT) algorithm which can help to solve the image storage and transmission time problem in hospitals. Discrete cosine transform (DCT) has become the most popular technique for image compression over the past several years. One of the major reasons for its popularity is its selection as the standard for JPEG. DCTs are most commonly used for non-analytical applications such as image processing and digital signal-processing (DSP) applications such as video conferencing, fax systems, video disks, and high-definition television HDTV. They also can be used on a matrix of practically any dimension. The proposed (DCT) algorithm improves the performance of medical image compression while satisfying both the medical image quality, and the high compression ratio. Application of DCT coding algorithm to actual still images

  11. Diagnostic Coding for Epilepsy.

    Science.gov (United States)

    Williams, Korwyn; Nuwer, Marc R; Buchhalter, Jeffrey R

    2016-02-01

    Accurate coding is an important function of neurologic practice. This contribution to Continuum is part of an ongoing series that presents helpful coding information along with examples related to the issue topic. Tips for diagnosis coding, Evaluation and Management coding, procedure coding, or a combination are presented, depending on which is most applicable to the subject area of the issue.

  12. Coding of Neuroinfectious Diseases.

    Science.gov (United States)

    Barkley, Gregory L

    2015-12-01

    Accurate coding is an important function of neurologic practice. This contribution to Continuum is part of an ongoing series that presents helpful coding information along with examples related to the issue topic. Tips for diagnosis coding, Evaluation and Management coding, procedure coding, or a combination are presented, depending on which is most applicable to the subject area of the issue.

  13. Calculus of the Power Spectral Density of Ultra Wide Band Pulse Position Modulation Signals Coded with Totally Flipped Code

    Directory of Open Access Journals (Sweden)

    DURNEA, T. N.

    2009-02-01

    Full Text Available UWB-PPM systems were noted to have a power spectral density (p.s.d. consisting of a continuous portion and a line spectrum, which is composed of energy components placed at discrete frequencies. These components are the major source of interference to narrowband systems operating in the same frequency interval and deny harmless coexistence of UWB-PPM and narrowband systems. A new code denoted as Totally Flipped Code (TFC is applied to them in order to eliminate these discrete spectral components. The coded signal transports the information inside pulse position and will have the amplitude coded to generate a continuous p.s.d. We have designed the code and calculated the power spectral density of the coded signals. The power spectrum has no discrete components and its envelope is largely flat inside the bandwidth with a maximum at its center and a null at D.C. These characteristics make this code suited for implementation in the UWB systems based on PPM-type modulation as it assures a continuous spectrum and keeps PPM modulation performances.

  14. Skeletonization and Partitioning of Digital Images Using Discrete Morse Theory.

    Science.gov (United States)

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

    2015-03-01

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

  15. Matrix albedo for discrete ordinates infinite-medium boundary condition

    International Nuclear Information System (INIS)

    Mathews, K.; Dishaw, J.

    2007-01-01

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

  16. Los Alamos radiation transport code system on desktop computing platforms

    International Nuclear Information System (INIS)

    Briesmeister, J.F.; Brinkley, F.W.; Clark, B.A.; West, J.T.

    1990-01-01

    The Los Alamos Radiation Transport Code System (LARTCS) consists of state-of-the-art Monte Carlo and discrete ordinates transport codes and data libraries. These codes were originally developed many years ago and have undergone continual improvement. With a large initial effort and continued vigilance, the codes are easily portable from one type of hardware to another. The performance of scientific work-stations (SWS) has evolved to the point that such platforms can be used routinely to perform sophisticated radiation transport calculations. As the personal computer (PC) performance approaches that of the SWS, the hardware options for desk-top radiation transport calculations expands considerably. The current status of the radiation transport codes within the LARTCS is described: MCNP, SABRINA, LAHET, ONEDANT, TWODANT, TWOHEX, and ONELD. Specifically, the authors discuss hardware systems on which the codes run and present code performance comparisons for various machines

  17. Research on Primary Shielding Calculation Source Generation Codes

    Science.gov (United States)

    Zheng, Zheng; Mei, Qiliang; Li, Hui; Shangguan, Danhua; Zhang, Guangchun

    2017-09-01

    Primary Shielding Calculation (PSC) plays an important role in reactor shielding design and analysis. In order to facilitate PSC, a source generation code is developed to generate cumulative distribution functions (CDF) for the source particle sample code of the J Monte Carlo Transport (JMCT) code, and a source particle sample code is deveoped to sample source particle directions, types, coordinates, energy and weights from the CDFs. A source generation code is developed to transform three dimensional (3D) power distributions in xyz geometry to source distributions in r θ z geometry for the J Discrete Ordinate Transport (JSNT) code. Validation on PSC model of Qinshan No.1 nuclear power plant (NPP), CAP1400 and CAP1700 reactors are performed. Numerical results show that the theoretical model and the codes are both correct.

  18. Finiteness of PST self-dual models

    International Nuclear Information System (INIS)

    Del Cima, Oswaldo M.; Piguet, Olivier; Sarandy, Marcelo S.

    2000-12-01

    The Pasti-Sorokin-Tonin model for describing chiral forms is considered at the quantum level. We study the ultraviolet and infrared behaviour of the model in two, four and six dimensions in the framework of algebraic renormalization. The absence of anomalies, as well as the finiteness, up to non-physical renormalizations, are shown in all dimensions analyzed. (author)

  19. Fermion systems in discrete space-time

    International Nuclear Information System (INIS)

    Finster, Felix

    2007-01-01

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

  20. Fermion systems in discrete space-time

    Energy Technology Data Exchange (ETDEWEB)

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

    2007-05-15

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

  1. Fermion Systems in Discrete Space-Time

    OpenAIRE

    Finster, Felix

    2006-01-01

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

  2. Fermion systems in discrete space-time

    Science.gov (United States)

    Finster, Felix

    2007-05-01

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

  3. Inevitable randomness in discrete mathematics

    CERN Document Server

    Beck, Jozsef

    2009-01-01

    Mathematics has been called the science of order. The subject is remarkably good for generalizing specific cases to create abstract theories. However, mathematics has little to say when faced with highly complex systems, where disorder reigns. This disorder can be found in pure mathematical arenas, such as the distribution of primes, the 3n+1 conjecture, and class field theory. The purpose of this book is to provide examples--and rigorous proofs--of the complexity law: (1) discrete systems are either simple or they exhibit advanced pseudorandomness; (2) a priori probabilities often exist even when there is no intrinsic symmetry. Part of the difficulty in achieving this purpose is in trying to clarify these vague statements. The examples turn out to be fascinating instances of deep or mysterious results in number theory and combinatorics. This book considers randomness and complexity. The traditional approach to complexity--computational complexity theory--is to study very general complexity classes, such as P...

  4. Quantum evolution by discrete measurements

    International Nuclear Information System (INIS)

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

    2007-01-01

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

  5. Quantum evolution by discrete measurements

    Energy Technology Data Exchange (ETDEWEB)

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

    2007-10-15

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

  6. Discrete calculus methods for counting

    CERN Document Server

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

  7. Modeling discrete competitive facility location

    CERN Document Server

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

  8. Discrete modelling of drapery systems

    Science.gov (United States)

    Thoeni, Klaus; Giacomini, Anna

    2016-04-01

    Drapery systems are an efficient and cost-effective measure in preventing and controlling rockfall hazards on rock slopes. The simplest form consists of a row of ground anchors along the top of the slope connected to a horizontal support cable from which a wire mesh is suspended down the face of the slope. Such systems are generally referred to as simple or unsecured draperies (Badger and Duffy 2012). Variations such as secured draperies, where a pattern of ground anchors is incorporated within the field of the mesh, and hybrid systems, where the upper part of an unsecured drapery is elevated to intercept rockfalls originating upslope of the installation, are becoming more and more popular. This work presents a discrete element framework for simulation of unsecured drapery systems and its variations. The numerical model is based on the classical discrete element method (DEM) and implemented into the open-source framework YADE (Šmilauer et al., 2010). The model takes all relevant interactions between block, drapery and slope into account (Thoeni et al., 2014) and was calibrated and validated based on full-scale experiments (Giacomini et al., 2012).The block is modelled as a rigid clump made of spherical particles which allows any shape to be approximated. The drapery is represented by a set of spherical particle with remote interactions. The behaviour of the remote interactions is governed by the constitutive behaviour of the wire and generally corresponds to a piecewise linear stress-strain relation (Thoeni et al., 2013). The same concept is used to model wire ropes. The rock slope is represented by rigid triangular elements where material properties (e.g., normal coefficient of restitution, friction angle) are assigned to each triangle. The capabilities of the developed model to simulate drapery systems and estimate the residual hazard involved with such systems is shown. References Badger, T.C., Duffy, J.D. (2012) Drapery systems. In: Turner, A.K., Schuster R

  9. Discrete space charge affected field emission: Flat and hemisphere emitters

    Energy Technology Data Exchange (ETDEWEB)

    Jensen, Kevin L., E-mail: kevin.jensen@nrl.navy.mil [Code 6854, Naval Research Laboratory, Washington, DC 20375 (United States); Shiffler, Donald A.; Tang, Wilkin [Air Force Research Laboratory, Kirtland AFB, New Mexico 87117 (United States); Rittersdorf, Ian M. [Code 6770, Naval Research Laboratory, Washington, DC 20375 (United States); Lebowitz, Joel L. [Department of Mathematics and Department of Physics, Rutgers University, Piscataway, New Jersey 08854-8019 (United States); Harris, John R. [U.S. Navy Reserve, New Orleans, Louisiana 70143 (United States); Lau, Y. Y. [Department of Nuclear Engineering and Radiological Sciences, University of Michigan, Ann Arbor, Michigan 48109 (United States); Petillo, John J. [Leidos, Billerica, Massachusetts 01821 (United States); Luginsland, John W. [Physics and Electronics Directorate, AFOSR, Arlington, Virginia 22203 (United States)

    2015-05-21

    Models of space-charge affected thermal-field emission from protrusions, able to incorporate the effects of both surface roughness and elongated field emitter structures in beam optics codes, are desirable but difficult. The models proposed here treat the meso-scale diode region separate from the micro-scale regions characteristic of the emission sites. The consequences of discrete emission events are given for both one-dimensional (sheets of charge) and three dimensional (rings of charge) models: in the former, results converge to steady state conditions found by theory (e.g., Rokhlenko et al. [J. Appl. Phys. 107, 014904 (2010)]) but show oscillatory structure as they do. Surface roughness or geometric features are handled using a ring of charge model, from which the image charges are found and used to modify the apex field and emitted current. The roughness model is shown to have additional constraints related to the discrete nature of electron charge. The ability of a unit cell model to treat field emitter structures and incorporate surface roughness effects inside a beam optics code is assessed.

  10. Vector Network Coding

    OpenAIRE

    Ebrahimi, Javad; Fragouli, Christina

    2010-01-01

    We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L X L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector co...

  11. Entropy Coding in HEVC

    OpenAIRE

    Sze, Vivienne; Marpe, Detlev

    2014-01-01

    Context-Based Adaptive Binary Arithmetic Coding (CABAC) is a method of entropy coding first introduced in H.264/AVC and now used in the latest High Efficiency Video Coding (HEVC) standard. While it provides high coding efficiency, the data dependencies in H.264/AVC CABAC make it challenging to parallelize and thus limit its throughput. Accordingly, during the standardization of entropy coding for HEVC, both aspects of coding efficiency and throughput were considered. This chapter describes th...

  12. Generalized concatenated quantum codes

    International Nuclear Information System (INIS)

    Grassl, Markus; Shor, Peter; Smith, Graeme; Smolin, John; Zeng Bei

    2009-01-01

    We discuss the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we construct families of single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases, which not only outperform any stabilizer codes for finite block length but also asymptotically meet the quantum Hamming bound for large block length.

  13. Rateless feedback codes

    DEFF Research Database (Denmark)

    Sørensen, Jesper Hemming; Koike-Akino, Toshiaki; Orlik, Philip

    2012-01-01

    This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both...... the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding....

  14. Advanced video coding systems

    CERN Document Server

    Gao, Wen

    2015-01-01

    This comprehensive and accessible text/reference presents an overview of the state of the art in video coding technology. Specifically, the book introduces the tools of the AVS2 standard, describing how AVS2 can help to achieve a significant improvement in coding efficiency for future video networks and applications by incorporating smarter coding tools such as scene video coding. Topics and features: introduces the basic concepts in video coding, and presents a short history of video coding technology and standards; reviews the coding framework, main coding tools, and syntax structure of AV

  15. Coding for dummies

    CERN Document Server

    Abraham, Nikhil

    2015-01-01

    Hands-on exercises help you learn to code like a pro No coding experience is required for Coding For Dummies,your one-stop guide to building a foundation of knowledge inwriting computer code for web, application, and softwaredevelopment. It doesn't matter if you've dabbled in coding or neverwritten a line of code, this book guides you through the basics.Using foundational web development languages like HTML, CSS, andJavaScript, it explains in plain English how coding works and whyit's needed. Online exercises developed by Codecademy, a leading online codetraining site, help hone coding skill

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

    International Nuclear Information System (INIS)

    Xu Xixiang; Cao Weili

    2007-01-01

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

  17. Two-dimensional sensitivity calculation code: SENSETWO

    International Nuclear Information System (INIS)

    Yamauchi, Michinori; Nakayama, Mitsuo; Minami, Kazuyoshi; Seki, Yasushi; Iida, Hiromasa.

    1979-05-01

    A SENSETWO code for the calculation of cross section sensitivities with a two-dimensional model has been developed, on the basis of first order perturbation theory. It uses forward neutron and/or gamma-ray fluxes and adjoint fluxes obtained by two-dimensional discrete ordinates code TWOTRAN-II. The data and informations of cross sections, geometry, nuclide density, response functions, etc. are transmitted to SENSETWO by the dump magnetic tape made in TWOTRAN calculations. The required input for SENSETWO calculations is thus very simple. The SENSETWO yields as printed output the cross section sensitivities for each coarse mesh zone and for each energy group, as well as the plotted output of sensitivity profiles specified by the input. A special feature of the code is that it also calculates the reaction rate with the response function used as the adjoint source in TWOTRAN adjoint calculation and the calculated forward flux from the TWOTRAN forward calculation. (author)

  18. Code ATOM for calculation of atomic characteristics

    International Nuclear Information System (INIS)

    Vainshtein, L.A.

    1990-01-01

    In applying atomic physics to problems of plasma diagnostics, it is necessary to determine some atomic characteristics, including energies and transition probabilities, for very many atoms and ions. Development of general codes for calculation of many types of atomic characteristics has been based on general but comparatively simple approximate methods. The program ATOM represents an attempt at effective use of such a general code. This report gives a brief description of the methods used, and the possibilities of and limitations to the code are discussed. Characteristics of the following processes can be calculated by ATOM: radiative transitions between discrete levels, radiative ionization and recombination, collisional excitation and ionization by electron impact, collisional excitation and ionization by point heavy particle (Born approximation only), dielectronic recombination, and autoionization. ATOM explores Born (for z=1) or Coulomb-Born (for z>1) approximations. In both cases exchange and normalization can be included. (N.K.)

  19. Geometry and Hamiltonian mechanics on discrete spaces

    International Nuclear Information System (INIS)

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

    2004-01-01

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

  20. Cuspidal discrete series for semisimple symmetric spaces

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  1. Discrete Riccati equation solutions: Distributed algorithms

    Directory of Open Access Journals (Sweden)

    D. G. Lainiotis

    1996-01-01

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

  2. Painleve test and discrete Boltzmann equations

    International Nuclear Information System (INIS)

    Euler, N.; Steeb, W.H.

    1989-01-01

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

  3. Variance Swap Replication: Discrete or Continuous?

    Directory of Open Access Journals (Sweden)

    Fabien Le Floc’h

    2018-02-01

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

  4. Discretization vs. Rounding Error in Euler's Method

    Science.gov (United States)

    Borges, Carlos F.

    2011-01-01

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

  5. Discrete/PWM Ballast-Resistor Controller

    Science.gov (United States)

    King, Roger J.

    1994-01-01

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

  6. Current Density and Continuity in Discretized Models

    Science.gov (United States)

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

    2010-01-01

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

  7. Geometry and Hamiltonian mechanics on discrete spaces

    NARCIS (Netherlands)

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

    2004-01-01

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

  8. Geometry and Hamiltonian mechanics on discrete spaces

    NARCIS (Netherlands)

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

    2004-01-01

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

  9. Discrete mathematics in the high school curriculum

    NARCIS (Netherlands)

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

    2004-01-01

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

  10. Discrete Fourier analysis of multigrid algorithms

    NARCIS (Netherlands)

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

    2011-01-01

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

  11. Handbook on modelling for discrete optimization

    CERN Document Server

    Pitsoulis, Leonidas; Williams, H

    2006-01-01

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

  12. Discrete elements method of neutral particle transport

    International Nuclear Information System (INIS)

    Mathews, K.A.

    1983-01-01

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

  13. Spatially localized, temporally quasiperiodic, discrete nonlinear excitations

    International Nuclear Information System (INIS)

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

    1995-01-01

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

  14. Laplacians on discrete and quantum geometries

    International Nuclear Information System (INIS)

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

    2013-01-01

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

  15. Discrete breathers in graphane: Effect of temperature

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-05-15

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

  16. Discussion on LDPC Codes and Uplink Coding

    Science.gov (United States)

    Andrews, Ken; Divsalar, Dariush; Dolinar, Sam; Moision, Bruce; Hamkins, Jon; Pollara, Fabrizio

    2007-01-01

    This slide presentation reviews the progress that the workgroup on Low-Density Parity-Check (LDPC) for space link coding. The workgroup is tasked with developing and recommending new error correcting codes for near-Earth, Lunar, and deep space applications. Included in the presentation is a summary of the technical progress of the workgroup. Charts that show the LDPC decoder sensitivity to symbol scaling errors are reviewed, as well as a chart showing the performance of several frame synchronizer algorithms compared to that of some good codes and LDPC decoder tests at ESTL. Also reviewed is a study on Coding, Modulation, and Link Protocol (CMLP), and the recommended codes. A design for the Pseudo-Randomizer with LDPC Decoder and CRC is also reviewed. A chart that summarizes the three proposed coding systems is also presented.

  17. 76 FR 37034 - Certain Employee Remuneration in Excess of $1,000,000 Under Internal Revenue Code Section 162(m)

    Science.gov (United States)

    2011-06-24

    ... Certain Employee Remuneration in Excess of $1,000,000 Under Internal Revenue Code Section 162(m) AGENCY... remuneration in excess of $1,000,000 under the Internal Revenue Code (Code). The proposed regulations clarify... stock options, it is intended that the directors may retain discretion as to the exact number of options...

  18. Low Complexity List Decoding for Polar Codes with Multiple CRC Codes

    Directory of Open Access Journals (Sweden)

    Jong-Hwan Kim

    2017-04-01

    Full Text Available Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.

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

    International Nuclear Information System (INIS)

    Ding Qing

    2007-01-01

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

  20. Locally orderless registration code

    DEFF Research Database (Denmark)

    2012-01-01

    This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....

  1. Decoding Codes on Graphs

    Indian Academy of Sciences (India)

    Shannon limit of the channel. Among the earliest discovered codes that approach the. Shannon limit were the low density parity check (LDPC) codes. The term low density arises from the property of the parity check matrix defining the code. We will now define this matrix and the role that it plays in decoding. 2. Linear Codes.

  2. Manually operated coded switch

    International Nuclear Information System (INIS)

    Barnette, J.H.

    1978-01-01

    The disclosure related to a manually operated recodable coded switch in which a code may be inserted, tried and used to actuate a lever controlling an external device. After attempting a code, the switch's code wheels must be returned to their zero positions before another try is made

  3. Discrete level schemes and their gamma radiation branching ratios (CENPL-DLS). Pt. 1

    International Nuclear Information System (INIS)

    Su Zongdi; Zhang Limin; Zhou Chunmei; Sun Zhengjun

    1994-01-01

    The DLS data file, which is a sub-library (version 1) of Chinese Evaluated Nuclear Parameter Library (CENPL), consists of data and information of discrete levels and gamma radiations. The data and information of this data file are translated from the Evaluated Nuclear Structure Data File (ENSDF). The transforming code from ENSDF to DLS was written. In the DLS data file, there are the data on discrete levels with determinate energy and their gamma radiations. At present, this file contains the data of 79456 levels and 100411 gammas for 1908 nuclides

  4. First and second collision source for mitigating ray effects in discrete ordinate calculations

    International Nuclear Information System (INIS)

    Gomes, L.T.; Stevens, P.N.

    1991-01-01

    This work revisits the problem of ray effects in discrete ordinates calculations that frequently occurs in two- and three-dimensional systems which contain isolated sources within a highly absorbing medium. The effectiveness of using a first collision source or a second collision source are analyzed as possible remedies to mitigate this problem. The first collision and second collision sources are generated by three-dimensional Monte Carlo calculations that enables its application to a variety of source configurations, and the results can be coupled to a two- or three-dimensional discrete ordinates transport code. (author)

  5. Elementary dispersion analysis of some mimetic discretizations on triangular C-grids

    Energy Technology Data Exchange (ETDEWEB)

    Korn, P., E-mail: peter.korn@mpimet.mpg.de [Max Planck Institute for Meteorology, Hamburg (Germany); Danilov, S. [Alfred Wegener Institute for Polar and Marine Research, Bremerhaven (Germany); A.M. Obukhov Institute of Atmospheric Physics, Moscow (Russian Federation)

    2017-02-01

    Spurious modes supported by triangular C-grids limit their application for modeling large-scale atmospheric and oceanic flows. Their behavior can be modified within a mimetic approach that generalizes the scalar product underlying the triangular C-grid discretization. The mimetic approach provides a discrete continuity equation which operates on an averaged combination of normal edge velocities instead of normal edge velocities proper. An elementary analysis of the wave dispersion of the new discretization for Poincaré, Rossby and Kelvin waves shows that, although spurious Poincaré modes are preserved, their frequency tends to zero in the limit of small wavenumbers, which removes the divergence noise in this limit. However, the frequencies of spurious and physical modes become close on shorter scales indicating that spurious modes can be excited unless high-frequency short-scale motions are effectively filtered in numerical codes. We argue that filtering by viscous dissipation is more efficient in the mimetic approach than in the standard C-grid discretization. Lumping of mass matrices appearing with the velocity time derivative in the mimetic discretization only slightly reduces the accuracy of the wave dispersion and can be used in practice. Thus, the mimetic approach cures some difficulties of the traditional triangular C-grid discretization but may still need appropriately tuned viscosity to filter small scales and high frequencies in solutions of full primitive equations when these are excited by nonlinear dynamics.

  6. Full-frame compression of discrete wavelet and cosine transforms

    Science.gov (United States)

    Lo, Shih-Chung B.; Li, Huai; Krasner, Brian; Freedman, Matthew T.; Mun, Seong K.

    1995-04-01

    At the foreground of computerized radiology and the filmless hospital are the possibilities for easy image retrieval, efficient storage, and rapid image communication. This paper represents the authors' continuous efforts in compression research on full-frame discrete wavelet (FFDWT) and full-frame discrete cosine transforms (FFDCT) for medical image compression. Prior to the coding, it is important to evaluate the global entropy in the decomposed space. It is because of the minimum entropy, that a maximum compression efficiency can be achieved. In this study, each image was split into the top three most significant bit (MSB) and the remaining remapped least significant bit (RLSB) images. The 3MSB image was compressed by an error-free contour coding and received an average of 0.1 bit/pixel. The RLSB image was either transformed to a multi-channel wavelet or the cosine transform domain for entropy evaluation. Ten x-ray chest radiographs and ten mammograms were randomly selected from our clinical database and were used for the study. Our results indicated that the coding scheme in the FFDCT domain performed better than in FFDWT domain for high-resolution digital chest radiographs and mammograms. From this study, we found that decomposition efficiency in the DCT domain for relatively smooth images is higher than that in the DWT. However, both schemes worked just as well for low resolution digital images. We also found that the image characteristics of the `Lena' image commonly used in the compression literature are very different from those of radiological images. The compression outcome of the radiological images can not be extrapolated from the compression result based on the `Lena.'

  7. The adaptive collision source method for discrete ordinates radiation transport

    International Nuclear Information System (INIS)

    Walters, William J.; Haghighat, Alireza

    2017-01-01

    Highlights: • A new adaptive quadrature method to solve the discrete ordinates transport equation. • The adaptive collision source (ACS) method splits the flux into n’th collided components. • Uncollided flux requires high quadrature; this is lowered with number of collisions. • ACS automatically applies appropriate quadrature order each collided component. • The adaptive quadrature is 1.5–4 times more efficient than uniform quadrature. - Abstract: A novel collision source method has been developed to solve the Linear Boltzmann Equation (LBE) more efficiently by adaptation of the angular quadrature order. The angular adaptation method is unique in that the flux from each scattering source iteration is obtained, with potentially a different quadrature order used for each. Traditionally, the flux from every iteration is combined, with the same quadrature applied to the combined flux. Since the scattering process tends to distribute the radiation more evenly over angles (i.e., make it more isotropic), the quadrature requirements generally decrease with each iteration. This method allows for an optimal use of processing power, by using a high order quadrature for the first iterations that need it, before shifting to lower order quadratures for the remaining iterations. This is essentially an extension of the first collision source method, and is referred to as the adaptive collision source (ACS) method. The ACS methodology has been implemented in the 3-D, parallel, multigroup discrete ordinates code TITAN. This code was tested on a several simple and complex fixed-source problems. The ACS implementation in TITAN has shown a reduction in computation time by a factor of 1.5–4 on the fixed-source test problems, for the same desired level of accuracy, as compared to the standard TITAN code.

  8. Coding in Muscle Disease.

    Science.gov (United States)

    Jones, Lyell K; Ney, John P

    2016-12-01

    Accurate coding is critically important for clinical practice and research. Ongoing changes to diagnostic and billing codes require the clinician to stay abreast of coding updates. Payment for health care services, data sets for health services research, and reporting for medical quality improvement all require accurate administrative coding. This article provides an overview of administrative coding for patients with muscle disease and includes a case-based review of diagnostic and Evaluation and Management (E/M) coding principles in patients with myopathy. Procedural coding for electrodiagnostic studies and neuromuscular ultrasound is also reviewed.

  9. Computer-assisted Particle-in-Cell code development

    International Nuclear Information System (INIS)

    Kawata, S.; Boonmee, C.; Teramoto, T.; Drska, L.; Limpouch, J.; Liska, R.; Sinor, M.

    1997-12-01

    This report presents a new approach for an electromagnetic Particle-in-Cell (PIC) code development by a computer: in general PIC codes have a common structure, and consist of a particle pusher, a field solver, charge and current density collections, and a field interpolation. Because of the common feature, the main part of the PIC code can be mechanically developed on a computer. In this report we use the packages FIDE and GENTRAN of the REDUCE computer algebra system for discretizations of field equations and a particle equation, and for an automatic generation of Fortran codes. The approach proposed is successfully applied to the development of 1.5-dimensional PIC code. By using the generated PIC code the Weibel instability in a plasma is simulated. The obtained growth rate agrees well with the theoretical value. (author)

  10. Compatible Spatial Discretizations for Partial Differential Equations

    Energy Technology Data Exchange (ETDEWEB)

    Arnold, Douglas, N, ed.

    2004-11-25

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

  11. QR Codes 101

    Science.gov (United States)

    Crompton, Helen; LaFrance, Jason; van 't Hooft, Mark

    2012-01-01

    A QR (quick-response) code is a two-dimensional scannable code, similar in function to a traditional bar code that one might find on a product at the supermarket. The main difference between the two is that, while a traditional bar code can hold a maximum of only 20 digits, a QR code can hold up to 7,089 characters, so it can contain much more…

  12. Perfect discretization of reparametrization invariant path integrals

    International Nuclear Information System (INIS)

    Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

    2011-01-01

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

  13. Perfect discretization of reparametrization invariant path integrals

    Science.gov (United States)

    Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

    2011-05-01

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

  14. Discrete particle noise in particle-in-cell simulations of plasma microturbulence

    International Nuclear Information System (INIS)

    Nevins, W.M.; Hammett, G.W.; Dimits, A.M.; Dorland, W.; Shumaker, D.E.

    2005-01-01

    Recent gyrokinetic simulations of electron temperature gradient (ETG) turbulence with the global particle-in-cell (PIC) code GTC [Z. Lin et al., Proceedings of the 20th Fusion Energy Conference, Vilamoura, Portugal, 2004 (IAEA, Vienna, 2005)] yielded different results from earlier flux-tube continuum code simulations [F. Jenko and W. Dorland, Phys. Rev. Lett. 89, 225001 (2002)] despite similar plasma parameters. Differences between the simulation results were attributed to insufficient phase-space resolution and novel physics associated with global simulation models. The results of the global PIC code are reproduced here using the flux-tube PIC code PG3EQ [A. M. Dimits et al., Phys. Rev. Lett. 77, 71 (1996)], thereby eliminating global effects as the cause of the discrepancy. The late-time decay of the ETG turbulence and the steady-state heat transport observed in these PIC simulations are shown to result from discrete particle noise. Discrete particle noise is a numerical artifact, so both these PG3EQ simulations and, by inference, the GTC simulations that they reproduced have little to say about steady-state ETG turbulence and the associated anomalous heat transport. In the course of this work several diagnostics are developed to retrospectively test whether a particular PIC simulation is dominated by discrete particle noise

  15. Higher dimensional discrete Cheeger inequalities

    Directory of Open Access Journals (Sweden)

    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.

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

    International Nuclear Information System (INIS)

    Maruno, Ken-ichi; Biondini, Gino

    2004-01-01

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

  17. Hairs of discrete symmetries and gravity

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-06-10

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

  18. Hairs of discrete symmetries and gravity

    Directory of Open Access Journals (Sweden)

    Kang Sin Choi

    2017-06-01

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

  19. Discrete Morse functions for graph configuration spaces

    International Nuclear Information System (INIS)

    Sawicki, A

    2012-01-01

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

  20. Discrete Tomography and Imaging of Polycrystalline Structures

    DEFF Research Database (Denmark)

    Alpers, Andreas

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

  1. Ensemble simulations with discrete classical dynamics

    DEFF Research Database (Denmark)

    Toxværd, Søren

    2013-01-01

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

  2. Stochastic Kuramoto oscillators with discrete phase states

    Science.gov (United States)

    Jörg, David J.

    2017-09-01

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

  3. Stochastic Kuramoto oscillators with discrete phase states.

    Science.gov (United States)

    Jörg, David J

    2017-09-01

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

  4. Discrete-Time Biomedical Signal Encryption

    Directory of Open Access Journals (Sweden)

    Victor Grigoraş

    2017-12-01

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

  5. Discrete symmetries and de Sitter spacetime

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-11-24

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

  6. Codes and curves

    CERN Document Server

    Walker, Judy L

    2000-01-01

    When information is transmitted, errors are likely to occur. Coding theory examines efficient ways of packaging data so that these errors can be detected, or even corrected. The traditional tools of coding theory have come from combinatorics and group theory. Lately, however, coding theorists have added techniques from algebraic geometry to their toolboxes. In particular, by re-interpreting the Reed-Solomon codes, one can see how to define new codes based on divisors on algebraic curves. For instance, using modular curves over finite fields, Tsfasman, Vladut, and Zink showed that one can define a sequence of codes with asymptotically better parameters than any previously known codes. This monograph is based on a series of lectures the author gave as part of the IAS/PCMI program on arithmetic algebraic geometry. Here, the reader is introduced to the exciting field of algebraic geometric coding theory. Presenting the material in the same conversational tone of the lectures, the author covers linear codes, inclu...

  7. Upper bound on the capacity of constrained three-dimensional codes

    DEFF Research Database (Denmark)

    Forchhammer, Søren

    2000-01-01

    An upper bound on the capacity of constrained three-dimensional codes is presented. The bound for two-dimensional codes of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, no.1, p.54-60, 1998) was extended to three dimensions by Nagy and Zeger. Both bounds apply to first order s...

  8. Exterior difference systems and invariance properties of discrete mechanics

    International Nuclear Information System (INIS)

    Xie Zheng; Xie Duanqiang; Li Hongbo

    2008-01-01

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

  9. Review of SKB's Code Documentation and Testing

    International Nuclear Information System (INIS)

    Hicks, T.W.

    2005-01-01

    SKB is in the process of developing the SR-Can safety assessment for a KBS 3 repository. The assessment will be based on quantitative analyses using a range of computational codes aimed at developing an understanding of how the repository system will evolve. Clear and comprehensive code documentation and testing will engender confidence in the results of the safety assessment calculations. This report presents the results of a review undertaken on behalf of SKI aimed at providing an understanding of how codes used in the SR 97 safety assessment and those planned for use in the SR-Can safety assessment have been documented and tested. Having identified the codes us ed by SKB, several codes were selected for review. Consideration was given to codes used directly in SKB's safety assessment calculations as well as to some of the less visible codes that are important in quantifying the different repository barrier safety functions. SKB's documentation and testing of the following codes were reviewed: COMP23 - a near-field radionuclide transport model developed by SKB for use in safety assessment calculations. FARF31 - a far-field radionuclide transport model developed by SKB for use in safety assessment calculations. PROPER - SKB's harness for executing probabilistic radionuclide transport calculations using COMP23 and FARF31. The integrated analytical radionuclide transport model that SKB has developed to run in parallel with COMP23 and FARF31. CONNECTFLOW - a discrete fracture network model/continuum model developed by Serco Assurance (based on the coupling of NAMMU and NAPSAC), which SKB is using to combine hydrogeological modelling on the site and regional scales in place of the HYDRASTAR code. DarcyTools - a discrete fracture network model coupled to a continuum model, recently developed by SKB for hydrogeological modelling, also in place of HYDRASTAR. ABAQUS - a finite element material model developed by ABAQUS, Inc, which is used by SKB to model repository buffer

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

    Science.gov (United States)

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

    2017-12-01

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

  11. On organizing principles of discrete differential geometry. Geometry of spheres

    International Nuclear Information System (INIS)

    Bobenko, Alexander I; Suris, Yury B

    2007-01-01

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

  12. Can time be a discrete dynamical variable

    International Nuclear Information System (INIS)

    Lee, T.D.

    1983-01-01

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

  13. Local discrete symmetries from superstring derived models

    International Nuclear Information System (INIS)

    Faraggi, A.E.

    1996-10-01

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

  14. Breatherlike impurity modes in discrete nonlinear lattices

    DEFF Research Database (Denmark)

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

  15. Inferring gene networks from discrete expression data

    KAUST Repository

    Zhang, L.; Mallick, B. K.

    2013-01-01

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

  16. A discrete control model of PLANT

    Science.gov (United States)

    Mitchell, C. M.

    1985-01-01

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

  17. Running Parallel Discrete Event Simulators on Sierra

    Energy Technology Data Exchange (ETDEWEB)

    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.

  18. Effective Hamiltonian for travelling discrete breathers

    Science.gov (United States)

    MacKay, Robert S.; Sepulchre, Jacques-Alexandre

    2002-05-01

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

  19. Comparing the Discrete and Continuous Logistic Models

    Science.gov (United States)

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

  20. Discrete-time nonlinear sliding mode controller

    African Journals Online (AJOL)

    user

    Keywords: Discrete-time delay system, Sliding mode control, nonlinear sliding ... of engineering systems such as chemical process control, delay in the actuator ...... instrumentation from Motilal Nehru National Institute of Technology (MNNIT),.

  1. Rich dynamics of discrete delay ecological models

    International Nuclear Information System (INIS)

    Peng Mingshu

    2005-01-01

    We study multiple bifurcations and chaotic behavior of a discrete delay ecological model. New form of chaos for the 2-D map is observed: the combination of potential period doubling and reverse period-doubling leads to cascading bubbles

  2. Discrete and Continuous Models for Partitioning Problems

    KAUST Repository

    Lellmann, Jan; Lellmann, Bjö rn; Widmann, Florian; Schnö rr, Christoph

    2013-01-01

    -based techniques. This work is concerned with the sources of such artifacts. We discuss the importance of differentiating between artifacts caused by discretization and those caused by relaxation and provide supporting numerical examples. Moreover, we consider

  3. Memorized discrete systems and time-delay

    CERN Document Server

    Luo, Albert C J

    2017-01-01

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

  4. Discrete element modelling of bedload transport

    Science.gov (United States)

    Loyer, A.; Frey, P.

    2011-12-01

    Discrete element modelling (DEM) has been widely used in solid mechanics and in granular physics. In this type of modelling, each individual particle is taken into account and intergranular interactions are modelled with simple laws (e.g. Coulomb friction). Gravity and contact forces permit to solve the dynamical behaviour of the system. DEM is interesting to model configurations and access to parameters not directly available in laboratory experimentation, hence the term "numerical experimentations" sometimes used to describe DEM. DEM was used to model bedload transport experiments performed at the particle scale with spherical glass beads in a steep and narrow flume. Bedload is the larger material that is transported on the bed on stream channels. It has a great geomorphic impact. Physical processes ruling bedload transport and more generally coarse-particle/fluid systems are poorly known, arguably because granular interactions have been somewhat neglected. An existing DEM code (PFC3D) already computing granular interactions was used. We implemented basic hydrodynamic forces to model the fluid interactions (buoyancy, drag, lift). The idea was to use the minimum number of ingredients to match the experimental results. Experiments were performed with one-size and two-size mixtures of coarse spherical glass beads entrained by a shallow turbulent and supercritical water flow down a steep channel with a mobile bed. The particle diameters were 4 and 6mm, the channel width 6.5mm (about the same width as the coarser particles) and the channel inclination was typically 10%. The water flow rate and the particle rate were kept constant at the upstream entrance and adjusted to obtain bedload transport equilibrium. Flows were filmed from the side by a high-speed camera. Using image processing algorithms made it possible to determine the position, velocity and trajectory of both smaller and coarser particles. Modelled and experimental particle velocity and concentration depth

  5. Testing Preference Axioms in Discrete Choice experiments

    DEFF Research Database (Denmark)

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

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

  6. Quadratic Term Structure Models in Discrete Time

    OpenAIRE

    Marco Realdon

    2006-01-01

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

  7. Symmetries in discrete-time mechanics

    International Nuclear Information System (INIS)

    Khorrami, M.

    1996-01-01

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

  8. Nonlinear integrodifferential equations as discrete systems

    Science.gov (United States)

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

    1999-06-01

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

  9. Definable maximal discrete sets in forcing extensions

    DEFF Research Database (Denmark)

    Törnquist, Asger Dag; Schrittesser, David

    2018-01-01

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

  10. Application of multivariate splines to discrete mathematics

    OpenAIRE

    Xu, Zhiqiang

    2005-01-01

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

  11. Discrete symmetries and solar neutrino mixing

    Energy Technology Data Exchange (ETDEWEB)

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

    1992-05-21

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

  12. Discrete symmetries and solar neutrino mixing

    International Nuclear Information System (INIS)

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

    1992-01-01

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

  13. Discrete symmetries and coset space dimensional reduction

    International Nuclear Information System (INIS)

    Kapetanakis, D.; Zoupanos, G.

    1989-01-01

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

  14. On discrete models of space-time

    International Nuclear Information System (INIS)

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

    1992-02-01

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

  15. Discrete approximations to vector spin models

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-11-25

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

  16. Discrete approximations to vector spin models

    International Nuclear Information System (INIS)

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

    2011-01-01

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

  17. A study of discrete nonlinear systems

    International Nuclear Information System (INIS)

    Dhillon, H.S.

    2001-04-01

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

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

    KAUST Repository

    Mohamed, Mamdouh S.

    2016-02-11

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

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

    Science.gov (United States)

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

    2016-05-01

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

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

    International Nuclear Information System (INIS)

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

    2012-01-01

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