The truncated conjugate gradient (TCG), a non-iterative/fixed-cost strategy for computing polarization in molecular dynamics: Fast evaluation of analytical forces.

PubMed

Aviat, Félix; Lagardère, Louis; Piquemal, Jean-Philip

2017-10-28

In a recent paper [F. Aviat et al., J. Chem. Theory Comput. 13, 180-190 (2017)], we proposed the Truncated Conjugate Gradient (TCG) approach to compute the polarization energy and forces in polarizable molecular simulations. The method consists in truncating the conjugate gradient algorithm at a fixed predetermined order leading to a fixed computational cost and can thus be considered "non-iterative." This gives the possibility to derive analytical forces avoiding the usual energy conservation (i.e., drifts) issues occurring with iterative approaches. A key point concerns the evaluation of the analytical gradients, which is more complex than that with a usual solver. In this paper, after reviewing the present state of the art of polarization solvers, we detail a viable strategy for the efficient implementation of the TCG calculation. The complete cost of the approach is then measured as it is tested using a multi-time step scheme and compared to timings using usual iterative approaches. We show that the TCG methods are more efficient than traditional techniques, making it a method of choice for future long molecular dynamics simulations using polarizable force fields where energy conservation matters. We detail the various steps required for the implementation of the complete method by software developers.

Computing eigenfunctions and eigenvalues of boundary-value problems with the orthogonal spectral renormalization method

NASA Astrophysics Data System (ADS)

Cartarius, Holger; Musslimani, Ziad H.; Schwarz, Lukas; Wunner, Günter

2018-03-01

The spectral renormalization method was introduced in 2005 as an effective way to compute ground states of nonlinear Schrödinger and Gross-Pitaevskii type equations. In this paper, we introduce an orthogonal spectral renormalization (OSR) method to compute ground and excited states (and their respective eigenvalues) of linear and nonlinear eigenvalue problems. The implementation of the algorithm follows four simple steps: (i) reformulate the underlying eigenvalue problem as a fixed-point equation, (ii) introduce a renormalization factor that controls the convergence properties of the iteration, (iii) perform a Gram-Schmidt orthogonalization process in order to prevent the iteration from converging to an unwanted mode, and (iv) compute the solution sought using a fixed-point iteration. The advantages of the OSR scheme over other known methods (such as Newton's and self-consistency) are (i) it allows the flexibility to choose large varieties of initial guesses without diverging, (ii) it is easy to implement especially at higher dimensions, and (iii) it can easily handle problems with complex and random potentials. The OSR method is implemented on benchmark Hermitian linear and nonlinear eigenvalue problems as well as linear and nonlinear non-Hermitian PT -symmetric models.

Convergence Time towards Periodic Orbits in Discrete Dynamical Systems

PubMed Central

San Martín, Jesús; Porter, Mason A.

2014-01-01

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we use linearized equations to examine the evolution near that neighborhood. The underlying idea is that points of stable periodic orbit are associated with intervals. We state and prove a theorem that details what regions of phase space are mapped into these intervals (once they are known) and how many iterations are required to get there. We also construct algorithms that allow our theoretical results to be implemented successfully in practice. PMID:24736594

Multigrid-based reconstruction algorithm for quantitative photoacoustic tomography

PubMed Central

Li, Shengfu; Montcel, Bruno; Yuan, Zhen; Liu, Wanyu; Vray, Didier

2015-01-01

This paper proposes a multigrid inversion framework for quantitative photoacoustic tomography reconstruction. The forward model of optical fluence distribution and the inverse problem are solved at multiple resolutions. A fixed-point iteration scheme is formulated for each resolution and used as a cost function. The simulated and experimental results for quantitative photoacoustic tomography reconstruction show that the proposed multigrid inversion can dramatically reduce the required number of iterations for the optimization process without loss of reliability in the results. PMID:26203371

An hp symplectic pseudospectral method for nonlinear optimal control

NASA Astrophysics Data System (ADS)

Peng, Haijun; Wang, Xinwei; Li, Mingwu; Chen, Biaosong

2017-01-01

An adaptive symplectic pseudospectral method based on the dual variational principle is proposed and is successfully applied to solving nonlinear optimal control problems in this paper. The proposed method satisfies the first order necessary conditions of continuous optimal control problems, also the symplectic property of the original continuous Hamiltonian system is preserved. The original optimal control problem is transferred into a set of nonlinear equations which can be solved easily by Newton-Raphson iterations, and the Jacobian matrix is found to be sparse and symmetric. The proposed method, on one hand, exhibits exponent convergence rates when the number of collocation points are increasing with the fixed number of sub-intervals; on the other hand, exhibits linear convergence rates when the number of sub-intervals is increasing with the fixed number of collocation points. Furthermore, combining with the hp method based on the residual error of dynamic constraints, the proposed method can achieve given precisions in a few iterations. Five examples highlight the high precision and high computational efficiency of the proposed method.

A Newton-Krylov method with an approximate analytical Jacobian for implicit solution of Navier-Stokes equations on staggered overset-curvilinear grids with immersed boundaries.

PubMed

Asgharzadeh, Hafez; Borazjani, Iman

2017-02-15

The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for nonlinear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the diagonal of the Jacobian further improves the performance by 42 - 74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal Jacobian when the stretching factor was increased, respectively. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80-90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future.

A Newton–Krylov method with an approximate analytical Jacobian for implicit solution of Navier–Stokes equations on staggered overset-curvilinear grids with immersed boundaries

PubMed Central

Asgharzadeh, Hafez; Borazjani, Iman

2016-01-01

The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for nonlinear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the diagonal of the Jacobian further improves the performance by 42 – 74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal Jacobian when the stretching factor was increased, respectively. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80–90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future. PMID:28042172

A Newton-Krylov method with an approximate analytical Jacobian for implicit solution of Navier-Stokes equations on staggered overset-curvilinear grids with immersed boundaries

NASA Astrophysics Data System (ADS)

Asgharzadeh, Hafez; Borazjani, Iman

2017-02-01

The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for non-linear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form a preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the diagonal of the Jacobian further improves the performance by 42-74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal and full Jacobian, respectivley, when the stretching factor was increased. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80-90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future.

Computerized Business Calculus Using Calculators, Examples from Mathematics to Finance.

ERIC Educational Resources Information Center

Vest, Floyd

1991-01-01

After discussing the role of supercalculators within the business calculus curriculum, several examples are presented which allow the reader to examine the capabilities and codes of calculators specific to different major manufacturers. The topics examined include annuities, Newton's method, fixed point iteration, graphing, solvers, and…

Dynamics of a durable commodity market involving trade at disequilibrium

NASA Astrophysics Data System (ADS)

Panchuk, A.; Puu, T.

2018-05-01

The present work considers a simple model of a durable commodity market involving two agents who trade stocks of two different types. Stock commodities, in contrast to flow commodities, remain on the market from period to period and, consequently, there is neither unique demand function nor unique supply function exists. We also set up exact conditions for trade at disequilibrium, the issue being usually neglected, though a fact of reality. The induced iterative system has infinite number of fixed points and path dependent dynamics. We show that a typical orbit is either attracted to one of the fixed points or eventually sticks at a no-trade point. For the latter the stock distribution always remains the same while the price displays periodic or chaotic oscillations.

Strong Convergence for a Finite Family of Generalized Asymptotically Nonexpansive Mappings

NASA Astrophysics Data System (ADS)

Ma, Zhi-Hong; Chen, Ru-Dond

The purpose of this paper is to show the convergence theorems for generalized asymptotically nonexpansive mappings and asymptotically nonexpansive mappings in Banach spaces by using a new iteration which is a natural generalization of the implicit iteration. In the meantime, we give the necessary and sufficient conditions of the strong convergence to approximate a common fixed point and modify some flaw in the results of Thakur [11]. As one will see, the results presented in this paper are an extension of the corresponding results [8,11].

X-Divertors on ITER - with no hardware changes

NASA Astrophysics Data System (ADS)

Valanju, Prashant; Covele, Brent; Kotschenreuther, Mike; Mahajan, Swadesh; Kessel, Charles

2014-10-01

Using CORSICA, we have discovered that X-Divertor (XD) equilibria are possible on ITER - without any extra PF coils inside the TF coils, and with no changes to ITER's poloidal field (PF) coil set, divertor cassette, strike points, or first wall. Starting from the Standard Divertor (SD), a sequence of XD configurations (with increasing flux expansions at the divertor plate) can be made by reprogramming ITER PF coil currents while keeping them all under their design limits (Lackner and Zohm have shown this to be impossible for Snowflakes). The strike point is held fixed, so no changes in the divertor or pumping hardware will be needed. The main plasma shape is kept very close to the SD case, so no hardware changes to the main chamber will be needed. Time-dependent ITER-XD operational scenarios are being checked using TSC. This opens the possibility that many XDs could be tested and used to assist in high-power operation on ITER. Because of the toroidally segmented ITER divertor plates, strongly detached operation may be critical for making use of the largest XD flux expansion possible. The flux flaring in XDs is expected to increase the stability of detachment, so that H-mode confinement is not affected. Detachment stability is being examined with SOLPS. This work supported by US DOE Grants DE-FG02-04ER54742 and DE-FG02-04ER54754 and by TACC at UT Austin.

Precise Point Positioning with Partial Ambiguity Fixing.

PubMed

Li, Pan; Zhang, Xiaohong

2015-06-10

Reliable and rapid ambiguity resolution (AR) is the key to fast precise point positioning (PPP). We propose a modified partial ambiguity resolution (PAR) method, in which an elevation and standard deviation criterion are first used to remove the low-precision ambiguity estimates for AR. Subsequently the success rate and ratio-test are simultaneously used in an iterative process to increase the possibility of finding a subset of decorrelated ambiguities which can be fixed with high confidence. One can apply the proposed PAR method to try to achieve an ambiguity-fixed solution when full ambiguity resolution (FAR) fails. We validate this method using data from 450 stations during DOY 021 to 027, 2012. Results demonstrate the proposed PAR method can significantly shorten the time to first fix (TTFF) and increase the fixing rate. Compared with FAR, the average TTFF for PAR is reduced by 14.9% for static PPP and 15.1% for kinematic PPP. Besides, using the PAR method, the average fixing rate can be increased from 83.5% to 98.2% for static PPP, from 80.1% to 95.2% for kinematic PPP respectively. Kinematic PPP accuracy with PAR can also be significantly improved, compared to that with FAR, due to a higher fixing rate.

Precise Point Positioning with Partial Ambiguity Fixing

PubMed Central

Li, Pan; Zhang, Xiaohong

2015-01-01

Reliable and rapid ambiguity resolution (AR) is the key to fast precise point positioning (PPP). We propose a modified partial ambiguity resolution (PAR) method, in which an elevation and standard deviation criterion are first used to remove the low-precision ambiguity estimates for AR. Subsequently the success rate and ratio-test are simultaneously used in an iterative process to increase the possibility of finding a subset of decorrelated ambiguities which can be fixed with high confidence. One can apply the proposed PAR method to try to achieve an ambiguity-fixed solution when full ambiguity resolution (FAR) fails. We validate this method using data from 450 stations during DOY 021 to 027, 2012. Results demonstrate the proposed PAR method can significantly shorten the time to first fix (TTFF) and increase the fixing rate. Compared with FAR, the average TTFF for PAR is reduced by 14.9% for static PPP and 15.1% for kinematic PPP. Besides, using the PAR method, the average fixing rate can be increased from 83.5% to 98.2% for static PPP, from 80.1% to 95.2% for kinematic PPP respectively. Kinematic PPP accuracy with PAR can also be significantly improved, compared to that with FAR, due to a higher fixing rate. PMID:26067196

Augmenting the one-shot framework by additional constraints

DOE PAGES

Bosse, Torsten

2016-05-12

The (multistep) one-shot method for design optimization problems has been successfully implemented for various applications. To this end, a slowly convergent primal fixed-point iteration of the state equation is augmented by an adjoint iteration and a corresponding preconditioned design update. In this paper we present a modification of the method that allows for additional equality constraints besides the usual state equation. Finally, a retardation analysis and the local convergence of the method in terms of necessary and sufficient conditions are given, which depend on key characteristics of the underlying problem and the quality of the utilized preconditioner.

Augmenting the one-shot framework by additional constraints

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

Bosse, Torsten

The (multistep) one-shot method for design optimization problems has been successfully implemented for various applications. To this end, a slowly convergent primal fixed-point iteration of the state equation is augmented by an adjoint iteration and a corresponding preconditioned design update. In this paper we present a modification of the method that allows for additional equality constraints besides the usual state equation. Finally, a retardation analysis and the local convergence of the method in terms of necessary and sufficient conditions are given, which depend on key characteristics of the underlying problem and the quality of the utilized preconditioner.

Layout compliance for triple patterning lithography: an iterative approach

NASA Astrophysics Data System (ADS)

Yu, Bei; Garreton, Gilda; Pan, David Z.

2014-10-01

As the semiconductor process further scales down, the industry encounters many lithography-related issues. In the 14nm logic node and beyond, triple patterning lithography (TPL) is one of the most promising techniques for Metal1 layer and possibly Via0 layer. As one of the most challenging problems in TPL, recently layout decomposition efforts have received more attention from both industry and academia. Ideally the decomposer should point out locations in the layout that are not triple patterning decomposable and therefore manual intervention by designers is required. A traditional decomposition flow would be an iterative process, where each iteration consists of an automatic layout decomposition step and manual layout modification task. However, due to the NP-hardness of triple patterning layout decomposition, automatic full chip level layout decomposition requires long computational time and therefore design closure issues continue to linger around in the traditional flow. Challenged by this issue, we present a novel incremental layout decomposition framework to facilitate accelerated iterative decomposition. In the first iteration, our decomposer not only points out all conflicts, but also provides the suggestions to fix them. After the layout modification, instead of solving the full chip problem from scratch, our decomposer can provide a quick solution for a selected portion of layout. We believe this framework is efficient, in terms of performance and designer friendly.

A Fixed-point Scheme for the Numerical Construction of Magnetohydrostatic Atmospheres in Three Dimensions

NASA Astrophysics Data System (ADS)

Gilchrist, S. A.; Braun, D. C.; Barnes, G.

2016-12-01

Magnetohydrostatic models of the solar atmosphere are often based on idealized analytic solutions because the underlying equations are too difficult to solve in full generality. Numerical approaches, too, are often limited in scope and have tended to focus on the two-dimensional problem. In this article we develop a numerical method for solving the nonlinear magnetohydrostatic equations in three dimensions. Our method is a fixed-point iteration scheme that extends the method of Grad and Rubin ( Proc. 2nd Int. Conf. on Peaceful Uses of Atomic Energy 31, 190, 1958) to include a finite gravity force. We apply the method to a test case to demonstrate the method in general and our implementation in code in particular.

A Kronecker product splitting preconditioner for two-dimensional space-fractional diffusion equations

NASA Astrophysics Data System (ADS)

Chen, Hao; Lv, Wen; Zhang, Tongtong

2018-05-01

We study preconditioned iterative methods for the linear system arising in the numerical discretization of a two-dimensional space-fractional diffusion equation. Our approach is based on a formulation of the discrete problem that is shown to be the sum of two Kronecker products. By making use of an alternating Kronecker product splitting iteration technique we establish a class of fixed-point iteration methods. Theoretical analysis shows that the new method converges to the unique solution of the linear system. Moreover, the optimal choice of the involved iteration parameters and the corresponding asymptotic convergence rate are computed exactly when the eigenvalues of the system matrix are all real. The basic iteration is accelerated by a Krylov subspace method like GMRES. The corresponding preconditioner is in a form of a Kronecker product structure and requires at each iteration the solution of a set of discrete one-dimensional fractional diffusion equations. We use structure preserving approximations to the discrete one-dimensional fractional diffusion operators in the action of the preconditioning matrix. Numerical examples are presented to illustrate the effectiveness of this approach.

New matrix bounds and iterative algorithms for the discrete coupled algebraic Riccati equation

NASA Astrophysics Data System (ADS)

Liu, Jianzhou; Wang, Li; Zhang, Juan

2017-11-01

The discrete coupled algebraic Riccati equation (DCARE) has wide applications in control theory and linear system. In general, for the DCARE, one discusses every term of the coupled term, respectively. In this paper, we consider the coupled term as a whole, which is different from the recent results. When applying eigenvalue inequalities to discuss the coupled term, our method has less error. In terms of the properties of special matrices and eigenvalue inequalities, we propose several upper and lower matrix bounds for the solution of DCARE. Further, we discuss the iterative algorithms for the solution of the DCARE. In the fixed point iterative algorithms, the scope of Lipschitz factor is wider than the recent results. Finally, we offer corresponding numerical examples to illustrate the effectiveness of the derived results.

Analytic approximation for random muffin-tin alloys

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

Mills, R.; Gray, L.J.; Kaplan, T.

1983-03-15

The methods introduced in a previous paper under the name of ''traveling-cluster approximation'' (TCA) are applied, in a multiple-scattering approach, to the case of a random muffin-tin substitutional alloy. This permits the iterative part of a self-consistent calculation to be carried out entirely in terms of on-the-energy-shell scattering amplitudes. Off-shell components of the mean resolvent, needed for the calculation of spectral functions, are obtained by standard methods involving single-site scattering wave functions. The single-site TCA is just the usual coherent-potential approximation, expressed in a form particularly suited for iteration. A fixed-point theorem is proved for the general t-matrix TCA, ensuringmore » convergence upon iteration to a unique self-consistent solution with the physically essential Herglotz properties.« less

Broadband excitation in nuclear magnetic resonance

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

Tycko, Robert

1984-10-01

Theoretical methods for designing sequences of radio frequency (rf) radiation pulses for broadband excitation of spin systems in nuclear magnetic resonance (NMR) are described. The sequences excite spins uniformly over large ranges of resonant frequencies arising from static magnetic field inhomogeneity, chemical shift differences, or spin couplings, or over large ranges of rf field amplitudes. Specific sequences for creating a population inversion or transverse magnetization are derived and demonstrated experimentally in liquid and solid state NMR. One approach to broadband excitation is based on principles of coherent averaging theory. A general formalism for deriving pulse sequences is given, along withmore » computational methods for specific cases. This approach leads to sequences that produce strictly constant transformations of a spin system. The importance of this feature in NMR applications is discussed. A second approach to broadband excitation makes use of iterative schemes, i.e. sets of operations that are applied repetitively to a given initial pulse sequences, generating a series of increasingly complex sequences with increasingly desirable properties. A general mathematical framework for analyzing iterative schemes is developed. An iterative scheme is treated as a function that acts on a space of operators corresponding to the transformations produced by all possible pulse sequences. The fixed points of the function and the stability of the fixed points are shown to determine the essential behavior of the scheme. Iterative schemes for broadband population inversion are treated in detail. Algebraic and numerical methods for performing the mathematical analysis are presented. Two additional topics are treated. The first is the construction of sequences for uniform excitation of double-quantum coherence and for uniform polarization transfer over a range of spin couplings. Double-quantum excitation sequences are demonstrated in a liquid crystal system. The second additional topic is the construction of iterative schemes for narrowband population inversion. The use of sequences that invert spin populations only over a narrow range of rf field amplitudes to spatially localize NMR signals in an rf field gradient is discussed.« less

Eigensolutions of nonviscously damped systems based on the fixed-point iteration

NASA Astrophysics Data System (ADS)

Lázaro, Mario

2018-03-01

In this paper, nonviscous, nonproportional, symmetric vibrating structures are considered. Nonviscously damped systems present dissipative forces depending on the time history of the response via kernel hereditary functions. Solutions of the free motion equation leads to a nonlinear eigenvalue problem involving mass, stiffness and damping matrices, this latter as dependent on frequency. Viscous damping can be considered as a particular case, involving damping forces as function of the instantaneous velocity of the degrees of freedom. In this work, a new numerical procedure to compute eigensolutions is proposed. The method is based on the construction of certain recursive functions which, under a iterative scheme, allow to reach eigenvalues and eigenvectors simultaneously and avoiding computation of eigensensitivities. Eigenvalues can be read then as fixed-points of those functions. A deep analysis of the convergence is carried out, focusing specially on relating the convergence conditions and error-decay rate to the damping model features, such as the nonproportionality and the viscoelasticity. The method is validated using two 6 degrees of freedom numerical examples involving both nonviscous and viscous damping and a continuous system with a local nonviscous damper. The convergence and the sequences behavior are in agreement with the results foreseen by the theory.

An optimized treatment for algorithmic differentiation of an important glaciological fixed-point problem

DOE PAGES

Goldberg, Daniel N.; Narayanan, Sri Hari Krishna; Hascoet, Laurent; ...

2016-05-20

We apply an optimized method to the adjoint generation of a time-evolving land ice model through algorithmic differentiation (AD). The optimization involves a special treatment of the fixed-point iteration required to solve the nonlinear stress balance, which differs from a straightforward application of AD software, and leads to smaller memory requirements and in some cases shorter computation times of the adjoint. The optimization is done via implementation of the algorithm of Christianson (1994) for reverse accumulation of fixed-point problems, with the AD tool OpenAD. For test problems, the optimized adjoint is shown to have far lower memory requirements, potentially enablingmore » larger problem sizes on memory-limited machines. In the case of the land ice model, implementation of the algorithm allows further optimization by having the adjoint model solve a sequence of linear systems with identical (as opposed to varying) matrices, greatly improving performance. Finally, the methods introduced here will be of value to other efforts applying AD tools to ice models, particularly ones which solve a hybrid shallow ice/shallow shelf approximation to the Stokes equations.« less

A Vision-Based Self-Calibration Method for Robotic Visual Inspection Systems

PubMed Central

Yin, Shibin; Ren, Yongjie; Zhu, Jigui; Yang, Shourui; Ye, Shenghua

2013-01-01

A vision-based robot self-calibration method is proposed in this paper to evaluate the kinematic parameter errors of a robot using a visual sensor mounted on its end-effector. This approach could be performed in the industrial field without external, expensive apparatus or an elaborate setup. A robot Tool Center Point (TCP) is defined in the structural model of a line-structured laser sensor, and aligned to a reference point fixed in the robot workspace. A mathematical model is established to formulate the misalignment errors with kinematic parameter errors and TCP position errors. Based on the fixed point constraints, the kinematic parameter errors and TCP position errors are identified with an iterative algorithm. Compared to the conventional methods, this proposed method eliminates the need for a robot-based-frame and hand-to-eye calibrations, shortens the error propagation chain, and makes the calibration process more accurate and convenient. A validation experiment is performed on an ABB IRB2400 robot. An optimal configuration on the number and distribution of fixed points in the robot workspace is obtained based on the experimental results. Comparative experiments reveal that there is a significant improvement of the measuring accuracy of the robotic visual inspection system. PMID:24300597

Virtual fringe projection system with nonparallel illumination based on iteration

NASA Astrophysics Data System (ADS)

Zhou, Duo; Wang, Zhangying; Gao, Nan; Zhang, Zonghua; Jiang, Xiangqian

2017-06-01

Fringe projection profilometry has been widely applied in many fields. To set up an ideal measuring system, a virtual fringe projection technique has been studied to assist in the design of hardware configurations. However, existing virtual fringe projection systems use parallel illumination and have a fixed optical framework. This paper presents a virtual fringe projection system with nonparallel illumination. Using an iterative method to calculate intersection points between rays and reference planes or object surfaces, the proposed system can simulate projected fringe patterns and captured images. A new explicit calibration method has been presented to validate the precision of the system. Simulated results indicate that the proposed iterative method outperforms previous systems. Our virtual system can be applied to error analysis, algorithm optimization, and help operators to find ideal system parameter settings for actual measurements.

Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction

PubMed Central

Nikazad, T; Davidi, R; Herman, G. T.

2013-01-01

We study the convergence of a class of accelerated perturbation-resilient block-iterative projection methods for solving systems of linear equations. We prove convergence to a fixed point of an operator even in the presence of summable perturbations of the iterates, irrespective of the consistency of the linear system. For a consistent system, the limit point is a solution of the system. In the inconsistent case, the symmetric version of our method converges to a weighted least squares solution. Perturbation resilience is utilized to approximate the minimum of a convex functional subject to the equations. A main contribution, as compared to previously published approaches to achieving similar aims, is a more than an order of magnitude speed-up, as demonstrated by applying the methods to problems of image reconstruction from projections. In addition, the accelerated algorithms are illustrated to be better, in a strict sense provided by the method of statistical hypothesis testing, than their unaccelerated versions for the task of detecting small tumors in the brain from X-ray CT projection data. PMID:23440911

Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction.

PubMed

Nikazad, T; Davidi, R; Herman, G T

2012-03-01

We study the convergence of a class of accelerated perturbation-resilient block-iterative projection methods for solving systems of linear equations. We prove convergence to a fixed point of an operator even in the presence of summable perturbations of the iterates, irrespective of the consistency of the linear system. For a consistent system, the limit point is a solution of the system. In the inconsistent case, the symmetric version of our method converges to a weighted least squares solution. Perturbation resilience is utilized to approximate the minimum of a convex functional subject to the equations. A main contribution, as compared to previously published approaches to achieving similar aims, is a more than an order of magnitude speed-up, as demonstrated by applying the methods to problems of image reconstruction from projections. In addition, the accelerated algorithms are illustrated to be better, in a strict sense provided by the method of statistical hypothesis testing, than their unaccelerated versions for the task of detecting small tumors in the brain from X-ray CT projection data.

Non-iterative distance constraints enforcement for cloth drapes simulation

NASA Astrophysics Data System (ADS)

Hidajat, R. L. L. G.; Wibowo, Arifin, Z.; Suyitno

2016-03-01

A cloth simulation represents the behavior of cloth objects such as flag, tablecloth, or even garments has application in clothing animation for games and virtual shops. Elastically deformable models have widely used to provide realistic and efficient simulation, however problem of overstretching is encountered. We introduce a new cloth simulation algorithm that replaces iterative distance constraint enforcement steps with non-iterative ones for preventing over stretching in a spring-mass system for cloth modeling. Our method is based on a simple position correction procedure applied at one end of a spring. In our experiments, we developed a rectangle cloth model which is initially at a horizontal position with one point is fixed, and it is allowed to drape by its own weight. Our simulation is able to achieve a plausible cloth drapes as in reality. This paper aims to demonstrate the reliability of our approach to overcome overstretches while decreasing the computational cost of the constraint enforcement process due to an iterative procedure that is eliminated.

Models of Intracavity Frequency Doubled Lasers

DTIC Science & Technology

1990-01-01

Intermittency; Intermittency Theory; Entropies and Dimension with Intermittency; Resonances, Frobenius - Perron Operators and Power Spectra; and Scaling and...to finding a measure is to approximate the Frobenius - Perron operator, whose domain is the set of measures on M (see, e.g., Li, 1976). An invariant...measure of the system is a fixed point of the Frobenius - Perron operator, and an iterative method using this operator can be shown to converge to an

Some estimation formulae for continuous time-invariant linear systems

NASA Technical Reports Server (NTRS)

Bierman, G. J.; Sidhu, G. S.

1975-01-01

In this brief paper we examine a Riccati equation decomposition due to Reid and Lainiotis and apply the result to the continuous time-invariant linear filtering problem. Exploitation of the time-invariant structure leads to integration-free covariance recursions which are of use in covariance analyses and in filter implementations. A super-linearly convergent iterative solution to the algebraic Riccati equation (ARE) is developed. The resulting algorithm, arranged in a square-root form, is thought to be numerically stable and competitive with other ARE solution methods. Certain covariance relations that are relevant to the fixed-point and fixed-lag smoothing problems are also discussed.

Multiple Revolution Solutions for the Perturbed Lambert Problem using the Method of Particular Solutions and Picard Iteration

NASA Astrophysics Data System (ADS)

Woollands, Robyn M.; Read, Julie L.; Probe, Austin B.; Junkins, John L.

2017-12-01

We present a new method for solving the multiple revolution perturbed Lambert problem using the method of particular solutions and modified Chebyshev-Picard iteration. The method of particular solutions differs from the well-known Newton-shooting method in that integration of the state transition matrix (36 additional differential equations) is not required, and instead it makes use of a reference trajectory and a set of n particular solutions. Any numerical integrator can be used for solving two-point boundary problems with the method of particular solutions, however we show that using modified Chebyshev-Picard iteration affords an avenue for increased efficiency that is not available with other step-by-step integrators. We take advantage of the path approximation nature of modified Chebyshev-Picard iteration (nodes iteratively converge to fixed points in space) and utilize a variable fidelity force model for propagating the reference trajectory. Remarkably, we demonstrate that computing the particular solutions with only low fidelity function evaluations greatly increases the efficiency of the algorithm while maintaining machine precision accuracy. Our study reveals that solving the perturbed Lambert's problem using the method of particular solutions with modified Chebyshev-Picard iteration is about an order of magnitude faster compared with the classical shooting method and a tenth-twelfth order Runge-Kutta integrator. It is well known that the solution to Lambert's problem over multiple revolutions is not unique and to ensure that all possible solutions are considered we make use of a reliable preexisting Keplerian Lambert solver to warm start our perturbed algorithm.

Truncated Conjugate Gradient: An Optimal Strategy for the Analytical Evaluation of the Many-Body Polarization Energy and Forces in Molecular Simulations.

PubMed

Aviat, Félix; Levitt, Antoine; Stamm, Benjamin; Maday, Yvon; Ren, Pengyu; Ponder, Jay W; Lagardère, Louis; Piquemal, Jean-Philip

2017-01-10

We introduce a new class of methods, denoted as Truncated Conjugate Gradient(TCG), to solve the many-body polarization energy and its associated forces in molecular simulations (i.e. molecular dynamics (MD) and Monte Carlo). The method consists in a fixed number of Conjugate Gradient (CG) iterations. TCG approaches provide a scalable solution to the polarization problem at a user-chosen cost and a corresponding optimal accuracy. The optimality of the CG-method guarantees that the number of the required matrix-vector products are reduced to a minimum compared to other iterative methods. This family of methods is non-empirical, fully adaptive, and provides analytical gradients, avoiding therefore any energy drift in MD as compared to popular iterative solvers. Besides speed, one great advantage of this class of approximate methods is that their accuracy is systematically improvable. Indeed, as the CG-method is a Krylov subspace method, the associated error is monotonically reduced at each iteration. On top of that, two improvements can be proposed at virtually no cost: (i) the use of preconditioners can be employed, which leads to the Truncated Preconditioned Conjugate Gradient (TPCG); (ii) since the residual of the final step of the CG-method is available, one additional Picard fixed point iteration ("peek"), equivalent to one step of Jacobi Over Relaxation (JOR) with relaxation parameter ω, can be made at almost no cost. This method is denoted by TCG-n(ω). Black-box adaptive methods to find good choices of ω are provided and discussed. Results show that TPCG-3(ω) is converged to high accuracy (a few kcal/mol) for various types of systems including proteins and highly charged systems at the fixed cost of four matrix-vector products: three CG iterations plus the initial CG descent direction. Alternatively, T(P)CG-2(ω) provides robust results at a reduced cost (three matrix-vector products) and offers new perspectives for long polarizable MD as a production algorithm. The T(P)CG-1(ω) level provides less accurate solutions for inhomogeneous systems, but its applicability to well-conditioned problems such as water is remarkable, with only two matrix-vector product evaluations.

Truncated Conjugate Gradient: An Optimal Strategy for the Analytical Evaluation of the Many-Body Polarization Energy and Forces in Molecular Simulations

PubMed Central

2016-01-01

We introduce a new class of methods, denoted as Truncated Conjugate Gradient(TCG), to solve the many-body polarization energy and its associated forces in molecular simulations (i.e. molecular dynamics (MD) and Monte Carlo). The method consists in a fixed number of Conjugate Gradient (CG) iterations. TCG approaches provide a scalable solution to the polarization problem at a user-chosen cost and a corresponding optimal accuracy. The optimality of the CG-method guarantees that the number of the required matrix-vector products are reduced to a minimum compared to other iterative methods. This family of methods is non-empirical, fully adaptive, and provides analytical gradients, avoiding therefore any energy drift in MD as compared to popular iterative solvers. Besides speed, one great advantage of this class of approximate methods is that their accuracy is systematically improvable. Indeed, as the CG-method is a Krylov subspace method, the associated error is monotonically reduced at each iteration. On top of that, two improvements can be proposed at virtually no cost: (i) the use of preconditioners can be employed, which leads to the Truncated Preconditioned Conjugate Gradient (TPCG); (ii) since the residual of the final step of the CG-method is available, one additional Picard fixed point iteration (“peek”), equivalent to one step of Jacobi Over Relaxation (JOR) with relaxation parameter ω, can be made at almost no cost. This method is denoted by TCG-n(ω). Black-box adaptive methods to find good choices of ω are provided and discussed. Results show that TPCG-3(ω) is converged to high accuracy (a few kcal/mol) for various types of systems including proteins and highly charged systems at the fixed cost of four matrix-vector products: three CG iterations plus the initial CG descent direction. Alternatively, T(P)CG-2(ω) provides robust results at a reduced cost (three matrix-vector products) and offers new perspectives for long polarizable MD as a production algorithm. The T(P)CG-1(ω) level provides less accurate solutions for inhomogeneous systems, but its applicability to well-conditioned problems such as water is remarkable, with only two matrix-vector product evaluations. PMID:28068773

Cyclic Game Dynamics Driven by Iterated Reasoning

PubMed Central

Frey, Seth; Goldstone, Robert L.

2013-01-01

Recent theories from complexity science argue that complex dynamics are ubiquitous in social and economic systems. These claims emerge from the analysis of individually simple agents whose collective behavior is surprisingly complicated. However, economists have argued that iterated reasoning–what you think I think you think–will suppress complex dynamics by stabilizing or accelerating convergence to Nash equilibrium. We report stable and efficient periodic behavior in human groups playing the Mod Game, a multi-player game similar to Rock-Paper-Scissors. The game rewards subjects for thinking exactly one step ahead of others in their group. Groups that play this game exhibit cycles that are inconsistent with any fixed-point solution concept. These cycles are driven by a “hopping” behavior that is consistent with other accounts of iterated reasoning: agents are constrained to about two steps of iterated reasoning and learn an additional one-half step with each session. If higher-order reasoning can be complicit in complex emergent dynamics, then cyclic and chaotic patterns may be endogenous features of real-world social and economic systems. PMID:23441191

Controlled wavelet domain sparsity for x-ray tomography

NASA Astrophysics Data System (ADS)

Purisha, Zenith; Rimpeläinen, Juho; Bubba, Tatiana; Siltanen, Samuli

2018-01-01

Tomographic reconstruction is an ill-posed inverse problem that calls for regularization. One possibility is to require sparsity of the unknown in an orthonormal wavelet basis. This, in turn, can be achieved by variational regularization, where the penalty term is the sum of the absolute values of the wavelet coefficients. The primal-dual fixed point algorithm showed that the minimizer of the variational regularization functional can be computed iteratively using a soft-thresholding operation. Choosing the soft-thresholding parameter \

An adaptive segment method for smoothing lidar signal based on noise estimation

NASA Astrophysics Data System (ADS)

Wang, Yuzhao; Luo, Pingping

2014-10-01

An adaptive segmentation smoothing method (ASSM) is introduced in the paper to smooth the signal and suppress the noise. In the ASSM, the noise is defined as the 3σ of the background signal. An integer number N is defined for finding the changing positions in the signal curve. If the difference of adjacent two points is greater than 3Nσ, the position is recorded as an end point of the smoothing segment. All the end points detected as above are recorded and the curves between them will be smoothed separately. In the traditional method, the end points of the smoothing windows in the signals are fixed. The ASSM creates changing end points in different signals and the smoothing windows could be set adaptively. The windows are always set as the half of the segmentations and then the average smoothing method will be applied in the segmentations. The Iterative process is required for reducing the end-point aberration effect in the average smoothing method and two or three times are enough. In ASSM, the signals are smoothed in the spacial area nor frequent area, that means the frequent disturbance will be avoided. A lidar echo was simulated in the experimental work. The echo was supposed to be created by a space-born lidar (e.g. CALIOP). And white Gaussian noise was added to the echo to act as the random noise resulted from environment and the detector. The novel method, ASSM, was applied to the noisy echo to filter the noise. In the test, N was set to 3 and the Iteration time is two. The results show that, the signal could be smoothed adaptively by the ASSM, but the N and the Iteration time might be optimized when the ASSM is applied in a different lidar.

Evaluation of integration methods for hybrid simulation of complex structural systems through collapse

NASA Astrophysics Data System (ADS)

Del Carpio R., Maikol; Hashemi, M. Javad; Mosqueda, Gilberto

2017-10-01

This study examines the performance of integration methods for hybrid simulation of large and complex structural systems in the context of structural collapse due to seismic excitations. The target application is not necessarily for real-time testing, but rather for models that involve large-scale physical sub-structures and highly nonlinear numerical models. Four case studies are presented and discussed. In the first case study, the accuracy of integration schemes including two widely used methods, namely, modified version of the implicit Newmark with fixed-number of iteration (iterative) and the operator-splitting (non-iterative) is examined through pure numerical simulations. The second case study presents the results of 10 hybrid simulations repeated with the two aforementioned integration methods considering various time steps and fixed-number of iterations for the iterative integration method. The physical sub-structure in these tests consists of a single-degree-of-freedom (SDOF) cantilever column with replaceable steel coupons that provides repeatable highlynonlinear behavior including fracture-type strength and stiffness degradations. In case study three, the implicit Newmark with fixed-number of iterations is applied for hybrid simulations of a 1:2 scale steel moment frame that includes a relatively complex nonlinear numerical substructure. Lastly, a more complex numerical substructure is considered by constructing a nonlinear computational model of a moment frame coupled to a hybrid model of a 1:2 scale steel gravity frame. The last two case studies are conducted on the same porotype structure and the selection of time steps and fixed number of iterations are closely examined in pre-test simulations. The generated unbalance forces is used as an index to track the equilibrium error and predict the accuracy and stability of the simulations.

Prospective ECG-Triggered Coronary CT Angiography: Clinical Value of Noise-Based Tube Current Reduction Method with Iterative Reconstruction

PubMed Central

Shen, Junlin; Du, Xiangying; Guo, Daode; Cao, Lizhen; Gao, Yan; Yang, Qi; Li, Pengyu; Liu, Jiabin; Li, Kuncheng

2013-01-01

Objectives To evaluate the clinical value of noise-based tube current reduction method with iterative reconstruction for obtaining consistent image quality with dose optimization in prospective electrocardiogram (ECG)-triggered coronary CT angiography (CCTA). Materials and Methods We performed a prospective randomized study evaluating 338 patients undergoing CCTA with prospective ECG-triggering. Patients were randomly assigned to fixed tube current with filtered back projection (Group 1, n = 113), noise-based tube current with filtered back projection (Group 2, n = 109) or with iterative reconstruction (Group 3, n = 116). Tube voltage was fixed at 120 kV. Qualitative image quality was rated on a 5-point scale (1 = impaired, to 5 = excellent, with 3–5 defined as diagnostic). Image noise and signal intensity were measured; signal-to-noise ratio was calculated; radiation dose parameters were recorded. Statistical analyses included one-way analysis of variance, chi-square test, Kruskal-Wallis test and multivariable linear regression. Results Image noise was maintained at the target value of 35HU with small interquartile range for Group 2 (35.00–35.03HU) and Group 3 (34.99–35.02HU), while from 28.73 to 37.87HU for Group 1. All images in the three groups were acceptable for diagnosis. A relative 20% and 51% reduction in effective dose for Group 2 (2.9 mSv) and Group 3 (1.8 mSv) were achieved compared with Group 1 (3.7 mSv). After adjustment for scan characteristics, iterative reconstruction was associated with 26% reduction in effective dose. Conclusion Noise-based tube current reduction method with iterative reconstruction maintains image noise precisely at the desired level and achieves consistent image quality. Meanwhile, effective dose can be reduced by more than 50%. PMID:23741444

Adaptive iterated function systems filter for images highly corrupted with fixed - Value impulse noise

NASA Astrophysics Data System (ADS)

Shanmugavadivu, P.; Eliahim Jeevaraj, P. S.

2014-06-01

The Adaptive Iterated Functions Systems (AIFS) Filter presented in this paper has an outstanding potential to attenuate the fixed-value impulse noise in images. This filter has two distinct phases namely noise detection and noise correction which uses Measure of Statistics and Iterated Function Systems (IFS) respectively. The performance of AIFS filter is assessed by three metrics namely, Peak Signal-to-Noise Ratio (PSNR), Mean Structural Similarity Index Matrix (MSSIM) and Human Visual Perception (HVP). The quantitative measures PSNR and MSSIM endorse the merit of this filter in terms of degree of noise suppression and details/edge preservation respectively, in comparison with the high performing filters reported in the recent literature. The qualitative measure HVP confirms the noise suppression ability of the devised filter. This computationally simple noise filter broadly finds application wherein the images are highly degraded by fixed-value impulse noise.

Nash equilibrium in differential games and the construction of the programmed iteration method

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

Averboukh, Yurii V

This work is devoted to the study of nonzero-sum differential games. The set of payoffs in a situation of Nash equilibrium is examined. It is shown that the set of payoffs in a situation of Nash equilibrium coincides with the set of values of consistent functions which are fixed points of the program absorption operator. A condition for functions to be consistent is given in terms of the weak invariance of the graph of the functions under a certain differential inclusion. Bibliography: 18 titles.

Estimation for the Linear Model With Uncertain Covariance Matrices

NASA Astrophysics Data System (ADS)

Zachariah, Dave; Shariati, Nafiseh; Bengtsson, Mats; Jansson, Magnus; Chatterjee, Saikat

2014-03-01

We derive a maximum a posteriori estimator for the linear observation model, where the signal and noise covariance matrices are both uncertain. The uncertainties are treated probabilistically by modeling the covariance matrices with prior inverse-Wishart distributions. The nonconvex problem of jointly estimating the signal of interest and the covariance matrices is tackled by a computationally efficient fixed-point iteration as well as an approximate variational Bayes solution. The statistical performance of estimators is compared numerically to state-of-the-art estimators from the literature and shown to perform favorably.

Some Remarks on GMRES for Transport Theory

NASA Technical Reports Server (NTRS)

Patton, Bruce W.; Holloway, James Paul

2003-01-01

We review some work on the application of GMRES to the solution of the discrete ordinates transport equation in one-dimension. We note that GMRES can be applied directly to the angular flux vector, or it can be applied to only a vector of flux moments as needed to compute the scattering operator of the transport equation. In the former case we illustrate both the delights and defects of ILU right-preconditioners for problems with anisotropic scatter and for problems with upscatter. When working with flux moments we note that GMRES can be used as an accelerator for any existing transport code whose solver is based on a stationary fixed-point iteration, including transport sweeps and DSA transport sweeps. We also provide some numerical illustrations of this idea. We finally show how space can be traded for speed by taking multiple transport sweeps per GMRES iteration. Key Words: transport equation, GMRES, Krylov subspace

A proximity algorithm accelerated by Gauss-Seidel iterations for L1/TV denoising models

NASA Astrophysics Data System (ADS)

Li, Qia; Micchelli, Charles A.; Shen, Lixin; Xu, Yuesheng

2012-09-01

Our goal in this paper is to improve the computational performance of the proximity algorithms for the L1/TV denoising model. This leads us to a new characterization of all solutions to the L1/TV model via fixed-point equations expressed in terms of the proximity operators. Based upon this observation we develop an algorithm for solving the model and establish its convergence. Furthermore, we demonstrate that the proposed algorithm can be accelerated through the use of the componentwise Gauss-Seidel iteration so that the CPU time consumed is significantly reduced. Numerical experiments using the proposed algorithm for impulsive noise removal are included, with a comparison to three recently developed algorithms. The numerical results show that while the proposed algorithm enjoys a high quality of the restored images, as the other three known algorithms do, it performs significantly better in terms of computational efficiency measured in the CPU time consumed.

Numerical Computation of Subsonic Conical Diffuser Flows with Nonuniform Turbulent Inlet Conditions

DTIC Science & Technology

1977-09-01

Gauss - Seidel Point Iteration Method . . . . . . . . . . . . . . . 7.0 FACTORS AFFECTING THE RATE OF CONVERGENCE OF THE POINT...can be solved in several ways. For simplicity, a standard Gauss - Seidel iteration method is used to obtain the solution . The method updates the...FACTORS AFFECTING THE RATE OF CONVERGENCE OF THE POINT ITERATION ,ŘETHOD The advantage of using the Gauss - Seidel point iteration method to

Continuation of probability density functions using a generalized Lyapunov approach

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

Baars, S., E-mail: s.baars@rug.nl; Viebahn, J.P., E-mail: viebahn@cwi.nl; Mulder, T.E., E-mail: t.e.mulder@uu.nl

Techniques from numerical bifurcation theory are very useful to study transitions between steady fluid flow patterns and the instabilities involved. Here, we provide computational methodology to use parameter continuation in determining probability density functions of systems of stochastic partial differential equations near fixed points, under a small noise approximation. Key innovation is the efficient solution of a generalized Lyapunov equation using an iterative method involving low-rank approximations. We apply and illustrate the capabilities of the method using a problem in physical oceanography, i.e. the occurrence of multiple steady states of the Atlantic Ocean circulation.

A Scalable Architecture of a Structured LDPC Decoder

NASA Technical Reports Server (NTRS)

Lee, Jason Kwok-San; Lee, Benjamin; Thorpe, Jeremy; Andrews, Kenneth; Dolinar, Sam; Hamkins, Jon

2004-01-01

We present a scalable decoding architecture for a certain class of structured LDPC codes. The codes are designed using a small (n,r) protograph that is replicated Z times to produce a decoding graph for a (Z x n, Z x r) code. Using this architecture, we have implemented a decoder for a (4096,2048) LDPC code on a Xilinx Virtex-II 2000 FPGA, and achieved decoding speeds of 31 Mbps with 10 fixed iterations. The implemented message-passing algorithm uses an optimized 3-bit non-uniform quantizer that operates with 0.2dB implementation loss relative to a floating point decoder.

Twisted Burnside-Frobenius Theory for Endomorphisms of Polycyclic Groups

NASA Astrophysics Data System (ADS)

Fel'shtyn, A. L.; Troitsky, E. V.

2018-01-01

Let R(ϕ) be the number of ϕ-conjugacy (or Reidemeister) classes of an endomorphism ϕ of a group G. We prove, for several classes of groups (including polycyclic ones), that the number R(ϕ) is equal to the number of fixed points of the induced mapping on an appropriate subspace of the unitary dual space Ĝ, when R(ϕ) < ∞. Applying the result to iterations of ϕ, we obtain Gauss congruences for Reidemeister numbers. In contrast to the case of automorphisms, studied previously, there are plenty examples having the above finiteness condition, even among groups with R ∞ property.

An Iterative Solver in the Presence and Absence of Multiplicity for Nonlinear Equations

PubMed Central

Özkum, Gülcan

2013-01-01

We develop a high-order fixed point type method to approximate a multiple root. By using three functional evaluations per full cycle, a new class of fourth-order methods for this purpose is suggested and established. The methods from the class require the knowledge of the multiplicity. We also present a method in the absence of multiplicity for nonlinear equations. In order to attest the efficiency of the obtained methods, we employ numerical comparisons alongside obtaining basins of attraction to compare them in the complex plane according to their convergence speed and chaotic behavior. PMID:24453914

Maximum likelihood clustering with dependent feature trees

NASA Technical Reports Server (NTRS)

Chittineni, C. B. (Principal Investigator)

1981-01-01

The decomposition of mixture density of the data into its normal component densities is considered. The densities are approximated with first order dependent feature trees using criteria of mutual information and distance measures. Expressions are presented for the criteria when the densities are Gaussian. By defining different typs of nodes in a general dependent feature tree, maximum likelihood equations are developed for the estimation of parameters using fixed point iterations. The field structure of the data is also taken into account in developing maximum likelihood equations. Experimental results from the processing of remotely sensed multispectral scanner imagery data are included.

Area- and energy-efficient CORDIC accelerators in deep sub-micron CMOS technologies

NASA Astrophysics Data System (ADS)

Vishnoi, U.; Noll, T. G.

2012-09-01

The COordinate Rotate DIgital Computer (CORDIC) algorithm is a well known versatile approach and is widely applied in today's SoCs for especially but not restricted to digital communications. Dedicated CORDIC blocks can be implemented in deep sub-micron CMOS technologies at very low area and energy costs and are attractive to be used as hardware accelerators for Application Specific Instruction Processors (ASIPs). Thereby, overcoming the well known energy vs. flexibility conflict. Optimizing Global Navigation Satellite System (GNSS) receivers to reduce the hardware complexity is an important research topic at present. In such receivers CORDIC accelerators can be used for digital baseband processing (fixed-point) and in Position-Velocity-Time estimation (floating-point). A micro architecture well suited to such applications is presented. This architecture is parameterized according to the wordlengths as well as the number of iterations and can be easily extended for floating point data format. Moreover, area can be traded for throughput by partially or even fully unrolling the iterations, whereby the degree of pipelining is organized with one CORDIC iteration per cycle. From the architectural description, the macro layout can be generated fully automatically using an in-house datapath generator tool. Since the adders and shifters play an important role in optimizing the CORDIC block, they must be carefully optimized for high area and energy efficiency in the underlying technology. So, for this purpose carry-select adders and logarithmic shifters have been chosen. Device dimensioning was automatically optimized with respect to dynamic and static power, area and performance using the in-house tool. The fully sequential CORDIC block for fixed-point digital baseband processing features a wordlength of 16 bits, requires 5232 transistors, which is implemented in a 40-nm CMOS technology and occupies a silicon area of 1560 μm2 only. Maximum clock frequency from circuit simulation of extracted netlist is 768 MHz under typical, and 463 MHz under worst case technology and application corner conditions, respectively. Simulated dynamic power dissipation is 0.24 uW MHz-1 at 0.9 V; static power is 38 uW in slow corner, 65 uW in typical corner and 518 uW in fast corner, respectively. The latter can be reduced by 43% in a 40-nm CMOS technology using 0.5 V reverse-backbias. These features are compared with the results from different design styles as well as with an implementation in 28-nm CMOS technology. It is interesting that in the latter case area scales as expected, but worst case performance and energy do not scale well anymore.

Iterative inversion of deformation vector fields with feedback control.

PubMed

Dubey, Abhishek; Iliopoulos, Alexandros-Stavros; Sun, Xiaobai; Yin, Fang-Fang; Ren, Lei

2018-05-14

Often, the inverse deformation vector field (DVF) is needed together with the corresponding forward DVF in four-dimesional (4D) reconstruction and dose calculation, adaptive radiation therapy, and simultaneous deformable registration. This study aims at improving both accuracy and efficiency of iterative algorithms for DVF inversion, and advancing our understanding of divergence and latency conditions. We introduce a framework of fixed-point iteration algorithms with active feedback control for DVF inversion. Based on rigorous convergence analysis, we design control mechanisms for modulating the inverse consistency (IC) residual of the current iterate, to be used as feedback into the next iterate. The control is designed adaptively to the input DVF with the objective to enlarge the convergence area and expedite convergence. Three particular settings of feedback control are introduced: constant value over the domain throughout the iteration; alternating values between iteration steps; and spatially variant values. We also introduce three spectral measures of the displacement Jacobian for characterizing a DVF. These measures reveal the critical role of what we term the nontranslational displacement component (NTDC) of the DVF. We carry out inversion experiments with an analytical DVF pair, and with DVFs associated with thoracic CT images of six patients at end of expiration and end of inspiration. The NTDC-adaptive iterations are shown to attain a larger convergence region at a faster pace compared to previous nonadaptive DVF inversion iteration algorithms. By our numerical experiments, alternating control yields smaller IC residuals and inversion errors than constant control. Spatially variant control renders smaller residuals and errors by at least an order of magnitude, compared to other schemes, in no more than 10 steps. Inversion results also show remarkable quantitative agreement with analysis-based predictions. Our analysis captures properties of DVF data associated with clinical CT images, and provides new understanding of iterative DVF inversion algorithms with a simple residual feedback control. Adaptive control is necessary and highly effective in the presence of nonsmall NTDCs. The adaptive iterations or the spectral measures, or both, may potentially be incorporated into deformable image registration methods. © 2018 American Association of Physicists in Medicine.

Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings.

PubMed

Werner, Tomás

2015-07-01

Many inference tasks in pattern recognition and artificial intelligence lead to partition functions in which addition and multiplication are abstract binary operations forming a commutative semiring. By generalizing max-sum diffusion (one of convergent message passing algorithms for approximate MAP inference in graphical models), we propose an iterative algorithm to upper bound such partition functions over commutative semirings. The iteration of the algorithm is remarkably simple: change any two factors of the partition function such that their product remains the same and their overlapping marginals become equal. In many commutative semirings, repeating this iteration for different pairs of factors converges to a fixed point when the overlapping marginals of every pair of factors coincide. We call this state marginal consistency. During that, an upper bound on the partition function monotonically decreases. This abstract algorithm unifies several existing algorithms, including max-sum diffusion and basic constraint propagation (or local consistency) algorithms in constraint programming. We further construct a hierarchy of marginal consistencies of increasingly higher levels and show than any such level can be enforced by adding identity factors of higher arity (order). Finally, we discuss instances of the framework for several semirings, including the distributive lattice and the max-sum and sum-product semirings.

Fully coupled simulation of multiple hydraulic fractures to propagate simultaneously from a perforated horizontal wellbore

NASA Astrophysics Data System (ADS)

Zeng, Qinglei; Liu, Zhanli; Wang, Tao; Gao, Yue; Zhuang, Zhuo

2018-02-01

In hydraulic fracturing process in shale rock, multiple fractures perpendicular to a horizontal wellbore are usually driven to propagate simultaneously by the pumping operation. In this paper, a numerical method is developed for the propagation of multiple hydraulic fractures (HFs) by fully coupling the deformation and fracturing of solid formation, fluid flow in fractures, fluid partitioning through a horizontal wellbore and perforation entry loss effect. The extended finite element method (XFEM) is adopted to model arbitrary growth of the fractures. Newton's iteration is proposed to solve these fully coupled nonlinear equations, which is more efficient comparing to the widely adopted fixed-point iteration in the literatures and avoids the need to impose fluid pressure boundary condition when solving flow equations. A secant iterative method based on the stress intensity factor (SIF) is proposed to capture different propagation velocities of multiple fractures. The numerical results are compared with theoretical solutions in literatures to verify the accuracy of the method. The simultaneous propagation of multiple HFs is simulated by the newly proposed algorithm. The coupled influences of propagation regime, stress interaction, wellbore pressure loss and perforation entry loss on simultaneous propagation of multiple HFs are investigated.

Stochastic derivative-free optimization using a trust region framework

DOE PAGES

Larson, Jeffrey; Billups, Stephen C.

2016-02-17

This study presents a trust region algorithm to minimize a function f when one has access only to noise-corrupted function values f¯. The model-based algorithm dynamically adjusts its step length, taking larger steps when the model and function agree and smaller steps when the model is less accurate. The method does not require the user to specify a fixed pattern of points used to build local models and does not repeatedly sample points. If f is sufficiently smooth and the noise is independent and identically distributed with mean zero and finite variance, we prove that our algorithm produces iterates suchmore » that the corresponding function gradients converge in probability to zero. As a result, we present a prototype of our algorithm that, while simplistic in its management of previously evaluated points, solves benchmark problems in fewer function evaluations than do existing stochastic approximation methods.« less

Function representation with circle inversion map systems

NASA Astrophysics Data System (ADS)

Boreland, Bryson; Kunze, Herb

2017-01-01

The fractals literature develops the now well-known concept of local iterated function systems (using affine maps) with grey-level maps (LIFSM) as an approach to function representation in terms of the associated fixed point of the so-called fractal transform. While originally explored as a method to achieve signal (and 2-D image) compression, more recent work has explored various aspects of signal and image processing using this machinery. In this paper, we develop a similar framework for function representation using circle inversion map systems. Given a circle C with centre õ and radius r, inversion with respect to C transforms the point p˜ to the point p˜', such that p˜ and p˜' lie on the same radial half-line from õ and d(õ, p˜)d(õ, p˜') = r2, where d is Euclidean distance. We demonstrate the results with an example.

Basin boundaries and focal points in a map coming from Bairstow's method.

PubMed

Gardini, Laura; Bischi, Gian-Italo; Fournier-Prunaret, Daniele

1999-06-01

This paper is devoted to the study of the global dynamical properties of a two-dimensional noninvertible map, with a denominator which can vanish, obtained by applying Bairstow's method to a cubic polynomial. It is shown that the complicated structure of the basins of attraction of the fixed points is due to the existence of singularities such as sets of nondefinition, focal points, and prefocal curves, which are specific to maps with a vanishing denominator, and have been recently introduced in the literature. Some global bifurcations that change the qualitative structure of the basin boundaries, are explained in terms of contacts among these singularities. The techniques used in this paper put in evidence some new dynamic behaviors and bifurcations, which are peculiar of maps with denominator; hence they can be applied to the analysis of other classes of maps coming from iterative algorithms (based on Newton's method, or others). (c) 1999 American Institute of Physics.

From cat's eyes to disjoint multicellular natural convection flow in tall tilted cavities

NASA Astrophysics Data System (ADS)

Nicolás, Alfredo; Báez, Elsa; Bermúdez, Blanca

2011-07-01

Numerical results of two-dimensional natural convection problems, in air-filled tall cavities, are reported to study the change of the cat's eyes flow as some parameters vary, the aspect ratio A and the angle of inclination ϕ of the cavity, with the Rayleigh number Ra mostly fixed; explicitly, the range of the variation is given by 12⩽A⩽20 and 0°⩽ϕ⩽270°; about Ra=1.1×10. A novelty contribution of this work is the transition from the cat's eyes changes, as A varies, to a disjoint multicellular flow, as ϕ varies. These flows may be modeled by the unsteady Boussinesq approximation in stream function and vorticity variables which is solved with a fixed point iterative process applied to the nonlinear elliptic system that results after time discretization. The validation of the results relies on mesh size and time-step independence studies.

Real-time control of divertor detachment in H-mode with impurity seeding using Langmuir probe feedback in JET-ITER-like wall

NASA Astrophysics Data System (ADS)

Guillemaut, C.; Lennholm, M.; Harrison, J.; Carvalho, I.; Valcarcel, D.; Felton, R.; Griph, S.; Hogben, C.; Lucock, R.; Matthews, G. F.; Perez Von Thun, C.; Pitts, R. A.; Wiesen, S.; contributors, JET

2017-04-01

Burning plasmas with 500 MW of fusion power on ITER will rely on partially detached divertor operation to keep target heat loads at manageable levels. Such divertor regimes will be maintained by a real-time control system using the seeding of radiative impurities like nitrogen (N), neon or argon as actuator and one or more diagnostic signals as sensors. Recently, real-time control of divertor detachment has been successfully achieved in Type I ELMy H-mode JET-ITER-like wall discharges by using saturation current (I sat) measurements from divertor Langmuir probes as feedback signals to control the level of N seeding. The degree of divertor detachment is calculated in real-time by comparing the outer target peak I sat measurements to the peak I sat value at the roll-over in order to control the opening of the N injection valve. Real-time control of detachment has been achieved in both fixed and swept strike point experiments. The system has been progressively improved and can now automatically drive the divertor conditions from attached through high recycling and roll-over down to a user-defined level of detachment. Such a demonstration is a successful proof of principle in the context of future operation on ITER which will be extensively equipped with divertor target probes.

Anderson acceleration and application to the three-temperature energy equations

NASA Astrophysics Data System (ADS)

An, Hengbin; Jia, Xiaowei; Walker, Homer F.

2017-10-01

The Anderson acceleration method is an algorithm for accelerating the convergence of fixed-point iterations, including the Picard method. Anderson acceleration was first proposed in 1965 and, for some years, has been used successfully to accelerate the convergence of self-consistent field iterations in electronic-structure computations. Recently, the method has attracted growing attention in other application areas and among numerical analysts. Compared with a Newton-like method, an advantage of Anderson acceleration is that there is no need to form the Jacobian matrix. Thus the method is easy to implement. In this paper, an Anderson-accelerated Picard method is employed to solve the three-temperature energy equations, which are a type of strong nonlinear radiation-diffusion equations. Two strategies are used to improve the robustness of the Anderson acceleration method. One strategy is to adjust the iterates when necessary to satisfy the physical constraint. Another strategy is to monitor and, if necessary, reduce the matrix condition number of the least-squares problem in the Anderson-acceleration implementation so that numerical stability can be guaranteed. Numerical results show that the Anderson-accelerated Picard method can solve the three-temperature energy equations efficiently. Compared with the Picard method without acceleration, Anderson acceleration can reduce the number of iterations by at least half. A comparison between a Jacobian-free Newton-Krylov method, the Picard method, and the Anderson-accelerated Picard method is conducted in this paper.

Positive contraction mappings for classical and quantum Schrödinger systems

NASA Astrophysics Data System (ADS)

Georgiou, Tryphon T.; Pavon, Michele

2015-03-01

The classical Schrödinger bridge seeks the most likely probability law for a diffusion process, in path space, that matches marginals at two end points in time; the likelihood is quantified by the relative entropy between the sought law and a prior. Jamison proved that the new law is obtained through a multiplicative functional transformation of the prior. This transformation is characterised by an automorphism on the space of endpoints probability measures, which has been studied by Fortet, Beurling, and others. A similar question can be raised for processes evolving in a discrete time and space as well as for processes defined over non-commutative probability spaces. The present paper builds on earlier work by Pavon and Ticozzi and begins by establishing solutions to Schrödinger systems for Markov chains. Our approach is based on the Hilbert metric and shows that the solution to the Schrödinger bridge is provided by the fixed point of a contractive map. We approach, in a similar manner, the steering of a quantum system across a quantum channel. We are able to establish existence of quantum transitions that are multiplicative functional transformations of a given Kraus map for the cases where the marginals are either uniform or pure states. As in the Markov chain case, and for uniform density matrices, the solution of the quantum bridge can be constructed from the fixed point of a certain contractive map. For arbitrary marginal densities, extensive numerical simulations indicate that iteration of a similar map leads to fixed points from which we can construct a quantum bridge. For this general case, however, a proof of convergence remains elusive.

Dynamic Analysis of a Reaction-Diffusion Rumor Propagation Model

NASA Astrophysics Data System (ADS)

Zhao, Hongyong; Zhu, Linhe

2016-06-01

The rapid development of the Internet, especially the emergence of the social networks, leads rumor propagation into a new media era. Rumor propagation in social networks has brought new challenges to network security and social stability. This paper, based on partial differential equations (PDEs), proposes a new SIS rumor propagation model by considering the effect of the communication between the different rumor infected users on rumor propagation. The stabilities of a nonrumor equilibrium point and a rumor-spreading equilibrium point are discussed by linearization technique and the upper and lower solutions method, and the existence of a traveling wave solution is established by the cross-iteration scheme accompanied by the technique of upper and lower solutions and Schauder’s fixed point theorem. Furthermore, we add the time delay to rumor propagation and deduce the conditions of Hopf bifurcation and stability switches for the rumor-spreading equilibrium point by taking the time delay as the bifurcation parameter. Finally, numerical simulations are performed to illustrate the theoretical results.

A calibrated iterative reconstruction for quantitative photoacoustic tomography using multi-angle light-sheet illuminations

NASA Astrophysics Data System (ADS)

Wang, Yihan; Lu, Tong; Zhang, Songhe; Song, Shaoze; Wang, Bingyuan; Li, Jiao; Zhao, Huijuan; Gao, Feng

2018-02-01

Quantitative photoacoustic tomography (q-PAT) is a nontrivial technique can be used to reconstruct the absorption image with a high spatial resolution. Several attempts have been investigated by setting point sources or fixed-angle illuminations. However, in practical applications, these schemes normally suffer from low signal-to-noise ratio (SNR) or poor quantification especially for large-size domains, due to the limitation of the ANSI-safety incidence and incompleteness in the data acquisition. We herein present a q-PAT implementation that uses multi-angle light-sheet illuminations and a calibrated iterative multi-angle reconstruction. The approach can acquire more complete information on the intrinsic absorption and SNR-boosted photoacoustic signals at selected planes from the multi-angle wide-field excitations of light-sheet. Therefore, the sliced absorption maps over whole body can be recovered in a measurementflexible, noise-robust and computation-economic way. The proposed approach is validated by the phantom experiment, exhibiting promising performances in image fidelity and quantitative accuracy.

Application Of Iterative Reconstruction Techniques To Conventional Circular Tomography

NASA Astrophysics Data System (ADS)

Ghosh Roy, D. N.; Kruger, R. A.; Yih, B. C.; Del Rio, S. P.; Power, R. L.

1985-06-01

Two "point-by-point" iteration procedures, namely, Iterative Least Square Technique (ILST) and Simultaneous Iterative Reconstructive Technique (SIRT) were applied to classical circular tomographic reconstruction. The technique of tomosynthetic DSA was used in forming the tomographic images. Reconstructions of a dog's renal and neck anatomy are presented.

Improving the numerical integration solution of satellite orbits in the presence of solar radiation pressure using modified back differences

NASA Technical Reports Server (NTRS)

Lundberg, J. B.; Feulner, M. R.; Abusali, P. A. M.; Ho, C. S.

1991-01-01

The method of modified back differences, a technique that significantly reduces the numerical integration errors associated with crossing shadow boundaries using a fixed-mesh multistep integrator without a significant increase in computer run time, is presented. While Hubbard's integral approach can produce significant improvements to the trajectory solution, the interpolation method provides the best overall results. It is demonstrated that iterating on the point mass term correction is also important for achieving the best overall results. It is also shown that the method of modified back differences can be implemented with only a small increase in execution time.

Probabilistic cluster labeling of imagery data

NASA Technical Reports Server (NTRS)

Chittineni, C. B. (Principal Investigator)

1980-01-01

The problem of obtaining the probabilities of class labels for the clusters using spectral and spatial information from a given set of labeled patterns and their neighbors is considered. A relationship is developed between class and clusters conditional densities in terms of probabilities of class labels for the clusters. Expressions are presented for updating the a posteriori probabilities of the classes of a pixel using information from its local neighborhood. Fixed-point iteration schemes are developed for obtaining the optimal probabilities of class labels for the clusters. These schemes utilize spatial information and also the probabilities of label imperfections. Experimental results from the processing of remotely sensed multispectral scanner imagery data are presented.

A fixed-memory moving, expanding window for obtaining scatter corrections in X-ray CT and other stochastic averages

NASA Astrophysics Data System (ADS)

Levine, Zachary H.; Pintar, Adam L.

2015-11-01

A simple algorithm for averaging a stochastic sequence of 1D arrays in a moving, expanding window is provided. The samples are grouped in bins which increase exponentially in size so that a constant fraction of the samples is retained at any point in the sequence. The algorithm is shown to have particular relevance for a class of Monte Carlo sampling problems which includes one characteristic of iterative reconstruction in computed tomography. The code is available in the CPC program library in both Fortran 95 and C and is also available in R through CRAN.

On the efficient and reliable numerical solution of rate-and-state friction problems

NASA Astrophysics Data System (ADS)

Pipping, Elias; Kornhuber, Ralf; Rosenau, Matthias; Oncken, Onno

2016-03-01

We present a mathematically consistent numerical algorithm for the simulation of earthquake rupture with rate-and-state friction. Its main features are adaptive time stepping, a novel algebraic solution algorithm involving nonlinear multigrid and a fixed point iteration for the rate-and-state decoupling. The algorithm is applied to a laboratory scale subduction zone which allows us to compare our simulations with experimental results. Using physical parameters from the experiment, we find a good fit of recurrence time of slip events as well as their rupture width and peak slip. Computations in 3-D confirm efficiency and robustness of our algorithm.

Time-dependent spectral renormalization method

NASA Astrophysics Data System (ADS)

Cole, Justin T.; Musslimani, Ziad H.

2017-11-01

The spectral renormalization method was introduced by Ablowitz and Musslimani (2005) as an effective way to numerically compute (time-independent) bound states for certain nonlinear boundary value problems. In this paper, we extend those ideas to the time domain and introduce a time-dependent spectral renormalization method as a numerical means to simulate linear and nonlinear evolution equations. The essence of the method is to convert the underlying evolution equation from its partial or ordinary differential form (using Duhamel's principle) into an integral equation. The solution sought is then viewed as a fixed point in both space and time. The resulting integral equation is then numerically solved using a simple renormalized fixed-point iteration method. Convergence is achieved by introducing a time-dependent renormalization factor which is numerically computed from the physical properties of the governing evolution equation. The proposed method has the ability to incorporate physics into the simulations in the form of conservation laws or dissipation rates. This novel scheme is implemented on benchmark evolution equations: the classical nonlinear Schrödinger (NLS), integrable PT symmetric nonlocal NLS and the viscous Burgers' equations, each of which being a prototypical example of a conservative and dissipative dynamical system. Numerical implementation and algorithm performance are also discussed.

Iterative Usage of Fixed and Random Effect Models for Powerful and Efficient Genome-Wide Association Studies

PubMed Central

Liu, Xiaolei; Huang, Meng; Fan, Bin; Buckler, Edward S.; Zhang, Zhiwu

2016-01-01

False positives in a Genome-Wide Association Study (GWAS) can be effectively controlled by a fixed effect and random effect Mixed Linear Model (MLM) that incorporates population structure and kinship among individuals to adjust association tests on markers; however, the adjustment also compromises true positives. The modified MLM method, Multiple Loci Linear Mixed Model (MLMM), incorporates multiple markers simultaneously as covariates in a stepwise MLM to partially remove the confounding between testing markers and kinship. To completely eliminate the confounding, we divided MLMM into two parts: Fixed Effect Model (FEM) and a Random Effect Model (REM) and use them iteratively. FEM contains testing markers, one at a time, and multiple associated markers as covariates to control false positives. To avoid model over-fitting problem in FEM, the associated markers are estimated in REM by using them to define kinship. The P values of testing markers and the associated markers are unified at each iteration. We named the new method as Fixed and random model Circulating Probability Unification (FarmCPU). Both real and simulated data analyses demonstrated that FarmCPU improves statistical power compared to current methods. Additional benefits include an efficient computing time that is linear to both number of individuals and number of markers. Now, a dataset with half million individuals and half million markers can be analyzed within three days. PMID:26828793

Fourth-order numerical solutions of diffusion equation by using SOR method with Crank-Nicolson approach

NASA Astrophysics Data System (ADS)

Muhiddin, F. A.; Sulaiman, J.

2017-09-01

The aim of this paper is to investigate the effectiveness of the Successive Over-Relaxation (SOR) iterative method by using the fourth-order Crank-Nicolson (CN) discretization scheme to derive a five-point Crank-Nicolson approximation equation in order to solve diffusion equation. From this approximation equation, clearly, it can be shown that corresponding system of five-point approximation equations can be generated and then solved iteratively. In order to access the performance results of the proposed iterative method with the fourth-order CN scheme, another point iterative method which is Gauss-Seidel (GS), also presented as a reference method. Finally the numerical results obtained from the use of the fourth-order CN discretization scheme, it can be pointed out that the SOR iterative method is superior in terms of number of iterations, execution time, and maximum absolute error.

Fractional Programming for Communication Systems—Part I: Power Control and Beamforming

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic transform technique for tackling the multiple-ratio concave-convex FP problem--in contrast to conventional FP techniques that mostly can only deal with the single-ratio or the max-min-ratio case. Multiple-ratio FP problems are important for the optimization of communication networks, because system-level design often involves multiple signal-to-interference-plus-noise ratio terms. This paper considers the applications of FP to solving continuous problems in communication system design, particularly for power control, beamforming, and energy efficiency maximization. These application cases illustrate that the proposed quadratic transform can greatly facilitate the optimization involving ratios by recasting the original nonconvex problem as a sequence of convex problems. This FP-based problem reformulation gives rise to an efficient iterative optimization algorithm with provable convergence to a stationary point. The paper further demonstrates close connections between the proposed FP approach and other well-known algorithms in the literature, such as the fixed-point iteration and the weighted minimum mean-square-error beamforming. The optimization of discrete problems is discussed in Part II of this paper.

Application of the nudged elastic band method to the point-to-point radio wave ray tracing in IRI modeled ionosphere

NASA Astrophysics Data System (ADS)

Nosikov, I. A.; Klimenko, M. V.; Bessarab, P. F.; Zhbankov, G. A.

2017-07-01

Point-to-point ray tracing is an important problem in many fields of science. While direct variational methods where some trajectory is transformed to an optimal one are routinely used in calculations of pathways of seismic waves, chemical reactions, diffusion processes, etc., this approach is not widely known in ionospheric point-to-point ray tracing. We apply the Nudged Elastic Band (NEB) method to a radio wave propagation problem. In the NEB method, a chain of points which gives a discrete representation of the radio wave ray is adjusted iteratively to an optimal configuration satisfying the Fermat's principle, while the endpoints of the trajectory are kept fixed according to the boundary conditions. Transverse displacements define the radio ray trajectory, while springs between the points control their distribution along the ray. The method is applied to a study of point-to-point ionospheric ray tracing, where the propagation medium is obtained with the International Reference Ionosphere model taking into account traveling ionospheric disturbances. A 2-dimensional representation of the optical path functional is developed and used to gain insight into the fundamental difference between high and low rays. We conclude that high and low rays are minima and saddle points of the optical path functional, respectively.

Q-Learning-Based Adjustable Fixed-Phase Quantum Grover Search Algorithm

NASA Astrophysics Data System (ADS)

Guo, Ying; Shi, Wensha; Wang, Yijun; Hu, Jiankun

2017-02-01

We demonstrate that the rotation phase can be suitably chosen to increase the efficiency of the phase-based quantum search algorithm, leading to a dynamic balance between iterations and success probabilities of the fixed-phase quantum Grover search algorithm with Q-learning for a given number of solutions. In this search algorithm, the proposed Q-learning algorithm, which is a model-free reinforcement learning strategy in essence, is used for performing a matching algorithm based on the fraction of marked items λ and the rotation phase α. After establishing the policy function α = π(λ), we complete the fixed-phase Grover algorithm, where the phase parameter is selected via the learned policy. Simulation results show that the Q-learning-based Grover search algorithm (QLGA) enables fewer iterations and gives birth to higher success probabilities. Compared with the conventional Grover algorithms, it avoids the optimal local situations, thereby enabling success probabilities to approach one.

Iterative usage of fixed and random effect models for powerful and efficient genome-wide association studies

USDA-ARS?s Scientific Manuscript database

False positives in a Genome-Wide Association Study (GWAS) can be effectively controlled by a fixed effect and random effect Mixed Linear Model (MLM) that incorporates population structure and kinship among individuals to adjust association tests on markers; however, the adjustment also compromises t...

Higher-order finite-difference formulation of periodic Orbital-free Density Functional Theory

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

Ghosh, Swarnava; Suryanarayana, Phanish, E-mail: phanish.suryanarayana@ce.gatech.edu

2016-02-15

We present a real-space formulation and higher-order finite-difference implementation of periodic Orbital-free Density Functional Theory (OF-DFT). Specifically, utilizing a local reformulation of the electrostatic and kernel terms, we develop a generalized framework for performing OF-DFT simulations with different variants of the electronic kinetic energy. In particular, we propose a self-consistent field (SCF) type fixed-point method for calculations involving linear-response kinetic energy functionals. In this framework, evaluation of both the electronic ground-state and forces on the nuclei are amenable to computations that scale linearly with the number of atoms. We develop a parallel implementation of this formulation using the finite-difference discretization.more » We demonstrate that higher-order finite-differences can achieve relatively large convergence rates with respect to mesh-size in both the energies and forces. Additionally, we establish that the fixed-point iteration converges rapidly, and that it can be further accelerated using extrapolation techniques like Anderson's mixing. We validate the accuracy of the results by comparing the energies and forces with plane-wave methods for selected examples, including the vacancy formation energy in Aluminum. Overall, the suitability of the proposed formulation for scalable high performance computing makes it an attractive choice for large-scale OF-DFT calculations consisting of thousands of atoms.« less

Finite element solution of nonlinear eddy current problems with periodic excitation and its industrial applications☆

PubMed Central

Bíró, Oszkár; Koczka, Gergely; Preis, Kurt

2014-01-01

An efficient finite element method to take account of the nonlinearity of the magnetic materials when analyzing three-dimensional eddy current problems is presented in this paper. The problem is formulated in terms of vector and scalar potentials approximated by edge and node based finite element basis functions. The application of Galerkin techniques leads to a large, nonlinear system of ordinary differential equations in the time domain. The excitations are assumed to be time-periodic and the steady-state periodic solution is of interest only. This is represented either in the frequency domain as a finite Fourier series or in the time domain as a set of discrete time values within one period for each finite element degree of freedom. The former approach is the (continuous) harmonic balance method and, in the latter one, discrete Fourier transformation will be shown to lead to a discrete harmonic balance method. Due to the nonlinearity, all harmonics, both continuous and discrete, are coupled to each other. The harmonics would be decoupled if the problem were linear, therefore, a special nonlinear iteration technique, the fixed-point method is used to linearize the equations by selecting a time-independent permeability distribution, the so-called fixed-point permeability in each nonlinear iteration step. This leads to uncoupled harmonics within these steps. As industrial applications, analyses of large power transformers are presented. The first example is the computation of the electromagnetic field of a single-phase transformer in the time domain with the results compared to those obtained by traditional time-stepping techniques. In the second application, an advanced model of the same transformer is analyzed in the frequency domain by the harmonic balance method with the effect of the presence of higher harmonics on the losses investigated. Finally a third example tackles the case of direct current (DC) bias in the coils of a single-phase transformer. PMID:24829517

Finite element solution of nonlinear eddy current problems with periodic excitation and its industrial applications.

PubMed

Bíró, Oszkár; Koczka, Gergely; Preis, Kurt

2014-05-01

An efficient finite element method to take account of the nonlinearity of the magnetic materials when analyzing three-dimensional eddy current problems is presented in this paper. The problem is formulated in terms of vector and scalar potentials approximated by edge and node based finite element basis functions. The application of Galerkin techniques leads to a large, nonlinear system of ordinary differential equations in the time domain. The excitations are assumed to be time-periodic and the steady-state periodic solution is of interest only. This is represented either in the frequency domain as a finite Fourier series or in the time domain as a set of discrete time values within one period for each finite element degree of freedom. The former approach is the (continuous) harmonic balance method and, in the latter one, discrete Fourier transformation will be shown to lead to a discrete harmonic balance method. Due to the nonlinearity, all harmonics, both continuous and discrete, are coupled to each other. The harmonics would be decoupled if the problem were linear, therefore, a special nonlinear iteration technique, the fixed-point method is used to linearize the equations by selecting a time-independent permeability distribution, the so-called fixed-point permeability in each nonlinear iteration step. This leads to uncoupled harmonics within these steps. As industrial applications, analyses of large power transformers are presented. The first example is the computation of the electromagnetic field of a single-phase transformer in the time domain with the results compared to those obtained by traditional time-stepping techniques. In the second application, an advanced model of the same transformer is analyzed in the frequency domain by the harmonic balance method with the effect of the presence of higher harmonics on the losses investigated. Finally a third example tackles the case of direct current (DC) bias in the coils of a single-phase transformer.

Transformation of two and three-dimensional regions by elliptic systems

NASA Technical Reports Server (NTRS)

Mastin, C. Wayne

1991-01-01

A reliable linear system is presented for grid generation in 2-D and 3-D. The method is robust in the sense that convergence is guaranteed but is not as reliable as other nonlinear elliptic methods in generating nonfolding grids. The construction of nonfolding grids depends on having reasonable approximations of cell aspect ratios and an appropriate distribution of grid points on the boundary of the region. Some guidelines are included on approximating the aspect ratios, but little help is offered on setting up the boundary grid other than to say that in 2-D the boundary correspondence should be close to that generated by a conformal mapping. It is assumed that the functions which control the grid distribution depend only on the computational variables and not on the physical variables. Whether this is actually the case depends on how the grid is constructed. In a dynamic adaptive procedure where the grid is constructed in the process of solving a fluid flow problem, the grid is usually updated at fixed iteration counts using the current value of the control function. Since the control function is not being updated during the iteration of the grid equations, the grid construction is a linear procedure. However, in the case of a static adaptive procedure where a trial solution is computed and used to construct an adaptive grid, the control functions may be recomputed at every step of the grid iteration.

Fixed-point image orthorectification algorithms for reduced computational cost

NASA Astrophysics Data System (ADS)

French, Joseph Clinton

Imaging systems have been applied to many new applications in recent years. With the advent of low-cost, low-power focal planes and more powerful, lower cost computers, remote sensing applications have become more wide spread. Many of these applications require some form of geolocation, especially when relative distances are desired. However, when greater global positional accuracy is needed, orthorectification becomes necessary. Orthorectification is the process of projecting an image onto a Digital Elevation Map (DEM), which removes terrain distortions and corrects the perspective distortion by changing the viewing angle to be perpendicular to the projection plane. Orthorectification is used in disaster tracking, landscape management, wildlife monitoring and many other applications. However, orthorectification is a computationally expensive process due to floating point operations and divisions in the algorithm. To reduce the computational cost of on-board processing, two novel algorithm modifications are proposed. One modification is projection utilizing fixed-point arithmetic. Fixed point arithmetic removes the floating point operations and reduces the processing time by operating only on integers. The second modification is replacement of the division inherent in projection with a multiplication of the inverse. The inverse must operate iteratively. Therefore, the inverse is replaced with a linear approximation. As a result of these modifications, the processing time of projection is reduced by a factor of 1.3x with an average pixel position error of 0.2% of a pixel size for 128-bit integer processing and over 4x with an average pixel position error of less than 13% of a pixel size for a 64-bit integer processing. A secondary inverse function approximation is also developed that replaces the linear approximation with a quadratic. The quadratic approximation produces a more accurate approximation of the inverse, allowing for an integer multiplication calculation to be used in place of the traditional floating point division. This method increases the throughput of the orthorectification operation by 38% when compared to floating point processing. Additionally, this method improves the accuracy of the existing integer-based orthorectification algorithms in terms of average pixel distance, increasing the accuracy of the algorithm by more than 5x. The quadratic function reduces the pixel position error to 2% and is still 2.8x faster than the 128-bit floating point algorithm.

High-order computer-assisted estimates of topological entropy

NASA Astrophysics Data System (ADS)

Grote, Johannes

The concept of Taylor Models is introduced, which offers highly accurate C0-estimates for the enclosures of functional dependencies, combining high-order Taylor polynomial approximation of functions and rigorous estimates of the truncation error, performed using verified interval arithmetic. The focus of this work is on the application of Taylor Models in algorithms for strongly nonlinear dynamical systems. A method to obtain sharp rigorous enclosures of Poincare maps for certain types of flows and surfaces is developed and numerical examples are presented. Differential algebraic techniques allow the efficient and accurate computation of polynomial approximations for invariant curves of certain planar maps around hyperbolic fixed points. Subsequently we introduce a procedure to extend these polynomial curves to verified Taylor Model enclosures of local invariant manifolds with C0-errors of size 10-10--10 -14, and proceed to generate the global invariant manifold tangle up to comparable accuracy through iteration in Taylor Model arithmetic. Knowledge of the global manifold structure up to finite iterations of the local manifold pieces enables us to find all homoclinic and heteroclinic intersections in the generated manifold tangle. Combined with the mapping properties of the homoclinic points and their ordering we are able to construct a subshift of finite type as a topological factor of the original planar system to obtain rigorous lower bounds for its topological entropy. This construction is fully automatic and yields homoclinic tangles with several hundred homoclinic points. As an example rigorous lower bounds for the topological entropy of the Henon map are computed, which to the best knowledge of the authors yield the largest such estimates published so far.

Varying-energy CT imaging method based on EM-TV

NASA Astrophysics Data System (ADS)

Chen, Ping; Han, Yan

2016-11-01

For complicated structural components with wide x-ray attenuation ranges, conventional fixed-energy computed tomography (CT) imaging cannot obtain all the structural information. This limitation results in a shortage of CT information because the effective thickness of the components along the direction of x-ray penetration exceeds the limit of the dynamic range of the x-ray imaging system. To address this problem, a varying-energy x-ray CT imaging method is proposed. In this new method, the tube voltage is adjusted several times with the fixed lesser interval. Next, the fusion of grey consistency and logarithm demodulation are applied to obtain full and lower noise projection with a high dynamic range (HDR). In addition, for the noise suppression problem of the analytical method, EM-TV (expectation maximization-total Jvariation) iteration reconstruction is used. In the process of iteration, the reconstruction result obtained at one x-ray energy is used as the initial condition of the next iteration. An accompanying experiment demonstrates that this EM-TV reconstruction can also extend the dynamic range of x-ray imaging systems and provide a higher reconstruction quality relative to the fusion reconstruction method.

Equivalent charge source model based iterative maximum neighbor weight for sparse EEG source localization.

PubMed

Xu, Peng; Tian, Yin; Lei, Xu; Hu, Xiao; Yao, Dezhong

2008-12-01

How to localize the neural electric activities within brain effectively and precisely from the scalp electroencephalogram (EEG) recordings is a critical issue for current study in clinical neurology and cognitive neuroscience. In this paper, based on the charge source model and the iterative re-weighted strategy, proposed is a new maximum neighbor weight based iterative sparse source imaging method, termed as CMOSS (Charge source model based Maximum neighbOr weight Sparse Solution). Different from the weight used in focal underdetermined system solver (FOCUSS) where the weight for each point in the discrete solution space is independently updated in iterations, the new designed weight for each point in each iteration is determined by the source solution of the last iteration at both the point and its neighbors. Using such a new weight, the next iteration may have a bigger chance to rectify the local source location bias existed in the previous iteration solution. The simulation studies with comparison to FOCUSS and LORETA for various source configurations were conducted on a realistic 3-shell head model, and the results confirmed the validation of CMOSS for sparse EEG source localization. Finally, CMOSS was applied to localize sources elicited in a visual stimuli experiment, and the result was consistent with those source areas involved in visual processing reported in previous studies.

A new solution procedure for a nonlinear infinite beam equation of motion

NASA Astrophysics Data System (ADS)

Jang, T. S.

2016-10-01

Our goal of this paper is of a purely theoretical question, however which would be fundamental in computational partial differential equations: Can a linear solution-structure for the equation of motion for an infinite nonlinear beam be directly manipulated for constructing its nonlinear solution? Here, the equation of motion is modeled as mathematically a fourth-order nonlinear partial differential equation. To answer the question, a pseudo-parameter is firstly introduced to modify the equation of motion. And then, an integral formalism for the modified equation is found here, being taken as a linear solution-structure. It enables us to formulate a nonlinear integral equation of second kind, equivalent to the original equation of motion. The fixed point approach, applied to the integral equation, results in proposing a new iterative solution procedure for constructing the nonlinear solution of the original beam equation of motion, which consists luckily of just the simple regular numerical integration for its iterative process; i.e., it appears to be fairly simple as well as straightforward to apply. A mathematical analysis is carried out on both natures of convergence and uniqueness of the iterative procedure by proving a contractive character of a nonlinear operator. It follows conclusively,therefore, that it would be one of the useful nonlinear strategies for integrating the equation of motion for a nonlinear infinite beam, whereby the preceding question may be answered. In addition, it may be worth noticing that the pseudo-parameter introduced here has double roles; firstly, it connects the original beam equation of motion with the integral equation, second, it is related with the convergence of the iterative method proposed here.

Composing chaotic music from the letter m

NASA Astrophysics Data System (ADS)

Sotiropoulos, Anastasios D.

Chaotic music is composed from a proposed iterative map depicting the letter m, relating the pitch, duration and loudness of successive steps. Each of the two curves of the letter m is based on the classical logistic map. Thus, the generating map is xn+1 = r xn(1/2 - xn) for xn between 0 and 1/2 defining the first curve, and xn+1 = r (xn - 1/2)(1 - xn) for xn between 1/2 and 1 representing the second curve. The parameter r which determines the height(s) of the letter m varies from 2 to 16, the latter value ensuring fully developed chaotic solutions for the whole letter m; r = 8 yielding full chaotic solutions only for its first curve. The m-model yields fixed points, bifurcation points and chaotic regions for each separate curve, as well as values of the parameter r greater than 8 which produce inter-fixed points, inter-bifurcation points and inter-chaotic regions from the interplay of the two curves. Based on this, music is composed from mapping the m- recurrence model solutions onto actual notes. The resulting musical score strongly depends on the sequence of notes chosen by the composer to define the musical range corresponding to the range of the chaotic mathematical solutions x from 0 to 1. Here, two musical ranges are used; one is the middle chromatic scale and the other is the seven- octaves range. At the composer's will and, for aesthetics, within the same composition, notes can be the outcome of different values of r and/or shifted in any octave. Compositions with endings of non-repeating note patterns result from values of r in the m-model that do not produce bifurcations. Scores of chaotic music composed from the m-model and the classical logistic model are presented.

An adaptive moving mesh method for two-dimensional ideal magnetohydrodynamics

NASA Astrophysics Data System (ADS)

Han, Jianqiang; Tang, Huazhong

2007-01-01

This paper presents an adaptive moving mesh algorithm for two-dimensional (2D) ideal magnetohydrodynamics (MHD) that utilizes a staggered constrained transport technique to keep the magnetic field divergence-free. The algorithm consists of two independent parts: MHD evolution and mesh-redistribution. The first part is a high-resolution, divergence-free, shock-capturing scheme on a fixed quadrangular mesh, while the second part is an iterative procedure. In each iteration, mesh points are first redistributed, and then a conservative-interpolation formula is used to calculate the remapped cell-averages of the mass, momentum, and total energy on the resulting new mesh; the magnetic potential is remapped to the new mesh in a non-conservative way and is reconstructed to give a divergence-free magnetic field on the new mesh. Several numerical examples are given to demonstrate that the proposed method can achieve high numerical accuracy, track and resolve strong shock waves in ideal MHD problems, and preserve divergence-free property of the magnetic field. Numerical examples include the smooth Alfvén wave problem, 2D and 2.5D shock tube problems, two rotor problems, the stringent blast problem, and the cloud-shock interaction problem.

Nonparametric estimation and testing of fixed effects panel data models

PubMed Central

Henderson, Daniel J.; Carroll, Raymond J.; Li, Qi

2009-01-01

In this paper we consider the problem of estimating nonparametric panel data models with fixed effects. We introduce an iterative nonparametric kernel estimator. We also extend the estimation method to the case of a semiparametric partially linear fixed effects model. To determine whether a parametric, semiparametric or nonparametric model is appropriate, we propose test statistics to test between the three alternatives in practice. We further propose a test statistic for testing the null hypothesis of random effects against fixed effects in a nonparametric panel data regression model. Simulations are used to examine the finite sample performance of the proposed estimators and the test statistics. PMID:19444335

Calibration of stereo rigs based on the backward projection process

NASA Astrophysics Data System (ADS)

Gu, Feifei; Zhao, Hong; Ma, Yueyang; Bu, Penghui; Zhao, Zixin

2016-08-01

High-accuracy 3D measurement based on binocular vision system is heavily dependent on the accurate calibration of two rigidly-fixed cameras. In most traditional calibration methods, stereo parameters are iteratively optimized through the forward imaging process (FIP). However, the results can only guarantee the minimal 2D pixel errors, but not the minimal 3D reconstruction errors. To address this problem, a simple method to calibrate a stereo rig based on the backward projection process (BPP) is proposed. The position of a spatial point can be determined separately from each camera by planar constraints provided by the planar pattern target. Then combined with pre-defined spatial points, intrinsic and extrinsic parameters of the stereo-rig can be optimized by minimizing the total 3D errors of both left and right cameras. An extensive performance study for the method in the presence of image noise and lens distortions is implemented. Experiments conducted on synthetic and real data demonstrate the accuracy and robustness of the proposed method.

Floating-to-Fixed-Point Conversion for Digital Signal Processors

NASA Astrophysics Data System (ADS)

Menard, Daniel; Chillet, Daniel; Sentieys, Olivier

2006-12-01

Digital signal processing applications are specified with floating-point data types but they are usually implemented in embedded systems with fixed-point arithmetic to minimise cost and power consumption. Thus, methodologies which establish automatically the fixed-point specification are required to reduce the application time-to-market. In this paper, a new methodology for the floating-to-fixed point conversion is proposed for software implementations. The aim of our approach is to determine the fixed-point specification which minimises the code execution time for a given accuracy constraint. Compared to previous methodologies, our approach takes into account the DSP architecture to optimise the fixed-point formats and the floating-to-fixed-point conversion process is coupled with the code generation process. The fixed-point data types and the position of the scaling operations are optimised to reduce the code execution time. To evaluate the fixed-point computation accuracy, an analytical approach is used to reduce the optimisation time compared to the existing methods based on simulation. The methodology stages are described and several experiment results are presented to underline the efficiency of this approach.

A Parallel Fast Sweeping Method for the Eikonal Equation

NASA Astrophysics Data System (ADS)

Baker, B.

2017-12-01

Recently, there has been an exciting emergence of probabilistic methods for travel time tomography. Unlike gradient-based optimization strategies, probabilistic tomographic methods are resistant to becoming trapped in a local minimum and provide a much better quantification of parameter resolution than, say, appealing to ray density or performing checkerboard reconstruction tests. The benefits associated with random sampling methods however are only realized by successive computation of predicted travel times in, potentially, strongly heterogeneous media. To this end this abstract is concerned with expediting the solution of the Eikonal equation. While many Eikonal solvers use a fast marching method, the proposed solver will use the iterative fast sweeping method because the eight fixed sweep orderings in each iteration are natural targets for parallelization. To reduce the number of iterations and grid points required the high-accuracy finite difference stencil of Nobel et al., 2014 is implemented. A directed acyclic graph (DAG) is created with a priori knowledge of the sweep ordering and finite different stencil. By performing a topological sort of the DAG sets of independent nodes are identified as candidates for concurrent updating. Additionally, the proposed solver will also address scalability during earthquake relocation, a necessary step in local and regional earthquake tomography and a barrier to extending probabilistic methods from active source to passive source applications, by introducing an asynchronous parallel forward solve phase for all receivers in the network. Synthetic examples using the SEG over-thrust model will be presented.

Implementation of the SPH Procedure Within the MOOSE Finite Element Framework

NASA Astrophysics Data System (ADS)

Laurier, Alexandre

The goal of this thesis was to implement the SPH homogenization procedure within the MOOSE finite element framework at INL. Before this project, INL relied on DRAGON to do their SPH homogenization which was not flexible enough for their needs. As such, the SPH procedure was implemented for the neutron diffusion equation with the traditional, Selengut and true Selengut normalizations. Another aspect of this research was to derive the SPH corrected neutron transport equations and implement them in the same framework. Following in the footsteps of other articles, this feature was implemented and tested successfully with both the PN and S N transport calculation schemes. Although the results obtained for the power distribution in PWR assemblies show no advantages over the use of the SPH diffusion equation, we believe the inclusion of this transport correction will allow for better results in cases where either P N or SN are required. An additional aspect of this research was the implementation of a novel way of solving the non-linear SPH problem. Traditionally, this was done through a Picard, fixed-point iterative process whereas the new implementation relies on MOOSE's Preconditioned Jacobian-Free Newton Krylov (PJFNK) method to allow for a direct solution to the non-linear problem. This novel implementation showed a decrease in calculation time by a factor reaching 50 and generated SPH factors that correspond to those obtained through a fixed-point iterative process with a very tight convergence criteria: epsilon < 10-8. The use of the PJFNK SPH procedure also allows to reach convergence in problems containing important reflector regions and void boundary conditions, something that the traditional SPH method has never been able to achieve. At times when the PJFNK method cannot reach convergence to the SPH problem, a hybrid method is used where by the traditional SPH iteration forces the initial condition to be within the radius of convergence of the Newton method. This new method was tested on a simplified model of INL's TREAT reactor, a problem that includes very important graphite reflector regions as well as vacuum boundary conditions with great success. To demonstrate the power of PJFNK SPH on a more common case, the correction was applied to a simplified PWR reactor core from the BEAVRS benchmark that included 15 assemblies and the water reflector to obtain very good results. This opens up the possibility to apply the SPH correction to full reactor cores in order to reduce homogenization errors for use in transient or multi-physics calculations.

Selection of floating-point or fixed-point for adaptive noise canceller in somatosensory evoked potential measurement.

PubMed

Shen, Chongfei; Liu, Hongtao; Xie, Xb; Luk, Keith Dk; Hu, Yong

2007-01-01

Adaptive noise canceller (ANC) has been used to improve signal to noise ratio (SNR) of somsatosensory evoked potential (SEP). In order to efficiently apply the ANC in hardware system, fixed-point algorithm based ANC can achieve fast, cost-efficient construction, and low-power consumption in FPGA design. However, it is still questionable whether the SNR improvement performance by fixed-point algorithm is as good as that by floating-point algorithm. This study is to compare the outputs of ANC by floating-point and fixed-point algorithm ANC when it was applied to SEP signals. The selection of step-size parameter (micro) was found different in fixed-point algorithm from floating-point algorithm. In this simulation study, the outputs of fixed-point ANC showed higher distortion from real SEP signals than that of floating-point ANC. However, the difference would be decreased with increasing micro value. In the optimal selection of micro, fixed-point ANC can get as good results as floating-point algorithm.

Positron Emission Mammography with Multiple Angle Acquisition

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

Mark F. Smith; Stan Majewski; Raymond R. Raylman

2002-11-01

Positron emission mammography (PEM) of F-18 fluorodeoxyglucose (FbG) uptake in breast tumors with dedicated detectors typically has been accomplished with two planar detectors in a fixed position with the breast under compression. The potential use of PEM imaging at two detector positions to guide stereotactic breast biopsy has motivated us to use PEM coincidence data acquired at two or more detector positions together in a single image reconstruction. Multiple angle PEM acquisition and iterative image reconstruction were investigated using point source and compressed breast phantom acquisitions with 5, 9, 12 and 15 mm diameter spheres and a simulated tumor:background activitymore » concentration ratio of 6:1. Image reconstruction was performed with an iterative MLEM algorithm that used coincidence events between any two detector pixels on opposed detector heads at each detector position. This present study compared two acquisition protocols: 2 angle acquisition with detector angular positions of -15 and +15 degrees and 11 angle acquisition with detector positions spaced at 3 degree increments over the range -15 to +15 degrees. Three-dimensional image resolution was assessed for the point source acquisitions, and contrast and signal-to-noise metrics were evaluated for the compressed breast phantom with different simulated tumor sizes. Radial and tangential resolutions were similar for the two protocols, while normal resolution was better for the 2 angle acquisition. Analysis is complicated by the asymmetric point spread functions. Signal- to-noise vs. contrast tradeoffs were better for 11 angle acquisition for the smallest visible 9 mm sphere, while tradeoff results were mixed for the larger and more easily visible 12 mm and 15 mm diameter spheres. Additional study is needed to better understand the performance of limited angle tomography for PEM. PEM tomography experiments with complete angular sampling are planned.« less

Experimental research of iterated dynamics for the complex exponentials with linear term

NASA Astrophysics Data System (ADS)

Matyushkin, Igor V.; Zapletina, Maria A.

2018-03-01

The research of the orbit of the point zero, fixed points, Julia and Fatou sets for the iterated complex-valued exponential is carried by means of computer experiment. The object of study is three one-parameter families based on exp (iz): f : z → (1 + μ) exp (iz), g : z → (1 + μ|z ‑ z*|) exp (iz), h : z → (1 + μ (z ‑ z*)) exp (iz). Here. For the first family 17- and 2-periodic regimes are detected when passing near the bifurcation value μ ≈ 2.475i, while the multiplicator equals 1. The second family shows a more interesting behavior: (i) three-valley structure of isolines of the convergence rate near fixpoint z* at μ = 0 + 1 + i; (ii) saddle-node transition when the parameter moves along a straight line Reμ = 0, leading to the appearance of a second fixpoint and loss of stability by the old fixpoint at Imμ = 2.1682; (iii) the nontrivial nature of the orbits of points in the vicinity of the new fixpoint and the presence of false fixpoints in the portrait of the Julia set; (iv) second phase transition leading to a radical change in the form of the Julia and Fatou sets at μ ≃ 2.5i. The dynamics of the third family during movement at Reμ = 0 is similar to the first case, but 17th and 2nd periodic modes are replaced by 39th and 3rd modes. Transitions 17 → 2 and 39 → 3 seem to be rapid and discreet while their geometric interpretation matches the ratios 17=1+2*8, 39=13*3. At μ = |z*|‑1 for the h- family Julia set fills the entire complex plane.

Two Reconfigurable Flight-Control Design Methods: Robust Servomechanism and Control Allocation

NASA Technical Reports Server (NTRS)

Burken, John J.; Lu, Ping; Wu, Zheng-Lu; Bahm, Cathy

2001-01-01

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the fight body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Reconfigurable Flight Control Designs With Application to the X-33 Vehicle

NASA Technical Reports Server (NTRS)

Burken, John J.; Lu, Ping; Wu, Zhenglu

1999-01-01

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the right body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

An explicit solution to the exoatmospheric powered flight guidance and trajectory optimization problem for rocket propelled vehicles

NASA Technical Reports Server (NTRS)

Jaggers, R. F.

1977-01-01

A derivation of an explicit solution to the two point boundary-value problem of exoatmospheric guidance and trajectory optimization is presented. Fixed initial conditions and continuous burn, multistage thrusting are assumed. Any number of end conditions from one to six (throttling is required in the case of six) can be satisfied in an explicit and practically optimal manner. The explicit equations converge for off nominal conditions such as engine failure, abort, target switch, etc. The self starting, predictor/corrector solution involves no Newton-Rhapson iterations, numerical integration, or first guess values, and converges rapidly if physically possible. A form of this algorithm has been chosen for onboard guidance, as well as real time and preflight ground targeting and trajectory shaping for the NASA Space Shuttle Program.

Efficient Hardware Implementation of the Horn-Schunck Algorithm for High-Resolution Real-Time Dense Optical Flow Sensor

PubMed Central

Komorkiewicz, Mateusz; Kryjak, Tomasz; Gorgon, Marek

2014-01-01

This article presents an efficient hardware implementation of the Horn-Schunck algorithm that can be used in an embedded optical flow sensor. An architecture is proposed, that realises the iterative Horn-Schunck algorithm in a pipelined manner. This modification allows to achieve data throughput of 175 MPixels/s and makes processing of Full HD video stream (1, 920 × 1, 080 @ 60 fps) possible. The structure of the optical flow module as well as pre- and post-filtering blocks and a flow reliability computation unit is described in details. Three versions of optical flow modules, with different numerical precision, working frequency and obtained results accuracy are proposed. The errors caused by switching from floating- to fixed-point computations are also evaluated. The described architecture was tested on popular sequences from an optical flow dataset of the Middlebury University. It achieves state-of-the-art results among hardware implementations of single scale methods. The designed fixed-point architecture achieves performance of 418 GOPS with power efficiency of 34 GOPS/W. The proposed floating-point module achieves 103 GFLOPS, with power efficiency of 24 GFLOPS/W. Moreover, a 100 times speedup compared to a modern CPU with SIMD support is reported. A complete, working vision system realized on Xilinx VC707 evaluation board is also presented. It is able to compute optical flow for Full HD video stream received from an HDMI camera in real-time. The obtained results prove that FPGA devices are an ideal platform for embedded vision systems. PMID:24526303

Efficient hardware implementation of the Horn-Schunck algorithm for high-resolution real-time dense optical flow sensor.

PubMed

Komorkiewicz, Mateusz; Kryjak, Tomasz; Gorgon, Marek

2014-02-12

This article presents an efficient hardware implementation of the Horn-Schunck algorithm that can be used in an embedded optical flow sensor. An architecture is proposed, that realises the iterative Horn-Schunck algorithm in a pipelined manner. This modification allows to achieve data throughput of 175 MPixels/s and makes processing of Full HD video stream (1; 920 × 1; 080 @ 60 fps) possible. The structure of the optical flow module as well as pre- and post-filtering blocks and a flow reliability computation unit is described in details. Three versions of optical flow modules, with different numerical precision, working frequency and obtained results accuracy are proposed. The errors caused by switching from floating- to fixed-point computations are also evaluated. The described architecture was tested on popular sequences from an optical flow dataset of the Middlebury University. It achieves state-of-the-art results among hardware implementations of single scale methods. The designed fixed-point architecture achieves performance of 418 GOPS with power efficiency of 34 GOPS/W. The proposed floating-point module achieves 103 GFLOPS, with power efficiency of 24 GFLOPS/W. Moreover, a 100 times speedup compared to a modern CPU with SIMD support is reported. A complete, working vision system realized on Xilinx VC707 evaluation board is also presented. It is able to compute optical flow for Full HD video stream received from an HDMI camera in real-time. The obtained results prove that FPGA devices are an ideal platform for embedded vision systems.

TH-CD-207A-07: Prediction of High Dimensional State Subject to Respiratory Motion: A Manifold Learning Approach

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

Liu, W; Sawant, A; Ruan, D

Purpose: The development of high dimensional imaging systems (e.g. volumetric MRI, CBCT, photogrammetry systems) in image-guided radiotherapy provides important pathways to the ultimate goal of real-time volumetric/surface motion monitoring. This study aims to develop a prediction method for the high dimensional state subject to respiratory motion. Compared to conventional linear dimension reduction based approaches, our method utilizes manifold learning to construct a descriptive feature submanifold, where more efficient and accurate prediction can be performed. Methods: We developed a prediction framework for high-dimensional state subject to respiratory motion. The proposed method performs dimension reduction in a nonlinear setting to permit moremore » descriptive features compared to its linear counterparts (e.g., classic PCA). Specifically, a kernel PCA is used to construct a proper low-dimensional feature manifold, where low-dimensional prediction is performed. A fixed-point iterative pre-image estimation method is applied subsequently to recover the predicted value in the original state space. We evaluated and compared the proposed method with PCA-based method on 200 level-set surfaces reconstructed from surface point clouds captured by the VisionRT system. The prediction accuracy was evaluated with respect to root-mean-squared-error (RMSE) for both 200ms and 600ms lookahead lengths. Results: The proposed method outperformed PCA-based approach with statistically higher prediction accuracy. In one-dimensional feature subspace, our method achieved mean prediction accuracy of 0.86mm and 0.89mm for 200ms and 600ms lookahead lengths respectively, compared to 0.95mm and 1.04mm from PCA-based method. The paired t-tests further demonstrated the statistical significance of the superiority of our method, with p-values of 6.33e-3 and 5.78e-5, respectively. Conclusion: The proposed approach benefits from the descriptiveness of a nonlinear manifold and the prediction reliability in such low dimensional manifold. The fixed-point iterative approach turns out to work well practically for the pre-image recovery. Our approach is particularly suitable to facilitate managing respiratory motion in image-guide radiotherapy. This work is supported in part by NIH grant R01 CA169102-02.« less

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.

Robust non-rigid registration algorithm based on local affine registration

NASA Astrophysics Data System (ADS)

Wu, Liyang; Xiong, Lei; Du, Shaoyi; Bi, Duyan; Fang, Ting; Liu, Kun; Wu, Dongpeng

2018-04-01

Aiming at the problem that the traditional point set non-rigid registration algorithm has low precision and slow convergence speed for complex local deformation data, this paper proposes a robust non-rigid registration algorithm based on local affine registration. The algorithm uses a hierarchical iterative method to complete the point set non-rigid registration from coarse to fine. In each iteration, the sub data point sets and sub model point sets are divided and the shape control points of each sub point set are updated. Then we use the control point guided affine ICP algorithm to solve the local affine transformation between the corresponding sub point sets. Next, the local affine transformation obtained by the previous step is used to update the sub data point sets and their shape control point sets. When the algorithm reaches the maximum iteration layer K, the loop ends and outputs the updated sub data point sets. Experimental results demonstrate that the accuracy and convergence of our algorithm are greatly improved compared with the traditional point set non-rigid registration algorithms.

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

NASA Technical Reports Server (NTRS)

Memarsadeghi, Nargess; Mount, David M.

2007-01-01

Scattered data interpolation is a problem of interest in numerous areas such as electronic imaging, smooth surface modeling, and computational geometry. Our motivation arises from applications in geology and mining, which often involve large scattered data sets and a demand for high accuracy. The method of choice is ordinary kriging. This is because it is a best unbiased estimator. Unfortunately, this interpolant is computationally very expensive to compute exactly. For n scattered data points, computing the value of a single interpolant involves solving a dense linear system of size roughly n x n. This is infeasible for large n. In practice, kriging is solved approximately by local approaches that are based on considering only a relatively small'number of points that lie close to the query point. There are many problems with this local approach, however. The first is that determining the proper neighborhood size is tricky, and is usually solved by ad hoc methods such as selecting a fixed number of nearest neighbors or all the points lying within a fixed radius. Such fixed neighborhood sizes may not work well for all query points, depending on local density of the point distribution. Local methods also suffer from the problem that the resulting interpolant is not continuous. Meyer showed that while kriging produces smooth continues surfaces, it has zero order continuity along its borders. Thus, at interface boundaries where the neighborhood changes, the interpolant behaves discontinuously. Therefore, it is important to consider and solve the global system for each interpolant. However, solving such large dense systems for each query point is impractical. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. The problems arise from the fact that the covariance functions that are used in kriging have global support. Our implementations combine, utilize, and enhance a number of different approaches that have been introduced in literature for solving large linear systems for interpolation of scattered data points. For very large systems, exact methods such as Gaussian elimination are impractical since they require 0(n(exp 3)) time and 0(n(exp 2)) storage. As Billings et al. suggested, we use an iterative approach. In particular, we use the SYMMLQ method, for solving the large but sparse ordinary kriging systems that result from tapering. The main technical issue that need to be overcome in our algorithmic solution is that the points' covariance matrix for kriging should be symmetric positive definite. The goal of tapering is to obtain a sparse approximate representation of the covariance matrix while maintaining its positive definiteness. Furrer et al. used tapering to obtain a sparse linear system of the form Ax = b, where A is the tapered symmetric positive definite covariance matrix. Thus, Cholesky factorization could be used to solve their linear systems. They implemented an efficient sparse Cholesky decomposition method. They also showed if these tapers are used for a limited class of covariance models, the solution of the system converges to the solution of the original system. Matrix A in the ordinary kriging system, while symmetric, is not positive definite. Thus, their approach is not applicable to the ordinary kriging system. Therefore, we use tapering only to obtain a sparse linear system. Then, we use SYMMLQ to solve the ordinary kriging system. We show that solving large kriging systems becomes practical via tapering and iterative methods, and results in lower estimation errors compared to traditional local approaches, and significant memory savings compared to the original global system. We also developed a more efficient variant of the sparse SYMMLQ method for large ordinary kriging systems. This approach adaptively finds the correct local neighborhood for each query point in the interpolation process.

The Simple Map for a Single-null Divertor Tokamak: How to Find the Last Good Surface

NASA Astrophysics Data System (ADS)

Phan, Huong; Ali, Halima; Punjabi, Alkesh

2000-10-01

The Simple Map^1 is a representation of the magnetic field inside a single-null divertor tokamak. It is given by the equations: X_n+1=X_n kYn (1-Y_n), Y_n+1= Y_n+kX_n+1. These equations mimic the motion of the magnetic field lines in a single-null divertor tokamak. The fixed stable point is (0,0) and the unstable fixed oint is (0,1). k is fixed at 0.60. In our work, the starting values of Y in the map is kept in the interval of 0 to 1, and the starting value of X is 0. Using the successive bifurcation method, we first run these equations for 10^6 iterations to find the approximate value of Y when chaos occurs. We examine the neighborhood of this Y value to find the exact value of Y for the last good surface. We call this value Y_lgs. We find Y_lgs to be 0.997135768 for k=0.60 and X=0. This work is supported by US DOE OFES. Ms. Huong Phan is a HU CFRT Summer Fusion High School Workshop Scholar from Andrew P. Hill High School in California. She is supported by NASA SHARP Plus Program. 1. Punjabi A, Verma A and Boozer A, Phys Rev Lett 69 3322 (1992) and J Plasma Phys 52 91 (1994)

Is scale-invariance in gauge-Yukawa systems compatible with the graviton?

NASA Astrophysics Data System (ADS)

Christiansen, Nicolai; Eichhorn, Astrid; Held, Aaron

2017-10-01

We explore whether perturbative interacting fixed points in matter systems can persist under the impact of quantum gravity. We first focus on semisimple gauge theories and show that the leading order gravity contribution evaluated within the functional Renormalization Group framework preserves the perturbative fixed-point structure in these models discovered in [J. K. Esbensen, T. A. Ryttov, and F. Sannino, Phys. Rev. D 93, 045009 (2016)., 10.1103/PhysRevD.93.045009]. We highlight that the quantum-gravity contribution alters the scaling dimension of the gauge coupling, such that the system exhibits an effective dimensional reduction. We secondly explore the effect of metric fluctuations on asymptotically safe gauge-Yukawa systems which feature an asymptotically safe fixed point [D. F. Litim and F. Sannino, J. High Energy Phys. 12 (2014) 178., 10.1007/JHEP12(2014)178]. The same effective dimensional reduction that takes effect in pure gauge theories also impacts gauge-Yukawa systems. There, it appears to lead to a split of the degenerate free fixed point into an interacting infrared attractive fixed point and a partially ultraviolet attractive free fixed point. The quantum-gravity induced infrared fixed point moves towards the asymptotically safe fixed point of the matter system, and annihilates it at a critical value of the gravity coupling. Even after that fixed-point annihilation, graviton effects leave behind new partially interacting fixed points for the matter sector.

47 CFR 101.137 - Interconnection of private operational fixed point-to-point microwave stations.

Code of Federal Regulations, 2013 CFR

2013-10-01

... point-to-point microwave stations. 101.137 Section 101.137 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.137 Interconnection of private operational fixed point-to-point microwave stations. Private...

47 CFR 101.137 - Interconnection of private operational fixed point-to-point microwave stations.

Code of Federal Regulations, 2011 CFR

2011-10-01

... point-to-point microwave stations. 101.137 Section 101.137 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.137 Interconnection of private operational fixed point-to-point microwave stations. Private...

47 CFR 101.137 - Interconnection of private operational fixed point-to-point microwave stations.

Code of Federal Regulations, 2012 CFR

2012-10-01

... point-to-point microwave stations. 101.137 Section 101.137 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.137 Interconnection of private operational fixed point-to-point microwave stations. Private...

47 CFR 101.137 - Interconnection of private operational fixed point-to-point microwave stations.

Code of Federal Regulations, 2014 CFR

2014-10-01

... point-to-point microwave stations. 101.137 Section 101.137 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.137 Interconnection of private operational fixed point-to-point microwave stations. Private...

47 CFR 101.137 - Interconnection of private operational fixed point-to-point microwave stations.

Code of Federal Regulations, 2010 CFR

2010-10-01

... point-to-point microwave stations. 101.137 Section 101.137 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.137 Interconnection of private operational fixed point-to-point microwave stations. Private...

A superlinear interior points algorithm for engineering design optimization

NASA Technical Reports Server (NTRS)

Herskovits, J.; Asquier, J.

1990-01-01

We present a quasi-Newton interior points algorithm for nonlinear constrained optimization. It is based on a general approach consisting of the iterative solution in the primal and dual spaces of the equalities in Karush-Kuhn-Tucker optimality conditions. This is done in such a way to have primal and dual feasibility at each iteration, which ensures satisfaction of those optimality conditions at the limit points. This approach is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix, instead of quadratic programming subproblems. It is also particularly appropriate for engineering design optimization inasmuch at each iteration a feasible design is obtained. The present algorithm uses a quasi-Newton approximation of the second derivative of the Lagrangian function in order to have superlinear asymptotic convergence. We discuss theoretical aspects of the algorithm and its computer implementation.

Associative memory in an analog iterated-map neural network

NASA Astrophysics Data System (ADS)

Marcus, C. M.; Waugh, F. R.; Westervelt, R. M.

1990-03-01

The behavior of an analog neural network with parallel dynamics is studied analytically and numerically for two associative-memory learning algorithms, the Hebb rule and the pseudoinverse rule. Phase diagrams in the parameter space of analog gain β and storage ratio α are presented. For both learning rules, the networks have large ``recall'' phases in which retrieval states exist and convergence to a fixed point is guaranteed by a global stability criterion. We also demonstrate numerically that using a reduced analog gain increases the probability of recall starting from a random initial state. This phenomenon is comparable to thermal annealing used to escape local minima but has the advantage of being deterministic, and therefore easily implemented in electronic hardware. Similarities and differences between analog neural networks and networks with two-state neurons at finite temperature are also discussed.

Dielectric response of periodic systems from quantum Monte Carlo calculations.

PubMed

Umari, P; Willamson, A J; Galli, Giulia; Marzari, Nicola

2005-11-11

We present a novel approach that allows us to calculate the dielectric response of periodic systems in the quantum Monte Carlo formalism. We employ a many-body generalization for the electric-enthalpy functional, where the coupling with the field is expressed via the Berry-phase formulation for the macroscopic polarization. A self-consistent local Hamiltonian then determines the ground-state wave function, allowing for accurate diffusion quantum Monte Carlo calculations where the polarization's fixed point is estimated from the average on an iterative sequence, sampled via forward walking. This approach has been validated for the case of an isolated hydrogen atom and then applied to a periodic system, to calculate the dielectric susceptibility of molecular-hydrogen chains. The results found are in excellent agreement with the best estimates obtained from the extrapolation of quantum-chemistry calculations.

Information flow in layered networks of non-monotonic units

NASA Astrophysics Data System (ADS)

Schittler Neves, Fabio; Martim Schubert, Benno; Erichsen, Rubem, Jr.

2015-07-01

Layered neural networks are feedforward structures that yield robust parallel and distributed pattern recognition. Even though much attention has been paid to pattern retrieval properties in such systems, many aspects of their dynamics are not yet well characterized or understood. In this work we study, at different temperatures, the memory activity and information flows through layered networks in which the elements are the simplest binary odd non-monotonic function. Our results show that, considering a standard Hebbian learning approach, the network information content has its maximum always at the monotonic limit, even though the maximum memory capacity can be found at non-monotonic values for small enough temperatures. Furthermore, we show that such systems exhibit rich macroscopic dynamics, including not only fixed point solutions of its iterative map, but also cyclic and chaotic attractors that also carry information.

Orbit and uncertainty propagation: a comparison of Gauss-Legendre-, Dormand-Prince-, and Chebyshev-Picard-based approaches

NASA Astrophysics Data System (ADS)

Aristoff, Jeffrey M.; Horwood, Joshua T.; Poore, Aubrey B.

2014-01-01

We present a new variable-step Gauss-Legendre implicit-Runge-Kutta-based approach for orbit and uncertainty propagation, VGL-IRK, which includes adaptive step-size error control and which collectively, rather than individually, propagates nearby sigma points or states. The performance of VGL-IRK is compared to a professional (variable-step) implementation of Dormand-Prince 8(7) (DP8) and to a fixed-step, optimally-tuned, implementation of modified Chebyshev-Picard iteration (MCPI). Both nearly-circular and highly-elliptic orbits are considered using high-fidelity gravity models and realistic integration tolerances. VGL-IRK is shown to be up to eleven times faster than DP8 and up to 45 times faster than MCPI (for the same accuracy), in a serial computing environment. Parallelization of VGL-IRK and MCPI is also discussed.

Structure-aware depth super-resolution using Gaussian mixture model

NASA Astrophysics Data System (ADS)

Kim, Sunok; Oh, Changjae; Kim, Youngjung; Sohn, Kwanghoon

2015-03-01

This paper presents a probabilistic optimization approach to enhance the resolution of a depth map. Conventionally, a high-resolution color image is considered as a cue for depth super-resolution under the assumption that the pixels with similar color likely belong to similar depth. This assumption might induce a texture transferring from the color image into the depth map and an edge blurring artifact to the depth boundaries. In order to alleviate these problems, we propose an efficient depth prior exploiting a Gaussian mixture model in which an estimated depth map is considered to a feature for computing affinity between two pixels. Furthermore, a fixed-point iteration scheme is adopted to address the non-linearity of a constraint derived from the proposed prior. The experimental results show that the proposed method outperforms state-of-the-art methods both quantitatively and qualitatively.

Parallel/Vector Integration Methods for Dynamical Astronomy

NASA Astrophysics Data System (ADS)

Fukushima, Toshio

1999-01-01

This paper reviews three recent works on the numerical methods to integrate ordinary differential equations (ODE), which are specially designed for parallel, vector, and/or multi-processor-unit(PU) computers. The first is the Picard-Chebyshev method (Fukushima, 1997a). It obtains a global solution of ODE in the form of Chebyshev polynomial of large (> 1000) degree by applying the Picard iteration repeatedly. The iteration converges for smooth problems and/or perturbed dynamics. The method runs around 100-1000 times faster in the vector mode than in the scalar mode of a certain computer with vector processors (Fukushima, 1997b). The second is a parallelization of a symplectic integrator (Saha et al., 1997). It regards the implicit midpoint rules covering thousands of timesteps as large-scale nonlinear equations and solves them by the fixed-point iteration. The method is applicable to Hamiltonian systems and is expected to lead an acceleration factor of around 50 in parallel computers with more than 1000 PUs. The last is a parallelization of the extrapolation method (Ito and Fukushima, 1997). It performs trial integrations in parallel. Also the trial integrations are further accelerated by balancing computational load among PUs by the technique of folding. The method is all-purpose and achieves an acceleration factor of around 3.5 by using several PUs. Finally, we give a perspective on the parallelization of some implicit integrators which require multiple corrections in solving implicit formulas like the implicit Hermitian integrators (Makino and Aarseth, 1992), (Hut et al., 1995) or the implicit symmetric multistep methods (Fukushima, 1998), (Fukushima, 1999).

Wall shear stress fixed points in blood flow

NASA Astrophysics Data System (ADS)

Arzani, Amirhossein; Shadden, Shawn

2017-11-01

Patient-specific computational fluid dynamics produces large datasets, and wall shear stress (WSS) is one of the most important parameters due to its close connection with the biological processes at the wall. While some studies have investigated WSS vectorial features, the WSS fixed points have not received much attention. In this talk, we will discuss the importance of WSS fixed points from three viewpoints. First, we will review how WSS fixed points relate to the flow physics away from the wall. Second, we will discuss how certain types of WSS fixed points lead to high biochemical surface concentration in cardiovascular mass transport problems. Finally, we will introduce a new measure to track the exposure of endothelial cells to WSS fixed points.

Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization.

PubMed

Chen, Ying-ping; Chen, Chao-Hong

2010-01-01

An adaptive discretization method, called split-on-demand (SoD), enables estimation of distribution algorithms (EDAs) for discrete variables to solve continuous optimization problems. SoD randomly splits a continuous interval if the number of search points within the interval exceeds a threshold, which is decreased at every iteration. After the split operation, the nonempty intervals are assigned integer codes, and the search points are discretized accordingly. As an example of using SoD with EDAs, the integration of SoD and the extended compact genetic algorithm (ECGA) is presented and numerically examined. In this integration, we adopt a local search mechanism as an optional component of our back end optimization engine. As a result, the proposed framework can be considered as a memetic algorithm, and SoD can potentially be applied to other memetic algorithms. The numerical experiments consist of two parts: (1) a set of benchmark functions on which ECGA with SoD and ECGA with two well-known discretization methods: the fixed-height histogram (FHH) and the fixed-width histogram (FWH) are compared; (2) a real-world application, the economic dispatch problem, on which ECGA with SoD is compared to other methods. The experimental results indicate that SoD is a better discretization method to work with ECGA. Moreover, ECGA with SoD works quite well on the economic dispatch problem and delivers solutions better than the best known results obtained by other methods in existence.

Effect of Impurities on the Freezing Point of Zinc

NASA Astrophysics Data System (ADS)

Sun, Jianping; Rudtsch, Steffen; Niu, Yalu; Zhang, Lin; Wang, Wei; Den, Xiaolong

2017-03-01

The knowledge of the liquidus slope of impurities in fixed-point metal defined by the International Temperature Scale of 1990 is important for the estimation of uncertainties and correction of fixed point with the sum of individual estimates method. Great attentions are paid to the effect of ultra-trace impurities on the freezing point of zinc in the National Institute of Metrology. In the present work, the liquidus slopes of Ga-Zn, Ge-Zn were measured with the slim fixed-point cell developed through the doping experiments, and the temperature characteristics of the phase diagram of Fe-Zn were furthermore investigated. A quasi-adiabatic Zn fixed-point cell was developed with the thermometer well surrounded by the crucible with the pure metal, and the temperature uniformity of less than 20 mK in the region where the metal is located was obtained. The previous doping experiment of Pb-Zn with slim fixed-point cell was checked with quasi-adiabatic Zn fixed-point cell, and the result supports the previous liquidus slope measured with the traditional fixed-point realization.

LiDAR-IMU Time Delay Calibration Based on Iterative Closest Point and Iterated Sigma Point Kalman Filter.

PubMed

Liu, Wanli

2017-03-08

The time delay calibration between Light Detection and Ranging (LiDAR) and Inertial Measurement Units (IMUs) is an essential prerequisite for its applications. However, the correspondences between LiDAR and IMU measurements are usually unknown, and thus cannot be computed directly for the time delay calibration. In order to solve the problem of LiDAR-IMU time delay calibration, this paper presents a fusion method based on iterative closest point (ICP) and iterated sigma point Kalman filter (ISPKF), which combines the advantages of ICP and ISPKF. The ICP algorithm can precisely determine the unknown transformation between LiDAR-IMU; and the ISPKF algorithm can optimally estimate the time delay calibration parameters. First of all, the coordinate transformation from the LiDAR frame to the IMU frame is realized. Second, the measurement model and time delay error model of LiDAR and IMU are established. Third, the methodology of the ICP and ISPKF procedure is presented for LiDAR-IMU time delay calibration. Experimental results are presented that validate the proposed method and demonstrate the time delay error can be accurately calibrated.

Point-spread Function Ramifications and Deconvolution of a Signal Dependent Blur Kernel Due to Interpixel Capacitive Coupling

NASA Astrophysics Data System (ADS)

Donlon, Kevan; Ninkov, Zoran; Baum, Stefi

2018-07-01

Interpixel capacitance (IPC) is a deterministic electronic coupling that results in a portion of the collected signal incident on one pixel of a hybridized detector array being measured in adjacent pixels. Data collected by light sensitive HgCdTe arrays which exhibit this coupling typically goes uncorrected or is corrected by treating the coupling as a fixed point-spread function. Evidence suggests that this IPC coupling is not uniform across different signal and background levels. This variation invalidates assumptions that are key in decoupling techniques such as Wiener Filtering or application of the Lucy–Richardson algorithm. Additionally, the variable IPC results in the point-spread function (PSF) depending upon a star’s signal level relative to the background level, among other parameters. With an IPC ranging from 0.68% to 1.45% over the full well depth of a sensor, as is a reasonable range for the H2RG arrays, the FWHM of the JWSTs NIRCam 405N band is degraded from 2.080 pix (0.″132) as expected from the diffraction pattern to 2.186 pix (0.″142) when the star is just breaching the sensitivity limit of the system. For example, When attempting to use a fixed PSF fitting (e.g., assuming the PSF observed from a bright star in the field) to untangle two sources with a flux ratio of 4:1 and a center to center distance of 3 pixels, flux estimation can be off by upwards of 1.5% with a separation error of 50 millipixels. To deal with this issue an iterative non-stationary method for deconvolution is here proposed, implemented, and evaluated that can account for the signal dependent nature of IPC.

Designing gradient coils with reduced hot spot temperatures.

PubMed

While, Peter T; Forbes, Larry K; Crozier, Stuart

2010-03-01

Gradient coil temperature is an important concern in the design and construction of MRI scanners. Closely spaced gradient coil windings cause temperature hot spots within the system as a result of Ohmic heating associated with large current being driven through resistive material, and can strongly affect the performance of the coils. In this paper, a model is presented for predicting the spatial temperature distribution of a gradient coil, including the location and extent of temperature hot spots. Subsequently, a method is described for designing gradient coils with improved temperature distributions and reduced hot spot temperatures. Maximum temperature represents a non-linear constraint and a relaxed fixed point iteration routine is proposed to adjust coil windings iteratively to minimise this coil feature. Several examples are considered that assume different thermal material properties and cooling mechanisms for the gradient system. Coil winding solutions are obtained for all cases considered that display a considerable drop in hot spot temperature (>20%) when compared to standard minimum power gradient coils with equivalent gradient homogeneity, efficiency and inductance. The method is semi-analytical in nature and can be adapted easily to consider other non-linear constraints in the design of gradient coils or similar systems. Crown Copyright (c) 2009. Published by Elsevier Inc. All rights reserved.

Efficient Coupling of Fluid-Plasma and Monte-Carlo-Neutrals Models for Edge Plasma Transport

NASA Astrophysics Data System (ADS)

Dimits, A. M.; Cohen, B. I.; Friedman, A.; Joseph, I.; Lodestro, L. L.; Rensink, M. E.; Rognlien, T. D.; Sjogreen, B.; Stotler, D. P.; Umansky, M. V.

2017-10-01

UEDGE has been valuable for modeling transport in the tokamak edge and scrape-off layer due in part to its efficient fully implicit solution of coupled fluid neutrals and plasma models. We are developing an implicit coupling of the kinetic Monte-Carlo (MC) code DEGAS-2, as the neutrals model component, to the UEDGE plasma component, based on an extension of the Jacobian-free Newton-Krylov (JFNK) method to MC residuals. The coupling components build on the methods and coding already present in UEDGE. For the linear Krylov iterations, a procedure has been developed to ``extract'' a good preconditioner from that of UEDGE. This preconditioner may also be used to greatly accelerate the convergence rate of a relaxed fixed-point iteration, which may provide a useful ``intermediate'' algorithm. The JFNK method also requires calculation of Jacobian-vector products, for which any finite-difference procedure is inaccurate when a MC component is present. A semi-analytical procedure that retains the standard MC accuracy and fully kinetic neutrals physics is therefore being developed. Prepared for US DOE by LLNL under Contract DE-AC52-07NA27344 and LDRD project 15-ERD-059, by PPPL under Contract DE-AC02-09CH11466, and supported in part by the U.S. DOE, OFES.

Iterative Most-Likely Point Registration (IMLP): A Robust Algorithm for Computing Optimal Shape Alignment

PubMed Central

Billings, Seth D.; Boctor, Emad M.; Taylor, Russell H.

2015-01-01

We present a probabilistic registration algorithm that robustly solves the problem of rigid-body alignment between two shapes with high accuracy, by aptly modeling measurement noise in each shape, whether isotropic or anisotropic. For point-cloud shapes, the probabilistic framework additionally enables modeling locally-linear surface regions in the vicinity of each point to further improve registration accuracy. The proposed Iterative Most-Likely Point (IMLP) algorithm is formed as a variant of the popular Iterative Closest Point (ICP) algorithm, which iterates between point-correspondence and point-registration steps. IMLP’s probabilistic framework is used to incorporate a generalized noise model into both the correspondence and the registration phases of the algorithm, hence its name as a most-likely point method rather than a closest-point method. To efficiently compute the most-likely correspondences, we devise a novel search strategy based on a principal direction (PD)-tree search. We also propose a new approach to solve the generalized total-least-squares (GTLS) sub-problem of the registration phase, wherein the point correspondences are registered under a generalized noise model. Our GTLS approach has improved accuracy, efficiency, and stability compared to prior methods presented for this problem and offers a straightforward implementation using standard least squares. We evaluate the performance of IMLP relative to a large number of prior algorithms including ICP, a robust variant on ICP, Generalized ICP (GICP), and Coherent Point Drift (CPD), as well as drawing close comparison with the prior anisotropic registration methods of GTLS-ICP and A-ICP. The performance of IMLP is shown to be superior with respect to these algorithms over a wide range of noise conditions, outliers, and misalignments using both mesh and point-cloud representations of various shapes. PMID:25748700

Common fixed points in best approximation for Banach operator pairs with Ciric type I-contractions

NASA Astrophysics Data System (ADS)

Hussain, N.

2008-02-01

The common fixed point theorems, similar to those of Ciric [Lj.B. Ciric, On a common fixed point theorem of a Gregus type, Publ. Inst. Math. (Beograd) (N.S.) 49 (1991) 174-178; Lj.B. Ciric, On Diviccaro, Fisher and Sessa open questions, Arch. Math. (Brno) 29 (1993) 145-152; Lj.B. Ciric, On a generalization of Gregus fixed point theorem, Czechoslovak Math. J. 50 (2000) 449-458], Fisher and Sessa [B. Fisher, S. Sessa, On a fixed point theorem of Gregus, Internat. J. Math. Math. Sci. 9 (1986) 23-28], Jungck [G. Jungck, On a fixed point theorem of Fisher and Sessa, Internat. J. Math. Math. Sci. 13 (1990) 497-500] and Mukherjee and Verma [R.N. Mukherjee, V. Verma, A note on fixed point theorem of Gregus, Math. Japon. 33 (1988) 745-749], are proved for a Banach operator pair. As applications, common fixed point and approximation results for Banach operator pair satisfying Ciric type contractive conditions are obtained without the assumption of linearity or affinity of either T or I. Our results unify and generalize various known results to a more general class of noncommuting mappings.

Miniature Fixed Points as Temperature Standards for In Situ Calibration of Temperature Sensors

NASA Astrophysics Data System (ADS)

Hao, X. P.; Sun, J. P.; Xu, C. Y.; Wen, P.; Song, J.; Xu, M.; Gong, L. Y.; Ding, L.; Liu, Z. L.

2017-06-01

Miniature Ga and Ga-In alloy fixed points as temperature standards are developed at National Institute of Metrology, China for the in situ calibration of temperature sensors. A quasi-adiabatic vacuum measurement system is constructed to study the phase-change plateaus of the fixed points. The system comprises a high-stability bath, a quasi-adiabatic vacuum chamber and a temperature control and measurement system. The melting plateau of the Ga fixed point is longer than 2 h at 0.008 W. The standard deviation of the melting temperature of the Ga and Ga-In alloy fixed points is better than 2 mK. The results suggest that the melting temperature of the Ga or Ga-In alloy fixed points is linearly related with the heating power.

Wall shear stress fixed points in cardiovascular fluid mechanics.

PubMed

Arzani, Amirhossein; Shadden, Shawn C

2018-05-17

Complex blood flow in large arteries creates rich wall shear stress (WSS) vectorial features. WSS acts as a link between blood flow dynamics and the biology of various cardiovascular diseases. WSS has been of great interest in a wide range of studies and has been the most popular measure to correlate blood flow to cardiovascular disease. Recent studies have emphasized different vectorial features of WSS. However, fixed points in the WSS vector field have not received much attention. A WSS fixed point is a point on the vessel wall where the WSS vector vanishes. In this article, WSS fixed points are classified and the aspects by which they could influence cardiovascular disease are reviewed. First, the connection between WSS fixed points and the flow topology away from the vessel wall is discussed. Second, the potential role of time-averaged WSS fixed points in biochemical mass transport is demonstrated using the recent concept of Lagrangian WSS structures. Finally, simple measures are proposed to quantify the exposure of the endothelial cells to WSS fixed points. Examples from various arterial flow applications are demonstrated. Copyright © 2018 Elsevier Ltd. All rights reserved.

Robust iterative closest point algorithm based on global reference point for rotation invariant registration.

PubMed

Du, Shaoyi; Xu, Yiting; Wan, Teng; Hu, Huaizhong; Zhang, Sirui; Xu, Guanglin; Zhang, Xuetao

2017-01-01

The iterative closest point (ICP) algorithm is efficient and accurate for rigid registration but it needs the good initial parameters. It is easily failed when the rotation angle between two point sets is large. To deal with this problem, a new objective function is proposed by introducing a rotation invariant feature based on the Euclidean distance between each point and a global reference point, where the global reference point is a rotation invariant. After that, this optimization problem is solved by a variant of ICP algorithm, which is an iterative method. Firstly, the accurate correspondence is established by using the weighted rotation invariant feature distance and position distance together. Secondly, the rigid transformation is solved by the singular value decomposition method. Thirdly, the weight is adjusted to control the relative contribution of the positions and features. Finally this new algorithm accomplishes the registration by a coarse-to-fine way whatever the initial rotation angle is, which is demonstrated to converge monotonically. The experimental results validate that the proposed algorithm is more accurate and robust compared with the original ICP algorithm.

Robust iterative closest point algorithm based on global reference point for rotation invariant registration

PubMed Central

Du, Shaoyi; Xu, Yiting; Wan, Teng; Zhang, Sirui; Xu, Guanglin; Zhang, Xuetao

2017-01-01

The iterative closest point (ICP) algorithm is efficient and accurate for rigid registration but it needs the good initial parameters. It is easily failed when the rotation angle between two point sets is large. To deal with this problem, a new objective function is proposed by introducing a rotation invariant feature based on the Euclidean distance between each point and a global reference point, where the global reference point is a rotation invariant. After that, this optimization problem is solved by a variant of ICP algorithm, which is an iterative method. Firstly, the accurate correspondence is established by using the weighted rotation invariant feature distance and position distance together. Secondly, the rigid transformation is solved by the singular value decomposition method. Thirdly, the weight is adjusted to control the relative contribution of the positions and features. Finally this new algorithm accomplishes the registration by a coarse-to-fine way whatever the initial rotation angle is, which is demonstrated to converge monotonically. The experimental results validate that the proposed algorithm is more accurate and robust compared with the original ICP algorithm. PMID:29176780

47 CFR 101.101 - Frequency availability.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE...—(Part 78) CC: Common Carrier Fixed Point-to-Point Microwave Service—(Part 101, Subparts C & I) DBS... Distribution Service—(Part 21) OFS: Private Operational Fixed Point-to-Point Microwave Service—(Part 101...

47 CFR 101.101 - Frequency availability.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE...—(Part 78) CC: Common Carrier Fixed Point-to-Point Microwave Service—(Part 101, Subparts C & I) DBS... Distribution Service—(Part 21) OFS: Private Operational Fixed Point-to-Point Microwave Service—(Part 101...

47 CFR 101.21 - Technical content of applications.

Code of Federal Regulations, 2013 CFR

2013-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.21 Technical... Private Operational Fixed Point-to-Point Microwave Service and the Common Carrier Fixed Point-to-Point Microwave Service must include the following information: Applicant's name and address. Transmitting station...

47 CFR 101.21 - Technical content of applications.

Code of Federal Regulations, 2014 CFR

2014-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.21 Technical... Private Operational Fixed Point-to-Point Microwave Service and the Common Carrier Fixed Point-to-Point Microwave Service must include the following information: Applicant's name and address. Transmitting station...

47 CFR 101.107 - Frequency tolerance.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE... to private operational fixed point-to-point microwave and stations providing MVDDS. 5 For private operational fixed point-to-point microwave systems, with a channel greater than or equal to 50 KHz bandwidth...

47 CFR 101.101 - Frequency availability.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE...—(Part 78) CC: Common Carrier Fixed Point-to-Point Microwave Service—(Part 101, Subparts C & I) DBS... Distribution Service—(Part 21) OFS: Private Operational Fixed Point-to-Point Microwave Service—(Part 101...

Seeking fixed points in multiple coupling scalar theories in the ɛ expansion

NASA Astrophysics Data System (ADS)

Osborn, Hugh; Stergiou, Andreas

2018-05-01

Fixed points for scalar theories in 4 - ɛ, 6 - ɛ and 3 - ɛ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general framework with two couplings. The original maximal symmetry, O( N), is broken to various subgroups, both discrete and continuous. A similar discussion is applied to the six dimensional case. Perturbative applications of the a-theorem are used to help classify potential fixed points. At lowest order in the ɛ-expansion it is shown that at fixed points there is a lower bound for a which is saturated at bifurcation points.

Reduce beam hardening artifacts of polychromatic X-ray computed tomography by an iterative approximation approach.

PubMed

Shi, Hongli; Yang, Zhi; Luo, Shuqian

2017-01-01

The beam hardening artifact is one of most important modalities of metal artifact for polychromatic X-ray computed tomography (CT), which can impair the image quality seriously. An iterative approach is proposed to reduce beam hardening artifact caused by metallic components in polychromatic X-ray CT. According to Lambert-Beer law, the (detected) projections can be expressed as monotonic nonlinear functions of element geometry projections, which are the theoretical projections produced only by the pixel intensities (image grayscale) of certain element (component). With help of a prior knowledge on spectrum distribution of X-ray beam source and energy-dependent attenuation coefficients, the functions have explicit expressions. Newton-Raphson algorithm is employed to solve the functions. The solutions are named as the synthetical geometry projections, which are the nearly linear weighted sum of element geometry projections with respect to mean of each attenuation coefficient. In this process, the attenuation coefficients are modified to make Newton-Raphson iterative functions satisfy the convergence conditions of fixed pointed iteration(FPI) so that the solutions will approach the true synthetical geometry projections stably. The underlying images are obtained using the projections by general reconstruction algorithms such as the filtered back projection (FBP). The image gray values are adjusted according to the attenuation coefficient means to obtain proper CT numbers. Several examples demonstrate the proposed approach is efficient in reducing beam hardening artifacts and has satisfactory performance in the term of some general criteria. In a simulation example, the normalized root mean square difference (NRMSD) can be reduced 17.52% compared to a newest algorithm. Since the element geometry projections are free from the effect of beam hardening, the nearly linear weighted sum of them, the synthetical geometry projections, are almost free from the effect of beam hardening. By working out the synthetical geometry projections, the proposed approach becomes quite efficient in reducing beam hardening artifacts.

Twostep-by-twostep PIRK-type PC methods with continuous output formulas

NASA Astrophysics Data System (ADS)

Cong, Nguyen Huu; Xuan, Le Ngoc

2008-11-01

This paper deals with parallel predictor-corrector (PC) iteration methods based on collocation Runge-Kutta (RK) corrector methods with continuous output formulas for solving nonstiff initial-value problems (IVPs) for systems of first-order differential equations. At nth step, the continuous output formulas are used not only for predicting the stage values in the PC iteration methods but also for calculating the step values at (n+2)th step. In this case, the integration processes can be proceeded twostep-by-twostep. The resulting twostep-by-twostep (TBT) parallel-iterated RK-type (PIRK-type) methods with continuous output formulas (twostep-by-twostep PIRKC methods or TBTPIRKC methods) give us a faster integration process. Fixed stepsize applications of these TBTPIRKC methods to a few widely-used test problems reveal that the new PC methods are much more efficient when compared with the well-known parallel-iterated RK methods (PIRK methods), parallel-iterated RK-type PC methods with continuous output formulas (PIRKC methods) and sequential explicit RK codes DOPRI5 and DOP853 available from the literature.

Arc detection for the ICRF system on ITER

NASA Astrophysics Data System (ADS)

D'Inca, R.

2011-12-01

The ICRF system for ITER is designed to respect the high voltage breakdown limits. However arcs can still statistically happen and must be quickly detected and suppressed by shutting the RF power down. For the conception of a reliable and efficient detector, the analysis of the mechanism of arcs is necessary to find their unique signature. Numerous systems have been conceived to address the issues of arc detection. VSWR-based detectors, RF noise detectors, sound detectors, optical detectors, S-matrix based detectors. Until now, none of them has succeeded in demonstrating the fulfillment of all requirements and the studies for ITER now follow three directions: improvement of the existing concepts to fix their flaws, development of new theoretically fully compliant detectors (like the GUIDAR) and combination of several detectors to benefit from the advantages of each of them. Together with the physical and engineering challenges, the development of an arc detection system for ITER raises methodological concerns to extrapolate the results from basic experiments and present machines to the ITER scale ICRF system and to conduct a relevant risk analysis.

Three Boundary Conditions for Computing the Fixed-Point Property in Binary Mixture Data.

PubMed

van Maanen, Leendert; Couto, Joaquina; Lebreton, Mael

2016-01-01

The notion of "mixtures" has become pervasive in behavioral and cognitive sciences, due to the success of dual-process theories of cognition. However, providing support for such dual-process theories is not trivial, as it crucially requires properties in the data that are specific to mixture of cognitive processes. In theory, one such property could be the fixed-point property of binary mixture data, applied-for instance- to response times. In that case, the fixed-point property entails that response time distributions obtained in an experiment in which the mixture proportion is manipulated would have a common density point. In the current article, we discuss the application of the fixed-point property and identify three boundary conditions under which the fixed-point property will not be interpretable. In Boundary condition 1, a finding in support of the fixed-point will be mute because of a lack of difference between conditions. Boundary condition 2 refers to the case in which the extreme conditions are so different that a mixture may display bimodality. In this case, a mixture hypothesis is clearly supported, yet the fixed-point may not be found. In Boundary condition 3 the fixed-point may also not be present, yet a mixture might still exist but is occluded due to additional changes in behavior. Finding the fixed-property provides strong support for a dual-process account, yet the boundary conditions that we identify should be considered before making inferences about underlying psychological processes.

Three Boundary Conditions for Computing the Fixed-Point Property in Binary Mixture Data

PubMed Central

Couto, Joaquina; Lebreton, Mael

2016-01-01

The notion of “mixtures” has become pervasive in behavioral and cognitive sciences, due to the success of dual-process theories of cognition. However, providing support for such dual-process theories is not trivial, as it crucially requires properties in the data that are specific to mixture of cognitive processes. In theory, one such property could be the fixed-point property of binary mixture data, applied–for instance- to response times. In that case, the fixed-point property entails that response time distributions obtained in an experiment in which the mixture proportion is manipulated would have a common density point. In the current article, we discuss the application of the fixed-point property and identify three boundary conditions under which the fixed-point property will not be interpretable. In Boundary condition 1, a finding in support of the fixed-point will be mute because of a lack of difference between conditions. Boundary condition 2 refers to the case in which the extreme conditions are so different that a mixture may display bimodality. In this case, a mixture hypothesis is clearly supported, yet the fixed-point may not be found. In Boundary condition 3 the fixed-point may also not be present, yet a mixture might still exist but is occluded due to additional changes in behavior. Finding the fixed-property provides strong support for a dual-process account, yet the boundary conditions that we identify should be considered before making inferences about underlying psychological processes. PMID:27893868

47 CFR 101.21 - Technical content of applications.

Code of Federal Regulations, 2010 CFR

2010-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.21 Technical...) [Reserved] (e) Each application in the Private Operational Fixed Point-to-Point Microwave Service and the Common Carrier Fixed Point-to-Point Microwave Service must include the following information: Applicant's...

47 CFR 101.5 - Station authorization required.

Code of Federal Regulations, 2014 CFR

2014-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.5 Station... stations authorized under subpart H (Private Operational Fixed Point-to-Point Microwave Service), subpart I (Common Carrier Fixed Point-to-Point Microwave Service), and subpart L of this part (Local Multipoint...

47 CFR 101.5 - Station authorization required.

Code of Federal Regulations, 2010 CFR

2010-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.5 Station... stations authorized under subpart H (Private Operational Fixed Point-to-Point Microwave Service), subpart I (Common Carrier Fixed Point-to-Point Microwave Service), and subpart L of this part (Local Multipoint...

47 CFR 101.21 - Technical content of applications.

Code of Federal Regulations, 2011 CFR

2011-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.21 Technical...) [Reserved] (e) Each application in the Private Operational Fixed Point-to-Point Microwave Service and the Common Carrier Fixed Point-to-Point Microwave Service must include the following information: Applicant's...

47 CFR 101.21 - Technical content of applications.

Code of Federal Regulations, 2012 CFR

2012-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.21 Technical...) [Reserved] (e) Each application in the Private Operational Fixed Point-to-Point Microwave Service and the Common Carrier Fixed Point-to-Point Microwave Service must include the following information: Applicant's...

47 CFR 101.5 - Station authorization required.

Code of Federal Regulations, 2013 CFR

2013-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.5 Station... stations authorized under subpart H (Private Operational Fixed Point-to-Point Microwave Service), subpart I (Common Carrier Fixed Point-to-Point Microwave Service), and subpart L of this part (Local Multipoint...

47 CFR 101.5 - Station authorization required.

Code of Federal Regulations, 2012 CFR

2012-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.5 Station... stations authorized under subpart H (Private Operational Fixed Point-to-Point Microwave Service), subpart I (Common Carrier Fixed Point-to-Point Microwave Service), and subpart L of this part (Local Multipoint...

47 CFR 101.5 - Station authorization required.

Code of Federal Regulations, 2011 CFR

2011-10-01

... SERVICES FIXED MICROWAVE SERVICES Applications and Licenses General Filing Requirements § 101.5 Station... stations authorized under subpart H (Private Operational Fixed Point-to-Point Microwave Service), subpart I (Common Carrier Fixed Point-to-Point Microwave Service), and subpart L of this part (Local Multipoint...

ISS Double-Gimbaled CMG Subsystem Simulation Using the Agile Development Method

NASA Technical Reports Server (NTRS)

Inampudi, Ravi

2016-01-01

This paper presents an evolutionary approach in simulating a cluster of 4 Control Moment Gyros (CMG) on the International Space Station (ISS) using a common sense approach (the agile development method) for concurrent mathematical modeling and simulation of the CMG subsystem. This simulation is part of Training systems for the 21st Century simulator which will provide training for crew members, instructors, and flight controllers. The basic idea of how the CMGs on the space station are used for its non-propulsive attitude control is briefly explained to set up the context for simulating a CMG subsystem. Next different reference frames and the detailed equations of motion (EOM) for multiple double-gimbal variable-speed control moment gyroscopes (DGVs) are presented. Fixing some of the terms in the EOM becomes the special case EOM for ISS's double-gimbaled fixed speed CMGs. CMG simulation development using the agile development method is presented in which customer's requirements and solutions evolve through iterative analysis, design, coding, unit testing and acceptance testing. At the end of the iteration a set of features implemented in that iteration are demonstrated to the flight controllers thus creating a short feedback loop and helping in creating adaptive development cycles. The unified modeling language (UML) tool is used in illustrating the user stories, class designs and sequence diagrams. This incremental development approach of mathematical modeling and simulating the CMG subsystem involved the development team and the customer early on, thus improving the quality of the working CMG system in each iteration and helping the team to accurately predict the cost, schedule and delivery of the software.

LiDAR-IMU Time Delay Calibration Based on Iterative Closest Point and Iterated Sigma Point Kalman Filter

PubMed Central

Liu, Wanli

2017-01-01

The time delay calibration between Light Detection and Ranging (LiDAR) and Inertial Measurement Units (IMUs) is an essential prerequisite for its applications. However, the correspondences between LiDAR and IMU measurements are usually unknown, and thus cannot be computed directly for the time delay calibration. In order to solve the problem of LiDAR-IMU time delay calibration, this paper presents a fusion method based on iterative closest point (ICP) and iterated sigma point Kalman filter (ISPKF), which combines the advantages of ICP and ISPKF. The ICP algorithm can precisely determine the unknown transformation between LiDAR-IMU; and the ISPKF algorithm can optimally estimate the time delay calibration parameters. First of all, the coordinate transformation from the LiDAR frame to the IMU frame is realized. Second, the measurement model and time delay error model of LiDAR and IMU are established. Third, the methodology of the ICP and ISPKF procedure is presented for LiDAR-IMU time delay calibration. Experimental results are presented that validate the proposed method and demonstrate the time delay error can be accurately calibrated. PMID:28282897

Stress-Constrained Structural Topology Optimization with Design-Dependent Loads

NASA Astrophysics Data System (ADS)

Lee, Edmund

Topology optimization is commonly used to distribute a given amount of material to obtain the stiffest structure, with predefined fixed loads. The present work investigates the result of applying stress constraints to topology optimization, for problems with design-depending loading, such as self-weight and pressure. In order to apply pressure loading, a material boundary identification scheme is proposed, iteratively connecting points of equal density. In previous research, design-dependent loading problems have been limited to compliance minimization. The present study employs a more practical approach by minimizing mass subject to failure constraints, and uses a stress relaxation technique to avoid stress constraint singularities. The results show that these design dependent loading problems may converge to a local minimum when stress constraints are enforced. Comparisons between compliance minimization solutions and stress-constrained solutions are also given. The resulting topologies of these two solutions are usually vastly different, demonstrating the need for stress-constrained topology optimization.

Load-Flow in Multiphase Distribution Networks: Existence, Uniqueness, Non-Singularity, and Linear Models

DOE PAGES

Bernstein, Andrey; Wang, Cong; Dall'Anese, Emiliano; ...

2018-01-01

This paper considers unbalanced multiphase distribution systems with generic topology and different load models, and extends the Z-bus iterative load-flow algorithm based on a fixed-point interpretation of the AC load-flow equations. Explicit conditions for existence and uniqueness of load-flow solutions are presented. These conditions also guarantee convergence of the load-flow algorithm to the unique solution. The proposed methodology is applicable to generic systems featuring (i) wye connections; (ii) ungrounded delta connections; (iii) a combination of wye-connected and delta-connected sources/loads; and, (iv) a combination of line-to-line and line-to-grounded-neutral devices at the secondary of distribution transformers. Further, a sufficient condition for themore » non-singularity of the load-flow Jacobian is proposed. Finally, linear load-flow models are derived, and their approximation accuracy is analyzed. Theoretical results are corroborated through experiments on IEEE test feeders.« less

Analytical and Numerical solutions of a nonlinear alcoholism model via variable-order fractional differential equations

NASA Astrophysics Data System (ADS)

Gómez-Aguilar, J. F.

2018-03-01

In this paper, we analyze an alcoholism model which involves the impact of Twitter via Liouville-Caputo and Atangana-Baleanu-Caputo fractional derivatives with constant- and variable-order. Two fractional mathematical models are considered, with and without delay. Special solutions using an iterative scheme via Laplace and Sumudu transform were obtained. We studied the uniqueness and existence of the solutions employing the fixed point postulate. The generalized model with variable-order was solved numerically via the Adams method and the Adams-Bashforth-Moulton scheme. Stability and convergence of the numerical solutions were presented in details. Numerical examples of the approximate solutions are provided to show that the numerical methods are computationally efficient. Therefore, by including both the fractional derivatives and finite time delays in the alcoholism model studied, we believe that we have established a more complete and more realistic indicator of alcoholism model and affect the spread of the drinking.

Hysteresis in column systems

NASA Astrophysics Data System (ADS)

Ivanyi, P.; Ivanyi, A.

2015-02-01

In this paper one column of a telescopic construction of a bell tower is investigated. The hinges at the support of the column and at the connecting joint between the upper and lower columns are modelled with rotational springs. The characteristics of the springs are assumed to be non-linear and the hysteresis property of them is represented with the Preisach hysteresis model. The mass of the columns and the bell with the fly are concentrated to the top of the column. The tolling process is simulated with a cycling load. The elements of the column are considered completely rigid. The time iteration of the non-linear equations of the motion is evaluated by the Crank-Nicolson schema and the implemented non-linear hysteresis is handled by the fix-point technique. The numerical simulation of the dynamic system is carried out under different combination of soft, medium and hard hysteresis properties of hinges.

Load-Flow in Multiphase Distribution Networks: Existence, Uniqueness, Non-Singularity, and Linear Models

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

Bernstein, Andrey; Wang, Cong; Dall'Anese, Emiliano

This paper considers unbalanced multiphase distribution systems with generic topology and different load models, and extends the Z-bus iterative load-flow algorithm based on a fixed-point interpretation of the AC load-flow equations. Explicit conditions for existence and uniqueness of load-flow solutions are presented. These conditions also guarantee convergence of the load-flow algorithm to the unique solution. The proposed methodology is applicable to generic systems featuring (i) wye connections; (ii) ungrounded delta connections; (iii) a combination of wye-connected and delta-connected sources/loads; and, (iv) a combination of line-to-line and line-to-grounded-neutral devices at the secondary of distribution transformers. Further, a sufficient condition for themore » non-singularity of the load-flow Jacobian is proposed. Finally, linear load-flow models are derived, and their approximation accuracy is analyzed. Theoretical results are corroborated through experiments on IEEE test feeders.« less

Markov Chain Monte Carlo from Lagrangian Dynamics.

PubMed

Lan, Shiwei; Stathopoulos, Vasileios; Shahbaba, Babak; Girolami, Mark

2015-04-01

Hamiltonian Monte Carlo (HMC) improves the computational e ciency of the Metropolis-Hastings algorithm by reducing its random walk behavior. Riemannian HMC (RHMC) further improves the performance of HMC by exploiting the geometric properties of the parameter space. However, the geometric integrator used for RHMC involves implicit equations that require fixed-point iterations. In some cases, the computational overhead for solving implicit equations undermines RHMC's benefits. In an attempt to circumvent this problem, we propose an explicit integrator that replaces the momentum variable in RHMC by velocity. We show that the resulting transformation is equivalent to transforming Riemannian Hamiltonian dynamics to Lagrangian dynamics. Experimental results suggests that our method improves RHMC's overall computational e ciency in the cases considered. All computer programs and data sets are available online (http://www.ics.uci.edu/~babaks/Site/Codes.html) in order to allow replication of the results reported in this paper.

A New Metrics for Countries' Fitness and Products' Complexity

NASA Astrophysics Data System (ADS)

Tacchella, Andrea; Cristelli, Matthieu; Caldarelli, Guido; Gabrielli, Andrea; Pietronero, Luciano

2012-10-01

Classical economic theories prescribe specialization of countries industrial production. Inspection of the country databases of exported products shows that this is not the case: successful countries are extremely diversified, in analogy with biosystems evolving in a competitive dynamical environment. The challenge is assessing quantitatively the non-monetary competitive advantage of diversification which represents the hidden potential for development and growth. Here we develop a new statistical approach based on coupled non-linear maps, whose fixed point defines a new metrics for the country Fitness and product Complexity. We show that a non-linear iteration is necessary to bound the complexity of products by the fitness of the less competitive countries exporting them. We show that, given the paradigm of economic complexity, the correct and simplest approach to measure the competitiveness of countries is the one presented in this work. Furthermore our metrics appears to be economically well-grounded.

Solution of a few nonlinear problems in aerodynamics by the finite elements and functional least squares methods. Ph.D. Thesis - Paris Univ.; [mathematical models of transonic flow using nonlinear equations

NASA Technical Reports Server (NTRS)

Periaux, J.

1979-01-01

The numerical simulation of the transonic flows of idealized fluids and of incompressible viscous fluids, by the nonlinear least squares methods is presented. The nonlinear equations, the boundary conditions, and the various constraints controlling the two types of flow are described. The standard iterative methods for solving a quasi elliptical nonlinear equation with partial derivatives are reviewed with emphasis placed on two examples: the fixed point method applied to the Gelder functional in the case of compressible subsonic flows and the Newton method used in the technique of decomposition of the lifting potential. The new abstract least squares method is discussed. It consists of substituting the nonlinear equation by a problem of minimization in a H to the minus 1 type Sobolev functional space.

Finite-beta equilibria for Wendelstein 7-X configurations using the Princeton Iterative Equilibrium Solver code

NASA Astrophysics Data System (ADS)

Arndt, S.; Merkel, P.; Monticello, D. A.; Reiman, A. H.

1999-04-01

Fixed- and free-boundary equilibria for Wendelstein 7-X (W7-X) [W. Lotz et al., Plasma Physics and Controlled Nuclear Fusion Research 1990 (Proc. 13th Int. Conf. Washington, DC, 1990), (International Atomic Energy Agency, Vienna, 1991), Vol. 2, p. 603] configurations are calculated using the Princeton Iterative Equilibrium Solver (PIES) [A. H. Reiman et al., Comput. Phys. Commun., 43, 157 (1986)] to deal with magnetic islands and stochastic regions. Usually, these W7-X configurations require a large number of iterations for PIES convergence. Here, two methods have been successfully tested in an attempt to decrease the number of iterations needed for convergence. First, periodic sequences of different blending parameters are used. Second, the initial guess is vastly improved by using results of the Variational Moments Equilibrium Code (VMEC) [S. P. Hirshmann et al., Phys. Fluids 26, 3553 (1983)]. Use of these two methods have allowed verification of the Hamada condition and tendency of "self-healing" of islands has been observed.

Solution of effective Hamiltonian of impurity hopping between two sites in a metal

NASA Astrophysics Data System (ADS)

Ye, Jinwu

1998-03-01

We analyze in detail all the possible fixed points of the effective Hamiltonian of a non-magnetic impurity hopping between two sites in a metal obtained by Moustakas and Fisher(MF). We find a line of non-fermi liquid fixed points which continuously interpolates between the 2-channel Kondo fixed point(2CK) and the one channel, two impurity Kondo (2IK) fixed point. There is one relevant direction with scaling dimension 1/2 and one leading irrelevant operator with dimension 3/2. There is also one marginal operator in the spin sector moving along this line. The additional non-fermi liquid fixed point found by MF has the same symmetry as the 2IK, it has two relevant directions with scaling dimension 1/2, therefore also unstable. The system is shown to flow to a line of fermi-liquid fixed points which continuously interpolates between the non-interacting fixed point and the 2 channel spin-flavor Kondo fixed point (2CSFK) discussed by the author previously. The effect of particle-hole symmetry breaking is discussed. The effective Hamiltonian in the external magnetic field is analysed. The scaling functions for the physical measurable quantities are derived in the different regimes; their predictions for the experiments are given. Finally the implications are given for a non-magnetic impurity hopping around three sites with triangular symmetry discussed by MF.

Rate-Compatible LDPC Codes with Linear Minimum Distance

NASA Technical Reports Server (NTRS)

Divsalar, Dariush; Jones, Christopher; Dolinar, Samuel

2009-01-01

A recently developed method of constructing protograph-based low-density parity-check (LDPC) codes provides for low iterative decoding thresholds and minimum distances proportional to block sizes, and can be used for various code rates. A code constructed by this method can have either fixed input block size or fixed output block size and, in either case, provides rate compatibility. The method comprises two submethods: one for fixed input block size and one for fixed output block size. The first mentioned submethod is useful for applications in which there are requirements for rate-compatible codes that have fixed input block sizes. These are codes in which only the numbers of parity bits are allowed to vary. The fixed-output-blocksize submethod is useful for applications in which framing constraints are imposed on the physical layers of affected communication systems. An example of such a system is one that conforms to one of many new wireless-communication standards that involve the use of orthogonal frequency-division modulation

Steady state numerical solutions for determining the location of MEMS on projectile

NASA Astrophysics Data System (ADS)

Abiprayu, K.; Abdigusna, M. F. F.; Gunawan, P. H.

2018-03-01

This paper is devoted to compare the numerical solutions for the steady and unsteady state heat distribution model on projectile. Here, the best location for installing of the MEMS on the projectile based on the surface temperature is investigated. Numerical iteration methods, Jacobi and Gauss-Seidel have been elaborated to solve the steady state heat distribution model on projectile. The results using Jacobi and Gauss-Seidel are shown identical but the discrepancy iteration cost for each methods is gained. Using Jacobi’s method, the iteration cost is 350 iterations. Meanwhile, using Gauss-Seidel 188 iterations are obtained, faster than the Jacobi’s method. The comparison of the simulation by steady state model and the unsteady state model by a reference is shown satisfying. Moreover, the best candidate for installing MEMS on projectile is observed at pointT(10, 0) which has the lowest temperature for the other points. The temperature using Jacobi and Gauss-Seidel for scenario 1 and 2 atT(10, 0) are 307 and 309 Kelvin respectively.

Combined Use of Automatic Tube Voltage Selection and Current Modulation with Iterative Reconstruction for CT Evaluation of Small Hypervascular Hepatocellular Carcinomas: Effect on Lesion Conspicuity and Image Quality

PubMed Central

Lv, Peijie; Liu, Jie; Zhang, Rui; Jia, Yan

2015-01-01

Objective To assess the lesion conspicuity and image quality in CT evaluation of small (≤ 3 cm) hepatocellular carcinomas (HCCs) using automatic tube voltage selection (ATVS) and automatic tube current modulation (ATCM) with or without iterative reconstruction. Materials and Methods One hundred and five patients with 123 HCC lesions were included. Fifty-seven patients were scanned using both ATVS and ATCM and images were reconstructed using either filtered back-projection (FBP) (group A1) or sinogram-affirmed iterative reconstruction (SAFIRE) (group A2). Forty-eight patients were imaged using only ATCM, with a fixed tube potential of 120 kVp and FBP reconstruction (group B). Quantitative parameters (image noise in Hounsfield unit and contrast-to-noise ratio of the aorta, the liver, and the hepatic tumors) and qualitative visual parameters (image noise, overall image quality, and lesion conspicuity as graded on a 5-point scale) were compared among the groups. Results Group A2 scanned with the automatically chosen 80 kVp and 100 kVp tube voltages ranked the best in lesion conspicuity and subjective and objective image quality (p values ranging from < 0.001 to 0.004) among the three groups, except for overall image quality between group A2 and group B (p = 0.022). Group A1 showed higher image noise (p = 0.005) but similar lesion conspicuity and overall image quality as compared with group B. The radiation dose in group A was 19% lower than that in group B (p = 0.022). Conclusion CT scanning with combined use of ATVS and ATCM and image reconstruction with SAFIRE algorithm provides higher lesion conspicuity and better image quality for evaluating small hepatic HCCs with radiation dose reduction. PMID:25995682

Numerical methods for solving moment equations in kinetic theory of neuronal network dynamics

NASA Astrophysics Data System (ADS)

Rangan, Aaditya V.; Cai, David; Tao, Louis

2007-02-01

Recently developed kinetic theory and related closures for neuronal network dynamics have been demonstrated to be a powerful theoretical framework for investigating coarse-grained dynamical properties of neuronal networks. The moment equations arising from the kinetic theory are a system of (1 + 1)-dimensional nonlinear partial differential equations (PDE) on a bounded domain with nonlinear boundary conditions. The PDEs themselves are self-consistently specified by parameters which are functions of the boundary values of the solution. The moment equations can be stiff in space and time. Numerical methods are presented here for efficiently and accurately solving these moment equations. The essential ingredients in our numerical methods include: (i) the system is discretized in time with an implicit Euler method within a spectral deferred correction framework, therefore, the PDEs of the kinetic theory are reduced to a sequence, in time, of boundary value problems (BVPs) with nonlinear boundary conditions; (ii) a set of auxiliary parameters is introduced to recast the original BVP with nonlinear boundary conditions as BVPs with linear boundary conditions - with additional algebraic constraints on the auxiliary parameters; (iii) a careful combination of two Newton's iterates for the nonlinear BVP with linear boundary condition, interlaced with a Newton's iterate for solving the associated algebraic constraints is constructed to achieve quadratic convergence for obtaining the solutions with self-consistent parameters. It is shown that a simple fixed-point iteration can only achieve a linear convergence for the self-consistent parameters. The practicability and efficiency of our numerical methods for solving the moment equations of the kinetic theory are illustrated with numerical examples. It is further demonstrated that the moment equations derived from the kinetic theory of neuronal network dynamics can very well capture the coarse-grained dynamical properties of integrate-and-fire neuronal networks.

Iterating the Number of Intersection Points of the Diagonals of Irregular Convex Polygons, or C (n, 4) the Hard Way!

ERIC Educational Resources Information Center

Hathout, Leith

2007-01-01

Counting the number of internal intersection points made by the diagonals of irregular convex polygons where no three diagonals are concurrent is an interesting problem in discrete mathematics. This paper uses an iterative approach to develop a summation relation which tallies the total number of intersections, and shows that this total can be…

Intrinsic alignments of galaxies in the MassiveBlack-II simulation: Analysis of two-point statistics

DOE PAGES

Tenneti, Ananth; Singh, Sukhdeep; Mandelbaum, Rachel; ...

2015-03-11

The intrinsic alignment of galaxies with the large-scale density field in an important astrophysical contaminant in upcoming weak lensing surveys. We present detailed measurements of the galaxy intrinsic alignments and associated ellipticity-direction (ED) and projected shape (w g₊) correlation functions for galaxies in the cosmological hydrodynamic MassiveBlack-II (MB-II) simulation. We carefully assess the effects on galaxy shapes, misalignment of the stellar component with the dark matter shape and two-point statistics of iterative weighted (by mass and luminosity) definitions of the (reduced and unreduced) inertia tensor. We find that iterative procedures must be adopted for a reliable measurement of the reducedmore » tensor but that luminosity versus mass weighting has only negligible effects. Both ED and w g₊ correlations increase in amplitude with subhalo mass (in the range of 10¹⁰ – 6.0 X 10¹⁴h⁻¹ M ⊙), with a weak redshift dependence (from z = 1 to z = 0.06) at fixed mass. At z ~ 0.3, we predict a w g₊ that is in reasonable agreement with SDSS LRG measurements and that decreases in amplitude by a factor of ~ 5–18 for galaxies in the LSST survey. We also compared the intrinsic alignment of centrals and satellites, with clear detection of satellite radial alignments within the host halos. Finally, we show that w g₊ (using subhalos as tracers of density and w δ (using dark matter density) predictions from the simulations agree with that of non-linear alignment models (NLA) at scales where the 2-halo term dominates in the correlations (and tabulate associated NLA fitting parameters). The 1-halo term induces a scale dependent bias at small scales which is not modeled in the NLA model.« less

Intrinsic alignments of galaxies in the MassiveBlack-II simulation: analysis of two-point statistics

NASA Astrophysics Data System (ADS)

Tenneti, Ananth; Singh, Sukhdeep; Mandelbaum, Rachel; di Matteo, Tiziana; Feng, Yu; Khandai, Nishikanta

2015-04-01

The intrinsic alignment of galaxies with the large-scale density field is an important astrophysical contaminant in upcoming weak lensing surveys. We present detailed measurements of the galaxy intrinsic alignments and associated ellipticity-direction (ED) and projected shape (wg+) correlation functions for galaxies in the cosmological hydrodynamic MassiveBlack-II simulation. We carefully assess the effects on galaxy shapes, misalignment of the stellar component with the dark matter shape and two-point statistics of iterative weighted (by mass and luminosity) definitions of the (reduced and unreduced) inertia tensor. We find that iterative procedures must be adopted for a reliable measurement of the reduced tensor but that luminosity versus mass weighting has only negligible effects. Both ED and wg+ correlations increase in amplitude with subhalo mass (in the range of 1010-6.0 × 1014 h-1 M⊙), with a weak redshift dependence (from z = 1 to 0.06) at fixed mass. At z ˜ 0.3, we predict a wg+ that is in reasonable agreement with Sloan Digital Sky Survey luminous red galaxy measurements and that decreases in amplitude by a factor of ˜5-18 for galaxies in the Large Synoptic Survey Telescope survey. We also compared the intrinsic alignments of centrals and satellites, with clear detection of satellite radial alignments within their host haloes. Finally, we show that wg+ (using subhaloes as tracers of density) and wδ+ (using dark matter density) predictions from the simulations agree with that of non-linear alignment (NLA) models at scales where the two-halo term dominates in the correlations (and tabulate associated NLA fitting parameters). The one-halo term induces a scale-dependent bias at small scales which is not modelled in the NLA model.

International Conference on Fixed Point Theory and Applications (Colloque International Theorie Du Point Fixe et Applications)

DTIC Science & Technology

1989-06-09

Theorem and the Perron - Frobenius Theorem in matrix theory. We use the Hahn-Banach theorem and do not use any fixed-point related concepts. 179 A...games defined b’, tions 87 Isac G. Fixed point theorems on convex cones , generalized pseudo-contractive mappings and the omplementarity problem 89...and (II), af(x) ° denotes the negative polar cone ot of(x). This condition are respectively called "inward" and "outward". Indeed, when X is convex

A Block Preconditioned Conjugate Gradient-type Iterative Solver for Linear Systems in Thermal Reservoir Simulation

NASA Astrophysics Data System (ADS)

Betté, Srinivas; Diaz, Julio C.; Jines, William R.; Steihaug, Trond

1986-11-01

A preconditioned residual-norm-reducing iterative solver is described. Based on a truncated form of the generalized-conjugate-gradient method for nonsymmetric systems of linear equations, the iterative scheme is very effective for linear systems generated in reservoir simulation of thermal oil recovery processes. As a consequence of employing an adaptive implicit finite-difference scheme to solve the model equations, the number of variables per cell-block varies dynamically over the grid. The data structure allows for 5- and 9-point operators in the areal model, 5-point in the cross-sectional model, and 7- and 11-point operators in the three-dimensional model. Block-diagonal-scaling of the linear system, done prior to iteration, is found to have a significant effect on the rate of convergence. Block-incomplete-LU-decomposition (BILU) and block-symmetric-Gauss-Seidel (BSGS) methods, which result in no fill-in, are used as preconditioning procedures. A full factorization is done on the well terms, and the cells are ordered in a manner which minimizes the fill-in in the well-column due to this factorization. The convergence criterion for the linear (inner) iteration is linked to that of the nonlinear (Newton) iteration, thereby enhancing the efficiency of the computation. The algorithm, with both BILU and BSGS preconditioners, is evaluated in the context of a variety of thermal simulation problems. The solver is robust and can be used with little or no user intervention.

A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem.

PubMed

Dang, C; Xu, L

2001-03-01

In this paper a globally convergent Lagrange and barrier function iterative algorithm is proposed for approximating a solution of the traveling salesman problem. The algorithm employs an entropy-type barrier function to deal with nonnegativity constraints and Lagrange multipliers to handle linear equality constraints, and attempts to produce a solution of high quality by generating a minimum point of a barrier problem for a sequence of descending values of the barrier parameter. For any given value of the barrier parameter, the algorithm searches for a minimum point of the barrier problem in a feasible descent direction, which has a desired property that the nonnegativity constraints are always satisfied automatically if the step length is a number between zero and one. At each iteration the feasible descent direction is found by updating Lagrange multipliers with a globally convergent iterative procedure. For any given value of the barrier parameter, the algorithm converges to a stationary point of the barrier problem without any condition on the objective function. Theoretical and numerical results show that the algorithm seems more effective and efficient than the softassign algorithm.

An efficient Monte Carlo-based algorithm for scatter correction in keV cone-beam CT

NASA Astrophysics Data System (ADS)

Poludniowski, G.; Evans, P. M.; Hansen, V. N.; Webb, S.

2009-06-01

A new method is proposed for scatter-correction of cone-beam CT images. A coarse reconstruction is used in initial iteration steps. Modelling of the x-ray tube spectra and detector response are included in the algorithm. Photon diffusion inside the imaging subject is calculated using the Monte Carlo method. Photon scoring at the detector is calculated using forced detection to a fixed set of node points. The scatter profiles are then obtained by linear interpolation. The algorithm is referred to as the coarse reconstruction and fixed detection (CRFD) technique. Scatter predictions are quantitatively validated against a widely used general-purpose Monte Carlo code: BEAMnrc/EGSnrc (NRCC, Canada). Agreement is excellent. The CRFD algorithm was applied to projection data acquired with a Synergy XVI CBCT unit (Elekta Limited, Crawley, UK), using RANDO and Catphan phantoms (The Phantom Laboratory, Salem NY, USA). The algorithm was shown to be effective in removing scatter-induced artefacts from CBCT images, and took as little as 2 min on a desktop PC. Image uniformity was greatly improved as was CT-number accuracy in reconstructions. This latter improvement was less marked where the expected CT-number of a material was very different to the background material in which it was embedded.

Evaluation of coupling approaches for thermomechanical simulations

DOE PAGES

Novascone, S. R.; Spencer, B. W.; Hales, J. D.; ...

2015-08-10

Many problems of interest, particularly in the nuclear engineering field, involve coupling between the thermal and mechanical response of an engineered system. The strength of the two-way feedback between the thermal and mechanical solution fields can vary significantly depending on the problem. Contact problems exhibit a particularly high degree of two-way feedback between those fields. This paper describes and demonstrates the application of a flexible simulation environment that permits the solution of coupled physics problems using either a tightly coupled approach or a loosely coupled approach. In the tight coupling approach, Newton iterations include the coupling effects between all physics,more » while in the loosely coupled approach, the individual physics models are solved independently, and fixed-point iterations are performed until the coupled system is converged. These approaches are applied to simple demonstration problems and to realistic nuclear engineering applications. The demonstration problems consist of single and multi-domain thermomechanics with and without thermal and mechanical contact. Simulations of a reactor pressure vessel under pressurized thermal shock conditions and a simulation of light water reactor fuel are also presented. Here, problems that include thermal and mechanical contact, such as the contact between the fuel and cladding in the fuel simulation, exhibit much stronger two-way feedback between the thermal and mechanical solutions, and as a result, are better solved using a tight coupling strategy.« less

Implicit Contractive Mappings in Modular Metric and Fuzzy Metric Spaces

PubMed Central

Hussain, N.; Salimi, P.

2014-01-01

The notion of modular metric spaces being a natural generalization of classical modulars over linear spaces like Lebesgue, Orlicz, Musielak-Orlicz, Lorentz, Orlicz-Lorentz, and Calderon-Lozanovskii spaces was recently introduced. In this paper we investigate the existence of fixed points of generalized α-admissible modular contractive mappings in modular metric spaces. As applications, we derive some new fixed point theorems in partially ordered modular metric spaces, Suzuki type fixed point theorems in modular metric spaces and new fixed point theorems for integral contractions. In last section, we develop an important relation between fuzzy metric and modular metric and deduce certain new fixed point results in triangular fuzzy metric spaces. Moreover, some examples are provided here to illustrate the usability of the obtained results. PMID:25003157

Second Iteration of Photogrammetric Pipeline to Enhance the Accuracy of Image Pose Estimation

NASA Astrophysics Data System (ADS)

Nguyen, T. G.; Pierrot-Deseilligny, M.; Muller, J.-M.; Thom, C.

2017-05-01

In classical photogrammetric processing pipeline, the automatic tie point extraction plays a key role in the quality of achieved results. The image tie points are crucial to pose estimation and have a significant influence on the precision of calculated orientation parameters. Therefore, both relative and absolute orientations of the 3D model can be affected. By improving the precision of image tie point measurement, one can enhance the quality of image orientation. The quality of image tie points is under the influence of several factors such as the multiplicity, the measurement precision and the distribution in 2D images as well as in 3D scenes. In complex acquisition scenarios such as indoor applications and oblique aerial images, tie point extraction is limited while only image information can be exploited. Hence, we propose here a method which improves the precision of pose estimation in complex scenarios by adding a second iteration to the classical processing pipeline. The result of a first iteration is used as a priori information to guide the extraction of new tie points with better quality. Evaluated with multiple case studies, the proposed method shows its validity and its high potiential for precision improvement.

Automatic extraction of the mid-sagittal plane using an ICP variant

NASA Astrophysics Data System (ADS)

Fieten, Lorenz; Eschweiler, Jörg; de la Fuente, Matías; Gravius, Sascha; Radermacher, Klaus

2008-03-01

Precise knowledge of the mid-sagittal plane is important for the assessment and correction of several deformities. Furthermore, the mid-sagittal plane can be used for the definition of standardized coordinate systems such as pelvis or skull coordinate systems. A popular approach for mid-sagittal plane computation is based on the selection of anatomical landmarks located either directly on the plane or symmetrically to it. However, the manual selection of landmarks is a tedious, time-consuming and error-prone task, which requires great care. In order to overcome this drawback, previously it was suggested to use the iterative closest point (ICP) algorithm: After an initial mirroring of the data points on a default mirror plane, the mirrored data points should be registered iteratively to the model points using rigid transforms. Finally, a reflection transform approximating the cumulative transform could be extracted. In this work, we present an ICP variant for the iterative optimization of the reflection parameters. It is based on a closed-form solution to the least-squares problem of matching data points to model points using a reflection. In experiments on CT pelvis and skull datasets our method showed a better ability to match homologous areas.

Comparison between iteration schemes for three-dimensional coordinate-transformed saturated-unsaturated flow model

NASA Astrophysics Data System (ADS)

An, Hyunuk; Ichikawa, Yutaka; Tachikawa, Yasuto; Shiiba, Michiharu

2012-11-01

SummaryThree different iteration methods for a three-dimensional coordinate-transformed saturated-unsaturated flow model are compared in this study. The Picard and Newton iteration methods are the common approaches for solving Richards' equation. The Picard method is simple to implement and cost-efficient (on an individual iteration basis). However it converges slower than the Newton method. On the other hand, although the Newton method converges faster, it is more complex to implement and consumes more CPU resources per iteration than the Picard method. The comparison of the two methods in finite-element model (FEM) for saturated-unsaturated flow has been well evaluated in previous studies. However, two iteration methods might exhibit different behavior in the coordinate-transformed finite-difference model (FDM). In addition, the Newton-Krylov method could be a suitable alternative for the coordinate-transformed FDM because it requires the evaluation of a 19-point stencil matrix. The formation of a 19-point stencil is quite a complex and laborious procedure. Instead, the Newton-Krylov method calculates the matrix-vector product, which can be easily approximated by calculating the differences of the original nonlinear function. In this respect, the Newton-Krylov method might be the most appropriate iteration method for coordinate-transformed FDM. However, this method involves the additional cost of taking an approximation at each Krylov iteration in the Newton-Krylov method. In this paper, we evaluated the efficiency and robustness of three iteration methods—the Picard, Newton, and Newton-Krylov methods—for simulating saturated-unsaturated flow through porous media using a three-dimensional coordinate-transformed FDM.

Uniform convergence of multigrid V-cycle iterations for indefinite and nonsymmetric problems

NASA Technical Reports Server (NTRS)

Bramble, James H.; Kwak, Do Y.; Pasciak, Joseph E.

1993-01-01

In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems. In this multigrid method various types of smoothers may be used. One type of smoother which we consider is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. We also study smoothers based entirely on the original operator. One is based on the normal form, that is, the product of the operator and its transpose. Other smoothers studied include point and line, Jacobi, and Gauss-Seidel. We show that the uniform estimates for symmetric positive definite problems carry over to these algorithms. More precisely, the multigrid iteration for the nonsymmetric and/or indefinite problem is shown to converge at a uniform rate provided that the coarsest grid in the multilevel iteration is sufficiently fine (but not depending on the number of multigrid levels).

Automated system for measuring temperature profiles inside ITS-90 fixed-point cells

NASA Astrophysics Data System (ADS)

Hiti, Miha; Bojkovski, Jovan; Batagelj, Valentin; Drnovsek, Janko

2005-11-01

The defining fixed points of the International Temperature Scale of 1990 (ITS-90) are temperature reference points for temperature calibration. The measured temperature inside the fixed-point cell depends on thermometer immersion, since measurements are made below the surface of the fixed-point material and the additional effect of the hydrostatic pressure has to be taken into account. Also, the heat flux along the thermometer stem can affect the measured temperature. The paper presents a system that enables accurate and reproducible immersion profile measurements for evaluation of measurement sensitivity and adequacy of thermometer immersion. It makes immersion profile measurements possible, where a great number of repetitions and long measurement periods are required, and reduces the workload on the user for performing such measurements. The system is flexible and portable and was developed for application to existing equipment in the laboratory. Results of immersion profile measurements in a triple point of water fixed-point cell are presented.

Iterative simulated quenching for designing irregular-spot-array generators.

PubMed

Gillet, J N; Sheng, Y

2000-07-10

We propose a novel, to our knowledge, algorithm of iterative simulated quenching with temperature rescaling for designing diffractive optical elements, based on an analogy between simulated annealing and statistical thermodynamics. The temperature is iteratively rescaled at the end of each quenching process according to ensemble statistics to bring the system back from a frozen imperfect state with a local minimum of energy to a dynamic state in a Boltzmann heat bath in thermal equilibrium at the rescaled temperature. The new algorithm achieves much lower cost function and reconstruction error and higher diffraction efficiency than conventional simulated annealing with a fast exponential cooling schedule and is easy to program. The algorithm is used to design binary-phase generators of large irregular spot arrays. The diffractive phase elements have trapezoidal apertures of varying heights, which fit ideal arbitrary-shaped apertures better than do trapezoidal apertures of fixed heights.

On iterative processes in the Krylov-Sonneveld subspaces

NASA Astrophysics Data System (ADS)

Ilin, Valery P.

2016-10-01

The iterative Induced Dimension Reduction (IDR) methods are considered for solving large systems of linear algebraic equations (SLAEs) with nonsingular nonsymmetric matrices. These approaches are investigated by many authors and are charachterized sometimes as the alternative to the classical processes of Krylov type. The key moments of the IDR algorithms consist in the construction of the embedded Sonneveld subspaces, which have the decreasing dimensions and use the orthogonalization to some fixed subspace. Other independent approaches for research and optimization of the iterations are based on the augmented and modified Krylov subspaces by using the aggregation and deflation procedures with present various low rank approximations of the original matrices. The goal of this paper is to show, that IDR method in Sonneveld subspaces present an original interpretation of the modified algorithms in the Krylov subspaces. In particular, such description is given for the multi-preconditioned semi-conjugate direction methods which are actual for the parallel algebraic domain decomposition approaches.

Iterative feature refinement for accurate undersampled MR image reconstruction

NASA Astrophysics Data System (ADS)

Wang, Shanshan; Liu, Jianbo; Liu, Qiegen; Ying, Leslie; Liu, Xin; Zheng, Hairong; Liang, Dong

2016-05-01

Accelerating MR scan is of great significance for clinical, research and advanced applications, and one main effort to achieve this is the utilization of compressed sensing (CS) theory. Nevertheless, the existing CSMRI approaches still have limitations such as fine structure loss or high computational complexity. This paper proposes a novel iterative feature refinement (IFR) module for accurate MR image reconstruction from undersampled K-space data. Integrating IFR with CSMRI which is equipped with fixed transforms, we develop an IFR-CS method to restore meaningful structures and details that are originally discarded without introducing too much additional complexity. Specifically, the proposed IFR-CS is realized with three iterative steps, namely sparsity-promoting denoising, feature refinement and Tikhonov regularization. Experimental results on both simulated and in vivo MR datasets have shown that the proposed module has a strong capability to capture image details, and that IFR-CS is comparable and even superior to other state-of-the-art reconstruction approaches.

Common fixed point theorems for maps under a contractive condition of integral type

NASA Astrophysics Data System (ADS)

Djoudi, A.; Merghadi, F.

2008-05-01

Two common fixed point theorems for mapping of complete metric space under a general contractive inequality of integral type and satisfying minimal commutativity conditions are proved. These results extend and improve several previous results, particularly Theorem 4 of Rhoades [B.E. Rhoades, Two fixed point theorems for mappings satisfying a general contractive condition of integral type, Int. J. Math. Math. Sci. 63 (2003) 4007-4013] and Theorem 4 of Sessa [S. Sessa, On a weak commutativity condition of mappings in fixed point considerations, Publ. Inst. Math. (Beograd) (N.S.) 32 (46) (1982) 149-153].

Experimental Evidence on Iterated Reasoning in Games

PubMed Central

Grehl, Sascha; Tutić, Andreas

2015-01-01

We present experimental evidence on two forms of iterated reasoning in games, i.e. backward induction and interactive knowledge. Besides reliable estimates of the cognitive skills of the subjects, our design allows us to disentangle two possible explanations for the observed limits in performed iterated reasoning: Restrictions in subjects’ cognitive abilities and their beliefs concerning the rationality of co-players. In comparison to previous literature, our estimates regarding subjects’ skills in iterated reasoning are quite pessimistic. Also, we find that beliefs concerning the rationality of co-players are completely irrelevant in explaining the observed limited amount of iterated reasoning in the dirty faces game. In addition, it is demonstrated that skills in backward induction are a solid predictor for skills in iterated knowledge, which points to some generalized ability of the subjects in iterated reasoning. PMID:26312486

Analytic Evolution of Singular Distribution Amplitudes in QCD

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

Tandogan Kunkel, Asli

2014-08-01

Distribution amplitudes (DAs) are the basic functions that contain information about the quark momentum. DAs are necessary to describe hard exclusive processes in quantum chromodynamics. We describe a method of analytic evolution of DAs that have singularities such as nonzero values at the end points of the support region, jumps at some points inside the support region and cusps. We illustrate the method by applying it to the evolution of a at (constant) DA, antisymmetric at DA, and then use the method for evolution of the two-photon generalized distribution amplitude. Our approach to DA evolution has advantages over the standardmore » method of expansion in Gegenbauer polynomials [1, 2] and over a straightforward iteration of an initial distribution with evolution kernel. Expansion in Gegenbauer polynomials requires an infinite number of terms in order to accurately reproduce functions in the vicinity of singular points. Straightforward iteration of an initial distribution produces logarithmically divergent terms at each iteration. In our method the logarithmic singularities are summed from the start, which immediately produces a continuous curve. Afterwards, in order to get precise results, only one or two iterations are needed.« less

Block Iterative Methods for Elliptic and Parabolic Difference Equations.

DTIC Science & Technology

1981-09-01

S V PARTER, M STEUERWALT N0OO14-7A-C-0341 UNCLASSIFIED CSTR -447 NL ENN.EEEEEN LLf SCOMPUTER SCIENCES c~DEPARTMENT SUniversity of Wisconsin- SMadison...suggests that iterative algorithms that solve for several points at once will converge more rapidly than point algorithms . The Gaussian elimination... algorithm is seen in this light to converge in one step. Frankel [14], Young [34], Arms, Gates, and Zondek [1], and Varga [32], using the algebraic structure

An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features.

PubMed

He, Ying; Liang, Bin; Yang, Jun; Li, Shunzhi; He, Jin

2017-08-11

The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accurate registration of 3D point cloud data. The algorithm requires a proper initial value and the approximate registration of two point clouds to prevent the algorithm from falling into local extremes, but in the actual point cloud matching process, it is difficult to ensure compliance with this requirement. In this paper, we proposed the ICP algorithm based on point cloud features (GF-ICP). This method uses the geometrical features of the point cloud to be registered, such as curvature, surface normal and point cloud density, to search for the correspondence relationships between two point clouds and introduces the geometric features into the error function to realize the accurate registration of two point clouds. The experimental results showed that the algorithm can improve the convergence speed and the interval of convergence without setting a proper initial value.

An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features

PubMed Central

Liang, Bin; Yang, Jun; Li, Shunzhi; He, Jin

2017-01-01

The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accurate registration of 3D point cloud data. The algorithm requires a proper initial value and the approximate registration of two point clouds to prevent the algorithm from falling into local extremes, but in the actual point cloud matching process, it is difficult to ensure compliance with this requirement. In this paper, we proposed the ICP algorithm based on point cloud features (GF-ICP). This method uses the geometrical features of the point cloud to be registered, such as curvature, surface normal and point cloud density, to search for the correspondence relationships between two point clouds and introduces the geometric features into the error function to realize the accurate registration of two point clouds. The experimental results showed that the algorithm can improve the convergence speed and the interval of convergence without setting a proper initial value. PMID:28800096

Metallic and antiferromagnetic fixed points from gravity

NASA Astrophysics Data System (ADS)

Paul, Chandrima

2018-06-01

We consider SU(2) × U(1) gauge theory coupled to matter field in adjoints and study RG group flow. We constructed Callan-Symanzik equation and subsequent β functions and study the fixed points. We find there are two fixed points, showing metallic and antiferromagnetic behavior. We have shown that metallic phase develops an instability if certain parametric conditions are satisfied.

PCC Framework for Program-Generators

NASA Technical Reports Server (NTRS)

Kong, Soonho; Choi, Wontae; Yi, Kwangkeun

2009-01-01

In this paper, we propose a proof-carrying code framework for program-generators. The enabling technique is abstract parsing, a static string analysis technique, which is used as a component for generating and validating certificates. Our framework provides an efficient solution for certifying program-generators whose safety properties are expressed in terms of the grammar representing the generated program. The fixed-point solution of the analysis is generated and attached with the program-generator on the code producer side. The consumer receives the code with a fixed-point solution and validates that the received fixed point is indeed a fixed point of the received code. This validation can be done in a single pass.

Metal Carbon Eutectics to Extend the Use of the Fixed-Point Technique in Precision IR Thermometry

NASA Astrophysics Data System (ADS)

Battuello, M.; Girard, F.; Florio, M.

2008-06-01

The high-temperature extension of the fixed-point technique for primary calibration of precision infrared (IR) thermometers was investigated both through mathematical simulations and laboratory investigations. Simulations were performed with Co C (1,324°C) and Pd C (1, 492°C) eutectic fixed points, and a precision IR thermometer was calibrated from the In point (156.5985°C) up to the Co C point. Mathematical simulations suggested the possibility of directly deriving the transition temperature of the Co C and Pd C points by extrapolating the calibration derived from fixed-point measurements from In to the Cu point. Both temperatures, as a result of the low uncertainty associated with the In Cu calibration and the high number of fixed points involved in the calibration process, can be derived with an uncertainty of 0.11°C for Co C and 0.18°C for Pd C. A transition temperature of 1,324.3°C for Co C was determined from the experimental verification, a value higher than, but compatible with, the one proposed by the thermometry community for inclusion as a secondary reference point for ITS-90 dissemination, i.e., 1,324.0°C.

Constructive methods of invariant manifolds for kinetic problems

NASA Astrophysics Data System (ADS)

Gorban, Alexander N.; Karlin, Iliya V.; Zinovyev, Andrei Yu.

2004-06-01

The concept of the slow invariant manifold is recognized as the central idea underpinning a transition from micro to macro and model reduction in kinetic theories. We present the Constructive Methods of Invariant Manifolds for model reduction in physical and chemical kinetics, developed during last two decades. The physical problem of reduced description is studied in the most general form as a problem of constructing the slow invariant manifold. The invariance conditions are formulated as the differential equation for a manifold immersed in the phase space ( the invariance equation). The equation of motion for immersed manifolds is obtained ( the film extension of the dynamics). Invariant manifolds are fixed points for this equation, and slow invariant manifolds are Lyapunov stable fixed points, thus slowness is presented as stability. A collection of methods to derive analytically and to compute numerically the slow invariant manifolds is presented. Among them, iteration methods based on incomplete linearization, relaxation method and the method of invariant grids are developed. The systematic use of thermodynamics structures and of the quasi-chemical representation allow to construct approximations which are in concordance with physical restrictions. The following examples of applications are presented: nonperturbative deviation of physically consistent hydrodynamics from the Boltzmann equation and from the reversible dynamics, for Knudsen numbers Kn∼1; construction of the moment equations for nonequilibrium media and their dynamical correction (instead of extension of list of variables) to gain more accuracy in description of highly nonequilibrium flows; determination of molecules dimension (as diameters of equivalent hard spheres) from experimental viscosity data; model reduction in chemical kinetics; derivation and numerical implementation of constitutive equations for polymeric fluids; the limits of macroscopic description for polymer molecules, etc.

The succinonitrile triple-point standard: a fixed point to improve the accuracy of temperature measurements in the clinical laboratory.

PubMed

Mangum, B W

1983-07-01

In an investigation of the melting and freezing behavior of succinonitrile, the triple-point temperature was determined to be 58.0805 degrees C, with an estimated uncertainty of +/- 0.0015 degrees C relative to the International Practical Temperature Scale of 1968 (IPTS-68). The triple-point temperature of this material is evaluated as a temperature-fixed point, and some clinical laboratory applications of this fixed point are proposed. In conjunction with the gallium and ice points, the availability of succinonitrile permits thermistor thermometers to be calibrated accurately and easily on the IPTS-68.

A note on the upper bound of the spectral radius for SOR iteration matrix

NASA Astrophysics Data System (ADS)

Chang, D.-W. Da-Wei

2004-05-01

Recently, Wang and Huang (J. Comput. Appl. Math. 135 (2001) 325, Corollary 4.7) established the following estimation on the upper bound of the spectral radius for successive overrelaxation (SOR) iteration matrix:ρSOR≤1-ω+ωρGSunder the condition that the coefficient matrix A is a nonsingular M-matrix and ω≥1, where ρSOR and ρGS are the spectral radius of SOR iteration matrix and Gauss-Seidel iteration matrix, respectively. In this note, we would like to point out that the above estimation is not valid in general.

Performance of a cavity-method-based algorithm for the prize-collecting Steiner tree problem on graphs

NASA Astrophysics Data System (ADS)

Biazzo, Indaco; Braunstein, Alfredo; Zecchina, Riccardo

2012-08-01

We study the behavior of an algorithm derived from the cavity method for the prize-collecting steiner tree (PCST) problem on graphs. The algorithm is based on the zero temperature limit of the cavity equations and as such is formally simple (a fixed point equation resolved by iteration) and distributed (parallelizable). We provide a detailed comparison with state-of-the-art algorithms on a wide range of existing benchmarks, networks, and random graphs. Specifically, we consider an enhanced derivative of the Goemans-Williamson heuristics and the dhea solver, a branch and cut integer linear programming based approach. The comparison shows that the cavity algorithm outperforms the two algorithms in most large instances both in running time and quality of the solution. Finally we prove a few optimality properties of the solutions provided by our algorithm, including optimality under the two postprocessing procedures defined in the Goemans-Williamson derivative and global optimality in some limit cases.

Minimizing hot spot temperature in asymmetric gradient coil design.

PubMed

While, Peter T; Forbes, Larry K; Crozier, Stuart

2011-08-01

Heating caused by gradient coils is a considerable concern in the operation of magnetic resonance imaging (MRI) scanners. Hot spots can occur in regions where the gradient coil windings are closely spaced. These problem areas are particularly common in the design of gradient coils with asymmetrically located target regions. In this paper, an extension of an existing coil design method is described, to enable the design of asymmetric gradient coils with reduced hot spot temperatures. An improved model is presented for predicting steady-state spatial temperature distributions for gradient coils. A great amount of flexibility is afforded by this model to consider a wide range of geometries and system material properties. A feature of the temperature distribution related to the temperature gradient is used in a relaxed fixed point iteration routine for successively altering coil windings to have a lower hot spot temperature. Results show that significant reductions in peak temperature are possible at little or no cost to coil performance when compared to minimum power coils of equivalent field error.

Numerical approximation of the electromechanical coupling in the left ventricle with inclusion of the Purkinje network.

PubMed

Landajuela, Mikel; Vergara, Christian; Gerbi, Antonello; Dedé, Luca; Formaggia, Luca; Quarteroni, Alfio

2018-03-25

In this work, we consider the numerical approximation of the electromechanical coupling in the left ventricle with inclusion of the Purkinje network. The mathematical model couples the 3D elastodynamics and bidomain equations for the electrophysiology in the myocardium with the 1D monodomain equation in the Purkinje network. For the numerical solution of the coupled problem, we consider a fixed-point iterative algorithm that enables a partitioned solution of the myocardium and Purkinje network problems. Different levels of myocardium-Purkinje network splitting are considered and analyzed. The results are compared with those obtained using standard strategies proposed in the literature to trigger the electrical activation. Finally, we present a numerical study that, although performed in an idealized computational domain, features all the physiological issues that characterize a heartbeat simulation, including the initiation of the signal in the Purkinje network and the systolic and diastolic phases. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

A Two Colorable Fourth Order Compact Difference Scheme and Parallel Iterative Solution of the 3D Convection Diffusion Equation

NASA Technical Reports Server (NTRS)

Zhang, Jun; Ge, Lixin; Kouatchou, Jules

2000-01-01

A new fourth order compact difference scheme for the three dimensional convection diffusion equation with variable coefficients is presented. The novelty of this new difference scheme is that it Only requires 15 grid points and that it can be decoupled with two colors. The entire computational grid can be updated in two parallel subsweeps with the Gauss-Seidel type iterative method. This is compared with the known 19 point fourth order compact differenCe scheme which requires four colors to decouple the computational grid. Numerical results, with multigrid methods implemented on a shared memory parallel computer, are presented to compare the 15 point and the 19 point fourth order compact schemes.

Realization of the Temperature Scale in the Range from 234.3 K (Hg Triple Point) to 1084.62°C (Cu Freezing Point) in Croatia

NASA Astrophysics Data System (ADS)

Zvizdic, Davor; Veliki, Tomislav; Grgec Bermanec, Lovorka

2008-06-01

This article describes the realization of the International Temperature Scale in the range from 234.3 K (mercury triple point) to 1084.62°C (copper freezing point) at the Laboratory for Process Measurement (LPM), Faculty of Mechanical Engineering and Naval Architecture (FSB), University of Zagreb. The system for the realization of the ITS-90 consists of the sealed fixed-point cells (mercury triple point, water triple point and gallium melting point) and the apparatus designed for the optimal realization of open fixed-point cells which include the gallium melting point, tin freezing point, zinc freezing point, aluminum freezing point, and copper freezing point. The maintenance of the open fixed-point cells is described, including the system for filling the cells with pure argon and for maintaining the pressure during the realization.

Control advances for achieving the ITER baseline scenario on KSTAR

NASA Astrophysics Data System (ADS)

Eidietis, N. W.; Barr, J.; Hahn, S. H.; Humphreys, D. A.; in, Y. K.; Jeon, Y. M.; Lanctot, M. J.; Mueller, D.; Walker, M. L.

2017-10-01

Control methodologies developed to enable successful production of ITER baseline scenario (IBS) plasmas on the superconducting KSTAR tokamak are presented: decoupled vertical control (DVC), real-time feedforward (rtFF) calculation, and multi-input multi-output (MIMO) X-point control. DVC provides fast vertical control with the in-vessel control coils (IVCC) while sharing slow vertical control with the poloidal field (PF) coils to avoid IVCC saturation. rtFF compensates for inaccuracies in offline PF current feedforward programming, allowing reduction or removal of integral gain (and its detrimental phase lag) from the shape controller. Finally, MIMO X-point control provides accurate positioning of the X-point despite low controllability due to the large distance between coils and plasma. Combined, these techniques enabled achievement of IBS parameters (q95 = 3.2, βN = 2) with a scaled ITER shape on KSTAR. n =2 RMP response displays a strong dependence upon this shaping. Work supported by the US DOE under Award DE-SC0010685 and the KSTAR project.

Nested Conjugate Gradient Algorithm with Nested Preconditioning for Non-linear Image Restoration.

PubMed

Skariah, Deepak G; Arigovindan, Muthuvel

2017-06-19

We develop a novel optimization algorithm, which we call Nested Non-Linear Conjugate Gradient algorithm (NNCG), for image restoration based on quadratic data fitting and smooth non-quadratic regularization. The algorithm is constructed as a nesting of two conjugate gradient (CG) iterations. The outer iteration is constructed as a preconditioned non-linear CG algorithm; the preconditioning is performed by the inner CG iteration that is linear. The inner CG iteration, which performs preconditioning for outer CG iteration, itself is accelerated by an another FFT based non-iterative preconditioner. We prove that the method converges to a stationary point for both convex and non-convex regularization functionals. We demonstrate experimentally that proposed method outperforms the well-known majorization-minimization method used for convex regularization, and a non-convex inertial-proximal method for non-convex regularization functional.

An iterative method for the localization of a neutron source in a large box (container)

NASA Astrophysics Data System (ADS)

Dubinski, S.; Presler, O.; Alfassi, Z. B.

2007-12-01

The localization of an unknown neutron source in a bulky box was studied. This can be used for the inspection of cargo, to prevent the smuggling of neutron and α emitters. It is important to localize the source from the outside for safety reasons. Source localization is necessary in order to determine its activity. A previous study showed that, by using six detectors, three on each parallel face of the box (460×420×200 mm 3), the location of the source can be found with an average distance of 4.73 cm between the real source position and the calculated one and a maximal distance of about 9 cm. Accuracy was improved in this work by applying an iteration method based on four fixed detectors and the successive iteration of positioning of an external calibrating source. The initial positioning of the calibrating source is the plane of detectors 1 and 2. This method finds the unknown source location with an average distance of 0.78 cm between the real source position and the calculated one and a maximum distance of 3.66 cm for the same box. For larger boxes, localization without iterations requires an increase in the number of detectors, while localization with iterations requires only an increase in the number of iteration steps. In addition to source localization, two methods for determining the activity of the unknown source were also studied.

Exact results for the O( N ) model with quenched disorder

NASA Astrophysics Data System (ADS)

Delfino, Gesualdo; Lamsen, Noel

2018-04-01

We use scale invariant scattering theory to exactly determine the lines of renormalization group fixed points for O( N )-symmetric models with quenched disorder in two dimensions. Random fixed points are characterized by two disorder parameters: a modulus that vanishes when approaching the pure case, and a phase angle. The critical lines fall into three classes depending on the values of the disorder modulus. Besides the class corresponding to the pure case, a second class has maximal value of the disorder modulus and includes Nishimori-like multicritical points as well as zero temperature fixed points. The third class contains critical lines that interpolate, as N varies, between the first two classes. For positive N , it contains a single line of infrared fixed points spanning the values of N from √{2}-1 to 1. The symmetry sector of the energy density operator is superuniversal (i.e. N -independent) along this line. For N = 2 a line of fixed points exists only in the pure case, but accounts also for the Berezinskii-Kosterlitz-Thouless phase observed in presence of disorder.

Aeroelastic optimization methodology for viscous and turbulent flows

NASA Astrophysics Data System (ADS)

Barcelos Junior, Manuel Nascimento Dias

2007-12-01

In recent years, the development of faster computers and parallel processing allowed the application of high-fidelity analysis methods to the aeroelastic design of aircraft. However, these methods are restricted to the final design verification, mainly due to the computational cost involved in iterative design processes. Therefore, this work is concerned with the creation of a robust and efficient aeroelastic optimization methodology for inviscid, viscous and turbulent flows by using high-fidelity analysis and sensitivity analysis techniques. Most of the research in aeroelastic optimization, for practical reasons, treat the aeroelastic system as a quasi-static inviscid problem. In this work, as a first step toward the creation of a more complete aeroelastic optimization methodology for realistic problems, an analytical sensitivity computation technique was developed and tested for quasi-static aeroelastic viscous and turbulent flow configurations. Viscous and turbulent effects are included by using an averaged discretization of the Navier-Stokes equations, coupled with an eddy viscosity turbulence model. For quasi-static aeroelastic problems, the traditional staggered solution strategy has unsatisfactory performance when applied to cases where there is a strong fluid-structure coupling. Consequently, this work also proposes a solution methodology for aeroelastic and sensitivity analyses of quasi-static problems, which is based on the fixed point of an iterative nonlinear block Gauss-Seidel scheme. The methodology can also be interpreted as the solution of the Schur complement of the aeroelastic and sensitivity analyses linearized systems of equations. The methodologies developed in this work are tested and verified by using realistic aeroelastic systems.

Symplectic exponential Runge-Kutta methods for solving nonlinear Hamiltonian systems

NASA Astrophysics Data System (ADS)

Mei, Lijie; Wu, Xinyuan

2017-06-01

Symplecticity is also an important property for exponential Runge-Kutta (ERK) methods in the sense of structure preservation once the underlying problem is a Hamiltonian system, though ERK methods provide a good performance of higher accuracy and better efficiency than classical Runge-Kutta (RK) methods in dealing with stiff problems: y‧ (t) = My + f (y). On account of this observation, the main theme of this paper is to derive and analyze the symplectic conditions for ERK methods. Using the fundamental analysis of geometric integrators, we first establish one class of sufficient conditions for symplectic ERK methods. It is shown that these conditions will reduce to the conventional ones when M → 0, and this means that these conditions of symplecticity are extensions of the conventional ones in the literature. Furthermore, we also present a new class of structure-preserving ERK methods possessing the remarkable property of symplecticity. Meanwhile, the revised stiff order conditions are proposed and investigated in detail. Since the symplectic ERK methods are implicit and iterative solutions are required in practice, we also investigate the convergence of the corresponding fixed-point iterative procedure. Finally, the numerical experiments, including a nonlinear Schrödinger equation, a sine-Gordon equation, a nonlinear Klein-Gordon equation, and the well-known Fermi-Pasta-Ulam problem, are implemented in comparison with the corresponding symplectic RK methods and the prominent numerical results definitely coincide with the theories and conclusions made in this paper.

Establishment of the Co-C Eutectic Fixed-Point Cell for Thermocouple Calibrations at NIMT

NASA Astrophysics Data System (ADS)

Ongrai, O.; Elliott, C. J.

2017-08-01

In 2015, NIMT first established a Co-C eutectic temperature reference (fixed-point) cell measurement capability for thermocouple calibration to support the requirements of Thailand's heavy industries and secondary laboratories. The Co-C eutectic fixed-point cell is a facility transferred from NPL, where the design was developed through European and UK national measurement system projects. In this paper, we describe the establishment of a Co-C eutectic fixed-point cell for thermocouple calibration at NIMT. This paper demonstrates achievement of the required furnace uniformity, the Co-C plateau realization and the comparison data between NIMT and NPL Co-C cells by using the same standard Pt/Pd thermocouple, demonstrating traceability. The NIMT measurement capability for noble metal type thermocouples at the new Co-C eutectic fixed point (1324.06°C) is estimated to be within ± 0.60 K (k=2). This meets the needs of Thailand's high-temperature thermocouple users—for which previously there has been no traceable calibration facility.

47 CFR 101.701 - Eligibility.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.701 Eligibility. (a) Authorizations... the customers (or points of service) on the microwave system involved, including those served through...

47 CFR 101.701 - Eligibility.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.701 Eligibility. (a) Authorizations... the customers (or points of service) on the microwave system involved, including those served through...

47 CFR 101.701 - Eligibility.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.701 Eligibility. (a) Authorizations... the customers (or points of service) on the microwave system involved, including those served through...

47 CFR 101.701 - Eligibility.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.701 Eligibility. (a) Authorizations... the customers (or points of service) on the microwave system involved, including those served through...

Inter-track interference mitigation with two-dimensional variable equalizer for bit patterned media recording

NASA Astrophysics Data System (ADS)

Wang, Yao; Vijaya Kumar, B. V. K.

2017-05-01

The increased track density in bit patterned media recording (BPMR) causes increased inter-track interference (ITI), which degrades the bit error rate (BER) performance. In order to mitigate the effect of the ITI, signals from multiple tracks can be equalized by a 2D equalizer with 1D target. Usually, the 2D fixed equalizer coefficients are obtained by using a pseudo-random bit sequence (PRBS) for training. In this study, a 2D variable equalizer is proposed, where various sets of 2D equalizer coefficients are predetermined and stored for different ITI patterns besides the usual PRBS training. For data detection, as the ITI patterns are unknown in the first global iteration, the main and adjacent tracks are equalized with the conventional 2D fixed equalizer, detected with Bahl-Cocke-Jelinek-Raviv (BCJR) detector and decoded with low-density parity-check (LDPC) decoder. Then using the estimated bit information from main and adjacent tracks, the ITI pattern for each island of the main track can be estimated and the corresponding 2D variable equalizers are used to better equalize the bits on the main track. This process is executed iteratively by feeding back the main track information. Simulation results indicate that for both single-track and two-track detection, the proposed 2D variable equalizer can achieve better BER and frame error rate (FER) compared to that with the 2D fixed equalizer.

An efficient algorithm for the generalized Foldy-Lax formulation

NASA Astrophysics Data System (ADS)

Huang, Kai; Li, Peijun; Zhao, Hongkai

2013-02-01

Consider the scattering of a time-harmonic plane wave incident on a two-scale heterogeneous medium, which consists of scatterers that are much smaller than the wavelength and extended scatterers that are comparable to the wavelength. In this work we treat those small scatterers as isotropic point scatterers and use a generalized Foldy-Lax formulation to model wave propagation and capture multiple scattering among point scatterers and extended scatterers. Our formulation is given as a coupled system, which combines the original Foldy-Lax formulation for the point scatterers and the regular boundary integral equation for the extended obstacle scatterers. The existence and uniqueness of the solution for the formulation is established in terms of physical parameters such as the scattering coefficient and the separation distances. Computationally, an efficient physically motivated Gauss-Seidel iterative method is proposed to solve the coupled system, where only a linear system of algebraic equations for point scatterers or a boundary integral equation for a single extended obstacle scatterer is required to solve at each step of iteration. The convergence of the iterative method is also characterized in terms of physical parameters. Numerical tests for the far-field patterns of scattered fields arising from uniformly or randomly distributed point scatterers and single or multiple extended obstacle scatterers are presented.

Digital evaluation of absolute marginal discrepancy: A comparison of ceramic crowns fabricated with conventional and digital techniques.

PubMed

Liang, Shanshan; Yuan, Fusong; Luo, Xu; Yu, Zhuoren; Tang, Zhihui

2018-04-05

Marginal discrepancy is key to evaluating the accuracy of fixed dental prostheses. An improved method of evaluating marginal discrepancy is needed. The purpose of this in vitro study was to evaluate the absolute marginal discrepancy of ceramic crowns fabricated using conventional and digital methods with a digital method for the quantitative evaluation of absolute marginal discrepancy. The novel method was based on 3-dimensional scanning, iterative closest point registration techniques, and reverse engineering theory. Six standard tooth preparations for the right maxillary central incisor, right maxillary second premolar, right maxillary second molar, left mandibular lateral incisor, left mandibular first premolar, and left mandibular first molar were selected. Ten conventional ceramic crowns and 10 CEREC crowns were fabricated for each tooth preparation. A dental cast scanner was used to obtain 3-dimensional data of the preparations and ceramic crowns, and the data were compared with the "virtual seating" iterative closest point technique. Reverse engineering software used edge sharpening and other functional modules to extract the margins of the preparations and crowns. Finally, quantitative evaluation of the absolute marginal discrepancy of the ceramic crowns was obtained from the 2-dimensional cross-sectional straight-line distance between points on the margin of the ceramic crowns and the standard preparations based on the circumferential function module along the long axis. The absolute marginal discrepancy of the ceramic crowns fabricated using conventional methods was 115 ±15.2 μm, and 110 ±14.3 μm for those fabricated using the digital technique was. ANOVA showed no statistical difference between the 2 methods or among ceramic crowns for different teeth (P>.05). The digital quantitative evaluation method for the absolute marginal discrepancy of ceramic crowns was established. The evaluations determined that the absolute marginal discrepancies were within a clinically acceptable range. This method is acceptable for the digital evaluation of the accuracy of complete crowns. Copyright © 2017 Editorial Council for the Journal of Prosthetic Dentistry. Published by Elsevier Inc. All rights reserved.

Finite-beta equilibria for Wendelstein 7-X configurations using the Princeton Iterative Equilibrium Solver code

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

Arndt, S.; Merkel, P.; Monticello, D.A.

Fixed- and free-boundary equilibria for Wendelstein 7-X (W7-X) [W. Lotz {ital et al.}, {ital Plasma Physics and Controlled Nuclear Fusion Research 1990} (Proc. 13th Int. Conf. Washington, DC, 1990), (International Atomic Energy Agency, Vienna, 1991), Vol. 2, p. 603] configurations are calculated using the Princeton Iterative Equilibrium Solver (PIES) [A. H. Reiman {ital et al.}, Comput. Phys. Commun., {bold 43}, 157 (1986)] to deal with magnetic islands and stochastic regions. Usually, these W7-X configurations require a large number of iterations for PIES convergence. Here, two methods have been successfully tested in an attempt to decrease the number of iterations neededmore » for convergence. First, periodic sequences of different blending parameters are used. Second, the initial guess is vastly improved by using results of the Variational Moments Equilibrium Code (VMEC) [S. P. Hirshmann {ital et al.}, Phys. Fluids {bold 26}, 3553 (1983)]. Use of these two methods have allowed verification of the Hamada condition and tendency of {open_quotes}self-healing{close_quotes} of islands has been observed. {copyright} {ital 1999 American Institute of Physics.}« less

Stability analysis of an autocatalytic protein model

NASA Astrophysics Data System (ADS)

Lee, Julian

2016-05-01

A self-regulatory genetic circuit, where a protein acts as a positive regulator of its own production, is known to be the simplest biological network with a positive feedback loop. Although at least three components—DNA, RNA, and the protein—are required to form such a circuit, stability analysis of the fixed points of this self-regulatory circuit has been performed only after reducing the system to a two-component system, either by assuming a fast equilibration of the DNA component or by removing the RNA component. Here, stability of the fixed points of the three-component positive feedback loop is analyzed by obtaining eigenvalues of the full three-dimensional Hessian matrix. In addition to rigorously identifying the stable fixed points and saddle points, detailed information about the system can be obtained, such as the existence of complex eigenvalues near a fixed point.

Fixed-point theorems for families of weakly non-expansive maps

NASA Astrophysics Data System (ADS)

Mai, Jie-Hua; Liu, Xin-He

2007-10-01

In this paper, we present some fixed-point theorems for families of weakly non-expansive maps under some relatively weaker and more general conditions. Our results generalize and improve several results due to Jungck [G. Jungck, Fixed points via a generalized local commutativity, Int. J. Math. Math. Sci. 25 (8) (2001) 497-507], Jachymski [J. Jachymski, A generalization of the theorem by Rhoades and Watson for contractive type mappings, Math. Japon. 38 (6) (1993) 1095-1102], Guo [C. Guo, An extension of fixed point theorem of Krasnoselski, Chinese J. Math. (P.O.C.) 21 (1) (1993) 13-20], Rhoades [B.E. Rhoades, A comparison of various definitions of contractive mappings, Trans. Amer. Math. Soc. 226 (1977) 257-290], and others.

Common Coupled Fixed Point Theorems for Two Hybrid Pairs of Mappings under φ-ψ Contraction

PubMed Central

Handa, Amrish

2014-01-01

We introduce the concept of (EA) property and occasional w-compatibility for hybrid pair F : X × X → 2X and f : X → X. We also introduce common (EA) property for two hybrid pairs F, G : X → 2X and f, g : X → X. We establish some common coupled fixed point theorems for two hybrid pairs of mappings under φ-ψ contraction on noncomplete metric spaces. An example is also given to validate our results. We improve, extend and generalize several known results. The results of this paper generalize the common fixed point theorems for hybrid pairs of mappings and essentially contain fixed point theorems for hybrid pair of mappings. PMID:27340688

Trivial dynamics in discrete-time systems: carrying simplex and translation arcs

NASA Astrophysics Data System (ADS)

Niu, Lei; Ruiz-Herrera, Alfonso

2018-06-01

In this paper we show that the dynamical behavior in (first octant) of the classical Kolmogorov systems of competitive type admitting a carrying simplex can be sometimes determined completely by the number of fixed points on the boundary and the local behavior around them. Roughly speaking, T has trivial dynamics (i.e. the omega limit set of any orbit is a connected set contained in the set of fixed points) provided T has exactly four hyperbolic nontrivial fixed points in with local attractors on the carrying simplex and local repellers on the carrying simplex; and there exists a unique hyperbolic fixed point in Int. Our results are applied to some classical models including the Leslie–Gower models, Atkinson-Allen systems and Ricker maps.

47 CFR 101.101 - Frequency availability.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE... Television Relay Service—(Part 78) CC: Common Carrier Fixed Point-to-Point Microwave Service—(Part 101...-Point Microwave Service—(Part 101, Subparts C & H) PCS: Personal Communications Service—(Part 24) PET...

Newton's method: A link between continuous and discrete solutions of nonlinear problems

NASA Technical Reports Server (NTRS)

Thurston, G. A.

1980-01-01

Newton's method for nonlinear mechanics problems replaces the governing nonlinear equations by an iterative sequence of linear equations. When the linear equations are linear differential equations, the equations are usually solved by numerical methods. The iterative sequence in Newton's method can exhibit poor convergence properties when the nonlinear problem has multiple solutions for a fixed set of parameters, unless the iterative sequences are aimed at solving for each solution separately. The theory of the linear differential operators is often a better guide for solution strategies in applying Newton's method than the theory of linear algebra associated with the numerical analogs of the differential operators. In fact, the theory for the differential operators can suggest the choice of numerical linear operators. In this paper the method of variation of parameters from the theory of linear ordinary differential equations is examined in detail in the context of Newton's method to demonstrate how it might be used as a guide for numerical solutions.

Nonlinear Network Description for Many-Body Quantum Systems in Continuous Space

NASA Astrophysics Data System (ADS)

Ruggeri, Michele; Moroni, Saverio; Holzmann, Markus

2018-05-01

We show that the recently introduced iterative backflow wave function can be interpreted as a general neural network in continuum space with nonlinear functions in the hidden units. Using this wave function in variational Monte Carlo simulations of liquid 4He in two and three dimensions, we typically find a tenfold increase in accuracy over currently used wave functions. Furthermore, subsequent stages of the iteration procedure define a set of increasingly good wave functions, each with its own variational energy and variance of the local energy: extrapolation to zero variance gives energies in close agreement with the exact values. For two dimensional 4He, we also show that the iterative backflow wave function can describe both the liquid and the solid phase with the same functional form—a feature shared with the shadow wave function, but now joined by much higher accuracy. We also achieve significant progress for liquid 3He in three dimensions, improving previous variational and fixed-node energies.

Fast projection/backprojection and incremental methods applied to synchrotron light tomographic reconstruction.

PubMed

de Lima, Camila; Salomão Helou, Elias

2018-01-01

Iterative methods for tomographic image reconstruction have the computational cost of each iteration dominated by the computation of the (back)projection operator, which take roughly O(N 3 ) floating point operations (flops) for N × N pixels images. Furthermore, classical iterative algorithms may take too many iterations in order to achieve acceptable images, thereby making the use of these techniques unpractical for high-resolution images. Techniques have been developed in the literature in order to reduce the computational cost of the (back)projection operator to O(N 2 logN) flops. Also, incremental algorithms have been devised that reduce by an order of magnitude the number of iterations required to achieve acceptable images. The present paper introduces an incremental algorithm with a cost of O(N 2 logN) flops per iteration and applies it to the reconstruction of very large tomographic images obtained from synchrotron light illuminated data.

Iterative algorithms for computing the feedback Nash equilibrium point for positive systems

NASA Astrophysics Data System (ADS)

Ivanov, I.; Imsland, Lars; Bogdanova, B.

2017-03-01

The paper studies N-player linear quadratic differential games on an infinite time horizon with deterministic feedback information structure. It introduces two iterative methods (the Newton method as well as its accelerated modification) in order to compute the stabilising solution of a set of generalised algebraic Riccati equations. The latter is related to the Nash equilibrium point of the considered game model. Moreover, we derive the sufficient conditions for convergence of the proposed methods. Finally, we discuss two numerical examples so as to illustrate the performance of both of the algorithms.

Evolution of extortion in Iterated Prisoner's Dilemma games.

PubMed

Hilbe, Christian; Nowak, Martin A; Sigmund, Karl

2013-04-23

Iterated games are a fundamental component of economic and evolutionary game theory. They describe situations where two players interact repeatedly and have the ability to use conditional strategies that depend on the outcome of previous interactions, thus allowing for reciprocation. Recently, a new class of strategies has been proposed, so-called "zero-determinant" strategies. These strategies enforce a fixed linear relationship between one's own payoff and that of the other player. A subset of those strategies allows "extortioners" to ensure that any increase in one player's own payoff exceeds that of the other player by a fixed percentage. Here, we analyze the evolutionary performance of this new class of strategies. We show that in reasonably large populations, they can act as catalysts for the evolution of cooperation, similar to tit-for-tat, but that they are not the stable outcome of natural selection. In very small populations, however, extortioners hold their ground. Extortion strategies do particularly well in coevolutionary arms races between two distinct populations. Significantly, they benefit the population that evolves at the slower rate, an example of the so-called "Red King" effect. This may affect the evolution of interactions between host species and their endosymbionts.

Evolution of extortion in Iterated Prisoner’s Dilemma games

PubMed Central

Hilbe, Christian; Nowak, Martin A.; Sigmund, Karl

2013-01-01

Iterated games are a fundamental component of economic and evolutionary game theory. They describe situations where two players interact repeatedly and have the ability to use conditional strategies that depend on the outcome of previous interactions, thus allowing for reciprocation. Recently, a new class of strategies has been proposed, so-called “zero-determinant” strategies. These strategies enforce a fixed linear relationship between one’s own payoff and that of the other player. A subset of those strategies allows “extortioners” to ensure that any increase in one player’s own payoff exceeds that of the other player by a fixed percentage. Here, we analyze the evolutionary performance of this new class of strategies. We show that in reasonably large populations, they can act as catalysts for the evolution of cooperation, similar to tit-for-tat, but that they are not the stable outcome of natural selection. In very small populations, however, extortioners hold their ground. Extortion strategies do particularly well in coevolutionary arms races between two distinct populations. Significantly, they benefit the population that evolves at the slower rate, an example of the so-called “Red King” effect. This may affect the evolution of interactions between host species and their endosymbionts. PMID:23572576

Liquidus slopes of impurities in ITS-90 fixed points from the mercury point to the copper point in the low concentration limit

NASA Astrophysics Data System (ADS)

Pearce, Jonathan V.; Gisby, John A.; Steur, Peter P. M.

2016-08-01

A knowledge of the effect of impurities at the level of parts per million on the freezing temperature of very pure metals is essential for realisation of ITS-90 fixed points. New information has become available for use with the thermodynamic modelling software MTDATA, permitting calculation of liquidus slopes, in the low concentration limit, of a wider range of binary alloy systems than was previously possible. In total, calculated values for 536 binary systems are given. In addition, new experimental determinations of phase diagrams, in the low impurity concentration limit, have recently appeared. All available data have been combined to provide a comprehensive set of liquidus slopes for impurities in ITS-90 metal fixed points. In total, liquidus slopes for 838 systems are tabulated for the fixed points Hg, Ga, In, Sn, Zn, Al, Ag, Au, and Cu. It is shown that the value of the liquidus slope as a function of impurity element atomic number can be approximated using a simple formula, and good qualitative agreement with the existing data is observed for the fixed points Al, Ag, Au and Cu, but curiously the formula is not applicable to the fixed points Hg, Ga, In, Sn, and Zn. Some discussion is made concerning the influence of oxygen on the liquidus slopes, and some calculations using MTDATA are discussed. The BIPM’s consultative committee for thermometry has long recognised that the sum of individual estimates method is the ideal approach for assessing uncertainties due to impurities, but the community has been largely powerless to use the model due to lack of data. Here, not only is data provided, but a simple model is given to enable known thermophysical data to be used directly to estimate impurity effects for a large fraction of the ITS-90 fixed points.

47 CFR 101.107 - Frequency tolerance.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE...-point microwave and stations providing MVDDS. 5 For private operational fixed point-to-point microwave... noted in the table of paragraph (a) of this section. (b) Heterodyne microwave radio systems may be...

47 CFR 101.107 - Frequency tolerance.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE...-point microwave and stations providing MVDDS. 5 For private operational fixed point-to-point microwave... noted in the table of paragraph (a) of this section. (b) Heterodyne microwave radio systems may be...

47 CFR 101.107 - Frequency tolerance.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE...-point microwave and stations providing MVDDS. 5 For private operational fixed point-to-point microwave... noted in the table of paragraph (a) of this section. (b) Heterodyne microwave radio systems may be...

Renorming c0 and closed, bounded, convex sets with fixed point property for affine nonexpansive mappings

NASA Astrophysics Data System (ADS)

Nezir, Veysel; Mustafa, Nizami

2017-04-01

In 2008, P.K. Lin provided the first example of a nonreflexive space that can be renormed to have fixed point property for nonexpansive mappings. This space was the Banach space of absolutely summable sequences l1 and researchers aim to generalize this to c0, Banach space of null sequences. Before P.K. Lin's intriguing result, in 1979, Goebel and Kuczumow showed that there is a large class of non-weak* compact closed, bounded, convex subsets of l1 with fixed point property for nonexpansive mappings. Then, P.K. Lin inspired by Goebel and Kuczumow's ideas to give his result. Similarly to P.K. Lin's study, Hernández-Linares worked on L1 and in his Ph.D. thesis, supervisored under Maria Japón, showed that L1 can be renormed to have fixed point property for affine nonexpansive mappings. Then, related questions for c0 have been considered by researchers. Recently, Nezir constructed several equivalent norms on c0 and showed that there are non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings. In this study, we construct a family of equivalent norms containing those developed by Nezir as well and show that there exists a large class of non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings.

Radiation pattern synthesis of planar antennas using the iterative sampling method

NASA Technical Reports Server (NTRS)

Stutzman, W. L.; Coffey, E. L.

1975-01-01

A synthesis method is presented for determining an excitation of an arbitrary (but fixed) planar source configuration. The desired radiation pattern is specified over all or part of the visible region. It may have multiple and/or shaped main beams with low sidelobes. The iterative sampling method is used to find an excitation of the source which yields a radiation pattern that approximates the desired pattern to within a specified tolerance. In this paper the method is used to calculate excitations for line sources, linear arrays (equally and unequally spaced), rectangular apertures, rectangular arrays (arbitrary spacing grid), and circular apertures. Examples using these sources to form patterns with shaped main beams, multiple main beams, shaped sidelobe levels, and combinations thereof are given.

Matching pursuit parallel decomposition of seismic data

NASA Astrophysics Data System (ADS)

Li, Chuanhui; Zhang, Fanchang

2017-07-01

In order to improve the computation speed of matching pursuit decomposition of seismic data, a matching pursuit parallel algorithm is designed in this paper. We pick a fixed number of envelope peaks from the current signal in every iteration according to the number of compute nodes and assign them to the compute nodes on average to search the optimal Morlet wavelets in parallel. With the help of parallel computer systems and Message Passing Interface, the parallel algorithm gives full play to the advantages of parallel computing to significantly improve the computation speed of the matching pursuit decomposition and also has good expandability. Besides, searching only one optimal Morlet wavelet by every compute node in every iteration is the most efficient implementation.

Analyzing survival curves at a fixed point in time for paired and clustered right-censored data

PubMed Central

Su, Pei-Fang; Chi, Yunchan; Lee, Chun-Yi; Shyr, Yu; Liao, Yi-De

2018-01-01

In clinical trials, information about certain time points may be of interest in making decisions about treatment effectiveness. Rather than comparing entire survival curves, researchers can focus on the comparison at fixed time points that may have a clinical utility for patients. For two independent samples of right-censored data, Klein et al. (2007) compared survival probabilities at a fixed time point by studying a number of tests based on some transformations of the Kaplan-Meier estimators of the survival function. However, to compare the survival probabilities at a fixed time point for paired right-censored data or clustered right-censored data, their approach would need to be modified. In this paper, we extend the statistics to accommodate the possible within-paired correlation and within-clustered correlation, respectively. We use simulation studies to present comparative results. Finally, we illustrate the implementation of these methods using two real data sets. PMID:29456280

APMP Scale Comparison with Three Radiation Thermometers and Six Fixed-Point Blackbodies

NASA Astrophysics Data System (ADS)

Yamada, Y.; Shimizu, Y.; Ishii, J.

2015-08-01

New Asia Pacific Metrology Programme (APMP) comparisons of radiation thermometry standards, APMP TS-11, and -12, have recently been initiated. These new APMP comparisons cover the temperature range from to . Three radiation thermometers with central wavelengths of 1.6 , 0.9 , and 0.65 are the transfer devices for the radiation thermometer scale comparison conducted in the so-called star configuration. In parallel, a compact fixed-point blackbody furnace that houses six types of fixed-point cells of In, Sn, Zn, Al, Ag, and Cu is circulated, again in a star-type comparison, to substantiate fixed-point calibration capabilities. Twelve APMP national metrology institutes are taking part in this endeavor, in which the National Metrology Institute of Japan acts as the pilot. In this article, the comparison scheme is described with emphasis on the features of the transfer devices, i.e., the radiation thermometers and the fixed-point blackbodies. Results of preliminary evaluations of the performance and characteristic of these instruments as well as the evaluation method of the comparison results are presented.

Long-Term Stability of WC-C Peritectic Fixed Point

NASA Astrophysics Data System (ADS)

Khlevnoy, B. B.; Grigoryeva, I. A.

2015-03-01

The tungsten carbide-carbon peritectic (WC-C) melting transition is an attractive high-temperature fixed point with a temperature of . Earlier investigations showed high repeatability, small melting range, low sensitivity to impurities, and robustness of WC-C that makes it a prospective candidate for the highest fixed point of the temperature scale. This paper presents further study of the fixed point, namely the investigation of the long-term stability of the WC-C melting temperature. For this purpose, a new WC-C cell of the blackbody type was built using tungsten powder of 99.999 % purity. The stability of the cell was investigated during the cell aging for 50 h at the cell working temperature that tooks 140 melting/freezing cycles. The method of investigation was based on the comparison of the WC-C tested cell with a reference Re-C fixed-point cell that reduces an influence of the probable instability of a radiation thermometer. It was shown that after the aging period, the deviation of the WC-C cell melting temperature was with an uncertainty of.

Renormalization group fixed points of foliated gravity-matter systems

NASA Astrophysics Data System (ADS)

Biemans, Jorn; Platania, Alessia; Saueressig, Frank

2017-05-01

We employ the Arnowitt-Deser-Misner formalism to study the renormalization group flow of gravity minimally coupled to an arbitrary number of scalar, vector, and Dirac fields. The decomposition of the gravitational degrees of freedom into a lapse function, shift vector, and spatial metric equips spacetime with a preferred (Euclidean) "time"- direction. In this work, we provide a detailed derivation of the renormalization group flow of Newton's constant and the cosmological constant on a flat Friedmann-Robertson-Walker background. Adding matter fields, it is shown that their contribution to the flow is the same as in the covariant formulation and can be captured by two parameters d g d λ . We classify the resulting fixed point structure as a function of these parameters finding that the existence of non-Gaussian renormalization group fixed points is rather generic. In particular the matter content of the standard model and its most common extensions gives rise to one non-Gaussian fixed point with real critical exponents suitable for Asymptotic Safety. Moreover, we find non-Gaussian fixed points for any number of scalar matter fields, making the scenario attractive for cosmological model building.

47 CFR 101.133 - Limitations on use of transmitters.

Code of Federal Regulations, 2011 CFR

2011-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.133 Limitations on use of transmitters. (a...) Private operational fixed point-to-point microwave stations authorized in this service may communicate...-point microwave licenses may use the same transmitting equipment under the following terms and...

47 CFR 101.133 - Limitations on use of transmitters.

Code of Federal Regulations, 2013 CFR

2013-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.133 Limitations on use of transmitters. (a...) Private operational fixed point-to-point microwave stations authorized in this service may communicate...-point microwave licenses may use the same transmitting equipment under the following terms and...

47 CFR 101.133 - Limitations on use of transmitters.

Code of Federal Regulations, 2014 CFR

2014-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.133 Limitations on use of transmitters. (a...) Private operational fixed point-to-point microwave stations authorized in this service may communicate...-point microwave licenses may use the same transmitting equipment under the following terms and...

47 CFR 101.133 - Limitations on use of transmitters.

Code of Federal Regulations, 2012 CFR

2012-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.133 Limitations on use of transmitters. (a...) Private operational fixed point-to-point microwave stations authorized in this service may communicate...-point microwave licenses may use the same transmitting equipment under the following terms and...

47 CFR 101.133 - Limitations on use of transmitters.

Code of Federal Regulations, 2010 CFR

2010-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.133 Limitations on use of transmitters. (a...) Private operational fixed point-to-point microwave stations authorized in this service may communicate...-point microwave licenses may use the same transmitting equipment under the following terms and...

Side Effects in Time Discounting Procedures: Fixed Alternatives Become the Reference Point

PubMed Central

2016-01-01

Typical research on intertemporal choice utilizes a two-alternative forced choice (2AFC) paradigm requiring participants to choose between a smaller sooner and larger later payoff. In the adjusting-amount procedure (AAP) one of the alternatives is fixed and the other is adjusted according to particular choices made by the participant. Such a method makes the alternatives unequal in status and is speculated to make the fixed alternative a reference point for choices, thereby affecting the decision made. The current study shows that fixing different alternatives in the AAP influences discount rates in intertemporal choices. Specifically, individuals’ (N = 283) choices were affected to just the same extent by merely fixing an alternative as when choices were preceded by scenarios explicitly imposing reference points. PMID:27768759

Fixed-Rate Compressed Floating-Point Arrays.

PubMed

Lindstrom, Peter

2014-12-01

Current compression schemes for floating-point data commonly take fixed-precision values and compress them to a variable-length bit stream, complicating memory management and random access. We present a fixed-rate, near-lossless compression scheme that maps small blocks of 4(d) values in d dimensions to a fixed, user-specified number of bits per block, thereby allowing read and write random access to compressed floating-point data at block granularity. Our approach is inspired by fixed-rate texture compression methods widely adopted in graphics hardware, but has been tailored to the high dynamic range and precision demands of scientific applications. Our compressor is based on a new, lifted, orthogonal block transform and embedded coding, allowing each per-block bit stream to be truncated at any point if desired, thus facilitating bit rate selection using a single compression scheme. To avoid compression or decompression upon every data access, we employ a software write-back cache of uncompressed blocks. Our compressor has been designed with computational simplicity and speed in mind to allow for the possibility of a hardware implementation, and uses only a small number of fixed-point arithmetic operations per compressed value. We demonstrate the viability and benefits of lossy compression in several applications, including visualization, quantitative data analysis, and numerical simulation.

Solution of the effective Hamiltonian of impurity hopping between two sites in a metal

NASA Astrophysics Data System (ADS)

Ye, Jinwu

1997-07-01

We analyze in detail all the possible fixed points of the effective Hamiltonian of a nonmagnetic impurity hopping between two sites in a metal obtained by Moustakas and Fisher (MF). We find a line of non-Fermi liquid fixed points which continuously interpolates between the two-channel Kondo fixed point (2CK) and the one-channel, two-impurity Kondo (2IK) fixed point. There is one relevant direction with scaling dimension 12 and one leading irrelevant operator with dimension 32. There is also one marginal operator in the spin sector moving along this line. The marginal operator, combined with the leading irrelevant operator, will generate the relevant operator. For the general position on this line, the leading low-temperature exponents of the specific heat, the hopping susceptibility and the electron conductivity Cimp,χhimp,σ(T) are the same as those of the 2CK, but the finite-size spectrum depends on the position on the line. No universal ratios can be formed from the amplitudes of the three quantities except at the 2CK point on this line where the universal ratios can be formed. At the 2IK point on this line, σ(T)~2σu(1+aT3/2), no universal ratio can be formed either. The additional non-Fermi-liquid fixed point found by MF has the same symmetry as the 2IK, it has two relevant directions with scaling dimension 12, and is therefore also unstable. The leading low-temperature behaviors are Cimp~T,χhimp~lnT,σ(T)~2σu(1+aT3/2) no universal ratios can be formed. The system is shown to flow to a line of Fermi-liquid fixed points which continuously interpolates between the noninteracting fixed point and the two-channel spin-flavor Kondo fixed point discussed by the author previously. The effect of particle-hole symmetry breaking is discussed. The effective Hamiltonian in the external magnetic field is analyzed. The scaling functions for the physical measurable quantities are derived in the different regimes; their predictions for the experiments are given. Finally the implications are given for a nonmagnetic impurity hopping around three sites with triangular symmetry discussed by MF.

Infrared fixed point of SU(2) gauge theory with six flavors

NASA Astrophysics Data System (ADS)

Leino, Viljami; Rummukainen, Kari; Suorsa, Joni; Tuominen, Kimmo; Tähtinen, Sara

2018-06-01

We compute the running of the coupling in SU(2) gauge theory with six fermions in the fundamental representation of the gauge group. We find strong evidence that this theory has an infrared stable fixed point at strong coupling and measure also the anomalous dimension of the fermion mass operator at the fixed point. This theory therefore likely lies close to the boundary of the conformal window and will display novel infrared dynamics if coupled with the electroweak sector of the Standard Model.

A dynamical system approach to Bianchi III cosmology for Hu-Sawicki type f( R) gravity

NASA Astrophysics Data System (ADS)

Banik, Sebika Kangsha; Banik, Debika Kangsha; Bhuyan, Kalyan

2018-02-01

The cosmological dynamics of spatially homogeneous but anisotropic Bianchi type-III space-time is investigated in presence of a perfect fluid within the framework of Hu-Sawicki model. We use the dynamical system approach to perform a detailed analysis of the cosmological behaviour of this model for the model parameters n=1, c_1=1, determining all the fixed points, their stability and corresponding cosmological evolution. We have found stable fixed points with de Sitter solution along with unstable radiation like fixed points. We have identified a matter like point which act like an unstable spiral and when the initial conditions of a trajectory are very close to this point, it stabilizes at a stable accelerating point. Thus, in this model, the universe can naturally approach to a phase of accelerated expansion following a radiation or a matter dominated phase. It is also found that the isotropisation of this model is affected by the spatial curvature and that all the isotropic fixed points are found to be spatially flat.

Nonrigid iterative closest points for registration of 3D biomedical surfaces

NASA Astrophysics Data System (ADS)

Liang, Luming; Wei, Mingqiang; Szymczak, Andrzej; Petrella, Anthony; Xie, Haoran; Qin, Jing; Wang, Jun; Wang, Fu Lee

2018-01-01

Advanced 3D optical and laser scanners bring new challenges to computer graphics. We present a novel nonrigid surface registration algorithm based on Iterative Closest Point (ICP) method with multiple correspondences. Our method, called the Nonrigid Iterative Closest Points (NICPs), can be applied to surfaces of arbitrary topology. It does not impose any restrictions on the deformation, e.g. rigidity or articulation. Finally, it does not require parametrization of input meshes. Our method is based on an objective function that combines distance and regularization terms. Unlike the standard ICP, the distance term is determined based on multiple two-way correspondences rather than single one-way correspondences between surfaces. A Laplacian-based regularization term is proposed to take full advantage of multiple two-way correspondences. This term regularizes the surface movement by enforcing vertices to move coherently with their 1-ring neighbors. The proposed method achieves good performances when no global pose differences or significant amount of bending exists in the models, for example, families of similar shapes, like human femur and vertebrae models.

Study on the fixed point in crustal deformation before strong earthquake

NASA Astrophysics Data System (ADS)

Niu, A.; Li, Y.; Yan, W. Mr

2017-12-01

Usually, scholars believe that the fault pre-sliding or expansion phenomenon will be observed near epicenter area before strong earthquake, but more and more observations show that the crust deformation nearby epicenter area is smallest(Zhou, 1997; Niu,2009,2012;Bilham, 2005; Amoruso et al., 2010). The theory of Fixed point t is a branch of mathematics that arises from the theory of topological transformation and has important applications in obvious model analysis. An important precursory was observed by two tilt-meter sets, installed at Wenchuan Observatory in the epicenter area, that the tilt changes were the smallest compared with the other 8 stations around them in one year before the Wenchuan earthquake. To subscribe the phenomenon, we proposed the minimum annual variation range that used as a topological transformation. The window length is 1 year, and the sliding length is 1 day. The convergence of points with minimum annual change in the 3 years before the Wenchuan earthquake is studied. And the results show that the points with minimum deformation amplitude basically converge to the epicenter region before the earthquake. The possible mechanism of fixed point of crustal deformation was explored. Concerning the fixed point of crust deformation, the liquidity of lithospheric medium and the isostasy theory are accepted by many scholars (Bott &Dean, 1973; Merer et al.1988; Molnar et al., 1975,1978; Tapponnier et al., 1976; Wang et al., 2001). To explain the fixed point of crust deformation before earthquakes, we study the plate bending model (Bai, et al., 2003). According to plate bending model and real deformation data, we have found that the earthquake rupture occurred around the extreme point of plate bending, where the velocities of displacement, tilt, strain, gravity and so on are close to zero, and the fixed points are located around the epicenter.The phenomenon of fixed point of crust deformation is different from former understandings about the earthquake rupture precursor. 1) The observations for crust deformation in natural conditions are different with dry and static experiments, and the former had the meaning of stress wave.2)The earthquake rupture has a special triggering mechanism that is different from the experiment with limited scale rock fracture.

Calibration and Data Analysis of the MC-130 Air Balance

NASA Technical Reports Server (NTRS)

Booth, Dennis; Ulbrich, N.

2012-01-01

Design, calibration, calibration analysis, and intended use of the MC-130 air balance are discussed. The MC-130 balance is an 8.0 inch diameter force balance that has two separate internal air flow systems and one external bellows system. The manual calibration of the balance consisted of a total of 1854 data points with both unpressurized and pressurized air flowing through the balance. A subset of 1160 data points was chosen for the calibration data analysis. The regression analysis of the subset was performed using two fundamentally different analysis approaches. First, the data analysis was performed using a recently developed extension of the Iterative Method. This approach fits gage outputs as a function of both applied balance loads and bellows pressures while still allowing the application of the iteration scheme that is used with the Iterative Method. Then, for comparison, the axial force was also analyzed using the Non-Iterative Method. This alternate approach directly fits loads as a function of measured gage outputs and bellows pressures and does not require a load iteration. The regression models used by both the extended Iterative and Non-Iterative Method were constructed such that they met a set of widely accepted statistical quality requirements. These requirements lead to reliable regression models and prevent overfitting of data because they ensure that no hidden near-linear dependencies between regression model terms exist and that only statistically significant terms are included. Finally, a comparison of the axial force residuals was performed. Overall, axial force estimates obtained from both methods show excellent agreement as the differences of the standard deviation of the axial force residuals are on the order of 0.001 % of the axial force capacity.

Optimized Dose Distribution of Gammamed Plus Vaginal Cylinders

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

Supe, Sanjay S.; Bijina, T.K.; Varatharaj, C.

2009-04-01

Endometrial carcinoma is the most common malignancy arising in the female genital tract. Intracavitary vaginal cuff irradiation may be given alone or with external beam irradiation in patients determined to be at risk for locoregional recurrence. Vaginal cylinders are often used to deliver a brachytherapy dose to the vaginal apex and upper vagina or the entire vaginal surface in the management of postoperative endometrial cancer or cervical cancer. The dose distributions of HDR vaginal cylinders must be evaluated carefully, so that clinical experiences with LDR techniques can be used in guiding optimal use of HDR techniques. The aim of thismore » study was to optimize dose distribution for Gammamed plus vaginal cylinders. Placement of dose optimization points was evaluated for its effect on optimized dose distributions. Two different dose optimization point models were used in this study, namely non-apex (dose optimization points only on periphery of cylinder) and apex (dose optimization points on periphery and along the curvature including the apex points). Thirteen dwell positions were used for the HDR dosimetry to obtain a 6-cm active length. Thus 13 optimization points were available at the periphery of the cylinder. The coordinates of the points along the curvature depended on the cylinder diameters and were chosen for each cylinder so that four points were distributed evenly in the curvature portion of the cylinder. Diameter of vaginal cylinders varied from 2.0 to 4.0 cm. Iterative optimization routine was utilized for all optimizations. The effects of various optimization routines (iterative, geometric, equal times) was studied for the 3.0-cm diameter vaginal cylinder. The effect of source travel step size on the optimized dose distributions for vaginal cylinders was also evaluated. All optimizations in this study were carried for dose of 6 Gy at dose optimization points. For both non-apex and apex models of vaginal cylinders, doses for apex point and three dome points were higher for the apex model compared with the non-apex model. Mean doses to the optimization points for both the cylinder models and all the cylinder diameters were 6 Gy, matching with the prescription dose of 6 Gy. Iterative optimization routine resulted in the highest dose to apex point and dome points. The mean dose for optimization point was 6.01 Gy for iterative optimization and was much higher than 5.74 Gy for geometric and equal times routines. Step size of 1 cm gave the highest dose to the apex point. This step size was superior in terms of mean dose to optimization points. Selection of dose optimization points for the derivation of optimized dose distributions for vaginal cylinders affects the dose distributions.« less

Improvements in the realization of the ITS-90 over the temperature range from the melting point of gallium to the freezing point of silver at NIM

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

Sun, J.; Zhang, J. T.; Ping, Q.

2013-09-11

The temperature primary standard over the range from the melting point of gallium to the freezing point of silver in National institute of Metrology (NIM), China, was established in the early 1990s. The performance of all of fixed-point furnaces degraded and needs to be updated due to many years of use. Nowadays, the satisfactory fixed point materials can be available with the development of the modern purification techniques. NIM plans to use a group of three cells for each defining fixed point temperature. In this way the eventual drift of individual cells can be evidenced by periodic intercomparison and thismore » will increase the reliability in disseminating the ITS-90 in China. This article describes the recent improvements in realization of ITS-90 over temperature range from the melting point of gallium to the freezing point of silver at NIM. Taking advantages of the technological advances in the design and manufacture of furnaces, the new three-zone furnaces and the open-type fixed points were developed from the freezing point of indium to the freezing point of silver, and a furnace with the three-zone semiconductor cooling was designed to automatically realize the melting point of gallium. The reproducibility of the new melting point of gallium and the new open-type freezing points of In, Sn, Zn. Al and Ag is improved, especially the freezing points of Al and Ag with the reproducibility of 0.2mK and 0.5mK respectively. The expanded uncertainty in the realization of these defining fixed point temperatures is 0.34mK, 0.44mK, 0.54mK, 0.60mK, 1.30mK and 1.88mK respectively.« less

A Spaceborne Synthetic Aperture Radar Partial Fixed-Point Imaging System Using a Field- Programmable Gate Array—Application-Specific Integrated Circuit Hybrid Heterogeneous Parallel Acceleration Technique

PubMed Central

Li, Bingyi; Chen, Liang; Wei, Chunpeng; Xie, Yizhuang; Chen, He; Yu, Wenyue

2017-01-01

With the development of satellite load technology and very large scale integrated (VLSI) circuit technology, onboard real-time synthetic aperture radar (SAR) imaging systems have become a solution for allowing rapid response to disasters. A key goal of the onboard SAR imaging system design is to achieve high real-time processing performance with severe size, weight, and power consumption constraints. In this paper, we analyse the computational burden of the commonly used chirp scaling (CS) SAR imaging algorithm. To reduce the system hardware cost, we propose a partial fixed-point processing scheme. The fast Fourier transform (FFT), which is the most computation-sensitive operation in the CS algorithm, is processed with fixed-point, while other operations are processed with single precision floating-point. With the proposed fixed-point processing error propagation model, the fixed-point processing word length is determined. The fidelity and accuracy relative to conventional ground-based software processors is verified by evaluating both the point target imaging quality and the actual scene imaging quality. As a proof of concept, a field- programmable gate array—application-specific integrated circuit (FPGA-ASIC) hybrid heterogeneous parallel accelerating architecture is designed and realized. The customized fixed-point FFT is implemented using the 130 nm complementary metal oxide semiconductor (CMOS) technology as a co-processor of the Xilinx xc6vlx760t FPGA. A single processing board requires 12 s and consumes 21 W to focus a 50-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384. PMID:28672813

A Spaceborne Synthetic Aperture Radar Partial Fixed-Point Imaging System Using a Field- Programmable Gate Array-Application-Specific Integrated Circuit Hybrid Heterogeneous Parallel Acceleration Technique.

PubMed

Yang, Chen; Li, Bingyi; Chen, Liang; Wei, Chunpeng; Xie, Yizhuang; Chen, He; Yu, Wenyue

2017-06-24

With the development of satellite load technology and very large scale integrated (VLSI) circuit technology, onboard real-time synthetic aperture radar (SAR) imaging systems have become a solution for allowing rapid response to disasters. A key goal of the onboard SAR imaging system design is to achieve high real-time processing performance with severe size, weight, and power consumption constraints. In this paper, we analyse the computational burden of the commonly used chirp scaling (CS) SAR imaging algorithm. To reduce the system hardware cost, we propose a partial fixed-point processing scheme. The fast Fourier transform (FFT), which is the most computation-sensitive operation in the CS algorithm, is processed with fixed-point, while other operations are processed with single precision floating-point. With the proposed fixed-point processing error propagation model, the fixed-point processing word length is determined. The fidelity and accuracy relative to conventional ground-based software processors is verified by evaluating both the point target imaging quality and the actual scene imaging quality. As a proof of concept, a field- programmable gate array-application-specific integrated circuit (FPGA-ASIC) hybrid heterogeneous parallel accelerating architecture is designed and realized. The customized fixed-point FFT is implemented using the 130 nm complementary metal oxide semiconductor (CMOS) technology as a co-processor of the Xilinx xc6vlx760t FPGA. A single processing board requires 12 s and consumes 21 W to focus a 50-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384.

Non-equilibrium price theories

NASA Astrophysics Data System (ADS)

Helbing, Dirk; Kern, Daniel

2000-11-01

We propose two theories for the formation of stock prices under the condition that the number of available stocks is fixed. Both theories consider the balance equations for cash and several kinds of stocks. They also take into account interest rates, dividends, and transaction costs. The proposed theories have the advantage that they do not require iterative procedures to determine the price, which would be inefficient for simulations with many agents.

Simultaneous digital super-resolution and nonuniformity correction for infrared imaging systems.

PubMed

Meza, Pablo; Machuca, Guillermo; Torres, Sergio; Martin, Cesar San; Vera, Esteban

2015-07-20

In this article, we present a novel algorithm to achieve simultaneous digital super-resolution and nonuniformity correction from a sequence of infrared images. We propose to use spatial regularization terms that exploit nonlocal means and the absence of spatial correlation between the scene and the nonuniformity noise sources. We derive an iterative optimization algorithm based on a gradient descent minimization strategy. Results from infrared image sequences corrupted with simulated and real fixed-pattern noise show a competitive performance compared with state-of-the-art methods. A qualitative analysis on the experimental results obtained with images from a variety of infrared cameras indicates that the proposed method provides super-resolution images with significantly less fixed-pattern noise.

Salient Point Detection in Protrusion Parts of 3D Object Robust to Isometric Variations

NASA Astrophysics Data System (ADS)

Mirloo, Mahsa; Ebrahimnezhad, Hosein

2018-03-01

In this paper, a novel method is proposed to detect 3D object salient points robust to isometric variations and stable against scaling and noise. Salient points can be used as the representative points from object protrusion parts in order to improve the object matching and retrieval algorithms. The proposed algorithm is started by determining the first salient point of the model based on the average geodesic distance of several random points. Then, according to the previous salient point, a new point is added to this set of points in each iteration. By adding every salient point, decision function is updated. Hence, a condition is created for selecting the next point in which the iterative point is not extracted from the same protrusion part so that drawing out of a representative point from every protrusion part is guaranteed. This method is stable against model variations with isometric transformations, scaling, and noise with different levels of strength due to using a feature robust to isometric variations and considering the relation between the salient points. In addition, the number of points used in averaging process is decreased in this method, which leads to lower computational complexity in comparison with the other salient point detection algorithms.

Improved evaluation of optical depth components from Langley plot data

NASA Technical Reports Server (NTRS)

Biggar, S. F.; Gellman, D. I.; Slater, P. N.

1990-01-01

A simple, iterative procedure to determine the optical depth components of the extinction optical depth measured by a solar radiometer is presented. Simulated data show that the iterative procedure improves the determination of the exponent of a Junge law particle size distribution. The determination of the optical depth due to aerosol scattering is improved as compared to a method which uses only two points from the extinction data. The iterative method was used to determine spectral optical depth components for June 11-13, 1988 during the MAC III experiment.

A general CPL-AdS methodology for fixing dynamic parameters in dual environments.

PubMed

Huang, De-Shuang; Jiang, Wen

2012-10-01

The algorithm of Continuous Point Location with Adaptive d-ary Search (CPL-AdS) strategy exhibits its efficiency in solving stochastic point location (SPL) problems. However, there is one bottleneck for this CPL-AdS strategy which is that, when the dimension of the feature, or the number of divided subintervals for each iteration, d is large, the decision table for elimination process is almost unavailable. On the other hand, the larger dimension of the features d can generally make this CPL-AdS strategy avoid oscillation and converge faster. This paper presents a generalized universal decision formula to solve this bottleneck problem. As a matter of fact, this decision formula has a wider usage beyond handling out this SPL problems, such as dealing with deterministic point location problems and searching data in Single Instruction Stream-Multiple Data Stream based on Concurrent Read and Exclusive Write parallel computer model. Meanwhile, we generalized the CPL-AdS strategy with an extending formula, which is capable of tracking an unknown dynamic parameter λ in both informative and deceptive environments. Furthermore, we employed different learning automata in the generalized CPL-AdS method to find out if faster learning algorithm will lead to better realization of the generalized CPL-AdS method. All of these aforementioned contributions are vitally important whether in theory or in practical applications. Finally, extensive experiments show that our proposed approaches are efficient and feasible.

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2011 CFR

2011-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2012 CFR

2012-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2014 CFR

2014-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2013 CFR

2013-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

Fixed point theorems for generalized contractions in ordered metric spaces

NASA Astrophysics Data System (ADS)

O'Regan, Donal; Petrusel, Adrian

2008-05-01

The purpose of this paper is to present some fixed point results for self-generalized contractions in ordered metric spaces. Our results generalize and extend some recent results of A.C.M. Ran, M.C. Reurings [A.C.M. Ran, MEC. Reurings, A fixed point theorem in partially ordered sets and some applications to matrix equations, Proc. Amer. Math. Soc. 132 (2004) 1435-1443], J.J. Nieto, R. Rodríguez-López [J.J. Nieto, R. Rodríguez-López, Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations, Order 22 (2005) 223-239; J.J. Nieto, R. Rodríguez-López, Existence and uniqueness of fixed points in partially ordered sets and applications to ordinary differential equations, Acta Math. Sin. (Engl. Ser.) 23 (2007) 2205-2212], J.J. Nieto, R.L. Pouso, R. Rodríguez-López [J.J. Nieto, R.L. Pouso, R. Rodríguez-López, Fixed point theorem theorems in ordered abstract sets, Proc. Amer. Math. Soc. 135 (2007) 2505-2517], A. Petrusel, I.A. Rus [A. Petrusel, I.A. Rus, Fixed point theorems in ordered L-spaces, Proc. Amer. Math. Soc. 134 (2006) 411-418] and R.P. Agarwal, M.A. El-Gebeily, D. O'Regan [R.P. Agarwal, M.A. El-Gebeily, D. O'Regan, Generalized contractions in partially ordered metric spaces, Appl. Anal., in press]. As applications, existence and uniqueness results for Fredholm and Volterra type integral equations are given.

A modified two-layer iteration via a boundary point approach to generalized multivalued pseudomonotone mixed variational inequalities.

PubMed

Saddeek, Ali Mohamed

2017-01-01

Most mathematical models arising in stationary filtration processes as well as in the theory of soft shells can be described by single-valued or generalized multivalued pseudomonotone mixed variational inequalities with proper convex nondifferentiable functionals. Therefore, for finding the minimum norm solution of such inequalities, the current paper attempts to introduce a modified two-layer iteration via a boundary point approach and to prove its strong convergence. The results here improve and extend the corresponding recent results announced by Badriev, Zadvornov and Saddeek (Differ. Equ. 37:934-942, 2001).

A minimization method on the basis of embedding the feasible set and the epigraph

NASA Astrophysics Data System (ADS)

Zabotin, I. Ya; Shulgina, O. N.; Yarullin, R. S.

2016-11-01

We propose a conditional minimization method of the convex nonsmooth function which belongs to the class of cutting-plane methods. During constructing iteration points a feasible set and an epigraph of the objective function are approximated by the polyhedral sets. In this connection, auxiliary problems of constructing iteration points are linear programming problems. In optimization process there is some opportunity of updating sets which approximate the epigraph. These updates are performed by periodically dropping of cutting planes which form embedding sets. Convergence of the proposed method is proved, some realizations of the method are discussed.

Registering myocardial fiber orientations with heart geometry using iterative closest points algorithms

NASA Astrophysics Data System (ADS)

Deng, Dongdong; Jiao, Peifeng; Shou, Guofa; Xia, Ling

2009-10-01

Myocardial electrical excitation propagation is anisotropic, with the most rapid spread of current along the direction of the long axis of the fiber. Fiber orientation is also an important determinant of myocardial mechanics. So myocardial fiber orientations are very important to heart modeling and simulation. Accurately construction of myocardial fiber orientations, however, is still a challenge. The purpose of this paper is to construct a heart geometrical model with myocardial fiber orientations based on CT and 3D laser scanned pictures. The iterative closest points (ICP) algorithms were used to register the fiber orientations with the heart geometry.

Convergence of Newton's method for a single real equation

NASA Technical Reports Server (NTRS)

Campbell, C. W.

1985-01-01

Newton's method for finding the zeroes of a single real function is investigated in some detail. Convergence is generally checked using the Contraction Mapping Theorem which yields sufficient but not necessary conditions for convergence of the general single point iteration method. The resulting convergence intervals are frequently considerably smaller than actual convergence zones. For a specific single point iteration method, such as Newton's method, better estimates of regions of convergence should be possible. A technique is described which, under certain conditions (frequently satisfied by well behaved functions) gives much larger zones where convergence is guaranteed.

User-centered design and evaluation of a next generation fixed-split ergonomic keyboard.

PubMed

McLoone, Hugh E; Jacobson, Melissa; Hegg, Chau; Johnson, Peter W

2010-01-01

Research has shown that fixed-split, ergonomic keyboards lessen the pain and functional status in symptomatic individuals as well as reduce the likelihood of developing musculoskeletal disorders in asymptomatic typists over extended use. The goal of this study was to evaluate design features to determine whether the current fixed-split ergonomic keyboard design could be improved. Thirty-nine, adult-aged, fixed-split ergonomic keyboard users were recruited to participate in one of three studies. First utilizing non-functional models and later a functional prototype, three studies evaluated keyboard design features including: 1) keyboard lateral inclination, 2) wrist rest height, 3) keyboard slope, and 4) curved "gull-wing" key layouts. The findings indicated that keyboard lateral inclination could be increased from 8° to 14°; wrist rest height could be increased up to 10 mm from current setting; positive, flat, and negative slope settings were equally preferred and facilitated greater postural variation; and participants preferred a new gull-wing key layout. The design changes reduced forearm pronation and wrist extension while not adversely affecting typing performance. This research demonstrated how iterative-evaluative, user-centered research methods can be utilized to improve a product's design such as a fixed-split ergonomic keyboard.

Iterative approach as alternative to S-matrix in modal methods

NASA Astrophysics Data System (ADS)

Semenikhin, Igor; Zanuccoli, Mauro

2014-12-01

The continuously increasing complexity of opto-electronic devices and the rising demands of simulation accuracy lead to the need of solving very large systems of linear equations making iterative methods promising and attractive from the computational point of view with respect to direct methods. In particular, iterative approach potentially enables the reduction of required computational time to solve Maxwell's equations by Eigenmode Expansion algorithms. Regardless of the particular eigenmodes finding method used, the expansion coefficients are computed as a rule by scattering matrix (S-matrix) approach or similar techniques requiring order of M3 operations. In this work we consider alternatives to the S-matrix technique which are based on pure iterative or mixed direct-iterative approaches. The possibility to diminish the impact of M3 -order calculations to overall time and in some cases even to reduce the number of arithmetic operations to M2 by applying iterative techniques are discussed. Numerical results are illustrated to discuss validity and potentiality of the proposed approaches.

Learning Efficient Sparse and Low Rank Models.

PubMed

Sprechmann, P; Bronstein, A M; Sapiro, G

2015-09-01

Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with parsimony-promoting terms. The inherently sequential structure and data-dependent complexity and latency of iterative optimization constitute a major limitation in many applications requiring real-time performance or involving large-scale data. Another limitation encountered by these modeling techniques is the difficulty of their inclusion in discriminative learning scenarios. In this work, we propose to move the emphasis from the model to the pursuit algorithm, and develop a process-centric view of parsimonious modeling, in which a learned deterministic fixed-complexity pursuit process is used in lieu of iterative optimization. We show a principled way to construct learnable pursuit process architectures for structured sparse and robust low rank models, derived from the iteration of proximal descent algorithms. These architectures learn to approximate the exact parsimonious representation at a fraction of the complexity of the standard optimization methods. We also show that appropriate training regimes allow to naturally extend parsimonious models to discriminative settings. State-of-the-art results are demonstrated on several challenging problems in image and audio processing with several orders of magnitude speed-up compared to the exact optimization algorithms.

Image quality of multiplanar reconstruction of pulmonary CT scans using adaptive statistical iterative reconstruction.

PubMed

Honda, O; Yanagawa, M; Inoue, A; Kikuyama, A; Yoshida, S; Sumikawa, H; Tobino, K; Koyama, M; Tomiyama, N

2011-04-01

We investigated the image quality of multiplanar reconstruction (MPR) using adaptive statistical iterative reconstruction (ASIR). Inflated and fixed lungs were scanned with a garnet detector CT in high-resolution mode (HR mode) or non-high-resolution (HR) mode, and MPR images were then reconstructed. Observers compared 15 MPR images of ASIR (40%) and ASIR (80%) with those of ASIR (0%), and assessed image quality using a visual five-point scale (1, definitely inferior; 5, definitely superior), with particular emphasis on normal pulmonary structures, artefacts, noise and overall image quality. The mean overall image quality scores in HR mode were 3.67 with ASIR (40%) and 4.97 with ASIR (80%). Those in non-HR mode were 3.27 with ASIR (40%) and 3.90 with ASIR (80%). The mean artefact scores in HR mode were 3.13 with ASIR (40%) and 3.63 with ASIR (80%), but those in non-HR mode were 2.87 with ASIR (40%) and 2.53 with ASIR (80%). The mean scores of the other parameters were greater than 3, whereas those in HR mode were higher than those in non-HR mode. There were significant differences between ASIR (40%) and ASIR (80%) in overall image quality (p<0.01). Contrast medium in the injection syringe was scanned to analyse image quality; ASIR did not suppress the severe artefacts of contrast medium. In general, MPR image quality with ASIR (80%) was superior to that with ASIR (40%). However, there was an increased incidence of artefacts by ASIR when CT images were obtained in non-HR mode.

Dark energy as a fixed point of the Einstein Yang-Mills Higgs equations

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

Rinaldi, Massimiliano, E-mail: massimiliano.rinaldi@unitn.it

We study the Einstein Yang-Mills Higgs equations in the SO(3) representation on a isotropic and homogeneous flat Universe, in the presence of radiation and matter fluids. We map the equations of motion into an autonomous dynamical system of first-order differential equations and we find the equilibrium points. We show that there is only one stable fixed point that corresponds to an accelerated expanding Universe in the future. In the past, instead, there is an unstable fixed point that implies a stiff-matter domination. In between, we find three other unstable fixed points, corresponding, in chronological order, to radiation domination, to mattermore » domination, and, finally, to a transition from decelerated expansion to accelerated expansion. We solve the system numerically and we confirm that there are smooth trajectories that correctly describe the evolution of the Universe, from a remote past dominated by radiation to a remote future dominated by dark energy, passing through a matter-dominated phase.« less

Dark energy as a fixed point of the Einstein Yang-Mills Higgs equations

NASA Astrophysics Data System (ADS)

Rinaldi, Massimiliano

2015-10-01

We study the Einstein Yang-Mills Higgs equations in the SO(3) representation on a isotropic and homogeneous flat Universe, in the presence of radiation and matter fluids. We map the equations of motion into an autonomous dynamical system of first-order differential equations and we find the equilibrium points. We show that there is only one stable fixed point that corresponds to an accelerated expanding Universe in the future. In the past, instead, there is an unstable fixed point that implies a stiff-matter domination. In between, we find three other unstable fixed points, corresponding, in chronological order, to radiation domination, to matter domination, and, finally, to a transition from decelerated expansion to accelerated expansion. We solve the system numerically and we confirm that there are smooth trajectories that correctly describe the evolution of the Universe, from a remote past dominated by radiation to a remote future dominated by dark energy, passing through a matter-dominated phase.

Choice in situations of time-based diminishing returns: immediate versus delayed consequences of action.

PubMed Central

Hackenberg, T D; Hineline, P N

1992-01-01

Pigeons chose between two schedules of food presentation, a fixed-interval schedule and a progressive-interval schedule that began at 0 s and increased by 20 s with each food delivery provided by that schedule. Choosing one schedule disabled the alternate schedule and stimuli until the requirements of the chosen schedule were satisfied, at which point both schedules were again made available. Fixed-interval duration remained constant within individual sessions but varied across conditions. Under reset conditions, completing the fixed-interval schedule not only produced food but also reset the progressive interval to its minimum. Blocks of sessions under the reset procedure were interspersed with sessions under a no-reset procedure, in which the progressive schedule value increased independent of fixed-interval choices. Median points of switching from the progressive to the fixed schedule varied systematically with fixed-interval value, and were consistently lower during reset than during no-reset conditions. Under the latter, each subject's choices of the progressive-interval schedule persisted beyond the point at which its requirements equaled those of the fixed-interval schedule at all but the highest fixed-interval value. Under the reset procedure, switching occurred at or prior to that equality point. These results qualitatively confirm molar analyses of schedule preference and some versions of optimality theory, but they are more adequately characterized by a model of schedule preference based on the cumulated values of multiple reinforcers, weighted in inverse proportion to the delay between the choice and each successive reinforcer. PMID:1548449

Entanglement entropy at infinite-randomness fixed points in higher dimensions.

PubMed

Lin, Yu-Cheng; Iglói, Ferenc; Rieger, Heiko

2007-10-05

The entanglement entropy of the two-dimensional random transverse Ising model is studied with a numerical implementation of the strong-disorder renormalization group. The asymptotic behavior of the entropy per surface area diverges at, and only at, the quantum phase transition that is governed by an infinite-randomness fixed point. Here we identify a double-logarithmic multiplicative correction to the area law for the entanglement entropy. This contrasts with the pure area law valid at the infinite-randomness fixed point in the diluted transverse Ising model in higher dimensions.

Fixed Point Results of Locally Contractive Mappings in Ordered Quasi-Partial Metric Spaces

PubMed Central

Arshad, Muhammad; Ahmad, Jamshaid

2013-01-01

Fixed point results for a self-map satisfying locally contractive conditions on a closed ball in an ordered 0-complete quasi-partial metric space have been established. Instead of monotone mapping, the notion of dominated mappings is applied. We have used weaker metric, weaker contractive conditions, and weaker restrictions to obtain unique fixed points. An example is given which shows that how this result can be used when the corresponding results cannot. Our results generalize, extend, and improve several well-known conventional results. PMID:24062629

Fixed point theorems for generalized α -β-weakly contraction mappings in metric spaces and applications.

PubMed

Latif, Abdul; Mongkolkeha, Chirasak; Sintunavarat, Wutiphol

2014-01-01

We extend the notion of generalized weakly contraction mappings due to Choudhury et al. (2011) to generalized α-β-weakly contraction mappings. We show with examples that our new class of mappings is a real generalization of several known classes of mappings. We also establish fixed point results for such mappings in metric spaces. Applying our new results, we obtain fixed point results on ordinary metric spaces, metric spaces endowed with an arbitrary binary relation, and metric spaces endowed with graph.

Evolution families of conformal mappings with fixed points and the Löwner-Kufarev equation

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

Goryainov, V V

2015-01-31

The paper is concerned with evolution families of conformal mappings of the unit disc to itself that fix an interior point and a boundary point. Conditions are obtained for the evolution families to be differentiable, and an existence and uniqueness theorem for an evolution equation is proved. A convergence theorem is established which describes the topology of locally uniform convergence of evolution families in terms of infinitesimal generating functions. The main result in this paper is the embedding theorem which shows that any conformal mapping of the unit disc to itself with two fixed points can be embedded into a differentiable evolution familymore » of such mappings. This result extends the range of the parametric method in the theory of univalent functions. In this way the problem of the mutual change of the derivative at an interior point and the angular derivative at a fixed point on the boundary is solved for a class of mappings of the unit disc to itself. In particular, the rotation theorem is established for this class of mappings. Bibliography: 27 titles.« less

Effect of time-of-flight and point spread function modeling on detectability of myocardial defects in PET

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

Schaefferkoetter, Joshua, E-mail: dnrjds@nus.edu.sg; Ouyang, Jinsong; Rakvongthai, Yothin

2014-06-15

Purpose: A study was designed to investigate the impact of time-of-flight (TOF) and point spread function (PSF) modeling on the detectability of myocardial defects. Methods: Clinical FDG-PET data were used to generate populations of defect-present and defect-absent images. Defects were incorporated at three contrast levels, and images were reconstructed by ordered subset expectation maximization (OSEM) iterative methods including ordinary Poisson, alone and with PSF, TOF, and PSF+TOF. Channelized Hotelling observer signal-to-noise ratio (SNR) was the surrogate for human observer performance. Results: For three iterations, 12 subsets, and no postreconstruction smoothing, TOF improved overall defect detection SNR by 8.6% as comparedmore » to its non-TOF counterpart for all the defect contrasts. Due to the slow convergence of PSF reconstruction, PSF yielded 4.4% less SNR than non-PSF. For reconstruction parameters (iteration number and postreconstruction smoothing kernel size) optimizing observer SNR, PSF showed larger improvement for faint defects. The combination of TOF and PSF improved mean detection SNR as compared to non-TOF and non-PSF counterparts by 3.0% and 3.2%, respectively. Conclusions: For typical reconstruction protocol used in clinical practice, i.e., less than five iterations, TOF improved defect detectability. In contrast, PSF generally yielded less detectability. For large number of iterations, TOF+PSF yields the best observer performance.« less

Different femorotibial contact points between fixed- and mobile-bearing TKAs do not show clinical impact.

PubMed

van Stralen, R A; Heesterbeek, P J C; Wymenga, A B

2015-11-01

In anteroposterior (AP)-gliding mobile-bearing total knee arthroplasty (TKA), the femoral component can theoretically slide forward resulting in a more anterior contact point, causing pain due to impingement. A lower lever arm of the extensor apparatus can also attribute to higher patella pressures and pain. The goal of this study was to determine the contact point in a cohort of mobile- and fixed-bearing TKAs, to determine whether the contact point lies more anteriorly in mobile-bearing TKA and to confirm whether this results in anterior knee pain. We used 38 fixed-bearing TKA and 40 mobile-bearing TKA from a randomized trial with straight lateral knee X-rays and measured the contact point. The functional outcome was measured by Knee Society Score at 12 months postoperatively. Pain scores were analysed using a VAS score (0-100 mm) in all patients at rest and when moving. Difficulty at rising up out of a chair was also assessed using a VAS score. The contact point in mobile-bearing TKA was situated at 59.5 % of the AP distance of the tibia and in the fixed-bearing TKA group at 66.1 % (P< 0.05). Patients with mobile- and fixed-bearing TKAs had similar knee scores, pain scores and difficulty in chair rise. No significant correlation was found between contact point and knee pain. The hypothesis of a more anterior contact point in the mobile-bearing cohort was confirmed but no correlation with functional and pain scores in this cohort could be found. The tibiofemoral contact point could not be correlated with a different clinical outcome and higher incidence of anterior knee pain. This study further adds to the knowledge on possible differences between mobile- and fixed-bearing prostheses. Next to that, bad outcomes could not be explained by CP. Case series, Level IV.

The Melting Point of Palladium Using Miniature Fixed Points of Different Ceramic Materials: Part II—Analysis of Melting Curves and Long-Term Investigation

NASA Astrophysics Data System (ADS)

Edler, F.; Huang, K.

2016-12-01

Fifteen miniature fixed-point cells made of three different ceramic crucible materials (Al2O3, ZrO2, and Al2O3(86 %)+ZrO2(14 %)) were filled with pure palladium and used to calibrate type B thermocouples (Pt30 %Rh/Pt6 %Rh). A critical point by using miniature fixed points with small amounts of fixed-point material is the analysis of the melting curves, which are characterized by significant slopes during the melting process compared to flat melting plateaus obtainable using conventional fixed-point cells. The method of the extrapolated starting point temperature using straight line approximation of the melting plateau was applied to analyze the melting curves. This method allowed an unambiguous determination of an electromotive force (emf) assignable as melting temperature. The strict consideration of two constraints resulted in a unique, repeatable and objective method to determine the emf at the melting temperature within an uncertainty of about 0.1 μ V. The lifetime and long-term stability of the miniature fixed points was investigated by performing more than 100 melt/freeze cycles for each crucible of the different ceramic materials. No failure of the crucibles occurred indicating an excellent mechanical stability of the investigated miniature cells. The consequent limitation of heating rates to values below {± }3.5 K min^{-1} above 1100° C and the carefully and completely filled crucibles (the liquid palladium occupies the whole volume of the crucible) are the reasons for successfully preventing the crucibles from breaking. The thermal stability of the melting temperature of palladium was excellent when using the crucibles made of Al2O3(86 %)+ZrO2(14 %) and ZrO2. Emf drifts over the total duration of the long-term investigation were below a temperature equivalent of about 0.1 K-0.2 K.

Onsite Calibration of a Precision IPRT Based on Gallium and Gallium-Based Small-Size Eutectic Points

NASA Astrophysics Data System (ADS)

Sun, Jianping; Hao, Xiaopeng; Zeng, Fanchao; Zhang, Lin; Fang, Xinyun

2017-04-01

Onsite thermometer calibration with temperature scale transfer technology based on fixed points can effectively improve the level of industrial temperature measurement and calibration. The present work performs an onsite calibration of a precision industrial platinum resistance thermometer near room temperature. The calibration is based on a series of small-size eutectic points, including Ga-In (15.7°C), Ga-Sn (20.5°C), Ga-Zn (25.2°C), and a Ga fixed point (29.7°C), developed in a portable multi-point automatic realization apparatus. The temperature plateaus of the Ga-In, Ga-Sn, and Ga-Zn eutectic points and the Ga fixed point last for longer than 2 h, and their reproducibility was better than 5 mK. The device is suitable for calibrating non-detachable temperature sensors in advanced environmental laboratories and industrial fields.

Scaling in the vicinity of the four-state Potts fixed point

NASA Astrophysics Data System (ADS)

Blöte, H. W. J.; Guo, Wenan; Nightingale, M. P.

2017-08-01

We study a self-dual generalization of the Baxter-Wu model, employing results obtained by transfer matrix calculations of the magnetic scaling dimension and the free energy. While the pure critical Baxter-Wu model displays the critical behavior of the four-state Potts fixed point in two dimensions, in the sense that logarithmic corrections are absent, the introduction of different couplings in the up- and down triangles moves the model away from this fixed point, so that logarithmic corrections appear. Real couplings move the model into the first-order range, away from the behavior displayed by the nearest-neighbor, four-state Potts model. We also use complex couplings, which bring the model in the opposite direction characterized by the same type of logarithmic corrections as present in the four-state Potts model. Our finite-size analysis confirms in detail the existing renormalization theory describing the immediate vicinity of the four-state Potts fixed point.

How to Assess the Existence of Competing Strategies in Cognitive Tasks: A Primer on the Fixed-Point Property

PubMed Central

van Maanen, Leendert; de Jong, Ritske; van Rijn, Hedderik

2014-01-01

When multiple strategies can be used to solve a type of problem, the observed response time distributions are often mixtures of multiple underlying base distributions each representing one of these strategies. For the case of two possible strategies, the observed response time distributions obey the fixed-point property. That is, there exists one reaction time that has the same probability of being observed irrespective of the actual mixture proportion of each strategy. In this paper we discuss how to compute this fixed-point, and how to statistically assess the probability that indeed the observed response times are generated by two competing strategies. Accompanying this paper is a free R package that can be used to compute and test the presence or absence of the fixed-point property in response time data, allowing for easy to use tests of strategic behavior. PMID:25170893

Matrix product density operators: Renormalization fixed points and boundary theories

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

Cirac, J.I.; Pérez-García, D., E-mail: dperezga@ucm.es; ICMAT, Nicolas Cabrera, Campus de Cantoblanco, 28049 Madrid

We consider the tensors generating matrix product states and density operators in a spin chain. For pure states, we revise the renormalization procedure introduced in (Verstraete et al., 2005) and characterize the tensors corresponding to the fixed points. We relate them to the states possessing zero correlation length, saturation of the area law, as well as to those which generate ground states of local and commuting Hamiltonians. For mixed states, we introduce the concept of renormalization fixed points and characterize the corresponding tensors. We also relate them to concepts like finite correlation length, saturation of the area law, as well asmore » to those which generate Gibbs states of local and commuting Hamiltonians. One of the main result of this work is that the resulting fixed points can be associated to the boundary theories of two-dimensional topological states, through the bulk-boundary correspondence introduced in (Cirac et al., 2011).« less

Fixed Point Learning Based Intelligent Traffic Control System

NASA Astrophysics Data System (ADS)

Zongyao, Wang; Cong, Sui; Cheng, Shao

2017-10-01

Fixed point learning has become an important tool to analyse large scale distributed system such as urban traffic network. This paper presents a fixed point learning based intelligence traffic network control system. The system applies convergence property of fixed point theorem to optimize the traffic flow density. The intelligence traffic control system achieves maximum road resources usage by averaging traffic flow density among the traffic network. The intelligence traffic network control system is built based on decentralized structure and intelligence cooperation. No central control is needed to manage the system. The proposed system is simple, effective and feasible for practical use. The performance of the system is tested via theoretical proof and simulations. The results demonstrate that the system can effectively solve the traffic congestion problem and increase the vehicles average speed. It also proves that the system is flexible, reliable and feasible for practical use.

Assessment of tungsten/rhenium thermocouples with metal-carbon eutectic fixed points up to 1500°C

NASA Astrophysics Data System (ADS)

Gotoh, M.

2013-09-01

Four Type A thermocouples and two Type C thermocouples were calibrated at the Au fixed point and Co-C and Pd-C eutectic fixed points. The thermocouples were exposed to 1330 °C for a total of 100 hours. The maximum drift due to the exposure was found to be 4.8 °C. The fixed-point calibration EMF of these thermocouples deviated by less than 0.86% from the temperature specified by the standards ASTM E230-2003 for Type C and GOSTR 8.585-2001 for Type A. The length of one of Type A thermocouples A52 is longer than the others by 150mm. Making use of this provision it was possible to place annealed part of A52 to the temperature gradient part of calibration arrangement every time. Therefore observed aging effect was as low as 0.5 °C compared to the other thermocouples.

Positive solutions of fractional integral equations by the technique of measure of noncompactness.

PubMed

Nashine, Hemant Kumar; Arab, Reza; Agarwal, Ravi P; De la Sen, Manuel

2017-01-01

In the present study, we work on the problem of the existence of positive solutions of fractional integral equations by means of measures of noncompactness in association with Darbo's fixed point theorem. To achieve the goal, we first establish new fixed point theorems using a new contractive condition of the measure of noncompactness in Banach spaces. By doing this we generalize Darbo's fixed point theorem along with some recent results of (Aghajani et al. (J. Comput. Appl. Math. 260:67-77, 2014)), (Aghajani et al. (Bull. Belg. Math. Soc. Simon Stevin 20(2):345-358, 2013)), (Arab (Mediterr. J. Math. 13(2):759-773, 2016)), (Banaś et al. (Dyn. Syst. Appl. 18:251-264, 2009)), and (Samadi et al. (Abstr. Appl. Anal. 2014:852324, 2014)). We also derive corresponding coupled fixed point results. Finally, we give an illustrative example to verify the effectiveness and applicability of our results.

More asymptotic safety guaranteed

NASA Astrophysics Data System (ADS)

Bond, Andrew D.; Litim, Daniel F.

2018-04-01

We study interacting fixed points and phase diagrams of simple and semisimple quantum field theories in four dimensions involving non-Abelian gauge fields, fermions and scalars in the Veneziano limit. Particular emphasis is put on new phenomena which arise due to the semisimple nature of the theory. Using matter field multiplicities as free parameters, we find a large variety of interacting conformal fixed points with stable vacua and crossovers inbetween. Highlights include semisimple gauge theories with exact asymptotic safety, theories with one or several interacting fixed points in the IR, theories where one of the gauge sectors is both UV free and IR free, and theories with weakly interacting fixed points in the UV and the IR limits. The phase diagrams for various simple and semisimple settings are also given. Further aspects such as perturbativity beyond the Veneziano limit, conformal windows, and implications for model building are discussed.

A multiresolution hierarchical classification algorithm for filtering airborne LiDAR data

NASA Astrophysics Data System (ADS)

Chen, Chuanfa; Li, Yanyan; Li, Wei; Dai, Honglei

2013-08-01

We presented a multiresolution hierarchical classification (MHC) algorithm for differentiating ground from non-ground LiDAR point cloud based on point residuals from the interpolated raster surface. MHC includes three levels of hierarchy, with the simultaneous increase of cell resolution and residual threshold from the low to the high level of the hierarchy. At each level, the surface is iteratively interpolated towards the ground using thin plate spline (TPS) until no ground points are classified, and the classified ground points are used to update the surface in the next iteration. 15 groups of benchmark dataset, provided by the International Society for Photogrammetry and Remote Sensing (ISPRS) commission, were used to compare the performance of MHC with those of the 17 other publicized filtering methods. Results indicated that MHC with the average total error and average Cohen’s kappa coefficient of 4.11% and 86.27% performs better than all other filtering methods.

A Mixed Methods Bounded Case Study: Data-Driven Decision Making within Professional Learning Communities for Response to Intervention

ERIC Educational Resources Information Center

Rodriguez, Gabriel R.

2017-01-01

A growing number of schools are implementing PLCs to address school improvement, staff engage with data to identify student needs and determine instructional interventions. This is a starting point for engaging in the iterative process of learning for the teach in order to increase student learning (Hord & Sommers, 2008). The iterative process…

An adaptive Gaussian process-based iterative ensemble smoother for data assimilation

NASA Astrophysics Data System (ADS)

Ju, Lei; Zhang, Jiangjiang; Meng, Long; Wu, Laosheng; Zeng, Lingzao

2018-05-01

Accurate characterization of subsurface hydraulic conductivity is vital for modeling of subsurface flow and transport. The iterative ensemble smoother (IES) has been proposed to estimate the heterogeneous parameter field. As a Monte Carlo-based method, IES requires a relatively large ensemble size to guarantee its performance. To improve the computational efficiency, we propose an adaptive Gaussian process (GP)-based iterative ensemble smoother (GPIES) in this study. At each iteration, the GP surrogate is adaptively refined by adding a few new base points chosen from the updated parameter realizations. Then the sensitivity information between model parameters and measurements is calculated from a large number of realizations generated by the GP surrogate with virtually no computational cost. Since the original model evaluations are only required for base points, whose number is much smaller than the ensemble size, the computational cost is significantly reduced. The applicability of GPIES in estimating heterogeneous conductivity is evaluated by the saturated and unsaturated flow problems, respectively. Without sacrificing estimation accuracy, GPIES achieves about an order of magnitude of speed-up compared with the standard IES. Although subsurface flow problems are considered in this study, the proposed method can be equally applied to other hydrological models.

High-bandwidth and flexible tracking control for precision motion with application to a piezo nanopositioner.

PubMed

Feng, Zhao; Ling, Jie; Ming, Min; Xiao, Xiao-Hui

2017-08-01

For precision motion, high-bandwidth and flexible tracking are the two important issues for significant performance improvement. Iterative learning control (ILC) is an effective feedforward control method only for systems that operate strictly repetitively. Although projection ILC can track varying references, the performance is still limited by the fixed-bandwidth Q-filter, especially for triangular waves tracking commonly used in a piezo nanopositioner. In this paper, a wavelet transform-based linear time-varying (LTV) Q-filter design for projection ILC is proposed to compensate high-frequency errors and improve the ability to tracking varying references simultaneously. The LVT Q-filter is designed based on the modulus maximum of wavelet detail coefficients calculated by wavelet transform to determine the high-frequency locations of each iteration with the advantages of avoiding cross-terms and segmenting manually. The proposed approach was verified on a piezo nanopositioner. Experimental results indicate that the proposed approach can locate the high-frequency regions accurately and achieve the best performance under varying references compared with traditional frequency-domain and projection ILC with a fixed-bandwidth Q-filter, which validates that through implementing the LTV filter on projection ILC, high-bandwidth and flexible tracking can be achieved simultaneously by the proposed approach.

Experiments on individual strategy updating in iterated snowdrift game under random rematching.

PubMed

Qi, Hang; Ma, Shoufeng; Jia, Ning; Wang, Guangchao

2015-03-07

How do people actually play the iterated snowdrift games, particularly under random rematching protocol is far from well explored. Two sets of laboratory experiments on snowdrift game were conducted to investigate human strategy updating rules. Four groups of subjects were modeled by experience-weighted attraction learning theory at individual-level. Three out of the four groups (75%) passed model validation. Substantial heterogeneity is observed among the players who update their strategies in four typical types, whereas rare people behave like belief-based learners even under fixed pairing. Most subjects (63.9%) adopt the reinforcement learning (or alike) rules; but, interestingly, the performance of averaged reinforcement learners suffered. It is observed that two factors seem to benefit players in competition, i.e., the sensitivity to their recent experiences and the overall consideration of forgone payoffs. Moreover, subjects with changing opponents tend to learn faster based on their own recent experience, and display more diverse strategy updating rules than they do with fixed opponent. These findings suggest that most of subjects do apply reinforcement learning alike updating rules even under random rematching, although these rules may not improve their performance. The findings help evolutionary biology researchers to understand sophisticated human behavioral strategies in social dilemmas. Copyright © 2015 Elsevier Ltd. All rights reserved.

Inflation, quintessence, and the origin of mass

NASA Astrophysics Data System (ADS)

Wetterich, C.

2015-08-01

In a unified picture both inflation and present dynamical dark energy arise from the same scalar field. The history of the Universe describes a crossover from a scale invariant "past fixed point" where all particles are massless, to a "future fixed point" for which spontaneous breaking of the exact scale symmetry generates the particle masses. The cosmological solution can be extrapolated to the infinite past in physical time - the universe has no beginning. This is seen most easily in a frame where particle masses and the Planck mass are field-dependent and increase with time. In this "freeze frame" the Universe shrinks and heats up during radiation and matter domination. In the equivalent, but singular Einstein frame cosmic history finds the familiar big bang description. The vicinity of the past fixed point corresponds to inflation. It ends at a first stage of the crossover. A simple model with no more free parameters than ΛCDM predicts for the primordial fluctuations a relation between the tensor amplitude r and the spectral index n, r = 8.19 (1 - n) - 0.137. The crossover is completed by a second stage where the beyond-standard-model sector undergoes the transition to the future fixed point. The resulting increase of neutrino masses stops a cosmological scaling solution, relating the present dark energy density to the present neutrino mass. At present our simple model seems compatible with all observational tests. We discuss how the fixed points can be rooted within quantum gravity in a crossover between ultraviolet and infrared fixed points. Then quantum properties of gravity could be tested both by very early and late cosmology.

Indirect addressing and load balancing for faster solution to Mandelbrot Set on SIMD architectures

NASA Technical Reports Server (NTRS)

Tomboulian, Sherryl

1989-01-01

SIMD computers with local indirect addressing allow programs to have queues and buffers, making certain kinds of problems much more efficient. Examined here are a class of problems characterized by computations on data points where the computation is identical, but the convergence rate is data dependent. Normally, in this situation, the algorithm time is governed by the maximum number of iterations required by each point. Using indirect addressing allows a processor to proceed to the next data point when it is done, reducing the overall number of iterations required to approach the mean convergence rate when a sufficiently large problem set is solved. Load balancing techniques can be applied for additional performance improvement. Simulations of this technique applied to solving Mandelbrot Sets indicate significant performance gains.

Robust Airfoil Optimization to Achieve Consistent Drag Reduction Over a Mach Range

NASA Technical Reports Server (NTRS)

Li, Wu; Huyse, Luc; Padula, Sharon; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

We prove mathematically that in order to avoid point-optimization at the sampled design points for multipoint airfoil optimization, the number of design points must be greater than the number of free-design variables. To overcome point-optimization at the sampled design points, a robust airfoil optimization method (called the profile optimization method) is developed and analyzed. This optimization method aims at a consistent drag reduction over a given Mach range and has three advantages: (a) it prevents severe degradation in the off-design performance by using a smart descent direction in each optimization iteration, (b) there is no random airfoil shape distortion for any iterate it generates, and (c) it allows a designer to make a trade-off between a truly optimized airfoil and the amount of computing time consumed. For illustration purposes, we use the profile optimization method to solve a lift-constrained drag minimization problem for 2-D airfoil in Euler flow with 20 free-design variables. A comparison with other airfoil optimization methods is also included.

47 CFR 101.705 - Special showing for renewal of common carrier station facilities using frequency diversity.

Code of Federal Regulations, 2014 CFR

2014-10-01

... COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.705 Special showing for renewal of common carrier station...

47 CFR 101.705 - Special showing for renewal of common carrier station facilities using frequency diversity.

Code of Federal Regulations, 2013 CFR

2013-10-01

... COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.705 Special showing for renewal of common carrier station...

47 CFR 101.705 - Special showing for renewal of common carrier station facilities using frequency diversity.

Code of Federal Regulations, 2012 CFR

2012-10-01

... COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.705 Special showing for renewal of common carrier station...

47 CFR 101.705 - Special showing for renewal of common carrier station facilities using frequency diversity.

Code of Federal Regulations, 2011 CFR

2011-10-01

... COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.705 Special showing for renewal of common carrier station...

Linear and Non-Linear Dielectric Response of Periodic Systems from Quantum Monte Carlo

NASA Astrophysics Data System (ADS)

Umari, Paolo

2006-03-01

We present a novel approach that allows to calculate the dielectric response of periodic systems in the quantum Monte Carlo formalism. We employ a many-body generalization for the electric enthalpy functional, where the coupling with the field is expressed via the Berry-phase formulation for the macroscopic polarization. A self-consistent local Hamiltonian then determines the ground-state wavefunction, allowing for accurate diffusion quantum Monte Carlo calculations where the polarization's fixed point is estimated from the average on an iterative sequence. The polarization is sampled through forward-walking. This approach has been validated for the case of the polarizability of an isolated hydrogen atom, and then applied to a periodic system. We then calculate the linear susceptibility and second-order hyper-susceptibility of molecular-hydrogen chains whith different bond-length alternations, and assess the quality of nodal surfaces derived from density-functional theory or from Hartree-Fock. The results found are in excellent agreement with the best estimates obtained from the extrapolation of quantum-chemistry calculations.P. Umari, A.J. Williamson, G. Galli, and N. MarzariPhys. Rev. Lett. 95, 207602 (2005).

About approximation of integer factorization problem by the combination fixed-point iteration method and Bayesian rounding for quantum cryptography

NASA Astrophysics Data System (ADS)

Ogorodnikov, Yuri; Khachay, Michael; Pljonkin, Anton

2018-04-01

We describe the possibility of employing the special case of the 3-SAT problem stemming from the well known integer factorization problem for the quantum cryptography. It is known, that for every instance of our 3-SAT setting the given 3-CNF is satisfiable by a unique truth assignment, and the goal is to find this assignment. Since the complexity status of the factorization problem is still undefined, development of approximation algorithms and heuristics adopts interest of numerous researchers. One of promising approaches to construction of approximation techniques is based on real-valued relaxation of the given 3-CNF followed by minimizing of the appropriate differentiable loss function, and subsequent rounding of the fractional minimizer obtained. Actually, algorithms developed this way differ by the rounding scheme applied on their final stage. We propose a new rounding scheme based on Bayesian learning. The article shows that the proposed method can be used to determine the security in quantum key distribution systems. In the quantum distribution the Shannon rules is applied and the factorization problem is paramount when decrypting secret keys.

Traveling-cluster approximation for uncorrelated amorphous systems

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

Sen, A.K.; Mills, R.; Kaplan, T.

1984-11-15

We have developed a formalism for including cluster effects in the one-electron Green's function for a positionally disordered (liquid or amorphous) system without any correlation among the scattering sites. This method is an extension of the technique known as the traveling-cluster approximation (TCA) originally obtained and applied to a substitutional alloy by Mills and Ratanavararaksa. We have also proved the appropriate fixed-point theorem, which guarantees, for a bounded local potential, that the self-consistent equations always converge upon iteration to a unique, Herglotz solution. To our knowledge, this is the only analytic theory for considering cluster effects. Furthermore, we have performedmore » some computer calculations in the pair TCA, for the model case of delta-function potentials on a one-dimensional random chain. These results have been compared with ''exact calculations'' (which, in principle, take into account all cluster effects) and with the coherent-potential approximation (CPA), which is the single-site TCA. The density of states for the pair TCA clearly shows some improvement over the CPA and yet, apparently, the pair approximation distorts some of the features of the exact results.« less

Fabrication of a mini multi-fixed-point cell for the calibration of industrial platinum resistance thermometers

NASA Astrophysics Data System (ADS)

Ragay-Enot, Monalisa; Lee, Young Hee; Kim, Yong-Gyoo

2017-07-01

A mini multi-fixed-point cell (length 118 mm, diameter 33 mm) containing three materials (In-Zn eutectic (mass fraction 3.8% Zn), Sn and Pb) in a single crucible was designed and fabricated for the easy and economical fixed-point calibration of industrial platinum resistance thermometers (IPRTs) for use in industrial temperature measurements. The melting and freezing behaviors of the metals were investigated and the phase transition temperatures were determined using a commercial dry-block calibrator. Results showed that the melting plateaus are generally easy to realize and are reproducible, flatter and of longer duration. On the other hand, the freezing process is generally difficult, especially for Sn, due to the high supercooling required to initiate freezing. The observed melting temperatures at optimum set conditions were 143.11 °C (In-Zn), 231.70 °C (Sn) and 327.15 °C (Pb) with expanded uncertainties (k  = 2) of 0.12 °C, 0.10 °C and 0.13 °C, respectively. This multi-fixed-point cell can be treated as a sole reference temperature-generating system. Based on the results, the realization of melting points of the mini multi-fixed-point cell can be recommended for the direct calibration of IPRTs in industrial applications without the need for a reference thermometer.

SU-E-T-446: Group-Sparsity Based Angle Generation Method for Beam Angle Optimization

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

Gao, H

2015-06-15

Purpose: This work is to develop the effective algorithm for beam angle optimization (BAO), with the emphasis on enabling further improvement from existing treatment-dependent templates based on clinical knowledge and experience. Methods: The proposed BAO algorithm utilizes a priori beam angle templates as the initial guess, and iteratively generates angular updates for this initial set, namely angle generation method, with improved dose conformality that is quantitatively measured by the objective function. That is, during each iteration, we select “the test angle” in the initial set, and use group-sparsity based fluence map optimization to identify “the candidate angle” for updating “themore » test angle”, for which all the angles in the initial set except “the test angle”, namely “the fixed set”, are set free, i.e., with no group-sparsity penalty, and the rest of angles including “the test angle” during this iteration are in “the working set”. And then “the candidate angle” is selected with the smallest objective function value from the angles in “the working set” with locally maximal group sparsity, and replaces “the test angle” if “the fixed set” with “the candidate angle” has a smaller objective function value by solving the standard fluence map optimization (with no group-sparsity regularization). Similarly other angles in the initial set are in turn selected as “the test angle” for angular updates and this chain of updates is iterated until no further new angular update is identified for a full loop. Results: The tests using the MGH public prostate dataset demonstrated the effectiveness of the proposed BAO algorithm. For example, the optimized angular set from the proposed BAO algorithm was better the MGH template. Conclusion: A new BAO algorithm is proposed based on the angle generation method via group sparsity, with improved dose conformality from the given template. Hao Gao was partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)« less

47 CFR 101.703 - Permissible communications.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 5 2014-10-01 2014-10-01 false Permissible communications. 101.703 Section 101.703 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.703 Permissible...

47 CFR 101.601 - Eligibility.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 5 2013-10-01 2013-10-01 false Eligibility. 101.601 Section 101.601 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Private Operational Fixed Point-to-Point Microwave Service § 101.601 Eligibility. Any person, or...

47 CFR 101.703 - Permissible communications.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Permissible communications. 101.703 Section 101.703 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.703 Permissible...

47 CFR 101.135 - Shared use of radio stations and the offering of private carrier service.

Code of Federal Regulations, 2012 CFR

2012-10-01

... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101... Operational Fixed Point-to-Point Microwave radio stations may share the use of their facilities on a non...

47 CFR 101.601 - Eligibility.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Eligibility. 101.601 Section 101.601 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Private Operational Fixed Point-to-Point Microwave Service § 101.601 Eligibility. Any person, or...

47 CFR 101.601 - Eligibility.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 5 2014-10-01 2014-10-01 false Eligibility. 101.601 Section 101.601 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Private Operational Fixed Point-to-Point Microwave Service § 101.601 Eligibility. Any person, or...

47 CFR 101.135 - Shared use of radio stations and the offering of private carrier service.

Code of Federal Regulations, 2010 CFR

2010-10-01

... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101... Operational Fixed Point-to-Point Microwave radio stations may share the use of their facilities on a non...

47 CFR 101.703 - Permissible communications.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 5 2013-10-01 2013-10-01 false Permissible communications. 101.703 Section 101.703 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.703 Permissible...

47 CFR 101.135 - Shared use of radio stations and the offering of private carrier service.

Code of Federal Regulations, 2011 CFR

2011-10-01

... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101... Operational Fixed Point-to-Point Microwave radio stations may share the use of their facilities on a non...

47 CFR 101.601 - Eligibility.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 5 2012-10-01 2012-10-01 false Eligibility. 101.601 Section 101.601 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Private Operational Fixed Point-to-Point Microwave Service § 101.601 Eligibility. Any person, or...

47 CFR 101.703 - Permissible communications.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Permissible communications. 101.703 Section 101.703 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.703 Permissible...

47 CFR 101.135 - Shared use of radio stations and the offering of private carrier service.

Code of Federal Regulations, 2014 CFR

2014-10-01

... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101... Operational Fixed Point-to-Point Microwave radio stations may share the use of their facilities on a non...

47 CFR 101.135 - Shared use of radio stations and the offering of private carrier service.

Code of Federal Regulations, 2013 CFR

2013-10-01

... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101... Operational Fixed Point-to-Point Microwave radio stations may share the use of their facilities on a non...

47 CFR 101.601 - Eligibility.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Eligibility. 101.601 Section 101.601 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Private Operational Fixed Point-to-Point Microwave Service § 101.601 Eligibility. Any person, or...

47 CFR 101.703 - Permissible communications.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 5 2012-10-01 2012-10-01 false Permissible communications. 101.703 Section 101.703 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.703 Permissible...

Regulator dependence of fixed points in quantum Einstein gravity with R 2 truncation

NASA Astrophysics Data System (ADS)

Nagy, S.; Fazekas, B.; Peli, Z.; Sailer, K.; Steib, I.

2018-03-01

We performed a functional renormalization group analysis for the quantum Einstein gravity including a quadratic term in the curvature. The ultraviolet non-gaussian fixed point and its critical exponent for the correlation length are identified for different forms of regulators in case of dimension 3. We searched for that optimized regulator where the physical quantities show the least regulator parameter dependence. It is shown that the Litim regulator satisfies this condition. The infrared fixed point has also been investigated, it is found that the exponent is insensitive to the third coupling introduced by the R 2 term.

Fixed Point Results for G-α-Contractive Maps with Application to Boundary Value Problems

PubMed Central

Roshan, Jamal Rezaei

2014-01-01

We unify the concepts of G-metric, metric-like, and b-metric to define new notion of generalized b-metric-like space and discuss its topological and structural properties. In addition, certain fixed point theorems for two classes of G-α-admissible contractive mappings in such spaces are obtained and some new fixed point results are derived in corresponding partially ordered space. Moreover, some examples and an application to the existence of a solution for the first-order periodic boundary value problem are provided here to illustrate the usability of the obtained results. PMID:24895655

A regularity result for fixed points, with applications to linear response

NASA Astrophysics Data System (ADS)

Sedro, Julien

2018-04-01

In this paper, we show a series of abstract results on fixed point regularity with respect to a parameter. They are based on a Taylor development taking into account a loss of regularity phenomenon, typically occurring for composition operators acting on spaces of functions with finite regularity. We generalize this approach to higher order differentiability, through the notion of an n-graded family. We then give applications to the fixed point of a nonlinear map, and to linear response in the context of (uniformly) expanding dynamics (theorem 3 and corollary 2), in the spirit of Gouëzel-Liverani.

Cartesian-Grid Simulations of a Canard-Controlled Missile with a Free-Spinning Tail

NASA Technical Reports Server (NTRS)

Murman, Scott M.; Aftosmis, Michael J.; Kwak, Dochan (Technical Monitor)

2002-01-01

The proposed paper presents a series of simulations of a geometrically complex, canard-controlled, supersonic missile with free-spinning tail fins. Time-dependent simulations were performed using an inviscid Cartesian-grid-based method with results compared to both experimental data and high-resolution Navier-Stokes computations. At fixed free stream conditions and canard deflections, the tail spin rate was iteratively determined such that the net rolling moment on the empennage is zero. This rate corresponds to the time-asymptotic rate of the free-to-spin fin system. After obtaining spin-averaged aerodynamic coefficients for the missile, the investigation seeks a fixed-tail approximation to the spin-averaged aerodynamic coefficients, and examines the validity of this approximation over a variety of freestream conditions.

Nuclear reactor transient analysis via a quasi-static kinetics Monte Carlo method

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

Jo, YuGwon; Cho, Bumhee; Cho, Nam Zin, E-mail: nzcho@kaist.ac.kr

2015-12-31

The predictor-corrector quasi-static (PCQS) method is applied to the Monte Carlo (MC) calculation for reactor transient analysis. To solve the transient fixed-source problem of the PCQS method, fission source iteration is used and a linear approximation of fission source distributions during a macro-time step is introduced to provide delayed neutron source. The conventional particle-tracking procedure is modified to solve the transient fixed-source problem via MC calculation. The PCQS method with MC calculation is compared with the direct time-dependent method of characteristics (MOC) on a TWIGL two-group problem for verification of the computer code. Then, the results on a continuous-energy problemmore » are presented.« less

SU-E-J-184: Stereo Time-Of-Flight System for Patient Positioning in Radiotherapy

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

Wentz, T; Gilles, M; Visvikis, D

2014-06-01

Purpose: The objective of this work is to test the advantage of using the surface acquired by two stereo Time-of-Flight (ToF) cameras in comparison of the use of one camera only for patient positioning in radiotherapy. Methods: A first step consisted on validating the use of a stereo ToFcamera system for positioning management of a phantom mounted on a linear actuator producing very accurate and repeatable displacements. The displacements between two positions were computed from the surface point cloud acquired by either one or two cameras thanks to an iterative closest point algorithm. A second step consisted on determining themore » displacements on patient datasets, with two cameras fixed on the ceiling of the radiotherapy room. Measurements were done first on voluntary subject with fixed translations, then on patients during the normal clinical radiotherapy routine. Results: The phantom tests showed a major improvement in lateral and depth axis for motions above 10 mm when using the stereo-system instead of a unique camera (Fig1). Patient measurements validate these results with a mean real and measured displacement differences in the depth direction of 1.5 mm when using one camera and 0.9 mm when using two cameras (Fig2). In the lateral direction, a mean difference of 1 mm was obtained by the stereo-system instead of 3.2 mm. Along the longitudinal axis mean differences of 5.4 and 3.4 mm with one and two cameras respectively were noticed but these measurements were still inaccurate and globally underestimated in this direction as in the literature. Similar results were also found for patient subjects with a mean difference reduction of 35%, 7%, and 25% for the lateral, depth, and longitudinal displacement with the stereo-system. Conclusion: The addition of a second ToF-camera to determine patient displacement strongly improved patient repositioning results and therefore insures better radiation delivery.« less

Multiview point clouds denoising based on interference elimination

NASA Astrophysics Data System (ADS)

Hu, Yang; Wu, Qian; Wang, Le; Jiang, Huanyu

2018-03-01

Newly emerging low-cost depth sensors offer huge potentials for three-dimensional (3-D) modeling, but existing high noise restricts these sensors from obtaining accurate results. Thus, we proposed a method for denoising registered multiview point clouds with high noise to solve that problem. The proposed method is aimed at fully using redundant information to eliminate the interferences among point clouds of different views based on an iterative procedure. In each iteration, noisy points are either deleted or moved to their weighted average targets in accordance with two cases. Simulated data and practical data captured by a Kinect v2 sensor were tested in experiments qualitatively and quantitatively. Results showed that the proposed method can effectively reduce noise and recover local features from highly noisy multiview point clouds with good robustness, compared to truncated signed distance function and moving least squares (MLS). Moreover, the resulting low-noise point clouds can be further smoothed by the MLS to achieve improved results. This study provides the feasibility of obtaining fine 3-D models with high-noise devices, especially for depth sensors, such as Kinect.

Feature-based three-dimensional registration for repetitive geometry in machine vision

PubMed Central

Gong, Yuanzheng; Seibel, Eric J.

2016-01-01

As an important step in three-dimensional (3D) machine vision, 3D registration is a process of aligning two or multiple 3D point clouds that are collected from different perspectives together into a complete one. The most popular approach to register point clouds is to minimize the difference between these point clouds iteratively by Iterative Closest Point (ICP) algorithm. However, ICP does not work well for repetitive geometries. To solve this problem, a feature-based 3D registration algorithm is proposed to align the point clouds that are generated by vision-based 3D reconstruction. By utilizing texture information of the object and the robustness of image features, 3D correspondences can be retrieved so that the 3D registration of two point clouds is to solve a rigid transformation. The comparison of our method and different ICP algorithms demonstrates that our proposed algorithm is more accurate, efficient and robust for repetitive geometry registration. Moreover, this method can also be used to solve high depth uncertainty problem caused by little camera baseline in vision-based 3D reconstruction. PMID:28286703

Drawing dynamical and parameters planes of iterative families and methods.

PubMed

Chicharro, Francisco I; Cordero, Alicia; Torregrosa, Juan R

2013-01-01

The complex dynamical analysis of the parametric fourth-order Kim's iterative family is made on quadratic polynomials, showing the MATLAB codes generated to draw the fractal images necessary to complete the study. The parameter spaces associated with the free critical points have been analyzed, showing the stable (and unstable) regions where the selection of the parameter will provide us the excellent schemes (or dreadful ones).

NIH-IEEE 2015 Strategic Conference on Healthcare Innovations and Point-of-Care Technologies for Prec

Cancer.gov

NIH and the Institute for Electrical and Electronics Engineering, Engineering in Medicine and Biology Society (IEEE/EMBS) hosted the third iteration of the Healthcare Innovations and Point-of-Care Technologies Conference last week.

Asymptotic safety of quantum gravity beyond Ricci scalars

NASA Astrophysics Data System (ADS)

Falls, Kevin; King, Callum R.; Litim, Daniel F.; Nikolakopoulos, Kostas; Rahmede, Christoph

2018-04-01

We investigate the asymptotic safety conjecture for quantum gravity including curvature invariants beyond Ricci scalars. Our strategy is put to work for families of gravitational actions which depend on functions of the Ricci scalar, the Ricci tensor, and products thereof. Combining functional renormalization with high order polynomial approximations and full numerical integration we derive the renormalization group flow for all couplings and analyse their fixed points, scaling exponents, and the fixed point effective action as a function of the background Ricci curvature. The theory is characterized by three relevant couplings. Higher-dimensional couplings show near-Gaussian scaling with increasing canonical mass dimension. We find that Ricci tensor invariants stabilize the UV fixed point and lead to a rapid convergence of polynomial approximations. We apply our results to models for cosmology and establish that the gravitational fixed point admits inflationary solutions. We also compare findings with those from f (R ) -type theories in the same approximation and pin-point the key new effects due to Ricci tensor interactions. Implications for the asymptotic safety conjecture of gravity are indicated.

Universality of modular symmetries in two-dimensional magnetotransport

NASA Astrophysics Data System (ADS)

Olsen, K. S.; Limseth, H. S.; Lütken, C. A.

2018-01-01

We analyze experimental quantum Hall data from a wide range of different materials, including semiconducting heterojunctions, thin films, surface layers, graphene, mercury telluride, bismuth antimonide, and black phosphorus. The fact that these materials have little in common, except that charge transport is effectively two-dimensional, shows how robust and universal the quantum Hall phenomenon is. The scaling and fixed point data we analyzed appear to show that magnetotransport in two dimensions is governed by a small number of universality classes that are classified by modular symmetries, which are infinite discrete symmetries not previously seen in nature. The Hall plateaux are (infrared) stable fixed points of the scaling-flow, and quantum critical points (where the wave function is delocalized) are unstable fixed points of scaling. Modular symmetries are so rigid that they in some cases fix the global geometry of the scaling flow, and therefore predict the exact location of quantum critical points, as well as the shape of flow lines anywhere in the phase diagram. We show that most available experimental quantum Hall scaling data are in good agreement with these predictions.

Rigorous high-precision enclosures of fixed points and their invariant manifolds

NASA Astrophysics Data System (ADS)

Wittig, Alexander N.

The well established concept of Taylor Models is introduced, which offer highly accurate C0 enclosures of functional dependencies, combining high-order polynomial approximation of functions and rigorous estimates of the truncation error, performed using verified arithmetic. The focus of this work is on the application of Taylor Models in algorithms for strongly non-linear dynamical systems. A method is proposed to extend the existing implementation of Taylor Models in COSY INFINITY from double precision coefficients to arbitrary precision coefficients. Great care is taken to maintain the highest efficiency possible by adaptively adjusting the precision of higher order coefficients in the polynomial expansion. High precision operations are based on clever combinations of elementary floating point operations yielding exact values for round-off errors. An experimental high precision interval data type is developed and implemented. Algorithms for the verified computation of intrinsic functions based on the High Precision Interval datatype are developed and described in detail. The application of these operations in the implementation of High Precision Taylor Models is discussed. An application of Taylor Model methods to the verification of fixed points is presented by verifying the existence of a period 15 fixed point in a near standard Henon map. Verification is performed using different verified methods such as double precision Taylor Models, High Precision intervals and High Precision Taylor Models. Results and performance of each method are compared. An automated rigorous fixed point finder is implemented, allowing the fully automated search for all fixed points of a function within a given domain. It returns a list of verified enclosures of each fixed point, optionally verifying uniqueness within these enclosures. An application of the fixed point finder to the rigorous analysis of beam transfer maps in accelerator physics is presented. Previous work done by Johannes Grote is extended to compute very accurate polynomial approximations to invariant manifolds of discrete maps of arbitrary dimension around hyperbolic fixed points. The algorithm presented allows for automatic removal of resonances occurring during construction. A method for the rigorous enclosure of invariant manifolds of continuous systems is introduced. Using methods developed for discrete maps, polynomial approximations of invariant manifolds of hyperbolic fixed points of ODEs are obtained. These approximations are outfit with a sharp error bound which is verified to rigorously contain the manifolds. While we focus on the three dimensional case, verification in higher dimensions is possible using similar techniques. Integrating the resulting enclosures using the verified COSY VI integrator, the initial manifold enclosures are expanded to yield sharp enclosures of large parts of the stable and unstable manifolds. To demonstrate the effectiveness of this method, we construct enclosures of the invariant manifolds of the Lorenz system and show pictures of the resulting manifold enclosures. To the best of our knowledge, these enclosures are the largest verified enclosures of manifolds in the Lorenz system in existence.

Development of Fixed-Point Cells at the SMU

NASA Astrophysics Data System (ADS)

Ďuriš, S.; Ranostaj, J.; Palenčár, R.

2008-06-01

One of the research programs realized at the thermometry laboratory of the Slovak Institute of Metrology (SMU) in recent years has focused on the development of fixed-point cells. In the frame of this research, several primary cells for realization of the International Temperature Scale of 1990 (ITS-90) and several secondary cells for industrial thermometer calibrations were built and studied. This article discusses primary cells for the gallium and mercury fixed points and miniature cells for the zinc point that were developed at the SMU. Information about the cell designs is provided, the materials that were used are specified, and the procedures for their manufacture are described. Briefly, the realization of the fixed points of mercury, gallium, and zinc by using these cells is also described. Many experiments were carried out to study the characteristics of these cells. One of the gallium cells was compared with the circulating transfer cell during the key comparison CCT-K3, and it and the mercury cell were used for the EUROMET Project No. 552. The results of the experiments together with the results of the comparisons show the high quality of these cells. Secondary zinc-point cells were compared against SMU primary zinc-point cells. The comparison shows agreement within 0.12 mK.

Application of Four-Point Newton-EGSOR iteration for the numerical solution of 2D Porous Medium Equations

NASA Astrophysics Data System (ADS)

Chew, J. V. L.; Sulaiman, J.

2017-09-01

Partial differential equations that are used in describing the nonlinear heat and mass transfer phenomena are difficult to be solved. For the case where the exact solution is difficult to be obtained, it is necessary to use a numerical procedure such as the finite difference method to solve a particular partial differential equation. In term of numerical procedure, a particular method can be considered as an efficient method if the method can give an approximate solution within the specified error with the least computational complexity. Throughout this paper, the two-dimensional Porous Medium Equation (2D PME) is discretized by using the implicit finite difference scheme to construct the corresponding approximation equation. Then this approximation equation yields a large-sized and sparse nonlinear system. By using the Newton method to linearize the nonlinear system, this paper deals with the application of the Four-Point Newton-EGSOR (4NEGSOR) iterative method for solving the 2D PMEs. In addition to that, the efficiency of the 4NEGSOR iterative method is studied by solving three examples of the problems. Based on the comparative analysis, the Newton-Gauss-Seidel (NGS) and the Newton-SOR (NSOR) iterative methods are also considered. The numerical findings show that the 4NEGSOR method is superior to the NGS and the NSOR methods in terms of the number of iterations to get the converged solutions, the time of computation and the maximum absolute errors produced by the methods.

Electromagnetic scattering of large structures in layered earths using integral equations

NASA Astrophysics Data System (ADS)

Xiong, Zonghou; Tripp, Alan C.

1995-07-01

An electromagnetic scattering algorithm for large conductivity structures in stratified media has been developed and is based on the method of system iteration and spatial symmetry reduction using volume electric integral equations. The method of system iteration divides a structure into many substructures and solves the resulting matrix equation using a block iterative method. The block submatrices usually need to be stored on disk in order to save computer core memory. However, this requires a large disk for large structures. If the body is discretized into equal-size cells it is possible to use the spatial symmetry relations of the Green's functions to regenerate the scattering impedance matrix in each iteration, thus avoiding expensive disk storage. Numerical tests show that the system iteration converges much faster than the conventional point-wise Gauss-Seidel iterative method. The numbers of cells do not significantly affect the rate of convergency. Thus the algorithm effectively reduces the solution of the scattering problem to an order of O(N2), instead of O(N3) as with direct solvers.

Glassy phase in quenched disordered crystalline membranes

NASA Astrophysics Data System (ADS)

Coquand, O.; Essafi, K.; Kownacki, J.-P.; Mouhanna, D.

2018-03-01

We investigate the flat phase of D -dimensional crystalline membranes embedded in a d -dimensional space and submitted to both metric and curvature quenched disorders using a nonperturbative renormalization group approach. We identify a second-order phase transition controlled by a finite-temperature, finite-disorder fixed point unreachable within the leading order of ɛ =4 -D and 1 /d expansions. This critical point divides the flow diagram into two basins of attraction: that associated with the finite-temperature fixed point controlling the long-distance behavior of disorder-free membranes and that associated with the zero-temperature, finite-disorder fixed point. Our work thus strongly suggests the existence of a whole low-temperature glassy phase for quenched disordered crystalline membranes and, possibly, for graphene and graphene-like compounds.

Gaussian mixed model in support of semiglobal matching leveraged by ground control points

NASA Astrophysics Data System (ADS)

Ma, Hao; Zheng, Shunyi; Li, Chang; Li, Yingsong; Gui, Li

2017-04-01

Semiglobal matching (SGM) has been widely applied in large aerial images because of its good tradeoff between complexity and robustness. The concept of ground control points (GCPs) is adopted to make SGM more robust. We model the effect of GCPs as two data terms for stereo matching between high-resolution aerial epipolar images in an iterative scheme. One term based on GCPs is formulated by Gaussian mixture model, which strengths the relation between GCPs and the pixels to be estimated and encodes some degree of consistency between them with respect to disparity values. Another term depends on pixel-wise confidence, and we further design a confidence updating equation based on three rules. With this confidence-based term, the assignment of disparity can be heuristically selected among disparity search ranges during the iteration process. Several iterations are sufficient to bring out satisfactory results according to our experiments. Experimental results validate that the proposed method outperforms surface reconstruction, which is a representative variant of SGM and behaves excellently on aerial images.

Solution of an eigenvalue problem for the Laplace operator on a spherical surface. M.S. Thesis - Maryland Univ.

NASA Technical Reports Server (NTRS)

Walden, H.

1974-01-01

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (also referred to as the membrane eigenvalue problem for the vibration equation) on the unit spherical surface are developed. Two specific types of spherical surface domains are considered: (1) the interior of a spherical triangle, i.e., the region bounded by arcs of three great circles, and (2) the exterior of a great circle arc extending for less than pi radians on the sphere (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is derived. The symmetric (generally five-point) finite difference equations that develop are written in matrix form and then solved by the iterative method of point successive overrelaxation. Upon convergence of this iterative method, the fundamental eigenvalue is approximated by iteration utilizing the power method as applied to the finite Rayleigh quotient.

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.

Directional kriging implementation for gridded data interpolation and comparative study with common methods

NASA Astrophysics Data System (ADS)

Mahmoudabadi, H.; Briggs, G.

2016-12-01

Gridded data sets, such as geoid models or datum shift grids, are commonly used in coordinate transformation algorithms. Grid files typically contain known or measured values at regular fixed intervals. The process of computing a value at an unknown location from the values in the grid data set is called "interpolation". Generally, interpolation methods predict a value at a given point by computing a weighted average of the known values in the neighborhood of the point. Geostatistical Kriging is a widely used interpolation method for irregular networks. Kriging interpolation first analyzes the spatial structure of the input data, then generates a general model to describe spatial dependencies. This model is used to calculate values at unsampled locations by finding direction, shape, size, and weight of neighborhood points. Because it is based on a linear formulation for the best estimation, Kriging it the optimal interpolation method in statistical terms. The Kriging interpolation algorithm produces an unbiased prediction, as well as the ability to calculate the spatial distribution of uncertainty, allowing you to estimate the errors in an interpolation for any particular point. Kriging is not widely used in geospatial applications today, especially applications that run on low power devices or deal with large data files. This is due to the computational power and memory requirements of standard Kriging techniques. In this paper, improvements are introduced in directional kriging implementation by taking advantage of the structure of the grid files. The regular spacing of points simplifies finding the neighborhood points and computing their pairwise distances, reducing the the complexity and improving the execution time of the Kriging algorithm. Also, the proposed method iteratively loads small portion of interest areas in different directions to reduce the amount of required memory. This makes the technique feasible on almost any computer processor. Comparison between kriging and other standard interpolation methods demonstrated more accurate estimations in less denser data files.

Indirect Determination of the Thermodynamic Temperature of a Gold Fixed-Point Cell

NASA Astrophysics Data System (ADS)

Battuello, M.; Girard, F.; Florio, M.

2010-09-01

Since the value T 90(Au) was fixed on the ITS-90, some determinations of the thermodynamic temperature of the gold point have been performed which form, with other renormalized results of previous measurements by radiation thermometry, the basis for the current best estimates of ( T - T 90)Au = 39.9 mK as elaborated by the CCT-WG4. Such a value, even if consistent with the behavior of T - T 90 differences at lower temperatures, is quite influenced by the low values of T Au as determined with few radiometric measurements. At INRIM, an independent indirect determination of the thermodynamic temperature of gold was performed by means of a radiation thermometry approach. A fixed-point technique was used to realize approximated thermodynamic scales from the Zn point up to the Cu point. A Si-based standard radiation thermometer working at 900 nm and 950 nm was used. The low uncertainty presently associated to the thermodynamic temperature of fixed points and the accuracy of INRIM realizations, allowed scales with an uncertainty lower than 0.03 K in terms of the thermodynamic temperature to be realized. A fixed-point cell filled with gold, 99.999 % in purity, was measured, and its freezing temperature was determined by both interpolation and extrapolation. An average T Au = 1337.395 K was found with a combined standard uncertainty of 23 mK. Such a value is 25 mK higher than the presently available value as derived by the CCT-WG4 value of ( T - T 90)Au = 39.9 mK.

Pilot Comparison of Radiance Temperature Scale Realization Between NIMT and NMIJ

NASA Astrophysics Data System (ADS)

Keawprasert, T.; Yamada, Y.; Ishii, J.

2015-03-01

A pilot comparison of radiance temperature scale realizations between the National Institute of Metrology Thailand (NIMT) and the National Metrology Institute of Japan (NMIJ) was conducted. At the two national metrology institutes (NMIs), a 900 nm radiation thermometer, used as the transfer artifact, was calibrated by a means of a multiple fixed-point method using the fixed-point blackbody of Zn, Al, Ag, and Cu points, and by means of relative spectral responsivity measurements according to the International Temperature Scale of 1990 (ITS-90) definition. The Sakuma-Hattori equation is used for interpolating the radiance temperature scale between the four fixed points and also for extrapolating the ITS-90 temperature scale to 2000 C. This paper compares the calibration results in terms of fixed-point measurements, relative spectral responsivity, and finally the radiance temperature scale. Good agreement for the fixed-point measurements was found in case a correction for the change of the internal temperature of the artifact was applied using the temperature coefficient measured at the NMIJ. For the realized radiance temperature range from 400 C to 1100 C, the resulting scale differences between the two NMIs are well within the combined scale comparison uncertainty of 0.12 C (). The resulting spectral responsivity measured at the NIMT has a comparable curve to that measured at the NMIJ especially in the out-of-band region, yielding a ITS-90 scale difference within 1.0 C from the Cu point to 2000 C, whereas the realization comparison uncertainty of NIMT and NMIJ combined is 1.2 C () at 2000 C.

Influence of the Cavity Length on the Behavior of Hybrid Fixed-Point Cells Constructed at INRIM

NASA Astrophysics Data System (ADS)

Battuello, M.; Girard, F.; Florio, M.

2015-03-01

Hybrid cells with double carbon/carbon sheets are used at the Istituto Nazionale di Ricerca Metrologica (INRIM) for the realization of both pure metal fixed points and high-temperature metal-carbon eutectic points. Cells for the Cu and Co-C fixed points have been prepared to be used in the high-temperature fixed-point project of the Comité Consultatif de Thermométrie. The results of the evaluation processes were not completely satisfactory for the INRIM cells because of their low transition temperatures with respect to the best cells, and of a rather large melting range for the Co-C cell. A new design of the cells was devised, and considerable improvements were achieved with respect to the transition temperature, and the plateau shape and duration. As for the Cu point, the duration of the freezing plateaux increased by more than 50 % and the freezing temperature increased by 18 mK. As for the Co-C point, the melting temperature, expressed in terms of the point of inflection of the melting curve, increased by about 70 mK. The melting range of the plateaux, expressed as a difference was reduced from about 180 mK to about 130 mK, with melting times increased by about 50 %, as a consequence of an improvement of flatness and run-off of the plateaux.

Existence of tripled fixed points for a class of condensing operators in Banach spaces.

PubMed

Karakaya, Vatan; Bouzara, Nour El Houda; Doğan, Kadri; Atalan, Yunus

2014-01-01

We give some results concerning the existence of tripled fixed points for a class of condensing operators in Banach spaces. Further, as an application, we study the existence of solutions for a general system of nonlinear integral equations.

A new numerical approach for uniquely solvable exterior Riemann-Hilbert problem on region with corners

NASA Astrophysics Data System (ADS)

Zamzamir, Zamzana; Murid, Ali H. M.; Ismail, Munira

2014-06-01

Numerical solution for uniquely solvable exterior Riemann-Hilbert problem on region with corners at offcorner points has been explored by discretizing the related integral equation using Picard iteration method without any modifications to the left-hand side (LHS) and right-hand side (RHS) of the integral equation. Numerical errors for all iterations are converge to the required solution. However, for certain problems, it gives lower accuracy. Hence, this paper presents a new numerical approach for the problem by treating the generalized Neumann kernel at LHS and the function at RHS of the integral equation. Due to the existence of the corner points, Gaussian quadrature is employed which avoids the corner points during numerical integration. Numerical example on a test region is presented to demonstrate the effectiveness of this formulation.

Contractive type non-self mappings on metric spaces of hyperbolic type

NASA Astrophysics Data System (ADS)

Ciric, Ljubomir B.

2006-05-01

Let (X,d) be a metric space of hyperbolic type and K a nonempty closed subset of X. In this paper we study a class of mappings from K into X (not necessarily self-mappings on K), which are defined by the contractive condition (2.1) below, and a class of pairs of mappings from K into X which satisfy the condition (2.28) below. We present fixed point and common fixed point theorems which are generalizations of the corresponding fixed point theorems of Ciric [L.B. Ciric, Quasi-contraction non-self mappings on Banach spaces, Bull. Acad. Serbe Sci. Arts 23 (1998) 25-31; L.B. Ciric, J.S. Ume, M.S. Khan, H.K.T. Pathak, On some non-self mappings, Math. Nachr. 251 (2003) 28-33], Rhoades [B.E. Rhoades, A fixed point theorem for some non-self mappings, Math. Japon. 23 (1978) 457-459] and many other authors. Some examples are presented to show that our results are genuine generalizations of known results from this area.

The evolving Planck mass in classically scale-invariant theories

NASA Astrophysics Data System (ADS)

Kannike, K.; Raidal, M.; Spethmann, C.; Veermäe, H.

2017-04-01

We consider classically scale-invariant theories with non-minimally coupled scalar fields, where the Planck mass and the hierarchy of physical scales are dynamically generated. The classical theories possess a fixed point, where scale invariance is spontaneously broken. In these theories, however, the Planck mass becomes unstable in the presence of explicit sources of scale invariance breaking, such as non-relativistic matter and cosmological constant terms. We quantify the constraints on such classical models from Big Bang Nucleosynthesis that lead to an upper bound on the non-minimal coupling and require trans-Planckian field values. We show that quantum corrections to the scalar potential can stabilise the fixed point close to the minimum of the Coleman-Weinberg potential. The time-averaged motion of the evolving fixed point is strongly suppressed, thus the limits on the evolving gravitational constant from Big Bang Nucleosynthesis and other measurements do not presently constrain this class of theories. Field oscillations around the fixed point, if not damped, contribute to the dark matter density of the Universe.

Hierarchical Higher Order Crf for the Classification of Airborne LIDAR Point Clouds in Urban Areas

NASA Astrophysics Data System (ADS)

Niemeyer, J.; Rottensteiner, F.; Soergel, U.; Heipke, C.

2016-06-01

We propose a novel hierarchical approach for the classification of airborne 3D lidar points. Spatial and semantic context is incorporated via a two-layer Conditional Random Field (CRF). The first layer operates on a point level and utilises higher order cliques. Segments are generated from the labelling obtained in this way. They are the entities of the second layer, which incorporates larger scale context. The classification result of the segments is introduced as an energy term for the next iteration of the point-based layer. This framework iterates and mutually propagates context to improve the classification results. Potentially wrong decisions can be revised at later stages. The output is a labelled point cloud as well as segments roughly corresponding to object instances. Moreover, we present two new contextual features for the segment classification: the distance and the orientation of a segment with respect to the closest road. It is shown that the classification benefits from these features. In our experiments the hierarchical framework improve the overall accuracies by 2.3% on a point-based level and by 3.0% on a segment-based level, respectively, compared to a purely point-based classification.

50 CFR 86.13 - What is boating infrastructure?

Code of Federal Regulations, 2010 CFR

2010-10-01

..., currents, etc., that provide a temporary safe anchorage point or harbor of refuge during storms); (f) Floating docks and fixed piers; (g) Floating and fixed breakwaters; (h) Dinghy docks (floating or fixed...

Parallel Fixed Point Implementation of a Radial Basis Function Network in an FPGA

PubMed Central

de Souza, Alisson C. D.; Fernandes, Marcelo A. C.

2014-01-01

This paper proposes a parallel fixed point radial basis function (RBF) artificial neural network (ANN), implemented in a field programmable gate array (FPGA) trained online with a least mean square (LMS) algorithm. The processing time and occupied area were analyzed for various fixed point formats. The problems of precision of the ANN response for nonlinear classification using the XOR gate and interpolation using the sine function were also analyzed in a hardware implementation. The entire project was developed using the System Generator platform (Xilinx), with a Virtex-6 xc6vcx240t-1ff1156 as the target FPGA. PMID:25268918

Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.

PubMed

Mori, Fumito; Mochizuki, Atsushi

2017-07-14

Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.

An investigation of the convergence to the stationary state in the Hassell mapping

NASA Astrophysics Data System (ADS)

de Mendonça, Hans M. J.; Leonel, Edson D.; de Oliveira, Juliano A.

2017-01-01

We investigate the convergence to the fixed point and near it in a transcritical bifurcation observed in a Hassell mapping. We considered a phenomenological description which was reinforced by a theoretical description. At the bifurcation, we confirm the convergence for the fixed point is characterized by a homogeneous function with three exponents. Near the bifurcation the decay to the fixed point is exponential with a relaxation time given by a power law. Although the expression of the mapping is different from the traditional logistic mapping, at the bifurcation and near it, the local dynamics is essentially the same for either mappings.

Automated Parameter Studies Using a Cartesian Method

NASA Technical Reports Server (NTRS)

Murman, Scott M.; Aftosimis, Michael J.; Nemec, Marian

2004-01-01

Computational Fluid Dynamics (CFD) is now routinely used to analyze isolated points in a design space by performing steady-state computations at fixed flight conditions (Mach number, angle of attack, sideslip), for a fixed geometric configuration of interest. This "point analysis" provides detailed information about the flowfield, which aides an engineer in understanding, or correcting, a design. A point analysis is typically performed using high fidelity methods at a handful of critical design points, e.g. a cruise or landing configuration, or a sample of points along a flight trajectory.

Test of prototype ITER vacuum ultraviolet spectrometer and its application to impurity study in KSTAR plasmas.

PubMed

Seon, C R; Hong, J H; Jang, J; Lee, S H; Choe, W; Lee, H H; Cheon, M S; Pak, S; Lee, H G; Biel, W; Barnsley, R

2014-11-01

To optimize the design of ITER vacuum ultraviolet (VUV) spectrometer, a prototype VUV spectrometer was developed. The sensitivity calibration curve of the spectrometer was calculated from the mirror reflectivity, the grating efficiency, and the detector efficiency. The calibration curve was consistent with the calibration points derived in the experiment using the calibrated hollow cathode lamp. For the application of the prototype ITER VUV spectrometer, the prototype spectrometer was installed at KSTAR, and various impurity emission lines could be measured. By analyzing about 100 shots, strong positive correlation between the O VI and the C IV emission intensities could be found.

On a new iterative method for solving linear systems and comparison results

NASA Astrophysics Data System (ADS)

Jing, Yan-Fei; Huang, Ting-Zhu

2008-10-01

In Ujevic [A new iterative method for solving linear systems, Appl. Math. Comput. 179 (2006) 725-730], the author obtained a new iterative method for solving linear systems, which can be considered as a modification of the Gauss-Seidel method. In this paper, we show that this is a special case from a point of view of projection techniques. And a different approach is established, which is both theoretically and numerically proven to be better than (at least the same as) Ujevic's. As the presented numerical examples show, in most cases, the convergence rate is more than one and a half that of Ujevic.

Generalized Pattern Search methods for a class of nonsmooth optimization problems with structure

NASA Astrophysics Data System (ADS)

Bogani, C.; Gasparo, M. G.; Papini, A.

2009-07-01

We propose a Generalized Pattern Search (GPS) method to solve a class of nonsmooth minimization problems, where the set of nondifferentiability is included in the union of known hyperplanes and, therefore, is highly structured. Both unconstrained and linearly constrained problems are considered. At each iteration the set of poll directions is enforced to conform to the geometry of both the nondifferentiability set and the boundary of the feasible region, near the current iterate. This is the key issue to guarantee the convergence of certain subsequences of iterates to points which satisfy first-order optimality conditions. Numerical experiments on some classical problems validate the method.

Drawing Dynamical and Parameters Planes of Iterative Families and Methods

PubMed Central

Chicharro, Francisco I.

2013-01-01

The complex dynamical analysis of the parametric fourth-order Kim's iterative family is made on quadratic polynomials, showing the MATLAB codes generated to draw the fractal images necessary to complete the study. The parameter spaces associated with the free critical points have been analyzed, showing the stable (and unstable) regions where the selection of the parameter will provide us the excellent schemes (or dreadful ones). PMID:24376386

Udzawa-type iterative method with parareal preconditioner for a parabolic optimal control problem

NASA Astrophysics Data System (ADS)

Lapin, A.; Romanenko, A.

2016-11-01

The article deals with the optimal control problem with the parabolic equation as state problem. There are point-wise constraints on the state and control functions. The objective functional involves the observation given in the domain at each moment. The conditions for convergence Udzawa's type iterative method are given. The parareal method to inverse preconditioner is given. The results of calculations are presented.

Changing the Way We Build Games: A Design-Based Research Study Examining the Implementation of Homemade PowerPoint Games in the Classroom

ERIC Educational Resources Information Center

Siko, Jason Paul

2012-01-01

This design-based research study examined the effects of a game design project on student test performance, with refinements made to the implementation after each of the three iterations of the study. The changes to the implementation over the three iterations were based on the literature for the three justifications for the use of homemade…

Quantitative FE-EPMA measurement of formation and inhibition of carbon contamination on Fe for trace carbon analysis.

PubMed

Tanaka, Yuji; Yamashita, Takako; Nagoshi, Masayasu

2017-04-01

Hydrocarbon contamination introduced during point, line and map analyses in a field emission electron probe microanalysis (FE-EPMA) was investigated to enable reliable quantitative analysis of trace amounts of carbon in steels. The increment of contamination on pure iron in point analysis is proportional to the number of iterations of beam irradiation, but not to the accumulated irradiation time. A combination of a longer dwell time and single measurement with a liquid nitrogen (LN2) trap as an anti-contamination device (ACD) is sufficient for a quantitative point analysis. However, in line and map analyses, contamination increases with irradiation time in addition to the number of iterations, even though the LN2 trap and a plasma cleaner are used as ACDs. Thus, a shorter dwell time and single measurement are preferred for line and map analyses, although it is difficult to eliminate the influence of contamination. While ring-like contamination around the irradiation point grows during electron-beam irradiation, contamination at the irradiation point increases during blanking time after irradiation. This can explain the increment of contamination in iterative point analysis as well as in line and map analyses. Among the ACDs, which are tested in this study, specimen heating at 373 K has a significant contamination inhibition effect. This technique makes it possible to obtain line and map analysis data with minimum influence of contamination. The above-mentioned FE-EPMA data are presented and discussed in terms of the contamination-formation mechanisms and the preferable experimental conditions for the quantification of trace carbon in steels. © The Author 2016. Published by Oxford University Press on behalf of The Japanese Society of Microscopy. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Parallelized implicit propagators for the finite-difference Schrödinger equation

NASA Astrophysics Data System (ADS)

Parker, Jonathan; Taylor, K. T.

1995-08-01

We describe the application of block Gauss-Seidel and block Jacobi iterative methods to the design of implicit propagators for finite-difference models of the time-dependent Schrödinger equation. The block-wise iterative methods discussed here are mixed direct-iterative methods for solving simultaneous equations, in the sense that direct methods (e.g. LU decomposition) are used to invert certain block sub-matrices, and iterative methods are used to complete the solution. We describe parallel variants of the basic algorithm that are well suited to the medium- to coarse-grained parallelism of work-station clusters, and MIMD supercomputers, and we show that under a wide range of conditions, fine-grained parallelism of the computation can be achieved. Numerical tests are conducted on a typical one-electron atom Hamiltonian. The methods converge robustly to machine precision (15 significant figures), in some cases in as few as 6 or 7 iterations. The rate of convergence is nearly independent of the finite-difference grid-point separations.

Generalized contractive mappings and weakly α-admissible pairs in G-metric spaces.

PubMed

Hussain, N; Parvaneh, V; Hoseini Ghoncheh, S J

2014-01-01

The aim of this paper is to present some coincidence and common fixed point results for generalized (ψ, φ)-contractive mappings using partially weakly G-α-admissibility in the setup of G-metric space. As an application of our results, periodic points of weakly contractive mappings are obtained. We also derive certain new coincidence point and common fixed point theorems in partially ordered G-metric spaces. Moreover, some examples are provided here to illustrate the usability of the obtained results.

Generalized Contractive Mappings and Weakly α-Admissible Pairs in G-Metric Spaces

PubMed Central

Hussain, N.; Parvaneh, V.; Hoseini Ghoncheh, S. J.

2014-01-01

The aim of this paper is to present some coincidence and common fixed point results for generalized (ψ, φ)-contractive mappings using partially weakly G-α-admissibility in the setup of G-metric space. As an application of our results, periodic points of weakly contractive mappings are obtained. We also derive certain new coincidence point and common fixed point theorems in partially ordered G-metric spaces. Moreover, some examples are provided here to illustrate the usability of the obtained results. PMID:25202742

Leveraging Anderson Acceleration for improved convergence of iterative solutions to transport systems

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

Willert, Jeffrey; Taitano, William T.; Knoll, Dana

In this note we demonstrate that using Anderson Acceleration (AA) in place of a standard Picard iteration can not only increase the convergence rate but also make the iteration more robust for two transport applications. We also compare the convergence acceleration provided by AA to that provided by moment-based acceleration methods. Additionally, we demonstrate that those two acceleration methods can be used together in a nested fashion. We begin by describing the AA algorithm. At this point, we will describe two application problems, one from neutronics and one from plasma physics, on which we will apply AA. We provide computationalmore » results which highlight the benefits of using AA, namely that we can compute solutions using fewer function evaluations, larger time-steps, and achieve a more robust iteration.« less

Ghost suppression in image restoration filtering

NASA Technical Reports Server (NTRS)

Riemer, T. E.; Mcgillem, C. D.

1975-01-01

An optimum image restoration filter is described in which provision is made to constrain the spatial extent of the restoration function, the noise level of the filter output and the rate of falloff of the composite system point-spread away from the origin. Experimental results show that sidelobes on the composite system point-spread function produce ghosts in the restored image near discontinuities in intensity level. By redetermining the filter using a penalty function that is zero over the main lobe of the composite point-spread function of the optimum filter and nonzero where the point-spread function departs from a smoothly decaying function in the sidelobe region, a great reduction in sidelobe level is obtained. Almost no loss in resolving power of the composite system results from this procedure. By iteratively carrying out the same procedure even further reductions in sidelobe level are obtained. Examples of original and iterated restoration functions are shown along with their effects on a test image.

Effect of thick blanket modules on neoclassical tearing mode locking in ITER

DOE PAGES

La Haye, R. J.; Paz-Soldan, C.; Liu, Y. Q.

2016-11-03

The rotation of m/n = 2/1 tearing modes can be slowed and stopped (i.e. locked) by eddy currents induced in resistive walls in conjunction with residual error fields that provide a final 'notch' point. This is a particular issue in ITER with large inertia and low applied torque (m and n are poloidal and toroidal mode numbers respectively). Previous estimates of tolerable 2/1 island widths in ITER found that the ITER electron cyclotron current drive (ECCD) system could catch and subdue such islands before they persisted long enough and grew large enough to lock. These estimates were based on amore » forecast of initial island rotation using the n = 1 resistive penetration time of the inner vacuum vessel wall and benchmarked to DIII-D high-rotation plasmas, However, rotating tearing modes in ITER will also induce eddy currents in the blanket as the effective first wall that can shield the inner vessel. The closer fitting blanket wall has a much shorter time constant and should allow several times smaller islands to lock several times faster in ITER than previously considered; this challenges the ECCD stabilization. Here, recent DIII-D ITER baseline scenario (IBS) plasmas with low rotation through small applied torque allow better modeling and scaling to ITER with the blanket as the first resistive wall.« less

Effect of thick blanket modules on neoclassical tearing mode locking in ITER

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

La Haye, R. J.; Paz-Soldan, C.; Liu, Y. Q.

The rotation of m/n = 2/1 tearing modes can be slowed and stopped (i.e. locked) by eddy currents induced in resistive walls in conjunction with residual error fields that provide a final 'notch' point. This is a particular issue in ITER with large inertia and low applied torque (m and n are poloidal and toroidal mode numbers respectively). Previous estimates of tolerable 2/1 island widths in ITER found that the ITER electron cyclotron current drive (ECCD) system could catch and subdue such islands before they persisted long enough and grew large enough to lock. These estimates were based on amore » forecast of initial island rotation using the n = 1 resistive penetration time of the inner vacuum vessel wall and benchmarked to DIII-D high-rotation plasmas, However, rotating tearing modes in ITER will also induce eddy currents in the blanket as the effective first wall that can shield the inner vessel. The closer fitting blanket wall has a much shorter time constant and should allow several times smaller islands to lock several times faster in ITER than previously considered; this challenges the ECCD stabilization. Here, recent DIII-D ITER baseline scenario (IBS) plasmas with low rotation through small applied torque allow better modeling and scaling to ITER with the blanket as the first resistive wall.« less

On the multivariate total least-squares approach to empirical coordinate transformations. Three algorithms

NASA Astrophysics Data System (ADS)

Schaffrin, Burkhard; Felus, Yaron A.

2008-06-01

The multivariate total least-squares (MTLS) approach aims at estimating a matrix of parameters, Ξ, from a linear model ( Y- E Y = ( X- E X ) · Ξ) that includes an observation matrix, Y, another observation matrix, X, and matrices of randomly distributed errors, E Y and E X . Two special cases of the MTLS approach include the standard multivariate least-squares approach where only the observation matrix, Y, is perturbed by random errors and, on the other hand, the data least-squares approach where only the coefficient matrix X is affected by random errors. In a previous contribution, the authors derived an iterative algorithm to solve the MTLS problem by using the nonlinear Euler-Lagrange conditions. In this contribution, new lemmas are developed to analyze the iterative algorithm, modify it, and compare it with a new ‘closed form’ solution that is based on the singular-value decomposition. For an application, the total least-squares approach is used to estimate the affine transformation parameters that convert cadastral data from the old to the new Israeli datum. Technical aspects of this approach, such as scaling the data and fixing the columns in the coefficient matrix are investigated. This case study illuminates the issue of “symmetry” in the treatment of two sets of coordinates for identical point fields, a topic that had already been emphasized by Teunissen (1989, Festschrift to Torben Krarup, Geodetic Institute Bull no. 58, Copenhagen, Denmark, pp 335-342). The differences between the standard least-squares and the TLS approach are analyzed in terms of the estimated variance component and a first-order approximation of the dispersion matrix of the estimated parameters.

Image quality of multiplanar reconstruction of pulmonary CT scans using adaptive statistical iterative reconstruction

PubMed Central

Honda, O; Yanagawa, M; Inoue, A; Kikuyama, A; Yoshida, S; Sumikawa, H; Tobino, K; Koyama, M; Tomiyama, N

2011-01-01

Objective We investigated the image quality of multiplanar reconstruction (MPR) using adaptive statistical iterative reconstruction (ASIR). Methods Inflated and fixed lungs were scanned with a garnet detector CT in high-resolution mode (HR mode) or non-high-resolution (HR) mode, and MPR images were then reconstructed. Observers compared 15 MPR images of ASIR (40%) and ASIR (80%) with those of ASIR (0%), and assessed image quality using a visual five-point scale (1, definitely inferior; 5, definitely superior), with particular emphasis on normal pulmonary structures, artefacts, noise and overall image quality. Results The mean overall image quality scores in HR mode were 3.67 with ASIR (40%) and 4.97 with ASIR (80%). Those in non-HR mode were 3.27 with ASIR (40%) and 3.90 with ASIR (80%). The mean artefact scores in HR mode were 3.13 with ASIR (40%) and 3.63 with ASIR (80%), but those in non-HR mode were 2.87 with ASIR (40%) and 2.53 with ASIR (80%). The mean scores of the other parameters were greater than 3, whereas those in HR mode were higher than those in non-HR mode. There were significant differences between ASIR (40%) and ASIR (80%) in overall image quality (p<0.01). Contrast medium in the injection syringe was scanned to analyse image quality; ASIR did not suppress the severe artefacts of contrast medium. Conclusion In general, MPR image quality with ASIR (80%) was superior to that with ASIR (40%). However, there was an increased incidence of artefacts by ASIR when CT images were obtained in non-HR mode. PMID:21081572

50 CFR 660.212 - Fixed gear fishery-prohibitions.

Code of Federal Regulations, 2010 CFR

2010-10-01

..., Painted Cave, Anacapa Island, Carrington Point, Judith Rock, Skunk Point, Footprint, Gull Island, South... are specific to the limited entry fixed gear fisheries. General groundfish prohibitions are found at § 660.12, subpart C. In addition to the general groundfish prohibitions specified in § 660.12, subpart C...

L-fuzzy fixed points theorems for L-fuzzy mappings via βℱL-admissible pair.

PubMed

Rashid, Maliha; Azam, Akbar; Mehmood, Nayyar

2014-01-01

We define the concept of βℱL-admissible for a pair of L-fuzzy mappings and establish the existence of common L-fuzzy fixed point theorem. Our result generalizes some useful results in the literature. We provide an example to support our result.

Network Aggregation in Transportation Planning : Volume II : A Fixed Point Method for Treating Traffic Equilibria

DOT National Transportation Integrated Search

1978-04-01

Volume 2 defines a new algorithm for the network equilibrium model that works in the space of path flows and is based on the theory of fixed point method. The goals of the study were broadly defined as the identification of aggregation practices and ...

SHORT COMMUNICATION: Correlation between the Resistance Ratios of Platinum Resistance Thermometers at the Melting Point of Gallium and the Triple Point of Mercury

NASA Astrophysics Data System (ADS)

Singh, Y. P.; Maas, H.; Edler, F.; Zaidi, Z. H.

1994-01-01

A set of resistance ratios (W) for platinum resistance thermometers was obtained at the triple point of Hg and the melting point of Ga in order to study their relationship. It was found that using measured values for one of the fixed points, a linear equation will predict the value of the other. These measurements also indicate that the fixed points of Hg and of Ga are inconsistent by about 1,5 mK in the sense that either the melting point of Ga or the triple point of Hg was assigned too high a value on the ITS-90.

Multi-point objective-oriented sequential sampling strategy for constrained robust design

NASA Astrophysics Data System (ADS)

Zhu, Ping; Zhang, Siliang; Chen, Wei

2015-03-01

Metamodelling techniques are widely used to approximate system responses of expensive simulation models. In association with the use of metamodels, objective-oriented sequential sampling methods have been demonstrated to be effective in balancing the need for searching an optimal solution versus reducing the metamodelling uncertainty. However, existing infilling criteria are developed for deterministic problems and restricted to one sampling point in one iteration. To exploit the use of multiple samples and identify the true robust solution in fewer iterations, a multi-point objective-oriented sequential sampling strategy is proposed for constrained robust design problems. In this article, earlier development of objective-oriented sequential sampling strategy for unconstrained robust design is first extended to constrained problems. Next, a double-loop multi-point sequential sampling strategy is developed. The proposed methods are validated using two mathematical examples followed by a highly nonlinear automotive crashworthiness design example. The results show that the proposed method can mitigate the effect of both metamodelling uncertainty and design uncertainty, and identify the robust design solution more efficiently than the single-point sequential sampling approach.

Identification of stable areas in unreferenced laser scans for automated geomorphometric monitoring

NASA Astrophysics Data System (ADS)

Wujanz, Daniel; Avian, Michael; Krueger, Daniel; Neitzel, Frank

2018-04-01

Current research questions in the field of geomorphology focus on the impact of climate change on several processes subsequently causing natural hazards. Geodetic deformation measurements are a suitable tool to document such geomorphic mechanisms, e.g. by capturing a region of interest with terrestrial laser scanners which results in a so-called 3-D point cloud. The main problem in deformation monitoring is the transformation of 3-D point clouds captured at different points in time (epochs) into a stable reference coordinate system. In this contribution, a surface-based registration methodology is applied, termed the iterative closest proximity algorithm (ICProx), that solely uses point cloud data as input, similar to the iterative closest point algorithm (ICP). The aim of this study is to automatically classify deformations that occurred at a rock glacier and an ice glacier, as well as in a rockfall area. For every case study, two epochs were processed, while the datasets notably differ in terms of geometric characteristics, distribution and magnitude of deformation. In summary, the ICProx algorithm's classification accuracy is 70 % on average in comparison to reference data.

Fixed points of contractive mappings in b-metric-like spaces.

PubMed

Hussain, Nawab; Roshan, Jamal Rezaei; Parvaneh, Vahid; Kadelburg, Zoran

2014-01-01

We discuss topological structure of b-metric-like spaces and demonstrate a fundamental lemma for the convergence of sequences. As an application we prove certain fixed point results in the setup of such spaces for different types of contractive mappings. Finally, some periodic point results in b-metric-like spaces are obtained. Two examples are presented in order to verify the effectiveness and applicability of our main results.

Highly multiplexed single-cell analysis of formalin-fixed, paraffin-embedded cancer tissue

PubMed Central

Gerdes, Michael J.; Sevinsky, Christopher J.; Sood, Anup; Adak, Sudeshna; Bello, Musodiq O.; Bordwell, Alexander; Can, Ali; Corwin, Alex; Dinn, Sean; Filkins, Robert J.; Hollman, Denise; Kamath, Vidya; Kaanumalle, Sireesha; Kenny, Kevin; Larsen, Melinda; Lazare, Michael; Lowes, Christina; McCulloch, Colin C.; McDonough, Elizabeth; Pang, Zhengyu; Rittscher, Jens; Santamaria-Pang, Alberto; Sarachan, Brion D.; Seel, Maximilian L.; Seppo, Antti; Shaikh, Kashan; Sui, Yunxia; Zhang, Jingyu; Ginty, Fiona

2013-01-01

Limitations on the number of unique protein and DNA molecules that can be characterized microscopically in a single tissue specimen impede advances in understanding the biological basis of health and disease. Here we present a multiplexed fluorescence microscopy method (MxIF) for quantitative, single-cell, and subcellular characterization of multiple analytes in formalin-fixed paraffin-embedded tissue. Chemical inactivation of fluorescent dyes after each image acquisition round allows reuse of common dyes in iterative staining and imaging cycles. The mild inactivation chemistry is compatible with total and phosphoprotein detection, as well as DNA FISH. Accurate computational registration of sequential images is achieved by aligning nuclear counterstain-derived fiducial points. Individual cells, plasma membrane, cytoplasm, nucleus, tumor, and stromal regions are segmented to achieve cellular and subcellular quantification of multiplexed targets. In a comparison of pathologist scoring of diaminobenzidine staining of serial sections and automated MxIF scoring of a single section, human epidermal growth factor receptor 2, estrogen receptor, p53, and androgen receptor staining by diaminobenzidine and MxIF methods yielded similar results. Single-cell staining patterns of 61 protein antigens by MxIF in 747 colorectal cancer subjects reveals extensive tumor heterogeneity, and cluster analysis of divergent signaling through ERK1/2, S6 kinase 1, and 4E binding protein 1 provides insights into the spatial organization of mechanistic target of rapamycin and MAPK signal transduction. Our results suggest MxIF should be broadly applicable to problems in the fields of basic biological research, drug discovery and development, and clinical diagnostics. PMID:23818604

Highly multiplexed single-cell analysis of formalin-fixed, paraffin-embedded cancer tissue.

PubMed

Gerdes, Michael J; Sevinsky, Christopher J; Sood, Anup; Adak, Sudeshna; Bello, Musodiq O; Bordwell, Alexander; Can, Ali; Corwin, Alex; Dinn, Sean; Filkins, Robert J; Hollman, Denise; Kamath, Vidya; Kaanumalle, Sireesha; Kenny, Kevin; Larsen, Melinda; Lazare, Michael; Li, Qing; Lowes, Christina; McCulloch, Colin C; McDonough, Elizabeth; Montalto, Michael C; Pang, Zhengyu; Rittscher, Jens; Santamaria-Pang, Alberto; Sarachan, Brion D; Seel, Maximilian L; Seppo, Antti; Shaikh, Kashan; Sui, Yunxia; Zhang, Jingyu; Ginty, Fiona

2013-07-16

Limitations on the number of unique protein and DNA molecules that can be characterized microscopically in a single tissue specimen impede advances in understanding the biological basis of health and disease. Here we present a multiplexed fluorescence microscopy method (MxIF) for quantitative, single-cell, and subcellular characterization of multiple analytes in formalin-fixed paraffin-embedded tissue. Chemical inactivation of fluorescent dyes after each image acquisition round allows reuse of common dyes in iterative staining and imaging cycles. The mild inactivation chemistry is compatible with total and phosphoprotein detection, as well as DNA FISH. Accurate computational registration of sequential images is achieved by aligning nuclear counterstain-derived fiducial points. Individual cells, plasma membrane, cytoplasm, nucleus, tumor, and stromal regions are segmented to achieve cellular and subcellular quantification of multiplexed targets. In a comparison of pathologist scoring of diaminobenzidine staining of serial sections and automated MxIF scoring of a single section, human epidermal growth factor receptor 2, estrogen receptor, p53, and androgen receptor staining by diaminobenzidine and MxIF methods yielded similar results. Single-cell staining patterns of 61 protein antigens by MxIF in 747 colorectal cancer subjects reveals extensive tumor heterogeneity, and cluster analysis of divergent signaling through ERK1/2, S6 kinase 1, and 4E binding protein 1 provides insights into the spatial organization of mechanistic target of rapamycin and MAPK signal transduction. Our results suggest MxIF should be broadly applicable to problems in the fields of basic biological research, drug discovery and development, and clinical diagnostics.

Simulation of design-unbiased point-to-particle sampling compared to alternatives on plantation rows

Treesearch

Thomas B. Lynch; David Hamlin; Mark J. Ducey

2016-01-01

Total quantities of tree attributes can be estimated in plantations by sampling on plantation rows using several methods. At random sample points on a row, either fixed row lengths or variable row lengths with a fixed number of sample trees can be assessed. Ratio of means or mean of ratios estimators can be developed for the fixed number of trees option but are not...

A New Method for Analyzing Near-Field Faraday Probe Data in Hall Thrusters

NASA Technical Reports Server (NTRS)

Huang, Wensheng; Shastry, Rohit; Herman, Daniel A.; Soulas, George C.; Kamhawi, Hani

2013-01-01

This paper presents a new method for analyzing near-field Faraday probe data obtained from Hall thrusters. Traditional methods spawned from far-field Faraday probe analysis rely on assumptions that are not applicable to near-field Faraday probe data. In particular, arbitrary choices for the point of origin and limits of integration have made interpretation of the results difficult. The new method, called iterative pathfinding, uses the evolution of the near-field plume with distance to provide feedback for determining the location of the point of origin. Although still susceptible to the choice of integration limits, this method presents a systematic approach to determining the origin point for calculating the divergence angle. The iterative pathfinding method is applied to near-field Faraday probe data taken in a previous study from the NASA-300M and NASA-457Mv2 Hall thrusters. Since these two thrusters use centrally mounted cathodes the current density associated with the cathode plume is removed before applying iterative pathfinding. A procedure is presented for removing the cathode plume. The results of the analysis are compared to far-field probe analysis results. This paper ends with checks on the validity of the new method and discussions on the implications of the results.

A New Method for Analyzing Near-Field Faraday Probe Data in Hall Thrusters

NASA Technical Reports Server (NTRS)

Huang, Wensheng; Shastry, Rohit; Herman, Daniel A.; Soulas, George C.; Kamhawi, Hani

2013-01-01

This paper presents a new method for analyzing near-field Faraday probe data obtained from Hall thrusters. Traditional methods spawned from far-field Faraday probe analysis rely on assumptions that are not applicable to near-field Faraday probe data. In particular, arbitrary choices for the point of origin and limits of integration have made interpretation of the results difficult. The new method, called iterative pathfinding, uses the evolution of the near-field plume with distance to provide feedback for determining the location of the point of origin. Although still susceptible to the choice of integration limits, this method presents a systematic approach to determining the origin point for calculating the divergence angle. The iterative pathfinding method is applied to near-field Faraday probe data taken in a previous study from the NASA-300M and NASA-457Mv2 Hall thrusters. Since these two thrusters use centrally mounted cathodes, the current density associated with the cathode plume is removed before applying iterative pathfinding. A procedure is presented for removing the cathode plume. The results of the analysis are compared to far-field probe analysis results. This paper ends with checks on the validity of the new method and discussions on the implications of the results.

Impedance computed tomography using an adaptive smoothing coefficient algorithm.

PubMed

Suzuki, A; Uchiyama, A

2001-01-01

In impedance computed tomography, a fixed coefficient regularization algorithm has been frequently used to improve the ill-conditioning problem of the Newton-Raphson algorithm. However, a lot of experimental data and a long period of computation time are needed to determine a good smoothing coefficient because a good smoothing coefficient has to be manually chosen from a number of coefficients and is a constant for each iteration calculation. Thus, sometimes the fixed coefficient regularization algorithm distorts the information or fails to obtain any effect. In this paper, a new adaptive smoothing coefficient algorithm is proposed. This algorithm automatically calculates the smoothing coefficient from the eigenvalue of the ill-conditioned matrix. Therefore, the effective images can be obtained within a short computation time. Also the smoothing coefficient is automatically adjusted by the information related to the real resistivity distribution and the data collection method. In our impedance system, we have reconstructed the resistivity distributions of two phantoms using this algorithm. As a result, this algorithm only needs one-fifth the computation time compared to the fixed coefficient regularization algorithm. When compared to the fixed coefficient regularization algorithm, it shows that the image is obtained more rapidly and applicable in real-time monitoring of the blood vessel.

Digital micromirror device as amplitude diffuser for multiple-plane phase retrieval

NASA Astrophysics Data System (ADS)

Abregana, Timothy Joseph T.; Hermosa, Nathaniel P.; Almoro, Percival F.

2017-06-01

Previous implementations of the phase diffuser used in the multiple-plane phase retrieval method included a diffuser glass plate with fixed optical properties or a programmable yet expensive spatial light modulator. Here a model for phase retrieval based on a digital micromirror device as amplitude diffuser is presented. The technique offers programmable, convenient and low-cost amplitude diffuser for a non-stagnating iterative phase retrieval. The technique is demonstrated in the reconstructions of smooth object wavefronts.

An iteration algorithm for optimal network flows

NASA Astrophysics Data System (ADS)

Woong, C. J.

1983-09-01

A packet switching network has the desirable feature of rapidly handling short (bursty) messages of the type often found in computer communication systems. In evaluating packet switching networks, the average time delay per packet is one of the most important measures of performance. The problem of message routing to minimize time delay is analyzed here using two approaches, called "successive saturation' and "max-slack', for various traffic requirement matrices and networks with fixed topology and link capacities.

A multiscale fixed stress split iterative scheme for coupled flow and poromechanics in deep subsurface reservoirs

NASA Astrophysics Data System (ADS)

Dana, Saumik; Ganis, Benjamin; Wheeler, Mary F.

2018-01-01

In coupled flow and poromechanics phenomena representing hydrocarbon production or CO2 sequestration in deep subsurface reservoirs, the spatial domain in which fluid flow occurs is usually much smaller than the spatial domain over which significant deformation occurs. The typical approach is to either impose an overburden pressure directly on the reservoir thus treating it as a coupled problem domain or to model flow on a huge domain with zero permeability cells to mimic the no flow boundary condition on the interface of the reservoir and the surrounding rock. The former approach precludes a study of land subsidence or uplift and further does not mimic the true effect of the overburden on stress sensitive reservoirs whereas the latter approach has huge computational costs. In order to address these challenges, we augment the fixed-stress split iterative scheme with upscaling and downscaling operators to enable modeling flow and mechanics on overlapping nonmatching hexahedral grids. Flow is solved on a finer mesh using a multipoint flux mixed finite element method and mechanics is solved on a coarse mesh using a conforming Galerkin method. The multiscale operators are constructed using a procedure that involves singular value decompositions, a surface intersections algorithm and Delaunay triangulations. We numerically demonstrate the convergence of the augmented scheme using the classical Mandel's problem solution.

Application of a GPU-Assisted Maxwell Code to Electromagnetic Wave Propagation in ITER

NASA Astrophysics Data System (ADS)

Kubota, S.; Peebles, W. A.; Woodbury, D.; Johnson, I.; Zolfaghari, A.

2014-10-01

The Low Field Side Reflectometer (LSFR) on ITER is envisioned to provide capabilities for electron density profile and fluctuations measurements in both the plasma core and edge. The current design for the Equatorial Port Plug 11 (EPP11) employs seven monostatic antennas for use with both fixed-frequency and swept-frequency systems. The present work examines the characteristics of this layout using the 3-D version of the GPU-Assisted Maxwell Code (GAMC-3D). Previous studies in this area were performed with either 2-D full wave codes or 3-D ray- and beam-tracing. GAMC-3D is based on the FDTD method and can be run with either a fixed-frequency or modulated (e.g. FMCW) source, and with either a stationary or moving target (e.g. Doppler backscattering). The code is designed to run on a single NVIDIA Tesla GPU accelerator, and utilizes a technique based on the moving window method to overcome the size limitation of the onboard memory. Effects such as beam drift, linear mode conversion, and diffraction/scattering will be examined. Comparisons will be made with beam-tracing calculations using the complex eikonal method. Supported by U.S. DoE Grants DE-FG02-99ER54527 and DE-AC02-09CH11466, and the DoE SULI Program at PPPL.

Final report on COOMET.T-S1. Comparison of type S thermocouples at the freezing points of zinc, aluminium and copper 2014—2015

NASA Astrophysics Data System (ADS)

Pokhodun, A. I.; Ivanova, A. G.; Duysebayeva, K. K.; Ivanova, K. P.

2015-01-01

Regional comparison of type S thermocouples at the freezing points of zinc, aluminium and copper was initiated by COOMET TC1.1-10 (the technical committee of COOMET `Thermometry and thermal physics'). Three NMI take part in COOMET regional comparison: D I Mendeleev Institute for Metrology (VNIIM) (Russian Federation), National Scientific Centre (Institute of Metrology) (NSC IM, Ukraine), Republic State Enterprise (Kazakhstan Institute of Metrology) (KazInMetr, Republic of Kazakhstan). VNIIM (Russia) was chosen as the coordinator-pilot of the regional comparison. A star type comparison was used. The participants: KazInMetr and NSC IM constructed the type S thermocouples and calibrated them in three fixed points: zinc, aluminum and copper points, using methods of ITS-90 fixed point realizations. The thermocouples have been sent to VNIIM together with the results of the calibration at three fixed points, with the values of the inhomogeneity at temperature 200 °C and the uncertainty evaluations of the results. For calibration of thermocouples the same VNIIM fixed points cells were used. Participating laboratories repeated the calibration of thermocouples after its returning in zinc, aluminum and copper points to determine the stability of its results. In result of the comparison was to evaluate the equivalence of the type S thermocouples calibration in fixed points by NMIs to confirm corresponding lines of international website for NMI's Calibration and Measurement Capabilities (CMC). This paper is the final report of the comparison including analysis of the uncertainty of measurement results. Main text. To reach the main text of this paper, click on Final Report. Note that this text is that which appears in Appendix B of the BIPM key comparison database kcdb.bipm.org/. The final report has been peer-reviewed and approved for publication by the CCT WG-KC, according to the provisions of the CIPM Mutual Recognition Arrangement (CIPM MRA).

MPL-A program for computations with iterated integrals on moduli spaces of curves of genus zero

NASA Astrophysics Data System (ADS)

Bogner, Christian

2016-06-01

We introduce the Maple program MPL for computations with multiple polylogarithms. The program is based on homotopy invariant iterated integrals on moduli spaces M0,n of curves of genus 0 with n ordered marked points. It includes the symbol map and procedures for the analytic computation of period integrals on M0,n. It supports the automated computation of a certain class of Feynman integrals.

Simulation of RF-fields in a fusion device

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

De Witte, Dieter; Bogaert, Ignace; De Zutter, Daniel

2009-11-26

In this paper the problem of scattering off a fusion plasma is approached from the point of view of integral equations. Using the volume equivalence principle an integral equation is derived which describes the electromagnetic fields in a plasma. The equation is discretized with MoM using conforming basis functions. This reduces the problem to solving a dense matrix equation. This can be done iteratively. Each iteration can be sped up using FFTs.

Influence of Iterative Reconstruction Algorithms on PET Image Resolution

NASA Astrophysics Data System (ADS)

Karpetas, G. E.; Michail, C. M.; Fountos, G. P.; Valais, I. G.; Nikolopoulos, D.; Kandarakis, I. S.; Panayiotakis, G. S.

2015-09-01

The aim of the present study was to assess image quality of PET scanners through a thin layer chromatography (TLC) plane source. The source was simulated using a previously validated Monte Carlo model. The model was developed by using the GATE MC package and reconstructed images obtained with the STIR software for tomographic image reconstruction. The simulated PET scanner was the GE DiscoveryST. A plane source consisted of a TLC plate, was simulated by a layer of silica gel on aluminum (Al) foil substrates, immersed in 18F-FDG bath solution (1MBq). Image quality was assessed in terms of the modulation transfer function (MTF). MTF curves were estimated from transverse reconstructed images of the plane source. Images were reconstructed by the maximum likelihood estimation (MLE)-OSMAPOSL, the ordered subsets separable paraboloidal surrogate (OSSPS), the median root prior (MRP) and OSMAPOSL with quadratic prior, algorithms. OSMAPOSL reconstruction was assessed by using fixed subsets and various iterations, as well as by using various beta (hyper) parameter values. MTF values were found to increase with increasing iterations. MTF also improves by using lower beta values. The simulated PET evaluation method, based on the TLC plane source, can be useful in the resolution assessment of PET scanners.

Guidelines for internal optics optimization of the ITER EC H and CD upper launcher

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

Moro, A.; Bruschi, A.; Figini, L.

2014-02-12

The importance of localized injection of Electron Cyclotron waves to control Magneto-HydroDynamic instability is well assessed in tokamak physics and the set of four Electron Cyclotron (EC) Upper Launchers (UL) in ITER is mainly designed for this purpose. Each of the 4 ULs uses quasi-optical mirrors (shaping and planes, fixed and steerable) to redirect and focus 8 beams (in two rows, with power close to 1 MW per beam coming from the EC transmission lines) in the plasma region where the instability appears. Small beam dimensions and maximum beam superposition guarantee the necessary localization of the driven current. To achievemore » the goal of MHD stabilization with minimum EC power to preserve the energy confinement in the outer half of the plasma cross section, optimization of the quasi-optical design is required and a guideline of a strategy is presented. As a result of this process and following the guidelines indicated, modifications of the design (new mirrors positions, rotation axes and/or focal properties) will be proposed for the next step of an iterative process, including the mandatory compatibility check with the mechanical constraints.« less

Computational approach to compact Riemann surfaces

NASA Astrophysics Data System (ADS)

Frauendiener, Jörg; Klein, Christian

2017-01-01

A purely numerical approach to compact Riemann surfaces starting from plane algebraic curves is presented. The critical points of the algebraic curve are computed via a two-dimensional Newton iteration. The starting values for this iteration are obtained from the resultants with respect to both coordinates of the algebraic curve and a suitable pairing of their zeros. A set of generators of the fundamental group for the complement of these critical points in the complex plane is constructed from circles around these points and connecting lines obtained from a minimal spanning tree. The monodromies are computed by solving the defining equation of the algebraic curve on collocation points along these contours and by analytically continuing the roots. The collocation points are chosen to correspond to Chebychev collocation points for an ensuing Clenshaw-Curtis integration of the holomorphic differentials which gives the periods of the Riemann surface with spectral accuracy. At the singularities of the algebraic curve, Puiseux expansions computed by contour integration on the circles around the singularities are used to identify the holomorphic differentials. The Abel map is also computed with the Clenshaw-Curtis algorithm and contour integrals. As an application of the code, solutions to the Kadomtsev-Petviashvili equation are computed on non-hyperelliptic Riemann surfaces.

The four fixed points of scale invariant single field cosmological models

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

Xue, BingKan, E-mail: bxue@princeton.edu

2012-10-01

We introduce a new set of flow parameters to describe the time dependence of the equation of state and the speed of sound in single field cosmological models. A scale invariant power spectrum is produced if these flow parameters satisfy specific dynamical equations. We analyze the flow of these parameters and find four types of fixed points that encompass all known single field models. Moreover, near each fixed point we uncover new models where the scale invariance of the power spectrum relies on having simultaneously time varying speed of sound and equation of state. We describe several distinctive new modelsmore » and discuss constraints from strong coupling and superluminality.« less

The Holographic F Theorem

NASA Astrophysics Data System (ADS)

Taylor, Marika; Woodhead, William

2017-12-01

The F theorem states that, for a unitary three dimensional quantum field theory, the F quantity defined in terms of the partition function on a three sphere is positive, stationary at fixed point and decreases monotonically along a renormalization group flow. We construct holographic renormalization group flows corresponding to relevant deformations of three-dimensional conformal field theories on spheres, working to quadratic order in the source. For these renormalization group flows, the F quantity at the IR fixed point is always less than F at the UV fixed point, but F increases along the RG flow for deformations by operators of dimension between 3/2 and 5/2. Therefore the strongest version of the F theorem is in general violated.

Bilateral Comparison Between NIM and NMC Over the Temperature Range from 83.8058 K to 692.677 K

NASA Astrophysics Data System (ADS)

Sun, Jianping; Ye, Shaochun; Kho, Haoyuan; Zhang, Jintao; Wang, Li

2015-08-01

A bilateral comparison of local realization of the International Temperature Scale of 1990 between the National Institute of Metrology (NIM) and National Metrology Centre (NMC) was carried out over the temperature range from 83.8058 K to 692.677 K. It involved six fixed points including the argon triple point, the mercury triple point, the triple point of water, the melting point of gallium, the freezing point of tin, and the freezing point of zinc. In 2009, NMC asked NIM to participate in a bilateral comparison to link the NMC results to the Consultative Committee for Thermometry Key Comparison 3 (CCT-K3) and facilitate the NMC's calibration and measurement capabilities submission. This comparison was agreed by NIM and Asia Pacific Metrology Programme in 2009, and registered in the Key Comparison Database in 2010 as CCT-K3.2. NMC supplied two fused silica sheath standard platinum resistance thermometers (SPRTs) as traveling standards. One of them was used at the Ga, Sn, and Zn fixed points, while the other one was used at the Ar and Hg fixed points. NMC measured them before and after NIM measured them. During the comparison, a criterion for the SPRT was set as the stability at the triple point of water to be less than 0.3 mK. The results for both laboratories are summarized. A proposal for linking the NMC's comparison results to CCT-K3 is presented. The difference between NMC and NIM and the difference between NMC and the CCT-K3 average reference value using NIM as a link are reported with expanded uncertainties at each measured fixed point.

Achieving algorithmic resilience for temporal integration through spectral deferred corrections

DOE PAGES

Grout, Ray; Kolla, Hemanth; Minion, Michael; ...

2017-05-08

Spectral deferred corrections (SDC) is an iterative approach for constructing higher-order-accurate numerical approximations of ordinary differential equations. SDC starts with an initial approximation of the solution defined at a set of Gaussian or spectral collocation nodes over a time interval and uses an iterative application of lower-order time discretizations applied to a correction equation to improve the solution at these nodes. Each deferred correction sweep increases the formal order of accuracy of the method up to the limit inherent in the accuracy defined by the collocation points. In this paper, we demonstrate that SDC is well suited to recovering frommore » soft (transient) hardware faults in the data. A strategy where extra correction iterations are used to recover from soft errors and provide algorithmic resilience is proposed. Specifically, in this approach the iteration is continued until the residual (a measure of the error in the approximation) is small relative to the residual of the first correction iteration and changes slowly between successive iterations. Here, we demonstrate the effectiveness of this strategy for both canonical test problems and a comprehensive situation involving a mature scientific application code that solves the reacting Navier-Stokes equations for combustion research.« less

Experiments on water detritiation and cryogenic distillation at TLK; Impact on ITER fuel cycle subsystems interfaces

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

Cristescu, I.; Cristescu, I. R.; Doerr, L.

2008-07-15

The ITER Isotope Separation System (ISS) and Water Detritiation System (WDS) should be integrated in order to reduce potential chronic tritium emissions from the ISS. This is achieved by routing the top (protium) product from the ISS to a feed point near the bottom end of the WDS Liquid Phase Catalytic Exchange (LPCE) column. This provides an additional barrier against ISS emissions and should mitigate the memory effects due to process parameter fluctuations in the ISS. To support the research activities needed to characterize the performances of various components for WDS and ISS processes under various working conditions and configurationsmore » as needed for ITER design, an experimental facility called TRENTA representative of the ITER WDS and ISS protium separation column, has been commissioned and is in operation at TLK The experimental program on TRENTA facility is conducted to provide the necessary design data related to the relevant ITER operating modes. The operation availability and performances of ISS-WDS have impact on ITER fuel cycle subsystems with consequences on the design integration. The preliminary experimental data on TRENTA facility are presented. (authors)« less

Achieving algorithmic resilience for temporal integration through spectral deferred corrections

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

Grout, Ray; Kolla, Hemanth; Minion, Michael

2017-05-08

Spectral deferred corrections (SDC) is an iterative approach for constructing higher- order accurate numerical approximations of ordinary differential equations. SDC starts with an initial approximation of the solution defined at a set of Gaussian or spectral collocation nodes over a time interval and uses an iterative application of lower-order time discretizations applied to a correction equation to improve the solution at these nodes. Each deferred correction sweep increases the formal order of accuracy of the method up to the limit inherent in the accuracy defined by the collocation points. In this paper, we demonstrate that SDC is well suited tomore » recovering from soft (transient) hardware faults in the data. A strategy where extra correction iterations are used to recover from soft errors and provide algorithmic resilience is proposed. Specifically, in this approach the iteration is continued until the residual (a measure of the error in the approximation) is small relative to the residual on the first correction iteration and changes slowly between successive iterations. We demonstrate the effectiveness of this strategy for both canonical test problems and a comprehen- sive situation involving a mature scientific application code that solves the reacting Navier-Stokes equations for combustion research.« less

Achieving algorithmic resilience for temporal integration through spectral deferred corrections

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

Grout, Ray; Kolla, Hemanth; Minion, Michael

2017-05-08

Spectral deferred corrections (SDC) is an iterative approach for constructing higher-order-accurate numerical approximations of ordinary differential equations. SDC starts with an initial approximation of the solution defined at a set of Gaussian or spectral collocation nodes over a time interval and uses an iterative application of lower-order time discretizations applied to a correction equation to improve the solution at these nodes. Each deferred correction sweep increases the formal order of accuracy of the method up to the limit inherent in the accuracy defined by the collocation points. In this paper, we demonstrate that SDC is well suited to recovering frommore » soft (transient) hardware faults in the data. A strategy where extra correction iterations are used to recover from soft errors and provide algorithmic resilience is proposed. Specifically, in this approach the iteration is continued until the residual (a measure of the error in the approximation) is small relative to the residual of the first correction iteration and changes slowly between successive iterations. We demonstrate the effectiveness of this strategy for both canonical test problems and a comprehensive situation involving a mature scientific application code that solves the reacting Navier-Stokes equations for combustion research.« less

Finite element computation of a viscous compressible free shear flow governed by the time dependent Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Cooke, C. H.; Blanchard, D. K.

1975-01-01

A finite element algorithm for solution of fluid flow problems characterized by the two-dimensional compressible Navier-Stokes equations was developed. The program is intended for viscous compressible high speed flow; hence, primitive variables are utilized. The physical solution was approximated by trial functions which at a fixed time are piecewise cubic on triangular elements. The Galerkin technique was employed to determine the finite-element model equations. A leapfrog time integration is used for marching asymptotically from initial to steady state, with iterated integrals evaluated by numerical quadratures. The nonsymmetric linear systems of equations governing time transition from step-to-step are solved using a rather economical block iterative triangular decomposition scheme. The concept was applied to the numerical computation of a free shear flow. Numerical results of the finite-element method are in excellent agreement with those obtained from a finite difference solution of the same problem.

Fixed Points of Contractive Mappings in b-Metric-Like Spaces

PubMed Central

Hussain, Nawab; Roshan, Jamal Rezaei

2014-01-01

We discuss topological structure of b-metric-like spaces and demonstrate a fundamental lemma for the convergence of sequences. As an application we prove certain fixed point results in the setup of such spaces for different types of contractive mappings. Finally, some periodic point results in b-metric-like spaces are obtained. Two examples are presented in order to verify the effectiveness and applicability of our main results. PMID:25143980

47 CFR 101.705 - Special showing for renewal of common carrier station facilities using frequency diversity.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Special showing for renewal of common carrier... COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Common Carrier Fixed Point-to-Point Microwave Service § 101.705 Special showing for renewal of common carrier station...

47 CFR 90.473 - Operation of internal transmitter control systems through licensed fixed control points.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Operation of internal transmitter control systems through licensed fixed control points. 90.473 Section 90.473 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Transmitter Control Internal Transmitter Control...

L-Fuzzy Fixed Points Theorems for L-Fuzzy Mappings via β ℱL-Admissible Pair

PubMed Central

Rashid, Maliha; Azam, Akbar

2014-01-01

We define the concept of β ℱL-admissible for a pair of L-fuzzy mappings and establish the existence of common L-fuzzy fixed point theorem. Our result generalizes some useful results in the literature. We provide an example to support our result. PMID:24688441

ASIC For Complex Fixed-Point Arithmetic

NASA Technical Reports Server (NTRS)

Petilli, Stephen G.; Grimm, Michael J.; Olson, Erlend M.

1995-01-01

Application-specific integrated circuit (ASIC) performs 24-bit, fixed-point arithmetic operations on arrays of complex-valued input data. High-performance, wide-band arithmetic logic unit (ALU) designed for use in computing fast Fourier transforms (FFTs) and for performing ditigal filtering functions. Other applications include general computations involved in analysis of spectra and digital signal processing.

47 CFR 90.473 - Operation of internal transmitter control systems through licensed fixed control points.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 5 2013-10-01 2013-10-01 false Operation of internal transmitter control systems through licensed fixed control points. 90.473 Section 90.473 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Transmitter Control Internal Transmitter Control...

47 CFR 90.473 - Operation of internal transmitter control systems through licensed fixed control points.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 5 2012-10-01 2012-10-01 false Operation of internal transmitter control systems through licensed fixed control points. 90.473 Section 90.473 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Transmitter Control Internal Transmitter Control...

47 CFR 90.473 - Operation of internal transmitter control systems through licensed fixed control points.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Operation of internal transmitter control systems through licensed fixed control points. 90.473 Section 90.473 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Transmitter Control Internal Transmitter Control...

47 CFR 90.473 - Operation of internal transmitter control systems through licensed fixed control points.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 5 2014-10-01 2014-10-01 false Operation of internal transmitter control systems through licensed fixed control points. 90.473 Section 90.473 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Transmitter Control Internal Transmitter Control...

Geometry in a dynamical system without space: Hyperbolic Geometry in Kuramoto Oscillator Systems

NASA Astrophysics Data System (ADS)

Engelbrecht, Jan; Chen, Bolun; Mirollo, Renato

Kuramoto oscillator networks have the special property that their time evolution is constrained to lie on 3D orbits of the Möbius group acting on the N-fold torus TN which explains the N - 3 constants of motion discovered by Watanabe and Strogatz. The dynamics for phase models can be further reduced to 2D invariant sets in T N - 1 which have a natural geometry equivalent to the unit disk Δ with hyperbolic metric. We show that the classic Kuramoto model with order parameter Z1 (the first moment of the oscillator configuration) is a gradient flow in this metric with a unique fixed point on each generic 2D invariant set, corresponding to the hyperbolic barycenter of an oscillator configuration. This gradient property makes the dynamics especially easy to analyze. We exhibit several new families of Kuramoto oscillator models which reduce to gradient flows in this metric; some of these have a richer fixed point structure including non-hyperbolic fixed points associated with fixed point bifurcations. Work Supported by NSF DMS 1413020.

Application of Monte Carlo Method for Evaluation of Uncertainties of ITS-90 by Standard Platinum Resistance Thermometer

NASA Astrophysics Data System (ADS)

Palenčár, Rudolf; Sopkuliak, Peter; Palenčár, Jakub; Ďuriš, Stanislav; Suroviak, Emil; Halaj, Martin

2017-06-01

Evaluation of uncertainties of the temperature measurement by standard platinum resistance thermometer calibrated at the defining fixed points according to ITS-90 is a problem that can be solved in different ways. The paper presents a procedure based on the propagation of distributions using the Monte Carlo method. The procedure employs generation of pseudo-random numbers for the input variables of resistances at the defining fixed points, supposing the multivariate Gaussian distribution for input quantities. This allows taking into account the correlations among resistances at the defining fixed points. Assumption of Gaussian probability density function is acceptable, with respect to the several sources of uncertainties of resistances. In the case of uncorrelated resistances at the defining fixed points, the method is applicable to any probability density function. Validation of the law of propagation of uncertainty using the Monte Carlo method is presented on the example of specific data for 25 Ω standard platinum resistance thermometer in the temperature range from 0 to 660 °C. Using this example, we demonstrate suitability of the method by validation of its results.

Modification and fixed-point analysis of a Kalman filter for orientation estimation based on 9D inertial measurement unit data.

PubMed

Brückner, Hans-Peter; Spindeldreier, Christian; Blume, Holger

2013-01-01

A common approach for high accuracy sensor fusion based on 9D inertial measurement unit data is Kalman filtering. State of the art floating-point filter algorithms differ in their computational complexity nevertheless, real-time operation on a low-power microcontroller at high sampling rates is not possible. This work presents algorithmic modifications to reduce the computational demands of a two-step minimum order Kalman filter. Furthermore, the required bit-width of a fixed-point filter version is explored. For evaluation real-world data captured using an Xsens MTx inertial sensor is used. Changes in computational latency and orientation estimation accuracy due to the proposed algorithmic modifications and fixed-point number representation are evaluated in detail on a variety of processing platforms enabling on-board processing on wearable sensor platforms.

A Method to Solve Interior and Exterior Camera Calibration Parameters for Image Resection

NASA Technical Reports Server (NTRS)

Samtaney, Ravi

1999-01-01

An iterative method is presented to solve the internal and external camera calibration parameters, given model target points and their images from one or more camera locations. The direct linear transform formulation was used to obtain a guess for the iterative method, and herein lies one of the strengths of the present method. In all test cases, the method converged to the correct solution. In general, an overdetermined system of nonlinear equations is solved in the least-squares sense. The iterative method presented is based on Newton-Raphson for solving systems of nonlinear algebraic equations. The Jacobian is analytically derived and the pseudo-inverse of the Jacobian is obtained by singular value decomposition.

Aerodynamic Optimization of Rocket Control Surface Geometry Using Cartesian Methods and CAD Geometry

NASA Technical Reports Server (NTRS)

Nelson, Andrea; Aftosmis, Michael J.; Nemec, Marian; Pulliam, Thomas H.

2004-01-01

Aerodynamic design is an iterative process involving geometry manipulation and complex computational analysis subject to physical constraints and aerodynamic objectives. A design cycle consists of first establishing the performance of a baseline design, which is usually created with low-fidelity engineering tools, and then progressively optimizing the design to maximize its performance. Optimization techniques have evolved from relying exclusively on designer intuition and insight in traditional trial and error methods, to sophisticated local and global search methods. Recent attempts at automating the search through a large design space with formal optimization methods include both database driven and direct evaluation schemes. Databases are being used in conjunction with surrogate and neural network models as a basis on which to run optimization algorithms. Optimization algorithms are also being driven by the direct evaluation of objectives and constraints using high-fidelity simulations. Surrogate methods use data points obtained from simulations, and possibly gradients evaluated at the data points, to create mathematical approximations of a database. Neural network models work in a similar fashion, using a number of high-fidelity database calculations as training iterations to create a database model. Optimal designs are obtained by coupling an optimization algorithm to the database model. Evaluation of the current best design then gives either a new local optima and/or increases the fidelity of the approximation model for the next iteration. Surrogate methods have also been developed that iterate on the selection of data points to decrease the uncertainty of the approximation model prior to searching for an optimal design. The database approximation models for each of these cases, however, become computationally expensive with increase in dimensionality. Thus the method of using optimization algorithms to search a database model becomes problematic as the number of design variables is increased.

Carbon fiber composites application in ITER plasma facing components

NASA Astrophysics Data System (ADS)

Barabash, V.; Akiba, M.; Bonal, J. P.; Federici, G.; Matera, R.; Nakamura, K.; Pacher, H. D.; Rödig, M.; Vieider, G.; Wu, C. H.

1998-10-01

Carbon Fiber Composites (CFCs) are one of the candidate armour materials for the plasma facing components of the International Thermonuclear Experimental Reactor (ITER). For the present reference design, CFC has been selected as armour for the divertor target near the plasma strike point mainly because of unique resistance to high normal and off-normal heat loads. It does not melt under disruptions and might have higher erosion lifetime in comparison with other possible armour materials. Issues related to CFC application in ITER are described in this paper. They include erosion lifetime, tritium codeposition with eroded material and possible methods for the removal of the codeposited layers, neutron irradiation effect, development of joining technologies with heat sink materials, and thermomechanical performance. The status of the development of new advanced CFCs for ITER application is also described. Finally, the remaining R&D needs are critically discussed.

Elliptic polylogarithms and iterated integrals on elliptic curves. II. An application to the sunrise integral

NASA Astrophysics Data System (ADS)

Broedel, Johannes; Duhr, Claude; Dulat, Falko; Tancredi, Lorenzo

2018-06-01

We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure mathematics and string theory. We then focus on the equal-mass and non-equal-mass sunrise integrals, and we develop a formalism that enables us to compute these Feynman integrals in terms of our iterated integrals on elliptic curves. The key idea is to use integration-by-parts identities to identify a set of integral kernels, whose precise form is determined by the branch points of the integral in question. These kernels allow us to express all iterated integrals on an elliptic curve in terms of them. The flexibility of our approach leads us to expect that it will be applicable to a large variety of integrals in high-energy physics.

Spotting the difference in molecular dynamics simulations of biomolecules

NASA Astrophysics Data System (ADS)

Sakuraba, Shun; Kono, Hidetoshi

2016-08-01

Comparing two trajectories from molecular simulations conducted under different conditions is not a trivial task. In this study, we apply a method called Linear Discriminant Analysis with ITERative procedure (LDA-ITER) to compare two molecular simulation results by finding the appropriate projection vectors. Because LDA-ITER attempts to determine a projection such that the projections of the two trajectories do not overlap, the comparison does not suffer from a strong anisotropy, which is an issue in protein dynamics. LDA-ITER is applied to two test cases: the T4 lysozyme protein simulation with or without a point mutation and the allosteric protein PDZ2 domain of hPTP1E with or without a ligand. The projection determined by the method agrees with the experimental data and previous simulations. The proposed procedure, which complements existing methods, is a versatile analytical method that is specialized to find the "difference" between two trajectories.

A fluid modeling perspective on the tokamak power scrape-off width using SOLPS-ITER

NASA Astrophysics Data System (ADS)

Meier, Eric

2016-10-01

SOLPS-ITER, a 2D fluid code, is used to conduct the first fluid modeling study of the physics behind the power scrape-off width (λq). When drift physics are activated in the code, λq is insensitive to changes in toroidal magnetic field (Bt), as predicted by the 0D heuristic drift (HD) model developed by Goldston. Using the HD model, which quantitatively agrees with regression analysis of a multi-tokamak database, λq in ITER is projected to be 1 mm instead of the previously assumed 4 mm, magnifying the challenge of maintaining the peak divertor target heat flux below the technological limit. These simulations, which use DIII-D H-mode experimental conditions as input, and reproduce the observed high-recycling, attached outer target plasma, allow insights into the scrape-off layer (SOL) physics that set λq. Independence of λq with respect to Bt suggests that SOLPS-ITER captures basic HD physics: the effect of Bt on the particle dwell time ( Bt) cancels with the effect on drift speed ( 1 /Bt), fixing the SOL plasma density width, and dictating λq. Scaling with plasma current (Ip), however, is much weaker than the roughly 1 /Ip dependence predicted by the HD model. Simulated net cross-separatrix particle flux due to magnetic drifts exceeds the anomalous particle transport, and a Pfirsch-Schluter-like SOL flow pattern is established. Up-down ion pressure asymmetry enables the net magnetic drift flux. Drifts establish in-out temperature asymmetry, and an associated thermoelectric current carries significant heat flux to the outer target. The density fall-off length in the SOL is similar to the electron temperature fall-off length, as observed experimentally. Finally, opportunities and challenges foreseen in ongoing work to extrapolate SOLPS-ITER and the HD model to ITER and future machines will be discussed. Supported by U.S. Department of Energy Contract DESC0010434.

Improved Real-Time Scan Matching Using Corner Features

NASA Astrophysics Data System (ADS)

Mohamed, H. A.; Moussa, A. M.; Elhabiby, M. M.; El-Sheimy, N.; Sesay, Abu B.

2016-06-01

The automation of unmanned vehicle operation has gained a lot of research attention, in the last few years, because of its numerous applications. The vehicle localization is more challenging in indoor environments where absolute positioning measurements (e.g. GPS) are typically unavailable. Laser range finders are among the most widely used sensors that help the unmanned vehicles to localize themselves in indoor environments. Typically, automatic real-time matching of the successive scans is performed either explicitly or implicitly by any localization approach that utilizes laser range finders. Many accustomed approaches such as Iterative Closest Point (ICP), Iterative Matching Range Point (IMRP), Iterative Dual Correspondence (IDC), and Polar Scan Matching (PSM) handles the scan matching problem in an iterative fashion which significantly affects the time consumption. Furthermore, the solution convergence is not guaranteed especially in cases of sharp maneuvers or fast movement. This paper proposes an automated real-time scan matching algorithm where the matching process is initialized using the detected corners. This initialization step aims to increase the convergence probability and to limit the number of iterations needed to reach convergence. The corner detection is preceded by line extraction from the laser scans. To evaluate the probability of line availability in indoor environments, various data sets, offered by different research groups, have been tested and the mean numbers of extracted lines per scan for these data sets are ranging from 4.10 to 8.86 lines of more than 7 points. The set of all intersections between extracted lines are detected as corners regardless of the physical intersection of these line segments in the scan. To account for the uncertainties of the detected corners, the covariance of the corners is estimated using the extracted lines variances. The detected corners are used to estimate the transformation parameters between the successive scan using least squares. These estimated transformation parameters are used to calculate an adjusted initialization for scan matching process. The presented method can be employed solely to match the successive scans and also can be used to aid other accustomed iterative methods to achieve more effective and faster converge. The performance and time consumption of the proposed approach is compared with ICP algorithm alone without initialization in different scenarios such as static period, fast straight movement, and sharp manoeuvers.

Projection matrix acquisition for cone-beam computed tomography iterative reconstruction

NASA Astrophysics Data System (ADS)

Yang, Fuqiang; Zhang, Dinghua; Huang, Kuidong; Shi, Wenlong; Zhang, Caixin; Gao, Zongzhao

2017-02-01

Projection matrix is an essential and time-consuming part in computed tomography (CT) iterative reconstruction. In this article a novel calculation algorithm of three-dimensional (3D) projection matrix is proposed to quickly acquire the matrix for cone-beam CT (CBCT). The CT data needed to be reconstructed is considered as consisting of the three orthogonal sets of equally spaced and parallel planes, rather than the individual voxels. After getting the intersections the rays with the surfaces of the voxels, the coordinate points and vertex is compared to obtain the index value that the ray traversed. Without considering ray-slope to voxel, it just need comparing the position of two points. Finally, the computer simulation is used to verify the effectiveness of the algorithm.

Assessment of Preconditioner for a USM3D Hierarchical Adaptive Nonlinear Method (HANIM) (Invited)

NASA Technical Reports Server (NTRS)

Pandya, Mohagna J.; Diskin, Boris; Thomas, James L.; Frink, Neal T.

2016-01-01

Enhancements to the previously reported mixed-element USM3D Hierarchical Adaptive Nonlinear Iteration Method (HANIM) framework have been made to further improve robustness, efficiency, and accuracy of computational fluid dynamic simulations. The key enhancements include a multi-color line-implicit preconditioner, a discretely consistent symmetry boundary condition, and a line-mapping method for the turbulence source term discretization. The USM3D iterative convergence for the turbulent flows is assessed on four configurations. The configurations include a two-dimensional (2D) bump-in-channel, the 2D NACA 0012 airfoil, a three-dimensional (3D) bump-in-channel, and a 3D hemisphere cylinder. The Reynolds Averaged Navier Stokes (RANS) solutions have been obtained using a Spalart-Allmaras turbulence model and families of uniformly refined nested grids. Two types of HANIM solutions using line- and point-implicit preconditioners have been computed. Additional solutions using the point-implicit preconditioner alone (PA) method that broadly represents the baseline solver technology have also been computed. The line-implicit HANIM shows superior iterative convergence in most cases with progressively increasing benefits on finer grids.

An Unsteady Preconditioning Scheme Based on Convective-Upwind Split-Pressure (CUSP) Artificial Dissipation

DTIC Science & Technology

2014-01-07

this can have a disastrous effect on convergence rate. Even if steady state is obtained for low Mach number flows (after many iterations ), the results...rally lead do a diagonally dominant left-hand-side matrix, which causes stability problems for implicit Gauss - Seidel schemes. For this reason, matrix... convergence at the stagnation point. The iterations for each airfoil is also reported in Fig. 2. Without preconditioning, dramatic efficiency problems are seen

FixO3 project results, legacy and module migration to EMSO

NASA Astrophysics Data System (ADS)

Lampitt, Richard

2017-04-01

The fixed point open ocean observatory network (FixO3) project is an international project aimed at integrating in a single network all fixed point open ocean observatories operated by European organisations and to harmonise and coordinate technological, procedural and data management across the stations. The project is running for four years since September 2013 with 29 partners across Europe and a budget of 7M Euros and is now coming to its final phase. In contrast to several past programmes, the opportunity has arisen to ensure that many of the project achievements can migrate into the newly formed European Multidisciplinary Seafloor and water column Observatory (EMSO) research infrastructure. The final phase of the project will focus on developing a strategy to transfer the results in an efficient way to maintain their relevance and maximise their use. In this presentation, we will highlight the significant achievements of FixO3 over the past three years focussing on the modules which will be transferred to EMSO in the coming 9 months. These include: 1. Handbook of best practices for operating fixed point observatories 2. Metadata catalogue 3. Earth Virtual Observatory (EarthVO) for data visualisation and comparison 4. Open Ocean Observatory Yellow Pages (O3YP) 5. Training material for hardware, data and data products used

Solving large test-day models by iteration on data and preconditioned conjugate gradient.

PubMed

Lidauer, M; Strandén, I; Mäntysaari, E A; Pösö, J; Kettunen, A

1999-12-01

A preconditioned conjugate gradient method was implemented into an iteration on a program for data estimation of breeding values, and its convergence characteristics were studied. An algorithm was used as a reference in which one fixed effect was solved by Gauss-Seidel method, and other effects were solved by a second-order Jacobi method. Implementation of the preconditioned conjugate gradient required storing four vectors (size equal to number of unknowns in the mixed model equations) in random access memory and reading the data at each round of iteration. The preconditioner comprised diagonal blocks of the coefficient matrix. Comparison of algorithms was based on solutions of mixed model equations obtained by a single-trait animal model and a single-trait, random regression test-day model. Data sets for both models used milk yield records of primiparous Finnish dairy cows. Animal model data comprised 665,629 lactation milk yields and random regression test-day model data of 6,732,765 test-day milk yields. Both models included pedigree information of 1,099,622 animals. The animal model ¿random regression test-day model¿ required 122 ¿305¿ rounds of iteration to converge with the reference algorithm, but only 88 ¿149¿ were required with the preconditioned conjugate gradient. To solve the random regression test-day model with the preconditioned conjugate gradient required 237 megabytes of random access memory and took 14% of the computation time needed by the reference algorithm.

Introducing soft systems methodology plus (SSM+): why we need it and what it can contribute.

PubMed

Braithwaite, Jeffrey; Hindle, Don; Iedema, Rick; Westbrook, Johanna I

2002-01-01

There are many complicated and seemingly intractable problems in the health care sector. Past ways to address them have involved political responses, economic restructuring, biomedical and scientific studies, and managerialist or business-oriented tools. Few methods have enabled us to develop a systematic response to problems. Our version of soft systems methodology, SSM+, seems to improve problem solving processes by providing an iterative, staged framework that emphasises collaborative learning and systems redesign involving both technical and cultural fixes.

Enhancing Sparsity by Reweighted l(1) Minimization

DTIC Science & Technology

2008-07-01

recovery depends on the sparsity level k. The dashed curves represent a reweighted ℓ1 algorithm that outperforms the traditional unweighted ℓ1...approach (solid curve ). (a) Performance after 4 reweighting iterations as a function of ǫ. (b) Performance with fixed ǫ = 0.1 as a function of the number of...signal recovery (declared when ‖x0 − x‖ℓ∞ ≤ 10−3) for the unweighted ℓ1 algorithm as a function of the sparsity level k. The dashed curves represent the

A heuristic statistical stopping rule for iterative reconstruction in emission tomography.

PubMed

Ben Bouallègue, F; Crouzet, J F; Mariano-Goulart, D

2013-01-01

We propose a statistical stopping criterion for iterative reconstruction in emission tomography based on a heuristic statistical description of the reconstruction process. The method was assessed for MLEM reconstruction. Based on Monte-Carlo numerical simulations and using a perfectly modeled system matrix, our method was compared with classical iterative reconstruction followed by low-pass filtering in terms of Euclidian distance to the exact object, noise, and resolution. The stopping criterion was then evaluated with realistic PET data of a Hoffman brain phantom produced using the GATE platform for different count levels. The numerical experiments showed that compared with the classical method, our technique yielded significant improvement of the noise-resolution tradeoff for a wide range of counting statistics compatible with routine clinical settings. When working with realistic data, the stopping rule allowed a qualitatively and quantitatively efficient determination of the optimal image. Our method appears to give a reliable estimation of the optimal stopping point for iterative reconstruction. It should thus be of practical interest as it produces images with similar or better quality than classical post-filtered iterative reconstruction with a mastered computation time.

A Hybrid Common Fixed Point Theorem under Certain Recent Properties

PubMed Central

Imdad, Mohammad

2014-01-01

We prove a common fixed point theorem for a hybrid pair of occasionally coincidentally idempotent mappings via common limit range property. Our result improves some results from the existing literature, especially the ones contained in Sintunavarat and Kumam (2009). Some illustrative and interesting examples to highlight the realized improvements are also furnished. PMID:24592191

Alignment Solution for CT Image Reconstruction using Fixed Point and Virtual Rotation Axis.

PubMed

Jun, Kyungtaek; Yoon, Seokhwan

2017-01-25

Since X-ray tomography is now widely adopted in many different areas, it becomes more crucial to find a robust routine of handling tomographic data to get better quality of reconstructions. Though there are several existing techniques, it seems helpful to have a more automated method to remove the possible errors that hinder clearer image reconstruction. Here, we proposed an alternative method and new algorithm using the sinogram and the fixed point. An advanced physical concept of Center of Attenuation (CA) was also introduced to figure out how this fixed point is applied to the reconstruction of image having errors we categorized in this article. Our technique showed a promising performance in restoring images having translation and vertical tilt errors.

Symmetry-breaking oscillations in membrane optomechanics

NASA Astrophysics Data System (ADS)

Wurl, C.; Alvermann, A.; Fehske, H.

2016-12-01

We study the classical dynamics of a membrane inside a cavity in the situation where this optomechanical system possesses a reflection symmetry. Symmetry breaking occurs through supercritical and subcritical pitchfork bifurcations of the static fixed-point solutions. Both bifurcations can be observed through variation of the laser-cavity detuning, which gives rise to a boomerang-like fixed-point pattern with hysteresis. The symmetry-breaking fixed points evolve into self-sustained oscillations when the laser intensity is increased. In addition to the analysis of the accompanying Hopf bifurcations we describe these oscillations at finite amplitudes with an ansatz that fully accounts for the frequency shift relative to the natural membrane frequency. We complete our study by following the route to chaos for the membrane dynamics.

A 640-MHz 32-megachannel real-time polyphase-FFT spectrum analyzer

NASA Technical Reports Server (NTRS)

Zimmerman, G. A.; Garyantes, M. F.; Grimm, M. J.; Charny, B.

1991-01-01

A polyphase fast Fourier transform (FFT) spectrum analyzer being designed for NASA's Search for Extraterrestrial Intelligence (SETI) Sky Survey at the Jet Propulsion Laboratory is described. By replacing the time domain multiplicative window preprocessing with polyphase filter processing, much of the processing loss of windowed FFTs can be eliminated. Polyphase coefficient memory costs are minimized by effective use of run length compression. Finite word length effects are analyzed, producing a balanced system with 8 bit inputs, 16 bit fixed point polyphase arithmetic, and 24 bit fixed point FFT arithmetic. Fixed point renormalization midway through the computation is seen to be naturally accommodated by the matrix FFT algorithm proposed. Simulation results validate the finite word length arithmetic analysis and the renormalization technique.

[Treatment of calcaneal avulsion fractures with twinfix suture anchors fixation].

PubMed

Zhao, Bin-xiu; Wang, Kun-zheng; Wang, Chun-sheng; Xie, Yue; Dai, Zhi-tang; Liu, Gang; Liu, Wei-dong

2011-06-01

For the calcaneal avulsion fracture, the current method is more commonly used screws or Kirschner wire to fix fracture fragment. This article intended to explore the feasibility and clinical efficacy for the treatment of avulsion fractures with TwinFix suture anchors. From July 2007 to November 2010, 21 patients were reviewed, including 15 males and 6 females, ranging in age from 49 to 65 years,with a mean of 58.7 years. Twelve patients had nodules in the right heel and 9 patients had nodules in the left heel. All the patients had closed fractures. The typical preoperative symptoms of the patients included pain in the upper heel and weak in heel lift. Body examination results: palpable sense of bone rubbing in the back of the heel, and swelling in the heel. Surgery treatment with TwinFix suture anchors performed as follows : to fix TwinFix suture anchors into the calcaneal body, then to drill the fracture block, to make the double strand suture through the fracture holes, to knot the suture eachother to fix the block, and to use stitch to fix the remaining suture in the Achilles tendon in order to improve the block fixation. The criteria of the AOFAS Foot and Ankle Surgery by the United States Association of ankle-rear foot functional recovery was used to evaluate the Achilles tendon. Total average score was (95.5 +/- 3.12) points, including pain items of(38.5 +/- 2.18) points,the average score of functional items of (49.5 +/- 3.09) points,and power lines of 10 points in all patients. Twenty-one patients got an excellent result, 16 good and 5 poor. The methods of treatment for the calcaneal avulsion fractures with TwinFix suture anchors is a simple operation, and have excellent clinical effect, which is worthy of promotion.

Tympanic thermometer performance validation by use of a body-temperature fixed point blackbody

NASA Astrophysics Data System (ADS)

Machin, Graham; Simpson, Robert

2003-04-01

The use of infrared tympanic thermometers within the medical community (and more generically in the public domain) has recently grown rapidly, displacing more traditional forms of thermometry such as mercury-in-glass. Besides the obvious health concerns over mercury the increase in the use of tympanic thermometers is related to a number of factors such as their speed and relatively non-invasive method of operation. The calibration and testing of such devices is covered by a number of international standards (ASTM1, prEN2, JIS3) which specify the design of calibration blackbodies. However these calibration sources are impractical for day-to-day in-situ validation purposes. In addition several studies (e.g. Modell et al4, Craig et al5) have thrown doubt on the accuracy of tympanic thermometers in clinical use. With this in mind the NPL is developing a practical, portable and robust primary reference fixed point source for tympanic thermometer validation. The aim of this simple device is to give the clinician a rapid way of validating the performance of their tympanic thermometer, enabling the detection of mal-functioning thermometers and giving confidence in the measurement to the clinician (and patient!) at point of use. The reference fixed point operates at a temperature of 36.3 °C (97.3 °F) with a repeatability of approximately +/- 20 mK. The fixed-point design has taken into consideration the optical characteristics of tympanic thermometers enabling wide-angled field of view devices to be successfully tested. The overall uncertainty of the device is estimated to be is less than 0.1°C. The paper gives a description of the fixed point, its design and construction as well as the results to date of validation tests.

A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework

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

Garrett, C. Kristopher; Hauck, Cory D.

In this paper, we present a domain decomposition algorithm to accelerate the solution of Eulerian-type discretizations of the linear, steady-state Vlasov equation. The steady-state solver then forms a key component in the implementation of fully implicit or nearly fully implicit temporal integrators for the nonlinear Vlasov--Poisson system. The solver relies on a particular decomposition of phase space that enables the use of sweeping techniques commonly used in radiation transport applications. The original linear system for the phase space unknowns is then replaced by a smaller linear system involving only unknowns on the boundary between subdomains, which can then be solvedmore » efficiently with Krylov methods such as GMRES. Steady-state solves are combined to form an implicit Runge--Kutta time integrator, and the Vlasov equation is coupled self-consistently to the Poisson equation via a linearized procedure or a nonlinear fixed-point method for the electric field. Finally, numerical results for standard test problems demonstrate the efficiency of the domain decomposition approach when compared to the direct application of an iterative solver to the original linear system.« less

Maximally random discrete-spin systems with symmetric and asymmetric interactions and maximally degenerate ordering

NASA Astrophysics Data System (ADS)

Atalay, Bora; Berker, A. Nihat

2018-05-01

Discrete-spin systems with maximally random nearest-neighbor interactions that can be symmetric or asymmetric, ferromagnetic or antiferromagnetic, including off-diagonal disorder, are studied, for the number of states q =3 ,4 in d dimensions. We use renormalization-group theory that is exact for hierarchical lattices and approximate (Migdal-Kadanoff) for hypercubic lattices. For all d >1 and all noninfinite temperatures, the system eventually renormalizes to a random single state, thus signaling q ×q degenerate ordering. Note that this is the maximally degenerate ordering. For high-temperature initial conditions, the system crosses over to this highly degenerate ordering only after spending many renormalization-group iterations near the disordered (infinite-temperature) fixed point. Thus, a temperature range of short-range disorder in the presence of long-range order is identified, as previously seen in underfrustrated Ising spin-glass systems. The entropy is calculated for all temperatures, behaves similarly for ferromagnetic and antiferromagnetic interactions, and shows a derivative maximum at the short-range disordering temperature. With a sharp immediate contrast of infinitesimally higher dimension 1 +ɛ , the system is as expected disordered at all temperatures for d =1 .

Heterogeneous growth-induced prestrain in the heart

PubMed Central

Genet, M.; Rausch, M.; Lee, L.C.; Choy, S.; Zhao, X.; Kassab, G.S.; Kozerke, S.; Guccione, J.M.; Kuhl, E.

2015-01-01

Even when entirely unloaded, biological structures are not stress-free, as shown by Y.C. Fung’s seminal opening angle experiment on arteries and the left ventricle. As a result of this prestrain, subject-specific geometries extracted from medical imaging do not represent an unloaded reference configuration necessary for mechanical analysis, even if the structure is externally unloaded. Here we propose a new computational method to create physiological residual stress fields in subject-specific left ventricular geometries using the continuum theory of fictitious configurations combined with a fixed-point iteration. We also reproduced the opening angle experiment on four swine models, to characterize the range of normal opening angle values. The proposed method generates residual stress fields which can reliably reproduce the range of opening angles between 8.7±1.8 and 16.6 ± 13.7 as measured experimentally. We demonstrate that including the effects of prestrain reduces the left ventricular stiffness by up to 40%, thus facilitating the ventricular filling, which has a significant impact on cardiac function. This method can improve the fidelity of subject-specific models to improve our understanding of cardiac diseases and to optimize treatment options. PMID:25913241

Development of a fully implicit particle-in-cell scheme for gyrokinetic electromagnetic turbulence simulation in XGC1

NASA Astrophysics Data System (ADS)

Ku, Seung-Hoe; Hager, R.; Chang, C. S.; Chacon, L.; Chen, G.; EPSI Team

2016-10-01

The cancelation problem has been a long-standing issue for long wavelengths modes in electromagnetic gyrokinetic PIC simulations in toroidal geometry. As an attempt of resolving this issue, we implemented a fully implicit time integration scheme in the full-f, gyrokinetic PIC code XGC1. The new scheme - based on the implicit Vlasov-Darwin PIC algorithm by G. Chen and L. Chacon - can potentially resolve cancelation problem. The time advance for the field and the particle equations is space-time-centered, with particle sub-cycling. The resulting system of equations is solved by a Picard iteration solver with fixed-point accelerator. The algorithm is implemented in the parallel velocity formalism instead of the canonical parallel momentum formalism. XGC1 specializes in simulating the tokamak edge plasma with magnetic separatrix geometry. A fully implicit scheme could be a way to accurate and efficient gyrokinetic simulations. We will test if this numerical scheme overcomes the cancelation problem, and reproduces the dispersion relation of Alfven waves and tearing modes in cylindrical geometry. Funded by US DOE FES and ASCR, and computing resources provided by OLCF through ALCC.

Non-negative Matrix Factorization for Self-calibration of Photometric Redshift Scatter in Weak-lensing Surveys

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

Zhang, Le; Yu, Yu; Zhang, Pengjie, E-mail: lezhang@sjtu.edu.cn

Photo- z error is one of the major sources of systematics degrading the accuracy of weak-lensing cosmological inferences. Zhang et al. proposed a self-calibration method combining galaxy–galaxy correlations and galaxy–shear correlations between different photo- z bins. Fisher matrix analysis shows that it can determine the rate of photo- z outliers at a level of 0.01%–1% merely using photometric data and do not rely on any prior knowledge. In this paper, we develop a new algorithm to implement this method by solving a constrained nonlinear optimization problem arising in the self-calibration process. Based on the techniques of fixed-point iteration and non-negativemore » matrix factorization, the proposed algorithm can efficiently and robustly reconstruct the scattering probabilities between the true- z and photo- z bins. The algorithm has been tested extensively by applying it to mock data from simulated stage IV weak-lensing projects. We find that the algorithm provides a successful recovery of the scatter rates at the level of 0.01%–1%, and the true mean redshifts of photo- z bins at the level of 0.001, which may satisfy the requirements in future lensing surveys.« less

Neural network based online simultaneous policy update algorithm for solving the HJI equation in nonlinear H∞ control.

PubMed

Wu, Huai-Ning; Luo, Biao

2012-12-01

It is well known that the nonlinear H∞ state feedback control problem relies on the solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which is a nonlinear partial differential equation that has proven to be impossible to solve analytically. In this paper, a neural network (NN)-based online simultaneous policy update algorithm (SPUA) is developed to solve the HJI equation, in which knowledge of internal system dynamics is not required. First, we propose an online SPUA which can be viewed as a reinforcement learning technique for two players to learn their optimal actions in an unknown environment. The proposed online SPUA updates control and disturbance policies simultaneously; thus, only one iterative loop is needed. Second, the convergence of the online SPUA is established by proving that it is mathematically equivalent to Newton's method for finding a fixed point in a Banach space. Third, we develop an actor-critic structure for the implementation of the online SPUA, in which only one critic NN is needed for approximating the cost function, and a least-square method is given for estimating the NN weight parameters. Finally, simulation studies are provided to demonstrate the effectiveness of the proposed algorithm.

A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework

DOE PAGES

Garrett, C. Kristopher; Hauck, Cory D.

2018-04-05

In this paper, we present a domain decomposition algorithm to accelerate the solution of Eulerian-type discretizations of the linear, steady-state Vlasov equation. The steady-state solver then forms a key component in the implementation of fully implicit or nearly fully implicit temporal integrators for the nonlinear Vlasov--Poisson system. The solver relies on a particular decomposition of phase space that enables the use of sweeping techniques commonly used in radiation transport applications. The original linear system for the phase space unknowns is then replaced by a smaller linear system involving only unknowns on the boundary between subdomains, which can then be solvedmore » efficiently with Krylov methods such as GMRES. Steady-state solves are combined to form an implicit Runge--Kutta time integrator, and the Vlasov equation is coupled self-consistently to the Poisson equation via a linearized procedure or a nonlinear fixed-point method for the electric field. Finally, numerical results for standard test problems demonstrate the efficiency of the domain decomposition approach when compared to the direct application of an iterative solver to the original linear system.« less

Precision Pointing Control System (PPCS) system design and analysis. [for gimbaled experiment platforms

NASA Technical Reports Server (NTRS)

Frew, A. M.; Eisenhut, D. F.; Farrenkopf, R. L.; Gates, R. F.; Iwens, R. P.; Kirby, D. K.; Mann, R. J.; Spencer, D. J.; Tsou, H. S.; Zaremba, J. G.

1972-01-01

The precision pointing control system (PPCS) is an integrated system for precision attitude determination and orientation of gimbaled experiment platforms. The PPCS concept configures the system to perform orientation of up to six independent gimbaled experiment platforms to design goal accuracy of 0.001 degrees, and to operate in conjunction with a three-axis stabilized earth-oriented spacecraft in orbits ranging from low altitude (200-2500 n.m., sun synchronous) to 24 hour geosynchronous, with a design goal life of 3 to 5 years. The system comprises two complementary functions: (1) attitude determination where the attitude of a defined set of body-fixed reference axes is determined relative to a known set of reference axes fixed in inertial space; and (2) pointing control where gimbal orientation is controlled, open-loop (without use of payload error/feedback) with respect to a defined set of body-fixed reference axes to produce pointing to a desired target.

Comparison of Fixed Point Realisations between Inmetro and PTB

NASA Astrophysics Data System (ADS)

Santiago, J. F. N.; Petkovic, S. G.; Teixeira, R. N.; Noatsch, U.; Thiele-Krivoj, B.

2003-09-01

An interlaboratory comparison in the temperature range between -190 °C and 420 °C was organised between the National Institute of Quality, Normalisation and Industrial Quality (Inmetro), Brazil, and the Physikalisch Technische Bundesanstalt (PTB), Germany. This comparison followed the same protocol as the EUROMET project 552 comparison and was carried out in the years 2001-2002. A standard platinum resistance thermometer (SPRT) of 25 Ω was calibrated at the temperature fixed points of Ar, Hg, the triple point of water (TWP), Ga, In, Sn and Zn, with at least three realisations of each fixed point at both institutes. The uncertainty evaluation is given by Inmetro and some differences in the calibration procedures or in the measuring instruments used are described. The agreement between the results of laboratories was not in all cases within the combined uncertainties. Results of other comparisons are presented, which give additional information on the equivalence of the realised temperature scales.

Human's choices in situations of time-based diminishing returns.

PubMed Central

Hackenberg, T D; Axtell, S A

1993-01-01

Three experiments examined adult humans' choices in situations with contrasting short-term and long-term consequences. Subjects were given repeated choices between two time-based schedules of points exchangeable for money: a fixed schedule and a progressive schedule that began at 0 s and increased by 5 s with each point delivered by that schedule. Under "reset" conditions, choosing the fixed schedule not only produced a point but it also reset the requirements of the progressive schedule to 0 s. In the first two experiments, reset conditions alternated with "no-reset" conditions, in which progressive-schedule requirements were independent of fixed-schedule choices. Experiment 1 entailed choices between a progressive-interval schedule and a fixed-interval schedule, the duration of which varied across conditions. Switching from the progressive- to the fixed-interval schedule was systematically related to fixed-interval size in 4 of 8 subjects, and in all subjects occurred consistently sooner in the progressive-schedule sequence under reset than under no-reset procedures. The latter result was replicated in a second experiment, in which choices between progressive- and fixed-interval schedules were compared with choices between progressive- and fixed-time schedules. In Experiment 3, switching patterns under reset conditions were unrelated to variations in intertrial interval. In none of the experiments did orderly choice patterns depend on verbal descriptions of the contingencies or on schedule-controlled response patterns in the presence of the chosen schedules. The overall pattern of results indicates control of choices by temporarily remote consequences, and is consistent with versions of optimality theory that address performance in situations of diminishing returns. PMID:8315364

Solving free-plasma-boundary problems with the SIESTA MHD code

NASA Astrophysics Data System (ADS)

Sanchez, R.; Peraza-Rodriguez, H.; Reynolds-Barredo, J. M.; Tribaldos, V.; Geiger, J.; Hirshman, S. P.; Cianciosa, M.

2017-10-01

SIESTA is a recently developed MHD equilibrium code designed to perform fast and accurate calculations of ideal MHD equilibria for 3D magnetic configurations. It is an iterative code that uses the solution obtained by the VMEC code to provide a background coordinate system and an initial guess of the solution. The final solution that SIESTA finds can exhibit magnetic islands and stochastic regions. In its original implementation, SIESTA addressed only fixed-boundary problems. This fixed boundary condition somewhat restricts its possible applications. In this contribution we describe a recent extension of SIESTA that enables it to address free-plasma-boundary situations, opening up the possibility of investigating problems with SIESTA in which the plasma boundary is perturbed either externally or internally. As an illustration, the extended version of SIESTA is applied to a configuration of the W7-X stellarator.

Can An Evolutionary Process Create English Text?

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

Bailey, David H.

Critics of the conventional theory of biological evolution have asserted that while natural processes might result in some limited diversity, nothing fundamentally new can arise from 'random' evolution. In response, biologists such as Richard Dawkins have demonstrated that a computer program can generate a specific short phrase via evolution-like iterations starting with random gibberish. While such demonstrations are intriguing, they are flawed in that they have a fixed, pre-specified future target, whereas in real biological evolution there is no fixed future target, but only a complicated 'fitness landscape'. In this study, a significantly more sophisticated evolutionary scheme is employed tomore » produce text segments reminiscent of a Charles Dickens novel. The aggregate size of these segments is larger than the computer program and the input Dickens text, even when comparing compressed data (as a measure of information content).« less

Active adaptive management for reintroduction of an animal population

USGS Publications Warehouse

Runge, Michael C.

2013-01-01

Captive animals are frequently reintroduced to the wild in the face of uncertainty, but that uncertainty can often be reduced over the course of the reintroduction effort, providing the opportunity for adaptive management. One common uncertainty in reintroductions is the short-term survival rate of released adults (a release cost), an important factor because it can affect whether releasing adults or juveniles is better. Information about this rate can improve the success of the reintroduction program, but does the expected gain offset the costs of obtaining the information? I explored this question for reintroduction of the griffon vulture (Gyps fulvus) by framing the management question as a belief Markov decision process, characterizing uncertainty about release cost with 2 information state variables, and finding the solution using stochastic dynamic programming. For a reintroduction program of fixed length (e.g., 5 years of releases), the optimal policy in the final release year resembles the deterministic solution: release either all adults or all juveniles depending on whether the point estimate for the survival rate in question is above or below a specific threshold. But the optimal policy in the earlier release years 1) includes release of a mixture of juveniles and adults under some circumstances, and 2) recommends release of adults even when the point estimate of survival is much less than the deterministic threshold. These results show that in an iterated decision setting, the optimal decision in early years can be quite different from that in later years because of the value of learning. 

Shape effects on time-scale divergence at athermal jamming transition of frictionless non-spherical particles

NASA Astrophysics Data System (ADS)

Yuan, Ye; Jin, Weiwei; Liu, Lufeng; Li, Shuixiang

2017-10-01

The critical behaviors of a granular system at the jamming transition have been extensively studied from both mechanical and thermodynamic perspectives. In this work, we numerically investigate the jamming behaviors of a variety of frictionless non-spherical particles, including spherocylinder, ellipsoid, spherotetrahedron and spherocube. In particular, for a given particle shape, a series of random configurations at different fixed densities are generated and relaxed to minimize interparticle overlaps using the relaxation algorithm. We find that as the jamming point (i.e., point J) is approached, the number of iteration steps (defined as the "time-scale" for our systems) required to completely relax the interparticle overlaps exhibits a clear power-law divergence. The dependence of the detailed mathematical form of the power-law divergence on particle shapes is systematically investigated and elucidated, which suggests that the shape effects can be generally categorized as elongation and roundness. Importantly, we show the jamming transition density can be accurately determined from the analysis of time-scale divergence for different non-spherical shapes, and the obtained values agree very well with corresponding ones reported in literature. Moreover, we study the plastic behaviors of over-jammed packings of different particles under a compression-expansion procedure and find that the jamming of ellipsoid is much more robust than other non-spherical particles. This work offers an alternative approximate procedure besides conventional packing algorithms for studying athermal jamming transition in granular system of frictionless non-spherical particles.

When water does not boil at the boiling point.

PubMed

Chang, Hasok

2007-03-01

Every schoolchild learns that, under standard pressure, pure water always boils at 100 degrees C. Except that it does not. By the late 18th century, pioneering scientists had already discovered great variations in the boiling temperature of water under fixed pressure. So, why have most of us been taught that the boiling point of water is constant? And, if it is not constant, how can it be used as a 'fixed point' for the calibration of thermometers? History of science has the answers.

Complete elliptical ring geometry provides energy and instrument calibration for synchrotron-based two-dimensional X-ray diffraction

PubMed Central

Hart, Michael L.; Drakopoulos, Michael; Reinhard, Christina; Connolley, Thomas

2013-01-01

A complete calibration method to characterize a static planar two-dimensional detector for use in X-ray diffraction at an arbitrary wavelength is described. This method is based upon geometry describing the point of intersection between a cone’s axis and its elliptical conic section. This point of intersection is neither the ellipse centre nor one of the ellipse focal points, but some other point which lies in between. The presented solution is closed form, algebraic and non-iterative in its application, and gives values for the X-ray beam energy, the sample-to-detector distance, the location of the beam centre on the detector surface and the detector tilt relative to the incident beam. Previous techniques have tended to require prior knowledge of either the X-ray beam energy or the sample-to-detector distance, whilst other techniques have been iterative. The new calibration procedure is performed by collecting diffraction data, in the form of diffraction rings from a powder standard, at known displacements of the detector along the beam path. PMID:24068840

CT image reconstruction with half precision floating-point values.

PubMed

Maaß, Clemens; Baer, Matthias; Kachelrieß, Marc

2011-07-01

Analytic CT image reconstruction is a computationally demanding task. Currently, the even more demanding iterative reconstruction algorithms find their way into clinical routine because their image quality is superior to analytic image reconstruction. The authors thoroughly analyze a so far unconsidered but valuable tool of tomorrow's reconstruction hardware (CPU and GPU) that allows implementing the forward projection and backprojection steps, which are the computationally most demanding parts of any reconstruction algorithm, much more efficiently. Instead of the standard 32 bit floating-point values (float), a recently standardized floating-point value with 16 bit (half) is adopted for data representation in image domain and in rawdata domain. The reduction in the total data amount reduces the traffic on the memory bus, which is the bottleneck of today's high-performance algorithms, by 50%. In CT simulations and CT measurements, float reconstructions (gold standard) and half reconstructions are visually compared via difference images and by quantitative image quality evaluation. This is done for analytical reconstruction (filtered backprojection) and iterative reconstruction (ordered subset SART). The magnitude of quantization noise, which is caused by a reduction in the data precision of both rawdata and image data during image reconstruction, is negligible. This is clearly shown for filtered backprojection and iterative ordered subset SART reconstruction. In filtered backprojection, the implementation of the backprojection should be optimized for low data precision if the image data are represented in half format. In ordered subset SART image reconstruction, no adaptations are necessary and the convergence speed remains unchanged. Half precision floating-point values allow to speed up CT image reconstruction without compromising image quality.

A test of fixed and moving reference point control in posture.

PubMed

Lee, I-Chieh; Pacheco, Matheus M; Newell, Karl M

2017-01-01

This study investigated two contrasting assumptions of the regulation of posture: namely, fixed and moving reference point control. These assumptions were tested in terms of time-dependent structure and data distribution properties when stability is manipulated. Fifteen male participants performed a tightrope simulated balance task that is, maintaining a tandem stance while holding a pole. Pole length (and mass) and the standing support surface (fixed surface/balance board) were manipulated so as to mechanically change the balance stability. The mean and standard deviation (SD) of COP length were reduced with pole length increment but only in the balance board surface condition. Also, the SampEn was lower with greater pole length for the balance board but not the fixed surface. More than one peak was present in the distribution of COP in the majority of trials. Collectively, the findings provide evidence for a moving reference point in the maintenance of postural stability for quiet standing. Copyright © 2016 Elsevier B.V. All rights reserved.

Free-time and fixed end-point optimal control theory in dissipative media: application to entanglement generation and maintenance.

PubMed

Mishima, K; Yamashita, K

2009-07-07

We develop monotonically convergent free-time and fixed end-point optimal control theory (OCT) in the density-matrix representation to deal with quantum systems showing dissipation. Our theory is more general and flexible for tailoring optimal laser pulses in order to control quantum dynamics with dissipation than the conventional fixed-time and fixed end-point OCT in that the optimal temporal duration of laser pulses can also be optimized exactly. To show the usefulness of our theory, it is applied to the generation and maintenance of the vibrational entanglement of carbon monoxide adsorbed on the copper (100) surface, CO/Cu(100). We demonstrate the numerical results and clarify how to combat vibrational decoherence as much as possible by the tailored shapes of the optimal laser pulses. It is expected that our theory will be general enough to be applied to a variety of dissipative quantum dynamics systems because the decoherence is one of the quantum phenomena sensitive to the temporal duration of the quantum dynamics.

Model Based Iterative Reconstruction for Bright Field Electron Tomography (Postprint)

DTIC Science & Technology

2013-02-01

which is based on the iterative coordinate descent (ICD), works by constructing a substitute to the original cost4 at every point, and minimizing this...using Beer’s law. Thus the projection integral corresponding to the ith measurement is given by log ( λD λi ) . There can be cases in which the dosage λD...Inputs: Measurements g, Initial reconstruction f ′, Initial dosage d′, Fraction of entries to reject R %Outputs: Reconstruction f̂ and dosage parameter d̂

Ultrametric properties of the attractor spaces for random iterated linear function systems

NASA Astrophysics Data System (ADS)

Buchovets, A. G.; Moskalev, P. V.

2018-03-01

We investigate attractors of random iterated linear function systems as independent spaces embedded in the ordinary Euclidean space. The introduction on the set of attractor points of a metric that satisfies the strengthened triangle inequality makes this space ultrametric. Then inherent in ultrametric spaces the properties of disconnectedness and hierarchical self-similarity make it possible to define an attractor as a fractal. We note that a rigorous proof of these properties in the case of an ordinary Euclidean space is very difficult.

Convergence of Proximal Iteratively Reweighted Nuclear Norm Algorithm for Image Processing.

PubMed

Sun, Tao; Jiang, Hao; Cheng, Lizhi

2017-08-25

The nonsmooth and nonconvex regularization has many applications in imaging science and machine learning research due to its excellent recovery performance. A proximal iteratively reweighted nuclear norm algorithm has been proposed for the nonsmooth and nonconvex matrix minimizations. In this paper, we aim to investigate the convergence of the algorithm. With the Kurdyka-Łojasiewicz property, we prove the algorithm globally converges to a critical point of the objective function. The numerical results presented in this paper coincide with our theoretical findings.

Symmetry dependence of holograms for optical trapping

NASA Astrophysics Data System (ADS)

Curtis, Jennifer E.; Schmitz, Christian H. J.; Spatz, Joachim P.

2005-08-01

No iterative algorithm is necessary to calculate holograms for most holographic optical trapping patterns. Instead, holograms may be produced by a simple extension of the prisms-and-lenses method. This formulaic approach yields the same diffraction efficiency as iterative algorithms for any asymmetric or symmetric but nonperiodic pattern of points while requiring less calculation time. A slight spatial disordering of periodic patterns significantly reduces intensity variations between the different traps without extra calculation costs. Eliminating laborious hologram calculations should greatly facilitate interactive holographic trapping.

Fragmentation functions beyond fixed order accuracy

NASA Astrophysics Data System (ADS)

Anderle, Daniele P.; Kaufmann, Tom; Stratmann, Marco; Ringer, Felix

2017-03-01

We give a detailed account of the phenomenology of all-order resummations of logarithmically enhanced contributions at small momentum fraction of the observed hadron in semi-inclusive electron-positron annihilation and the timelike scale evolution of parton-to-hadron fragmentation functions. The formalism to perform resummations in Mellin moment space is briefly reviewed, and all relevant expressions up to next-to-next-to-leading logarithmic order are derived, including their explicit dependence on the factorization and renormalization scales. We discuss the details pertinent to a proper numerical implementation of the resummed results comprising an iterative solution to the timelike evolution equations, the matching to known fixed-order expressions, and the choice of the contour in the Mellin inverse transformation. First extractions of parton-to-pion fragmentation functions from semi-inclusive annihilation data are performed at different logarithmic orders of the resummations in order to estimate their phenomenological relevance. To this end, we compare our results to corresponding fits up to fixed, next-to-next-to-leading order accuracy and study the residual dependence on the factorization scale in each case.

Experimental realization of self-guided quantum coherence freezing

NASA Astrophysics Data System (ADS)

Yu, Shang; Wang, Yi-Tao; Ke, Zhi-Jin; Liu, Wei; Zhang, Wen-Hao; Chen, Geng; Tang, Jian-Shun; Li, Chuan-Feng; Guo, Guang-Can

2017-12-01

Quantum coherence is the most essential characteristic of quantum physics, specifcially, when it is subject to the resource-theoretical framework, it is considered as the most fundamental resource for quantum techniques. Other quantum resources, e.g., entanglement, are all based on coherence. Therefore, it becomes urgently important to learn how to preserve coherence in quantum channels. The best preservation is coherence freezing, which has been studied recently. However, in these studies, the freezing condition is theoretically calculated, and there still lacks a practical way to achieve this freezing; in addition the channels are usually fixed, but actually, there are also degrees of freedom that can be used to adapt the channels to quantum states. Here we develop a self-guided quantum coherence freezing method, which can guide either the quantum channels (tunable-channel scheme with upgraded channels) or the initial state (fixed-channel scheme) to the coherence-freezing zone from any starting estimate. Specifically, in the fixed-channel scheme, the final-iterative quantum states all satisfy the previously calculated freezing condition. This coincidence demonstrates the validity of our method. Our work will be helpful for the better protection of quantum coherence.

(Un)Fixing Education

ERIC Educational Resources Information Center

Kuntz, Aaron M.; Petrovic, John E.

2018-01-01

In this article we consider the material dimensions of schooling as constitutive of the possibilities inherent in "fixing" education. We begin by mapping out the problem of "fixing education," pointing to the necrophilic tendencies of contemporary education--a desire to kill what otherwise might be life-giving. In this sense,…

Fixed point Open Ocean Observatory network (FixO3): Multidisciplinary observations from the air-sea interface to the deep seafloor

NASA Astrophysics Data System (ADS)

Lampitt, Richard; Cristini, Luisa

2014-05-01

The Fixed point Open Ocean Observatory network (FixO3) seeks to integrate the 23 European open ocean fixed point observatories and to improve access to these key installations for the broader community. These will provide multidisciplinary observations in all parts of the oceans from the air-sea interface to the deep seafloor. Coordinated by the National Oceanography Centre, UK, FixO3 builds on the significant advances achieved through the previous Europe-funded FP7 programmes EuroSITES, ESONET and CARBOOCEAN. Started in September 2013 with a budget of 7 Million Euros over 4 years the project has 29 partners drawn from academia, research institutions and SME's. In addition 12 international experts from a wide range of disciplines comprise an Advisory Board. On behalf of the FixO3 Consortium, we present the programme that will be achieved through the activities of 12 Work Packages: 1. Coordination activities to integrate and harmonise the current procedures and processes. Strong links will be fostered with the wider community across academia, industry, policy and the general public through outreach, knowledge exchange and training. 2. Support actions to offer a) free access to observatory infrastructures to those who do not have such access, and b) free and open data services and products. 3. Joint research activities to innovate and enhance the current capability for multidisciplinary in situ ocean observation. Support actions include Transnational Access (TNA) to FixO3 infrastructure, meaning that European organizations can apply to free-of-charge access to the observatories for research and testing in two international calls during the project lifetime. The first call for TNA opens in summer 2014. More information can be found on FixO3 website (www.fixo3.eu/). Open ocean observation is currently a high priority for European marine and maritime activities. FixO3 will provide important data on environmental products and services to address the Marine Strategy Framework Directive and in support of the European Integrated Maritime Policy. The FixO3 network will provide free and open access to in situ fixed point data of the highest quality. It will provide a strong integrated framework of open ocean facilities in the Atlantic from the Arctic to the Antarctic and throughout the Mediterranean, enabling an integrated, regional and multidisciplinary approach to understand natural and anthropogenic change in the ocean.

[Formula: see text]-Contraction in terms of measure of noncompactness with application for nonlinear integral equations.

PubMed

Nikbakhtsarvestani, Farzaneh; Vaezpour, S Mansour; Asadi, Mehdi

2017-01-01

In this paper, some new generalization of Darbo's fixed point theorem is proved by using a [Formula: see text]-contraction in terms of a measure of noncompactness. Our result extends to obtaining a common fixed point for a pair of compatible mappings. The paper contains an application for nonlinear integral equations as well.

Fixed Point Theorems for Hybrid Mappings

PubMed Central

Kamran, Tayyab; Karapinar, Erdal

2015-01-01

We obtain some fixed point theorems for two pairs of hybrid mappings using hybrid tangential property and quadratic type contractive condition. Our results generalize some results by Babu and Alemayehu and those contained therein. In the sequel, we introduce a new notion to generalize occasionally weak compatibility. Moreover, two concrete examples are established to illuminate the generality of our results. PMID:25629089

Fixed Point Problems for Linear Transformations on Pythagorean Triples

ERIC Educational Resources Information Center

Zhan, M.-Q.; Tong, J.-C.; Braza, P.

2006-01-01

In this article, an attempt is made to find all linear transformations that map a standard Pythagorean triple (a Pythagorean triple [x y z][superscript T] with y being even) into a standard Pythagorean triple, which have [3 4 5][superscript T] as their fixed point. All such transformations form a monoid S* under matrix product. It is found that S*…

Fixed-Radius Point Counts in Forests: Factors Influencing Effectiveness and Efficiency

Treesearch

Daniel R. Petit; Lisa J. Petit; Victoria A. Saab; Thomas E. Martin

1995-01-01

The effectiveness of fixed-radius point counts in quantifying abundance and richness of bird species in oak-hickory, pine-hardwoods, mixed-mesophytic, beech-maple, and riparian cottonwood forests was evaluated in Arkansas, Ohio, Kentucky, and Idaho. Effects of count duration and numbers of stations and visits per stand were evaluated in May to July 1991 by conducting...

A MAP fixed-point, packing-unpacking routine for the IBM 7094 computer

Treesearch

Robert S. Helfman

1966-01-01

Two MAP (Macro Assembly Program) computer routines for packing and unpacking fixed point data are described. Use of these routines with Fortran IV Programs provides speedy access to quantities of data which far exceed the normal storage capacity of IBM 7000-series computers. Many problems that could not be attempted because of the slow access-speed of tape...

Quantum group spin nets: Refinement limit and relation to spin foams

NASA Astrophysics Data System (ADS)

Dittrich, Bianca; Martin-Benito, Mercedes; Steinhaus, Sebastian

2014-07-01

So far spin foam models are hardly understood beyond a few of their basic building blocks. To make progress on this question, we define analogue spin foam models, so-called "spin nets," for quantum groups SU(2)k and examine their effective continuum dynamics via tensor network renormalization. In the refinement limit of this coarse-graining procedure, we find a vast nontrivial fixed-point structure beyond the degenerate and the BF phase. In comparison to previous work, we use fixed-point intertwiners, inspired by Reisenberger's construction principle [M. P. Reisenberger, J. Math. Phys. (N.Y.) 40, 2046 (1999)] and the recent work [B. Dittrich and W. Kaminski, arXiv:1311.1798], as the initial parametrization. In this new parametrization fine-tuning is not required in order to flow to these new fixed points. Encouragingly, each fixed point has an associated extended phase, which allows for the study of phase transitions in the future. Finally we also present an interpretation of spin nets in terms of melonic spin foams. The coarse-graining flow of spin nets can thus be interpreted as describing the effective coupling between two spin foam vertices or space time atoms.

How nonperturbative is the infrared regime of Landau gauge Yang-Mills correlators?

NASA Astrophysics Data System (ADS)

Reinosa, U.; Serreau, J.; Tissier, M.; Wschebor, N.

2017-07-01

We study the Landau gauge correlators of Yang-Mills fields for infrared Euclidean momenta in the context of a massive extension of the Faddeev-Popov Lagrangian which, we argue, underlies a variety of continuum approaches. Standard (perturbative) renormalization group techniques with a specific, infrared-safe renormalization scheme produce so-called decoupling and scaling solutions for the ghost and gluon propagators, which correspond to nontrivial infrared fixed points. The decoupling fixed point is infrared stable and weakly coupled, while the scaling fixed point is unstable and generically strongly coupled except for low dimensions d →2 . Under the assumption that such a scaling fixed point exists beyond one-loop order, we find that the corresponding ghost and gluon scaling exponents are, respectively, 2 αF=2 -d and 2 αG=d at all orders of perturbation theory in the present renormalization scheme. We discuss the relation between the ghost wave function renormalization, the gluon screening mass, the scale of spectral positivity violation, and the gluon mass parameter. We also show that this scaling solution does not realize the standard Becchi-Rouet-Stora-Tyutin symmetry of the Faddeev-Popov Lagrangian. Finally, we discuss our findings in relation to the results of nonperturbative continuum methods.

Stochastic oscillations in models of epidemics on a network of cities

NASA Astrophysics Data System (ADS)

Rozhnova, G.; Nunes, A.; McKane, A. J.

2011-11-01

We carry out an analytic investigation of stochastic oscillations in a susceptible-infected-recovered model of disease spread on a network of n cities. In the model a fraction fjk of individuals from city k commute to city j, where they may infect, or be infected by, others. Starting from a continuous-time Markov description of the model the deterministic equations, which are valid in the limit when the population of each city is infinite, are recovered. The stochastic fluctuations about the fixed point of these equations are derived by use of the van Kampen system-size expansion. The fixed point structure of the deterministic equations is remarkably simple: A unique nontrivial fixed point always exists and has the feature that the fraction of susceptible, infected, and recovered individuals is the same for each city irrespective of its size. We find that the stochastic fluctuations have an analogously simple dynamics: All oscillations have a single frequency, equal to that found in the one-city case. We interpret this phenomenon in terms of the properties of the spectrum of the matrix of the linear approximation of the deterministic equations at the fixed point.

Self-adaptive demodulation for polarization extinction ratio in distributed polarization coupling.

PubMed

Zhang, Hongxia; Ren, Yaguang; Liu, Tiegen; Jia, Dagong; Zhang, Yimo

2013-06-20

A self-adaptive method for distributed polarization extinction ratio (PER) demodulation is demonstrated. It is characterized by dynamic PER threshold coupling intensity (TCI) and nonuniform PER iteration step length (ISL). Based on the preset PER calculation accuracy and original distribution coupling intensity, TCI and ISL can be made self-adaptive to determine contributing coupling points inside the polarizing devices. Distributed PER is calculated by accumulating those coupling points automatically and selectively. Two different kinds of polarization-maintaining fibers are tested, and PERs are obtained after merely 3-5 iterations using the proposed method. Comparison experiments with Thorlabs commercial instrument are also conducted, and results show high consistency. In addition, the optimum preset PER calculation accuracy of 0.05 dB is obtained through many repeated experiments.

Adaptive form-finding method for form-fixed spatial network structures

NASA Astrophysics Data System (ADS)

Lan, Cheng; Tu, Xi; Xue, Junqing; Briseghella, Bruno; Zordan, Tobia

2018-02-01

An effective form-finding method for form-fixed spatial network structures is presented in this paper. The adaptive form-finding method is introduced along with the example of designing an ellipsoidal network dome with bar length variations being as small as possible. A typical spherical geodesic network is selected as an initial state, having bar lengths in a limit group number. Next, this network is transformed into the ellipsoidal shape as desired by applying compressions on bars according to the bar length variations caused by transformation. Afterwards, the dynamic relaxation method is employed to explicitly integrate the node positions by applying residual forces. During the form-finding process, the boundary condition of constraining nodes on the ellipsoid surface is innovatively considered as reactions on the normal direction of the surface at node positions, which are balanced with the components of the nodal forces in a reverse direction induced by compressions on bars. The node positions are also corrected according to the fixed-form condition in each explicit iteration step. In the serial results of time history, the optimal solution is found from a time history of states by properly choosing convergence criteria, and the presented form-finding procedure is proved to be applicable for form-fixed problems.

Cosmic infinity: a dynamical system approach

NASA Astrophysics Data System (ADS)

Bouhmadi-López, Mariam; Marto, João; Morais, João; Silva, César M.

2017-03-01

Dynamical system techniques are extremely useful to study cosmology. It turns out that in most of the cases, we deal with finite isolated fixed points corresponding to a given cosmological epoch. However, it is equally important to analyse the asymptotic behaviour of the universe. On this paper, we show how this can be carried out for 3-form models. In fact, we show that there are fixed points at infinity mainly by introducing appropriate compactifications and defining a new time variable that washes away any potential divergence of the system. The richness of 3-form models allows us as well to identify normally hyperbolic non-isolated fixed points. We apply this analysis to three physically interesting situations: (i) a pre-inflationary era; (ii) an inflationary era; (iii) the late-time dark matter/dark energy epoch.

Quantum corrections to non-Abelian SUSY theories on orbifolds

NASA Astrophysics Data System (ADS)

Groot Nibbelink, Stefan; Hillenbach, Mark

2006-07-01

We consider supersymmetric non-Abelian gauge theories coupled to hyper multiplets on five and six dimensional orbifolds, S/Z and T/Z, respectively. We compute the bulk and local fixed point renormalizations of the gauge couplings. To this end we extend supergraph techniques to these orbifolds by defining orbifold compatible delta functions. We develop their properties in detail. To cancel the bulk one-loop divergences the bulk gauge kinetic terms and dimension six higher derivative operators are required. The gauge couplings renormalize at the Z fixed points due to vector multiplet self interactions; the hyper multiplet renormalizes only non- Z fixed points. In 6D the Wess-Zumino-Witten term and a higher derivative analogue have to renormalize in the bulk as well to preserve 6D gauge invariance.

Non-Kondo many-body physics in a Majorana-based Kondo type system

NASA Astrophysics Data System (ADS)

van Beek, Ian J.; Braunecker, Bernd

2016-09-01

We carry out a theoretical analysis of a prototypical Majorana system, which demonstrates the existence of a Majorana-mediated many-body state and an associated intermediate low-energy fixed point. Starting from two Majorana bound states, hosted by a Coulomb-blockaded topological superconductor and each coupled to a separate lead, we derive an effective low-energy Hamiltonian, which displays a Kondo-like character. However, in contrast to the Kondo model which tends to a strong- or weak-coupling limit under renormalization, we show that this effective Hamiltonian scales to an intermediate fixed point, whose existence is contingent upon teleportation via the Majorana modes. We conclude by determining experimental signatures of this fixed point, as well as the exotic many-body state associated with it.

Nonminimal hints for asymptotic safety

NASA Astrophysics Data System (ADS)

Eichhorn, Astrid; Lippoldt, Stefan; Skrinjar, Vedran

2018-01-01

In the asymptotic-safety scenario for gravity, nonzero interactions are present in the ultraviolet. This property should also percolate into the matter sector. Symmetry-based arguments suggest that nonminimal derivative interactions of scalars with curvature tensors should therefore be present in the ultraviolet regime. We perform a nonminimal test of the viability of the asymptotic-safety scenario by working in a truncation of the renormalization group flow, where we discover the existence of an interacting fixed point for a corresponding nonminimal coupling. The back-coupling of such nonminimal interactions could in turn destroy the asymptotically safe fixed point in the gravity sector. As a key finding, we observe nontrivial indications of stability of the fixed-point properties under the impact of nonminimal derivative interactions, further strengthening the case for asymptotic safety in gravity-matter systems.

Bilateral Comparison of Mercury and Gallium Fixed-Point Cells Using Standard Platinum Resistance Thermometer

NASA Astrophysics Data System (ADS)

Bojkovski, J.; Veliki, T.; Zvizdić, D.; Drnovšek, J.

2011-08-01

The objective of project EURAMET 1127 (Bilateral comparison of triple point of mercury and melting point of gallium) in the field of thermometry is to compare realization of a triple point of mercury (-38.8344 °C) and melting point of gallium (29.7646 °C) between the Slovenian national laboratory MIRS/UL-FE/LMK and the Croatian national laboratory HMI/FSB-LPM using a long-stem 25 Ω standard platinum resistance thermometer (SPRT). MIRS/UL/FE-LMK participated in a number of intercomparisons on the level of EURAMET. On the other hand, the HMI/LPM-FSB laboratory recently acquired new fixed-point cells which had to be evaluated in the process of intercomparisons. A quartz-sheathed SPRT has been selected and calibrated at HMI/LPM-FSB at the triple point of mercury, the melting point of gallium, and the water triple point. A second set of measurements was made at MIRS/UL/FE-LMK. After its return, the SPRT was again recalibrated at HMI/LPM-FSB. In the comparison, the W value of the SPRT has been used. Results of the bilateral intercomparison confirmed that the new gallium cell of the HMI/LPM-FSB has a value that is within uncertainty limits of both laboratories that participated in the exercise, while the mercury cell experienced problems. After further research, a small leakage in the mercury fixed-point cell has been found.

Extrapolation of radiation thermometry scales for determining the transition temperature of metal-carbon points. Experiments with the Co-C

NASA Astrophysics Data System (ADS)

Battuello, M.; Girard, F.; Florio, M.

2009-02-01

Four independent radiation temperature scales approximating the ITS-90 at 900 nm, 950 nm and 1.6 µm have been realized from the indium point (429.7485 K) to the copper point (1357.77 K) which were used to derive by extrapolation the transition temperature T90(Co-C) of the cobalt-carbon eutectic fixed point. An INRIM cell was investigated and an average value T90(Co-C) = 1597.20 K was found with the four values lying within 0.25 K. Alternatively, thermodynamic approximated scales were realized by assigning to the fixed points the best presently available thermodynamic values and deriving T(Co-C). An average value of 1597.27 K was found (four values lying within 0.25 K). The standard uncertainties associated with T90(Co-C) and T(Co-C) were 0.16 K and 0.17 K, respectively. INRIM determinations are compatible with recent thermodynamic determinations on three different cells (values lying between 1597.11 K and 1597.25 K) and with the result of a comparison on the same cell by an absolute radiation thermometer and an irradiance measurement with filter radiometers which give values of 1597.11 K and 1597.43 K, respectively (Anhalt et al 2006 Metrologia 43 S78-83). The INRIM approach allows the determination of both ITS-90 and thermodynamic temperature of a fixed point in a simple way and can provide valuable support to absolute radiometric methods in defining the transition temperature of new high-temperature fixed points.