Multiscale geometric modeling of macromolecules I: Cartesian representation
NASA Astrophysics Data System (ADS)
Xia, Kelin; Feng, Xin; Chen, Zhan; Tong, Yiying; Wei, Guo-Wei
2014-01-01
This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace-Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the
Multiscale geometric modeling of macromolecules I: Cartesian representation
Xia, Kelin; Feng, Xin; Chen, Zhan; Tong, Yiying; Wei, Guo-Wei
2014-01-15
This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace–Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the
Multiscale geometric modeling of macromolecules I: Cartesian representation
Xia, Kelin; Feng, Xin; Chen, Zhan; Tong, Yiying; Wei, Guo Wei
2013-01-01
This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace-Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the
Multiscale geometric modeling of macromolecules I: Cartesian representation.
Xia, Kelin; Feng, Xin; Chen, Zhan; Tong, Yiying; Wei, Guo Wei
2014-01-01
This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace-Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the
Choi, Cheol Ho
2004-02-22
A new way of generating the multipole moments of Cartesian Gaussian functions in spherical polar coordinates has been established, bypassing the intermediary of Cartesian moment tensors. A new set of recurrence relations have also been derived for the resulting analytic integral values. The new method furnishes a conceptually simple and numerically efficient evaluation procedure for the multipole moments. The advantages over existing methods are documented. The results are relevant for the linear scaling quantum theories based on the fast multipole method. PMID:15268515
Moment Closures on Two-Dimensional Cartesian Grids
Energy Science and Technology Software Center (ESTSC)
2015-07-31
Some moment methods for kinetic equations are complicated and take time to develop. Over the course of a couple years, this software was developed to test different closures on standard test problems in the literature. With this software, researchers in the field of moment closures will be able to rapidly test new methods.
NASA Astrophysics Data System (ADS)
Gilmanov, Anvar; Sotiropoulos, Fotis
2005-08-01
A numerical method is developed for solving the 3D, unsteady, incompressible Navier-Stokes equations in Cartesian domains containing immersed boundaries of arbitrary geometrical complexity moving with prescribed kinematics. The governing equations are discretized on a hybrid staggered/non-staggered grid layout using second-order accurate finite-difference formulas. The discrete equations are integrated in time via a second-order accurate dual-time-stepping, artificial compressibility iteration scheme. Unstructured, triangular meshes are employed to discretize complex immersed boundaries. The nodes of the surface mesh constitute a set of Lagrangian control points used to track the motion of the flexible body. At every instant in time, the influence of the body on the flow is accounted for by applying boundary conditions at Cartesian grid nodes located in the exterior but in the immediate vicinity of the body by reconstructing the solution along the local normal to the body surface. Grid convergence tests are carried out for the flow induced by an oscillating sphere in a cubic cavity, which show that the method is second-order accurate. The method is validated by applying it to calculate flow in a Cartesian domain containing a rigid sphere rotating at constant angular velocity as well as flow induced by a flapping wing. The ability of the method to simulate flows in domains with arbitrarily complex moving bodies is demonstrated by applying to simulate flow past an undulating fish-like body and flow past an anatomically realistic planktonic copepod performing an escape-like maneuver.
Rotation invariant moments and transforms for geometrically invariant image watermarking
NASA Astrophysics Data System (ADS)
Singh, Chandan; Ranade, Sukhjeet K.
2013-01-01
We present invariant image watermarking based on a recently introduced set of polar harmonic transforms and angular radial transforms and their comparative analysis with state-of-art approaches based on Zernike moments and pseudo-Zernike moments (ZMs/PZMs). Similar to ZMs/PZMs, these transforms provide rotation invariance and resilience to noise while mitigating inherent limitations like numerical instability and computational cost at high order of moments. These characteristics motivate us to design invariant transform-based invariant image watermarking schemes that can withstand various intentional or unintentional attacks, handle large bitcarriers, and work in a limited computing environment. A comparative performance evaluation of watermarking systems regarding critical parameters like visual imperceptibility, embedding capacity, and watermark robustness against geometric transformations, common signal processing distortions, and Stirmark attacks is performed along with the empirical analysis of various inherent properties of transforms and moments such as magnitude invariance, reconstruction capabilities, and computational complexity to investigate relationships between the performance of watermarking schemes and inherent properties of transforms.
Analysis of geometric moments as features for firearm identification.
Md Ghani, Nor Azura; Liong, Choong-Yeun; Jemain, Abdul Aziz
2010-05-20
The task of identifying firearms from forensic ballistics specimens is exacting in crime investigation since the last two decades. Every firearm, regardless of its size, make and model, has its own unique 'fingerprint'. These fingerprints transfer when a firearm is fired to the fired bullet and cartridge case. The components that are involved in producing these unique characteristics are the firing chamber, breech face, firing pin, ejector, extractor and the rifling of the barrel. These unique characteristics are the critical features in identifying firearms. It allows investigators to decide on which particular firearm that has fired the bullet. Traditionally the comparison of ballistic evidence has been a tedious and time-consuming process requiring highly skilled examiners. Therefore, the main objective of this study is the extraction and identification of suitable features from firing pin impression of cartridge case images for firearm recognition. Some previous studies have shown that firing pin impression of cartridge case is one of the most important characteristics used for identifying an individual firearm. In this study, data are gathered using 747 cartridge case images captured from five different pistols of type 9mm Parabellum Vektor SP1, made in South Africa. All the images of the cartridge cases are then segmented into three regions, forming three different set of images, i.e. firing pin impression image, centre of firing pin impression image and ring of firing pin impression image. Then geometric moments up to the sixth order were generated from each part of the images to form a set of numerical features. These 48 features were found to be significantly different using the MANOVA test. This high dimension of features is then reduced into only 11 significant features using correlation analysis. Classification results using cross-validation under discriminant analysis show that 96.7% of the images were classified correctly. These results demonstrate
Analytic dipole moment geometric derivatives from nuclear electric shielding in molecules
NASA Astrophysics Data System (ADS)
Lazzeretti, P.; Zanasi, R.
1986-04-01
We present ab initio calculations of dipole moment geometric derivatives for some first-row atom hydrides. Dipole moment derivatives, in terms of atomic polar tensors (APT), are equivalent to nuclear electric shieldings and were determined analytically, within the random phase approximation (RPA). Polarized basis sets were used, which give accurate results with small computer effort.
Efficient 3D geometric and Zernike moments computation from unstructured surface meshes.
Pozo, José María; Villa-Uriol, Maria-Cruz; Frangi, Alejandro F
2011-03-01
This paper introduces and evaluates a fast exact algorithm and a series of faster approximate algorithms for the computation of 3D geometric moments from an unstructured surface mesh of triangles. Being based on the object surface reduces the computational complexity of these algorithms with respect to volumetric grid-based algorithms. In contrast, it can only be applied for the computation of geometric moments of homogeneous objects. This advantage and restriction is shared with other proposed algorithms based on the object boundary. The proposed exact algorithm reduces the computational complexity for computing geometric moments up to order N with respect to previously proposed exact algorithms, from N(9) to N(6). The approximate series algorithm appears as a power series on the rate between triangle size and object size, which can be truncated at any desired degree. The higher the number and quality of the triangles, the better the approximation. This approximate algorithm reduces the computational complexity to N(3). In addition, the paper introduces a fast algorithm for the computation of 3D Zernike moments from the computed geometric moments, with a computational complexity N(4), while the previously proposed algorithm is of order N(6). The error introduced by the proposed approximate algorithms is evaluated in different shapes and the cost-benefit ratio in terms of error, and computational time is analyzed for different moment orders. PMID:20714011
NASA Astrophysics Data System (ADS)
Maginot, Peter G.; Morel, Jim E.; Ragusa, Jean C.
2012-08-01
We present a new nonlinear spatial finite-element method for the linearized Boltzmann transport equation with Sn angular discretization in 1-D and 2-D Cartesian geometries. This method has two central characteristics. First, it is equivalent to the linear-discontinuous (LD) Galerkin method whenever that method yields a strictly non-negative solution. Second, it always satisfies both the zeroth and first spatial moment equations. Because it yields the LD solution when that solution is non-negative, one might interpret our method as a classical fix-up to the LD scheme. However, fix-up schemes for the LD equations derived in the past have given up solution of the first moment equations when the LD solution is negative in order to satisfy positivity in a simple manner. We present computational results comparing our method in 1-D to the strictly non-negative linear exponential-discontinuous method and to the LD method. We present computational results in 2-D comparing our method to a recently developed LD fix-up scheme and to the LD scheme. It is demonstrated that our method is a valuable alternative to existing methods.
Geometric moment based nonlocal-means filter for ultrasound image denoising
NASA Astrophysics Data System (ADS)
Dou, Yangchao; Zhang, Xuming; Ding, Mingyue; Chen, Yimin
2011-06-01
It is inevitable that there is speckle noise in ultrasound image. Despeckling is the important process. The original nonlocal means (NLM) filter can remove speckle noise and protect the texture information effectively when the image corruption degree is relatively low. But when the noise in the image is strong, NLM will produce fictitious texture information, which has the disadvantageous influence on its denoising performance. In this paper, a novel nonlocal means (NLM) filter is proposed. We introduce geometric moments into the NLM filter. Though geometric moments are not orthogonal moments, it is popular by its concision, and its restoration ability is not yet proved. Results on synthetic data and real ultrasound image show that the proposed method can get better despeckling performance than other state-of-the-art method.
Affine Legendre moment invariants for image watermarking robust to geometric distortions
Zhang, Hui; Shu, Huazhong; Coatrieux, Gouenou; Zhu, Jie; Wu, Jonathan Q. M.; Zhang, Yue; Zhu, Hongqing; Luo, Limin
2011-01-01
Geometric distortions are generally simple and effective attacks for many watermarking methods. They can make detection and extraction of the embedded watermark difficult or even impossible by destroying the synchronization between the watermark reader and the embedded watermark. In this paper, we propose a new watermarking approach which allows watermark detection and extraction under affine transformation attacks. The novelty of our approach stands on a set of affine invariants we derived from Legendre moments. Watermark embedding and detection are directly performed on this set of invariants. We also show how these moments can be exploited for estimating the geometric distortion parameters in order to permit watermark extraction. Experimental results show that the proposed watermarking scheme is robust to a wide range of attacks: geometric distortion, filtering, compression, and additive noise. PMID:21342852
NASA Astrophysics Data System (ADS)
Lazzeretti, Paolo; Malagoli, Massimo; Zanasi, Riccardo
1991-01-01
The virial theorem has been used to derive sum rules for dipole- and mixed-dipole-quadrupole nuclear electric shieldings and corresponding geometrical derivatives of dipole and quadrupole moments in a molecule. Test calculations have been carried out on a series of first- and second-row hydrides. The virial sum rules can be effective tools to prove the accuracy of theoretical nuclear shieldings and analytic geometrical derivatives. As the latter are related to ir intensities, the virial sum rules can give important indications on the reliability of theoretical predictions for this spectroscopical parameter.
NASA Astrophysics Data System (ADS)
Kwon, H.
2011-12-01
The impact of climate variation on monsoon seasonal rainfall has been generally well documented in the climate literature. However, rather limited efforts have been done to understand moisture transport and their impact on extreme rainfall in the hydrology field. This study developed a new model for extracting moisture tracks associated with extreme events as a way to characterize large scale climate system. Main interests are to derive location, size and direction of the rainfall field and this study developed an algorithm to extract the above characteristics from global climate data set. In order to facilitate characterization of synoptic patterns, geometric moment based ellipsoid models are introduced. Local weather station data in Korea and NCEP reanalysis data are mainly utilized to identify synoptic patterns. The proposed geometric moments based ellipsoid model works equally well with regularly and irregularly distributed synthetic grid data. Finally, the proposed model was applied to space-time real moisture transport. We extracted daily wind patterns and specific humidity on top 20 extreme rainfall events and apply a 90% threshold to isolate high magnitude of moisture transport associated with extreme rainfall in South Korea. It was found that location, size and direction of the rainfall field was successfully extracted. Our analyses of daily synoptic moisture transport patterns defined by geometric moments suggest can be possibly clustered given their intensity, direction and position properties. Acknowledgement : This work was supported by National Research Foundation of Korea Grant funded by the Korean Government (NRF-2010-220-D00083)
Moment map and gauge geometric aspects of the Schrödinger and Pauli equations
NASA Astrophysics Data System (ADS)
Spera, Mauro
2016-03-01
In this paper we discuss various geometric aspects related to the Schrödinger and the Pauli equations. First we resume the Madelung-Bohm hydrodynamical approach to quantum mechanics and recall the Hamiltonian structure of the Schrödinger equation. The probability current provides an equivariant moment map for the group G = sDiff(R3) of volume-preserving diffeomorphisms of R3 (rapidly approaching the identity at infinity) and leads to a current algebra of Rasetti-Regge type. The moment map picture is then extended, mutatis mutandis, to the Pauli equation and to generalized Schrödinger equations of the Pauli-Thomas type. A gauge theoretical reinterpretation of all equations is obtained via the introduction of suitable Maurer-Cartan gauge fields and it is then related to Weyl geometric and pilot wave ideas. A general framework accommodating Aharonov-Bohm and Aharonov-Casher effects is presented within the gauge approach. Furthermore, a kind of holomorphic geometric quantization can be performed and yields natural “coherent state” representations of G. The relationship with the covariant phase space and density manifold approaches is then outlined. Comments on possible extensions to nonlinear Schrödinger equations, on Fisher-information theoretic aspects and on stochastic mechanics are finally made.
Spin-orbit coupled jeff=1/2 iridium moments on the geometrically frustrated fcc lattice
Cook, A. M.; Matern, S.; Hickey, C.; Aczel, A. A.; Paramekanti, A.
2015-07-01
Motivated by experiments on La2ZnIrO6 and La2MgIrO6, we study the magnetism of spin-orbit coupled jeff = 1/2 iridium moments on the three-dimensional geometrically-frustrated face-centered cubic lattice. The symmetry-allowed nearest-neighbor interaction includes Heisenberg, Kitaev, and symmetric off-diagonal exchange. Using Luttinger-Tisza and Monte Carlo simulations, we find a rich variety of orders, including collinear A-type antiferromagnetism, collinear stripe order with moments along the {111}-direction, and incommensurate non-coplanar spirals, and determine their magnetic ordering transition temperatures. We argue that thermodynamic data on these iridates underscore the presence of a dominant Kitaev exchange, and suggest a possible resolution to the puzzle of why La2ZnIrO6,more » but not La2MgIrO6, exhibits 'weak' ferromagnetism.« less
NASA Astrophysics Data System (ADS)
Hovorka, O.; Barker, J.; Friedman, G.; Chantrell, R. W.
2014-03-01
Thermally activated magnetization decay is studied in ensembles of clusters of interacting dipolar moments by applying the master-equation formalism, as a model of thermal relaxation in systems of interacting single-domain ferromagnetic particles. Solving the associated master equation reveals a breakdown of the energy barrier picture depending on the geometrical symmetry of structures. Deviations are most pronounced for reduced symmetry and result in a strong interaction dependence of relaxation rates on the memory of system initialization. A simple two-state system description of an ensemble of clusters is developed, which accounts for the observed anomalies. These results follow from a semianalytical treatment, and are fully supported by kinetic Monte Carlo simulations.
NASA Astrophysics Data System (ADS)
Hovorka, Ondrej; Barker, Joe; Friedman, Gary; Chantrell, Roy
2014-03-01
Thermally activated magnetization decay is studied in ensembles of clusters of interacting dipolar moments by applying the master-equation formalism, as a model of thermal relaxation in systems of interacting single-domain ferromagnetic nanoparticles. Solving the associated master-equation reveals a breakdown of the energy barrier picture depending on the geometrical symmetry of structures. Deviations are most pronounced for reduced symmetry and result in a strong interaction dependence of relaxation rates on the memory of initialization of an ensemble. Developed is a simple two-state system description of an ensemble, which accounts for the observed anomalies. These results follow from a semi-analytical treatment, and are fully supported by kinetic Monte-Carlo simulations. OH gratefully acknowledges support from a Marie Curie Intra European Fellowship within the 7th European Community Framework Programme under grant agreement PIEF-GA-2010-273014.
Comparison of organs' shapes with geometric and Zernike 3D moments.
Broggio, D; Moignier, A; Ben Brahim, K; Gardumi, A; Grandgirard, N; Pierrat, N; Chea, M; Derreumaux, S; Desbrée, A; Boisserie, G; Aubert, B; Mazeron, J-J; Franck, D
2013-09-01
The morphological similarity of organs is studied with feature vectors based on geometric and Zernike 3D moments. It is particularly investigated if outliers and average models can be identified. For this purpose, the relative proximity to the mean feature vector is defined, principal coordinate and clustering analyses are also performed. To study the consistency and usefulness of this approach, 17 livers and 76 hearts voxel models from several sources are considered. In the liver case, models with similar morphological feature are identified. For the limited amount of studied cases, the liver of the ICRP male voxel model is identified as a better surrogate than the female one. For hearts, the clustering analysis shows that three heart shapes represent about 80% of the morphological variations. The relative proximity and clustering analysis rather consistently identify outliers and average models. For the two cases, identification of outliers and surrogate of average models is rather robust. However, deeper classification of morphological feature is subject to caution and can only be performed after cross analysis of at least two kinds of feature vectors. Finally, the Zernike moments contain all the information needed to re-construct the studied objects and thus appear as a promising tool to derive statistical organ shapes. PMID:23846154
NASA Astrophysics Data System (ADS)
Zanasi, Riccardo; Lazzeretti, Paolo
1986-11-01
Calculations of dipole moment geometric derivatives for C2H4, C2H6, CH2O, CH3F, C2H2, HCN, and CH3OH molecules are presented. Satisfactory results are obtained by using a previously introduced analytical method, based on the evaluation of nuclear electric shieldings combined with the use of ``polarized'' basis sets. Computer efforts are maintained reasonably low.
Geometric quantum phase for displaced states for a particle with an induced electric dipole moment
NASA Astrophysics Data System (ADS)
Lemos de Melo, J.; Bakke, K.; Furtado, C.
2016-07-01
Basing on the analogue Landau levels for a neutral particle possessing an induced electric dipole moment, we show that displaced states can be built in the presence of electric and magnetic fields. Besides, the Berry phase associated with these displaced quantum states is obtained by performing an adiabatic cyclic evolution in series of paths in parameter space.
NASA Astrophysics Data System (ADS)
Ortega, Roberto; Quintanar, Luis; Huesca-Pérez, Eduardo
2015-12-01
The East Pacific Rise (EPR) and the Gulf of California (GC) have different tectonic histories. While the EPR has been present for 75 Ma, the GC started only 12.5 Myr. The region that links both systems is the Tamayo Fracture Zone, where a diffuse triple junction is located. A key question to be solved is whether the source mechanisms in this region reflect important variations from the GC to the EPR. Therefore, we analyzed the seismic moment tensors of the GC and the EPR using a full moment tensor inversion. This source model is useful in extensional regimes where isotropic components or complex faults are present. The full moment tensor is the best representation of the fault and slip direction in a rifting process because it resolves for six free parameters, including complex sources of pure shear dislocations. The analysis is similar to the deviatoric case, but the interpretation is different, because physical characteristics in the model allow for choosing a realistic style of rupture. Our results show that there are similarities between focal mechanisms determined by full moment tensors computed for the southern part of the GC and the EPR. We suggest that the EPR is tectonically linked to the GC not only at the diffuse triple junction region but also along the entire province. The rupture patterns of the GC and the EPR are slightly different: whereas the GC is partitioned by means of NW-SE faults, the EPR ruptures through a faulting system NE-SW. The geometrical relations of the extensional province of the GC and the EPR were present since the crustal thinning of the rifting process. Strain partitioning of faults explains easily the nature of the oblique divergence of the GC and the EPR. In addition, in our analysis, we observe clockwise rotation in the structures of the southern part of the GC, suggesting that there is a change in the spatial partitioning of this region.
NASA Astrophysics Data System (ADS)
Yan, H.; Plaster, B.
2011-06-01
Geometric-phase-induced false electric dipole moment (EDM) signals, resulting from interference between magnetic field gradients and particle motion in electric fields, have been studied extensively in the literature, especially for neutron EDM experiments utilizing stored ultracold neutrons and co-magnetometer atoms. Previous studies have considered particle motion in the transverse plane perpendicular to the direction of the applied electric and magnetic fields. We show, via Monte Carlo studies, that motion along the field direction can impact the magnitude of this false EDM signal if the wall surfaces are rough such that the wall collisions can be modeled as diffuse, with the results dependent on the size of the storage cell's dimension along the field direction.
Blodwell, J.F.
1987-10-01
It is argued that the point structure of space and time must be constructed from the primitive extensional character of space and time. A procedure for doing this is laid down and applied to one-dimensional and two-dimensional systems of abstract extensions. Topological and metrical properties of the constructed point systems, which differ nontrivially from the usual R and R/sup 2/ models, are examined. Briefly, constructed points are associated with directions and the Cartesian point is split. In one-dimension each point splits into a point pair compatible with the linear ordering. An application to one-dimensional particle motion is given, with the result that natural topological assumptions force the number of left point, right point transitions to remain locally finite in a continuous motion. In general, Cartesian points are seen to correspond to certain filters on a suitable Boolean algebra. Constructed points correspond to ultrafilters. Thus, point construction gives a natural refinement of the Cartesian systems.
NASA Technical Reports Server (NTRS)
Heedy, D. J.; Burnside, W. D.
1984-01-01
The moment method and the uniform geometrical theory of diffraction are utilized to obtain two separate solutions for the E-plane field pattern of an aperture-matched horn antenna. This particular horn antenna consists of a standard pyramidal horn with the following modifications: a rolled edge section attached to the aperture edges and a curved throat section. The resulting geometry provides significantly better performance in terms of the pattern, impedance, and frequency characteristics than normally obtainable. The moment method is used to calculate the E-plane pattern and BSWR of the antenna. However, at higher frequencies, large amounts of computation time are required. The uniform geometrical theory of diffraction provides a quick and efficient high frequency solution for the E-plane field pattern. In fact, the uniform geometrical theory of diffraction may be used to initially design the antenna; then, the moment method may be applied to fine tune the design. This procedure has been successfully applied to a compact range feed design.
Electronic Absolute Cartesian Autocollimator
NASA Technical Reports Server (NTRS)
Leviton, Douglas B.
2006-01-01
An electronic absolute Cartesian autocollimator performs the same basic optical function as does a conventional all-optical or a conventional electronic autocollimator but differs in the nature of its optical target and the manner in which the position of the image of the target is measured. The term absolute in the name of this apparatus reflects the nature of the position measurement, which, unlike in a conventional electronic autocollimator, is based absolutely on the position of the image rather than on an assumed proportionality between the position and the levels of processed analog electronic signals. The term Cartesian in the name of this apparatus reflects the nature of its optical target. Figure 1 depicts the electronic functional blocks of an electronic absolute Cartesian autocollimator along with its basic optical layout, which is the same as that of a conventional autocollimator. Referring first to the optical layout and functions only, this or any autocollimator is used to measure the compound angular deviation of a flat datum mirror with respect to the optical axis of the autocollimator itself. The optical components include an illuminated target, a beam splitter, an objective or collimating lens, and a viewer or detector (described in more detail below) at a viewing plane. The target and the viewing planes are focal planes of the lens. Target light reflected by the datum mirror is imaged on the viewing plane at unit magnification by the collimating lens. If the normal to the datum mirror is parallel to the optical axis of the autocollimator, then the target image is centered on the viewing plane. Any angular deviation of the normal from the optical axis manifests itself as a lateral displacement of the target image from the center. The magnitude of the displacement is proportional to the focal length and to the magnitude (assumed to be small) of the angular deviation. The direction of the displacement is perpendicular to the axis about which the
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.
Software for Automated Generation of Cartesian Meshes
NASA Technical Reports Server (NTRS)
Aftosmis, Michael J.; Melton, John E.; Berger, Marshal J.
2006-01-01
Cart3D is a collection of computer programs for generating Cartesian meshes [for computational fluid dynamics (CFD) and other applications] in volumes bounded by solid objects. Aspects of Cart3D at earlier stages of development were reported in "Robust and Efficient Generation of Cartesian Meshes for CFD" (ARC-14275), NASA Tech Briefs, Vol. 23, No. 8 (August 1999), page 30. The geometric input to Cart3D comprises surface triangulations like those commonly generated by computer-aided-design programs. Complexly shaped objects can be represented as assemblies of simpler ones. Cart3D deletes all portions of such an assembled object that are not on the exterior surface. Intersections between components are preserved in the resulting triangulation. A tie-breaking routine unambiguously resolves geometric degeneracies. Then taking the intersected surface triangulation as input, the volume mesh is generated through division of cells of an initially coarse hexahedral grid. Cells are subdivided to refine the grid in regions of increased surface curvature and/or increased flow gradients. Cells that become split into multiple unconnected regions by thin pieces of surface are identified.
NASA Technical Reports Server (NTRS)
Reddy, C. J.; Deshpande, M. D.; Cockrell, C. R.; Beck, F. B.
1995-01-01
A combined finite element method (FEM) and method of moments (MoM) technique is presented to analyze the radiation characteristics of a cavity-fed aperture in three dimensions. Generalized feed modeling has been done using the modal expansion of fields in the feed structure. Numerical results for some feeding structures such as a rectangular waveguide, circular waveguide, and coaxial line are presented. The method also uses the geometrical theory of diffraction (GTD) to predict the effect of a finite ground plane on radiation characteristics. Input admittance calculations for open radiating structures such as a rectangular waveguide, a circular waveguide, and a coaxial line are shown. Numerical data for a coaxial-fed cavity with finite ground plane are verified with experimental data.
Triangle geometry processing for surface modeling and cartesian grid generation
Aftosmis, Michael J [San Mateo, CA; Melton, John E [Hollister, CA; Berger, Marsha J [New York, NY
2002-09-03
Cartesian mesh generation is accomplished for component based geometries, by intersecting components subject to mesh generation to extract wetted surfaces with a geometry engine using adaptive precision arithmetic in a system which automatically breaks ties with respect to geometric degeneracies. During volume mesh generation, intersected surface triangulations are received to enable mesh generation with cell division of an initially coarse grid. The hexagonal cells are resolved, preserving the ability to directionally divide cells which are locally well aligned.
Triangle Geometry Processing for Surface Modeling and Cartesian Grid Generation
NASA Technical Reports Server (NTRS)
Aftosmis, Michael J. (Inventor); Melton, John E. (Inventor); Berger, Marsha J. (Inventor)
2002-01-01
Cartesian mesh generation is accomplished for component based geometries, by intersecting components subject to mesh generation to extract wetted surfaces with a geometry engine using adaptive precision arithmetic in a system which automatically breaks ties with respect to geometric degeneracies. During volume mesh generation, intersected surface triangulations are received to enable mesh generation with cell division of an initially coarse grid. The hexagonal cells are resolved, preserving the ability to directionally divide cells which are locally well aligned.
ERIC Educational Resources Information Center
Planinsic, G.; Kos, M.; Jerman, R.
2004-01-01
It is quite easy to make a version of the well known Cartesian diver experiment that uses two immiscible liquids. This allows students to test their knowledge of density and pressure in explaining the diver's behaviour. Construction details are presented here together with a mathematical model to explain the observations.
3D Euler flow solutions using unstructured Cartesian and prismatic grids
NASA Technical Reports Server (NTRS)
Melton, John E.; Pandya, Shishir A.; Steger, Joseph L.
1993-01-01
A hyperbolic prismatic grid generation technique is combined with a background Cartesian grid for the study of inviscid three-dimensional flows. The mathematics of the hyperbolic prismatic grid generation algorithm are described, and some simple inviscid demonstration cases are presented. By combining the simplicity of the Cartesian background grid with the geometric flexibility and computational efficiencies inherent to prismatic grids, this approach shows promise for improving computational aerodynamic simulations.
Cartesian control of redundant robots
NASA Technical Reports Server (NTRS)
Colbaugh, R.; Glass, K.
1989-01-01
A Cartesian-space position/force controller is presented for redundant robots. The proposed control structure partitions the control problem into a nonredundant position/force trajectory tracking problem and a redundant mapping problem between Cartesian control input F is a set member of the set R(sup m) and robot actuator torque T is a set member of the set R(sup n) (for redundant robots, m is less than n). The underdetermined nature of the F yields T map is exploited so that the robot redundancy is utilized to improve the dynamic response of the robot. This dynamically optimal F yields T map is implemented locally (in time) so that it is computationally efficient for on-line control; however, it is shown that the map possesses globally optimal characteristics. Additionally, it is demonstrated that the dynamically optimal F yields T map can be modified so that the robot redundancy is used to simultaneously improve the dynamic response and realize any specified kinematic performance objective (e.g., manipulability maximization or obstacle avoidance). Computer simulation results are given for a four degree of freedom planar redundant robot under Cartesian control, and demonstrate that position/force trajectory tracking and effective redundancy utilization can be achieved simultaneously with the proposed controller.
Topology preserving advection of implicit interfaces on Cartesian grids
NASA Astrophysics Data System (ADS)
Qin, Zhipeng; Delaney, Keegan; Riaz, Amir; Balaras, Elias
2015-06-01
Accurate representation of implicit interface topology is important for the numerical computation of two phase flow on Cartesian grids. A new method is proposed for the construction of signed distance function by geometrically projecting interface topology onto the Cartesian grid using a multi-level projection framework. The method involves a stepwise improvement in the approximation to the signed distance function based on pointwise, piecewise and locally smooth reconstructions of the interface. We show that this approach provides accurate representation of the projected interface and its topology on the Cartesian grid, including the distance from the interface and the interface normal and curvature. The projected interface can be in the form of either a connected set of marker particles that evolve with Lagrangian advection, or a discrete set of points associated with an implicit interface that evolves with the advection of a scalar function. The signed distance function obtained with geometric projection is independent of the details of the scaler field, in contrast to the conventional approach where advection and reinitialization cannot be decoupled. As a result, errors introduced by reinitialization do not amplify advection errors, which leads to substantial improvement in both volume conservation and topology representation.
Cartesian to geodetic coordinates conversion on a triaxial ellipsoid
NASA Astrophysics Data System (ADS)
Ligas, Marcin
2012-04-01
A new method of transforming Cartesian to geodetic (or planetographic) coordinates on a triaxial ellipsoid is presented. The method is based on simple reasoning coming from essentials of vector calculus. The reasoning results in solving a nonlinear system of equations for coordinates of the point being the projection of a point located outside or inside a triaxial ellipsoid along the normal to the ellipsoid. The presented method has been compared to a vector method of Feltens (J Geod 83:129-137, 2009) who claims that no other methods are available in the literature. Generally, our method turns out to be more accurate, faster and applicable to celestial bodies characterized by different geometric parameters. The presented method also fits to the classical problem of converting Cartesian to geodetic coordinates on the ellipsoid of revolution.
High Energy Boundary Conditions for a Cartesian Mesh Euler Solver
NASA Technical Reports Server (NTRS)
Pandya, Shishir; Murman, Scott; Aftosmis, Michael
2003-01-01
Inlets and exhaust nozzles are common place in the world of flight. Yet, many aerodynamic simulation packages do not provide a method of modelling such high energy boundaries in the flow field. For the purposes of aerodynamic simulation, inlets and exhausts are often fared over and it is assumed that the flow differences resulting from this assumption are minimal. While this is an adequate assumption for the prediction of lift, the lack of a plume behind the aircraft creates an evacuated base region thus effecting both drag and pitching moment values. In addition, the flow in the base region is often mis-predicted resulting in incorrect base drag. In order to accurately predict these quantities, a method for specifying inlet and exhaust conditions needs to be available in aerodynamic simulation packages. A method for a first approximation of a plume without accounting for chemical reactions is added to the Cartesian mesh based aerodynamic simulation package CART3D. The method consists of 3 steps. In the first step, a components approach where each triangle is assigned a component number is used. Here, a method for marking the inlet or exhaust plane triangles as separate components is discussed. In step two, the flow solver is modified to accept a reference state for the components marked inlet or exhaust. In the third step, the flow solver uses these separated components and the reference state to compute the correct flow condition at that triangle. The present method is implemented in the CART3D package which consists of a set of tools for generating a Cartesian volume mesh from a set of component triangulations. The Euler equations are solved on the resulting unstructured Cartesian mesh. The present methods is implemented in this package and its usefulness is demonstrated with two validation cases. A generic missile body is also presented to show the usefulness of the method on a real world geometry.
Turing instabilities on Cartesian product networks
Asllani, Malbor; Busiello, Daniel M.; Carletti, Timoteo; Fanelli, Duccio; Planchon, Gwendoline
2015-01-01
The problem of Turing instabilities for a reaction-diffusion system defined on a complex Cartesian product network is considered. To this end we operate in the linear regime and expand the time dependent perturbation on a basis formed by the tensor product of the eigenvectors of the discrete Laplacian operators, associated to each of the individual networks that build the Cartesian product. The dispersion relation which controls the onset of the instability depends on a set of discrete wavelengths, the eigenvalues of the aforementioned Laplacians. Patterns can develop on the Cartesian network, if they are supported on at least one of its constitutive sub-graphs. Multiplex networks are also obtained under specific prescriptions. In this case, the criteria for the instability reduce to compact explicit formulae. Numerical simulations carried out for the Mimura-Murray reaction kinetics confirm the adequacy of the proposed theory. PMID:26245138
Turing instabilities on Cartesian product networks
NASA Astrophysics Data System (ADS)
Asllani, Malbor; Busiello, Daniel M.; Carletti, Timoteo; Fanelli, Duccio; Planchon, Gwendoline
2015-08-01
The problem of Turing instabilities for a reaction-diffusion system defined on a complex Cartesian product network is considered. To this end we operate in the linear regime and expand the time dependent perturbation on a basis formed by the tensor product of the eigenvectors of the discrete Laplacian operators, associated to each of the individual networks that build the Cartesian product. The dispersion relation which controls the onset of the instability depends on a set of discrete wavelengths, the eigenvalues of the aforementioned Laplacians. Patterns can develop on the Cartesian network, if they are supported on at least one of its constitutive sub-graphs. Multiplex networks are also obtained under specific prescriptions. In this case, the criteria for the instability reduce to compact explicit formulae. Numerical simulations carried out for the Mimura-Murray reaction kinetics confirm the adequacy of the proposed theory.
Turing instabilities on Cartesian product networks.
Asllani, Malbor; Busiello, Daniel M; Carletti, Timoteo; Fanelli, Duccio; Planchon, Gwendoline
2015-01-01
The problem of Turing instabilities for a reaction-diffusion system defined on a complex Cartesian product network is considered. To this end we operate in the linear regime and expand the time dependent perturbation on a basis formed by the tensor product of the eigenvectors of the discrete Laplacian operators, associated to each of the individual networks that build the Cartesian product. The dispersion relation which controls the onset of the instability depends on a set of discrete wavelengths, the eigenvalues of the aforementioned Laplacians. Patterns can develop on the Cartesian network, if they are supported on at least one of its constitutive sub-graphs. Multiplex networks are also obtained under specific prescriptions. In this case, the criteria for the instability reduce to compact explicit formulae. Numerical simulations carried out for the Mimura-Murray reaction kinetics confirm the adequacy of the proposed theory. PMID:26245138
Stable boundary conditions for Cartesian grid calculations
NASA Technical Reports Server (NTRS)
Berger, M. J.; Leveque, R. J.
1990-01-01
The inviscid Euler equations in complicated geometries are solved using a Cartesian grid. This requires solid wall boundary conditions in the irregular grid cells near the boundary. Since these cells may be orders of magnitude smaller than the regular grid cells, stability is a primary concern. An approach to this problem is presented and its use is illustrated.
Cook, A. M.; Matern, S.; Hickey, C.; Aczel, A. A.; Paramekanti, A.
2015-07-01
Motivated by experiments on La_{2}ZnIrO_{6 }and La_{2}MgIrO_{6}, we study the magnetism of spin-orbit coupled jeff = 1/2 iridium moments on the three-dimensional geometrically-frustrated face-centered cubic lattice. The symmetry-allowed nearest-neighbor interaction includes Heisenberg, Kitaev, and symmetric off-diagonal exchange. Using Luttinger-Tisza and Monte Carlo simulations, we find a rich variety of orders, including collinear A-type antiferromagnetism, collinear stripe order with moments along the {111}-direction, and incommensurate non-coplanar spirals, and determine their magnetic ordering transition temperatures. We argue that thermodynamic data on these iridates underscore the presence of a dominant Kitaev exchange, and suggest a possible resolution to the puzzle of why La_{2}ZnIrO_{6}, but not La_{2}MgIrO_{6}, exhibits 'weak' ferromagnetism.
The 3D Euler solutions using automated Cartesian grid generation
NASA Technical Reports Server (NTRS)
Melton, John E.; Enomoto, Francis Y.; Berger, Marsha J.
1993-01-01
Viewgraphs on 3-dimensional Euler solutions using automated Cartesian grid generation are presented. Topics covered include: computational fluid dynamics (CFD) and the design cycle; Cartesian grid strategy; structured body fit; grid generation; prolate spheroid; and ONERA M6 wing.
A uniform parametrization of moment tensors
NASA Astrophysics Data System (ADS)
Tape, Walter; Tape, Carl
2015-09-01
A moment tensor is a 3 × 3 symmetric matrix that expresses an earthquake source. We construct a parametrization of the 5-D space of all moment tensors of unit norm. The coordinates associated with the parametrization are closely related to moment tensor orientations and source types. The parametrization is uniform, in the sense that equal volumes in the coordinate domain of the parametrization correspond to equal volumes of moment tensors. Uniformly distributed points in the coordinate domain therefore give uniformly distributed moment tensors. A cartesian grid in the coordinate domain can be used to search efficiently over moment tensors. We find that uniformly distributed moment tensors have uniformly distributed orientations (eigenframes), but that their source types (eigenvalue triples) are distributed so as to favour double couples.
Transonic airfoil design using Cartesian coordinates
NASA Technical Reports Server (NTRS)
Carlson, L. A.
1976-01-01
A numerical technique for designing transonic airfoils having a prescribed pressure distribution (the inverse problem) is presented. The method employs the basic features of Jameson's iterative solution for the full potential equation, except that inverse boundary conditions and Cartesian coordinates are used. The method is a direct-inverse approach that controls trailing-edge closure. Examples show the application of the method to design aft-cambered and other airfoils specifically for transonic flight.
Schwartz, Peter; Barad, Michael; Colella, Phillip; Ligocki, Terry
2004-11-02
We present an algorithm for solving Poisson's equation and the heat equation on irregular domains in three dimensions. Our work uses the Cartesian grid embedded boundary algorithm for 2D problems of Johansen and Colella (1998, J. Comput. Phys. 147(2):60-85) and extends work of McCorquodale, Colella and Johansen (2001, J. Comput. Phys. 173(2):60-85). Our method is based on a finite-volume discretization of the operator, on the control volumes formed by intersecting the Cartesian grid cells with the domain, combined with a second-order accurate discretization of the fluxes. The resulting method provides uniformly second-order accurate solutions and gradients and is amenable to geometric multigrid solvers.
ERIC Educational Resources Information Center
Williams, Kate
2012-01-01
The informatics moment is the moment when a person seeks help in using some digital technology that is new to him or her. This article examines the informatics moment in people's everyday lives as they sought help at a branch public library. Four types of literacy were involved: basic literacy (reading and writing), computer literacy (use of a…
Explicitly computing geodetic coordinates from Cartesian coordinates
NASA Astrophysics Data System (ADS)
Zeng, Huaien
2013-04-01
This paper presents a new form of quartic equation based on Lagrange's extremum law and a Groebner basis under the constraint that the geodetic height is the shortest distance between a given point and the reference ellipsoid. A very explicit and concise formulae of the quartic equation by Ferrari's line is found, which avoids the need of a good starting guess for iterative methods. A new explicit algorithm is then proposed to compute geodetic coordinates from Cartesian coordinates. The convergence region of the algorithm is investigated and the corresponding correct solution is given. Lastly, the algorithm is validated with numerical experiments.
Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows
NASA Technical Reports Server (NTRS)
Coirier, William J.; Powell, Kenneth G.
1996-01-01
A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.
Electrostatic PIC with adaptive Cartesian mesh
NASA Astrophysics Data System (ADS)
Kolobov, Vladimir; Arslanbekov, Robert
2016-05-01
We describe an initial implementation of an electrostatic Particle-in-Cell (ES-PIC) module with adaptive Cartesian mesh in our Unified Flow Solver framework. Challenges of PIC method with cell-based adaptive mesh refinement (AMR) are related to a decrease of the particle-per-cell number in the refined cells with a corresponding increase of the numerical noise. The developed ES-PIC solver is validated for capacitively coupled plasma, its AMR capabilities are demonstrated for simulations of streamer development during high-pressure gas breakdown. It is shown that cell-based AMR provides a convenient particle management algorithm for exponential multiplications of electrons and ions in the ionization events.
An adaptive Cartesian control scheme for manipulators
NASA Technical Reports Server (NTRS)
Seraji, H.
1987-01-01
A adaptive control scheme for direct control of manipulator end-effectors to achieve trajectory tracking in Cartesian space is developed. The control structure is obtained from linear multivariable theory and is composed of simple feedforward and feedback controllers and an auxiliary input. The direct adaptation laws are derived from model reference adaptive control theory and are not based on parameter estimation of the robot model. The utilization of feedforward control and the inclusion of auxiliary input are novel features of the present scheme and result in improved dynamic performance over existing adaptive control schemes. The adaptive controller does not require the complex mathematical model of the robot dynamics or any knowledge of the robot parameters or the payload, and is computationally fast for online implementation with high sampling rates.
Moments of Inertia of Disks and Spheres without Integration
ERIC Educational Resources Information Center
Hong, Seok-Cheol; Hong, Seok-In
2013-01-01
Calculation of moments of inertia is often challenging for introductory-level physics students due to the use of integration, especially in non-Cartesian coordinates. Methods that do not employ calculus have been described for finding the rotational inertia of thin rods and other simple bodies. In this paper we use the parallel axis theorem and…
NASA Astrophysics Data System (ADS)
Lin, Dejun
2015-09-01
Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green's function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4-16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A
A uniform parameterization of moment tensors
NASA Astrophysics Data System (ADS)
Tape, C.; Tape, W.
2015-12-01
A moment tensor is a 3 x 3 symmetric matrix that expresses an earthquake source. We construct a parameterization of the five-dimensional space of all moment tensors of unit norm. The coordinates associated with the parameterization are closely related to moment tensor orientations and source types. The parameterization is uniform, in the sense that equal volumes in the coordinate domain of the parameterization correspond to equal volumes of moment tensors. Uniformly distributed points in the coordinate domain therefore give uniformly distributed moment tensors. A cartesian grid in the coordinate domain can be used to search efficiently over moment tensors. We find that uniformly distributed moment tensors have uniformly distributed orientations (eigenframes), but that their source types (eigenvalue triples) are distributed so as to favor double couples. An appropriate choice of a priori moment tensor probability is a prerequisite for parameter estimation. As a seemingly sensible choice, we consider the homogeneous probability, in which equal volumes of moment tensors are equally likely. We believe that it will lead to improved characterization of source processes.
The adaptive, cut-cell Cartesian approach (warts and all)
NASA Technical Reports Server (NTRS)
Powell, Kenneth G.
1995-01-01
Solution-adaptive methods based on cutting bodies out of Cartesian grids are gaining popularity now that the ways of circumventing the accuracy problems associated with small cut cells have been developed. Researchers are applying Cartesian-based schemes to a broad class of problems now, and, although there is still development work to be done, it is becoming clearer which problems are best suited to the approach (and which are not). The purpose of this paper is to give a candid assessment, based on applying Cartesian schemes to a variety of problems, of the strengths and weaknesses of the approach as it is currently implemented.
Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method
NASA Technical Reports Server (NTRS)
Nemec, Marian; Aftosmis, Michael J.
2004-01-01
Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented
Fox-Wolfram moments in Higgs physics
NASA Astrophysics Data System (ADS)
Bernaciak, Catherine; Buschmann, Malte Seán Andreas; Butter, Anja; Plehn, Tilman
2013-04-01
Geometric correlations between jets as part of hard processes or in addition to hard processes are key ingredients to many LHC analyses. Fox-Wolfram moments systematically describe these correlations in terms of spherical harmonics. These moments, computed either from the tagging jets or from all jets in each event, can significantly improve Higgs searches in weak boson fusion. Applications of Fox-Wolfram moments in LHC analyses obviously surpass jets as analysis objects, as well as Higgs searches in terms of analyses.
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.
NASA Astrophysics Data System (ADS)
Lindlein, Norbert; Leuchs, Gerd
This chapter shall discuss the basics and the applications of geometrical optical methods in modern optics. Geometrical optics has a long tradition and some ideas are many centuries old. Nevertheless, the invention of modern personal computers which can perform several million floating-point operations in a second also revolutionized the methods of geometrical optics and so several analytical methods lost importance whereas numerical methods such as ray tracing became very important. Therefore, the emphasis in this chapter is also on modern numerical methods such as ray tracing and some other systematic methods such as the paraxial matrix theory.
Frequency-Offset Cartesian Feedback Based on Polyphase Difference Amplifiers
Zanchi, Marta G.; Pauly, John M.; Scott, Greig C.
2010-01-01
A modified Cartesian feedback method called “frequency-offset Cartesian feedback” and based on polyphase difference amplifiers is described that significantly reduces the problems associated with quadrature errors and DC-offsets in classic Cartesian feedback power amplifier control systems. In this method, the reference input and feedback signals are down-converted and compared at a low intermediate frequency (IF) instead of at DC. The polyphase difference amplifiers create a complex control bandwidth centered at this low IF, which is typically offset from DC by 200–1500 kHz. Consequently, the loop gain peak does not overlap DC where voltage offsets, drift, and local oscillator leakage create errors. Moreover, quadrature mismatch errors are significantly attenuated in the control bandwidth. Since the polyphase amplifiers selectively amplify the complex signals characterized by a +90° phase relationship representing positive frequency signals, the control system operates somewhat like single sideband (SSB) modulation. However, the approach still allows the same modulation bandwidth control as classic Cartesian feedback. In this paper, the behavior of the polyphase difference amplifier is described through both the results of simulations, based on a theoretical analysis of their architecture, and experiments. We then describe our first printed circuit board prototype of a frequency-offset Cartesian feedback transmitter and its performance in open and closed loop configuration. This approach should be especially useful in magnetic resonance imaging transmit array systems. PMID:20814450
Frequency-Offset Cartesian Feedback Based on Polyphase Difference Amplifiers.
Zanchi, Marta G; Pauly, John M; Scott, Greig C
2010-05-01
A modified Cartesian feedback method called "frequency-offset Cartesian feedback" and based on polyphase difference amplifiers is described that significantly reduces the problems associated with quadrature errors and DC-offsets in classic Cartesian feedback power amplifier control systems.In this method, the reference input and feedback signals are down-converted and compared at a low intermediate frequency (IF) instead of at DC. The polyphase difference amplifiers create a complex control bandwidth centered at this low IF, which is typically offset from DC by 200-1500 kHz. Consequently, the loop gain peak does not overlap DC where voltage offsets, drift, and local oscillator leakage create errors. Moreover, quadrature mismatch errors are significantly attenuated in the control bandwidth. Since the polyphase amplifiers selectively amplify the complex signals characterized by a +90° phase relationship representing positive frequency signals, the control system operates somewhat like single sideband (SSB) modulation. However, the approach still allows the same modulation bandwidth control as classic Cartesian feedback.In this paper, the behavior of the polyphase difference amplifier is described through both the results of simulations, based on a theoretical analysis of their architecture, and experiments. We then describe our first printed circuit board prototype of a frequency-offset Cartesian feedback transmitter and its performance in open and closed loop configuration. This approach should be especially useful in magnetic resonance imaging transmit array systems. PMID:20814450
NASA Technical Reports Server (NTRS)
Finley, Dennis B.
1995-01-01
This report documents results from the Euler Technology Assessment program. The objective was to evaluate the efficacy of Euler computational fluid dynamics (CFD) codes for use in preliminary aircraft design. Both the accuracy of the predictions and the rapidity of calculations were to be assessed. This portion of the study was conducted by Lockheed Fort Worth Company, using a recently developed in-house Cartesian-grid code called SPLITFLOW. The Cartesian grid technique offers several advantages for this study, including ease of volume grid generation and reduced number of cells compared to other grid schemes. SPLITFLOW also includes grid adaptation of the volume grid during the solution convergence to resolve high-gradient flow regions. This proved beneficial in resolving the large vortical structures in the flow for several configurations examined in the present study. The SPLITFLOW code predictions of the configuration forces and moments are shown to be adequate for preliminary design analysis, including predictions of sideslip effects and the effects of geometry variations at low and high angles of attack. The time required to generate the results from initial surface definition is on the order of several hours, including grid generation, which is compatible with the needs of the design environment.
Adaptively Refined Euler and Navier-Stokes Solutions with a Cartesian-Cell Based Scheme
NASA Technical Reports Server (NTRS)
Coirier, William J.; Powell, Kenneth G.
1995-01-01
A Cartesian-cell based scheme with adaptive mesh refinement for solving the Euler and Navier-Stokes equations in two dimensions has been developed and tested. Grids about geometrically complicated bodies were generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells were created using polygon-clipping algorithms. The grid was stored in a binary-tree data structure which provided a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations were solved on the resulting grids using an upwind, finite-volume formulation. The inviscid fluxes were found in an upwinded manner using a linear reconstruction of the cell primitives, providing the input states to an approximate Riemann solver. The viscous fluxes were formed using a Green-Gauss type of reconstruction upon a co-volume surrounding the cell interface. Data at the vertices of this co-volume were found in a linearly K-exact manner, which ensured linear K-exactness of the gradients. Adaptively-refined solutions for the inviscid flow about a four-element airfoil (test case 3) were compared to theory. Laminar, adaptively-refined solutions were compared to accepted computational, experimental and theoretical results.
Efficient Fluid Dynamic Design Optimization Using Cartesian Grids
NASA Technical Reports Server (NTRS)
Dadone, A.; Grossman, B.; Sellers, Bill (Technical Monitor)
2004-01-01
This report is subdivided in three parts. The first one reviews a new approach to the computation of inviscid flows using Cartesian grid methods. The crux of the method is the curvature-corrected symmetry technique (CCST) developed by the present authors for body-fitted grids. The method introduces ghost cells near the boundaries whose values are developed from an assumed flow-field model in vicinity of the wall consisting of a vortex flow, which satisfies the normal momentum equation and the non-penetration condition. The CCST boundary condition was shown to be substantially more accurate than traditional boundary condition approaches. This improved boundary condition is adapted to a Cartesian mesh formulation, which we call the Ghost Body-Cell Method (GBCM). In this approach, all cell centers exterior to the body are computed with fluxes at the four surrounding cell edges. There is no need for special treatment corresponding to cut cells which complicate other Cartesian mesh methods.
A Cartesian grid approach with hierarchical refinement for compressible flows
NASA Technical Reports Server (NTRS)
Quirk, James J.
1994-01-01
Many numerical studies of flows that involve complex geometries are limited by the difficulties in generating suitable grids. We present a Cartesian boundary scheme for two-dimensional, compressible flows that is unfettered by the need to generate a computational grid and so it may be used, routinely, even for the most awkward of geometries. In essence, an arbitrary-shaped body is allowed to blank out some region of a background Cartesian mesh and the resultant cut-cells are singled out for special treatment. This is done within a finite-volume framework and so, in principle, any explicit flux-based integration scheme can take advantage of this method for enforcing solid boundary conditions. For best effect, the present Cartesian boundary scheme has been combined with a sophisticated, local mesh refinement scheme, and a number of examples are shown in order to demonstrate the efficacy of the combined algorithm for simulations of shock interaction phenomena.
A Cartesian parametrization for the numerical analysis of material instability
Mota, Alejandro; Chen, Qiushi; Foulk, III, James W.; Ostien, Jakob T.; Lai, Zhengshou
2016-02-25
We examine four parametrizations of the unit sphere in the context of material stability analysis by means of the singularity of the acoustic tensor. We then propose a Cartesian parametrization for vectors that lie a cube of side length two and use these vectors in lieu of unit normals to test for the loss of the ellipticity condition. This parametrization is then used to construct a tensor akin to the acoustic tensor. It is shown that both of these tensors become singular at the same time and in the same planes in the presence of a material instability. Furthermore, themore » performance of the Cartesian parametrization is compared against the other parametrizations, with the results of these comparisons showing that in general, the Cartesian parametrization is more robust and more numerically efficient than the others.« less
Development and Applications of 3D Cartesian CFD Technology
NASA Technical Reports Server (NTRS)
Melton, John E.; Berger, Marsha J.; VanDalsem, William (Technical Monitor)
1994-01-01
The urgent need for dramatic reductions in aircraft design cycle time is focusing scrutiny upon all aspects of computational fluid dynamics (CFD). These reductions will most likely come not from increased reliance upon user-interactive (and therefore time-expensive) methods, but instead from methods that can be fully automated and incorporated into 'black box' solutions. In comparison with tetrahedral methods, three-dimensional Cartesian grid approaches are in relative infancy, but initial experiences with automated Cartesian techniques are quite promising. Our research is targeted at furthering the development of Cartesian methods so that they can become key elements of a completely automatic grid generation/flow solution procedure applicable to the Euler analysis of complex aircraft geometries.
Numerical Simulation of Rolling-Airframes Using a Multi-Level Cartesian Method
NASA Technical Reports Server (NTRS)
Murman, Scott M.; Aftosmis, Michael J.; Berger, Marsha J.; Kwak, Dochan (Technical Monitor)
2002-01-01
A supersonic rolling missile with two synchronous canard control surfaces is analyzed using an automated, inviscid, Cartesian method. Sequential-static and time-dependent dynamic simulations of the complete motion are computed for canard dither schedules for level flight, pitch, and yaw maneuver. The dynamic simulations are compared directly against both high-resolution viscous simulations and relevant experimental data, and are also utilized to compute dynamic stability derivatives. The results show that both the body roll rate and canard dither motion influence the roll-averaged forces and moments on the body. At the relatively, low roll rates analyzed in the current work these dynamic effects are modest, however the dynamic computations are effective in predicting the dynamic stability derivatives which can be significant for highly-maneuverable missiles.
On differential transformations between Cartesian and curvilinear (geodetic) coordinates
NASA Technical Reports Server (NTRS)
Soler, T.
1976-01-01
Differential transformations are developed between Cartesian and curvilinear orthogonal coordinates. Only matrix algebra is used for the presentation of the basic concepts. After defining the reference systems used the rotation (R), metric (H), and Jacobian (J) matrices of the transformations between cartesian and curvilinear coordinate systems are introduced. A value of R as a function of H and J is presented. Likewise an analytical expression for J(-1) as a function of H(-2) and R is obtained. Emphasis is placed on showing that differential equations are equivalent to conventional similarity transformations. Scaling methods are discussed along with ellipsoidal coordinates. Differential transformations between elipsoidal and geodetic coordinates are established.
Faster tomographic fan-beam back-projection using Cartesian axes pre-projection
NASA Astrophysics Data System (ADS)
Davis, G. R.
1998-02-01
The convolution back-projection algorithm is the most common method for reconstructing images from complete sets of fan-beam projections. For each pixel and for every projection, the interception point on the detector array must be determined and a weighted value from the appropriate point on the filtered back projection added. Thus the number of operations required is of order n2p, where n is the number of points per projection, and p the number of projections. This can mean a considerable computation time, even with modern, fast computer workstations. The complexity of each pixel operation (weighting and geometric computations) is reduced if the projection is first pre-projected onto one or other of the Cartesian axes. This has been demonstrated to reduce the computational time by a factor of 2, with no loss of accuracy, when compared with a highly optimised implementation of the conventional fan-beam back-projection algorithm.
Blurred image recognition by legendre moment invariants
Zhang, Hui; Shu, Huazhong; Han, Guo-Niu; Coatrieux, Gouenou; Luo, Limin; Coatrieux, Jean-Louis
2010-01-01
Processing blurred images is a key problem in many image applications. Existing methods to obtain blur invariants which are invariant with respect to centrally symmetric blur are based on geometric moments or complex moments. In this paper, we propose a new method to construct a set of blur invariants using the orthogonal Legendre moments. Some important properties of Legendre moments for the blurred image are presented and proved. The performance of the proposed descriptors is evaluated with various point-spread functions and different image noises. The comparison of the present approach with previous methods in terms of pattern recognition accuracy is also provided. The experimental results show that the proposed descriptors are more robust to noise and have better discriminative power than the methods based on geometric or complex moments. PMID:19933003
Lin, Dejun
2015-09-21
Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A
Lin, Dejun
2015-09-21
Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green's function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4-16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A
NASA Technical Reports Server (NTRS)
Coirier, William J.; Powell, Kenneth G.
1994-01-01
A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: a gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.
NASA Technical Reports Server (NTRS)
Coirier, William J.; Powell, Kenneth G.
1995-01-01
A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.
SU-E-I-41: Non-Cartesian MR Image Reconstruction with Integrated Gradient Non-Linearity Correction
Tao, S; Trzasko, JD; Polley, TW; Shu, Y; Bernstein, MA
2014-06-01
Purpose: Nonlinearities in the spatial encoding gradients of MRI systems cause geometric distortion in images. Typically, this is retrospectively corrected via image-domain interpolation (a.k.a., “gradwarp”) albeit with a loss of spatial resolution. For non-Cartesian MRI, the latter problem is exaggerated by noise and undersampling artifact. In this study, we describe a novel correction strategy that accounts for gradient nonlinearities during — rather than after — non-Cartesian MRI reconstruction, and demonstrate that this approach mitigates the resolution loss that can occur with standard methods. Methods: To test the proposed method, the American College of Radiology (ACR) quality control phantom was scanned on at 1.5 T (General Electric, v16.0, “zoom” gradient) using a 1.6x undersampled 3D non- Cartesian Shells trajectory (GRE, FOV=24 cm3, 120 shells, 16552 shots, 512 readout, matrix=2403). Image reconstruction was first performed via standard k-space density-compensated gridding and retrospectively corrected via cubic spline interpolation. Image reconstruction was then separately performed using a k-space and image-domain densitycompensated type-3 non-uniform fast Fourier transform (NUFFT), which provides a direct mapping between non-Cartesian k-space samples and warped image space voxel locations. Thus, no separate distortion correction procedure is needed for the proposed approach. The gradient distortion field was determined using vendor provided calibration data. Results: Phantom scan results show that both processing approaches successfully correct geometric distortion. However, visual inspection of the ACR phantom spatial resolution inserts shows that the proposed strategy preserves the resolution of the nominal (uncorrected) reconstruction while “gradwarp” imparts marked spatial blurring (especially for the 1.0 and 1.1 mm inserts) and thus resolution loss. Conclusion: We've presented a novel reconstruction strategy for non-Cartesian MRI
The Cartesian Diver as an Aid for Teaching Respiratory Physiology
ERIC Educational Resources Information Center
Fitch, Greg K.
2004-01-01
The mechanism by which air enters the mammalian lung is difficult for many students of physiology. In particular, some students have trouble seeing how pressure can be transmitted through a fluid such as the intrapleural fluid and how the magnitude of that pressure can change. A Cartesian diver, an old-time child's toy, may be used as a visual aid…
The Cartesian Diver, Surface Tension and the Cheerios Effect
ERIC Educational Resources Information Center
Chen, Chi-Tung; Lee, Wen-Tang; Kao, Sung-Kai
2014-01-01
A Cartesian diver can be used to measure the surface tension of a liquid to a certain extent. The surface tension measurement is related to the two critical pressures at which the diver is about to sink and about to emerge. After sinking because of increasing pressure, the diver is repulsed to the centre of the vessel. After the pressure is…
A Lot of Good Physics in the Cartesian Diver
ERIC Educational Resources Information Center
De Luca, Roberto; Ganci, Salvatore
2011-01-01
The Cartesian diver experiment certainly occupies a place of honour in old physics textbooks as a vivid demonstration of Archimedes' buoyancy. The original experiment, as described in old textbooks, shows Archimedes buoyancy qualitatively: when the increased weight of the diver is not counterbalanced by Archimedes' buoyancy, the diver sinks. When…
Simulations of 6-DOF Motion with a Cartesian Method
NASA Technical Reports Server (NTRS)
Murman, Scott M.; Aftosmis, Michael J.; Berger, Marsha J.; Kwak, Dochan (Technical Monitor)
2003-01-01
Coupled 6-DOF/CFD trajectory predictions using an automated Cartesian method are demonstrated by simulating a GBU-32/JDAM store separating from an F-18C aircraft. Numerical simulations are performed at two Mach numbers near the sonic speed, and compared with flight-test telemetry and photographic-derived data. Simulation results obtained with a sequential-static series of flow solutions are contrasted with results using a time-dependent flow solver. Both numerical methods show good agreement with the flight-test data through the first half of the simulations. The sequential-static and time-dependent methods diverge over the last half of the trajectory prediction. after the store produces peak angular rates. A cost comparison for the Cartesian method is included, in terms of absolute cost and relative to computing uncoupled 6-DOF trajectories. A detailed description of the 6-DOF method, as well as a verification of its accuracy, is provided in an appendix.
Irreducible Cartesian tensors of highest weight, for arbitrary order
NASA Astrophysics Data System (ADS)
Mane, S. R.
2016-03-01
A closed form expression is presented for the irreducible Cartesian tensor of highest weight, for arbitrary order. Two proofs are offered, one employing bookkeeping of indices and, after establishing the connection with the so-called natural tensors and their projection operators, the other one employing purely coordinate-free tensor manipulations. Some theorems and formulas in the published literature are generalized from SO(3) to SO(n), for dimensions n ≥ 3.
Quality-based generation of weather radar Cartesian products
NASA Astrophysics Data System (ADS)
Osrodka, K.; Szturc, J.
2015-05-01
Weather radar data volumes are commonly processed to obtain various 2-D Cartesian products based on the transfer from polar to Cartesian representations through a certain interpolation method. In this research an algorithm of the spatial interpolation of polar reflectivity data employing quality index data is applied to find the Cartesian reflectivity as plan position indicator products. On this basis, quality-based versions of standard algorithms for the generation of the following products have been developed: ETOP (echo top), MAX (maximum of reflectivity), and VIL (vertically integrated liquid water). Moreover, as an example of a higher-level product, a CONVECTION (detection of convection) has been defined as a specific combination of the above-listed standard products. A corresponding quality field is determined for each generated product, taking into account the quality of the pixels from which a given product was determined and how large a fraction of the investigated heights was scanned. Examples of such quality-based products are presented in the paper.
Errors of Remapping of Radar Estimates onto Cartesian Coordinates
NASA Astrophysics Data System (ADS)
Sharif, H. O.; Ogden, F. L.
2014-12-01
Recent upgrades to operational radar rainfall products in terms of quality and resolution call for re-examination of the factors that contribute to the uncertainty of radar rainfall estimation. Remapping or gridding of radar polar observations onto Cartesian coordinates is implemented using various methods, and is often applied when radar estimates are compared against rain gauge observations, in hydrologic applications, or for merging data from different radars. However, assuming perfect radar observations, many of the widely used remapping methodologies do not conserve mass for the rainfall rate field. Research has suggested that optimal remapping should select all polar bins falling within or intersecting a Cartesian grid and assign them weights based on the proportion of each individual bin's area falling within the grid. However, to reduce computational demand practitioners use a variety of approximate remapping approaches. The most popular approximate approaches used are those based on extracting information from radar bins whose centers fall within a certain distance from the center of the Cartesian grid. This paper introduces a mass-conserving method for remapping, which we call "precise remapping", and evaluates it by comparing against two other commonly used remapping methods based on areal weighting and distance. Results show that the choice of the remapping method can lead to large errors in grid-averaged rainfall accumulations.
Frequency-offset Cartesian feedback for MRI power amplifier linearization.
Zanchi, Marta G; Stang, Pascal; Kerr, Adam; Pauly, John M; Scott, Greig C
2011-02-01
High-quality magnetic resonance imaging (MRI) requires precise control of the transmit radio-frequency (RF) field. In parallel excitation applications such as transmit SENSE, high RF power linearity is essential to cancel aliased excitations. In widely-employed class AB power amplifiers, gain compression, cross-over distortion, memory effects, and thermal drift all distort the RF field modulation and can degrade image quality. Cartesian feedback (CF) linearization can mitigate these effects in MRI, if the quadrature mismatch and dc offset imperfections inherent in the architecture can be minimized. In this paper, we present a modified Cartesian feedback technique called "frequency-offset Cartesian feedback" (FOCF) that significantly reduces these problems. In the FOCF architecture, the feedback control is performed at a low intermediate frequency rather than dc, so that quadrature ghosts and dc errors are shifted outside the control bandwidth. FOCF linearization is demonstrated with a variety of typical MRI pulses. Simulation of the magnetization obtained with the Bloch equation demonstrates that high-fidelity RF reproduction can be obtained even with inexpensive class AB amplifiers. Finally, the enhanced RF fidelity of FOCF over CF is demonstrated with actual images obtained in a 1.5 T MRI system. PMID:20959264
Frequency-Offset Cartesian Feedback for MRI Power Amplifier Linearization
Zanchi, Marta Gaia; Stang, Pascal; Kerr, Adam; Pauly, John Mark; Scott, Greig Cameron
2011-01-01
High-quality magnetic resonance imaging (MRI) requires precise control of the transmit radio-frequency field. In parallel excitation applications such as transmit SENSE, high RF power linearity is essential to cancel aliased excitations. In widely-employed class AB power amplifiers, gain compression, cross-over distortion, memory effects, and thermal drift all distort the RF field modulation and can degrade image quality. Cartesian feedback (CF) linearization can mitigate these effects in MRI, if the quadrature mismatch and DC offset imperfections inherent in the architecture can be minimized. In this paper, we present a modified Cartesian feedback technique called “frequency-offset Cartesian feedback” (FOCF) that significantly reduces these problems. In the FOCF architecture, the feedback control is performed at a low intermediate frequency rather than DC, so that quadrature ghosts and DC errors are shifted outside the control bandwidth. FOCF linearization is demonstrated with a variety of typical MRI pulses. Simulation of the magnetization obtained with the Bloch equation demonstrates that high-fidelity RF reproduction can be obtained even with inexpensive class AB amplifiers. Finally, the enhanced RF fidelity of FOCF over CF is demonstrated with actual images obtained in a 1.5 T MRI system. PMID:20959264
NASA Technical Reports Server (NTRS)
Grebowsky, G. J.
1982-01-01
Present LANDSAT data formats are reviewed to clarify how the geodetic location and registration capabilities were defined for P-tape products and RBV data. Since there is only one geometric model used in the master data processor, geometric location accuracy of P-tape products depends on the absolute accuracy of the model and registration accuracy is determined by the stability of the model. Due primarily to inaccuracies in data provided by the LANDSAT attitude management system, desired accuracies are obtained only by using ground control points and a correlation process. The verification of system performance with regards to geodetic location requires the capability to determine pixel positions of map points in a P-tape array. Verification of registration performance requires the capability to determine pixel positions of common points (not necessarily map points) in 2 or more P-tape arrays for a given world reference system scene. Techniques for registration verification can be more varied and automated since map data are not required. The verification of LACIE extractions is used as an example.
Hinker, P.; Hansen, C.
1993-09-01
An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage requirements, and facilitating the transmission of large, multi-timestep geometric data sets. This paper shows how coplanar and nearly coplanar polygons can be merged into larger complex polygons and re-triangulated into fewer simple polygons than originally required. The notable contributions of this paper are: (1) a method for quickly grouping polygons into nearly coplanar sets, (2) a fast approach for merging coplanar polygon sets and, (3) a simple, robust triangulation method for polygons created by 1 and 2. The central idea of the algorithm is the notion of treating polygonal data as a collection of segments and removing redundant segments to quickly form polygon hulls which represent the merged coplanar sets.
Revisiting geometrical shock dynamics for blast wave propagation in complex environment
NASA Astrophysics Data System (ADS)
Ridoux, J.; Lardjane, N.; Gomez, T.; Coulouvrat, F.
2015-10-01
A new fast-running model for blast wave propagation in air is described. This model is an extension of Whitham's Geometrical Shock Dynamics with specific closure to non sustained shock waves. The numerical procedure relies on a Cartesian fast-marching like algorithm with immersed boundary method for complex boundaries. Comparison to academic results underline the capacity of this model.
Moments of catchment storm area
NASA Technical Reports Server (NTRS)
Eagleson, P. S.; Wang, Q.
1985-01-01
The portion of a catchment covered by a stationary rainstorm is modeled by the common area of two overlapping circles. Given that rain occurs within the catchment and conditioned by fixed storm and catchment sizes, the first two moments of the distribution of the common area are derived from purely geometrical considerations. The variance of the wetted fraction is shown to peak when the catchment size is equal to the size of the predominant storm. The conditioning on storm size is removed by assuming a probability distribution based upon the observed fractal behavior of cloud and rainstorm areas.
A Cartesian embedded boundary method for hyperbolic conservation laws
Sjogreen, B; Petersson, N A
2006-12-04
The authors develop an embedded boundary finite difference technique for solving the compressible two- or three-dimensional Euler equations in complex geometries on a Cartesian grid. The method is second order accurate with an explicit time step determined by the grid size away from the boundary. Slope limiters are used on the embedded boundary to avoid non-physical oscillations near shock waves. They show computed examples of supersonic flow past a cylinder and compare with results computed on a body fitted grid. Furthermore, they discuss the implementation of the method for thin geometries, and show computed examples of transonic flow past an airfoil.
Nested Cartesian grid method in incompressible viscous fluid flow
NASA Astrophysics Data System (ADS)
Peng, Yih-Ferng; Mittal, Rajat; Sau, Amalendu; Hwang, Robert R.
2010-09-01
In this work, the local grid refinement procedure is focused by using a nested Cartesian grid formulation. The method is developed for simulating unsteady viscous incompressible flows with complex immersed boundaries. A finite-volume formulation based on globally second-order accurate central-difference schemes is adopted here in conjunction with a two-step fractional-step procedure. The key aspects that needed to be considered in developing such a nested grid solver are proper imposition of interface conditions on the nested-block boundaries, and accurate discretization of the governing equations in cells that are with block-interface as a control-surface. The interpolation procedure adopted in the study allows systematic development of a discretization scheme that preserves global second-order spatial accuracy of the underlying solver, and as a result high efficiency/accuracy nested grid discretization method is developed. Herein the proposed nested grid method has been widely tested through effective simulation of four different classes of unsteady incompressible viscous flows, thereby demonstrating its performance in the solution of various complex flow-structure interactions. The numerical examples include a lid-driven cavity flow and Pearson vortex problems, flow past a circular cylinder symmetrically installed in a channel, flow past an elliptic cylinder at an angle of attack, and flow past two tandem circular cylinders of unequal diameters. For the numerical simulations of flows past bluff bodies an immersed boundary (IB) method has been implemented in which the solid object is represented by a distributed body force in the Navier-Stokes equations. The main advantages of the implemented immersed boundary method are that the simulations could be performed on a regular Cartesian grid and applied to multiple nested-block (Cartesian) structured grids without any difficulty. Through the numerical experiments the strength of the solver in effectively
Claes Hellerström and Cartesian diver microrespirometry
Welsh, Michael
2016-01-01
Cartesian diver microrespirometry was introduced by Claes Hellerström at the Department of Histology/Medical Cell Biology at Uppsala University, Sweden, to determine rates of oxygen consumption in islets of Langerhans. The theory behind this method is touched upon and the main findings described. Glucose-stimulated beta cell respiration significantly contributes to increased ATP generation, which is a prerequisite for stimulated insulin secretion and synthesis. This has had major implications for understanding the beta cell stimulus–secretion coupling. PMID:27181825
NASA Technical Reports Server (NTRS)
Finley, Dennis B.; Karman, Steve L., Jr.
1996-01-01
The objective of the second phase of the Euler Technology Assessment program was to evaluate the ability of Euler computational fluid dynamics codes to predict compressible flow effects over a generic fighter wind tunnel model. This portion of the study was conducted by Lockheed Martin Tactical Aircraft Systems, using an in-house Cartesian-grid code called SPLITFLOW. The Cartesian grid technique offers several advantages, including ease of volume grid generation and reduced number of cells compared to other grid schemes. SPLITFLOW also includes grid adaption of the volume grid during the solution to resolve high-gradient regions. The SPLITFLOW code predictions of configuration forces and moments are shown to be adequate for preliminary design, including predictions of sideslip effects and the effects of geometry variations at low and high angles-of-attack. The transonic pressure prediction capabilities of SPLITFLOW are shown to be improved over subsonic comparisons. The time required to generate the results from initial surface data is on the order of several hours, including grid generation, which is compatible with the needs of the design environment.
GSRP/David Marshall: Fully Automated Cartesian Grid CFD Application for MDO in High Speed Flows
NASA Technical Reports Server (NTRS)
2003-01-01
With the renewed interest in Cartesian gridding methodologies for the ease and speed of gridding complex geometries in addition to the simplicity of the control volumes used in the computations, it has become important to investigate ways of extending the existing Cartesian grid solver functionalities. This includes developing methods of modeling the viscous effects in order to utilize Cartesian grids solvers for accurate drag predictions and addressing the issues related to the distributed memory parallelization of Cartesian solvers. This research presents advances in two areas of interest in Cartesian grid solvers, viscous effects modeling and MPI parallelization. The development of viscous effects modeling using solely Cartesian grids has been hampered by the widely varying control volume sizes associated with the mesh refinement and the cut cells associated with the solid surface. This problem is being addressed by using physically based modeling techniques to update the state vectors of the cut cells and removing them from the finite volume integration scheme. This work is performed on a new Cartesian grid solver, NASCART-GT, with modifications to its cut cell functionality. The development of MPI parallelization addresses issues associated with utilizing Cartesian solvers on distributed memory parallel environments. This work is performed on an existing Cartesian grid solver, CART3D, with modifications to its parallelization methodology.
Maintain rigid structures in Verlet based Cartesian molecular dynamics simulations
NASA Astrophysics Data System (ADS)
Tao, Peng; Wu, Xiongwu; Brooks, Bernard R.
2012-10-01
An algorithm is presented to maintain rigid structures in Verlet based Cartesian molecular dynamics (MD) simulations. After each unconstrained MD step, the coordinates of selected particles are corrected to maintain rigid structures through an iterative procedure of rotation matrix computation. This algorithm, named as SHAPE and implemented in CHARMM program suite, avoids the calculations of Lagrange multipliers, so that the complexity of computation does not increase with the number of particles in a rigid structure. The implementation of this algorithm does not require significant modification of propagation integrator, and can be plugged into any Cartesian based MD integration scheme. A unique feature of the SHAPE method is that it is interchangeable with SHAKE for any object that can be constrained as a rigid structure using multiple SHAKE constraints. Unlike SHAKE, the SHAPE method can be applied to large linear (with three or more centers) and planar (with four or more centers) rigid bodies. Numerical tests with four model systems including two proteins demonstrate that the accuracy and reliability of the SHAPE method are comparable to the SHAKE method, but with much more applicability and efficiency.
[Cartesian misunderstanding as a cause of therapeutic failure].
Isler, H
1986-01-01
Headache patients disassociate themselves from their own automatic responses, relying on the traditional separation of body and mind. On the other hand, patients who obtain voluntary control of automatic functions by biofeedback training modify not only vegetative but also voluntary behaviour patterns, losing "neurotic" traits. The basic misconception of the separation of body and mind, Cartesian dualism, is now ingrained in our culture. In the 17th century Descartes asserted that concepts applied to the soul must be entirely different from those used for the body in order to improve comprehension of the immortality of the soul. This dualism also led to "enlightenment" and to many later social and philosophical developments. But his basic neurophysiology was obsolete when he wrote it down. Other models from mainstream natural philosophy were better compatible with observation and experiments. Gassendi assumed a "body soul" consisting of energy as the functional principle of the nervous system, and Willis accommodated a series of anticipations of 19th century discoveries within this model. No comparable progress resulted from Descartes' own medieval model. Cartesian dualism has become untenable in view of recent neuropsychology but it still obstructs our management of functional patients. Instead of reinforcing the delusion of separation of psyche and soma, we ought to encourage patients to understand that their malfunctioning organs are on-line with their emotions, and with their mind. PMID:2420000
Moment-to-Moment Emotions during Reading
ERIC Educational Resources Information Center
Graesser, Arthur C.; D'Mello, Sidney
2012-01-01
Moment-to-moment emotions are affective states that dynamically change during reading and potentially influence comprehension. Researchers have recently identified these emotions and the emotion trajectories in reading, tutoring, and problem solving. The primary learning-centered emotions are boredom, frustration, confusion, flow (engagement),…
Crockett, Robert; Graves, Daniel; Colella, Phillip
2009-10-23
We present a method for solving Poisson and heat equations with discon- tinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materi- als, as described in Johansen& Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 106, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.
Adjoint Formulation for an Embedded-Boundary Cartesian Method
NASA Technical Reports Server (NTRS)
Nemec, Marian; Aftosmis, Michael J.; Murman, Scott M.; Pulliam, Thomas H.
2004-01-01
Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code
A general time element for orbit integration in Cartesian coordinates
NASA Technical Reports Server (NTRS)
Janin, G.; Bond, V. R.
1981-01-01
Two techniques are discussed for increasing the accuracy of the numerical integration of eccentric orbits in Cartesian coordinates. One involves the use of an independent variable different from time; this increases the efficiency of the numerical integration. The other uses a time element, which reduces the in-track error. A general expression is given of a time element valid for an arbitrary independent variable. It is pointed out that this time element makes it possible to switch the independent variable merely by applying a scaling factor; there is no need to change the differential equations of the motion. Eccentric, true, and elliptic anomalies are used as independent variables in the case of a transfer orbit for a geosynchronous orbit. The elliptic anomaly is shown to perform much better than the other classical anomalies.
Direct adaptive control of manipulators in Cartesian space
NASA Technical Reports Server (NTRS)
Seraji, H.
1987-01-01
A new adaptive-control scheme for direct control of manipulator end effector to achieve trajectory tracking in Cartesian space is developed in this article. The control structure is obtained from linear multivariable theory and is composed of simple feedforward and feedback controllers and an auxiliary input. The direct adaptation laws are derived from model reference adaptive control theory and are not based on parameter estimation of the robot model. The utilization of adaptive feedforward control and the inclusion of auxiliary input are novel features of the present scheme and result in improved dynamic performance over existing adaptive control schemes. The adaptive controller does not require the complex mathematical model of the robot dynamics or any knowledge of the robot parameters or the payload, and is computationally fast for on-line implementation with high sampling rates. The control scheme is applied to a two-link manipulator for illustration.
PREFACE: Geometrically frustrated magnetism Geometrically frustrated magnetism
NASA Astrophysics Data System (ADS)
Gardner, Jason S.
2011-04-01
Frustrated magnetism is an exciting and diverse field in condensed matter physics that has grown tremendously over the past 20 years. This special issue aims to capture some of that excitement in the field of geometrically frustrated magnets and is inspired by the 2010 Highly Frustrated Magnetism (HFM 2010) meeting in Baltimore, MD, USA. Geometric frustration is a broad phenomenon that results from an intrinsic incompatibility between some fundamental interactions and the underlying lattice geometry based on triangles and tetrahedra. Most studies have centred around the kagomé and pyrochlore based magnets but recent work has looked at other structures including the delafossite, langasites, hyper-kagomé, garnets and Laves phase materials to name a few. Personally, I hope this issue serves as a great reference to scientist both new and old to this field, and that we all continue to have fun in this very frustrated playground. Finally, I want to thank the HFM 2010 organizers and all the sponsors whose contributions were an essential part of the success of the meeting in Baltimore. Geometrically frustrated magnetism contents Spangolite: an s = 1/2 maple leaf lattice antiferromagnet? T Fennell, J O Piatek, R A Stephenson, G J Nilsen and H M Rønnow Two-dimensional magnetism and spin-size effect in the S = 1 triangular antiferromagnet NiGa2S4 Yusuke Nambu and Satoru Nakatsuji Short range ordering in the modified honeycomb lattice compound SrHo2O4 S Ghosh, H D Zhou, L Balicas, S Hill, J S Gardner, Y Qi and C R Wiebe Heavy fermion compounds on the geometrically frustrated Shastry-Sutherland lattice M S Kim and M C Aronson A neutron polarization analysis study of moment correlations in (Dy0.4Y0.6)T2 (T = Mn, Al) J R Stewart, J M Hillier, P Manuel and R Cywinski Elemental analysis and magnetism of hydronium jarosites—model kagome antiferromagnets and topological spin glasses A S Wills and W G Bisson The Herbertsmithite Hamiltonian: μSR measurements on single crystals
Multi-fault Tolerance for Cartesian Data Distributions
Ali, Nawab; Krishnamoorthy, Sriram; Halappanavar, Mahantesh; Daily, Jeffrey A.
2013-06-01
Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale sys- tems. Algorithm-based fault tolerance (ABFT) is a promising approach that involves modications to the algorithm to recover from faults with lower over- heads than replicated storage and a signicant reduction in lost work compared to checkpoint-restart techniques. Fault-tolerant linear algebra (FTLA) algo- rithms employ additional processors that store parities along the dimensions of a matrix to tolerate multiple, simultaneous faults. Existing approaches as- sume regular data distributions (blocked or block-cyclic) with the failures of each data block being independent. To match the characteristics of failures on parallel computers, we extend these approaches to mapping parity blocks in several important ways. First, we handle parity computation for generalized Cartesian data distributions with each processor holding arbitrary subsets of blocks in a Cartesian-distributed array. Second, techniques to handle corre- lated failures, i.e., multiple processors that can be expected to fail together, are presented. Third, we handle the colocation of parity blocks with the data blocks and do not require them to be on additional processors. Several al- ternative approaches, based on graph matching, are presented that attempt to balance the memory overhead on processors while guaranteeing the same fault tolerance properties as existing approaches that assume independent fail- ures on regular blocked data distributions. The evaluation of these algorithms demonstrates that the additional desirable properties are provided by the pro- posed approach with minimal overhead.
Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry
NASA Technical Reports Server (NTRS)
Nemec, Marian; Aftosmis, Michael J.
2006-01-01
A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design
Solvents level dipole moments.
Liang, Wenkel; Li, Xiaosong; Dalton, Larry R; Robinson, Bruce H; Eichinger, Bruce E
2011-11-01
The dipole moments of highly polar molecules measured in solution are usually smaller than the molecular dipole moments that are calculated with reaction field methods, whereas vacuum values are routinely calculated in good agreement with available vapor phase data. Whether from Onsager's theory (or variations thereof) or from quantum mechanical methods, the calculated molecular dipoles in solution are found to be larger than those measured. The reason, of course, is that experiments measure the net dipole moment of solute together with the polarized (perturbed) solvent "cloud" surrounding it. Here we show that the reaction field charges that are generated in the quantum mechanical self-consistent reaction field (SCRF) method give a good estimate of the net dipole moment of the solute molecule together with the moment arising from the reaction field charges. This net dipole is a better description of experimental data than the vacuum dipole moment and certainly better than the bare dipole moment of the polarized solute molecule. PMID:21923185
Conversion of Cartesian coordinates from and to Generalized Balanced Ternary addresses
van Roessel, Jan W.
1988-01-01
Hexagonal grids have several advantages over square grids, such as a greater angular resolution and unambiguous connectivity. The Generalized Balanced Ternary (GBT) system is a spatial addressing method for hexagonal grids in which the hexagons are arranged in hierarchical aggregates, and which accommodates vector operations in GBT space. Efficient algorithms for converting Cartesian coordinates from and to GBT addresses are based on the dual representation of the hexagonal tessellation. The GBT-to-Cartesian algorithm is an order of magnitude faster than the Cartesian-to-GBT algorithm, the latter requiring interpolation and GBT addition for each digit of the generated GBT address.
Static Aeroelastic Analysis with an Inviscid Cartesian Method
NASA Technical Reports Server (NTRS)
Rodriguez, David L.; Aftosmis, Michael J.; Nemec, Marian; Smith, Stephen C.
2014-01-01
An embedded-boundary Cartesian-mesh flow solver is coupled with a three degree-offreedom structural model to perform static, aeroelastic analysis of complex aircraft geometries. The approach solves the complete system of aero-structural equations using a modular, loosely-coupled strategy which allows the lower-fidelity structural model to deform the highfidelity CFD model. The approach uses an open-source, 3-D discrete-geometry engine to deform a triangulated surface geometry according to the shape predicted by the structural model under the computed aerodynamic loads. The deformation scheme is capable of modeling large deflections and is applicable to the design of modern, very-flexible transport wings. The interface is modular so that aerodynamic or structural analysis methods can be easily swapped or enhanced. This extended abstract includes a brief description of the architecture, along with some preliminary validation of underlying assumptions and early results on a generic 3D transport model. The final paper will present more concrete cases and validation of the approach. Preliminary results demonstrate convergence of the complete aero-structural system and investigate the accuracy of the approximations used in the formulation of the structural model.
Static Aeroelastic Analysis with an Inviscid Cartesian Method
NASA Technical Reports Server (NTRS)
Rodriguez, David L.; Aftosmis, Michael J.; Nemec, Marian; Smith, Stephen C.
2014-01-01
An embedded-boundary, Cartesian-mesh flow solver is coupled with a three degree-of-freedom structural model to perform static, aeroelastic analysis of complex aircraft geometries. The approach solves a nonlinear, aerostructural system of equations using a loosely-coupled strategy. An open-source, 3-D discrete-geometry engine is utilized to deform a triangulated surface geometry according to the shape predicted by the structural model under the computed aerodynamic loads. The deformation scheme is capable of modeling large deflections and is applicable to the design of modern, very-flexible transport wings. The coupling interface is modular so that aerodynamic or structural analysis methods can be easily swapped or enhanced. After verifying the structural model with comparisons to Euler beam theory, two applications of the analysis method are presented as validation. The first is a relatively stiff, transport wing model which was a subject of a recent workshop on aeroelasticity. The second is a very flexible model recently tested in a low speed wind tunnel. Both cases show that the aeroelastic analysis method produces results in excellent agreement with experimental data.
On NUFFT-based gridding for non-Cartesian MRI
Fessler, Jeffrey A.
2007-01-01
For MRI with non-Cartesian sampling, the conventional approach to reconstructing images is to use the gridding method with a Kaiser-Bessel (KB) interpolation kernel. Recently, Sha et al. [1] proposed an alternative method based on a nonuniform FFT (NUFFT) with least-squares (LS) design of the interpolation coefficients. They described this LS_NUFFT method as shift variant and reported that it yielded smaller reconstruction approximation errors than the conventional shift-invariant KB approach. This paper analyzes the LS_NUFFT approach in detail. We show that when one accounts for a certain linear phase factor, the core of the LS_NUFFT interpolator is in fact real and shift invariant. Furthermore, we find that the KB approach yields smaller errors than the original LS_NUFFT approach. We show that optimizing certain scaling factors can lead to a somewhat improved LS_NUFFT approach, but the high computation cost seems to outweigh the modest reduction in reconstruction error. We conclude that the standard KB approach, with appropriate parameters as described in the literature, remains the practical method of choice for gridding reconstruction in MRI. PMID:17689121
Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver
NASA Astrophysics Data System (ADS)
Moustafa, Salli; Dutka-Malen, Ivan; Plagne, Laurent; Ponçot, Angélique; Ramet, Pierre
2014-06-01
This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOMINO can exploit the full power of modern multi-core processors and is able to tackle very large simulations, that usually require large HPC clusters, using a single computing node. For example, DOMINO solves a 3D full core PWR eigenvalue problem involving 26 energy groups, 288 angular directions (S16), 46 × 106 spatial cells and 1 × 1012 DoFs within 11 hours on a single 32-core SMP node. This represents a sustained performance of 235 GFlops and 40:74% of the SMP node peak performance for the DOMINO sweep implementation. The very high Flops/Watt ratio of DOMINO makes it a very interesting building block for a future many-nodes nuclear simulation tool.
A multilevel Cartesian non-uniform grid time domain algorithm
Meng Jun; Boag, Amir; Lomakin, Vitaliy; Michielssen, Eric
2010-11-01
A multilevel Cartesian non-uniform grid time domain algorithm (CNGTDA) is introduced to rapidly compute transient wave fields radiated by time dependent three-dimensional source constellations. CNGTDA leverages the observation that transient wave fields generated by temporally bandlimited and spatially confined source constellations can be recovered via interpolation from appropriately delay- and amplitude-compensated field samples. This property is used in conjunction with a multilevel scheme, in which the computational domain is hierarchically decomposed into subdomains with sparse non-uniform grids used to obtain the fields. For both surface and volumetric source distributions, the computational cost of CNGTDA to compute the transient field at N{sub s} observation locations from N{sub s} collocated sources for N{sub t} discrete time instances scales as O(N{sub t}N{sub s}logN{sub s}) and O(N{sub t}N{sub s}log{sup 2}N{sub s}) in the low- and high-frequency regimes, respectively. Coupled with marching-on-in-time (MOT) time domain integral equations, CNGTDA can facilitate efficient analysis of large scale time domain electromagnetic and acoustic problems.
On NUFFT-based gridding for non-Cartesian MRI
NASA Astrophysics Data System (ADS)
Fessler, Jeffrey A.
2007-10-01
For MRI with non-Cartesian sampling, the conventional approach to reconstructing images is to use the gridding method with a Kaiser-Bessel (KB) interpolation kernel. Recently, Sha et al. [L. Sha, H. Guo, A.W. Song, An improved gridding method for spiral MRI using nonuniform fast Fourier transform, J. Magn. Reson. 162(2) (2003) 250-258] proposed an alternative method based on a nonuniform FFT (NUFFT) with least-squares (LS) design of the interpolation coefficients. They described this LS_NUFFT method as shift variant and reported that it yielded smaller reconstruction approximation errors than the conventional shift-invariant KB approach. This paper analyzes the LS_NUFFT approach in detail. We show that when one accounts for a certain linear phase factor, the core of the LS_NUFFT interpolator is in fact real and shift invariant. Furthermore, we find that the KB approach yields smaller errors than the original LS_NUFFT approach. We show that optimizing certain scaling factors can lead to a somewhat improved LS_NUFFT approach, but the high computation cost seems to outweigh the modest reduction in reconstruction error. We conclude that the standard KB approach, with appropriate parameters as described in the literature, remains the practical method of choice for gridding reconstruction in MRI.
On NUFFT-based gridding for non-Cartesian MRI.
Fessler, Jeffrey A
2007-10-01
For MRI with non-Cartesian sampling, the conventional approach to reconstructing images is to use the gridding method with a Kaiser-Bessel (KB) interpolation kernel. Recently, Sha et al. [L. Sha, H. Guo, A.W. Song, An improved gridding method for spiral MRI using nonuniform fast Fourier transform, J. Magn. Reson. 162(2) (2003) 250-258] proposed an alternative method based on a nonuniform FFT (NUFFT) with least-squares (LS) design of the interpolation coefficients. They described this LS_NUFFT method as shift variant and reported that it yielded smaller reconstruction approximation errors than the conventional shift-invariant KB approach. This paper analyzes the LS_NUFFT approach in detail. We show that when one accounts for a certain linear phase factor, the core of the LS_NUFFT interpolator is in fact real and shift invariant. Furthermore, we find that the KB approach yields smaller errors than the original LS_NUFFT approach. We show that optimizing certain scaling factors can lead to a somewhat improved LS_NUFFT approach, but the high computation cost seems to outweigh the modest reduction in reconstruction error. We conclude that the standard KB approach, with appropriate parameters as described in the literature, remains the practical method of choice for gridding reconstruction in MRI. PMID:17689121
The geometric phase in quantum physics
Bohm, A.
1993-03-01
After an explanatory introduction, a quantum system in a classical time-dependent environment is discussed; an example is a magnetic moment in a classical magnetic field. At first, the general abelian case is discussed in the adiabatic approximation. Then the geometric phase for nonadiabatic change of the environment (Anandan--Aharonov phase) is introduced, and after that general cyclic (nonadiabatic) evolution is discussed. The mathematics of fiber bundles is introduced, and some of its results are used to describe the relation between the adiabatic Berry phase and the geometric phase for general cyclic evolution of a pure state. The discussion is restricted to the abelian, U(1) phase.
Michael Ramsey-Musolf; Wick Haxton; Ching-Pang Liu
2002-03-29
Nuclear anapole moments are parity-odd, time-reversal-even E1 moments of the electromagnetic current operator. Although the existence of this moment was recognized theoretically soon after the discovery of parity nonconservation (PNC), its experimental isolation was achieved only recently, when a new level of precision was reached in a measurement of the hyperfine dependence of atomic PNC in 133Cs. An important anapole moment bound in 205Tl also exists. In this paper, we present the details of the first calculation of these anapole moments in the framework commonly used in other studies of hadronic PNC, a meson exchange potential that includes long-range pion exchange and enough degrees of freedom to describe the five independent S-P amplitudes induced by short-range interactions. The resulting contributions of pi-, rho-, and omega-exchange to the single-nucleon anapole moment, to parity admixtures in the nuclear ground state, and to PNC exchange currents are evaluated, using configuration-mixed shell-model wave functions. The experimental anapole moment constraints on the PNC meson-nucleon coupling constants are derived and compared with those from other tests of the hadronic weak interaction. While the bounds obtained from the anapole moment results are consistent with the broad ''reasonable ranges'' defined by theory, they are not in good agreement with the constraints from the other experiments. We explore possible explanations for the discrepancy and comment on the potential importance of new experiments.
ERIC Educational Resources Information Center
Zichittella, Jack
1998-01-01
Discusses Henri Cartier-Bresson's notion of the "aesthetic of the decisive moment" and its role in photographic composition. Argues that recording spontaneous moments from real life can produce significant and complex photographs. Suggests that instilling this technique in photography students frees them to experiment without fear of failure. (DSK)
Valentine, Christine
2007-01-01
The "moment of death," once a dominant concept in preparing for a "good death", has been eclipsed by a focus on the wider concept of the "dying trajectory". However, findings from interviews with 25 bereaved individuals suggest that dying loved ones' final moments may still be experienced as highly significant in their own right. In some accounts the dying individual's final moments did not feature or made little impression, either because the survivor was not present, or there was no obviously definable moment, or because other, usually medical factors, such as whether to resuscitate the person, took precedence. However, in six cases such moments were constructed as profound, special, and memorable occasions. These constructions are explored in relation to achieving a good death, the dying trajectory as a whole, and making sense of the bereavement experience. Their implications for sociological theories of identity and embodiment are also considered. PMID:18214069
NASA Astrophysics Data System (ADS)
Civicioglu, Pinar
2012-09-01
In order to solve numerous practical navigational, geodetic and astro-geodetic problems, it is necessary to transform geocentric cartesian coordinates into geodetic coordinates or vice versa. It is very easy to solve the problem of transforming geodetic coordinates into geocentric cartesian coordinates. On the other hand, it is rather difficult to solve the problem of transforming geocentric cartesian coordinates into geodetic coordinates as it is very hard to define a mathematical relationship between the geodetic latitude (φ) and the geocentric cartesian coordinates (X, Y, Z). In this paper, a new algorithm, the Differential Search Algorithm (DS), is presented to solve the problem of transforming the geocentric cartesian coordinates into geodetic coordinates and its performance is compared with the performances of the classical methods (i.e., Borkowski, 1989; Bowring, 1976; Fukushima, 2006; Heikkinen, 1982; Jones, 2002; Zhang, 2005; Borkowski, 1987; Shu, 2010 and Lin, 1995) and Computational-Intelligence algorithms (i.e., ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES). The statistical tests realized for the comparison of performances indicate that the problem-solving success of DS algorithm in transforming the geocentric cartesian coordinates into geodetic coordinates is higher than those of all classical methods and Computational-Intelligence algorithms used in this paper.
Moment inference from tomograms
Day-Lewis, F. D.; Chen, Y.; Singha, K.
2007-01-01
Time-lapse geophysical tomography can provide valuable qualitative insights into hydrologic transport phenomena associated with aquifer dynamics, tracer experiments, and engineered remediation. Increasingly, tomograms are used to infer the spatial and/or temporal moments of solute plumes; these moments provide quantitative information about transport processes (e.g., advection, dispersion, and rate-limited mass transfer) and controlling parameters (e.g., permeability, dispersivity, and rate coefficients). The reliability of moments calculated from tomograms is, however, poorly understood because classic approaches to image appraisal (e.g., the model resolution matrix) are not directly applicable to moment inference. Here, we present a semi-analytical approach to construct a moment resolution matrix based on (1) the classic model resolution matrix and (2) image reconstruction from orthogonal moments. Numerical results for radar and electrical-resistivity imaging of solute plumes demonstrate that moment values calculated from tomograms depend strongly on plume location within the tomogram, survey geometry, regularization criteria, and measurement error. Copyright 2007 by the American Geophysical Union.
Chang, D. . Dept. of Physics and Astronomy Fermi National Accelerator Lab., Batavia, IL ); Senjanovic, G. . Dept. of Theoretical Physics)
1990-01-01
We review attempts to achieve a large neutrino magnetic moment ({mu}{sub {nu}} {le} 10{sup {minus}11}{mu}{sub B}), while keeping neutrino light or massless. The application to the solar neutrino puzzle is discussed. 24 refs.
Analysis of Crustal Magnetisation in Cartesian Vector Harmonics
NASA Astrophysics Data System (ADS)
Gubbins, D.; Ivers, D.; Williams, S.
2015-12-01
We present a new set of functions, Vector Cartesian Harmonics (VCH), analogous to the Vector Spherical Harmonics that we have applied recently to global models of crustal and lithospheric magnetisation. Like their spherical counterpart, the VCH form a complete, orthogonal set: planar models of magnetisation can be expanded in them. There are 3 distinct types of VCH, one representing that part of the magnetisation which generates the potential magnetic field above the surface, another the potential magnetic field below the surface, and a toroidal function that generates only a non-potential field. One function therefore describes the magnetisation detected by observations of the magnetic anomaly while the other two describe the null space of an inversion of magnetic observations for magnetisation. The formalism is therefore ideal for analysing the results of inversions for magnetic structures in plane layers such as local or regional surveys where Earth's curvature can be ignored. The null space is in general very large, being an arbitrary combination of a doubly-infinite set of vector functions. However, in the absence of remanence and when the inducing field is uniform the null space reduces to only 2 types of structure, uniform susceptibility (Runcorn's Theorem) and a pattern of susceptibility induced by a uniform field, the null space is restricted to uniform magnetisation and 1D patterns of susceptibility aligned with a horizontal inducing field. Both these cases are already well known, but this analysis shows them to be the ONLY members of the null space. We also give results for familiar text-book structures to show the nature of the null space in each case. Curiously, inversion of the magnetic field from a buried dipole returns exactly half the correct magnitude plus a spurious distributed magnetisation. A more complex application is the topographic structure based on the Bishop formation in California (Fairhead and Williams, SEG exp. abstr. 25, 845, 2006
NASA Technical Reports Server (NTRS)
Bock, G.
1946-01-01
When flying in a turn or pulling out of a dive, the airscrew exerts a gyroscopic moment on the aircraft, In the case of airscrews with three or more blades, arranged symmetrically, the value of the gyroscopic moment is J(sub x) omega(sub x) omega(sub y), where J(sub x) denotes the axial moment of inertia about the axis of rotation of the airscrew, omega(sub x) the angular upeed of the airscrew about its axis, and omega (sub Y) the rotary speed of the whole aircraft about an axis parallel to the plane of the airscrew (e.g., when pulling up, the transverse axis of the aircraft). The gyroscopic moment then tends to rotate the aircraft about an axis perpendicular to those of the two angular speeds and, in the came of airscrews with three or more blades, is constant during a revolution of the airscrew. With two-bladed airscrews, on the contrary, although the calculate gyroscopic moment represents the mean value in time, it fluctuates about this value with a frequency equal to twice the revolutions per minute. In addition, pulsating moments likewise occur about the other two axes. This fact is known from the theory of the asymmetrical gyro; the calculations that have been carried out for the determination of the various gyroscopic moments, however, mostly require an exact knowledge of the gyro theory. The problem will therefore be approached in another manner based on quite elementary considerations. The considerations are of importance, not only in connection with the gyroscopic moments exerted by the two-bladed airscrew on the aircraft, but also with the stressing of the blades of airscrews with an arbitrary number of blades.
Geometric Algebra for Physicists
NASA Astrophysics Data System (ADS)
Doran, Chris; Lasenby, Anthony
2007-11-01
Preface; Notation; 1. Introduction; 2. Geometric algebra in two and three dimensions; 3. Classical mechanics; 4. Foundations of geometric algebra; 5. Relativity and spacetime; 6. Geometric calculus; 7. Classical electrodynamics; 8. Quantum theory and spinors; 9. Multiparticle states and quantum entanglement; 10. Geometry; 11. Further topics in calculus and group theory; 12. Lagrangian and Hamiltonian techniques; 13. Symmetry and gauge theory; 14. Gravitation; Bibliography; Index.
Rabow, A. A.; Scheraga, H. A.
1996-01-01
We have devised a Cartesian combination operator and coding scheme for improving the performance of genetic algorithms applied to the protein folding problem. The genetic coding consists of the C alpha Cartesian coordinates of the protein chain. The recombination of the genes of the parents is accomplished by: (1) a rigid superposition of one parent chain on the other, to make the relation of Cartesian coordinates meaningful, then, (2) the chains of the children are formed through a linear combination of the coordinates of their parents. The children produced with this Cartesian combination operator scheme have similar topology and retain the long-range contacts of their parents. The new scheme is significantly more efficient than the standard genetic algorithm methods for locating low-energy conformations of proteins. The considerable superiority of genetic algorithms over Monte Carlo optimization methods is also demonstrated. We have also devised a new dynamic programming lattice fitting procedure for use with the Cartesian combination operator method. The procedure finds excellent fits of real-space chains to the lattice while satisfying bond-length, bond-angle, and overlap constraints. PMID:8880904
Freitas, Andreia C; Wylezinska, Marzena; Birch, Malcolm J; Petersen, Steffen E; Miquel, Marc E
2016-01-01
Dynamic imaging of the vocal tract using real-time MRI has been an active and growing area of research, having demonstrated great potential to become routinely performed in the clinical evaluation of speech and swallowing disorders. Although many technical advances have been made in regards to acquisition and reconstruction methodologies, there is still no consensus in best practice protocols. This study aims to compare Cartesian and non-Cartesian real-time MRI sequences, regarding image quality and temporal resolution trade-off, for dynamic speech imaging. Five subjects were imaged at 1.5T, while performing normal phonation, in order to assess velar motion and velopharyngeal closure. Data was acquired using both Cartesian and non-Cartesian (spiral and radial) real-time sequences at five different spatial-temporal resolution sets, between 10 fps (1.7×1.7×10 mm3) and 25 fps (1.5×1.5×10 mm3). Only standard scanning resources provided by the MRI scanner manufacturer were used to ensure easy applicability to clinical evaluation and reproducibility. Data sets were evaluated by comparing measurements of the velar structure, dynamic contrast-to-noise ratio and image quality visual scoring. Results showed that for all proposed sequences, FLASH spiral acquisitions provided higher contrast-to-noise ratio, up to a 170.34% increase at 20 fps, than equivalent bSSFP Cartesian acquisitions for the same spatial-temporal resolution. At higher frame rates (22 and 25 fps), spiral protocols were optimal and provided higher CNR and visual scoring than equivalent radial protocols. Comparison of dynamic imaging at 10 and 22 fps for radial and spiral acquisitions revealed no significant difference in CNR performance, thus indicating that temporal resolution can be doubled without compromising spatial resolution (1.9×1.9 mm2) or CNR. In summary, this study suggests that the use of FLASH spiral protocols should be preferred over bSSFP Cartesian for the dynamic imaging of velopharyngeal
Freitas, Andreia C.; Wylezinska, Marzena; Birch, Malcolm J.; Petersen, Steffen E.; Miquel, Marc E.
2016-01-01
Dynamic imaging of the vocal tract using real-time MRI has been an active and growing area of research, having demonstrated great potential to become routinely performed in the clinical evaluation of speech and swallowing disorders. Although many technical advances have been made in regards to acquisition and reconstruction methodologies, there is still no consensus in best practice protocols. This study aims to compare Cartesian and non-Cartesian real-time MRI sequences, regarding image quality and temporal resolution trade-off, for dynamic speech imaging. Five subjects were imaged at 1.5T, while performing normal phonation, in order to assess velar motion and velopharyngeal closure. Data was acquired using both Cartesian and non-Cartesian (spiral and radial) real-time sequences at five different spatial-temporal resolution sets, between 10 fps (1.7×1.7×10 mm3) and 25 fps (1.5×1.5×10 mm3). Only standard scanning resources provided by the MRI scanner manufacturer were used to ensure easy applicability to clinical evaluation and reproducibility. Data sets were evaluated by comparing measurements of the velar structure, dynamic contrast-to-noise ratio and image quality visual scoring. Results showed that for all proposed sequences, FLASH spiral acquisitions provided higher contrast-to-noise ratio, up to a 170.34% increase at 20 fps, than equivalent bSSFP Cartesian acquisitions for the same spatial-temporal resolution. At higher frame rates (22 and 25 fps), spiral protocols were optimal and provided higher CNR and visual scoring than equivalent radial protocols. Comparison of dynamic imaging at 10 and 22 fps for radial and spiral acquisitions revealed no significant difference in CNR performance, thus indicating that temporal resolution can be doubled without compromising spatial resolution (1.9×1.9 mm2) or CNR. In summary, this study suggests that the use of FLASH spiral protocols should be preferred over bSSFP Cartesian for the dynamic imaging of velopharyngeal
Centroid and moments of an area using a digitizer
NASA Technical Reports Server (NTRS)
Patch, R. W.
1976-01-01
The centroid and moments of an area program provides the centroid, moments of inertia, product of inertia, radii of gyration, and area of any closed planar geometric figure. The figure must be available in graphic form and is digitized once with chart digitizer (graphic tablet). The digitizer origin may be set anywhere on the digitizer table. After digitizing, fifteen quantities are calculated and displayed: (1) area (2) moment of inertia of area with respect to digitizer x-axis, (3) moment of inertia of area with respect to digitizer y-axis, (4) product of inertia of area with respect to digitizer axes, (5) first moment of x for digitizer axes, (6) first moment of y for digitizer axes, (7) x coordinate of centroid, (8) y coordinate of centroid, (9) moment of area inertia of with respect to x axis through centroid, (10) moment of inertia of area with respect to y axis through centroid, (11) product inertia of area with respect to x and y axes through centroid, (12) polar moment of inertia of area around centroid, (13) radius of gyration about digitizer x axis, (14) radius of gyration about digitizer y-axis; and (15) variance in the x-direction.
Exploring New Geometric Worlds
ERIC Educational Resources Information Center
Nirode, Wayne
2015-01-01
When students work with a non-Euclidean distance formula, geometric objects such as circles and segment bisectors can look very different from their Euclidean counterparts. Students and even teachers can experience the thrill of creative discovery when investigating these differences among geometric worlds. In this article, the author describes a…
The inertial and geometrical properties of helmets.
Njus, G O; Liu, Y K; Nye, T A
1984-10-01
The center of gravity (CG) and the principal mass moments of inertia about the CG of Army aviator, American football, and bicycle helmets were experimentally determined by a variation of the classic differential weighing and torsional pendulum techniques. In the course of these experiments, an innovative method for three-dimensional (3D) digitization was found. An electronic caliper, which measured length, was used with a computer algorithm to achieve 3D digitization. The results of the above measurements show that the weight of the helmet and the distances from the CG to the orthogonal coordinate axes intercepts with the outer shell surface were highly correlated with its principal mass moments of inertia. A set of regression equations was derived on theoretical considerations and served to unify the experimentally obtained data. Our results indicate that the principal mass moments of inertia of helmets vary linearly with its mass but nonlinearly with size and shape. For a helmet, given its weight and certain geometrical distances, the regression equations estimate the principal mass moments of inertia to within 5% of its experimentally-determined values. For the helmets studied in this series, a modified linear-regression relationship between the principal mass moments of inertia and its mass was found. This result is reasonable because the mass distribution of the current generation of helmets are set primarily by the head size and secondarily by helmet size, shape, and materials. PMID:6513769
Bayro-Corrochano, E J
2001-01-01
This paper shows the analysis and design of feedforward neural networks using the coordinate-free system of Clifford or geometric algebra. It is shown that real-, complex-, and quaternion-valued neural networks are simply particular cases of the geometric algebra multidimensional neural networks and that some of them can also be generated using support multivector machines (SMVMs). Particularly, the generation of radial basis function for neurocomputing in geometric algebra is easier using the SMVM, which allows one to find automatically the optimal parameters. The use of support vector machines in the geometric algebra framework expands its sphere of applicability for multidimensional learning. Interesting examples of nonlinear problems show the effect of the use of an adequate Clifford geometric algebra which alleviate the training of neural networks and that of SMVMs. PMID:18249926
NASA Astrophysics Data System (ADS)
Rousseau, Guy; Gay, David; Piché, Michel
2006-09-01
A recent analysis [G. Rousseau, D. Gay and M. Piché, One-dimensional description of cylindrically symmetric laser beams: application to Bessel-type nondiffracting beams, J. Opt. Soc. Am. A, 22 (2005) 1274] has shown that any cylindrically symmetric laser beam can be synthesized from a single wave called a constituent wave. This representation allows the introduction of one-dimensional Cartesian root-mean-square (rms) parameters to describe the conical structure of cylindrically symmetric laser beams. In this paper, we compare the rms characterization of Bessel-Gauss beams in polar coordinates with that of their respective constituent waves in Cartesian coordinates. Numerical results reveal an asymptotic correspondence between polar and Cartesian rms parameters of Bessel-Gauss beams propagating in a nondiffracting regime. Such a correspondence eliminates misleading interpretations about the propagation factor and the Rayleigh range of nondiffracting Bessel-type beams characterized in terms of polar rms parameters.
An accuracy assessment of Cartesian-mesh approaches for the Euler equations
NASA Technical Reports Server (NTRS)
Coirier, William J.; Powell, Kenneth G.
1995-01-01
A critical assessment of the accuracy of Cartesian-mesh approaches for steady, transonic solutions of the Euler equations of gas dynamics is made. An exact solution of the Euler equations (Ringleb's flow) is used not only to infer the order of the truncation error of the Cartesian-mesh approaches, but also to compare the magnitude of the discrete error directly to that obtained with a structured mesh approach. Uniformly and adaptively refined solutions using a Cartesian-mesh approach are obtained and compared to each other and to uniformly refined structured mesh results. The effect of cell merging is investigated as well as the use of two different K-exact reconstruction procedures. The solution methodology of the schemes is explained and tabulated results are presented to compare the solution accuracies.
Temporal Moments in Hydrogeophysics
NASA Astrophysics Data System (ADS)
Pollock, D.; Cirpka, O. A.
2007-12-01
Electrical Resistivity Tomography (ERT) has been tested as monitoring tool for salt-tracer experiments by various authors. So far, the analysis of such experiments has been done by a two-step procedure [Kemna et al., 2002; Vanderborght et al., 2005; Singha and Gorelick, 2005]. In the first step, classical geophysical inversion methods have been used to infer the distribution of electrical conductivity, which is transferred to an estimated concentration distribution of the tracer. Subsequently, the inferred concentration images were analyzed to estimate hydraulic quantities such as the velocity distribution. This approach has two disadvantages: The concentration distribution is reconstructed with a high spatial resolution, but the estimate is uncertain, and the estimation uncertainty is spatially correlated. These correlated uncertainties should be accounted for in the estimation of hydraulic conductivity from concentration values. The latter, unfortunately, is not practical because the reconstructed data sets are very large. The geophysical inversion is not enforced to be in agreement with basic hydromechanical constraints. E.g., Singha and Gorelick [2005] observed an apparent loss of solute mass when using ERT as monitoring tool. We propose considering the temporal moments of potential-difference time series. These temporal moments depend on temporal moments of concentration, which have already been used in the inference of hydraulic- conductivity distributions (Cirpka and Kitanidis, 2000). In our contribution, we present the complete set of equations leading from hydraulic conductivity via hydraulic heads, velocities, temporal moments of concentrations to temporal moments of potential differences for given flow and transport boundary conditions and electrode configurations. We also present how the sensitivity of temporal moments of potential differences on the hydraulic conductivity field can be computed without the need of storing intermediate sensitivities
Smith, C U
2001-08-01
J. C. Eccles (1903-1997) had a highly distinguished career in neurophysiology, being awarded the Nobel Prize for Medicine or Physiology in 1963. This paper sets him within the Cartesian tradition of British neurophysiology initiated by Thomas Henry Huxley in the mid-19th century. It shows how the mind-brain problematique of the Cartesian tradition troubled him throughout his career, leading him finally to a solution in terms of quantum microphysics and microphysiology. This position, which has subsequently become fashionable, is discussed and shown (at least in the form Eccles espoused) to provide no solution to the problem posed by Descartes in the early 17th century. PMID:11487286
Random subspaces for encryption based on a private shared Cartesian frame
Bartlett, Stephen D.; Hayden, Patrick; Spekkens, Robert W.
2005-11-15
A private shared Cartesian frame is a novel form of private shared correlation that allows for both private classical and quantum communication. Cryptography using a private shared Cartesian frame has the remarkable property that asymptotically, if perfect privacy is demanded, the private classical capacity is three times the private quantum capacity. We demonstrate that if the requirement for perfect privacy is relaxed, then it is possible to use the properties of random subspaces to nearly triple the private quantum capacity, almost closing the gap between the private classical and quantum capacities.
A Cartesian cut cell method for rarefied flow simulations around moving obstacles
NASA Astrophysics Data System (ADS)
Dechristé, G.; Mieussens, L.
2016-06-01
For accurate simulations of rarefied gas flows around moving obstacles, we propose a cut cell method on Cartesian grids: it allows exact conservation and accurate treatment of boundary conditions. Our approach is designed to treat Cartesian cells and various kinds of cut cells by the same algorithm, with no need to identify the specific shape of each cut cell. This makes the implementation quite simple, and allows a direct extension to 3D problems. Such simulations are also made possible by using an adaptive mesh refinement technique and a hybrid parallel implementation. This is illustrated by several test cases, including a 3D unsteady simulation of the Crookes radiometer.
NASA Astrophysics Data System (ADS)
Rhee, Young Min
2000-10-01
A modified method to construct an accurate potential energy surface by interpolation is presented. The modification is based on the use of Cartesian coordinates in the weighting function. The translational and rotational invariance of the potential is incorporated by a proper definition of the distance between two Cartesian configurations. A numerical algorithm to find the distance is developed. It is shown that the present method is more exact in describing a planar system compared to the previous methods with weightings in internal coordinates. The applicability of the method to reactive systems is also demonstrated by performing classical trajectory simulations on the surface.
Parameter Studies, time-dependent simulations and design with automated Cartesian methods
NASA Technical Reports Server (NTRS)
Aftosmis, Michael
2005-01-01
Over the past decade, NASA has made a substantial investment in developing adaptive Cartesian grid methods for aerodynamic simulation. Cartesian-based methods played a key role in both the Space Shuttle Accident Investigation and in NASA's return to flight activities. The talk will provide an overview of recent technological developments focusing on the generation of large-scale aerodynamic databases, automated CAD-based design, and time-dependent simulations with of bodies in relative motion. Automation, scalability and robustness underly all of these applications and research in each of these topics will be presented.
ERIC Educational Resources Information Center
Terr, Lenore C.; McDermott, John F.; Benson, Ronald M.; Blos, Peter, Jr.; Deeney, John M.; Rogers, Rita R.; Zrull, Joel P.
2005-01-01
In the summer of 2004, a number of psychotherapists with old ties to the University of Michigan or UCLA decided to write 500-word vignettes that attempted to capture a turning point in one of their child patient's psychotherapies. What did the child and adolescent psychiatrist do to elicit such a moment? Upon receiving seven vignettes, one of us…
ERIC Educational Resources Information Center
Child & Youth Services, 2004
2004-01-01
This chapter presents additional stories and interpretations by John Korsmo, Molly Weingrod, Joseph Stanley, Quinn Wilder, Amy Evans, Rick Flowers, Arcelia Martinez, and Pam Ramsey. The stories and interpretations are presented as teachable moments that are examples of how people are learning to understand youthwork and, as such, are open to…
ERIC Educational Resources Information Center
Higgins, Chris
2014-01-01
In "The Humanist Moment," Chris Higgins sets out to recover a tenable, living humanism, rejecting both the version vilified by the anti-humanists and the one sentimentalized by the reactionary nostalgists. Rescuing humanism from such polemics is only the first step, as we find at least nine rival, contemporary definitions of humanism.…
ERIC Educational Resources Information Center
Goodrow, Mary Ellen
2000-01-01
Details how an unplanned activity involving spinning wool presented a teachable moment for children in a family child care setting. Notes how activities related to farming, spinning wool, and using wool cloth resulted from following the children's lead. Concludes that everyday activities provide opportunities to listen to children, learn about…
NASA Technical Reports Server (NTRS)
Coirier, William John
1994-01-01
A Cartesian, cell-based scheme for solving the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal 'cut' cells are created. The geometry of the cut cells is computed using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a
Geometric intrinsic symmetries
Gozdz, A. Szulerecka, A.; Pedrak, A.
2013-08-15
The problem of geometric symmetries in the intrinsic frame of a many-body system (nucleus) is considered. An importance of symmetrization group notion is discussed. Ageneral structure of the intrinsic symmetry group structure is determined.
A moment-based ridge detection approach for agricultural robot using stereovision
NASA Astrophysics Data System (ADS)
Zhang, Fangming; Ying, Yibin
2004-10-01
It is necessary to perceive and avoid collision with obstacles, such as ridges, for an agricultural robot. In this paper we regarded weeds as the prominent feature of the ridge and used stereovision to infer their depth. The mixed moments and mixed central moments were used to characterize the weeds in two disparity images, and the Bayes" rule was applied to segment the weeds from background. The weeds were matched based on their approximate contours. Then the disparity was the difference between the two centers of the contours, which were extracted using the method of Cartesian moments. Since the contour of weed was random, it showed that stereovision could be applied for agricultural robot to detect complex obstacles.
NASA Technical Reports Server (NTRS)
Curtiss, L. A.; Langhoff, S. R.; Carney, G. D.
1979-01-01
The constant and linear terms in a Taylor series expansion of the dipole moment function of the ground state of ozone are calculated with Cartesian Gaussian basis sets ranging in quality from minimal to double zeta plus polarization. Results are presented at both the self-consistent field and configuration-interaction levels. Although the algebraic signs of the linear dipole moment derivatives are all established to be positive, the absolute magnitudes of these quantities, as well as the infrared intensities calculated from them, vary considerably with the level of theory.
D Catenary Curve Fitting for Geometric Calibration
NASA Astrophysics Data System (ADS)
Chan, T.-O.; Lichti, D. D.
2011-09-01
In modern road surveys, hanging power cables are among the most commonly-found geometric features. These cables are catenary curves that are conventionally modelled with three parameters in 2D Cartesian space. With the advent and popularity of the mobile mapping system (MMS), the 3D point clouds of hanging power cables can be captured within a short period of time. These point clouds, similarly to those of planar features, can be used for feature-based self-calibration of the system assembly errors of an MMS. However, to achieve this, a well-defined 3D equation for the catenary curve is needed. This paper proposes three 3D catenary curve models, each having different parameters. The models are examined by least squares fitting of simulated data and real data captured with an MMS. The outcome of the fitting is investigated in terms of the residuals and correlation matrices. Among the proposed models, one of them could estimate the parameters accurately and without any extreme correlation between the variables. This model can also be applied to those transmission lines captured by airborne laser scanning or any other hanging cable-like objects.
Topological Invariants and CW Complexes of Cartesian Product and Hexagonal Tiling Paces
NASA Astrophysics Data System (ADS)
Escudero, Juan García
2011-09-01
The cohomology of a class of cartesian product tiling spaces in N dimensions when the inflation factor is a Pisot-Vijayaraghavan unit is analyzed. A CW complex for an hexagonal tiling space is defined in terms of collared tiles for the study of its topological invariants.
Onset of buoyancy-driven convection in Cartesian and cylindrical geometries
NASA Astrophysics Data System (ADS)
Myint, Philip C.; Firoozabadi, Abbas
2013-04-01
We perform a linear stability analysis to examine the onset of buoyancy-driven convection relevant to subsurface carbon dioxide sequestration in confined, porous Cartesian and cylindrical domains. Our work amends the analysis in an earlier study on cylindrical geometries. We consider Cartesian geometries where the aspect ratio between the two horizontal dimensions is not necessarily equal to one. Two key elements of the stability analysis are: (1) the critical time and (2) the critical wavenumber. Lateral boundaries have a much greater influence on the critical wavenumber than on the critical time. The confinement due to these boundaries impedes the onset of convection to the extent that convection cannot even occur in domains that are smaller than a certain size. Large aspect ratios can significantly reduce boundary effects. Patterns of the earliest-growing perturbation mode in the horizontal plane reveal many interesting dynamics which have not been examined in previous stability analyses. We illustrate several differences between patterns in Cartesian geometries and patterns in cylindrical geometries. Based on observations from earlier papers, we hypothesize that the contrasts between the Cartesian and cylindrical patterns may lead to significantly different behavior in the two geometries after the onset of convection. Our results may guide future numerical studies that can investigate this hypothesis and may help with understanding the onset of buoyancy-driven convection in real systems where lateral boundary effects are significant.
ERIC Educational Resources Information Center
Earnest, Darrell Steven
2012-01-01
This dissertation explores fifth and eighth grade students' interpretations of three kinds of mathematical representations: number lines, the Cartesian plane, and graphs of linear functions. Two studies were conducted. In Study 1, I administered the paper-and-pencil Linear Representations Assessment (LRA) to examine students'…
Real-time cartesian force feedback control of a teleoperated robot
NASA Technical Reports Server (NTRS)
Campbell, Perry
1989-01-01
Active cartesian force control of a teleoperated robot is investigated. An economical microcomputer based control method was tested. Limitations are discussed and methods of performance improvement suggested. To demonstrate the performance of this technique, a preliminary test was performed with success. A general purpose bilateral force reflecting hand controller is currently being constructed based on this control method.
"Mens Sana in Corpore Sano": Cartesian Dualism and the Marginalisation of Sex Education
ERIC Educational Resources Information Center
Paechter, Carrie
2004-01-01
Cartesian dualism has left a heavy legacy in terms of how we think about ourselves, so that we treat humans as minds within bodies rather than mind/body unities. This has far-reaching effects on our conceptualisation of the sex/gender distinction and on the relationship between bodies and identities. Related to this is a dualism that is embedded…
Descriptive Geometry and Geometric Modeling.
ERIC Educational Resources Information Center
Adams, J. Alan
1988-01-01
Describes experiences for engineering students to develop spatial awareness and reasoning capability. Describes geometric modeling, basic geometric concepts, operations, surface modeling, and conclusions. (YP)
Inflation from geometrical tachyons
Thomas, Steven; Ward, John
2005-10-15
We propose an alternative formulation of tachyon inflation using the geometrical tachyon arising from the time dependent motion of a BPS D3-brane in the background geometry due to k parallel NS5-branes arranged around a ring of radius R. Because of the fact that the mass of this geometrical tachyon field is {radical}(2/k) times smaller than the corresponding open-string tachyon mass, we find that the slow-roll conditions for inflation and the number of e-foldings can be satisfied in a manner that is consistent with an effective 4-dimensional model and with a perturbative string coupling. We also show that the metric perturbations produced at the end of inflation can be sufficiently small and do not lead to the inconsistencies that plague the open-string tachyon models. Finally we argue for the existence of a minimum of the geometrical tachyon potential which could give rise to a traditional reheating mechanism.
NASA Astrophysics Data System (ADS)
Kempf, Andreas; Kilian, Patrick; Ganse, Urs; Schreiner, Cedric; Spanier, Felix
2015-03-01
A three-dimensional, parallelized implementation of the electromagnetic relativistic moment implicit particle-in-cell method in Cartesian geometry (Noguchi et al., 2007) is presented. Particular care was taken to keep the C++11 codebase simple, concise, and approachable. GMRES is used as a field solver and during the Newton-Krylov iteration of the particle pusher. Drifting Maxwellian problem setups are available while more complex simulations can be implemented easily. Several test runs are described and the code's numerical and computational performance is examined. Weak scaling on the SuperMUC system is discussed and found suitable for large-scale production runs.
A fast-marching like algorithm for geometrical shock dynamics
NASA Astrophysics Data System (ADS)
Noumir, Y.; Le Guilcher, A.; Lardjane, N.; Monneau, R.; Sarrazin, A.
2015-03-01
We develop a new algorithm for the computation of the Geometrical Shock Dynamics (GSD) model. The method relies on the fast-marching paradigm and enables the discrete evaluation of the first arrival time of a shock wave and its local velocity on a Cartesian grid. The proposed algorithm is based on a first order upwind finite difference scheme and reduces to a local nonlinear system of two equations solved by an iterative procedure. Reference solutions are built for a smooth radial configuration and for the 2D Riemann problem. The link between the GSD model and p-systems is given. Numerical experiments demonstrate the efficiency of the scheme and its ability to handle singularities.
NASA Technical Reports Server (NTRS)
Shahshahani, M.
1991-01-01
The performance characteristics are discussed of certain algebraic geometric codes. Algebraic geometric codes have good minimum distance properties. On many channels they outperform other comparable block codes; therefore, one would expect them eventually to replace some of the block codes used in communications systems. It is suggested that it is unlikely that they will become useful substitutes for the Reed-Solomon codes used by the Deep Space Network in the near future. However, they may be applicable to systems where the signal to noise ratio is sufficiently high so that block codes would be more suitable than convolutional or concatenated codes.
D Image Based Geometric Documentation of the Tower of Winds
NASA Astrophysics Data System (ADS)
Tryfona, M. S.; Georgopoulos, A.
2016-06-01
This paper describes and investigates the implementation of almost entirely image based contemporary techniques for the three dimensional geometric documentation of the Tower of the Winds in Athens, which is a unique and very special monument of the Roman era. These techniques and related algorithms were implemented using a well-known piece of commercial software with extreme caution in the selection of the various parameters. Problems related to data acquisition and processing, but also to the algorithms and to the software implementation are identified and discussed. The resulting point cloud has been georeferenced, i.e. referenced to a local Cartesian coordinate system through minimum geodetic measurements, and subsequently the surface, i.e. the mesh was created and finally the three dimensional textured model was produced. In this way, the geometric documentation drawings, i.e. the horizontal section plans, the vertical section plans and the elevations, which include orthophotos of the monument, can be produced at will from that 3D model, for the complete geometric documentation. Finally, a 3D tour of the Tower of the Winds has also been created for a more integrated view of the monument. The results are presented and are evaluated for their completeness, efficiency, accuracy and ease of production.
NASA Astrophysics Data System (ADS)
Muralidharan, Balaji; Menon, Suresh
2016-09-01
A new adaptive finite volume conservative cut-cell method that is third-order accurate for simulation of compressible viscous flows is presented. A high-order reconstruction approach using cell centered piecewise polynomial approximation of flow quantities, developed in the past for body-fitted grids, is now extended to the Cartesian based cut-cell method. It is shown that the presence of cut-cells of very low volume results in numerical oscillations in the flow solution near the embedded boundaries when standard small cell treatment techniques are employed. A novel cell clustering approach for polynomial reconstruction in the vicinity of the small cells is proposed and is shown to achieve smooth representation of flow field quantities and their derivatives on immersed interfaces. It is further shown through numerical examples that the proposed clustering method achieves the design order of accuracy and is fairly insensitive to the cluster size. Results are presented for canonical flow past a single cylinder and a sphere at different flow Reynolds numbers to verify the accuracy of the scheme. Investigations are then performed for flow over two staggered cylinders and the results are compared with prior data for the same configuration. All the simulations are carried out with both quadratic and cubic reconstruction, and the results indicate a clear improvement with the cubic reconstruction. The new cut-cell approach with cell clustering is able to predict accurate results even at relatively low resolutions. The ability of the high-order cut-cell method in handling sharp geometrical corners and narrow gaps is also demonstrated using various examples. Finally, three-dimensional flow interactions between a pair of spheres in cross flow is investigated using the proposed cut-cell scheme. The results are shown to be in excellent agreement with past studies, which employed body-fitted grids for studying this complex case.
NASA Technical Reports Server (NTRS)
Ives, David
1995-01-01
This paper presents a highly automated hexahedral grid generator based on extensive geometrical and solid modeling operations developed in response to a vision of a designer-driven one day turnaround CFD process which implies a designer-driven one hour grid generation process.
ERIC Educational Resources Information Center
Burgess, Claudia R.
2014-01-01
Designed for a broad audience, including educators, camp directors, afterschool coordinators, and preservice teachers, this investigation aims to help individuals experience mathematics in unconventional and exciting ways by engaging them in the physical activity of building geometric shapes using ropes. Through this engagement, the author…
ERIC Educational Resources Information Center
Smart, Julie; Marshall, Jeff
2007-01-01
Children possess a genuine curiosity for exploring the natural world around them. One third grade teacher capitalized on this inherent trait by leading her students on "A Geometric Scavenger Hunt." The four-lesson inquiry investigation described in this article integrates mathematics and science. Among the students' discoveries was the fact that…
Levels of Geometric Understanding.
ERIC Educational Resources Information Center
Pegg, John; Davey, Geoff
1991-01-01
Three activities are presented to assess the level of students' geometric understanding according to van Hiele learning model. The activities--Descriptions, Minimum Properties, and Class Inclusion--are applied to the example of classifying quadrilaterals as squares, rectangles, rhombi, or parallelograms. Implications of this assessment are…
Pragmatic geometric model evaluation
NASA Astrophysics Data System (ADS)
Pamer, Robert
2015-04-01
Quantification of subsurface model reliability is mathematically and technically demanding as there are many different sources of uncertainty and some of the factors can be assessed merely in a subjective way. For many practical applications in industry or risk assessment (e. g. geothermal drilling) a quantitative estimation of possible geometric variations in depth unit is preferred over relative numbers because of cost calculations for different scenarios. The talk gives an overview of several factors that affect the geometry of structural subsurface models that are based upon typical geological survey organization (GSO) data like geological maps, borehole data and conceptually driven construction of subsurface elements (e. g. fault network). Within the context of the trans-European project "GeoMol" uncertainty analysis has to be very pragmatic also because of different data rights, data policies and modelling software between the project partners. In a case study a two-step evaluation methodology for geometric subsurface model uncertainty is being developed. In a first step several models of the same volume of interest have been calculated by omitting successively more and more input data types (seismic constraints, fault network, outcrop data). The positions of the various horizon surfaces are then compared. The procedure is equivalent to comparing data of various levels of detail and therefore structural complexity. This gives a measure of the structural significance of each data set in space and as a consequence areas of geometric complexity are identified. These areas are usually very data sensitive hence geometric variability in between individual data points in these areas is higher than in areas of low structural complexity. Instead of calculating a multitude of different models by varying some input data or parameters as it is done by Monte-Carlo-simulations, the aim of the second step of the evaluation procedure (which is part of the ongoing work) is to
On the new analytical solution for a well in Cartesian coordinates with MODFLOW comparisons.
Batu, Vedat
2014-01-01
In this paper, the comparison process of Batu (2012) generalized three-dimensional well hydraulics solution for confined aquifers in Cartesian coordinates with MODFLOW is presented. First, a brief description of Batu (2012) solution along with the governing equations and some of its key features are described. The final average drawdown expression in an observation well is given with the conversion expressions from Cartesian to radial coordinates. A generalized comparison using Batu (2012), Hantush (1964), and MODFLOW (Harbaugh et al. 2000), for vertical wells in horizontally isotropic aquifers, that is, ayx = Ky /Kx = 1, is presented. Comparisons are also presented with Batu (2012) and MODFLOW for horizontally anisotropic aquifers, that is, ayx ≠ 1. After that comparisons are presented for horizontal wells between Batu (2012) and MODFLOW. PMID:24236933
A Two-dimensional Cartesian and Axisymmetric Study of Combustion-acoustic Interaction
NASA Technical Reports Server (NTRS)
Hood, Caroline; Frendi, Abdelkader
2006-01-01
This paper describes a study of a lean premixed (LP) methane-air combustion wave in a two-dimensional Cartesian and axisymmetric coordinate system. Lean premixed combustors provide low emission and high efficiency; however, they are susceptible to combustion instabilities. The present study focuses on the behavior of the flame as it interacts with an external acoustic disturbance. It was found that the flame oscillations increase as the disturbance amplitude is increased. Furthermore, when the frequency of the disturbance is at resonance with a chamber frequency, the instabilities increase. For the axisymmetric geometry, the flame is found to be more unstable compared to the Cartesian case. In some cases, these instabilities were severe and led to flame extinction. In the axisymmetric case, several passive control devices were tested to assess their effectiveness. It is found that an acoustic cavity is better able at controlling the pressure fluctuations in the chamber.
Cartesian Off-Body Grid Adaption for Viscous Time- Accurate Flow Simulation
NASA Technical Reports Server (NTRS)
Buning, Pieter G.; Pulliam, Thomas H.
2011-01-01
An improved solution adaption capability has been implemented in the OVERFLOW overset grid CFD code. Building on the Cartesian off-body approach inherent in OVERFLOW and the original adaptive refinement method developed by Meakin, the new scheme provides for automated creation of multiple levels of finer Cartesian grids. Refinement can be based on the undivided second-difference of the flow solution variables, or on a specific flow quantity such as vorticity. Coupled with load-balancing and an inmemory solution interpolation procedure, the adaption process provides very good performance for time-accurate simulations on parallel compute platforms. A method of using refined, thin body-fitted grids combined with adaption in the off-body grids is presented, which maximizes the part of the domain subject to adaption. Two- and three-dimensional examples are used to illustrate the effectiveness and performance of the adaption scheme.
A Cartesian Adaptive Level Set Method for Two-Phase Flows
NASA Technical Reports Server (NTRS)
Ham, F.; Young, Y.-N.
2003-01-01
In the present contribution we develop a level set method based on local anisotropic Cartesian adaptation as described in Ham et al. (2002). Such an approach should allow for the smallest possible Cartesian grid capable of resolving a given flow. The remainder of the paper is organized as follows. In section 2 the level set formulation for free surface calculations is presented and its strengths and weaknesses relative to the other free surface methods reviewed. In section 3 the collocated numerical method is described. In section 4 the method is validated by solving the 2D and 3D drop oscilation problem. In section 5 we present some results from more complex cases including the 3D drop breakup in an impulsively accelerated free stream, and the 3D immiscible Rayleigh-Taylor instability. Conclusions are given in section 6.
Direct simulation of multi-phase MHD flows on an unstructured Cartesian adaptive system
NASA Astrophysics Data System (ADS)
Zhang, Jie; Ni, Ming-Jiu
2014-08-01
An approach for direct simulation of the multi-phase magnetohydrodynamics (MHD) flows has been developed in the present study on an unstructured Cartesian adaptive system. The approach is based on the volume-of-fluid (VOF) method for capturing the interface with the adaptive mesh refinement (AMR) technique used to well resolve the interface and the boundary layer. The Lorentz force is calculated using the consistent and conservative scheme, which is specially designed on a Cartesian adaptive mesh to conserve the physical conservation laws. The continuous-surface-tension (CSF) formulation is adopted for surface tension calculation. Moreover, the interfacial flows driven by thermal Marangoni effects at multifluid interfaces are also studied with a special numerical treatment presented. The method is able to simulate bubble motion in liquid metal under magnetic field irrespective of high density ratio and electric conductivity ratio. The proposed scheme for multi-phase MHD flows is validated by experimental results as well as analytical solutions.
OTAHAL,THOMAS J.; GALLIS,MICHAIL A.; BARTEL,TIMOTHY J.
2000-06-27
This paper presents an investigation of a technique for using two-dimensional bodies composed of simple polygons with a body decoupled uniform Cmtesian grid in the Direct Simulation Monte Carlo method (DSMC). The method employs an automated grid pre-processing scheme beginning form a CAD geometry definition file, and is based on polygon triangulation using a trapezoid algorithm. A particle-body intersection time comparison is presented between the Icarus DSMC code using a body-fitted structured grid and using a structured body-decoupled Cartesian grid with both linear and logarithmic search techniques. A comparison of neutral flow over a cylinder is presented using the structured body fitted grid and the Cartesian body de-coupled grid.
On the Use of Parmetric-CAD Systems and Cartesian Methods for Aerodynamic Design
NASA Technical Reports Server (NTRS)
Nemec, Marian; Aftosmis, Michael J.; Pulliam, Thomas H.
2004-01-01
Automated, high-fidelity tools for aerodynamic design face critical issues in attempting to optimize real-life geometry arid in permitting radical design changes. Success in these areas promises not only significantly shorter design- cycle times, but also superior and unconventional designs. To address these issues, we investigate the use of a parmetric-CAD system in conjunction with an embedded-boundary Cartesian method. Our goal is to combine the modeling capabilities of feature-based CAD with the robustness and flexibility of component-based Cartesian volume-mesh generation for complex geometry problems. We present the development of an automated optimization frame-work with a focus on the deployment of such a CAD-based design approach in a heterogeneous parallel computing environment.
Aerodynamic Design of Complex Configurations Using Cartesian Methods and CAD Geometry
NASA Technical Reports Server (NTRS)
Nemec, Marian; Aftosmis, Michael J.; Pulliam, Thomas H.
2003-01-01
The objective for this paper is to present the development of an optimization capability for the Cartesian inviscid-flow analysis package of Aftosmis et al. We evaluate and characterize the following modules within the new optimization framework: (1) A component-based geometry parameterization approach using a CAD solid representation and the CAPRI interface. (2) The use of Cartesian methods in the development Optimization techniques using a genetic algorithm. The discussion and investigations focus on several real world problems of the optimization process. We examine the architectural issues associated with the deployment of a CAD-based design approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute nodes. In addition, we study the influence of noise on the performance of optimization techniques, and the overall efficiency of the optimization process for aerodynamic design of complex three-dimensional configurations. of automated optimization tools. rithm and a gradient-based algorithm.
CUDA accelerated uniform re-sampling for non-Cartesian MR reconstruction.
Feng, Chaolu; Zhao, Dazhe
2015-01-01
A grid-driven gridding (GDG) method is proposed to uniformly re-sample non-Cartesian raw data acquired in PROPELLER, in which a trajectory window for each Cartesian grid is first computed. The intensity of the reconstructed image at this grid is the weighted average of raw data in this window. Taking consider of the single instruction multiple data (SIMD) property of the proposed GDG, a CUDA accelerated method is then proposed to improve the performance of the proposed GDG. Two groups of raw data sampled by PROPELLER in two resolutions are reconstructed by the proposed method. To balance computation resources of the GPU and obtain the best performance improvement, four thread-block strategies are adopted. Experimental results demonstrate that although the proposed GDG is more time consuming than traditional DDG, the CUDA accelerated GDG is almost 10 times faster than traditional DDG. PMID:26406102
Mean square optimal NUFFT approximation for efficient non-Cartesian MRI reconstruction
Yang, Zhili; Jacob, Mathews
2014-01-01
The fast evaluation of the discrete Fourier transform of an image at non-uniform sampling locations is key to efficient iterative non-Cartesian MRI reconstruction algorithms. Current non-uniform fast Fourier transform (NUFFT) approximations rely on the interpolation of oversampled uniform Fourier samples. The main challenge is high memory demand due to oversampling, especially when multi-dimensional datasets are involved. The main focus of this work is to design an NUFFT algorithm with minimal memory demands. Specifically, we introduce an analytical expression for the expected mean square error in the NUFFT approximation based on our earlier work. We then introduce an iterative algorithm to design the interpolator and scale factors.Experimental comparisons show that the proposed optimized NUFFT scheme provides considerably lower approximation errors than our previous scheme that rely on worst case error metrics. The improved approximations are also seen to considerably reduce the errors and artifacts in non-Cartesian MRI reconstruction. PMID:24637054
Geometry optimization for peptides and proteins: comparison of Cartesian and internal coordinates.
Koslover, Elena F; Wales, David J
2007-12-21
We present the results of several benchmarks comparing the relative efficiency of different coordinate systems in optimizing polypeptide geometries. Cartesian, natural internal, and primitive internal coordinates are employed in quasi-Newton minimization for a variety of biomolecules. The peptides and proteins used in these benchmarks range in size from 16 to 999 residues. They vary in complexity from polyalanine helices to a beta-barrel enzyme. We find that the relative performance of the different coordinate systems depends on the parameters of the optimization method, the starting point for the optimization, and the size of the system studied. In general, internal coordinates were found to be advantageous for small peptides. For larger structures, Cartesians appear to be more efficient for empirical potentials where the energy and gradient can be evaluated relatively quickly compared to the cost of the coordinate transformations. PMID:18154373
Geometry optimization for peptides and proteins: Comparison of Cartesian and internal coordinates
NASA Astrophysics Data System (ADS)
Koslover, Elena F.; Wales, David J.
2007-12-01
We present the results of several benchmarks comparing the relative efficiency of different coordinate systems in optimizing polypeptide geometries. Cartesian, natural internal, and primitive internal coordinates are employed in quasi-Newton minimization for a variety of biomolecules. The peptides and proteins used in these benchmarks range in size from 16 to 999 residues. They vary in complexity from polyalanine helices to a β-barrel enzyme. We find that the relative performance of the different coordinate systems depends on the parameters of the optimization method, the starting point for the optimization, and the size of the system studied. In general, internal coordinates were found to be advantageous for small peptides. For larger structures, Cartesians appear to be more efficient for empirical potentials where the energy and gradient can be evaluated relatively quickly compared to the cost of the coordinate transformations.
Cartesian grid simulations of gas-solids flow systems with complex geometry
Dietiker, Jean-Francois; Li, Tingwen; Garg, Rahul; Shahnam, Mehrdad
2013-02-01
Complex geometries encountered in many applications of gas–solids flow need special treatment in most legacy multiphase flow solvers with Cartesian numerical grid. This paper briefly outlines the implementation of a cut cell technique in the open-source multiphase flow solver—MFIX for accurate representation of complex geometries. Specifically, applications of the Cartesian cut cell method to different gas–solids fluidization systems including a small scale bubbling fluidized bed with submerged tube bundle and a complete pilot-scale circulating fluidized bed will be presented. In addition to qualitative predictions on the general flow behaviors inside each system, quantitative comparison with the available experimental data will be presented. Furthermore, some results on extending the current cut-cell technique to Lagrangian–Eulerian simulations will be presented.
Equivalence of the Path Integral for Fermions in Cartesian and Spherical Coordinates
NASA Astrophysics Data System (ADS)
Briggs, Andrew; Camblong, Horacio E.; Ordóñez, Carlos R.
2013-06-01
The path integral calculation for the free energy of a spin-1/2 Dirac-fermion gas is performed in spherical polar coordinates for a flat space-time geometry. Its equivalence with the Cartesian-coordinate representation is explicitly established. This evaluation involves a relevant limiting case of the fermionic path integral in a Schwarzschild background, whose near-horizon limit has been shown to be related to black hole thermodynamics.
Development and application of a 3D Cartesian grid Euler method
NASA Technical Reports Server (NTRS)
Melton, John E.; Aftosmis, Michael J.; Berger, Marsha J.; Wong, Michael D.
1995-01-01
This report describes recent progress in the development and application of 3D Cartesian grid generation and Euler flow solution techniques. Improvements to flow field grid generation algorithms, geometry representations, and geometry refinement criteria are presented, including details of a procedure for correctly identifying and resolving extremely thin surface features. An initial implementation of automatic flow field refinement is also presented. Results for several 3D multi-component configurations are provided and discussed.
A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
NASA Astrophysics Data System (ADS)
Schmitz, Phillip G.; Ying, Lexing
2014-02-01
We present a fast algorithm for solutions to linear systems arising from three dimensional elliptic problems on a regular Cartesian mesh. We follow the approach of Schmitz and Ying (2012) on combining the nested dissection matrix factorization method with hierarchical matrices in two dimensions and extend it to the three dimensional case. A theoretical linear time complexity is derived and a more practical variant with slightly worse scaling is demonstrated.
Density- and wavefunction-normalized Cartesian spherical harmonics for l ≤ 20
Michael, J. Robert; Volkov, Anatoliy
2015-03-01
The widely used pseudoatom formalism in experimental X-ray charge-density studies makes use of real spherical harmonics when describing the angular component of aspherical deformations of the atomic electron density in molecules and crystals. The analytical form of the density-normalized Cartesian spherical harmonic functions for up to l ≤ 7 and the corresponding normalization coefficients were reported previously by Paturle & Coppens. It was shown that the analytical form for normalization coefficients is available primarily for
Density- and wavefunction-normalized Cartesian spherical harmonics for l ≤ 20
Michael, J. Robert; Volkov, Anatoliy
2015-03-01
The widely used pseudoatom formalism in experimental X-ray charge-density studies makes use of real spherical harmonics when describing the angular component of aspherical deformations of the atomic electron density in molecules and crystals. The analytical form of the density-normalized Cartesian spherical harmonic functions for up to l ≤ 7 and the corresponding normalization coefficients were reported previously by Paturle & Coppens. It was shown that the analytical form for normalization coefficients is available primarily forl ≤ 4. Only in very special cases it is possible to derive an analytical representation of the normalization coefficients for 4 < l ≤ 7.more » In most cases for l > 4 the density normalization coefficients were calculated numerically to within seven significant figures. In this study we review the literature on the density-normalized spherical harmonics, clarify the existing notations, use the Paturle–Coppens method in the Wolfram Mathematicasoftware to derive the Cartesian spherical harmonics for l ≤ 20 and determine the density normalization coefficients to 35 significant figures, and computer-generate a Fortran90 code. The article primarily targets researchers who work in the field of experimental X-ray electron density, but may be of some use to all who are interested in Cartesian spherical harmonics.« less
A Hybrid Advection Scheme for Conserving Angular Momentum on a Refined Cartesian Mesh
NASA Astrophysics Data System (ADS)
Byerly, Zachary D.; Adelstein-Lelbach, Bryce; Tohline, Joel E.; Marcello, Dominic C.
2014-06-01
We test a new "hybrid" scheme for simulating dynamical fluid flows in which cylindrical components of the momentum are advected across a rotating Cartesian coordinate mesh. This hybrid scheme allows us to conserve angular momentum to machine precision while capitalizing on the advantages offered by a Cartesian mesh, such as a straightforward implementation of mesh refinement. Our test focuses on measuring the real and imaginary parts of the eigenfrequency of unstable nonaxisymmetric modes that naturally arise in massless polytropic tori having a range of different aspect ratios and on quantifying the uncertainty in these measurements. Our measured eigenfrequencies show good agreement with the results obtained from the linear stability analysis of Kojima and from nonlinear hydrodynamic simulations performed on a cylindrical coordinate mesh by Woodward et al. When compared against results conducted with a traditional Cartesian advection scheme, the hybrid scheme achieves qualitative convergence at the same or, in some cases, much lower grid resolutions and conserves angular momentum to a much higher degree of precision. As a result, this hybrid scheme is much better suited for simulating astrophysical fluid flows such as accretion disks and mass-transferring binary systems.
On moments of the integrated exponential Brownian motion
NASA Astrophysics Data System (ADS)
Caravelli, Francesco; Mansour, Toufik; Sindoni, Lorenzo; Severini, Simone
2016-07-01
We present new exact expressions for a class of moments of the geometric Brownian motion in terms of determinants, obtained using a recurrence relation and combinatorial arguments for the case of a Itô's Wiener process. We then apply the obtained exact formulas to computing averages of the solution of the logistic stochastic differential equation via a series expansion, and compare the results to the solution obtained via Monte Carlo.
Weller, Daniel S.; Ramani, Sathish; Fessler, Jeffrey A.
2013-01-01
SPIRiT (iterative self-consistent parallel imaging reconstruction), and its sparsity-regularized variant L1-SPIRiT, are compatible with both Cartesian and non-Cartesian MRI sampling trajectories. However, the non-Cartesian framework is more expensive computationally, involving a nonuniform Fourier transform with a nontrivial Gram matrix. We propose a novel implementation of the regularized reconstruction problem using variable splitting, alternating minimization of the augmented La-grangian, and careful preconditioning. Our new method based on the alternating direction method of multipliers converges much faster than existing methods because of the preconditioners' heightened effectiveness. We demonstrate such rapid convergence substantially improves image quality for a fixed computation time. Our framework is a step forward towards rapid non-Cartesian L1-SPIRiT reconstructions. PMID:24122551
Geometrical deuteron stripping revisited
Neoh, Y. S.; Yap, S. L.
2014-03-05
We investigate the reality of the idea of geometrical deuteron stripping originally envisioned by Serber. By taking into account of realistic deuteron wavefunction, nuclear density, and nucleon stopping mean free path, we are able to estimate inclusive deuteron stripping cross section for deuteron energy up to before pion production. Our semiclassical model contains only one global parameter constant for all nuclei which can be approximated by Woods-Saxon or any other spherically symmetric density distribution.
Geometric measures of entanglement
Uyanik, K.; Turgut, S.
2010-03-15
The geometric measure of entanglement, which expresses the minimum distance to product states, has been generalized to distances to sets that remain invariant under the stochastic reducibility relation. For each such set, an associated entanglement monotone can be defined. The explicit analytical forms of these measures are obtained for bipartite entangled states. Moreover, the three-qubit case is discussed and it is argued that the distance to the W states is a new monotone.
Improving Higgs plus jets analyses through Fox-Wolfram moments
NASA Astrophysics Data System (ADS)
Bernaciak, Catherine; Mellado, Bruce; Plehn, Tilman; Ruan, Xifeng; Schichtel, Peter
2014-03-01
It is well known that understanding the structure of jet radiation can significantly improve Higgs analyses. Using Fox-Wolfram moments we systematically study the geometric patterns of additional jets in weak boson fusion Higgs production with a decay to photons. First, we find a significant improvement with respect to the standard analysis based on an analysis of the tagging jet correlations. In addition, we show that replacing a jet veto by a Fox-Wolfram moment analysis of the extra jet radiation almost doubles the signal-to-background ratio. Finally, we show that this improvement can also be achieved based on a modified definition of the Fox-Wolfram moments which avoids introducing a new physical scale below the factorization scale. This modification can reduce the impact of theory uncertainties on the Higgs rate and couplings measurements.
Inquiry-Based Science: Turning Teachable Moments into Learnable Moments
ERIC Educational Resources Information Center
Haug, Berit S.
2014-01-01
This study examines how an inquiry-based approach to teaching and learning creates teachable moments that can foster conceptual understanding in students, and how teachers capitalize upon these moments. Six elementary school teachers were videotaped as they implemented an integrated inquiry-based science and literacy curriculum in their…
Geometric diffusion of quantum trajectories
Yang, Fan; Liu, Ren-Bao
2015-01-01
A quantum object can acquire a geometric phase (such as Berry phases and Aharonov–Bohm phases) when evolving along a path in a parameter space with non-trivial gauge structures. Inherent to quantum evolutions of wavepackets, quantum diffusion occurs along quantum trajectories. Here we show that quantum diffusion can also be geometric as characterized by the imaginary part of a geometric phase. The geometric quantum diffusion results from interference between different instantaneous eigenstate pathways which have different geometric phases during the adiabatic evolution. As a specific example, we study the quantum trajectories of optically excited electron-hole pairs in time-reversal symmetric insulators, driven by an elliptically polarized terahertz field. The imaginary geometric phase manifests itself as elliptical polarization in the terahertz sideband generation. The geometric quantum diffusion adds a new dimension to geometric phases and may have applications in many fields of physics, e.g., transport in topological insulators and novel electro-optical effects. PMID:26178745
Geometric diffusion of quantum trajectories.
Yang, Fan; Liu, Ren-Bao
2015-01-01
A quantum object can acquire a geometric phase (such as Berry phases and Aharonov-Bohm phases) when evolving along a path in a parameter space with non-trivial gauge structures. Inherent to quantum evolutions of wavepackets, quantum diffusion occurs along quantum trajectories. Here we show that quantum diffusion can also be geometric as characterized by the imaginary part of a geometric phase. The geometric quantum diffusion results from interference between different instantaneous eigenstate pathways which have different geometric phases during the adiabatic evolution. As a specific example, we study the quantum trajectories of optically excited electron-hole pairs in time-reversal symmetric insulators, driven by an elliptically polarized terahertz field. The imaginary geometric phase manifests itself as elliptical polarization in the terahertz sideband generation. The geometric quantum diffusion adds a new dimension to geometric phases and may have applications in many fields of physics, e.g., transport in topological insulators and novel electro-optical effects. PMID:26178745
Quantum computation using geometric algebra
NASA Astrophysics Data System (ADS)
Matzke, Douglas James
This dissertation reports that arbitrary Boolean logic equations and operators can be represented in geometric algebra as linear equations composed entirely of orthonormal vectors using only addition and multiplication Geometric algebra is a topologically based algebraic system that naturally incorporates the inner and anticommutative outer products into a real valued geometric product, yet does not rely on complex numbers or matrices. A series of custom tools was designed and built to simplify geometric algebra expressions into a standard sum of products form, and automate the anticommutative geometric product and operations. Using this infrastructure, quantum bits (qubits), quantum registers and EPR-bits (ebits) are expressed symmetrically as geometric algebra expressions. Many known quantum computing gates, measurement operators, and especially the Bell/magic operators are also expressed as geometric products. These results demonstrate that geometric algebra can naturally and faithfully represent the central concepts, objects, and operators necessary for quantum computing, and can facilitate the design and construction of quantum computing tools.
E. Cartan moment of rotation in classical and quantum gravity. Final report
Kheyfets, A.
1994-05-25
The geometric construction of the E. Cartan moment of rotation associated to the spacetime curvature provides a geometric interpretation of the gravitational field sources and describes geometrically how the sources are ``wired`` to the field in standard geometrodynamics. E. Cartan moment of rotation yields an alternate way (as opposed to using variational principles) to obtain Einstein equations. The E. Cartan construction uses in an essential way the soldering structure of the frame bundle underlying the geometry of the gravitational field of general relativity. The geometry of Ashtekar`s connection formulation of gravitation theory is based on a complex-valued self-dual connection that is defined not on the frame bundle of spacetime but, rather, on its complexification. We show how to transfer the construction of the E. Cartan moment of rotation to Ashtekar`s theory of gravity and demonstrate that no spurious equations are produced via this procedure.
An adaptive discretization of compressible flow using a multitude of moving Cartesian grids
NASA Astrophysics Data System (ADS)
Qiu, Linhai; Lu, Wenlong; Fedkiw, Ronald
2016-01-01
We present a novel method for simulating compressible flow on a multitude of Cartesian grids that can rotate and translate. Following previous work, we split the time integration into an explicit step for advection followed by an implicit solve for the pressure. A second order accurate flux based scheme is devised to handle advection on each moving Cartesian grid using an effective characteristic velocity that accounts for the grid motion. In order to avoid the stringent time step restriction imposed by very fine grids, we propose strategies that allow for a fluid velocity CFL number larger than 1. The stringent time step restriction related to the sound speed is alleviated by formulating an implicit linear system in order to find a pressure consistent with the equation of state. This implicit linear system crosses overlapping Cartesian grid boundaries by utilizing local Voronoi meshes to connect the various degrees of freedom obtaining a symmetric positive-definite system. Since a straightforward application of this technique contains an inherent central differencing which can result in spurious oscillations, we introduce a new high order diffusion term similar in spirit to ENO-LLF but solved for implicitly in order to avoid any associated time step restrictions. The method is conservative on each grid, as well as globally conservative on the background grid that contains all other grids. Moreover, a conservative interpolation operator is devised for conservatively remapping values in order to keep them consistent across different overlapping grids. Additionally, the method is extended to handle two-way solid fluid coupling in a monolithic fashion including cases (in the appendix) where solids in close proximity do not properly allow for grid based degrees of freedom in between them.
Density- and wavefunction-normalized Cartesian spherical harmonics for l ≤ 20.
Michael, J Robert; Volkov, Anatoliy
2015-03-01
The widely used pseudoatom formalism [Stewart (1976). Acta Cryst. A32, 565-574; Hansen & Coppens (1978). Acta Cryst. A34, 909-921] in experimental X-ray charge-density studies makes use of real spherical harmonics when describing the angular component of aspherical deformations of the atomic electron density in molecules and crystals. The analytical form of the density-normalized Cartesian spherical harmonic functions for up to l ≤ 7 and the corresponding normalization coefficients were reported previously by Paturle & Coppens [Acta Cryst. (1988), A44, 6-7]. It was shown that the analytical form for normalization coefficients is available primarily for l ≤ 4 [Hansen & Coppens, 1978; Paturle & Coppens, 1988; Coppens (1992). International Tables for Crystallography, Vol. B, Reciprocal space, 1st ed., edited by U. Shmueli, ch. 1.2. Dordrecht: Kluwer Academic Publishers; Coppens (1997). X-ray Charge Densities and Chemical Bonding. New York: Oxford University Press]. Only in very special cases it is possible to derive an analytical representation of the normalization coefficients for 4 < l ≤ 7 (Paturle & Coppens, 1988). In most cases for l > 4 the density normalization coefficients were calculated numerically to within seven significant figures. In this study we review the literature on the density-normalized spherical harmonics, clarify the existing notations, use the Paturle-Coppens (Paturle & Coppens, 1988) method in the Wolfram Mathematica software to derive the Cartesian spherical harmonics for l ≤ 20 and determine the density normalization coefficients to 35 significant figures, and computer-generate a Fortran90 code. The article primarily targets researchers who work in the field of experimental X-ray electron density, but may be of some use to all who are interested in Cartesian spherical harmonics. PMID:25727874
Mackie, Cameron J; Candian, Alessandra; Huang, Xinchuan; Lee, Timothy J; Tielens, Alexander G G M
2015-06-28
A full derivation of the analytic transformation of the quadratic, cubic, and quartic force constants from normal coordinates to Cartesian coordinates is given. Previous attempts at this transformation have resulted in non-linear transformations; however, for the first time, a simple linear transformation is presented here. Two different approaches have been formulated and implemented, one of which does not require prior knowledge of the translation-rotation eigenvectors from diagonalization of the Hessian matrix. The validity of this method is tested using two molecules H2O and c-C3H2D(+). PMID:26133410
Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry
NASA Technical Reports Server (NTRS)
Nemec, Marian; Aftosmis,Michael J.
2006-01-01
Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach
System Wide Joint Position Sensor Fault Tolerance in Robot Systems Using Cartesian Accelerometers
NASA Technical Reports Server (NTRS)
Aldridge, Hal A.; Juang, Jer-Nan
1997-01-01
Joint position sensors are necessary for most robot control systems. A single position sensor failure in a normal robot system can greatly degrade performance. This paper presents a method to obtain position information from Cartesian accelerometers without integration. Depending on the number and location of the accelerometers. the proposed system can tolerate the loss of multiple position sensors. A solution technique suitable for real-time implementation is presented. Simulations were conducted using 5 triaxial accelerometers to recover from the loss of up to 4 joint position sensors on a 7 degree of freedom robot moving in general three dimensional space. The simulations show good estimation performance using non-ideal accelerometer measurements.
NASA Astrophysics Data System (ADS)
Noda, N.; Ashida, F.; Okumura, I. A.
1992-07-01
In the present paper we propose a new general solution technique for transient thermoelastic problems of transversely isotropic solids in Cartesian coordinates. The solution technique consists of five fundamental solutions. By considering the relations among the material constants of transverse isotropy, the solution technique is classified into five groups. One among those corresponds to Goodier's thermoelastic potential function as well as the generalized Boussinesq solutions and the Michell function. For an application of the solution technique, an inverse problem of transient thermoelasticity in a transversely isotropic semi-infinite solid is analyzed.
Alj, Domenico; Caputo, Roberto; Umeton, Cesare
2014-11-01
We report on the realization of a liquid crystal (LC)-based optical diffraction grating showing a polar symmetry of the director alignment. This has been obtained as a natural evolution of the POLICRYPS technique, which enables the realization of highly efficient, switchable, planar diffraction gratings. Performances exhibited in the Cartesian geometry are extended to the polar one by exploiting the spherical aberration produced by simple optical elements. This enables producing the required highly stable polar pattern that allows fabricating a circular optical diffraction grating. Results are promising for their possible application in fields in which a rotational structure of the optical beam is needed. PMID:25361314
Parallel adaptive Cartesian upwind methods for shock-driven multiphysics simulation
Deiterding, Ralf
2011-01-01
The multiphysics fluid-structure interaction simulation of shock-loaded thin-walled structures requires the dynamic coupling of a shock-capturing flow solver to a solid mechanics solver for large deformations. By combining a Cartesian embedded boundary approach with dynamic mesh adaptation a generic software framework for such flow solvers has been constructed that allows easy exchange of the specific hydrodynamic finite volume upwind scheme and coupling to various explicit finite element solid dynamics solvers. The paper gives an overview of the computational approach and presents first simulations that couple the software to the general purpose solid dynamics code DYNA3D.
CAD-Based Aerodynamic Design of Complex Configurations using a Cartesian Method
NASA Technical Reports Server (NTRS)
Nemec, Marian; Aftosmis, Michael J.; Pulliam, Thomas H.
2003-01-01
A modular framework for aerodynamic optimization of complex geometries is developed. By working directly with a parametric CAD system, complex-geometry models are modified nnd tessellated in an automatic fashion. The use of a component-based Cartesian method significantly reduces the demands on the CAD system, and also provides for robust and efficient flowfield analysis. The optimization is controlled using either a genetic or quasi-Newton algorithm. Parallel efficiency of the framework is maintained even when subject to limited CAD resources by dynamically re-allocating the processors of the flow solver. Overall, the resulting framework can explore designs incorporating large shape modifications and changes in topology.
Efficient and Robust Cartesian Mesh Generation for Building-Cube Method
NASA Astrophysics Data System (ADS)
Ishida, Takashi; Takahashi, Shun; Nakahashi, Kazuhiro
In this study, an efficient and robust Cartesian mesh generation method for Building-Cube Method (BCM) is proposed. It can handle “dirty” geometry data whose surface has cracks, overlaps, and reverse of triangle. BCM mesh generation is implemented by two procedures; cube generation and cell generation in each cube. The cell generation procedure in this study is managed in each cube individually, and parallelized by OpenMP. Efficiency of the parallelized BCM mesh generation is demonstrated for several three-dimensional test cases using a multi-core PC.
The Dirac-Hestenes Equation for Spherical Symmetric Potentials in the Spherical and Cartesian Gauges
NASA Astrophysics Data System (ADS)
da Rocha, Roldão; Rodrigues, Waldyr A.
In this paper, using the apparatus of the Clifford bundle formalism, we show how straightforwardly solve in Minkowski space-time the Dirac-Hestenes equation — which is an appropriate representative in the Clifford bundle of differential forms of the usual Dirac equation — by separation of variables for the case of a potential having spherical symmetry in the Cartesian and spherical gauges. We show that, contrary to what is expected at a first sight, the solution of the Dirac-Hestenes equation in both gauges has exactly the same mathematical difficulty.
Mathematical model of a moment-less arch
2016-01-01
This paper presents a mathematical model for predicting the geometrical shapes of rigid, two-pin, moment-less arches of constant cross section. The advancement of this work lies in the inclusion of arch self-weight and the ability to produce moment-less arch forms for any span/rise ratio, and any ratio of uniformly distributed load per unit span, w, to uniformly distributed arch weight per unit arch length, q. The model is used to derive the shapes of two classical ‘moment-less’ arch forms: parabolic and catenary, prior to demonstrating a general case, not restricted by the unrealistic load assumptions (absence of q, in the case of a parabolic form, or no w, in the case of a catenary arch). Using the same value of span/rise ratio, and w/q>1, the behaviour of the moment-less and parabolic arches under permanent loading, (w+q), is analysed. Results show the former to be developing much lower stresses than its parabolic rival, even when there are relatively small differences in the two geometries; for a medium span/rise ratio of 4 and w/q=2, differences in the parabolic and moment-less arch geometries would, in practical terms, be viewed as insignificant, but the stresses in them are different. PMID:27436970
Random geometric graphs with general connection functions
NASA Astrophysics Data System (ADS)
Dettmann, Carl P.; Georgiou, Orestis
2016-03-01
In the original (1961) Gilbert model of random geometric graphs, nodes are placed according to a Poisson point process, and links formed between those within a fixed range. Motivated by wireless ad hoc networks "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H (r ) that gives the probability that two nodes at distance r are linked (directly connect). In many applications (not only wireless networks), it is desirable that the graph is connected; that is, every node is linked to every other node in a multihop fashion. Here the connection probability of a dense network in a convex domain in two or three dimensions is expressed in terms of contributions from boundary components for a very general class of connection functions. It turns out that only a few quantities such as moments of the connection function appear. Good agreement is found with special cases from previous studies and with numerical simulations.
Point estimates for probability moments
Rosenblueth, Emilio
1975-01-01
Given a well-behaved real function Y of a real random variable X and the first two or three moments of X, expressions are derived for the moments of Y as linear combinations of powers of the point estimates y(x+) and y(x-), where x+ and x- are specific values of X. Higher-order approximations and approximations for discontinuous Y using more point estimates are also given. Second-moment approximations are generalized to the case when Y is a function of several variables. PMID:16578731
Spectral moments of fullerene cages
NASA Astrophysics Data System (ADS)
Zhang, Hongxing; Balasubramanian, K.
Based on the symmetric method, analytical expression or recursive relations for the spectral moments of the C20, C24, C26, C28, C30, C32, C36, C38, C40, C42, C44, C50 and C60 fullerene cage clusters are obtained by factoring the original graphs and the corresponding characteristic polynomials into their smaller subgraphs and subpolynomials. We also give numerical results for the spectral moments. It is demonstrated that the symmetric method is feasible in enumerating the moments as well as factoring the characteristic polynomials for fullerene cages.
VLSI architectures for geometrical mapping problems in high-definition image processing
NASA Astrophysics Data System (ADS)
Kim, K.; Lee, J.
This paper explores a VLSI architecture for geometrical mapping address computation. The geometric transformation is discussed in the context of plane projective geometry, which invokes a set of basic transformations to be implemented for the general image processing. The homogeneous and 2-dimensional cartesian coordinates are employed to represent the transformations, each of which is implemented via an augmented CORDIC as a processing element. A specific scheme for a processor, which utilizes full-pipelining at the macro-level and parallel constant-factor-redundant arithmetic and full-pipelining at the micro-level, is assessed to produce a single VLSI chip for HDTV applications using state-of-art MOS technology.
VLSI architectures for geometrical mapping problems in high-definition image processing
NASA Technical Reports Server (NTRS)
Kim, K.; Lee, J.
1991-01-01
This paper explores a VLSI architecture for geometrical mapping address computation. The geometric transformation is discussed in the context of plane projective geometry, which invokes a set of basic transformations to be implemented for the general image processing. The homogeneous and 2-dimensional cartesian coordinates are employed to represent the transformations, each of which is implemented via an augmented CORDIC as a processing element. A specific scheme for a processor, which utilizes full-pipelining at the macro-level and parallel constant-factor-redundant arithmetic and full-pipelining at the micro-level, is assessed to produce a single VLSI chip for HDTV applications using state-of-art MOS technology.
Rational and efficient geometric definition of pharmacophores is essential for the patent process.
Guérin, Georges-Alexandre; Pratuangdejkul, Jaturong; Alemany, Monica; Launay, Jean-Marie; Manivet, Philippe
2006-11-01
The geometric description of pharmacophores suffers from approximations. No consensus has been clearly established, despite the increasing interest in using pharmacophores in drug design and in patent applications. We therefore propose an original definition of a pharmacophore using spherical coordinates. These coordinates give a precise description of each point using three parameters: distance to a geometric origin and two angles. If necessary, these parameters can be easily and rapidly converted to cartesian coordinates. Our method can guarantee, to the patent applicant, the safe protection of his intellectual property by both improving markedly the readability of a pharmacophore definition and bringing, to the person who is skilled in the art, enough information to understand easily the essence of the invention. PMID:17055408
Elking, Dennis M
2016-08-15
New equations for torque and atomic force are derived for use in flexible molecule force fields with atomic multipoles. The expressions are based on Cartesian tensors with arbitrary multipole rank. The standard method for rotating Cartesian tensor multipoles and calculating torque is to first represent the tensor with n indexes and 3(n) redundant components. In this work, new expressions for directly rotating the unique (n + 1)(n + 2)/2 Cartesian tensor multipole components Θpqr are given by introducing Cartesian tensor rotation matrix elements X(R). A polynomial expression and a recursion relation for X(R) are derived. For comparison, the analogous rotation matrix for spherical tensor multipoles are the Wigner functions D(R). The expressions for X(R) are used to derive simple equations for torque and atomic force. The torque and atomic force equations are applied to the geometry optimization of small molecule crystal unit cells. In addition, a discussion of computational efficiency as a function of increasing multipole rank is given for Cartesian tensors. © 2016 Wiley Periodicals, Inc. PMID:27349179
Characteristic signatures of quantum criticality driven by geometrical frustration.
Tokiwa, Yoshifumi; Stingl, Christian; Kim, Moo-Sung; Takabatake, Toshiro; Gegenwart, Philipp
2015-04-01
Geometrical frustration describes situations where interactions are incompatible with the lattice geometry and stabilizes exotic phases such as spin liquids. Whether geometrical frustration of magnetic interactions in metals can induce unconventional quantum critical points is an active area of research. We focus on the hexagonal heavy fermion metal CeRhSn, where the Kondo ions are located on distorted kagome planes stacked along the c axis. Low-temperature specific heat, thermal expansion, and magnetic Grüneisen parameter measurements prove a zero-field quantum critical point. The linear thermal expansion, which measures the initial uniaxial pressure derivative of the entropy, displays a striking anisotropy. Critical and noncritical behaviors along and perpendicular to the kagome planes, respectively, prove that quantum criticality is driven be geometrical frustration. We also discovered a spin flop-type metamagnetic crossover. This excludes an itinerant scenario and suggests that quantum criticality is related to local moments in a spin liquid-like state. PMID:26601165
Characteristic signatures of quantum criticality driven by geometrical frustration
Tokiwa, Yoshifumi; Stingl, Christian; Kim, Moo-Sung; Takabatake, Toshiro; Gegenwart, Philipp
2015-01-01
Geometrical frustration describes situations where interactions are incompatible with the lattice geometry and stabilizes exotic phases such as spin liquids. Whether geometrical frustration of magnetic interactions in metals can induce unconventional quantum critical points is an active area of research. We focus on the hexagonal heavy fermion metal CeRhSn, where the Kondo ions are located on distorted kagome planes stacked along the c axis. Low-temperature specific heat, thermal expansion, and magnetic Grüneisen parameter measurements prove a zero-field quantum critical point. The linear thermal expansion, which measures the initial uniaxial pressure derivative of the entropy, displays a striking anisotropy. Critical and noncritical behaviors along and perpendicular to the kagome planes, respectively, prove that quantum criticality is driven be geometrical frustration. We also discovered a spin flop–type metamagnetic crossover. This excludes an itinerant scenario and suggests that quantum criticality is related to local moments in a spin liquid–like state. PMID:26601165
Goldberg, P.W.
1993-04-01
In this paper we consider the problem of learning the positions of spheres in metric spaces, given as data randomly drawn points classified according to whether they are internal or external to an unknown sphere. The particular metrics under consideration are geometrical shape metrics, and the results are intended to be applicable to the problem of learning to identify a shape from related shapes classified according to whether they resemble it visually. While it is typically NP-hard to locate a central point for a hypothesis sphere, we find that it is however often possible to obtain a non-spherical hypothesis which can accurately predict whether further random points lie within the unknown sphere. We exhibit algorithms which achieve this, and in the process indicate useful general techniques for computational learning. Finally we exhibit a natural shape metric and show that it defines a class of spheres not predictable in this sense, subject to standard cryptographic assumptions.
Geometrical aspects of entanglement
Leinaas, Jon Magne; Myrheim, Jan; Ovrum, Eirik
2006-07-15
We study geometrical aspects of entanglement, with the Hilbert-Schmidt norm defining the metric on the set of density matrices. We focus first on the simplest case of two two-level systems and show that a 'relativistic' formulation leads to a complete analysis of the question of separability. Our approach is based on Schmidt decomposition of density matrices for a composite system and nonunitary transformations to a standard form. The positivity of the density matrices is crucial for the method to work. A similar approach works to some extent in higher dimensions, but is a less powerful tool. We further present a numerical method for examining separability and illustrate the method by a numerical study of bound entanglement in a composite system of two three-level systems.
Information geometric nonlinear filtering
NASA Astrophysics Data System (ADS)
Newton, Nigel J.
2015-06-01
This paper develops information geometric representations for nonlinear filters in continuous time. The posterior distribution associated with an abstract nonlinear filtering problem is shown to satisfy a stochastic differential equation on a Hilbert information manifold. This supports the Fisher metric as a pseudo-Riemannian metric. Flows of Shannon information are shown to be connected with the quadratic variation of the process of posterior distributions in this metric. Apart from providing a suitable setting in which to study such information-theoretic properties, the Hilbert manifold has an appropriate topology from the point of view of multi-objective filter approximations. A general class of finite-dimensional exponential filters is shown to fit within this framework, and an intrinsic evolution equation, involving Amari's -1-covariant derivative, is developed for such filters. Three example systems, one of infinite dimension, are developed in detail.
Inflow-outflow boundary conditions along arbitrary directions in Cartesian lake models
NASA Astrophysics Data System (ADS)
Ramón, C. L.; Cortés, A.; Rueda, F. J.
2015-01-01
Specifying point sources and sinks of water near boundaries is presented as a flexible approach to prescribe inflows and outflows along arbitrary directions in Cartesian grid lake models. Implementing the approach involves a straightforward modification of the governing equations, to include a first order source term in the continuity and momentum equations. The approach is implemented in a Cartesian grid model and applied to several test cases. First, the flow along a straight flat bottom channel with its axis forming different angles with the grid directions is simulated and the results are compared against well-known analytical solutions. Point-sources are then used to simulate unconfined inflows into a reservoir (a small river entering a reservoir in a jet-like manner), which occur at an angle with the grid directions. The model results are assessed in terms of a mixing ratio between lake and river water, evaluated at a cross section downstream of the inflow boundary. Those results are particularly sensitive to changes in the inflow angle. It is argued that differences in mixing rates near the inflow sections could affect the fate of river-borne substances in model simulations.
Applications of Space-Filling-Curves to Cartesian Methods for CFD
NASA Technical Reports Server (NTRS)
Aftosmis, Michael J.; Berger, Marsha J.; Murman, Scott M.
2003-01-01
The proposed paper presents a variety novel uses of Space-Filling-Curves (SFCs) for Cartesian mesh methods in 0. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, most are applicable on general body-fitted meshes -both structured and unstructured. We demonstrate the use of single O(N log N) SFC-based reordering to produce single-pass (O(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations. Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 512 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 10% of ideal even with only around 50,000 cells in each subdomain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with O(max(M,N)) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for finite-difference-based gradient design methods.
Applications of Space-Filling-Curves to Cartesian Methods for CFD
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.; Murman, S. M.; Berger, M. J.
2003-01-01
This paper presents a variety of novel uses of space-filling-curves (SFCs) for Cartesian mesh methods in CFD. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, many are applicable on general body-fitted meshes-both structured and unstructured. We demonstrate the use of single theta(N log N) SFC-based reordering to produce single-pass (theta(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 640 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 15% of ideal even with only around 50,000 cells in each sub-domain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with theta(M + N) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for control surface deflection or finite-difference-based gradient design methods.
Systematic and Deterministic Graph-Minor Embedding of Cartesian Products of Complete Graphs
NASA Astrophysics Data System (ADS)
Zaribafiyan, Arman; Marchand, Dominic J. J.; Changiz Rezaei, Seyed Saeed
The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. The overhead of the widely used heuristic techniques is quickly proving to be a significant bottleneck for real-world applications. To alleviate this obstacle, we propose a systematic deterministic embedding method that exploits the structures of both the input graph of the specific combinatorial optimization problem and the quantum annealer. We focus on the specific case of the Cartesian product of two complete graphs, a regular structure that occurs in many problems. We first divide the problem by embedding one of the factors of the Cartesian product in a repeatable unit. The resulting simplified problem consists of placing copies of this unit and connecting them together appropriately. Aside from the obvious speed and efficiency advantages of a systematic deterministic approach, the embeddings produced can be easily scaled for larger processors and show desirable properties with respect to the number of qubits used and the chain length distribution.
Overcoming high-field RF problems with non-magnetic Cartesian feedback transceivers.
Hoult, D I; Foreman, D; Kolansky, G; Kripiakevich, D
2008-03-01
In extending human MR to field strengths approaching 10 T, the wavelength of electromagnetic radiation at the proton Larmor frequency becomes less than human body size and conventional radio-frequency coil circumference. Consequently, radio-frequency magnetic fields are better generated by an array of small coils than by one large coil. In this article, the primary problem of array coil interactions during transmission is examined, and a standard proposed whereby secondary induced currents should be less than 1% of the primary coil current. The use of cancellation methods and of power amplifiers with high output impedance to reduce interactions is examined in the light of this standard and found wanting. Non-magnetic Cartesian feedback transceivers functioning at the magnet entrance are then proposed as a solution that both reduces instrumentation cost and increases the bandwidth over which the standard may be met. The compromises inherent in instrument design are detailed and examples given of the innovative circuitry used. It is shown experimentally that when connected to interacting coils, two Cartesian feedback instruments function stably in accord with theory and such that the proposed standard is typically attained over a bandwidth of 22 kHz during transmission (much greater during signal reception)-enough for all current MR protocols. PMID:18026763
Multilevel Error Estimation and Adaptive h-Refinement for Cartesian Meshes with Embedded Boundaries
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.; Berger, M. J.; Kwak, Dochan (Technical Monitor)
2002-01-01
This paper presents the development of a mesh adaptation module for a multilevel Cartesian solver. While the module allows mesh refinement to be driven by a variety of different refinement parameters, a central feature in its design is the incorporation of a multilevel error estimator based upon direct estimates of the local truncation error using tau-extrapolation. This error indicator exploits the fact that in regions of uniform Cartesian mesh, the spatial operator is exactly the same on the fine and coarse grids, and local truncation error estimates can be constructed by evaluating the residual on the coarse grid of the restricted solution from the fine grid. A new strategy for adaptive h-refinement is also developed to prevent errors in smooth regions of the flow from being masked by shocks and other discontinuous features. For certain classes of error histograms, this strategy is optimal for achieving equidistribution of the refinement parameters on hierarchical meshes, and therefore ensures grid converged solutions will be achieved for appropriately chosen refinement parameters. The robustness and accuracy of the adaptation module is demonstrated using both simple model problems and complex three dimensional examples using meshes with from 10(exp 6), to 10(exp 7) cells.
Nonlinear and linear local cartesian relative motion state models for J2 pertubed elliptical orbits
NASA Astrophysics Data System (ADS)
Theron, A.; Kara-Zaitri, M.; Arzelier, D.; Louembet, C.
2009-10-01
Formulating a relative motion model between artificial satellites keeps a very actual interest in order to achieve devices adapted to autonomous rendezvous operating or formation flying control. Scanning the existing models field leads to distinguish them according to their nature -- linear or nonlinear -- the relative state variables -- local cartesian or curvilinear variables, relative orbital elements, classical or not -- the reference state variables -- inertial cartesian or spherical variables, orbital elements -- the pertubations taken into account -- drag, J2, ... -- and other assumptions as eccentricity of the reference satellite. The historical Clohessy-Wiltshire and Tschauner-Hempel models have been outclassed by improved linear models that include J2 pertubation [1, 2, 3] or drag [4] but do not take rigorously into account the perturbed dynamics of the reference local frame. As far as this fundamental point is concerned, Kechichian's nonlinear model [5] provides an interesting but complex formulation because of a non optimal derivation method. More over, it does not take full advantage of the Lagrange conditions [6] implied by orbital elements definition which allows simplifications without loss of generality. These elements are presented in this article to reach an improved relative motion nonlinear model under J2 perturbation assumption which results are validated by comparison with those produced by a nonlinear equinoctial propagator. A linear model is also proposed.
Radiation reaction of multipole moments
NASA Astrophysics Data System (ADS)
Kazinski, P. O.
2007-08-01
A Poincaré-invariant description is proposed for the effective dynamics of a localized system of charged particles in classical electrodynamics in terms of the intrinsic multipole moments of the system. A relativistic-invariant definition for the intrinsic multipole moments of a system of charged particles is given. A new generally covariant action functional for a relativistic perfect fluid is proposed. In the case of relativistic charged dust, it is proven that the description of the problem of radiation reaction of multipole moments by the model of particles is equivalent to the description of this problem by a hydrodynamic model. An effective model is obtained for a pointlike neutral system of charged particles that possesses an intrinsic dipole moment, and the free dynamics of this system is described. The bound momentum of a point dipole is found.
Second moments and rotational spectroscopy
NASA Astrophysics Data System (ADS)
Bohn, Robert K.; Montgomery, John A.; Michels, H. Harvey; Fournier, Joseph A.
2016-07-01
Although determining molecular structure using microwave spectroscopy is a mature technique, there are still simple but powerful insights to analysis of the data which are not generally appreciated. This paper summarizes three applications of second (or planar) moments which quickly and easily provide insights and conclusions about a molecule's structure not easily obtained from the molecule's rotational constants. If the molecule has a plane of symmetry, group second moments can verify that property and determine which groups are located on that plane. Common groups contribute predictable values to second moments. This study examines the contribution and transferability of CH2/CH3, CF2/CF3, isopropyl, and phenyl groups to molecular constants. Structures of related molecules can be critically compared using their second moments. A third application to any molecule, even those whose structures have only the identity symmetry element, determines bond lengths and angles which exactly reproduce experimentally determined 2nd moments, rotational constants, and moments of inertia. Approximate least squares methods are not needed.
Elliott, Mark A; Giersch, Anne
2015-01-01
There has been evidence for the very brief, temporal quantization of perceptual experience at regular intervals below 100 ms for several decades. We briefly describe how earlier studies led to the concept of "psychological moment" of between 50 and 60 ms duration. According to historical theories, within the psychological moment all events would be processed as co-temporal. More recently, a link with physiological mechanisms has been proposed, according to which the 50-60 ms psychological moment would be defined by the upper limit required by neural mechanisms to synchronize and thereby represent a snapshot of current perceptual event structure. However, our own experimental developments also identify a more fine-scaled, serialized process structure within the psychological moment. Our data suggests that not all events are processed as co-temporal within the psychological moment and instead, some are processed successively. This evidence questions the analog relationship between synchronized process and simultaneous experience and opens debate on the ontology and function of "moments" in psychological experience. PMID:26779059
Characterization of cerebral aneurysms using 3D moment invariants
NASA Astrophysics Data System (ADS)
Millan, Raul D.; Hernandez, Monica; Gallardo, Daniel; Cebral, Juan R.; Putman, Christopher; Dempere-Marco, Laura; Frangi, Alejandro F.
2005-04-01
The rupture mechanism of intracranial aneurysms is still not fully understood. Although the size of the aneurysm is the shape index most commonly used to predict rupture, some controversy still exists about its adequateness as an aneurysm rupture predictor. In this work, an automatic method to geometrically characterize the shape of cerebral saccular aneurysms using 3D moment invariants is proposed. Geometric moments are efficiently computed via application of the Divergence Theorem over the aneurysm surface using a non-structured mesh. 3D models of the aneurysm and its connected parent vessels have been reconstructed from segmentations of both 3DRA and CTA images. Two alternative approaches have been used for segmentation, the first one based on isosurface deformable models, and the second one based on the level set method. Several experiments were also conducted to both assess the influence of pre-processing steps in the stability of the aneurysm shape descriptors, and to know the robustness of the proposed method. Moment invariants have proved to be a robust technique while providing a reliable way to discriminate between ruptured and unruptured aneurysms (Sensitivity=0.83, Specificity=0.74) on a data set containing 55 aneurysms. Further investigation over larger databases is necessary to establish their adequateness as reliable predictors of rupture risk.
Second Moments (planar Moments) and Their Application in Spectroscopy
NASA Astrophysics Data System (ADS)
Bohn, Robert K.; Montgomery, John A., Jr.; Michels, H. Harvey; Byrd, Jason N.
2013-06-01
Second moments, also called planar moments (P_{ii} = Σ m_{i}^{} x_{i}^{2}), are the spectroscopic parameters used to determine substitution structures (r_{s}) ) by Kraitchman''s method from spectra of a molecule and its isotopologs. They are also useful for discussing other molecular structural properties. Just as bond lengths and angles are considered transferable among similar molecules, second moments of many common groups are also transferable. This paper discusses applications of second moments of methylene/methyl groups, singly or multiply, isopropyl/tert-butyl groups, phenyl groups, per{f}{l}uoro methylene/methyl groups, combinations of any of them, and planarity of molecules, the historically most common application of second moments. The inertial defect is Δ = (I_{c} - I_{a} - I_{b}) or -2P_{cc}. Some authors err by assuming each isotopolog provides three independent rotational constants, but in some cases they are not all independent. J. Kraitchman, Am. J. Phys. {21 (17), 1953.}
Inquiry-Based Science: Turning Teachable Moments into Learnable Moments
NASA Astrophysics Data System (ADS)
Haug, Berit S.
2014-02-01
This study examines how an inquiry-based approach to teaching and learning creates teachable moments that can foster conceptual understanding in students, and how teachers capitalize upon these moments. Six elementary school teachers were videotaped as they implemented an integrated inquiry-based science and literacy curriculum in their classrooms. In this curriculum, science inquiry implies that students search for evidence in order to make and revise explanations based on the evidence found and through critical and logical thinking. Furthermore, the curriculum material is designed to address science key concepts multiple times through multiple modalities (do it, say it, read it, write it). Two types of teachable moments were identified: planned and spontaneous. Results suggest that the consolidation phases of inquiry, when students reinforce new knowledge and connect their empirical findings to theory, can be considered as planned teachable moments. These are phases of inquiry during which the teacher should expect, and be prepared for, student utterances that create opportunities to further student learning. Spontaneous teachable moments are instances when the teacher must choose to either follow the pace of the curriculum or adapt to the students' need. One implication of the study is that more teacher support is required in terms of how to plan for and effectively utilize the consolidation phases of inquiry.
Enhancing geometric reasoning.
Mistretta, R M
2000-01-01
Geometry is an important part of the mathematics curriculum. However, students are not demonstrating strong conceptual knowledge of this subject. The research of Van Hiele and Van Hiele-Geldof has focused on the concept of thinking levels in geometry and the role of instruction in raising levels of thinking. This paper describes a field trial of a supplemental geometry unit intended to raise Van Hiele thinking levels in a group of 23 eighth-grade students by having them become more adept at using higher order thinking skills. Sample questions assessing particular Van Hiele thinking levels and attitudes toward geometry, as well as field-tested activities yielding the most positive results, are presented. Educators can benefit from this application of the Van Hiele model of geometric thinking, since the thought processes involved in learning geometry are explained, along with teaching techniques and tools for assessment. By having teachers become more aware of their students' cognitive skills, attitudes, and misconceptions, teaching practices and student achievement can be enhanced. PMID:11019778
Nuclear Electric Dipole Moment Calculations
NASA Astrophysics Data System (ADS)
Haxton, Wick
2010-11-01
One of the most important constraints on CP violation in the nucleon and NN interaction is provided by electric dipole moment (EDM) limits for neutral diamagnetic atoms, particularly 199Hg. To extract CP-violating couplings from experiment, one must relate the atomic EDM to the underlying nuclear CP-odd moments, a task complicated by the atomic response, which largely shields the nucleus from the applied external electric field. The residual response -- the Schiff moment -- depends on corrections such as the finite size of the nucleus. Conventional Schiff-moment calculations have largely ignored one consequence of the screening: the cancellation between direct and polarization diagrams, which yields an answer that is suppressed by two powers of RN/RA, where RN and RA are the nuclear and atomic sizes, requires one to identify all other terms that contribute to the same order in the RN/RA power counting. We show that such terms arise from nuclear excitations associated with the dipole charge and transverse electric multipole operators, and discuss the consequences. We also describe higher T-odd moments that contribute up to the same order in the counting, and point out interesting nuclear structure and experimental consequences.
Moment of inertia of liquid in a tank
NASA Astrophysics Data System (ADS)
Lee, Gyeong Joong
2014-03-01
In this study, the inertial properties of fully filled liquid in a tank were studied based on the potential theory. The analytic solution was obtained for the rectangular tank, and the numerical solutions using Green's 2nd identity were obtained for other shapes. The inertia of liquid behaves like solid in recti-linear acceleration. But under rotational acceleration, the moment of inertia of liquid becomes small compared to that of solid. The shapes of tank investigated in this study were ellipse, rectangle, hexagon, and octagon with various aspect ratios. The numerical solu¬tions were compared with analytic solution, and an ad hoc semi-analytical approximate formula is proposed herein and this formula gives very good predictions for the moment of inertia of the liquid in a tank of several different geometrical shapes. The results of this study will be useful in analyzing of the motion of LNG/LPG tanker, liquid cargo ship, and damaged ship.
A Cartesian grid embedded boundary method for the heat equation on irregular domains
McCorquodale, Peter; Colella, Phillip; Johansen, Hans
2001-03-14
We present an algorithm for solving the heat equation on irregular time-dependent domains. It is based on the Cartesian grid embedded boundary algorithm of Johansen and Colella (J. Comput. Phys. 147(2):60--85) for discretizing Poisson's equation, combined with a second-order accurate discretization of the time derivative. This leads to a method that is second-order accurate in space and time. For the case where the boundary is moving, we convert the moving-boundary problem to a sequence of fixed-boundary problems, combined with an extrapolation procedure to initialize values that are uncovered as the boundary moves. We find that, in the moving boundary case, the use of Crank--Nicolson time discretization is unstable, requiring us to use the L{sub 0}-stable implicit Runge--Kutta method of Twizell, Gumel, and Arigu.
NASA Astrophysics Data System (ADS)
Huang, He
In this thesis, I present the results of studies of the structural properties and phase transition of a charge neutral FCC Lattice Gas with Yukawa Interaction and discuss a novel fast calculation algorithm---Accelerated Cartesian Expansion (ACE) method. In the first part of my thesis, I discuss the results of Monte Carlo simulations carried out to understand the finite temperature (phase transition) properties and the ground state structure of a Yukawa Lattice Gas (YLG) model. In this model the ions interact via the potential q iqjexp(-kappar> ij)/rij where qi,j are the charges of the ions located at the lattice sites i and j with position vectors R i and Rj; rij = Ri-Rj, kappa is a measure of the range of the interaction and is called the screening parameter. This model approximates an interesting quaternary system of great current thermoelectric interest called LAST-m, AgSbPbmTem+2. I have also developed rapid calculation methods for the potential energy calculation in a lattice gas system with periodic boundary condition bases on the Ewald summation method and coded the algorithm to compute the energies in MC simulation. Some of the interesting results of the MC simulations are: (i) how the nature and strength of the phase transition depend on the range of interaction (Yukawa screening parameter kappa) (ii) what is the degeneracy of the ground state for different values of the concentration of charges, and (iii) what is the nature of two-stage disordering transition seen for certain values of x. In addition, based on the analysis of the surface energy of different nano-clusters formed near the transition temperature, the solidification process and the rate of production of these nano-clusters have been studied. In the second part of my thesis, we have developed two methods for rapidly computing potentials of the form R-nu. Both these methods are founded on addition theorems based on Taylor expansions. Taylor's series has a couple of inherent advantages: (i) it
Courau, T.; Moustafa, S.; Plagne, L.; Poncot, A.
2013-07-01
As part of its activity, EDF R and D is developing a new nuclear core simulation code named COCAGNE. This code relies on DIABOLO, a Simplified PN (SPN) method to compute the neutron flux inside the core for eigenvalue calculations. In order to assess the accuracy of SPN calculations, we have developed DOMINO, a new 3D Cartesian SN solver. The parallel implementation of DOMINO is very efficient and allows to complete an eigenvalue calculation involving around 300 x 10{sup 9} degrees of freedom within a few hours on a single shared-memory supercomputing node. This computation corresponds to a 26-group S{sub 8} 3D PWR core model used to assess the SPN accuracy. At the pin level, the maximal error for the SP{sub 5} DIABOLO fission production rate is lower than 0.2% compared to the S{sub 8} DOMINO reference for this 3D PWR core model. (authors)
Baczewski, Andrew David; Miller, Nicholas C.; Shanker, Balasubramaniam
2012-03-22
Here, the analysis of fields in periodic dielectric structures arise in numerous applications of recent interest, ranging from photonic bandgap structures and plasmonically active nanostructures to metamaterials. To achieve an accurate representation of the fields in these structures using numerical methods, dense spatial discretization is required. This, in turn, affects the cost of analysis, particularly for integral-equation-based methods, for which traditional iterative methods require Ο(Ν^{2}) operations, Ν being the number of spatial degrees of freedom. In this paper, we introduce a method for the rapid solution of volumetric electric field integral equations used in the analysis of doubly periodic dielectric structures. The crux of our method is the accelerated Cartesian expansion algorithm, which is used to evaluate the requisite potentials in Ο(Ν) cost. Results are provided that corroborate our claims of acceleration without compromising accuracy, as well as the application of our method to a number of compelling photonics applications.
Investigation of Radar Propagation in Buildings: A 10 Billion Element Cartesian-Mesh FETD Simulation
Stowell, M L; Fasenfest, B J; White, D A
2008-01-14
In this paper large scale full-wave simulations are performed to investigate radar wave propagation inside buildings. In principle, a radar system combined with sophisticated numerical methods for inverse problems can be used to determine the internal structure of a building. The composition of the walls (cinder block, re-bar) may effect the propagation of the radar waves in a complicated manner. In order to provide a benchmark solution of radar propagation in buildings, including the effects of typical cinder block and re-bar, we performed large scale full wave simulations using a Finite Element Time Domain (FETD) method. This particular FETD implementation is tuned for the special case of an orthogonal Cartesian mesh and hence resembles FDTD in accuracy and efficiency. The method was implemented on a general-purpose massively parallel computer. In this paper we briefly describe the radar propagation problem, the FETD implementation, and we present results of simulations that used over 10 billion elements.
Validation of Inlet and Exhaust Boundary Conditions for a Cartesian Method
NASA Technical Reports Server (NTRS)
Pandya, Shishir A.; Murman, Scott M.; Aftosmis, Michael J.
2004-01-01
Inlets and exhaust nozzles are often omitted in aerodynamic simulations of aircraft due to the complexities involved in the modeling of engine details and flow physics. However, the omission is often improper since inlet or plume flows may have a substantial effect on vehicle aerodynamics. A method for modeling the effect of inlets and exhaust plumes using boundary conditions within an inviscid Cartesian flow solver is presented. This approach couples with both CAD systems and legacy geometry to provide an automated tool suitable for parameter studies. The method is validated using two and three-dimensional test problems which are compared with both theoretical and experimental results. The numerical results demonstrate excellent agreement with theory and available data, even for extremely strong jets and very sensitive inlets.
Accelerated Cartesian expansions for the rapid solution of periodic multiscale problems
Baczewski, Andrew David; Dault, Daniel L.; Shanker, Balasubramaniam
2012-07-03
We present an algorithm for the fast and efficient solution of integral equations that arise in the analysis of scattering from periodic arrays of PEC objects, such as multiband frequency selective surfaces (FSS) or metamaterial structures. Our approach relies upon the method of Accelerated Cartesian Expansions (ACE) to rapidly evaluate the requisite potential integrals. ACE is analogous to FMM in that it can be used to accelerate the matrix vector product used in the solution of systems discretized using MoM. Here, ACE provides linear scaling in both CPU time and memory. Details regarding the implementation of this method within themore » context of periodic systems are provided, as well as results that establish error convergence and scalability. In addition, we also demonstrate the applicability of this algorithm by studying several exemplary electrically dense systems.« less
Accelerated Cartesian expansions for the rapid solution of periodic multiscale problems
Baczewski, Andrew David; Dault, Daniel L.; Shanker, Balasubramaniam
2012-07-03
We present an algorithm for the fast and efficient solution of integral equations that arise in the analysis of scattering from periodic arrays of PEC objects, such as multiband frequency selective surfaces (FSS) or metamaterial structures. Our approach relies upon the method of Accelerated Cartesian Expansions (ACE) to rapidly evaluate the requisite potential integrals. ACE is analogous to FMM in that it can be used to accelerate the matrix vector product used in the solution of systems discretized using MoM. Here, ACE provides linear scaling in both CPU time and memory. Details regarding the implementation of this method within the context of periodic systems are provided, as well as results that establish error convergence and scalability. In addition, we also demonstrate the applicability of this algorithm by studying several exemplary electrically dense systems.
Polar versus Cartesian velocity models for maneuvering target tracking with IMM
NASA Astrophysics Data System (ADS)
Laneuville, Dann
This paper compares various model sets in different IMM filters for the maneuvering target tracking problem. The aim is to see whether we can improve the tracking performance of what is certainly the most widely used model set in the literature for the maneuvering target tracking problem: a Nearly Constant Velocity model and a Nearly Coordinated Turn model. Our new challenger set consists of a mixed Cartesian position and polar velocity state vector to describe the uniform motion segments and is augmented with the turn rate to obtain the second model for the maneuvering segments. This paper also gives a general procedure to discretize up to second order any non-linear continuous time model with linear diffusion. Comparative simulations on an air defence scenario with a 2D radar, show that this new approach improves significantly the tracking performance in this case.
Implicit Approaches for Moving Boundaries in a 3-D Cartesian Method
NASA Technical Reports Server (NTRS)
Murman, Scott M.; Aftosmis, Michael J.; Berger, Marsha J.; Kwak, Dochan
2003-01-01
This work considers numerical simulation of three-dimensional flows with time-evolving boundaries. Such problems pose a variety of challenges for numerical schemes, and have received a substantial amount of attention in the recent literature. Since such simulations are unsteady, time-accurate solution of the governing equations is required. In special cases, the body motion can be treated by a uniform rigid motion of the computational domain. For the more general situation of relative-body motion, however, this simplification is unavailable and the simulations require a mechanism for ensuring that the mesh evolves with the moving boundaries. This involves a "remeshing" of the computational domain (either localized or global) at each physical timestep, and places a premium on both the speed and robustness of the remeshing algorithms. This work presents a method which includes unsteady flow simulation, rigid domain motion, and relative body motion using a time-evolving Cartesian grid system in three dimensions.
A Parallel Cartesian Approach for External Aerodynamics of Vehicles with Complex Geometry
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.; Berger, M. J.; Adomavicius, G.
2001-01-01
This workshop paper presents the current status in the development of a new approach for the solution of the Euler equations on Cartesian meshes with embedded boundaries in three dimensions on distributed and shared memory architectures. The approach uses adaptively refined Cartesian hexahedra to fill the computational domain. Where these cells intersect the geometry, they are cut by the boundary into arbitrarily shaped polyhedra which receive special treatment by the solver. The presentation documents a newly developed multilevel upwind solver based on a flexible domain-decomposition strategy. One novel aspect of the work is its use of space-filling curves (SFC) for memory efficient on-the-fly parallelization, dynamic re-partitioning and automatic coarse mesh generation. Within each subdomain the approach employs a variety reordering techniques so that relevant data are on the same page in memory permitting high-performance on cache-based processors. Details of the on-the-fly SFC based partitioning are presented as are construction rules for the automatic coarse mesh generation. After describing the approach, the paper uses model problems and 3- D configurations to both verify and validate the solver. The model problems demonstrate that second-order accuracy is maintained despite the presence of the irregular cut-cells in the mesh. In addition, it examines both parallel efficiency and convergence behavior. These investigations demonstrate a parallel speed-up in excess of 28 on 32 processors of an SGI Origin 2000 system and confirm that mesh partitioning has no effect on convergence behavior.
Neutron star moments of inertia
NASA Technical Reports Server (NTRS)
Ravenhall, D. G.; Pethick, C. J.
1994-01-01
An approximation for the moment of inertia of a neutron star in terms of only its mass and radius is presented, and insight into it is obtained by examining the behavior of the relativistic structural equations. The approximation is accurate to approximately 10% for a variety of nuclear equations of state, for all except very low mass stars. It is combined with information about the neutron-star crust to obtain a simple expression (again in terms only of mass and radius) for the fractional moment of inertia of the crust.
NASA Astrophysics Data System (ADS)
Chen, XinJian
2012-12-01
This paper presents an application of a three-dimensional unstructured Cartesian grid model (Chen, 2011) to a real-world case, namely the Crystal River/Kings Bay system located on the Gulf coast of the Florida peninsula of the United States. Crystal River/Kings Bay is a spring-fed estuarine system which is believed to be the largest natural refuge in the United States for manatees during the coldest days in winter because of the existence of a large amount of discharge out of numerous spring vents at the bottom of Kings Bay. The unstructured Cartesian grid model was used to simulate hydrodynamics, including salinity transport processes and thermodynamics, in the estuary during a 34-month period from April 2007 to February 2010. Although there are some unidentified uncertainties in quantifying flow rates from the spring vents and salinity variations in spring flows, simulated water elevations, salinities, temperatures, and cross-sectional flux all match well or very well with measured real-time field data. This suggests that the unstructured Cartesian grid model can adequately simulate hydrodynamics in a complex shallow water system such as Crystal River/Kings Bay and the numerical theory for the unstructured Cartesian grid model works properly. The successful simulation of hydrodynamics in the estuarine system also suggests that an empirical formula that relates the spring discharge with the water level in Kings Bay and the groundwater level measured in a nearby well is reasonable.
Bahri, A; Bendersky, M; Cohen, F R; Gitler, S
2009-07-28
This article gives a natural decomposition of the suspension of a generalized moment-angle complex or partial product space which arises as the polyhedral product functor described below. The introduction and application of the smash product moment-angle complex provides a precise identification of the stable homotopy type of the values of the polyhedral product functor. One direct consequence is an analysis of the associated cohomology. For the special case of the complements of certain subspace arrangements, the geometrical decomposition implies the homological decomposition in earlier work of others as described below. Because the splitting is geometric, an analogous homological decomposition for a generalized moment-angle complex applies for any homology theory. Implied, therefore, is a decomposition for the Stanley-Reisner ring of a finite simplicial complex, and natural generalizations. PMID:19620727
Automated analysis for scintigraphic evaluation of gastric emptying using invariant moments.
Abutaleb, A; Delalic, Z J; Ech, R; Siegel, J A
1989-01-01
This study introduces a method for automated analysis of the standard solid-meal gastric emptying test. The purpose was to develop a diagnostic tool to characterize more reproducibly abnormalities of solid-phase gastric emptying. The processing of gastric emptying is automated using geometrical moments that are invariant to scaling, rotation, and shift. Twenty subjects were studied. The first step was to obtain images of the stomach using a nuclear gamma camera immediately after the subject had eaten a radio-labeled meal. The second step was to process and analyze the images by a recently developed automated gastric emptying analysis (AGEA) method, which determines the gastric contour and the geometrical properties include such parameters as area, centroid, orientation, and moments of inertia. Statistical tests showed that some of the moments were sensitive to the patient's gastric status (normal versus abnormal). The difference between the normal and abnormal patients became noticeable approximately 1 h after meal ingestion. PMID:18230536