The Deep Impact Coma of Comet 9P/Tempel 1 as a Time-of-Flight Experiment Motivates DDSCAT Models for Porous Aggregate Grains with Silicate Crystal Inclusions

Science.gov (United States)

Wooden, Diane H.; Lindsay, S. S.; Harker, D. E.; Kelley, M. S.; Woodward, C. E.; Richard, D. T.; Kolokolova, L.; Moreno, F.

2010-10-01

Spitzer IRS spectra of short-period Ecliptic Comets (ECs) have silicate features, and many have distinct crystalline silicate peaks. These Spitzer spectra, when fitted with thermal models after subtraction of the relatively strong contribution of the nuclear flux to the IR spectrum (e.g., Harker et al. 2007), demonstrate ECs have weaker silicate features than long-period Nearly-Isotropic Comets (NICs). There are exceptions, however, as some NICs also have weak features like most ECs. Grains with lower porosities (lower fraction of vacuum) can explain weaker silicate features (Kelley and Wooden 2009; Kolokolova et al. 2007). Alternatively, omitting the smallest (submicron) solid grains can reduce the contrast of the silicate feature (Lisse et al. 2006). However, so far, only models for solid submicron crystals fit the crystalline peaks in spectra of comets with weak silicate features. This presents a dilemma: how can the coma be devoid of small grains except for the crystals? The Spitzer spectra of the Deep Impact event with EC 9P/Tempel 1 provides a data set to model larger porous grains with crystal inclusions because the post-impact coma was a time-of-flight experiment: an impulsive release of grains were size-sorted in time by their respective gas velocities so that the smaller grains departed the inner coma quicker than larger grains. A velocity law derived from fitting small beam Gemini spectra (Harker et al. 2007) indicates that at 20 hour post-impact the (pre-impact subtracted) Spitzer IRS spectrum contained grains larger than 10-20 micron radii, moving at 20 m/s, that produced a weak silicate feature with an 11.2 micron crystalline olivine peak. Furthermore, this feature looks like the silicate feature from the nominal coma. We present some results of a computational effort to model discrete crystals and mixed-mineral porous aggregate grains with silicate crystal inclusions using DDSCAT on the NAS Pleiades supercomputer.

VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport

International Nuclear Information System (INIS)

Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

1975-10-01

The computer code block VENTURE, designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P 1 ) in up to three-dimensional geometry is described. A variety of types of problems may be solved: the usual eigenvalue problem, a direct criticality search on the buckling, on a reciprocal velocity absorber (prompt mode), or on nuclide concentrations, or an indirect criticality search on nuclide concentrations, or on dimensions. First-order perturbation analysis capability is available at the macroscopic cross section level

Approximate symmetries of Hamiltonians

Science.gov (United States)

Chubb, Christopher T.; Flammia, Steven T.

2017-08-01

We explore the relationship between approximate symmetries of a gapped Hamiltonian and the structure of its ground space. We start by considering approximate symmetry operators, defined as unitary operators whose commutators with the Hamiltonian have norms that are sufficiently small. We show that when approximate symmetry operators can be restricted to the ground space while approximately preserving certain mutual commutation relations. We generalize the Stone-von Neumann theorem to matrices that approximately satisfy the canonical (Heisenberg-Weyl-type) commutation relations and use this to show that approximate symmetry operators can certify the degeneracy of the ground space even though they only approximately form a group. Importantly, the notions of "approximate" and "small" are all independent of the dimension of the ambient Hilbert space and depend only on the degeneracy in the ground space. Our analysis additionally holds for any gapped band of sufficiently small width in the excited spectrum of the Hamiltonian, and we discuss applications of these ideas to topological quantum phases of matter and topological quantum error correcting codes. Finally, in our analysis, we also provide an exponential improvement upon bounds concerning the existence of shared approximate eigenvectors of approximately commuting operators under an added normality constraint, which may be of independent interest.

Usage of burnt fuel isotopic compositions from engineering codes in Monte-Carlo code calculations

International Nuclear Information System (INIS)

Aleshin, Sergey S.; Gorodkov, Sergey S.; Shcherenko, Anna I.

2015-01-01

A burn-up calculation of VVER's cores by Monte-Carlo code is complex process and requires large computational costs. This fact makes Monte-Carlo codes usage complicated for project and operating calculations. Previously prepared isotopic compositions are proposed to use for the Monte-Carlo code (MCU) calculations of different states of VVER's core with burnt fuel. Isotopic compositions are proposed to calculate by an approximation method. The approximation method is based on usage of a spectral functionality and reference isotopic compositions, that are calculated by engineering codes (TVS-M, PERMAK-A). The multiplication factors and power distributions of FA and VVER with infinite height are calculated in this work by the Monte-Carlo code MCU using earlier prepared isotopic compositions. The MCU calculation data were compared with the data which were obtained by engineering codes.

Coincidence: Fortran code for calculation of (e, e'x) differential cross-sections, nuclear structure functions and polarization asymmetry in self-consistent random phase approximation with Skyrme interaction

Energy Technology Data Exchange (ETDEWEB)

Cavinato, M.; Marangoni, M.; Saruis, A.M.

1990-10-01

This report describes the COINCIDENCE code written for the IBM 3090/300E computer in Fortran 77 language. The output data of this code are the (e, e'x) threefold differential cross-sections, the nuclear structure functions, the polarization asymmetry and the angular correlation coefficients. In the real photon limit, the output data are the angular distributions for plane polarized incident photons. The code reads from tape the transition matrix elements previously calculated, by in continuum self-consistent RPA (random phase approximation) theory with Skyrme interactions. This code has been used to perform a numerical analysis of coincidence (e, e'x) reactions with polarized electrons on the /sup 16/O nucleous.

Physics options in the plasma code VOA

International Nuclear Information System (INIS)

Eltgroth, P.G.

1976-06-01

A two dimensional relativistic plasma physics code has been modified to accomodate general electromagnetic boundary conditions and various approximations of basic physics. The code can treat internal conductors and insulators, imposed electromagnetic fields, the effects of external circuitry and non-equilibrium starting conditions. Particle dynamics options include a full microscopic treatment, fully relaxed electrons, a low frequency electron approximation and a combination of approximations for specified zones. Electromagnetic options include the full wave treatment, an electrostatic approximation and two varieties of magnetohydrodynamic approximations in specified zones

Legendre-tau approximations for functional differential equations

Science.gov (United States)

Ito, K.; Teglas, R.

1986-01-01

The numerical approximation of solutions to linear retarded functional differential equations are considered using the so-called Legendre-tau method. The functional differential equation is first reformulated as a partial differential equation with a nonlocal boundary condition involving time-differentiation. The approximate solution is then represented as a truncated Legendre series with time-varying coefficients which satisfy a certain system of ordinary differential equations. The method is very easy to code and yields very accurate approximations. Convergence is established, various numerical examples are presented, and comparison between the latter and cubic spline approximation is made.

When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

KAUST Repository

Wang, Jim Jing-Yan

2017-06-28

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.

Log-Likelihood Ratio Calculation for Iterative Decoding on Rayleigh Fading Channels Using Padé Approximation

Directory of Open Access Journals (Sweden)

Gou Hosoya

2013-01-01

Full Text Available Approximate calculation of channel log-likelihood ratio (LLR for wireless channels using Padé approximation is presented. LLR is used as an input of iterative decoding for powerful error-correcting codes such as low-density parity-check (LDPC codes or turbo codes. Due to the lack of knowledge of the channel state information of a wireless fading channel, such as uncorrelated fiat Rayleigh fading channels, calculations of exact LLR for these channels are quite complicated for a practical implementation. The previous work, an LLR calculation using the Taylor approximation, quickly becomes inaccurate as the channel output leaves some derivative point. This becomes a big problem when higher order modulation scheme is employed. To overcome this problem, a new LLR approximation using Padé approximation, which expresses the original function by a rational form of two polynomials with the same total number of coefficients of the Taylor series and can accelerate the Taylor approximation, is devised. By applying the proposed approximation to the iterative decoding and the LDPC codes with some modulation schemes, we show the effectiveness of the proposed methods by simulation results and analysis based on the density evolution.

VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport, version II

International Nuclear Information System (INIS)

Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

1977-11-01

The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P 1 ) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently

Implementation of an approximate zero-variance scheme in the TRIPOLI Monte Carlo code

Energy Technology Data Exchange (ETDEWEB)

Christoforou, S.; Hoogenboom, J. E. [Delft Univ. of Technology, Mekelweg 15, 2629 JB Delft (Netherlands); Dumonteil, E.; Petit, O.; Diop, C. [Commissariat a l' Energie Atomique CEA, Gif-sur-Yvette (France)

2006-07-01

In an accompanying paper it is shown that theoretically a zero-variance Monte Carlo scheme can be devised for criticality calculations if the space, energy and direction dependent adjoint function is exactly known. This requires biasing of the transition and collision kernels with the appropriate adjoint function. In this paper it is discussed how an existing general purpose Monte Carlo code like TRIPOLI can be modified to approach the zero-variance scheme. This requires modifications for reading in the adjoint function obtained from a separate deterministic calculation for a number of space intervals, energy groups and discrete directions. Furthermore, a function has to be added to supply the direction dependent and the averaged adjoint function at a specific position in the system by interpolation. The initial particle weights of a certain batch must be set inversely proportional to the averaged adjoint function and proper normalization of the initial weights must be secured. The sampling of the biased transition kernel requires cumulative integrals of the biased kernel along the flight path until a certain value, depending on a selected random number is reached to determine a new collision site. The weight of the particle must be adapted accordingly. The sampling of the biased collision kernel (in a multigroup treatment) is much more like the normal sampling procedure. A numerical example is given for a 3-group calculation with a simplified transport model (two-direction model), demonstrating that the zero-variance scheme can be approximated quite well for this simplified case. (authors)

VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport, version II. [LMFBR

Energy Technology Data Exchange (ETDEWEB)

Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

1977-11-01

The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P/sub 1/) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently.

Validation of thermalhydraulic codes

International Nuclear Information System (INIS)

Wilkie, D.

1992-01-01

Thermalhydraulic codes require to be validated against experimental data collected over a wide range of situations if they are to be relied upon. A good example is provided by the nuclear industry where codes are used for safety studies and for determining operating conditions. Errors in the codes could lead to financial penalties, to the incorrect estimation of the consequences of accidents and even to the accidents themselves. Comparison between prediction and experiment is often described qualitatively or in approximate terms, e.g. ''agreement is within 10%''. A quantitative method is preferable, especially when several competing codes are available. The codes can then be ranked in order of merit. Such a method is described. (Author)

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan; Gao, Xin

2014-01-01

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan

2014-07-06

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

Fast successive approximation analog-to-digital converter

Energy Technology Data Exchange (ETDEWEB)

Gobbur, S G; Landis, D A; Goulding, F S [California Univ., Berkeley (USA). Lawrence Berkeley Lab.

1977-01-15

A new scheme has been developed for a 4096-channel (12-bit) successive approximation ADC which will allow more rapid coding than schemes commonly used at the present time. The allowable bit setting time for the major bits has been increased without adding to the total coding time. This is accomplished by permitting the initial accuracy of the setting of the major bits to be within eight channels. Towards the end of the coding time, when the major bits have settled, this error is corrected to an accuracy of a fraction of a channel. Using this scheme a differential nonlinearity of better than 20% has been achieved in the basic encoder with a total coding time of 4 ..mu..s. Applying a 6-bit sliding register (the method of Gatti) to the ADC, a differential nonlinearity less than 0.5% results in the complete ADC.

Radiative transfer in disc galaxies - V. The accuracy of the KB approximation

Science.gov (United States)

Lee, Dukhang; Baes, Maarten; Seon, Kwang-Il; Camps, Peter; Verstocken, Sam; Han, Wonyong

2016-12-01

We investigate the accuracy of an approximate radiative transfer technique that was first proposed by Kylafis & Bahcall (hereafter the KB approximation) and has been popular in modelling dusty late-type galaxies. We compare realistic galaxy models calculated with the KB approximation with those of a three-dimensional Monte Carlo radiative transfer code SKIRT. The SKIRT code fully takes into account of the contribution of multiple scattering whereas the KB approximation calculates only single scattered intensity and multiple scattering components are approximated. We find that the KB approximation gives fairly accurate results if optically thin, face-on galaxies are considered. However, for highly inclined (I ≳ 85°) and/or optically thick (central face-on optical depth ≳1) galaxy models, the approximation can give rise to substantial errors, sometimes, up to ≳40 per cent. Moreover, it is also found that the KB approximation is not always physical, sometimes producing infinite intensities at lines of sight with high optical depth in edge-on galaxy models. There is no `simple recipe' to correct the errors of the KB approximation that is universally applicable to any galaxy models. Therefore, it is recommended that the full radiative transfer calculation be used, even though it is slower than the KB approximation.

Monte-Carlo code calculation of 3D reactor core model with usage of burnt fuel isotopic compositions, obtained by engineering codes

Energy Technology Data Exchange (ETDEWEB)

Aleshin, Sergey S.; Gorodkov, Sergey S.; Shcherenko, Anna I. [National Research Centre ' Kurchatov Institute' , Moscow (Russian Federation)

2016-09-15

A burn-up calculation of large systems by Monte-Carlo code (MCU) is complex process and it requires large computational costs. Previously prepared isotopic compositions are proposed to be used for the Monte-Carlo code calculations of different system states with burnt fuel. Isotopic compositions are calculated by an approximation method. The approximation method is based on usage of a spectral functionality and reference isotopic compositions, that are calculated by the engineering codes (TVS-M, BIPR-7A and PERMAK-A). The multiplication factors and power distributions of FAs from a 3-D reactor core are calculated in this work by the Monte-Carlo code MCU using earlier prepared isotopic compositions. The separate conditions of the burnt core are observed. The results of MCU calculations were compared with those that were obtained by engineering codes.

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

Development of the point-depletion code DEPTH

International Nuclear Information System (INIS)

She, Ding; Wang, Kan; Yu, Ganglin

2013-01-01

Highlights: ► The DEPTH code has been developed for the large-scale depletion system. ► DEPTH uses the data library which is convenient to couple with MC codes. ► TTA and matrix exponential methods are implemented and compared. ► DEPTH is able to calculate integral quantities based on the matrix inverse. ► Code-to-code comparisons prove the accuracy and efficiency of DEPTH. -- Abstract: The burnup analysis is an important aspect in reactor physics, which is generally done by coupling of transport calculations and point-depletion calculations. DEPTH is a newly-developed point-depletion code of handling large burnup depletion systems and detailed depletion chains. For better coupling with Monte Carlo transport codes, DEPTH uses data libraries based on the combination of ORIGEN-2 and ORIGEN-S and allows users to assign problem-dependent libraries for each depletion step. DEPTH implements various algorithms of treating the stiff depletion systems, including the Transmutation trajectory analysis (TTA), the Chebyshev Rational Approximation Method (CRAM), the Quadrature-based Rational Approximation Method (QRAM) and the Laguerre Polynomial Approximation Method (LPAM). Three different modes are supported by DEPTH to execute the decay, constant flux and constant power calculations. In addition to obtaining the instantaneous quantities of the radioactivity, decay heats and reaction rates, DEPTH is able to calculate the integral quantities by a time-integrated solver. Through calculations compared with ORIGEN-2, the validity of DEPTH in point-depletion calculations is proved. The accuracy and efficiency of depletion algorithms are also discussed. In addition, an actual pin-cell burnup case is calculated to illustrate the DEPTH code performance in coupling with the RMC Monte Carlo code

Development of codes for physical calculations of WWER

International Nuclear Information System (INIS)

Novikov, A.N.

2000-01-01

A package of codes for physical calculations of WWER reactors, used at the RRC 'Kurchatov Institute' is discussed including the purpose of these codes, approximations used, degree of data verification, possibilities of automation of calculations and presentation of results, trends of further development of the codes. (Authors)

VT ZIP Code Areas

Data.gov (United States)

Vermont Center for Geographic Information — (Link to Metadata) A ZIP Code Tabulation Area (ZCTA) is a statistical geographic entity that approximates the delivery area for a U.S. Postal Service five-digit...

Implatation of MC2 computer code

International Nuclear Information System (INIS)

Seehusen, J.; Nair, R.P.K.; Becceneri, J.C.

1981-01-01

The implantation of MC2 computer code in the CDC system is presented. The MC2 computer code calculates multigroup cross sections for tipical compositions of fast reactors. The multigroup constants are calculated using solutions of PI or BI approximations for determined buckling value as weighting function. (M.C.K.) [pt

Improved diffusion coefficients generated from Monte Carlo codes

International Nuclear Information System (INIS)

Herman, B. R.; Forget, B.; Smith, K.; Aviles, B. N.

2013-01-01

Monte Carlo codes are becoming more widely used for reactor analysis. Some of these applications involve the generation of diffusion theory parameters including macroscopic cross sections and diffusion coefficients. Two approximations used to generate diffusion coefficients are assessed using the Monte Carlo code MC21. The first is the method of homogenization; whether to weight either fine-group transport cross sections or fine-group diffusion coefficients when collapsing to few-group diffusion coefficients. The second is a fundamental approximation made to the energy-dependent P1 equations to derive the energy-dependent diffusion equations. Standard Monte Carlo codes usually generate a flux-weighted transport cross section with no correction to the diffusion approximation. Results indicate that this causes noticeable tilting in reconstructed pin powers in simple test lattices with L2 norm error of 3.6%. This error is reduced significantly to 0.27% when weighting fine-group diffusion coefficients by the flux and applying a correction to the diffusion approximation. Noticeable tilting in reconstructed fluxes and pin powers was reduced when applying these corrections. (authors)

Optimized implementations of rational approximations for the Voigt and complex error function

International Nuclear Information System (INIS)

Schreier, Franz

2011-01-01

Rational functions are frequently used as efficient yet accurate numerical approximations for real and complex valued functions. For the complex error function w(x+iy), whose real part is the Voigt function K(x,y), code optimizations of rational approximations are investigated. An assessment of requirements for atmospheric radiative transfer modeling indicates a y range over many orders of magnitude and accuracy better than 10 -4 . Following a brief survey of complex error function algorithms in general and rational function approximations in particular the problems associated with subdivisions of the x, y plane (i.e., conditional branches in the code) are discussed and practical aspects of Fortran and Python implementations are considered. Benchmark tests of a variety of algorithms demonstrate that programming language, compiler choice, and implementation details influence computational speed and there is no unique ranking of algorithms. A new implementation, based on subdivision of the upper half-plane in only two regions, combining Weideman's rational approximation for small |x|+y<15 and Humlicek's rational approximation otherwise is shown to be efficient and accurate for all x, y.

Linear source approximation scheme for method of characteristics

International Nuclear Information System (INIS)

Tang Chuntao

2011-01-01

Method of characteristics (MOC) for solving neutron transport equation based on unstructured mesh has already become one of the fundamental methods for lattice calculation of nuclear design code system. However, most of MOC codes are developed with flat source approximation called step characteristics (SC) scheme, which is another basic assumption for MOC. A linear source (LS) characteristics scheme and its corresponding modification for negative source distribution were proposed. The OECD/NEA C5G7-MOX 2D benchmark and a self-defined BWR mini-core problem were employed to validate the new LS module of PEACH code. Numerical results indicate that the proposed LS scheme employs less memory and computational time compared with SC scheme at the same accuracy. (authors)

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.

Computation of the bounce-average code

International Nuclear Information System (INIS)

Cutler, T.A.; Pearlstein, L.D.; Rensink, M.E.

1977-01-01

The bounce-average computer code simulates the two-dimensional velocity transport of ions in a mirror machine. The code evaluates and bounce-averages the collision operator and sources along the field line. A self-consistent equilibrium magnetic field is also computed using the long-thin approximation. Optionally included are terms that maintain μ, J invariance as the magnetic field changes in time. The assumptions and analysis that form the foundation of the bounce-average code are described. When references can be cited, the required results are merely stated and explained briefly. A listing of the code is appended

Language Recognition via Sparse Coding

Science.gov (United States)

2016-09-08

explanation is that sparse coding can achieve a near-optimal approximation of much complicated nonlinear relationship through local and piecewise linear...training examples, where x(i) ∈ RN is the ith example in the batch. Optionally, X can be normalized and whitened before sparse coding for better result...normalized input vectors are then ZCA- whitened [20]. Em- pirically, we choose ZCA- whitening over PCA- whitening , and there is no dimensionality reduction

Adaptive distributed source coding.

Science.gov (United States)

Varodayan, David; Lin, Yao-Chung; Girod, Bernd

2012-05-01

We consider distributed source coding in the presence of hidden variables that parameterize the statistical dependence among sources. We derive the Slepian-Wolf bound and devise coding algorithms for a block-candidate model of this problem. The encoder sends, in addition to syndrome bits, a portion of the source to the decoder uncoded as doping bits. The decoder uses the sum-product algorithm to simultaneously recover the source symbols and the hidden statistical dependence variables. We also develop novel techniques based on density evolution (DE) to analyze the coding algorithms. We experimentally confirm that our DE analysis closely approximates practical performance. This result allows us to efficiently optimize parameters of the algorithms. In particular, we show that the system performs close to the Slepian-Wolf bound when an appropriate doping rate is selected. We then apply our coding and analysis techniques to a reduced-reference video quality monitoring system and show a bit rate saving of about 75% compared with fixed-length coding.

Performance evaluation based on data from code reviews

OpenAIRE

Andrej, Sekáč

2016-01-01

Context. Modern code review tools such as Gerrit have made available great amounts of code review data from different open source projects as well as other commercial projects. Code reviews are used to keep the quality of produced source code under control but the stored data could also be used for evaluation of the software development process. Objectives. This thesis uses machine learning methods for an approximation of review expert’s performance evaluation function. Due to limitations in ...

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.

Distinct timescales of population coding across cortex.

Science.gov (United States)

Runyan, Caroline A; Piasini, Eugenio; Panzeri, Stefano; Harvey, Christopher D

2017-08-03

The cortex represents information across widely varying timescales. For instance, sensory cortex encodes stimuli that fluctuate over few tens of milliseconds, whereas in association cortex behavioural choices can require the maintenance of information over seconds. However, it remains poorly understood whether diverse timescales result mostly from features intrinsic to individual neurons or from neuronal population activity. This question remains unanswered, because the timescales of coding in populations of neurons have not been studied extensively, and population codes have not been compared systematically across cortical regions. Here we show that population codes can be essential to achieve long coding timescales. Furthermore, we find that the properties of population codes differ between sensory and association cortices. We compared coding for sensory stimuli and behavioural choices in auditory cortex and posterior parietal cortex as mice performed a sound localization task. Auditory stimulus information was stronger in auditory cortex than in posterior parietal cortex, and both regions contained choice information. Although auditory cortex and posterior parietal cortex coded information by tiling in time neurons that were transiently informative for approximately 200 milliseconds, the areas had major differences in functional coupling between neurons, measured as activity correlations that could not be explained by task events. Coupling among posterior parietal cortex neurons was strong and extended over long time lags, whereas coupling among auditory cortex neurons was weak and short-lived. Stronger coupling in posterior parietal cortex led to a population code with long timescales and a representation of choice that remained consistent for approximately 1 second. In contrast, auditory cortex had a code with rapid fluctuations in stimulus and choice information over hundreds of milliseconds. Our results reveal that population codes differ across cortex

Applications of American design codes for elevated temperature environment

International Nuclear Information System (INIS)

Severud, L.K.

1980-03-01

A brief summary of the ASME Code rules of Case N-47 is presented. An overview of the typical procedure used to demonstrate Code compliance is provided. Application experience and some examples of detailed inelastic analysis and simplified-approximate methods are given. Recent developments and future trends in design criteria and ASME Code rules are also presented

SWAT3.1 - the integrated burnup code system driving continuous energy Monte Carlo codes MVP and MCNP

International Nuclear Information System (INIS)

Suyama, Kenya; Mochizuki, Hiroki; Takada, Tomoyuki; Ryufuku, Susumu; Okuno, Hiroshi; Murazaki, Minoru; Ohkubo, Kiyoshi

2009-05-01

Integrated burnup calculation code system SWAT is a system that combines neutronics calculation code SRAC,which is widely used in Japan, and point burnup calculation code ORIGEN2. It has been used to evaluate the composition of the uranium, plutonium, minor actinides and the fission products in the spent nuclear fuel. Based on this idea, the integrated burnup calculation code system SWAT3.1 was developed by combining the continuous energy Monte Carlo code MVP and MCNP, and ORIGEN2. This enables us to treat the arbitrary fuel geometry and to generate the effective cross section data to be used in the burnup calculation with few approximations. This report describes the outline, input data instruction and several examples of the calculation. (author)

Electro-magnetic cascade calculation using EGS4 code

International Nuclear Information System (INIS)

Namito, Yoshihito; Hirayama, Hideo

2001-01-01

The outline of the general-purpose electron-photon transport code EGS4 (Electron-Gamma-Shower Version 4) is described. In section 1, the history of the electron photon Monte Carlo transport code toward EGS4 is described. In section 2, the features of the EGS4 and the physical processes treated, cross section preparation and language is explained. The upper energy limit of EGS4 is a few thousand GeV. The lower energy limit of EGS4 is 1 keV and 10 keV for photon and electron, respectively. In section 3, particle transport method in EGS4 code is discussed. The points are; condensed history method, continuous slowing down approximation and multiple scattering approximation. Order of the particle transport calculation is also mentioned. The switches to control scoring routine AUSGAB is listed. In section 4, the output from the code is described. In section 5, several benchmark calculations are described. (author)

Optical image encryption based on real-valued coding and subtracting with the help of QR code

Science.gov (United States)

Deng, Xiaopeng

2015-08-01

A novel optical image encryption based on real-valued coding and subtracting is proposed with the help of quick response (QR) code. In the encryption process, the original image to be encoded is firstly transformed into the corresponding QR code, and then the corresponding QR code is encoded into two phase-only masks (POMs) by using basic vector operations. Finally, the absolute values of the real or imaginary parts of the two POMs are chosen as the ciphertexts. In decryption process, the QR code can be approximately restored by recording the intensity of the subtraction between the ciphertexts, and hence the original image can be retrieved without any quality loss by scanning the restored QR code with a smartphone. Simulation results and actual smartphone collected results show that the method is feasible and has strong tolerance to noise, phase difference and ratio between intensities of the two decryption light beams.

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

Intrabeam Scattering Studies for the ILC Damping Rings Using a NewMATLAB Code

Energy Technology Data Exchange (ETDEWEB)

Reichel, I.; Wolski, A.

2006-06-21

A new code to calculate the effects of intrabeam scattering (IBS) has been developed in MATLAB based on the approximation suggested by K. Bane. It interfaces with the Accelerator Toolbox but can also read in lattice functions from other codes. The code has been benchmarked against results from other codes for the ATF that use this approximation or do the calculation in a different way. The new code has been used to calculate the emittance growth due to intrabeam scattering for the lattices currently proposed for the ILC Damping Rings, as IBS is a concern, especially for the electron ring. A description of the code and its user interface, as well as results for the Damping Rings, will be presented.

Intrabeam Scattering Studies for the ILC Damping Rings Using a New MATLAB Code

International Nuclear Information System (INIS)

Reichel, I.; Wolski, A.

2006-01-01

A new code to calculate the effects of intrabeam scattering (IBS) has been developed in MATLAB based on the approximation suggested by K. Bane. It interfaces with the Accelerator Toolbox but can also read in lattice functions from other codes. The code has been benchmarked against results from other codes for the ATF that use this approximation or do the calculation in a different way. The new code has been used to calculate the emittance growth due to intrabeam scattering for the lattices currently proposed for the ILC Damping Rings, as IBS is a concern, especially for the electron ring. A description of the code and its user interface, as well as results for the Damping Rings, will be presented

Diffusion approximation for modeling of 3-D radiation distributions

International Nuclear Information System (INIS)

Zardecki, A.; Gerstl, S.A.W.; De Kinder, R.E. Jr.

1985-01-01

A three-dimensional transport code DIF3D, based on the diffusion approximation, is used to model the spatial distribution of radiation energy arising from volumetric isotropic sources. Future work will be concerned with the determination of irradiances and modeling of realistic scenarios, relevant to the battlefield conditions. 8 refs., 4 figs

Users' guide to CACECO containment analysis code. [LMFBR

Energy Technology Data Exchange (ETDEWEB)

Peak, R.D.

1979-06-01

The CACECO containment analysis code was developed to predict the thermodynamic responses of LMFBR containment facilities to a variety of accidents. The code is included in the National Energy Software Center Library at Argonne National Laboratory as Program No. 762. This users' guide describes the CACECO code and its data input requirements. The code description covers the many mathematical models used and the approximations used in their solution. The descriptions are detailed to the extent that the user can modify the code to suit his unique needs, and, indeed, the reader is urged to consider code modification acceptable.

Binary codes with impulse autocorrelation functions for dynamic experiments

International Nuclear Information System (INIS)

Corran, E.R.; Cummins, J.D.

1962-09-01

A series of binary codes exist which have autocorrelation functions approximating to an impulse function. Signals whose behaviour in time can be expressed by such codes have spectra which are 'whiter' over a limited bandwidth and for a finite time than signals from a white noise generator. These codes are used to determine system dynamic responses using the correlation technique. Programmes have been written to compute codes of arbitrary length and to compute 'cyclic' autocorrelation and cross-correlation functions. Complete listings of these programmes are given, and a code of 1019 bits is presented. (author)

Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes

DEFF Research Database (Denmark)

Justesen, Jørn; Høholdt, Tom

2007-01-01

Products of Reed-Solomon codes are important in applications because they offer a combination of large blocks, low decoding complexity, and good performance. A recent result on random graphs can be used to show that with high probability a large number of errors can be corrected by iterating...... minimum distance decoding. We present an analysis related to density evolution which gives the exact asymptotic value of the decoding threshold and also provides a closed form approximation to the distribution of errors in each step of the decoding of finite length codes....

Development of improved methods for the LWR lattice physics code EPRI-CELL

International Nuclear Information System (INIS)

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

1982-07-01

A number of improvements have been made by ORNL to the lattice physics code EPRI-CELL (E-C) which is widely used by utilities for analysis of power reactors. The code modifications were made mainly in the thermal and epithermal routines and resulted in improved reactor physics approximations and more efficient running times. The improvements in the thermal flux calculation included implementation of a group-dependent rebalance procedure to accelerate the iterative process and a more rigorous calculation of interval-to-interval collision probabilities. The epithermal resonance shielding methods used in the code have been extensively studied to determine its major approximations and to examine the sensitivity of computed results to these approximations. The study has resulted in several improvements in the original methodology

Towards Holography via Quantum Source-Channel Codes

Science.gov (United States)

Pastawski, Fernando; Eisert, Jens; Wilming, Henrik

2017-07-01

While originally motivated by quantum computation, quantum error correction (QEC) is currently providing valuable insights into many-body quantum physics, such as topological phases of matter. Furthermore, mounting evidence originating from holography research (AdS/CFT) indicates that QEC should also be pertinent for conformal field theories. With this motivation in mind, we introduce quantum source-channel codes, which combine features of lossy compression and approximate quantum error correction, both of which are predicted in holography. Through a recent construction for approximate recovery maps, we derive guarantees on its erasure decoding performance from calculations of an entropic quantity called conditional mutual information. As an example, we consider Gibbs states of the transverse field Ising model at criticality and provide evidence that they exhibit nontrivial protection from local erasure. This gives rise to the first concrete interpretation of a bona fide conformal field theory as a quantum error correcting code. We argue that quantum source-channel codes are of independent interest beyond holography.

Towers of generalized divisible quantum codes

Science.gov (United States)

Haah, Jeongwan

2018-04-01

A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is 2ν for a positive integer ν , then one can construct a Calderbank-Shor-Steane (CSS) code, where X -stabilizer space is the divisible classical code, that admits a transversal gate in the ν th level of Clifford hierarchy. We consider a generalization of the divisibility by allowing a coefficient vector of odd integers with which every code word has zero dot product modulo the divisor. In this generalized sense, we construct a CSS code with divisor 2ν +1 and code distance d from any CSS code of code distance d and divisor 2ν where the transversal X is a nontrivial logical operator. The encoding rate of the new code is approximately d times smaller than that of the old code. In particular, for large d and ν ≥2 , our construction yields a CSS code of parameters [[O (dν -1) ,Ω (d ) ,d ] ] admitting a transversal gate at the ν th level of Clifford hierarchy. For our construction we introduce a conversion from magic state distillation protocols based on Clifford measurements to those based on codes with transversal T gates. Our tower contains, as a subclass, generalized triply even CSS codes that have appeared in so-called gauge fixing or code switching methods.

Development of multi-group spectral code TVS-M

International Nuclear Information System (INIS)

Lazarenko, A. P.; Pryanichnikov, A. V.; Kalugin, M. A.; Gurevich, M. I.

2011-01-01

This paper is dedicated to the latest version of TVS-M code - TVS-M 2007, which allows the neutron flux distribution inside fuel assemblies to be calculated without using the diffusion approximation. The new spatial calculation module PERST introduced in TBS-M code is based on the first collisions probability method and allows the scattering anisotropy to be accounted for. This paper presents some preliminary results calculated with the use of the new version of TVS-M code. (Authors)

Classification of multispectral or hyperspectral satellite imagery using clustering of sparse approximations on sparse representations in learned dictionaries obtained using efficient convolutional sparse coding

Science.gov (United States)

Moody, Daniela; Wohlberg, Brendt

2018-01-02

An approach for land cover classification, seasonal and yearly change detection and monitoring, and identification of changes in man-made features may use a clustering of sparse approximations (CoSA) on sparse representations in learned dictionaries. The learned dictionaries may be derived using efficient convolutional sparse coding to build multispectral or hyperspectral, multiresolution dictionaries that are adapted to regional satellite image data. Sparse image representations of images over the learned dictionaries may be used to perform unsupervised k-means clustering into land cover categories. The clustering process behaves as a classifier in detecting real variability. This approach may combine spectral and spatial textural characteristics to detect geologic, vegetative, hydrologic, and man-made features, as well as changes in these features over time.

Efficient DS-UWB MUD Algorithm Using Code Mapping and RVM

Directory of Open Access Journals (Sweden)

Pingyan Shi

2016-01-01

Full Text Available A hybrid multiuser detection (MUD using code mapping and a wrong code recognition based on relevance vector machine (RVM for direct sequence ultra wide band (DS-UWB system is developed to cope with the multiple access interference (MAI and the computational efficiency. A new MAI suppression mechanism is studied in the following steps: firstly, code mapping, an optimal decision function, is constructed and the output candidate code of the matched filter is mapped to a feature space by the function. In the feature space, simulation results show that the error codes caused by MAI and the single user mapped codes can be classified by a threshold which is related to SNR of the receiver. Then, on the base of code mapping, use RVM to distinguish the wrong codes from the right ones and finally correct them. Compared with the traditional MUD approaches, the proposed method can considerably improve the bit error ratio (BER performance due to its special MAI suppression mechanism. Simulation results also show that the proposed method can approximately achieve the BER performance of optimal multiuser detection (OMD and the computational complexity approximately equals the matched filter. Moreover, the proposed method is less sensitive to the number of users.

A comparison of two nodal codes : Advanced nodal code (ANC) and analytic function expansion nodal (AFEN) code

International Nuclear Information System (INIS)

Chung, S.K.; Hah, C.J.; Lee, H.C.; Kim, Y.H.; Cho, N.Z.

1996-01-01

Modern nodal methods usually employs the transverse integration technique in order to reduce a multi-dimensional diffusion equation to one-dimensional diffusion equations. The use of the transverse integration technique requires two major approximations such as a transverse leakage approximation and a one-dimensional flux approximation. Both the transverse leakage and the one-dimensional flux are approximated by polynomials. ANC (Advanced Nodal Code) developed by Westinghouse employs a modern nodal expansion method for the flux calculation, the equivalence theory for the homogenization error reduction and a group theory for pin power recovery. Unlike the conventional modern nodal methods, AFEN (Analytic Function Expansion Nodal) method expands homogeneous flux distributions within a node into non-separable analytic basis functions, which eliminate two major approximations of the modern nodal methods. A comparison study of AFEN with ANC has been performed to see the applicability of AFEN to commercial PWR and different types of reactors such as MOX fueled reactor. The qualification comparison results demonstrate that AFEN methodology is accurate enough to apply for commercial PWR analysis. The results show that AFEN provides very accurate results (core multiplication factor and assembly power distribution) for cores that exhibit strong flux gradients as in a MOX loaded core. (author)

State of art in FE-based fuel performance codes

International Nuclear Information System (INIS)

Kim, Hyo Chan; Yang, Yong Sik; Kim, Dae Ho; Bang, Je Geon; Kim, Sun Ki; Koo, Yang Hyun

2013-01-01

Fuel performance codes approximate this complex behavior using an axisymmetric, axially-stacked, one-dimensional radial representation to save computation cost. However, the need for improved modeling of PCMI and, particularly, the importance of multidimensional capability for accurate fuel performance simulation has been identified as safety margin decreases. Finite element (FE) method that is reliable and proven solution in mechanical field has been introduced into fuel performance codes for multidimensional analysis. The present state of the art in numerical simulation of FE-based fuel performance predominantly involves 2-D axisymmetric model and 3-D volumetric model. The FRAPCON and FRAPTRAN own 1.5-D and 2-D FE model to simulate PCMI and cladding ballooning. In 2-D simulation, the FALCON code, developed by EPRI, is a 2-D (R-Z and R-θ) fully thermal-mechanically coupled steady-state and transient FE-based fuel behavior code. The French codes TOUTATIS and ALCYONE which are 3-D, and typically used to investigate localized behavior. In 2008, the Idaho National Laboratory (INL) has been developing multidimensional (2-D and 3-D) nuclear fuel performance code called BISON. In this paper, the current state of FE-based fuel performance code and their models are presented. Based on investigation into the codes, requirements and direction of development for new FE-based fuel performance code can be discussed. Based on comparison of models in FE-based fuel performance code, status of art in the codes can be discussed. A new FE-based fuel performance code should include typical pellet and cladding models which all codes own. In particular, specified pellet and cladding model such as gaseous swelling and high burnup structure (HBS) model should be developed to improve accuracy of code as well as consider AC condition. To reduce computation cost, the approximated gap and the optimized contact model should be also developed

Turbo Equalization Using Partial Gaussian Approximation

DEFF Research Database (Denmark)

Zhang, Chuanzong; Wang, Zhongyong; Manchón, Carles Navarro

2016-01-01

This letter deals with turbo equalization for coded data transmission over intersymbol interference (ISI) channels. We propose a message-passing algorithm that uses the expectation propagation rule to convert messages passed from the demodulator and decoder to the equalizer and computes messages...... returned by the equalizer by using a partial Gaussian approximation (PGA). We exploit the specific structure of the ISI channel model to compute the latter messages from the beliefs obtained using a Kalman smoother/equalizer. Doing so leads to a significant complexity reduction compared to the initial PGA...

SAMPO: a code system giving different orders of approximation for sensitivity and perturbation analysis

International Nuclear Information System (INIS)

Estiot, J.C.; Salvatores, M.; Palmiotti, G.

1981-01-01

We present the characteristics of SAMPO, a one dimension transport theory code system, which is used for the following types of calculation: sensitivity analysis for functional linear or bi-linear on the direct or adjoint flux and their ratios; classic perturbation analysis. First order calculations, as well higher order, can be presented

Multidimensional method of spatially coupled approximation to the transverse escape in nodal codes

International Nuclear Information System (INIS)

Jatuff, F.E.

1990-01-01

A natural extension of the polynomic development programmed in RHENO code is presented, which adds to the variable order one-dimensional functions sum, a number of terms that represent functions of production. These new terms, which provide a direct determination of transverse escapes, are calculated from the new variables coupling among nodes: the 4 fluxes in rectangle vortices (bidimensional Cartesian geometry) or the 12 fluxes half-way through the parallelepiped edges (tridimensional Cartesian geometry). (Author) [es

Uncertainties associated with the use of the KENO Monte Carlo criticality codes

International Nuclear Information System (INIS)

Landers, N.F.; Petrie, L.M.

1989-01-01

The KENO multi-group Monte Carlo criticality codes have earned the reputation of being efficient, user friendly tools especially suited for the analysis of situations commonly encountered in the storage and transportation of fissile materials. Throughout their twenty years of service, a continuing effort has been made to maintain and improve these codes to meet the needs of the nuclear criticality safety community. Foremost among these needs is the knowledge of how to utilize the results safely and effectively. Therefore it is important that code users be aware of uncertainties that may affect their results. These uncertainties originate from approximations in the problem data, methods used to process cross sections, and assumptions, limitations and approximations within the criticality computer code itself. 6 refs., 8 figs., 1 tab

Diophantine approximation and badly approximable sets

DEFF Research Database (Denmark)

Kristensen, S.; Thorn, R.; Velani, S.

2006-01-01

. The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...

Determination of a Two Variable Approximation Function with Application to the Fuel Combustion Charts

Directory of Open Access Journals (Sweden)

Irina-Carmen ANDREI

2017-09-01

Full Text Available Following the demands of the design and performance analysis in case of liquid fuel propelled rocket engines, as well as the trajectory optimization, the development of efficient codes, which frequently need to call the Fuel Combustion Charts, became an important matter. This paper presents an efficient solution to the issue; the author has developed an original approach to determine the non-linear approximation function of two variables: the chamber pressure and the nozzle exit pressure ratio. The numerical algorithm based on this two variable approximation function is more efficient due to its simplicity, capability to providing numerical accuracy and prospects for an increased convergence rate of the optimization codes.

Approximating tunneling rates in multi-dimensional field spaces

Energy Technology Data Exchange (ETDEWEB)

Masoumi, Ali; Olum, Ken D.; Wachter, Jeremy M., E-mail: ali@cosmos.phy.tufts.edu, E-mail: kdo@cosmos.phy.tufts.edu, E-mail: Jeremy.Wachter@tufts.edu [Institute of Cosmology, Department of Physics and Astronomy, Tufts University, Medford, MA 02155 (United States)

2017-10-01

Quantum mechanics makes the otherwise stable vacua of a theory metastable through the nucleation of bubbles of the new vacuum. This in turn causes a first order phase transition. These cosmological phase transitions may have played an important role in settling our universe into its current vacuum, and they may also happen in future. The most important frameworks where vacuum decay happens contain a large number of fields. Unfortunately, calculating the tunneling rates in these models is very time-consuming. In this paper we present a simple approximation for the tunneling rate by reducing it to a one-field problem which is easy to calculate. We demonstrate the validity of this approximation using our recent code 'Anybubble' for several classes of potentials.

Present status on numerical algorithms and benchmark tests for point kinetics and quasi-static approximate kinetics

International Nuclear Information System (INIS)

Ise, Takeharu

1976-12-01

Review studies have been made on algorithms of numerical analysis and benchmark tests on point kinetics and quasistatic approximate kinetics computer codes to perform efficiently benchmark tests on space-dependent neutron kinetics codes. Point kinetics methods have now been improved since they can be directly applied to the factorization procedures. Methods based on Pade rational function give numerically stable solutions and methods on matrix-splitting are interested in the fact that they are applicable to the direct integration methods. An improved quasistatic (IQ) approximation is the best and the most practical method; it is numerically shown that the IQ method has a high stability and precision and the computation time which is about one tenth of that of the direct method. IQ method is applicable to thermal reactors as well as fast reactors and especially fitted for fast reactors to which many time steps are necessary. Two-dimensional diffusion kinetics codes are most practicable though there exist also three-dimensional diffusion kinetics code as well as two-dimensional transport kinetics code. On developing a space-dependent kinetics code, in any case, it is desirable to improve the method so as to have a high computing speed for solving static diffusion and transport equations. (auth.)

Analysis of Coded FHSS Systems with Multiple Access Interference over Generalized Fading Channels

Directory of Open Access Journals (Sweden)

Salam A. Zummo

2009-02-01

Full Text Available We study the effect of interference on the performance of coded FHSS systems. This is achieved by modeling the physical channel in these systems as a block fading channel. In the derivation of the bit error probability over Nakagami fading channels, we use the exact statistics of the multiple access interference (MAI in FHSS systems. Due to the mathematically intractable expression of the Rician distribution, we use the Gaussian approximation to derive the error probability of coded FHSS over Rician fading channel. The effect of pilot-aided channel estimation is studied for Rician fading channels using the Gaussian approximation. From this, the optimal hopping rate in coded FHSS is approximated. Results show that the performance loss due to interference increases as the hopping rate decreases.

A search for symmetries in the genetic code

International Nuclear Information System (INIS)

Hornos, J.E.M.; Hornos, Y.M.M.

1991-01-01

A search for symmetries based on the classification theorem of Cartan for the compact simple Lie algebras is performed to verify to what extent the genetic code is a manifestation of some underlying symmetry. An exact continuous symmetry group cannot be found to reproduce the present, universal code. However a unique approximate symmetry group is compatible with codon assignment for the fundamental amino acids and the termination codon. In order to obtain the actual genetic code, the symmetry must be slightly broken. (author). 27 refs, 3 figs, 6 tabs

SPORTS - a simple non-linear thermalhydraulic stability code

International Nuclear Information System (INIS)

Chatoorgoon, V.

1986-01-01

A simple code, called SPORTS, has been developed for two-phase stability studies. A novel method of solution of the finite difference equations was deviced and incorporated, and many of the approximations that are common in other stability codes are avoided. SPORTS is believed to be accurate and efficient, as small and large time-steps are permitted, and hence suitable for micro-computers. (orig.)

The ASME Code today -- Challenges, threats, opportunities

International Nuclear Information System (INIS)

Canonico, D.A.

1995-01-01

Since its modest beginning as a single volume in 1914 the ASME Code, or some of its parts, is recognized today in 48 of the United States and all providence's of Canada. The ASME Code today is composed of 25 books including two Code Case books. These books cover the new construction of boilers and pressure vessels and the new construction and In-Service-Inspection of Nuclear Power Plant components. The ASME accredits all manufacturers of boilers and pressure vessels built to the ASME Code. There are approximately 7650 symbol stamps issued throughout the world. Over 23% of the symbol stamps have been issued outside the USA and Canada. The challenge to the ASME Code is to be accepted as the world standard for pressure boundary components. There are activities underway to achieve that goal. The ASME Code is being revised to make it a more friendly document to entities outside of North America. To achieve that end there are specific tasks underway which are described here

Fast decoding algorithms for geometric coded apertures

International Nuclear Information System (INIS)

Byard, Kevin

2015-01-01

Fast decoding algorithms are described for the class of coded aperture designs known as geometric coded apertures which were introduced by Gourlay and Stephen. When compared to the direct decoding method, the algorithms significantly reduce the number of calculations required when performing the decoding for these apertures and hence speed up the decoding process. Experimental tests confirm the efficacy of these fast algorithms, demonstrating a speed up of approximately two to three orders of magnitude over direct decoding.

Plasma Physics Approximations in Ares

International Nuclear Information System (INIS)

Managan, R. A.

2015-01-01

Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, Fn( μ/θ ), the chemical potential, μ or ζ = ln(1+e μ/θ ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A α (ζ ),A β (ζ ), ζ, f(ζ ) = (1 + e -μ/θ )F 1/2 (μ/θ), F 1/2 '/F 1/2 , F c α , and F c β . In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.

Assessment of the IVA3 code for multifield flow simulation. Formal report

Energy Technology Data Exchange (ETDEWEB)

Stewart, H.B.

1995-07-01

This report presents an assessment of the IVA3 computer code for multifield flow simulation, as applied to the premixing phase of a hypothetical steam explosion in a water-cooled power reactor. The first section of this report reviews the derivation of the basic partial differential equations of multifield modeling, with reference to standard practices in the multiphase flow literature. Basic underlying assumptions and approximations are highlighted, and comparison is made between IVA3 and other codes in current use. Although Kolev`s derivation of these equations is outside the mainstream of the multiphase literature, the basic partial differential equations are in fact nearly equivalent to those in other codes. In the second section, the assumptions and approximations required to pass from generic differential equations to a specific working form are detailed. Some modest improvements to the IVA3 model are suggested. In Section 3, the finite difference approximations to the differential equations are described. The discretization strategy is discussed with reference to numerical stability, accuracy, and the role of various physical phenomena - material convection, sonic propagation, viscous stress, and interfacial exchanges - in the choice of discrete approximations. There is also cause for concern about the approximations of time evolution in some heat transfer terms, which might be adversely affecting numerical accuracy. The fourth section documents the numerical solution method used in IVA3. An explanation for erratic behavior sometimes observed in the first outer iteration is suggested, along with possible remedies. Finally, six recommendations for future assessment and improvement of the IVA3 model and code are made.

The single-collision thermalization approximation for application to cold neutron moderation problems

International Nuclear Information System (INIS)

Ritenour, R.L.

1989-01-01

The single collision thermalization (SCT) approximation models the thermalization process by assuming that neutrons attain a thermalized distribution with only a single collision within the moderating material, independent of the neutron's incident energy. The physical intuition on which this approximation is based is that the salient properties of neutron thermalization are accounted for in the first collision, and the effects of subsequent collisions tend to average out statistically. The independence of the neutron incident and outscattering energy leads to variable separability in the scattering kernel and, thus, significant simplification of the neutron thermalization problem. The approximation also addresses detailed balance and neutron conservation concerns. All of the tests performed on the SCT approximation yielded excellent results. The significance of the SCT approximation is that it greatly simplifies thermalization calculations for CNS design. Preliminary investigations with cases involving strong absorbers also indicates that this approximation may have broader applicability, as in the upgrading of the thermalization codes

Spike Code Flow in Cultured Neuronal Networks.

Science.gov (United States)

Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime; Kamimura, Takuya; Yagi, Yasushi; Mizuno-Matsumoto, Yuko; Chen, Yen-Wei

2016-01-01

We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of "1101" and "1011," which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the "maximum cross-correlations" among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

Approximated neutronic calculation for the tritium breeding ratio in fusion reactor blankets

International Nuclear Information System (INIS)

Santos, Raul dos

1983-01-01

An approximated model for the calculation of the tritium breeding ratio in conceptual thermonuclear fusion reactor blankets is presented. This model makes use of the exponential absorption concept due to the Li 6 (n, He 4 )T and Li 7 (n, n'He 4 )T reactions. The results of this approximated method are compared with reference benchmarks which were generated by the nuclear codes ANISN (discrete ordinates) and MORSE (Monte Carlo method). The maximum deviation among the results have been around 10%. (Author) [pt

Quantitative accuracy assessment of thermalhydraulic code predictions with SARBM

International Nuclear Information System (INIS)

Prosek, A.

2001-01-01

In recent years, the nuclear reactor industry has focused significant attention on nuclear reactor systems code accuracy and uncertainty issues. A few methods suitable to quantify code accuracy of thermalhydraulic code calculations were proposed and applied in the past. In this study a Stochastic Approximation Ratio Based Method (SARBM) was adapted and proposed for accuracy quantification. The objective of the study was to qualify the SARBM. The study compare the accuracy obtained by SARBM with the results obtained by widely used Fast Fourier Transform Based Method (FFTBM). The methods were applied to RELAP5/MOD3.2 code calculations of various BETHSY experiments. The obtained results showed that the SARBM was able to satisfactorily predict the accuracy of the calculated trends when visually comparing plots and comparing the results with the qualified FFTBM. The analysis also showed that the new figure-of-merit called accuracy factor (AF) is more convenient than stochastic approximation ratio for combining single variable accuracy's into total accuracy. The accuracy results obtained for the selected tests suggest that the acceptability factors for the SAR method were reasonably defined. The results also indicate that AF is a useful quantitative measure of accuracy.(author)

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.

The generalized gradient approximation in solids and molecules

International Nuclear Information System (INIS)

Haas, P.

2010-01-01

Today, most methods are based on theoretical calculations of the electronic structure of molecules, surfaces and solids on density functional theory (DFT) and the resulting Kohn-Sham equations. Unfortunately, the exact analytical expression for the exchange-correlation functional is not known and has to be approximated. The reliability of such a Kohn-Sham calculation depends i) from the numerical accuracy and ii) from the used approximation for the exchange-correlation energy. To solve the Kohn-Sham equations, the WIEN2k code, which is one of the most accurate methods for solid-state calculations, is used. The search for better approximations for the exchange-correlation energy is an intense field of research in chemistry and physics. The main objectives of the dissertation is the development, implementation and testing of advanced exchange-correlation functionals and the analysis of existing functionals. The focus of this work are GGA - functionals. Such GGA functionals are still the most widely used functionals, in particular because they are easy to implement and require little computational effort. Several recent studies have shown that an improvement of the GGA should be possible. A detailed analysis of the results will allow us to understand why a particular GGA approximation for a class of elements (compounds) works better than for another. (Kancsar) [de

Recent advances in neutral particle transport methods and codes

International Nuclear Information System (INIS)

Azmy, Y.Y.

1996-01-01

An overview of ORNL's three-dimensional neutral particle transport code, TORT, is presented. Special features of the code that make it invaluable for large applications are summarized for the prospective user. Advanced capabilities currently under development and installation in the production release of TORT are discussed; they include: multitasking on Cray platforms running the UNICOS operating system; Adjacent cell Preconditioning acceleration scheme; and graphics codes for displaying computed quantities such as the flux. Further developments for TORT and its companion codes to enhance its present capabilities, as well as expand its range of applications are disucssed. Speculation on the next generation of neutron particle transport codes at ORNL, especially regarding unstructured grids and high order spatial approximations, are also mentioned

Comparison of calculations of a reflected reactor with diffusion, SN and Monte Carlo codes

International Nuclear Information System (INIS)

McGregor, B.

1975-01-01

A diffusion theory code, POW, was compared with a Monte Carlo transport theory code, KENO, for the calculation of a small C/ 235 U cylindrical core with a graphite reflector. The calculated multiplication factors were in good agreement but differences were noted in region-averaged group fluxes. A one-dimensional spherical geometry was devised to approximate cylindrical geometry. Differences similar to those already observed were noted when the region-averaged fluxes from a diffusion theory (POW) calculation were compared with an SN transport theory (ANAUSN) calculation for the spherical model. Calculations made with SN and Monte Carlo transport codes were in good agreement. It was concluded that observed flux differences were attributable to the POW code, and were not inconsistent with inherent diffusion theory approximations. (author)

SPQR: a Monte Carlo reactor kinetics code

International Nuclear Information System (INIS)

Cramer, S.N.; Dodds, H.L.

1980-02-01

The SPQR Monte Carlo code has been developed to analyze fast reactor core accident problems where conventional methods are considered inadequate. The code is based on the adiabatic approximation of the quasi-static method. This initial version contains no automatic material motion or feedback. An existing Monte Carlo code is used to calculate the shape functions and the integral quantities needed in the kinetics module. Several sample problems have been devised and analyzed. Due to the large statistical uncertainty associated with the calculation of reactivity in accident simulations, the results, especially at later times, differ greatly from deterministic methods. It was also found that in large uncoupled systems, the Monte Carlo method has difficulty in handling asymmetric perturbations

CINETHICA - Core accident analysis code

International Nuclear Information System (INIS)

Nakata, H.

1989-10-01

A computer program for nuclear accident analysis has been developed based on the point-kinetics approximation and one-dimensional heat transfer model for reactivity feedback calculation. Hansen's method/1/ were used for the kinetics equation solution and explicit Euler method were adopted for the thermohidraulic equations. The results were favorably compared to those from the GAPOTKIN Code/2/. (author) [pt

Comparison of beam deposition for three neutral beam injection codes

International Nuclear Information System (INIS)

Wieland, R.M.; Houlberg, W.A.; Mense, A.T.

1979-03-01

The three neutral beam injection codes BEAM (Houlberg, ORNL), HOFR (Howe, ORNL), and FREYA (Post, PPPL) are compared with respect to the calculation of the fast ion deposition profile H(r). Only plasmas of circular cross section are considered, with injection confined to the mid-plane of the torus. The approximations inherent in each code are pointed out, and a series of comparisons varying several parameters (beam energy and radius, machine size, and injection angle) shows excellent agreement among all the codes. A cost comparison (execution time and memory requirements) is made which points out the relative merits of each code within the context of incorporation into a plasma transport simulation code

Spike Code Flow in Cultured Neuronal Networks

Directory of Open Access Journals (Sweden)

Shinichi Tamura

2016-01-01

Full Text Available We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of “1101” and “1011,” which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the “maximum cross-correlations” among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

Computing travel time when the exact address is unknown: a comparison of point and polygon ZIP code approximation methods.

Science.gov (United States)

Berke, Ethan M; Shi, Xun

2009-04-29

Travel time is an important metric of geographic access to health care. We compared strategies of estimating travel times when only subject ZIP code data were available. Using simulated data from New Hampshire and Arizona, we estimated travel times to nearest cancer centers by using: 1) geometric centroid of ZIP code polygons as origins, 2) population centroids as origin, 3) service area rings around each cancer center, assigning subjects to rings by assuming they are evenly distributed within their ZIP code, 4) service area rings around each center, assuming the subjects follow the population distribution within the ZIP code. We used travel times based on street addresses as true values to validate estimates. Population-based methods have smaller errors than geometry-based methods. Within categories (geometry or population), centroid and service area methods have similar errors. Errors are smaller in urban areas than in rural areas. Population-based methods are superior to the geometry-based methods, with the population centroid method appearing to be the best choice for estimating travel time. Estimates in rural areas are less reliable.

RF cavity evaluation with the code SUPERFISH

International Nuclear Information System (INIS)

Hori, T.; Nakanishi, T.; Ueda, N.

1982-01-01

The computer code SUPERFISH calculates axisymmetric rf fields and is most applicable to re-entrant cavities of an Alvarez linac. Some sample results are shown for the first Alvarez's in NUMATRON project. On the other hand the code can also be effectivily applied to TE modes excited in an RFQ linac when the cavity is approximately considered as positioning at an infinite distance from the symmetry axis. The evaluation was made for several RFQ cavities, models I, II and a test linac named LITL, and useful results for the resonator design were obtained. (author)

2-Step scalar deadzone quantization for bitplane image coding.

Science.gov (United States)

Auli-Llinas, Francesc

2013-12-01

Modern lossy image coding systems generate a quality progressive codestream that, truncated at increasing rates, produces an image with decreasing distortion. Quality progressivity is commonly provided by an embedded quantizer that employs uniform scalar deadzone quantization (USDQ) together with a bitplane coding strategy. This paper introduces a 2-step scalar deadzone quantization (2SDQ) scheme that achieves same coding performance as that of USDQ while reducing the coding passes and the emitted symbols of the bitplane coding engine. This serves to reduce the computational costs of the codec and/or to code high dynamic range images. The main insights behind 2SDQ are the use of two quantization step sizes that approximate wavelet coefficients with more or less precision depending on their density, and a rate-distortion optimization technique that adjusts the distortion decreases produced when coding 2SDQ indexes. The integration of 2SDQ in current codecs is straightforward. The applicability and efficiency of 2SDQ are demonstrated within the framework of JPEG2000.

GAPCON-THERMAL-3 code description

International Nuclear Information System (INIS)

Lanning, D.D.; Mohr, C.L.; Panisko, F.E.; Stewart, K.B.

1978-01-01

GAPCON-3 is a computer program that predicts the thermal and mechanical behavior of an operating fuel rod during its normal lifetime. The code calculates temperatures, dimensions, stresses, and strains for the fuel and the cladding in both the radial and axial directions for each step of the user specified power history. The method of weighted residuals is for the steady state temperature calculation, and is combined with a finite difference approximation of the time derivative for transient conditions. The stress strain analysis employs an iterative axisymmetric finite element procedure that includes plasticity and creep for normal and pellet-clad mechanical interaction loads. GAPCON-3 can solve steady state and operational transient problems. Comparisons of GAPCON-3 predictions to both closed form analytical solutions and actual inpile instrumented fuel rod data have demonstrated the ability of the code to calculate fuel rod behavior. GAPCON-3 features a restart capability and an associated plot package unavailable in previous GAPCON series codes

GAPCON-THERMAL-3 code description

Energy Technology Data Exchange (ETDEWEB)

Lanning, D.D.; Mohr, C.L.; Panisko, F.E.; Stewart, K.B.

1978-01-01

GAPCON-3 is a computer program that predicts the thermal and mechanical behavior of an operating fuel rod during its normal lifetime. The code calculates temperatures, dimensions, stresses, and strains for the fuel and the cladding in both the radial and axial directions for each step of the user specified power history. The method of weighted residuals is for the steady state temperature calculation, and is combined with a finite difference approximation of the time derivative for transient conditions. The stress strain analysis employs an iterative axisymmetric finite element procedure that includes plasticity and creep for normal and pellet-clad mechanical interaction loads. GAPCON-3 can solve steady state and operational transient problems. Comparisons of GAPCON-3 predictions to both closed form analytical solutions and actual inpile instrumented fuel rod data have demonstrated the ability of the code to calculate fuel rod behavior. GAPCON-3 features a restart capability and an associated plot package unavailable in previous GAPCON series codes.

Fast frequency hopping codes applied to SAC optical CDMA network

Science.gov (United States)

Tseng, Shin-Pin

2015-06-01

This study designed a fast frequency hopping (FFH) code family suitable for application in spectral-amplitude-coding (SAC) optical code-division multiple-access (CDMA) networks. The FFH code family can effectively suppress the effects of multiuser interference and had its origin in the frequency hopping code family. Additional codes were developed as secure codewords for enhancing the security of the network. In considering the system cost and flexibility, simple optical encoders/decoders using fiber Bragg gratings (FBGs) and a set of optical securers using two arrayed-waveguide grating (AWG) demultiplexers (DeMUXs) were also constructed. Based on a Gaussian approximation, expressions for evaluating the bit error rate (BER) and spectral efficiency (SE) of SAC optical CDMA networks are presented. The results indicated that the proposed SAC optical CDMA network exhibited favorable performance.

NALAP: an LMFBR system transient code

International Nuclear Information System (INIS)

Martin, B.A.; Agrawal, A.K.; Albright, D.C.; Epel, L.G.; Maise, G.

1975-07-01

NALAP is a LMFBR system transient code. This code, adapted from the light water reactor transient code RELAP 3B, simulates thermal-hydraulic response of sodium cooled fast breeder reactors when subjected to postulated accidents such as a massive pipe break as well as a variety of other upset conditions that do not disrupt the system geometry. Various components of the plant are represented by control volumes. These control volumes are connected by junctions some of which may be leak or fill junctions. The fluid flow equations are modeled as compressible, single-stream flow with momentum flux in one dimension. The transient response is computed by integrating the thermal-hydraulic conservation equations from user-initialized operating conditions by an implicit numerical scheme. Point kinetics approximation is used to represent the time dependent heat generation in the reactor core

Project ''REMAD'', Neutron spectrometry. Code ''SOHO - phase II''. First part ''FORMULATION''

International Nuclear Information System (INIS)

Zaborowski, H.L.

1982-08-01

''SOHO'' is a new neutron spectrometric code with large potential applications besides the BONNER spheres system for which he has been initially developped. This code makes use of a new and original iteractive procedure for the search of approximate solutions from the Fredholm integral Equation of the First kind whose Resolution Function is experimentally and/or mathematically defined (e.g. the Log-Normal Hypothesis for the BONNER Spheres). Upon discretization of the Fredholm integral Equation we get systems of non-exact homogeneous linear equations: Q X = e whose approximate solutions are given when: Q X → 0. We show that the iterative procedure converges absolutely leading to the existence of the approximate solutions, independently of the kind of initialization used. For the applications to health physics of the BONNER sphere ''SOHO'' has been programmed on a HP - 41 CV calculator [fr

Construction of Protograph LDPC Codes with Linear Minimum Distance

Science.gov (United States)

Divsalar, Dariush; Dolinar, Sam; Jones, Christopher

2006-01-01

A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very high-degree node in the base protograph. A family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

State of art in FE-based fuel performance codes

International Nuclear Information System (INIS)

Kim, Hyo Chan; Yang, Yong Sik; Kim, Dae Ho; Bang, Je Geon; Kim, Sun Ki; Koo, Yang Hyun

2013-01-01

Finite element (FE) method that is reliable and proven solution in mechanical field has been introduced into fuel performance codes for multidimensional analysis. The present state of the art in numerical simulation of FE-based fuel performance predominantly involves 2-D axisymmetric model and 3-D volumetric model. The FRAPCON and FRAPTRAN own 1.5-D and 2-D FE model to simulate PCMI and cladding ballooning. In 2-D simulation, the FALCON code, developed by EPRI, is a 2-D (R-Z and R-θ) fully thermal-mechanically coupled steady-state and transient FE-based fuel behavior code. The French codes TOUTATIS and ALCYONE which are 3-D, and typically used to investigate localized behavior. In 2008, the Idaho National Laboratory (INL) has been developing multidimensional (2-D and 3-D) nuclear fuel performance code called BISON. In this paper, the current state of FE-based fuel performance code and their models are presented. Based on investigation into the codes, requirements and direction of development for new FE-based fuel performance code can be discussed. Based on comparison of models in FE-based fuel performance code, status of art in the codes can be discussed. A new FE-based fuel performance code should include typical pellet and cladding models which all codes own. In particular, specified pellet and cladding model such as gaseous swelling and high burnup structure (HBS) model should be developed to improve accuracy of code as well as consider AC condition. To reduce computation cost, the approximated gap and the optimized contact model should be also developed. Nuclear fuel operates in an extreme environment that induces complex multiphysics phenomena, occurring over distances ranging from inter-atomic spacing to meters, and times scales ranging from microseconds to years. This multiphysics behavior is often tightly coupled, a well known example being the thermomechanical behavior. Adding to this complexity, important aspects of fuel behavior are inherently

Adaptive tree multigrids and simplified spherical harmonics approximation in deterministic neutral and charged particle transport

International Nuclear Information System (INIS)

Kotiluoto, P.

2007-05-01

A new deterministic three-dimensional neutral and charged particle transport code, MultiTrans, has been developed. In the novel approach, the adaptive tree multigrid technique is used in conjunction with simplified spherical harmonics approximation of the Boltzmann transport equation. The development of the new radiation transport code started in the framework of the Finnish boron neutron capture therapy (BNCT) project. Since the application of the MultiTrans code to BNCT dose planning problems, the testing and development of the MultiTrans code has continued in conventional radiotherapy and reactor physics applications. In this thesis, an overview of different numerical radiation transport methods is first given. Special features of the simplified spherical harmonics method and the adaptive tree multigrid technique are then reviewed. The usefulness of the new MultiTrans code has been indicated by verifying and validating the code performance for different types of neutral and charged particle transport problems, reported in separate publications. (orig.)

Generic programming for deterministic neutron transport codes

International Nuclear Information System (INIS)

Plagne, L.; Poncot, A.

2005-01-01

This paper discusses the implementation of neutron transport codes via generic programming techniques. Two different Boltzmann equation approximations have been implemented, namely the Sn and SPn methods. This implementation experiment shows that generic programming allows us to improve maintainability and readability of source codes with no performance penalties compared to classical approaches. In the present implementation, matrices and vectors as well as linear algebra algorithms are treated separately from the rest of source code and gathered in a tool library called 'Generic Linear Algebra Solver System' (GLASS). Such a code architecture, based on a linear algebra library, allows us to separate the three different scientific fields involved in transport codes design: numerical analysis, reactor physics and computer science. Our library handles matrices with optional storage policies and thus applies both to Sn code, where the matrix elements are computed on the fly, and to SPn code where stored matrices are used. Thus, using GLASS allows us to share a large fraction of source code between Sn and SPn implementations. Moreover, the GLASS high level of abstraction allows the writing of numerical algorithms in a form which is very close to their textbook descriptions. Hence the GLASS algorithms collection, disconnected from computer science considerations (e.g. storage policy), is very easy to read, to maintain and to extend. (authors)

The DarkStars code: a publicly available dark stellar evolution package

CERN Document Server

Scott, Pat; Fairbairn, Malcolm

2009-01-01

We announce the public release of the 'dark' stellar evolution code DarkStars. The code simultaneously solves the equations of WIMP capture and annihilation in a star with those of stellar evolution assuming approximate hydrostatic equilibrium. DarkStars includes the most extensive WIMP microphysics of any dark evolution code to date. The code employs detailed treatments of the capture process from a range of WIMP velocity distributions, as well as composite WIMP distribution and conductive energy transport schemes based on the WIMP mean-free path in the star. We give a brief description of the input physics and practical usage of the code, as well as examples of its application to dark stars at the Galactic centre.

Edge-preserving Intra Depth Coding based on Context-coding and H.264/AVC

DEFF Research Database (Denmark)

Zamarin, Marco; Salmistraro, Matteo; Forchhammer, Søren

2013-01-01

Depth map coding plays a crucial role in 3D Video communication systems based on the “Multi-view Video plus Depth” representation as view synthesis performance is strongly affected by the accuracy of depth information, especially at edges in the depth map image. In this paper an efficient algorithm...... for edge-preserving intra depth compression based on H.264/AVC is presented. The proposed method introduces a new Intra mode specifically targeted to depth macroblocks with arbitrarily shaped edges, which are typically not efficiently represented by DCT. Edge macroblocks are partitioned into two regions...... each approximated by a flat surface. Edge information is encoded by means of contextcoding with an adaptive template. As a novel element, the proposed method allows exploiting the edge structure of previously encoded edge macroblocks during the context-coding step to further increase compression...

Hierarchical low-rank approximation for high dimensional approximation

KAUST Repository

Nouy, Anthony

2016-01-07

Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

Hierarchical low-rank approximation for high dimensional approximation

KAUST Repository

Nouy, Anthony

2016-01-01

Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

Verification of Monte Carlo transport codes by activation experiments

OpenAIRE

Chetvertkova, Vera

2013-01-01

With the increasing energies and intensities of heavy-ion accelerator facilities, the problem of an excessive activation of the accelerator components caused by beam losses becomes more and more important. Numerical experiments using Monte Carlo transport codes are performed in order to assess the levels of activation. The heavy-ion versions of the codes were released approximately a decade ago, therefore the verification is needed to be sure that they give reasonable results. Present work is...

Dynamic Analyses of Result Quality in Energy-Aware Approximate Programs

Science.gov (United States)

RIngenburg, Michael F.

Energy efficiency is a key concern in the design of modern computer systems. One promising approach to energy-efficient computation, approximate computing, trades off output precision for energy efficiency. However, this tradeoff can have unexpected effects on computation quality. This thesis presents dynamic analysis tools to study, debug, and monitor the quality and energy efficiency of approximate computations. We propose three styles of tools: prototyping tools that allow developers to experiment with approximation in their applications, online tools that instrument code to determine the key sources of error, and online tools that monitor the quality of deployed applications in real time. Our prototyping tool is based on an extension to the functional language OCaml. We add approximation constructs to the language, an approximation simulator to the runtime, and profiling and auto-tuning tools for studying and experimenting with energy-quality tradeoffs. We also present two online debugging tools and three online monitoring tools. The first online tool identifies correlations between output quality and the total number of executions of, and errors in, individual approximate operations. The second tracks the number of approximate operations that flow into a particular value. Our online tools comprise three low-cost approaches to dynamic quality monitoring. They are designed to monitor quality in deployed applications without spending more energy than is saved by approximation. Online monitors can be used to perform real time adjustments to energy usage in order to meet specific quality goals. We present prototype implementations of all of these tools and describe their usage with several applications. Our prototyping, profiling, and autotuning tools allow us to experiment with approximation strategies and identify new strategies, our online tools succeed in providing new insights into the effects of approximation on output quality, and our monitors succeed in

Program POD; A computer code to calculate nuclear elastic scattering cross sections with the optical model and neutron inelastic scattering cross sections by the distorted-wave born approximation

International Nuclear Information System (INIS)

Ichihara, Akira; Kunieda, Satoshi; Chiba, Satoshi; Iwamoto, Osamu; Shibata, Keiichi; Nakagawa, Tsuneo; Fukahori, Tokio; Katakura, Jun-ichi

2005-07-01

The computer code, POD, was developed to calculate angle-differential cross sections and analyzing powers for shape-elastic scattering for collisions of neutron or light ions with target nucleus. The cross sections are computed with the optical model. Angle-differential cross sections for neutron inelastic scattering can also be calculated with the distorted-wave Born approximation. The optical model potential parameters are the most essential inputs for those model computations. In this program, the cross sections and analyzing powers are obtained by using the existing local or global parameters. The parameters can also be inputted by users. In this report, the theoretical formulas, the computational methods, and the input parameters are explained. The sample inputs and outputs are also presented. (author)

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

Efficient Power Allocation for Video over Superposition Coding

KAUST Repository

Lau, Chun Pong

2013-03-01

In this paper we consider a wireless multimedia system by mapping scalable video coded (SVC) bit stream upon superposition coded (SPC) signals, referred to as (SVC-SPC) architecture. Empirical experiments using a software-defined radio(SDR) emulator are conducted to gain a better understanding of its efficiency, specifically, the impact of the received signal due to different power allocation ratios. Our experimental results show that to maintain high video quality, the power allocated to the base layer should be approximately four times higher than the power allocated to the enhancement layer.

Coded Shack-Hartmann Wavefront Sensor

KAUST Repository

Wang, Congli

2016-12-01

Wavefront sensing is an old yet fundamental problem in adaptive optics. Traditional wavefront sensors are limited to time-consuming measurements, complicated and expensive setup, or low theoretically achievable resolution. In this thesis, we introduce an optically encoded and computationally decodable novel approach to the wavefront sensing problem: the Coded Shack-Hartmann. Our proposed Coded Shack-Hartmann wavefront sensor is inexpensive, easy to fabricate and calibrate, highly sensitive, accurate, and with high resolution. Most importantly, using simple optical flow tracking combined with phase smoothness prior, with the help of modern optimization technique, the computational part is split, efficient, and parallelized, hence real time performance has been achieved on Graphics Processing Unit (GPU), with high accuracy as well. This is validated by experimental results. We also show how optical flow intensity consistency term can be derived, using rigor scalar diffraction theory with proper approximation. This is the true physical law behind our model. Based on this insight, Coded Shack-Hartmann can be interpreted as an illumination post-modulated wavefront sensor. This offers a new theoretical approach for wavefront sensor design.

Automatic choroid cells segmentation and counting based on approximate convexity and concavity of chain code in fluorescence microscopic image

Science.gov (United States)

Lu, Weihua; Chen, Xinjian; Zhu, Weifang; Yang, Lei; Cao, Zhaoyuan; Chen, Haoyu

2015-03-01

In this paper, we proposed a method based on the Freeman chain code to segment and count rhesus choroid-retinal vascular endothelial cells (RF/6A) automatically for fluorescence microscopy images. The proposed method consists of four main steps. First, a threshold filter and morphological transform were applied to reduce the noise. Second, the boundary information was used to generate the Freeman chain codes. Third, the concave points were found based on the relationship between the difference of the chain code and the curvature. Finally, cells segmentation and counting were completed based on the characteristics of the number of the concave points, the area and shape of the cells. The proposed method was tested on 100 fluorescence microscopic cell images, and the average true positive rate (TPR) is 98.13% and the average false positive rate (FPR) is 4.47%, respectively. The preliminary results showed the feasibility and efficiency of the proposed method.

Approximate solutions of the two-dimensional integral transport equation by collision probability methods

International Nuclear Information System (INIS)

Sanchez, Richard

1977-01-01

A set of approximate solutions for the isotropic two-dimensional neutron transport problem has been developed using the Interface Current formalism. The method has been applied to regular lattices of rectangular cells containing a fuel pin, cladding and water, or homogenized structural material. The cells are divided into zones which are homogeneous. A zone-wise flux expansion is used to formulate a direct collision probability problem within a cell. The coupling of the cells is made by making extra assumptions on the currents entering and leaving the interfaces. Two codes have been written: the first uses a cylindrical cell model and one or three terms for the flux expansion; the second uses a two-dimensional flux representation and does a truly two-dimensional calculation inside each cell. In both codes one or three terms can be used to make a space-independent expansion of the angular fluxes entering and leaving each side of the cell. The accuracies and computing times achieved with the different approximations are illustrated by numerical studies on two benchmark pr

Study and application of the ANISN and DOT 3.5 codes to problems in nuclear radiation shielding

International Nuclear Information System (INIS)

Otto, A.C.

1983-01-01

The application of the Sn transport codes ANISN and DOT 3.5 to problems in radiation shielding is reviewed. In addition, a large array of codes involved in radiation shielding calculations is described and applied in this work. The ANISN and DOT 3.5 codes solve the multigroup transport equation in plane, cylindrical and spherical geometries, the first in one dimension and the second in two dimensions, by using the Sn approximation and were designed to solve coupled neutron-photon transport problems commonly found in reactor shielding calculations. In this work the numerical methods used in these codes are reviewed and their basic application to deep-penetration and void problems is discussed. Benchmark problems are solved by employing the array of codes previously mentioned. In particular, the ability of the ISOFLUXO program coupled to the DOT 3.5 code of mapping contours of regions with approximately the same scalar fluxes is illustrated, showing that they can be efficiently used in shielding analysis. (Author) [pt

PC-Reactor-core transient simulation code

International Nuclear Information System (INIS)

Nakata, H.

1989-10-01

PC-REATOR, a reactor core transient simulation code has been developed for the real-time operator training on a IBM-PC microcomputer. The program presents capabilities for on-line exchange of the operating parameters during the transient simulation, by friendly keyboard instructions. The model is based on the point-kinetics approximation, with 2 delayed neutron percursors and up to 11 decay power generating groups. (author) [pt

Likelihood Approximation With Hierarchical Matrices For Large Spatial Datasets

KAUST Repository

Litvinenko, Alexander

2017-09-03

We use available measurements to estimate the unknown parameters (variance, smoothness parameter, and covariance length) of a covariance function by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the linear algebra, we approximate the discretized covariance function in the hierarchical (H-) matrix format. The H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations. The H-matrix technique allows us to work with general covariance matrices in an efficient way, since H-matrices can approximate inhomogeneous covariance functions, with a fairly general mesh that is not necessarily axes-parallel, and neither the covariance matrix itself nor its inverse have to be sparse. We demonstrate our method with Monte Carlo simulations and an application to soil moisture data. The C, C++ codes and data are freely available.

LOCFES-B: Solving the one-dimensional transport equation with user-selected spatial approximations

International Nuclear Information System (INIS)

Jarvis, R.D.; Nelson, P.

1993-01-01

Closed linear one-cell functional (CLOF) methods constitute an abstractly defined class of spatial approximations to the one-dimensional discrete ordinates equations of linear particle transport that encompass, as specific instances, the vast majority of the spatial approximations that have been either used or suggested in the computational solution of these equations. A specific instance of the class of CLOF methods is defined by a (typically small) number of functions of the cell width, total cross section, and direction cosine of particle motion. The LOCFES code takes advantage of the latter observation by permitting the use, within a more-or-less standard source iteration solution process, of an arbitrary CLOF method as defined by a user-supplied subroutine. The design objective of LOCFES was to provide automated determination of the order of accuracy (i.e., order of the discretization error) in the fine-mesh limit for an arbitrary user-selected CLOF method. This asymptotic order of accuracy is one widely used measure of the merit of a spatial approximation. This paper discusses LOCFES-B, which is a code that uses methods developed in LOCFES to solve one-dimensional linear particle transport problems with any user-selected CLOF method. LOCFES-B provides automatic solution of a given problem to within an accuracy specified by user input and provides comparison of the computational results against results from externally provided benchmark results

Two codes used in analysis of rod ejection accident for Qinshan Nuclear Power Plant

International Nuclear Information System (INIS)

Zhu Xinguan

1987-12-01

Two codes were developed to analyse rod ejection accident for Qinshan Nuclear Power Plant. One was based on point model with temperature reactivity feedback. In this code, the worth of ejected rod was obtained under'adiabatic' approximation. In the other code, the Nodal Green's Function Method was used to solve space-time dependent neutron diffusion equation. Using these codes, the transient core-power have been calculated for two rod ejection cases at beginning of core-life in Qinshan Nuclear Power Plant

A fast, exact code for scattered thermal radiation compared with a two-stream approximation

International Nuclear Information System (INIS)

Cogley, A.C.; Pandey, D.K.

1980-01-01

A two-stream accuracy study for internally (thermal) driven problems is presented by comparison with a recently developed 'exact' adding/doubling method. The resulting errors in external (or boundary) radiative intensity and flux are usually larger than those for the externally driven problems and vary substantially with the radiative parameters. Error predictions for a specific problem are difficult. An unexpected result is that the exact method is computationally as fast as the two-stream approximation for nonisothermal media

On the Performance of the Cache Coding Protocol

Directory of Open Access Journals (Sweden)

Behnaz Maboudi

2018-03-01

Full Text Available Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the cache coding protocol was proposed. This protocol only allows recoding at the relays when the relay has received enough coded packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key, allowing the system to detect and minimize the effect of pollution attacks and making the relays accountable for changes on the data. This paper analyzes the delay performance of cache coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an absorbing Markov chain and an approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that cache coding can overcome the security issues of unrestricted recoding with only a moderate decrease in system performance.

Fitting Social Network Models Using Varying Truncation Stochastic Approximation MCMC Algorithm

KAUST Repository

Jin, Ick Hoon

2013-10-01

The exponential random graph model (ERGM) plays a major role in social network analysis. However, parameter estimation for the ERGM is a hard problem due to the intractability of its normalizing constant and the model degeneracy. The existing algorithms, such as Monte Carlo maximum likelihood estimation (MCMLE) and stochastic approximation, often fail for this problem in the presence of model degeneracy. In this article, we introduce the varying truncation stochastic approximation Markov chain Monte Carlo (SAMCMC) algorithm to tackle this problem. The varying truncation mechanism enables the algorithm to choose an appropriate starting point and an appropriate gain factor sequence, and thus to produce a reasonable parameter estimate for the ERGM even in the presence of model degeneracy. The numerical results indicate that the varying truncation SAMCMC algorithm can significantly outperform the MCMLE and stochastic approximation algorithms: for degenerate ERGMs, MCMLE and stochastic approximation often fail to produce any reasonable parameter estimates, while SAMCMC can do; for nondegenerate ERGMs, SAMCMC can work as well as or better than MCMLE and stochastic approximation. The data and source codes used for this article are available online as supplementary materials. © 2013 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America.

Use of a hybrid code for global-scale plasma simulation

International Nuclear Information System (INIS)

Swift, D.W.

1996-01-01

This paper presents a demonstration of the use of a hybrid code to model the Earth's magnetosphere on a global scale. The typical hybrid code calculates the interaction of fully kinetic ions and a massless electron fluid with the magnetic field. This code also includes a fluid ion component to approximate the cold ionospheric plasma that spatially overlaps with the discrete particle component. Other innovative features of the code include a numerically generated curvilinear coordinate system and subcycling of the magnetic field update to the particle push. These innovations allow the code to accommodate disparate time and distance scales. The demonstration is a simulation of the noon meridian plane of the magnetosphere. The code exhibits the formation of fast and slow-mode shocks and tearing reconnection at the magnetopause. New results include particle acceleration in the cusp and nearly field aligned currents linking the cusp and polar ionosphere. The paper also describes a density depletion instability and measures to avoid it. 27 refs., 4 figs

The KASY synthesis programme for the approximative solution of the 3-dimensional neutron diffusion equation

International Nuclear Information System (INIS)

Buckel, G.; Wouters, R. de; Pilate, S.

1977-01-01

The synthesis code KASY for an approximate solution of the three-dimensional neutron diffusion equation is described; the state of the art as well as envisaged program extensions and the application to tasks from the field of reactor designing are dealt with. (RW) [de

Development of burnup methods and capabilities in Monte Carlo code RMC

International Nuclear Information System (INIS)

She, Ding; Liu, Yuxuan; Wang, Kan; Yu, Ganglin; Forget, Benoit; Romano, Paul K.; Smith, Kord

2013-01-01

Highlights: ► The RMC code has been developed aiming at large-scale burnup calculations. ► Matrix exponential methods are employed to solve the depletion equations. ► The Energy-Bin method reduces the time expense of treating ACE libraries. ► The Cell-Mapping method is efficient to handle massive amounts of tally cells. ► Parallelized depletion is necessary for massive amounts of burnup regions. -- Abstract: The Monte Carlo burnup calculation has always been a challenging problem because of its large time consumption when applied to full-scale assembly or core calculations, and thus its application in routine analysis is limited. Most existing MC burnup codes are usually external wrappers between a MC code, e.g. MCNP, and a depletion code, e.g. ORIGEN. The code RMC is a newly developed MC code with an embedded depletion module aimed at performing burnup calculations of large-scale problems with high efficiency. Several measures have been taken to strengthen the burnup capabilities of RMC. Firstly, an accurate and efficient depletion module called DEPTH has been developed and built in, which employs the rational approximation and polynomial approximation methods. Secondly, the Energy-Bin method and the Cell-Mapping method are implemented to speed up the transport calculations with large numbers of nuclides and tally cells. Thirdly, the batch tally method and the parallelized depletion module have been utilized to better handle cases with massive amounts of burnup regions in parallel calculations. Burnup cases including a PWR pin and a 5 × 5 assembly group are calculated, thereby demonstrating the burnup capabilities of the RMC code. In addition, the computational time and memory requirements of RMC are compared with other MC burnup codes.

GRAYSKY-A new gamma-ray skyshine code

International Nuclear Information System (INIS)

Witts, D.J.; Twardowski, T.; Watmough, M.H.

1993-01-01

This paper describes a new prototype gamma-ray skyshine code GRAYSKY (Gamma-RAY SKYshine) that has been developed at BNFL, as part of an industrially based master of science course, to overcome the problems encountered with SKYSHINEII and RANKERN. GRAYSKY is a point kernel code based on the use of a skyshine response function. The scattering within source or shield materials is accounted for by the use of buildup factors. This is an approximate method of solution but one that has been shown to produce results that are acceptable for dose rate predictions on operating plants. The novel features of GRAYSKY are as follows: 1. The code is fully integrated with a semianalytical point kernel shielding code, currently under development at BNFL, which offers powerful solid-body modeling capabilities. 2. The geometry modeling also allows the skyshine response function to be used in a manner that accounts for the shielding of air-scattered radiation. 3. Skyshine buildup factors calculated using the skyshine response function have been used as well as dose buildup factors

Approximate first collision probabilities for neutrons in cylindrical and cluster lattices

International Nuclear Information System (INIS)

Robinson, G.S.

1979-05-01

Methods for calculating approximate first collision probabilities for neutrons in cylindrical and cluster lattices are presented and compared with numerical solution methods. The methods differ from those of other authors in the inclusion of anisotropic boundary conditions for both geometries. The methods, which are fast enough for routine use in multigroup and resonance subgroup calculations, have been coded in FORTRAN and included in modules of the AUS scheme for reactor neutronics calculations

The semaphore codes attached to a Turing machine via resets and their various limits

OpenAIRE

Rhodes, John; Schilling, Anne; Silva, Pedro V.

2016-01-01

We introduce semaphore codes associated to a Turing machine via resets. Semaphore codes provide an approximation theory for resets. In this paper we generalize the set-up of our previous paper "Random walks on semaphore codes and delay de Bruijn semigroups" to the infinite case by taking the profinite limit of $k$-resets to obtain $(-\\omega)$-resets. We mention how this opens new avenues to attack the P versus NP problem.

SPIDERMAN: Fast code to simulate secondary transits and phase curves

Science.gov (United States)

Louden, Tom; Kreidberg, Laura

2017-11-01

SPIDERMAN calculates exoplanet phase curves and secondary eclipses with arbitrary surface brightness distributions in two dimensions. The code uses a geometrical algorithm to solve exactly the area of sections of the disc of the planet that are occulted by the star. Approximately 1000 models can be generated per second in typical use, which makes making Markov Chain Monte Carlo analyses practicable. The code is modular and allows comparison of the effect of multiple different brightness distributions for a dataset.

Numerical Test of Different Approximations Used in the Transport Theory of Energetic Particles

Science.gov (United States)

Qin, G.; Shalchi, A.

2016-05-01

Recently developed theories for perpendicular diffusion work remarkably well. The diffusion coefficients they provide agree with test-particle simulations performed for different turbulence setups ranging from slab and slab-like models to two-dimensional and noisy reduced MHD turbulence. However, such theories are still based on different analytical approximations. In the current paper we use a test-particle code to explore the different approximations used in diffusion theory. We benchmark different guiding center approximations, simplifications of higher-order correlations, and the Taylor-Green-Kubo formula. We demonstrate that guiding center approximations work very well as long as the particle's unperturbed Larmor radius is smaller than the perpendicular correlation length of the turbulence. Furthermore, the Taylor-Green-Kubo formula and the definition of perpendicular diffusion coefficients via mean square displacements provide the same results. The only approximation that was used in the past in nonlinear diffusion theory that fails is to replace fourth-order correlations by a product of two second-order correlation functions. In more advanced nonlinear theories, however, this type of approximation is no longer used. Therefore, we confirm the validity of modern diffusion theories as a result of the work presented in the current paper.

LEGO: A modular accelerator design code

International Nuclear Information System (INIS)

Cai, Y.; Donald, M.; Irwin, J.; Yan, Y.

1997-08-01

An object-oriented accelerator design code has been designed and implemented in a simple and modular fashion. It contains all major features of its predecessors: TRACY and DESPOT. All physics of single-particle dynamics is implemented based on the Hamiltonian in the local frame of the component. Components can be moved arbitrarily in the three dimensional space. Several symplectic integrators are used to approximate the integration of the Hamiltonian. A differential algebra class is introduced to extract a Taylor map up to arbitrary order. Analysis of optics is done in the same way both for the linear and nonlinear case. Currently, the code is used to design and simulate the lattices of the PEP-II. It will also be used for the commissioning

Cascade Optimization for Aircraft Engines With Regression and Neural Network Analysis - Approximators

Science.gov (United States)

Patnaik, Surya N.; Guptill, James D.; Hopkins, Dale A.; Lavelle, Thomas M.

2000-01-01

The NASA Engine Performance Program (NEPP) can configure and analyze almost any type of gas turbine engine that can be generated through the interconnection of a set of standard physical components. In addition, the code can optimize engine performance by changing adjustable variables under a set of constraints. However, for engine cycle problems at certain operating points, the NEPP code can encounter difficulties: nonconvergence in the currently implemented Powell's optimization algorithm and deficiencies in the Newton-Raphson solver during engine balancing. A project was undertaken to correct these deficiencies. Nonconvergence was avoided through a cascade optimization strategy, and deficiencies associated with engine balancing were eliminated through neural network and linear regression methods. An approximation-interspersed cascade strategy was used to optimize the engine's operation over its flight envelope. Replacement of Powell's algorithm by the cascade strategy improved the optimization segment of the NEPP code. The performance of the linear regression and neural network methods as alternative engine analyzers was found to be satisfactory. This report considers two examples-a supersonic mixed-flow turbofan engine and a subsonic waverotor-topped engine-to illustrate the results, and it discusses insights gained from the improved version of the NEPP code.

Multitasking the code ARC3D. [for computational fluid dynamics

Science.gov (United States)

Barton, John T.; Hsiung, Christopher C.

1986-01-01

The CRAY multitasking system was developed in order to utilize all four processors and sharply reduce the wall clock run time. This paper describes the techniques used to modify the computational fluid dynamics code ARC3D for this run and analyzes the achieved speedup. The ARC3D code solves either the Euler or thin-layer N-S equations using an implicit approximate factorization scheme. Results indicate that multitask processing can be used to achieve wall clock speedup factors of over three times, depending on the nature of the program code being used. Multitasking appears to be particularly advantageous for large-memory problems running on multiple CPU computers.

Relativistic quasiparticle random phase approximation in deformed nuclei

Energy Technology Data Exchange (ETDEWEB)

Pena Arteaga, D.

2007-06-25

Covariant density functional theory is used to study the influence of electromagnetic radiation on deformed superfluid nuclei. The relativistic Hartree-Bogolyubov equations and the resulting diagonalization problem of the quasiparticle random phase approximation are solved for axially symmetric systems in a fully self-consistent way by a newly developed parallel code. Three different kinds of high precision energy functionals are investigated and special care is taken for the decoupling of the Goldstone modes. This allows the microscopic investigation of Pygmy and scissor resonances in electric and magnetic dipole fields. Excellent agreement with recent experiments is found and new types of modes are predicted for deformed systems with large neutron excess. (orig.)

Utilization of the Nelkin model in a Hammer computer code for calculation the reactor parameters

International Nuclear Information System (INIS)

Leal, L.C.

1980-07-01

The possibility of modifying the HAMMER code, in the thermal part, by changing the thermal neutron scattering Kernel of its library for another one calculated in a subprogramm which can be incorporated to the code, is studied. This subprogramm uses the original version of the Nelkin model instead of its approximation which is used in the HAMMER. It has the advantage of giving the values of the Kernel for any temperature of the reactor for the approximations P 0 , P 1 , P 2 and P 3 . (Author) [pt

A user's guide to GENEX, SDR, and related computer codes

International Nuclear Information System (INIS)

Brissenden, R.J.; Durston, C.

1968-08-01

This series of codes will be of use in a variety of fields connected with reactor physics, examples of which are: (a) In evaluation of nuclear data in which the RESP-GENEX part of the system would be used to examine and produce a cross-section set based on the theories and experiments of the nuclear physicists. The approximations in GENEX must however be kept in mind, the chief one being the diagonal expansion approximation of the inverse level matrix originally due to Bethe which precludes a correct representation of strong interference effects (the Lynn effect). (b) In the calculation of Doppler effects or other resonance effects such as establishing equivalence relationships, approximate resonance treatments, etc. A given set of tapes generated by GENEX (or by some other means into the GENEX format) would be used to run the SDH code. The SDR code produces cross-sections and reaction rates over any group structure within its working range. In situations with complex geometries the spatial representation of SDR is liable to be inadequate and in these circumstances it is recommended that the reaction rates are not used directly but instead the cross-sections are used in a more accurate spatial calculation to produce revised reaction rates. (c) Finally the system may be used for a variety of special investigations such as an analysis of the variance of the Doppler coefficient in fast reactors or the accurate assessment of ideal integral measurements, (for instance the Aldermaston sphere experiment

Improved predictions of nuclear reaction rates with the TALYS reaction code for astrophysical applications

International Nuclear Information System (INIS)

Goriely, S.; Hilaire, S.; Koning, A.J

2008-01-01

Context. Nuclear reaction rates of astrophysical applications are traditionally determined on the basis of Hauser-Feshbach reaction codes. These codes adopt a number of approximations that have never been tested, such as a simplified width fluctuation correction, the neglect of delayed or multiple-particle emission during the electromagnetic decay cascade, or the absence of the pre-equilibrium contribution at increasing incident energies. Aims. The reaction code TALYS has been recently updated to estimate the Maxwellian-averaged reaction rates that are of astrophysical relevance. These new developments enable the reaction rates to be calculated with increased accuracy and reliability and the approximations of previous codes to be investigated. Methods. The TALYS predictions for the thermonuclear rates of relevance to astrophysics are detailed and compared with those derived by widely-used codes for the same nuclear ingredients. Results. It is shown that TALYS predictions may differ significantly from those of previous codes, in particular for nuclei for which no or little nuclear data is available. The pre-equilibrium process is shown to influence the astrophysics rates of exotic neutron-rich nuclei significantly. For the first time, the Maxwellian- averaged (n, 2n) reaction rate is calculated for all nuclei and its competition with the radiative capture rate is discussed. Conclusions. The TALYS code provides a new tool to estimate all nuclear reaction rates of relevance to astrophysics with improved accuracy and reliability. (authors)

Sparsity in Linear Predictive Coding of Speech

DEFF Research Database (Denmark)

Giacobello, Daniele

of the effectiveness of their application in audio processing. The second part of the thesis deals with introducing sparsity directly in the linear prediction analysis-by-synthesis (LPAS) speech coding paradigm. We first propose a novel near-optimal method to look for a sparse approximate excitation using a compressed...... one with direct applications to coding but also consistent with the speech production model of voiced speech, where the excitation of the all-pole filter can be modeled as an impulse train, i.e., a sparse sequence. Introducing sparsity in the LP framework will also bring to de- velop the concept...... sensing formulation. Furthermore, we define a novel re-estimation procedure to adapt the predictor coefficients to the given sparse excitation, balancing the two representations in the context of speech coding. Finally, the advantages of the compact parametric representation of a segment of speech, given...

REVISED STREAM CODE AND WASP5 BENCHMARK

International Nuclear Information System (INIS)

Chen, K

2005-01-01

STREAM is an emergency response code that predicts downstream pollutant concentrations for releases from the SRS area to the Savannah River. The STREAM code uses an algebraic equation to approximate the solution of the one dimensional advective transport differential equation. This approach generates spurious oscillations in the concentration profile when modeling long duration releases. To improve the capability of the STREAM code to model long-term releases, its calculation module was replaced by the WASP5 code. WASP5 is a US EPA water quality analysis program that simulates one-dimensional pollutant transport through surface water. Test cases were performed to compare the revised version of STREAM with the existing version. For continuous releases, results predicted by the revised STREAM code agree with physical expectations. The WASP5 code was benchmarked with the US EPA 1990 and 1991 dye tracer studies, in which the transport of the dye was measured from its release at the New Savannah Bluff Lock and Dam downstream to Savannah. The peak concentrations predicted by the WASP5 agreed with the measurements within ±20.0%. The transport times of the dye concentration peak predicted by the WASP5 agreed with the measurements within ±3.6%. These benchmarking results demonstrate that STREAM should be capable of accurately modeling releases from SRS outfalls

FISIC - a full-wave code to model ion cyclotron resonance heating of tokamak plasmas

International Nuclear Information System (INIS)

Kruecken, T.

1988-08-01

We present a user manual for the FISIC code which solves the integrodifferential wave equation in the finite Larmor radius approximation in fully toroidal geometry to simulate ICRF heating experiments. The code models the electromagnetic wave field as well as antenna coupling and power deposition profiles in axisymmetric plasmas. (orig.)

Visual communication with retinex coding.

Science.gov (United States)

Huck, F O; Fales, C L; Davis, R E; Alter-Gartenberg, R

2000-04-10

Visual communication with retinex coding seeks to suppress the spatial variation of the irradiance (e.g., shadows) across natural scenes and preserve only the spatial detail and the reflectance (or the lightness) of the surface itself. The separation of reflectance from irradiance begins with nonlinear retinex coding that sharply and clearly enhances edges and preserves their contrast, and it ends with a Wiener filter that restores images from this edge and contrast information. An approximate small-signal model of image gathering with retinex coding is found to consist of the familiar difference-of-Gaussian bandpass filter and a locally adaptive automatic-gain control. A linear representation of this model is used to develop expressions within the small-signal constraint for the information rate and the theoretical minimum data rate of the retinex-coded signal and for the maximum-realizable fidelity of the images restored from this signal. Extensive computations and simulations demonstrate that predictions based on these figures of merit correlate closely with perceptual and measured performance. Hence these predictions can serve as a general guide for the design of visual communication channels that produce images with a visual quality that consistently approaches the best possible sharpness, clarity, and reflectance constancy, even for nonuniform irradiances. The suppression of shadows in the restored image is found to be constrained inherently more by the sharpness of their penumbra than by their depth.

Visual Communication with Retinex Coding

Science.gov (United States)

Huck, Friedrich O.; Fales, Carl L.; Davis, Richard E.; Alter-Gartenberg, Rachel

2000-04-01

Visual communication with retinex coding seeks to suppress the spatial variation of the irradiance (e.g., shadows) across natural scenes and preserve only the spatial detail and the reflectance (or the lightness) of the surface itself. The separation of reflectance from irradiance begins with nonlinear retinex coding that sharply and clearly enhances edges and preserves their contrast, and it ends with a Wiener filter that restores images from this edge and contrast information. An approximate small-signal model of image gathering with retinex coding is found to consist of the familiar difference-of-Gaussian bandpass filter and a locally adaptive automatic-gain control. A linear representation of this model is used to develop expressions within the small-signal constraint for the information rate and the theoretical minimum data rate of the retinex-coded signal and for the maximum-realizable fidelity of the images restored from this signal. Extensive computations and simulations demonstrate that predictions based on these figures of merit correlate closely with perceptual and measured performance. Hence these predictions can serve as a general guide for the design of visual communication channels that produce images with a visual quality that consistently approaches the best possible sharpness, clarity, and reflectance constancy, even for nonuniform irradiances. The suppression of shadows in the restored image is found to be constrained inherently more by the sharpness of their penumbra than by their depth.

Approximate models for neutral particle transport calculations in ducts

International Nuclear Information System (INIS)

Ono, Shizuca

2000-01-01

The problem of neutral particle transport in evacuated ducts of arbitrary, but axially uniform, cross-sectional geometry and isotropic reflection at the wall is studied. The model makes use of basis functions to represent the transverse and azimuthal dependences of the particle angular flux in the duct. For the approximation in terms of two basis functions, an improvement in the method is implemented by decomposing the problem into uncollided and collided components. A new quadrature set, more suitable to the problem, is developed and generated by one of the techniques of the constructive theory of orthogonal polynomials. The approximation in terms of three basis functions is developed and implemented to improve the precision of the results. For both models of two and three basis functions, the energy dependence of the problem is introduced through the multigroup formalism. The results of sample problems are compared to literature results and to results of the Monte Carlo code, MCNP. (author)

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.

Absorption Efficiencies of Forsterite. I: DDA Explorations in Grain Shape and Size

Science.gov (United States)

Lindsay, Sean S.; Wooden, Diane; Harker, David E.; Kelley, Michael S.; Woodward, Charles E.; Murphy, Jim R.

2013-01-01

We compute the absorption efficiency (Q(sub abs)) of forsterite using the discrete dipole approximation (DDA) in order to identify and describe what characteristics of crystal grain shape and size are important to the shape, peak location, and relative strength of spectral features in the 8 - 40 micron wavelength range. Using the DDSCAT code, we compute Q(sub abs) for non-spherical polyhedral grain shapes with a(sub eff) = 0.1 micron. The shape characteristics identified are: 1) elongation/reduction along one of three crystallographic axes; 2) asymmetry, such that all three crystallographic axes are of different lengths; and 3) the presence of crystalline faces that are not parallel to a specific crystallographic axis, e.g., non-rectangular prisms and (di)pyramids. Elongation/reduction dominates the locations and shapes of spectral features near 10, 11, 16, 23.5, 27, and 33.5 micron, while asymmetry and tips are secondary shape effects. Increasing grain sizes (0.1 - 1.0 micron) shifts the 10, 11 micron features systematically towards longer wavelengths and relative to the 11 micron feature increases the strengths and slightly broadens the longer wavelength features. Seven spectral shape classes are established for crystallographic a-, b-, and c-axes and include columnar and platelet shapes plus non-elongated or equant grain shapes. The spectral shape classes and the effects of grain size have practical application in identifying or excluding columnar, platelet or equant forsterite grain shapes in astrophysical environs. Identification of the shape characteristics of forsterite from 8 - 40 micron spectra provides a potential means to probe the temperatures at which forsterite formed.

Low Complexity Encoder of High Rate Irregular QC-LDPC Codes for Partial Response Channels

Directory of Open Access Journals (Sweden)

IMTAWIL, V.

2011-11-01

Full Text Available High rate irregular QC-LDPC codes based on circulant permutation matrices, for efficient encoder implementation, are proposed in this article. The structure of the code is an approximate lower triangular matrix. In addition, we present two novel efficient encoding techniques for generating redundant bits. The complexity of the encoder implementation depends on the number of parity bits of the code for the one-stage encoding and the length of the code for the two-stage encoding. The advantage of both encoding techniques is that few XOR-gates are used in the encoder implementation. Simulation results on partial response channels also show that the BER performance of the proposed code has gain over other QC-LDPC codes.

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.

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Science.gov (United States)

Green, Lawrence; Carle, Alan; Fagan, Mike

1999-01-01

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop

Depletion methodology in the 3-D whole core transport code DeCART

Energy Technology Data Exchange (ETDEWEB)

Kim, Kang Seog; Cho, Jin Young; Zee, Sung Quun

2005-02-01

Three dimensional whole-core transport code DeCART has been developed to include a characteristics of the numerical reactor to replace partly the experiment. This code adopts the deterministic method in simulating the neutron behavior with the least assumption and approximation. This neutronic code is also coupled with the thermal hydraulic code CFD and the thermo mechanical code to simulate the combined effects. Depletion module has been implemented in DeCART code to predict the depleted composition in the fuel. The exponential matrix method of ORIGEN-2 has been used for the depletion calculation. The library of including decay constants, yield matrix and others has been used and greatly simplified for the calculation efficiency. This report summarizes the theoretical backgrounds and includes the verification of the depletion module in DeCART by performing the benchmark calculations.

Development and validation of GWHEAD, a three-dimensional groundwater head computer code

International Nuclear Information System (INIS)

Beckmeyer, R.R.; Root, R.W.; Routt, K.R.

1980-03-01

A computer code has been developed to solve the groundwater flow equation in three dimensions. The code has finite-difference approximations solved by the strongly implicit solution procedure. Input parameters to the code include hydraulic conductivity, specific storage, porosity, accretion (recharge), and initial hydralic head. These parameters may be input as varying spatially. The hydraulic conductivity may be input as isotropic or anisotropic. The boundaries either may permit flow across them or may be impermeable. The code has been used to model leaky confined groundwater conditions and spherical flow to a continuous point sink, both of which have exact analytical solutions. The results generated by the computer code compare well with those of the analytical solutions. The code was designed to be used to model groundwater flow beneath fuel reprocessing and waste storage areas at the Savannah River Plant

Performance of Low-Density Parity-Check Coded Modulation

Science.gov (United States)

Hamkins, Jon

2010-01-01

This paper reports the simulated performance of each of the nine accumulate-repeat-4-jagged-accumulate (AR4JA) low-density parity-check (LDPC) codes [3] when used in conjunction with binary phase-shift-keying (BPSK), quadrature PSK (QPSK), 8-PSK, 16-ary amplitude PSK (16- APSK), and 32-APSK.We also report the performance under various mappings of bits to modulation symbols, 16-APSK and 32-APSK ring scalings, log-likelihood ratio (LLR) approximations, and decoder variations. One of the simple and well-performing LLR approximations can be expressed in a general equation that applies to all of the modulation types.

Qsub(N) approximation for slowing-down in fast reactors

International Nuclear Information System (INIS)

Rocca-Volmerange, Brigitte.

1976-05-01

An accurate and simple determination of the neutron energy spectra in fast reactors poses several problems. The slowing-down models (Fermi, Wigner, Goertzel-Greuling...) which are different forms of the approximation with order N=0 may prove inaccurate, in spite of recent improvements. A new method of approximation is presented which turns out to be a method of higher order: the Qsub(N) method. It is characterized by a rapid convergence with respect to the order N, by the use of some global parameters to represent the slowing-down and by the expression of the Boltzmann integral equation in a differential formalism. Numerous test verify that, for the order N=2 or 3, the method gives precision equivalent to that of the multigroup numerical integration for the spectra with greatly reduced calculational effort. Furthermore, since the Qsub(N) expressions are a kind of synthesis method, they allow calculation of the spatial Green's function, or the use of collision probabilities to find the flux. Both possibilities have been introduced into existing reactor codes: EXCALIBUR, TRALOR, RE MINEUR... Some applications to multi-zone media (core, blanket, reflector of Masurca pile and exponential slabs) are presented in the isotropic collision approximation. The case of linearly anisotropic collisions is theoretically resolved [fr

Modernization of the graphics post-processors of the Hamburg German Climate Computer Center Carbon Cycle Codes

Energy Technology Data Exchange (ETDEWEB)

Stevens, E.J.; McNeilly, G.S.

1994-03-01

The existing National Center for Atmospheric Research (NCAR) code in the Hamburg Oceanic Carbon Cycle Circulation Model and the Hamburg Large-Scale Geostrophic Ocean General Circulation Model was modernized and reduced in size while still producing an equivalent end result. A reduction in the size of the existing code from more than 50,000 lines to approximately 7,500 lines in the new code has made the new code much easier to maintain. The existing code in Hamburg model uses legacy NCAR (including even emulated CALCOMP subrountines) graphics to display graphical output. The new code uses only current (version 3.1) NCAR subrountines.

Update on the opal opacity code

International Nuclear Information System (INIS)

Rogers, F.J.; Iglesias, C.A.; Wilson, B.G.

1990-01-01

Persisting discrepancies between theory and observation in a number of astrophysical properties has led to the conjecture that opacity databases may be inaccurate. The OPAL opacity code has been developed to address this question. The physical basis of OPAL removes several of the approximations present in past calculations. For example, it utilizes a much larger and more detailed set of atomic data than was used to construct the los Alamos Astrophysical Library. This data is generated online, in LS or intermediate coupling, from prefitted analytic effective potentials and is of similar quality as single configuration, relativistic, self-consistent-field calculations. The OPAL code has been used to calculate opacities for the solar core and for Cepheid variable stars. In both cases, significant increases in the opacity compared to the Los Alamos Astrophysical Library were found

Developments in the Generation and Interpretation of Wire Codes (invited paper)

International Nuclear Information System (INIS)

Ebi, K.L.

1999-01-01

Three new developments in the generation and interpretation of wire codes are discussed. First, a method was developed to computer generate wire codes using data gathered from a utility database of the local distribution system and from tax assessor records. This method was used to wire code more than 250,000 residences in the greater Denver metropolitan area. There was an approximate 75% agreement with field wire coding. Other research in Denver suggests that wire codes predict some characteristics of a residence and its neighbourhood, including age, assessed value, street layout and traffic density. A third new development is the case-specular method to study the association between wire codes and childhood cancers. Recent results from applying the method to the Savitz et al and London et al studies suggest that the associations between childhood cancer and VHCC residences were strongest for residences with a backyard rather than street service drop, and for VHCC residences with LCC speculars. (author)

XGC developments for a more efficient XGC-GENE code coupling

Science.gov (United States)

Dominski, Julien; Hager, Robert; Ku, Seung-Hoe; Chang, Cs

2017-10-01

In the Exascale Computing Program, the High-Fidelity Whole Device Modeling project initially aims at delivering a tightly-coupled simulation of plasma neoclassical and turbulence dynamics from the core to the edge of the tokamak. To permit such simulations, the gyrokinetic codes GENE and XGC will be coupled together. Numerical efforts are made to improve the numerical schemes agreement in the coupling region. One of the difficulties of coupling those codes together is the incompatibility of their grids. GENE is a continuum grid-based code and XGC is a Particle-In-Cell code using unstructured triangular mesh. A field-aligned filter is thus implemented in XGC. Even if XGC originally had an approximately field-following mesh, this field-aligned filter permits to have a perturbation discretization closer to the one solved in the field-aligned code GENE. Additionally, new XGC gyro-averaging matrices are implemented on a velocity grid adapted to the plasma properties, thus ensuring same accuracy from the core to the edge regions.

Calculation of photon attenuation coefficients of elements and compounds from approximate semi-analytical formulae

Energy Technology Data Exchange (ETDEWEB)

Roteta, M; Baro, J; Fernandez-Varea, J M; Salvat, F

1994-07-01

The FORTRAN 77 code PHOTAC to compute photon attenuation coefficients of elements and compounds is described. The code is based on the semi analytical approximate atomic cross sections proposed by Baro et al. (1994). Photoelectric cross sections for coherent and incoherent scattering and for pair production are obtained as integrals of the corresponding differential cross sections. These integrals are evaluated, to a pre-selected accuracy, by using a 20-point Gauss adaptive integration algorithm. Calculated attenuation coefficients agree with recently compiled databases to within - 1%, in the energy range from 1 keV to 1 GeV. The complete source listing of the program PHOTAC is included. (Author) 14 refs.

Calculation of photon attenuation coefficients of elements and compounds from approximate semi-analytical formulae

International Nuclear Information System (INIS)

Roteta, M.; Baro, J.; Fernandez-Varea, J. M.; Salvat, F.

1994-01-01

The FORTRAN 77 code PHOTAC to compute photon attenuation coefficients of elements and compounds is described. The code is based on the semi analytical approximate atomic cross sections proposed by Baro et al. (1994). Photoelectric cross sections for coherent and incoherent scattering and for pair production are obtained as integrals of the corresponding differential cross sections. These integrals are evaluated, to a pre-selected accuracy, by using a 20-point Gauss adaptive integration algorithm. Calculated attenuation coefficients agree with recently compiled databases to within - 1%, in the energy range from 1 keV to 1 GeV. The complete source listing of the program PHOTAC is included. (Author) 14 refs

Efficient algorithms for maximum likelihood decoding in the surface code

Science.gov (United States)

Bravyi, Sergey; Suchara, Martin; Vargo, Alexander

2014-09-01

We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the two-dimensional surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time O (n2), where n is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our implementation has running time O (nχ3), where χ is a parameter that controls the approximation precision. The key step of our algorithm, borrowed from the density matrix renormalization-group method, is a subroutine for contracting a tensor network on the two-dimensional grid. The subroutine uses MPS with a bond dimension χ to approximate the sequence of tensors arising in the course of contraction. We benchmark the MPS-based decoder against the standard minimum weight matching decoder observing a significant reduction of the logical error probability for χ ≥4.

Improved lossless intra coding for H.264/MPEG-4 AVC.

Science.gov (United States)

Lee, Yung-Lyul; Han, Ki-Hun; Sullivan, Gary J

2006-09-01

A new lossless intra coding method based on sample-by-sample differential pulse code modulation (DPCM) is presented as an enhancement of the H.264/MPEG-4 AVC standard. The H.264/AVC design includes a multidirectional spatial prediction method to reduce spatial redundancy by using neighboring samples as a prediction for the samples in a block of data to be encoded. In the new lossless intra coding method, the spatial prediction is performed based on samplewise DPCM instead of in the block-based manner used in the current H.264/AVC standard, while the block structure is retained for the residual difference entropy coding process. We show that the new method, based on samplewise DPCM, does not have a major complexity penalty, despite its apparent pipeline dependencies. Experiments show that the new lossless intra coding method reduces the bit rate by approximately 12% in comparison with the lossless intra coding method previously included in the H.264/AVC standard. As a result, the new method is currently being adopted into the H.264/AVC standard in a new enhancement project.

Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications. [computational fluid dynamics

Science.gov (United States)

Taylor, Arthur C., III; Hou, Gene W.

1992-01-01

Fundamental equations of aerodynamic sensitivity analysis and approximate analysis for the two dimensional thin layer Navier-Stokes equations are reviewed, and special boundary condition considerations necessary to apply these equations to isolated lifting airfoils on 'C' and 'O' meshes are discussed in detail. An efficient strategy which is based on the finite element method and an elastic membrane representation of the computational domain is successfully tested, which circumvents the costly 'brute force' method of obtaining grid sensitivity derivatives, and is also useful in mesh regeneration. The issue of turbulence modeling is addressed in a preliminary study. Aerodynamic shape sensitivity derivatives are efficiently calculated, and their accuracy is validated on two viscous test problems, including: (1) internal flow through a double throat nozzle, and (2) external flow over a NACA 4-digit airfoil. An automated aerodynamic design optimization strategy is outlined which includes the use of a design optimization program, an aerodynamic flow analysis code, an aerodynamic sensitivity and approximate analysis code, and a mesh regeneration and grid sensitivity analysis code. Application of the optimization methodology to the two test problems in each case resulted in a new design having a significantly improved performance in the aerodynamic response of interest.

Dose uncertainties for large solar particle events: Input spectra variability and human geometry approximations

International Nuclear Information System (INIS)

Townsend, Lawrence W.; Zapp, E. Neal

1999-01-01

The true uncertainties in estimates of body organ absorbed dose and dose equivalent, from exposures of interplanetary astronauts to large solar particle events (SPEs), are essentially unknown. Variations in models used to parameterize SPE proton spectra for input into space radiation transport and shielding computer codes can result in uncertainty about the reliability of dose predictions for these events. Also, different radiation transport codes and their input databases can yield significant differences in dose predictions, even for the same input spectra. Different results may also be obtained for the same input spectra and transport codes if different spacecraft and body self-shielding distributions are assumed. Heretofore there have been no systematic investigations of the variations in dose and dose equivalent resulting from these assumptions and models. In this work we present a study of the variability in predictions of organ dose and dose equivalent arising from the use of different parameters to represent the same incident SPE proton data and from the use of equivalent sphere approximations to represent human body geometry. The study uses the BRYNTRN space radiation transport code to calculate dose and dose equivalent for the skin, ocular lens and bone marrow using the October 1989 SPE as a model event. Comparisons of organ dose and dose equivalent, obtained with a realistic human geometry model and with the oft-used equivalent sphere approximation, are also made. It is demonstrated that variations of 30-40% in organ dose and dose equivalent are obtained for slight variations in spectral fitting parameters obtained when various data points are included or excluded from the fitting procedure. It is further demonstrated that extrapolating spectra from low energy (≤30 MeV) proton fluence measurements, rather than using fluence data extending out to 100 MeV results in dose and dose equivalent predictions that are underestimated by factors as large as 2

Notes on nuclear reactor core analysis code: CITATION

International Nuclear Information System (INIS)

Cepraga, D.G.

1980-01-01

The method which has evolved over the years for making power reactor calculations is the multigroup diffusion method. The CITATION code is designed to solve multigroup neutronics problems with application of the finite-difference diffusion theory approximation to neutron transport in up to three-dimensional geometry. The first part of this paper presents information about the mathematical equations programmed along with background material and certain displays to convey the nature of some of the formulations. The results obtained with the CITATION code regarding the neutron and burnup core analysis for a typical PWR reactor are presented in the second part of this paper. (author)

Sums over geometries and improvements on the mean field approximation

International Nuclear Information System (INIS)

Sacksteder, Vincent E. IV

2007-01-01

The saddle points of a Lagrangian due to Efetov are analyzed. This Lagrangian was originally proposed as a tool for calculating systematic corrections to the Bethe approximation, a mean-field approximation which is important in statistical mechanics, glasses, coding theory, and combinatorial optimization. Detailed analysis shows that the trivial saddle point generates a sum over geometries reminiscent of dynamically triangulated quantum gravity, which suggests new possibilities to design sums over geometries for the specific purpose of obtaining improved mean-field approximations to D-dimensional theories. In the case of the Efetov theory, the dominant geometries are locally treelike, and the sum over geometries diverges in a way that is similar to quantum gravity's divergence when all topologies are included. Expertise from the field of dynamically triangulated quantum gravity about sums over geometries may be able to remedy these defects and fulfill the Efetov theory's original promise. The other saddle points of the Efetov Lagrangian are also analyzed; the Hessian at these points is nonnormal and pseudo-Hermitian, which is unusual for bosonic theories. The standard formula for Gaussian integrals is generalized to nonnormal kernels

Limitations of the acoustic approximation for seismic crosshole tomography

Science.gov (United States)

Marelli, Stefano; Maurer, Hansruedi

2010-05-01

Modelling and inversion of seismic crosshole data is a challenging task in terms of computational resources. Even with the significant increase in power of modern supercomputers, full three-dimensional elastic modelling of high-frequency waveforms generated from hundreds of source positions in several boreholes is still an intractable task. However, it has been recognised that full waveform inversion offers substantially more information compared with traditional travel time tomography. A common strategy to reduce the computational burden for tomographic inversion is to approximate the true elastic wave propagation by acoustic modelling. This approximation assumes that the solid rock units can be treated like fluids (with no shear wave propagation) and is generally considered to be satisfactory so long as only the earliest portions of the recorded seismograms are considered. The main assumption is that most of the energy in the early parts of the recorded seismograms is carried by the faster compressional (P-) waves. Although a limited number of studies exist on the effects of this approximation for surface/marine synthetic reflection seismic data, and show it to be generally acceptable for models with low to moderate impedance contrasts, to our knowledge no comparable studies have been published on the effects for cross-borehole transmission data. An obvious question is whether transmission tomography should be less affected by elastic effects than surface reflection data when only short time windows are applied to primarily capture the first arriving wavetrains. To answer this question we have performed 2D and 3D investigations on the validity of the acoustic approximation for an elastic medium and using crosshole source-receiver configurations. In order to generate consistent acoustic and elastic data sets, we ran the synthetic tests using the same finite-differences time-domain elastic modelling code for both types of simulations. The acoustic approximation was

CH-TRU Waste Content Codes

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2008-01-16

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

Application of the NJOY code for unresolved resonance treatment in the MCNP utility code

International Nuclear Information System (INIS)

Milosevic, M.; Greenspan, E.; Vujic, J. . E-mail addresses of corresponding authors: mmilos@vin.bg.ac.yu , vujic@nuc.berkeley.edu ,; Milosevic, M.; Vujic, J.)

2005-01-01

There are numerous uncertainties in the prediction of neutronic characteristics of reactor cores, particularly in the case of innovative reactor designs, arising from approximations used in the solution of the transport equation, and in nuclear data processing and cross section libraries generation. This paper describes the problems encountered in the analysis of the Encapsulated Nuclear Heat Source (ENHS) benchmark core and the new procedures and cross section libraries developed to overcome these problems. The ENHS is a new lead-bismuth or lead cooled novel reactor concept that is fuelled with metallic alloy of Pu, U and Zr, and it is designed to operate for 20 effective full power years without refuelling and with very small burnup reactivity swing. The computational tools benchmarked include: MOCUP - a coupled MCNP-4C and ORIGEN2.1 utility codes with MCNP data libraries based on the ENDF/B-VI evaluations; and KWO2 - a coupled KENO-V.a and ORIGEN2.1 code with ENDFB-V.2 based 238 group library. Calculations made for the ENHS benchmark have shown that the differences between the results obtained using different code systems and cross section libraries are significant and should be taken into account in assessing the quality of nuclear data libraries. (author)

Development of code PRETOR for stellarator simulation

International Nuclear Information System (INIS)

Dies, J.; Fontanet, J.; Fontdecaba, J.M.; Castejon, F.; Alejandre, C.

1998-01-01

The Department de Fisica i Enginyeria Nuclear (DFEN) of the UPC has some experience in the development of the transport code PRETOR. This code has been validated with shots of DIII-D, JET and TFTR, it has also been used in the simulation of operational scenarios of ITER fast burnt termination. Recently, the association EURATOM-CIEMAT has started the operation of the TJ-II stellarator. Due to the need of validating the results given by others transport codes applied to stellarators and because all of them made some approximations, as a averaging magnitudes in each magnetic surface, it was thought suitable to adapt the PRETOR code to devices without axial symmetry, like stellarators, which is very suitable for the specific needs of the study of TJ-II. Several modifications are required in PRETOR; the main concerns to the models of: magnetic equilibrium, geometry and transport of energy and particles. In order to solve the complex magnetic equilibrium geometry the powerful numerical code VMEC has been used. This code gives the magnetic surface shape as a Fourier series in terms of the harmonics (m,n). Most of the geometric magnitudes are also obtained from the VMEC results file. The energy and particle transport models will be replaced by other phenomenological models that are better adapted to stellarator simulation. Using the proposed models, it is pretended to reproduce experimental data available from present stellarators, given especial attention to the TJ-II of the association EURATOM-CIEMAT. (Author)

Monocrystal sputtering by the computer simulation code ACOCT

International Nuclear Information System (INIS)

Yamamura, Yasunori; Takeuchi, Wataru.

1987-09-01

A new computer code ACOCT has been developed in order to simulate the atomic collisions in the crystalline target within the binary collision approximation. The present code is more convenient as compared with the MARLOWE code, and takes the higher-order simultaneous collisions into account. To cheke the validity of the ACOCT program, we have calculated sputtering yields for various ion-target combinations and compared with the MARLOWE results. It is found that the calculated yields by the ACOCT program are in good agreements with those by the MARLOWE code. The ejection patterns of sputtered atoms were also calculated for the major surfaces of fcc, bcc, diamond and hcp structures, and we have got reasonable agreements with experimental results. In order to know the effects of the simultaneous collision in the slowing down process the sputtering yields and the projected ranges are calculated, changeing the parameter of the criterion for the simultaneous collision, and the effect of the simultaneous collision is found to depend on the crystal orientation. (author)

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

SNAP-3D: a three-dimensional neutron diffusion code

International Nuclear Information System (INIS)

McCallien, C.W.J.

1975-10-01

A preliminary report is presented describing the data requirements of a one- two- or three-dimensional multi-group diffusion code, SNAP-3D. This code is primarily intended for neutron diffusion calculations but it can also carry out gamma calculations if the diffuse approximation is accurate enough. It is suitable for fast and thermal reactor core calculations and for shield calculations. It is assumed the reader is familiar with the older, two-dimensional code SNAP and can refer to the report [TRG-Report-1990], describing it. The present report concentrates on the enhancements to SNAP that have been made to produce the three-dimensional version, SNAP-3D, and is intended to act a a guide on data preparation until a single, comprehensive report can be published. (author)

A multiplex coding imaging spectrometer for X-ray astronomy

International Nuclear Information System (INIS)

Rocchia, R.; Deschamps, J.Y.; Koch-Miramond, L.; Tarrius, A.

1985-06-01

The paper describes a multiplex coding system associated with a solid state spectrometer Si(Li) designed to be placed at the focus of a grazing incidence telescope. In this instrument the spectrometric and imaging functions are separated. The coding system consists in a movable mask with pseudo randomly distributed holes, located in the focal plane of the telescope. The pixel size lies in the range 100-200 microns. The close association of the coding system with a Si(Li) detector gives an imaging spectrometer combining the good efficiency (50% between 0,5 and 10 keV) and energy resolution (ΔE approximately 90 to 160 eV) of solid state spectrometers with the spatial resolution of the mask. Simulations and results obtained with a laboratory model are presented

Description of excited states in the nucleus using the Quasiparticle Random-Phase Approximation and the Gogny interaction

International Nuclear Information System (INIS)

Lechaftois, Francois

2016-01-01

This thesis presents three aspects centered around the QRPA (Quasiparticle Random Phase Approximation). The first consists in the use of an axial code to confront computed data with experimental results and to feed a microscopic reaction code. This step is a chance to analyse low-energy spectroscopy (few tens of MeV) of some nuclei, and more precisely (but not exclusively) the tin isotopic chain (Z=50). The second one relies on the improvement of the formalism to calculate multipolar electromagnetic transition operators, and a method to consolidate the computation of these operators, allowing to ease the programming by unifying the code for different multipolarities. Finally, in order to overcome the axial symmetry constraint, a new triaxial code has been developed. Its assets and development are presented, followed by the first batch of results. (author) [fr

Statistical physics inspired energy-efficient coded-modulation for optical communications.

Science.gov (United States)

Djordjevic, Ivan B; Xu, Lei; Wang, Ting

2012-04-15

Because Shannon's entropy can be obtained by Stirling's approximation of thermodynamics entropy, the statistical physics energy minimization methods are directly applicable to the signal constellation design. We demonstrate that statistical physics inspired energy-efficient (EE) signal constellation designs, in combination with large-girth low-density parity-check (LDPC) codes, significantly outperform conventional LDPC-coded polarization-division multiplexed quadrature amplitude modulation schemes. We also describe an EE signal constellation design algorithm. Finally, we propose the discrete-time implementation of D-dimensional transceiver and corresponding EE polarization-division multiplexed system. © 2012 Optical Society of America

Auditory information coding by modeled cochlear nucleus neurons.

Science.gov (United States)

Wang, Huan; Isik, Michael; Borst, Alexander; Hemmert, Werner

2011-06-01

In this paper we use information theory to quantify the information in the output spike trains of modeled cochlear nucleus globular bushy cells (GBCs). GBCs are part of the sound localization pathway. They are known for their precise temporal processing, and they code amplitude modulations with high fidelity. Here we investigated the information transmission for a natural sound, a recorded vowel. We conclude that the maximum information transmission rate for a single neuron was close to 1,050 bits/s, which corresponds to a value of approximately 5.8 bits per spike. For quasi-periodic signals like voiced speech, the transmitted information saturated as word duration increased. In general, approximately 80% of the available information from the spike trains was transmitted within about 20 ms. Transmitted information for speech signals concentrated around formant frequency regions. The efficiency of neural coding was above 60% up to the highest temporal resolution we investigated (20 μs). The increase in transmitted information to that precision indicates that these neurons are able to code information with extremely high fidelity, which is required for sound localization. On the other hand, only 20% of the information was captured when the temporal resolution was reduced to 4 ms. As the temporal resolution of most speech recognition systems is limited to less than 10 ms, this massive information loss might be one of the reasons which are responsible for the lack of noise robustness of these systems.

Canadian energy standards : residential energy code requirements

Energy Technology Data Exchange (ETDEWEB)

Cooper, K. [SAR Engineering Ltd., Burnaby, BC (Canada)

2006-09-15

A survey of residential energy code requirements was discussed. New housing is approximately 13 per cent more efficient than housing built 15 years ago, and more stringent energy efficiency requirements in building codes have contributed to decreased energy use and greenhouse gas (GHG) emissions. However, a survey of residential energy codes across Canada has determined that explicit demands for energy efficiency are currently only present in British Columbia (BC), Manitoba, Ontario and Quebec. The survey evaluated more than 4300 single-detached homes built between 2000 and 2005 using data from the EnerGuide for Houses (EGH) database. House area, volume, airtightness and construction characteristics were reviewed to create archetypes for 8 geographic areas. The survey indicated that in Quebec and the Maritimes, 90 per cent of houses comply with ventilation system requirements of the National Building Code, while compliance in the rest of Canada is much lower. Heat recovery ventilation use is predominant in the Atlantic provinces. Direct-vent or condensing furnaces constitute the majority of installed systems in provinces where natural gas is the primary space heating fuel. Details of Insulation levels for walls, double-glazed windows, and building code insulation standards were also reviewed. It was concluded that if R-2000 levels of energy efficiency were applied, total average energy consumption would be reduced by 36 per cent in Canada. 2 tabs.

Numerical model for two-dimensional hydrodynamics and energy transport. [VECTRA code

Energy Technology Data Exchange (ETDEWEB)

Trent, D.S.

1973-06-01

The theoretical basis and computational procedure of the VECTRA computer program are presented. VECTRA (Vorticity-Energy Code for TRansport Analysis) is designed for applying numerical simulation to a broad range of intake/discharge flows in conjunction with power plant hydrological evaluation. The code computational procedure is based on finite-difference approximation of the vorticity-stream function partial differential equations which govern steady flow momentum transport of two-dimensional, incompressible, viscous fluids in conjunction with the transport of heat and other constituents.

A Calculation Method of PKA, KERMA and DPA from Evaluated Nuclear Data with an Effective Single-particle Emission Approximation (ESPEA) and Introduction of Event Generator Mode in PHITS Code

International Nuclear Information System (INIS)

Fukahori, Tokio; Iwamoto, Yosuke

2012-01-01

The displacement calculation method from evaluated nuclear data file has been developed by using effective single-particle emission approximation (ESPEA). The ESPEA can be used effectively below about 50 MeV, because of since multiplicity of emitted particles. These are also reported in the Ref. 24. The displacement calculation method in PHITS has been developed. In the high energy region (≥ 20 MeV) for proton and neutron beams, DPA created by secondary particles increase due to nuclear reactions. For heavy-ion beams, DPA created by the primaries are dominant to total DPA due to the large Coulomb scattering cross sections. PHITS results agree with FLUKA ones within a factor of 1.7. In the high-energy region above 10 MeV/nucleon, comparisons among codes and measurements of displacement damage cross section are necessary. (author)

International Code Assessment and Applications Program: Annual report

International Nuclear Information System (INIS)

Ting, P.; Hanson, R.; Jenks, R.

1987-03-01

This is the first annual report of the International Code Assessment and Applications Program (ICAP). The ICAP was organized by the Office of Nuclear Regulatory Research, United States Nuclear Regulatory Commission (USNRC) in 1985. The ICAP is an international cooperative reactor safety research program planned to continue over a period of approximately five years. To date, eleven European and Asian countries/organizations have joined the program through bilateral agreements with the USNRC. Seven proposed agreements are currently under negotiation. The primary mission of the ICAP is to provide independent assessment of the three major advanced computer codes (RELAP5, TRAC-PWR, and TRAC-BWR) developed by the USNRC. However, program activities can be expected to enhance the assessment process throughout member countries. The codes were developed to calculate the reactor plant response to transients and loss-of-coolant accidents. Accurate prediction of normal and abnormal plant response using the codes enhances procedures and regulations used for the safe operation of the plant and also provides technical basis for assessing the safety margin of future reactor plant designs. The ICAP is providing required assessment data that will contribute to quantification of the code uncertainty for each code. The first annual report is devoted to coverage of program activities and accomplishments during the period between April 1985 and March 1987

Comparative studies of parameters based on the most probable versus an approximate linear extrapolation distance estimates for circular cylindrical absorbing rod

International Nuclear Information System (INIS)

Wassef, W.A.

1982-01-01

Estimates and techniques that are valid to calculate the linear extrapolation distance for an infinitely long circular cylindrical absorbing region are reviewed. Two estimates, in particular, are put into consideration, that is the most probable and the value resulting from an approximate technique based on matching the integral transport equation inside the absorber with the diffusion approximation in the surrounding infinite scattering medium. Consequently, the effective diffusion parameters and the blackness of the cylinder are derived and subjected to comparative studies. A computer code is set up to calculate and compare the different parameters, which is useful in reactor analysis and serves to establish a beneficial estimates that are amenable to direct application to reactor design codes

GRADSPMHD: A parallel MHD code based on the SPH formalism

Science.gov (United States)

Vanaverbeke, S.; Keppens, R.; Poedts, S.

2014-03-01

We present GRADSPMHD, a completely Lagrangian parallel magnetohydrodynamics code based on the SPH formalism. The implementation of the equations of SPMHD in the “GRAD-h” formalism assembles known results, including the derivation of the discretized MHD equations from a variational principle, the inclusion of time-dependent artificial viscosity, resistivity and conductivity terms, as well as the inclusion of a mixed hyperbolic/parabolic correction scheme for satisfying the ∇ṡB→ constraint on the magnetic field. The code uses a tree-based formalism for neighbor finding and can optionally use the tree code for computing the self-gravity of the plasma. The structure of the code closely follows the framework of our parallel GRADSPH FORTRAN 90 code which we added previously to the CPC program library. We demonstrate the capabilities of GRADSPMHD by running 1, 2, and 3 dimensional standard benchmark tests and we find good agreement with previous work done by other researchers. The code is also applied to the problem of simulating the magnetorotational instability in 2.5D shearing box tests as well as in global simulations of magnetized accretion disks. We find good agreement with available results on this subject in the literature. Finally, we discuss the performance of the code on a parallel supercomputer with distributed memory architecture. Catalogue identifier: AERP_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERP_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 620503 No. of bytes in distributed program, including test data, etc.: 19837671 Distribution format: tar.gz Programming language: FORTRAN 90/MPI. Computer: HPC cluster. Operating system: Unix. Has the code been vectorized or parallelized?: Yes, parallelized using MPI. RAM: ˜30 MB for a

Code-code comparisons of DIVIMP's 'onion-skin model' and the EDGE2D fluid code

International Nuclear Information System (INIS)

Stangeby, P.C.; Elder, J.D.; Horton, L.D.; Simonini, R.; Taroni, A.; Matthews, O.F.; Monk, R.D.

1997-01-01

In onion-skin modelling, O-SM, of the edge plasma, the cross-field power and particle flows are treated very simply e.g. as spatially uniform. The validity of O-S modelling requires demonstration that such approximations can still result in reasonable solutions for the edge plasma. This is demonstrated here by comparison of O-SM with full 2D fluid edge solutions generated by the EDGE2D code. The target boundary conditions for the O-SM are taken from the EDGE2D output and the complete O-SM solutions are then compared with the EDGE2D ones. Agreement is generally within 20% for n e , T e , T i and parallel particle flux density Γ for the medium and high recycling JET cases examined and somewhat less good for a strongly detached CMOD example. (orig.)

Benchmarking of epithermal methods in the lattice-physics code EPRI-CELL

International Nuclear Information System (INIS)

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

1982-01-01

The epithermal cross section shielding methods used in the lattice physics code EPRI-CELL (E-C) have been extensively studied to determine its major approximations and to examine the sensitivity of computed results to these approximations. The study has resulted in several improvements in the original methodology. These include: treatment of the external moderator source with intermediate resonance (IR) theory, development of a new Dancoff factor expression to account for clad interactions, development of a new method for treating resonance interference, and application of a generalized least squares method to compute best-estimate values for the Bell factor and group-dependent IR parameters. The modified E-C code with its new ENDF/B-V cross section library is tested for several numerical benchmark problems. Integral parameters computed by EC are compared with those obtained with point-cross section Monte Carlo calculations, and E-C fine group cross sections are benchmarked against point-cross section descrete ordinates calculations. It is found that the code modifications improve agreement between E-C and the more sophisticated methods. E-C shows excellent agreement on the integral parameters and usually agrees within a few percent on fine-group, shielded cross sections

Improved algorithms for approximate string matching (extended abstract

Directory of Open Access Journals (Sweden)

Papamichail Georgios

2009-01-01

Full Text Available Abstract Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. Results We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s - |n - m|·min(m, n, s + m + n and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm also excels in practice, especially in cases where the two strings compared differ significantly in length. Conclusion We have provided the design, analysis and implementation of a new algorithm for calculating the edit distance of two strings with both theoretical and practical implications. Source code of our algorithm is available online.

Codes and standards and other guidance cited in regulatory documents

International Nuclear Information System (INIS)

Nickolaus, J.R.; Bohlander, K.L.

1996-08-01

As part of the U.S. Nuclear Regulatory Commission (NRC) Standard Review Plan Update and Development Program (SRP-UDP), Pacific Northwest National Laboratory developed a listing of industry consensus codes and standards and other government and industry guidance referred to in regulatory documents. The SRP-UDP has been completed and the SRP-Maintenance Program (SRP-MP) is now maintaining this listing. Besides updating previous information, Revision 3 adds approximately 80 citations. This listing identifies the version of the code or standard cited in the regulatory document, the regulatory document, and the current version of the code or standard. It also provides a summary characterization of the nature of the citation. This listing was developed from electronic searches of the Code of Federal Regulations and the NRC's Bulletins, Information Notices, Circulars, Enforcement Manual, Generic Letters, Inspection Manual, Policy Statements, Regulatory Guides, Standard Technical Specifications and the Standard Review Plan (NUREG-0800)

Codes and standards and other guidance cited in regulatory documents

Energy Technology Data Exchange (ETDEWEB)

Nickolaus, J.R.; Bohlander, K.L.

1996-08-01

As part of the U.S. Nuclear Regulatory Commission (NRC) Standard Review Plan Update and Development Program (SRP-UDP), Pacific Northwest National Laboratory developed a listing of industry consensus codes and standards and other government and industry guidance referred to in regulatory documents. The SRP-UDP has been completed and the SRP-Maintenance Program (SRP-MP) is now maintaining this listing. Besides updating previous information, Revision 3 adds approximately 80 citations. This listing identifies the version of the code or standard cited in the regulatory document, the regulatory document, and the current version of the code or standard. It also provides a summary characterization of the nature of the citation. This listing was developed from electronic searches of the Code of Federal Regulations and the NRC`s Bulletins, Information Notices, Circulars, Enforcement Manual, Generic Letters, Inspection Manual, Policy Statements, Regulatory Guides, Standard Technical Specifications and the Standard Review Plan (NUREG-0800).

Toric Varieties and Codes, Error-correcting Codes, Quantum Codes, Secret Sharing and Decoding

DEFF Research Database (Denmark)

Hansen, Johan Peder

We present toric varieties and associated toric codes and their decoding. Toric codes are applied to construct Linear Secret Sharing Schemes (LSSS) with strong multiplication by the Massey construction. Asymmetric Quantum Codes are obtained from toric codes by the A.R. Calderbank P.W. Shor and A.......M. Steane construction of stabilizer codes (CSS) from linear codes containing their dual codes....

Calculation of photon attenuation coefficients of elements and compounds from approximate semi-analytical formulae

International Nuclear Information System (INIS)

Roteta, M.; Baro, J.; Fernandez-Varea, J.M.; Salvat, F.

1994-01-01

The FORTRAN 77 code PHOTAC to compute photon attenuation coefficients of elements and compounds is described. The code is based on the semi-analytical approximate atomic cross sections proposed by Baro et al. (1994). Photoelectric cross sections are calculated directly from a simple analytical expression. Atomic cross sections for coherent and incoherent scattering and for pair production are obtained as integrals of the corresponding differential cross sections. These integrals are evaluated, to a pre-selected accuracy, by using a 20-point Gauss adaptive integration algorithm. Calculated attenuation coefficients agree with recently compiled databases to within equal 1%, in the energy range from 1 KeV to 1 GeV. The complete source listing of the program PHOTAC is included

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

U.S. Department Of Energy's nuclear engineering education research: highlights of recent and current research-II. 1. Comparison of Angular Approximations for PWR Cell Calculations

International Nuclear Information System (INIS)

Smith, M.A.; Tsoulfanidis, N.; Lewis, E.E.; Palmiotti, G.

2001-01-01

Increasing computer power is allowing higher-order angular approximations to replace diffusion theory methods in whole core reactor physics computations. Spherical harmonic (P n ), simplified spherical harmonic (SP n ), and discrete ordinates (S n ) methods are capable of performing such calculations in three dimensions. Most advantages of such transport methods are gained by eliminating fuel assembly homogenization, thus allowing pin powers to be calculated directly. A further step, currently under investigation, is the elimination of spatial homogenization at the pin cell level as well. The fuel-moderator interfaces may be treated explicitly in P n , S n , or SP n calculations by applying triangular finite elements (FEM) to the spatial variables. Early results using a modified form of the VARIANT code, however, indicate that without pin cell homogenization, high-order angular approximations may be required to represent the lattice effects accurately within the whole-core calculations. To examine these lattice effects further, a modified form of VARIANT was created to use the spatial triangular finite element scheme. The program was set up to treat a single heterogeneous pin cell coupled with P n , SP n , or S n angular approximations. Additional modifications replaced the nodal interface approximations with exact reflected boundary conditions to increase the accuracy of the results. Several pressurized water reactor pin cells, taken from a previous benchmark specification, were examined. However, the results shown here focus only on the most severe case, i.e., a pin cell containing 8.7% mixed-oxide enriched fuel. The DRAGON collision probability code was used to collapse a 69-group cross-section library to a more manageable 7-group library that contained cross sections for the fuel-cladding mixture and for the water. Eigenvalue results are shown in Figs. 1 and 2 using the modified VARIANT code with P n , SP n , and S n angular approximations. A 7-group MCNP Monte

Practical Application of Monte Carlo Code in RTP

International Nuclear Information System (INIS)

Mohamad Hairie Rabir; Julia Abdul Karim; Muhammad Rawi Mohamed Zin; Na'im Syauqi Hamzah; Mark Dennis Anak Usang; Abi Muttaqin Jalal Bayar; Muhammad Khairul Ariff Mustafa

2015-01-01

Monte Carlo neutron transport codes are widely used in various reactor physics applications in RTP and other related nuclear and radiation research in Nuklear Malaysia. The main advantage of the method is the capability to model geometry and interaction physics without major approximations. The disadvantage is that the modelling of complicated systems is very computing-intensive, which restricts the applications to some extent. The importance of Monte Carlo calculation is likely to increase in the future, along with the development in computer capacities and parallel calculation. This paper presents several calculation activities, its achievements and challenges in using MCNP code for neutronics analysis, nuclide inventory and source term calculation, shielding and dose evaluation. (author)

Monte-Carlo code PARJET to simulate e+e--annihilation events via QCD jets

International Nuclear Information System (INIS)

Ritter, S.

1983-01-01

The Monte-Carlo code PARJET simulates exclusive hadronic final states produced in e + e - -annihilation via a virtual photon by two steps: (i) the fragmentation of the original quark-antiquark pair into further partons using results of perturbative QCD in the leading logarithmic approximation (LLA), and (ii) the transition of these parton jets into hadrons on the basis of a chain decay model. Program summary and code description are given. (author)

Finite mixture models for sensitivity analysis of thermal hydraulic codes for passive safety systems analysis

Energy Technology Data Exchange (ETDEWEB)

Di Maio, Francesco, E-mail: francesco.dimaio@polimi.it [Energy Department, Politecnico di Milano, Via La Masa 34, 20156 Milano (Italy); Nicola, Giancarlo [Energy Department, Politecnico di Milano, Via La Masa 34, 20156 Milano (Italy); Zio, Enrico [Energy Department, Politecnico di Milano, Via La Masa 34, 20156 Milano (Italy); Chair on System Science and Energetic Challenge Fondation EDF, Ecole Centrale Paris and Supelec, Paris (France); Yu, Yu [School of Nuclear Science and Engineering, North China Electric Power University, 102206 Beijing (China)

2015-08-15

Highlights: • Uncertainties of TH codes affect the system failure probability quantification. • We present Finite Mixture Models (FMMs) for sensitivity analysis of TH codes. • FMMs approximate the pdf of the output of a TH code with a limited number of simulations. • The approach is tested on a Passive Containment Cooling System of an AP1000 reactor. • The novel approach overcomes the results of a standard variance decomposition method. - Abstract: For safety analysis of Nuclear Power Plants (NPPs), Best Estimate (BE) Thermal Hydraulic (TH) codes are used to predict system response in normal and accidental conditions. The assessment of the uncertainties of TH codes is a critical issue for system failure probability quantification. In this paper, we consider passive safety systems of advanced NPPs and present a novel approach of Sensitivity Analysis (SA). The approach is based on Finite Mixture Models (FMMs) to approximate the probability density function (i.e., the uncertainty) of the output of the passive safety system TH code with a limited number of simulations. We propose a novel Sensitivity Analysis (SA) method for keeping the computational cost low: an Expectation Maximization (EM) algorithm is used to calculate the saliency of the TH code input variables for identifying those that most affect the system functional failure. The novel approach is compared with a standard variance decomposition method on a case study considering a Passive Containment Cooling System (PCCS) of an Advanced Pressurized reactor AP1000.

Secure DS-CDMA spreading codes using fully digital multidimensional multiscroll chaos

KAUST Repository

Mansingka, Abhinav S.

2014-06-18

This paper introduces a generalized fully digital hardware implementation of 1-D, 2-D and 3-D multiscroll chaos through sawtooth nonlinearities in a 3rd order ODE with the Euler approximation, wherein low-significance bits pass all NIST SP. 800-22 tests. The low-significance bits show good performance as spreading code for multiple-access DS-CDMA in AWGN and multipath environments, equivalent to Gold codes. This system capitalizes on complex nonlinear dynamics afforded by multiscroll chaos to provide higher security than conventional codes with the same BER performance demonstrated experimentally on a Xilinx Virtex 4 FPGA with logic utilization less than 1.25% and throughput up to 10.92 Gbits/s.

Rare and low-frequency coding variants alter human adult height

NARCIS (Netherlands)

Marouli, Eirini; Graff, Mariaelisa; Medina-Gomez, Carolina; Lo, Ken Sin; Wood, Andrew R.; Kjaer, Troels R.; Fine, Rebecca S.; Lu, Yingchang; Schurmann, Claudia; Highland, Heather M.; Rüeger, Sina; Thorleifsson, Gudmar; Justice, Anne E.; Lamparter, David; Stirrups, Kathleen E.; Turcot, Valérie; Young, Kristin L.; Winkler, Thomas W.; Esko, Tõnu; Karaderi, Tugce; Locke, Adam E.; Masca, Nicholas G. D.; Ng, Maggie C. Y.; Mudgal, Poorva; Rivas, Manuel A.; Vedantam, Sailaja; Mahajan, Anubha; Guo, Xiuqing; Abecasis, Goncalo; Aben, Katja K.; Adair, Linda S.; Alam, Dewan S.; Albrecht, Eva; Allin, Kristine H.; Allison, Matthew; Amouyel, Philippe; Appel, Emil V.; Arveiler, Dominique; Asselbergs, Folkert W.; Auer, Paul L.; Balkau, Beverley; Banas, Bernhard; Bang, Lia E.; Benn, Marianne; Bergmann, Sven; Bielak, Lawrence F.; Blüher, Matthias; Boeing, Heiner; Boerwinkle, Eric; Böger, Carsten A.; Bonnycastle, Lori L.; Bork-Jensen, Jette; Bots, Michiel L.; Bottinger, Erwin P.; Bowden, Donald W.; Brandslund, Ivan; Breen, Gerome; Brilliant, Murray H.; Broer, Linda; Burt, Amber A.; Butterworth, Adam S.; Carey, David J.; Caulfield, Mark J.; Chambers, John C.; Chasman, Daniel I.; Chen, Yii-Der Ida; Chowdhury, Rajiv; Christensen, Cramer; Chu, Audrey Y.; Cocca, Massimiliano; Collins, Francis S.; Cook, James P.; Corley, Janie; Galbany, Jordi Corominas; Cox, Amanda J.; Cuellar-Partida, Gabriel; Danesh, John; Davies, Gail; de Bakker, Paul I. W.; de Borst, Gert J.; de Denus, Simon; de Groot, Mark C. H.; de Mutsert, Renée; Deary, Ian J.; Dedoussis, George; Demerath, Ellen W.; den Hollander, Anneke I.; Dennis, Joe G.; Di Angelantonio, Emanuele; Drenos, Fotios; Du, Mengmeng; Dunning, Alison M.; Easton, Douglas F.; Ebeling, Tapani; Edwards, Todd L.; Ellinor, Patrick T.; Elliott, Paul; Evangelou, Evangelos; Farmaki, Aliki-Eleni; Faul, Jessica D.; Feitosa, Mary F.; Feng, Shuang; Ferrannini, Ele; Ferrario, Marco M.; Ferrieres, Jean; Florez, Jose C.; Ford, Ian; Fornage, Myriam; Franks, Paul W.; Frikke-Schmidt, Ruth; Galesloot, Tessel E.; Gan, Wei; Gandin, Ilaria; Gasparini, Paolo; Giedraitis, Vilmantas; Giri, Ayush; Girotto, Giorgia; Gordon, Scott D.; Gordon-Larsen, Penny; Gorski, Mathias; Grarup, Niels; Grove, Megan L.; Gudnason, Vilmundur; Gustafsson, Stefan; Hansen, Torben; Harris, Kathleen Mullan; Harris, Tamara B.; Hattersley, Andrew T.; Hayward, Caroline; He, Liang; Heid, Iris M.; Heikkilä, Kauko; Helgeland, Øyvind; Hernesniemi, Jussi; Hewitt, Alex W.; Hocking, Lynne J.; Hollensted, Mette; Holmen, Oddgeir L.; Hovingh, G. Kees; Howson, Joanna M. M.; Hoyng, Carel B.; Huang, Paul L.; Hveem, Kristian; Ikram, M. Arfan; Ingelsson, Erik; Jackson, Anne U.; Jansson, Jan-Håkan; Jarvik, Gail P.; Jensen, Gorm B.; Jhun, Min A.; Jia, Yucheng; Jiang, Xuejuan; Johansson, Stefan; Jørgensen, Marit E.; Jørgensen, Torben; Jousilahti, Pekka; Jukema, J. Wouter; Kahali, Bratati; Kahn, René S.; Kähönen, Mika; Kamstrup, Pia R.; Kanoni, Stavroula; Kaprio, Jaakko; Karaleftheri, Maria; Kardia, Sharon L. R.; Karpe, Fredrik; Kee, Frank; Keeman, Renske; Kiemeney, Lambertus A.; Kitajima, Hidetoshi; Kluivers, Kirsten B.; Kocher, Thomas; Komulainen, Pirjo; Kontto, Jukka; Kooner, Jaspal S.; Kooperberg, Charles; Kovacs, Peter; Kriebel, Jennifer; Kuivaniemi, Helena; Küry, Sébastien; Kuusisto, Johanna; La Bianca, Martina; Laakso, Markku; Lakka, Timo A.; Lange, Ethan M.; Lange, Leslie A.; Langefeld, Carl D.; Langenberg, Claudia; Larson, Eric B.; Lee, I.-Te; Lehtimäki, Terho; Lewis, Cora E.; Li, Huaixing; Li, Jin; Li-Gao, Ruifang; Lin, Honghuang; Lin, Li-An; Lin, Xu; Lind, Lars; Lindström, Jaana; Linneberg, Allan; Liu, Yeheng; Liu, Yongmei; Lophatananon, Artitaya; Luan, Jian'an; Lubitz, Steven A.; Lyytikäinen, Leo-Pekka; Mackey, David A.; Madden, Pamela A. F.; Manning, Alisa K.; Männistö, Satu; Marenne, Gaëlle; Marten, Jonathan; Martin, Nicholas G.; Mazul, Angela L.; Meidtner, Karina; Metspalu, Andres; Mitchell, Paul; Mohlke, Karen L.; Mook-Kanamori, Dennis O.; Morgan, Anna; Morris, Andrew D.; Morris, Andrew P.; Müller-Nurasyid, Martina; Munroe, Patricia B.; Nalls, Mike A.; Nauck, Matthias; Nelson, Christopher P.; Neville, Matt; Nielsen, Sune F.; Nikus, Kjell; Njølstad, Pål R.; Nordestgaard, Børge G.; Ntalla, Ioanna; O'Connel, Jeffrey R.; Oksa, Heikki; Loohuis, Loes M. Olde; Ophoff, Roel A.; Owen, Katharine R.; Packard, Chris J.; Padmanabhan, Sandosh; Palmer, Colin N. A.; Pasterkamp, Gerard; Patel, Aniruddh P.; Pattie, Alison; Pedersen, Oluf; Peissig, Peggy L.; Peloso, Gina M.; Pennell, Craig E.; Perola, Markus; Perry, James A.; Perry, John R. B.; Person, Thomas N.; Pirie, Ailith; Polasek, Ozren; Posthuma, Danielle; Raitakari, Olli T.; Rasheed, Asif; Rauramaa, Rainer; Reilly, Dermot F.; Reiner, Alex P.; Renström, Frida; Ridker, Paul M.; Rioux, John D.; Robertson, Neil; Robino, Antonietta; Rolandsson, Olov; Rudan, Igor; Ruth, Katherine S.; Saleheen, Danish; Salomaa, Veikko; Samani, Nilesh J.; Sandow, Kevin; Sapkota, Yadav; Sattar, Naveed; Schmidt, Marjanka K.; Schreiner, Pamela J.; Schulze, Matthias B.; Scott, Robert A.; Segura-Lepe, Marcelo P.; Shah, Svati; Sim, Xueling; Sivapalaratnam, Suthesh; Small, Kerrin S.; Smith, Albert Vernon; Smith, Jennifer A.; Southam, Lorraine; Spector, Timothy D.; Speliotes, Elizabeth K.; Starr, John M.; Steinthorsdottir, Valgerdur; Stringham, Heather M.; Stumvoll, Michael; Surendran, Praveen; 't Hart, Leen M.; Tansey, Katherine E.; Tardif, Jean-Claude; Taylor, Kent D.; Teumer, Alexander; Thompson, Deborah J.; Thorsteinsdottir, Unnur; Thuesen, Betina H.; Tönjes, Anke; Tromp, Gerard; Trompet, Stella; Tsafantakis, Emmanouil; Tuomilehto, Jaakko; Tybjaerg-Hansen, Anne; Tyrer, Jonathan P.; Uher, Rudolf; Uitterlinden, André G.; Ulivi, Sheila; van der Laan, Sander W.; van der Leij, Andries R.; van Duijn, Cornelia M.; van Schoor, Natasja M.; van Setten, Jessica; Varbo, Anette; Varga, Tibor V.; Varma, Rohit; Edwards, Digna R. Velez; Vermeulen, Sita H.; Vestergaard, Henrik; Vitart, Veronique; Vogt, Thomas F.; Vozzi, Diego; Walker, Mark; Wang, Feijie; Wang, Carol A.; Wang, Shuai; Wang, Yiqin; Wareham, Nicholas J.; Warren, Helen R.; Wessel, Jennifer; Willems, Sara M.; Wilson, James G.; Witte, Daniel R.; Woods, Michael O.; Wu, Ying; Yaghootkar, Hanieh; Yao, Jie; Yao, Pang; Yerges-Armstrong, Laura M.; Young, Robin; Zeggini, Eleftheria; Zhan, Xiaowei; Zhang, Weihua; Zhao, Jing Hua; Zhao, Wei; Zheng, He; Zhou, Wei; Rotter, Jerome I.; Boehnke, Michael; Kathiresan, Sekar; McCarthy, Mark I.; Willer, Cristen J.; Stefansson, Kari; Borecki, Ingrid B.; Liu, Dajiang J.; North, Kari E.; Heard-Costa, Nancy L.; Pers, Tune H.; Lindgren, Cecilia M.; Oxvig, Claus; Kutalik, Zoltán; Rivadeneira, Fernando; Loos, Ruth J. F.; Frayling, Timothy M.; Hirschhorn, Joel N.; Deloukas, Panos; Lettre, Guillaume

2017-01-01

Height is a highly heritable, classic polygenic trait with approximately 700 common associated variants identified through genome-wide association studies so far. Here, we report 83 height-associated coding variants with lower minor-allele frequencies (in the range of 0.1-4.8%) and effects of up to

Self-similar factor approximants

International Nuclear Information System (INIS)

Gluzman, S.; Yukalov, V.I.; Sornette, D.

2003-01-01

The problem of reconstructing functions from their asymptotic expansions in powers of a small variable is addressed by deriving an improved type of approximants. The derivation is based on the self-similar approximation theory, which presents the passage from one approximant to another as the motion realized by a dynamical system with the property of group self-similarity. The derived approximants, because of their form, are called self-similar factor approximants. These complement the obtained earlier self-similar exponential approximants and self-similar root approximants. The specific feature of self-similar factor approximants is that their control functions, providing convergence of the computational algorithm, are completely defined from the accuracy-through-order conditions. These approximants contain the Pade approximants as a particular case, and in some limit they can be reduced to the self-similar exponential approximants previously introduced by two of us. It is proved that the self-similar factor approximants are able to reproduce exactly a wide class of functions, which include a variety of nonalgebraic functions. For other functions, not pertaining to this exactly reproducible class, the factor approximants provide very accurate approximations, whose accuracy surpasses significantly that of the most accurate Pade approximants. This is illustrated by a number of examples showing the generality and accuracy of the factor approximants even when conventional techniques meet serious difficulties

Semantic and phonological coding in poor and normal readers.

Science.gov (United States)

Vellutino, F R; Scanlon, D M; Spearing, D

1995-02-01

Three studies were conducted evaluating semantic and phonological coding deficits as alternative explanations of reading disability. In the first study, poor and normal readers in second and sixth grade were compared on various tests evaluating semantic development as well as on tests evaluating rapid naming and pseudoword decoding as independent measures of phonological coding ability. In a second study, the same subjects were given verbal memory and visual-verbal learning tasks using high and low meaning words as verbal stimuli and Chinese ideographs as visual stimuli. On the semantic tasks, poor readers performed below the level of the normal readers only at the sixth grade level, but, on the rapid naming and pseudoword learning tasks, they performed below the normal readers at the second as well as at the sixth grade level. On both the verbal memory and visual-verbal learning tasks, performance in poor readers approximated that of normal readers when the word stimuli were high in meaning but not when they were low in meaning. These patterns were essentially replicated in a third study that used some of the same semantic and phonological measures used in the first experiment, and verbal memory and visual-verbal learning tasks that employed word lists and visual stimuli (novel alphabetic characters) that more closely approximated those used in learning to read. It was concluded that semantic coding deficits are an unlikely cause of reading difficulties in most poor readers at the beginning stages of reading skills acquisition, but accrue as a consequence of prolonged reading difficulties in older readers. It was also concluded that phonological coding deficits are a probable cause of reading difficulties in most poor readers.

SYN3D: a single-channel, spatial flux synthesis code for diffusion theory calculations

Energy Technology Data Exchange (ETDEWEB)

Adams, C. H.

1976-07-01

This report is a user's manual for SYN3D, a computer code which uses single-channel, spatial flux synthesis to calculate approximate solutions to two- and three-dimensional, finite-difference, multigroup neutron diffusion theory equations. SYN3D is designed to run in conjunction with any one of several one- and two-dimensional, finite-difference codes (required to generate the synthesis expansion functions) currently being used in the fast reactor community. The report describes the theory and equations, the use of the code, and the implementation on the IBM 370/195 and CDC 7600 of the version of SYN3D available through the Argonne Code Center.

Optimized Irregular Low-Density Parity-Check Codes for Multicarrier Modulations over Frequency-Selective Channels

Directory of Open Access Journals (Sweden)

Valérian Mannoni

2004-09-01

Full Text Available This paper deals with optimized channel coding for OFDM transmissions (COFDM over frequency-selective channels using irregular low-density parity-check (LDPC codes. Firstly, we introduce a new characterization of the LDPC code irregularity called “irregularity profile.” Then, using this parameterization, we derive a new criterion based on the minimization of the transmission bit error probability to design an irregular LDPC code suited to the frequency selectivity of the channel. The optimization of this criterion is done using the Gaussian approximation technique. Simulations illustrate the good performance of our approach for different transmission channels.

SYN3D: a single-channel, spatial flux synthesis code for diffusion theory calculations

International Nuclear Information System (INIS)

Adams, C.H.

1976-07-01

This report is a user's manual for SYN3D, a computer code which uses single-channel, spatial flux synthesis to calculate approximate solutions to two- and three-dimensional, finite-difference, multigroup neutron diffusion theory equations. SYN3D is designed to run in conjunction with any one of several one- and two-dimensional, finite-difference codes (required to generate the synthesis expansion functions) currently being used in the fast reactor community. The report describes the theory and equations, the use of the code, and the implementation on the IBM 370/195 and CDC 7600 of the version of SYN3D available through the Argonne Code Center

Coding in pigeons: Multiple-coding versus single-code/default strategies.

Science.gov (United States)

Pinto, Carlos; Machado, Armando

2015-05-01

To investigate the coding strategies that pigeons may use in a temporal discrimination tasks, pigeons were trained on a matching-to-sample procedure with three sample durations (2s, 6s and 18s) and two comparisons (red and green hues). One comparison was correct following 2-s samples and the other was correct following both 6-s and 18-s samples. Tests were then run to contrast the predictions of two hypotheses concerning the pigeons' coding strategies, the multiple-coding and the single-code/default. According to the multiple-coding hypothesis, three response rules are acquired, one for each sample. According to the single-code/default hypothesis, only two response rules are acquired, one for the 2-s sample and a "default" rule for any other duration. In retention interval tests, pigeons preferred the "default" key, a result predicted by the single-code/default hypothesis. In no-sample tests, pigeons preferred the key associated with the 2-s sample, a result predicted by multiple-coding. Finally, in generalization tests, when the sample duration equaled 3.5s, the geometric mean of 2s and 6s, pigeons preferred the key associated with the 6-s and 18-s samples, a result predicted by the single-code/default hypothesis. The pattern of results suggests the need for models that take into account multiple sources of stimulus control. © Society for the Experimental Analysis of Behavior.

Magnetic reconnection under anisotropic magnetohydrodynamic approximation

International Nuclear Information System (INIS)

Hirabayashi, K.; Hoshino, M.

2013-01-01

We study the formation of slow-mode shocks in collisionless magnetic reconnection by using one- and two-dimensional collisionless MHD codes based on the double adiabatic approximation and the Landau closure model. We bridge the gap between the Petschek-type MHD reconnection model accompanied by a pair of slow shocks and the observational evidence of the rare occasion of in-situ slow shock observations. Our results showed that once magnetic reconnection takes place, a firehose-sense (p ∥ >p ⊥ ) pressure anisotropy arises in the downstream region, and the generated slow shocks are quite weak comparing with those in an isotropic MHD. In spite of the weakness of the shocks, however, the resultant reconnection rate is 10%–30% higher than that in an isotropic case. This result implies that the slow shock does not necessarily play an important role in the energy conversion in the reconnection system and is consistent with the satellite observation in the Earth's magnetosphere

A Novel Modified Algorithm with Reduced Complexity LDPC Code Decoder

Directory of Open Access Journals (Sweden)

Song Yang

2014-10-01

Full Text Available A novel efficient decoding algorithm reduced the sum-product algorithm (SPA Complexity with LPDC code is proposed. Base on the hyperbolic tangent rule, modified the Check node update with two horizontal process, which have similar calculation, Motivated by the finding that sun- min (MS algorithm reduce the complexity reducing the approximation error in the horizontal process, simplify the information weight small part. Compared with the exiting approximations, the proposed method is less computational complexity than SPA algorithm. Simulation results show that the author algorithm can achieve performance very close SPA.

Modulated Pade approximant

International Nuclear Information System (INIS)

Ginsburg, C.A.

1980-01-01

In many problems, a desired property A of a function f(x) is determined by the behaviour of f(x) approximately equal to g(x,A) as x→xsup(*). In this letter, a method for resuming the power series in x of f(x) and approximating A (modulated Pade approximant) is presented. This new approximant is an extension of a resumation method for f(x) in terms of rational functions. (author)

Approximate Dynamic Programming: Combining Regional and Local State Following Approximations.

Science.gov (United States)

Deptula, Patryk; Rosenfeld, Joel A; Kamalapurkar, Rushikesh; Dixon, Warren E

2018-06-01

An infinite-horizon optimal regulation problem for a control-affine deterministic system is solved online using a local state following (StaF) kernel and a regional model-based reinforcement learning (R-MBRL) method to approximate the value function. Unlike traditional methods such as R-MBRL that aim to approximate the value function over a large compact set, the StaF kernel approach aims to approximate the value function in a local neighborhood of the state that travels within a compact set. In this paper, the value function is approximated using a state-dependent convex combination of the StaF-based and the R-MBRL-based approximations. As the state enters a neighborhood containing the origin, the value function transitions from being approximated by the StaF approach to the R-MBRL approach. Semiglobal uniformly ultimately bounded (SGUUB) convergence of the system states to the origin is established using a Lyapunov-based analysis. Simulation results are provided for two, three, six, and ten-state dynamical systems to demonstrate the scalability and performance of the developed method.

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)

Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets

KAUST Repository

Litvinenko, Alexander; Sun, Ying; Genton, Marc G.; Keyes, David E.

2017-01-01

The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\H$-) matrix format with computational cost $\\mathcal{O}(k^2n \\log^2 n/p)$ and storage $\\mathcal{O}(kn \\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.

Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets

KAUST Repository

Litvinenko, Alexander

2017-11-01

The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\\\H$-) matrix format with computational cost $\\\\mathcal{O}(k^2n \\\\log^2 n/p)$ and storage $\\\\mathcal{O}(kn \\\\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.

3-D extension C5G7 MOX benchmark calculation using threedant code

International Nuclear Information System (INIS)

Kim, H.Ch.; Han, Ch.Y.; Kim, J.K.; Na, B.Ch.

2005-01-01

It pursued the benchmark on deterministic 3-D MOX fuel assembly transport calculations without spatial homogenization (C5G7 MOX Benchmark Extension). The goal of this benchmark is to provide a more through test results for the abilities of current available 3-D methods to handle the spatial heterogeneities of reactor core. The benchmark requires solutions in the form of normalized pin powers as well as the eigenvalue for each of the control rod configurations; without rod, with A rods, and with B rods. In this work, the DANTSYS code package was applied to analyze the 3-D Extension C5G7 MOX Benchmark problems. The THREEDANT code within the DANTSYS code package, which solves the 3-D transport equation in x-y-z, and r-z-theta geometries, was employed to perform the benchmark calculations. To analyze the benchmark with the THREEDANT code, proper spatial and angular approximations were made. Several calculations were performed to investigate the effects of the different spatial approximations on the accuracy. The results from these sensitivity studies were analyzed and discussed. From the results, it is found that the 4*4 grid per pin cell is sufficiently refined so that very little benefit is obtained by increasing the mesh size. (authors)

Nodes and Codes: The Reality of Cyber Warfare

Science.gov (United States)

2012-05-17

respectively. The avionics in Boeing’s 787 Dreamliner require approximately 6.5 million lines of code while the current S-Class Mercedes Benz requires over 20...leaders (demonstrated through outdated policy, theory, and doctrine) and the reality of warfare in 1914 (dictated by innovation, technology , and...or the guidelines to military action codified in doctrine? How are states using the latest technological innovations as violent instruments of

Optical model calculations with the code ECIS95

Energy Technology Data Exchange (ETDEWEB)

Carlson, B V [Departamento de Fisica, Instituto Tecnologico da Aeronautica, Centro Tecnico Aeroespacial (Brazil)

2001-12-15

The basic features of elastic and inelastic scattering within the framework of the spherical and deformed nuclear optical models are discussed. The calculation of cross sections, angular distributions and other scattering quantities using J. Raynal's code ECIS95 is described. The use of the ECIS method (Equations Couplees en Iterations Sequentielles) in coupled-channels and distorted-wave Born approximation calculations is also reviewed. (author)

Approximate solutions for the two-dimensional integral transport equation. Solution of complex two-dimensional transport problems

International Nuclear Information System (INIS)

Sanchez, Richard.

1980-11-01

This work is divided into two parts: the first part deals with the solution of complex two-dimensional transport problems, the second one (note CEA-N-2166) treats the critically mixed methods of resolution. A set of approximate solutions for the isotropic two-dimensional neutron transport problem has been developed using the interface current formalism. The method has been applied to regular lattices of rectangular cells containing a fuel pin, cladding, and water, or homogenized structural material. The cells are divided into zones that are homogeneous. A zone-wise flux expansion is used to formulate a direct collision probability problem within a cell. The coupling of the cells is effected by making extra assumptions on the currents entering and leaving the interfaces. Two codes have been written: CALLIOPE uses a cylindrical cell model and one or three terms for the flux expansion, and NAUSICAA uses a two-dimensional flux representation and does a truly two-dimensional calculation inside each cell. In both codes, one or three terms can be used to make a space-independent expansion of the angular fluxes entering and leaving each side of the cell. The accuracies and computing times achieved with the different approximations are illustrated by numerical studies on two benchmark problems and by calculations performed in the APOLLO multigroup code [fr

3D code for simulations of fluid flows

International Nuclear Information System (INIS)

Skandera, D.

2004-01-01

In this paper, a present status in the development of the new numerical code is reported. The code is considered for simulations of fluid flows. The finite volume approach is adopted for solving standard fluid equations. They are treated in a conservative form to ensure a correct conservation of fluid quantities. Thus, a nonlinear hyperbolic system of conservation laws is numerically solved. The code uses the Eulerian description of the fluid and is designed as a high order central numerical scheme. The central approach employs no (approximate) Riemann solver and is less computational expensive. The high order WENO strategy is adopted in the reconstruction step to achieve results comparable with more accurate Riemann solvers. A combination of the central approach with an iterative solving of a local Riemann problem is tested and behaviour of such numerical flux is reported. An extension to three dimensions is implemented using a dimension by dimension approach, hence, no complicated dimensional splitting need to be introduced. The code is fully parallelized with the MPI library. Several standard hydrodynamic tests in one, two and three dimensions were performed and their results are presented. (author)

Evaluation Codes from an Affine Veriety Code Perspective

DEFF Research Database (Denmark)

Geil, Hans Olav

2008-01-01

Evaluation codes (also called order domain codes) are traditionally introduced as generalized one-point geometric Goppa codes. In the present paper we will give a new point of view on evaluation codes by introducing them instead as particular nice examples of affine variety codes. Our study...... includes a reformulation of the usual methods to estimate the minimum distances of evaluation codes into the setting of affine variety codes. Finally we describe the connection to the theory of one-pointgeometric Goppa codes. Contents 4.1 Introduction...... . . . . . . . . . . . . . . . . . . . . . . . 171 4.9 Codes form order domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173 4.10 One-point geometric Goppa codes . . . . . . . . . . . . . . . . . . . . . . . . 176 4.11 Bibliographical Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178 References...

CH-TRU Content Codes (CH-TRUCON)

International Nuclear Information System (INIS)

2005-01-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes 'shipping categories' that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the 'General Case,' which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for 'Close-Proximity Shipments' (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for 'Controlled Shipments

CH-TRU Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-10-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

MRPP: multiregion processing plant code

International Nuclear Information System (INIS)

Kee, C.W.; McNeese, L.E.

1976-09-01

The report describes the machine solution of a large number (approximately 52,000) of simultaneous linear algebraic equations in which the unknowns are the concentrations of nuclides in the fuel salt of a fluid-fueled reactor (MSBR) having a continuous fuel processing plant. Most of the equations define concentrations at various points in the processing plant. The code allows as input a generalized description of a processing plant flowsheet; it also performs the iterative adjustment of flowsheet parameters for determination of concentrations throughout the flowsheet, and the associated effect of the specified processing mode on the overall reactor operation

An Optimal Linear Coding for Index Coding Problem

OpenAIRE

Pezeshkpour, Pouya

2015-01-01

An optimal linear coding solution for index coding problem is established. Instead of network coding approach by focus on graph theoric and algebraic methods a linear coding program for solving both unicast and groupcast index coding problem is presented. The coding is proved to be the optimal solution from the linear perspective and can be easily utilize for any number of messages. The importance of this work is lying mostly on the usage of the presented coding in the groupcast index coding ...

Some benchmark calculations for VVER-1000 assemblies by WIMS-7B code

International Nuclear Information System (INIS)

Sultanov, N.V.

2001-01-01

Our aim in this report is to compare of calculation results, obtained with the use of different libraries, which are in the variant of the WIMS7B code. We had the three libraries: the 1986 library is based on the UKNDL files, the two 1996 libraries are based on the JEF-2.2 files, the one having the 69 group approximation, the other having the 172 group approximation. We wanted also to have some acquaintance with the new option of WIMS-7B - CACTUS. The variant of WIMS-7B was placed at our disposal by the code authors for a temporal use for 9 months. It was natural to make at comparisons with analogous values of TVS-M, MCU, Apollo-2, Casmo-4, Conkemo, MCNP, HELIOS codes, where the other different libraries were used. In accordance with our aims the calculations of unprofiled and profiled assemblies of the VVER-1000 reactor have been carried out by the option CACTUS. This option provides calculations by the characteristics method. The calculation results have been compared with the K ∞ values obtained by other codes in work. The conclusion from this analysis is such: the methodical parts of errors of these codes have nearly the same values. Spacing for K eff values can be explained of the library microsections differences mainly. Nevertheless, the more detailed analysis of the results obtained is required. In conclusion the calculation of a depletion of VVER-1000 cell has been carried out. The comparison of the dependency of the multiply factor from the depletion obtained by WIMS-7B with different libraries and by the TVS-M, MCU, HELIOS and WIMS-ABBN codes in work has been performed. (orig.)

Approximate techniques for calculating gamma ray dose rates in nuclear power plants

International Nuclear Information System (INIS)

Lahti, G.P.

1986-01-01

Although today's computers have made three-dimensional discrete ordinates transport codes a virtual reality, there is still a need for approximate techniques for estimating radiation environments. This paper discusses techniques for calculating gamma ray dose rates in nuclear power plants where Compton scattering is the dominant attenuation mechanism. The buildup factor method is reviewed; its use and misuse are discussed. Several useful rules-of-thumb are developed. The paper emphasizes the need for understanding the fundamental physics and draws heavily on the old, classic references

A PC version of the Monte Carlo criticality code OMEGA

International Nuclear Information System (INIS)

Seifert, E.

1996-05-01

A description of the PC version of the Monte Carlo criticality code OMEGA is given. The report contains a general description of the code together with a detailed input description. Furthermore, some examples are given illustrating the generation of an input file. The main field of application is the calculation of the criticality of arrangements of fissionable material. Geometrically complicated arrangements that often appear inside and outside a reactor, e.g. in a fuel storage or transport container, can be considered essentially without geometrical approximations. For example, the real geometry of assemblies containing hexagonal or square lattice structures can be described in full detail. Moreover, the code can be used for special investigations in the field of reactor physics and neutron transport. Many years of practical experience and comparison with reference cases have shown that the code together with the built-in data libraries gives reliable results. OMEGA is completely independent on other widely used criticality codes (KENO, MCNP, etc.), concerning programming and the data base. It is a good practice to run difficult criticality safety problems by different independent codes in order to mutually verify the results. In this way, OMEGA can be used as a redundant code within the family of criticality codes. An advantage of OMEGA is the short calculation time: A typical criticality safety application takes only a few minutes on a Pentium PC. Therefore, the influence of parameter variations can simply be investigated by running many variants of a problem. (orig.)

Analog system for computing sparse codes

Science.gov (United States)

Rozell, Christopher John; Johnson, Don Herrick; Baraniuk, Richard Gordon; Olshausen, Bruno A.; Ortman, Robert Lowell

2010-08-24

A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.

Resonance self-shielding methodology of new neutron transport code STREAM

International Nuclear Information System (INIS)

Choi, Sooyoung; Lee, Hyunsuk; Lee, Deokjung; Hong, Ser Gi

2015-01-01

This paper reports on the development and verification of three new resonance self-shielding methods. The verifications were performed using the new neutron transport code, STREAM. The new methodologies encompass the extension of energy range for resonance treatment, the development of optimum rational approximation, and the application of resonance treatment to isotopes in the cladding region. (1) The extended resonance energy range treatment has been developed to treat the resonances below 4 eV of three resonance isotopes and shows significant improvements in the accuracy of effective cross sections (XSs) in that energy range. (2) The optimum rational approximation can eliminate the geometric limitations of the conventional approach of equivalence theory and can also improve the accuracy of fuel escape probability. (3) The cladding resonance treatment method makes it possible to treat resonances in cladding material which have not been treated explicitly in the conventional methods. These three new methods have been implemented in the new lattice physics code STREAM and the improvement in the accuracy of effective XSs is demonstrated through detailed verification calculations. (author)

Validity of the Aluminum Equivalent Approximation in Space Radiation Shielding

Science.gov (United States)

Badavi, Francis F.; Adams, Daniel O.; Wilson, John W.

2009-01-01

The origin of the aluminum equivalent shield approximation in space radiation analysis can be traced back to its roots in the early years of the NASA space programs (Mercury, Gemini and Apollo) wherein the primary radiobiological concern was the intense sources of ionizing radiation causing short term effects which was thought to jeopardize the safety of the crew and hence the mission. Herein, it is shown that the aluminum equivalent shield approximation, although reasonably well suited for that time period and to the application for which it was developed, is of questionable usefulness to the radiobiological concerns of routine space operations of the 21 st century which will include long stays onboard the International Space Station (ISS) and perhaps the moon. This is especially true for a risk based protection system, as appears imminent for deep space exploration where the long-term effects of Galactic Cosmic Ray (GCR) exposure is of primary concern. The present analysis demonstrates that sufficiently large errors in the interior particle environment of a spacecraft result from the use of the aluminum equivalent approximation, and such approximations should be avoided in future astronaut risk estimates. In this study, the aluminum equivalent approximation is evaluated as a means for estimating the particle environment within a spacecraft structure induced by the GCR radiation field. For comparison, the two extremes of the GCR environment, the 1977 solar minimum and the 2001 solar maximum, are considered. These environments are coupled to the Langley Research Center (LaRC) deterministic ionized particle transport code High charge (Z) and Energy TRaNsport (HZETRN), which propagates the GCR spectra for elements with charges (Z) in the range I aluminum equivalent approximation for a good polymeric shield material such as genetic polyethylene (PE). The shield thickness is represented by a 25 g/cm spherical shell. Although one could imagine the progression to greater

BALDUR: a one-dimensional plasma transport code

International Nuclear Information System (INIS)

Singer, C.E.; Post, D.E.; Mikkelsen, D.R.

1986-07-01

The purpose of BALDUR is to calculate the evolution of plasma parameters in an MHD equilibrium which can be approximated by concentric circular flux surfaces. Transport of up to six species of ionized particles, of electron and ion energy, and of poloidal magnetic flux is computed. A wide variety of source terms are calculated including those due to neutral gas, fusion, and auxiliary heating. The code is primarily designed for modeling tokamak plasmas but could be adapted to other toroidal confinement systems

Estimates of margins in ASME Code strength values for stainless steel nuclear piping

International Nuclear Information System (INIS)

Ware, A.G.

1995-01-01

The margins in the ASME Code stainless steel allowable stress values that can be attributed to the variations in material strength are evaluated for nuclear piping steels. Best-fit curves were calculated for the material test data that were used to determine allowable stress values for stainless steels in the ASME Code, supplemented by more recent data, to estimate the mean stresses. The mean yield stresses (on which the stainless steel S m values are based) from the test data are about 15 to 20% greater than the ASME Code yield stress values. The ASME Code yield stress values are estimated to approximately coincide with the 97% confidence limit from the test data. The mean and 97% confidence limit values can be used in the probabilistic risk assessments of nuclear piping

Calculation of extended shields in the Monte Carlo method using importance function (BRAND and DD code systems)

International Nuclear Information System (INIS)

Androsenko, A.A.; Androsenko, P.A.; Kagalenko, I.Eh.; Mironovich, Yu.N.

1992-01-01

Consideration is given of a technique and algorithms of constructing neutron trajectories in the Monte-Carlo method taking into account the data on adjoint transport equation solution. When simulating the transport part of transfer kernel the use is made of piecewise-linear approximation of free path length density along the particle motion direction. The approach has been implemented in programs within the framework of the BRAND code system. The importance is calculated in the multigroup P 1 -approximation within the framework of the DD-30 code system. The efficiency of the developed computation technique is demonstrated by means of solution of two model problems. 4 refs.; 2 tabs

Flow predictions for MHD channels with an approximation for three-dimensional effects

International Nuclear Information System (INIS)

Blottner, F.G.

1978-01-01

A finite-difference procedure has been formulated for predicting the flow properties across channels. A quasi-two-dimensional approach has been developed which allows the three-dimensional channel effects to be taken into account. Comparison of the numerical solutions with experimental results show that this approach is a reasonable approximation for MHD flow conditions if there is not significant merging of the wall boundary layers. The resulting code provides a technique to obtain the flow details in the symmetry plane of the channel and requires only a small amount of computer time

110 °C range athermalization of wavefront coding infrared imaging systems

Science.gov (United States)

Feng, Bin; Shi, Zelin; Chang, Zheng; Liu, Haizheng; Zhao, Yaohong

2017-09-01

110 °C range athermalization is significant but difficult for designing infrared imaging systems. Our wavefront coding athermalized infrared imaging system adopts an optical phase mask with less manufacturing errors and a decoding method based on shrinkage function. The qualitative experiments prove that our wavefront coding athermalized infrared imaging system has three prominent merits: (1) working well over a temperature range of 110 °C; (2) extending the focal depth up to 15.2 times; (3) achieving a decoded image being approximate to its corresponding in-focus infrared image, with a mean structural similarity index (MSSIM) value greater than 0.85.

Application of the TWODANT code system to pressure vessel dosimetry calculations

International Nuclear Information System (INIS)

Parsons, D.K.; Alcouffe, R.E.; Marr, D.R.; Urban, W.T.

1993-01-01

The TWODANT code system has recently been enhanced to include TWODANT/GQ and THREEDANT. TWODANT/GQ solves the two-dimensional form of the discrete ordinates approximation to the transport equation on a generalized quadrilateral mesh. This geometric capability is very general and allows nearly exact representations of X-Y or R-Z geometries. THREEDANT solves the three-dimensional form of the discrete ordinates equations. In addition to the conventional coarse-mesh material zone input, THREEDANT can also be linked to a three-dimensional nested-region mesh generation code called FRAC-IN-THE-BOX. THREEDANT can thus model a much wider variety of geometric shapes than any other discrete ordinates code. These enhanced geometric modeling capabilities are applied here to the analysis of the VENUS PWR Mock-Up Facility

[INVITED] Luminescent QR codes for smart labelling and sensing

Science.gov (United States)

Ramalho, João F. C. B.; António, L. C. F.; Correia, S. F. H.; Fu, L. S.; Pinho, A. S.; Brites, C. D. S.; Carlos, L. D.; André, P. S.; Ferreira, R. A. S.

2018-05-01

QR (Quick Response) codes are two-dimensional barcodes composed of special geometric patterns of black modules in a white square background that can encode different types of information with high density and robustness, correct errors and physical damages, thus keeping the stored information protected. Recently, these codes have gained increased attention as they offer a simple physical tool for quick access to Web sites for advertising and social interaction. Challenges encompass the increase of the storage capacity limit, even though they can store approximately 350 times more information than common barcodes, and encode different types of characters (e.g., numeric, alphanumeric, kanji and kana). In this work, we fabricate luminescent QR codes based on a poly(methyl methacrylate) substrate coated with organic-inorganic hybrid materials doped with trivalent terbium (Tb3+) and europium (Eu3+) ions, demonstrating the increase of storage capacity per unit area by a factor of two by using the colour multiplexing, when compared to conventional QR codes. A novel methodology to decode the multiplexed QR codes is developed based on a colour separation threshold where a decision level is calculated through a maximum-likelihood criteria to minimize the error probability of the demultiplexed modules, maximizing the foreseen total storage capacity. Moreover, the thermal dependence of the emission colour coordinates of the Eu3+/Tb3+-based hybrids enables the simultaneously QR code colour-multiplexing and may be used to sense temperature (reproducibility higher than 93%), opening new fields of applications for QR codes as smart labels for sensing.

SNR in ultrasonic pluse compression using Golay codes

International Nuclear Information System (INIS)

Kim, Young Hwan; Kim, Young Gil; Jeong, Peter

1994-01-01

The conventional ultrasonic flaw detection system uses a large amplitude narrow pulse to excite a transducer, however, these systems are limited in average transmit power. An excessively large amplitude causes a dielectric breakage of the transducer, and an excessively long pulse cuases decrease of the resolution. Using the pulse compression, a long pulse of psudorandom signal can be used without sacrificing resolution by signal correlation. In the present work, the pulse compression technique was utilized to the ultrasonic system. Golay code was used as a psudorandom signal in this system, since pair sum of auto-correlations has not sidelobe. The equivalent input pulse of the Golay code was proposed to analyze the pulse compression system. In experiment, the material type, material thickness and code length were considered. As results, pulse compression system considerably reduced system's white noise, and approximately 30 dB improvement in SNR was obtained over the conventional ultrasonic system. The technique seems to perform particularly well with highly energy-absorbent materials such as polymers, plastics and rubbers.

Power Allocation Strategies for Distributed Space-Time Codes in Amplify-and-Forward Mode

Directory of Open Access Journals (Sweden)

Are Hjørungnes

2009-01-01

Full Text Available We consider a wireless relay network with Rayleigh fading channels and apply distributed space-time coding (DSTC in amplify-and-forward (AF mode. It is assumed that the relays have statistical channel state information (CSI of the local source-relay channels, while the destination has full instantaneous CSI of the channels. It turns out that, combined with the minimum SNR based power allocation in the relays, AF DSTC results in a new opportunistic relaying scheme, in which the best relay is selected to retransmit the source's signal. Furthermore, we have derived the optimum power allocation between two cooperative transmission phases by maximizing the average received SNR at the destination. Next, assuming M-PSK and M-QAM modulations, we analyze the performance of cooperative diversity wireless networks using AF opportunistic relaying. We also derive an approximate formula for the symbol error rate (SER of AF DSTC. Assuming the use of full-diversity space-time codes, we derive two power allocation strategies minimizing the approximate SER expressions, for constrained transmit power. Our analytical results have been confirmed by simulation results, using full-rate, full-diversity distributed space-time codes.

Rate-adaptive BCH codes for distributed source coding

DEFF Research Database (Denmark)

Salmistraro, Matteo; Larsen, Knud J.; Forchhammer, Søren

2013-01-01

This paper considers Bose-Chaudhuri-Hocquenghem (BCH) codes for distributed source coding. A feedback channel is employed to adapt the rate of the code during the decoding process. The focus is on codes with short block lengths for independently coding a binary source X and decoding it given its...... strategies for improving the reliability of the decoded result are analyzed, and methods for estimating the performance are proposed. In the analysis, noiseless feedback and noiseless communication are assumed. Simulation results show that rate-adaptive BCH codes achieve better performance than low...... correlated side information Y. The proposed codes have been analyzed in a high-correlation scenario, where the marginal probability of each symbol, Xi in X, given Y is highly skewed (unbalanced). Rate-adaptive BCH codes are presented and applied to distributed source coding. Adaptive and fixed checking...

Self-complementary circular codes in coding theory.

Science.gov (United States)

Fimmel, Elena; Michel, Christian J; Starman, Martin; Strüngmann, Lutz

2018-04-01

Self-complementary circular codes are involved in pairing genetic processes. A maximal [Formula: see text] self-complementary circular code X of trinucleotides was identified in genes of bacteria, archaea, eukaryotes, plasmids and viruses (Michel in Life 7(20):1-16 2017, J Theor Biol 380:156-177, 2015; Arquès and Michel in J Theor Biol 182:45-58 1996). In this paper, self-complementary circular codes are investigated using the graph theory approach recently formulated in Fimmel et al. (Philos Trans R Soc A 374:20150058, 2016). A directed graph [Formula: see text] associated with any code X mirrors the properties of the code. In the present paper, we demonstrate a necessary condition for the self-complementarity of an arbitrary code X in terms of the graph theory. The same condition has been proven to be sufficient for codes which are circular and of large size [Formula: see text] trinucleotides, in particular for maximal circular codes ([Formula: see text] trinucleotides). For codes of small-size [Formula: see text] trinucleotides, some very rare counterexamples have been constructed. Furthermore, the length and the structure of the longest paths in the graphs associated with the self-complementary circular codes are investigated. It has been proven that the longest paths in such graphs determine the reading frame for the self-complementary circular codes. By applying this result, the reading frame in any arbitrary sequence of trinucleotides is retrieved after at most 15 nucleotides, i.e., 5 consecutive trinucleotides, from the circular code X identified in genes. Thus, an X motif of a length of at least 15 nucleotides in an arbitrary sequence of trinucleotides (not necessarily all of them belonging to X) uniquely defines the reading (correct) frame, an important criterion for analyzing the X motifs in genes in the future.

Diagonal Eigenvalue Unity (DEU) code for spectral amplitude coding-optical code division multiple access

Science.gov (United States)

Ahmed, Hassan Yousif; Nisar, K. S.

2013-08-01

Code with ideal in-phase cross correlation (CC) and practical code length to support high number of users are required in spectral amplitude coding-optical code division multiple access (SAC-OCDMA) systems. SAC systems are getting more attractive in the field of OCDMA because of its ability to eliminate the influence of multiple access interference (MAI) and also suppress the effect of phase induced intensity noise (PIIN). In this paper, we have proposed new Diagonal Eigenvalue Unity (DEU) code families with ideal in-phase CC based on Jordan block matrix with simple algebraic ways. Four sets of DEU code families based on the code weight W and number of users N for the combination (even, even), (even, odd), (odd, odd) and (odd, even) are constructed. This combination gives DEU code more flexibility in selection of code weight and number of users. These features made this code a compelling candidate for future optical communication systems. Numerical results show that the proposed DEU system outperforms reported codes. In addition, simulation results taken from a commercial optical systems simulator, Virtual Photonic Instrument (VPI™) shown that, using point to multipoint transmission in passive optical network (PON), DEU has better performance and could support long span with high data rate.

List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes

DEFF Research Database (Denmark)

Hernando, Fernando; Høholdt, Tom; Ruano, Diego

2012-01-01

A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list...... decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units....

Nodal kinetics model upgrade in the Penn State coupled TRAC/NEM codes

International Nuclear Information System (INIS)

Beam, Tara M.; Ivanov, Kostadin N.; Baratta, Anthony J.; Finnemann, Herbert

1999-01-01

The Pennsylvania State University currently maintains and does development and verification work for its own versions of the coupled three-dimensional kinetics/thermal-hydraulics codes TRAC-PF1/NEM and TRAC-BF1/NEM. The subject of this paper is nodal model enhancements in the above mentioned codes. Because of the numerous validation studies that have been performed on almost every aspect of these codes, this upgrade is done without a major code rewrite. The upgrade consists of four steps. The first two steps are designed to improve the accuracy of the kinetics model, based on the nodal expansion method. The polynomial expansion solution of 1D transverse integrated diffusion equation is replaced with a solution, which uses a semi-analytic expansion. Further the standard parabolic polynomial representation of the transverse leakage in the above 1D equations is replaced with an improved approximation. The last two steps of the upgrade address the code efficiency by improving the solution of the time-dependent NEM equations and implementing a multi-grid solver. These four improvements are implemented into the standalone NEM kinetics code. Verification of this code was accomplished based on the original verification studies. The results show that the new methods improve the accuracy and efficiency of the code. The verification of the upgraded NEM model in the TRAC-PF1/NEM and TRAC-BF1/NEM coupled codes is underway

Geometric approximation algorithms

CERN Document Server

Har-Peled, Sariel

2011-01-01

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.

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.

Combinatorial neural codes from a mathematical coding theory perspective.

Science.gov (United States)

Curto, Carina; Itskov, Vladimir; Morrison, Katherine; Roth, Zachary; Walker, Judy L

2013-07-01

Shannon's seminal 1948 work gave rise to two distinct areas of research: information theory and mathematical coding theory. While information theory has had a strong influence on theoretical neuroscience, ideas from mathematical coding theory have received considerably less attention. Here we take a new look at combinatorial neural codes from a mathematical coding theory perspective, examining the error correction capabilities of familiar receptive field codes (RF codes). We find, perhaps surprisingly, that the high levels of redundancy present in these codes do not support accurate error correction, although the error-correcting performance of receptive field codes catches up to that of random comparison codes when a small tolerance to error is introduced. However, receptive field codes are good at reflecting distances between represented stimuli, while the random comparison codes are not. We suggest that a compromise in error-correcting capability may be a necessary price to pay for a neural code whose structure serves not only error correction, but must also reflect relationships between stimuli.

Design Aspects of the Rayleigh Convection Code

Science.gov (United States)

Featherstone, N. A.

2017-12-01

Understanding the long-term generation of planetary or stellar magnetic field requires complementary knowledge of the large-scale fluid dynamics pervading large fractions of the object's interior. Such large-scale motions are sensitive to the system's geometry which, in planets and stars, is spherical to a good approximation. As a result, computational models designed to study such systems often solve the MHD equations in spherical geometry, frequently employing a spectral approach involving spherical harmonics. We present computational and user-interface design aspects of one such modeling tool, the Rayleigh convection code, which is suitable for deployment on desktop and petascale-hpc architectures alike. In this poster, we will present an overview of this code's parallel design and its built-in diagnostics-output package. Rayleigh has been developed with NSF support through the Computational Infrastructure for Geodynamics and is expected to be released as open-source software in winter 2017/2018.

LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources

Directory of Open Access Journals (Sweden)

Javier Garcia-Frias

2005-05-01

Full Text Available We propose a coding scheme based on the use of systematic linear codes with low-density generator matrix (LDGM codes for channel coding and joint source-channel coding of multiterminal correlated binary sources. In both cases, the structures of the LDGM encoder and decoder are shown, and a concatenated scheme aimed at reducing the error floor is proposed. Several decoding possibilities are investigated, compared, and evaluated. For different types of noisy channels and correlation models, the resulting performance is very close to the theoretical limits.

Sparse approximation with bases

CERN Document Server

2015-01-01

This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

Write up of the codes for microscopic models of NN and NA scattering

International Nuclear Information System (INIS)

Amos, K.

1998-01-01

This report documents the essential details of the NN and NA computer programs that culminate in the prediction of elastic and inelastic nucleon scattering observables form optical potentials generated by full folding and effective NN interaction within the nuclear medium. That same (energy and density dependent) effective interaction is used as the transition operator in the distorted wave approximation (DWA) for inelastic (and charge exchange) nucleon scattering from nuclei. The report consists of four sections: 1) general remarks and program locations, 2) the t- and g-matrix codes and how to use them, 3) the effective interaction codes and how to use them, and 4) the NA codes, DWBA97 and DWBB97 and how to use them. (author)

Rayleigh scatter in kilovoltage x-ray imaging: is the independent atom approximation good enough?

OpenAIRE

Poludniowski, G; Evans, PM; Webb, S

2009-01-01

Monte Carlo simulation is the gold standard method for modelling scattering processes in medical x-ray imaging. General-purpose Monte Carlo codes, however, typically use the independent atom approximation (IAA). This is known to be inaccurate for Rayleigh scattering, for many materials, in the forward direction. This work addresses whether the IAA is sufficient for the typical modelling tasks in medical kilovoltage x-ray imaging. As a means of comparison, we incorporate a more realistic 'inte...

CH-TRU Waste Content Codes (CH-TRUCON)

International Nuclear Information System (INIS)

2007-01-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes 'shipping categories' that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the 'General Case,' which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for 'Close-Proximity Shipments' (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for 'Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

International Nuclear Information System (INIS)

2006-01-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes 'shipping categories' that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the 'General Case,' which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for 'Close-Proximity Shipments' (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for 'Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

International Nuclear Information System (INIS)

2005-01-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes 'shipping categories' that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the 'General Case,' which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for 'Close-Proximity Shipments' (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for 'Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

International Nuclear Information System (INIS)

2004-01-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes 'shipping categories' that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the 'General Case,' which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for 'Close-Proximity Shipments' (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for 'Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

International Nuclear Information System (INIS)

2008-01-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes 'shipping categories' that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the 'General Case,' which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for 'Close-Proximity Shipments' (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for 'Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2006-09-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-05-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2007-02-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-06-20

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2006-06-20

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2006-12-20

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2006-08-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2006-01-18

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2004-10-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-03-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2007-09-20

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2007-08-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2004-12-01

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-11-20

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-12-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-01-30

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-08-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2007-06-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codes and corresponding shipping categories for "Controlled Shipments

Software Certification - Coding, Code, and Coders

Science.gov (United States)

Havelund, Klaus; Holzmann, Gerard J.

2011-01-01

We describe a certification approach for software development that has been adopted at our organization. JPL develops robotic spacecraft for the exploration of the solar system. The flight software that controls these spacecraft is considered to be mission critical. We argue that the goal of a software certification process cannot be the development of "perfect" software, i.e., software that can be formally proven to be correct under all imaginable and unimaginable circumstances. More realistically, the goal is to guarantee a software development process that is conducted by knowledgeable engineers, who follow generally accepted procedures to control known risks, while meeting agreed upon standards of workmanship. We target three specific issues that must be addressed in such a certification procedure: the coding process, the code that is developed, and the skills of the coders. The coding process is driven by standards (e.g., a coding standard) and tools. The code is mechanically checked against the standard with the help of state-of-the-art static source code analyzers. The coders, finally, are certified in on-site training courses that include formal exams.

Thermal-Hydraulic System Codes in Nulcear Reactor Safety and Qualification Procedures

Directory of Open Access Journals (Sweden)

Alessandro Petruzzi

2008-01-01

Full Text Available In the last four decades, large efforts have been undertaken to provide reliable thermal-hydraulic system codes for the analyses of transients and accidents in nuclear power plants. Whereas the first system codes, developed at the beginning of the 1970s, utilized the homogenous equilibrium model with three balance equations to describe the two-phase flow, nowadays the more advanced system codes are based on the so-called “two-fluid model” with separation of the water and vapor phases, resulting in systems with at least six balance equations. The wide experimental campaign, constituted by the integral and separate effect tests, conducted under the umbrella of the OECD/CSNI was at the basis of the development and validation of the thermal-hydraulic system codes by which they have reached the present high degree of maturity. However, notwithstanding the huge amounts of financial and human resources invested, the results predicted by the code are still affected by errors whose origins can be attributed to several reasons as model deficiencies, approximations in the numerical solution, nodalization effects, and imperfect knowledge of boundary and initial conditions. In this context, the existence of qualified procedures for a consistent application of qualified thermal-hydraulic system code is necessary and implies the drawing up of specific criteria through which the code-user, the nodalization, and finally the transient results are qualified.

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.

Sensitivity Analysis of FEAST-Metal Fuel Performance Code: Initial Results

International Nuclear Information System (INIS)

Edelmann, Paul Guy; Williams, Brian J.; Unal, Cetin; Yacout, Abdellatif

2012-01-01

This memo documents the completion of the LANL milestone, M3FT-12LA0202041, describing methodologies and initial results using FEAST-Metal. The FEAST-Metal code calculations for this work are being conducted at LANL in support of on-going activities related to sensitivity analysis of fuel performance codes. The objective is to identify important macroscopic parameters of interest to modeling and simulation of metallic fuel performance. This report summarizes our preliminary results for the sensitivity analysis using 6 calibration datasets for metallic fuel developed at ANL for EBR-II experiments. Sensitivity ranking methodology was deployed to narrow down the selected parameters for the current study. There are approximately 84 calibration parameters in the FEAST-Metal code, of which 32 were ultimately used in Phase II of this study. Preliminary results of this sensitivity analysis led to the following ranking of FEAST models for future calibration and improvements: fuel conductivity, fission gas transport/release, fuel creep, and precipitation kinetics. More validation data is needed to validate calibrated parameter distributions for future uncertainty quantification studies with FEAST-Metal. Results of this study also served to point out some code deficiencies and possible errors, and these are being investigated in order to determine root causes and to improve upon the existing code models.

Approximate calculational techniques for radiation protection applications (collection of papers presented at the November 1985 American Nuclear Society meeting)

Energy Technology Data Exchange (ETDEWEB)

Rice, A.F.; Roussin, R.W. (comps.)

1986-09-01

Although radiation protection principles are, on the whole, well understood and a whole series of computer codes exist for their solution, it is felt that there is a need for practical, approximate techniques to be used by the practicing nuclear engineer for a variety of applications. Within the context of approximate techniques, the papers presented cover a broad overview of specific problems, for example, skyshine and penetration analysis, with applications extending from general nuclear reactor design to spent fuel storage and fusion. Separate abstracts have been prepared for individual papers.

Approximating distributions from moments

Science.gov (United States)

Pawula, R. F.

1987-11-01

A method based upon Pearson-type approximations from statistics is developed for approximating a symmetric probability density function from its moments. The extended Fokker-Planck equation for non-Markov processes is shown to be the underlying foundation for the approximations. The approximation is shown to be exact for the beta probability density function. The applicability of the general method is illustrated by numerous pithy examples from linear and nonlinear filtering of both Markov and non-Markov dichotomous noise. New approximations are given for the probability density function in two cases in which exact solutions are unavailable, those of (i) the filter-limiter-filter problem and (ii) second-order Butterworth filtering of the random telegraph signal. The approximate results are compared with previously published Monte Carlo simulations in these two cases.

Predictions of the thermomechanical code ''RESTA'' compared with fuel element examinations after irradiation in the BR3 reactor

International Nuclear Information System (INIS)

Petitgrand, S.

1980-01-01

A large number of fuel rods have been irradiated in the small power plant BR3. Many of them have been examined in hot cells after irradiation, giving thus valuable experimental information. On the other hand a thermomechanical code, named RESTA, has been developed by the C.E.A. to describe and predict the behaviour of a fuel pin in a PWR environment and in stationary conditions. The models used in that code derive chiefly from the C.E.A.'s own experience and are briefly reviewed in this paper. The comparison between prediction and experience has been performed for four power history classes: (1) moderate (average linear rating approximately equal to 20 kw m -1 ) and short (approximately equal to 300 days) rating, (2) moderate (approximately equal to 20 kw m -1 ) and long (approximately equal to 600 days) rating, (3) high (25-30 kw m -1 ) and long (approximately equal to 600 days) rating and (4) very high (30-40 kw m -1 ) and long (approximately equal to 600 days) rating. Satisfactory agreement has been found between experimental and calculated results in all cases, concerning fuel structural change, fission gas release, pellet-clad interaction as well as clad permanent strain. (author)

HOTSPOT Health Physics codes for the PC

Energy Technology Data Exchange (ETDEWEB)

Homann, S.G.

1994-03-01

The HOTSPOT Health Physics codes were created to provide Health Physics personnel with a fast, field-portable calculation tool for evaluating accidents involving radioactive materials. HOTSPOT codes are a first-order approximation of the radiation effects associated with the atmospheric release of radioactive materials. HOTSPOT programs are reasonably accurate for a timely initial assessment. More importantly, HOTSPOT codes produce a consistent output for the same input assumptions and minimize the probability of errors associated with reading a graph incorrectly or scaling a universal nomogram during an emergency. The HOTSPOT codes are designed for short-term (less than 24 hours) release durations. Users requiring radiological release consequences for release scenarios over a longer time period, e.g., annual windrose data, are directed to such long-term models as CAPP88-PC (Parks, 1992). Users requiring more sophisticated modeling capabilities, e.g., complex terrain; multi-location real-time wind field data; etc., are directed to such capabilities as the Department of Energy`s ARAC computer codes (Sullivan, 1993). Four general programs -- Plume, Explosion, Fire, and Resuspension -- calculate a downwind assessment following the release of radioactive material resulting from a continuous or puff release, explosive release, fuel fire, or an area contamination event. Other programs deal with the release of plutonium, uranium, and tritium to expedite an initial assessment of accidents involving nuclear weapons. Additional programs estimate the dose commitment from the inhalation of any one of the radionuclides listed in the database of radionuclides; calibrate a radiation survey instrument for ground-survey measurements; and screen plutonium uptake in the lung (see FIDLER Calibration and LUNG Screening sections).

HOTSPOT Health Physics codes for the PC

International Nuclear Information System (INIS)

Homann, S.G.

1994-03-01

The HOTSPOT Health Physics codes were created to provide Health Physics personnel with a fast, field-portable calculation tool for evaluating accidents involving radioactive materials. HOTSPOT codes are a first-order approximation of the radiation effects associated with the atmospheric release of radioactive materials. HOTSPOT programs are reasonably accurate for a timely initial assessment. More importantly, HOTSPOT codes produce a consistent output for the same input assumptions and minimize the probability of errors associated with reading a graph incorrectly or scaling a universal nomogram during an emergency. The HOTSPOT codes are designed for short-term (less than 24 hours) release durations. Users requiring radiological release consequences for release scenarios over a longer time period, e.g., annual windrose data, are directed to such long-term models as CAPP88-PC (Parks, 1992). Users requiring more sophisticated modeling capabilities, e.g., complex terrain; multi-location real-time wind field data; etc., are directed to such capabilities as the Department of Energy's ARAC computer codes (Sullivan, 1993). Four general programs -- Plume, Explosion, Fire, and Resuspension -- calculate a downwind assessment following the release of radioactive material resulting from a continuous or puff release, explosive release, fuel fire, or an area contamination event. Other programs deal with the release of plutonium, uranium, and tritium to expedite an initial assessment of accidents involving nuclear weapons. Additional programs estimate the dose commitment from the inhalation of any one of the radionuclides listed in the database of radionuclides; calibrate a radiation survey instrument for ground-survey measurements; and screen plutonium uptake in the lung (see FIDLER Calibration and LUNG Screening sections)

Characterization and Optimization of LDPC Codes for the 2-User Gaussian Multiple Access Channel

Directory of Open Access Journals (Sweden)

Declercq David

2007-01-01

Full Text Available We address the problem of designing good LDPC codes for the Gaussian multiple access channel (MAC. The framework we choose is to design multiuser LDPC codes with joint belief propagation decoding on the joint graph of the 2-user case. Our main result compared to existing work is to express analytically EXIT functions of the multiuser decoder with two different approximations of the density evolution. This allows us to propose a very simple linear programming optimization for the complicated problem of LDPC code design with joint multiuser decoding. The stability condition for our case is derived and used in the optimization constraints. The codes that we obtain for the 2-user case are quite good for various rates, especially if we consider the very simple optimization procedure.

General Rytov approximation.

Science.gov (United States)

Potvin, Guy

2015-10-01

We examine how the Rytov approximation describing log-amplitude and phase fluctuations of a wave propagating through weak uniform turbulence can be generalized to the case of turbulence with a large-scale nonuniform component. We show how the large-scale refractive index field creates Fermat rays using the path integral formulation for paraxial propagation. We then show how the second-order derivatives of the Fermat ray action affect the Rytov approximation, and we discuss how a numerical algorithm would model the general Rytov approximation.

A 3D coarse-mesh time dependent code for nuclear reactor kinetic calculations

International Nuclear Information System (INIS)

Montagnini, B.; Raffaelli, P.; Sumini, M.; Zardini, D.M.

1996-01-01

A course-mesh code for time-dependent multigroup neutron diffusion calculation based on a direct integration scheme for the time dependence and a low order nodal flux expansion approximation for the space variables has been implemented as a fast tool for transient analysis. (Author)

Rayleigh scatter in kilovoltage x-ray imaging: is the independent atom approximation good enough?

Science.gov (United States)

Poludniowski, G.; Evans, P. M.; Webb, S.

2009-11-01

Monte Carlo simulation is the gold standard method for modelling scattering processes in medical x-ray imaging. General-purpose Monte Carlo codes, however, typically use the independent atom approximation (IAA). This is known to be inaccurate for Rayleigh scattering, for many materials, in the forward direction. This work addresses whether the IAA is sufficient for the typical modelling tasks in medical kilovoltage x-ray imaging. As a means of comparison, we incorporate a more realistic 'interference function' model into a custom-written Monte Carlo code. First, we conduct simulations of scatter from isolated voxels of soft tissue, adipose, cortical bone and spongiosa. Then, we simulate scatter profiles from a cylinder of water and from phantoms of a patient's head, thorax and pelvis, constructed from diagnostic-quality CT data sets. Lastly, we reconstruct CT numbers from simulated sets of projection images and investigate the quantitative effects of the approximation. We show that the IAA can produce errors of several per cent of the total scatter, across a projection image, for typical x-ray beams and patients. The errors in reconstructed CT number, however, for the phantoms simulated, were small (typically < 10 HU). The IAA can therefore be considered sufficient for the modelling of scatter correction in CT imaging. Where accurate quantitative estimates of scatter in individual projection images are required, however, the appropriate interference functions should be included.

New quantum codes constructed from quaternary BCH codes

Science.gov (United States)

Xu, Gen; Li, Ruihu; Guo, Luobin; Ma, Yuena

2016-10-01

In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183-1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert-Varshamov bound for linear quantum codes.

Entanglement-assisted quantum MDS codes from negacyclic codes

Science.gov (United States)

Lu, Liangdong; Li, Ruihu; Guo, Luobin; Ma, Yuena; Liu, Yang

2018-03-01

The entanglement-assisted formalism generalizes the standard stabilizer formalism, which can transform arbitrary classical linear codes into entanglement-assisted quantum error-correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this work, we construct six classes of q-ary entanglement-assisted quantum MDS (EAQMDS) codes based on classical negacyclic MDS codes by exploiting two or more pre-shared maximally entangled states. We show that two of these six classes q-ary EAQMDS have minimum distance more larger than q+1. Most of these q-ary EAQMDS codes are new in the sense that their parameters are not covered by the codes available in the literature.

VAMPIR - A two-group two-dimensional diffusion computer code for burnup calculation

International Nuclear Information System (INIS)

Zmijarevic, I.; Petrovic, I.

1985-01-01

VAMPIR is a computer code which simulates the burnup within a reactor coe. It computes the neutron flux, power distribution and burnup taking into account spatial variations of temperature and xenon poisoning. Its overall reactor calculation uses diffusion theory with finite differences approximation in X-Y or R-Z geometry. Two-group macroscopic cross section data are prepared by the lattice cell code WIMS-D4 and stored in the library form of multi entry tabulation against the various parameters that significantly affect the physical conditions in the reactor core. herein, the main features of the program are presented. (author)

Visualizing code and coverage changes for code review

NARCIS (Netherlands)

Oosterwaal, Sebastiaan; van Deursen, A.; De Souza Coelho, R.; Sawant, A.A.; Bacchelli, A.

2016-01-01

One of the tasks of reviewers is to verify that code modifications are well tested. However, current tools offer little support in understanding precisely how changes to the code relate to changes to the tests. In particular, it is hard to see whether (modified) test code covers the changed code.

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.

SPECTRAL AMPLITUDE CODING OCDMA SYSTEMS USING ENHANCED DOUBLE WEIGHT CODE

Directory of Open Access Journals (Sweden)

F.N. HASOON

2006-12-01

Full Text Available A new code structure for spectral amplitude coding optical code division multiple access systems based on double weight (DW code families is proposed. The DW has a fixed weight of two. Enhanced double-weight (EDW code is another variation of a DW code family that can has a variable weight greater than one. The EDW code possesses ideal cross-correlation properties and exists for every natural number n. A much better performance can be provided by using the EDW code compared to the existing code such as Hadamard and Modified Frequency-Hopping (MFH codes. It has been observed that theoretical analysis and simulation for EDW is much better performance compared to Hadamard and Modified Frequency-Hopping (MFH codes.

Development status of the lattice physics code in COSINE project

Energy Technology Data Exchange (ETDEWEB)

Chen, Y.; Yu, H.; Li, S.; Liu, Z.; Yan, Y. [State Nuclear Power Software Development Center, SNPTC, National Energy Key Laboratory of Nuclear Power Software NEKLS, North Third Ring Road, Beijing 100029 (China)

2013-07-01

LATC is an essential part of COSINE code package, which stands for Core and System Integrated Engine for design and analysis. LATC performs 2D multi-group assembly transport calculation and generates few group constants and the required cross-section data for CORE, the core simulator code. LATC is designed to have the capability of modeling the API 000 series assemblies. The development is a continuously improved process. Currently, LATC uses well-proven technology to achieve the key functions. In the next stage, more advanced methods and modules will be implemented. At present, WIMS and WIMS improved format library could be read in LATC code. For resonance calculation, equivalent relation with rational approximations is utilized. For transport calculation, two options are available. One choice is collision probability method in cell homogenization while discrete coordinate method in assembly homogenization, the other is method of characteristics in assembly homogenization directly. For depletion calculation, an improved linear rate 'constant power' depletion method has been developed. (authors)

Development status of the lattice physics code in COSINE project

International Nuclear Information System (INIS)

Chen, Y.; Yu, H.; Li, S.; Liu, Z.; Yan, Y.

2013-01-01

LATC is an essential part of COSINE code package, which stands for Core and System Integrated Engine for design and analysis. LATC performs 2D multi-group assembly transport calculation and generates few group constants and the required cross-section data for CORE, the core simulator code. LATC is designed to have the capability of modeling the API 000 series assemblies. The development is a continuously improved process. Currently, LATC uses well-proven technology to achieve the key functions. In the next stage, more advanced methods and modules will be implemented. At present, WIMS and WIMS improved format library could be read in LATC code. For resonance calculation, equivalent relation with rational approximations is utilized. For transport calculation, two options are available. One choice is collision probability method in cell homogenization while discrete coordinate method in assembly homogenization, the other is method of characteristics in assembly homogenization directly. For depletion calculation, an improved linear rate 'constant power' depletion method has been developed. (authors)

Optimizing the ATLAS code with different profilers

CERN Document Server

Kama, S; The ATLAS collaboration

2013-01-01

After the current maintenance period, the LHC will provide higher energy collisions with increased luminosity. In order to keep up with these higher rates, ATLAS software needs to speed up substantially. However, ATLAS code is composed of approximately 4M lines, written by many different programmers with different backgrounds, which makes code optimisation a challenge. To help with this effort different profiling tools and techniques are being used. These include well known tools, such as the Valgrind suite and Intel Amplifier; less common tools like PIN, PAPI, and GOODA; as well as techniques such as library interposing. In this talk we will mainly focus on PIN tools and GOODA. PIN is a dynamic binary instrumentation tool which can obtain statistics such as call counts, instruction counts and interrogate functions' arguments. It has been used to obtain CLHEP Matrix profiles, operations and vector sizes for linear algebra calculations which has provided the insight necessary to achieve significant performance...

Modelling RF sources using 2-D PIC codes

Energy Technology Data Exchange (ETDEWEB)

Eppley, K.R.

1993-03-01

In recent years, many types of RF sources have been successfully modelled using 2-D PIC codes. Both cross field devices (magnetrons, cross field amplifiers, etc.) and pencil beam devices (klystrons, gyrotrons, TWT'S, lasertrons, etc.) have been simulated. All these devices involve the interaction of an electron beam with an RF circuit. For many applications, the RF structure may be approximated by an equivalent circuit, which appears in the simulation as a boundary condition on the electric field ( port approximation''). The drive term for the circuit is calculated from the energy transfer between beam and field in the drift space. For some applications it may be necessary to model the actual geometry of the structure, although this is more expensive. One problem not entirely solved is how to accurately model in 2-D the coupling to an external waveguide. Frequently this is approximated by a radial transmission line, but this sometimes yields incorrect results. We also discuss issues in modelling the cathode and injecting the beam into the PIC simulation.

Modelling RF sources using 2-D PIC codes

Energy Technology Data Exchange (ETDEWEB)

Eppley, K.R.

1993-03-01

In recent years, many types of RF sources have been successfully modelled using 2-D PIC codes. Both cross field devices (magnetrons, cross field amplifiers, etc.) and pencil beam devices (klystrons, gyrotrons, TWT`S, lasertrons, etc.) have been simulated. All these devices involve the interaction of an electron beam with an RF circuit. For many applications, the RF structure may be approximated by an equivalent circuit, which appears in the simulation as a boundary condition on the electric field (``port approximation``). The drive term for the circuit is calculated from the energy transfer between beam and field in the drift space. For some applications it may be necessary to model the actual geometry of the structure, although this is more expensive. One problem not entirely solved is how to accurately model in 2-D the coupling to an external waveguide. Frequently this is approximated by a radial transmission line, but this sometimes yields incorrect results. We also discuss issues in modelling the cathode and injecting the beam into the PIC simulation.

Modelling RF sources using 2-D PIC codes

International Nuclear Information System (INIS)

Eppley, K.R.

1993-03-01

In recent years, many types of RF sources have been successfully modelled using 2-D PIC codes. Both cross field devices (magnetrons, cross field amplifiers, etc.) and pencil beam devices (klystrons, gyrotrons, TWT'S, lasertrons, etc.) have been simulated. All these devices involve the interaction of an electron beam with an RF circuit. For many applications, the RF structure may be approximated by an equivalent circuit, which appears in the simulation as a boundary condition on the electric field (''port approximation''). The drive term for the circuit is calculated from the energy transfer between beam and field in the drift space. For some applications it may be necessary to model the actual geometry of the structure, although this is more expensive. One problem not entirely solved is how to accurately model in 2-D the coupling to an external waveguide. Frequently this is approximated by a radial transmission line, but this sometimes yields incorrect results. We also discuss issues in modelling the cathode and injecting the beam into the PIC simulation

Computational modeling for the angular reconstruction of monoenergetic neutron flux in non-multiplying slabs using synthetic diffusion approximation

International Nuclear Information System (INIS)

Mansur, Ralph S.; Barros, Ricardo C.

2011-01-01

We describe a method to determine the neutron scalar flux in a slab using monoenergetic diffusion model. To achieve this goal we used three ingredients in the computational code that we developed on the Scilab platform: a spectral nodal method that generates numerical solution for the one-speed slab-geometry fixed source diffusion problem with no spatial truncation errors; a spatial reconstruction scheme to yield detailed profile of the coarse-mesh solution; and an angular reconstruction scheme to yield approximately the neutron angular flux profile at a given location of the slab migrating in a given direction. Numerical results are given to illustrate the efficiency of the offered code. (author)

Technical notes. Rational approximations for cross-section space-shielding in doubly heterogeneous systems

International Nuclear Information System (INIS)

Stamatelatos, M.G.

1976-01-01

A simple yet accurate method of space-shielding cross sections in a doubly heterogeneous high-temperature gas-cooled reactor (HTGR) system using collision probabilities and rational approximations is presented. Unlike other more elaborate methods, this method does not require point-wise cross sections that are not explicitly generated in most popular cross-section codes. Consequently, this method makes double heterogeneity space-shielding possible for cross-section codes that do not proceed via point-wise cross sections and that usually allow only for single (fuel-rod) heterogeneity cross-section space-shielding. Results of calculations based on this method compare well with results of calculations based on more elaborate methods using point-wise cross sections. Moreover, the systematic trend of the difference between the results from this method and those from the more elaborate methods used for comparison supports the already existent opinion that the latter methods tend to overestimate the space-shielding cross-section correction in doubly heterogeneous HTGR systems

Fractal Image Coding Based on a Fitting Surface

Directory of Open Access Journals (Sweden)

Sheng Bi

2014-01-01

Full Text Available A no-search fractal image coding method based on a fitting surface is proposed. In our research, an improved gray-level transform with a fitting surface is introduced. One advantage of this method is that the fitting surface is used for both the range and domain blocks and one set of parameters can be saved. Another advantage is that the fitting surface can approximate the range and domain blocks better than the previous fitting planes; this can result in smaller block matching errors and better decoded image quality. Since the no-search and quadtree techniques are adopted, smaller matching errors also imply less number of blocks matching which results in a faster encoding process. Moreover, by combining all the fitting surfaces, a fitting surface image (FSI is also proposed to speed up the fractal decoding. Experiments show that our proposed method can yield superior performance over the other three methods. Relative to range-averaged image, FSI can provide faster fractal decoding process. Finally, by combining the proposed fractal coding method with JPEG, a hybrid coding method is designed which can provide higher PSNR than JPEG while maintaining the same Bpp.

Hierarchical differences in population coding within auditory cortex.

Science.gov (United States)

Downer, Joshua D; Niwa, Mamiko; Sutter, Mitchell L

2017-08-01

Most models of auditory cortical (AC) population coding have focused on primary auditory cortex (A1). Thus our understanding of how neural coding for sounds progresses along the cortical hierarchy remains obscure. To illuminate this, we recorded from two AC fields: A1 and middle lateral belt (ML) of rhesus macaques. We presented amplitude-modulated (AM) noise during both passive listening and while the animals performed an AM detection task ("active" condition). In both fields, neurons exhibit monotonic AM-depth tuning, with A1 neurons mostly exhibiting increasing rate-depth functions and ML neurons approximately evenly distributed between increasing and decreasing functions. We measured noise correlation ( r noise ) between simultaneously recorded neurons and found that whereas engagement decreased average r noise in A1, engagement increased average r noise in ML. This finding surprised us, because attentive states are commonly reported to decrease average r noise We analyzed the effect of r noise on AM coding in both A1 and ML and found that whereas engagement-related shifts in r noise in A1 enhance AM coding, r noise shifts in ML have little effect. These results imply that the effect of r noise differs between sensory areas, based on the distribution of tuning properties among the neurons within each population. A possible explanation of this is that higher areas need to encode nonsensory variables (e.g., attention, choice, and motor preparation), which impart common noise, thus increasing r noise Therefore, the hierarchical emergence of r noise -robust population coding (e.g., as we observed in ML) enhances the ability of sensory cortex to integrate cognitive and sensory information without a loss of sensory fidelity. NEW & NOTEWORTHY Prevailing models of population coding of sensory information are based on a limited subset of neural structures. An important and under-explored question in neuroscience is how distinct areas of sensory cortex differ in their

Approximation techniques for engineers

CERN Document Server

Komzsik, Louis

2006-01-01

Presenting numerous examples, algorithms, and industrial applications, Approximation Techniques for Engineers is your complete guide to the major techniques used in modern engineering practice. Whether you need approximations for discrete data of continuous functions, or you''re looking for approximate solutions to engineering problems, everything you need is nestled between the covers of this book. Now you can benefit from Louis Komzsik''s years of industrial experience to gain a working knowledge of a vast array of approximation techniques through this complete and self-contained resource.

International Conference Approximation Theory XV

CERN Document Server

Schumaker, Larry

2017-01-01

These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22–25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, a...

Structural dynamics in LMFBR containment analysis: a brief survey of computational methods and codes

International Nuclear Information System (INIS)

Chang, Y.W.; Gvildys, J.

1977-01-01

In recent years, the use of computer codes to study the response of primary containment of large, liquid-metal fast breeder reactors (LMFBR) under postulated accident conditions has been adopted by most fast reactor projects. Since the first introduction of REXCO-H containment code in 1969, a number of containment codes have evolved and been reported in the literature. The paper briefly summarizes the various numerical methods commonly used in containment analysis in computer programs. They are compared on the basis of truncation errors resulting in the numerical approximation, the method of integration, the resolution of the computed results, and the ease of programming in computer codes. The aim of the paper is to provide enough information to an analyst so that he can suitably define his choice of method, and hence his choice of programs

DLLExternalCode

Energy Technology Data Exchange (ETDEWEB)

2014-05-14

DLLExternalCode is the a general dynamic-link library (DLL) interface for linking GoldSim (www.goldsim.com) with external codes. The overall concept is to use GoldSim as top level modeling software with interfaces to external codes for specific calculations. The DLLExternalCode DLL that performs the linking function is designed to take a list of code inputs from GoldSim, create an input file for the external application, run the external code, and return a list of outputs, read from files created by the external application, back to GoldSim. Instructions for creating the input file, running the external code, and reading the output are contained in an instructions file that is read and interpreted by the DLL.

High efficiency video coding coding tools and specification

CERN Document Server

Wien, Mathias

2015-01-01

The video coding standard High Efficiency Video Coding (HEVC) targets at improved compression performance for video resolutions of HD and beyond, providing Ultra HD video at similar compressed bit rates as for HD video encoded with the well-established video coding standard H.264 | AVC. Based on known concepts, new coding structures and improved coding tools have been developed and specified in HEVC. The standard is expected to be taken up easily by established industry as well as new endeavors, answering the needs of todays connected and ever-evolving online world. This book presents the High Efficiency Video Coding standard and explains it in a clear and coherent language. It provides a comprehensive and consistently written description, all of a piece. The book targets at both, newbies to video coding as well as experts in the field. While providing sections with introductory text for the beginner, it suits as a well-arranged reference book for the expert. The book provides a comprehensive reference for th...

Analysis of the anisotropy effects with the AZTRAN code

International Nuclear Information System (INIS)

Xolocostli, V.; Vargas, S.; Gomez, A.; Del Valle, E.

2017-09-01

Among the improvements that are made for the deterministic codes with which nuclear reactors are analyzed, is the implementation of the dispersion anisotropic dispersion section, which can obtain better results. With the current computing technology is possible to carry out these implementations, since the computation time is no longer a considerable problem as in the past. In this paper we analyze some effects of anisotropy in the AZTRAN code, a code that solves the Boltzmann transport equation in one, two and three dimensions at steady state, using the multigroup technique, the nodal method RTN-0 and ordered discrete, which is part of the AZTLAN platform for analysis of nuclear reactors, which is currently under development. The implementation of the anisotropy in the AZTRAN code is one of the latest improvements that have been made to the code, leading to different tests and analyzes regarding the anisotropic dispersion, some as a test with homogeneous fuel assemblies. In the case presented here, the benchmark problem of a fuel assembly type BWR is analyzed, which is part of the Benchmark problem suite for reactor physics study of LWR next generation fuels, proposed by the Committee on Reactor Physics organized by the Japan Atomic Energy Research Institute (JAERI). In this problem the behavior of the infinite multiplication factor (k inf ) is analyzed, as well as the behavior of using odd and even anisotropy approximation with respect to the symmetry in the radial power of the assembly. (Author)

A hybrid gyrokinetic ion and isothermal electron fluid code for astrophysical plasma

Science.gov (United States)

Kawazura, Y.; Barnes, M.

2018-05-01

This paper describes a new code for simulating astrophysical plasmas that solves a hybrid model composed of gyrokinetic ions (GKI) and an isothermal electron fluid (ITEF) Schekochihin et al. (2009) [9]. This model captures ion kinetic effects that are important near the ion gyro-radius scale while electron kinetic effects are ordered out by an electron-ion mass ratio expansion. The code is developed by incorporating the ITEF approximation into AstroGK, an Eulerian δf gyrokinetics code specialized to a slab geometry Numata et al. (2010) [41]. The new code treats the linear terms in the ITEF equations implicitly while the nonlinear terms are treated explicitly. We show linear and nonlinear benchmark tests to prove the validity and applicability of the simulation code. Since the fast electron timescale is eliminated by the mass ratio expansion, the Courant-Friedrichs-Lewy condition is much less restrictive than in full gyrokinetic codes; the present hybrid code runs ∼ 2√{mi /me } ∼ 100 times faster than AstroGK with a single ion species and kinetic electrons where mi /me is the ion-electron mass ratio. The improvement of the computational time makes it feasible to execute ion scale gyrokinetic simulations with a high velocity space resolution and to run multiple simulations to determine the dependence of turbulent dynamics on parameters such as electron-ion temperature ratio and plasma beta.

HEFF---A user's manual and guide for the HEFF code for thermal-mechanical analysis using the boundary-element method

International Nuclear Information System (INIS)

St John, C.M.; Sanjeevan, K.

1991-12-01

The HEFF Code combines a simple boundary-element method of stress analysis with the closed form solutions for constant or exponentially decaying heat sources in an infinite elastic body to obtain an approximate method for analysis of underground excavations in a rock mass with heat generation. This manual describes the theoretical basis for the code, the code structure, model preparation, and step taken to assure that the code correctly performs its intended functions. The material contained within the report addresses the Software Quality Assurance Requirements for the Yucca Mountain Site Characterization Project. 13 refs., 26 figs., 14 tabs

Converter of a continuous code into the Grey code

International Nuclear Information System (INIS)

Gonchar, A.I.; TrUbnikov, V.R.

1979-01-01

Described is a converter of a continuous code into the Grey code used in a 12-charged precision amplitude-to-digital converter to decrease the digital component of spectrometer differential nonlinearity to +0.7% in the 98% range of the measured band. To construct the converter of a continuous code corresponding to the input signal amplitude into the Grey code used is the regularity in recycling of units and zeroes in each discharge of the Grey code in the case of a continuous change of the number of pulses of a continuous code. The converter is constructed on the elements of 155 series, the frequency of continuous code pulse passing at the converter input is 25 MHz

Ordered cones and approximation

CERN Document Server

Keimel, Klaus

1992-01-01

This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.

CH-TRU Waste Content Codes (CH-TRUCON)

Energy Technology Data Exchange (ETDEWEB)

Washington TRU Solutions LLC

2005-01-15

The CH-TRU Waste Content Codes (CH-TRUCON) document describes the inventory of the U.S. Department of Energy (DOE) CH-TRU waste within the transportation parameters specified by the Contact-Handled Transuranic Waste Authorized Methods for Payload Control (CH-TRAMPAC). The CH-TRAMPAC defines the allowable payload for the Transuranic Package Transporter-II (TRUPACT-II) and HalfPACT packagings. This document is a catalog of TRUPACT-II and HalfPACT authorized contents and a description of the methods utilized to demonstrate compliance with the CH-TRAMPAC. A summary of currently approved content codes by site is presented in Table 1. The CH-TRAMPAC describes "shipping categories" that are assigned to each payload container. Multiple shipping categories may be assigned to a single content code. A summary of approved content codes and corresponding shipping categories is provided in Table 2, which consists of Tables 2A, 2B, and 2C. Table 2A provides a summary of approved content codes and corresponding shipping categories for the "General Case," which reflects the assumption of a 60-day shipping period as described in the CH-TRAMPAC and Appendix 3.4 of the CH-TRU Payload Appendices. For shipments to be completed within an approximately 1,000-mile radius, a shorter shipping period of 20 days is applicable as described in the CH-TRAMPAC and Appendix 3.5 of the CH-TRU Payload Appendices. For shipments to WIPP from Los Alamos National Laboratory (LANL), Nevada Test Site, and Rocky Flats Environmental Technology Site, a 20-day shipping period is applicable. Table 2B provides a summary of approved content codes and corresponding shipping categories for "Close-Proximity Shipments" (20-day shipping period). For shipments implementing the controls specified in the CH-TRAMPAC and Appendix 3.6 of the CH-TRU Payload Appendices, a 10-day shipping period is applicable. Table 2C provides a summary of approved content codesand corresponding shipping categories for "Controlled Shipments

Approximate Bayesian computation for forward modeling in cosmology

International Nuclear Information System (INIS)

Akeret, Joël; Refregier, Alexandre; Amara, Adam; Seehars, Sebastian; Hasner, Caspar

2015-01-01

Bayesian inference is often used in cosmology and astrophysics to derive constraints on model parameters from observations. This approach relies on the ability to compute the likelihood of the data given a choice of model parameters. In many practical situations, the likelihood function may however be unavailable or intractable due to non-gaussian errors, non-linear measurements processes, or complex data formats such as catalogs and maps. In these cases, the simulation of mock data sets can often be made through forward modeling. We discuss how Approximate Bayesian Computation (ABC) can be used in these cases to derive an approximation to the posterior constraints using simulated data sets. This technique relies on the sampling of the parameter set, a distance metric to quantify the difference between the observation and the simulations and summary statistics to compress the information in the data. We first review the principles of ABC and discuss its implementation using a Population Monte-Carlo (PMC) algorithm and the Mahalanobis distance metric. We test the performance of the implementation using a Gaussian toy model. We then apply the ABC technique to the practical case of the calibration of image simulations for wide field cosmological surveys. We find that the ABC analysis is able to provide reliable parameter constraints for this problem and is therefore a promising technique for other applications in cosmology and astrophysics. Our implementation of the ABC PMC method is made available via a public code release

Improved Genetic Algorithm with Two-Level Approximation for Truss Optimization by Using Discrete Shape Variables

Directory of Open Access Journals (Sweden)

Shen-yan Chen

2015-01-01

Full Text Available This paper presents an Improved Genetic Algorithm with Two-Level Approximation (IGATA to minimize truss weight by simultaneously optimizing size, shape, and topology variables. On the basis of a previously presented truss sizing/topology optimization method based on two-level approximation and genetic algorithm (GA, a new method for adding shape variables is presented, in which the nodal positions are corresponding to a set of coordinate lists. A uniform optimization model including size/shape/topology variables is established. First, a first-level approximate problem is constructed to transform the original implicit problem to an explicit problem. To solve this explicit problem which involves size/shape/topology variables, GA is used to optimize individuals which include discrete topology variables and shape variables. When calculating the fitness value of each member in the current generation, a second-level approximation method is used to optimize the continuous size variables. With the introduction of shape variables, the original optimization algorithm was improved in individual coding strategy as well as GA execution techniques. Meanwhile, the update strategy of the first-level approximation problem was also improved. The results of numerical examples show that the proposed method is effective in dealing with the three kinds of design variables simultaneously, and the required computational cost for structural analysis is quite small.

Random walks on semaphore codes and delay de Bruijn semigroups

OpenAIRE

Rhodes, John; Schilling, Anne; Silva, Pedro V.

2015-01-01

© 2016 World Scientific Publishing Company. We develop a new approach to random walks on de Bruijn graphs over the alphabet A through right congruences on A k , defined using the natural right action of A + . A major role is played by special right congruences, which correspond to semaphore codes and allow an easier computation of the hitting time. We show how right congruences can be approximated by special right congruences.

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

Entanglement-assisted quantum MDS codes constructed from negacyclic codes

Science.gov (United States)

Chen, Jianzhang; Huang, Yuanyuan; Feng, Chunhui; Chen, Riqing

2017-12-01

Recently, entanglement-assisted quantum codes have been constructed from cyclic codes by some scholars. However, how to determine the number of shared pairs required to construct entanglement-assisted quantum codes is not an easy work. In this paper, we propose a decomposition of the defining set of negacyclic codes. Based on this method, four families of entanglement-assisted quantum codes constructed in this paper satisfy the entanglement-assisted quantum Singleton bound, where the minimum distance satisfies q+1 ≤ d≤ n+2/2. Furthermore, we construct two families of entanglement-assisted quantum codes with maximal entanglement.

Rate Aware Instantly Decodable Network Codes

KAUST Repository

Douik, Ahmed

2016-02-26

This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.

Rate Aware Instantly Decodable Network Codes

KAUST Repository

Douik, Ahmed; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-01

This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.

New MoM code incorporating multiple domain basis functions

CSIR Research Space (South Africa)

Lysko, AA

2011-08-01

Full Text Available piecewise linear approximation of geometry. This often leads to an unnecessarily great number of unknowns used to model relatively small loop and spiral antennas, coils and other curved structures. This is because the program creates a dense mesh... to accelerate computation of the elements of the impedance matrix and showed acceleration factor exceeding an order of magnitude, subject to a high accuracy requirement. 3. On Code Functionality and Application Results The package of programs was written...

Computerized Dental Comparison: A Critical Review of Dental Coding and Ranking Algorithms Used in Victim Identification.

Science.gov (United States)

Adams, Bradley J; Aschheim, Kenneth W

2016-01-01

Comparison of antemortem and postmortem dental records is a leading method of victim identification, especially for incidents involving a large number of decedents. This process may be expedited with computer software that provides a ranked list of best possible matches. This study provides a comparison of the most commonly used conventional coding and sorting algorithms used in the United States (WinID3) with a simplified coding format that utilizes an optimized sorting algorithm. The simplified system consists of seven basic codes and utilizes an optimized algorithm based largely on the percentage of matches. To perform this research, a large reference database of approximately 50,000 antemortem and postmortem records was created. For most disaster scenarios, the proposed simplified codes, paired with the optimized algorithm, performed better than WinID3 which uses more complex codes. The detailed coding system does show better performance with extremely large numbers of records and/or significant body fragmentation. © 2015 American Academy of Forensic Sciences.

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.

Channel coding/decoding alternatives for compressed TV data on advanced planetary missions.

Science.gov (United States)

Rice, R. F.

1972-01-01

The compatibility of channel coding/decoding schemes with a specific TV compressor developed for advanced planetary missions is considered. Under certain conditions, it is shown that compressed data can be transmitted at approximately the same rate as uncompressed data without any loss in quality. Thus, the full gains of data compression can be achieved in real-time transmission.

Convergence acceleration in the Monte-Carlo particle transport code TRIPOLI-4 in criticality

International Nuclear Information System (INIS)

Dehaye, Benjamin

2014-01-01

Fields such as criticality studies need to compute some values of interest in neutron physics. Two kind of codes may be used: deterministic ones and stochastic ones. The stochastic codes do not require approximation and are thus more exact. However, they may require a lot of time to converge with a sufficient precision.The work carried out during this thesis aims to build an efficient acceleration strategy in the TRIPOLI-4. We wish to implement the zero variance game. To do so, the method requires to compute the adjoint flux. The originality of this work is to directly compute the adjoint flux directly from a Monte-Carlo simulation without using external codes thanks to the fission matrix method. This adjoint flux is then used as an importance map to bias the simulation. (author) [fr

Turbo-Gallager Codes: The Emergence of an Intelligent Coding ...

African Journals Online (AJOL)

Today, both turbo codes and low-density parity-check codes are largely superior to other code families and are being used in an increasing number of modern communication systems including 3G standards, satellite and deep space communications. However, the two codes have certain distinctive characteristics that ...

TASS code topical report. V.1 TASS code technical manual

International Nuclear Information System (INIS)

Sim, Suk K.; Chang, W. P.; Kim, K. D.; Kim, H. C.; Yoon, H. Y.

1997-02-01

TASS 1.0 code has been developed at KAERI for the initial and reload non-LOCA safety analysis for the operating PWRs as well as the PWRs under construction in Korea. TASS code will replace various vendor's non-LOCA safety analysis codes currently used for the Westinghouse and ABB-CE type PWRs in Korea. This can be achieved through TASS code input modifications specific to each reactor type. The TASS code can be run interactively through the keyboard operation. A simimodular configuration used in developing the TASS code enables the user easily implement new models. TASS code has been programmed using FORTRAN77 which makes it easy to install and port for different computer environments. The TASS code can be utilized for the steady state simulation as well as the non-LOCA transient simulations such as power excursions, reactor coolant pump trips, load rejections, loss of feedwater, steam line breaks, steam generator tube ruptures, rod withdrawal and drop, and anticipated transients without scram (ATWS). The malfunctions of the control systems, components, operator actions and the transients caused by the malfunctions can be easily simulated using the TASS code. This technical report describes the TASS 1.0 code models including reactor thermal hydraulic, reactor core and control models. This TASS code models including reactor thermal hydraulic, reactor core and control models. This TASS code technical manual has been prepared as a part of the TASS code manual which includes TASS code user's manual and TASS code validation report, and will be submitted to the regulatory body as a TASS code topical report for a licensing non-LOCA safety analysis for the Westinghouse and ABB-CE type PWRs operating and under construction in Korea. (author). 42 refs., 29 tabs., 32 figs

Application of a nodal collocation approximation for the multidimensional PL equations to the 3D Takeda benchmark problems

International Nuclear Information System (INIS)

Capilla, M.; Talavera, C.F.; Ginestar, D.; Verdú, G.

2012-01-01

Highlights: ► The multidimensional P L approximation to the nuclear transport equation is reviewed. ► A nodal collocation method is developed for the spatial discretization of P L equations. ► Advantages of the method are lower dimension and good characterists of the associated algebraic eigenvalue problem. ► The P L nodal collocation method is implemented into the computer code SHNC. ► The SHNC code is verified with 2D and 3D benchmark eigenvalue problems from Takeda and Ikeda, giving satisfactory results. - Abstract: P L equations are classical approximations to the neutron transport equations, which are obtained expanding the angular neutron flux in terms of spherical harmonics. These approximations are useful to study the behavior of reactor cores with complex fuel assemblies, for the homogenization of nuclear cross-sections, etc., and most of these applications are in three-dimensional (3D) geometries. In this work, we review the multi-dimensional P L equations and describe a nodal collocation method for the spatial discretization of these equations for arbitrary odd order L, which is based on the expansion of the spatial dependence of the fields in terms of orthonormal Legendre polynomials. The performance of the nodal collocation method is studied by means of obtaining the k eff and the stationary power distribution of several 3D benchmark problems. The solutions are obtained are compared with a finite element method and a Monte Carlo method.

Stochastic methods for uncertainty treatment of functional variables in computer codes: application to safety studies

International Nuclear Information System (INIS)

Nanty, Simon

2015-01-01

This work relates to the framework of uncertainty quantification for numerical simulators, and more precisely studies two industrial applications linked to the safety studies of nuclear plants. These two applications have several common features. The first one is that the computer code inputs are functional and scalar variables, functional ones being dependent. The second feature is that the probability distribution of functional variables is known only through a sample of their realizations. The third feature, relative to only one of the two applications, is the high computational cost of the code, which limits the number of possible simulations. The main objective of this work was to propose a complete methodology for the uncertainty analysis of numerical simulators for the two considered cases. First, we have proposed a methodology to quantify the uncertainties of dependent functional random variables from a sample of their realizations. This methodology enables to both model the dependency between variables and their link to another variable, called co-variate, which could be, for instance, the output of the considered code. Then, we have developed an adaptation of a visualization tool for functional data, which enables to simultaneously visualize the uncertainties and features of dependent functional variables. Second, a method to perform the global sensitivity analysis of the codes used in the two studied cases has been proposed. In the case of a computationally demanding code, the direct use of quantitative global sensitivity analysis methods is intractable. To overcome this issue, the retained solution consists in building a surrogate model or meta model, a fast-running model approximating the computationally expensive code. An optimized uniform sampling strategy for scalar and functional variables has been developed to build a learning basis for the meta model. Finally, a new approximation approach for expensive codes with functional outputs has been

ASPHERICAL SURFACES APPROXIMATION IN AUTOMATED DESIGN OF OPTICAL SYSTEMS

Directory of Open Access Journals (Sweden)

T. V. Ivanova

2015-07-01

Full Text Available Subject of Research. The paper deals with the problems of higher order aspherical surfaces approximation using different equation types. The objects of research are two types of equations for higher order aspherical surfaces description used in different software for optical systems design (SАRО, OPAL, ZEMAX, CODE-V, etc. and dependent on z-coordinate or on a radial coordinate on the surface. Conversion from one type of equations to another is considered in view of application in different software for optical systems design. Methods. The subject matter of the method lies in usage of mean square method approximation for recalculation of high-order aspherical surface. Iterative algorithm for recalculation is presented giving the possibility to recalculate coefficients for different types of equations with required accuracy. Recommendations are given for choosing recalculation parameters such as the number of result equation coefficients, the number of points for recalculation and point allocation on a surface. Main Results. Example of recalculation for aspherical surface and accuracy estimation, including result aberration comparison between initial surface and recalculated surface are presented. The example has shown that required accuracy of surface representation was obtained. Practical Relevance. This technique is usable for recalculation of higher order aspherical surfaces in various types of software for optical systems design and also for research of optimal higher order aspherical surfaces description.

Decoding of concatenated codes with interleaved outer codes

DEFF Research Database (Denmark)

Justesen, Jørn; Høholdt, Tom; Thommesen, Christian

2004-01-01

Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes.......Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes....

Fast Coding Unit Encoding Mechanism for Low Complexity Video Coding

OpenAIRE

Gao, Yuan; Liu, Pengyu; Wu, Yueying; Jia, Kebin; Gao, Guandong

2016-01-01

In high efficiency video coding (HEVC), coding tree contributes to excellent compression performance. However, coding tree brings extremely high computational complexity. Innovative works for improving coding tree to further reduce encoding time are stated in this paper. A novel low complexity coding tree mechanism is proposed for HEVC fast coding unit (CU) encoding. Firstly, this paper makes an in-depth study of the relationship among CU distribution, quantization parameter (QP) and content ...

Packing simulation code to calculate distribution function of hard spheres by Monte Carlo method : MCRDF

International Nuclear Information System (INIS)

Murata, Isao; Mori, Takamasa; Nakagawa, Masayuki; Shirai, Hiroshi.

1996-03-01

High Temperature Gas-cooled Reactors (HTGRs) employ spherical fuels named coated fuel particles (CFPs) consisting of a microsphere of low enriched UO 2 with coating layers in order to prevent FP release. There exist many spherical fuels distributed randomly in the cores. Therefore, the nuclear design of HTGRs is generally performed on the basis of the multigroup approximation using a diffusion code, S N transport code or group-wise Monte Carlo code. This report summarizes a Monte Carlo hard sphere packing simulation code to simulate the packing of equal hard spheres and evaluate the necessary probability distribution of them, which is used for the application of the new Monte Carlo calculation method developed to treat randomly distributed spherical fuels with the continuous energy Monte Carlo method. By using this code, obtained are the various statistical values, namely Radial Distribution Function (RDF), Nearest Neighbor Distribution (NND), 2-dimensional RDF and so on, for random packing as well as ordered close packing of FCC and BCC. (author)

Validation of SCALE code package on high performance neutron shields

International Nuclear Information System (INIS)

Bace, M.; Jecmenica, R.; Smuc, T.

1999-01-01

The shielding ability and other properties of new high performance neutron shielding materials from the KRAFTON series have been recently published. A comparison of the published experimental and MCNP results for the two materials of the KRAFTON series, with our own calculations has been done. Two control modules of the SCALE-4.4 code system have been used, one of them based on one dimensional radiation transport analysis (SAS1) and other based on the three dimensional Monte Carlo method (SAS3). The comparison of the calculated neutron dose equivalent rates shows a good agreement between experimental and calculated results for the KRAFTON-N2 material.. Our results indicate that the N2-M-N2 sandwich type is approximately 10% inferior as neutron shield to the KRAFTON-N2 material. All values of neutron dose equivalent obtained by SAS1 are approximately 25% lower in comparison with the SAS3 results, which indicates proportions of discrepancies introduced by one-dimensional geometry approximation.(author)

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.

Amino acid codes in mitochondria as possible clues to primitive codes

Science.gov (United States)

Jukes, T. H.

1981-01-01

Differences between mitochondrial codes and the universal code indicate that an evolutionary simplification has taken place, rather than a return to a more primitive code. However, these differences make it evident that the universal code is not the only code possible, and therefore earlier codes may have differed markedly from the previous code. The present universal code is probably a 'frozen accident.' The change in CUN codons from leucine to threonine (Neurospora vs. yeast mitochondria) indicates that neutral or near-neutral changes occurred in the corresponding proteins when this code change took place, caused presumably by a mutation in a tRNA gene.

Accuracy estimation for intermediate and low energy neutron transport calculation with Monte Carlo code MCNP

International Nuclear Information System (INIS)

Kotegawa, Hiroshi; Sasamoto, Nobuo; Tanaka, Shun-ichi

1987-02-01

Both ''measured radioactive inventory due to neutron activation in the shield concrete of JPDR'' and ''measured intermediate and low energy neutron spectra penetrating through a graphite sphere'' are analyzed using a continuous energy model Monte Carlo code MCNP so as to estimate calculational accuracy of the code for neutron transport in thermal and epithermal energy regions. Analyses reveal that MCNP calculates thermal neutron spectra fairly accurately, while it apparently over-estimates epithermal neutron spectra (of approximate 1/E distribution) as compared with the measurements. (author)

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

STEMsalabim: A high-performance computing cluster friendly code for scanning transmission electron microscopy image simulations of thin specimens

International Nuclear Information System (INIS)

Oelerich, Jan Oliver; Duschek, Lennart; Belz, Jürgen; Beyer, Andreas; Baranovskii, Sergei D.; Volz, Kerstin

2017-01-01

Highlights: • We present STEMsalabim, a modern implementation of the multislice algorithm for simulation of STEM images. • Our package is highly parallelizable on high-performance computing clusters, combining shared and distributed memory architectures. • With STEMsalabim, computationally and memory expensive STEM image simulations can be carried out within reasonable time. - Abstract: We present a new multislice code for the computer simulation of scanning transmission electron microscope (STEM) images based on the frozen lattice approximation. Unlike existing software packages, the code is optimized to perform well on highly parallelized computing clusters, combining distributed and shared memory architectures. This enables efficient calculation of large lateral scanning areas of the specimen within the frozen lattice approximation and fine-grained sweeps of parameter space.

STEMsalabim: A high-performance computing cluster friendly code for scanning transmission electron microscopy image simulations of thin specimens

Energy Technology Data Exchange (ETDEWEB)

Oelerich, Jan Oliver, E-mail: jan.oliver.oelerich@physik.uni-marburg.de; Duschek, Lennart; Belz, Jürgen; Beyer, Andreas; Baranovskii, Sergei D.; Volz, Kerstin

2017-06-15

Highlights: • We present STEMsalabim, a modern implementation of the multislice algorithm for simulation of STEM images. • Our package is highly parallelizable on high-performance computing clusters, combining shared and distributed memory architectures. • With STEMsalabim, computationally and memory expensive STEM image simulations can be carried out within reasonable time. - Abstract: We present a new multislice code for the computer simulation of scanning transmission electron microscope (STEM) images based on the frozen lattice approximation. Unlike existing software packages, the code is optimized to perform well on highly parallelized computing clusters, combining distributed and shared memory architectures. This enables efficient calculation of large lateral scanning areas of the specimen within the frozen lattice approximation and fine-grained sweeps of parameter space.

CONTRIBUTIONS TO RATIONAL APPROXIMATION,

Science.gov (United States)

Some of the key results of linear Chebyshev approximation theory are extended to generalized rational functions. Prominent among these is Haar’s...linear theorem which yields necessary and sufficient conditions for uniqueness. Some new results in the classic field of rational function Chebyshev...Furthermore a Weierstrass type theorem is proven for rational Chebyshev approximation. A characterization theorem for rational trigonometric Chebyshev approximation in terms of sign alternation is developed. (Author)

Contributions at the Tripoli Monte Carlo code qualifying on critical experiences and at neutronic interaction study of fissile units

International Nuclear Information System (INIS)

Nouri, A.

1994-01-01

Criticality studies in nuclear fuel cycle are based on Monte Carlo method. These codes use multigroup cross sections which can verify by experimental configurations or by use of reference codes such Tripoli 2. In this Tripoli 2 code nuclear data are errors attached and asked for experimental studies with critical experiences. This is one of the aim of this thesis. To calculate the keff of interacted fissile units we have used the multigroup Monte Carlo code Moret with convergence problems. A new estimator of reactions rates permit to better approximate the neutrons exchange between units and a new importance function has been tested. 2 annexes

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

Dynamic load balancing in a concurrent plasma PIC code on the JPL/Caltech Mark III hypercube

International Nuclear Information System (INIS)

Liewer, P.C.; Leaver, E.W.; Decyk, V.K.; Dawson, J.M.

1990-01-01

Dynamic load balancing has been implemented in a concurrent one-dimensional electromagnetic plasma particle-in-cell (PIC) simulation code using a method which adds very little overhead to the parallel code. In PIC codes, the orbits of many interacting plasma electrons and ions are followed as an initial value problem as the particles move in electromagnetic fields calculated self-consistently from the particle motions. The code was implemented using the GCPIC algorithm in which the particles are divided among processors by partitioning the spatial domain of the simulation. The problem is load-balanced by partitioning the spatial domain so that each partition has approximately the same number of particles. During the simulation, the partitions are dynamically recreated as the spatial distribution of the particles changes in order to maintain processor load balance

Residential building codes, affordability, and health protection: a risk-tradeoff approach.

Science.gov (United States)

Hammitt, J K; Belsky, E S; Levy, J I; Graham, J D

1999-12-01

Residential building codes intended to promote health and safety may produce unintended countervailing risks by adding to the cost of construction. Higher construction costs increase the price of new homes and may increase health and safety risks through "income" and "stock" effects. The income effect arises because households that purchase a new home have less income remaining for spending on other goods that contribute to health and safety. The stock effect arises because suppression of new-home construction leads to slower replacement of less safe housing units. These countervailing risks are not presently considered in code debates. We demonstrate the feasibility of estimating the approximate magnitude of countervailing risks by combining the income effect with three relatively well understood and significant home-health risks. We estimate that a code change that increases the nationwide cost of constructing and maintaining homes by $150 (0.1% of the average cost to build a single-family home) would induce offsetting risks yielding between 2 and 60 premature fatalities or, including morbidity effects, between 20 and 800 lost quality-adjusted life years (both discounted at 3%) each year the code provision remains in effect. To provide a net health benefit, the code change would need to reduce risk by at least this amount. Future research should refine these estimates, incorporate quantitative uncertainty analysis, and apply a full risk-tradeoff approach to real-world case studies of proposed code changes.

UNR. A code for processing unresolved resonance data for MCNP

International Nuclear Information System (INIS)

Hogenbirk, A.

1994-09-01

In neutron transport problems the correct treatment of self-shielding is important for those nuclei present in large concentrations. Monte Carlo calculations using continuous-energy cross section data, such as calculations with the code MCNP, offer the advantage that neutron transport is calculated in a very accurate way. Self-shielding in the resolved resonance region is taken into account exactly in MCNP. However, self-shielding in the unresolved resonance region can not be taken into account by MCNP, although the effect of it may be important in many applications. In this report a description is given of the computer code UNR. With this code problem-dependent cross section libraries can be produced for MCNP. In these libraries self-shielded cross section data in the unresolved resonance range are given, which are produced by NJOY-module UNRESR. It is noted, that the treatment for resonance self-shielding presented in this report is approximate. However, the current version of MCNP does not allow the use of probability tables, which would be a general solution. (orig.)

Prevalence of transcription promoters within archaeal operons and coding sequences.

Science.gov (United States)

Koide, Tie; Reiss, David J; Bare, J Christopher; Pang, Wyming Lee; Facciotti, Marc T; Schmid, Amy K; Pan, Min; Marzolf, Bruz; Van, Phu T; Lo, Fang-Yin; Pratap, Abhishek; Deutsch, Eric W; Peterson, Amelia; Martin, Dan; Baliga, Nitin S

2009-01-01

Despite the knowledge of complex prokaryotic-transcription mechanisms, generalized rules, such as the simplified organization of genes into operons with well-defined promoters and terminators, have had a significant role in systems analysis of regulatory logic in both bacteria and archaea. Here, we have investigated the prevalence of alternate regulatory mechanisms through genome-wide characterization of transcript structures of approximately 64% of all genes, including putative non-coding RNAs in Halobacterium salinarum NRC-1. Our integrative analysis of transcriptome dynamics and protein-DNA interaction data sets showed widespread environment-dependent modulation of operon architectures, transcription initiation and termination inside coding sequences, and extensive overlap in 3' ends of transcripts for many convergently transcribed genes. A significant fraction of these alternate transcriptional events correlate to binding locations of 11 transcription factors and regulators (TFs) inside operons and annotated genes-events usually considered spurious or non-functional. Using experimental validation, we illustrate the prevalence of overlapping genomic signals in archaeal transcription, casting doubt on the general perception of rigid boundaries between coding sequences and regulatory elements.

Detecting non-coding selective pressure in coding regions

Directory of Open Access Journals (Sweden)

Blanchette Mathieu

2007-02-01

Full Text Available Abstract Background Comparative genomics approaches, where orthologous DNA regions are compared and inter-species conserved regions are identified, have proven extremely powerful for identifying non-coding regulatory regions located in intergenic or intronic regions. However, non-coding functional elements can also be located within coding region, as is common for exonic splicing enhancers, some transcription factor binding sites, and RNA secondary structure elements affecting mRNA stability, localization, or translation. Since these functional elements are located in regions that are themselves highly conserved because they are coding for a protein, they generally escaped detection by comparative genomics approaches. Results We introduce a comparative genomics approach for detecting non-coding functional elements located within coding regions. Codon evolution is modeled as a mixture of codon substitution models, where each component of the mixture describes the evolution of codons under a specific type of coding selective pressure. We show how to compute the posterior distribution of the entropy and parsimony scores under this null model of codon evolution. The method is applied to a set of growth hormone 1 orthologous mRNA sequences and a known exonic splicing elements is detected. The analysis of a set of CORTBP2 orthologous genes reveals a region of several hundred base pairs under strong non-coding selective pressure whose function remains unknown. Conclusion Non-coding functional elements, in particular those involved in post-transcriptional regulation, are likely to be much more prevalent than is currently known. With the numerous genome sequencing projects underway, comparative genomics approaches like that proposed here are likely to become increasingly powerful at detecting such elements.

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.

Exact constants in approximation theory

CERN Document Server

Korneichuk, N

1991-01-01

This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base

The correspondence between projective codes and 2-weight codes

NARCIS (Netherlands)

Brouwer, A.E.; Eupen, van M.J.M.; Tilborg, van H.C.A.; Willems, F.M.J.

1994-01-01

The hyperplanes intersecting a 2-weight code in the same number of points obviously form the point set of a projective code. On the other hand, if we have a projective code C, then we can make a 2-weight code by taking the multiset of points E PC with multiplicity "Y(w), where W is the weight of

Emergency medicine summary code for reporting CT scan results: implementation and survey results.

Science.gov (United States)

Lam, Joanne; Coughlin, Ryan; Buhl, Luce; Herbst, Meghan; Herbst, Timothy; Martillotti, Jared; Coughlin, Bret

2018-06-01

The purpose of the study was to assess the emergency department (ED) providers' interest and satisfaction with ED CT result reporting before and after the implementation of a standardized summary code for all CT scan reporting. A summary code was provided at the end of all CTs ordered through the ED from August to October of 2016. A retrospective review was completed on all studies performed during this period. A pre- and post-survey was given to both ED and radiology providers. A total of 3980 CT scans excluding CTAs were ordered with 2240 CTs dedicated to the head and neck, 1685 CTs dedicated to the torso, and 55 CTs dedicated to the extremities. Approximately 74% CT scans were contrast enhanced. Of the 3980 ED CT examination ordered, 69% had a summary code assigned to it. Fifteen percent of the coded CTs had a critical or diagnostic positive result. The introduction of an ED CT summary code did not show a definitive improvement in communication. However, the ED providers are in consensus that radiology reports are crucial their patients' management. There is slightly increased satisfaction with the providers with less than 5 years of experience with the ED CT codes compared to more seasoned providers. The implementation of a user-friendly summary code may allow better analysis of results, practice improvement, and quality measurements in the future.

Quality Improvement of MARS Code and Establishment of Code Coupling

International Nuclear Information System (INIS)

Chung, Bub Dong; Jeong, Jae Jun; Kim, Kyung Doo

2010-04-01

The improvement of MARS code quality and coupling with regulatory auditing code have been accomplished for the establishment of self-reliable technology based regulatory auditing system. The unified auditing system code was realized also by implementing the CANDU specific models and correlations. As a part of the quality assurance activities, the various QA reports were published through the code assessments. The code manuals were updated and published a new manual which describe the new models and correlations. The code coupling methods were verified though the exercise of plant application. The education-training seminar and technology transfer were performed for the code users. The developed MARS-KS is utilized as reliable auditing tool for the resolving the safety issue and other regulatory calculations. The code can be utilized as a base technology for GEN IV reactor applications

Analytical approximations for the long-term decay behavior of spent fuel and high-level waste

International Nuclear Information System (INIS)

Malbrain, C.M.; Deutch, J.M.; Lester, R.K.

1982-01-01

Simple analytical approximations are presented that describe the radioactivity and radiogenic decay heat behavior of high-level wastes (HLWs) from various nuclear fuel cycles during the first 100,000 years of waste life. The correlations are based on detailed computations of HLW properties carried out with the isotope generation and depletion code ORIGEN 2. The ambiguities encountered in using simple comparisons of the hazards posed by HLWs and naturally occurring mineral deposits to establish the longevity requirements for geologic waste disposal schemes are discussed

Improved predictions of nuclear reaction rates for astrophysics applications with the TALYS reaction code

International Nuclear Information System (INIS)

Goriely, S.; Hilaire, S.; Koning, A.J.

2008-01-01

Nuclear reaction rates for astrophysics applications are traditionally determined on the basis of Hauser-Feshbach reaction codes, like MOST. These codes use simplified schemes to calculate the capture reaction cross section on a given target nucleus, not only in its ground state but also on the different thermally populated states of the stellar plasma at a given temperature. Such schemes include a number of approximations that have never been tested, such as an approximate width fluctuation correction, the neglect of delayed particle emission during the electromagnetic decay cascade or the absence of the pre-equilibrium contribution at increasing incident energies. New developments have been brought to the reaction code TALYS to estimate the Maxwellian-averaged reaction rates of astrophysics relevance. These new developments give us the possibility to calculate with an improved accuracy the reaction cross sections and the corresponding astrophysics rates. The TALYS predictions for the thermonuclear rates of astrophysics relevance are presented and compared with those obtained with the MOST code on the basis of the same nuclear ingredients for nuclear structure properties, optical model potential, nuclear level densities and γ-ray strength. It is shown that, in particular, the pre-equilibrium process significantly influences the astrophysics rates of exotic neutron-rich nuclei. The reciprocity theorem traditionally used in astrophysics to determine photo-rates is also shown no to be valid for exotic nuclei. The predictions obtained with different nuclear inputs are also analyzed to provide an estimate of the theoretical uncertainties still affecting the reaction rate prediction far away from the experimentally known regions. (authors)

Optimal random perturbations for stochastic approximation using a simultaneous perturbation gradient approximation

DEFF Research Database (Denmark)

Sadegh, Payman; Spall, J. C.

1998-01-01

simultaneous perturbation approximation to the gradient based on loss function measurements. SPSA is based on picking a simultaneous perturbation (random) vector in a Monte Carlo fashion as part of generating the approximation to the gradient. This paper derives the optimal distribution for the Monte Carlo...

Multiple component codes based generalized LDPC codes for high-speed optical transport.

Science.gov (United States)

Djordjevic, Ivan B; Wang, Ting

2014-07-14

A class of generalized low-density parity-check (GLDPC) codes suitable for optical communications is proposed, which consists of multiple local codes. It is shown that Hamming, BCH, and Reed-Muller codes can be used as local codes, and that the maximum a posteriori probability (MAP) decoding of these local codes by Ashikhmin-Lytsin algorithm is feasible in terms of complexity and performance. We demonstrate that record coding gains can be obtained from properly designed GLDPC codes, derived from multiple component codes. We then show that several recently proposed classes of LDPC codes such as convolutional and spatially-coupled codes can be described using the concept of GLDPC coding, which indicates that the GLDPC coding can be used as a unified platform for advanced FEC enabling ultra-high speed optical transport. The proposed class of GLDPC codes is also suitable for code-rate adaption, to adjust the error correction strength depending on the optical channel conditions.

A novel approach to correct the coded aperture misalignment for fast neutron imaging

Energy Technology Data Exchange (ETDEWEB)

Zhang, F. N.; Hu, H. S., E-mail: huasi-hu@mail.xjtu.edu.cn; Wang, D. M.; Jia, J. [School of Energy and Power Engineering, Xi’an Jiaotong University, Xi’an 710049 (China); Zhang, T. K. [Laser Fusion Research Center, CAEP, Mianyang, 621900 Sichuan (China); Jia, Q. G. [Institute of Applied Physics and Computational Mathematics, Beijing 100094 (China)

2015-12-15

Aperture alignment is crucial for the diagnosis of neutron imaging because it has significant impact on the coding imaging and the understanding of the neutron source. In our previous studies on the neutron imaging system with coded aperture for large field of view, “residual watermark,” certain extra information that overlies reconstructed image and has nothing to do with the source is discovered if the peak normalization is employed in genetic algorithms (GA) to reconstruct the source image. Some studies on basic properties of residual watermark indicate that the residual watermark can characterize coded aperture and can thus be used to determine the location of coded aperture relative to the system axis. In this paper, we have further analyzed the essential conditions for the existence of residual watermark and the requirements of the reconstruction algorithm for the emergence of residual watermark. A gamma coded imaging experiment has been performed to verify the existence of residual watermark. Based on the residual watermark, a correction method for the aperture misalignment has been studied. A multiple linear regression model of the position of coded aperture axis, the position of residual watermark center, and the gray barycenter of neutron source with twenty training samples has been set up. Using the regression model and verification samples, we have found the position of the coded aperture axis relative to the system axis with an accuracy of approximately 20 μm. Conclusively, a novel approach has been established to correct the coded aperture misalignment for fast neutron coded imaging.

Approximate kernel competitive learning.

Science.gov (United States)

Wu, Jian-Sheng; Zheng, Wei-Shi; Lai, Jian-Huang

2015-03-01

Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches. Copyright © 2014 Elsevier Ltd. All rights reserved.

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

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

On the use of SERPENT Monte Carlo code to generate few group diffusion constants

Energy Technology Data Exchange (ETDEWEB)

Piovezan, Pamela, E-mail: pamela.piovezan@ctmsp.mar.mil.b [Centro Tecnologico da Marinha em Sao Paulo (CTMSP), Sao Paulo, SP (Brazil); Carluccio, Thiago; Domingos, Douglas Borges; Rossi, Pedro Russo; Mura, Luiz Felipe, E-mail: fermium@cietec.org.b, E-mail: thiagoc@ipen.b [Fermium Tecnologia Nuclear, Sao Paulo, SP (Brazil); Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

2011-07-01

The accuracy of diffusion reactor codes strongly depends on the quality of the groups constants processing. For many years, the generation of such constants was based on 1-D infinity cell transport calculations. Some developments using collision probability or the method of characteristics allow, nowadays, 2-D assembly group constants calculations. However, these 1-D and 2-D codes how some limitations as , for example, on complex geometries and in the neighborhood of heavy absorbers. On the other hand, since Monte Carlos (MC) codes provide accurate neutro flux distributions, the possibility of using these solutions to provide group constants to full-core reactor diffusion simulators has been recently investigated, especially for the cases in which the geometry and reactor types are beyond the capability of the conventional deterministic lattice codes. The two greatest difficulties on the use of MC codes to group constant generation are the computational costs and the methodological incompatibility between analog MC particle transport simulation and deterministic transport methods based in several approximations. The SERPENT code is a 3-D continuous energy MC transport code with built-in burnup capability that was specially optimized to generate these group constants. In this work, we present the preliminary results of using the SERPENT MC code to generate 3-D two-group diffusion constants for a PWR like assembly. These constants were used in the CITATION diffusion code to investigate the effects of the MC group constants determination on the neutron multiplication factor diffusion estimate. (author)

Approximate cohomology in Banach algebras | Pourabbas ...

African Journals Online (AJOL)

We introduce the notions of approximate cohomology and approximate homotopy in Banach algebras and we study the relation between them. We show that the approximate homotopically equivalent cochain complexes give the same approximate cohomologies. As a special case, approximate Hochschild cohomology is ...

Case-crossover analysis of heat-coded deaths and vulnerable subpopulations: Oklahoma, 1990-2011

Science.gov (United States)

Moore, Brianna F.; Brooke Anderson, G.; Johnson, Matthew G.; Brown, Sheryll; Bradley, Kristy K.; Magzamen, Sheryl

2017-11-01

The extent of the association between temperature and heat-coded deaths, for which heat is the primary cause of death, remains largely unknown. We explored the association between temperature and heat-coded deaths and potential interactions with various demographic and environmental factors. A total of 335 heat-coded deaths that occurred in Oklahoma from 1990 through 2011 were identified using heat-related International Classification of Diseases codes, cause-of-death nomenclature, and narrative descriptions. Conditional logistic regression models examined the association between temperature and heat index on heat-coded deaths. Interaction by demographic factors (age, sex, marital status, living alone, outdoor/heavy labor occupations) and environmental factors (ozone, PM10, PM2.5) was also explored. Temperatures ≥99 °F (the median value) were associated with approximately five times higher odds of a heat-coded death as compared to temperatures effect estimates were attenuated when exposure to heat was characterized by heat index. The interaction results suggest that effect of temperature on heat-coded deaths may depend on sex and occupation. For example, the odds of a heat-coded death among outdoor/heavy labor workers exposed to temperatures ≥99 °F was greater than expected based on the sum of the individual effects (observed OR = 14.0, 95% CI 2.7, 72.0; expected OR = 4.1 [2.8 + 2.3-1.0]). Our results highlight the extent of the association between temperature and heat-coded deaths and emphasize the need for a comprehensive, multisource definition of heat-coded deaths. Furthermore, based on the interaction results, we recommend that states implement or expand heat safety programs to protect vulnerable subpopulations, such as outdoor workers.

New quantum codes derived from a family of antiprimitive BCH codes

Science.gov (United States)

Liu, Yang; Li, Ruihu; Lü, Liangdong; Guo, Luobin

The Bose-Chaudhuri-Hocquenghem (BCH) codes have been studied for more than 57 years and have found wide application in classical communication system and quantum information theory. In this paper, we study the construction of quantum codes from a family of q2-ary BCH codes with length n=q2m+1 (also called antiprimitive BCH codes in the literature), where q≥4 is a power of 2 and m≥2. By a detailed analysis of some useful properties about q2-ary cyclotomic cosets modulo n, Hermitian dual-containing conditions for a family of non-narrow-sense antiprimitive BCH codes are presented, which are similar to those of q2-ary primitive BCH codes. Consequently, via Hermitian Construction, a family of new quantum codes can be derived from these dual-containing BCH codes. Some of these new antiprimitive quantum BCH codes are comparable with those derived from primitive BCH codes.

Investigation on the MOC with a linear source approximation scheme in three-dimensional assembly

International Nuclear Information System (INIS)

Zhu, Chenglin; Cao, Xinrong

2014-01-01

Method of characteristics (MOC) for solving neutron transport equation has already become one of the fundamental methods for lattice calculation of nuclear design code system. At present, MOC has three schemes to deal with the neutron source of the transport equation: the flat source approximation of the step characteristics (SC) scheme, the diamond difference (DD) scheme and the linear source (LS) characteristics scheme. The MOC for SC scheme and DD scheme need large storage space and long computing time when they are used to calculate large-scale three-dimensional neutron transport problems. In this paper, a LS scheme and its correction for negative source distribution were developed and added to DRAGON code. This new scheme was compared with the SC scheme and DD scheme which had been applied in this code. As an open source code, DRAGON could solve three-dimensional assembly with MOC method. Detailed calculation is conducted on two-dimensional VVER-1000 assembly under three schemes of MOC. The numerical results indicate that coarse mesh could be used in the LS scheme with the same accuracy. And the LS scheme applied in DRAGON is effective and expected results are achieved. Then three-dimensional cell problem and VVER-1000 assembly are calculated with LS scheme and SC scheme. The results show that less memory and shorter computational time are employed in LS scheme compared with SC scheme. It is concluded that by using LS scheme, DRAGON is able to calculate large-scale three-dimensional problems with less storage space and shorter computing time

Surface acoustic wave coding for orthogonal frequency coded devices

Science.gov (United States)

Malocha, Donald (Inventor); Kozlovski, Nikolai (Inventor)

2011-01-01

Methods and systems for coding SAW OFC devices to mitigate code collisions in a wireless multi-tag system. Each device producing plural stepped frequencies as an OFC signal with a chip offset delay to increase code diversity. A method for assigning a different OCF to each device includes using a matrix based on the number of OFCs needed and the number chips per code, populating each matrix cell with OFC chip, and assigning the codes from the matrix to the devices. The asynchronous passive multi-tag system includes plural surface acoustic wave devices each producing a different OFC signal having the same number of chips and including a chip offset time delay, an algorithm for assigning OFCs to each device, and a transceiver to transmit an interrogation signal and receive OFC signals in response with minimal code collisions during transmission.

The MARS15-based FermiCORD code system for calculation of the accelerator-induced residual dose

Energy Technology Data Exchange (ETDEWEB)

Grebe, A.; Leveling, A.; Lu, T.; Mokhov, N.; Pronskikh, V.

2018-01-01

The FermiCORD code system, a set of codes based on MARS15 that calculates the accelerator-induced residual doses at experimental facilities of arbitrary configurations, has been developed. FermiCORD is written in C++ as an add-on to Fortran-based MARS15. The FermiCORD algorithm consists of two stages: 1) simulation of residual doses on contact with the surfaces surrounding the studied location and of radionuclide inventories in the structures surrounding those locations using MARS15, and 2) simulation of the emission of the nuclear decay gamma-quanta by the residuals in the activated structures and scoring the prompt doses of these gamma-quanta at arbitrary distances from those structures. The FermiCORD code system has been benchmarked against similar algorithms based on other code systems and showed a good agreement. The code system has been applied for calculation of the residual dose of the target station for the Mu2e experiment and the results have been compared to approximate dosimetric approaches.

International Conference Approximation Theory XIV

CERN Document Server

Schumaker, Larry

2014-01-01

This volume developed from papers presented at the international conference Approximation Theory XIV,  held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.

Separate Turbo Code and Single Turbo Code Adaptive OFDM Transmissions

Directory of Open Access Journals (Sweden)

Burr Alister

2009-01-01

Full Text Available Abstract This paper discusses the application of adaptive modulation and adaptive rate turbo coding to orthogonal frequency-division multiplexing (OFDM, to increase throughput on the time and frequency selective channel. The adaptive turbo code scheme is based on a subband adaptive method, and compares two adaptive systems: a conventional approach where a separate turbo code is used for each subband, and a single turbo code adaptive system which uses a single turbo code over all subbands. Five modulation schemes (BPSK, QPSK, 8AMPM, 16QAM, and 64QAM are employed and turbo code rates considered are and . The performances of both systems with high ( and low ( BER targets are compared. Simulation results for throughput and BER show that the single turbo code adaptive system provides a significant improvement.

Linear-time general decoding algorithm for the surface code

Science.gov (United States)

Darmawan, Andrew S.; Poulin, David

2018-05-01

A quantum error correcting protocol can be substantially improved by taking into account features of the physical noise process. We present an efficient decoder for the surface code which can account for general noise features, including coherences and correlations. We demonstrate that the decoder significantly outperforms the conventional matching algorithm on a variety of noise models, including non-Pauli noise and spatially correlated noise. The algorithm is based on an approximate calculation of the logical channel using a tensor-network description of the noisy state.

Reliability of Broadcast Communications Under Sparse Random Linear Network Coding

OpenAIRE

Brown, Suzie; Johnson, Oliver; Tassi, Andrea

2018-01-01

Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kin...

Approximate and renormgroup symmetries

International Nuclear Information System (INIS)

Ibragimov, Nail H.; Kovalev, Vladimir F.

2009-01-01

''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)

Analytical approximate solutions of the time-domain diffusion equation in layered slabs.

Science.gov (United States)

Martelli, Fabrizio; Sassaroli, Angelo; Yamada, Yukio; Zaccanti, Giovanni

2002-01-01

Time-domain analytical solutions of the diffusion equation for photon migration through highly scattering two- and three-layered slabs have been obtained. The effect of the refractive-index mismatch with the external medium is taken into account, and approximate boundary conditions at the interface between the diffusive layers have been considered. A Monte Carlo code for photon migration through a layered slab has also been developed. Comparisons with the results of Monte Carlo simulations showed that the analytical solutions correctly describe the mean path length followed by photons inside each diffusive layer and the shape of the temporal profile of received photons, while discrepancies are observed for the continuous-wave reflectance or transmittance.

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

Separate Turbo Code and Single Turbo Code Adaptive OFDM Transmissions

Directory of Open Access Journals (Sweden)

Lei Ye

2009-01-01

Full Text Available This paper discusses the application of adaptive modulation and adaptive rate turbo coding to orthogonal frequency-division multiplexing (OFDM, to increase throughput on the time and frequency selective channel. The adaptive turbo code scheme is based on a subband adaptive method, and compares two adaptive systems: a conventional approach where a separate turbo code is used for each subband, and a single turbo code adaptive system which uses a single turbo code over all subbands. Five modulation schemes (BPSK, QPSK, 8AMPM, 16QAM, and 64QAM are employed and turbo code rates considered are 1/2 and 1/3. The performances of both systems with high (10−2 and low (10−4 BER targets are compared. Simulation results for throughput and BER show that the single turbo code adaptive system provides a significant improvement.

Quantum Codes From Cyclic Codes Over The Ring R 2

International Nuclear Information System (INIS)

Altinel, Alev; Güzeltepe, Murat

2016-01-01

Let R 2 denotes the ring F 2 + μF 2 + υ 2 + μυ F 2 + wF 2 + μwF 2 + υwF 2 + μυwF 2 . In this study, we construct quantum codes from cyclic codes over the ring R 2 , for arbitrary length n, with the restrictions μ 2 = 0, υ 2 = 0, w 2 = 0, μυ = υμ, μw = wμ, υw = wυ and μ (υw) = (μυ) w. Also, we give a necessary and sufficient condition for cyclic codes over R 2 that contains its dual. As a final point, we obtain the parameters of quantum error-correcting codes from cyclic codes over R 2 and we give an example of quantum error-correcting codes form cyclic codes over R 2 . (paper)

Enhanced Verification Test Suite for Physics Simulation Codes

Energy Technology Data Exchange (ETDEWEB)

Kamm, J R; Brock, J S; Brandon, S T; Cotrell, D L; Johnson, B; Knupp, P; Rider, W; Trucano, T; Weirs, V G

2008-10-10

This document discusses problems with which to augment, in quantity and in quality, the existing tri-laboratory suite of verification problems used by Los Alamos National Laboratory (LANL), Lawrence Livermore National Laboratory (LLNL), and Sandia National Laboratories (SNL). The purpose of verification analysis is demonstrate whether the numerical results of the discretization algorithms in physics and engineering simulation codes provide correct solutions of the corresponding continuum equations. The key points of this document are: (1) Verification deals with mathematical correctness of the numerical algorithms in a code, while validation deals with physical correctness of a simulation in a regime of interest. This document is about verification. (2) The current seven-problem Tri-Laboratory Verification Test Suite, which has been used for approximately five years at the DOE WP laboratories, is limited. (3) Both the methodology for and technology used in verification analysis have evolved and been improved since the original test suite was proposed. (4) The proposed test problems are in three basic areas: (a) Hydrodynamics; (b) Transport processes; and (c) Dynamic strength-of-materials. (5) For several of the proposed problems we provide a 'strong sense verification benchmark', consisting of (i) a clear mathematical statement of the problem with sufficient information to run a computer simulation, (ii) an explanation of how the code result and benchmark solution are to be evaluated, and (iii) a description of the acceptance criterion for simulation code results. (6) It is proposed that the set of verification test problems with which any particular code be evaluated include some of the problems described in this document. Analysis of the proposed verification test problems constitutes part of a necessary--but not sufficient--step that builds confidence in physics and engineering simulation codes. More complicated test cases, including physics models of

Approximations of Fuzzy Systems

Directory of Open Access Journals (Sweden)

Vinai K. Singh

2013-03-01

Full Text Available A fuzzy system can uniformly approximate any real continuous function on a compact domain to any degree of accuracy. Such results can be viewed as an existence of optimal fuzzy systems. Li-Xin Wang discussed a similar problem using Gaussian membership function and Stone-Weierstrass Theorem. He established that fuzzy systems, with product inference, centroid defuzzification and Gaussian functions are capable of approximating any real continuous function on a compact set to arbitrary accuracy. In this paper we study a similar approximation problem by using exponential membership functions

Approximate and renormgroup symmetries

Energy Technology Data Exchange (ETDEWEB)

Ibragimov, Nail H. [Blekinge Institute of Technology, Karlskrona (Sweden). Dept. of Mathematics Science; Kovalev, Vladimir F. [Russian Academy of Sciences, Moscow (Russian Federation). Inst. of Mathematical Modeling

2009-07-01

''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)

A New Prime Code for Synchronous Optical Code Division Multiple-Access Networks

Directory of Open Access Journals (Sweden)

Huda Saleh Abbas

2018-01-01

Full Text Available A new spreading code based on a prime code for synchronous optical code-division multiple-access networks that can be used in monitoring applications has been proposed. The new code is referred to as “extended grouped new modified prime code.” This new code has the ability to support more terminal devices than other prime codes. In addition, it patches subsequences with “0s” leading to lower power consumption. The proposed code has an improved cross-correlation resulting in enhanced BER performance. The code construction and parameters are provided. The operating performance, using incoherent on-off keying modulation and incoherent pulse position modulation systems, has been analyzed. The performance of the code was compared with other prime codes. The results demonstrate an improved performance, and a BER floor of 10−9 was achieved.

Understanding Mixed Code and Classroom Code-Switching: Myths and Realities

Science.gov (United States)

Li, David C. S.

2008-01-01

Background: Cantonese-English mixed code is ubiquitous in Hong Kong society, and yet using mixed code is widely perceived as improper. This paper presents evidence of mixed code being socially constructed as bad language behavior. In the education domain, an EDB guideline bans mixed code in the classroom. Teachers are encouraged to stick to…

January: IBM 7094 programme for the resolution of cell problems in planar, spherical and cylindrical geometry using the double Pn approximation

International Nuclear Information System (INIS)

Amouyal, A.; Tariel, H.

1966-01-01

Code name: January 1 st SCEA 011S. 2) Computer: IBM 7094; Programme system: Fortran II, 2 nd version. 3) Nature of the problem: resolution of cell problems with one space variable (planar, spherical and cylindrical geometries) and with one energy group, with isotropic sources in the double P n approximation (DP 1 and DP 3 approximation in planar and spherical geometries, DP 1 and DP 2 in cylindrical geometry). 4) Method used: the differential equations with limiting conditions are transformed into differential system with initial conditions which are integrated by a separate-step method. 5) Restrictions: number of physical media [fr

Retrieval-based Face Annotation by Weak Label Regularized Local Coordinate Coding.

Science.gov (United States)

Wang, Dayong; Hoi, Steven C H; He, Ying; Zhu, Jianke; Mei, Tao; Luo, Jiebo

2013-08-02

Retrieval-based face annotation is a promising paradigm of mining massive web facial images for automated face annotation. This paper addresses a critical problem of such paradigm, i.e., how to effectively perform annotation by exploiting the similar facial images and their weak labels which are often noisy and incomplete. In particular, we propose an effective Weak Label Regularized Local Coordinate Coding (WLRLCC) technique, which exploits the principle of local coordinate coding in learning sparse features, and employs the idea of graph-based weak label regularization to enhance the weak labels of the similar facial images. We present an efficient optimization algorithm to solve the WLRLCC task. We conduct extensive empirical studies on two large-scale web facial image databases: (i) a Western celebrity database with a total of $6,025$ persons and $714,454$ web facial images, and (ii)an Asian celebrity database with $1,200$ persons and $126,070$ web facial images. The encouraging results validate the efficacy of the proposed WLRLCC algorithm. To further improve the efficiency and scalability, we also propose a PCA-based approximation scheme and an offline approximation scheme (AWLRLCC), which generally maintains comparable results but significantly saves much time cost. Finally, we show that WLRLCC can also tackle two existing face annotation tasks with promising performance.

Development of a coupled code system based on system transient code, RETRAN, and 3-D neutronics code, MASTER

International Nuclear Information System (INIS)

Kim, K. D.; Jung, J. J.; Lee, S. W.; Cho, B. O.; Ji, S. K.; Kim, Y. H.; Seong, C. K.

2002-01-01

A coupled code system of RETRAN/MASTER has been developed for best-estimate simulations of interactions between reactor core neutron kinetics and plant thermal-hydraulics by incorporation of a 3-D reactor core kinetics analysis code, MASTER into system transient code, RETRAN. The soundness of the consolidated code system is confirmed by simulating the MSLB benchmark problem developed to verify the performance of a coupled kinetics and system transient codes by OECD/NEA

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…

Cosmological applications of Padé approximant

International Nuclear Information System (INIS)

Wei, Hao; Yan, Xiao-Peng; Zhou, Ya-Nan

2014-01-01

As is well known, in mathematics, any function could be approximated by the Padé approximant. The Padé approximant is the best approximation of a function by a rational function of given order. In fact, the Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. In the present work, we consider the Padé approximant in two issues. First, we obtain the analytical approximation of the luminosity distance for the flat XCDM model, and find that the relative error is fairly small. Second, we propose several parameterizations for the equation-of-state parameter (EoS) of dark energy based on the Padé approximant. They are well motivated from the mathematical and physical points of view. We confront these EoS parameterizations with the latest observational data, and find that they can work well. In these practices, we show that the Padé approximant could be an useful tool in cosmology, and it deserves further investigation

Cosmological applications of Padé approximant

Science.gov (United States)

Wei, Hao; Yan, Xiao-Peng; Zhou, Ya-Nan

2014-01-01

As is well known, in mathematics, any function could be approximated by the Padé approximant. The Padé approximant is the best approximation of a function by a rational function of given order. In fact, the Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. In the present work, we consider the Padé approximant in two issues. First, we obtain the analytical approximation of the luminosity distance for the flat XCDM model, and find that the relative error is fairly small. Second, we propose several parameterizations for the equation-of-state parameter (EoS) of dark energy based on the Padé approximant. They are well motivated from the mathematical and physical points of view. We confront these EoS parameterizations with the latest observational data, and find that they can work well. In these practices, we show that the Padé approximant could be an useful tool in cosmology, and it deserves further investigation.

Prestack wavefield approximations

KAUST Repository

Alkhalifah, Tariq

2013-01-01

The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.

Prestack wavefield approximations

KAUST Repository

Alkhalifah, Tariq

2013-09-01

The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.

Expectation Consistent Approximate Inference

DEFF Research Database (Denmark)

Opper, Manfred; Winther, Ole

2005-01-01

We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability dis...

Approximate number and approximate time discrimination each correlate with school math abilities in young children.

Science.gov (United States)

Odic, Darko; Lisboa, Juan Valle; Eisinger, Robert; Olivera, Magdalena Gonzalez; Maiche, Alejandro; Halberda, Justin

2016-01-01

What is the relationship between our intuitive sense of number (e.g., when estimating how many marbles are in a jar), and our intuitive sense of other quantities, including time (e.g., when estimating how long it has been since we last ate breakfast)? Recent work in cognitive, developmental, comparative psychology, and computational neuroscience has suggested that our representations of approximate number, time, and spatial extent are fundamentally linked and constitute a "generalized magnitude system". But, the shared behavioral and neural signatures between number, time, and space may alternatively be due to similar encoding and decision-making processes, rather than due to shared domain-general representations. In this study, we investigate the relationship between approximate number and time in a large sample of 6-8 year-old children in Uruguay by examining how individual differences in the precision of number and time estimation correlate with school mathematics performance. Over four testing days, each child completed an approximate number discrimination task, an approximate time discrimination task, a digit span task, and a large battery of symbolic math tests. We replicate previous reports showing that symbolic math abilities correlate with approximate number precision and extend those findings by showing that math abilities also correlate with approximate time precision. But, contrary to approximate number and time sharing common representations, we find that each of these dimensions uniquely correlates with formal math: approximate number correlates more strongly with formal math compared to time and continues to correlate with math even when precision in time and individual differences in working memory are controlled for. These results suggest that there are important differences in the mental representations of approximate number and approximate time and further clarify the relationship between quantity representations and mathematics. Copyright �

Some Families of Asymmetric Quantum MDS Codes Constructed from Constacyclic Codes

Science.gov (United States)

Huang, Yuanyuan; Chen, Jianzhang; Feng, Chunhui; Chen, Riqing

2018-02-01

Quantum maximal-distance-separable (MDS) codes that satisfy quantum Singleton bound with different lengths have been constructed by some researchers. In this paper, seven families of asymmetric quantum MDS codes are constructed by using constacyclic codes. We weaken the case of Hermitian-dual containing codes that can be applied to construct asymmetric quantum MDS codes with parameters [[n,k,dz/dx

Approximation and Computation

CERN Document Server

Gautschi, Walter; Rassias, Themistocles M

2011-01-01

Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg

Variation in clinical coding lists in UK general practice: a barrier to consistent data entry?

Science.gov (United States)

Tai, Tracy Waize; Anandarajah, Sobanna; Dhoul, Neil; de Lusignan, Simon

2007-01-01

Routinely collected general practice computer data are used for quality improvement; poor data quality including inconsistent coding can reduce their usefulness. To document the diversity of data entry systems currently in use in UK general practice and highlight possible implications for data quality. General practice volunteers provided screen shots of the clinical coding screen they would use to code a diagnosis or problem title in the clinical consultation. The six clinical conditions examined were: depression, cystitis, type 2 diabetes mellitus, sore throat, tired all the time, and myocardial infarction. We looked at the picking lists generated for these problem titles in EMIS, IPS, GPASS and iSOFT general practice clinical computer systems, using the Triset browser as a gold standard for comparison. A mean of 19.3 codes is offered in the picking list after entering a diagnosis or problem title. EMIS produced the longest picking lists and GPASS the shortest, with a mean number of choices of 35.2 and 12.7, respectively. Approximately three-quarters (73.5%) of codes are diagnoses, one-eighth (12.5%) symptom codes, and the remainder come from a range of Read chapters. There was no readily detectable consistent order in which codes were displayed. Velocity coding, whereby commonly-used codes are placed higher in the picking list, results in variation between practices even where they have the same brand of computer system. Current systems for clinical coding promote diversity rather than consistency of clinical coding. As the UK moves towards an integrated health IT system consistency of coding will become more important. A standardised, limited list of codes for primary care might help address this need.

Theoretical Atomic Physics code development II: ACE: Another collisional excitation code

International Nuclear Information System (INIS)

Clark, R.E.H.; Abdallah, J. Jr.; Csanak, G.; Mann, J.B.; Cowan, R.D.

1988-12-01

A new computer code for calculating collisional excitation data (collision strengths or cross sections) using a variety of models is described. The code uses data generated by the Cowan Atomic Structure code or CATS for the atomic structure. Collisional data are placed on a random access file and can be displayed in a variety of formats using the Theoretical Atomic Physics Code or TAPS. All of these codes are part of the Theoretical Atomic Physics code development effort at Los Alamos. 15 refs., 10 figs., 1 tab

Multiple LDPC decoding for distributed source coding and video coding

DEFF Research Database (Denmark)

Forchhammer, Søren; Luong, Huynh Van; Huang, Xin

2011-01-01

Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...

Low-Complexity Multiple Description Coding of Video Based on 3D Block Transforms

Directory of Open Access Journals (Sweden)

Andrey Norkin

2007-02-01

Full Text Available The paper presents a multiple description (MD video coder based on three-dimensional (3D transforms. Two balanced descriptions are created from a video sequence. In the encoder, video sequence is represented in a form of coarse sequence approximation (shaper included in both descriptions and residual sequence (details which is split between two descriptions. The shaper is obtained by block-wise pruned 3D-DCT. The residual sequence is coded by 3D-DCT or hybrid, LOT+DCT, 3D-transform. The coding scheme is targeted to mobile devices. It has low computational complexity and improved robustness of transmission over unreliable networks. The coder is able to work at very low redundancies. The coding scheme is simple, yet it outperforms some MD coders based on motion-compensated prediction, especially in the low-redundancy region. The margin is up to 3 dB for reconstruction from one description.

Constrained Optimization via Stochastic approximation with a simultaneous perturbation gradient approximation

DEFF Research Database (Denmark)

Sadegh, Payman

1997-01-01

This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...... of the optimization parameters. It is shown that, under application of the projection algorithm, the parameter iterate converges almost surely to a Kuhn-Tucker point, The procedure is illustrated by a numerical example, (C) 1997 Elsevier Science Ltd....

A new formulation for the Doppler broadening function relaxing the approximations of Beth–Plackzec

International Nuclear Information System (INIS)

Palma, Daniel A.P.; Gonçalves, Alessandro C.; Martinez, Aquilino S.; Mesquita, Amir Z.

2016-01-01

Highlights: • One of the Beth–Placzek approximation were relaxed. • An additional term in the form of an integral is obtained. • A new mathematical formulation for the Doppler broadening function is proposed. - Abstract: In all nuclear reactors some neutrons can be absorbed in the resonance region and, in the design of these reactors, an accurate treatment of the resonant absorptions is essential. Apart from that, the resonant absorption varies with fuel temperature due to the Doppler broadening of the resonances. The thermal agitation movement in the reactor core is adequately represented in the microscopic cross-section of the neutron-core interaction through the Doppler broadening function. This function is calculated numerically in modern systems for the calculation of macro-group constants, necessary to determine the power distribution of a nuclear reactor. It can also be applied to the calculation of self-shielding factors to correct the measurements of the microscopic cross-sections through the activation technique and used for the approximate calculations of the resonance integrals in heterogeneous fuel cells. In these types of application we can point at the need to develop precise analytical approximations for the Doppler broadening function to be used in the calculation codes that calculate the values of this function. However, the Doppler broadening function is based on a series of approximations proposed by Beth–Plackzec. In this work a relaxation of these approximations is proposed, generating an additional term in the form of an integral. Analytical solutions of this additional term are discussed. The results obtained show that the new term is important for high temperatures.

Some results in Diophantine approximation

DEFF Research Database (Denmark)

Pedersen, Steffen Højris

the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered......This thesis consists of three papers in Diophantine approximation, a subbranch of number theory. Preceding these papers is an introduction to various aspects of Diophantine approximation and formal Laurent series over Fq and a summary of each of the three papers. The introduction introduces...

Bounded-Degree Approximations of Stochastic Networks

Energy Technology Data Exchange (ETDEWEB)

Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

2017-06-01

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.

Offshore Code Comparison Collaboration within IEA Wind Task 23: Phase IV Results Regarding Floating Wind Turbine Modeling; Preprint

Energy Technology Data Exchange (ETDEWEB)

Jonkman, J.; Larsen, T.; Hansen, A.; Nygaard, T.; Maus, K.; Karimirad, M.; Gao, Z.; Moan, T.; Fylling, I.

2010-04-01

Offshore wind turbines are designed and analyzed using comprehensive simulation codes that account for the coupled dynamics of the wind inflow, aerodynamics, elasticity, and controls of the turbine, along with the incident waves, sea current, hydrodynamics, and foundation dynamics of the support structure. This paper describes the latest findings of the code-to-code verification activities of the Offshore Code Comparison Collaboration, which operates under Subtask 2 of the International Energy Agency Wind Task 23. In the latest phase of the project, participants used an assortment of codes to model the coupled dynamic response of a 5-MW wind turbine installed on a floating spar buoy in 320 m of water. Code predictions were compared from load-case simulations selected to test different model features. The comparisons have resulted in a greater understanding of offshore floating wind turbine dynamics and modeling techniques, and better knowledge of the validity of various approximations. The lessons learned from this exercise have improved the participants' codes, thus improving the standard of offshore wind turbine modeling.

Effect of difference between group constants processed by codes TIMS and ETOX on integral quantities

International Nuclear Information System (INIS)

Takano, Hideki; Ishiguro, Yukio; Matsui, Yasushi.

1978-06-01

Group constants of 235 U, 238 U, 239 Pu, 240 Pu and 241 Pu have been produced with the processing code TIMS using the evaluated nuclear data of JENDL-1. The temperature and composition dependent self-shielding factors have been calculated for the two cases with and without considering mutual interference resonant nuclei. By using the group constants set produced by the TIMS code, the integral quantities, i.e. multiplication factor, Na-void reactivity effect and Doppler reactivity effect, are calculated and compared with those calculated with the use of the cross sections set produced by the ETOX code to evaluate accuracy of the approximate calculation method in ETOX. There is much difference in self-shielding factor in each energy group between the two codes. For the fast reactor assemblies under study, however, the integral quantities calculated with these two sets are in good agreement with each other, because of eventual cancelation of errors. (auth.)

Error-correction coding and decoding bounds, codes, decoders, analysis and applications

CERN Document Server

Tomlinson, Martin; Ambroze, Marcel A; Ahmed, Mohammed; Jibril, Mubarak

2017-01-01

This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies, from smartphones to secure communications and transactions. Written in a readily understandable style, the book presents the authors’ twenty-five years of research organized into five parts: Part I is concerned with the theoretical performance attainable by using error correcting codes to achieve communications efficiency in digital communications systems. Part II explores the construction of error-correcting codes and explains the different families of codes and how they are designed. Techniques are described for producing the very best codes. Part III addresses the analysis of low-density parity-check (LDPC) codes, primarily to calculate their stopping sets and low-weight codeword spectrum which determines the performance of these codes. Part IV deals with decoders desi...

Development of a dose assessment computer code for the NPP severe accident at intermediate level - Korean case

International Nuclear Information System (INIS)

Cheong, J.H.; Lee, K.J.; Cho, H.Y.; Lim, J.H.

1993-01-01

A real-time dose assessment computer code named RADCON (RADiological CONsequence analysis) has been developed. An approximation method describing the distribution of radionuclides in a puff was proposed and implemented in the code. This method is expected to reduce the time required to calculate the cloud shine (external dose from radioactive plumes). RADCON can simulate an NPP emergency situation by considering complex topography and continuous washout phenomena and provide a function of effective emergency planning. To verify the code results, RADCON has been compared with RASCAL, which was developed for the U.S. NRC by ORNL, for eight hypothetical accident scenarios. Sensitivity analysis was also performed for the important input parameters. (2 tabs., 3 figs.)

Newly-Developed 3D GRMHD Code and its Application to Jet Formation

Science.gov (United States)

Mizuno, Y.; Nishikawa, K.-I.; Koide, S.; Hardee, P.; Fishman, G. J.

2006-01-01

We have developed a new three-dimensional general relativistic magnetohydrodynamic code by using a conservative, high-resolution shock-capturing scheme. The numerical fluxes are calculated using the HLL approximate Riemann solver scheme. The flux-interpolated constrained transport scheme is used to maintain a divergence-free magnetic field. We have performed various 1-dimensional test problems in both special and general relativity by using several reconstruction methods and found that the new 3D GRMHD code shows substantial improvements over our previous model. The . preliminary results show the jet formations from a geometrically thin accretion disk near a non-rotating and a rotating black hole. We will discuss the jet properties depended on the rotation of a black hole and the magnetic field strength.

Annealing simulation of cascade damage using MARLOWE-DAIQUIRI codes

International Nuclear Information System (INIS)

Muroga, Takeo

1984-01-01

The localization effect of the defects generated by the cascade damage on the properties of solids was studied by using a computer code. The code is based on the two-body collision approximation method and the Monte Carlo method. The MARLOWE and DAIQUIRI codes were partly improved to fit the present calculation of the annealing of cascade damage. The purpose of this study is to investigate the behavior of defects under the simulated reactive and irradiation condition. Calculation was made for alpha iron (BCC), and the threshold energy was set at 40 eV. The temperature dependence of annealing and the growth of a cluster were studied. The overlapping effect of cascade was studied. At first, the extreme case of overlapping was studied, then the practical cases were estimated by interpolation. The state of overlapping of cascade corresponded to the irradiation speed. The interaction between cascade and dislocations was studied, and the calculation of the annealing of primary knock-out atoms (PKA) in alpha iron was performed. At low temperature, the effect of dislocations was large, but the growth of vacancy was not seen. At high temperature, the effect of dislocations was small. The evaluation of the simulation of various ion irradiation and the growth efficiency of defects were performed. (Kato, T.)

Error floor behavior study of LDPC codes for concatenated codes design

Science.gov (United States)

Chen, Weigang; Yin, Liuguo; Lu, Jianhua

2007-11-01

Error floor behavior of low-density parity-check (LDPC) codes using quantized decoding algorithms is statistically studied with experimental results on a hardware evaluation platform. The results present the distribution of the residual errors after decoding failure and reveal that the number of residual error bits in a codeword is usually very small using quantized sum-product (SP) algorithm. Therefore, LDPC code may serve as the inner code in a concatenated coding system with a high code rate outer code and thus an ultra low error floor can be achieved. This conclusion is also verified by the experimental results.

Health Impact Assessment (HIA) of Proposed Code Changes Regarding Onsite Sewage Disposal Systems in Suffolk County, NY

Science.gov (United States)

The U.S. Environmental Protection Agency (EPA) conducted a Health Impact Assessment (HIA) of proposed code changes regarding residential onsite sewage disposal systems (OSDS) in Suffolk County, New York. Of the approximately 569,000 housing units in Suffolk County, 365,000 are no...

Approximation by planar elastic curves

DEFF Research Database (Denmark)

Brander, David; Gravesen, Jens; Nørbjerg, Toke Bjerge

2016-01-01

We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good initial guess for the approximating curve. A gradient......-driven optimization is then used to find the approximating elastic curve....

Binary-State Dynamics on Complex Networks: Pair Approximation and Beyond

Directory of Open Access Journals (Sweden)

James P. Gleeson

2013-04-01

Full Text Available A wide class of binary-state dynamics on networks—including, for example, the voter model, the Bass diffusion model, and threshold models—can be described in terms of transition rates (spin-flip probabilities that depend on the number of nearest neighbors in each of the two possible states. High-accuracy approximations for the emergent dynamics of such models on uncorrelated, infinite networks are given by recently developed compartmental models or approximate master equations (AMEs. Pair approximations (PAs and mean-field theories can be systematically derived from the AME. We show that PA and AME solutions can coincide under certain circumstances, and numerical simulations confirm that PA is highly accurate in these cases. For monotone dynamics (where transitions out of one nodal state are impossible, e.g., susceptible-infected disease spread or Bass diffusion, PA and the AME give identical results for the fraction of nodes in the infected (active state for all time, provided that the rate of infection depends linearly on the number of infected neighbors. In the more general nonmonotone case, we derive a condition—that proves to be equivalent to a detailed balance condition on the dynamics—for PA and AME solutions to coincide in the limit t→∞. This equivalence permits bifurcation analysis, yielding explicit expressions for the critical (ferromagnetic or paramagnetic transition point of such dynamics, that is closely analogous to the critical temperature of the Ising spin model. Finally, the AME for threshold models of propagation is shown to reduce to just two differential equations and to give excellent agreement with numerical simulations. As part of this work, the Octave or Matlab code for implementing and solving the differential-equation systems is made available for download.

Limitations of shallow nets approximation.

Science.gov (United States)

Lin, Shao-Bo

2017-10-01

In this paper, we aim at analyzing the approximation abilities of shallow networks in reproducing kernel Hilbert spaces (RKHSs). We prove that there is a probability measure such that the achievable lower bound for approximating by shallow nets can be realized for all functions in balls of reproducing kernel Hilbert space with high probability, which is different with the classical minimax approximation error estimates. This result together with the existing approximation results for deep nets shows the limitations for shallow nets and provides a theoretical explanation on why deep nets perform better than shallow nets. Copyright © 2017 Elsevier Ltd. All rights reserved.

Improved core-edge tokamak transport simulations with the CORSICA 2 code

International Nuclear Information System (INIS)

Tarditi, A.; Cohen, R.H.; Crotinger, J.A.

1996-01-01

The CORSICA 2 code models the nonlinear transport between the core and the edge of a tokamak plasma. The code couples a 2D axisymmetric edge/SOL model (UEDGE) to a 1D model for the radial core transport in toroidal flux coordinates (the transport module from the CORSICA 1 code). The core density and temperature profiles are joined to the flux-surface average profiles from the 2D code sufficiently inside the magnetic separatrix, at a flux surface on which the edge profiles are approximately constant. In the present version of the code, the deuterium density and electron and ion temperatures are coupled. The electron density is determined by imposing quasi-neutrality, both in the core and in the edge. The model allows the core-edge coupling of multiple ion densities while retaining a single temperature (corresponding to the equilibration value) for the all ion species. Applications of CORSICA 2 to modeling the DIII-D tokamak are discussed. This work will focus on the simulation of the L-H transition, coupling a single ion species (deuterium) and the two (electron and ion) temperatures. These simulations will employ a new self-consistent model for the L-H transition that is being implemented in the UEDGE code. Applications to the modeling of ITER ignition scenarios are also discussed. This will involve coupling a second density species (the thermal alphas), bringing the total number of coupled variables up to four. Finally, the progress in evolving the magnetic geometry is discussed. Currently, this geometry is calculated by CORSICA's MHD equilibrium module (TEQ) at the beginning of the run and fixed thereafter. However, CORSICA 1 can evolve this geometry quasistatically, and this quasistatic treatment is being extended to include the edge/SOL geometry. Recent improvements for code speed-up are also presented

Reactor lattice codes

International Nuclear Information System (INIS)

Kulikowska, T.

1999-01-01

The present lecture has a main goal to show how the transport lattice calculations are realised in a standard computer code. This is illustrated on the example of the WIMSD code, belonging to the most popular tools for reactor calculations. Most of the approaches discussed here can be easily modified to any other lattice code. The description of the code assumes the basic knowledge of reactor lattice, on the level given in the lecture on 'Reactor lattice transport calculations'. For more advanced explanation of the WIMSD code the reader is directed to the detailed descriptions of the code cited in References. The discussion of the methods and models included in the code is followed by the generally used homogenisation procedure and several numerical examples of discrepancies in calculated multiplication factors based on different sources of library data. (author)

CodeArmor : Virtualizing the Code Space to Counter Disclosure Attacks

NARCIS (Netherlands)

Chen, Xi; Bos, Herbert; Giuffrida, Cristiano

2017-01-01

Code diversification is an effective strategy to prevent modern code-reuse exploits. Unfortunately, diversification techniques are inherently vulnerable to information disclosure. Recent diversification-aware ROP exploits have demonstrated that code disclosure attacks are a realistic threat, with an

An Evaluation of Automated Code Generation with the PetriCode Approach

DEFF Research Database (Denmark)

Simonsen, Kent Inge

2014-01-01

Automated code generation is an important element of model driven development methodologies. We have previously proposed an approach for code generation based on Coloured Petri Net models annotated with textual pragmatics for the network protocol domain. In this paper, we present and evaluate thr...... important properties of our approach: platform independence, code integratability, and code readability. The evaluation shows that our approach can generate code for a wide range of platforms which is integratable and readable....

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

Approximate L0 constrained Non-negative Matrix and Tensor Factorization

DEFF Research Database (Denmark)

Mørup, Morten; Madsen, Kristoffer Hougaard; Hansen, Lars Kai

2008-01-01

Non-negative matrix factorization (NMF), i.e. V = WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based representation. The NMF decomposition is not in general unique and a part based representation not guaranteed. However...... constraint. In general, solving for a given L0 norm is an NP hard problem thus convex relaxatin to regularization by the L1 norm is often considered, i.e., minimizing ( 1/2 ||V-WHk||^2+lambda|H|_1). An open problem is to control the degree of sparsity imposed. We here demonstrate that a full regularization......, the L1 regularization strength lambda that best approximates a given L0 can be directly accessed and in effect used to control the sparsity of H. The MATLAB code for the NLARS algorithm is available for download....

Cracking the code: the accuracy of coding shoulder procedures and the repercussions.

Science.gov (United States)

Clement, N D; Murray, I R; Nie, Y X; McBirnie, J M

2013-05-01

Coding of patients' diagnosis and surgical procedures is subject to error levels of up to 40% with consequences on distribution of resources and financial recompense. Our aim was to explore and address reasons behind coding errors of shoulder diagnosis and surgical procedures and to evaluate a potential solution. A retrospective review of 100 patients who had undergone surgery was carried out. Coding errors were identified and the reasons explored. A coding proforma was designed to address these errors and was prospectively evaluated for 100 patients. The financial implications were also considered. Retrospective analysis revealed the correct primary diagnosis was assigned in 54 patients (54%) had an entirely correct diagnosis, and only 7 (7%) patients had a correct procedure code assigned. Coders identified indistinct clinical notes and poor clarity of procedure codes as reasons for errors. The proforma was significantly more likely to assign the correct diagnosis (odds ratio 18.2, p code (odds ratio 310.0, p coding department. High error levels for coding are due to misinterpretation of notes and ambiguity of procedure codes. This can be addressed by allowing surgeons to assign the diagnosis and procedure using a simplified list that is passed directly to coding.

A summary of methods for approximating salt creep and disposal room closure in numerical models of multiphase flow

Energy Technology Data Exchange (ETDEWEB)

Freeze, G.A.; Larson, K.W. [INTERA, Inc., Albuquerque, NM (United States); Davies, P.B. [Sandia National Labs., Albuquerque, NM (United States)

1995-10-01

Eight alternative methods for approximating salt creep and disposal room closure in a multiphase flow model of the Waste Isolation Pilot Plant (WIPP) were implemented and evaluated: Three fixed-room geometries three porosity functions and two fluid-phase-salt methods. The pressure-time-porosity line interpolation method is the method used in current WIPP Performance Assessment calculations. The room closure approximation methods were calibrated against a series of room closure simulations performed using a creep closure code, SANCHO. The fixed-room geometries did not incorporate a direct coupling between room void volume and room pressure. The two porosity function methods that utilized moles of gas as an independent parameter for closure coupling. The capillary backstress method was unable to accurately simulate conditions of re-closure of the room. Two methods were found to be accurate enough to approximate the effects of room closure; the boundary backstress method and pressure-time-porosity line interpolation. The boundary backstress method is a more reliable indicator of system behavior due to a theoretical basis for modeling salt deformation as a viscous process. It is a complex method and a detailed calibration process is required. The pressure lines method is thought to be less reliable because the results were skewed towards SANCHO results in simulations where the sequence of gas generation was significantly different from the SANCHO gas-generation rate histories used for closure calibration. This limitation in the pressure lines method is most pronounced at higher gas-generation rates and is relatively insignificant at lower gas-generation rates. Due to its relative simplicity, the pressure lines method is easier to implement in multiphase flow codes and simulations have a shorter execution time.

A summary of methods for approximating salt creep and disposal room closure in numerical models of multiphase flow

International Nuclear Information System (INIS)

Freeze, G.A.; Larson, K.W.; Davies, P.B.

1995-10-01

Eight alternative methods for approximating salt creep and disposal room closure in a multiphase flow model of the Waste Isolation Pilot Plant (WIPP) were implemented and evaluated: Three fixed-room geometries three porosity functions and two fluid-phase-salt methods. The pressure-time-porosity line interpolation method is the method used in current WIPP Performance Assessment calculations. The room closure approximation methods were calibrated against a series of room closure simulations performed using a creep closure code, SANCHO. The fixed-room geometries did not incorporate a direct coupling between room void volume and room pressure. The two porosity function methods that utilized moles of gas as an independent parameter for closure coupling. The capillary backstress method was unable to accurately simulate conditions of re-closure of the room. Two methods were found to be accurate enough to approximate the effects of room closure; the boundary backstress method and pressure-time-porosity line interpolation. The boundary backstress method is a more reliable indicator of system behavior due to a theoretical basis for modeling salt deformation as a viscous process. It is a complex method and a detailed calibration process is required. The pressure lines method is thought to be less reliable because the results were skewed towards SANCHO results in simulations where the sequence of gas generation was significantly different from the SANCHO gas-generation rate histories used for closure calibration. This limitation in the pressure lines method is most pronounced at higher gas-generation rates and is relatively insignificant at lower gas-generation rates. Due to its relative simplicity, the pressure lines method is easier to implement in multiphase flow codes and simulations have a shorter execution time

Approximate circuits for increased reliability

Science.gov (United States)

Hamlet, Jason R.; Mayo, Jackson R.

2015-08-18

Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.

LUCKY-TD code for solving the time-dependent transport equation with the use of parallel computations

Energy Technology Data Exchange (ETDEWEB)

Moryakov, A. V., E-mail: sailor@orc.ru [National Research Centre Kurchatov Institute (Russian Federation)

2016-12-15

An algorithm for solving the time-dependent transport equation in the P{sub m}S{sub n} group approximation with the use of parallel computations is presented. The algorithm is implemented in the LUCKY-TD code for supercomputers employing the MPI standard for the data exchange between parallel processes.

Mapping moveout approximations in TI media

KAUST Repository

Stovas, Alexey; Alkhalifah, Tariq Ali

2013-01-01

Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.

Analytical approximation of neutron physics data

International Nuclear Information System (INIS)

Badikov, S.A.; Vinogradov, V.A.; Gaj, E.V.; Rabotnov, N.S.

1984-01-01

The method for experimental neutron-physical data analytical approximation by rational functions based on the Pade approximation is suggested. It is shown that the existence of the Pade approximation specific properties in polar zones is an extremely favourable analytical property essentially extending the convergence range and increasing its rate as compared with polynomial approximation. The Pade approximation is the particularly natural instrument for resonance curve processing as the resonances conform to the complex poles of the approximant. But even in a general case analytical representation of the data in this form is convenient and compact. Thus representation of the data on the neutron threshold reaction cross sections (BOSPOR constant library) in the form of rational functions lead to approximately twenty fold reduction of the storaged numerical information as compared with the by-point calculation at the same accWracy

Mapping moveout approximations in TI media

KAUST Repository

Stovas, Alexey

2013-11-21

Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.

The MARS15-based FermiCORD code system for calculation of the accelerator-induced residual dose

Science.gov (United States)

Grebe, A.; Leveling, A.; Lu, T.; Mokhov, N.; Pronskikh, V.

2018-01-01

The FermiCORD code system, a set of codes based on MARS15 that calculates the accelerator-induced residual doses at experimental facilities of arbitrary configurations, has been developed. FermiCORD is written in C++ as an add-on to Fortran-based MARS15. The FermiCORD algorithm consists of two stages: 1) simulation of residual doses on contact with the surfaces surrounding the studied location and of radionuclide inventories in the structures surrounding those locations using MARS15, and 2) simulation of the emission of the nuclear decay γ-quanta by the residuals in the activated structures and scoring the prompt doses of these γ-quanta at arbitrary distances from those structures. The FermiCORD code system has been benchmarked against similar algorithms based on other code systems and against experimental data from the CERF facility at CERN, and FermiCORD showed reasonable agreement with these. The code system has been applied for calculation of the residual dose of the target station for the Mu2e experiment and the results have been compared to approximate dosimetric approaches.

Construction of new quantum MDS codes derived from constacyclic codes

Science.gov (United States)

Taneja, Divya; Gupta, Manish; Narula, Rajesh; Bhullar, Jaskaran

Obtaining quantum maximum distance separable (MDS) codes from dual containing classical constacyclic codes using Hermitian construction have paved a path to undertake the challenges related to such constructions. Using the same technique, some new parameters of quantum MDS codes have been constructed here. One set of parameters obtained in this paper has achieved much larger distance than work done earlier. The remaining constructed parameters of quantum MDS codes have large minimum distance and were not explored yet.

Development of an analysis code for pressure wave propagation, (1)

International Nuclear Information System (INIS)

Tanaka, Yoshihisa; Sakano, Kosuke; Shindo, Yoshihisa

1974-11-01

We analyzed the propagation of the pressure-wave in the piping system of SWAT-1B rig by using SWAC-5 Code. We carried out analyses on the following parts. 1) A straight pipe 2) Branches 3) A piping system The results obtained in these analyses are as follows. 1) The present our model simulates well the straight pipe and the branch with the same diameters. 2) The present our model simulates approximately the branch with the different diameters and the piping system. (auth.)

Nuclear Hartree-Fock approximation testing and other related approximations

International Nuclear Information System (INIS)

Cohenca, J.M.

1970-01-01

Hartree-Fock, and Tamm-Dancoff approximations are tested for angular momentum of even-even nuclei. Wave functions, energy levels and momenta are comparatively evaluated. Quadripole interactions are studied following the Elliott model. Results are applied to Ne 20 [pt

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

Code-Mixing and Code Switchingin The Process of Learning

Directory of Open Access Journals (Sweden)

Diyah Atiek Mustikawati

2016-09-01

Full Text Available This study aimed to describe a form of code switching and code mixing specific form found in the teaching and learning activities in the classroom as well as determining factors influencing events stand out that form of code switching and code mixing in question.Form of this research is descriptive qualitative case study which took place in Al Mawaddah Boarding School Ponorogo. Based on the analysis and discussion that has been stated in the previous chapter that the form of code mixing and code switching learning activities in Al Mawaddah Boarding School is in between the use of either language Java language, Arabic, English and Indonesian, on the use of insertion of words, phrases, idioms, use of nouns, adjectives, clauses, and sentences. Code mixing deciding factor in the learning process include: Identification of the role, the desire to explain and interpret, sourced from the original language and its variations, is sourced from a foreign language. While deciding factor in the learning process of code, includes: speakers (O1, partners speakers (O2, the presence of a third person (O3, the topic of conversation, evoke a sense of humour, and just prestige. The significance of this study is to allow readers to see the use of language in a multilingual society, especially in AL Mawaddah boarding school about the rules and characteristics variation in the language of teaching and learning activities in the classroom. Furthermore, the results of this research will provide input to the ustadz / ustadzah and students in developing oral communication skills and the effectiveness of teaching and learning strategies in boarding schools.

Using Coding Apps to Support Literacy Instruction and Develop Coding Literacy

Science.gov (United States)

Hutchison, Amy; Nadolny, Larysa; Estapa, Anne

2016-01-01

In this article the authors present the concept of Coding Literacy and describe the ways in which coding apps can support the development of Coding Literacy and disciplinary and digital literacy skills. Through detailed examples, we describe how coding apps can be integrated into literacy instruction to support learning of the Common Core English…

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.

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.

DISP1 code

International Nuclear Information System (INIS)

Vokac, P.

1999-12-01

DISP1 code is a simple tool for assessment of the dispersion of the fission product cloud escaping from a nuclear power plant after an accident. The code makes it possible to tentatively check the feasibility of calculations by more complex PSA3 codes and/or codes for real-time dispersion calculations. The number of input parameters is reasonably low and the user interface is simple enough to allow a rapid processing of sensitivity analyses. All input data entered through the user interface are stored in the text format. Implementation of dispersion model corrections taken from the ARCON96 code enables the DISP1 code to be employed for assessment of the radiation hazard within the NPP area, in the control room for instance. (P.A.)

ZEST: A Fast Code for Simulating Zeeman-Stark Line-Shape Functions

Directory of Open Access Journals (Sweden)

Franck Gilleron

2018-03-01

Full Text Available We present the ZEST code, dedicated to the calculation of line shapes broadened by Zeeman and Stark effects. As concerns the Stark effect, the model is based on the Standard Lineshape Theory in which ions are treated in the quasi-static approximation, whereas the effects of electrons are represented by weak collisions in the framework of a binary collision relaxation theory. A static magnetic field may be taken into account in the radiator Hamiltonian in the dipole approximation, which leads to additional Zeeman splitting patterns. Ion dynamics effects are implemented using the fast Frequency-Fluctuation Model. For fast calculations, the static ion microfield distribution in the plasma is evaluated using analytic fits of Monte-Carlo simulations, which depend only on the ion-ion coupling parameter and the electron-ion screening factor.

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

Studies on the liquid fluoride thorium reactor: Comparative neutronics analysis of MCNP6 code with SRAC95 reactor analysis code based on FUJI-U3-(0)

Energy Technology Data Exchange (ETDEWEB)

Jaradat, S.Q., E-mail: sqjxv3@mst.edu; Alajo, A.B., E-mail: alajoa@mst.edu

2017-04-01

Highlights: • The verification for FUJI-U3-(0)—a molten salt reactor—was performed. • The MCNP6 was used to study the reactor physics characteristics for FUJI-U3 type. • The results from the MCNP6 were comparable with the ones obtained from literature. - Abstract: The verification for FUJI-U3-(0)—a molten salt reactor—was performed. The reactor used LiF-BeF2-ThF4-UF4 as the mixed liquid fuel salt, and the core was graphite moderated. The MCNP6 code was used to study the reactor physics characteristics for the FUJI-U3-(0) reactor. Results for reactor physics characteristic of the FUJI-U3-(0) exist in literature, which were used as reference. The reference results were obtained using SRAC95 (a reactor analysis code) coupled with ORIGEN2 (a depletion code). Some modifications were made in the reconstruction of the FUJI-U3-(0) reactor in MCNP due to unavailability of more detailed description of the reactor core. The assumptions resulted in two representative models of the reactor. The results from the MCNP6 models were compared with the reference results obtained from literature. The results were comparable with each other, but with some notable differences. The differences are because of the approximations that were done on the SRAC95 model of the FUJI-U3 to simplify the simulation. Based on the results, it is concluded that MCNP6 code predicts well the overall simulation of neutronics analysis to the previous simulation works using SRAC95 code.

On the use of the HOTSPOT code for evaluating accidents involving radioactive materials

International Nuclear Information System (INIS)

Sattinger, D.; Sarussi, R.; Tzarfati, Y.; Levinson, S.; Tshuva, A.

2004-01-01

The HOTSPOT Health Physics code was created by LLNL in order to provide Health Physics personnel with a fast, field portable calculation tool for evaluating accidents involving radioactive materials. The HOTSPOT code is a first order approximation of the radiation effects associated with the atmospheric release of radioactive materials. HOTSPOT programs are reasonably accurate for a timely initial assessment. More importantly, HOTSPOT code produce a consistent output for the same input assumptions, and minimize the probability of errors associated with reading a graph incorrectly. Four general programs, Plume, Explosion, Fire, and Resuspension, calculate a downwind assessment following the release of radioactive material resulting from a continuous or puff release, explosive release, fuel or fire, or an area contamination event. Additional programs estimate the dose commitment from inhalation of any one of the radionuclides listed in the database of radionuclides, calibrate a radiation survey instrument for ground survey measurements, and screening of alpha emitters in the Lung. We believe that the HOTSPOT code is extremely valuable in providing reasonable and reliable guidance for a diversity of application. For example, we demonstrate the release of 241 Am(20Ci) to the atmosphere

78 FR 18321 - International Code Council: The Update Process for the International Codes and Standards

Science.gov (United States)

2013-03-26

... Energy Conservation Code. International Existing Building Code. International Fire Code. International... Code. International Property Maintenance Code. International Residential Code. International Swimming Pool and Spa Code International Wildland-Urban Interface Code. International Zoning Code. ICC Standards...

Two-terminal video coding.

Science.gov (United States)

Yang, Yang; Stanković, Vladimir; Xiong, Zixiang; Zhao, Wei

2009-03-01

Following recent works on the rate region of the quadratic Gaussian two-terminal source coding problem and limit-approaching code designs, this paper examines multiterminal source coding of two correlated, i.e., stereo, video sequences to save the sum rate over independent coding of both sequences. Two multiterminal video coding schemes are proposed. In the first scheme, the left sequence of the stereo pair is coded by H.264/AVC and used at the joint decoder to facilitate Wyner-Ziv coding of the right video sequence. The first I-frame of the right sequence is successively coded by H.264/AVC Intracoding and Wyner-Ziv coding. An efficient stereo matching algorithm based on loopy belief propagation is then adopted at the decoder to produce pixel-level disparity maps between the corresponding frames of the two decoded video sequences on the fly. Based on the disparity maps, side information for both motion vectors and motion-compensated residual frames of the right sequence are generated at the decoder before Wyner-Ziv encoding. In the second scheme, source splitting is employed on top of classic and Wyner-Ziv coding for compression of both I-frames to allow flexible rate allocation between the two sequences. Experiments with both schemes on stereo video sequences using H.264/AVC, LDPC codes for Slepian-Wolf coding of the motion vectors, and scalar quantization in conjunction with LDPC codes for Wyner-Ziv coding of the residual coefficients give a slightly lower sum rate than separate H.264/AVC coding of both sequences at the same video quality.