Flow of rarefied gases over two-dimensional bodies

NASA Technical Reports Server (NTRS)

Jeng, Duen-Ren; De Witt, Kenneth J.; Keith, Theo G., Jr.; Chung, Chan-Hong

1989-01-01

A kinetic-theory analysis is made of the flow of rarefied gases over two-dimensional bodies of arbitrary curvature. The Boltzmann equation simplified by a model collision integral is written in an arbitrary orthogonal curvilinear coordinate system, and solved by means of finite-difference approximation with the discrete ordinate method. A numerical code is developed which can be applied to any two-dimensional submerged body of arbitrary curvature for the flow regimes from free-molecular to slip at transonic Mach numbers. Predictions are made for the case of a right circular cylinder.

Optimum projection pattern generation for grey-level coded structured light illumination systems

NASA Astrophysics Data System (ADS)

Porras-Aguilar, Rosario; Falaggis, Konstantinos; Ramos-Garcia, Ruben

2017-04-01

Structured light illumination (SLI) systems are well-established optical inspection techniques for noncontact 3D surface measurements. A common technique is multi-frequency sinusoidal SLI that obtains the phase map at various fringe periods in order to estimate the absolute phase, and hence, the 3D surface information. Nevertheless, multi-frequency SLI systems employ multiple measurement planes (e.g. four phase shifted frames) to obtain the phase at a given fringe period. It is therefore an age old challenge to obtain the absolute surface information using fewer measurement frames. Grey level (GL) coding techniques have been developed as an attempt to reduce the number of planes needed, because a spatio-temporal GL sequence employing p discrete grey-levels and m frames has the potential to unwrap up to pm fringes. Nevertheless, one major disadvantage of GL based SLI techniques is that there are often errors near the border of each stripe, because an ideal stepwise intensity change cannot be measured. If the step-change in intensity is a single discrete grey-level unit, this problem can usually be overcome by applying an appropriate threshold. However, severe errors occur if the intensity change at the border of the stripe exceeds several discrete grey-level units. In this work, an optimum GL based technique is presented that generates a series of projection patterns with a minimal gradient in the intensity. It is shown that when using this technique, the errors near the border of the stripes can be significantly reduced. This improvement is achieved with the choice generated patterns, and does not involve additional hardware or special post-processing techniques. The performance of that method is validated using both simulations and experiments. The reported technique is generic, works with an arbitrary number of frames, and can employ an arbitrary number of grey-levels.

A submerged singularity method for calculating potential flow velocities at arbitrary near-field points

NASA Technical Reports Server (NTRS)

Maskew, B.

1976-01-01

A discrete singularity method has been developed for calculating the potential flow around two-dimensional airfoils. The objective was to calculate velocities at any arbitrary point in the flow field, including points that approach the airfoil surface. That objective was achieved and is demonstrated here on a Joukowski airfoil. The method used combined vortices and sources ''submerged'' a small distance below the airfoil surface and incorporated a near-field subvortex technique developed earlier. When a velocity calculation point approached the airfoil surface, the number of discrete singularities effectively increased (but only locally) to keep the point just outside the error region of the submerged singularity discretization. The method could be extended to three dimensions, and should improve nonlinear methods, which calculate interference effects between multiple wings, and which include the effects of force-free trailing vortex sheets. The capability demonstrated here would extend the scope of such calculations to allow the close approach of wings and vortex sheets (or vortices).

Generalized Reduction Formula for Discrete Wigner Functions of Multiqubit Systems

NASA Astrophysics Data System (ADS)

Srinivasan, K.; Raghavan, G.

2018-03-01

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

Open shop scheduling problem to minimize total weighted completion time

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai; Zhang, Qiang; Tang, Mengqian

2017-01-01

A given number of jobs in an open shop scheduling environment must each be processed for given amounts of time on each of a given set of machines in an arbitrary sequence. This study aims to achieve a schedule that minimizes total weighted completion time. Owing to the strong NP-hardness of the problem, the weighted shortest processing time block (WSPTB) heuristic is presented to obtain approximate solutions for large-scale problems. Performance analysis proves the asymptotic optimality of the WSPTB heuristic in the sense of probability limits. The largest weight block rule is provided to seek optimal schedules in polynomial time for a special case. A hybrid discrete differential evolution algorithm is designed to obtain high-quality solutions for moderate-scale problems. Simulation experiments demonstrate the effectiveness of the proposed algorithms.

Multidimensional FEM-FCT schemes for arbitrary time stepping

NASA Astrophysics Data System (ADS)

Kuzmin, D.; Möller, M.; Turek, S.

2003-05-01

The flux-corrected-transport paradigm is generalized to finite-element schemes based on arbitrary time stepping. A conservative flux decomposition procedure is proposed for both convective and diffusive terms. Mathematical properties of positivity-preserving schemes are reviewed. A nonoscillatory low-order method is constructed by elimination of negative off-diagonal entries of the discrete transport operator. The linearization of source terms and extension to hyperbolic systems are discussed. Zalesak's multidimensional limiter is employed to switch between linear discretizations of high and low order. A rigorous proof of positivity is provided. The treatment of non-linearities and iterative solution of linear systems are addressed. The performance of the new algorithm is illustrated by numerical examples for the shock tube problem in one dimension and scalar transport equations in two dimensions.

Extended phase graphs with anisotropic diffusion

NASA Astrophysics Data System (ADS)

Weigel, M.; Schwenk, S.; Kiselev, V. G.; Scheffler, K.; Hennig, J.

2010-08-01

The extended phase graph (EPG) calculus gives an elegant pictorial description of magnetization response in multi-pulse MR sequences. The use of the EPG calculus enables a high computational efficiency for the quantitation of echo intensities even for complex sequences with multiple refocusing pulses with arbitrary flip angles. In this work, the EPG concept dealing with RF pulses with arbitrary flip angles and phases is extended to account for anisotropic diffusion in the presence of arbitrary varying gradients. The diffusion effect can be expressed by specific diffusion weightings of individual magnetization pathways. This can be represented as an action of a linear operator on the magnetization state. The algorithm allows easy integration of diffusion anisotropy effects. The formalism is validated on known examples from literature and used to calculate the effective diffusion weighting in multi-echo sequences with arbitrary refocusing flip angles.

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong Luo; Luqing Luo; Robert Nourgaliev

2010-09-01

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier–Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier–Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need tomore » judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi–Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier–Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier–Stokes equations.« less

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong Luo; Luqing Luo; Robert Nourgaliev

2010-01-01

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier-Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need tomore » judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi-Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier-Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier-Stokes equations.« less

Frequency-domain method for discrete frequency noise prediction of rotors in arbitrary steady motion

NASA Astrophysics Data System (ADS)

Gennaretti, M.; Testa, C.; Bernardini, G.

2012-12-01

A novel frequency-domain formulation for the prediction of the tonal noise emitted by rotors in arbitrary steady motion is presented. It is derived from Farassat's 'Formulation 1A', that is a time-domain boundary integral representation for the solution of the Ffowcs-Williams and Hawkings equation, and represents noise as harmonic response to body kinematics and aerodynamic loads via frequency-response-function matrices. The proposed frequency-domain solver is applicable to rotor configurations for which sound pressure levels of discrete tones are much higher than those of broadband noise. The numerical investigation concerns the analysis of noise produced by an advancing helicopter rotor in blade-vortex interaction conditions, as well as the examination of pressure disturbances radiated by the interaction of a marine propeller with a non-uniform inflow.

A simple method to calculate first-passage time densities with arbitrary initial conditions

NASA Astrophysics Data System (ADS)

Nyberg, Markus; Ambjörnsson, Tobias; Lizana, Ludvig

2016-06-01

Numerous applications all the way from biology and physics to economics depend on the density of first crossings over a boundary. Motivated by the lack of general purpose analytical tools for computing first-passage time densities (FPTDs) for complex problems, we propose a new simple method based on the independent interval approximation (IIA). We generalise previous formulations of the IIA to include arbitrary initial conditions as well as to deal with discrete time and non-smooth continuous time processes. We derive a closed form expression for the FPTD in z and Laplace-transform space to a boundary in one dimension. Two classes of problems are analysed in detail: discrete time symmetric random walks (Markovian) and continuous time Gaussian stationary processes (Markovian and non-Markovian). Our results are in good agreement with Langevin dynamics simulations.

Extended phase graphs with anisotropic diffusion.

PubMed

Weigel, M; Schwenk, S; Kiselev, V G; Scheffler, K; Hennig, J

2010-08-01

The extended phase graph (EPG) calculus gives an elegant pictorial description of magnetization response in multi-pulse MR sequences. The use of the EPG calculus enables a high computational efficiency for the quantitation of echo intensities even for complex sequences with multiple refocusing pulses with arbitrary flip angles. In this work, the EPG concept dealing with RF pulses with arbitrary flip angles and phases is extended to account for anisotropic diffusion in the presence of arbitrary varying gradients. The diffusion effect can be expressed by specific diffusion weightings of individual magnetization pathways. This can be represented as an action of a linear operator on the magnetization state. The algorithm allows easy integration of diffusion anisotropy effects. The formalism is validated on known examples from literature and used to calculate the effective diffusion weighting in multi-echo sequences with arbitrary refocusing flip angles. Copyright 2010 Elsevier Inc. All rights reserved.

Generation of sequence signatures from DNA amplification fingerprints with mini-hairpin and microsatellite primers.

PubMed

Caetano-Anollés, G; Gresshoff, P M

1996-06-01

DNA amplification fingerprinting (DAF) with mini-hairpins harboring arbitrary "core" sequences at their 3' termini were used to fingerprint a variety of templates, including PCR products and whole genomes, to establish genetic relationships between plant tax at the interspecific and intraspecific level, and to identify closely related fungal isolates and plant accessions. No correlation was observed between the sequence of the arbitrary core, the stability of the mini-hairpin structure and DAF efficiency. Mini-hairpin primers with short arbitrary cores and primers complementary to simple sequence repeats present in microsatellites were also used to generate arbitrary signatures from amplification profiles (ASAP). The ASAP strategy is a dual-step amplification procedure that uses at least one primer in each fingerprinting stage. ASAP was able to reproducibly amplify DAF products (representing about 10-15 kb of sequence) following careful optimization of amplification parameters such as primer and template concentration. Avoidance of primer sequences partially complementary to DAF product termini was necessary in order to produce distinct fingerprints. This allowed the combinatorial use of oligomers in nucleic acid screening, with numerous ASAP fingerprinting reactions based on a limited number of primer sequences. Mini-hairpin primers and ASAP analysis significantly increased detection of polymorphic DNA, separating closely related bermudagrass (Cynodon) cultivars and detecting putatively linked markers in bulked segregant analysis of the soybean (Glycine max) supernodulation (nitrate-tolerant symbiosis) locus.

A free energy satisfying discontinuous Galerkin method for one-dimensional Poisson-Nernst-Planck systems

NASA Astrophysics Data System (ADS)

Liu, Hailiang; Wang, Zhongming

2017-01-01

We design an arbitrary-order free energy satisfying discontinuous Galerkin (DG) method for solving time-dependent Poisson-Nernst-Planck systems. Both the semi-discrete and fully discrete DG methods are shown to satisfy the corresponding discrete free energy dissipation law for positive numerical solutions. Positivity of numerical solutions is enforced by an accuracy-preserving limiter in reference to positive cell averages. Numerical examples are presented to demonstrate the high resolution of the numerical algorithm and to illustrate the proven properties of mass conservation, free energy dissipation, as well as the preservation of steady states.

Phase retrieval with the transport-of-intensity equation in an arbitrarily-shaped aperture by iterative discrete cosine transforms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huang, Lei; Zuo, Chao; Idir, Mourad

A novel transport-of-intensity equation (TIE) based phase retrieval method is proposed with putting an arbitrarily-shaped aperture into the optical wavefield. In this arbitrarily-shaped aperture, the TIE can be solved under non-uniform illuminations and even non-homogeneous boundary conditions by iterative discrete cosine transforms with a phase compensation mechanism. Simulation with arbitrary phase, arbitrary aperture shape, and non-uniform intensity distribution verifies the effective compensation and high accuracy of the proposed method. Experiment is also carried out to check the feasibility of the proposed method in real measurement. Comparing to the existing methods, the proposed method is applicable for any types of phasemore » distribution under non-uniform illumination and non-homogeneous boundary conditions within an arbitrarily-shaped aperture, which enables the technique of TIE with hard aperture become a more flexible phase retrieval tool in practical measurements.« less

Phase retrieval with the transport-of-intensity equation in an arbitrarily-shaped aperture by iterative discrete cosine transforms

DOE PAGES

Huang, Lei; Zuo, Chao; Idir, Mourad; ...

2015-04-21

A novel transport-of-intensity equation (TIE) based phase retrieval method is proposed with putting an arbitrarily-shaped aperture into the optical wavefield. In this arbitrarily-shaped aperture, the TIE can be solved under non-uniform illuminations and even non-homogeneous boundary conditions by iterative discrete cosine transforms with a phase compensation mechanism. Simulation with arbitrary phase, arbitrary aperture shape, and non-uniform intensity distribution verifies the effective compensation and high accuracy of the proposed method. Experiment is also carried out to check the feasibility of the proposed method in real measurement. Comparing to the existing methods, the proposed method is applicable for any types of phasemore » distribution under non-uniform illumination and non-homogeneous boundary conditions within an arbitrarily-shaped aperture, which enables the technique of TIE with hard aperture become a more flexible phase retrieval tool in practical measurements.« less

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

NASA Astrophysics Data System (ADS)

Gyrya, V.; Lipnikov, K.

2017-11-01

We present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, we observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.

The arbitrary order mixed mimetic finite difference method for the diffusion equation

DOE PAGES

Gyrya, Vitaliy; Lipnikov, Konstantin; Manzini, Gianmarco

2016-05-01

Here, we propose an arbitrary-order accurate mimetic finite difference (MFD) method for the approximation of diffusion problems in mixed form on unstructured polygonal and polyhedral meshes. As usual in the mimetic numerical technology, the method satisfies local consistency and stability conditions, which determines the accuracy and the well-posedness of the resulting approximation. The method also requires the definition of a high-order discrete divergence operator that is the discrete analog of the divergence operator and is acting on the degrees of freedom. The new family of mimetic methods is proved theoretically to be convergent and optimal error estimates for flux andmore » scalar variable are derived from the convergence analysis. A numerical experiment confirms the high-order accuracy of the method in solving diffusion problems with variable diffusion tensor. It is worth mentioning that the approximation of the scalar variable presents a superconvergence effect.« less

Output synchronization of discrete-time dynamical networks based on geometrically incremental dissipativity.

PubMed

Li, Chensong; Zhao, Jun

2017-01-01

In this work, we investigate the output synchronization problem for discrete-time dynamical networks with identical nodes. Firstly, if each node of a network is geometrically incrementally dissipative, the entire network can be viewed as a geometrically dissipative nonlinear system by choosing a particular input-output pair. Then, based on the geometrical dissipativity property, we consider two cases: output synchronization under arbitrary topology and switching topology, respectively. For the first case, we establish several criteria of output synchronization under arbitrary switching between a set of connection topologies by employing a common Lyapunov function. For the other case, we give the design method of a switching signal to achieve output synchronization even if all subnetworks are not synchronous. Finally, an example is provided to illustrate the effectiveness of the main results. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

DOE PAGES

Gyrya, V.; Lipnikov, K.

2017-07-18

Here, we present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We also present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, wemore » observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.« less

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gyrya, V.; Lipnikov, K.

Here, we present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We also present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, wemore » observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.« less

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

PubMed

Hua, Wei; Wang, Jiasong; Zhao, Jian

2014-01-01

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

Detailed analysis of the effects of stencil spatial variations with arbitrary high-order finite-difference Maxwell solver

DOE PAGES

Vincenti, H.; Vay, J. -L.

2015-11-22

Due to discretization effects and truncation to finite domains, many electromagnetic simulations present non-physical modifications of Maxwell's equations in space that may generate spurious signals affecting the overall accuracy of the result. Such modifications for instance occur when Perfectly Matched Layers (PMLs) are used at simulation domain boundaries to simulate open media. Another example is the use of arbitrary order Maxwell solver with domain decomposition technique that may under some condition involve stencil truncations at subdomain boundaries, resulting in small spurious errors that do eventually build up. In each case, a careful evaluation of the characteristics and magnitude of themore » errors resulting from these approximations, and their impact at any frequency and angle, requires detailed analytical and numerical studies. To this end, we present a general analytical approach that enables the evaluation of numerical discretization errors of fully three-dimensional arbitrary order finite-difference Maxwell solver, with arbitrary modification of the local stencil in the simulation domain. The analytical model is validated against simulations of domain decomposition technique and PMLs, when these are used with very high-order Maxwell solver, as well as in the infinite order limit of pseudo-spectral solvers. Results confirm that the new analytical approach enables exact predictions in each case. It also confirms that the domain decomposition technique can be used with very high-order Maxwell solver and a reasonably low number of guard cells with negligible effects on the whole accuracy of the simulation.« less

Consistent Discretization and Canonical, Classical and Quantum Regge Calculus

NASA Astrophysics Data System (ADS)

Gambini, Rodolfo; Pullin, Jorge

We apply the "consistent discretization" technique to the Regge action for (Euclidean and Lorentzian) general relativity in arbitrary number of dimensions. The result is a well-defined canonical theory that is free of constraints and where the dynamics is implemented as a canonical transformation. In the Lorentzian case, the framework appears to be naturally free of the "spikes" that plague traditional formulations. It also provides a well-defined recipe for determining the integration measure for quantum Regge calculus.

Iterative methods for elliptic finite element equations on general meshes

NASA Technical Reports Server (NTRS)

Nicolaides, R. A.; Choudhury, Shenaz

1986-01-01

Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.

On the arbitrary l-wave solutions of the deformed hyperbolic manning-rosen potential including an improved approximation to the orbital centrifugal term

NASA Astrophysics Data System (ADS)

Xu, Chun-Long; Zhang, Min-Cang

2017-01-01

The arbitrary l-wave solutions to the Schrödinger equation for the deformed hyperbolic Manning-Rosen potential is investigated analytically by using the Nikiforov-Uvarov method, the centrifugal term is treated with an improved Greene and Aldrich's approximation scheme. The wavefunctions depend on the deformation parameter q, which is expressed in terms of the Jocobi polynomial or the hypergeometric function. The bound state energy is obtained, and the discrete spectrum is shown to be independent of the deformation parameter q.

On the convergence of a discrete Kirchhoff triangle method valid for shells of arbitrary shape

NASA Astrophysics Data System (ADS)

Bernadou, Michel; Eiroa, Pilar Mato; Trouve, Pascal

1994-10-01

In a recent paper by the same authors, we have thoroughly described how to extend to the case of general shells the well known DKT (discrete Kirchhoff triangle) methods which are now classically used to solve plate problems. In that paper we have also detailed how to realize the implementation and reported some numerical results obtained for classical benchmarks. The aim of this paper is to prove the convergence of a closely related method and to obtain corresponding error estimates.

Initial Data of Digital Correlation ECE with a Giga Hertz Sampling Digitizer

NASA Astrophysics Data System (ADS)

Tsuchiya, Hayato; Inagaki, Shigeru; Tokuzawa, Tokihiko; Nagayama, Yoshio

2015-03-01

The proposed Digital Correlation ECE (DCECE) technique is applied in Large Helical Device. DCECE is realized by the use of the Giga Hertz Sampling Digitizer. The waveform of intermediate frequency band of ECE, whose frequency is several giga hertz, can be discretized and saved directly. The discretized IF data can be used for the analysis of correlation ECE with arbitrary parameter of spatial resolution and temporal resolution. In this paper, the characteristic of DCECE and initial Data in LHD is introduced.

Compatible, total energy conserving and symmetry preserving arbitrary Lagrangian-Eulerian hydrodynamics in 2D rz - Cylindrical coordinates

NASA Astrophysics Data System (ADS)

Kenamond, Mack; Bement, Matthew; Shashkov, Mikhail

2014-07-01

We present a new discretization for 2D arbitrary Lagrangian-Eulerian hydrodynamics in rz geometry (cylindrical coordinates) that is compatible, total energy conserving and symmetry preserving. In the first part of the paper, we describe the discretization of the basic Lagrangian hydrodynamics equations in axisymmetric 2D rz geometry on general polygonal meshes. It exactly preserves planar, cylindrical and spherical symmetry of the flow on meshes aligned with the flow. In particular, spherical symmetry is preserved on polar equiangular meshes. The discretization conserves total energy exactly up to machine round-off on any mesh. It has a consistent definition of kinetic energy in the zone that is exact for a velocity field with constant magnitude. The method for discretization of the Lagrangian equations is based on ideas presented in [2,3,7], where the authors use a special procedure to distribute zonal mass to corners of the zone (subzonal masses). The momentum equation is discretized in its “Cartesian” form with a special definition of “planar” masses (area-weighted). The principal contributions of this part of the paper are as follows: a definition of “planar” subzonal mass for nodes on the z axis (r=0) that does not require a special procedure for movement of these nodes; proof of conservation of the total energy; formulated for general polygonal meshes. We present numerical examples that demonstrate the robustness of the new method for Lagrangian equations on a variety of grids and test problems including polygonal meshes. In particular, we demonstrate the importance of conservation of total energy for correctly modeling shock waves. In the second part of the paper we describe the remapping stage of the arbitrary Lagrangian-Eulerian algorithm. The general idea is based on the following papers [25-28], where it was described for Cartesian coordinates. We describe a distribution-based algorithm for the definition of remapped subzonal densities and a local constrained-optimization-based approach for each zone to find the subzonal mass fluxes. In this paper we give a systematic and complete description of the algorithm for the axisymmetric case and provide justification for our approach. The ALE algorithm conserves total energy on arbitrary meshes and preserves symmetry when remapping from one equiangular polar mesh to another. The principal contributions of this part of the paper are the extension of this algorithm to general polygonal meshes and 2D rz geometry with requirement of symmetry preservation on special meshes. We present numerical examples that demonstrate the robustness of the new ALE method on a variety of grids and test problems including polygonal meshes and some realistic experiments. We confirm the importance of conservation of total energy for correctly modeling shock waves.

Exact Integrations of Polynomials and Symmetric Quadrature Formulas over Arbitrary Polyhedral Grids

NASA Technical Reports Server (NTRS)

Liu, Yen; Vinokur, Marcel

1997-01-01

This paper is concerned with two important elements in the high-order accurate spatial discretization of finite volume equations over arbitrary grids. One element is the integration of basis functions over arbitrary domains, which is used in expressing various spatial integrals in terms of discrete unknowns. The other consists of quadrature approximations to those integrals. Only polynomial basis functions applied to polyhedral and polygonal grids are treated here. Non-triangular polygonal faces are subdivided into a union of planar triangular facets, and the resulting triangulated polyhedron is subdivided into a union of tetrahedra. The straight line segment, triangle, and tetrahedron are thus the fundamental shapes that are the building blocks for all integrations and quadrature approximations. Integrals of products up to the fifth order are derived in a unified manner for the three fundamental shapes in terms of the position vectors of vertices. Results are given both in terms of tensor products and products of Cartesian coordinates. The exact polynomial integrals are used to obtain symmetric quadrature approximations of any degree of precision up to five for arbitrary integrals over the three fundamental domains. Using a coordinate-free formulation, simple and rational procedures are developed to derive virtually all quadrature formulas, including some previously unpublished. Four symmetry groups of quadrature points are introduced to derive Gauss formulas, while their limiting forms are used to derive Lobatto formulas. Representative Gauss and Lobatto formulas are tabulated. The relative efficiency of their application to polyhedral and polygonal grids is detailed. The extension to higher degrees of precision is discussed.

Practical Aspects of Stabilized FEM Discretizations of Nonlinear Conservation Law Systems with Convex Extension

NASA Technical Reports Server (NTRS)

Barth, Timothy; Saini, Subhash (Technical Monitor)

1999-01-01

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the Galerkin least-squares (GLS) and the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the POE system. Central to the development of the simplified GLS and DG methods is the Degenerative Scaling Theorem which characterizes right symmetrizes of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobean matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler, Navier-Stokes, and magnetohydrodynamic (MHD) equations. Linear and nonlinear energy stability is proven for the simplified GLS and DG methods. Spatial convergence properties of the simplified GLS and DO methods are numerical evaluated via the computation of Ringleb flow on a sequence of successively refined triangulations. Finally, we consider a posteriori error estimates for the GLS and DG demoralization assuming error functionals related to the integrated lift and drag of a body. Sample calculations in 20 are shown to validate the theory and implementation.

Parametric instability of spinning elastic rings excited by fluctuating space-fixed stiffnesses

NASA Astrophysics Data System (ADS)

Liu, Chunguang; Cooley, Christopher G.; Parker, Robert G.

2017-07-01

This study investigates the vibration of rotating elastic rings that are dynamically excited by an arbitrary number of space-fixed discrete stiffnesses with periodically fluctuating stiffnesses. The rotating, elastic ring is modeled using thin-ring theory with radial and tangential deformations. Primary and combination instability regions are determined in closed-form using the method of multiple scales. The ratio of peak-to-peak fluctuation to average discrete stiffness is used as the perturbation parameter, so the resulting perturbation analysis is not limited to small mean values of discrete stiffnesses. The natural frequencies and vibration modes are determined by discretizing the governing equations using Galerkin's method. Results are demonstrated for compliant gear applications. The perturbation results are validated by direct numerical integration of the equations of motion and Floquet theory. The bandwidths of the instability regions correlate with the fractional strain energy stored in the discrete stiffnesses. For rings with multiple discrete stiffnesses, the phase differences between them can eliminate large amplitude response under certain conditions.

Recursive multibody dynamics and discrete-time optimal control

NASA Technical Reports Server (NTRS)

Deleuterio, G. M. T.; Damaren, C. J.

1989-01-01

A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

Inherent robustness of discrete-time adaptive control systems

NASA Technical Reports Server (NTRS)

Ma, C. C. H.

1986-01-01

Global stability robustness with respect to unmodeled dynamics, arbitrary bounded internal noise, as well as external disturbance is shown to exist for a class of discrete-time adaptive control systems when the regressor vectors of these systems are persistently exciting. Although fast adaptation is definitely undesirable, so far as attaining the greatest amount of global stability robustness is concerned, slow adaptation is shown to be not necessarily beneficial. The entire analysis in this paper holds for systems with slowly varying return difference matrices; the plants in these systems need not be slowly varying.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vincenti, H.; Vay, J. -L.

Due to discretization effects and truncation to finite domains, many electromagnetic simulations present non-physical modifications of Maxwell's equations in space that may generate spurious signals affecting the overall accuracy of the result. Such modifications for instance occur when Perfectly Matched Layers (PMLs) are used at simulation domain boundaries to simulate open media. Another example is the use of arbitrary order Maxwell solver with domain decomposition technique that may under some condition involve stencil truncations at subdomain boundaries, resulting in small spurious errors that do eventually build up. In each case, a careful evaluation of the characteristics and magnitude of themore » errors resulting from these approximations, and their impact at any frequency and angle, requires detailed analytical and numerical studies. To this end, we present a general analytical approach that enables the evaluation of numerical discretization errors of fully three-dimensional arbitrary order finite-difference Maxwell solver, with arbitrary modification of the local stencil in the simulation domain. The analytical model is validated against simulations of domain decomposition technique and PMLs, when these are used with very high-order Maxwell solver, as well as in the infinite order limit of pseudo-spectral solvers. Results confirm that the new analytical approach enables exact predictions in each case. It also confirms that the domain decomposition technique can be used with very high-order Maxwell solver and a reasonably low number of guard cells with negligible effects on the whole accuracy of the simulation.« less

Adjoint-Based Methodology for Time-Dependent Optimization

NASA Technical Reports Server (NTRS)

Yamaleev, N. K.; Diskin, B.; Nielsen, E. J.

2008-01-01

This paper presents a discrete adjoint method for a broad class of time-dependent optimization problems. The time-dependent adjoint equations are derived in terms of the discrete residual of an arbitrary finite volume scheme which approximates unsteady conservation law equations. Although only the 2-D unsteady Euler equations are considered in the present analysis, this time-dependent adjoint method is applicable to the 3-D unsteady Reynolds-averaged Navier-Stokes equations with minor modifications. The discrete adjoint operators involving the derivatives of the discrete residual and the cost functional with respect to the flow variables are computed using a complex-variable approach, which provides discrete consistency and drastically reduces the implementation and debugging cycle. The implementation of the time-dependent adjoint method is validated by comparing the sensitivity derivative with that obtained by forward mode differentiation. Our numerical results show that O(10) optimization iterations of the steepest descent method are needed to reduce the objective functional by 3-6 orders of magnitude for test problems considered.

A discrete artificial bee colony algorithm for detecting transcription factor binding sites in DNA sequences.

PubMed

Karaboga, D; Aslan, S

2016-04-27

The great majority of biological sequences share significant similarity with other sequences as a result of evolutionary processes, and identifying these sequence similarities is one of the most challenging problems in bioinformatics. In this paper, we present a discrete artificial bee colony (ABC) algorithm, which is inspired by the intelligent foraging behavior of real honey bees, for the detection of highly conserved residue patterns or motifs within sequences. Experimental studies on three different data sets showed that the proposed discrete model, by adhering to the fundamental scheme of the ABC algorithm, produced competitive or better results than other metaheuristic motif discovery techniques.

Continuous- and discrete-time stimulus sequences for high stimulus rate paradigm in evoked potential studies.

PubMed

Wang, Tao; Huang, Jiang-hua; Lin, Lin; Zhan, Chang'an A

2013-01-01

To obtain reliable transient auditory evoked potentials (AEPs) from EEGs recorded using high stimulus rate (HSR) paradigm, it is critical to design the stimulus sequences of appropriate frequency properties. Traditionally, the individual stimulus events in a stimulus sequence occur only at discrete time points dependent on the sampling frequency of the recording system and the duration of stimulus sequence. This dependency likely causes the implementation of suboptimal stimulus sequences, sacrificing the reliability of resulting AEPs. In this paper, we explicate the use of continuous-time stimulus sequence for HSR paradigm, which is independent of the discrete electroencephalogram (EEG) recording system. We employ simulation studies to examine the applicability of the continuous-time stimulus sequences and the impacts of sampling frequency on AEPs in traditional studies using discrete-time design. Results from these studies show that the continuous-time sequences can offer better frequency properties and improve the reliability of recovered AEPs. Furthermore, we find that the errors in the recovered AEPs depend critically on the sampling frequencies of experimental systems, and their relationship can be fitted using a reciprocal function. As such, our study contributes to the literature by demonstrating the applicability and advantages of continuous-time stimulus sequences for HSR paradigm and by revealing the relationship between the reliability of AEPs and sampling frequencies of the experimental systems when discrete-time stimulus sequences are used in traditional manner for the HSR paradigm.

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

NASA Technical Reports Server (NTRS)

Barth, Timothy J.; Sethian, James A.

1997-01-01

Borrowing from techniques developed for conservation law equations, numerical schemes which discretize the Hamilton-Jacobi (H-J), level set, and Eikonal equations on triangulated domains are presented. The first scheme is a provably monotone discretization for certain forms of the H-J equations. Unfortunately, the basic scheme lacks proper Lipschitz continuity of the numerical Hamiltonian. By employing a virtual edge flipping technique, Lipschitz continuity of the numerical flux is restored on acute triangulations. Next, schemes are introduced and developed based on the weaker concept of positive coefficient approximations for homogeneous Hamiltonians. These schemes possess a discrete maximum principle on arbitrary triangulations and naturally exhibit proper Lipschitz continuity of the numerical Hamiltonian. Finally, a class of Petrov-Galerkin approximations are considered. These schemes are stabilized via a least-squares bilinear form. The Petrov-Galerkin schemes do not possess a discrete maximum principle but generalize to high order accuracy.

Arbitrary Order Mixed Mimetic Finite Differences Method with Nodal Degrees of Freedom

DOE Office of Scientific and Technical Information (OSTI.GOV)

Iaroshenko, Oleksandr; Gyrya, Vitaliy; Manzini, Gianmarco

2016-09-01

In this work we consider a modification to an arbitrary order mixed mimetic finite difference method (MFD) for a diffusion equation on general polygonal meshes [1]. The modification is based on moving some degrees of freedom (DoF) for a flux variable from edges to vertices. We showed that for a non-degenerate element this transformation is locally equivalent, i.e. there is a one-to-one map between the new and the old DoF. Globally, on the other hand, this transformation leads to a reduction of the total number of degrees of freedom (by up to 40%) and additional continuity of the discrete flux.

Control of automated behavior: insights from the discrete sequence production task

PubMed Central

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

2013-01-01

Work with the discrete sequence production (DSP) task has provided a substantial literature on discrete sequencing skill over the last decades. The purpose of the current article is to provide a comprehensive overview of this literature and of the theoretical progress that it has prompted. We start with a description of the DSP task and the phenomena that are typically observed with it. Then we propose a cognitive model, the dual processor model (DPM), which explains performance of (skilled) discrete key-press sequences. Key features of this model are the distinction between a cognitive processor and a motor system (i.e., motor buffer and motor processor), the interplay between these two processing systems, and the possibility to execute familiar sequences in two different execution modes. We further discuss how this model relates to several related sequence skill research paradigms and models, and we outline outstanding questions for future research throughout the paper. We conclude by sketching a tentative neural implementation of the DPM. PMID:23515430

Rarefied gas flow through two-dimensional nozzles

NASA Technical Reports Server (NTRS)

De Witt, Kenneth J.; Jeng, Duen-Ren; Keith, Theo G., Jr.; Chung, Chan-Hong

1989-01-01

A kinetic theory analysis is made of the flow of a rarefied gas from one reservoir to another through two-dimensional nozzles with arbitrary curvature. The Boltzmann equation simplified by a model collision integral is solved by means of finite-difference approximations with the discrete ordinate method. The physical space is transformed by a general grid generation technique and the velocity space is transformed to a polar coordinate system. A numerical code is developed which can be applied to any two-dimensional passage of complicated geometry for the flow regimes from free-molecular to slip. Numerical values of flow quantities can be calculated for the entire physical space including both inside the nozzle and in the outside plume. Predictions are made for the case of parallel slots and compared with existing literature data. Also, results for the cases of convergent or divergent slots and two-dimensional nozzles with arbitrary curvature at arbitrary knudsen number are presented.

A new shock-capturing numerical scheme for ideal hydrodynamics

NASA Astrophysics Data System (ADS)

Fecková, Z.; Tomášik, B.

2015-05-01

We present a new algorithm for solving ideal relativistic hydrodynamics based on Godunov method with an exact solution of Riemann problem for an arbitrary equation of state. Standard numerical tests are executed, such as the sound wave propagation and the shock tube problem. Low numerical viscosity and high precision are attained with proper discretization.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eldred, Christopher; Randall, David

The shallow water equations provide a useful analogue of the fully compressible Euler equations since they have similar characteristics: conservation laws, inertia-gravity and Rossby waves, and a (quasi-) balanced state. In order to obtain realistic simulation results, it is desirable that numerical models have discrete analogues of these properties. Two prototypical examples of such schemes are the 1981 Arakawa and Lamb (AL81) C-grid total energy and potential enstrophy conserving scheme, and the 2007 Salmon (S07) Z-grid total energy and potential enstrophy conserving scheme. Unfortunately, the AL81 scheme is restricted to logically square, orthogonal grids, and the S07 scheme is restrictedmore » to uniform square grids. The current work extends the AL81 scheme to arbitrary non-orthogonal polygonal grids and the S07 scheme to arbitrary orthogonal spherical polygonal grids in a manner that allows for both total energy and potential enstrophy conservation, by combining Hamiltonian methods (work done by Salmon, Gassmann, Dubos, and others) and discrete exterior calculus (Thuburn, Cotter, Dubos, Ringler, Skamarock, Klemp, and others). Lastly, detailed results of the schemes applied to standard test cases are deferred to part 2 of this series of papers.« less

Generalized skew-symmetric interfacial probability distribution in reflectivity and small-angle scattering analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jiang, Zhang; Chen, Wei

Generalized skew-symmetric probability density functions are proposed to model asymmetric interfacial density distributions for the parameterization of any arbitrary density profiles in the `effective-density model'. The penetration of the densities into adjacent layers can be selectively controlled and parameterized. A continuous density profile is generated and discretized into many independent slices of very thin thickness with constant density values and sharp interfaces. The discretized profile can be used to calculate reflectivities via Parratt's recursive formula, or small-angle scattering via the concentric onion model that is also developed in this work.

Generalized skew-symmetric interfacial probability distribution in reflectivity and small-angle scattering analysis

DOE PAGES

Jiang, Zhang; Chen, Wei

2017-11-03

Generalized skew-symmetric probability density functions are proposed to model asymmetric interfacial density distributions for the parameterization of any arbitrary density profiles in the `effective-density model'. The penetration of the densities into adjacent layers can be selectively controlled and parameterized. A continuous density profile is generated and discretized into many independent slices of very thin thickness with constant density values and sharp interfaces. The discretized profile can be used to calculate reflectivities via Parratt's recursive formula, or small-angle scattering via the concentric onion model that is also developed in this work.

Graph transformation method for calculating waiting times in Markov chains.

PubMed

Trygubenko, Semen A; Wales, David J

2006-06-21

We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then calculate averages over a given ensemble of paths for both additive and multiplicative properties in a nonstochastic and noniterative fashion. In particular, we can calculate the mean first-passage time between arbitrary groups of stationary points for discrete path sampling databases, and hence extract phenomenological rate constants. We present a number of examples to demonstrate the efficiency and robustness of this approach.

Hardware for dynamic quantum computing experiments: Part I

NASA Astrophysics Data System (ADS)

Johnson, Blake; Ryan, Colm; Riste, Diego; Donovan, Brian; Ohki, Thomas

Static, pre-defined control sequences routinely achieve high-fidelity operation on superconducting quantum processors. Efforts toward dynamic experiments depending on real-time information have mostly proceeded through hardware duplication and triggers, requiring a combinatorial explosion in the number of channels. We provide a hardware efficient solution to dynamic control with a complete platform of specialized FPGA-based control and readout electronics; these components enable arbitrary control flow, low-latency feedback and/or feedforward, and scale far beyond single-qubit control and measurement. We will introduce the BBN Arbitrary Pulse Sequencer 2 (APS2) control system and the X6 QDSP readout platform. The BBN APS2 features: a sequencer built around implementing short quantum gates, a sequence cache to allow long sequences with branching structures, subroutines for code re-use, and a trigger distribution module to capture and distribute steering information. The X6 QDSP features a single-stage DSP pipeline that combines demodulation with arbitrary integration kernels, and multiple taps to inspect data flow for debugging and calibration. We will show system performance when putting it all together, including a latency budget for feedforward operations. This research was funded by the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), through the Army Research Office Contract No. W911NF-10-1-0324.

Discrete sequence prediction and its applications

NASA Technical Reports Server (NTRS)

Laird, Philip

1992-01-01

Learning from experience to predict sequences of discrete symbols is a fundamental problem in machine learning with many applications. We apply sequence prediction using a simple and practical sequence-prediction algorithm, called TDAG. The TDAG algorithm is first tested by comparing its performance with some common data compression algorithms. Then it is adapted to the detailed requirements of dynamic program optimization, with excellent results.

Drekar v.2.0

DOE Office of Scientific and Technical Information (OSTI.GOV)

Seefeldt, Ben; Sondak, David; Hensinger, David M.

Drekar is an application code that solves partial differential equations for fluids that can be optionally coupled to electromagnetics. Drekar solves low-mach compressible and incompressible computational fluid dynamics (CFD), compressible and incompressible resistive magnetohydrodynamics (MHD), and multiple species plasmas interacting with electromagnetic fields. Drekar discretization technology includes continuous and discontinuous finite element formulations, stabilized finite element formulations, mixed integration finite element bases (nodal, edge, face, volume) and an initial arbitrary Lagrangian Eulerian (ALE) capability. Drekar contains the implementation of the discretized physics and leverages the open source Trilinos project for both parallel solver capabilities and general finite element discretization tools.more » The code will be released open source under a BSD license. The code is used for fundamental research for simulation of fluids and plasmas on high performance computing environments.« less

A new discrete Kirchhoff-Mindlin element based on Mindlin-Reissner plate theory and assumed shear strain fields. I - An extended DKT element for thick-plate bending analysis. II - An extended DKQ element for thick-plate bending analysis

NASA Astrophysics Data System (ADS)

Katili, Irwan

1993-06-01

A new three-node nine-degree-of-freedom triangular plate bending element is proposed which is valid for the analysis of both thick and thin plates. The element, called the discrete Kirchhoff-Mindlin triangle (DKMT), has a proper rank, passes the patch test for thin and thick plates in an arbitrary mesh, and is free of shear locking. As an extension of the DKMT element, a four-node element with 3 degrees of freedom per node is developed. The element, referred to as DKMQ (discrete Kirchhoff-Mindlin quadrilateral) is found to provide good results for both thin and thick plates without any compatibility problems.

Arbitrary digital pulse sequence generator with delay-loop timing

NASA Astrophysics Data System (ADS)

Hošák, Radim; Ježek, Miroslav

2018-04-01

We propose an idea of an electronic multi-channel arbitrary digital sequence generator with temporal granularity equal to two clock cycles. We implement the generator with 32 channels using a low-cost ARM microcontroller and demonstrate its capability to produce temporal delays ranging from tens of nanoseconds to hundreds of seconds, with 24 ns timing granularity and linear scaling of delay with respect to the number of delay loop iterations. The generator is optionally synchronized with an external clock source to provide 100 ps jitter and overall sequence repeatability within the whole temporal range. The generator is fully programmable and able to produce digital sequences of high complexity. The concept of the generator can be implemented using different microcontrollers and applied for controlling of various optical, atomic, and nuclear physics measurement setups.

Phylogenetic mixtures and linear invariants for equal input models.

PubMed

Casanellas, Marta; Steel, Mike

2017-04-01

The reconstruction of phylogenetic trees from molecular sequence data relies on modelling site substitutions by a Markov process, or a mixture of such processes. In general, allowing mixed processes can result in different tree topologies becoming indistinguishable from the data, even for infinitely long sequences. However, when the underlying Markov process supports linear phylogenetic invariants, then provided these are sufficiently informative, the identifiability of the tree topology can be restored. In this paper, we investigate a class of processes that support linear invariants once the stationary distribution is fixed, the 'equal input model'. This model generalizes the 'Felsenstein 1981' model (and thereby the Jukes-Cantor model) from four states to an arbitrary number of states (finite or infinite), and it can also be described by a 'random cluster' process. We describe the structure and dimension of the vector spaces of phylogenetic mixtures and of linear invariants for any fixed phylogenetic tree (and for all trees-the so called 'model invariants'), on any number n of leaves. We also provide a precise description of the space of mixtures and linear invariants for the special case of [Formula: see text] leaves. By combining techniques from discrete random processes and (multi-) linear algebra, our results build on a classic result that was first established by James Lake (Mol Biol Evol 4:167-191, 1987).

SU-F-T-527: A Novel Dynamic Multileaf Collimator Leaf-Sequencing Algorithm in Radiation Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jing, J; Lin, H; Chow, J

Purpose: A novel leaf-sequencing algorithm is developed for generating arbitrary beam intensity profiles in discrete levels using dynamic multileaf collimator (MLC). The efficiency of this dynamic MLC leaf-sequencing method was evaluated using external beam treatment plans delivered by intensity modulated radiation therapy technique. Methods: To qualify and validate this algorithm, integral test for the beam segment of MLC generated by the CORVUS treatment planning system was performed with clinical intensity map experiments. The treatment plans were optimized and the fluence maps for all photon beams were determined. This algorithm started with the algebraic expression for the area under the beammore » profile. The coefficients in the expression can be transformed into the specifications for the leaf-setting sequence. The leaf optimization procedure was then applied and analyzed for clinical relevant intensity profiles in cancer treatment. Results: The macrophysical effect of this method can be described by volumetric plan evaluation tools such as dose-volume histograms (DVHs). The DVH results are in good agreement compared to those from the CORVUS treatment planning system. Conclusion: We developed a dynamic MLC method to examine the stability of leaf speed including effects of acceleration and deceleration of leaf motion in order to make sure the stability of leaf speed did not affect the intensity profile generated. It was found that the mechanical requirements were better satisfied using this method. The Project is sponsored by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.« less

Dynamical behaviour of a discrete selection-migration model with arbitrary dominance

Treesearch

James F. Selgrade; Jordan West Bostic; James H. Roberds

2009-01-01

To study the effects of immigration of genes (possibly transgenic) into a natural population, a one-island selection-migration model with density-dependent regulation is used to track allele frequency and population size. The existence and uniqueness of a polymorphic genetic equilibrium is proved under a general assumption about dominance in fitnesses. Also, conditions...

Tunable arbitrary unitary transformer based on multiple sections of multicore fibers with phase control.

PubMed

Zhou, Junhe; Wu, Jianjie; Hu, Qinsong

2018-02-05

In this paper, we propose a novel tunable unitary transformer, which can achieve arbitrary discrete unitary transforms. The unitary transformer is composed of multiple sections of multi-core fibers with closely aligned coupled cores. Phase shifters are inserted before and after the sections to control the phases of the waves in the cores. A simple algorithm is proposed to find the optimal phase setup for the phase shifters to realize the desired unitary transforms. The proposed device is fiber based and is particularly suitable for the mode division multiplexing systems. A tunable mode MUX/DEMUX for a three-mode fiber is designed based on the proposed structure.

A case study to quantify prediction bounds caused by model-form uncertainty of a portal frame

NASA Astrophysics Data System (ADS)

Van Buren, Kendra L.; Hall, Thomas M.; Gonzales, Lindsey M.; Hemez, François M.; Anton, Steven R.

2015-01-01

Numerical simulations, irrespective of the discipline or application, are often plagued by arbitrary numerical and modeling choices. Arbitrary choices can originate from kinematic assumptions, for example the use of 1D beam, 2D shell, or 3D continuum elements, mesh discretization choices, boundary condition models, and the representation of contact and friction in the simulation. This work takes a step toward understanding the effect of arbitrary choices and model-form assumptions on the accuracy of numerical predictions. The application is the simulation of the first four resonant frequencies of a one-story aluminum portal frame structure under free-free boundary conditions. The main challenge of the portal frame structure resides in modeling the joint connections, for which different modeling assumptions are available. To study this model-form uncertainty, and compare it to other types of uncertainty, two finite element models are developed using solid elements, and with differing representations of the beam-to-column and column-to-base plate connections: (i) contact stiffness coefficients or (ii) tied nodes. Test-analysis correlation is performed to compare the lower and upper bounds of numerical predictions obtained from parametric studies of the joint modeling strategies to the range of experimentally obtained natural frequencies. The approach proposed is, first, to characterize the experimental variability of the joints by varying the bolt torque, method of bolt tightening, and the sequence in which the bolts are tightened. The second step is to convert what is learned from these experimental studies to models that "envelope" the range of observed bolt behavior. We show that this approach, that combines small-scale experiments, sensitivity analysis studies, and bounding-case models, successfully produces lower and upper bounds of resonant frequency predictions that match those measured experimentally on the frame structure. (Approved for unlimited, public release, LA-UR-13-27561).

Open-pNovo: De Novo Peptide Sequencing with Thousands of Protein Modifications.

PubMed

Yang, Hao; Chi, Hao; Zhou, Wen-Jing; Zeng, Wen-Feng; He, Kun; Liu, Chao; Sun, Rui-Xiang; He, Si-Min

2017-02-03

De novo peptide sequencing has improved remarkably, but sequencing full-length peptides with unexpected modifications is still a challenging problem. Here we present an open de novo sequencing tool, Open-pNovo, for de novo sequencing of peptides with arbitrary types of modifications. Although the search space increases by ∼300 times, Open-pNovo is close to or even ∼10-times faster than the other three proposed algorithms. Furthermore, considering top-1 candidates on three MS/MS data sets, Open-pNovo can recall over 90% of the results obtained by any one traditional algorithm and report 5-87% more peptides, including 14-250% more modified peptides. On a high-quality simulated data set, ∼85% peptides with arbitrary modifications can be recalled by Open-pNovo, while hardly any results can be recalled by others. In summary, Open-pNovo is an excellent tool for open de novo sequencing and has great potential for discovering unexpected modifications in the real biological applications.

Method of Implementing Digital Phase-Locked Loops

NASA Technical Reports Server (NTRS)

Stephens, Scott A. (Inventor); Thomas, J. Brooks (Inventor)

1997-01-01

In a new formulation for digital phase-locked loops, loop-filter constants are determined from loop roots that can each be selectively placed in the s-plane on the basis of a new set of parameters, each with simple and direct physical meaning in terms of loop noise bandwidth, root-specific decay rate, and root-specific damping. Loops of first to fourth order are treated in the continuous-update approximation (B(sub L)T approaches 0) and in a discrete-update formulation with arbitrary B(sub L)T. Deficiencies of the continuous-update approximation in large-B(sub L)T applications are avoided in the new discrete-update formulation.

Self-adaptive difference method for the effective solution of computationally complex problems of boundary layer theory

NASA Technical Reports Server (NTRS)

Schoenauer, W.; Daeubler, H. G.; Glotz, G.; Gruening, J.

1986-01-01

An implicit difference procedure for the solution of equations for a chemically reacting hypersonic boundary layer is described. Difference forms of arbitrary error order in the x and y coordinate plane were used to derive estimates for discretization error. Computational complexity and time were minimized by the use of this difference method and the iteration of the nonlinear boundary layer equations was regulated by discretization error. Velocity and temperature profiles are presented for Mach 20.14 and Mach 18.5; variables are velocity profiles, temperature profiles, mass flow factor, Stanton number, and friction drag coefficient; three figures include numeric data.

Coupled NASTRAN/boundary element formulation for acoustic scattering

NASA Technical Reports Server (NTRS)

Everstine, Gordon C.; Henderson, Francis M.; Schuetz, Luise S.

1987-01-01

A coupled finite element/boundary element capability is described for calculating the sound pressure field scattered by an arbitrary submerged 3-D elastic structure. Structural and fluid impedances are calculated with no approximation other than discretization. The surface fluid pressures and normal velocities are first calculated by coupling a NASTRAN finite element model of the structure with a discretized form of the Helmholtz surface integral equation for the exterior field. Far field pressures are then evaluated from the surface solution using the Helmholtz exterior integral equation. The overall approach is illustrated and validated using a known analytic solution for scattering from submerged spherical shells.

Solving the incompressible surface Navier-Stokes equation by surface finite elements

NASA Astrophysics Data System (ADS)

Reuther, Sebastian; Voigt, Axel

2018-01-01

We consider a numerical approach for the incompressible surface Navier-Stokes equation on surfaces with arbitrary genus g (S ) . The approach is based on a reformulation of the equation in Cartesian coordinates of the embedding R3, penalization of the normal component, a Chorin projection method, and discretization in space by surface finite elements for each component. The approach thus requires only standard ingredients which most finite element implementations can offer. We compare computational results with discrete exterior calculus simulations on a torus and demonstrate the interplay of the flow field with the topology by showing realizations of the Poincaré-Hopf theorem on n-tori.

Wave-packet continuum-discretization approach to ion-atom collisions including rearrangement: Application to differential ionization in proton-hydrogen scattering

NASA Astrophysics Data System (ADS)

Abdurakhmanov, I. B.; Bailey, J. J.; Kadyrov, A. S.; Bray, I.

2018-03-01

In this work, we develop a wave-packet continuum-discretization approach to ion-atom collisions that includes rearrangement processes. The total scattering wave function is expanded using a two-center basis built from wave-packet pseudostates. The exact three-body Schrödinger equation is converted into coupled-channel differential equations for time-dependent expansion coefficients. In the asymptotic region these time-dependent coefficients represent transition amplitudes for all processes including elastic scattering, excitation, ionization, and electron capture. The wave-packet continuum-discretization approach is ideal for differential ionization studies as it allows one to generate pseudostates with arbitrary energies and distribution. The approach is used to calculate the double differential cross section for ionization in proton collisions with atomic hydrogen. Overall good agreement with experiment is obtained for all considered cases.

High-Order Semi-Discrete Central-Upwind Schemes for Multi-Dimensional Hamilton-Jacobi Equations

NASA Technical Reports Server (NTRS)

Bryson, Steve; Levy, Doron; Biegel, Bryan (Technical Monitor)

2002-01-01

We present the first fifth order, semi-discrete central upwind method for approximating solutions of multi-dimensional Hamilton-Jacobi equations. Unlike most of the commonly used high order upwind schemes, our scheme is formulated as a Godunov-type scheme. The scheme is based on the fluxes of Kurganov-Tadmor and Kurganov-Tadmor-Petrova, and is derived for an arbitrary number of space dimensions. A theorem establishing the monotonicity of these fluxes is provided. The spacial discretization is based on a weighted essentially non-oscillatory reconstruction of the derivative. The accuracy and stability properties of our scheme are demonstrated in a variety of examples. A comparison between our method and other fifth-order schemes for Hamilton-Jacobi equations shows that our method exhibits smaller errors without any increase in the complexity of the computations.

Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes

NASA Technical Reports Server (NTRS)

Mavriplis, Dimitri J.; Thomas, James L. (Technical Monitor)

2003-01-01

The accuracy of the least-squares technique for gradient reconstruction on unstructured meshes is examined. While least-squares techniques produce accurate results on arbitrary isotropic unstructured meshes, serious difficulties exist for highly stretched meshes in the presence of surface curvature. In these situations, gradients are typically under-estimated by up to an order of magnitude. For vertex-based discretizations on triangular and quadrilateral meshes, and cell-centered discretizations on quadrilateral meshes, accuracy can be recovered using an inverse distance weighting in the least-squares construction. For cell-centered discretizations on triangles, both the unweighted and weighted least-squares constructions fail to provide suitable gradient estimates for highly stretched curved meshes. Good overall flow solution accuracy can be retained in spite of poor gradient estimates, due to the presence of flow alignment in exactly the same regions where the poor gradient accuracy is observed. However, the use of entropy fixes has the potential for generating large but subtle discretization errors.

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

NASA Astrophysics Data System (ADS)

Aurzada, Frank; Buck, Micha

2018-02-01

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

Soil geomorphic classification, soil taxonomy, and effects on soil richness assessments

Treesearch

Jonathan D. Phillips; Daniel A. Marion

2007-01-01

The study of pedodiversity and soil richness depends on the notion of soils as discrete entities. Soil classifications are often criticized in this regard because they depend in part on arbitrary or subjective criteria. In this study soils were categorized on the basis of the presence or absence of six lithological and morphological characteristics. Richness vs. area...

Total energy and potential enstrophy conserving schemes for the shallow water equations using Hamiltonian methods - Part 1: Derivation and properties

NASA Astrophysics Data System (ADS)

Eldred, Christopher; Randall, David

2017-02-01

The shallow water equations provide a useful analogue of the fully compressible Euler equations since they have similar characteristics: conservation laws, inertia-gravity and Rossby waves, and a (quasi-) balanced state. In order to obtain realistic simulation results, it is desirable that numerical models have discrete analogues of these properties. Two prototypical examples of such schemes are the 1981 Arakawa and Lamb (AL81) C-grid total energy and potential enstrophy conserving scheme, and the 2007 Salmon (S07) Z-grid total energy and potential enstrophy conserving scheme. Unfortunately, the AL81 scheme is restricted to logically square, orthogonal grids, and the S07 scheme is restricted to uniform square grids. The current work extends the AL81 scheme to arbitrary non-orthogonal polygonal grids and the S07 scheme to arbitrary orthogonal spherical polygonal grids in a manner that allows for both total energy and potential enstrophy conservation, by combining Hamiltonian methods (work done by Salmon, Gassmann, Dubos, and others) and discrete exterior calculus (Thuburn, Cotter, Dubos, Ringler, Skamarock, Klemp, and others). Detailed results of the schemes applied to standard test cases are deferred to part 2 of this series of papers.

Radiant heat exchange calculations in radiantly heated and cooled enclosures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chapman, K.S.; Zhang, P.

1995-08-01

This paper presents the development of a three-dimensional mathematical model to compute the radiant heat exchange between surfaces separated by a transparent and/or opaque medium. The model formulation accommodates arbitrary arrangements of the interior surfaces, as well as arbitrary placement of obstacles within the enclosure. The discrete ordinates radiation model is applied and has the capability to analyze the effect of irregular geometries and diverse surface temperatures and radiative properties. The model is verified by comparing calculated heat transfer rates to heat transfer rates determined from the exact radiosity method for four different enclosures. The four enclosures were selected tomore » provide a wide range of verification. This three-dimensional model based on the discrete ordinates method can be applied to a building to assist the design engineer in sizing a radiant heating system. By coupling this model with a convective and conductive heat transfer model and a thermal comfort model, the comfort levels throughout the room can be easily and efficiently mapped for a given radiant heater location. In addition, objects such as airplanes, trucks, furniture, and partitions can be easily incorporated to determine their effect on the performance of the radiant heating system.« less

Magnetizabilities of relativistic hydrogenlike atoms in some arbitrary discrete energy eigenstates

NASA Astrophysics Data System (ADS)

Stefańska, Patrycja

2016-03-01

We present the results of numerical calculations of magnetizability (χ) of the relativistic one-electron atoms with a pointlike, spinless and motionless nuclei of charge Ze. Exploiting the analytical formula for χ recently derived by us Stefańska (2015), valid for an arbitrary discrete energy eigenstate, we have found the values of the magnetizability for the ground state and for the first and the second set of excited states (i.e.: 2s1/2, 2p1/2, 2p3/2, 3s1/2, 3p1/2, 3p3/2, 3d3/2, and 3d5/2) of the Dirac one-electron atom. The results for ions with the atomic number 1 ⩽ Z ⩽ 137 are given in 14 tables. The comparison of the numerical values of magnetizabilities for the ground state and for each state belonging to the first set of excited states of selected hydrogenlike ions, obtained with the use of two different values of the fine-structure constant, i.e.: α-1 = 137.035 999 139 (CODATA 2014) and α-1 = 137.035 999 074 (CODATA 2010), is also presented.

An analysis of the vertical structure equation for arbitrary thermal profiles

NASA Technical Reports Server (NTRS)

Cohn, Stephen E.; Dee, Dick P.

1989-01-01

The vertical structure equation is a singular Sturm-Liouville problem whose eigenfunctions describe the vertical dependence of the normal modes of the primitive equations linearized about a given thermal profile. The eigenvalues give the equivalent depths of the modes. The spectrum of the vertical structure equation and the appropriateness of various upper boundary conditions, both for arbitrary thermal profiles were studied. The results depend critically upon whether or not the thermal profile is such that the basic state atmosphere is bounded. In the case of a bounded atmosphere it is shown that the spectrum is always totally discrete, regardless of details of the thermal profile. For the barotropic equivalent depth, which corresponds to the lowest eigen value, upper and lower bounds which depend only on the surface temperature and the atmosphere height were obtained. All eigenfunctions are bounded, but always have unbounded first derivatives. It was proved that the commonly invoked upper boundary condition that vertical velocity must vanish as pressure tends to zero, as well as a number of alternative conditions, is well posed. It was concluded that the vertical structure equation always has a totally discrete spectrum under the assumptions implicit in the primitive equations.

An analysis of the vertical structure equation for arbitrary thermal profiles

NASA Technical Reports Server (NTRS)

Cohn, Stephen E.; Dee, Dick P.

1987-01-01

The vertical structure equation is a singular Sturm-Liouville problem whose eigenfunctions describe the vertical dependence of the normal modes of the primitive equations linearized about a given thermal profile. The eigenvalues give the equivalent depths of the modes. The spectrum of the vertical structure equation and the appropriateness of various upper boundary conditions, both for arbitrary thermal profiles were studied. The results depend critically upon whether or not the thermal profile is such that the basic state atmosphere is bounded. In the case of a bounded atmosphere it is shown that the spectrum is always totally discrete, regardless of details of the thermal profile. For the barotropic equivalent depth, which corresponds to the lowest eigen value, upper and lower bounds which depend only on the surface temperature and the atmosphere height were obtained. All eigenfunctions are bounded, but always have unbounded first derivatives. It was proved that the commonly invoked upper boundary condition that vertical velocity must vanish as pressure tends to zero, as well as a number of alternative conditions, is well posed. It was concluded that the vertical structure equation always has a totally discrete spectrum under the assumptions implicit in the primitive equations.

Foundations of a mathematical theory of darwinism.

PubMed

Batty, Charles J K; Crewe, Paul; Grafen, Alan; Gratwick, Richard

2014-08-01

This paper pursues the 'formal darwinism' project of Grafen, whose aim is to construct formal links between dynamics of gene frequencies and optimization programmes, in very abstract settings with general implications for biologically relevant situations. A major outcome is the definition, within wide assumptions, of the ubiquitous but problematic concept of 'fitness'. This paper is the first to present the project for mathematicians. Within the framework of overlapping generations in discrete time and no social interactions, the current model shows links between fitness maximization and gene frequency change in a class-structured population, with individual-level uncertainty but no uncertainty in the class projection operator, where individuals are permitted to observe and condition their behaviour on arbitrary parts of the uncertainty. The results hold with arbitrary numbers of loci and alleles, arbitrary dominance and epistasis, and make no assumptions about linkage, linkage disequilibrium or mating system. An explicit derivation is given of Fisher's Fundamental Theorem of Natural Selection in its full generality.

Delivering Sound Energy along an Arbitrary Convex Trajectory

PubMed Central

Zhao, Sipei; Hu, Yuxiang; Lu, Jing; Qiu, Xiaojun; Cheng, Jianchun; Burnett, Ian

2014-01-01

Accelerating beams have attracted considerable research interest due to their peculiar properties and various applications. Although there have been numerous research on the generation and application of accelerating light beams, few results have been published on the generation of accelerating acoustic beams. Here we report on the experimental observation of accelerating acoustic beams along arbitrary convex trajectories. The desired trajectory is projected to the spatial phase profile on the boundary which is discretized and sampled spatially. The sound field distribution is formulated with the Green function and the integral equation method. Both the paraxial and the non-paraxial regimes are examined and observed in the experiments. The effect of obstacle scattering in the sound field is also investigated and the results demonstrate that the approach is robust against obstacle scattering. The realization of accelerating acoustic beams will have an impact on various applications where acoustic information and energy are required to be delivered along an arbitrary convex trajectory. PMID:25316353

Symmetric convolution of asymmetric multidimensional sequences using discrete trigonometric transforms.

PubMed

Foltz, T M; Welsh, B M

1999-01-01

This paper uses the fact that the discrete Fourier transform diagonalizes a circulant matrix to provide an alternate derivation of the symmetric convolution-multiplication property for discrete trigonometric transforms. Derived in this manner, the symmetric convolution-multiplication property extends easily to multiple dimensions using the notion of block circulant matrices and generalizes to multidimensional asymmetric sequences. The symmetric convolution of multidimensional asymmetric sequences can then be accomplished by taking the product of the trigonometric transforms of the sequences and then applying an inverse trigonometric transform to the result. An example is given of how this theory can be used for applying a two-dimensional (2-D) finite impulse response (FIR) filter with nonlinear phase which models atmospheric turbulence.

SSAW: A new sequence similarity analysis method based on the stationary discrete wavelet transform.

PubMed

Lin, Jie; Wei, Jing; Adjeroh, Donald; Jiang, Bing-Hua; Jiang, Yue

2018-05-02

Alignment-free sequence similarity analysis methods often lead to significant savings in computational time over alignment-based counterparts. A new alignment-free sequence similarity analysis method, called SSAW is proposed. SSAW stands for Sequence Similarity Analysis using the Stationary Discrete Wavelet Transform (SDWT). It extracts k-mers from a sequence, then maps each k-mer to a complex number field. Then, the series of complex numbers formed are transformed into feature vectors using the stationary discrete wavelet transform. After these steps, the original sequence is turned into a feature vector with numeric values, which can then be used for clustering and/or classification. Using two different types of applications, namely, clustering and classification, we compared SSAW against the the-state-of-the-art alignment free sequence analysis methods. SSAW demonstrates competitive or superior performance in terms of standard indicators, such as accuracy, F-score, precision, and recall. The running time was significantly better in most cases. These make SSAW a suitable method for sequence analysis, especially, given the rapidly increasing volumes of sequence data required by most modern applications.

PAN AIR: A Computer Program for Predicting Subsonic or Supersonic Linear Potential Flows About Arbitrary Configurations Using a Higher Order Panel Method. Volume 1; Theory Document (Version 1.1)

NASA Technical Reports Server (NTRS)

Magnus, Alfred E.; Epton, Michael A.

1981-01-01

An outline of the derivation of the differential equation governing linear subsonic and supersonic potential flow is given. The use of Green's Theorem to obtain an integral equation over the boundary surface is discussed. The engineering techniques incorporated in the PAN AIR (Panel Aerodynamics) program (a discretization method which solves the integral equation for arbitrary first order boundary conditions) are then discussed in detail. Items discussed include the construction of the compressibility transformations, splining techniques, imposition of the boundary conditions, influence coefficient computation (including the concept of the finite part of an integral), computation of pressure coefficients, and computation of forces and moments.

How to decompose arbitrary continuous-variable quantum operations.

PubMed

Sefi, Seckin; van Loock, Peter

2011-10-21

We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multimode Hamiltonian evolution, into a set of universal unitary gates. Although our approach is mainly oriented towards continuous-variable quantum computation, it may be used more generally whenever quantum states are to be transformed deterministically, e.g., in quantum control, discrete-variable quantum computation, or Hamiltonian simulation. We illustrate our scheme by presenting decompositions for various nonlinear Hamiltonians including quartic Kerr interactions. Finally, we conclude with two potential experiments utilizing offline-prepared optical cubic states and homodyne detections, in which quantum information is processed optically or in an atomic memory using quadratic light-atom interactions. © 2011 American Physical Society

Analysis of stationary availability factor of two-level backbone computer networks with arbitrary topology

NASA Astrophysics Data System (ADS)

Rahman, P. A.

2018-05-01

This scientific paper deals with the two-level backbone computer networks with arbitrary topology. A specialized method, offered by the author for calculation of the stationary availability factor of the two-level backbone computer networks, based on the Markov reliability models for the set of the independent repairable elements with the given failure and repair rates and the methods of the discrete mathematics, is also discussed. A specialized algorithm, offered by the author for analysis of the network connectivity, taking into account different kinds of the network equipment failures, is also observed. Finally, this paper presents an example of calculation of the stationary availability factor for the backbone computer network with the given topology.

Properties of the Magnitude Terms of Orthogonal Scaling Functions.

PubMed

Tay, Peter C; Havlicek, Joseph P; Acton, Scott T; Hossack, John A

2010-09-01

The spectrum of the convolution of two continuous functions can be determined as the continuous Fourier transform of the cross-correlation function. The same can be said about the spectrum of the convolution of two infinite discrete sequences, which can be determined as the discrete time Fourier transform of the cross-correlation function of the two sequences. In current digital signal processing, the spectrum of the contiuous Fourier transform and the discrete time Fourier transform are approximately determined by numerical integration or by densely taking the discrete Fourier transform. It has been shown that all three transforms share many analogous properties. In this paper we will show another useful property of determining the spectrum terms of the convolution of two finite length sequences by determining the discrete Fourier transform of the modified cross-correlation function. In addition, two properties of the magnitude terms of orthogonal wavelet scaling functions are developed. These properties are used as constraints for an exhaustive search to determine an robust lower bound on conjoint localization of orthogonal scaling functions.

Entanglement transfer from two-mode continuous variable SU(2) cat states to discrete qubits systems in Jaynes-Cummings Dimers

PubMed Central

Ran, Du; Hu, Chang-Sheng; Yang, Zhen-Biao

2016-01-01

We study the entanglement transfer from a two-mode continuous variable system (initially in the two-mode SU(2) cat states) to a couple of discrete two-state systems (initially in an arbitrary mixed state), by use of the resonant Jaynes-Cummings (JC) interaction. We first quantitatively connect the entanglement transfer to non-Gaussianity of the two-mode SU(2) cat states and find a positive correlation between them. We then investigate the behaviors of the entanglement transfer and find that it is dependent on the initial state of the discrete systems. We also find that the largest possible value of the transferred entanglement exhibits a variety of behaviors for different photon number as well as for the phase angle of the two-mode SU(2) cat states. We finally consider the influences of the noise on the transferred entanglement. PMID:27553881

Improved algorithms and methods for room sound-field prediction by acoustical radiosity in arbitrary polyhedral rooms.

PubMed

Nosal, Eva-Marie; Hodgson, Murray; Ashdown, Ian

2004-08-01

This paper explores acoustical (or time-dependent) radiosity--a geometrical-acoustics sound-field prediction method that assumes diffuse surface reflection. The literature of acoustical radiosity is briefly reviewed and the advantages and disadvantages of the method are discussed. A discrete form of the integral equation that results from meshing the enclosure boundaries into patches is presented and used in a discrete-time algorithm. Furthermore, an averaging technique is used to reduce computational requirements. To generalize to nonrectangular rooms, a spherical-triangle method is proposed as a means of evaluating the integrals over solid angles that appear in the discrete form of the integral equation. The evaluation of form factors, which also appear in the numerical solution, is discussed for rectangular and nonrectangular rooms. This algorithm and associated methods are validated by comparison of the steady-state predictions for a spherical enclosure to analytical solutions.

Improved algorithms and methods for room sound-field prediction by acoustical radiosity in arbitrary polyhedral rooms

NASA Astrophysics Data System (ADS)

Nosal, Eva-Marie; Hodgson, Murray; Ashdown, Ian

2004-08-01

This paper explores acoustical (or time-dependent) radiosity-a geometrical-acoustics sound-field prediction method that assumes diffuse surface reflection. The literature of acoustical radiosity is briefly reviewed and the advantages and disadvantages of the method are discussed. A discrete form of the integral equation that results from meshing the enclosure boundaries into patches is presented and used in a discrete-time algorithm. Furthermore, an averaging technique is used to reduce computational requirements. To generalize to nonrectangular rooms, a spherical-triangle method is proposed as a means of evaluating the integrals over solid angles that appear in the discrete form of the integral equation. The evaluation of form factors, which also appear in the numerical solution, is discussed for rectangular and nonrectangular rooms. This algorithm and associated methods are validated by comparison of the steady-state predictions for a spherical enclosure to analytical solutions.

Discrete symmetries in the heterotic-string landscape

NASA Astrophysics Data System (ADS)

Athanasopoulos, P.

2015-07-01

We describe a new type of discrete symmetry that relates heterotic-string models. It is based on the spectral flow operator which normally acts within a general N = (2, 2) model and we use this operator to construct a map between N = (2, 0) models. The landscape of N = (2, 0) models is of particular interest among all heterotic-string models for two important reasons: Firstly, N =1 spacetime SUSY requires (2, 0) superconformal invariance and secondly, models with the well motivated by the Standard Model SO(10) unification structure are of this type. This idea was inspired by a new discrete symmetry in the space of fermionic ℤ2 × ℤ2 heterotic-string models that exchanges the spinors and vectors of the SO(10) GUT group, dubbed spinor-vector duality. We will describe how to generalize this to arbitrary internal rational Conformal Field Theories.

The SMM Model as a Boundary Value Problem Using the Discrete Diffusion Equation

NASA Technical Reports Server (NTRS)

Campbell, Joel

2007-01-01

A generalized single step stepwise mutation model (SMM) is developed that takes into account an arbitrary initial state to a certain partial difference equation. This is solved in both the approximate continuum limit and the more exact discrete form. A time evolution model is developed for Y DNA or mtDNA that takes into account the reflective boundary modeling minimum microsatellite length and the original difference equation. A comparison is made between the more widely known continuum Gaussian model and a discrete model, which is based on modified Bessel functions of the first kind. A correction is made to the SMM model for the probability that two individuals are related that takes into account a reflecting boundary modeling minimum microsatellite length. This method is generalized to take into account the general n-step model and exact solutions are found. A new model is proposed for the step distribution.

Modeling of Electromagnetic Scattering by Discrete and Discretely Heterogeneous Random Media by Using Numerically Exact Solutions of the Maxwell Equations

NASA Technical Reports Server (NTRS)

Dlugach, Janna M.; Mishchenko, Michael I.

2017-01-01

In this paper, we discuss some aspects of numerical modeling of electromagnetic scattering by discrete random medium by using numerically exact solutions of the macroscopic Maxwell equations. Typical examples of such media are clouds of interstellar dust, clouds of interplanetary dust in the Solar system, dusty atmospheres of comets, particulate planetary rings, clouds in planetary atmospheres, aerosol particles with numerous inclusions and so on. Our study is based on the results of extensive computations of different characteristics of electromagnetic scattering obtained by using the superposition T-matrix method which represents a direct computer solver of the macroscopic Maxwell equations for an arbitrary multisphere configuration. As a result, in particular, we clarify the range of applicability of the low-density theories of radiative transfer and coherent backscattering as well as of widely used effective-medium approximations.

Discrete Adjoint-Based Design for Unsteady Turbulent Flows On Dynamic Overset Unstructured Grids

NASA Technical Reports Server (NTRS)

Nielsen, Eric J.; Diskin, Boris

2012-01-01

A discrete adjoint-based design methodology for unsteady turbulent flows on three-dimensional dynamic overset unstructured grids is formulated, implemented, and verified. The methodology supports both compressible and incompressible flows and is amenable to massively parallel computing environments. The approach provides a general framework for performing highly efficient and discretely consistent sensitivity analysis for problems involving arbitrary combinations of overset unstructured grids which may be static, undergoing rigid or deforming motions, or any combination thereof. General parent-child motions are also accommodated, and the accuracy of the implementation is established using an independent verification based on a complex-variable approach. The methodology is used to demonstrate aerodynamic optimizations of a wind turbine geometry, a biologically-inspired flapping wing, and a complex helicopter configuration subject to trimming constraints. The objective function for each problem is successfully reduced and all specified constraints are satisfied.

Accuracy-preserving source term quadrature for third-order edge-based discretization

NASA Astrophysics Data System (ADS)

Nishikawa, Hiroaki; Liu, Yi

2017-09-01

In this paper, we derive a family of source term quadrature formulas for preserving third-order accuracy of the node-centered edge-based discretization for conservation laws with source terms on arbitrary simplex grids. A three-parameter family of source term quadrature formulas is derived, and as a subset, a one-parameter family of economical formulas is identified that does not require second derivatives of the source term. Among the economical formulas, a unique formula is then derived that does not require gradients of the source term at neighbor nodes, thus leading to a significantly smaller discretization stencil for source terms. All the formulas derived in this paper do not require a boundary closure, and therefore can be directly applied at boundary nodes. Numerical results are presented to demonstrate third-order accuracy at interior and boundary nodes for one-dimensional grids and linear triangular/tetrahedral grids over straight and curved geometries.

The SMM model as a boundary value problem using the discrete diffusion equation.

PubMed

Campbell, Joel

2007-12-01

A generalized single-step stepwise mutation model (SMM) is developed that takes into account an arbitrary initial state to a certain partial difference equation. This is solved in both the approximate continuum limit and the more exact discrete form. A time evolution model is developed for Y DNA or mtDNA that takes into account the reflective boundary modeling minimum microsatellite length and the original difference equation. A comparison is made between the more widely known continuum Gaussian model and a discrete model, which is based on modified Bessel functions of the first kind. A correction is made to the SMM model for the probability that two individuals are related that takes into account a reflecting boundary modeling minimum microsatellite length. This method is generalized to take into account the general n-step model and exact solutions are found. A new model is proposed for the step distribution.

Lubin-Tate extensions, an elementary approach

NASA Astrophysics Data System (ADS)

Ershov, Yu L.

2007-12-01

We give an elementary proof of the assertion that the Lubin-Tate extension L\\ge K is an Abelian extension whose Galois group is isomorphic to U_K/N_{L/K}(U_L) for arbitrary fields K that have Henselian discrete valuation rings with finite residue fields. The term `elementary' only means that the proofs are algebraic (that is, no transcedental methods are used [1], pp. 327, 332).

An efficient code for the simulation of nonhydrostatic stratified flow over obstacles

NASA Technical Reports Server (NTRS)

Pihos, G. G.; Wurtele, M. G.

1981-01-01

The physical model and computational procedure of the code is described in detail. The code is validated in tests against a variety of known analytical solutions from the literature and is also compared against actual mountain wave observations. The code will receive as initial input either mathematically idealized or discrete observational data. The form of the obstacle or mountain is arbitrary.

Orchestration of Molecular Information through Higher Order Chemical Recognition

NASA Astrophysics Data System (ADS)

Frezza, Brian M.

Broadly defined, higher order chemical recognition is the process whereby discrete chemical building blocks capable of specifically binding to cognate moieties are covalently linked into oligomeric chains. These chains, or sequences, are then able to recognize and bind to their cognate sequences with a high degree of cooperativity. Principally speaking, DNA and RNA are the most readily obtained examples of this chemical phenomenon, and function via Watson-Crick cognate pairing: guanine pairs with cytosine and adenine with thymine (DNA) or uracil (RNA), in an anti-parallel manner. While the theoretical principles, techniques, and equations derived herein apply generally to any higher-order chemical recognition system, in practice we utilize DNA oligomers as a model-building material to experimentally investigate and validate our hypotheses. Historically, general purpose information processing has been a task limited to semiconductor electronics. Molecular computing on the other hand has been limited to ad hoc approaches designed to solve highly specific and unique computation problems, often involving components or techniques that cannot be applied generally in a manner suitable for precise and predictable engineering. Herein, we provide a fundamental framework for harnessing high-order recognition in a modular and programmable fashion to synthesize molecular information process networks of arbitrary construction and complexity. This document provides a solid foundation for routinely embedding computational capability into chemical and biological systems where semiconductor electronics are unsuitable for practical application.

Cognitive and neural foundations of discrete sequence skill: a TMS study.

PubMed

Ruitenberg, Marit F L; Verwey, Willem B; Schutter, Dennis J L G; Abrahamse, Elger L

2014-04-01

Executing discrete movement sequences typically involves a shift with practice from a relatively slow, stimulus-based mode to a fast mode in which performance is based on retrieving and executing entire motor chunks. The dual processor model explains the performance of (skilled) discrete key-press sequences in terms of an interplay between a cognitive processor and a motor system. In the present study, we tested and confirmed the core assumptions of this model at the behavioral level. In addition, we explored the involvement of the pre-supplementary motor area (pre-SMA) in discrete sequence skill by applying inhibitory 20 min 1-Hz off-line repetitive transcranial magnetic stimulation (rTMS). Based on previous work, we predicted pre-SMA involvement in the selection/initiation of motor chunks, and this was confirmed by our results. The pre-SMA was further observed to be more involved in more complex than in simpler sequences, while no evidence was found for pre-SMA involvement in direct stimulus-response translations or associative learning processes. In conclusion, support is provided for the dual processor model, and for pre-SMA involvement in the initiation of motor chunks. Copyright © 2014 Elsevier Ltd. All rights reserved.

Automated quadrilateral surface discretization method and apparatus usable to generate mesh in a finite element analysis system

DOEpatents

Blacker, Teddy D.

1994-01-01

An automatic quadrilateral surface discretization method and apparatus is provided for automatically discretizing a geometric region without decomposing the region. The automated quadrilateral surface discretization method and apparatus automatically generates a mesh of all quadrilateral elements which is particularly useful in finite element analysis. The generated mesh of all quadrilateral elements is boundary sensitive, orientation insensitive and has few irregular nodes on the boundary. A permanent boundary of the geometric region is input and rows are iteratively layered toward the interior of the geometric region. Also, an exterior permanent boundary and an interior permanent boundary for a geometric region may be input and the rows are iteratively layered inward from the exterior boundary in a first counter clockwise direction while the rows are iteratively layered from the interior permanent boundary toward the exterior of the region in a second clockwise direction. As a result, a high quality mesh for an arbitrary geometry may be generated with a technique that is robust and fast for complex geometric regions and extreme mesh gradations.

Specular reflection treatment for the 3D radiative transfer equation solved with the discrete ordinates method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Le Hardy, D.; Favennec, Y., E-mail: yann.favennec@univ-nantes.fr; Rousseau, B.

The contribution of this paper relies in the development of numerical algorithms for the mathematical treatment of specular reflection on borders when dealing with the numerical solution of radiative transfer problems. The radiative transfer equation being integro-differential, the discrete ordinates method allows to write down a set of semi-discrete equations in which weights are to be calculated. The calculation of these weights is well known to be based on either a quadrature or on angular discretization, making the use of such method straightforward for the state equation. Also, the diffuse contribution of reflection on borders is usually well taken intomore » account. However, the calculation of accurate partition ratio coefficients is much more tricky for the specular condition applied on arbitrary geometrical borders. This paper presents algorithms that calculate analytically partition ratio coefficients needed in numerical treatments. The developed algorithms, combined with a decentered finite element scheme, are validated with the help of comparisons with analytical solutions before being applied on complex geometries.« less

Efficient scheme for parametric fitting of data in arbitrary dimensions.

PubMed

Pang, Ning-Ning; Tzeng, Wen-Jer; Kao, Hisen-Ching

2008-07-01

We propose an efficient scheme for parametric fitting expressed in terms of the Legendre polynomials. For continuous systems, our scheme is exact and the derived explicit expression is very helpful for further analytical studies. For discrete systems, our scheme is almost as accurate as the method of singular value decomposition. Through a few numerical examples, we show that our algorithm costs much less CPU time and memory space than the method of singular value decomposition. Thus, our algorithm is very suitable for a large amount of data fitting. In addition, the proposed scheme can also be used to extract the global structure of fluctuating systems. We then derive the exact relation between the correlation function and the detrended variance function of fluctuating systems in arbitrary dimensions and give a general scaling analysis.

Nonequilibrium Fluctuations and Enhanced Diffusion of a Driven Particle in a Dense Environment

NASA Astrophysics Data System (ADS)

Illien, Pierre; Bénichou, Olivier; Oshanin, Gleb; Sarracino, Alessandro; Voituriez, Raphaël

2018-05-01

We study the diffusion of a tracer particle driven out of equilibrium by an external force and traveling in a dense environment of arbitrary density. The system evolves on a discrete lattice and its stochastic dynamics is described by a master equation. Relying on a decoupling approximation that goes beyond the naive mean-field treatment of the problem, we calculate the fluctuations of the position of the tracer around its mean value on a lattice of arbitrary dimension, and with different boundary conditions. We reveal intrinsically nonequilibrium effects, such as enhanced diffusivity of the tracer induced by both the crowding interactions and the external driving. We finally consider the high-density and low-density limits of the model and show that our approximation scheme becomes exact in these limits.

Total energy and potential enstrophy conserving schemes for the shallow water equations using Hamiltonian methods $-$ Part 1: Derivation and properties

DOE PAGES

Eldred, Christopher; Randall, David

2017-02-17

The shallow water equations provide a useful analogue of the fully compressible Euler equations since they have similar characteristics: conservation laws, inertia-gravity and Rossby waves, and a (quasi-) balanced state. In order to obtain realistic simulation results, it is desirable that numerical models have discrete analogues of these properties. Two prototypical examples of such schemes are the 1981 Arakawa and Lamb (AL81) C-grid total energy and potential enstrophy conserving scheme, and the 2007 Salmon (S07) Z-grid total energy and potential enstrophy conserving scheme. Unfortunately, the AL81 scheme is restricted to logically square, orthogonal grids, and the S07 scheme is restrictedmore » to uniform square grids. The current work extends the AL81 scheme to arbitrary non-orthogonal polygonal grids and the S07 scheme to arbitrary orthogonal spherical polygonal grids in a manner that allows for both total energy and potential enstrophy conservation, by combining Hamiltonian methods (work done by Salmon, Gassmann, Dubos, and others) and discrete exterior calculus (Thuburn, Cotter, Dubos, Ringler, Skamarock, Klemp, and others). Lastly, detailed results of the schemes applied to standard test cases are deferred to part 2 of this series of papers.« less

An efficient direct solver for rarefied gas flows with arbitrary statistics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Diaz, Manuel A., E-mail: f99543083@ntu.edu.tw; Yang, Jaw-Yen, E-mail: yangjy@iam.ntu.edu.tw; Center of Advanced Study in Theoretical Science, National Taiwan University, Taipei 10167, Taiwan

2016-01-15

A new numerical methodology associated with a unified treatment is presented to solve the Boltzmann–BGK equation of gas dynamics for the classical and quantum gases described by the Bose–Einstein and Fermi–Dirac statistics. Utilizing a class of globally-stiffly-accurate implicit–explicit Runge–Kutta scheme for the temporal evolution, associated with the discrete ordinate method for the quadratures in the momentum space and the weighted essentially non-oscillatory method for the spatial discretization, the proposed scheme is asymptotic-preserving and imposes no non-linear solver or requires the knowledge of fugacity and temperature to capture the flow structures in the hydrodynamic (Euler) limit. The proposed treatment overcomes themore » limitations found in the work by Yang and Muljadi (2011) [33] due to the non-linear nature of quantum relations, and can be applied in studying the dynamics of a gas with internal degrees of freedom with correct values of the ratio of specific heat for the flow regimes for all Knudsen numbers and energy wave lengths. The present methodology is numerically validated with the unified treatment by the one-dimensional shock tube problem and the two-dimensional Riemann problems for gases of arbitrary statistics. Descriptions of ideal quantum gases including rotational degrees of freedom have been successfully achieved under the proposed methodology.« less

Distinguishability notion based on Wootters statistical distance: Application to discrete maps

NASA Astrophysics Data System (ADS)

Gomez, Ignacio S.; Portesi, M.; Lamberti, P. W.

2017-08-01

We study the distinguishability notion given by Wootters for states represented by probability density functions. This presents the particularity that it can also be used for defining a statistical distance in chaotic unidimensional maps. Based on that definition, we provide a metric d ¯ for an arbitrary discrete map. Moreover, from d ¯ , we associate a metric space with each invariant density of a given map, which results to be the set of all distinguished points when the number of iterations of the map tends to infinity. Also, we give a characterization of the wandering set of a map in terms of the metric d ¯ , which allows us to identify the dissipative regions in the phase space. We illustrate the results in the case of the logistic and the circle maps numerically and analytically, and we obtain d ¯ and the wandering set for some characteristic values of their parameters. Finally, an extension of the metric space associated for arbitrary probability distributions (not necessarily invariant densities) is given along with some consequences. The statistical properties of distributions given by histograms are characterized in terms of the cardinal of the associated metric space. For two conjugate variables, the uncertainty principle is expressed in terms of the diameters of the associated metric space with those variables.

Multi-normed spaces based on non-discrete measures and their tensor products

NASA Astrophysics Data System (ADS)

Helemskii, A. Ya.

2018-04-01

Lambert discovered a new type of structures situated, in a sense, between normed spaces and abstract operator spaces. His definition was based on the notion of amplifying a normed space by means of the spaces \\ell_2^n. Later, several mathematicians studied more general structures (`p-multi- normed spaces') introduced by means of the spaces \\ell_p^n, 1≤ p≤∞. We pass from \\ell_p to L_p(X,μ) with an arbitrary measure. This becomes possible in the framework of the non- coordinate approach to the notion of amplification. In the case of a discrete counting measure, this approach is equivalent to the approach in the papers mentioned. Two categories arise. One consists of amplifications by means of an arbitrary normed space, and the other consists of p-convex amplifications by means of L_p(X,μ). Each of them has its own tensor product of objects (the existence of each product is proved by a separate explicit construction). As a final result, we show that the `p-convex' tensor product has an especially transparent form for the minimal L_p-amplifications of L_q-spaces, where q is conjugate to p. Namely, tensoring L_q(Y,ν) and L_q(Z,λ), we obtain L_q(Y× Z, ν×λ).

Position-specific automated processing of V3 env ultra-deep pyrosequencing data for predicting HIV-1 tropism

PubMed Central

Jeanne, Nicolas; Saliou, Adrien; Carcenac, Romain; Lefebvre, Caroline; Dubois, Martine; Cazabat, Michelle; Nicot, Florence; Loiseau, Claire; Raymond, Stéphanie; Izopet, Jacques; Delobel, Pierre

2015-01-01

HIV-1 coreceptor usage must be accurately determined before starting CCR5 antagonist-based treatment as the presence of undetected minor CXCR4-using variants can cause subsequent virological failure. Ultra-deep pyrosequencing of HIV-1 V3 env allows to detect low levels of CXCR4-using variants that current genotypic approaches miss. However, the computation of the mass of sequence data and the need to identify true minor variants while excluding artifactual sequences generated during amplification and ultra-deep pyrosequencing is rate-limiting. Arbitrary fixed cut-offs below which minor variants are discarded are currently used but the errors generated during ultra-deep pyrosequencing are sequence-dependant rather than random. We have developed an automated processing of HIV-1 V3 env ultra-deep pyrosequencing data that uses biological filters to discard artifactual or non-functional V3 sequences followed by statistical filters to determine position-specific sensitivity thresholds, rather than arbitrary fixed cut-offs. It allows to retain authentic sequences with point mutations at V3 positions of interest and discard artifactual ones with accurate sensitivity thresholds. PMID:26585833

Position-specific automated processing of V3 env ultra-deep pyrosequencing data for predicting HIV-1 tropism.

PubMed

Jeanne, Nicolas; Saliou, Adrien; Carcenac, Romain; Lefebvre, Caroline; Dubois, Martine; Cazabat, Michelle; Nicot, Florence; Loiseau, Claire; Raymond, Stéphanie; Izopet, Jacques; Delobel, Pierre

2015-11-20

HIV-1 coreceptor usage must be accurately determined before starting CCR5 antagonist-based treatment as the presence of undetected minor CXCR4-using variants can cause subsequent virological failure. Ultra-deep pyrosequencing of HIV-1 V3 env allows to detect low levels of CXCR4-using variants that current genotypic approaches miss. However, the computation of the mass of sequence data and the need to identify true minor variants while excluding artifactual sequences generated during amplification and ultra-deep pyrosequencing is rate-limiting. Arbitrary fixed cut-offs below which minor variants are discarded are currently used but the errors generated during ultra-deep pyrosequencing are sequence-dependant rather than random. We have developed an automated processing of HIV-1 V3 env ultra-deep pyrosequencing data that uses biological filters to discard artifactual or non-functional V3 sequences followed by statistical filters to determine position-specific sensitivity thresholds, rather than arbitrary fixed cut-offs. It allows to retain authentic sequences with point mutations at V3 positions of interest and discard artifactual ones with accurate sensitivity thresholds.

Method of implementing digital phase-locked loops

NASA Technical Reports Server (NTRS)

Stephens, Scott A. (Inventor); Thomas, Jess Brooks, Jr. (Inventor)

1993-01-01

In a new formulation for digital phase-locked loops, loop-filter constants are determined from loop roots that can each be selectively placed in the s-plane on the basis of a new set of parameters, each with simple and direct physical meaning in terms of loop noise bandwidth, root-specific decay rate, or root-specific damping. Loops of first to fourth order are treated in the continuous-update approximation (BLT yields 0) and in a discrete-update formulation with arbitrary BLT. Deficiencies of the continuous-update approximation in large-BLT applications are avoided in the new discrete-update formulation. A new method for direct, transient-free acquisition with third- and fourth-order loops can improve the versatility and reliability of acquisition with such loops.

Response of discrete linear systems to forcing functions with inequality constraints.

NASA Technical Reports Server (NTRS)

Michalopoulos, C. D.; Riley, T. A.

1972-01-01

An analysis is made of the maximum response of discrete, linear mechanical systems to arbitrary forcing functions which lie within specified bounds. Primary attention is focused on the complete determination of the forcing function which will engender maximum displacement to any particular mass element of a multi-degree-of-freedom system. In general, the desired forcing function is found to be a bang-bang type function, i.e., a function which switches from the maximum to the minimum bound and vice-versa at certain instants of time. Examples of two-degree-of-freedom systems, with and without damping, are presented in detail. Conclusions are drawn concerning the effect of damping on the switching times and the general procedure for finding these times is discussed.

Homogenous polynomially parameter-dependent H∞ filter designs of discrete-time fuzzy systems.

PubMed

Zhang, Huaguang; Xie, Xiangpeng; Tong, Shaocheng

2011-10-01

This paper proposes a novel H(∞) filtering technique for a class of discrete-time fuzzy systems. First, a novel kind of fuzzy H(∞) filter, which is homogenous polynomially parameter dependent on membership functions with an arbitrary degree, is developed to guarantee the asymptotic stability and a prescribed H(∞) performance of the filtering error system. Second, relaxed conditions for H(∞) performance analysis are proposed by using a new fuzzy Lyapunov function and the Finsler lemma with homogenous polynomial matrix Lagrange multipliers. Then, based on a new kind of slack variable technique, relaxed linear matrix inequality-based H(∞) filtering conditions are proposed. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed approach.

On the Existence of Simultaneous Edge Disjoint Realizations of Degree Sequences with ’Few’ Edges

DTIC Science & Technology

1975-08-01

constructing graphs and digraphs with given valences and factors. Discrete Math . 6 (1973) 79-88. 3. M. Keren, Realization of a sun of sequences by a sum...appear. 5. S. Kundu, The k factor conjecture is true. Discrete Math . 6 (1973) 367-376. 6. S. Kundu, Disjoint representation of tree realizable

BRYNTRN: A baryon transport computer code, computation procedures and data base

NASA Technical Reports Server (NTRS)

Wilson, John W.; Townsend, Lawrence W.; Chun, Sang Y.; Buck, Warren W.; Khan, Ferdous; Cucinotta, Frank

1988-01-01

The development is described of an interaction data base and a numerical solution to the transport of baryons through the arbitrary shield material based on a straight ahead approximation of the Boltzmann equation. The code is most accurate for continuous energy boundary values but gives reasonable results for discrete spectra at the boundary with even a relatively coarse energy grid (30 points) and large spatial increments (1 cm in H2O).

Stability of a modified Peaceman–Rachford method for the paraxial Helmholtz equation on adaptive grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sheng, Qin, E-mail: Qin_Sheng@baylor.edu; Sun, Hai-wei, E-mail: hsun@umac.mo

This study concerns the asymptotic stability of an eikonal, or ray, transformation based Peaceman–Rachford splitting method for solving the paraxial Helmholtz equation with high wave numbers. Arbitrary nonuniform grids are considered in transverse and beam propagation directions. The differential equation targeted has been used for modeling propagations of high intensity laser pulses over a long distance without diffractions. Self-focusing of high intensity beams may be balanced with the de-focusing effect of created ionized plasma channel in the situation, and applications of grid adaptations are frequently essential. It is shown rigorously that the fully discretized oscillation-free decomposition method on arbitrary adaptivemore » grids is asymptotically stable with a stability index one. Simulation experiments are carried out to illustrate our concern and conclusions.« less

Quantum state engineering using one-dimensional discrete-time quantum walks

NASA Astrophysics Data System (ADS)

Innocenti, Luca; Majury, Helena; Giordani, Taira; Spagnolo, Nicolò; Sciarrino, Fabio; Paternostro, Mauro; Ferraro, Alessandro

2017-12-01

Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen for implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walker's sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin and providing a method to efficiently compute the corresponding set of coin parameters. We assess the feasibility of our proposal by identifying a linear optics experiment based on photonic orbital angular momentum technology.

N -tag probability law of the symmetric exclusion process

NASA Astrophysics Data System (ADS)

Poncet, Alexis; Bénichou, Olivier; Démery, Vincent; Oshanin, Gleb

2018-06-01

The symmetric exclusion process (SEP), in which particles hop symmetrically on a discrete line with hard-core constraints, is a paradigmatic model of subdiffusion in confined systems. This anomalous behavior is a direct consequence of strong spatial correlations induced by the requirement that the particles cannot overtake each other. Even if this fact has been recognized qualitatively for a long time, up to now there has been no full quantitative determination of these correlations. Here we study the joint probability distribution of an arbitrary number of tagged particles in the SEP. We determine analytically its large-time limit for an arbitrary density of particles, and its full dynamics in the high-density limit. In this limit, we obtain the time-dependent large deviation function of the problem and unveil a universal scaling form shared by the cumulants.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wintermeyer, Niklas; Winters, Andrew R., E-mail: awinters@math.uni-koeln.de; Gassner, Gregor J.

We design an arbitrary high-order accurate nodal discontinuous Galerkin spectral element approximation for the non-linear two dimensional shallow water equations with non-constant, possibly discontinuous, bathymetry on unstructured, possibly curved, quadrilateral meshes. The scheme is derived from an equivalent flux differencing formulation of the split form of the equations. We prove that this discretization exactly preserves the local mass and momentum. Furthermore, combined with a special numerical interface flux function, the method exactly preserves the mathematical entropy, which is the total energy for the shallow water equations. By adding a specific form of interface dissipation to the baseline entropy conserving schememore » we create a provably entropy stable scheme. That is, the numerical scheme discretely satisfies the second law of thermodynamics. Finally, with a particular discretization of the bathymetry source term we prove that the numerical approximation is well-balanced. We provide numerical examples that verify the theoretical findings and furthermore provide an application of the scheme for a partial break of a curved dam test problem.« less

Statistics of primordial density perturbations from discrete seed masses

NASA Technical Reports Server (NTRS)

Scherrer, Robert J.; Bertschinger, Edmund

1991-01-01

The statistics of density perturbations for general distributions of seed masses with arbitrary matter accretion is examined. Formal expressions for the power spectrum, the N-point correlation functions, and the density distribution function are derived. These results are applied to the case of uncorrelated seed masses, and power spectra are derived for accretion of both hot and cold dark matter plus baryons. The reduced moments (cumulants) of the density distribution are computed and used to obtain a series expansion for the density distribution function. Analytic results are obtained for the density distribution function in the case of a distribution of seed masses with a spherical top-hat accretion pattern. More generally, the formalism makes it possible to give a complete characterization of the statistical properties of any random field generated from a discrete linear superposition of kernels. In particular, the results can be applied to density fields derived by smoothing a discrete set of points with a window function.

Weak form of Stokes-Dirac structures and geometric discretization of port-Hamiltonian systems

NASA Astrophysics Data System (ADS)

Kotyczka, Paul; Maschke, Bernhard; Lefèvre, Laurent

2018-05-01

We present the mixed Galerkin discretization of distributed parameter port-Hamiltonian systems. On the prototypical example of hyperbolic systems of two conservation laws in arbitrary spatial dimension, we derive the main contributions: (i) A weak formulation of the underlying geometric (Stokes-Dirac) structure with a segmented boundary according to the causality of the boundary ports. (ii) The geometric approximation of the Stokes-Dirac structure by a finite-dimensional Dirac structure is realized using a mixed Galerkin approach and power-preserving linear maps, which define minimal discrete power variables. (iii) With a consistent approximation of the Hamiltonian, we obtain finite-dimensional port-Hamiltonian state space models. By the degrees of freedom in the power-preserving maps, the resulting family of structure-preserving schemes allows for trade-offs between centered approximations and upwinding. We illustrate the method on the example of Whitney finite elements on a 2D simplicial triangulation and compare the eigenvalue approximation in 1D with a related approach.

Dynamics and Control of Flexible Space Vehicles

NASA Technical Reports Server (NTRS)

Likins, P. W.

1970-01-01

The purpose of this report is twofold: (1) to survey the established analytic procedures for the simulation of controlled flexible space vehicles, and (2) to develop in detail methods that employ a combination of discrete and distributed ("modal") coordinates, i.e., the hybrid-coordinate methods. Analytic procedures are described in three categories: (1) discrete-coordinate methods, (2) hybrid-coordinate methods, and (3) vehicle normal-coordinate methods. Each of these approaches is described and analyzed for its advantages and disadvantages, and each is found to have an area of applicability. The hybrid-coordinate method combines the efficiency of the vehicle normal-coordinate method with the versatility of the discrete-coordinate method, and appears to have the widest range of practical application. The results in this report have practical utility in two areas: (1) complex digital computer simulation of flexible space vehicles of arbitrary configuration subject to realistic control laws, and (2) preliminary control system design based on transfer functions for linearized models of dynamics and control laws.

An efficient numerical method for the solution of the problem of elasticity for 3D-homogeneous elastic medium with cracks and inclusions

NASA Astrophysics Data System (ADS)

Kanaun, S.; Markov, A.

2017-06-01

An efficient numerical method for solution of static problems of elasticity for an infinite homogeneous medium containing inhomogeneities (cracks and inclusions) is developed. Finite number of heterogeneous inclusions and planar parallel cracks of arbitrary shapes is considered. The problem is reduced to a system of surface integral equations for crack opening vectors and volume integral equations for stress tensors inside the inclusions. For the numerical solution of these equations, a class of Gaussian approximating functions is used. The method based on these functions is mesh free. For such functions, the elements of the matrix of the discretized system are combinations of explicit analytical functions and five standard 1D-integrals that can be tabulated. Thus, the numerical integration is excluded from the construction of the matrix of the discretized problem. For regular node grids, the matrix of the discretized system has Toeplitz's properties, and Fast Fourier Transform technique can be used for calculation matrix-vector products of such matrices.

Discontinuous Galerkin method for coupled problems of compressible flow and elastic structures

NASA Astrophysics Data System (ADS)

Kosík, A.; Feistauer, M.; Hadrava, M.; Horáček, J.

2013-10-01

This paper is concerned with the numerical simulation of the interaction of 2D compressible viscous flow and an elastic structure. We consider the model of dynamical linear elasticity. Each individual problem is discretized in space by the discontinuous Galerkin method (DGM). For the time discretization we can use either the BDF (backward difference formula) method or also the DGM. The time dependence of the domain occupied by the fluid is given by the deformation of the elastic structure adjacent to the flow domain. It is treated with the aid of the Arbitrary Lagrangian-Eulerian (ALE) method. The fluid-structure interaction, given by transient conditions, is realized by an iterative process. The developed method is applied to the simulation of the biomechanical problem containing the onset of the voice production.

Switched periodic systems in discrete time: stability and input-output norms

NASA Astrophysics Data System (ADS)

Bolzern, Paolo; Colaneri, Patrizio

2013-07-01

This paper deals with the analysis of stability and the characterisation of input-output norms for discrete-time periodic switched linear systems. Such systems consist of a network of time-periodic linear subsystems sharing the same state vector and an exogenous switching signal that triggers the jumps between the subsystems. The overall system exhibits a complex dynamic behaviour due to the interplay between the time periodicity of the subsystem parameters and the switching signal. Both arbitrary switching signals and signals satisfying a dwell-time constraint are considered. Linear matrix inequality conditions for stability and guaranteed H2 and H∞ performances are provided. The results heavily rely on the merge of the theory of linear periodic systems and recent developments on switched linear time-invariant systems.

Formal methods for modeling and analysis of hybrid systems

NASA Technical Reports Server (NTRS)

Tiwari, Ashish (Inventor); Lincoln, Patrick D. (Inventor)

2009-01-01

A technique based on the use of a quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata is taught. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. The technique works on linear and non-linear polynomial hybrid systems: the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. An exemplar tool in the SAL environment built over the theorem prover PVS is detailed. The technique scales well to large and complex hybrid systems.

Structure-preserving operators for thermal-nonequilibrium hydrodynamics

NASA Astrophysics Data System (ADS)

Shiroto, Takashi; Kawai, Soshi; Ohnishi, Naofumi

2018-07-01

Radiation hydrodynamics simulations based on a single fluid two-temperature model may violate the law of energy conservation, because the governing equations are expressed in a nonconservative formulation. In this study, we maintain the important physical requirements by employing a strategy based on the key concept that mathematical structures associated with conservative and nonconservative equations are preserved, even at the discrete level. To this end, we discretize the conservation laws and transform them using exact algebraic operations. The proposed scheme maintains global conservation errors within the round-off level. In addition, a numerical experiment concerning the shock tube problem suggests that the proposed scheme agrees well with the jump conditions at the discontinuities regulated by the Rankine-Hugoniot relationship. The generalized derivation allows us to employ arbitrary central difference, artificial dissipation, and Runge-Kutta methods.

Overset meshing coupled with hybridizable discontinuous Galerkin finite elements

DOE PAGES

Kauffman, Justin A.; Sheldon, Jason P.; Miller, Scott T.

2017-03-01

We introduce the use of hybridizable discontinuous Galerkin (HDG) finite element methods on overlapping (overset) meshes. Overset mesh methods are advantageous for solving problems on complex geometrical domains. We also combine geometric flexibility of overset methods with the advantages of HDG methods: arbitrarily high-order accuracy, reduced size of the global discrete problem, and the ability to solve elliptic, parabolic, and/or hyperbolic problems with a unified form of discretization. This approach to developing the ‘overset HDG’ method is to couple the global solution from one mesh to the local solution on the overset mesh. We present numerical examples for steady convection–diffusionmore » and static elasticity problems. The examples demonstrate optimal order convergence in all primal fields for an arbitrary amount of overlap of the underlying meshes.« less

A framework for developing a mimetic tensor artificial viscosity for Lagrangian hydrocodes on arbitrary polygonal and polyhedral meshes (u)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lipnikov, Konstantin; Shashkov, Mikhail

2011-01-11

We construct a new mimetic tensor artificial viscosity on general polygonal and polyhedral meshes. The tensor artificial viscosity is based on a mimetic discretization of coordinate invariant operators, divergence of a tensor and gradient of a vector. The focus of this paper is on the symmetric form, div ({mu},{var_epsilon}(u)), of the tensor artificial viscosity where {var_epsilon}(u) is the symmetrized gradient of u and {mu}, is a tensor. The mimetic discretizations of this operator is derived for the case of a full tensor coefficient {mu}, that may reflect a shock direction. We demonstrate performance of the new viscosity for the Nohmore » implosion, Sedov explosion and Saltzman piston problems in both Cartesian and axisymmetric coordinate systems.« less

Dynamic generation of light states with discrete symmetries

NASA Astrophysics Data System (ADS)

Cordero, S.; Nahmad-Achar, E.; Castaños, O.; López-Peña, R.

2018-01-01

A dynamic procedure is established within the generalized Tavis-Cummings model to generate light states with discrete point symmetries, given by the cyclic group Cn. We consider arbitrary dipolar coupling strengths of the atoms with a one-mode electromagnetic field in a cavity. The method uses mainly the matter-field entanglement properties of the system, which can be extended to any number of three-level atoms. An initial state constituted by the superposition of two states with definite total excitation numbers, |ψ〉 M1,and |ψ〉 M 2, is considered. It can be generated by the proper selection of the time of flight of an atom passing through the cavity. We demonstrate that the resulting Husimi function of the light is invariant under cyclic point transformations of order n =| M1-M2| .

Microprocessor-based integration of microfluidic control for the implementation of automated sensor monitoring and multithreaded optimization algorithms.

PubMed

Ezra, Elishai; Maor, Idan; Bavli, Danny; Shalom, Itai; Levy, Gahl; Prill, Sebastian; Jaeger, Magnus S; Nahmias, Yaakov

2015-08-01

Microfluidic applications range from combinatorial synthesis to high throughput screening, with platforms integrating analog perfusion components, digitally controlled micro-valves and a range of sensors that demand a variety of communication protocols. Currently, discrete control units are used to regulate and monitor each component, resulting in scattered control interfaces that limit data integration and synchronization. Here, we present a microprocessor-based control unit, utilizing the MS Gadgeteer open framework that integrates all aspects of microfluidics through a high-current electronic circuit that supports and synchronizes digital and analog signals for perfusion components, pressure elements, and arbitrary sensor communication protocols using a plug-and-play interface. The control unit supports an integrated touch screen and TCP/IP interface that provides local and remote control of flow and data acquisition. To establish the ability of our control unit to integrate and synchronize complex microfluidic circuits we developed an equi-pressure combinatorial mixer. We demonstrate the generation of complex perfusion sequences, allowing the automated sampling, washing, and calibrating of an electrochemical lactate sensor continuously monitoring hepatocyte viability following exposure to the pesticide rotenone. Importantly, integration of an optical sensor allowed us to implement automated optimization protocols that require different computational challenges including: prioritized data structures in a genetic algorithm, distributed computational efforts in multiple-hill climbing searches and real-time realization of probabilistic models in simulated annealing. Our system offers a comprehensive solution for establishing optimization protocols and perfusion sequences in complex microfluidic circuits.

Segmented strings and the McMillan map

DOE PAGES

Gubser, Steven S.; Parikh, Sarthak; Witaszczyk, Przemek

2016-07-25

We present new exact solutions describing motions of closed segmented strings in AdS 3 in terms of elliptic functions. The existence of analytic expressions is due to the integrability of the classical equations of motion, which in our examples reduce to instances of the McMillan map. Here, we also obtain a discrete evolution rule for the motion in AdS 3 of arbitrary bound states of fundamental strings and D1-branes in the test approximation.

Unstructured Polyhedral Mesh Thermal Radiation Diffusion

DOE Office of Scientific and Technical Information (OSTI.GOV)

Palmer, T.S.; Zika, M.R.; Madsen, N.K.

2000-07-27

Unstructured mesh particle transport and diffusion methods are gaining wider acceptance as mesh generation, scientific visualization and linear solvers improve. This paper describes an algorithm that is currently being used in the KULL code at Lawrence Livermore National Laboratory to solve the radiative transfer equations. The algorithm employs a point-centered diffusion discretization on arbitrary polyhedral meshes in 3D. We present the results of a few test problems to illustrate the capabilities of the radiation diffusion module.

Particle Size Distributions in Atmospheric Clouds

NASA Technical Reports Server (NTRS)

Paoli, Roberto; Shariff, Karim

2003-01-01

In this note, we derive a transport equation for a spatially integrated distribution function of particles size that is suitable for sparse particle systems, such as in atmospheric clouds. This is done by integrating a Boltzmann equation for a (local) distribution function over an arbitrary but finite volume. A methodology for evolving the moments of the integrated distribution is presented. These moments can be either tracked for a finite number of discrete populations ('clusters') or treated as continuum variables.

Dynamical Localization for Unitary Anderson Models

NASA Astrophysics Data System (ADS)

Hamza, Eman; Joye, Alain; Stolz, Günter

2009-11-01

This paper establishes dynamical localization properties of certain families of unitary random operators on the d-dimensional lattice in various regimes. These operators are generalizations of one-dimensional physical models of quantum transport and draw their name from the analogy with the discrete Anderson model of solid state physics. They consist in a product of a deterministic unitary operator and a random unitary operator. The deterministic operator has a band structure, is absolutely continuous and plays the role of the discrete Laplacian. The random operator is diagonal with elements given by i.i.d. random phases distributed according to some absolutely continuous measure and plays the role of the random potential. In dimension one, these operators belong to the family of CMV-matrices in the theory of orthogonal polynomials on the unit circle. We implement the method of Aizenman-Molchanov to prove exponential decay of the fractional moments of the Green function for the unitary Anderson model in the following three regimes: In any dimension, throughout the spectrum at large disorder and near the band edges at arbitrary disorder and, in dimension one, throughout the spectrum at arbitrary disorder. We also prove that exponential decay of fractional moments of the Green function implies dynamical localization, which in turn implies spectral localization. These results complete the analogy with the self-adjoint case where dynamical localization is known to be true in the same three regimes.

An Embedded 3D Fracture Modeling Approach for Simulating Fracture-Dominated Fluid Flow and Heat Transfer in Geothermal Reservoirs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Johnston, Henry; Wang, Cong; Winterfeld, Philip

An efficient modeling approach is described for incorporating arbitrary 3D, discrete fractures, such as hydraulic fractures or faults, into modeling fracture-dominated fluid flow and heat transfer in fractured geothermal reservoirs. This technique allows 3D discrete fractures to be discretized independently from surrounding rock volume and inserted explicitly into a primary fracture/matrix grid, generated without including 3D discrete fractures in prior. An effective computational algorithm is developed to discretize these 3D discrete fractures and construct local connections between 3D fractures and fracture/matrix grid blocks of representing the surrounding rock volume. The constructed gridding information on 3D fractures is then added tomore » the primary grid. This embedded fracture modeling approach can be directly implemented into a developed geothermal reservoir simulator via the integral finite difference (IFD) method or with TOUGH2 technology This embedded fracture modeling approach is very promising and computationally efficient to handle realistic 3D discrete fractures with complicated geometries, connections, and spatial distributions. Compared with other fracture modeling approaches, it avoids cumbersome 3D unstructured, local refining procedures, and increases computational efficiency by simplifying Jacobian matrix size and sparsity, while keeps sufficient accuracy. Several numeral simulations are present to demonstrate the utility and robustness of the proposed technique. Our numerical experiments show that this approach captures all the key patterns about fluid flow and heat transfer dominated by fractures in these cases. Thus, this approach is readily available to simulation of fractured geothermal reservoirs with both artificial and natural fractures.« less

Implementation of perfectly matched layers in an arbitrary geometrical boundary for elastic wave modelling

NASA Astrophysics Data System (ADS)

Gao, Hongwei; Zhang, Jianfeng

2008-09-01

The perfectly matched layer (PML) absorbing boundary condition is incorporated into an irregular-grid elastic-wave modelling scheme, thus resulting in an irregular-grid PML method. We develop the irregular-grid PML method using the local coordinate system based PML splitting equations and integral formulation of the PML equations. The irregular-grid PML method is implemented under a discretization of triangular grid cells, which has the ability to absorb incident waves in arbitrary directions. This allows the PML absorbing layer to be imposed along arbitrary geometrical boundaries. As a result, the computational domain can be constructed with smaller nodes, for instance, to represent the 2-D half-space by a semi-circle rather than a rectangle. By using a smooth artificial boundary, the irregular-grid PML method can also avoid the special treatments to the corners, which lead to complex computer implementations in the conventional PML method. We implement the irregular-grid PML method in both 2-D elastic isotropic and anisotropic media. The numerical simulations of a VTI lamb's problem, wave propagation in an isotropic elastic medium with curved surface and in a TTI medium demonstrate the good behaviour of the irregular-grid PML method.

Self-replicating machines in continuous space with virtual physics.

PubMed

Smith, Arnold; Turney, Peter; Ewaschuk, Robert

2003-01-01

JohnnyVon is an implementation of self-replicating machines in continuous two-dimensional space. Two types of particles drift about in a virtual liquid. The particles are automata with discrete internal states but continuous external relationships. Their internal states are governed by finite state machines, but their external relationships are governed by a simulated physics that includes Brownian motion, viscosity, and springlike attractive and repulsive forces. The particles can be assembled into patterns that can encode arbitrary strings of bits. We demonstrate that, if an arbitrary seed pattern is put in a soup of separate individual particles, the pattern will replicate by assembling the individual particles into copies of itself. We also show that, given sufficient time, a soup of separate individual particles will eventually spontaneously form self-replicating patterns. We discuss the implications of JohnnyVon for research in nanotechnology, theoretical biology, and artificial life.

Quantum communication through an unmodulated spin chain.

PubMed

Bose, Sougato

2003-11-14

We propose a scheme for using an unmodulated and unmeasured spin chain as a channel for short distance quantum communications. The state to be transmitted is placed on one spin of the chain and received later on a distant spin with some fidelity. We first obtain simple expressions for the fidelity of quantum state transfer and the amount of entanglement sharable between any two sites of an arbitrary Heisenberg ferromagnet using our scheme. We then apply this to the realizable case of an open ended chain with nearest neighbor interactions. The fidelity of quantum state transfer is obtained as an inverse discrete cosine transform and as a Bessel function series. We find that in a reasonable time, a qubit can be directly transmitted with better than classical fidelity across the full length of chains of up to 80 spins. Moreover, our channel allows distillable entanglement to be shared over arbitrary distances.

Maximum-entropy probability distributions under Lp-norm constraints

NASA Technical Reports Server (NTRS)

Dolinar, S.

1991-01-01

Continuous probability density functions and discrete probability mass functions are tabulated which maximize the differential entropy or absolute entropy, respectively, among all probability distributions with a given L sub p norm (i.e., a given pth absolute moment when p is a finite integer) and unconstrained or constrained value set. Expressions for the maximum entropy are evaluated as functions of the L sub p norm. The most interesting results are obtained and plotted for unconstrained (real valued) continuous random variables and for integer valued discrete random variables. The maximum entropy expressions are obtained in closed form for unconstrained continuous random variables, and in this case there is a simple straight line relationship between the maximum differential entropy and the logarithm of the L sub p norm. Corresponding expressions for arbitrary discrete and constrained continuous random variables are given parametrically; closed form expressions are available only for special cases. However, simpler alternative bounds on the maximum entropy of integer valued discrete random variables are obtained by applying the differential entropy results to continuous random variables which approximate the integer valued random variables in a natural manner. All the results are presented in an integrated framework that includes continuous and discrete random variables, constraints on the permissible value set, and all possible values of p. Understanding such as this is useful in evaluating the performance of data compression schemes.

Computer simulation of random variables and vectors with arbitrary probability distribution laws

NASA Technical Reports Server (NTRS)

Bogdan, V. M.

1981-01-01

Assume that there is given an arbitrary n-dimensional probability distribution F. A recursive construction is found for a sequence of functions x sub 1 = f sub 1 (U sub 1, ..., U sub n), ..., x sub n = f sub n (U sub 1, ..., U sub n) such that if U sub 1, ..., U sub n are independent random variables having uniform distribution over the open interval (0,1), then the joint distribution of the variables x sub 1, ..., x sub n coincides with the distribution F. Since uniform independent random variables can be well simulated by means of a computer, this result allows one to simulate arbitrary n-random variables if their joint probability distribution is known.

A generalized theoretical framework for the description of spin decoupling in solid-state MAS NMR: Offset effect on decoupling performance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tan, Kong Ooi; Meier, Beat H., E-mail: beme@ethz.ch, E-mail: maer@ethz.ch; Ernst, Matthias, E-mail: beme@ethz.ch, E-mail: maer@ethz.ch

2016-09-07

We present a generalized theoretical framework that allows the approximate but rapid analysis of residual couplings of arbitrary decoupling sequences in solid-state NMR under magic-angle spinning conditions. It is a generalization of the tri-modal Floquet analysis of TPPM decoupling [Scholz et al., J. Chem. Phys. 130, 114510 (2009)] where three characteristic frequencies are used to describe the pulse sequence. Such an approach can be used to describe arbitrary periodic decoupling sequences that differ only in the magnitude of the Fourier coefficients of the interaction-frame transformation. It allows a ∼100 times faster calculation of second-order residual couplings as a function ofmore » pulse sequence parameters than full spin-dynamics simulations. By comparing the theoretical calculations with full numerical simulations, we show the potential of the new approach to examine the performance of decoupling sequences. We exemplify the usefulness of this framework by analyzing the performance of commonly used high-power decoupling sequences and low-power decoupling sequences such as amplitude-modulated XiX (AM-XiX) and its super-cycled variant SC-AM-XiX. In addition, the effect of chemical-shift offset is examined for both high- and low-power decoupling sequences. The results show that the cross-terms between the dipolar couplings are the main contributions to the line broadening when offset is present. We also show that the SC-AM-XIX shows a better offset compensation.« less

A generalized theoretical framework for the description of spin decoupling in solid-state MAS NMR: Offset effect on decoupling performance.

PubMed

Tan, Kong Ooi; Agarwal, Vipin; Meier, Beat H; Ernst, Matthias

2016-09-07

We present a generalized theoretical framework that allows the approximate but rapid analysis of residual couplings of arbitrary decoupling sequences in solid-state NMR under magic-angle spinning conditions. It is a generalization of the tri-modal Floquet analysis of TPPM decoupling [Scholz et al., J. Chem. Phys. 130, 114510 (2009)] where three characteristic frequencies are used to describe the pulse sequence. Such an approach can be used to describe arbitrary periodic decoupling sequences that differ only in the magnitude of the Fourier coefficients of the interaction-frame transformation. It allows a ∼100 times faster calculation of second-order residual couplings as a function of pulse sequence parameters than full spin-dynamics simulations. By comparing the theoretical calculations with full numerical simulations, we show the potential of the new approach to examine the performance of decoupling sequences. We exemplify the usefulness of this framework by analyzing the performance of commonly used high-power decoupling sequences and low-power decoupling sequences such as amplitude-modulated XiX (AM-XiX) and its super-cycled variant SC-AM-XiX. In addition, the effect of chemical-shift offset is examined for both high- and low-power decoupling sequences. The results show that the cross-terms between the dipolar couplings are the main contributions to the line broadening when offset is present. We also show that the SC-AM-XIX shows a better offset compensation.

Note: On the relation between Lifson-Jackson and Derrida formulas for effective diffusion coefficient

NASA Astrophysics Data System (ADS)

Kalnin, Juris R.; Berezhkovskii, Alexander M.

2013-11-01

The Lifson-Jackson formula provides the effective free diffusion coefficient for a particle diffusing in an arbitrary one-dimensional periodic potential. Its counterpart, when the underlying dynamics is described in terms of an unbiased nearest-neighbor Markovian random walk on a one-dimensional periodic lattice is given by the formula obtained by Derrida. It is shown that the latter formula can be considered as a discretized version of the Lifson-Jackson formula with correctly chosen position-dependent diffusion coefficient.

Development of a time-dependent incompressible Navier-Stokes solver based on a fractional-step method

NASA Technical Reports Server (NTRS)

Rosenfeld, Moshe

1990-01-01

The main goals are the development, validation, and application of a fractional step solution method of the time-dependent incompressible Navier-Stokes equations in generalized coordinate systems. A solution method that combines a finite volume discretization with a novel choice of the dependent variables and a fractional step splitting to obtain accurate solutions in arbitrary geometries is extended to include more general situations, including cases with moving grids. The numerical techniques are enhanced to gain efficiency and generality.

Perceptual Optimization of DCT Color Quantization Matrices

NASA Technical Reports Server (NTRS)

Watson, Andrew B.; Statler, Irving C. (Technical Monitor)

1994-01-01

Many image compression schemes employ a block Discrete Cosine Transform (DCT) and uniform quantization. Acceptable rate/distortion performance depends upon proper design of the quantization matrix. In previous work, we showed how to use a model of the visibility of DCT basis functions to design quantization matrices for arbitrary display resolutions and color spaces. Subsequently, we showed how to optimize greyscale quantization matrices for individual images, for optimal rate/perceptual distortion performance. Here we describe extensions of this optimization algorithm to color images.

Lagrangian continuum dynamics in ALEGRA.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wong, Michael K. W.; Love, Edward

Alegra is an ALE (Arbitrary Lagrangian-Eulerian) multi-material finite element code that emphasizes large deformations and strong shock physics. The Lagrangian continuum dynamics package in Alegra uses a Galerkin finite element spatial discretization and an explicit central-difference stepping method in time. The goal of this report is to describe in detail the characteristics of this algorithm, including the conservation and stability properties. The details provided should help both researchers and analysts understand the underlying theory and numerical implementation of the Alegra continuum hydrodynamics algorithm.

A fast Cauchy-Riemann solver. [differential equation solution for boundary conditions by finite difference approximation

NASA Technical Reports Server (NTRS)

Ghil, M.; Balgovind, R.

1979-01-01

The inhomogeneous Cauchy-Riemann equations in a rectangle are discretized by a finite difference approximation. Several different boundary conditions are treated explicitly, leading to algorithms which have overall second-order accuracy. All boundary conditions with either u or v prescribed along a side of the rectangle can be treated by similar methods. The algorithms presented here have nearly minimal time and storage requirements and seem suitable for development into a general-purpose direct Cauchy-Riemann solver for arbitrary boundary conditions.

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

ERIC Educational Resources Information Center

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

2014-01-01

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

On the role of the SMA in the discrete sequence production task: a TMS study. Transcranial Magnetic Stimulation.

PubMed

Verwey, Willem B; Lammens, Robin; van Honk, Jack

2002-01-01

Participants practiced two discrete six-key sequences for a total of 420 trials. The 1 x 6 sequence had a unique order of key presses while the 2 x 3 sequence involved repetition of a three-key segment. Both sequences showed a long interkey interval halfway the sequence indicating hierarchical sequence control in that not only the 2 x 3 but also the 1 x 6 sequence was executed as two successive motor chunks. Besides, the second part of both sequences was executed faster than the first part. This supports the earlier notion of a motor processor executing the elements of familiar motor chunks and a cognitive processor triggering either these motor chunks or individual sequence elements. Low-frequency, off-line transcranial magnetic stimulation (TMS) of the supplementary motor area (SMA) counteracted normal improvement with practice of key presses at all sequence positions. Together, these results are in line with the notion that with moderate practice, the SMA executes short sequence fragments that are concatenated by other brain structures.

(abstract) Synthesis of Speaker Facial Movements to Match Selected Speech Sequences

NASA Technical Reports Server (NTRS)

Scott, Kenneth C.

1994-01-01

We are developing a system for synthesizing image sequences the simulate the facial motion of a speaker. To perform this synthesis, we are pursuing two major areas of effort. We are developing the necessary computer graphics technology to synthesize a realistic image sequence of a person speaking selected speech sequences. Next, we are developing a model that expresses the relation between spoken phonemes and face/mouth shape. A subject is video taped speaking an arbitrary text that contains expression of the full list of desired database phonemes. The subject is video taped from the front speaking normally, recording both audio and video detail simultaneously. Using the audio track, we identify the specific video frames on the tape relating to each spoken phoneme. From this range we digitize the video frame which represents the extreme of mouth motion/shape. Thus, we construct a database of images of face/mouth shape related to spoken phonemes. A selected audio speech sequence is recorded which is the basis for synthesizing a matching video sequence; the speaker need not be the same as used for constructing the database. The audio sequence is analyzed to determine the spoken phoneme sequence and the relative timing of the enunciation of those phonemes. Synthesizing an image sequence corresponding to the spoken phoneme sequence is accomplished using a graphics technique known as morphing. Image sequence keyframes necessary for this processing are based on the spoken phoneme sequence and timing. We have been successful in synthesizing the facial motion of a native English speaker for a small set of arbitrary speech segments. Our future work will focus on advancement of the face shape/phoneme model and independent control of facial features.

Comparison of specificity and information for fuzzy domains

NASA Technical Reports Server (NTRS)

Ramer, Arthur

1992-01-01

This paper demonstrates how an integrated theory can be built on the foundation of possibility theory. Information and uncertainty were considered in 'fuzzy' literature since 1982. Our departing point is the model proposed by Klir for the discrete case. It was elaborated axiomatically by Ramer, who also introduced the continuous model. Specificity as a numerical function was considered mostly within Dempster-Shafer evidence theory. An explicity definition was given first by Yager, who has also introduced it in the context of possibility theory. Axiomatic approach and the continuous model have been developed very recently by Ramer and Yager. They also establish a close analytical correspondence between specificity and information. In literature to date, specificity and uncertainty are defined only for the discrete finite domains, with a sole exception. Our presentation removes these limitations. We define specificity measures for arbitrary measurable domains.

Determining Trajectory of Triboelectrically Charged Particles, Using Discrete Element Modeling

NASA Technical Reports Server (NTRS)

2008-01-01

The Kennedy Space Center (KSC) Electrostatics and Surface Physics Laboratory is participating in an Innovative Partnership Program (IPP) project with an industry partner to modify a commercial off-the-shelf simulation software product to treat the electrodynamics of particulate systems. Discrete element modeling (DEM) is a numerical technique that can track the dynamics of particle systems. This technique, which was introduced in 1979 for analysis of rock mechanics, was recently refined to include the contact force interaction of particles with arbitrary surfaces and moving machinery. In our work, we endeavor to incorporate electrostatic forces into the DEM calculations to enhance the fidelity of the software and its applicability to (1) particle processes, such as electrophotography, that are greatly affected by electrostatic forces, (2) grain and dust transport, and (3) the study of lunar and Martian regoliths.

Three-dimensional unsteady Euler equations solutions on dynamic grids

NASA Technical Reports Server (NTRS)

Belk, D. M.; Janus, J. M.; Whitfield, D. L.

1985-01-01

A method is presented for solving the three-dimensional unsteady Euler equations on dynamic grids based on flux vector splitting. The equations are cast in curvilinear coordinates and a finite volume discretization is used for handling arbitrary geometries. The discretized equations are solved using an explicit upwind second-order predictor corrector scheme that is stable for a CFL of 2. Characteristic variable boundary conditions are developed and used for unsteady impermeable surfaces and for the far-field boundary. Dynamic-grid results are presented for an oscillating air-foil and for a store separating from a reflection plate. For the cases considered of stores separating from a reflection plate, the unsteady aerodynamic forces on the store are significantly different from forces obtained by steady-state aerodynamics with the body inclination angle changed to account for plunge velocity.

Tempest - Efficient Computation of Atmospheric Flows Using High-Order Local Discretization Methods

NASA Astrophysics Data System (ADS)

Ullrich, P. A.; Guerra, J. E.

2014-12-01

The Tempest Framework composes several compact numerical methods to easily facilitate intercomparison of atmospheric flow calculations on the sphere and in rectangular domains. This framework includes the implementations of Spectral Elements, Discontinuous Galerkin, Flux Reconstruction, and Hybrid Finite Element methods with the goal of achieving optimal accuracy in the solution of atmospheric problems. Several advantages of this approach are discussed such as: improved pressure gradient calculation, numerical stability by vertical/horizontal splitting, arbitrary order of accuracy, etc. The local numerical discretization allows for high performance parallel computation and efficient inclusion of parameterizations. These techniques are used in conjunction with a non-conformal, locally refined, cubed-sphere grid for global simulations and standard Cartesian grids for simulations at the mesoscale. A complete implementation of the methods described is demonstrated in a non-hydrostatic setting.

Numerical analysis of field-modulated electroosmotic flows in microchannels with arbitrary numbers and configurations of discrete electrodes.

PubMed

Chao, Kan; Chen, Bo; Wu, Jiankang

2010-12-01

The formation of an electric double layer and electroosmosis are important theoretic foundations associated with microfluidic systems. Field-modulated electroosmotic flows in microchannels can be obtained by applying modulating electric fields in a direction perpendicular to a channel wall. This paper presents a systematic numerical analysis of modulated electroosmotic flows in a microchannel with discrete electrodes on the basis of the Poisson equation of electric fields in a liquid-solid coupled domain, the Navier-Stokes equation of liquid flow, and the Nernst-Planck equation of ion transport. These equations are nonlinearly coupled and are simultaneously solved numerically for the electroosmotic flow velocity, electric potential, and ion concentrations in the microchannel. A number of numerical examples of modulated electroosmotic flows in microchannels with discrete electrodes are presented, including single electrodes, symmetric/asymmetric double electrodes, and triple electrodes. Numerical results indicate that chaotic circulation flows, micro-vortices, and effective fluid mixing can be realized in microchannels by applying modulating electric fields with various electrode configurations. The interaction of a modulating field with an applied field along the channel is also discussed.

The nature of plant species.

PubMed

Rieseberg, Loren H; Wood, Troy E; Baack, Eric J

2006-03-23

Many botanists doubt the existence of plant species, viewing them as arbitrary constructs of the human mind, as opposed to discrete, objective entities that represent reproductively independent lineages or 'units of evolution'. However, the discreteness of plant species and their correspondence with reproductive communities have not been tested quantitatively, allowing zoologists to argue that botanists have been overly influenced by a few 'botanical horror stories', such as dandelions, blackberries and oaks. Here we analyse phenetic and/or crossing relationships in over 400 genera of plants and animals. We show that although discrete phenotypic clusters exist in most genera (> 80%), the correspondence of taxonomic species to these clusters is poor (< 60%) and no different between plants and animals. Lack of congruence is caused by polyploidy, asexual reproduction and over-differentiation by taxonomists, but not by contemporary hybridization. Nonetheless, crossability data indicate that 70% of taxonomic species and 75% of phenotypic clusters in plants correspond to reproductively independent lineages (as measured by postmating isolation), and thus represent biologically real entities. Contrary to conventional wisdom, plant species are more likely than animal species to represent reproductively independent lineages.

An entropy stable nodal discontinuous Galerkin method for the two dimensional shallow water equations on unstructured curvilinear meshes with discontinuous bathymetry

NASA Astrophysics Data System (ADS)

Wintermeyer, Niklas; Winters, Andrew R.; Gassner, Gregor J.; Kopriva, David A.

2017-07-01

We design an arbitrary high-order accurate nodal discontinuous Galerkin spectral element approximation for the non-linear two dimensional shallow water equations with non-constant, possibly discontinuous, bathymetry on unstructured, possibly curved, quadrilateral meshes. The scheme is derived from an equivalent flux differencing formulation of the split form of the equations. We prove that this discretization exactly preserves the local mass and momentum. Furthermore, combined with a special numerical interface flux function, the method exactly preserves the mathematical entropy, which is the total energy for the shallow water equations. By adding a specific form of interface dissipation to the baseline entropy conserving scheme we create a provably entropy stable scheme. That is, the numerical scheme discretely satisfies the second law of thermodynamics. Finally, with a particular discretization of the bathymetry source term we prove that the numerical approximation is well-balanced. We provide numerical examples that verify the theoretical findings and furthermore provide an application of the scheme for a partial break of a curved dam test problem.

A high-order staggered meshless method for elliptic problems

DOE PAGES

Trask, Nathaniel; Perego, Mauro; Bochev, Pavel Blagoveston

2017-03-21

Here, we present a new meshless method for scalar diffusion equations, which is motivated by their compatible discretizations on primal-dual grids. Unlike the latter though, our approach is truly meshless because it only requires the graph of nearby neighbor connectivity of the discretization points. This graph defines a local primal-dual grid complex with a virtual dual grid, in the sense that specification of the dual metric attributes is implicit in the method's construction. Our method combines a topological gradient operator on the local primal grid with a generalized moving least squares approximation of the divergence on the local dual grid. We show that the resulting approximation of the div-grad operator maintains polynomial reproduction to arbitrary orders and yields a meshless method, which attainsmore » $$O(h^{m})$$ convergence in both $L^2$- and $H^1$-norms, similar to mixed finite element methods. We demonstrate this convergence on curvilinear domains using manufactured solutions in two and three dimensions. Application of the new method to problems with discontinuous coefficients reveals solutions that are qualitatively similar to those of compatible mesh-based discretizations.« less

Computationally efficient approach for solving time dependent diffusion equation with discrete temporal convolution applied to granular particles of battery electrodes

NASA Astrophysics Data System (ADS)

Senegačnik, Jure; Tavčar, Gregor; Katrašnik, Tomaž

2015-03-01

The paper presents a computationally efficient method for solving the time dependent diffusion equation in a granule of the Li-ion battery's granular solid electrode. The method, called Discrete Temporal Convolution method (DTC), is based on a discrete temporal convolution of the analytical solution of the step function boundary value problem. This approach enables modelling concentration distribution in the granular particles for arbitrary time dependent exchange fluxes that do not need to be known a priori. It is demonstrated in the paper that the proposed method features faster computational times than finite volume/difference methods and Padé approximation at the same accuracy of the results. It is also demonstrated that all three addressed methods feature higher accuracy compared to the quasi-steady polynomial approaches when applied to simulate the current densities variations typical for mobile/automotive applications. The proposed approach can thus be considered as one of the key innovative methods enabling real-time capability of the multi particle electrochemical battery models featuring spatial and temporal resolved particle concentration profiles.

Minimizing finite-volume discretization errors on polyhedral meshes

NASA Astrophysics Data System (ADS)

Mouly, Quentin; Evrard, Fabien; van Wachem, Berend; Denner, Fabian

2017-11-01

Tetrahedral meshes are widely used in CFD to simulate flows in and around complex geometries, as automatic generation tools now allow tetrahedral meshes to represent arbitrary domains in a relatively accessible manner. Polyhedral meshes, however, are an increasingly popular alternative. While tetrahedron have at most four neighbours, the higher number of neighbours per polyhedral cell leads to a more accurate evaluation of gradients, essential for the numerical resolution of PDEs. The use of polyhedral meshes, nonetheless, introduces discretization errors for finite-volume methods: skewness and non-orthogonality, which occur with all sorts of unstructured meshes, as well as errors due to non-planar faces, specific to polygonal faces with more than three vertices. Indeed, polyhedral mesh generation algorithms cannot, in general, guarantee to produce meshes free of non-planar faces. The presented work focuses on the quantification and optimization of discretization errors on polyhedral meshes in the context of finite-volume methods. A quasi-Newton method is employed to optimize the relevant mesh quality measures. Various meshes are optimized and CFD results of cases with known solutions are presented to assess the improvements the optimization approach can provide.

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis

PubMed Central

2012-01-01

Background Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2-L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations. Results The exploratory analysis described here consisted of selecting foundational string problems and refactoring them using CGR-based algorithms. We found that CGR can take the role of suffix trees and emulate sophisticated string algorithms, efficiently solving exact and approximate string matching problems such as finding all palindromes and tandem repeats, and matching with mismatches. The common feature of these problems is that they use longest common extension (LCE) queries as subtasks of their procedures, which we show to have a constant time solution with CGR. Additionally, we show that CGR can be used as a rolling hash function within the Rabin-Karp algorithm. Conclusions The analysis of biological sequences relies on algorithmic foundations facing mounting challenges, both logistic (performance) and analytical (lack of unifying mathematical framework). CGR is found to provide the latter and to promise the former: graph-based data structures for sequence analysis operations are entailed by numerical-based data structures produced by CGR maps, providing a unifying analytical framework for a diversity of pattern matching problems. PMID:22551152

Discrete Time Rescaling Theorem: Determining Goodness of Fit for Discrete Time Statistical Models of Neural Spiking

PubMed Central

Haslinger, Robert; Pipa, Gordon; Brown, Emery

2010-01-01

One approach for understanding the encoding of information by spike trains is to fit statistical models and then test their goodness of fit. The time rescaling theorem provides a goodness of fit test consistent with the point process nature of spike trains. The interspike intervals (ISIs) are rescaled (as a function of the model’s spike probability) to be independent and exponentially distributed if the model is accurate. A Kolmogorov Smirnov (KS) test between the rescaled ISIs and the exponential distribution is then used to check goodness of fit. This rescaling relies upon assumptions of continuously defined time and instantaneous events. However spikes have finite width and statistical models of spike trains almost always discretize time into bins. Here we demonstrate that finite temporal resolution of discrete time models prevents their rescaled ISIs from being exponentially distributed. Poor goodness of fit may be erroneously indicated even if the model is exactly correct. We present two adaptations of the time rescaling theorem to discrete time models. In the first we propose that instead of assuming the rescaled times to be exponential, the reference distribution be estimated through direct simulation by the fitted model. In the second, we prove a discrete time version of the time rescaling theorem which analytically corrects for the effects of finite resolution. This allows us to define a rescaled time which is exponentially distributed, even at arbitrary temporal discretizations. We demonstrate the efficacy of both techniques by fitting Generalized Linear Models (GLMs) to both simulated spike trains and spike trains recorded experimentally in monkey V1 cortex. Both techniques give nearly identical results, reducing the false positive rate of the KS test and greatly increasing the reliability of model evaluation based upon the time rescaling theorem. PMID:20608868

A hierarchical preconditioner for the electric field integral equation on unstructured meshes based on primal and dual Haar bases

NASA Astrophysics Data System (ADS)

Adrian, S. B.; Andriulli, F. P.; Eibert, T. F.

2017-02-01

A new hierarchical basis preconditioner for the electric field integral equation (EFIE) operator is introduced. In contrast to existing hierarchical basis preconditioners, it works on arbitrary meshes and preconditions both the vector and the scalar potential within the EFIE operator. This is obtained by taking into account that the vector and the scalar potential discretized with loop-star basis functions are related to the hypersingular and the single layer operator (i.e., the well known integral operators from acoustics). For the single layer operator discretized with piecewise constant functions, a hierarchical preconditioner can easily be constructed. Thus the strategy we propose in this work for preconditioning the EFIE is the transformation of the scalar and the vector potential into operators equivalent to the single layer operator and to its inverse. More specifically, when the scalar potential is discretized with star functions as source and testing functions, the resulting matrix is a single layer operator discretized with piecewise constant functions and multiplied left and right with two additional graph Laplacian matrices. By inverting these graph Laplacian matrices, the discretized single layer operator is obtained, which can be preconditioned with the hierarchical basis. Dually, when the vector potential is discretized with loop functions, the resulting matrix can be interpreted as a hypersingular operator discretized with piecewise linear functions. By leveraging on a scalar Calderón identity, we can interpret this operator as spectrally equivalent to the inverse single layer operator. Then we use a linear-in-complexity, closed-form inverse of the dual hierarchical basis to precondition the hypersingular operator. The numerical results show the effectiveness of the proposed preconditioner and the practical impact of theoretical developments in real case scenarios.

Discrete time rescaling theorem: determining goodness of fit for discrete time statistical models of neural spiking.

PubMed

Haslinger, Robert; Pipa, Gordon; Brown, Emery

2010-10-01

One approach for understanding the encoding of information by spike trains is to fit statistical models and then test their goodness of fit. The time-rescaling theorem provides a goodness-of-fit test consistent with the point process nature of spike trains. The interspike intervals (ISIs) are rescaled (as a function of the model's spike probability) to be independent and exponentially distributed if the model is accurate. A Kolmogorov-Smirnov (KS) test between the rescaled ISIs and the exponential distribution is then used to check goodness of fit. This rescaling relies on assumptions of continuously defined time and instantaneous events. However, spikes have finite width, and statistical models of spike trains almost always discretize time into bins. Here we demonstrate that finite temporal resolution of discrete time models prevents their rescaled ISIs from being exponentially distributed. Poor goodness of fit may be erroneously indicated even if the model is exactly correct. We present two adaptations of the time-rescaling theorem to discrete time models. In the first we propose that instead of assuming the rescaled times to be exponential, the reference distribution be estimated through direct simulation by the fitted model. In the second, we prove a discrete time version of the time-rescaling theorem that analytically corrects for the effects of finite resolution. This allows us to define a rescaled time that is exponentially distributed, even at arbitrary temporal discretizations. We demonstrate the efficacy of both techniques by fitting generalized linear models to both simulated spike trains and spike trains recorded experimentally in monkey V1 cortex. Both techniques give nearly identical results, reducing the false-positive rate of the KS test and greatly increasing the reliability of model evaluation based on the time-rescaling theorem.

Novel symmetries in N=2 supersymmetric quantum mechanical models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Malik, R.P., E-mail: malik@bhu.ac.in; DST-CIMS, Faculty of Science, BHU-Varanasi-221 005; Khare, Avinash, E-mail: khare@iiserpune.ac.in

We demonstrate the existence of a novel set of discrete symmetries in the context of the N=2 supersymmetric (SUSY) quantum mechanical model with a potential function f(x) that is a generalization of the potential of the 1D SUSY harmonic oscillator. We perform the same exercise for the motion of a charged particle in the X–Y plane under the influence of a magnetic field in the Z-direction. We derive the underlying algebra of the existing continuous symmetry transformations (and corresponding conserved charges) and establish its relevance to the algebraic structures of the de Rham cohomological operators of differential geometry. We showmore » that the discrete symmetry transformations of our present general theories correspond to the Hodge duality operation. Ultimately, we conjecture that any arbitrary N=2 SUSY quantum mechanical system can be shown to be a tractable model for the Hodge theory. -- Highlights: •Discrete symmetries of two completely different kinds of N=2 supersymmetric quantum mechanical models have been discussed. •The discrete symmetries provide physical realizations of Hodge duality. •The continuous symmetries provide the physical realizations of de Rham cohomological operators. •Our work sheds a new light on the meaning of the above abstract operators.« less

SPHARA--a generalized spatial Fourier analysis for multi-sensor systems with non-uniformly arranged sensors: application to EEG.

PubMed

Graichen, Uwe; Eichardt, Roland; Fiedler, Patrique; Strohmeier, Daniel; Zanow, Frank; Haueisen, Jens

2015-01-01

Important requirements for the analysis of multichannel EEG data are efficient techniques for signal enhancement, signal decomposition, feature extraction, and dimensionality reduction. We propose a new approach for spatial harmonic analysis (SPHARA) that extends the classical spatial Fourier analysis to EEG sensors positioned non-uniformly on the surface of the head. The proposed method is based on the eigenanalysis of the discrete Laplace-Beltrami operator defined on a triangular mesh. We present several ways to discretize the continuous Laplace-Beltrami operator and compare the properties of the resulting basis functions computed using these discretization methods. We apply SPHARA to somatosensory evoked potential data from eleven volunteers and demonstrate the ability of the method for spatial data decomposition, dimensionality reduction and noise suppression. When employing SPHARA for dimensionality reduction, a significantly more compact representation can be achieved using the FEM approach, compared to the other discretization methods. Using FEM, to recover 95% and 99% of the total energy of the EEG data, on average only 35% and 58% of the coefficients are necessary. The capability of SPHARA for noise suppression is shown using artificial data. We conclude that SPHARA can be used for spatial harmonic analysis of multi-sensor data at arbitrary positions and can be utilized in a variety of other applications.

Dense image registration through MRFs and efficient linear programming.

PubMed

Glocker, Ben; Komodakis, Nikos; Tziritas, Georgios; Navab, Nassir; Paragios, Nikos

2008-12-01

In this paper, we introduce a novel and efficient approach to dense image registration, which does not require a derivative of the employed cost function. In such a context, the registration problem is formulated using a discrete Markov random field objective function. First, towards dimensionality reduction on the variables we assume that the dense deformation field can be expressed using a small number of control points (registration grid) and an interpolation strategy. Then, the registration cost is expressed using a discrete sum over image costs (using an arbitrary similarity measure) projected on the control points, and a smoothness term that penalizes local deviations on the deformation field according to a neighborhood system on the grid. Towards a discrete approach, the search space is quantized resulting in a fully discrete model. In order to account for large deformations and produce results on a high resolution level, a multi-scale incremental approach is considered where the optimal solution is iteratively updated. This is done through successive morphings of the source towards the target image. Efficient linear programming using the primal dual principles is considered to recover the lowest potential of the cost function. Very promising results using synthetic data with known deformations and real data demonstrate the potentials of our approach.

Finite element generation of arbitrary 3-D fracture networks for flow analysis in complicated discrete fracture networks

NASA Astrophysics Data System (ADS)

Zhang, Qi-Hua

2015-10-01

Finite element generation of complicated fracture networks is the core issue and source of technical difficulty in three-dimensional (3-D) discrete fracture network (DFN) flow models. Due to the randomness and uncertainty in the configuration of a DFN, the intersection lines (traces) are arbitrarily distributed in each face (fracture and other surfaces). Hence, subdivision of the fractures is an issue relating to subdivision of two-dimensional (2-D) domains with arbitrarily-distributed constraints. When the DFN configuration is very complicated, the well-known approaches (e.g. Voronoi Delaunay-based methods and advancing-front techniques) cannot operate properly. This paper proposes an algorithm to implement end-to-end connection between traces to subdivide 2-D domains into closed loops. The compositions of the vertices in the common edges between adjacent loops (which may belong to a single fracture or two connected fractures) are thus ensured to be topologically identical. The paper then proposes an approach for triangulating arbitrary loops which does not add any nodes to ensure consistency of the meshes at the common edges. In addition, several techniques relating to tolerance control and improving code robustness are discussed. Finally, the equivalent permeability of the rock mass is calculated for some very complicated DFNs (the DFN may contain 1272 fractures, 633 connected fractures, and 16,270 closed loops). The results are compared with other approaches to demonstrate the veracity and efficiency of the approach proposed in this paper.

Application of discrete Fourier inter-coefficient difference for assessing genetic sequence similarity.

PubMed

King, Brian R; Aburdene, Maurice; Thompson, Alex; Warres, Zach

2014-01-01

Digital signal processing (DSP) techniques for biological sequence analysis continue to grow in popularity due to the inherent digital nature of these sequences. DSP methods have demonstrated early success for detection of coding regions in a gene. Recently, these methods are being used to establish DNA gene similarity. We present the inter-coefficient difference (ICD) transformation, a novel extension of the discrete Fourier transformation, which can be applied to any DNA sequence. The ICD method is a mathematical, alignment-free DNA comparison method that generates a genetic signature for any DNA sequence that is used to generate relative measures of similarity among DNA sequences. We demonstrate our method on a set of insulin genes obtained from an evolutionarily wide range of species, and on a set of avian influenza viral sequences, which represents a set of highly similar sequences. We compare phylogenetic trees generated using our technique against trees generated using traditional alignment techniques for similarity and demonstrate that the ICD method produces a highly accurate tree without requiring an alignment prior to establishing sequence similarity.

Almost periodic solutions to difference equations

NASA Technical Reports Server (NTRS)

Bayliss, A.

1975-01-01

The theory of Massera and Schaeffer relating the existence of unique almost periodic solutions of an inhomogeneous linear equation to an exponential dichotomy for the homogeneous equation was completely extended to discretizations by a strongly stable difference scheme. In addition it is shown that the almost periodic sequence solution will converge to the differential equation solution. The preceding theory was applied to a class of exponentially stable partial differential equations to which one can apply the Hille-Yoshida theorem. It is possible to prove the existence of unique almost periodic solutions of the inhomogeneous equation (which can be approximated by almost periodic sequences) which are the solutions to appropriate discretizations. Two methods of discretizations are discussed: the strongly stable scheme and the Lax-Wendroff scheme.

Self-consistent field theory simulations of polymers on arbitrary domains

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ouaknin, Gaddiel, E-mail: gaddielouaknin@umail.ucsb.edu; Laachi, Nabil; Delaney, Kris

2016-12-15

We introduce a framework for simulating the mesoscale self-assembly of block copolymers in arbitrary confined geometries subject to Neumann boundary conditions. We employ a hybrid finite difference/volume approach to discretize the mean-field equations on an irregular domain represented implicitly by a level-set function. The numerical treatment of the Neumann boundary conditions is sharp, i.e. it avoids an artificial smearing in the irregular domain boundary. This strategy enables the study of self-assembly in confined domains and enables the computation of physically meaningful quantities at the domain interface. In addition, we employ adaptive grids encoded with Quad-/Oc-trees in parallel to automatically refinemore » the grid where the statistical fields vary rapidly as well as at the boundary of the confined domain. This approach results in a significant reduction in the number of degrees of freedom and makes the simulations in arbitrary domains using effective boundary conditions computationally efficient in terms of both speed and memory requirement. Finally, in the case of regular periodic domains, where pseudo-spectral approaches are superior to finite differences in terms of CPU time and accuracy, we use the adaptive strategy to store chain propagators, reducing the memory footprint without loss of accuracy in computed physical observables.« less

The demarcation of arbitrary boundaries for coastal zone management: the Israeli case.

PubMed

Sas, Eliraz; Fischhendler, Itay; Portman, Michelle E

2010-11-01

Integrated coastal zone management (ICZM) addresses the interconnections, complexities, and conflicts between many users of the coastal area with different goals. It requires setting managerial boundaries that capture many elements of human and natural systems. Experience teaches us that without a directed effort managerial rules and laws are not likely to coincide with the physical sensitivity of units that reflect different environmental characteristics of the coastal zone. Hence the aim of this study is to explore why coastal managerial boundaries are set arbitrarily and whether and how it is possible to address the problems this poses. We examine what influences the decisions of a new coastal management authority in Israel to determine how this body overcomes the limits of arbitrary boundary demarcation. The study found that real life management succeeded to both address areas outside the arbitrary boundaries and also to respect some of the different socio-economic needs and physical constraints of the coastal sub-units. Israel's Coastal Environment Protection Law allows and, in fact, encourages the regulator to use discretion and to employ various criteria to balance development and conservation. This implies that policy makers are cognizant of a need to balance ecologically-sensitive boundaries that consider the homogeneity of the coast with politically feasible boundaries that are set arbitrarily. Copyright 2010 Elsevier Ltd. All rights reserved.

Entropic Lattice Boltzmann Simulations of Turbulence

NASA Astrophysics Data System (ADS)

Keating, Brian; Vahala, George; Vahala, Linda; Soe, Min; Yepez, Jeffrey

2006-10-01

Because of its simplicity, nearly perfect parallelization and vectorization on supercomputer platforms, lattice Boltzmann (LB) methods hold great promise for simulations of nonlinear physics. Indeed, our MHD-LB code has the best sustained performance/PE of any code on the Earth Simulator. By projecting into the higher dimensional kinetic phase space, the solution trajectory is simpler and much easier to compute than standard CFD approach. However, simple LB -- with its simple advection and local BGK collisional relaxation -- does not impose positive definiteness of the distribution functions in the time evolution. This leads to numerical instabilities for very low transport coefficients. In Entropic LB (ELB) one determines a discrete H-theorem and the equilibrium distribution functions subject to the collisional invariants. The ELB algorithm is unconditionally stable to arbitrary small transport coefficients. Various choices of velocity discretization are examined: 15, 19 and 27-bit ELB models. The connection between Tsallis and Boltzmann entropies are clarified.

On Stable Wall Boundary Conditions for the Hermite Discretization of the Linearised Boltzmann Equation

NASA Astrophysics Data System (ADS)

Sarna, Neeraj; Torrilhon, Manuel

2018-01-01

We define certain criteria, using the characteristic decomposition of the boundary conditions and energy estimates, which a set of stable boundary conditions for a linear initial boundary value problem, involving a symmetric hyperbolic system, must satisfy. We first use these stability criteria to show the instability of the Maxwell boundary conditions proposed by Grad (Commun Pure Appl Math 2(4):331-407, 1949). We then recognise a special block structure of the moment equations which arises due to the recursion relations and the orthogonality of the Hermite polynomials; the block structure will help us in formulating stable boundary conditions for an arbitrary order Hermite discretization of the Boltzmann equation. The formulation of stable boundary conditions relies upon an Onsager matrix which will be constructed such that the newly proposed boundary conditions stay close to the Maxwell boundary conditions at least in the lower order moments.

Acoustic pressures emanating from a turbomachine stage

NASA Technical Reports Server (NTRS)

Ramachandra, S. M.

1984-01-01

A knowledge of the acoustic energy emission of each blade row of a turbomachine is useful for estimating the overall noise level of the machine and for determining its discrete frequency noise content. Because of the close spacing between the rotor and stator of a compressor stage, the strong aerodynamic interactions between them have to be included in obtaining the resultant flow field. A three dimensional theory for determining the discrete frequency noise content of an axial compressor consisting of a rotor and a stator each with a finite number of blades are outlined. The lifting surface theory and the linearized equation of an ideal, nonsteady compressible fluid motion are used for thin blades of arbitrary cross section. The combined pressure field at a point of the fluid is constructed by linear addition of the rotor and stator solutions together with an interference factor obtained by matching them for net zero vorticity behind the stage.

Control theory based airfoil design for potential flow and a finite volume discretization

NASA Technical Reports Server (NTRS)

Reuther, J.; Jameson, A.

1994-01-01

This paper describes the implementation of optimization techniques based on control theory for airfoil design. In previous studies it was shown that control theory could be used to devise an effective optimization procedure for two-dimensional profiles in which the shape is determined by a conformal transformation from a unit circle, and the control is the mapping function. The goal of our present work is to develop a method which does not depend on conformal mapping, so that it can be extended to treat three-dimensional problems. Therefore, we have developed a method which can address arbitrary geometric shapes through the use of a finite volume method to discretize the potential flow equation. Here the control law serves to provide computationally inexpensive gradient information to a standard numerical optimization method. Results are presented, where both target speed distributions and minimum drag are used as objective functions.

Surface Design Based on Discrete Conformal Transformations

NASA Astrophysics Data System (ADS)

Duque, Carlos; Santangelo, Christian; Vouga, Etienne

Conformal transformations are angle-preserving maps from one domain to another. Although angles are preserved, the lengths between arbitrary points are not generally conserved. As a consequence there is always a given amount of distortion associated to any conformal map. Different uses of such transformations can be found in various fields, but have been used by us to program non-uniformly swellable gel sheets to buckle into prescribed three dimensional shapes. In this work we apply circle packings as a kind of discrete conformal map in order to find conformal maps from the sphere to the plane that can be used as nearly uniform swelling patterns to program non-Euclidean sheets to buckle into spheres. We explore the possibility of tuning the area distortion to fit the experimental range of minimum and maximum swelling by modifying the boundary of the planar domain through the introduction of different cutting schemes.

Parallel Solver for H(div) Problems Using Hybridization and AMG

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Chak S.; Vassilevski, Panayot S.

2016-01-15

In this paper, a scalable parallel solver is proposed for H(div) problems discretized by arbitrary order finite elements on general unstructured meshes. The solver is based on hybridization and algebraic multigrid (AMG). Unlike some previously studied H(div) solvers, the hybridization solver does not require discrete curl and gradient operators as additional input from the user. Instead, only some element information is needed in the construction of the solver. The hybridization results in a H1-equivalent symmetric positive definite system, which is then rescaled and solved by AMG solvers designed for H1 problems. Weak and strong scaling of the method are examinedmore » through several numerical tests. Our numerical results show that the proposed solver provides a promising alternative to ADS, a state-of-the-art solver [12], for H(div) problems. In fact, it outperforms ADS for higher order elements.« less

High-order noise filtering in nontrivial quantum logic gates.

PubMed

Green, Todd; Uys, Hermann; Biercuk, Michael J

2012-07-13

Treating the effects of a time-dependent classical dephasing environment during quantum logic operations poses a theoretical challenge, as the application of noncommuting control operations gives rise to both dephasing and depolarization errors that must be accounted for in order to understand total average error rates. We develop a treatment based on effective Hamiltonian theory that allows us to efficiently model the effect of classical noise on nontrivial single-bit quantum logic operations composed of arbitrary control sequences. We present a general method to calculate the ensemble-averaged entanglement fidelity to arbitrary order in terms of noise filter functions, and provide explicit expressions to fourth order in the noise strength. In the weak noise limit we derive explicit filter functions for a broad class of piecewise-constant control sequences, and use them to study the performance of dynamically corrected gates, yielding good agreement with brute-force numerics.

Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution

NASA Astrophysics Data System (ADS)

Jiao, Yong; Wakakuwa, Eyuri; Ogawa, Tomohiro

2018-02-01

We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily a tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of bipartite pure states.

Towards spinning Mellin amplitudes

NASA Astrophysics Data System (ADS)

Chen, Heng-Yu; Kuo, En-Jui; Kyono, Hideki

2018-06-01

We construct the Mellin representation of four point conformal correlation function with external primary operators with arbitrary integer spacetime spins, and obtain a natural proposal for spinning Mellin amplitudes. By restricting to the exchange of symmetric traceless primaries, we generalize the Mellin transform for scalar case to introduce discrete Mellin variables for incorporating spin degrees of freedom. Based on the structures about spinning three and four point Witten diagrams, we also obtain a generalization of the Mack polynomial which can be regarded as a natural kinematical polynomial basis for computing spinning Mellin amplitudes using different choices of interaction vertices.

Accretional evolution of a planetesimal swarm. I - A new simulation

NASA Technical Reports Server (NTRS)

Spaute, Dominique; Weidenschilling, Stuart J.; Davis, Donald R.; Marzari, Francesco

1991-01-01

This novel simulation of planetary accretion simultaneously treats many interacting heliocentric distance zones and characterizes planetesimals via Keplerian elements. The numerical code employed, in addition to following the size distribution and the orbit-element distribution of a planetesimal swarm from arbitrary size and orbit distributions, treats a small number of the largest bodies as discrete objects with individual orbits. The accretion algorithm used yields good agreement with the analytic solutions; agreement is also obtained with the results of Weatherill and Stewart (1989) for gravitational accretion of planetesimals having equivalent initial conditions.

A System of Poisson Equations for a Nonconstant Varadhan Functional on a Finite State Space

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cavazos-Cadena, Rolando; Hernandez-Hernandez, Daniel

2006-01-15

Given a discrete-time Markov chain with finite state space and a stationary transition matrix, a system of 'local' Poisson equations characterizing the (exponential) Varadhan's functional J(.) is given. The main results, which are derived for an arbitrary transition structure so that J(.) may be nonconstant, are as follows: (i) Any solution to the local Poisson equations immediately renders Varadhan's functional, and (ii) a solution of the system always exist. The proof of this latter result is constructive and suggests a method to solve the local Poisson equations.

A note on the Poisson bracket of 2d smeared fluxes in loop quantum gravity

NASA Astrophysics Data System (ADS)

Cattaneo, Alberto S.; Perez, Alejandro

2017-05-01

We show that the non-Abelian nature of geometric fluxes—the corner-stone in the definition of quantum geometry in the framework of loop quantum gravity (LQG)—follows directly form the continuum canonical commutations relations of gravity in connection variables and the validity of the Gauss law. The present treatment simplifies previous formulations and thus identifies more clearly the root of the discreteness of geometric operators in LQG. Our statement generalizes to arbitrary gauge theories and relies only on the validity of the Gauss law.

GENESUS: a two-step sequence design program for DNA nanostructure self-assembly.

PubMed

Tsutsumi, Takanobu; Asakawa, Takeshi; Kanegami, Akemi; Okada, Takao; Tahira, Tomoko; Hayashi, Kenshi

2014-01-01

DNA has been recognized as an ideal material for bottom-up construction of nanometer scale structures by self-assembly. The generation of sequences optimized for unique self-assembly (GENESUS) program reported here is a straightforward method for generating sets of strand sequences optimized for self-assembly of arbitrarily designed DNA nanostructures by a generate-candidates-and-choose-the-best strategy. A scalable procedure to prepare single-stranded DNA having arbitrary sequences is also presented. Strands for the assembly of various structures were designed and successfully constructed, validating both the program and the procedure.

Advances in Discrete-Event Simulation for MSL Command Validation

NASA Technical Reports Server (NTRS)

Patrikalakis, Alexander; O'Reilly, Taifun

2013-01-01

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

Fitting power-laws in empirical data with estimators that work for all exponents

PubMed Central

Hanel, Rudolf; Corominas-Murtra, Bernat; Liu, Bo; Thurner, Stefan

2017-01-01

Most standard methods based on maximum likelihood (ML) estimates of power-law exponents can only be reliably used to identify exponents smaller than minus one. The argument that power laws are otherwise not normalizable, depends on the underlying sample space the data is drawn from, and is true only for sample spaces that are unbounded from above. Power-laws obtained from bounded sample spaces (as is the case for practically all data related problems) are always free of such limitations and maximum likelihood estimates can be obtained for arbitrary powers without restrictions. Here we first derive the appropriate ML estimator for arbitrary exponents of power-law distributions on bounded discrete sample spaces. We then show that an almost identical estimator also works perfectly for continuous data. We implemented this ML estimator and discuss its performance with previous attempts. We present a general recipe of how to use these estimators and present the associated computer codes. PMID:28245249

TAS: A Transonic Aircraft/Store flow field prediction code

NASA Technical Reports Server (NTRS)

Thompson, D. S.

1983-01-01

A numerical procedure has been developed that has the capability to predict the transonic flow field around an aircraft with an arbitrarily located, separated store. The TAS code, the product of a joint General Dynamics/NASA ARC/AFWAL research and development program, will serve as the basis for a comprehensive predictive method for aircraft with arbitrary store loadings. This report described the numerical procedures employed to simulate the flow field around a configuration of this type. The validity of TAS code predictions is established by comparison with existing experimental data. In addition, future areas of development of the code are outlined. A brief description of code utilization is also given in the Appendix. The aircraft/store configuration is simulated using a mesh embedding approach. The computational domain is discretized by three meshes: (1) a planform-oriented wing/body fine mesh, (2) a cylindrical store mesh, and (3) a global Cartesian crude mesh. This embedded mesh scheme enables simulation of stores with fins of arbitrary angular orientation.

Exact combinatorial approach to finite coagulating systems

NASA Astrophysics Data System (ADS)

Fronczak, Agata; Chmiel, Anna; Fronczak, Piotr

2018-02-01

This paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, an exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the average number of such clusters, and that average's standard deviation. The correctness of our general expressions is proved based on the (analytical and numerical) results obtained for systems with the constant kernel. In addition, the results obtained are compared with the results arising from the solutions to the mean-field Smoluchowski coagulation equation, indicating its weak points. The paper closes with a brief discussion on the extensibility to other systems of the approach presented herein, emphasizing the issue of arbitrary initial conditions.

Decoding brain activity using a large-scale probabilistic functional-anatomical atlas of human cognition

PubMed Central

Jones, Michael N.

2017-01-01

A central goal of cognitive neuroscience is to decode human brain activity—that is, to infer mental processes from observed patterns of whole-brain activation. Previous decoding efforts have focused on classifying brain activity into a small set of discrete cognitive states. To attain maximal utility, a decoding framework must be open-ended, systematic, and context-sensitive—that is, capable of interpreting numerous brain states, presented in arbitrary combinations, in light of prior information. Here we take steps towards this objective by introducing a probabilistic decoding framework based on a novel topic model—Generalized Correspondence Latent Dirichlet Allocation—that learns latent topics from a database of over 11,000 published fMRI studies. The model produces highly interpretable, spatially-circumscribed topics that enable flexible decoding of whole-brain images. Importantly, the Bayesian nature of the model allows one to “seed” decoder priors with arbitrary images and text—enabling researchers, for the first time, to generate quantitative, context-sensitive interpretations of whole-brain patterns of brain activity. PMID:29059185

Quantum Optical Realization of Arbitrary Linear Transformations Allowing for Loss and Gain

NASA Astrophysics Data System (ADS)

Tischler, N.; Rockstuhl, C.; Słowik, K.

2018-04-01

Unitary transformations are routinely modeled and implemented in the field of quantum optics. In contrast, nonunitary transformations, which can involve loss and gain, require a different approach. In this work, we present a universal method to deal with nonunitary networks. An input to the method is an arbitrary linear transformation matrix of optical modes that does not need to adhere to bosonic commutation relations. The method constructs a transformation that includes the network of interest and accounts for full quantum optical effects related to loss and gain. Furthermore, through a decomposition in terms of simple building blocks, it provides a step-by-step implementation recipe, in a manner similar to the decomposition by Reck et al. [Experimental Realization of Any Discrete Unitary Operator, Phys. Rev. Lett. 73, 58 (1994), 10.1103/PhysRevLett.73.58] but applicable to nonunitary transformations. Applications of the method include the implementation of positive-operator-valued measures and the design of probabilistic optical quantum information protocols.

Non-autonomous equations with unpredictable solutions

NASA Astrophysics Data System (ADS)

Akhmet, Marat; Fen, Mehmet Onur

2018-06-01

To make research of chaos more amenable to investigating differential and discrete equations, we introduce the concepts of an unpredictable function and sequence. The topology of uniform convergence on compact sets is applied to define unpredictable functions [1,2]. The unpredictable sequence is defined as a specific unpredictable function on the set of integers. The definitions are convenient to be verified as solutions of differential and discrete equations. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and uniqueness of the unpredictable solution for a delay differential equation are proved as well as for quasilinear discrete systems. As a corollary of the theorem, a similar assertion for a quasilinear ordinary differential equation is formulated. The results are demonstrated numerically, and an application to Hopfield neural networks is provided. In particular, Poincaré chaos near periodic orbits is observed. The completed research contributes to the theory of chaos as well as to the theory of differential and discrete equations, considering unpredictable solutions.

3D unstructured-mesh radiation transport codes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Morel, J.

1997-12-31

Three unstructured-mesh radiation transport codes are currently being developed at Los Alamos National Laboratory. The first code is ATTILA, which uses an unstructured tetrahedral mesh in conjunction with standard Sn (discrete-ordinates) angular discretization, standard multigroup energy discretization, and linear-discontinuous spatial differencing. ATTILA solves the standard first-order form of the transport equation using source iteration in conjunction with diffusion-synthetic acceleration of the within-group source iterations. DANTE is designed to run primarily on workstations. The second code is DANTE, which uses a hybrid finite-element mesh consisting of arbitrary combinations of hexahedra, wedges, pyramids, and tetrahedra. DANTE solves several second-order self-adjoint forms of the transport equation including the even-parity equation, the odd-parity equation, and a new equation called the self-adjoint angular flux equation. DANTE also offers three angular discretization options:more » $$S{_}n$$ (discrete-ordinates), $$P{_}n$$ (spherical harmonics), and $$SP{_}n$$ (simplified spherical harmonics). DANTE is designed to run primarily on massively parallel message-passing machines, such as the ASCI-Blue machines at LANL and LLNL. The third code is PERICLES, which uses the same hybrid finite-element mesh as DANTE, but solves the standard first-order form of the transport equation rather than a second-order self-adjoint form. DANTE uses a standard $$S{_}n$$ discretization in angle in conjunction with trilinear-discontinuous spatial differencing, and diffusion-synthetic acceleration of the within-group source iterations. PERICLES was initially designed to run on workstations, but a version for massively parallel message-passing machines will be built. The three codes will be described in detail and computational results will be presented.« less

Discrete Deterministic and Stochastic Petri Nets

NASA Technical Reports Server (NTRS)

Zijal, Robert; Ciardo, Gianfranco

1996-01-01

Petri nets augmented with timing specifications gained a wide acceptance in the area of performance and reliability evaluation of complex systems exhibiting concurrency, synchronization, and conflicts. The state space of time-extended Petri nets is mapped onto its basic underlying stochastic process, which can be shown to be Markovian under the assumption of exponentially distributed firing times. The integration of exponentially and non-exponentially distributed timing is still one of the major problems for the analysis and was first attacked for continuous time Petri nets at the cost of structural or analytical restrictions. We propose a discrete deterministic and stochastic Petri net (DDSPN) formalism with no imposed structural or analytical restrictions where transitions can fire either in zero time or according to arbitrary firing times that can be represented as the time to absorption in a finite absorbing discrete time Markov chain (DTMC). Exponentially distributed firing times are then approximated arbitrarily well by geometric distributions. Deterministic firing times are a special case of the geometric distribution. The underlying stochastic process of a DDSPN is then also a DTMC, from which the transient and stationary solution can be obtained by standard techniques. A comprehensive algorithm and some state space reduction techniques for the analysis of DDSPNs are presented comprising the automatic detection of conflicts and confusions, which removes a major obstacle for the analysis of discrete time models.

SPHARA - A Generalized Spatial Fourier Analysis for Multi-Sensor Systems with Non-Uniformly Arranged Sensors: Application to EEG

PubMed Central

Graichen, Uwe; Eichardt, Roland; Fiedler, Patrique; Strohmeier, Daniel; Zanow, Frank; Haueisen, Jens

2015-01-01

Important requirements for the analysis of multichannel EEG data are efficient techniques for signal enhancement, signal decomposition, feature extraction, and dimensionality reduction. We propose a new approach for spatial harmonic analysis (SPHARA) that extends the classical spatial Fourier analysis to EEG sensors positioned non-uniformly on the surface of the head. The proposed method is based on the eigenanalysis of the discrete Laplace-Beltrami operator defined on a triangular mesh. We present several ways to discretize the continuous Laplace-Beltrami operator and compare the properties of the resulting basis functions computed using these discretization methods. We apply SPHARA to somatosensory evoked potential data from eleven volunteers and demonstrate the ability of the method for spatial data decomposition, dimensionality reduction and noise suppression. When employing SPHARA for dimensionality reduction, a significantly more compact representation can be achieved using the FEM approach, compared to the other discretization methods. Using FEM, to recover 95% and 99% of the total energy of the EEG data, on average only 35% and 58% of the coefficients are necessary. The capability of SPHARA for noise suppression is shown using artificial data. We conclude that SPHARA can be used for spatial harmonic analysis of multi-sensor data at arbitrary positions and can be utilized in a variety of other applications. PMID:25885290

Discrete False-Discovery Rate Improves Identification of Differentially Abundant Microbes.

PubMed

Jiang, Lingjing; Amir, Amnon; Morton, James T; Heller, Ruth; Arias-Castro, Ery; Knight, Rob

2017-01-01

Differential abundance testing is a critical task in microbiome studies that is complicated by the sparsity of data matrices. Here we adapt for microbiome studies a solution from the field of gene expression analysis to produce a new method, discrete false-discovery rate (DS-FDR), that greatly improves the power to detect differential taxa by exploiting the discreteness of the data. Additionally, DS-FDR is relatively robust to the number of noninformative features, and thus removes the problem of filtering taxonomy tables by an arbitrary abundance threshold. We show by using a combination of simulations and reanalysis of nine real-world microbiome data sets that this new method outperforms existing methods at the differential abundance testing task, producing a false-discovery rate that is up to threefold more accurate, and halves the number of samples required to find a given difference (thus increasing the efficiency of microbiome experiments considerably). We therefore expect DS-FDR to be widely applied in microbiome studies. IMPORTANCE DS-FDR can achieve higher statistical power to detect significant findings in sparse and noisy microbiome data compared to the commonly used Benjamini-Hochberg procedure and other FDR-controlling procedures.

Flux-corrected transport algorithms for continuous Galerkin methods based on high order Bernstein finite elements

NASA Astrophysics Data System (ADS)

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

2017-09-01

This work extends the flux-corrected transport (FCT) methodology to arbitrary order continuous finite element discretizations of scalar conservation laws on simplex meshes. Using Bernstein polynomials as local basis functions, we constrain the total variation of the numerical solution by imposing local discrete maximum principles on the Bézier net. The design of accuracy-preserving FCT schemes for high order Bernstein-Bézier finite elements requires the development of new algorithms and/or generalization of limiting techniques tailored for linear and multilinear Lagrange elements. In this paper, we propose (i) a new discrete upwinding strategy leading to local extremum bounded low order approximations with compact stencils, (ii) high order variational stabilization based on the difference between two gradient approximations, and (iii) new localized limiting techniques for antidiffusive element contributions. The optional use of a smoothness indicator, based on a second derivative test, makes it possible to potentially avoid unnecessary limiting at smooth extrema and achieve optimal convergence rates for problems with smooth solutions. The accuracy of the proposed schemes is assessed in numerical studies for the linear transport equation in 1D and 2D.

The nature of plant species

PubMed Central

Rieseberg, Loren H.; Wood, Troy E.; Baack, Eric J.

2008-01-01

Many botanists doubt the existence of plant species1–5, viewing them as arbitrary constructs of the human mind, as opposed to discrete, objective entities that represent reproductively independent lineages or ‘units of evolution’. However, the discreteness of plant species and their correspondence with reproductive communities have not been tested quantitatively, allowing zoologists to argue that botanists have been overly influenced by a few ‘botanical horror stories’, such as dandelions, blackberries and oaks6,7. Here we analyse phenetic and/or crossing relationships in over 400 genera of plants and animals. We show that although discrete phenotypic clusters exist in most genera (>80%), the correspondence of taxonomic species to these clusters is poor (<60%) and no different between plants and animals. Lack of congruence is caused by polyploidy, asexual reproduction and over-differentiation by taxonomists, but not by contemporary hybridization. Nonetheless, crossability data indicate that 70% of taxonomic species and 75% of phenotypic clusters in plants correspond to reproductively independent lineages (as measured by postmating isolation), and thus represent biologically real entities. Contrary to conventional wisdom8, plant species are more likely than animal species to represent reproductively independent lineages. PMID:16554818

A high-order staggered finite-element vertical discretization for non-hydrostatic atmospheric models

DOE PAGES

Guerra, Jorge E.; Ullrich, Paul A.

2016-06-01

Atmospheric modeling systems require economical methods to solve the non-hydrostatic Euler equations. Two major differences between hydrostatic models and a full non-hydrostatic description lies in the vertical velocity tendency and numerical stiffness associated with sound waves. In this work we introduce a new arbitrary-order vertical discretization entitled the staggered nodal finite-element method (SNFEM). Our method uses a generalized discrete derivative that consistently combines the discontinuous Galerkin and spectral element methods on a staggered grid. Our combined method leverages the accurate wave propagation and conservation properties of spectral elements with staggered methods that eliminate stationary (2Δ x) modes. Furthermore, high-order accuracymore » also eliminates the need for a reference state to maintain hydrostatic balance. In this work we demonstrate the use of high vertical order as a means of improving simulation quality at relatively coarse resolution. We choose a test case suite that spans the range of atmospheric flows from predominantly hydrostatic to nonlinear in the large-eddy regime. Lastly, our results show that there is a distinct benefit in using the high-order vertical coordinate at low resolutions with the same robust properties as the low-order alternative.« less

A high-order staggered finite-element vertical discretization for non-hydrostatic atmospheric models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Guerra, Jorge E.; Ullrich, Paul A.

Atmospheric modeling systems require economical methods to solve the non-hydrostatic Euler equations. Two major differences between hydrostatic models and a full non-hydrostatic description lies in the vertical velocity tendency and numerical stiffness associated with sound waves. In this work we introduce a new arbitrary-order vertical discretization entitled the staggered nodal finite-element method (SNFEM). Our method uses a generalized discrete derivative that consistently combines the discontinuous Galerkin and spectral element methods on a staggered grid. Our combined method leverages the accurate wave propagation and conservation properties of spectral elements with staggered methods that eliminate stationary (2Δ x) modes. Furthermore, high-order accuracymore » also eliminates the need for a reference state to maintain hydrostatic balance. In this work we demonstrate the use of high vertical order as a means of improving simulation quality at relatively coarse resolution. We choose a test case suite that spans the range of atmospheric flows from predominantly hydrostatic to nonlinear in the large-eddy regime. Lastly, our results show that there is a distinct benefit in using the high-order vertical coordinate at low resolutions with the same robust properties as the low-order alternative.« less

A well-balanced finite volume scheme for the Euler equations with gravitation. The exact preservation of hydrostatic equilibrium with arbitrary entropy stratification

NASA Astrophysics Data System (ADS)

Käppeli, R.; Mishra, S.

2016-03-01

Context. Many problems in astrophysics feature flows which are close to hydrostatic equilibrium. However, standard numerical schemes for compressible hydrodynamics may be deficient in approximating this stationary state, where the pressure gradient is nearly balanced by gravitational forces. Aims: We aim to develop a second-order well-balanced scheme for the Euler equations. The scheme is designed to mimic a discrete version of the hydrostatic balance. It therefore can resolve a discrete hydrostatic equilibrium exactly (up to machine precision) and propagate perturbations, on top of this equilibrium, very accurately. Methods: A local second-order hydrostatic equilibrium preserving pressure reconstruction is developed. Combined with a standard central gravitational source term discretization and numerical fluxes that resolve stationary contact discontinuities exactly, the well-balanced property is achieved. Results: The resulting well-balanced scheme is robust and simple enough to be very easily implemented within any existing computer code that solves time explicitly or implicitly the compressible hydrodynamics equations. We demonstrate the performance of the well-balanced scheme for several astrophysically relevant applications: wave propagation in stellar atmospheres, a toy model for core-collapse supernovae, convection in carbon shell burning, and a realistic proto-neutron star.

Design, Synthesis, and Self-Assembly of Polymers with Tailored Graft Distributions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chang, Alice B.; Lin, Tzu-Pin; Thompson, Niklas B.

Grafting density and graft distribution impact the chain dimensions and physical properties of polymers. However, achieving precise control over these structural parameters presents long-standing synthetic challenges. In this report, we introduce a versatile strategy to synthesize polymers with tailored architectures via grafting-through ring-opening metathesis polymerization (ROMP). One-pot copolymerization of an ω-norbornenyl macromonomer and a discrete norbornenyl co-monomer (diluent) provides opportunities to control the backbone sequence and therefore the side chain distribution. Toward sequence control, the homopolymerization kinetics of 23 diluents were studied, representing diverse variations in the stereochemistry, anchor groups, and substituents. These modifications tuned the homopolymerization rate constants overmore » two orders of magnitude (0.36 M -1 s -1 < k homo < 82 M -1 s -1). Rate trends were identified and elucidated by complementary mechanistic and density functional theory (DFT) studies. Building on this foundation, complex architectures were achieved through copolymerizations of selected diluents with a poly (D,L-lactide) (PLA), polydimethylsiloxane (PDMS), or polystyrene (PS) macromonomer. The cross-propagation rate constants were obtained by non-linear least squares fitting of the instantaneous co-monomer concentrations according to the Mayo-Lewis terminal model. Indepth kinetic analyses indicate a wide range of accessible macromonomer/diluent reactivity ratios (0.08 < r 1/r 2 < 20), corresponding to blocky, gradient, or random backbone sequences. We further demonstrated the versatility of this copolymerization approach by synthesizing AB graft diblock polymers with tapered, uniform, and inverse-tapered molecular “shapes.” Small-angle X-ray scattering analysis of the self-assembled structures illustrates effects of the graft distribution on the domain spacing and backbone conformation. Collectively, the insights provided herein into the ROMP mechanism, monomer design, and homo- and copolymerization rate trends offer a general strategy for the design and synthesis of graft polymers with arbitrary architectures. Controlled copolymerization therefore expands the parameter space for molecular and materials design.« less

Design, Synthesis, and Self-Assembly of Polymers with Tailored Graft Distributions.

PubMed

Chang, Alice B; Lin, Tzu-Pin; Thompson, Niklas B; Luo, Shao-Xiong; Liberman-Martin, Allegra L; Chen, Hsiang-Yun; Lee, Byeongdu; Grubbs, Robert H

2017-12-06

Grafting density and graft distribution impact the chain dimensions and physical properties of polymers. However, achieving precise control over these structural parameters presents long-standing synthetic challenges. In this report, we introduce a versatile strategy to synthesize polymers with tailored architectures via grafting-through ring-opening metathesis polymerization (ROMP). One-pot copolymerization of an ω-norbornenyl macromonomer and a discrete norbornenyl comonomer (diluent) provides opportunities to control the backbone sequence and therefore the side chain distribution. Toward sequence control, the homopolymerization kinetics of 23 diluents were studied, representing diverse variations in the stereochemistry, anchor groups, and substituents. These modifications tuned the homopolymerization rate constants over 2 orders of magnitude (0.36 M -1 s -1 < k homo < 82 M -1 s -1 ). Rate trends were identified and elucidated by complementary mechanistic and density functional theory (DFT) studies. Building on this foundation, complex architectures were achieved through copolymerizations of selected diluents with a poly(d,l-lactide) (PLA), polydimethylsiloxane (PDMS), or polystyrene (PS) macromonomer. The cross-propagation rate constants were obtained by nonlinear least-squares fitting of the instantaneous comonomer concentrations according to the Mayo-Lewis terminal model. In-depth kinetic analyses indicate a wide range of accessible macromonomer/diluent reactivity ratios (0.08 < r 1 /r 2 < 20), corresponding to blocky, gradient, or random backbone sequences. We further demonstrated the versatility of this copolymerization approach by synthesizing AB graft diblock polymers with tapered, uniform, and inverse-tapered molecular "shapes." Small-angle X-ray scattering analysis of the self-assembled structures illustrates effects of the graft distribution on the domain spacing and backbone conformation. Collectively, the insights provided herein into the ROMP mechanism, monomer design, and homo- and copolymerization rate trends offer a general strategy for the design and synthesis of graft polymers with arbitrary architectures. Controlled copolymerization therefore expands the parameter space for molecular and materials design.

Simultaneous optical flow and source estimation: Space–time discretization and preconditioning

PubMed Central

Andreev, R.; Scherzer, O.; Zulehner, W.

2015-01-01

We consider the simultaneous estimation of an optical flow field and an illumination source term in a movie sequence. The particular optical flow equation is obtained by assuming that the image intensity is a conserved quantity up to possible sources and sinks which represent varying illumination. We formulate this problem as an energy minimization problem and propose a space–time simultaneous discretization for the optimality system in saddle-point form. We investigate a preconditioning strategy that renders the discrete system well-conditioned uniformly in the discretization resolution. Numerical experiments complement the theory. PMID:26435561

Next-generation digital information storage in DNA.

PubMed

Church, George M; Gao, Yuan; Kosuri, Sriram

2012-09-28

Digital information is accumulating at an astounding rate, straining our ability to store and archive it. DNA is among the most dense and stable information media known. The development of new technologies in both DNA synthesis and sequencing make DNA an increasingly feasible digital storage medium. We developed a strategy to encode arbitrary digital information in DNA, wrote a 5.27-megabit book using DNA microchips, and read the book by using next-generation DNA sequencing.

Sequence invariant state machines

NASA Technical Reports Server (NTRS)

Whitaker, S.; Manjunath, S.

1990-01-01

A synthesis method and new VLSI architecture are introduced to realize sequential circuits that have the ability to implement any state machine having N states and m inputs, regardless of the actual sequence specified in the flow table. A design method is proposed that utilizes BTS logic to implement regular and dense circuits. A given state sequence can be programmed with power supply connections or dynamically reallocated if stored in a register. Arbitrary flow table sequences can be modified or programmed to dynamically alter the function of the machine. This allows VLSI controllers to be designed with the programmability of a general purpose processor but with the compact size and performance of dedicated logic.

Arbitrarily accurate twin composite π -pulse sequences

NASA Astrophysics Data System (ADS)

Torosov, Boyan T.; Vitanov, Nikolay V.

2018-04-01

We present three classes of symmetric broadband composite pulse sequences. The composite phases are given by analytic formulas (rational fractions of π ) valid for any number of constituent pulses. The transition probability is expressed by simple analytic formulas and the order of pulse area error compensation grows linearly with the number of pulses. Therefore, any desired compensation order can be produced by an appropriate composite sequence; in this sense, they are arbitrarily accurate. These composite pulses perform equally well as or better than previously published ones. Moreover, the current sequences are more flexible as they allow total pulse areas of arbitrary integer multiples of π .

DNA sequence analysis with droplet-based microfluidics

PubMed Central

Abate, Adam R.; Hung, Tony; Sperling, Ralph A.; Mary, Pascaline; Rotem, Assaf; Agresti, Jeremy J.; Weiner, Michael A.; Weitz, David A.

2014-01-01

Droplet-based microfluidic techniques can form and process micrometer scale droplets at thousands per second. Each droplet can house an individual biochemical reaction, allowing millions of reactions to be performed in minutes with small amounts of total reagent. This versatile approach has been used for engineering enzymes, quantifying concentrations of DNA in solution, and screening protein crystallization conditions. Here, we use it to read the sequences of DNA molecules with a FRET-based assay. Using probes of different sequences, we interrogate a target DNA molecule for polymorphisms. With a larger probe set, additional polymorphisms can be interrogated as well as targets of arbitrary sequence. PMID:24185402

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

ERIC Educational Resources Information Center

Shi, Yixun

2009-01-01

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

A Combinatorial Approach to Detecting Gene-Gene and Gene-Environment Interactions in Family Studies

PubMed Central

Lou, Xiang-Yang; Chen, Guo-Bo; Yan, Lei; Ma, Jennie Z.; Mangold, Jamie E.; Zhu, Jun; Elston, Robert C.; Li, Ming D.

2008-01-01

Widespread multifactor interactions present a significant challenge in determining risk factors of complex diseases. Several combinatorial approaches, such as the multifactor dimensionality reduction (MDR) method, have emerged as a promising tool for better detecting gene-gene (G × G) and gene-environment (G × E) interactions. We recently developed a general combinatorial approach, namely the generalized multifactor dimensionality reduction (GMDR) method, which can entertain both qualitative and quantitative phenotypes and allows for both discrete and continuous covariates to detect G × G and G × E interactions in a sample of unrelated individuals. In this article, we report the development of an algorithm that can be used to study G × G and G × E interactions for family-based designs, called pedigree-based GMDR (PGMDR). Compared to the available method, our proposed method has several major improvements, including allowing for covariate adjustments and being applicable to arbitrary phenotypes, arbitrary pedigree structures, and arbitrary patterns of missing marker genotypes. Our Monte Carlo simulations provide evidence that the PGMDR method is superior in performance to identify epistatic loci compared to the MDR-pedigree disequilibrium test (PDT). Finally, we applied our proposed approach to a genetic data set on tobacco dependence and found a significant interaction between two taste receptor genes (i.e., TAS2R16 and TAS2R38) in affecting nicotine dependence. PMID:18834969

Discrete Cosine Transform Image Coding With Sliding Block Codes

NASA Astrophysics Data System (ADS)

Divakaran, Ajay; Pearlman, William A.

1989-11-01

A transform trellis coding scheme for images is presented. A two dimensional discrete cosine transform is applied to the image followed by a search on a trellis structured code. This code is a sliding block code that utilizes a constrained size reproduction alphabet. The image is divided into blocks by the transform coding. The non-stationarity of the image is counteracted by grouping these blocks in clusters through a clustering algorithm, and then encoding the clusters separately. Mandela ordered sequences are formed from each cluster i.e identically indexed coefficients from each block are grouped together to form one dimensional sequences. A separate search ensues on each of these Mandela ordered sequences. Padding sequences are used to improve the trellis search fidelity. The padding sequences absorb the error caused by the building up of the trellis to full size. The simulations were carried out on a 256x256 image ('LENA'). The results are comparable to any existing scheme. The visual quality of the image is enhanced considerably by the padding and clustering.

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

PubMed

Park, Jin-Hoon; Stelmach, George E

2009-11-01

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

On the Delta Sequence of the Thue-Morse Sequence

DTIC Science & Technology

2007-02-27

S. Plouffe, B.E. Sagan, A relative of the Thue-Morse sequence, in For- mal power series and algebraic combinatorics (Montreal, PQ, 1992), Discrete ... Math . 139, 455–461, 1995. [2] J.-P. Allouche, J. Shallit, The ubiquitous Prouhet-Thue-Morse se- quence, In C. Ding, T. Helleseth,and H. Niederreiter

Using cellular automata to generate image representation for biological sequences.

PubMed

Xiao, X; Shao, S; Ding, Y; Huang, Z; Chen, X; Chou, K-C

2005-02-01

A novel approach to visualize biological sequences is developed based on cellular automata (Wolfram, S. Nature 1984, 311, 419-424), a set of discrete dynamical systems in which space and time are discrete. By transforming the symbolic sequence codes into the digital codes, and using some optimal space-time evolvement rules of cellular automata, a biological sequence can be represented by a unique image, the so-called cellular automata image. Many important features, which are originally hidden in a long and complicated biological sequence, can be clearly revealed thru its cellular automata image. With biological sequences entering into databanks rapidly increasing in the post-genomic era, it is anticipated that the cellular automata image will become a very useful vehicle for investigation into their key features, identification of their function, as well as revelation of their "fingerprint". It is anticipated that by using the concept of the pseudo amino acid composition (Chou, K.C. Proteins: Structure, Function, and Genetics, 2001, 43, 246-255), the cellular automata image approach can also be used to improve the quality of predicting protein attributes, such as structural class and subcellular location.

Modeling electrokinetic flows by consistent implicit incompressible smoothed particle hydrodynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pan, Wenxiao; Kim, Kyungjoo; Perego, Mauro

2017-04-01

We present an efficient implicit incompressible smoothed particle hydrodynamics (I2SPH) discretization of Navier-Stokes, Poisson-Boltzmann, and advection-diffusion equations subject to Dirichlet or Robin boundary conditions. It is applied to model various two and three dimensional electrokinetic flows in simple or complex geometries. The I2SPH's accuracy and convergence are examined via comparison with analytical solutions, grid-based numerical solutions, or empirical models. The new method provides a framework to explore broader applications of SPH in microfluidics and complex fluids with charged objects, such as colloids and biomolecules, in arbitrary complex geometries.

Second-order Cosmological Perturbations Engendered by Point-like Masses

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brilenkov, Ruslan; Eingorn, Maxim, E-mail: ruslan.brilenkov@gmail.com, E-mail: maxim.eingorn@gmail.com

2017-08-20

In the ΛCDM framework, presenting nonrelativistic matter inhomogeneities as discrete massive particles, we develop the second‐order cosmological perturbation theory. Our approach relies on the weak gravitational field limit. The derived equations for the second‐order scalar, vector, and tensor metric corrections are suitable at arbitrary distances, including regions with nonlinear contrasts of the matter density. We thoroughly verify fulfillment of all Einstein equations, as well as self‐consistency of order assignments. In addition, we achieve logical positive results in the Minkowski background limit. Feasible investigations of the cosmological back-reaction manifestations by means of relativistic simulations are also outlined.

v-representability and density functional theory. [for nonrelativistic electrons in nondegenerate ground state

NASA Technical Reports Server (NTRS)

Kohn, W.

1983-01-01

It is shown that if n(r) is the discrete density on a lattice (enclosed in a finite box) associated with a nondegenerate ground state in an external potential v(r) (i.e., is 'v-representable'), then the density n(r) + mu(r), with m(r) arbitrary (apart from trivial constraints) and mu small enough, is also associated with a nondegenerate ground state in an external potential v'(r) near v(r); i.e., n(r) + m(r) is also v-representable. Implications for the Hohenberg-Kohn variational principle and the Kohn-Sham equations are discussed.

BRYNTRN: A baryon transport model

NASA Technical Reports Server (NTRS)

Wilson, John W.; Townsend, Lawrence W.; Nealy, John E.; Chun, Sang Y.; Hong, B. S.; Buck, Warren W.; Lamkin, S. L.; Ganapol, Barry D.; Khan, Ferdous; Cucinotta, Francis A.

1989-01-01

The development of an interaction data base and a numerical solution to the transport of baryons through an arbitrary shield material based on a straight ahead approximation of the Boltzmann equation are described. The code is most accurate for continuous energy boundary values, but gives reasonable results for discrete spectra at the boundary using even a relatively coarse energy grid (30 points) and large spatial increments (1 cm in H2O). The resulting computer code is self-contained, efficient and ready to use. The code requires only a very small fraction of the computer resources required for Monte Carlo codes.

Development of a time-dependent incompressible Navier-Stokes solver based on a fractional-step method

NASA Technical Reports Server (NTRS)

Rosenfeld, Moshe

1990-01-01

The development, validation and application of a fractional step solution method of the time-dependent incompressible Navier-Stokes equations in generalized coordinate systems are discussed. A solution method that combines a finite-volume discretization with a novel choice of the dependent variables and a fractional step splitting to obtain accurate solutions in arbitrary geometries was previously developed for fixed-grids. In the present research effort, this solution method is extended to include more general situations, including cases with moving grids. The numerical techniques are enhanced to gain efficiency and generality.

Method and Apparatus for Evaluating the Visual Quality of Processed Digital Video Sequences

NASA Technical Reports Server (NTRS)

Watson, Andrew B. (Inventor)

2002-01-01

A Digital Video Quality (DVQ) apparatus and method that incorporate a model of human visual sensitivity to predict the visibility of artifacts. The DVQ method and apparatus are used for the evaluation of the visual quality of processed digital video sequences and for adaptively controlling the bit rate of the processed digital video sequences without compromising the visual quality. The DVQ apparatus minimizes the required amount of memory and computation. The input to the DVQ apparatus is a pair of color image sequences: an original (R) non-compressed sequence, and a processed (T) sequence. Both sequences (R) and (T) are sampled, cropped, and subjected to color transformations. The sequences are then subjected to blocking and discrete cosine transformation, and the results are transformed to local contrast. The next step is a time filtering operation which implements the human sensitivity to different time frequencies. The results are converted to threshold units by dividing each discrete cosine transform coefficient by its respective visual threshold. At the next stage the two sequences are subtracted to produce an error sequence. The error sequence is subjected to a contrast masking operation, which also depends upon the reference sequence (R). The masked errors can be pooled in various ways to illustrate the perceptual error over various dimensions, and the pooled error can be converted to a visual quality measure.

Design and Implementation of Parallel Algorithms

DTIC Science & Technology

1992-05-01

Alon, N., Y. Azar, and Y. Ravid [1990]. "Universal sequences for complete graphs," SIAM J. Discrete Math 27. Alon, N., A. Bar-Noy, N. Linial, and D...SIAM J. Discrete Math .’ Klein, P., S. A. Plotkin, C. Stein, and E. Tardos [19911. "Faster approximation algorithms for the unit capacity concurrent

Optimal digital dynamical decoupling for general decoherence via Walsh modulation

NASA Astrophysics Data System (ADS)

Qi, Haoyu; Dowling, Jonathan P.; Viola, Lorenza

2017-11-01

We provide a general framework for constructing digital dynamical decoupling sequences based on Walsh modulation—applicable to arbitrary qubit decoherence scenarios. By establishing equivalence between decoupling design based on Walsh functions and on concatenated projections, we identify a family of optimal Walsh sequences, which can be exponentially more efficient, in terms of the required total pulse number, for fixed cancellation order, than known digital sequences based on concatenated design. Optimal sequences for a given cancellation order are highly non-unique—their performance depending sensitively on the control path. We provide an analytic upper bound to the achievable decoupling error and show how sequences within the optimal Walsh family can substantially outperform concatenated decoupling in principle, while respecting realistic timing constraints.

Solutions to an advanced functional partial differential equation of the pantograph type

PubMed Central

Zaidi, Ali A.; Van Brunt, B.; Wake, G. C.

2015-01-01

A model for cells structured by size undergoing growth and division leads to an initial boundary value problem that involves a first-order linear partial differential equation with a functional term. Here, size can be interpreted as DNA content or mass. It has been observed experimentally and shown analytically that solutions for arbitrary initial cell distributions are asymptotic as time goes to infinity to a certain solution called the steady size distribution. The full solution to the problem for arbitrary initial distributions, however, is elusive owing to the presence of the functional term and the paucity of solution techniques for such problems. In this paper, we derive a solution to the problem for arbitrary initial cell distributions. The method employed exploits the hyperbolic character of the underlying differential operator, and the advanced nature of the functional argument to reduce the problem to a sequence of simple Cauchy problems. The existence of solutions for arbitrary initial distributions is established along with uniqueness. The asymptotic relationship with the steady size distribution is established, and because the solution is known explicitly, higher-order terms in the asymptotics can be readily obtained. PMID:26345391

Solutions to an advanced functional partial differential equation of the pantograph type.

PubMed

Zaidi, Ali A; Van Brunt, B; Wake, G C

2015-07-08

A model for cells structured by size undergoing growth and division leads to an initial boundary value problem that involves a first-order linear partial differential equation with a functional term. Here, size can be interpreted as DNA content or mass. It has been observed experimentally and shown analytically that solutions for arbitrary initial cell distributions are asymptotic as time goes to infinity to a certain solution called the steady size distribution. The full solution to the problem for arbitrary initial distributions, however, is elusive owing to the presence of the functional term and the paucity of solution techniques for such problems. In this paper, we derive a solution to the problem for arbitrary initial cell distributions. The method employed exploits the hyperbolic character of the underlying differential operator, and the advanced nature of the functional argument to reduce the problem to a sequence of simple Cauchy problems. The existence of solutions for arbitrary initial distributions is established along with uniqueness. The asymptotic relationship with the steady size distribution is established, and because the solution is known explicitly, higher-order terms in the asymptotics can be readily obtained.

Direct method for measuring and witnessing quantum entanglement of arbitrary two-qubit states through Hong-Ou-Mandel interference

NASA Astrophysics Data System (ADS)

Bartkiewicz, Karol; Chimczak, Grzegorz; Lemr, Karel

2017-02-01

We describe a direct method for experimental determination of the negativity of an arbitrary two-qubit state with 11 measurements performed on multiple copies of the two-qubit system. Our method is based on the experimentally accessible sequences of singlet projections performed on up to four qubit pairs. In particular, our method permits the application of the Peres-Horodecki separability criterion to an arbitrary two-qubit state. We explicitly demonstrate that measuring entanglement in terms of negativity requires three measurements more than detecting two-qubit entanglement. The reported minimal set of interferometric measurements provides a complete description of bipartite quantum entanglement in terms of two-photon interference. This set is smaller than the set of 15 measurements needed to perform a complete quantum state tomography of an arbitrary two-qubit system. Finally, we demonstrate that the set of nine Makhlin's invariants needed to express the negativity can be measured by performing 13 multicopy projections. We demonstrate both that these invariants are a useful theoretical concept for designing specialized quantum interferometers and that their direct measurement within the framework of linear optics does not require performing complete quantum state tomography.

Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear Systems.

PubMed

Wei, Qinglai; Liu, Derong; Lin, Hanquan

2016-03-01

In this paper, a value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon undiscounted optimal control problems for discrete-time nonlinear systems. The present value iteration ADP algorithm permits an arbitrary positive semi-definite function to initialize the algorithm. A novel convergence analysis is developed to guarantee that the iterative value function converges to the optimal performance index function. Initialized by different initial functions, it is proven that the iterative value function will be monotonically nonincreasing, monotonically nondecreasing, or nonmonotonic and will converge to the optimum. In this paper, for the first time, the admissibility properties of the iterative control laws are developed for value iteration algorithms. It is emphasized that new termination criteria are established to guarantee the effectiveness of the iterative control laws. Neural networks are used to approximate the iterative value function and compute the iterative control law, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.

Numerical electromagnetic frequency domain analysis with discrete exterior calculus

NASA Astrophysics Data System (ADS)

Chen, Shu C.; Chew, Weng Cho

2017-12-01

In this paper, we perform a numerical analysis in frequency domain for various electromagnetic problems based on discrete exterior calculus (DEC) with an arbitrary 2-D triangular or 3-D tetrahedral mesh. We formulate the governing equations in terms of DEC for 3-D and 2-D inhomogeneous structures, and also show that the charge continuity relation is naturally satisfied. Then we introduce a general construction for signed dual volume to incorporate material information and take into account the case when circumcenters fall outside triangles or tetrahedrons, which may lead to negative dual volume without Delaunay triangulation. Then we examine the boundary terms induced by the dual mesh and provide a systematical treatment of various boundary conditions, including perfect magnetic conductor (PMC), perfect electric conductor (PEC), Dirichlet, periodic, and absorbing boundary conditions (ABC) within this method. An excellent agreement is achieved through the numerical calculation of several problems, including homogeneous waveguides, microstructured fibers, photonic crystals, scattering by a 2-D PEC, and resonant cavities.

A spectral approach for discrete dislocation dynamics simulations of nanoindentation

NASA Astrophysics Data System (ADS)

Bertin, Nicolas; Glavas, Vedran; Datta, Dibakar; Cai, Wei

2018-07-01

We present a spectral approach to perform nanoindentation simulations using three-dimensional nodal discrete dislocation dynamics. The method relies on a two step approach. First, the contact problem between an indenter of arbitrary shape and an isotropic elastic half-space is solved using a spectral iterative algorithm, and the contact pressure is fully determined on the half-space surface. The contact pressure is then used as a boundary condition of the spectral solver to determine the resulting stress field produced in the simulation volume. In both stages, the mechanical fields are decomposed into Fourier modes and are efficiently computed using fast Fourier transforms. To further improve the computational efficiency, the method is coupled with a subcycling integrator and a special approach is devised to approximate the displacement field associated with surface steps. As a benchmark, the method is used to compute the response of an elastic half-space using different types of indenter. An example of a dislocation dynamics nanoindentation simulation with complex initial microstructure is presented.

Adaptive Dynamic Programming for Discrete-Time Zero-Sum Games.

PubMed

Wei, Qinglai; Liu, Derong; Lin, Qiao; Song, Ruizhuo

2018-04-01

In this paper, a novel adaptive dynamic programming (ADP) algorithm, called "iterative zero-sum ADP algorithm," is developed to solve infinite-horizon discrete-time two-player zero-sum games of nonlinear systems. The present iterative zero-sum ADP algorithm permits arbitrary positive semidefinite functions to initialize the upper and lower iterations. A novel convergence analysis is developed to guarantee the upper and lower iterative value functions to converge to the upper and lower optimums, respectively. When the saddle-point equilibrium exists, it is emphasized that both the upper and lower iterative value functions are proved to converge to the optimal solution of the zero-sum game, where the existence criteria of the saddle-point equilibrium are not required. If the saddle-point equilibrium does not exist, the upper and lower optimal performance index functions are obtained, respectively, where the upper and lower performance index functions are proved to be not equivalent. Finally, simulation results and comparisons are shown to illustrate the performance of the present method.

Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures: A paradigm in three dimensions

PubMed Central

Ovtchinnikov, Evgueni E.; Xanthis, Leonidas S.

2000-01-01

We present a methodology for the efficient numerical solution of eigenvalue problems of full three-dimensional elasticity for thin elastic structures, such as shells, plates and rods of arbitrary geometry, discretized by the finite element method. Such problems are solved by iterative methods, which, however, are known to suffer from slow convergence or even convergence failure, when the thickness is small. In this paper we show an effective way of resolving this difficulty by invoking a special preconditioning technique associated with the effective dimensional reduction algorithm (EDRA). As an example, we present an algorithm for computing the minimal eigenvalue of a thin elastic plate and we show both theoretically and numerically that it is robust with respect to both the thickness and discretization parameters, i.e. the convergence does not deteriorate with diminishing thickness or mesh refinement. This robustness is sine qua non for the efficient computation of large-scale eigenvalue problems for thin elastic structures. PMID:10655469

A sequence-dependent rigid-base model of DNA

NASA Astrophysics Data System (ADS)

Gonzalez, O.; Petkevičiutė, D.; Maddocks, J. H.

2013-02-01

A novel hierarchy of coarse-grain, sequence-dependent, rigid-base models of B-form DNA in solution is introduced. The hierarchy depends on both the assumed range of energetic couplings, and the extent of sequence dependence of the model parameters. A significant feature of the models is that they exhibit the phenomenon of frustration: each base cannot simultaneously minimize the energy of all of its interactions. As a consequence, an arbitrary DNA oligomer has an intrinsic or pre-existing stress, with the level of this frustration dependent on the particular sequence of the oligomer. Attention is focussed on the particular model in the hierarchy that has nearest-neighbor interactions and dimer sequence dependence of the model parameters. For a Gaussian version of this model, a complete coarse-grain parameter set is estimated. The parameterized model allows, for an oligomer of arbitrary length and sequence, a simple and explicit construction of an approximation to the configuration-space equilibrium probability density function for the oligomer in solution. The training set leading to the coarse-grain parameter set is itself extracted from a recent and extensive database of a large number of independent, atomic-resolution molecular dynamics (MD) simulations of short DNA oligomers immersed in explicit solvent. The Kullback-Leibler divergence between probability density functions is used to make several quantitative assessments of our nearest-neighbor, dimer-dependent model, which is compared against others in the hierarchy to assess various assumptions pertaining both to the locality of the energetic couplings and to the level of sequence dependence of its parameters. It is also compared directly against all-atom MD simulation to assess its predictive capabilities. The results show that the nearest-neighbor, dimer-dependent model can successfully resolve sequence effects both within and between oligomers. For example, due to the presence of frustration, the model can successfully predict the nonlocal changes in the minimum energy configuration of an oligomer that are consequent upon a local change of sequence at the level of a single point mutation.

A sequence-dependent rigid-base model of DNA.

PubMed

Gonzalez, O; Petkevičiūtė, D; Maddocks, J H

2013-02-07

A novel hierarchy of coarse-grain, sequence-dependent, rigid-base models of B-form DNA in solution is introduced. The hierarchy depends on both the assumed range of energetic couplings, and the extent of sequence dependence of the model parameters. A significant feature of the models is that they exhibit the phenomenon of frustration: each base cannot simultaneously minimize the energy of all of its interactions. As a consequence, an arbitrary DNA oligomer has an intrinsic or pre-existing stress, with the level of this frustration dependent on the particular sequence of the oligomer. Attention is focussed on the particular model in the hierarchy that has nearest-neighbor interactions and dimer sequence dependence of the model parameters. For a Gaussian version of this model, a complete coarse-grain parameter set is estimated. The parameterized model allows, for an oligomer of arbitrary length and sequence, a simple and explicit construction of an approximation to the configuration-space equilibrium probability density function for the oligomer in solution. The training set leading to the coarse-grain parameter set is itself extracted from a recent and extensive database of a large number of independent, atomic-resolution molecular dynamics (MD) simulations of short DNA oligomers immersed in explicit solvent. The Kullback-Leibler divergence between probability density functions is used to make several quantitative assessments of our nearest-neighbor, dimer-dependent model, which is compared against others in the hierarchy to assess various assumptions pertaining both to the locality of the energetic couplings and to the level of sequence dependence of its parameters. It is also compared directly against all-atom MD simulation to assess its predictive capabilities. The results show that the nearest-neighbor, dimer-dependent model can successfully resolve sequence effects both within and between oligomers. For example, due to the presence of frustration, the model can successfully predict the nonlocal changes in the minimum energy configuration of an oligomer that are consequent upon a local change of sequence at the level of a single point mutation.

3D ductile crack propagation within a polycrystalline microstructure using XFEM

NASA Astrophysics Data System (ADS)

Beese, Steffen; Loehnert, Stefan; Wriggers, Peter

2018-02-01

In this contribution we present a gradient enhanced damage based method to simulate discrete crack propagation in 3D polycrystalline microstructures. Discrete cracks are represented using the eXtended finite element method. The crack propagation criterion and the crack propagation direction for each point along the crack front line is based on the gradient enhanced damage variable. This approach requires the solution of a coupled problem for the balance of momentum and the additional global equation for the gradient enhanced damage field. To capture the discontinuity of the displacements as well as the gradient enhanced damage along the discrete crack, both fields are enriched using the XFEM in combination with level sets. Knowing the crack front velocity, level set methods are used to compute the updated crack geometry after each crack propagation step. The applied material model is a crystal plasticity model often used for polycrystalline microstructures of metals in combination with the gradient enhanced damage model. Due to the inelastic material behaviour after each discrete crack propagation step a projection of the internal variables from the old to the new crack configuration is required. Since for arbitrary crack geometries ill-conditioning of the equation system may occur due to (near) linear dependencies between standard and enriched degrees of freedom, an XFEM stabilisation technique based on a singular value decomposition of the element stiffness matrix is proposed. The performance of the presented methodology to capture crack propagation in polycrystalline microstructures is demonstrated with a number of numerical examples.

Indexcov: fast coverage quality control for whole-genome sequencing.

PubMed

Pedersen, Brent S; Collins, Ryan L; Talkowski, Michael E; Quinlan, Aaron R

2017-11-01

The BAM and CRAM formats provide a supplementary linear index that facilitates rapid access to sequence alignments in arbitrary genomic regions. Comparing consecutive entries in a BAM or CRAM index allows one to infer the number of alignment records per genomic region for use as an effective proxy of sequence depth in each genomic region. Based on these properties, we have developed indexcov, an efficient estimator of whole-genome sequencing coverage to rapidly identify samples with aberrant coverage profiles, reveal large-scale chromosomal anomalies, recognize potential batch effects, and infer the sex of a sample. Indexcov is available at https://github.com/brentp/goleft under the MIT license. © The Authors 2017. Published by Oxford University Press.

Generalized Procedure for Improved Accuracy of Thermal Contact Resistance Measurements for Materials With Arbitrary Temperature-Dependent Thermal Conductivity

DOE PAGES

Sayer, Robert A.

2014-06-26

Thermal contact resistance (TCR) is most commonly measured using one-dimensional steady-state calorimetric techniques. In the experimental methods we utilized, a temperature gradient is applied across two contacting beams and the temperature drop at the interface is inferred from the temperature profiles of the rods that are measured at discrete points. During data analysis, thermal conductivity of the beams is typically taken to be an average value over the temperature range imposed during the experiment. Our generalized theory is presented and accounts for temperature-dependent changes in thermal conductivity. The procedure presented enables accurate measurement of TCR for contacting materials whose thermalmore » conductivity is any arbitrary function of temperature. For example, it is shown that the standard technique yields TCR values that are about 15% below the actual value for two specific examples of copper and silicon contacts. Conversely, the generalized technique predicts TCR values that are within 1% of the actual value. The method is exact when thermal conductivity is known exactly and no other errors are introduced to the system.« less

Border and surface tracing--theoretical foundations.

PubMed

Brimkov, Valentin E; Klette, Reinhard

2008-04-01

In this paper we define and study digital manifolds of arbitrary dimension, and provide (in particular)a general theoretical basis for curve or surface tracing in picture analysis. The studies involve properties such as one-dimensionality of digital curves and (n-1)-dimensionality of digital hypersurfaces that makes them discrete analogs of corresponding notions in continuous topology. The presented approach is fully based on the concept of adjacency relation and complements the concept of dimension as common in combinatorial topology. This work appears to be the first one on digital manifolds based ona graph-theoretical definition of dimension. In particular, in the n-dimensional digital space, a digital curve is a one-dimensional object and a digital hypersurface is an (n-1)-dimensional object, as it is in the case of curves and hypersurfaces in the Euclidean space. Relying on the obtained properties of digital hypersurfaces, we propose a uniform approach for studying good pairs defined by separations and obtain a classification of good pairs in arbitrary dimension. We also discuss possible applications of the presented definitions and results.

Stochastic flux analysis of chemical reaction networks

PubMed Central

2013-01-01

Background Chemical reaction networks provide an abstraction scheme for a broad range of models in biology and ecology. The two common means for simulating these networks are the deterministic and the stochastic approaches. The traditional deterministic approach, based on differential equations, enjoys a rich set of analysis techniques, including a treatment of reaction fluxes. However, the discrete stochastic simulations, which provide advantages in some cases, lack a quantitative treatment of network fluxes. Results We describe a method for flux analysis of chemical reaction networks, where flux is given by the flow of species between reactions in stochastic simulations of the network. Extending discrete event simulation algorithms, our method constructs several data structures, and thereby reveals a variety of statistics about resource creation and consumption during the simulation. We use these structures to quantify the causal interdependence and relative importance of the reactions at arbitrary time intervals with respect to the network fluxes. This allows us to construct reduced networks that have the same flux-behavior, and compare these networks, also with respect to their time series. We demonstrate our approach on an extended example based on a published ODE model of the same network, that is, Rho GTP-binding proteins, and on other models from biology and ecology. Conclusions We provide a fully stochastic treatment of flux analysis. As in deterministic analysis, our method delivers the network behavior in terms of species transformations. Moreover, our stochastic analysis can be applied, not only at steady state, but at arbitrary time intervals, and used to identify the flow of specific species between specific reactions. Our cases study of Rho GTP-binding proteins reveals the role played by the cyclic reverse fluxes in tuning the behavior of this network. PMID:24314153

Stochastic flux analysis of chemical reaction networks.

PubMed

Kahramanoğulları, Ozan; Lynch, James F

2013-12-07

Chemical reaction networks provide an abstraction scheme for a broad range of models in biology and ecology. The two common means for simulating these networks are the deterministic and the stochastic approaches. The traditional deterministic approach, based on differential equations, enjoys a rich set of analysis techniques, including a treatment of reaction fluxes. However, the discrete stochastic simulations, which provide advantages in some cases, lack a quantitative treatment of network fluxes. We describe a method for flux analysis of chemical reaction networks, where flux is given by the flow of species between reactions in stochastic simulations of the network. Extending discrete event simulation algorithms, our method constructs several data structures, and thereby reveals a variety of statistics about resource creation and consumption during the simulation. We use these structures to quantify the causal interdependence and relative importance of the reactions at arbitrary time intervals with respect to the network fluxes. This allows us to construct reduced networks that have the same flux-behavior, and compare these networks, also with respect to their time series. We demonstrate our approach on an extended example based on a published ODE model of the same network, that is, Rho GTP-binding proteins, and on other models from biology and ecology. We provide a fully stochastic treatment of flux analysis. As in deterministic analysis, our method delivers the network behavior in terms of species transformations. Moreover, our stochastic analysis can be applied, not only at steady state, but at arbitrary time intervals, and used to identify the flow of specific species between specific reactions. Our cases study of Rho GTP-binding proteins reveals the role played by the cyclic reverse fluxes in tuning the behavior of this network.

FastMag: Fast micromagnetic simulator for complex magnetic structures (invited)

NASA Astrophysics Data System (ADS)

Chang, R.; Li, S.; Lubarda, M. V.; Livshitz, B.; Lomakin, V.

2011-04-01

A fast micromagnetic simulator (FastMag) for general problems is presented. FastMag solves the Landau-Lifshitz-Gilbert equation and can handle multiscale problems with a high computational efficiency. The simulator derives its high performance from efficient methods for evaluating the effective field and from implementations on massively parallel graphics processing unit (GPU) architectures. FastMag discretizes the computational domain into tetrahedral elements and therefore is highly flexible for general problems. The magnetostatic field is computed via the superposition principle for both volume and surface parts of the computational domain. This is accomplished by implementing efficient quadrature rules and analytical integration for overlapping elements in which the integral kernel is singular. Thus, discretized superposition integrals are computed using a nonuniform grid interpolation method, which evaluates the field from N sources at N collocated observers in O(N) operations. This approach allows handling objects of arbitrary shape, allows easily calculating of the field outside the magnetized domains, does not require solving a linear system of equations, and requires little memory. FastMag is implemented on GPUs with ?> GPU-central processing unit speed-ups of 2 orders of magnitude. Simulations are shown of a large array of magnetic dots and a recording head fully discretized down to the exchange length, with over a hundred million tetrahedral elements on an inexpensive desktop computer.

Localization in finite vibroimpact chains: Discrete breathers and multibreathers.

PubMed

Grinberg, Itay; Gendelman, Oleg V

2016-09-01

We explore the dynamics of strongly localized periodic solutions (discrete solitons or discrete breathers) in a finite one-dimensional chain of oscillators. Localization patterns with both single and multiple localization sites (breathers and multibreathers) are considered. The model involves parabolic on-site potential with rigid constraints (the displacement domain of each particle is finite) and a linear nearest-neighbor coupling. When the particle approaches the constraint, it undergoes an inelastic impact according to Newton's impact model. The rigid nonideal impact constraints are the only source of nonlinearity and damping in the system. We demonstrate that this vibro-impact model allows derivation of exact analytic solutions for the breathers and multibreathers with an arbitrary set of localization sites, both in conservative and in forced-damped settings. Periodic boundary conditions are considered; exact solutions for other types of boundary conditions are also available. Local character of the nonlinearity permits explicit derivation of a monodromy matrix for the breather solutions. Consequently, the stability of the derived breather and multibreather solutions can be efficiently studied in the framework of simple methods of linear algebra, and with rather moderate computational efforts. One reveals that that the finiteness of the chain fragment and possible proximity of the localization sites strongly affect both the existence and the stability patterns of these localized solutions.

Variational symplectic algorithm for guiding center dynamics in the inner magnetosphere

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li Jinxing; Pu Zuyin; Xie Lun

Charged particle dynamics in magnetosphere has temporal and spatial multiscale; therefore, numerical accuracy over a long integration time is required. A variational symplectic integrator (VSI) [H. Qin and X. Guan, Phys. Rev. Lett. 100, 035006 (2008) and H. Qin, X. Guan, and W. M. Tang, Phys. Plasmas 16, 042510 (2009)] for the guiding-center motion of charged particles in general magnetic field is applied to study the dynamics of charged particles in magnetosphere. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing themore » dynamics. The VSI conserves exactly a discrete Lagrangian symplectic structure and has better numerical properties over a long integration time, compared with standard integrators, such as the standard and adaptive fourth order Runge-Kutta (RK4) methods. Applying the VSI method to guiding-center dynamics in the inner magnetosphere, we can accurately calculate the particles'orbits for an arbitrary long simulating time with good conservation property. When a time-independent convection and corotation electric field is considered, the VSI method can give the accurate single particle orbit, while the RK4 method gives an incorrect orbit due to its intrinsic error accumulation over a long integrating time.« less

Superresolution restoration of an image sequence: adaptive filtering approach.

PubMed

Elad, M; Feuer, A

1999-01-01

This paper presents a new method based on adaptive filtering theory for superresolution restoration of continuous image sequences. The proposed methodology suggests least squares (LS) estimators which adapt in time, based on adaptive filters, least mean squares (LMS) or recursive least squares (RLS). The adaptation enables the treatment of linear space and time-variant blurring and arbitrary motion, both of them assumed known. The proposed new approach is shown to be of relatively low computational requirements. Simulations demonstrating the superresolution restoration algorithms are presented.

Microfabricated, flowthrough porous apparatus for discrete detection of binding reactions

DOEpatents

Beattie, Kenneth L.

1998-01-01

An improved microfabricated apparatus for conducting a multiplicity of individual and simultaneous binding reactions is described. The apparatus comprises a substrate on which are located discrete and isolated sites for binding reactions. The apparatus is characterized by discrete and isolated regions that extend through said substrate and terminate on a second surface thereof such that when a test sample is allowed to the substrate, it is capable of penetrating through each such region during the course of said binding reaction. The apparatus is especially useful for sequencing by hybridization of DNA molecules.

Duality for massive spin two theories in arbitrary dimensions

NASA Astrophysics Data System (ADS)

González, B.; Khoudeir, A.; Montemayor, R.; Urrutia, L. F.

2008-09-01

Using the parent Lagrangian approach we construct a dual formulation, in the sense originally proposed by Curtright and Freund, of a massive spin two Fierz-Pauli theory in arbitrary dimensions D. This is achieved in terms of a mixed symmetry tensor TA[B1B2...BD-2], without the need of auxiliary fields. The relation of this method with an alternative formulation based on a gauge symmetry principle proposed by Zinoviev is elucidated. We show that the latter formulation in four dimensions, with a given gauge fixing together with a definite sequence of auxiliary fields elimination via their equations of motion, leads to the parent Lagrangian already considered by West completed by a Fierz-Pauli mass term, which in turns yields the Curtright-Freund action. This motivates our generalization to arbitrary dimensions leading to the corresponding extension of the four dimensional result. We identify the transverse true degrees of freedom of the dual theory and verify that their number is in accordance with those of the massive Fierz-Pauli field.

Fusion primer and nested integrated PCR (FPNI-PCR): a new high-efficiency strategy for rapid chromosome walking or flanking sequence cloning

PubMed Central

2011-01-01

Background The advent of genomics-based technologies has revolutionized many fields of biological enquiry. However, chromosome walking or flanking sequence cloning is still a necessary and important procedure to determining gene structure. Such methods are used to identify T-DNA insertion sites and so are especially relevant for organisms where large T-DNA insertion libraries have been created, such as rice and Arabidopsis. The currently available methods for flanking sequence cloning, including the popular TAIL-PCR technique, are relatively laborious and slow. Results Here, we report a simple and effective fusion primer and nested integrated PCR method (FPNI-PCR) for the identification and cloning of unknown genomic regions flanked known sequences. In brief, a set of universal primers was designed that consisted of various 15-16 base arbitrary degenerate oligonucleotides. These arbitrary degenerate primers were fused to the 3' end of an adaptor oligonucleotide which provided a known sequence without degenerate nucleotides, thereby forming the fusion primers (FPs). These fusion primers are employed in the first step of an integrated nested PCR strategy which defines the overall FPNI-PCR protocol. In order to demonstrate the efficacy of this novel strategy, we have successfully used it to isolate multiple genomic sequences namely, 21 orthologs of genes in various species of Rosaceace, 4 MYB genes of Rosa rugosa, 3 promoters of transcription factors of Petunia hybrida, and 4 flanking sequences of T-DNA insertion sites in transgenic tobacco lines and 6 specific genes from sequenced genome of rice and Arabidopsis. Conclusions The successful amplification of target products through FPNI-PCR verified that this novel strategy is an effective, low cost and simple procedure. Furthermore, FPNI-PCR represents a more sensitive, rapid and accurate technique than the established TAIL-PCR and hiTAIL-PCR procedures. PMID:22093809

Topological T-duality for torus bundles with monodromy

NASA Astrophysics Data System (ADS)

Baraglia, David

2015-05-01

We give a simplified definition of topological T-duality that applies to arbitrary torus bundles. The new definition does not involve Chern classes or spectral sequences, only gerbes and morphisms between them. All the familiar topological conditions for T-duals are shown to follow. We determine necessary and sufficient conditions for existence of a T-dual in the case of affine torus bundles. This is general enough to include all principal torus bundles as well as torus bundles with arbitrary monodromy representations. We show that isomorphisms in twisted cohomology, twisted K-theory and of Courant algebroids persist in this general setting. We also give an example where twisted K-theory groups can be computed by iterating T-duality.

Gate sequence for continuous variable one-way quantum computation

PubMed Central

Su, Xiaolong; Hao, Shuhong; Deng, Xiaowei; Ma, Lingyu; Wang, Meihong; Jia, Xiaojun; Xie, Changde; Peng, Kunchi

2013-01-01

Measurement-based one-way quantum computation using cluster states as resources provides an efficient model to perform computation and information processing of quantum codes. Arbitrary Gaussian quantum computation can be implemented sufficiently by long single-mode and two-mode gate sequences. However, continuous variable gate sequences have not been realized so far due to an absence of cluster states larger than four submodes. Here we present the first continuous variable gate sequence consisting of a single-mode squeezing gate and a two-mode controlled-phase gate based on a six-mode cluster state. The quantum property of this gate sequence is confirmed by the fidelities and the quantum entanglement of two output modes, which depend on both the squeezing and controlled-phase gates. The experiment demonstrates the feasibility of implementing Gaussian quantum computation by means of accessible gate sequences.

From Movements to Actions: Two Mechanisms for Learning Action Sequences

ERIC Educational Resources Information Center

Endress, Ansgar D.; Wood, Justin N.

2011-01-01

When other individuals move, we interpret their movements as discrete, hierarchically-organized, goal-directed actions. However, the mechanisms that integrate visible movement features into actions are poorly understood. Here, we consider two sequence learning mechanisms--transitional probability-based (TP) and position-based encoding…

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

ERIC Educational Resources Information Center

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

1998-01-01

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

A numerical homogenization method for heterogeneous, anisotropic elastic media based on multiscale theory

DOE PAGES

Gao, Kai; Chung, Eric T.; Gibson, Richard L.; ...

2015-06-05

The development of reliable methods for upscaling fine scale models of elastic media has long been an important topic for rock physics and applied seismology. Several effective medium theories have been developed to provide elastic parameters for materials such as finely layered media or randomly oriented or aligned fractures. In such cases, the analytic solutions for upscaled properties can be used for accurate prediction of wave propagation. However, such theories cannot be applied directly to homogenize elastic media with more complex, arbitrary spatial heterogeneity. We therefore propose a numerical homogenization algorithm based on multiscale finite element methods for simulating elasticmore » wave propagation in heterogeneous, anisotropic elastic media. Specifically, our method used multiscale basis functions obtained from a local linear elasticity problem with appropriately defined boundary conditions. Homogenized, effective medium parameters were then computed using these basis functions, and the approach applied a numerical discretization that is similar to the rotated staggered-grid finite difference scheme. Comparisons of the results from our method and from conventional, analytical approaches for finely layered media showed that the homogenization reliably estimated elastic parameters for this simple geometry. Additional tests examined anisotropic models with arbitrary spatial heterogeneity where the average size of the heterogeneities ranged from several centimeters to several meters, and the ratio between the dominant wavelength and the average size of the arbitrary heterogeneities ranged from 10 to 100. Comparisons to finite-difference simulations proved that the numerical homogenization was equally accurate for these complex cases.« less

Game Theoretic Approaches to Protect Cyberspace

DTIC Science & Technology

2010-04-20

security problems. 3.1 Definitions Game A description of the strategic interaction between opposing, or co-operating, interests where the con ...that involves probabilistic transitions through several states of the system. The game pro - gresses as a sequence of states. The game begins with a...eventually leads to a discretized model. The reaction functions uniquely minimize the strictly con - vex cost functions. After discretization, this

Modeling electrokinetic flows by consistent implicit incompressible smoothed particle hydrodynamics

DOE PAGES

Pan, Wenxiao; Kim, Kyungjoo; Perego, Mauro; ...

2017-01-03

In this paper, we present a consistent implicit incompressible smoothed particle hydrodynamics (I 2SPH) discretization of Navier–Stokes, Poisson–Boltzmann, and advection–diffusion equations subject to Dirichlet or Robin boundary conditions. It is applied to model various two and three dimensional electrokinetic flows in simple or complex geometries. The accuracy and convergence of the consistent I 2SPH are examined via comparison with analytical solutions, grid-based numerical solutions, or empirical models. Lastly, the new method provides a framework to explore broader applications of SPH in microfluidics and complex fluids with charged objects, such as colloids and biomolecules, in arbitrary complex geometries.

Elliptic surface grid generation in three-dimensional space

NASA Technical Reports Server (NTRS)

Kania, Lee

1992-01-01

A methodology for surface grid generation in three dimensional space is described. The method solves a Poisson equation for each coordinate on arbitrary surfaces using successive line over-relaxation. The complete surface curvature terms were discretized and retained within the nonhomogeneous term in order to preserve surface definition; there is no need for conventional surface splines. Control functions were formulated to permit control of grid orthogonality and spacing. A method for interpolation of control functions into the domain was devised which permits their specification not only at the surface boundaries but within the interior as well. An interactive surface generation code which makes use of this methodology is currently under development.

Convex relaxations of spectral sparsity for robust super-resolution and line spectrum estimation

NASA Astrophysics Data System (ADS)

Chi, Yuejie

2017-08-01

We consider recovering the amplitudes and locations of spikes in a point source signal from its low-pass spectrum that may suffer from missing data and arbitrary outliers. We first review and provide a unified view of several recently proposed convex relaxations that characterize and capitalize the spectral sparsity of the point source signal without discretization under the framework of atomic norms. Next we propose a new algorithm when the spikes are known a priori to be positive, motivated by applications such as neural spike sorting and fluorescence microscopy imaging. Numerical experiments are provided to demonstrate the effectiveness of the proposed approach.

Linear Characteristic Spatial Quadrature for Discrete Ordinates Neutral Particle Transport on Arbitrary Triangles

DTIC Science & Technology

1993-06-01

1•) + ) •,(v)(•,L) = ()(Q)+ sEXT (F). (4) The scalar flux, 0, is related to the angular flux, W, by (F)= f (dQ Vh) (5) and the particle current, J...J," v,p’) u +at(U, v) w(u, U, p’)= as(u, v) O(u, v) + SEXT (uv)] (92) 0 Ul,(V) I Assuming the area of the triangle is sufficiently small that cross...M + SEXT () (98) Wvn and WoUT are angular flux averages along the input and output edges, respectively, and are defined by WD Iv = f- ds. V(s.v) (99

The Mimetic Finite Element Method and the Virtual Element Method for elliptic problems with arbitrary regularity.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Manzini, Gianmarco

2012-07-13

We develop and analyze a new family of virtual element methods on unstructured polygonal meshes for the diffusion problem in primal form, that use arbitrarily regular discrete spaces V{sub h} {contained_in} C{sup {alpha}} {element_of} N. The degrees of freedom are (a) solution and derivative values of various degree at suitable nodes and (b) solution moments inside polygons. The convergence of the method is proven theoretically and an optimal error estimate is derived. The connection with the Mimetic Finite Difference method is also discussed. Numerical experiments confirm the convergence rate that is expected from the theory.

Adaptive Discrete Hypergraph Matching.

PubMed

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

2018-02-01

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

Data compression of discrete sequence: A tree based approach using dynamic programming

NASA Technical Reports Server (NTRS)

Shivaram, Gurusrasad; Seetharaman, Guna; Rao, T. R. N.

1994-01-01

A dynamic programming based approach for data compression of a ID sequence is presented. The compression of an input sequence of size N to that of a smaller size k is achieved by dividing the input sequence into k subsequences and replacing the subsequences by their respective average values. The partitioning of the input sequence is carried with the intention of reducing the mean squared error in the reconstructed sequence. The complexity involved in finding the partitions which would result in such an optimal compressed sequence is reduced by using the dynamic programming approach, which is presented.

SCAMP: Automatic Astrometric and Photometric Calibration

NASA Astrophysics Data System (ADS)

Bertin, Emmanuel

2010-10-01

Astrometric and photometric calibrations have remained the most tiresome step in the reduction of large imaging surveys. SCAMP has been written to address this problem. The program efficiently computes accurate astrometric and photometric solutions for any arbitrary sequence of FITS images in a completely automatic way. SCAMP is released under the GNU General Public License.

Optimization of training sequence for DFT-spread DMT signal in optical access network with direct detection utilizing DML.

PubMed

Li, Fan; Li, Xinying; Yu, Jianjun; Chen, Lin

2014-09-22

We experimentally demonstrated the transmission of 79.86-Gb/s discrete-Fourier-transform spread 32 QAM discrete multi-tone (DFT-spread 32 QAM-DMT) signal over 20-km standard single-mode fiber (SSMF) utilizing directly modulated laser (DML). The experimental results show DFT-spread effectively reduces Peak-to-Average Power Ratio (PAPR) of DMT signal, and also well overcomes narrowband interference and high frequencies power attenuation. We compared different types of training sequence (TS) symbols and found that the optimized TS for channel estimation is the symbol with digital BPSK/QPSK modulation format due to its best performance against optical link noise during channel estimation.

On the design of henon and logistic map-based random number generator

NASA Astrophysics Data System (ADS)

Magfirawaty; Suryadi, M. T.; Ramli, Kalamullah

2017-10-01

The key sequence is one of the main elements in the cryptosystem. True Random Number Generators (TRNG) method is one of the approaches to generating the key sequence. The randomness source of the TRNG divided into three main groups, i.e. electrical noise based, jitter based and chaos based. The chaos based utilizes a non-linear dynamic system (continuous time or discrete time) as an entropy source. In this study, a new design of TRNG based on discrete time chaotic system is proposed, which is then simulated in LabVIEW. The principle of the design consists of combining 2D and 1D chaotic systems. A mathematical model is implemented for numerical simulations. We used comparator process as a harvester method to obtain the series of random bits. Without any post processing, the proposed design generated random bit sequence with high entropy value and passed all NIST 800.22 statistical tests.

Temporal and Rate Coding for Discrete Event Sequences in the Hippocampus.

PubMed

Terada, Satoshi; Sakurai, Yoshio; Nakahara, Hiroyuki; Fujisawa, Shigeyoshi

2017-06-21

Although the hippocampus is critical to episodic memory, neuronal representations supporting this role, especially relating to nonspatial information, remain elusive. Here, we investigated rate and temporal coding of hippocampal CA1 neurons in rats performing a cue-combination task that requires the integration of sequentially provided sound and odor cues. The majority of CA1 neurons displayed sensory cue-, combination-, or choice-specific (simply, "event"-specific) elevated discharge activities, which were sustained throughout the event period. These event cells underwent transient theta phase precession at event onset, followed by sustained phase locking to the early theta phases. As a result of this unique single neuron behavior, the theta sequences of CA1 cell assemblies of the event sequences had discrete representations. These results help to update the conceptual framework for space encoding toward a more general model of episodic event representations in the hippocampus. Copyright © 2017 Elsevier Inc. All rights reserved.

A matrix-based approach to solving the inverse Frobenius-Perron problem using sequences of density functions of stochastically perturbed dynamical systems

NASA Astrophysics Data System (ADS)

Nie, Xiaokai; Coca, Daniel

2018-01-01

The paper introduces a matrix-based approach to estimate the unique one-dimensional discrete-time dynamical system that generated a given sequence of probability density functions whilst subjected to an additive stochastic perturbation with known density.

A matrix-based approach to solving the inverse Frobenius-Perron problem using sequences of density functions of stochastically perturbed dynamical systems.

PubMed

Nie, Xiaokai; Coca, Daniel

2018-01-01

The paper introduces a matrix-based approach to estimate the unique one-dimensional discrete-time dynamical system that generated a given sequence of probability density functions whilst subjected to an additive stochastic perturbation with known density.

The isolation of spatial patterning modes in a mathematical model of juxtacrine cell signalling.

PubMed

O'Dea, R D; King, J R

2013-06-01

Juxtacrine signalling mechanisms are known to be crucial in tissue and organ development, leading to spatial patterns in gene expression. We investigate the patterning behaviour of a discrete model of juxtacrine cell signalling due to Owen & Sherratt (1998, Mathematical modelling of juxtacrine cell signalling. Math. Biosci., 153, 125-150) in which ligand molecules, unoccupied receptors and bound ligand-receptor complexes are modelled. Feedback between the ligand and receptor production and the level of bound receptors is incorporated. By isolating two parameters associated with the feedback strength and employing numerical simulation, linear stability and bifurcation analysis, the pattern-forming behaviour of the model is analysed under regimes corresponding to lateral inhibition and induction. Linear analysis of this model fails to capture the patterning behaviour exhibited in numerical simulations. Via bifurcation analysis, we show that since the majority of periodic patterns fold subcritically from the homogeneous steady state, a wide variety of stable patterns exists at a given parameter set, providing an explanation for this failure. The dominant pattern is isolated via numerical simulation. Additionally, by sampling patterns of non-integer wavelength on a discrete mesh, we highlight a disparity between the continuous and discrete representations of signalling mechanisms: in the continuous case, patterns of arbitrary wavelength are possible, while sampling such patterns on a discrete mesh leads to longer wavelength harmonics being selected where the wavelength is rational; in the irrational case, the resulting aperiodic patterns exhibit 'local periodicity', being constructed from distorted stable shorter wavelength patterns. This feature is consistent with experimentally observed patterns, which typically display approximate short-range periodicity with defects.

Theoretical model for the discrete flexoelectric effect and a description for the sequence of intermediate smectic phases with increasing periodicity.

PubMed

Emelyanenko, A V; Osipov, M A

2003-11-01

A general phenomenological description and a simple molecular model is proposed for the "discrete" flexoelectric effect in tilted smectic liquid crystal phases. This effect defines a polarization in a smectic layer induced by a difference of director orientations in the two smectic layers adjacent to it. It is shown that the "discrete" flexoelectric effect is determined by electrostatic dipole-quadrupole interaction between positionally correlated molecules located in adjacent smectic layers, while the corresponding dipole-dipole interaction is responsible for a coupling between polarization vectors in neighboring layers. It is shown that a simple phenomenological model of a ferrielectric smectic liquid crystal, which has recently been proposed in the literature, can be used to describe the whole sequence of intermediate chiral smectic C* phases with increasing periods, and to determine the nonplanar structure of each phase without additional assumptions. In this sequence the phases with three- and four-layer periodicities have the same structure, as observed in the experiment. The theory predicts also the structure of intermediate phases with longer periods that have not been studied experimentally so far. The structures of intermediate phases with periodicities of up to nine layers are presented together with the phase diagrams, and a relationship between molecular chirality and the three-dimensional structure of intermediate phases is discussed. It is considered also how the coupling between the spontaneous polarization determined by molecular chirality and the induced polarization determined by the discrete flexoelectric effect stabilizes the nonplanar structure of intermediate phases.

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

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

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

PubMed

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

2018-05-04

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

Plasma plume oscillations monitoring during laser welding of stainless steel by discrete wavelet transform application.

PubMed

Sibillano, Teresa; Ancona, Antonio; Rizzi, Domenico; Lupo, Valentina; Tricarico, Luigi; Lugarà, Pietro Mario

2010-01-01

The plasma optical radiation emitted during CO2 laser welding of stainless steel samples has been detected with a Si-PIN photodiode and analyzed under different process conditions. The discrete wavelet transform (DWT) has been used to decompose the optical signal into various discrete series of sequences over different frequency bands. The results show that changes of the process settings may yield different signal features in the range of frequencies between 200 Hz and 30 kHz. Potential applications of this method to monitor in real time the laser welding processes are also discussed.

Stability and bifurcation analysis for the Kaldor-Kalecki model with a discrete delay and a distributed delay

NASA Astrophysics Data System (ADS)

Yu, Jinchen; Peng, Mingshu

2016-10-01

In this paper, a Kaldor-Kalecki model of business cycle with both discrete and distributed delays is considered. With the corresponding characteristic equation analyzed, the local stability of the positive equilibrium is investigated. It is found that there exist Hopf bifurcations when the discrete time delay passes a sequence of critical values. By applying the method of multiple scales, the explicit formulae which determine the direction of Hopf bifurcation and the stability of bifurcating periodic solutions are derived. Finally, numerical simulations are carried out to illustrate our main results.

Training alignment parameters for arbitrary sequencers with LAST-TRAIN.

PubMed

Hamada, Michiaki; Ono, Yukiteru; Asai, Kiyoshi; Frith, Martin C

2017-03-15

LAST-TRAIN improves sequence alignment accuracy by inferring substitution and gap scores that fit the frequencies of substitutions, insertions, and deletions in a given dataset. We have applied it to mapping DNA reads from IonTorrent and PacBio RS, and we show that it reduces reference bias for Oxford Nanopore reads. the source code is freely available at http://last.cbrc.jp/. mhamada@waseda.jp or mcfrith@edu.k.u-tokyo.ac.jp. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.

Several Families of Sequences with Low Correlation and Large Linear Span

NASA Astrophysics Data System (ADS)

Zeng, Fanxin; Zhang, Zhenyu

In DS-CDMA systems and DS-UWB radios, low correlation of spreading sequences can greatly help to minimize multiple access interference (MAI) and large linear span of spreading sequences can reduce their predictability. In this letter, new sequence sets with low correlation and large linear span are proposed. Based on the construction Trm1[Trnm(αbt+γiαdt)]r for generating p-ary sequences of period pn-1, where n=2m, d=upm±v, b=u±v, γi∈GF(pn), and p is an arbitrary prime number, several methods to choose the parameter d are provided. The obtained sequences with family size pn are of four-valued, five-valued, six-valued or seven-valued correlation and the maximum nontrivial correlation value is (u+v-1)pm-1. The simulation by a computer shows that the linear span of the new sequences is larger than that of the sequences with Niho-type and Welch-type decimations, and similar to that of [10].

Reproduction accuracy of articulator mounting with an arbitrary face-bow vs. average values-a controlled, randomized, blinded patient simulator study.

PubMed

Ahlers, M Oliver; Edelhoff, Daniel; Jakstat, Holger A

2018-06-21

The benefit from positioning the maxillary casts with the aid of face-bows has been questioned in the past. Therefore, the aim of this study was to investigate the reliability and validity of arbitrary face-bow transfers compared to a process solely based on the orientation by means of average values. For optimized validity, the study was conducted using a controlled, randomized, anonymized, and blinded patient simulator study design. Thirty-eight undergraduate dental students were randomly divided into two groups; both groups were applied to both methods, in opposite sequences. Investigated methods were the transfer of casts using an arbitrary face-bow in comparison to the transfer using average values based on Bonwill's triangle and the Balkwill angle. The "patient" used in this study was a patient simulator. All casts were transferred to the same individual articulator, and all the transferred casts were made using type IV special hard stone plaster; for the attachment into the articulator, type II plaster was used. A blinded evaluation was performed based on three-dimensional measurements of three reference points. The results are presented three-dimensionally in scatterplots. Statistical analysis indicated a significantly smaller variance (Student's t test, p < 0.05) for the transfer using a face-bow, applicable for all three reference points. The use of an arbitrary face-bow significantly improves the transfer reliability and hence the validity. To simulate the patient situation in an individual articulator correctly, casts should be transferred at least by means of an arbitrary face-bow.

Partitioned fluid-solid coupling for cardiovascular blood flow: left-ventricular fluid mechanics.

PubMed

Krittian, Sebastian; Janoske, Uwe; Oertel, Herbert; Böhlke, Thomas

2010-04-01

We present a 3D code-coupling approach which has been specialized towards cardiovascular blood flow. For the first time, the prescribed geometry movement of the cardiovascular flow model KaHMo (Karlsruhe Heart Model) has been replaced by a myocardial composite model. Deformation is driven by fluid forces and myocardial response, i.e., both its contractile and constitutive behavior. Whereas the arbitrary Lagrangian-Eulerian formulation (ALE) of the Navier-Stokes equations is discretized by finite volumes (FVM), the solid mechanical finite elasticity equations are discretized by a finite element (FEM) approach. Taking advantage of specialized numerical solution strategies for non-matching fluid and solid domain meshes, an iterative data-exchange guarantees the interface equilibrium of the underlying governing equations. The focus of this work is on left-ventricular fluid-structure interaction based on patient-specific magnetic resonance imaging datasets. Multi-physical phenomena are described by temporal visualization and characteristic FSI numbers. The results gained show flow patterns that are in good agreement with previous observations. A deeper understanding of cavity deformation, blood flow, and their vital interaction can help to improve surgical treatment and clinical therapy planning.

On the performance of voltage stepping for the simulation of adaptive, nonlinear integrate-and-fire neuronal networks.

PubMed

Kaabi, Mohamed Ghaith; Tonnelier, Arnaud; Martinez, Dominique

2011-05-01

In traditional event-driven strategies, spike timings are analytically given or calculated with arbitrary precision (up to machine precision). Exact computation is possible only for simplified neuron models, mainly the leaky integrate-and-fire model. In a recent paper, Zheng, Tonnelier, and Martinez (2009) introduced an approximate event-driven strategy, named voltage stepping, that allows the generic simulation of nonlinear spiking neurons. Promising results were achieved in the simulation of single quadratic integrate-and-fire neurons. Here, we assess the performance of voltage stepping in network simulations by considering more complex neurons (quadratic integrate-and-fire neurons with adaptation) coupled with multiple synapses. To handle the discrete nature of synaptic interactions, we recast voltage stepping in a general framework, the discrete event system specification. The efficiency of the method is assessed through simulations and comparisons with a modified time-stepping scheme of the Runge-Kutta type. We demonstrated numerically that the original order of voltage stepping is preserved when simulating connected spiking neurons, independent of the network activity and connectivity.

The domain interface method: a general-purpose non-intrusive technique for non-conforming domain decomposition problems

NASA Astrophysics Data System (ADS)

Cafiero, M.; Lloberas-Valls, O.; Cante, J.; Oliver, J.

2016-04-01

A domain decomposition technique is proposed which is capable of properly connecting arbitrary non-conforming interfaces. The strategy essentially consists in considering a fictitious zero-width interface between the non-matching meshes which is discretized using a Delaunay triangulation. Continuity is satisfied across domains through normal and tangential stresses provided by the discretized interface and inserted in the formulation in the form of Lagrange multipliers. The final structure of the global system of equations resembles the dual assembly of substructures where the Lagrange multipliers are employed to nullify the gap between domains. A new approach to handle floating subdomains is outlined which can be implemented without significantly altering the structure of standard industrial finite element codes. The effectiveness of the developed algorithm is demonstrated through a patch test example and a number of tests that highlight the accuracy of the methodology and independence of the results with respect to the framework parameters. Considering its high degree of flexibility and non-intrusive character, the proposed domain decomposition framework is regarded as an attractive alternative to other established techniques such as the mortar approach.

LinAir: A multi-element discrete vortex Weissinger aerodynamic prediction method

NASA Technical Reports Server (NTRS)

Durston, Donald A.

1993-01-01

LinAir is a vortex lattice aerodynamic prediction method similar to Weissinger's extended lifting-line theory, except that the circulation around a wing is represented by discrete horseshoe vortices, not a continuous distribution of vorticity. The program calculates subsonic longitudinal and lateral/directional aerodynamic forces and moments for arbitrary aircraft geometries. It was originally written by Dr. Ilan Kroo of Stanford University, and subsequently modified by the author to simplify modeling of complex configurations. The Polhamus leading-edge suction analogy was added by the author to extend the range of applicability of LinAir to low aspect ratio (i.e., fighter-type) configurations. A brief discussion of the theory of LinAir is presented, and details on how to run the program are given along with some comparisons with experimental data to validate the code. Example input and output files are given in the appendices to aid in understanding the program and its use. This version of LinAir runs in the VAX/VMS, Cray UNICOS, and Silicon Graphics Iris workstation environments at the time of this writing.

A first-order Green's function approach to supersonic oscillatory flow: A mixed analytic and numeric treatment

NASA Technical Reports Server (NTRS)

Freedman, M. I.; Sipcic, S.; Tseng, K.

1985-01-01

A frequency domain Green's Function Method for unsteady supersonic potential flow around complex aircraft configurations is presented. The focus is on the supersonic range wherein the linear potential flow assumption is valid. In this range the effects of the nonlinear terms in the unsteady supersonic compressible velocity potential equation are negligible and therefore these terms will be omitted. The Green's function method is employed in order to convert the potential flow differential equation into an integral one. This integral equation is then discretized, through standard finite element technique, to yield a linear algebraic system of equations relating the unknown potential to its prescribed co-normalwash (boundary condition) on the surface of the aircraft. The arbitrary complex aircraft configuration (e.g., finite-thickness wing, wing-body-tail) is discretized into hyperboloidal (twisted quadrilateral) panels. The potential and co-normalwash are assumed to vary linearly within each panel. The long range goal is to develop a comprehensive theory for unsteady supersonic potential aerodynamic which is capable of yielding accurate results even in the low supersonic (i.e., high transonic) range.

Simulating Electrophoresis with Discrete Charge and Drag

NASA Astrophysics Data System (ADS)

Mowitz, Aaron J.; Witten, Thomas A.

A charged asymmetric rigid cluster of colloidal particles in saline solution can respond in exotic ways to an electric field: it may spin or move transversely. These distinctive motions arise from the drag force of the neutralizing countercharge surrounding the cluster. Because of this drag, calculating the motion of arbitrary asymmetric objects with nonuniform charge is impractical by conventional methods. Here we present a new method of simulating electrophoresis, in which we replace the continuous object and the surrounding countercharge with discrete point-draggers, called Stokeslets. The balance of forces imposes a linear, self-consistent relation among the drag and Coulomb forces on the Stokeslets, which allows us to easily determine the object's motion via matrix inversion. By explicitly enforcing charge+countercharge neutrality, the simulation recovers the distinctive features of electrophoretic motion to few-percent accuracy using as few as 1000 Stokeslets. In particular, for uniformly charged objects, we observe the characteristic Smoluchowski independence of mobility on object size and shape. We then discuss electrophoretic motion of asymmetric objects, where our simulation method is particularly advantageous. This work is supported by a Grant from the US-Israel Binational Science Foundation.

Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations

NASA Astrophysics Data System (ADS)

Kao, Chiu Yen; Osher, Stanley; Qian, Jianliang

2004-05-01

We propose a simple, fast sweeping method based on the Lax-Friedrichs monotone numerical Hamiltonian to approximate viscosity solutions of arbitrary static Hamilton-Jacobi equations in any number of spatial dimensions. By using the Lax-Friedrichs numerical Hamiltonian, we can easily obtain the solution at a specific grid point in terms of its neighbors, so that a Gauss-Seidel type nonlinear iterative method can be utilized. Furthermore, by incorporating a group-wise causality principle into the Gauss-Seidel iteration by following a finite group of characteristics, we have an easy-to-implement, sweeping-type, and fast convergent numerical method. However, unlike other methods based on the Godunov numerical Hamiltonian, some computational boundary conditions are needed in the implementation. We give a simple recipe which enforces a version of discrete min-max principle. Some convergence analysis is done for the one-dimensional eikonal equation. Extensive 2-D and 3-D numerical examples illustrate the efficiency and accuracy of the new approach. To our knowledge, this is the first fast numerical method based on discretizing the Hamilton-Jacobi equation directly without assuming convexity and/or homogeneity of the Hamiltonian.

Cell-Averaged discretization for incompressible Navier-Stokes with embedded boundaries and locally refined Cartesian meshes: a high-order finite volume approach

NASA Astrophysics Data System (ADS)

Bhalla, Amneet Pal Singh; Johansen, Hans; Graves, Dan; Martin, Dan; Colella, Phillip; Applied Numerical Algorithms Group Team

2017-11-01

We present a consistent cell-averaged discretization for incompressible Navier-Stokes equations on complex domains using embedded boundaries. The embedded boundary is allowed to freely cut the locally-refined background Cartesian grid. Implicit-function representation is used for the embedded boundary, which allows us to convert the required geometric moments in the Taylor series expansion (upto arbitrary order) of polynomials into an algebraic problem in lower dimensions. The computed geometric moments are then used to construct stencils for various operators like the Laplacian, divergence, gradient, etc., by solving a least-squares system locally. We also construct the inter-level data-transfer operators like prolongation and restriction for multi grid solvers using the same least-squares system approach. This allows us to retain high-order of accuracy near coarse-fine interface and near embedded boundaries. Canonical problems like Taylor-Green vortex flow and flow past bluff bodies will be presented to demonstrate the proposed method. U.S. Department of Energy, Office of Science, ASCR (Award Number DE-AC02-05CH11231).

A statistical learning approach to the modeling of chromatographic retention of oligonucleotides incorporating sequence and secondary structure data

PubMed Central

Sturm, Marc; Quinten, Sascha; Huber, Christian G.; Kohlbacher, Oliver

2007-01-01

We propose a new model for predicting the retention time of oligonucleotides. The model is based on ν support vector regression using features derived from base sequence and predicted secondary structure of oligonucleotides. Because of the secondary structure information, the model is applicable even at relatively low temperatures where the secondary structure is not suppressed by thermal denaturing. This makes the prediction of oligonucleotide retention time for arbitrary temperatures possible, provided that the target temperature lies within the temperature range of the training data. We describe different possibilities of feature calculation from base sequence and secondary structure, present the results and compare our model to existing models. PMID:17567619

Programming and Reprogramming Sequence Timing Following High and Low Contextual Interference Practice

ERIC Educational Resources Information Center

Wright, David L.; Magnuson, Curt E.; Black, Charles B.

2005-01-01

Individuals practiced two unique discrete sequence production tasks that differed in their relative time profile in either a blocked or random practice schedule. Each participant was subsequently administered a "precuing" protocol to examine the cost of initially compiling or modifying the plan for an upcoming movement's relative timing. The…

A minimal model of an autonomous thermal motor

NASA Astrophysics Data System (ADS)

Fogedby, Hans C.; Imparato, Alberto

2017-09-01

We consider a model of a Brownian motor composed of two coupled overdamped degrees of freedom moving in periodic potentials and driven by two heat reservoirs. This model exhibits a spontaneous breaking of symmetry and gives rise to directed transport in the case of a non-vanishing interparticle interaction strength. For strong coupling between the particles we derive an expression for the propagation velocity valid for arbitrary periodic potentials. In the limit of strong coupling the model is equivalent to the Büttiker-Landauer model for a single particle diffusing in an environment with position-dependent temperature. By using numerical calculations of the Fokker-Planck equation and simulations of the Langevin equations we study the model for arbitrary coupling, retrieving many features of the strong-coupling limit. In particular, directed transport emerges even for symmetric potentials. For distinct heat reservoirs the heat currents are well-defined quantities allowing a study of the motor efficiency. We show that the optimal working regime occurs for moderate coupling. Finally, we introduce a model with discrete phase space which captures the essential features of the continuous model, can be solved in the limit of weak coupling, and exhibits a larger efficiency than the continuous counterpart.

PAN AIR: A computer program for predicting subsonic or supersonic linear potential flows about arbitrary configurations using a higher order panel method. Volume 1: Theory document (version 3.0)

NASA Technical Reports Server (NTRS)

Epton, Michael A.; Magnus, Alfred E.

1990-01-01

An outline of the derivation of the differential equation governing linear subsonic and supersonic potential flow is given. The use of Green's Theorem to obtain an integral equation over the boundary surface is discussed. The engineering techniques incorporated in the Panel Aerodynamics (PAN AIR) program (a discretization method which solves the integral equation for arbitrary first order boundary conditions) are then discussed in detail. Items discussed include the construction of the compressibility transformation, splining techniques, imposition of the boundary conditions, influence coefficient computation (including the concept of the finite part of an integral), computation of pressure coefficients, and computation of forces and moments. Principal revisions to version 3.0 are the following: (1) appendices H and K more fully describe the Aerodynamic Influence Coefficient (AIC) construction; (2) appendix L now provides a complete description of the AIC solution process; (3) appendix P is new and discusses the theory for the new FDP module (which calculates streamlines and offbody points); and (4) numerous small corrections and revisions reflecting the MAG module rewrite.

A Fictitious Domain Method for Resolving the Interaction of Blood Flow with Clot Growth

NASA Astrophysics Data System (ADS)

Mukherjee, Debanjan; Shadden, Shawn

2016-11-01

Thrombosis and thrombo-embolism cause a range of diseases including heart attack and stroke. Closer understanding of clot and blood flow mechanics provides valuable insights on the etiology, diagnosis, and treatment of thrombotic diseases. Such mechanics are complicated, however, by the discrete and multi-scale phenomena underlying thrombosis, and the complex interactions of unsteady, pulsatile hemodynamics with a clot of arbitrary shape and microstructure. We have developed a computational technique, based on a fictitious domain based finite element method, to study these interactions. The method can resolve arbitrary clot geometries, and dynamically couple fluid flow with static or growing clot boundaries. Macroscopic thrombus-hemodynamics interactions were investigated within idealized vessel geometries representative of the common carotid artery, with realistic unsteady flow profiles as inputs. The method was also employed successfully to resolve micro-scale interactions using a model driven by in-vivo morphology data. The results provide insights into the flow structures and hemodynamic loading around an arbitrarily grown clot at arterial length-scales, as well as flow and transport within the interstices of platelet aggregates composing the clot. The work was supported by AHA Award No: 16POST27500023.

FDD Massive MIMO Channel Estimation With Arbitrary 2D-Array Geometry

NASA Astrophysics Data System (ADS)

Dai, Jisheng; Liu, An; Lau, Vincent K. N.

2018-05-01

This paper addresses the problem of downlink channel estimation in frequency-division duplexing (FDD) massive multiple-input multiple-output (MIMO) systems. The existing methods usually exploit hidden sparsity under a discrete Fourier transform (DFT) basis to estimate the cdownlink channel. However, there are at least two shortcomings of these DFT-based methods: 1) they are applicable to uniform linear arrays (ULAs) only, since the DFT basis requires a special structure of ULAs, and 2) they always suffer from a performance loss due to the leakage of energy over some DFT bins. To deal with the above shortcomings, we introduce an off-grid model for downlink channel sparse representation with arbitrary 2D-array antenna geometry, and propose an efficient sparse Bayesian learning (SBL) approach for the sparse channel recovery and off-grid refinement. The main idea of the proposed off-grid method is to consider the sampled grid points as adjustable parameters. Utilizing an in-exact block majorization-minimization (MM) algorithm, the grid points are refined iteratively to minimize the off-grid gap. Finally, we further extend the solution to uplink-aided channel estimation by exploiting the angular reciprocity between downlink and uplink channels, which brings enhanced recovery performance.

A point-centered arbitrary Lagrangian Eulerian hydrodynamic approach for tetrahedral meshes

DOE PAGES

Morgan, Nathaniel R.; Waltz, Jacob I.; Burton, Donald E.; ...

2015-02-24

We present a three dimensional (3D) arbitrary Lagrangian Eulerian (ALE) hydrodynamic scheme suitable for modeling complex compressible flows on tetrahedral meshes. The new approach stores the conserved variables (mass, momentum, and total energy) at the nodes of the mesh and solves the conservation equations on a control volume surrounding the point. This type of an approach is termed a point-centered hydrodynamic (PCH) method. The conservation equations are discretized using an edge-based finite element (FE) approach with linear basis functions. All fluxes in the new approach are calculated at the center of each tetrahedron. A multidirectional Riemann-like problem is solved atmore » the center of the tetrahedron. The advective fluxes are calculated by solving a 1D Riemann problem on each face of the nodal control volume. A 2-stage Runge–Kutta method is used to evolve the solution forward in time, where the advective fluxes are part of the temporal integration. The mesh velocity is smoothed by solving a Laplacian equation. The details of the new ALE hydrodynamic scheme are discussed. Results from a range of numerical test problems are presented.« less

Manipulation of quantum evolution

NASA Technical Reports Server (NTRS)

Cabera, David Jose Fernandez; Mielnik, Bogdan

1994-01-01

The free evolution of a non-relativistic charged particle is manipulated using time-dependent magnetic fields. It is shown that the application of a programmed sequence of magnetic pulses can invert the free evolution process, forcing an arbitrary wave packet to 'go back in time' to recover its past shape. The possibility of more general operations upon the Schrodinger wave packet is discussed.

Arbitrary-ratio power splitter based on nonlinear multimode interference coupler

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tajaldini, Mehdi; Young Researchers and Elite Club, Baft Branch, Islamic Azad University, Baft; Jafri, Mohd Zubir Mat

2015-04-24

We propose an ultra-compact multimode interference (MMI) power splitter based on nonlinear effects from simulations using nonlinear modal propagation analysis (NMPA) cooperation with finite difference Method (FDM) to access free choice of splitting ratio. Conventional multimode interference power splitter could only obtain a few discrete ratios. The power splitting ratio may be adjusted continuously while the input set power is varying by a tunable laser. In fact, using an ultra- compact MMI with a simple structure that is launched by a tunable nonlinear input fulfills the problem of arbitrary-ratio in integrated photonics circuits. Silicon on insulator (SOI) is used asmore » the offered material due to the high contrast refractive index and Centro symmetric properties. The high-resolution images at the end of the multimode waveguide in the simulated power splitter have a high power balance, whereas access to a free choice of splitting ratio is not possible under the linear regime in the proposed length range except changes in the dimension for any ratio. The compact dimensions and ideal performance of the device are established according to optimized parameters. The proposed regime can be extended to the design of M×N arbitrary power splitters ratio for programmable logic devices in all optical digital signal processing. The results of this study indicate that nonlinear modal propagation analysis solves the miniaturization problem for all-optical devices based on MMI couplers to achieve multiple functions in a compact planar integrated circuit and also overcomes the limitations of previously proposed methods for nonlinear MMI.« less

Permeability Sensitivity Functions and Rapid Simulation of Hydraulic-Testing Measurements Using Perturbation Theory

NASA Astrophysics Data System (ADS)

Escobar Gómez, J. D.; Torres-Verdín, C.

2018-03-01

Single-well pressure-diffusion simulators enable improved quantitative understanding of hydraulic-testing measurements in the presence of arbitrary spatial variations of rock properties. Simulators of this type implement robust numerical algorithms which are often computationally expensive, thereby making the solution of the forward modeling problem onerous and inefficient. We introduce a time-domain perturbation theory for anisotropic permeable media to efficiently and accurately approximate the transient pressure response of spatially complex aquifers. Although theoretically valid for any spatially dependent rock/fluid property, our single-phase flow study emphasizes arbitrary spatial variations of permeability and anisotropy, which constitute key objectives of hydraulic-testing operations. Contrary to time-honored techniques, the perturbation method invokes pressure-flow deconvolution to compute the background medium's permeability sensitivity function (PSF) with a single numerical simulation run. Subsequently, the first-order term of the perturbed solution is obtained by solving an integral equation that weighs the spatial variations of permeability with the spatial-dependent and time-dependent PSF. Finally, discrete convolution transforms the constant-flow approximation to arbitrary multirate conditions. Multidimensional numerical simulation studies for a wide range of single-well field conditions indicate that perturbed solutions can be computed in less than a few CPU seconds with relative errors in pressure of <5%, corresponding to perturbations in background permeability of up to two orders of magnitude. Our work confirms that the proposed joint perturbation-convolution (JPC) method is an efficient alternative to analytical and numerical solutions for accurate modeling of pressure-diffusion phenomena induced by Neumann or Dirichlet boundary conditions.

Classification of Particle Numbers with Unique Heitmann-Radin Minimizer

NASA Astrophysics Data System (ADS)

De Luca, Lucia; Friesecke, Gero

2017-06-01

We show that minimizers of the Heitmann-Radin energy (Heitmann and Radin in J Stat Phys 22(3):281-287, 1980) are unique if and only if the particle number N belongs to an infinite sequence whose first thirty-five elements are 1, 2, 3, 4, 5, 7, 8, 10, 12, 14, 16, 19, 21, 24, 27, 30, 33, 37, 40, 44, 48, 52, 56, 61, 65, 70, 75, 80, 85, 91, 96, 102, 108, 114, 120 (see the paper for a closed-form description of this sequence). The proof relies on the discrete differential geometry techniques introduced in De Luca and Friesecke (Crystallization in two dimensions and a discrete Gauss-Bonnet Theorem, 2016).

Neural-network-designed pulse sequences for robust control of singlet-triplet qubits

NASA Astrophysics Data System (ADS)

Yang, Xu-Chen; Yung, Man-Hong; Wang, Xin

2018-04-01

Composite pulses are essential for universal manipulation of singlet-triplet spin qubits. In the absence of noise, they are required to perform arbitrary single-qubit operations due to the special control constraint of a singlet-triplet qubit, while in a noisy environment, more complicated sequences have been developed to dynamically correct the error. Tailoring these sequences typically requires numerically solving a set of nonlinear equations. Here we demonstrate that these pulse sequences can be generated by a well-trained, double-layer neural network. For sequences designed for the noise-free case, the trained neural network is capable of producing almost exactly the same pulses known in the literature. For more complicated noise-correcting sequences, the neural network produces pulses with slightly different line shapes, but the robustness against noises remains comparable. These results indicate that the neural network can be a judicious and powerful alternative to existing techniques in developing pulse sequences for universal fault-tolerant quantum computation.

Modeling Electrokinetic Flows by the Smoothed Profile Method

PubMed Central

Luo, Xian; Beskok, Ali; Karniadakis, George Em

2010-01-01

We propose an efficient modeling method for electrokinetic flows based on the Smoothed Profile Method (SPM) [1–4] and spectral element discretizations. The new method allows for arbitrary differences in the electrical conductivities between the charged surfaces and the the surrounding electrolyte solution. The electrokinetic forces are included into the flow equations so that the Poisson-Boltzmann and electric charge continuity equations are cast into forms suitable for SPM. The method is validated by benchmark problems of electroosmotic flow in straight channels and electrophoresis of charged cylinders. We also present simulation results of electrophoresis of charged microtubules, and show that the simulated electrophoretic mobility and anisotropy agree with the experimental values. PMID:20352076

A new class of exact solutions of the Klein-Gordon equation of a charged particle interacting with an electromagnetic plane wave in a medium

NASA Astrophysics Data System (ADS)

Varró, Sándor

2014-01-01

Exact solutions are presented of the Klein-Gordon equation of a charged particle moving in a transverse monochromatic plasmon wave of arbitrary high amplitude, which propagates in an underdense plasma. These solutions are expressed in terms of Ince polynomials, forming a doubly infinite set, parametrized by discrete momentum components of the charged particle’s de Broglie wave along the polarization vector and along the propagation direction of the plasmon radiation. The envelope of the exact wavefunctions describes a high-contrast periodic structure of the particle density on the plasma length scale, which may have relevance in novel particle acceleration mechanisms.

Continuous variable quantum key distribution with a real local oscillator using simultaneous pilot signals.

PubMed

Kleis, Sebastian; Rueckmann, Max; Schaeffer, Christian G

2017-04-15

In this Letter, we propose a novel implementation of continuous variable quantum key distribution that operates with a real local oscillator placed at the receiver site. In addition, pulsing of the continuous wave laser sources is not required, leading to an extraordinary practical and secure setup. It is suitable for arbitrary schemes based on modulated coherent states and heterodyne detection. The shown results include transmission experiments, as well as an excess noise analysis applying a discrete 8-state phase modulation. Achievable key rates under collective attacks are estimated. The results demonstrate the high potential of the approach to achieve high secret key rates at relatively low effort and cost.

Generation of Synthetic Spike Trains with Defined Pairwise Correlations

PubMed Central

Niebur, Ernst

2008-01-01

Recent technological advances as well as progress in theoretical understanding of neural systems have created a need for synthetic spike trains with controlled mean rate and pairwise cross-correlation. This report introduces and analyzes a novel algorithm for the generation of discretized spike trains with arbitrary mean rates and controlled cross correlation. Pairs of spike trains with any pairwise correlation can be generated, and higher-order correlations are compatible with common synaptic input. Relations between allowable mean rates and correlations within a population are discussed. The algorithm is highly efficient, its complexity increasing linearly with the number of spike trains generated and therefore inversely with the number of cross-correlated pairs. PMID:17521277

Analytical solution for a class of network dynamics with mechanical and financial applications

NASA Astrophysics Data System (ADS)

Krejčí, P.; Lamba, H.; Melnik, S.; Rachinskii, D.

2014-09-01

We show that for a certain class of dynamics at the nodes the response of a network of any topology to arbitrary inputs is defined in a simple way by its response to a monotone input. The nodes may have either a discrete or continuous set of states and there is no limit on the complexity of the network. The results provide both an efficient numerical method and the potential for accurate analytic approximation of the dynamics on such networks. As illustrative applications, we introduce a quasistatic mechanical model with objects interacting via frictional forces and a financial market model with avalanches and critical behavior that are generated by momentum trading strategies.

An Enriched Shell Element for Delamination Simulation in Composite Laminates

NASA Technical Reports Server (NTRS)

McElroy, Mark

2015-01-01

A formulation is presented for an enriched shell finite element capable of delamination simulation in composite laminates. The element uses an adaptive splitting approach for damage characterization that allows for straightforward low-fidelity model creation and a numerically efficient solution. The Floating Node Method is used in conjunction with the Virtual Crack Closure Technique to predict delamination growth and represent it discretely at an arbitrary ply interface. The enriched element is verified for Mode I delamination simulation using numerical benchmark data. After determining important mesh configuration guidelines for the vicinity of the delamination front in the model, a good correlation was found between the enriched shell element model results and the benchmark data set.

An Isomorphism between Lyapunov Exponents and Shannon's Channel Capacity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Friedland, Gerald; Metere, Alfredo

We demonstrate that discrete Lyapunov exponents are isomorphic to numeric overflows of the capacity of an arbitrary noiseless and memoryless channel in a Shannon communication model with feedback. The isomorphism allows the understanding of Lyapunov exponents in terms of Information Theory, rather than the traditional definitions in chaos theory. The result also implies alternative approaches to the calculation of related quantities, such as the Kolmogorov Sinai entropy which has been linked to thermodynamic entropy. This work provides a bridge between fundamental physics and information theory. It suggests, among other things, that machine learning and other information theory methods can bemore » employed at the core of physics simulations.« less

First-Principles Modeling Of Electromagnetic Scattering By Discrete and Discretely Heterogeneous Random Media

NASA Technical Reports Server (NTRS)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2016-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell's equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell- Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell-Lorentz equations, we trace the development of the first principles formalism enabling accurate calculations of monochromatic and quasi-monochromatic scattering by static and randomly varying multiparticle groups. We illustrate how this general framework can be coupled with state-of-the-art computer solvers of the Maxwell equations and applied to direct modeling of electromagnetic scattering by representative random multi-particle groups with arbitrary packing densities. This first-principles modeling yields general physical insights unavailable with phenomenological approaches. We discuss how the first-order-scattering approximation, the radiative transfer theory, and the theory of weak localization of electromagnetic waves can be derived as immediate corollaries of the Maxwell equations for very specific and well-defined kinds of particulate medium. These recent developments confirm the mesoscopic origin of the radiative transfer, weak localization, and effective-medium regimes and help evaluate the numerical accuracy of widely used approximate modeling methodologies.

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media.

PubMed

Mishchenko, Michael I; Dlugach, Janna M; Yurkin, Maxim A; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R Lee; Travis, Larry D; Yang, Ping; Zakharova, Nadezhda T

2016-05-16

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ , or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell's equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell-Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell-Lorentz equations, we trace the development of the first-principles formalism enabling accurate calculations of monochromatic and quasi-monochromatic scattering by static and randomly varying multiparticle groups. We illustrate how this general framework can be coupled with state-of-the-art computer solvers of the Maxwell equations and applied to direct modeling of electromagnetic scattering by representative random multi-particle groups with arbitrary packing densities. This first-principles modeling yields general physical insights unavailable with phenomenological approaches. We discuss how the first-order-scattering approximation, the radiative transfer theory, and the theory of weak localization of electromagnetic waves can be derived as immediate corollaries of the Maxwell equations for very specific and well-defined kinds of particulate medium. These recent developments confirm the mesoscopic origin of the radiative transfer, weak localization, and effective-medium regimes and help evaluate the numerical accuracy of widely used approximate modeling methodologies.

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

PubMed Central

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2018-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development of the first-principles formalism enabling accurate calculations of monochromatic and quasi-monochromatic scattering by static and randomly varying multiparticle groups. We illustrate how this general framework can be coupled with state-of-the-art computer solvers of the Maxwell equations and applied to direct modeling of electromagnetic scattering by representative random multi-particle groups with arbitrary packing densities. This first-principles modeling yields general physical insights unavailable with phenomenological approaches. We discuss how the first-order-scattering approximation, the radiative transfer theory, and the theory of weak localization of electromagnetic waves can be derived as immediate corollaries of the Maxwell equations for very specific and well-defined kinds of particulate medium. These recent developments confirm the mesoscopic origin of the radiative transfer, weak localization, and effective-medium regimes and help evaluate the numerical accuracy of widely used approximate modeling methodologies. PMID:29657355

Numerical Solution of Optimal Control Problem under SPDE Constraints

DTIC Science & Technology

2011-10-14

Faure and Sobol sequences are used to evaluate high dimensional integrals, and the errors in the numerical results for over 30 dimensions become quite...sequence; right: 1000 points of dimension 26 and 27 projection for optimal Kronecker sequence. benchmark Faure and Sobol methods. 2.2 High order...J. Goodman and J. O’Rourke, Handbook of discrete and computational geome- try, CRC Press, Inc., (2004). [5] S. Joe and F. Kuo, Constructing Sobol

Identification of Novel Growth Regulators in Plant Populations Expressing Random Peptides1[OPEN

PubMed Central

Bao, Zhilong; Clancy, Maureen A.

2017-01-01

The use of chemical genomics approaches allows the identification of small molecules that integrate into biological systems, thereby changing discrete processes that influence growth, development, or metabolism. Libraries of chemicals are applied to living systems, and changes in phenotype are observed, potentially leading to the identification of new growth regulators. This work describes an approach that is the nexus of chemical genomics and synthetic biology. Here, each plant in an extensive population synthesizes a unique small peptide arising from a transgene composed of a randomized nucleic acid sequence core flanked by translational start, stop, and cysteine-encoding (for disulfide cyclization) sequences. Ten and 16 amino acid sequences, bearing a core of six and 12 random amino acids, have been synthesized in Arabidopsis (Arabidopsis thaliana) plants. Populations were screened for phenotypes from the seedling stage through senescence. Dozens of phenotypes were observed in over 2,000 plants analyzed. Ten conspicuous phenotypes were verified through separate transformation and analysis of multiple independent lines. The results indicate that these populations contain sequences that often influence discrete aspects of plant biology. Novel peptides that affect photosynthesis, flowering, and red light response are described. The challenge now is to identify the mechanistic integrations of these peptides into biochemical processes. These populations serve as a new tool to identify small molecules that modulate discrete plant functions that could be produced later in transgenic plants or potentially applied exogenously to impart their effects. These findings could usher in a new generation of agricultural growth regulators, herbicides, or defense compounds. PMID:28807931

A discrete Fourier transform for virtual memory machines

NASA Technical Reports Server (NTRS)

Galant, David C.

1992-01-01

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

A modal approach based on perfectly matched layers for the forced response of elastic open waveguides

NASA Astrophysics Data System (ADS)

Gallezot, M.; Treyssède, F.; Laguerre, L.

2018-03-01

This paper investigates the computation of the forced response of elastic open waveguides with a numerical modal approach based on perfectly matched layers (PML). With a PML of infinite thickness, the solution can theoretically be expanded as a discrete sum of trapped modes, a discrete sum of leaky modes and a continuous sum of radiation modes related to the PML branch cuts. Yet with numerical methods (e.g. finite elements), the waveguide cross-section is discretized and the PML must be truncated to a finite thickness. This truncation transforms the continuous sum into a discrete set of PML modes. To guarantee the uniqueness of the numerical solution of the forced response problem, an orthogonality relationship is proposed. This relationship is applicable to any type of modes (trapped, leaky and PML modes) and hence allows the numerical solution to be expanded on a discrete sum in a convenient manner. This also leads to an expression for the modal excitability valid for leaky modes. The physical relevance of each type of mode for the solution is clarified through two numerical test cases, a homogeneous medium and a circular bar waveguide example, excited by a point source. The former is favourably compared to a transient analytical solution, showing that PML modes reassemble the bulk wave contribution in a homogeneous medium. The latter shows that the PML mode contribution yields the long-term diffraction phenomenon whereas the leaky mode contribution prevails closer to the source. The leaky mode contribution is shown to remain accurate even with a relatively small PML thickness, hence reducing the computational cost. This is of particular interest for solving three-dimensional waveguide problems, involving two-dimensional cross-sections of arbitrary shapes. Such a problem is handled in a third numerical example by considering a buried square bar.

Optimizing the sequence of diameter distributions and selection harvests for uneven-aged stand management

Treesearch

Robert G. Haight; J. Douglas Brodie; Darius M. Adams

1985-01-01

The determination of an optimal sequence of diameter distributions and selection harvests for uneven-aged stand management is formulated as a discrete-time optimal-control problem with bounded control variables and free-terminal point. An efficient programming technique utilizing gradients provides solutions that are stable and interpretable on the basis of economic...

Corrected score estimation in the proportional hazards model with misclassified discrete covariates

PubMed Central

Zucker, David M.; Spiegelman, Donna

2013-01-01

SUMMARY We consider Cox proportional hazards regression when the covariate vector includes error-prone discrete covariates along with error-free covariates, which may be discrete or continuous. The misclassification in the discrete error-prone covariates is allowed to be of any specified form. Building on the work of Nakamura and his colleagues, we present a corrected score method for this setting. The method can handle all three major study designs (internal validation design, external validation design, and replicate measures design), both functional and structural error models, and time-dependent covariates satisfying a certain ‘localized error’ condition. We derive the asymptotic properties of the method and indicate how to adjust the covariance matrix of the regression coefficient estimates to account for estimation of the misclassification matrix. We present the results of a finite-sample simulation study under Weibull survival with a single binary covariate having known misclassification rates. The performance of the method described here was similar to that of related methods we have examined in previous works. Specifically, our new estimator performed as well as or, in a few cases, better than the full Weibull maximum likelihood estimator. We also present simulation results for our method for the case where the misclassification probabilities are estimated from an external replicate measures study. Our method generally performed well in these simulations. The new estimator has a broader range of applicability than many other estimators proposed in the literature, including those described in our own earlier work, in that it can handle time-dependent covariates with an arbitrary misclassification structure. We illustrate the method on data from a study of the relationship between dietary calcium intake and distal colon cancer. PMID:18219700

Lithostratigraphic controls on bedding-plane fractures and the potential for discrete groundwater flow through a siliciclastic sandstone aquifer, southern Wisconsin

NASA Astrophysics Data System (ADS)

Swanson, Susan K.

2007-04-01

Outcrop-analog studies of the Upper Cambrian Tunnel City Group sandstones in southern Wisconsin show the utility of lithostratigraphic information in hydrostratigraphic studies of siliciclastic sandstone aquifers. Recent work supports the lateral continuity of discrete groundwater flow through these sandstones. Lithologic description of the Reno Member of the Lone Rock Formation (Tunnel City Group) in outcrop and core reveals repeating sequences of three dominant lithofacies, including flat-pebble intraclast conglomerate with a glauconite-rich matrix; glauconitic and feldspathic subquartzose sandstone with horizontal-planar, low-angle, and hummocky lamination; and feldspathic subquartzose sandstone with dolomite-filled burrows. The vertically stacked Reno Member sequences have been interpreted as having a storm-related origin, and they are laterally continuous on the scale of an outcrop. Horizontal fracture locations correlate with bedding planes at contacts between lithofacies. They are most commonly associated with the base of the flat-pebble intraclast conglomerate or with partings along laminae and erosional surfaces in the laminated subquartzose sandstone lithofacies. Sequences show upward increases in natural gamma radiation due to increasing potassium feldspar content. The incorporation of the detailed lithostratigraphic information allows a more accurate interpretation of borehole natural gamma logs where the rocks are buried and saturated and clarifies the role of sedimentary structures in the distribution of features that might promote discrete flow through these rocks.

Markov-modulated Markov chains and the covarion process of molecular evolution.

PubMed

Galtier, N; Jean-Marie, A

2004-01-01

The covarion (or site specific rate variation, SSRV) process of biological sequence evolution is a process by which the evolutionary rate of a nucleotide/amino acid/codon position can change in time. In this paper, we introduce time-continuous, space-discrete, Markov-modulated Markov chains as a model for representing SSRV processes, generalizing existing theory to any model of rate change. We propose a fast algorithm for diagonalizing the generator matrix of relevant Markov-modulated Markov processes. This algorithm makes phylogeny likelihood calculation tractable even for a large number of rate classes and a large number of states, so that SSRV models become applicable to amino acid or codon sequence datasets. Using this algorithm, we investigate the accuracy of the discrete approximation to the Gamma distribution of evolutionary rates, widely used in molecular phylogeny. We show that a relatively large number of classes is required to achieve accurate approximation of the exact likelihood when the number of analyzed sequences exceeds 20, both under the SSRV and among site rate variation (ASRV) models.

Investigation and appreciation of optimal output feedback. Volume 1: A convergent algorithm for the stochastic infinite-time discrete optimal output feedback problem

NASA Technical Reports Server (NTRS)

Halyo, N.; Broussard, J. R.

1984-01-01

The stochastic, infinite time, discrete output feedback problem for time invariant linear systems is examined. Two sets of sufficient conditions for the existence of a stable, globally optimal solution are presented. An expression for the total change in the cost function due to a change in the feedback gain is obtained. This expression is used to show that a sequence of gains can be obtained by an algorithm, so that the corresponding cost sequence is monotonically decreasing and the corresponding sequence of the cost gradient converges to zero. The algorithm is guaranteed to obtain a critical point of the cost function. The computational steps necessary to implement the algorithm on a computer are presented. The results are applied to a digital outer loop flight control problem. The numerical results for this 13th order problem indicate a rate of convergence considerably faster than two other algorithms used for comparison.

Discrete-continuous variable structural synthesis using dual methods

NASA Technical Reports Server (NTRS)

Schmit, L. A.; Fleury, C.

1980-01-01

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

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

NASA Astrophysics Data System (ADS)

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

2018-07-01

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

Automatic Astrometric and Photometric Calibration with SCAMP

NASA Astrophysics Data System (ADS)

Bertin, E.

2006-07-01

Astrometric and photometric calibrations have remained the most tiresome step in the reduction of large imaging surveys. I present a new software package, SCAMP which has been written to address this problem. SCAMP efficiently computes accurate astrometric and photometric solutions for any arbitrary sequence of FITS images in a completely automatic way. SCAMP is released under the GNU General Public Licence.

Intentional Control and Operational Constraints in Prosodic Phrasing: A Study of Picture-Elicited Narrations by French Children

ERIC Educational Resources Information Center

Vion, Monique; Colas, Annie

2009-01-01

This study deals with the determinants of prosodic phrasing in French schoolchildren's narratives. Children (aged 7 to 11) told picture stories to a silent same-age peer. The establishment of temporal and/or causal relations between the events was more or less guided by the drawings (ordered vs. arbitrary sequences). The comprehension of the…

Arbitrary and semantic associations in subjective memory impairment and amnestic mild cognitive impairment among Taiwanese individuals: A cross-sectional study.

PubMed

Chang, Hsin-Te; Chen, Ta-Fu; Cheng, Ting-Wen; Lai, Ya-Mei; Hua, Mau-Sun

2018-05-01

Researchers have recently proposed a preclinical stage of dementia of Alzheimer's type (DAT), referred to as subjective memory impairment (SMI), with the aim of developing methods for the early detection of DAT and subsequent intervention. It has been proposed that the objective memory functions of individuals with SMI are normal; however, arbitrary and semantic associations are both used to describe the processes of memory. No previous studies have investigated these processes among individuals with SMI. Cross-sectional analysis was used to compare the memory function of individuals with SMI, amnestic mild cognitive impairment (aMCI), or DAT. One hundred and eighty-three participants were recruited from the Memory Clinic of National Taiwan University Hospital and communities in northern Taiwan, including individuals with no memory complaints (HC, n = 30) and individuals with SMI (n = 61), aMCI-single domain (n = 24), aMCI-multiple domain (n = 33), or DAT (n = 35). The Word Sequence Learning Test (WSLT) was used to assess the formation of arbitrary associations and the Logical Memory subtest of the Wechsler Memory Scale-Third Edition was used to assess the formation of semantic associations. Compared to the HC group, the SMI group performed poorly only on the WSLT, whereas the other groups performed poorly on both of the memory tasks. This study demonstrated that SMI individuals tend to perform poorly in the formation of arbitrary associations. Our findings suggest that tasks requiring arbitrary associations may provide greater sensitivity in the detection cognitive changes associated with preclinical DAT. Copyright © 2017. Published by Elsevier B.V.

Extracting full-field dynamic strain on a wind turbine rotor subjected to arbitrary excitations using 3D point tracking and a modal expansion technique

NASA Astrophysics Data System (ADS)

Baqersad, Javad; Niezrecki, Christopher; Avitabile, Peter

2015-09-01

Health monitoring of rotating structures such as wind turbines and helicopter rotors is generally performed using conventional sensors that provide a limited set of data at discrete locations near or on the hub. These sensors usually provide no data on the blades or inside them where failures might occur. Within this paper, an approach was used to extract the full-field dynamic strain on a wind turbine assembly subject to arbitrary loading conditions. A three-bladed wind turbine having 2.3-m long blades was placed in a semi-built-in boundary condition using a hub, a machining chuck, and a steel block. For three different test cases, the turbine was excited using (1) pluck testing, (2) random impacts on blades with three impact hammers, and (3) random excitation by a mechanical shaker. The response of the structure to the excitations was measured using three-dimensional point tracking. A pair of high-speed cameras was used to measure displacement of optical targets on the structure when the blades were vibrating. The measured displacements at discrete locations were expanded and applied to the finite element model of the structure to extract the full-field dynamic strain. The results of the paper show an excellent correlation between the strain predicted using the proposed approach and the strain measured with strain-gages for each of the three loading conditions. The approach used in this paper to predict the strain showed higher accuracy than the digital image correlation technique. The new expansion approach is able to extract dynamic strain all over the entire structure, even inside the structure beyond the line of sight of the measurement system. Because the method is based on a non-contacting measurement approach, it can be readily applied to a variety of structures having different boundary and operating conditions, including rotating blades.

Classification of topological insulators and superconductors in three spatial dimensions

NASA Astrophysics Data System (ADS)

Schnyder, Andreas P.; Ryu, Shinsei; Furusaki, Akira; Ludwig, Andreas W. W.

2008-11-01

We systematically study topological phases of insulators and superconductors (or superfluids) in three spatial dimensions. We find that there exist three-dimensional (3D) topologically nontrivial insulators or superconductors in five out of ten symmetry classes introduced in seminal work by Altland and Zirnbauer within the context of random matrix theory, more than a decade ago. One of these is the recently introduced Z2 topological insulator in the symplectic (or spin-orbit) symmetry class. We show that there exist precisely four more topological insulators. For these systems, all of which are time-reversal invariant in three dimensions, the space of insulating ground states satisfying certain discrete symmetry properties is partitioned into topological sectors that are separated by quantum phase transitions. Three of the above five topologically nontrivial phases can be realized as time-reversal invariant superconductors. In these the different topological sectors are characterized by an integer winding number defined in momentum space. When such 3D topological insulators are terminated by a two-dimensional surface, they support a number (which may be an arbitrary nonvanishing even number for singlet pairing) of Dirac fermion (Majorana fermion when spin-rotation symmetry is completely broken) surface modes which remain gapless under arbitrary perturbations of the Hamiltonian that preserve the characteristic discrete symmetries, including disorder. In particular, these surface modes completely evade Anderson localization from random impurities. These topological phases can be thought of as three-dimensional analogs of well-known paired topological phases in two spatial dimensions such as the spinless chiral (px±ipy) -wave superconductor (or Moore-Read Pfaffian state). In the corresponding topologically nontrivial (analogous to “weak pairing”) and topologically trivial (analogous to “strong pairing”) 3D phases, the wave functions exhibit markedly distinct behavior. When an electromagnetic U(1) gauge field and fluctuations of the gap functions are included in the dynamics, the superconducting phases with nonvanishing winding number possess nontrivial topological ground-state degeneracies.

cgDNAweb: a web interface to the cgDNA sequence-dependent coarse-grain model of double-stranded DNA.

PubMed

De Bruin, Lennart; Maddocks, John H

2018-06-14

The sequence-dependent statistical mechanical properties of fragments of double-stranded DNA is believed to be pertinent to its biological function at length scales from a few base pairs (or bp) to a few hundreds of bp, e.g. indirect read-out protein binding sites, nucleosome positioning sequences, phased A-tracts, etc. In turn, the equilibrium statistical mechanics behaviour of DNA depends upon its ground state configuration, or minimum free energy shape, as well as on its fluctuations as governed by its stiffness (in an appropriate sense). We here present cgDNAweb, which provides browser-based interactive visualization of the sequence-dependent ground states of double-stranded DNA molecules, as predicted by the underlying cgDNA coarse-grain rigid-base model of fragments with arbitrary sequence. The cgDNAweb interface is specifically designed to facilitate comparison between ground state shapes of different sequences. The server is freely available at cgDNAweb.epfl.ch with no login requirement.

Torque measurements reveal sequence-specific cooperative transitions in supercoiled DNA

PubMed Central

Oberstrass, Florian C.; Fernandes, Louis E.; Bryant, Zev

2012-01-01

B-DNA becomes unstable under superhelical stress and is able to adopt a wide range of alternative conformations including strand-separated DNA and Z-DNA. Localized sequence-dependent structural transitions are important for the regulation of biological processes such as DNA replication and transcription. To directly probe the effect of sequence on structural transitions driven by torque, we have measured the torsional response of a panel of DNA sequences using single molecule assays that employ nanosphere rotational probes to achieve high torque resolution. The responses of Z-forming d(pGpC)n sequences match our predictions based on a theoretical treatment of cooperative transitions in helical polymers. “Bubble” templates containing 50–100 bp mismatch regions show cooperative structural transitions similar to B-DNA, although less torque is required to disrupt strand–strand interactions. Our mechanical measurements, including direct characterization of the torsional rigidity of strand-separated DNA, establish a framework for quantitative predictions of the complex torsional response of arbitrary sequences in their biological context. PMID:22474350

Self-complementary circular codes in coding theory.

PubMed

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.

Universal scaling function in discrete time asymmetric exclusion processes

NASA Astrophysics Data System (ADS)

Chia, Nicholas; Bundschuh, Ralf

2005-03-01

In the universality class of the one dimensional Kardar-Parisi-Zhang surface growth, Derrida and Lebowitz conjectured the universality of not only the scaling exponents, but of an entire scaling function. Since Derrida and Lebowitz' original publication this universality has been verified for a variety of continuous time systems in the KPZ universality class. We study the Derrida-Lebowitz scaling function for multi-particle versions of the discrete time Asymmetric Exclusion Process. We find that in this discrete time system the Derrida-Lebowitz scaling function not only properly characterizes the large system size limit, but even accurately describes surprisingly small systems. These results have immediate applications in searching biological sequence databases.

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

PubMed

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

2018-01-19

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

Air-structure coupling features analysis of mining contra-rotating axial flow fan cascade

NASA Astrophysics Data System (ADS)

Chen, Q. G.; Sun, W.; Li, F.; Zhang, Y. J.

2013-12-01

The interaction between contra-rotating axial flow fan blade and working gas has been studied by means of establishing air-structure coupling control equation and combining Computational Fluid Dynamics (CFD) and Computational solid mechanics (CSM). Based on the single flow channel model, the Finite Volume Method was used to make the field discrete. Additionally, the SIMPLE algorithm, the Standard k-ε model and the Arbitrary Lagrangian-Eulerian dynamic grids technology were utilized to get the airflow motion by solving the discrete governing equations. At the same time, the Finite Element Method was used to make the field discrete to solve dynamic response characteristics of blade. Based on weak coupling method, data exchange from the fluid solver and the solid solver was processed on the coupling interface. Then interpolation was used to obtain the coupling characteristics. The results showed that the blade's maximum amplitude was on the tip of the last-stage blade and aerodynamic force signal could reflect the blade working conditions to some extent. By analyzing the flow regime in contra-rotating axial flow fan, it could be found that the vortex core region was mainly in the blade surface, the hub and the blade clearance. In those regions, the turbulence intensity was very high. The last-stage blade's operating life is shorter than that of the pre-stage blade due to the fatigue fracture occurs much more easily on the last-stage blade which bears more stress.

Large-amplitude nonlinear normal modes of the discrete sine lattices.

PubMed

Smirnov, Valeri V; Manevitch, Leonid I

2017-02-01

We present an analytical description of the large-amplitude stationary oscillations of the finite discrete system of harmonically coupled pendulums without any restrictions on their amplitudes (excluding a vicinity of π). Although this model has numerous applications in different fields of physics, it was studied earlier in the infinite limit only. The discrete chain with a finite length can be considered as a well analytical analog of the coarse-grain models of flexible polymers in the molecular dynamics simulations. The developed approach allows to find the dispersion relations for arbitrary amplitudes of the nonlinear normal modes. We emphasize that the long-wavelength approximation, which is described by well-known sine-Gordon equation, leads to an inadequate zone structure for the amplitudes of about π/2 even if the chain is long enough. An extremely complex zone structure at the large amplitudes corresponds to multiple resonances between nonlinear normal modes even with strongly different wave numbers. Due to the complexity of the dispersion relations the modes with shorter wavelengths may have smaller frequencies. The stability of the nonlinear normal modes under condition of the resonant interaction are discussed. It is shown that this interaction of the modes in the vicinity of the long wavelength edge of the spectrum leads to the localization of the oscillations. The thresholds of instability and localization are determined explicitly. The numerical simulation of the dynamics of a finite-length chain is in a good agreement with obtained analytical predictions.

Discrete diffusion Lyman α radiative transfer

NASA Astrophysics Data System (ADS)

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

2018-06-01

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

Digital simulation of an arbitrary stationary stochastic process by spectral representation.

PubMed

Yura, Harold T; Hanson, Steen G

2011-04-01

In this paper we present a straightforward, efficient, and computationally fast method for creating a large number of discrete samples with an arbitrary given probability density function and a specified spectral content. The method relies on initially transforming a white noise sample set of random Gaussian distributed numbers into a corresponding set with the desired spectral distribution, after which this colored Gaussian probability distribution is transformed via an inverse transform into the desired probability distribution. In contrast to previous work, where the analyses were limited to auto regressive and or iterative techniques to obtain satisfactory results, we find that a single application of the inverse transform method yields satisfactory results for a wide class of arbitrary probability distributions. Although a single application of the inverse transform technique does not conserve the power spectra exactly, it yields highly accurate numerical results for a wide range of probability distributions and target power spectra that are sufficient for system simulation purposes and can thus be regarded as an accurate engineering approximation, which can be used for wide range of practical applications. A sufficiency condition is presented regarding the range of parameter values where a single application of the inverse transform method yields satisfactory agreement between the simulated and target power spectra, and a series of examples relevant for the optics community are presented and discussed. Outside this parameter range the agreement gracefully degrades but does not distort in shape. Although we demonstrate the method here focusing on stationary random processes, we see no reason why the method could not be extended to simulate non-stationary random processes. © 2011 Optical Society of America

The Effect of the Number and Nature of Features and of General Ability on the Simultaneous and Successive Processing of Maps.

ERIC Educational Resources Information Center

Sutherland, Sandra; Winn, William

The interactions of three factors that may be involved with the memory for pattern or sequence in visual materials were investigated in this study: (1) arbitrariness of representation; (2) task; and (3) ability of students. The subjects, who were 29 graduate students in education, were pretested for general ability and randomly assigned to four…

Multidimensional NMR inversion without Kronecker products: Multilinear inversion

NASA Astrophysics Data System (ADS)

Medellín, David; Ravi, Vivek R.; Torres-Verdín, Carlos

2016-08-01

Multidimensional NMR inversion using Kronecker products poses several challenges. First, kernel compression is only possible when the kernel matrices are separable, and in recent years, there has been an increasing interest in NMR sequences with non-separable kernels. Second, in three or more dimensions, the singular value decomposition is not unique; therefore kernel compression is not well-defined for higher dimensions. Without kernel compression, the Kronecker product yields matrices that require large amounts of memory, making the inversion intractable for personal computers. Finally, incorporating arbitrary regularization terms is not possible using the Lawson-Hanson (LH) or the Butler-Reeds-Dawson (BRD) algorithms. We develop a minimization-based inversion method that circumvents the above problems by using multilinear forms to perform multidimensional NMR inversion without using kernel compression or Kronecker products. The new method is memory efficient, requiring less than 0.1% of the memory required by the LH or BRD methods. It can also be extended to arbitrary dimensions and adapted to include non-separable kernels, linear constraints, and arbitrary regularization terms. Additionally, it is easy to implement because only a cost function and its first derivative are required to perform the inversion.

An uncertainty principle for unimodular quantum groups

DOE Office of Scientific and Technical Information (OSTI.GOV)

Crann, Jason; Université Lille 1 - Sciences et Technologies, UFR de Mathématiques, Laboratoire de Mathématiques Paul Painlevé - UMR CNRS 8524, 59655 Villeneuve d'Ascq Cédex; Kalantar, Mehrdad, E-mail: jason-crann@carleton.ca, E-mail: mkalanta@math.carleton.ca

2014-08-15

We present a generalization of Hirschman's entropic uncertainty principle for locally compact Abelian groups to unimodular locally compact quantum groups. As a corollary, we strengthen a well-known uncertainty principle for compact groups, and generalize the relation to compact quantum groups of Kac type. We also establish the complementarity of finite-dimensional quantum group algebras. In the non-unimodular setting, we obtain an uncertainty relation for arbitrary locally compact groups using the relative entropy with respect to the Haar weight as the measure of uncertainty. We also show that when restricted to q-traces of discrete quantum groups, the relative entropy with respect tomore » the Haar weight reduces to the canonical entropy of the random walk generated by the state.« less

A method for reducing the order of nonlinear dynamic systems

NASA Astrophysics Data System (ADS)

Masri, S. F.; Miller, R. K.; Sassi, H.; Caughey, T. K.

1984-06-01

An approximate method that uses conventional condensation techniques for linear systems together with the nonparametric identification of the reduced-order model generalized nonlinear restoring forces is presented for reducing the order of discrete multidegree-of-freedom dynamic systems that possess arbitrary nonlinear characteristics. The utility of the proposed method is demonstrated by considering a redundant three-dimensional finite-element model half of whose elements incorporate hysteretic properties. A nonlinear reduced-order model, of one-third the order of the original model, is developed on the basis of wideband stationary random excitation and the validity of the reduced-order model is subsequently demonstrated by its ability to predict with adequate accuracy the transient response of the original nonlinear model under a different nonstationary random excitation.

A robust color image watermarking algorithm against rotation attacks

NASA Astrophysics Data System (ADS)

Han, Shao-cheng; Yang, Jin-feng; Wang, Rui; Jia, Gui-min

2018-01-01

A robust digital watermarking algorithm is proposed based on quaternion wavelet transform (QWT) and discrete cosine transform (DCT) for copyright protection of color images. The luminance component Y of a host color image in YIQ space is decomposed by QWT, and then the coefficients of four low-frequency subbands are transformed by DCT. An original binary watermark scrambled by Arnold map and iterated sine chaotic system is embedded into the mid-frequency DCT coefficients of the subbands. In order to improve the performance of the proposed algorithm against rotation attacks, a rotation detection scheme is implemented before watermark extracting. The experimental results demonstrate that the proposed watermarking scheme shows strong robustness not only against common image processing attacks but also against arbitrary rotation attacks.

Using the Schur Complement to Reduce Runtime in KULL's Magnetic Diffusion Package

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brunner, T A; Kolev, T V

2010-12-15

Recently a Resistive Magnetohydrodynamics (MHD) package has been added to the KULL code. In order to be compatible with the underlying hydrodynamics algorithm, a new sub-zonal magnetics discretization was developed that supports arbitrary polygonal and polyhedral zones. This flexibility comes at the cost of many more unknowns per zone - approximately ten times more for a hexahedral mesh. We can eliminate some (or all, depending on the dimensionality) of the extra unknowns from the global matrix during assembly by using a Schur complement approach. This trades expensive global work for cache-friendly local work, while still allowing solution for the fullmore » system. Significant improvements in the solution time are observed for several test problems.« less

Using a two-step matrix solution to reduce the run time in KULL's magnetic diffusion package

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brunner, T A; Kolev, T V

2010-12-17

Recently a Resistive Magnetohydrodynamics (MHD) package has been added to the KULL code. In order to be compatible with the underlying hydrodynamics algorithm, a new sub-zonal magnetics discretization was developed that supports arbitrary polygonal and polyhedral zones. This flexibility comes at the cost of many more unknowns per zone - approximately ten times more for a hexahedral mesh. We can eliminate some (or all, depending on the dimensionality) of the extra unknowns from the global matrix during assembly by using a Schur complement approach. This trades expensive global work for cache-friendly local work, while still allowing solution for the fullmore » system. Significant improvements in the solution time are observed for several test problems.« less

Electrodynamic multiple-scattering method for the simulation of optical trapping atop periodic metamaterials

NASA Astrophysics Data System (ADS)

Yannopapas, Vassilios; Paspalakis, Emmanuel

2018-07-01

We present a new theoretical tool for simulating optical trapping of nanoparticles in the presence of an arbitrary metamaterial design. The method is based on rigorously solving Maxwell's equations for the metamaterial via a hybrid discrete-dipole approximation/multiple-scattering technique and direct calculation of the optical force exerted on the nanoparticle by means of the Maxwell stress tensor. We apply the method to the case of a spherical polystyrene probe trapped within the optical landscape created by illuminating of a plasmonic metamaterial consisting of periodically arranged tapered metallic nanopyramids. The developed technique is ideally suited for general optomechanical calculations involving metamaterial designs and can compete with purely numerical methods such as finite-difference or finite-element schemes.

Nonparametric weighted stochastic block models

NASA Astrophysics Data System (ADS)

Peixoto, Tiago P.

2018-01-01

We present a Bayesian formulation of weighted stochastic block models that can be used to infer the large-scale modular structure of weighted networks, including their hierarchical organization. Our method is nonparametric, and thus does not require the prior knowledge of the number of groups or other dimensions of the model, which are instead inferred from data. We give a comprehensive treatment of different kinds of edge weights (i.e., continuous or discrete, signed or unsigned, bounded or unbounded), as well as arbitrary weight transformations, and describe an unsupervised model selection approach to choose the best network description. We illustrate the application of our method to a variety of empirical weighted networks, such as global migrations, voting patterns in congress, and neural connections in the human brain.

Transient response of multidegree-of-freedom linear systems to forcing functions with inequality constraints

NASA Technical Reports Server (NTRS)

Michalopoulos, C. D.

1974-01-01

Optimal control theory is applied to analyze the transient response of discrete linear systems to forcing functions with unknown time dependence but having known bounds. Particular attention is given to forcing functions which include: (1) maximum displacement of any given mass element, (2) maximum relative displacement of any two adjacent masses, and (3) maximum acceleration of a given mass. Linear mechanical systems with an arbitrary number of degrees of freedom and only one forcing function acting are considered. In the general case, the desired forcing function is found to be a function that switches from the upper-to-lower bound and vice-versa at certain moments of time. A general procedure for finding such switching times is set forth.

An updated Lagrangian particle hydrodynamics (ULPH) for Newtonian fluids

NASA Astrophysics Data System (ADS)

Tu, Qingsong; Li, Shaofan

2017-11-01

In this work, we have developed an updated Lagrangian particle hydrodynamics (ULPH) for Newtonian fluid. Unlike the smoothed particle hydrodynamics, the non-local particle hydrodynamics formulation proposed here is consistent and convergence. Unlike the state-based peridynamics, the discrete particle dynamics proposed here has no internal material bond between particles, and it is not formulated with respect to initial or a fixed referential configuration. In specific, we have shown that (1) the non-local update Lagrangian particle hydrodynamics formulation converges to the conventional local fluid mechanics formulation; (2) the non-local updated Lagrangian particle hydrodynamics can capture arbitrary flow discontinuities without any changes in the formulation, and (3) the proposed non-local particle hydrodynamics is computationally efficient and robust.

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

PubMed

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

2017-10-23

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

DiscML: an R package for estimating evolutionary rates of discrete characters using maximum likelihood.

PubMed

Kim, Tane; Hao, Weilong

2014-09-27

The study of discrete characters is crucial for the understanding of evolutionary processes. Even though great advances have been made in the analysis of nucleotide sequences, computer programs for non-DNA discrete characters are often dedicated to specific analyses and lack flexibility. Discrete characters often have different transition rate matrices, variable rates among sites and sometimes contain unobservable states. To obtain the ability to accurately estimate a variety of discrete characters, programs with sophisticated methodologies and flexible settings are desired. DiscML performs maximum likelihood estimation for evolutionary rates of discrete characters on a provided phylogeny with the options that correct for unobservable data, rate variations, and unknown prior root probabilities from the empirical data. It gives users options to customize the instantaneous transition rate matrices, or to choose pre-determined matrices from models such as birth-and-death (BD), birth-death-and-innovation (BDI), equal rates (ER), symmetric (SYM), general time-reversible (GTR) and all rates different (ARD). Moreover, we show application examples of DiscML on gene family data and on intron presence/absence data. DiscML was developed as a unified R program for estimating evolutionary rates of discrete characters with no restriction on the number of character states, and with flexibility to use different transition models. DiscML is ideal for the analyses of binary (1s/0s) patterns, multi-gene families, and multistate discrete morphological characteristics.

A distributed, graphical user interface based, computer control system for atomic physics experiments

NASA Astrophysics Data System (ADS)

Keshet, Aviv; Ketterle, Wolfgang

2013-01-01

Atomic physics experiments often require a complex sequence of precisely timed computer controlled events. This paper describes a distributed graphical user interface-based control system designed with such experiments in mind, which makes use of off-the-shelf output hardware from National Instruments. The software makes use of a client-server separation between a user interface for sequence design and a set of output hardware servers. Output hardware servers are designed to use standard National Instruments output cards, but the client-server nature should allow this to be extended to other output hardware. Output sequences running on multiple servers and output cards can be synchronized using a shared clock. By using a field programmable gate array-generated variable frequency clock, redundant buffers can be dramatically shortened, and a time resolution of 100 ns achieved over effectively arbitrary sequence lengths.

A distributed, graphical user interface based, computer control system for atomic physics experiments.

PubMed

Keshet, Aviv; Ketterle, Wolfgang

2013-01-01

Atomic physics experiments often require a complex sequence of precisely timed computer controlled events. This paper describes a distributed graphical user interface-based control system designed with such experiments in mind, which makes use of off-the-shelf output hardware from National Instruments. The software makes use of a client-server separation between a user interface for sequence design and a set of output hardware servers. Output hardware servers are designed to use standard National Instruments output cards, but the client-server nature should allow this to be extended to other output hardware. Output sequences running on multiple servers and output cards can be synchronized using a shared clock. By using a field programmable gate array-generated variable frequency clock, redundant buffers can be dramatically shortened, and a time resolution of 100 ns achieved over effectively arbitrary sequence lengths.

Adaptive time stepping for fluid-structure interaction solvers

DOE PAGES

Mayr, M.; Wall, W. A.; Gee, M. W.

2017-12-22

In this work, a novel adaptive time stepping scheme for fluid-structure interaction (FSI) problems is proposed that allows for controlling the accuracy of the time-discrete solution. Furthermore, it eases practical computations by providing an efficient and very robust time step size selection. This has proven to be very useful, especially when addressing new physical problems, where no educated guess for an appropriate time step size is available. The fluid and the structure field, but also the fluid-structure interface are taken into account for the purpose of a posteriori error estimation, rendering it easy to implement and only adding negligible additionalmore » cost. The adaptive time stepping scheme is incorporated into a monolithic solution framework, but can straightforwardly be applied to partitioned solvers as well. The basic idea can be extended to the coupling of an arbitrary number of physical models. Accuracy and efficiency of the proposed method are studied in a variety of numerical examples ranging from academic benchmark tests to complex biomedical applications like the pulsatile blood flow through an abdominal aortic aneurysm. Finally, the demonstrated accuracy of the time-discrete solution in combination with reduced computational cost make this algorithm very appealing in all kinds of FSI applications.« less

Computing Radiative Transfer in a 3D Medium

NASA Technical Reports Server (NTRS)

Von Allmen, Paul; Lee, Seungwon

2012-01-01

A package of software computes the time-dependent propagation of a narrow laser beam in an arbitrary three- dimensional (3D) medium with absorption and scattering, using the transient-discrete-ordinates method and a direct integration method. Unlike prior software that utilizes a Monte Carlo method, this software enables simulation at very small signal-to-noise ratios. The ability to simulate propagation of a narrow laser beam in a 3D medium is an improvement over other discrete-ordinate software. Unlike other direct-integration software, this software is not limited to simulation of propagation of thermal radiation with broad angular spread in three dimensions or of a laser pulse with narrow angular spread in two dimensions. Uses for this software include (1) computing scattering of a pulsed laser beam on a material having given elastic scattering and absorption profiles, and (2) evaluating concepts for laser-based instruments for sensing oceanic turbulence and related measurements of oceanic mixed-layer depths. With suitable augmentation, this software could be used to compute radiative transfer in ultrasound imaging in biological tissues, radiative transfer in the upper Earth crust for oil exploration, and propagation of laser pulses in telecommunication applications.

Variational formulation of macroparticle models for electromagnetic plasma simulations

DOE PAGES

Stamm, Alexander B.; Shadwick, Bradley A.; Evstatiev, Evstati G.

2014-06-01

A variational method is used to derive a self-consistent macroparticle model for relativistic electromagnetic kinetic plasma simulations. Extending earlier work, discretization of the electromagnetic Low Lagrangian is performed via a reduction of the phase-space distribution function onto a collection of finite-sized macroparticles of arbitrary shape and discretization of field quantities onto a spatial grid. This approach may be used with lab frame coordinates or moving window coordinates; the latter can greatly improve computational efficiency for studying some types of laser-plasma interactions. The primary advantage of the variational approach is the preservation of Lagrangian symmetries, which in our case leads tomore » energy conservation and thus avoids difficulties with grid heating. In addition, this approach decouples particle size from grid spacing and relaxes restrictions on particle shape, leading to low numerical noise. The variational approach also guarantees consistent approximations in the equations of motion and is amenable to higher order methods in both space and time. We restrict our attention to the 1.5-D case (one coordinate and two momenta). Lastly, simulations are performed with the new models and demonstrate energy conservation and low noise.« less

Shock wave structure in a strongly nonlinear lattice with viscous dissipation.

PubMed

Herbold, E B; Nesterenko, V F

2007-02-01

The shock wave structure in a one-dimensional lattice (e.g., granular chain of elastic particles) with a power law dependence of force on displacement between particles (F proportional to delta(n)) with viscous dissipation is considered and compared to the corresponding long wave approximation. A dissipative term depending on the relative velocity between neighboring particles is included to investigate its influence on the shape of a steady shock. The critical viscosity coefficient p(c), defining the transition from an oscillatory to a monotonic shock profile in strongly nonlinear systems, is obtained from the long-wave approximation for arbitrary values of the exponent n. The expression for the critical viscosity is comparable to the value obtained in the numerical analysis of a discrete system with a Hertzian contact interaction (n=3/2) . The expression for p(c) in the weakly nonlinear case converges to the known equation for the critical viscosity. An initial disturbance in a discrete system approaches a stationary shock profile after traveling a short distance that is comparable to the width of the leading pulse of a stationary shock front. The shock front width is minimized when the viscosity is equal to its critical value.

Coherence number as a discrete quantum resource

NASA Astrophysics Data System (ADS)

Chin, Seungbeom

2017-10-01

We introduce a discrete coherence monotone named the coherence number, which is a generalization of the coherence rank to mixed states. After defining the coherence number in a manner similar to that of the Schmidt number in entanglement theory, we present a necessary and sufficient condition of the coherence number for a coherent state to be converted to an entangled state of nonzero k concurrence (a member of the generalized concurrence family with 2 ≤k ≤d ). As an application of the coherence number to a practical quantum system, Grover's search algorithm of N items is considered. We show that the coherence number remains N and falls abruptly when the success probability of a searching process becomes maximal. This phenomenon motivates us to analyze the depletion pattern of Cc(N ) (the last member of the generalized coherence concurrence, nonzero when the coherence number is N ), which turns out to be an optimal resource for the process since it is completely consumed to finish the searching task. The generalization of the original Grover algorithm with arbitrary (mixed) initial states is also discussed, which reveals the boundary condition for the coherence to be monotonically decreasing under the process.

Adaptive time stepping for fluid-structure interaction solvers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mayr, M.; Wall, W. A.; Gee, M. W.

In this work, a novel adaptive time stepping scheme for fluid-structure interaction (FSI) problems is proposed that allows for controlling the accuracy of the time-discrete solution. Furthermore, it eases practical computations by providing an efficient and very robust time step size selection. This has proven to be very useful, especially when addressing new physical problems, where no educated guess for an appropriate time step size is available. The fluid and the structure field, but also the fluid-structure interface are taken into account for the purpose of a posteriori error estimation, rendering it easy to implement and only adding negligible additionalmore » cost. The adaptive time stepping scheme is incorporated into a monolithic solution framework, but can straightforwardly be applied to partitioned solvers as well. The basic idea can be extended to the coupling of an arbitrary number of physical models. Accuracy and efficiency of the proposed method are studied in a variety of numerical examples ranging from academic benchmark tests to complex biomedical applications like the pulsatile blood flow through an abdominal aortic aneurysm. Finally, the demonstrated accuracy of the time-discrete solution in combination with reduced computational cost make this algorithm very appealing in all kinds of FSI applications.« less

Multi-Material Closure Model for High-Order Finite Element Lagrangian Hydrodynamics

DOE PAGES

Dobrev, V. A.; Kolev, T. V.; Rieben, R. N.; ...

2016-04-27

We present a new closure model for single fluid, multi-material Lagrangian hydrodynamics and its application to high-order finite element discretizations of these equations [1]. The model is general with respect to the number of materials, dimension and space and time discretizations. Knowledge about exact material interfaces is not required. Material indicator functions are evolved by a closure computation at each quadrature point of mixed cells, which can be viewed as a high-order variational generalization of the method of Tipton [2]. This computation is defined by the notion of partial non-instantaneous pressure equilibration, while the full pressure equilibration is achieved bymore » both the closure model and the hydrodynamic motion. Exchange of internal energy between materials is derived through entropy considerations, that is, every material produces positive entropy, and the total entropy production is maximized in compression and minimized in expansion. Results are presented for standard one-dimensional two-material problems, followed by two-dimensional and three-dimensional multi-material high-velocity impact arbitrary Lagrangian–Eulerian calculations. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.« less

A Fluid Structure Algorithm with Lagrange Multipliers to Model Free Swimming

NASA Astrophysics Data System (ADS)

Sahin, Mehmet; Dilek, Ezgi

2017-11-01

A new monolithic approach is prosed to solve the fluid-structure interaction (FSI) problem with Lagrange multipliers in order to model free swimming/flying. In the present approach, the fluid domain is modeled by the incompressible Navier-Stokes equations and discretized using an Arbitrary Lagrangian-Eulerian (ALE) formulation based on the stable side-centered unstructured finite volume method. The solid domain is modeled by the constitutive laws for the nonlinear Saint Venant-Kirchhoff material and the classical Galerkin finite element method is used to discretize the governing equations in a Lagrangian frame. In order to impose the body motion/deformation, the distance between the constraint pair nodes is imposed using the Lagrange multipliers, which is independent from the frame of reference. The resulting algebraic linear equations are solved in a fully coupled manner using a dual approach (null space method). The present numerical algorithm is initially validated for the classical FSI benchmark problems and then applied to the free swimming of three linked ellipses. The authors are grateful for the use of the computing resources provided by the National Center for High Performance Computing (UYBHM) under Grant Number 10752009 and the computing facilities at TUBITAK-ULAKBIM, High Performance and Grid Computing Center.

The simplicial Ricci tensor

NASA Astrophysics Data System (ADS)

Alsing, Paul M.; McDonald, Jonathan R.; Miller, Warner A.

2011-08-01

The Ricci tensor (Ric) is fundamental to Einstein's geometric theory of gravitation. The three-dimensional Ric of a spacelike surface vanishes at the moment of time symmetry for vacuum spacetimes. The four-dimensional Ric is the Einstein tensor for such spacetimes. More recently, the Ric was used by Hamilton to define a nonlinear, diffusive Ricci flow (RF) that was fundamental to Perelman's proof of the Poincarè conjecture. Analytic applications of RF can be found in many fields including general relativity and mathematics. Numerically it has been applied broadly to communication networks, medical physics, computer design and more. In this paper, we use Regge calculus (RC) to provide the first geometric discretization of the Ric. This result is fundamental for higher dimensional generalizations of discrete RF. We construct this tensor on both the simplicial lattice and its dual and prove their equivalence. We show that the Ric is an edge-based weighted average of deficit divided by an edge-based weighted average of dual area—an expression similar to the vertex-based weighted average of the scalar curvature reported recently. We use this Ric in a third and independent geometric derivation of the RC Einstein tensor in arbitrary dimensions.

Calculus domains modelled using an original bool algebra based on polygons

NASA Astrophysics Data System (ADS)

Oanta, E.; Panait, C.; Raicu, A.; Barhalescu, M.; Axinte, T.

2016-08-01

Analytical and numerical computer based models require analytical definitions of the calculus domains. The paper presents a method to model a calculus domain based on a bool algebra which uses solid and hollow polygons. The general calculus relations of the geometrical characteristics that are widely used in mechanical engineering are tested using several shapes of the calculus domain in order to draw conclusions regarding the most effective methods to discretize the domain. The paper also tests the results of several CAD commercial software applications which are able to compute the geometrical characteristics, being drawn interesting conclusions. The tests were also targeting the accuracy of the results vs. the number of nodes on the curved boundary of the cross section. The study required the development of an original software consisting of more than 1700 computer code lines. In comparison with other calculus methods, the discretization using convex polygons is a simpler approach. Moreover, this method doesn't lead to large numbers as the spline approximation did, in that case being required special software packages in order to offer multiple, arbitrary precision. The knowledge resulted from this study may be used to develop complex computer based models in engineering.

Virtualized Traffic: reconstructing traffic flows from discrete spatiotemporal data.

PubMed

Sewall, Jason; van den Berg, Jur; Lin, Ming C; Manocha, Dinesh

2011-01-01

We present a novel concept, Virtualized Traffic, to reconstruct and visualize continuous traffic flows from discrete spatiotemporal data provided by traffic sensors or generated artificially to enhance a sense of immersion in a dynamic virtual world. Given the positions of each car at two recorded locations on a highway and the corresponding time instances, our approach can reconstruct the traffic flows (i.e., the dynamic motions of multiple cars over time) between the two locations along the highway for immersive visualization of virtual cities or other environments. Our algorithm is applicable to high-density traffic on highways with an arbitrary number of lanes and takes into account the geometric, kinematic, and dynamic constraints on the cars. Our method reconstructs the car motion that automatically minimizes the number of lane changes, respects safety distance to other cars, and computes the acceleration necessary to obtain a smooth traffic flow subject to the given constraints. Furthermore, our framework can process a continuous stream of input data in real time, enabling the users to view virtualized traffic events in a virtual world as they occur. We demonstrate our reconstruction technique with both synthetic and real-world input. © 2011 IEEE Published by the IEEE Computer Society

Multi-Material Closure Model for High-Order Finite Element Lagrangian Hydrodynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dobrev, V. A.; Kolev, T. V.; Rieben, R. N.

We present a new closure model for single fluid, multi-material Lagrangian hydrodynamics and its application to high-order finite element discretizations of these equations [1]. The model is general with respect to the number of materials, dimension and space and time discretizations. Knowledge about exact material interfaces is not required. Material indicator functions are evolved by a closure computation at each quadrature point of mixed cells, which can be viewed as a high-order variational generalization of the method of Tipton [2]. This computation is defined by the notion of partial non-instantaneous pressure equilibration, while the full pressure equilibration is achieved bymore » both the closure model and the hydrodynamic motion. Exchange of internal energy between materials is derived through entropy considerations, that is, every material produces positive entropy, and the total entropy production is maximized in compression and minimized in expansion. Results are presented for standard one-dimensional two-material problems, followed by two-dimensional and three-dimensional multi-material high-velocity impact arbitrary Lagrangian–Eulerian calculations. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.« less

One-dimensional Lagrangian implicit hydrodynamic algorithm for Inertial Confinement Fusion applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ramis, Rafael, E-mail: rafael.ramis@upm.es

A new one-dimensional hydrodynamic algorithm, specifically developed for Inertial Confinement Fusion (ICF) applications, is presented. The scheme uses a fully conservative Lagrangian formulation in planar, cylindrical, and spherically symmetric geometries, and supports arbitrary equations of state with separate ion and electron components. Fluid equations are discretized on a staggered grid and stabilized by means of an artificial viscosity formulation. The space discretized equations are advanced in time using an implicit algorithm. The method includes several numerical parameters that can be adjusted locally. In regions with low Courant–Friedrichs–Lewy (CFL) number, where stability is not an issue, they can be adjusted tomore » optimize the accuracy. In typical problems, the truncation error can be reduced by a factor between 2 to 10 in comparison with conventional explicit algorithms. On the other hand, in regions with high CFL numbers, the parameters can be set to guarantee unconditional stability. The method can be integrated into complex ICF codes. This is demonstrated through several examples covering a wide range of situations: from thermonuclear ignition physics, where alpha particles are managed as an additional species, to low intensity laser–matter interaction, where liquid–vapor phase transitions occur.« less

Development and application of a method for predicting rotor free wake positions and resulting rotor blade air loads. Volume 1: Model and results

NASA Technical Reports Server (NTRS)

Sadler, S. G.

1971-01-01

Rotor wake geometries are predicted by a process similar to the startup of a rotor in a free stream. An array of discrete trailing and shed vortices is generated with vortex strengths corresponding to stepwise radial and azimuthal blade circulations. The array of shed and trailing vortices is limited to an arbitrary number of azimuthal steps behind each blade. The remainder of the wake model of each blade is an arbitrary number of trailing vortices. Vortex element end points were allowed to be transported by the resultant velocity of the free stream and vortex-induced velocities. Wake geometry, wake flow, and wake-induced velocity influence coefficients are generated by this program for use in the blade loads portion of the calculations. Blade loads computations include the effects of nonuniform inflow due to a free wake, nonlinear airfoil characteristics, and response of flexible blades to the applied loads. Computed wake flows and blade loads are compared with experimentally measured data. Predicted blade loads, response and shears and moments are obtained for a model rotor system having two independent rotors. The effects of advance ratio, vertical separation of rotors, different blade radius ratios, and different azimuthal spacing of the blades of one rotor with respect to the other are investigated.

Toward Higher-Order Mass Detection: Influence of an Adsorbate's Rotational Inertia and Eccentricity on the Resonant Response of a Bernoulli-Euler Cantilever Beam.

PubMed

Heinrich, Stephen M; Dufour, Isabelle

2015-11-19

In this paper a new theoretical model is derived, the results of which permit a detailed examination of how the resonant characteristics of a cantilever are influenced by a particle (adsorbate) attached at an arbitrary position along the beam's length. Unlike most previous work, the particle need not be small in mass or dimension relative to the beam, and the adsorbate's geometric characteristics are incorporated into the model via its rotational inertia and eccentricity relative to the beam axis. For the special case in which the adsorbate's (translational) mass is indeed small, an analytical solution is obtained for the particle-induced resonant frequency shift of an arbitrary flexural mode, including the effects of rotational inertia and eccentricity. This solution is shown to possess the exact first-order behavior in the normalized particle mass and represents a generalization of analytical solutions derived by others in earlier studies. The results suggest the potential for "higher-order" nanobeam-based mass detection methods by which the multi-mode frequency response reflects not only the adsorbate's mass but also important geometric data related to its size, shape, or orientation (i.e., the mass distribution), thus resulting in more highly discriminatory techniques for discrete-mass sensing.

Distributional and regularized radiation fields of non-uniformly moving straight dislocations, and elastodynamic Tamm problem

NASA Astrophysics Data System (ADS)

Lazar, Markus; Pellegrini, Yves-Patrick

2016-11-01

This work introduces original explicit solutions for the elastic fields radiated by non-uniformly moving, straight, screw or edge dislocations in an isotropic medium, in the form of time-integral representations in which acceleration-dependent contributions are explicitly separated out. These solutions are obtained by applying an isotropic regularization procedure to distributional expressions of the elastodynamic fields built on the Green tensor of the Navier equation. The obtained regularized field expressions are singularity-free, and depend on the dislocation density rather than on the plastic eigenstrain. They cover non-uniform motion at arbitrary speeds, including faster-than-wave ones. A numerical method of computation is discussed, that rests on discretizing motion along an arbitrary path in the plane transverse to the dislocation, into a succession of time intervals of constant velocity vector over which time-integrated contributions can be obtained in closed form. As a simple illustration, it is applied to the elastodynamic equivalent of the Tamm problem, where fields induced by a dislocation accelerated from rest beyond the longitudinal wave speed, and thereafter put to rest again, are computed. As expected, the proposed expressions produce Mach cones, the dynamic build-up and decay of which is illustrated by means of full-field calculations.

Pooling sexes when assessing ground reaction forces during walking: Statistical Parametric Mapping versus traditional approach.

PubMed

Castro, Marcelo P; Pataky, Todd C; Sole, Gisela; Vilas-Boas, Joao Paulo

2015-07-16

Ground reaction force (GRF) data from men and women are commonly pooled for analyses. However, it may not be justifiable to pool sexes on the basis of discrete parameters extracted from continuous GRF gait waveforms because this can miss continuous effects. Forty healthy participants (20 men and 20 women) walked at a cadence of 100 steps per minute across two force plates, recording GRFs. Two statistical methods were used to test the null hypothesis of no mean GRF differences between sexes: (i) Statistical Parametric Mapping-using the entire three-component GRF waveform; and (ii) traditional approach-using the first and second vertical GRF peaks. Statistical Parametric Mapping results suggested large sex differences, which post-hoc analyses suggested were due predominantly to higher anterior-posterior and vertical GRFs in early stance in women compared to men. Statistically significant differences were observed for the first GRF peak and similar values for the second GRF peak. These contrasting results emphasise that different parts of the waveform have different signal strengths and thus that one may use the traditional approach to choose arbitrary metrics and make arbitrary conclusions. We suggest that researchers and clinicians consider both the entire gait waveforms and sex-specificity when analysing GRF data. Copyright © 2015 Elsevier Ltd. All rights reserved.

Higher-Order Advection-Based Remap of Magnetic Fields in an Arbitrary Lagrangian-Eulerian Code

NASA Astrophysics Data System (ADS)

Cornille, Brian; White, Dan

2017-10-01

We will present methods formulated for the Eulerian advection stage of an arbitrary Lagrangian-Eulerian code for the new addition of magnetohydrodynamic (MHD) effects. The various physical fields are advanced in time using a Lagrangian formulation of the system. When this Lagrangian motion produces substantial distortion of the mesh, it can be difficult or impossible to progress the simulation forward. This is overcome by relaxation of the mesh while the physical fields are frozen. The code has already successfully been extended to include evolution of magnetic field diffusion during the Lagrangian motion stage. This magnetic field is discretized using an H(div) compatible finite element basis. The advantage of this basis is that the divergence-free constraint of magnetic fields is maintained exactly during the Lagrangian motion evolution. Our goal is to preserve this property during Eulerian advection as well. We will demonstrate this property and the importance of MHD effects in several numerical experiments. In pulsed-power experiments magnetic fields may be imposed or spontaneously generated. When these magnetic fields are present, the evolution of the experiment may differ from a comparable configuration without magnetic fields. Prepared by LLNL under Contract DE-AC52-07NA27344. Supported by DOE CSGF under Grant Number DE-FG02-97ER25308.

Toward Higher-Order Mass Detection: Influence of an Adsorbate’s Rotational Inertia and Eccentricity on the Resonant Response of a Bernoulli-Euler Cantilever Beam

PubMed Central

Heinrich, Stephen M.; Dufour, Isabelle

2015-01-01

In this paper a new theoretical model is derived, the results of which permit a detailed examination of how the resonant characteristics of a cantilever are influenced by a particle (adsorbate) attached at an arbitrary position along the beam’s length. Unlike most previous work, the particle need not be small in mass or dimension relative to the beam, and the adsorbate’s geometric characteristics are incorporated into the model via its rotational inertia and eccentricity relative to the beam axis. For the special case in which the adsorbate’s (translational) mass is indeed small, an analytical solution is obtained for the particle-induced resonant frequency shift of an arbitrary flexural mode, including the effects of rotational inertia and eccentricity. This solution is shown to possess the exact first-order behavior in the normalized particle mass and represents a generalization of analytical solutions derived by others in earlier studies. The results suggest the potential for “higher-order” nanobeam-based mass detection methods by which the multi-mode frequency response reflects not only the adsorbate’s mass but also important geometric data related to its size, shape, or orientation (i.e., the mass distribution), thus resulting in more highly discriminatory techniques for discrete-mass sensing. PMID:26610493

Fast and Accurate Multivariate Gaussian Modeling of Protein Families: Predicting Residue Contacts and Protein-Interaction Partners

PubMed Central

Feinauer, Christoph; Procaccini, Andrea; Zecchina, Riccardo; Weigt, Martin; Pagnani, Andrea

2014-01-01

In the course of evolution, proteins show a remarkable conservation of their three-dimensional structure and their biological function, leading to strong evolutionary constraints on the sequence variability between homologous proteins. Our method aims at extracting such constraints from rapidly accumulating sequence data, and thereby at inferring protein structure and function from sequence information alone. Recently, global statistical inference methods (e.g. direct-coupling analysis, sparse inverse covariance estimation) have achieved a breakthrough towards this aim, and their predictions have been successfully implemented into tertiary and quaternary protein structure prediction methods. However, due to the discrete nature of the underlying variable (amino-acids), exact inference requires exponential time in the protein length, and efficient approximations are needed for practical applicability. Here we propose a very efficient multivariate Gaussian modeling approach as a variant of direct-coupling analysis: the discrete amino-acid variables are replaced by continuous Gaussian random variables. The resulting statistical inference problem is efficiently and exactly solvable. We show that the quality of inference is comparable or superior to the one achieved by mean-field approximations to inference with discrete variables, as done by direct-coupling analysis. This is true for (i) the prediction of residue-residue contacts in proteins, and (ii) the identification of protein-protein interaction partner in bacterial signal transduction. An implementation of our multivariate Gaussian approach is available at the website http://areeweb.polito.it/ricerca/cmp/code. PMID:24663061

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

PubMed

Bravo, Héctor Corrada; Irizarry, Rafael A

2010-09-01

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

Relaxation time estimation in surface NMR

DOEpatents

Grunewald, Elliot D.; Walsh, David O.

2017-03-21

NMR relaxation time estimation methods and corresponding apparatus generate two or more alternating current transmit pulses with arbitrary amplitudes, time delays, and relative phases; apply a surface NMR acquisition scheme in which initial preparatory pulses, the properties of which may be fixed across a set of multiple acquisition sequence, are transmitted at the start of each acquisition sequence and are followed by one or more depth sensitive pulses, the pulse moments of which are varied across the set of multiple acquisition sequences; and apply processing techniques in which recorded NMR response data are used to estimate NMR properties and the relaxation times T.sub.1 and T.sub.2* as a function of position as well as one-dimensional and two-dimension distributions of T.sub.1 versus T.sub.2* as a function of subsurface position.

Universal Quantum Computing with Measurement-Induced Continuous-Variable Gate Sequence in a Loop-Based Architecture.

PubMed

Takeda, Shuntaro; Furusawa, Akira

2017-09-22

We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically processed in a nested loop by an electrically programmable gate sequence. This architecture can process any input state and an arbitrary number of modes with almost minimum resources, and offers a universal gate set for both qubits and continuous variables. Furthermore, quantum computing can be performed fault tolerantly by a known scheme for encoding a qubit in an infinite-dimensional Hilbert space of a single light mode.

Universal Quantum Computing with Measurement-Induced Continuous-Variable Gate Sequence in a Loop-Based Architecture

NASA Astrophysics Data System (ADS)

Takeda, Shuntaro; Furusawa, Akira

2017-09-01

We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically processed in a nested loop by an electrically programmable gate sequence. This architecture can process any input state and an arbitrary number of modes with almost minimum resources, and offers a universal gate set for both qubits and continuous variables. Furthermore, quantum computing can be performed fault tolerantly by a known scheme for encoding a qubit in an infinite-dimensional Hilbert space of a single light mode.

Molecular classification based on apomorphic amino acids (Arthropoda, Hexapoda): Integrative taxonomy in the era of phylogenomics.

PubMed

Wu, Hao-Yang; Wang, Yan-Hui; Xie, Qiang; Ke, Yun-Ling; Bu, Wen-Jun

2016-06-17

With the great development of sequencing technologies and systematic methods, our understanding of evolutionary relationships at deeper levels within the tree of life has greatly improved over the last decade. However, the current taxonomic methodology is insufficient to describe the growing levels of diversity in both a standardised and general way due to the limitations of using only morphological traits to describe clades. Herein, we propose the idea of a molecular classification based on hierarchical and discrete amino acid characters. Clades are classified based on the results of phylogenetic analyses and described using amino acids with group specificity in phylograms. Practices based on the recently published phylogenomic datasets of insects together with 15 de novo sequenced transcriptomes in this study demonstrate that such a methodology can accommodate various higher ranks of taxonomy. Such an approach has the advantage of describing organisms in a standard and discrete way within a phylogenetic framework, thereby facilitating the recognition of clades from the view of the whole lineage, as indicated by PhyloCode. By combining identification keys and phylogenies, the molecular classification based on hierarchical and discrete characters may greatly boost the progress of integrative taxonomy.

Molecular classification based on apomorphic amino acids (Arthropoda, Hexapoda): Integrative taxonomy in the era of phylogenomics

PubMed Central

Wu, Hao-Yang; Wang, Yan-Hui; Xie, Qiang; Ke, Yun-Ling; Bu, Wen-Jun

2016-01-01

With the great development of sequencing technologies and systematic methods, our understanding of evolutionary relationships at deeper levels within the tree of life has greatly improved over the last decade. However, the current taxonomic methodology is insufficient to describe the growing levels of diversity in both a standardised and general way due to the limitations of using only morphological traits to describe clades. Herein, we propose the idea of a molecular classification based on hierarchical and discrete amino acid characters. Clades are classified based on the results of phylogenetic analyses and described using amino acids with group specificity in phylograms. Practices based on the recently published phylogenomic datasets of insects together with 15 de novo sequenced transcriptomes in this study demonstrate that such a methodology can accommodate various higher ranks of taxonomy. Such an approach has the advantage of describing organisms in a standard and discrete way within a phylogenetic framework, thereby facilitating the recognition of clades from the view of the whole lineage, as indicated by PhyloCode. By combining identification keys and phylogenies, the molecular classification based on hierarchical and discrete characters may greatly boost the progress of integrative taxonomy. PMID:27312960

Coding and decoding libraries of sequence-defined functional copolymers synthesized via photoligation

PubMed Central

Zydziak, Nicolas; Konrad, Waldemar; Feist, Florian; Afonin, Sergii; Weidner, Steffen; Barner-Kowollik, Christopher

2016-01-01

Designing artificial macromolecules with absolute sequence order represents a considerable challenge. Here we report an advanced light-induced avenue to monodisperse sequence-defined functional linear macromolecules up to decamers via a unique photochemical approach. The versatility of the synthetic strategy—combining sequential and modular concepts—enables the synthesis of perfect macromolecules varying in chemical constitution and topology. Specific functions are placed at arbitrary positions along the chain via the successive addition of monomer units and blocks, leading to a library of functional homopolymers, alternating copolymers and block copolymers. The in-depth characterization of each sequence-defined chain confirms the precision nature of the macromolecules. Decoding of the functional information contained in the molecular structure is achieved via tandem mass spectrometry without recourse to their synthetic history, showing that the sequence information can be read. We submit that the presented photochemical strategy is a viable and advanced concept for coding individual monomer units along a macromolecular chain. PMID:27901024

High-throughput automated microfluidic sample preparation for accurate microbial genomics

PubMed Central

Kim, Soohong; De Jonghe, Joachim; Kulesa, Anthony B.; Feldman, David; Vatanen, Tommi; Bhattacharyya, Roby P.; Berdy, Brittany; Gomez, James; Nolan, Jill; Epstein, Slava; Blainey, Paul C.

2017-01-01

Low-cost shotgun DNA sequencing is transforming the microbial sciences. Sequencing instruments are so effective that sample preparation is now the key limiting factor. Here, we introduce a microfluidic sample preparation platform that integrates the key steps in cells to sequence library sample preparation for up to 96 samples and reduces DNA input requirements 100-fold while maintaining or improving data quality. The general-purpose microarchitecture we demonstrate supports workflows with arbitrary numbers of reaction and clean-up or capture steps. By reducing the sample quantity requirements, we enabled low-input (∼10,000 cells) whole-genome shotgun (WGS) sequencing of Mycobacterium tuberculosis and soil micro-colonies with superior results. We also leveraged the enhanced throughput to sequence ∼400 clinical Pseudomonas aeruginosa libraries and demonstrate excellent single-nucleotide polymorphism detection performance that explained phenotypically observed antibiotic resistance. Fully-integrated lab-on-chip sample preparation overcomes technical barriers to enable broader deployment of genomics across many basic research and translational applications. PMID:28128213

Coding and decoding libraries of sequence-defined functional copolymers synthesized via photoligation.

PubMed

Zydziak, Nicolas; Konrad, Waldemar; Feist, Florian; Afonin, Sergii; Weidner, Steffen; Barner-Kowollik, Christopher

2016-11-30

Designing artificial macromolecules with absolute sequence order represents a considerable challenge. Here we report an advanced light-induced avenue to monodisperse sequence-defined functional linear macromolecules up to decamers via a unique photochemical approach. The versatility of the synthetic strategy-combining sequential and modular concepts-enables the synthesis of perfect macromolecules varying in chemical constitution and topology. Specific functions are placed at arbitrary positions along the chain via the successive addition of monomer units and blocks, leading to a library of functional homopolymers, alternating copolymers and block copolymers. The in-depth characterization of each sequence-defined chain confirms the precision nature of the macromolecules. Decoding of the functional information contained in the molecular structure is achieved via tandem mass spectrometry without recourse to their synthetic history, showing that the sequence information can be read. We submit that the presented photochemical strategy is a viable and advanced concept for coding individual monomer units along a macromolecular chain.

Task planning and control synthesis for robotic manipulation in space applications

NASA Technical Reports Server (NTRS)

Sanderson, A. C.; Peshkin, M. A.; Homem-De-mello, L. S.

1987-01-01

Space-based robotic systems for diagnosis, repair and assembly of systems will require new techniques of planning and manipulation to accomplish these complex tasks. Results of work in assembly task representation, discrete task planning, and control synthesis which provide a design environment for flexible assembly systems in manufacturing applications, and which extend to planning of manipulatiuon operations in unstructured environments are summarized. Assembly planning is carried out using the AND/OR graph representation which encompasses all possible partial orders of operations and may be used to plan assembly sequences. Discrete task planning uses the configuration map which facilitates search over a space of discrete operations parameters in sequential operations in order to achieve required goals in the space of bounded configuration sets.

Elegant anti-disturbance control for discrete-time stochastic systems with nonlinearity and multiple disturbances

NASA Astrophysics Data System (ADS)

Wei, Xinjiang; Sun, Shixiang

2018-03-01

An elegant anti-disturbance control (EADC) strategy for a class of discrete-time stochastic systems with both nonlinearity and multiple disturbances, which include the disturbance with partially known information and a sequence of random vectors, is proposed in this paper. A stochastic disturbance observer is constructed to estimate the disturbance with partially known information, based on which, an EADC scheme is proposed by combining pole placement and linear matrix inequality methods. It is proved that the two different disturbances can be rejected and attenuated, and the corresponding desired performances can be guaranteed for discrete-time stochastic systems with known and unknown nonlinear dynamics, respectively. Simulation examples are given to demonstrate the effectiveness of the proposed schemes compared with some existing results.

Pellet Cladding Mechanical Interaction Modeling Using the Extended Finite Element Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Spencer, Benjamin W.; Jiang, Wen; Dolbow, John E.

As a brittle material, the ceramic UO2 used as light water reactor fuel experiences significant fracturing throughout its life, beginning with the first rise to power of fresh fuel. This has multiple effects on the thermal and mechanical response of the fuel/cladding system. One such effect that is particularly important is that when there is mechanical contact between the fuel and cladding, cracks that extending from the outer surface of the fuel into the volume of the fuel cause elevated stresses in the adjacent cladding, which can potentially lead to cladding failure. Modeling the thermal and mechanical response of themore » cladding in the vicinity of these surface-breaking cracks in the fuel can provide important insights into this behavior to help avoid operating conditions that could lead to cladding failure. Such modeling has traditionally been done in the context of finite-element-based fuel performance analysis by modifying the fuel mesh to introduce discrete cracks. While this approach is effective in capturing the important behavior at the fuel/cladding interface, there are multiple drawbacks to explicitly incorporating the cracks in the finite element mesh. Because the cracks are incorporated in the original mesh, the mesh must be modified for cracks of specified location and depth, so it is difficult to account for crack propagation and the formation of new cracks at other locations. The extended finite element method (XFEM) has emerged in recent years as a powerful method to represent arbitrary, evolving, discrete discontinuities within the context of the finite element method. Development work is underway by the authors to implement XFEM in the BISON fuel performance code, and this capability has previously been demonstrated in simulations of fracture propagation in ceramic nuclear fuel. These preliminary demonstrations have included only the fuel, and excluded the cladding for simplicity. This paper presents initial results of efforts to apply XFEM to model stress concentrations induced by fuel fractures at the fuel/cladding interface during pellet cladding mechanical interaction (PCMI). This is accomplished by enhancing the thermal and mechanical contact enforcement algorithms employed by BISON to permit their use in conjunction with XFEM. The results from this methodology are demonstrated to be equivalent to those from using meshed discrete cracks. While the results of the two methods are equivalent for the case of a stationary crack, it is demonstrated that XFEM provides the additional flexibility of allowing arbitrary crack initiation and propagation during the analysis, and minimizes model setup effort for cases with stationary cracks.« less

General methods for determining the linear stability of coronal magnetic fields

NASA Technical Reports Server (NTRS)

Craig, I. J. D.; Sneyd, A. D.; Mcclymont, A. N.

1988-01-01

A time integration of a linearized plasma equation of motion has been performed to calculate the ideal linear stability of arbitrary three-dimensional magnetic fields. The convergence rates of the explicit and implicit power methods employed are speeded up by using sequences of cyclic shifts. Growth rates are obtained for Gold-Hoyle force-free equilibria, and the corkscrew-kink instability is found to be very weak.

General methods for determining the linear stability of coronal magnetic fields

DOE Office of Scientific and Technical Information (OSTI.GOV)

Craig, I.J.D.; Sneyd, A.D.; McClymont, A.N.

1988-12-01

A time integration of a linearized plasma equation of motion has been performed to calculate the ideal linear stability of arbitrary three-dimensional magnetic fields. The convergence rates of the explicit and implicit power methods employed are speeded up by using sequences of cyclic shifts. Growth rates are obtained for Gold-Hoyle force-free equilibria, and the corkscrew-kink instability is found to be very weak. 19 references.

Investigation of genetic divergence and polymorphism of nuclear DNA in species and populations of domestic and wild sheep

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mel`nikova, M.N.; Grechko, V.V.; Mednikov, B.M.

1995-08-01

Genetic divergence in repetitive sequences of nuclear DNA of wild and domestic sheep was studied by general restriction endonuclease mapping (i.e., the taxonoprint method). The PCR RAPD method with one and two arbitrary primers was also used to analyze the nuclear DNA polymorphism in some other regions. The taxonoprint method, performed using six endonucleases, showed specificity and virtually complete similarity in the patterns of repetitive DNA sequences of two wild forms, argali and moufflon, and five domestic sheep breeds. Central Asian breeds, Kazakh fine-fleeced, karakuk, ghissar, and eadeelbay, and an English breed, Lincoln, were examined. The results confirm the opinionmore » that wild and domestic sheep may be considered one polytypic species. The PCR-RAPD method, both with one and two arbitrary primers, revealed a closer similarity of all the sheep breeds examined when aragali, rather than with moufflon, was used. These results indicate that the domestication area of sheep was much more broader than was earlier presumed. Otherwise, hybridizations of domestic and wild forms could occasionally occur in the area of their coexistence. The amplification patterns of PCR-RAPD products are the most promising population genetic markers. 27 refs., 4 figs., 7 tabs.« less

Population genetics of polymorphism and divergence for diploid selection models with arbitrary dominance.

PubMed

Williamson, Scott; Fledel-Alon, Adi; Bustamante, Carlos D

2004-09-01

We develop a Poisson random-field model of polymorphism and divergence that allows arbitrary dominance relations in a diploid context. This model provides a maximum-likelihood framework for estimating both selection and dominance parameters of new mutations using information on the frequency spectrum of sequence polymorphisms. This is the first DNA sequence-based estimator of the dominance parameter. Our model also leads to a likelihood-ratio test for distinguishing nongenic from genic selection; simulations indicate that this test is quite powerful when a large number of segregating sites are available. We also use simulations to explore the bias in selection parameter estimates caused by unacknowledged dominance relations. When inference is based on the frequency spectrum of polymorphisms, genic selection estimates of the selection parameter can be very strongly biased even for minor deviations from the genic selection model. Surprisingly, however, when inference is based on polymorphism and divergence (McDonald-Kreitman) data, genic selection estimates of the selection parameter are nearly unbiased, even for completely dominant or recessive mutations. Further, we find that weak overdominant selection can increase, rather than decrease, the substitution rate relative to levels of polymorphism. This nonintuitive result has major implications for the interpretation of several popular tests of neutrality.

Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny

NASA Astrophysics Data System (ADS)

Misra, Navodit; Blelloch, Guy; Ravi, R.; Schwartz, Russell

Accurate reconstruction of phylogenies remains a key challenge in evolutionary biology. Most biologically plausible formulations of the problem are formally NP-hard, with no known efficient solution. The standard in practice are fast heuristic methods that are empirically known to work very well in general, but can yield results arbitrarily far from optimal. Practical exact methods, which yield exponential worst-case running times but generally much better times in practice, provide an important alternative. We report progress in this direction by introducing a provably optimal method for the weighted multi-state maximum parsimony phylogeny problem. The method is based on generalizing the notion of the Buneman graph, a construction key to efficient exact methods for binary sequences, so as to apply to sequences with arbitrary finite numbers of states with arbitrary state transition weights. We implement an integer linear programming (ILP) method for the multi-state problem using this generalized Buneman graph and demonstrate that the resulting method is able to solve data sets that are intractable by prior exact methods in run times comparable with popular heuristics. Our work provides the first method for provably optimal maximum parsimony phylogeny inference that is practical for multi-state data sets of more than a few characters.

Image encryption using random sequence generated from generalized information domain

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

GGRNA: an ultrafast, transcript-oriented search engine for genes and transcripts

PubMed Central

Naito, Yuki; Bono, Hidemasa

2012-01-01

GGRNA (http://GGRNA.dbcls.jp/) is a Google-like, ultrafast search engine for genes and transcripts. The web server accepts arbitrary words and phrases, such as gene names, IDs, gene descriptions, annotations of gene and even nucleotide/amino acid sequences through one simple search box, and quickly returns relevant RefSeq transcripts. A typical search takes just a few seconds, which dramatically enhances the usability of routine searching. In particular, GGRNA can search sequences as short as 10 nt or 4 amino acids, which cannot be handled easily by popular sequence analysis tools. Nucleotide sequences can be searched allowing up to three mismatches, or the query sequences may contain degenerate nucleotide codes (e.g. N, R, Y, S). Furthermore, Gene Ontology annotations, Enzyme Commission numbers and probe sequences of catalog microarrays are also incorporated into GGRNA, which may help users to conduct searches by various types of keywords. GGRNA web server will provide a simple and powerful interface for finding genes and transcripts for a wide range of users. All services at GGRNA are provided free of charge to all users. PMID:22641850

GGRNA: an ultrafast, transcript-oriented search engine for genes and transcripts.

PubMed

Naito, Yuki; Bono, Hidemasa

2012-07-01

GGRNA (http://GGRNA.dbcls.jp/) is a Google-like, ultrafast search engine for genes and transcripts. The web server accepts arbitrary words and phrases, such as gene names, IDs, gene descriptions, annotations of gene and even nucleotide/amino acid sequences through one simple search box, and quickly returns relevant RefSeq transcripts. A typical search takes just a few seconds, which dramatically enhances the usability of routine searching. In particular, GGRNA can search sequences as short as 10 nt or 4 amino acids, which cannot be handled easily by popular sequence analysis tools. Nucleotide sequences can be searched allowing up to three mismatches, or the query sequences may contain degenerate nucleotide codes (e.g. N, R, Y, S). Furthermore, Gene Ontology annotations, Enzyme Commission numbers and probe sequences of catalog microarrays are also incorporated into GGRNA, which may help users to conduct searches by various types of keywords. GGRNA web server will provide a simple and powerful interface for finding genes and transcripts for a wide range of users. All services at GGRNA are provided free of charge to all users.

Individual-based approach to epidemic processes on arbitrary dynamic contact networks

NASA Astrophysics Data System (ADS)

Rocha, Luis E. C.; Masuda, Naoki

2016-08-01

The dynamics of contact networks and epidemics of infectious diseases often occur on comparable time scales. Ignoring one of these time scales may provide an incomplete understanding of the population dynamics of the infection process. We develop an individual-based approximation for the susceptible-infected-recovered epidemic model applicable to arbitrary dynamic networks. Our framework provides, at the individual-level, the probability flow over time associated with the infection dynamics. This computationally efficient framework discards the correlation between the states of different nodes, yet provides accurate results in approximating direct numerical simulations. It naturally captures the temporal heterogeneities and correlations of contact sequences, fundamental ingredients regulating the timing and size of an epidemic outbreak, and the number of secondary infections. The high accuracy of our approximation further allows us to detect the index individual of an epidemic outbreak in real-life network data.

On scattering from the one-dimensional multiple Dirac delta potentials

NASA Astrophysics Data System (ADS)

Erman, Fatih; Gadella, Manuel; Uncu, Haydar

2018-05-01

In this paper, we propose a pedagogical presentation of the Lippmann–Schwinger equation as a powerful tool, so as to obtain important scattering information. In particular, we consider a one-dimensional system with a Schrödinger-type free Hamiltonian decorated with a sequence of N attractive Dirac delta interactions. We first write the Lippmann–Schwinger equation for the system and then solve it explicitly in terms of an N × N matrix. Then, we discuss the reflection and the transmission coefficients for an arbitrary number of centres and study the threshold anomaly for the N = 2 and N = 4 cases. We also study further features like the quantum metastable states and resonances, including their corresponding Gamow functions and virtual or antibound states. The use of the Lippmann–Schwinger equation simplifies our analysis enormously and gives exact results for an arbitrary number of Dirac delta potentials.

High-speed multi-frame dynamic transmission electron microscope image acquisition system with arbitrary timing

DOEpatents

Reed, Bryan W.; DeHope, William J.; Huete, Glenn; LaGrange, Thomas B.; Shuttlesworth, Richard M.

2016-02-23

An electron microscope is disclosed which has a laser-driven photocathode and an arbitrary waveform generator (AWG) laser system ("laser"). The laser produces a train of temporally-shaped laser pulses each being of a programmable pulse duration, and directs the laser pulses to the laser-driven photocathode to produce a train of electron pulses. An image sensor is used along with a deflector subsystem. The deflector subsystem is arranged downstream of the target but upstream of the image sensor, and has a plurality of plates. A control system having a digital sequencer controls the laser and a plurality of switching components, synchronized with the laser, to independently control excitation of each one of the deflector plates. This allows each electron pulse to be directed to a different portion of the image sensor, as well as to enable programmable pulse durations and programmable inter-pulse spacings.

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

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

Image secure transmission for optical orthogonal frequency-division multiplexing visible light communication systems using chaotic discrete cosine transform

NASA Astrophysics Data System (ADS)

Wang, Zhongpeng; Zhang, Shaozhong; Chen, Fangni; Wu, Ming-Wei; Qiu, Weiwei

2017-11-01

A physical encryption scheme for orthogonal frequency-division multiplexing (OFDM) visible light communication (VLC) systems using chaotic discrete cosine transform (DCT) is proposed. In the scheme, the row of the DCT matrix is permutated by a scrambling sequence generated by a three-dimensional (3-D) Arnold chaos map. Furthermore, two scrambling sequences, which are also generated from a 3-D Arnold map, are employed to encrypt the real and imaginary parts of the transmitted OFDM signal before the chaotic DCT operation. The proposed scheme enhances the physical layer security and improves the bit error rate (BER) performance for OFDM-based VLC. The simulation results prove the efficiency of the proposed encryption method. The experimental results show that the proposed security scheme not only protects image data from eavesdroppers but also keeps the good BER and peak-to-average power ratio performances for image-based OFDM-VLC systems.

Corruption of genomic databases with anomalous sequence.

PubMed

Lamperti, E D; Kittelberger, J M; Smith, T F; Villa-Komaroff, L

1992-06-11

We describe evidence that DNA sequences from vectors used for cloning and sequencing have been incorporated accidentally into eukaryotic entries in the GenBank database. These incorporations were not restricted to one type of vector or to a single mechanism. Many minor instances may have been the result of simple editing errors, but some entries contained large blocks of vector sequence that had been incorporated by contamination or other accidents during cloning. Some cases involved unusual rearrangements and areas of vector distant from the normal insertion sites. Matches to vector were found in 0.23% of 20,000 sequences analyzed in GenBank Release 63. Although the possibility of anomalous sequence incorporation has been recognized since the inception of GenBank and should be easy to avoid, recent evidence suggests that this problem is increasing more quickly than the database itself. The presence of anomalous sequence may have serious consequences for the interpretation and use of database entries, and will have an impact on issues of database management. The incorporated vector fragments described here may also be useful for a crude estimate of the fidelity of sequence information in the database. In alignments with well-defined ends, the matching sequences showed 96.8% identity to vector; when poorer matches with arbitrary limits were included, the aggregate identity to vector sequence was 94.8%.

On Weak and Strong 2k- bent Boolean Functions

DTIC Science & Technology

2016-01-01

U.S.A. Email: pstanica@nps.edu Abstract—In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent...denotes the complex conjugate of z. An important tool in our analysis is the discrete Fourier transform , known in Boolean functions literature, as Walsh...Hadamard, or Walsh–Hadamard transform , which is the func- tion Wf : Fn2 → C, defined by Wf (u) = 2− n 2 ∑ x∈Vn (−1)f(x)⊕u·x. Any f ∈ Bn can be

Discrete-element simulation of sea-ice mechanics: Contact mechanics and granular jamming

NASA Astrophysics Data System (ADS)

Damsgaard, A.; Adcroft, A.; Sergienko, O. V.; Stern, A. A.

2017-12-01

Lagrangian models of sea-ice dynamics offer several advantages to Eulerian continuum methods. Spatial discretization on the ice-floe scale is natural for Lagrangian models, which additionally offer the convenience of being able to handle arbitrary sea-ice concentrations. This is likely to improve model performance in ice-marginal zones with strong advection. Furthermore, phase transitions in granular rheology around the jamming limit, such as observed when sea ice moves through geometric confinements, includes sharp thresholds in effective viscosity which are typically ignored in Eulerian models. Granular jamming is a stochastic process dependent on having the right grains in the right place at the right time, and the jamming likelihood over time can be described by a probabilistic model. Difficult to parameterize in continuum formulations, jamming occurs naturally in dense granular systems simulated in a Lagrangian framework, and is a very relevant process controlling sea-ice transport through narrow straits. We construct a flexible discrete-element framework for simulating Lagrangian sea-ice dynamics at the ice-floe scale, forced by ocean and atmosphere velocity fields. Using this framework, we demonstrate that frictionless contact models based on compressive stiffness alone are unlikely to jam, and describe two different approaches based on friction and tensile strength which both result in increased bulk shear strength of the granular assemblage. The frictionless but cohesive contact model, with certain tensile strength values, can display jamming behavior which on the large scale is very similar to a more complex and realistic model with contact friction and ice-floe rotation.

Minimum-domain impulse theory for unsteady aerodynamic force

NASA Astrophysics Data System (ADS)

Kang, L. L.; Liu, L. Q.; Su, W. D.; Wu, J. Z.

2018-01-01

We extend the impulse theory for unsteady aerodynamics from its classic global form to finite-domain formulation then to minimum-domain form and from incompressible to compressible flows. For incompressible flow, the minimum-domain impulse theory raises the finding of Li and Lu ["Force and power of flapping plates in a fluid," J. Fluid Mech. 712, 598-613 (2012)] to a theorem: The entire force with discrete wake is completely determined by only the time rate of impulse of those vortical structures still connecting to the body, along with the Lamb-vector integral thereof that captures the contribution of all the rest disconnected vortical structures. For compressible flows, we find that the global form in terms of the curl of momentum ∇ × (ρu), obtained by Huang [Unsteady Vortical Aerodynamics (Shanghai Jiaotong University Press, 1994)], can be generalized to having an arbitrary finite domain, but the formula is cumbersome and in general ∇ × (ρu) no longer has discrete structures and hence no minimum-domain theory exists. Nevertheless, as the measure of transverse process only, the unsteady field of vorticity ω or ρω may still have a discrete wake. This leads to a minimum-domain compressible vorticity-moment theory in terms of ρω (but it is beyond the classic concept of impulse). These new findings and applications have been confirmed by our numerical experiments. The results not only open an avenue to combine the theory with computation-experiment in wide applications but also reveal a physical truth that it is no longer necessary to account for all wake vortical structures in computing the force and moment.

Dispersion analysis of leaky guided waves in fluid-loaded waveguides of generic shape.

PubMed

Mazzotti, M; Marzani, A; Bartoli, I

2014-01-01

A fully coupled 2.5D formulation is proposed to compute the dispersive parameters of waveguides with arbitrary cross-section immersed in infinite inviscid fluids. The discretization of the waveguide is performed by means of a Semi-Analytical Finite Element (SAFE) approach, whereas a 2.5D BEM formulation is used to model the impedance of the surrounding infinite fluid. The kernels of the boundary integrals contain the fundamental solutions of the space Fourier-transformed Helmholtz equation, which governs the wave propagation process in the fluid domain. Numerical difficulties related to the evaluation of singular integrals are avoided by using a regularization procedure. To improve the numerical stability of the discretized boundary integral equations for the external Helmholtz problem, the so called CHIEF method is used. The discrete wave equation results in a nonlinear eigenvalue problem in the complex axial wavenumbers that is solved at the frequencies of interest by means of a contour integral algorithm. In order to separate physical from non-physical solutions and to fulfill the requirement of holomorphicity of the dynamic stiffness matrix inside the complex wavenumber contour, the phase of the radial bulk wavenumber is uniquely defined by enforcing the Snell-Descartes law at the fluid-waveguide interface. Three numerical applications are presented. The computed dispersion curves for a circular bar immersed in oil are in agreement with those extracted using the Global Matrix Method. Novel results are presented for viscoelastic steel bars of square and L-shaped cross-section immersed in water. Copyright © 2013 Elsevier B.V. All rights reserved.

G-sequentially connectedness for topological groups with operations

NASA Astrophysics Data System (ADS)

Mucuk, Osman; Cakalli, Huseyin

2016-08-01

It is a well-known fact that for a Hausdorff topological group X, the limits of convergent sequences in X define a function denoted by lim from the set of all convergent sequences in X to X. This notion has been modified by Connor and Grosse-Erdmann for real functions by replacing lim with an arbitrary linear functional G defined on a linear subspace of the vector space of all real sequences. Recently some authors have extended the concept to the topological group setting and introduced the concepts of G-sequential continuity, G-sequential compactness and G-sequential connectedness. In this work, we present some results about G-sequentially closures, G-sequentially connectedness and fundamental system of G-sequentially open neighbourhoods for topological group with operations which include topological groups, topological rings without identity, R-modules, Lie algebras, Jordan algebras, and many others.

New method to design stellarator coils without the winding surface

NASA Astrophysics Data System (ADS)

Zhu, Caoxiang; Hudson, Stuart R.; Song, Yuntao; Wan, Yuanxi

2018-01-01

Finding an easy-to-build coils set has been a critical issue for stellarator design for decades. Conventional approaches assume a toroidal ‘winding’ surface, but a poorly chosen winding surface can unnecessarily constrain the coil optimization algorithm, This article presents a new method to design coils for stellarators. Each discrete coil is represented as an arbitrary, closed, one-dimensional curve embedded in three-dimensional space. A target function to be minimized that includes both physical requirements and engineering constraints is constructed. The derivatives of the target function with respect to the parameters describing the coil geometries and currents are calculated analytically. A numerical code, named flexible optimized coils using space curves (FOCUS), has been developed. Applications to a simple stellarator configuration, W7-X and LHD vacuum fields are presented.

Unstable spiral waves and local Euclidean symmetry in a model of cardiac tissue.

PubMed

Marcotte, Christopher D; Grigoriev, Roman O

2015-06-01

This paper investigates the properties of unstable single-spiral wave solutions arising in the Karma model of two-dimensional cardiac tissue. In particular, we discuss how such solutions can be computed numerically on domains of arbitrary shape and study how their stability, rotational frequency, and spatial drift depend on the size of the domain as well as the position of the spiral core with respect to the boundaries. We also discuss how the breaking of local Euclidean symmetry due to finite size effects as well as the spatial discretization of the model is reflected in the structure and dynamics of spiral waves. This analysis allows identification of a self-sustaining process responsible for maintaining the state of spiral chaos featuring multiple interacting spirals.

A proof of the Woodward-Lawson sampling method for a finite linear array

NASA Technical Reports Server (NTRS)

Somers, Gary A.

1993-01-01

An extension of the continuous aperture Woodward-Lawson sampling theorem has been developed for a finite linear array of equidistant identical elements with arbitrary excitations. It is shown that by sampling the array factor at a finite number of specified points in the far field, the exact array factor over all space can be efficiently reconstructed in closed form. The specified sample points lie in real space and hence are measurable provided that the interelement spacing is greater than approximately one half of a wavelength. This paper provides insight as to why the length parameter used in the sampling formulas for discrete arrays is larger than the physical span of the lattice points in contrast with the continuous aperture case where the length parameter is precisely the physical aperture length.

On Faraday's law in the presence of extended conductors

NASA Astrophysics Data System (ADS)

Bilbao, Luis

2018-06-01

The use of Faraday's Law of induction for calculating the induced currents in an extended conducting body is discussed. In a general case with arbitrary geometry, the solution to the problem of a moving metal object in the presence of a magnetic field is difficult and implies solving Maxwell's equations in a time-dependent situation. In many cases, including cases with good conductors (but not superconductors) Ampère's Law can be neglected and a simpler solution based solely in Faraday's law can be obtained. The integral form of Faraday's Law along any loop in the conducting body is equivalent to a Kirkhhoff's voltage law of a circuit. Therefore, a numerical solution can be obtained by solving a linear system of equations corresponding to a discrete number of loops in the body.

Measurement of complete and continuous Wigner functions for discrete atomic systems

NASA Astrophysics Data System (ADS)

Tian, Yali; Wang, Zhihui; Zhang, Pengfei; Li, Gang; Li, Jie; Zhang, Tiancai

2018-01-01

We measure complete and continuous Wigner functions of a two-level cesium atom in both a nearly pure state and highly mixed states. We apply the method [T. Tilma et al., Phys. Rev. Lett. 117, 180401 (2016), 10.1103/PhysRevLett.117.180401] of strictly constructing continuous Wigner functions for qubit or spin systems. We find that the Wigner function of all pure states of a qubit has negative regions and the negativity completely vanishes when the purity of an arbitrary mixed state is less than 2/3 . We experimentally demonstrate these findings using a single cesium atom confined in an optical dipole trap, which undergoes a nearly pure dephasing process. Our method can be applied straightforwardly to multi-atom systems for measuring the Wigner function of their collective spin state.

Inferring Markov chains: Bayesian estimation, model comparison, entropy rate, and out-of-class modeling.

PubMed

Strelioff, Christopher C; Crutchfield, James P; Hübler, Alfred W

2007-07-01

Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer kth order Markov chains, for arbitrary k , from finite data by applying Bayesian methods to both parameter estimation and model-order selection. Extending existing results for multinomial models of discrete data, we connect inference to statistical mechanics through information-theoretic (type theory) techniques. We establish a direct relationship between Bayesian evidence and the partition function which allows for straightforward calculation of the expectation and variance of the conditional relative entropy and the source entropy rate. Finally, we introduce a method that uses finite data-size scaling with model-order comparison to infer the structure of out-of-class processes.

Free-form Airfoil Shape Optimization Under Uncertainty Using Maximum Expected Value and Second-order Second-moment Strategies

NASA Technical Reports Server (NTRS)

Huyse, Luc; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

Free-form shape optimization of airfoils poses unexpected difficulties. Practical experience has indicated that a deterministic optimization for discrete operating conditions can result in dramatically inferior performance when the actual operating conditions are different from the - somewhat arbitrary - design values used for the optimization. Extensions to multi-point optimization have proven unable to adequately remedy this problem of "localized optimization" near the sampled operating conditions. This paper presents an intrinsically statistical approach and demonstrates how the shortcomings of multi-point optimization with respect to "localized optimization" can be overcome. The practical examples also reveal how the relative likelihood of each of the operating conditions is automatically taken into consideration during the optimization process. This is a key advantage over the use of multipoint methods.

Non-polynomial extensions of solvable potentials à la Abraham-Moses

DOE Office of Scientific and Technical Information (OSTI.GOV)

Odake, Satoru; Sasaki, Ryu; Center for Theoretical Sciences, National Taiwan University, Taipei 10617, Taiwan

2013-10-15

Abraham-Moses transformations, besides Darboux transformations, are well-known procedures to generate extensions of solvable potentials in one-dimensional quantum mechanics. Here we present the explicit forms of infinitely many seed solutions for adding eigenstates at arbitrary real energy through the Abraham-Moses transformations for typical solvable potentials, e.g., the radial oscillator, the Darboux-Pöschl-Teller, and some others. These seed solutions are simple generalisations of the virtual state wavefunctions, which are obtained from the eigenfunctions by discrete symmetries of the potentials. The virtual state wavefunctions have been an essential ingredient for constructing multi-indexed Laguerre and Jacobi polynomials through multiple Darboux-Crum transformations. In contrast to themore » Darboux transformations, the virtual state wavefunctions generate non-polynomial extensions of solvable potentials through the Abraham-Moses transformations.« less

Multi-level adaptive finite element methods. 1: Variation problems

NASA Technical Reports Server (NTRS)

Brandt, A.

1979-01-01

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

A Varifold Approach to Surface Approximation

NASA Astrophysics Data System (ADS)

Buet, Blanche; Leonardi, Gian Paolo; Masnou, Simon

2017-11-01

We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we introduce the notion of approximate mean curvature and show various convergence results that hold, in particular, for sequences of discrete varifolds associated with point clouds or pixel/voxel-type discretizations of d-surfaces in the Euclidean n-space, without restrictions on dimension and codimension. The variational nature of the approach also allows us to consider surfaces with singularities, and in that case the approximate mean curvature is consistent with the generalized mean curvature of the limit surface. A series of numerical tests are provided in order to illustrate the effectiveness and generality of the method.

Video compression of coronary angiograms based on discrete wavelet transform with block classification.

PubMed

Ho, B T; Tsai, M J; Wei, J; Ma, M; Saipetch, P

1996-01-01

A new method of video compression for angiographic images has been developed to achieve high compression ratio (~20:1) while eliminating block artifacts which leads to loss of diagnostic accuracy. This method adopts motion picture experts group's (MPEGs) motion compensated prediction to takes advantage of frame to frame correlation. However, in contrast to MPEG, the error images arising from mismatches in the motion estimation are encoded by discrete wavelet transform (DWT) rather than block discrete cosine transform (DCT). Furthermore, the authors developed a classification scheme which label each block in an image as intra, error, or background type and encode it accordingly. This hybrid coding can significantly improve the compression efficiency in certain eases. This method can be generalized for any dynamic image sequences applications sensitive to block artifacts.

The effect of spatial discretization upon traveling wave body forcing of a turbulent wall-bounded flow

NASA Astrophysics Data System (ADS)

You, Soyoung; Goldstein, David

2015-11-01

DNS is employed to simulate turbulent channel flow subject to a traveling wave body force field near the wall. The regions in which forces are applied are made progressively more discrete in a sequence of simulations to explore the boundaries between the effects of discrete flow actuators and spatially continuum actuation. The continuum body force field is designed to correspond to the ``optimal'' resolvent mode of McKeon and Sharma (2010), which has the L2 norm of σ1. That is, the normalized harmonic forcing that gives the largest disturbance energy is the first singular mode with the gain of σ1. 2D and 3D resolvent modes are examined at a modest Reτ of 180. For code validation, nominal flow simulations without discretized forcing are compared to previous work by Sharma and Goldstein (2014) in which we find that as we increase the forcing amplitude there is a decrease in the mean velocity and an increase in turbulent kinetic energy. The same force field is then sampled into isolated sub-domains to emulate the effect of discrete physical actuators. Several cases will be presented to explore the dependencies between the level of discretization and the turbulent flow behavior.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Long, T; Chen, M; Jiang, S

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

Two-dimensional arbitrary nano-manipulation on a plasmonic metasurface.

PubMed

Jiang, Min; Wang, Guanghui; Xu, Wenhao; Ji, Wenbin; Zou, Ningmu; Ho, Ho-Pui; Zhang, Xuping

2018-04-01

In this Letter, we report on a plasmonic nano-ellipse metasurface with the purpose of trapping and two-dimensional (2D) arbitrary transport of nanoparticles by means of rotating the polarization of an excitation beam. The locations of hot spots within a metasurface are polarization dependent, thus making it possible to turn on/off the adjacent hot spots and then convey the trapped target by rotating the incident polarization state. For the case of a metasurface with a unit cell of perpendicularly orientated nano-ellipses, the hot spots with higher intensities are located at both apexes of the nano-ellipse whose major axis is parallel to the direction of polarization. When the polarization gradually rotates to its counterpart direction, the trapped particle may move around the ellipse and transfer to the most adjacent ellipse, due to the unbalanced trap potentials around the nano-ellipse. Clockwise and counterclockwise rotation would guide the particle in a different direction, which makes it possible to convey the particle arbitrarily within the plasmonic metasurface by setting a time sequence of polarization rotation. As confirmed by the three-dimensional finite-difference time-domain analysis, our design offers a novel scheme of 2D arbitrary transport with nanometer accuracy, which could be used in many on-chip optofluidic applications.

Coherent optical pulse sequencer for quantum applications.

PubMed

Hosseini, Mahdi; Sparkes, Ben M; Hétet, Gabriel; Longdell, Jevon J; Lam, Ping Koy; Buchler, Ben C

2009-09-10

The bandwidth and versatility of optical devices have revolutionized information technology systems and communication networks. Precise and arbitrary control of an optical field that preserves optical coherence is an important requisite for many proposed photonic technologies. For quantum information applications, a device that allows storage and on-demand retrieval of arbitrary quantum states of light would form an ideal quantum optical memory. Recently, significant progress has been made in implementing atomic quantum memories using electromagnetically induced transparency, photon echo spectroscopy, off-resonance Raman spectroscopy and other atom-light interaction processes. Single-photon and bright-optical-field storage with quantum states have both been successfully demonstrated. Here we present a coherent optical memory based on photon echoes induced through controlled reversible inhomogeneous broadening. Our scheme allows storage of multiple pulses of light within a chosen frequency bandwidth, and stored pulses can be recalled in arbitrary order with any chosen delay between each recalled pulse. Furthermore, pulses can be time-compressed, time-stretched or split into multiple smaller pulses and recalled in several pieces at chosen times. Although our experimental results are so far limited to classical light pulses, our technique should enable the construction of an optical random-access memory for time-bin quantum information, and have potential applications in quantum information processing.

Limit cycles in piecewise-affine gene network models with multiple interaction loops

NASA Astrophysics Data System (ADS)

Farcot, Etienne; Gouzé, Jean-Luc

2010-01-01

In this article, we consider piecewise affine differential equations modelling gene networks. We work with arbitrary decay rates, and under a local hypothesis expressed as an alignment condition of successive focal points. The interaction graph of the system may be rather complex (multiple intricate loops of any sign, multiple thresholds, etc.). Our main result is an alternative theorem showing that if a sequence of region is periodically visited by trajectories, then under our hypotheses, there exists either a unique stable periodic solution, or the origin attracts all trajectories in this sequence of regions. This result extends greatly our previous work on a single negative feedback loop. We give several examples and simulations illustrating different cases.

Arrays of probes for positional sequencing by hybridization

DOEpatents

Cantor, Charles R [Boston, MA; Prezetakiewiczr, Marek [East Boston, MA; Smith, Cassandra L [Boston, MA; Sano, Takeshi [Waltham, MA

2008-01-15

This invention is directed to methods and reagents useful for sequencing nucleic acid targets utilizing sequencing by hybridization technology comprising probes, arrays of probes and methods whereby sequence information is obtained rapidly and efficiently in discrete packages. That information can be used for the detection, identification, purification and complete or partial sequencing of a particular target nucleic acid. When coupled with a ligation step, these methods can be performed under a single set of hybridization conditions. The invention also relates to the replication of probe arrays and methods for making and replicating arrays of probes which are useful for the large scale manufacture of diagnostic aids used to screen biological samples for specific target sequences. Arrays created using PCR technology may comprise probes with 5'- and/or 3'-overhangs.

Complete mitochondrial genome of Platevindex sp. (Gastropoda: Pulmonata: Systellommatophora: Onchidiidae).

PubMed

Liu, Chen; Shen, He Ding; Zhou, Na

2016-01-01

The complete mitochondrial genome sequence of Platevindex sp. is firstly described in the article. The mitogenome (13,908 bp) contains 22 tRNA genes, 2 ribosomal RNA genes and 13 protein-coding genes, and 1 putative control region (CR). CR is not well characterized due to lack of discrete conserved sequence blocks. This characteristic is similar with CRs of other invertebrate mitochondrial genomes. The characteristic is the typical bivalvia mitochondrial gene composition.

Sequence Complexity of Amyloidogenic Regions in Intrinsically Disordered Human Proteins

PubMed Central

Das, Swagata; Pal, Uttam; Das, Supriya; Bagga, Khyati; Roy, Anupam; Mrigwani, Arpita; Maiti, Nakul C.

2014-01-01

An amyloidogenic region (AR) in a protein sequence plays a significant role in protein aggregation and amyloid formation. We have investigated the sequence complexity of AR that is present in intrinsically disordered human proteins. More than 80% human proteins in the disordered protein databases (DisProt+IDEAL) contained one or more ARs. With decrease of protein disorder, AR content in the protein sequence was decreased. A probability density distribution analysis and discrete analysis of AR sequences showed that ∼8% residue in a protein sequence was in AR and the region was in average 8 residues long. The residues in the AR were high in sequence complexity and it seldom overlapped with low complexity regions (LCR), which was largely abundant in disorder proteins. The sequences in the AR showed mixed conformational adaptability towards α-helix, β-sheet/strand and coil conformations. PMID:24594841

Quantized discrete space oscillators

NASA Technical Reports Server (NTRS)

Uzes, C. A.; Kapuscik, Edward

1993-01-01

A quasi-canonical sequence of finite dimensional quantizations was found which has canonical quantization as its limit. In order to demonstrate its practical utility and its numerical convergence, this formalism is applied to the eigenvalue and 'eigenfunction' problem of several harmonic and anharmonic oscillators.

SPIDYAN, a MATLAB library for simulating pulse EPR experiments with arbitrary waveform excitation.

PubMed

Pribitzer, Stephan; Doll, Andrin; Jeschke, Gunnar

2016-02-01

Frequency-swept chirp pulses, created with arbitrary waveform generators (AWGs), can achieve inversion over a range of several hundreds of MHz. Such passage pulses provide defined flip angles and increase sensitivity. The fact that spectra are not excited at once, but single transitions are passed one after another, can cause new effects in established pulse EPR sequences. We developed a MATLAB library for simulation of pulse EPR, which is especially suited for modeling spin dynamics in ultra-wideband (UWB) EPR experiments, but can also be used for other experiments and NMR. At present the command line controlled SPin DYnamics ANalysis (SPIDYAN) package supports one-spin and two-spin systems with arbitrary spin quantum numbers. By providing the program with appropriate spin operators and Hamiltonian matrices any spin system is accessible, with limits set only by available memory and computation time. Any pulse sequence using rectangular and linearly or variable-rate frequency-swept chirp pulses, including phase cycling can be quickly created. To keep track of spin evolution the user can choose from a vast variety of detection operators, including transition selective operators. If relaxation effects can be neglected, the program solves the Liouville-von Neumann equation and propagates spin density matrices. In the other cases SPIDYAN uses the quantum mechanical master equation and Liouvillians for propagation. In order to consider the resonator response function, which on the scale of UWB excitation limits bandwidth, the program includes a simple RLC circuit model. Another subroutine can compute waveforms that, for a given resonator, maintain a constant critical adiabaticity factor over the excitation band. Computational efficiency is enhanced by precomputing propagator lookup tables for the whole set of AWG output levels. The features of the software library are discussed and demonstrated with spin-echo and population transfer simulations. Copyright © 2016 Elsevier Inc. All rights reserved.

Automated Classification and Removal of EEG Artifacts With SVM and Wavelet-ICA.

PubMed

Sai, Chong Yeh; Mokhtar, Norrima; Arof, Hamzah; Cumming, Paul; Iwahashi, Masahiro

2018-05-01

Brain electrical activity recordings by electroencephalography (EEG) are often contaminated with signal artifacts. Procedures for automated removal of EEG artifacts are frequently sought for clinical diagnostics and brain-computer interface applications. In recent years, a combination of independent component analysis (ICA) and discrete wavelet transform has been introduced as standard technique for EEG artifact removal. However, in performing the wavelet-ICA procedure, visual inspection or arbitrary thresholding may be required for identifying artifactual components in the EEG signal. We now propose a novel approach for identifying artifactual components separated by wavelet-ICA using a pretrained support vector machine (SVM). Our method presents a robust and extendable system that enables fully automated identification and removal of artifacts from EEG signals, without applying any arbitrary thresholding. Using test data contaminated by eye blink artifacts, we show that our method performed better in identifying artifactual components than did existing thresholding methods. Furthermore, wavelet-ICA in conjunction with SVM successfully removed target artifacts, while largely retaining the EEG source signals of interest. We propose a set of features including kurtosis, variance, Shannon's entropy, and range of amplitude as training and test data of SVM to identify eye blink artifacts in EEG signals. This combinatorial method is also extendable to accommodate multiple types of artifacts present in multichannel EEG. We envision future research to explore other descriptive features corresponding to other types of artifactual components.

The behavior of plasma with an arbitrary degree of degeneracy of electron gas in the conductive layer

NASA Astrophysics Data System (ADS)

Latyshev, A. V.; Gordeeva, N. M.

2017-09-01

We obtain an analytic solution of the boundary problem for the behavior (fluctuations) of an electron plasma with an arbitrary degree of degeneracy of the electron gas in the conductive layer in an external electric field. We use the kinetic Vlasov-Boltzmann equation with the Bhatnagar-Gross-Krook collision integral and the Maxwell equation for the electric field. We use the mirror boundary conditions for the reflections of electrons from the layer boundary. The boundary problem reduces to a one-dimensional problem with a single velocity. For this, we use the method of consecutive approximations, linearization of the equations with respect to the absolute distribution of the Fermi-Dirac electrons, and the conservation law for the number of particles. Separation of variables then helps reduce the problem equations to a characteristic system of equations. In the space of generalized functions, we find the eigensolutions of the initial system, which correspond to the continuous spectrum (Van Kampen mode). Solving the dispersion equation, we then find the eigensolutions corresponding to the adjoint and discrete spectra (Drude and Debye modes). We then construct the general solution of the boundary problem by decomposing it into the eigensolutions. The coefficients of the decomposition are given by the boundary conditions. This allows obtaining the decompositions of the distribution function and the electric field in explicit form.

The initial-value problem for viscous channel flows

NASA Technical Reports Server (NTRS)

Criminale, W. O.; Jackson, T. L.; Lasseigne, D. G.

1995-01-01

Plane viscous channel flows are perturbed and the ensuing initial-value problems are investigated in detail. Unlike traditional methods where traveling wave normal modes are assumed for solution, this works offers a means whereby completely arbitrary initial input can be specified without having to resort to eigenfunction expansions. The full temporal behavior, including both early time transients and the long time asymptotics, can be determined for any initial disturbance. Effects of three-dimensionality can be assessed. The bases for the analysis are: (a) linearization of the governing equations; (b) Fourier decomposition in the spanwise and streamwise directions of the flow; and (c) direct numerical integration of the resulting partial differential equations. All of the stability data that are known for such flows can be reproduced. Also, the optimal initial condition can be determined in a straight forward manner and such optimal conditions clearly reflect transient growth data that is easily determined by a rational choice of a basis for the initial conditions. Although there can be significant transient growth for subcritical values of the Reynolds number using this approach it does not appear possible that arbitrary initial conditions will lead to the exceptionally large transient amplitudes that have been determined by optimization of normal modes. The approach is general and can be applied to other classes of problems where only a finite discrete spectrum exists, such as the boundary layer for example.

Two hybridization events define the population structure of Trypanosoma cruzi.

PubMed

Westenberger, Scott J; Barnabé, Christian; Campbell, David A; Sturm, Nancy R

2005-10-01

Genetic variation in Trypanosoma cruzi is likely a key determinant in transmission and pathogenesis of Chagas disease. We have examined nine loci as markers for the extant T. cruzi strains. Four distinct alleles were found for each locus, corresponding to the sequence classes present in the homozygous discrete typing units (DTUs) I, IIa, IIb, and IIc. The alleles in DTUs IIa and IIc showed a spectrum of polymorphism ranging from DTU I-like to DTU IIb-like, in addition to DTU-specific sequence variation. DTUs IId and IIe were indistinguishable, showing DTU homozygosity at one locus and heterozygosity with DTU IIb and IIc allelic sequences at eight loci. Recombination between the DTU IIb and IIc alleles is evidenced from mosaic polymorphisms. These data imply that two discrete hybridization events resulted in the formation of the current DTUs. We propose a model in which a fusion between ancestral DTU I and IIb strains gave rise to a heterozygous hybrid that homogenized its genome to become the homozygous progenitor of DTUs IIa and IIc. The second hybridization between DTU IIb and IIc strains that generated DTUs IId and IIe resulted in extensive heterozygosity with subsequent recombination of parental genotypes.

Whale song analyses using bioinformatics sequence analysis approaches

NASA Astrophysics Data System (ADS)

Chen, Yian A.; Almeida, Jonas S.; Chou, Lien-Siang

2005-04-01

Animal songs are frequently analyzed using discrete hierarchical units, such as units, themes and songs. Because animal songs and bio-sequences may be understood as analogous, bioinformatics analysis tools DNA/protein sequence alignment and alignment-free methods are proposed to quantify the theme similarities of the songs of false killer whales recorded off northeast Taiwan. The eighteen themes with discrete units that were identified in an earlier study [Y. A. Chen, masters thesis, University of Charleston, 2001] were compared quantitatively using several distance metrics. These metrics included the scores calculated using the Smith-Waterman algorithm with the repeated procedure; the standardized Euclidian distance and the angle metrics based on word frequencies. The theme classifications based on different metrics were summarized and compared in dendrograms using cluster analyses. The results agree with earlier classifications derived by human observation qualitatively. These methods further quantify the similarities among themes. These methods could be applied to the analyses of other animal songs on a larger scale. For instance, these techniques could be used to investigate song evolution and cultural transmission quantifying the dissimilarities of humpback whale songs across different seasons, years, populations, and geographic regions. [Work supported by SC Sea Grant, and Ilan County Government, Taiwan.

State space truncation with quantified errors for accurate solutions to discrete Chemical Master Equation

PubMed Central

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-01-01

The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEG), we truncate the state space by limiting the total molecular copy numbers in each MEG. We further describe a theoretical framework for analysis of the truncation error in the steady state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of 1) the birth and death model, 2) the single gene expression model, 3) the genetic toggle switch model, and 4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate out theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks. PMID:27105653

State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cao, Youfang; Terebus, Anna; Liang, Jie

The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. Wemore » further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks.« less

State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation

DOE PAGES

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-04-22

The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. Wemore » further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks.« less

Delay-induced wave instabilities in single-species reaction-diffusion systems

NASA Astrophysics Data System (ADS)

Otto, Andereas; Wang, Jian; Radons, Günter

2017-11-01

The Turing (wave) instability is only possible in reaction-diffusion systems with more than one (two) components. Motivated by the fact that a time delay increases the dimension of a system, we investigate the presence of diffusion-driven instabilities in single-species reaction-diffusion systems with delay. The stability of arbitrary one-component systems with a single discrete delay, with distributed delay, or with a variable delay is systematically analyzed. We show that a wave instability can appear from an equilibrium of single-species reaction-diffusion systems with fluctuating or distributed delay, which is not possible in similar systems with constant discrete delay or without delay. More precisely, we show by basic analytic arguments and by numerical simulations that fast asymmetric delay fluctuations or asymmetrically distributed delays can lead to wave instabilities in these systems. Examples, for the resulting traveling waves are shown for a Fisher-KPP equation with distributed delay in the reaction term. In addition, we have studied diffusion-induced instabilities from homogeneous periodic orbits in the same systems with variable delay, where the homogeneous periodic orbits are attracting resonant periodic solutions of the system without diffusion, i.e., periodic orbits of the Hutchinson equation with time-varying delay. If diffusion is introduced, standing waves can emerge whose temporal period is equal to the period of the variable delay.

Chrestenson transform FPGA embedded factorizations.

PubMed

Corinthios, Michael J

2016-01-01

Chrestenson generalized Walsh transform factorizations for parallel processing imbedded implementations on field programmable gate arrays are presented. This general base transform, sometimes referred to as the Discrete Chrestenson transform, has received special attention in recent years. In fact, the Discrete Fourier transform and Walsh-Hadamard transform are but special cases of the Chrestenson generalized Walsh transform. Rotations of a base-p hypercube, where p is an arbitrary integer, are shown to produce dynamic contention-free memory allocation, in processor architecture. The approach is illustrated by factorizations involving the processing of matrices of the transform which are function of four variables. Parallel operations are implemented matrix multiplications. Each matrix, of dimension N × N, where N = p (n) , n integer, has a structure that depends on a variable parameter k that denotes the iteration number in the factorization process. The level of parallelism, in the form of M = p (m) processors can be chosen arbitrarily by varying m between zero to its maximum value of n - 1. The result is an equation describing the generalised parallelism factorization as a function of the four variables n, p, k and m. Applications of the approach are shown in relation to configuring field programmable gate arrays for digital signal processing applications.

An equilibrium-preserving discretization for the nonlinear Rosenbluth-Fokker-Planck operator in arbitrary multi-dimensional geometry

NASA Astrophysics Data System (ADS)

Taitano, W. T.; Chacón, L.; Simakov, A. N.

2017-06-01

The Fokker-Planck collision operator is an advection-diffusion operator which describe dynamical systems such as weakly coupled plasmas [1,2], photonics in high temperature environment [3,4], biological [5], and even social systems [6]. For plasmas in the continuum, the Fokker-Planck collision operator supports such important physical properties as conservation of number, momentum, and energy, as well as positivity. It also obeys the Boltzmann's H-theorem [7-11], i.e., the operator increases the system entropy while simultaneously driving the distribution function towards a Maxwellian. In the discrete, when these properties are not ensured, numerical simulations can either fail catastrophically or suffer from significant numerical pollution [12,13]. There is strong emphasis in the literature on developing numerical techniques to solve the Fokker-Planck equation while preserving these properties [12-24]. In this short note, we focus on the analytical equilibrium preserving property, meaning that the Fokker-Planck collision operator vanishes when acting on an analytical Maxwellian distribution function. The equilibrium preservation property is especially important, for example, when one is attempting to capture subtle transport physics. Since transport arises from small O (ɛ) corrections to the equilibrium [25] (where ɛ is a small expansion parameter), numerical truncation error present in the equilibrium solution may dominate, overwhelming transport dynamics.

Numerical calculation of listener-specific head-related transfer functions and sound localization: Microphone model and mesh discretization

PubMed Central

Ziegelwanger, Harald; Majdak, Piotr; Kreuzer, Wolfgang

2015-01-01

Head-related transfer functions (HRTFs) can be numerically calculated by applying the boundary element method on the geometry of a listener’s head and pinnae. The calculation results are defined by geometrical, numerical, and acoustical parameters like the microphone used in acoustic measurements. The scope of this study was to estimate requirements on the size and position of the microphone model and on the discretization of the boundary geometry as triangular polygon mesh for accurate sound localization. The evaluation involved the analysis of localization errors predicted by a sagittal-plane localization model, the comparison of equivalent head radii estimated by a time-of-arrival model, and the analysis of actual localization errors obtained in a sound-localization experiment. While the average edge length (AEL) of the mesh had a negligible effect on localization performance in the lateral dimension, the localization performance in sagittal planes, however, degraded for larger AELs with the geometrical error as dominant factor. A microphone position at an arbitrary position at the entrance of the ear canal, a microphone size of 1 mm radius, and a mesh with 1 mm AEL yielded a localization performance similar to or better than observed with acoustically measured HRTFs. PMID:26233020

Magnetic-dipole-to-electric-quadrupole cross-susceptibilities for relativistic hydrogenlike atoms in some low-lying discrete energy eigenstates

NASA Astrophysics Data System (ADS)

Stefańska, Patrycja

2017-01-01

In this paper we present tabulated data for magnetic-dipole-to-electric-quadrupole cross-susceptibilities (χ M 1 →E 2) for Dirac one-electron atoms with a pointlike, spinless and motionless nucleus of charge Ze. Numerical values of this susceptibility for the hydrogen atom (Z = 1) and for hydrogenic ions with 2 ⩽ Z ⩽ 137 are computed from the general analytical formula, recently derived by us (Stefanska, 2016), valid for an arbitrary discrete energy eigenstate. In this work we provide 30 tables with the values of χ M 1 →E 2 for the ground state, and also for the first, the second and the third set of excited states (i.e.: 2s1/2, 2p1/2, 2p3/2, 3s1/2, 3p1/2, 3p3/2, 3d3/2, 3d5/2, 4s1/2, 4p1/2, 4p3/2, 4d3/2, 4d5/2, 4f5/2 and 4f7/2) of the relativistic hydrogenlike atoms. The value of the inverse of the fine-structure constant used in the calculations is α-1 = 137.035999139, and was taken from CODATA 2014.

Viscid-inviscid interaction associated with incompressible flow past wedges at high Reynolds number

NASA Technical Reports Server (NTRS)

Warpinski, N. R.; Chow, W. L.

1977-01-01

An analytical method is suggested for the study of the viscid inviscid interaction associated with incompressible flow past wedges with arbitrary angles. It is shown that the determination of the nearly constant pressure (base pressure) prevailing within the near wake is really the heart of the problem, and the pressure can only be established from these interactive considerations. The basic free streamline flow field is established through two discrete parameters which adequately describe the inviscid flow around the body and the wake. The viscous flow processes such as the boundary layer buildup, turbulent jet mixing, and recompression are individually analyzed and attached to the inviscid flow in the sense of the boundary layer concept. The interaction between the viscous and inviscid streams is properly displayed by the fact that the aforementioned discrete parameters needed for the inviscid flow are determined by the viscous flow condition at the point of reattachment. It is found that the reattachment point behaves as a saddle point singularity for the system of equations describing the recompressive viscous flow processes, and this behavior is exploited for the establishment of the overall flow field. Detailed results such as the base pressure, pressure distributions on the wedge, and the geometry of the wake are determined as functions of the wedge angle.

Artificial perfect electric conductor-perfect magnetic conductor anisotropic metasurface for generating orbital angular momentum of microwave with nearly perfect conversion efficiency

NASA Astrophysics Data System (ADS)

Chen, Menglin L. N.; Jiang, Li Jun; Sha, Wei E. I.

2016-02-01

Orbital angular momentum (OAM) is a promising degree of freedom for fundamental studies in electromagnetics and quantum mechanics. The unlimited state space of OAM shows a great potential to enhance channel capacities of classical and quantum communications. By exploring the Pancharatnam-Berry phase concept and engineering anisotropic scatterers in a metasurface with spatially varying orientations, a plane wave with zero OAM can be converted to a vortex beam carrying nonzero OAM. In this paper, we proposed two types of novel perfect electric conductor-perfect magnetic conductor anisotropic metasurfaces. One is composed of azimuthally continuous loops and the other is constructed by azimuthally discontinuous dipole scatterers. Both types of metasurfaces are mounted on a mushroom-type high impedance surface. Compared to previous metasurface designs for generating OAM, the proposed ones achieve nearly perfect conversion efficiency. In view of the eliminated vertical component of electric field, the continuous metasurface shows very smooth phase pattern at the near-field region, which cannot be achieved by convectional metasurfaces composed of discrete scatterers. On the other hand, the metasurface with discrete dipole scatterers shows a great flexibility to generate OAM with arbitrary topological charges. Our work is fundamentally and practically important to high-performance OAM generation.

A Hidden Markov Model Approach for Simultaneously Estimating Local Ancestry and Admixture Time Using Next Generation Sequence Data in Samples of Arbitrary Ploidy

PubMed Central

Nielsen, Rasmus

2017-01-01

Admixture—the mixing of genomes from divergent populations—is increasingly appreciated as a central process in evolution. To characterize and quantify patterns of admixture across the genome, a number of methods have been developed for local ancestry inference. However, existing approaches have a number of shortcomings. First, all local ancestry inference methods require some prior assumption about the expected ancestry tract lengths. Second, existing methods generally require genotypes, which is not feasible to obtain for many next-generation sequencing projects. Third, many methods assume samples are diploid, however a wide variety of sequencing applications will fail to meet this assumption. To address these issues, we introduce a novel hidden Markov model for estimating local ancestry that models the read pileup data, rather than genotypes, is generalized to arbitrary ploidy, and can estimate the time since admixture during local ancestry inference. We demonstrate that our method can simultaneously estimate the time since admixture and local ancestry with good accuracy, and that it performs well on samples of high ploidy—i.e. 100 or more chromosomes. As this method is very general, we expect it will be useful for local ancestry inference in a wider variety of populations than what previously has been possible. We then applied our method to pooled sequencing data derived from populations of Drosophila melanogaster on an ancestry cline on the east coast of North America. We find that regions of local recombination rates are negatively correlated with the proportion of African ancestry, suggesting that selection against foreign ancestry is the least efficient in low recombination regions. Finally we show that clinal outlier loci are enriched for genes associated with gene regulatory functions, consistent with a role of regulatory evolution in ecological adaptation of admixed D. melanogaster populations. Our results illustrate the potential of local ancestry inference for elucidating fundamental evolutionary processes. PMID:28045893

Novel non-parametric models to estimate evolutionary rates and divergence times from heterochronous sequence data.

PubMed

Fourment, Mathieu; Holmes, Edward C

2014-07-24

Early methods for estimating divergence times from gene sequence data relied on the assumption of a molecular clock. More sophisticated methods were created to model rate variation and used auto-correlation of rates, local clocks, or the so called "uncorrelated relaxed clock" where substitution rates are assumed to be drawn from a parametric distribution. In the case of Bayesian inference methods the impact of the prior on branching times is not clearly understood, and if the amount of data is limited the posterior could be strongly influenced by the prior. We develop a maximum likelihood method--Physher--that uses local or discrete clocks to estimate evolutionary rates and divergence times from heterochronous sequence data. Using two empirical data sets we show that our discrete clock estimates are similar to those obtained by other methods, and that Physher outperformed some methods in the estimation of the root age of an influenza virus data set. A simulation analysis suggests that Physher can outperform a Bayesian method when the real topology contains two long branches below the root node, even when evolution is strongly clock-like. These results suggest it is advisable to use a variety of methods to estimate evolutionary rates and divergence times from heterochronous sequence data. Physher and the associated data sets used here are available online at http://code.google.com/p/physher/.

Equation-free and variable free modeling for complex/multiscale systems. Coarse-grained computation in science and engineering using fine-grained models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kevrekidis, Ioannis G.

The work explored the linking of modern developing machine learning techniques (manifold learning and in particular diffusion maps) with traditional PDE modeling/discretization/scientific computation techniques via the equation-free methodology developed by the PI. The result (in addition to several PhD degrees, two of them by CSGF Fellows) was a sequence of strong developments - in part on the algorithmic side, linking data mining with scientific computing, and in part on applications, ranging from PDE discretizations to molecular dynamics and complex network dynamics.

Discrete X-Ray Source Populations and Star Formation History in Nearby Galaxies

NASA Technical Reports Server (NTRS)

Zezas, Andreas; Hasan, Hashima (Technical Monitor)

2005-01-01

This program aims in understanding the connection between the discrete X-ray source populations observed in nearby galaxies and the history of star-formation in these galaxies. The ultimate goal is to use this knowledge in order to constrain X-ray binary evolution channels. For this reason although the program is primarily observational it has a significant modeling component. During the second year of this study we focused on detailed studies of the Antennae galaxies and the Small Magellanic Cloud (SMC). We also performed the initial analysis of the 5 galaxies forming a starburst-age sequence.

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

PubMed

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

2018-05-01

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

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

NASA Astrophysics Data System (ADS)

Bouganssa, Issam; Sbihi, Mohamed; Zaim, Mounia

2017-07-01

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

Isotropic 3-D T2-weighted spin-echo for abdominal and pelvic MRI in children.

PubMed

Dias, Sílvia Costa; Ølsen, Oystein E

2012-11-01

MRI has a fundamental role in paediatric imaging. The T2-weighted fast/turbo spin-echo sequence is important because it has high signal-to-noise ratio compared to gradient-echo sequences. It is usually acquired as 2-D sections in one or more planes. Volumetric spin-echo has until recently only been possible with very long echo times due to blurring of the soft-tissue contrast with long echo trains. A new 3-D spin-echo sequence uses variable flip angles to overcome this problem. It may reproduce useful soft-tissue contrast, with improved spatial resolution. Its isotropic capability allows subsequent reconstruction in standard, curved or arbitrary planes. It may be particularly useful for visualisation of small lesions, or if large lesions distort the usual anatomical relations. We present clinical examples, describe the technical parameters and discuss some potential artefacts and optimisation of image quality.

Phase correction, phase resetting, and phase shifts after subliminal timing perturbations in sensorimotor synchronization.

PubMed

Repp, B H

2001-06-01

Recent studies of synchronized finger tapping have shown that perceptually subliminal phase shifts in an auditory sequence are rapidly compensated for in the motor activity (B. H. Repp, 2000a). Experiment 1 used a continuation-tapping task to confirm that this compensation is indeed a phase correction, not an adjustment of the central timekeeper period. Experiments 2-5 revealed that this phase correction occurs even when there is no ordinary sensorimotor asynchrony--when the finger taps are in antiphase or arbitrary phase relative to the auditory sequence (Experiments 2 and 3) or when the tap coinciding with the sequence phase shift is withheld (Experiments 4 and 5). The phase correction observed in the latter conditions was instantaneous, which suggests that phase resetting occurs when the motor activity is discontinuous. A prolonged phase shift suggestive of overcompensation was observed in some conditions, which poses a challenge to pure phase correction models.

The Unique Significance and Origin of the Cretaceous-Tertiary Boundary: Historical Context and Burdens of Proof

NASA Technical Reports Server (NTRS)

Ryder, Graham

1996-01-01

The abruptness and intensity of the Cretaceous-Tertiary boundary have been deemphasized by some authors over recent years, mainly by those skeptical of an impact origin for the boundary. However, it was recognized at the birth of stratigraphy as both abrupt and of major importance. It was used to define the change from the Mesozoic to the Cenozoic; the boundary has become continually more precisely defined and its global sequences more correlatable. It is now unique in being an event boundary marked by an iridium-bearing layer of global extent, rather than an arbitrary boundary in a sequence of little change. The Permian-Triassic boundary, in contrast, is arbitrary and the transition is not yet proven to be abrupt, the extinctions that define it perhaps having taken place in pulses over several millions of years. Some of those who have denied the importance (and in some cases even the existence) of an impact in the Cretaceous-Tertiary extinctions have placed burdens of proof on the impact hypothesis that they do not place on strictly terrestrial mechanisms. Terrestrial mechanisms have always been unsatisfactory (or at least unconvincing for global, massive, multienvironment faunal change) and are now even more so. Some authors have required of the impact hypothesis attributes that are not inherent in it, including particular patterns of extinction selectivity and timing.

Merging of multi-string BWTs with applications

PubMed Central

Holt, James; McMillan, Leonard

2014-01-01

Motivation: The throughput of genomic sequencing has increased to the point that is overrunning the rate of downstream analysis. This, along with the desire to revisit old data, has led to a situation where large quantities of raw, and nearly impenetrable, sequence data are rapidly filling the hard drives of modern biology labs. These datasets can be compressed via a multi-string variant of the Burrows–Wheeler Transform (BWT), which provides the side benefit of searches for arbitrary k-mers within the raw data as well as the ability to reconstitute arbitrary reads as needed. We propose a method for merging such datasets for both increased compression and downstream analysis. Results: We present a novel algorithm that merges multi-string BWTs in O(LCS×N) time where LCS is the length of their longest common substring between any of the inputs, and N is the total length of all inputs combined (number of symbols) using O(N×log2(F)) bits where F is the number of multi-string BWTs merged. This merged multi-string BWT is also shown to have a higher compressibility compared with the input multi-string BWTs separately. Additionally, we explore some uses of a merged multi-string BWT for bioinformatics applications. Availability and implementation: The MSBWT package is available through PyPI with source code located at https://code.google.com/p/msbwt/. Contact: holtjma@cs.unc.edu PMID:25172922

Cloning and sequence analysis of complementary DNA encoding an aberrantly rearranged human T-cell gamma chain.

PubMed Central

Dialynas, D P; Murre, C; Quertermous, T; Boss, J M; Leiden, J M; Seidman, J G; Strominger, J L

1986-01-01

Complementary DNA (cDNA) encoding a human T-cell gamma chain has been cloned and sequenced. At the junction of the variable and joining regions, there is an apparent deletion of two nucleotides in the human cDNA sequence relative to the murine gamma-chain cDNA sequence, resulting simultaneously in the generation of an in-frame stop codon and in a translational frameshift. For this reason, the sequence presented here encodes an aberrantly rearranged human T-cell gamma chain. There are several surprising differences between the deduced human and murine gamma-chain amino acid sequences. These include poor homology in the variable region, poor homology in a discrete segment of the constant region precisely bounded by the expected junctions of exon CII, and the presence in the human sequence of five potential sites for N-linked glycosylation. Images PMID:3458221

A modular DNA signal translator for the controlled release of a protein by an aptamer.

PubMed

Beyer, Stefan; Simmel, Friedrich C

2006-01-01

Owing to the intimate linkage of sequence and structure in nucleic acids, DNA is an extremely attractive molecule for the development of molecular devices, in particular when a combination of information processing and chemomechanical tasks is desired. Many of the previously demonstrated devices are driven by hybridization between DNA 'effector' strands and specific recognition sequences on the device. For applications it is of great interest to link several of such molecular devices together within artificial reaction cascades. Often it will not be possible to choose DNA sequences freely, e.g. when functional nucleic acids such as aptamers are used. In such cases translation of an arbitrary 'input' sequence into a desired effector sequence may be required. Here we demonstrate a molecular 'translator' for information encoded in DNA and show how it can be used to control the release of a protein by an aptamer using an arbitrarily chosen DNA input strand. The function of the translator is based on branch migration and the action of the endonuclease FokI. The modular design of the translator facilitates the adaptation of the device to various input or output sequences.

A modular DNA signal translator for the controlled release of a protein by an aptamer

PubMed Central

Beyer, Stefan; Simmel, Friedrich C.

2006-01-01

Owing to the intimate linkage of sequence and structure in nucleic acids, DNA is an extremely attractive molecule for the development of molecular devices, in particular when a combination of information processing and chemomechanical tasks is desired. Many of the previously demonstrated devices are driven by hybridization between DNA ‘effector’ strands and specific recognition sequences on the device. For applications it is of great interest to link several of such molecular devices together within artificial reaction cascades. Often it will not be possible to choose DNA sequences freely, e.g. when functional nucleic acids such as aptamers are used. In such cases translation of an arbitrary ‘input’ sequence into a desired effector sequence may be required. Here we demonstrate a molecular ‘translator’ for information encoded in DNA and show how it can be used to control the release of a protein by an aptamer using an arbitrarily chosen DNA input strand. The function of the translator is based on branch migration and the action of the endonuclease FokI. The modular design of the translator facilitates the adaptation of the device to various input or output sequences. PMID:16547201

Assembly of highly repetitive genomes using short reads: the genome of discrete typing unit III Trypanosoma cruzi strain 231.

PubMed

Baptista, Rodrigo P; Reis-Cunha, Joao Luis; DeBarry, Jeremy D; Chiari, Egler; Kissinger, Jessica C; Bartholomeu, Daniella C; Macedo, Andrea M

2018-02-14

Next-generation sequencing (NGS) methods are low-cost high-throughput technologies that produce thousands to millions of sequence reads. Despite the high number of raw sequence reads, their short length, relative to Sanger, PacBio or Nanopore reads, complicates the assembly of genomic repeats. Many genome tools are available, but the assembly of highly repetitive genome sequences using only NGS short reads remains challenging. Genome assembly of organisms responsible for important neglected diseases such as Trypanosoma cruzi, the aetiological agent of Chagas disease, is known to be challenging because of their repetitive nature. Only three of six recognized discrete typing units (DTUs) of the parasite have their draft genomes published and therefore genome evolution analyses in the taxon are limited. In this study, we developed a computational workflow to assemble highly repetitive genomes via a combination of de novo and reference-based assembly strategies to better overcome the intrinsic limitations of each, based on Illumina reads. The highly repetitive genome of the human-infecting parasite T. cruzi 231 strain was used as a test subject. The combined-assembly approach shown in this study benefits from the reference-based assembly ability to resolve highly repetitive sequences and from the de novo capacity to assemble genome-specific regions, improving the quality of the assembly. The acceptable confidence obtained by analyzing our results showed that our combined approach is an attractive option to assemble highly repetitive genomes with NGS short reads. Phylogenomic analysis including the 231 strain, the first representative of DTU III whose genome was sequenced, was also performed and provides new insights into T. cruzi genome evolution.

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; Belkouchi, B.; Montomoli, F.

2016-09-01

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrixmore » is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.« less

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

NASA Astrophysics Data System (ADS)

Ahlfeld, R.; Belkouchi, B.; Montomoli, F.

2016-09-01

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.

Adaptive frequency-domain equalization in digital coherent optical receivers.

PubMed

Faruk, Md Saifuddin; Kikuchi, Kazuro

2011-06-20

We propose a novel frequency-domain adaptive equalizer in digital coherent optical receivers, which can reduce computational complexity of the conventional time-domain adaptive equalizer based on finite-impulse-response (FIR) filters. The proposed equalizer can operate on the input sequence sampled by free-running analog-to-digital converters (ADCs) at the rate of two samples per symbol; therefore, the arbitrary initial sampling phase of ADCs can be adjusted so that the best symbol-spaced sequence is produced. The equalizer can also be configured in the butterfly structure, which enables demultiplexing of polarization tributaries apart from equalization of linear transmission impairments. The performance of the proposed equalization scheme is verified by 40-Gbits/s dual-polarization quadrature phase-shift keying (QPSK) transmission experiments.

On new classes of solutions of nonlinear partial differential equations in the form of convergent special series

NASA Astrophysics Data System (ADS)

Filimonov, M. Yu.

2017-12-01

The method of special series with recursively calculated coefficients is used to solve nonlinear partial differential equations. The recurrence of finding the coefficients of the series is achieved due to a special choice of functions, in powers of which the solution is expanded in a series. We obtain a sequence of linear partial differential equations to find the coefficients of the series constructed. In many cases, one can deal with a sequence of linear ordinary differential equations. We construct classes of solutions in the form of convergent series for a certain class of nonlinear evolution equations. A new class of solutions of generalized Boussinesque equation with an arbitrary function in the form of a convergent series is constructed.

An integral equation-based numerical solver for Taylor states in toroidal geometries

NASA Astrophysics Data System (ADS)

O'Neil, Michael; Cerfon, Antoine J.

2018-04-01

We present an algorithm for the numerical calculation of Taylor states in toroidal and toroidal-shell geometries using an analytical framework developed for the solution to the time-harmonic Maxwell equations. Taylor states are a special case of what are known as Beltrami fields, or linear force-free fields. The scheme of this work relies on the generalized Debye source representation of Maxwell fields and an integral representation of Beltrami fields which immediately yields a well-conditioned second-kind integral equation. This integral equation has a unique solution whenever the Beltrami parameter λ is not a member of a discrete, countable set of resonances which physically correspond to spontaneous symmetry breaking. Several numerical examples relevant to magnetohydrodynamic equilibria calculations are provided. Lastly, our approach easily generalizes to arbitrary geometries, both bounded and unbounded, and of varying genus.

New method to design stellarator coils without the winding surface

DOE PAGES

Zhu, Caoxiang; Hudson, Stuart R.; Song, Yuntao; ...

2017-11-06

Finding an easy-to-build coils set has been a critical issue for stellarator design for decades. Conventional approaches assume a toroidal 'winding' surface, but a poorly chosen winding surface can unnecessarily constrain the coil optimization algorithm, This article presents a new method to design coils for stellarators. Each discrete coil is represented as an arbitrary, closed, one-dimensional curve embedded in three-dimensional space. A target function to be minimized that includes both physical requirements and engineering constraints is constructed. The derivatives of the target function with respect to the parameters describing the coil geometries and currents are calculated analytically. A numerical code,more » named flexible optimized coils using space curves (FOCUS), has been developed. Furthermore, applications to a simple stellarator configuration, W7-X and LHD vacuum fields are presented.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Frayce, D.; Khayat, R.E.; Derdouri, A.

The dual reciprocity boundary element method (DRBEM) is implemented to solve three-dimensional transient heat conduction problems in the presence of arbitrary sources, typically as these problems arise in materials processing. The DRBEM has a major advantage over conventional BEM, since it avoids the computation of volume integrals. These integrals stem from transient, nonlinear, and/or source terms. Thus there is no need to discretize the inner domain, since only a number of internal points are needed for the computation. The validity of the method is assessed upon comparison with results from benchmark problems where analytical solutions exist. There is generally goodmore » agreement. Comparison against finite element results is also favorable. Calculations are carried out in order to assess the influence of the number and location of internal nodes. The influence of the ratio of the numbers of internal to boundary nodes is also examined.« less

Large deflection elastic-plastic dynamic response of stiffened shells of revolution

NASA Technical Reports Server (NTRS)

Stricklin, J. A.; Haisler, W. E.; Vonriesemann, W. A.; Leick, R. D.; Hunsaker, B.; Saczalski, K. J.

1972-01-01

The formulation and check out porblems for a computer code DYNAPLAS, which analyzes the large deflection elastic-plastic dynamic response of stiffened shells of revolution, are presented. The formulation for special discretization is by the finite element method with finite differences being used for the evaluation of the pseudo forces due to material and geometric nonlinearities. Time integration is by the Houbolt method. The stiffeners may be due to concentrated or distributed eccentric rings and spring supports at arbitrary angles around the circumference of the elements. Check out porblems include the comparison of solutions from DYNAPLAS with experimental and other computer solutions for rings, conical and cylindrical shells and a curved panel. A hypothetical submarine including stiffeners and missile tube is studied under a combination of hydrostatic and dynamically applied asymmetrical pressure loadings.

Attitude dynamics simulation subroutines for systems of hinge-connected rigid bodies

NASA Technical Reports Server (NTRS)

Fleischer, G. E.; Likins, P. W.

1974-01-01

Several computer subroutines are designed to provide the solution to minimum-dimension sets of discrete-coordinate equations of motion for systems consisting of an arbitrary number of hinge-connected rigid bodies assembled in a tree topology. In particular, these routines may be applied to: (1) the case of completely unrestricted hinge rotations, (2) the totally linearized case (all system rotations are small), and (3) the mixed, or partially linearized, case. The use of the programs in each case is demonstrated using a five-body spacecraft and attitude control system configuration. The ability of the subroutines to accommodate prescribed motions of system bodies is also demonstrated. Complete listings and user instructions are included for these routines (written in FORTRAN V) which are intended as multi- and general-purpose tools in the simulation of spacecraft and other complex electromechanical systems.

Low-energy electron-phonon effective action from symmetry analysis

NASA Astrophysics Data System (ADS)

Cabra, D. C.; Grandi, N. E.; Silva, G. A.; Sturla, M. B.

2013-07-01

Based on a detailed symmetry analysis, we state the general rules to build up the effective low-energy field theory describing a system of electrons weakly interacting with the lattice degrees of freedom. The basic elements in our construction are what we call the “memory tensors,” which keep track of the microscopic discrete symmetries into the coarse-grained action. The present approach can be applied to lattice systems in arbitrary dimensions and in a systematic way to any desired order in derivatives. We apply the method to the honeycomb lattice and reobtain the by-now well-known effective action of Dirac fermions coupled to fictitious gauge fields. As a second example, we derive the effective action for electrons in the kagome lattice, where our approach allows us to obtain in a simple way the low-energy electron-phonon coupling terms.

Automated generation of influence functions for planar crack problems

NASA Technical Reports Server (NTRS)

Sire, Robert A.; Harris, David O.; Eason, Ernest D.

1989-01-01

A numerical procedure for the generation of influence functions for Mode I planar problems is described. The resulting influence functions are in a form for convenient evaluation of stress-intensity factors for complex stress distributions. Crack surface displacements are obtained by a least-squares solution of the Williams eigenfunction expansion for displacements in a cracked body. Discrete values of the influence function, evaluated using the crack surface displacements, are curve fit using an assumed functional form. The assumed functional form includes appropriate limit-behavior terms for very deep and very shallow cracks. Continuous representation of the influence function provides a convenient means for evaluating stress-intensity factors for arbitrary stress distributions by numerical integration. The procedure is demonstrated for an edge-cracked strip and a radially cracked disk. Comparisons with available published results demonstrate the accuracy of the procedure.

Ultrasound beam transmission using a discretely orthogonal Gaussian aperture basis

NASA Astrophysics Data System (ADS)

Roberts, R. A.

2018-04-01

Work is reported on development of a computational model for ultrasound beam transmission at an arbitrary geometry transmission interface for generally anisotropic materials. The work addresses problems encountered when the fundamental assumptions of ray theory do not hold, thereby introducing errors into ray-theory-based transmission models. Specifically, problems occur when the asymptotic integral analysis underlying ray theory encounters multiple stationary phase points in close proximity, due to focusing caused by concavity on either the entry surface or a material slowness surface. The approach presented here projects integrands over both the transducer aperture and the entry surface beam footprint onto a Gaussian-derived basis set, thereby distributing the integral over a summation of second-order phase integrals which are amenable to single stationary phase point analysis. Significantly, convergence is assured provided a sufficiently fine distribution of basis functions is used.

Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers

NASA Technical Reports Server (NTRS)

Sozer, Emre; Brehm, Christoph; Kiris, Cetin C.

2014-01-01

A survey of gradient reconstruction methods for cell-centered data on unstructured meshes is conducted within the scope of accuracy assessment. Formal order of accuracy, as well as error magnitudes for each of the studied methods, are evaluated on a complex mesh of various cell types through consecutive local scaling of an analytical test function. The tests highlighted several gradient operator choices that can consistently achieve 1st order accuracy regardless of cell type and shape. The tests further offered error comparisons for given cell types, leading to the observation that the "ideal" gradient operator choice is not universal. Practical implications of the results are explored via CFD solutions of a 2D inviscid standing vortex, portraying the discretization error properties. A relatively naive, yet largely unexplored, approach of local curvilinear stencil transformation exhibited surprisingly favorable properties

Toward a constructive physics

NASA Astrophysics Data System (ADS)

Noyes, H. P.; Gefwert, C.; Manthey, M. J.

1983-06-01

The discretization of physics which has occurred thanks to the advent of quantum mechanics has replaced the continuum standards of time, length and mass which brought physics to maturity by counting. The (arbitrary in the sense of conventional dimensional analysis) standards were replaced by three dimensional constants: the limiting velocity c, the unit of action h, and either a reference mass (eg m/sub p/) or a coupling constant (et G related to mass scale by hc/(2(LC OMEGA)Gm/sub/p(2)) approx. - 1.7 x 10 to the 38th power. Once these physical and experimental reference standards are accepted, the conventional approach is to connect physics to mathematics by means of dimensionless ratios. A program for physics which will meet these rigid criteria while preserving, in so far as possible, the successes that conventional physics has already achieved is outlined.

New method to design stellarator coils without the winding surface

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhu, Caoxiang; Hudson, Stuart R.; Song, Yuntao

Finding an easy-to-build coils set has been a critical issue for stellarator design for decades. Conventional approaches assume a toroidal 'winding' surface, but a poorly chosen winding surface can unnecessarily constrain the coil optimization algorithm, This article presents a new method to design coils for stellarators. Each discrete coil is represented as an arbitrary, closed, one-dimensional curve embedded in three-dimensional space. A target function to be minimized that includes both physical requirements and engineering constraints is constructed. The derivatives of the target function with respect to the parameters describing the coil geometries and currents are calculated analytically. A numerical code,more » named flexible optimized coils using space curves (FOCUS), has been developed. Furthermore, applications to a simple stellarator configuration, W7-X and LHD vacuum fields are presented.« less

Distributed MPC based consensus for single-integrator multi-agent systems.

PubMed

Cheng, Zhaomeng; Fan, Ming-Can; Zhang, Hai-Tao

2015-09-01

This paper addresses model predictive control schemes for consensus in multi-agent systems (MASs) with discrete-time single-integrator dynamics under switching directed interaction graphs. The control horizon is extended to be greater than one which endows the closed-loop system with extra degree of freedom. We derive sufficient conditions on the sampling period and the interaction graph to achieve consensus by using the property of infinite products of stochastic matrices. Consensus can be achieved asymptotically if the sampling period is selected such that the interaction graph among agents has a directed spanning tree jointly. Significantly, if the interaction graph always has a spanning tree, one can select an arbitrary large sampling period to guarantee consensus. Finally, several simulations are conducted to illustrate the effectiveness of the theoretical results. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Numerical calculation of ion runaway distributions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Embréus, O.; Stahl, A.; Hirvijoki, E.

2015-05-15

Ions accelerated by electric fields (so-called runaway ions) in plasmas may explain observations in solar flares and fusion experiments; however, limitations of previous analytic work have prevented definite conclusions. In this work, we describe a numerical solver of the 2D non-relativistic linearized Fokker-Planck equation for ions. It solves the initial value problem in velocity space with a spectral-Eulerian discretization scheme, allowing arbitrary plasma composition and time-varying electric fields and background plasma parameters. The numerical ion distribution function is then used to consider the conditions for runaway ion acceleration in solar flares and tokamak plasmas. Typical time scales and electric fieldsmore » required for ion acceleration are determined for various plasma compositions, ion species, and temperatures, and the potential for excitation of toroidal Alfvén eigenmodes during tokamak disruptions is considered.« less

Open Quantum Walks and Dissipative Quantum Computing

NASA Astrophysics Data System (ADS)

Petruccione, Francesco

2012-02-01

Open Quantum Walks (OQWs) have been recently introduced as quantum Markov chains on graphs [S. Attal, F. Petruccione, C. Sabot, and I. Sinayskiy, E-print: http://hal.archives-ouvertes.fr/hal-00581553/fr/]. The formulation of the OQWs is exclusively based upon the non-unitary dynamics induced by the environment. It will be shown that OQWs are a very useful tool for the formulation of dissipative quantum computing and quantum state preparation. In particular, it will be shown how to implement single qubit gates and the CNOT gate as OQWs on fully connected graphs. Also, OQWS make possible the dissipative quantum state preparation of arbitrary single qubit states and of all two-qubit Bell states. Finally, it will be shown how to reformulate efficiently a discrete time version of dissipative quantum computing in the language of OQWs.

Jacobi spectral Galerkin method for elliptic Neumann problems

NASA Astrophysics Data System (ADS)

Doha, E.; Bhrawy, A.; Abd-Elhameed, W.

2009-01-01

This paper is concerned with fast spectral-Galerkin Jacobi algorithms for solving one- and two-dimensional elliptic equations with homogeneous and nonhomogeneous Neumann boundary conditions. The paper extends the algorithms proposed by Shen (SIAM J Sci Comput 15:1489-1505, 1994) and Auteri et al. (J Comput Phys 185:427-444, 2003), based on Legendre polynomials, to Jacobi polynomials with arbitrary α and β. The key to the efficiency of our algorithms is to construct appropriate basis functions with zero slope at the endpoints, which lead to systems with sparse matrices for the discrete variational formulations. The direct solution algorithm developed for the homogeneous Neumann problem in two-dimensions relies upon a tensor product process. Nonhomogeneous Neumann data are accounted for by means of a lifting. Numerical results indicating the high accuracy and effectiveness of these algorithms are presented.

The unusually large Plasmodium telomerase reverse-transcriptase localizes in a discrete compartment associated with the nucleolus

PubMed Central

Figueiredo, Luisa M.; Rocha, Eduardo P. C.; Mancio-Silva, Liliana; Prevost, Christine; Hernandez-Verdun, Danièle; Scherf, Artur

2005-01-01

Telomerase replicates chromosome ends, a function necessary for maintaining genome integrity. We have identified the gene that encodes the catalytic reverse transcriptase (RT) component of this enzyme in the malaria parasite Plasmodium falciparum (PfTERT) as well as the orthologous genes from two rodent and one simian malaria species. PfTERT is predicted to encode a basic protein that contains the major sequence motifs previously identified in known telomerase RTs (TERTs). At ∼2500 amino acids, PfTERT is three times larger than other characterized TERTs. We observed remarkable sequence diversity between TERT proteins of different Plasmodial species, with conserved domains alternating with hypervariable regions. Immunofluorescence analysis revealed that PfTERT is expressed in asexual blood stage parasites that have begun DNA synthesis. Surprisingly, rather than at telomere clusters, PfTERT typically localizes into a discrete nuclear compartment. We further demonstrate that this compartment is associated with the nucleolus, hereby defined for the first time in P.falciparum. PMID:15722485

Equivalence between the Arquès-Walsh sequence formula and the number of connected Feynman diagrams for every perturbation order in the fermionic many-body problem

NASA Astrophysics Data System (ADS)

Castro, E.

2018-02-01

From the perturbative expansion of the exact Green function, an exact counting formula is derived to determine the number of different types of connected Feynman diagrams. This formula coincides with the Arquès-Walsh sequence formula in the rooted map theory, supporting the topological connection between Feynman diagrams and rooted maps. A classificatory summing-terms approach is used, in connection to discrete mathematical theory.

Dynamics of embryonic stem cell differentiation inferred from single-cell transcriptomics show a series of transitions through discrete cell states

PubMed Central

Jang, Sumin; Choubey, Sandeep; Furchtgott, Leon; Zou, Ling-Nan; Doyle, Adele; Menon, Vilas; Loew, Ethan B; Krostag, Anne-Rachel; Martinez, Refugio A; Madisen, Linda; Levi, Boaz P; Ramanathan, Sharad

2017-01-01

The complexity of gene regulatory networks that lead multipotent cells to acquire different cell fates makes a quantitative understanding of differentiation challenging. Using a statistical framework to analyze single-cell transcriptomics data, we infer the gene expression dynamics of early mouse embryonic stem (mES) cell differentiation, uncovering discrete transitions across nine cell states. We validate the predicted transitions across discrete states using flow cytometry. Moreover, using live-cell microscopy, we show that individual cells undergo abrupt transitions from a naïve to primed pluripotent state. Using the inferred discrete cell states to build a probabilistic model for the underlying gene regulatory network, we further predict and experimentally verify that these states have unique response to perturbations, thus defining them functionally. Our study provides a framework to infer the dynamics of differentiation from single cell transcriptomics data and to build predictive models of the gene regulatory networks that drive the sequence of cell fate decisions during development. DOI: http://dx.doi.org/10.7554/eLife.20487.001 PMID:28296635

Optimal control of a hybrid rhythmic-discrete task: the bouncing ball revisited.

PubMed

Ronsse, Renaud; Wei, Kunlin; Sternad, Dagmar

2010-05-01

Rhythmically bouncing a ball with a racket is a hybrid task that combines continuous rhythmic actuation of the racket with the control of discrete impact events between racket and ball. This study presents experimental data and a two-layered modeling framework that explicitly addresses the hybrid nature of control: a first discrete layer calculates the state to reach at impact and the second continuous layer smoothly drives the racket to this desired state, based on optimality principles. The testbed for this hybrid model is task performance at a range of increasingly slower tempos. When slowing the rhythm of the bouncing actions, the continuous cycles become separated into a sequence of discrete movements interspersed by dwell times and directed to achieve the desired impact. Analyses of human performance show increasing variability of performance measures with slower tempi, associated with a change in racket trajectories from approximately sinusoidal to less symmetrical velocity profiles. Matching results of model simulations give support to a hybrid control model based on optimality, and therefore suggest that optimality principles are applicable to the sensorimotor control of complex movements such as ball bouncing.

All optical quantum control of a spin-quantum state and ultrafast transduction into an electric current.

PubMed

Müller, K; Kaldewey, T; Ripszam, R; Wildmann, J S; Bechtold, A; Bichler, M; Koblmüller, G; Abstreiter, G; Finley, J J

2013-01-01

The ability to control and exploit quantum coherence and entanglement drives research across many fields ranging from ultra-cold quantum gases to spin systems in condensed matter. Transcending different physical systems, optical approaches have proven themselves to be particularly powerful, since they profit from the established toolbox of quantum optical techniques, are state-selective, contact-less and can be extremely fast. Here, we demonstrate how a precisely timed sequence of monochromatic ultrafast (~ 2-5 ps) optical pulses, with a well defined polarisation can be used to prepare arbitrary superpositions of exciton spin states in a semiconductor quantum dot, achieve ultrafast control of the spin-wavefunction without an applied magnetic field and make high fidelity read-out the quantum state in an arbitrary basis simply by detecting a strong (~ 2-10 pA) electric current flowing in an external circuit. The results obtained show that the combined quantum state preparation, control and read-out can be performed with a near-unity (≥97%) fidelity.

Techniques for generation of control and guidance signals derived from optical fields, part 2

NASA Technical Reports Server (NTRS)

Hemami, H.; Mcghee, R. B.; Gardner, S. R.

1971-01-01

The development is reported of a high resolution technique for the detection and identification of landmarks from spacecraft optical fields. By making use of nonlinear regression analysis, a method is presented whereby a sequence of synthetic images produced by a digital computer can be automatically adjusted to provide a least squares approximation to a real image. The convergence of the method is demonstrated by means of a computer simulation for both elliptical and rectangular patterns. Statistical simulation studies with elliptical and rectangular patterns show that the computational techniques developed are able to at least match human pattern recognition capabilities, even in the presence of large amounts of noise. Unlike most pattern recognition techniques, this ability is unaffected by arbitrary pattern rotation, translation, and scale change. Further development of the basic approach may eventually allow a spacecraft or robot vehicle to be provided with an ability to very accurately determine its spatial relationship to arbitrary known objects within its optical field of view.

First known EL5 chondrite - Evidence for dual genetic sequence for enstatite chondrites

NASA Technical Reports Server (NTRS)

Sears, D. W. G.; Weeks, K. S.; Rubin, A. E.

1984-01-01

The compositionally distinct EH and EL groups together with four (3-6) petrologic types which constitute the enstatite chondrites represent increasing degrees of metamorphic alteration. Although bulk composition variations preclude a simple conversion of EH4 into EL6 material, complex models which involve simultaneous bulk composition and petrologic type variations may be implied by other classification schemes in common use. Attention is presently given to the discovery of the first EL5 chondrite, which breaks the EH3,4-EH5-EL6 sequence and indicates that the enstatite chondrites constitute the two discrete, isochemical metamorphic sequences EH3-5 and EL5-6.

Calculation procedure for transient heat transfer to a cooled plate in a heated stream whose temperature varies arbitrarily with time. [turbine blades

NASA Technical Reports Server (NTRS)

Sucec, J.

1975-01-01

Solutions for the surface temperature and surface heat flux are found for laminar, constant property, slug flow over a plate convectively cooled from below, when the temperature of the fluid over the plate varies arbitrarily with time at the plate leading edge. A simple technique is presented for handling arbitrary fluid temperature variation with time by approximating it by a sequence of ramps or steps for which exact analytical solutions are available.

Integration of channel and floodplain suites. I. Developmental sequence and lateral relations of alluvial paleosols.

USGS Publications Warehouse

Bown, T.M.; Kraus, M.J.

1987-01-01

The lower Eocene Willwood Formation of the Bighorn Basin, northwest Wyoming, consists of about 770 m of alluvial rocks that exhibit extensive mechanical and geochemical modifications resulting from Eocene pedogenesis. Five arbitrary stages are proposed to distinguish these soils of different maturities in the Willwood Formation. An inverse relationship exists between soil maturity and short-term sediment accumulation rate. Illustrates several important principles of soil-sediment interrelationships in aggrading alluvial systems that have broad application to other deposits.-from Authors

Rank-order-selective neurons form a temporal basis set for the generation of motor sequences.

PubMed

Salinas, Emilio

2009-04-08

Many behaviors are composed of a series of elementary motor actions that must occur in a specific order, but the neuronal mechanisms by which such motor sequences are generated are poorly understood. In particular, if a sequence consists of a few motor actions, a primate can learn to replicate it from memory after practicing it for just a few trials. How do the motor and premotor areas of the brain assemble motor sequences so fast? The network model presented here reveals part of the solution to this problem. The model is based on experiments showing that, during the performance of motor sequences, some cortical neurons are always activated at specific times, regardless of which motor action is being executed. In the model, a population of such rank-order-selective (ROS) cells drives a layer of downstream motor neurons so that these generate specific movements at different times in different sequences. A key ingredient of the model is that the amplitude of the ROS responses must be modulated by sequence identity. Because of this modulation, which is consistent with experimental reports, the network is able not only to produce multiple sequences accurately but also to learn a new sequence with minimal changes in connectivity. The ROS neurons modulated by sequence identity thus serve as a basis set for constructing arbitrary sequences of motor responses downstream. The underlying mechanism is analogous to the mechanism described in parietal areas for generating coordinate transformations in the spatial domain.

RANK-ORDER-SELECTIVE NEURONS FORM A TEMPORAL BASIS SET FOR THE GENERATION OF MOTOR SEQUENCES

PubMed Central

Salinas, Emilio

2009-01-01

Many behaviors are composed of a series of elementary motor actions that must occur in a specific order, but the neuronal mechanisms by which such motor sequences are generated are poorly understood. In particular, if a sequence consists of a few motor actions, a primate can learn to replicate it from memory after practicing it for just a few trials. How do the motor and premotor areas of the brain assemble motor sequences so fast? The network model presented here reveals part of the solution to this problem. The model is based on experiments showing that, during the performance of motor sequences, some cortical neurons are always activated at specific times, regardless of which motor action is being executed. In the model, a population of such rank-order-selective (ROS) cells drives a layer of downstream motor neurons so that these generate specific movements at different times in different sequences. A key ingredient of the model is that the amplitude of the ROS responses must be modulated by sequence identity. Because of this modulation, which is consistent with experimental reports, the network is able not only to produce multiple sequences accurately but also to learn a new sequence with minimal changes in connectivity. The ROS neurons modulated by sequence identity thus serve as a basis set for constructing arbitrary sequences of motor responses downstream. The underlying mechanism is analogous to the mechanism described in parietal areas for generating coordinate transformations in the spatial domain. PMID:19357265

TOPPE: A framework for rapid prototyping of MR pulse sequences.

PubMed

Nielsen, Jon-Fredrik; Noll, Douglas C

2018-06-01

To introduce a framework for rapid prototyping of MR pulse sequences. We propose a simple file format, called "TOPPE", for specifying all details of an MR imaging experiment, such as gradient and radiofrequency waveforms and the complete scan loop. In addition, we provide a TOPPE file "interpreter" for GE scanners, which is a binary executable that loads TOPPE files and executes the sequence on the scanner. We also provide MATLAB scripts for reading and writing TOPPE files and previewing the sequence prior to hardware execution. With this setup, the task of the pulse sequence programmer is reduced to creating TOPPE files, eliminating the need for hardware-specific programming. No sequence-specific compilation is necessary; the interpreter only needs to be compiled once (for every scanner software upgrade). We demonstrate TOPPE in three different applications: k-space mapping, non-Cartesian PRESTO whole-brain dynamic imaging, and myelin mapping in the brain using inhomogeneous magnetization transfer. We successfully implemented and executed the three example sequences. By simply changing the various TOPPE sequence files, a single binary executable (interpreter) was used to execute several different sequences. The TOPPE file format is a complete specification of an MR imaging experiment, based on arbitrary sequences of a (typically small) number of unique modules. Along with the GE interpreter, TOPPE comprises a modular and flexible platform for rapid prototyping of new pulse sequences. Magn Reson Med 79:3128-3134, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Input-output identification of controlled discrete manufacturing systems

NASA Astrophysics Data System (ADS)

Estrada-Vargas, Ana Paula; López-Mellado, Ernesto; Lesage, Jean-Jacques

2014-03-01

The automated construction of discrete event models from observations of external system's behaviour is addressed. This problem, often referred to as system identification, allows obtaining models of ill-known (or even unknown) systems. In this article, an identification method for discrete event systems (DESs) controlled by a programmable logic controller is presented. The method allows processing a large quantity of observed long sequences of input/output signals generated by the controller and yields an interpreted Petri net model describing the closed-loop behaviour of the automated DESs. The proposed technique allows the identification of actual complex systems because it is sufficiently efficient and well adapted to cope with both the technological characteristics of industrial controllers and data collection requirements. Based on polynomial-time algorithms, the method is implemented as an efficient software tool which constructs and draws the model automatically; an overview of this tool is given through a case study dealing with an automated manufacturing system.

Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing

NASA Technical Reports Server (NTRS)

Jones, Robert L.; Goode, Plesent W. (Technical Monitor)

2000-01-01

The Petri net formalism is useful in studying many discrete-state, discrete-event systems exhibiting concurrency, synchronization, and other complex behavior. As a bipartite graph, the net can conveniently capture salient aspects of the system. As a mathematical tool, the net can specify an analyzable state space. Indeed, one can reason about certain qualitative properties (from state occupancies) and how they arise (the sequence of events leading there). By introducing deterministic or random delays, the model is forced to sojourn in states some amount of time, giving rise to an underlying stochastic process, one that can be specified in a compact way and capable of providing quantitative, probabilistic measures. We formalize a new non-Markovian extension to the Petri net that captures both discrete and continuous timing in the same model. The approach affords efficient, stationary analysis in most cases and efficient transient analysis under certain restrictions. Moreover, this new formalism has the added benefit in modeling fidelity stemming from the simultaneous capture of discrete- and continuous-time events (as opposed to capturing only one and approximating the other). We show how the underlying stochastic process, which is non-Markovian, can be resolved into simpler Markovian problems that enjoy efficient solutions. Solution algorithms are provided that can be easily programmed.

Bayesian selection of Markov models for symbol sequences: application to microsaccadic eye movements.

PubMed

Bettenbühl, Mario; Rusconi, Marco; Engbert, Ralf; Holschneider, Matthias

2012-01-01

Complex biological dynamics often generate sequences of discrete events which can be described as a Markov process. The order of the underlying Markovian stochastic process is fundamental for characterizing statistical dependencies within sequences. As an example for this class of biological systems, we investigate the Markov order of sequences of microsaccadic eye movements from human observers. We calculate the integrated likelihood of a given sequence for various orders of the Markov process and use this in a Bayesian framework for statistical inference on the Markov order. Our analysis shows that data from most participants are best explained by a first-order Markov process. This is compatible with recent findings of a statistical coupling of subsequent microsaccade orientations. Our method might prove to be useful for a broad class of biological systems.

Cross-shore and Vertical Distributions of Invertebrate Larvae Using Autonomous Sampling Coupled with Genetic Analysis

NASA Astrophysics Data System (ADS)

Govindarajan, A.; Pineda, J.; Purcell, M.; Tradd, K.; Packard, G.; Girard, A.; Dennett, M.; Breier, J. A., Jr.

2016-02-01

We present a new method to estimate the distribution of invertebrate larvae relative to environmental variables such as temperature, salinity, and circulation. A large volume in situ filtering system developed for discrete biogeochemical sampling in the deep-sea (the Suspended Particulate Rosette "SUPR" multisampler) was mounted to the autonomous underwater vehicle REMUS 600 for coastal larval and environmental sampling. We describe the results of SUPR-REMUS deployments conducted in Buzzards Bay, Massachusetts (2014) and west of Martha's Vineyard, Massachusetts (2015). We collected discrete samples cross-shore and from surface, middle, and bottom layers of the water column. Samples were preserved for DNA analysis. Our Buzzards Bay deployment targeted barnacle larvae, which are abundant in late winter and early spring. For these samples, we used morphological analysis and DNA barcodes generated by Sanger sequencing to obtain stage and species-specific cross-shore and vertical distributions. We targeted bivalve larvae in our 2015 deployments, and genetic analysis of larvae from these samples is underway. For these samples, we are comparing species barcode data derived from traditional Sanger sequencing of individuals to those obtained from next generation sequencing (NGS) of bulk plankton samples. Our results demonstrate the utility of autonomous sampling combined with DNA barcoding for studying larval distributions and transport dynamics.

Improved Modeling of Side-Chain–Base Interactions and Plasticity in Protein–DNA Interface Design

PubMed Central

Thyme, Summer B.; Baker, David; Bradley, Philip

2012-01-01

Combinatorial sequence optimization for protein design requires libraries of discrete side-chain conformations. The discreteness of these libraries is problematic, particularly for long, polar side chains, since favorable interactions can be missed. Previously, an approach to loop remodeling where protein backbone movement is directed by side-chain rotamers predicted to form interactions previously observed in native complexes (termed “motifs”) was described. Here, we show how such motif libraries can be incorporated into combinatorial sequence optimization protocols and improve native complex recapitulation. Guided by the motif rotamer searches, we made improvements to the underlying energy function, increasing recapitulation of native interactions. To further test the methods, we carried out a comprehensive experimental scan of amino acid preferences in the I-AniI protein–DNA interface and found that many positions tolerated multiple amino acids. This sequence plasticity is not observed in the computational results because of the fixed-backbone approximation of the model. We improved modeling of this diversity by introducing DNA flexibility and reducing the convergence of the simulated annealing algorithm that drives the design process. In addition to serving as a benchmark, this extensive experimental data set provides insight into the types of interactions essential to maintain the function of this potential gene therapy reagent. PMID:22426128

Improved modeling of side-chain--base interactions and plasticity in protein--DNA interface design.

PubMed

Thyme, Summer B; Baker, David; Bradley, Philip

2012-06-08

Combinatorial sequence optimization for protein design requires libraries of discrete side-chain conformations. The discreteness of these libraries is problematic, particularly for long, polar side chains, since favorable interactions can be missed. Previously, an approach to loop remodeling where protein backbone movement is directed by side-chain rotamers predicted to form interactions previously observed in native complexes (termed "motifs") was described. Here, we show how such motif libraries can be incorporated into combinatorial sequence optimization protocols and improve native complex recapitulation. Guided by the motif rotamer searches, we made improvements to the underlying energy function, increasing recapitulation of native interactions. To further test the methods, we carried out a comprehensive experimental scan of amino acid preferences in the I-AniI protein-DNA interface and found that many positions tolerated multiple amino acids. This sequence plasticity is not observed in the computational results because of the fixed-backbone approximation of the model. We improved modeling of this diversity by introducing DNA flexibility and reducing the convergence of the simulated annealing algorithm that drives the design process. In addition to serving as a benchmark, this extensive experimental data set provides insight into the types of interactions essential to maintain the function of this potential gene therapy reagent. Published by Elsevier Ltd.

Vision based obstacle detection and grouping for helicopter guidance

NASA Technical Reports Server (NTRS)

Sridhar, Banavar; Chatterji, Gano

1993-01-01

Electro-optical sensors can be used to compute range to objects in the flight path of a helicopter. The computation is based on the optical flow/motion at different points in the image. The motion algorithms provide a sparse set of ranges to discrete features in the image sequence as a function of azimuth and elevation. For obstacle avoidance guidance and display purposes, these discrete set of ranges, varying from a few hundreds to several thousands, need to be grouped into sets which correspond to objects in the real world. This paper presents a new method for object segmentation based on clustering the sparse range information provided by motion algorithms together with the spatial relation provided by the static image. The range values are initially grouped into clusters based on depth. Subsequently, the clusters are modified by using the K-means algorithm in the inertial horizontal plane and the minimum spanning tree algorithms in the image plane. The object grouping allows interpolation within a group and enables the creation of dense range maps. Researchers in robotics have used densely scanned sequence of laser range images to build three-dimensional representation of the outside world. Thus, modeling techniques developed for dense range images can be extended to sparse range images. The paper presents object segmentation results for a sequence of flight images.

Novel methodologies for spectral classification of exon and intron sequences

NASA Astrophysics Data System (ADS)

Kwan, Hon Keung; Kwan, Benjamin Y. M.; Kwan, Jennifer Y. Y.

2012-12-01

Digital processing of a nucleotide sequence requires it to be mapped to a numerical sequence in which the choice of nucleotide to numeric mapping affects how well its biological properties can be preserved and reflected from nucleotide domain to numerical domain. Digital spectral analysis of nucleotide sequences unfolds a period-3 power spectral value which is more prominent in an exon sequence as compared to that of an intron sequence. The success of a period-3 based exon and intron classification depends on the choice of a threshold value. The main purposes of this article are to introduce novel codes for 1-sequence numerical representations for spectral analysis and compare them to existing codes to determine appropriate representation, and to introduce novel thresholding methods for more accurate period-3 based exon and intron classification of an unknown sequence. The main findings of this study are summarized as follows: Among sixteen 1-sequence numerical representations, the K-Quaternary Code I offers an attractive performance. A windowed 1-sequence numerical representation (with window length of 9, 15, and 24 bases) offers a possible speed gain over non-windowed 4-sequence Voss representation which increases as sequence length increases. A winner threshold value (chosen from the best among two defined threshold values and one other threshold value) offers a top precision for classifying an unknown sequence of specified fixed lengths. An interpolated winner threshold value applicable to an unknown and arbitrary length sequence can be estimated from the winner threshold values of fixed length sequences with a comparable performance. In general, precision increases as sequence length increases. The study contributes an effective spectral analysis of nucleotide sequences to better reveal embedded properties, and has potential applications in improved genome annotation.

Core-Plus Mathematics. What Works Clearinghouse Intervention Report

ERIC Educational Resources Information Center

What Works Clearinghouse, 2010

2010-01-01

"Core-Plus Mathematics" is a four-year curriculum that replaces the traditional sequence with courses that each feature interwoven strands of algebra and functions, statistics and probability, geometry and trigonometry, and discrete mathematics. The first three courses in the series provide a common core of broadly useful mathematics,…

Narrowband Interference Suppression in Spread Spectrum Communication Systems

DTIC Science & Technology

1995-12-01

receiver input. As stated earlier, these waveforms must be sampled to obtain the discrete time sequences. The sampling theorem states: A bandlimited...From the FFT chips, the data is passed to a Plessey PDSP16330 Pythagoras Processor. The 16330 is a high-speed digital CMOS IC that converts real and

Evaluation in a Research and Development Context.

ERIC Educational Resources Information Center

Cooley, William W.

Educational research and development (R&D) has often been characterized as a neat, linear sequence of discrete steps, moving from research through development to evaluation and dissemination. Although the inadequacies of such linear models of educational research and development have been pointed out previously, these models have been so much…