Lanczos algorithm with matrix product states for dynamical correlation functions

NASA Astrophysics Data System (ADS)

Dargel, P. E.; Wöllert, A.; Honecker, A.; McCulloch, I. P.; Schollwöck, U.; Pruschke, T.

2012-05-01

The density-matrix renormalization group (DMRG) algorithm can be adapted to the calculation of dynamical correlation functions in various ways which all represent compromises between computational efficiency and physical accuracy. In this paper we reconsider the oldest approach based on a suitable Lanczos-generated approximate basis and implement it using matrix product states (MPS) for the representation of the basis states. The direct use of matrix product states combined with an ex post reorthogonalization method allows us to avoid several shortcomings of the original approach, namely the multitargeting and the approximate representation of the Hamiltonian inherent in earlier Lanczos-method implementations in the DMRG framework, and to deal with the ghost problem of Lanczos methods, leading to a much better convergence of the spectral weights and poles. We present results for the dynamic spin structure factor of the spin-1/2 antiferromagnetic Heisenberg chain. A comparison to Bethe ansatz results in the thermodynamic limit reveals that the MPS-based Lanczos approach is much more accurate than earlier approaches at minor additional numerical cost.

Projected Hybrid Orbitals: A General QM/MM Method

PubMed Central

2015-01-01

A projected hybrid orbital (PHO) method was described to model the covalent boundary in a hybrid quantum mechanical and molecular mechanical (QM/MM) system. The PHO approach can be used in ab initio wave function theory and in density functional theory with any basis set without introducing system-dependent parameters. In this method, a secondary basis set on the boundary atom is introduced to formulate a set of hybrid atomic orbtials. The primary basis set on the boundary atom used for the QM subsystem is projected onto the secondary basis to yield a representation that provides a good approximation to the electron-withdrawing power of the primary basis set to balance electronic interactions between QM and MM subsystems. The PHO method has been tested on a range of molecules and properties. Comparison with results obtained from QM calculations on the entire system shows that the present PHO method is a robust and balanced QM/MM scheme that preserves the structural and electronic properties of the QM region. PMID:25317748

Nucleon Isovector Pairing in Nuclei: Microscopic Approach, Boson Representation, and Collective Model

NASA Astrophysics Data System (ADS)

Jolos, R. V.; Kartavenko, V. G.; Kolganova, E. A.

2018-03-01

Nucleon pair correlations in atomic nuclei are analyzed within a nuclear microscopic model with residual isovector pairing forces. These are formulated in the boson representation of fermion operators whereby the collective mode of pair excitations can be isolated without restricting the size of the one-particle basis. This method allows one to analyze the fluctuations in the nonsuperfluid phase of nuclear matter, its phase transition to the superfluid phase, and strong pair correlations. The performance of the method is exemplified by numerical results for the nuclei in the vicinity of the doubly magic 56Ni nucleus.

An efficient basis set representation for calculating electrons in molecules

DOE PAGES

Jones, Jeremiah R.; Rouet, Francois -Henry; Lawler, Keith V.; ...

2016-04-27

The method of McCurdy, Baertschy, and Rescigno, is generalised to obtain a straightforward, surprisingly accurate, and scalable numerical representation for calculating the electronic wave functions of molecules. It uses a basis set of product sinc functions arrayed on a Cartesian grid, and yields 1 kcal/mol precision for valence transition energies with a grid resolution of approximately 0.1 bohr. The Coulomb matrix elements are replaced with matrix elements obtained from the kinetic energy operator. A resolution-of-the-identity approximation renders the primitive one- and two-electron matrix elements diagonal; in other words, the Coulomb operator is local with respect to the grid indices. Themore » calculation of contracted two-electron matrix elements among orbitals requires only O( Nlog (N)) multiplication operations, not O( N 4), where N is the number of basis functions; N = n 3 on cubic grids. The representation not only is numerically expedient, but also produces energies and properties superior to those calculated variationally. Absolute energies, absorption cross sections, transition energies, and ionisation potentials are reported for 1- (He +, H + 2), 2- (H 2, He), 10- (CH 4), and 56-electron (C 8H 8) systems.« less

SS-HORSE method for studying resonances

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

Blokhintsev, L. D.; Mazur, A. I.; Mazur, I. A., E-mail: 008043@pnu.edu.ru

A new method for analyzing resonance states based on the Harmonic-Oscillator Representation of Scattering Equations (HORSE) formalism and analytic properties of partial-wave scattering amplitudes is proposed. The method is tested by applying it to the model problem of neutral-particle scattering and can be used to study resonance states on the basis of microscopic calculations performed within various versions of the shell model.

A clustering-based graph Laplacian framework for value function approximation in reinforcement learning.

PubMed

Xu, Xin; Huang, Zhenhua; Graves, Daniel; Pedrycz, Witold

2014-12-01

In order to deal with the sequential decision problems with large or continuous state spaces, feature representation and function approximation have been a major research topic in reinforcement learning (RL). In this paper, a clustering-based graph Laplacian framework is presented for feature representation and value function approximation (VFA) in RL. By making use of clustering-based techniques, that is, K-means clustering or fuzzy C-means clustering, a graph Laplacian is constructed by subsampling in Markov decision processes (MDPs) with continuous state spaces. The basis functions for VFA can be automatically generated from spectral analysis of the graph Laplacian. The clustering-based graph Laplacian is integrated with a class of approximation policy iteration algorithms called representation policy iteration (RPI) for RL in MDPs with continuous state spaces. Simulation and experimental results show that, compared with previous RPI methods, the proposed approach needs fewer sample points to compute an efficient set of basis functions and the learning control performance can be improved for a variety of parameter settings.

LETTER TO THE EDITOR: Two-centre exchange integrals for complex exponent Slater orbitals

NASA Astrophysics Data System (ADS)

Kuang, Jiyun; Lin, C. D.

1996-12-01

The one-dimensional integral representation for the Fourier transform of a two-centre product of B functions (finite linear combinations of Slater orbitals) with real parameters is generalized to include B functions with complex parameters. This one-dimensional integral representation allows for an efficient method of calculating two-centre exchange integrals with plane-wave electronic translational factors (ETF) over Slater orbitals of real/complex exponents. This method is a significant improvement on the previous two-dimensional quadrature method of the integrals. A new basis set of the form 0953-4075/29/24/005/img1 is proposed to improve the description of pseudo-continuum states in the close-coupling treatment of ion - atom collisions.

A combined representation method for use in band structure calculations. 1: Method

NASA Technical Reports Server (NTRS)

Friedli, C.; Ashcroft, N. W.

1975-01-01

A representation was described whose basis levels combine the important physical aspects of a finite set of plane waves with those of a set of Bloch tight-binding levels. The chosen combination has a particularly simple dependence on the wave vector within the Brillouin Zone, and its use in reducing the standard one-electron band structure problem to the usual secular equation has the advantage that the lattice sums involved in the calculation of the matrix elements are actually independent of the wave vector. For systems with complicated crystal structures, for which the Korringa-Kohn-Rostoker (KKR), Augmented-Plane Wave (APW) and Orthogonalized-Plane Wave (OPW) methods are difficult to apply, the present method leads to results with satisfactory accuracy and convergence.

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. I. An efficient and simple linear scaling local MP2 method that uses an intermediate basis of pair natural orbitals

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

Pinski, Peter; Riplinger, Christoph; Neese, Frank, E-mail: evaleev@vt.edu, E-mail: frank.neese@cec.mpg.de

2015-07-21

In this work, a systematic infrastructure is described that formalizes concepts implicit in previous work and greatly simplifies computer implementation of reduced-scaling electronic structure methods. The key concept is sparse representation of tensors using chains of sparse maps between two index sets. Sparse map representation can be viewed as a generalization of compressed sparse row, a common representation of a sparse matrix, to tensor data. By combining few elementary operations on sparse maps (inversion, chaining, intersection, etc.), complex algorithms can be developed, illustrated here by a linear-scaling transformation of three-center Coulomb integrals based on our compact code library that implementsmore » sparse maps and operations on them. The sparsity of the three-center integrals arises from spatial locality of the basis functions and domain density fitting approximation. A novel feature of our approach is the use of differential overlap integrals computed in linear-scaling fashion for screening products of basis functions. Finally, a robust linear scaling domain based local pair natural orbital second-order Möller-Plesset (DLPNO-MP2) method is described based on the sparse map infrastructure that only depends on a minimal number of cutoff parameters that can be systematically tightened to approach 100% of the canonical MP2 correlation energy. With default truncation thresholds, DLPNO-MP2 recovers more than 99.9% of the canonical resolution of the identity MP2 (RI-MP2) energy while still showing a very early crossover with respect to the computational effort. Based on extensive benchmark calculations, relative energies are reproduced with an error of typically <0.2 kcal/mol. The efficiency of the local MP2 (LMP2) method can be drastically improved by carrying out the LMP2 iterations in a basis of pair natural orbitals. While the present work focuses on local electron correlation, it is of much broader applicability to computation with sparse tensors in quantum chemistry and beyond.« less

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. I. An efficient and simple linear scaling local MP2 method that uses an intermediate basis of pair natural orbitals.

PubMed

Pinski, Peter; Riplinger, Christoph; Valeev, Edward F; Neese, Frank

2015-07-21

In this work, a systematic infrastructure is described that formalizes concepts implicit in previous work and greatly simplifies computer implementation of reduced-scaling electronic structure methods. The key concept is sparse representation of tensors using chains of sparse maps between two index sets. Sparse map representation can be viewed as a generalization of compressed sparse row, a common representation of a sparse matrix, to tensor data. By combining few elementary operations on sparse maps (inversion, chaining, intersection, etc.), complex algorithms can be developed, illustrated here by a linear-scaling transformation of three-center Coulomb integrals based on our compact code library that implements sparse maps and operations on them. The sparsity of the three-center integrals arises from spatial locality of the basis functions and domain density fitting approximation. A novel feature of our approach is the use of differential overlap integrals computed in linear-scaling fashion for screening products of basis functions. Finally, a robust linear scaling domain based local pair natural orbital second-order Möller-Plesset (DLPNO-MP2) method is described based on the sparse map infrastructure that only depends on a minimal number of cutoff parameters that can be systematically tightened to approach 100% of the canonical MP2 correlation energy. With default truncation thresholds, DLPNO-MP2 recovers more than 99.9% of the canonical resolution of the identity MP2 (RI-MP2) energy while still showing a very early crossover with respect to the computational effort. Based on extensive benchmark calculations, relative energies are reproduced with an error of typically <0.2 kcal/mol. The efficiency of the local MP2 (LMP2) method can be drastically improved by carrying out the LMP2 iterations in a basis of pair natural orbitals. While the present work focuses on local electron correlation, it is of much broader applicability to computation with sparse tensors in quantum chemistry and beyond.

The quantum dynamics of electronically nonadiabatic chemical reactions

NASA Technical Reports Server (NTRS)

Truhlar, Donald G.

1993-01-01

Considerable progress was achieved on the quantum mechanical treatment of electronically nonadiabatic collisions involving energy transfer and chemical reaction in the collision of an electronically excited atom with a molecule. In the first step, a new diabatic representation for the coupled potential energy surfaces was created. A two-state diabatic representation was developed which was designed to realistically reproduce the two lowest adiabatic states of the valence bond model and also to have the following three desirable features: (1) it is more economical to evaluate; (2) it is more portable; and (3) all spline fits are replaced by analytic functions. The new representation consists of a set of two coupled diabatic potential energy surfaces plus a coupling surface. It is suitable for dynamics calculations on both the electronic quenching and reaction processes in collisions of Na(3p2p) with H2. The new two-state representation was obtained by a three-step process from a modified eight-state diatomics-in-molecules (DIM) representation of Blais. The second step required the development of new dynamical methods. A formalism was developed for treating reactions with very general basis functions including electronically excited states. Our formalism is based on the generalized Newton, scattered wave, and outgoing wave variational principles that were used previously for reactive collisions on a single potential energy surface, and it incorporates three new features: (1) the basis functions include electronic degrees of freedom, as required to treat reactions involving electronic excitation and two or more coupled potential energy surfaces; (2) the primitive electronic basis is assumed to be diabatic, and it is not assumed that it diagonalizes the electronic Hamiltonian even asymptotically; and (3) contracted basis functions for vibrational-rotational-orbital degrees of freedom are included in a very general way, similar to previous prescriptions for locally adiabatic functions in various quantum scattering algorithms.

Bayesian image reconstruction - The pixon and optimal image modeling

NASA Technical Reports Server (NTRS)

Pina, R. K.; Puetter, R. C.

1993-01-01

In this paper we describe the optimal image model, maximum residual likelihood method (OptMRL) for image reconstruction. OptMRL is a Bayesian image reconstruction technique for removing point-spread function blurring. OptMRL uses both a goodness-of-fit criterion (GOF) and an 'image prior', i.e., a function which quantifies the a priori probability of the image. Unlike standard maximum entropy methods, which typically reconstruct the image on the data pixel grid, OptMRL varies the image model in order to find the optimal functional basis with which to represent the image. We show how an optimal basis for image representation can be selected and in doing so, develop the concept of the 'pixon' which is a generalized image cell from which this basis is constructed. By allowing both the image and the image representation to be variable, the OptMRL method greatly increases the volume of solution space over which the image is optimized. Hence the likelihood of the final reconstructed image is greatly increased. For the goodness-of-fit criterion, OptMRL uses the maximum residual likelihood probability distribution introduced previously by Pina and Puetter (1992). This GOF probability distribution, which is based on the spatial autocorrelation of the residuals, has the advantage that it ensures spatially uncorrelated image reconstruction residuals.

The Application of Auto-Disturbance Rejection Control Optimized by Least Squares Support Vector Machines Method and Time-Frequency Representation in Voltage Source Converter-High Voltage Direct Current System.

PubMed

Liu, Ying-Pei; Liang, Hai-Ping; Gao, Zhong-Ke

2015-01-01

In order to improve the performance of voltage source converter-high voltage direct current (VSC-HVDC) system, we propose an improved auto-disturbance rejection control (ADRC) method based on least squares support vector machines (LSSVM) in the rectifier side. Firstly, we deduce the high frequency transient mathematical model of VSC-HVDC system. Then we investigate the ADRC and LSSVM principles. We ignore the tracking differentiator in the ADRC controller aiming to improve the system dynamic response speed. On this basis, we derive the mathematical model of ADRC controller optimized by LSSVM for direct current voltage loop. Finally we carry out simulations to verify the feasibility and effectiveness of our proposed control method. In addition, we employ the time-frequency representation methods, i.e., Wigner-Ville distribution (WVD) and adaptive optimal kernel (AOK) time-frequency representation, to demonstrate our proposed method performs better than the traditional method from the perspective of energy distribution in time and frequency plane.

The Application of Auto-Disturbance Rejection Control Optimized by Least Squares Support Vector Machines Method and Time-Frequency Representation in Voltage Source Converter-High Voltage Direct Current System

PubMed Central

Gao, Zhong-Ke

2015-01-01

In order to improve the performance of voltage source converter-high voltage direct current (VSC-HVDC) system, we propose an improved auto-disturbance rejection control (ADRC) method based on least squares support vector machines (LSSVM) in the rectifier side. Firstly, we deduce the high frequency transient mathematical model of VSC-HVDC system. Then we investigate the ADRC and LSSVM principles. We ignore the tracking differentiator in the ADRC controller aiming to improve the system dynamic response speed. On this basis, we derive the mathematical model of ADRC controller optimized by LSSVM for direct current voltage loop. Finally we carry out simulations to verify the feasibility and effectiveness of our proposed control method. In addition, we employ the time-frequency representation methods, i.e., Wigner-Ville distribution (WVD) and adaptive optimal kernel (AOK) time-frequency representation, to demonstrate our proposed method performs better than the traditional method from the perspective of energy distribution in time and frequency plane. PMID:26098556

Mapped grid methods for long-range molecules and cold collisions

NASA Astrophysics Data System (ADS)

Willner, K.; Dulieu, O.; Masnou-Seeuws, F.

2004-01-01

The paper discusses ways of improving the accuracy of numerical calculations for vibrational levels of diatomic molecules close to the dissociation limit or for ultracold collisions, in the framework of a grid representation. In order to avoid the implementation of very large grids, Kokoouline et al. [J. Chem. Phys. 110, 9865 (1999)] have proposed a mapping procedure through introduction of an adaptive coordinate x subjected to the variation of the local de Broglie wavelength as a function of the internuclear distance R. Some unphysical levels ("ghosts") then appear in the vibrational series computed via a mapped Fourier grid representation. In the present work the choice of the basis set is reexamined, and two alternative expansions are discussed: Sine functions and Hardy functions. It is shown that use of a basis set with fixed nodes at both grid ends is efficient to eliminate "ghost" solutions. It is further shown that the Hamiltonian matrix in the sine basis can be calculated very accurately by using an auxiliary basis of cosine functions, overcoming the problems arising from numerical calculation of the Jacobian J(x) of the R→x coordinate transformation.

Optimal color coding for compression of true color images

NASA Astrophysics Data System (ADS)

Musatenko, Yurij S.; Kurashov, Vitalij N.

1998-11-01

In the paper we present the method that improves lossy compression of the true color or other multispectral images. The essence of the method is to project initial color planes into Karhunen-Loeve (KL) basis that gives completely decorrelated representation for the image and to compress basis functions instead of the planes. To do that the new fast algorithm of true KL basis construction with low memory consumption is suggested and our recently proposed scheme for finding optimal losses of Kl functions while compression is used. Compare to standard JPEG compression of the CMYK images the method provides the PSNR gain from 0.2 to 2 dB for the convenient compression ratios. Experimental results are obtained for high resolution CMYK images. It is demonstrated that presented scheme could work on common hardware.

A Parallel Product-Convolution approach for representing the depth varying Point Spread Functions in 3D widefield microscopy based on principal component analysis.

PubMed

Arigovindan, Muthuvel; Shaevitz, Joshua; McGowan, John; Sedat, John W; Agard, David A

2010-03-29

We address the problem of computational representation of image formation in 3D widefield fluorescence microscopy with depth varying spherical aberrations. We first represent 3D depth-dependent point spread functions (PSFs) as a weighted sum of basis functions that are obtained by principal component analysis (PCA) of experimental data. This representation is then used to derive an approximating structure that compactly expresses the depth variant response as a sum of few depth invariant convolutions pre-multiplied by a set of 1D depth functions, where the convolving functions are the PCA-derived basis functions. The model offers an efficient and convenient trade-off between complexity and accuracy. For a given number of approximating PSFs, the proposed method results in a much better accuracy than the strata based approximation scheme that is currently used in the literature. In addition to yielding better accuracy, the proposed methods automatically eliminate the noise in the measured PSFs.

Comparison of Flux-Surface Aligned Curvilinear Coordinate Systems and Neoclassical Magnetic Field Predictions

NASA Astrophysics Data System (ADS)

Collart, T. G.; Stacey, W. M.

2015-11-01

Several methods are presented for extending the traditional analytic ``circular'' representation of flux-surface aligned curvilinear coordinate systems to more accurately describe equilibrium plasma geometry and magnetic fields in DIII-D. The formalism originally presented by Miller is extended to include different poloidal variations in the upper and lower hemispheres. A coordinate system based on separate Fourier expansions of major radius and vertical position greatly improves accuracy in edge plasma structure representation. Scale factors and basis vectors for a system formed by expanding the circular model minor radius can be represented using linear combinations of Fourier basis functions. A general method for coordinate system orthogonalization is presented and applied to all curvilinear models. A formalism for the magnetic field structure in these curvilinear models is presented, and the resulting magnetic field predictions are compared against calculations performed in a Cartesian system using an experimentally based EFIT prediction for the Grad-Shafranov equilibrium. Supported by: US DOE under DE-FG02-00ER54538.

Cerebral localization in the nineteenth century--the birth of a science and its modern consequences.

PubMed

Steinberg, David A

2009-07-01

Although many individuals contributed to the development of the science of cerebral localization, its conceptual framework is the work of a single man--John Hughlings Jackson (1835-1911), a Victorian physician practicing in London. Hughlings Jackson's formulation of a neurological science consisted of an axiomatic basis, an experimental methodology, and a clinical neurophysiology. His axiom--that the brain is an exclusively sensorimotor machine--separated neurology from psychiatry and established a rigorous and sophisticated structure for the brain and mind. Hughlings Jackson's experimental method utilized the focal lesion as a probe of brain function and created an evolutionary structure of somatotopic representation to explain clinical neurophysiology. His scientific theory of cerebral localization can be described as a weighted ordinal representation. Hughlings Jackson's theory of weighted ordinal representation forms the scientific basis for modern neurology. Though this science is utilized daily by every neurologist and forms the basis of neuroscience, the consequences of Hughlings Jackson's ideas are still not generally appreciated. For example, they imply the intrinsic inconsistency of some modern fields of neuroscience and neurology. Thus, "cognitive imaging" and the "neurology of art"--two topics of modern interest--are fundamentally oxymoronic according to the science of cerebral localization. Neuroscientists, therefore, still have much to learn from John Hughlings Jackson.

Identifying group discriminative and age regressive sub-networks from DTI-based connectivity via a unified framework of non-negative matrix factorization and graph embedding

PubMed Central

Ghanbari, Yasser; Smith, Alex R.; Schultz, Robert T.; Verma, Ragini

2014-01-01

Diffusion tensor imaging (DTI) offers rich insights into the physical characteristics of white matter (WM) fiber tracts and their development in the brain, facilitating a network representation of brain’s traffic pathways. Such a network representation of brain connectivity has provided a novel means of investigating brain changes arising from pathology, development or aging. The high dimensionality of these connectivity networks necessitates the development of methods that identify the connectivity building blocks or sub-network components that characterize the underlying variation in the population. In addition, the projection of the subject networks into the basis set provides a low dimensional representation of it, that teases apart different sources of variation in the sample, facilitating variation-specific statistical analysis. We propose a unified framework of non-negative matrix factorization and graph embedding for learning sub-network patterns of connectivity by their projective non-negative decomposition into a reconstructive basis set, as well as, additional basis sets representing variational sources in the population like age and pathology. The proposed framework is applied to a study of diffusion-based connectivity in subjects with autism that shows localized sparse sub-networks which mostly capture the changes related to pathology and developmental variations. PMID:25037933

Space-time VMS computation of wind-turbine rotor and tower aerodynamics

NASA Astrophysics Data System (ADS)

Takizawa, Kenji; Tezduyar, Tayfun E.; McIntyre, Spenser; Kostov, Nikolay; Kolesar, Ryan; Habluetzel, Casey

2014-01-01

We present the space-time variational multiscale (ST-VMS) computation of wind-turbine rotor and tower aerodynamics. The rotor geometry is that of the NREL 5MW offshore baseline wind turbine. We compute with a given wind speed and a specified rotor speed. The computation is challenging because of the large Reynolds numbers and rotating turbulent flows, and computing the correct torque requires an accurate and meticulous numerical approach. The presence of the tower increases the computational challenge because of the fast, rotational relative motion between the rotor and tower. The ST-VMS method is the residual-based VMS version of the Deforming-Spatial-Domain/Stabilized ST (DSD/SST) method, and is also called "DSD/SST-VMST" method (i.e., the version with the VMS turbulence model). In calculating the stabilization parameters embedded in the method, we are using a new element length definition for the diffusion-dominated limit. The DSD/SST method, which was introduced as a general-purpose moving-mesh method for computation of flows with moving interfaces, requires a mesh update method. Mesh update typically consists of moving the mesh for as long as possible and remeshing as needed. In the computations reported here, NURBS basis functions are used for the temporal representation of the rotor motion, enabling us to represent the circular paths associated with that motion exactly and specify a constant angular velocity corresponding to the invariant speeds along those paths. In addition, temporal NURBS basis functions are used in representation of the motion and deformation of the volume meshes computed and also in remeshing. We name this "ST/NURBS Mesh Update Method (STNMUM)." The STNMUM increases computational efficiency in terms of computer time and storage, and computational flexibility in terms of being able to change the time-step size of the computation. We use layers of thin elements near the blade surfaces, which undergo rigid-body motion with the rotor. We compare the results from computations with and without tower, and we also compare using NURBS and linear finite element basis functions in temporal representation of the mesh motion.

Space-Time VMS Computation of Wind-Turbine Rotor and Tower Aerodynamics

NASA Astrophysics Data System (ADS)

McIntyre, Spenser W.

This thesis is on the space{time variational multiscale (ST-VMS) computation of wind-turbine rotor and tower aerodynamics. The rotor geometry is that of the NREL 5MW offshore baseline wind turbine. We compute with a given wind speed and a specified rotor speed. The computation is challenging because of the large Reynolds numbers and rotating turbulent ows, and computing the correct torque requires an accurate and meticulous numerical approach. The presence of the tower increases the computational challenge because of the fast, rotational relative motion between the rotor and tower. The ST-VMS method is the residual-based VMS version of the Deforming-Spatial-Domain/Stabilized ST (DSD/SST) method, and is also called "DSD/SST-VMST" method (i.e., the version with the VMS turbulence model). In calculating the stabilization parameters embedded in the method, we are using a new element length definition for the diffusion-dominated limit. The DSD/SST method, which was introduced as a general-purpose moving-mesh method for computation of ows with moving interfaces, requires a mesh update method. Mesh update typically consists of moving the mesh for as long as possible and remeshing as needed. In the computations reported here, NURBS basis functions are used for the temporal representation of the rotor motion, enabling us to represent the circular paths associated with that motion exactly and specify a constant angular velocity corresponding to the invariant speeds along those paths. In addition, temporal NURBS basis functions are used in representation of the motion and deformation of the volume meshes computed and also in remeshing. We name this "ST/NURBS Mesh Update Method (STNMUM)." The STNMUM increases computational efficiency in terms of computer time and storage, and computational exibility in terms of being able to change the time-step size of the computation. We use layers of thin elements near the blade surfaces, which undergo rigid-body motion with the rotor. We compare the results from computations with and without tower, and we also compare using NURBS and linear finite element basis functions in temporal representation of the mesh motion.

Birman—Wenzl—Murakami Algebra and Topological Basis

NASA Astrophysics Data System (ADS)

Zhou, Cheng-Cheng; Xue, Kang; Wang, Gang-Cheng; Sun, Chun-Fang; Du, Gui-Jiao

2012-02-01

In this paper, we use entangled states to construct 9 × 9-matrix representations of Temperley—Lieb algebra (TLA), then a family of 9 × 9-matrix representations of Birman—Wenzl—Murakami algebra (BWMA) have been presented. Based on which, three topological basis states have been found. And we apply topological basis states to recast nine-dimensional BWMA into its three-dimensional counterpart. Finally, we find the topological basis states are spin singlet states in special case.

A potential energy surface for the process H2 + H2O yielding H + H + H2O - Ab initio calculations and analytical representation

NASA Technical Reports Server (NTRS)

Schwenke, David W.; Walch, Stephen P.; Taylor, Peter R.

1991-01-01

Extensive ab initio calculations on the ground state potential energy surface of H2 + H2O were performed using a large contracted Gaussian basis set and a high level of correlation treatment. An analytical representation of the potential energy surface was then obtained which reproduces the calculated energies with an overall root-mean-square error of only 0.64 mEh. The analytic representation explicitly includes all nine internal degrees of freedom and is also well behaved as the H2 dissociates; it thus can be used to study collision-induced dissociation or recombination of H2. The strategy used to minimize the number of energy calculations is discussed, as well as other advantages of the present method for determining the analytical representation.

Perception for rugged terrain

NASA Technical Reports Server (NTRS)

Kweon, In SO; Hebert, Martial; Kanade, Takeo

1989-01-01

A three-dimensional perception system for building a geometrical description of rugged terrain environments from range image data is presented with reference to the exploration of the rugged terrain of Mars. An intermediate representation consisting of an elevation map that includes an explicit representation of uncertainty and labeling of the occluded regions is proposed. The locus method used to convert range image to an elevation map is introduced, along with an uncertainty model based on this algorithm. Both the elevation map and the locus method are the basis of a terrain matching algorithm which does not assume any correspondences between range images. The two-stage algorithm consists of a feature-based matching algorithm to compute an initial transform and an iconic terrain matching algorithm to merge multiple range images into a uniform representation. Terrain modeling results on real range images of rugged terrain are presented. The algorithms considered are a fundamental part of the perception system for the Ambler, a legged locomotor.

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

Maiolo, M., E-mail: massimo.maiolo@zhaw.ch; ZHAW, Institut für Angewandte Simulation, Grüental, CH-8820 Wädenswil; Vancheri, A., E-mail: alberto.vancheri@supsi.ch

In this paper, we apply Multiresolution Analysis (MRA) to develop sparse but accurate representations for the Multiscale Coarse-Graining (MSCG) approximation to the many-body potential of mean force. We rigorously framed the MSCG method into MRA so that all the instruments of this theory become available together with a multitude of new basis functions, namely the wavelets. The coarse-grained (CG) force field is hierarchically decomposed at different resolution levels enabling to choose the most appropriate wavelet family for each physical interaction without requiring an a priori knowledge of the details localization. The representation of the CG potential in this new efficientmore » orthonormal basis leads to a compression of the signal information in few large expansion coefficients. The multiresolution property of the wavelet transform allows to isolate and remove the noise from the CG force-field reconstruction by thresholding the basis function coefficients from each frequency band independently. We discuss the implementation of our wavelet-based MSCG approach and demonstrate its accuracy using two different condensed-phase systems, i.e. liquid water and methanol. Simulations of liquid argon have also been performed using a one-to-one mapping between atomistic and CG sites. The latter model allows to verify the accuracy of the method and to test different choices of wavelet families. Furthermore, the results of the computer simulations show that the efficiency and sparsity of the representation of the CG force field can be traced back to the mathematical properties of the chosen family of wavelets. This result is in agreement with what is known from the theory of multiresolution analysis of signals.« less

Hyperspherical Slater determinant approach to few-body fractional quantum Hall states

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

Yan, Bin, E-mail: yanbin@purdue.edu; Wooten, Rachel E.; Daily, Kevin M.

2017-05-15

In a recent study (Daily et al., 2015), a hyperspherical approach has been developed to study few-body fractional quantum Hall states. This method has been successfully applied to the exploration of few boson and fermion problems in the quantum Hall region, as well as the study of inter-Landau level collective excitations (Rittenhouse et al., 2016; Wooten et al., 2016). However, the hyperspherical method as it is normally implemented requires a subsidiary (anti-)symmetrization process, which limits its computational effectiveness. The present work overcomes these difficulties and extends the power of this method by implementing a representation of the hyperspherical many-body basismore » space in terms of Slater determinants of single particle eigenfunctions. A clear connection between the hyperspherical representation and the conventional single particle picture is presented, along with a compact operator representation of the theoretical framework. - Highlights: • A hyperspherical method has been implemented to study the quantum Hall effect. • The hyperspherical many-body basis space is represented with Slater determinants. • Example numerical studies of the 4- and 8-electron systems are presented.« less

Method of transition from 3D model to its ontological representation in aircraft design process

NASA Astrophysics Data System (ADS)

Govorkov, A. S.; Zhilyaev, A. S.; Fokin, I. V.

2018-05-01

This paper proposes the method of transition from a 3D model to its ontological representation and describes its usage in the aircraft design process. The problems of design for manufacturability and design automation are also discussed. The introduced method is to aim to ease the process of data exchange between important aircraft design phases, namely engineering and design control. The method is also intended to increase design speed and 3D model customizability. This requires careful selection of the complex systems (CAD / CAM / CAE / PDM), providing the basis for the integration of design and technological preparation of production and more fully take into account the characteristics of products and processes for their manufacture. It is important to solve this problem, as investment in the automation define the company's competitiveness in the years ahead.

Review of Sparse Representation-Based Classification Methods on EEG Signal Processing for Epilepsy Detection, Brain-Computer Interface and Cognitive Impairment

PubMed Central

Wen, Dong; Jia, Peilei; Lian, Qiusheng; Zhou, Yanhong; Lu, Chengbiao

2016-01-01

At present, the sparse representation-based classification (SRC) has become an important approach in electroencephalograph (EEG) signal analysis, by which the data is sparsely represented on the basis of a fixed dictionary or learned dictionary and classified based on the reconstruction criteria. SRC methods have been used to analyze the EEG signals of epilepsy, cognitive impairment and brain computer interface (BCI), which made rapid progress including the improvement in computational accuracy, efficiency and robustness. However, these methods have deficiencies in real-time performance, generalization ability and the dependence of labeled sample in the analysis of the EEG signals. This mini review described the advantages and disadvantages of the SRC methods in the EEG signal analysis with the expectation that these methods can provide the better tools for analyzing EEG signals. PMID:27458376

A simple procedure for construction of the orthonormal basis vectors of irreducible representations of O(5) in the OT (3) ⊗ON (2) basis

NASA Astrophysics Data System (ADS)

Pan, Feng; Ding, Xiaoxue; Launey, Kristina D.; Draayer, J. P.

2018-06-01

A simple and effective algebraic isospin projection procedure for constructing orthonormal basis vectors of irreducible representations of O (5) ⊃OT (3) ⊗ON (2) from those in the canonical O (5) ⊃ SUΛ (2) ⊗ SUI (2) basis is outlined. The expansion coefficients are components of null space vectors of the projection matrix with four nonzero elements in each row in general. Explicit formulae for evaluating OT (3)-reduced matrix elements of O (5) generators are derived.

System and method for optical fiber based image acquisition suitable for use in turbine engines

DOEpatents

Baleine, Erwan; A V, Varun; Zombo, Paul J.; Varghese, Zubin

2017-05-16

A system and a method for image acquisition suitable for use in a turbine engine are disclosed. Light received from a field of view in an object plane is projected onto an image plane through an optical modulation device and is transferred through an image conduit to a sensor array. The sensor array generates a set of sampled image signals in a sensing basis based on light received from the image conduit. Finally, the sampled image signals are transformed from the sensing basis to a representation basis and a set of estimated image signals are generated therefrom. The estimated image signals are used for reconstructing an image and/or a motion-video of a region of interest within a turbine engine.

Infinite occupation number basis of bosons: Solving a numerical challenge

NASA Astrophysics Data System (ADS)

Geißler, Andreas; Hofstetter, Walter

2017-06-01

In any bosonic lattice system, which is not dominated by local interactions and thus "frozen" in a Mott-type state, numerical methods have to cope with the infinite size of the corresponding Hilbert space even for finite lattice sizes. While it is common practice to restrict the local occupation number basis to Nc lowest occupied states, the presence of a finite condensate fraction requires the complete number basis for an exact representation of the many-body ground state. In this work we present a truncation scheme to account for contributions from higher number states. By simply adding a single coherent-tail state to this common truncation, we demonstrate increased numerical accuracy and the possible increase in numerical efficiency of this method for the Gutzwiller variational wave function and within dynamical mean-field theory.

Image restoration for three-dimensional fluorescence microscopy using an orthonormal basis for efficient representation of depth-variant point-spread functions

PubMed Central

Patwary, Nurmohammed; Preza, Chrysanthe

2015-01-01

A depth-variant (DV) image restoration algorithm for wide field fluorescence microscopy, using an orthonormal basis decomposition of DV point-spread functions (PSFs), is investigated in this study. The efficient PSF representation is based on a previously developed principal component analysis (PCA), which is computationally intensive. We present an approach developed to reduce the number of DV PSFs required for the PCA computation, thereby making the PCA-based approach computationally tractable for thick samples. Restoration results from both synthetic and experimental images show consistency and that the proposed algorithm addresses efficiently depth-induced aberration using a small number of principal components. Comparison of the PCA-based algorithm with a previously-developed strata-based DV restoration algorithm demonstrates that the proposed method improves performance by 50% in terms of accuracy and simultaneously reduces the processing time by 64% using comparable computational resources. PMID:26504634

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

Liakh, Dmitry I

While the formalism of multiresolution analysis (MRA), based on wavelets and adaptive integral representations of operators, is actively progressing in electronic structure theory (mostly on the independent-particle level and, recently, second-order perturbation theory), the concepts of multiresolution and adaptivity can also be utilized within the traditional formulation of correlated (many-particle) theory which is based on second quantization and the corresponding (generally nonorthogonal) tensor algebra. In this paper, we present a formalism called scale-adaptive tensor algebra (SATA) which exploits an adaptive representation of tensors of many-body operators via the local adjustment of the basis set quality. Given a series of locallymore » supported fragment bases of a progressively lower quality, we formulate the explicit rules for tensor algebra operations dealing with adaptively resolved tensor operands. The formalism suggested is expected to enhance the applicability and reliability of local correlated many-body methods of electronic structure theory, especially those directly based on atomic orbitals (or any other localized basis functions).« less

Adaptive Sparse Representation for Source Localization with Gain/Phase Errors

PubMed Central

Sun, Ke; Liu, Yimin; Meng, Huadong; Wang, Xiqin

2011-01-01

Sparse representation (SR) algorithms can be implemented for high-resolution direction of arrival (DOA) estimation. Additionally, SR can effectively separate the coherent signal sources because the spectrum estimation is based on the optimization technique, such as the L1 norm minimization, but not on subspace orthogonality. However, in the actual source localization scenario, an unknown gain/phase error between the array sensors is inevitable. Due to this nonideal factor, the predefined overcomplete basis mismatches the actual array manifold so that the estimation performance is degraded in SR. In this paper, an adaptive SR algorithm is proposed to improve the robustness with respect to the gain/phase error, where the overcomplete basis is dynamically adjusted using multiple snapshots and the sparse solution is adaptively acquired to match with the actual scenario. The simulation results demonstrate the estimation robustness to the gain/phase error using the proposed method. PMID:22163875

The "Primitive Mode of Representation" and the Evolution of Interactive Multimedia.

ERIC Educational Resources Information Center

Plowman, Lydia

1994-01-01

Findings from fieldwork analyzing children's use of four interactive multimedia programs are compared with a description of early film features and used as the basis to consider problems faced by an audience encountering a nascent medium. Methods adopted to facilitate understanding of films and their suitability for adaptation to multimedia…

Method for the Direct Solve of the Many-Body Schrödinger Wave Equation

NASA Astrophysics Data System (ADS)

Jerke, Jonathan; Tymczak, C. J.; Poirier, Bill

We report on theoretical and computational developments towards a computationally efficient direct solve of the many-body Schrödinger wave equation for electronic systems. This methodology relies on two recent developments pioneered by the authors: 1) the development of a Cardinal Sine basis for electronic structure calculations; and 2) the development of a highly efficient and compact representation of multidimensional functions using the Canonical tensor rank representation developed by Belykin et. al. which we have adapted to electronic structure problems. We then show several relevant examples of the utility and accuracy of this methodology, scaling with system size, and relevant convergence issues of the methodology. Method for the Direct Solve of the Many-Body Schrödinger Wave Equation.

Grobner Basis Representations of Sudoku

ERIC Educational Resources Information Center

Taalman, Laura; Arnold, Elizabeth; Lucas, Stephen

2010-01-01

This paper uses Grobner bases to explore the inherent structure of Sudoku puzzles and boards. In particular, we develop three different ways of representing the constraints of Sudoku puzzles with a system of polynomial equations. In one case, we explicitly show how a Grobner basis can be used to obtain a more meaningful representation of the…

A Grobner Basis Solution for Lightning Ground Flash Fraction Retrieval

NASA Technical Reports Server (NTRS)

Solakiewicz, Richard; Attele, Rohan; Koshak, William

2011-01-01

A Bayesian inversion method was previously introduced for retrieving the fraction of ground flashes in a set of flashes observed from a (low earth orbiting or geostationary) satellite lightning imager. The method employed a constrained mixed exponential distribution model to describe the lightning optical measurements. To obtain the optimum model parameters, a scalar function was minimized by a numerical method. In order to improve this optimization, we introduce a Grobner basis solution to obtain analytic representations of the model parameters that serve as a refined initialization scheme to the numerical optimization. Using the Grobner basis, we show that there are exactly 2 solutions involving the first 3 moments of the (exponentially distributed) data. When the mean of the ground flash optical characteristic (e.g., such as the Maximum Group Area, MGA) is larger than that for cloud flashes, then a unique solution can be obtained.

Novel Spectral Representations and Sparsity-Driven Algorithms for Shape Modeling and Analysis

NASA Astrophysics Data System (ADS)

Zhong, Ming

In this dissertation, we focus on extending classical spectral shape analysis by incorporating spectral graph wavelets and sparsity-seeking algorithms. Defined with the graph Laplacian eigenbasis, the spectral graph wavelets are localized both in the vertex domain and graph spectral domain, and thus are very effective in describing local geometry. With a rich dictionary of elementary vectors and forcing certain sparsity constraints, a real life signal can often be well approximated by a very sparse coefficient representation. The many successful applications of sparse signal representation in computer vision and image processing inspire us to explore the idea of employing sparse modeling techniques with dictionary of spectral basis to solve various shape modeling problems. Conventional spectral mesh compression uses the eigenfunctions of mesh Laplacian as shape bases, which are highly inefficient in representing local geometry. To ameliorate, we advocate an innovative approach to 3D mesh compression using spectral graph wavelets as dictionary to encode mesh geometry. The spectral graph wavelets are locally defined at individual vertices and can better capture local shape information than Laplacian eigenbasis. The multi-scale SGWs form a redundant dictionary as shape basis, so we formulate the compression of 3D shape as a sparse approximation problem that can be readily handled by greedy pursuit algorithms. Surface inpainting refers to the completion or recovery of missing shape geometry based on the shape information that is currently available. We devise a new surface inpainting algorithm founded upon the theory and techniques of sparse signal recovery. Instead of estimating the missing geometry directly, our novel method is to find this low-dimensional representation which describes the entire original shape. More specifically, we find that, for many shapes, the vertex coordinate function can be well approximated by a very sparse coefficient representation with respect to the dictionary comprising its Laplacian eigenbasis, and it is then possible to recover this sparse representation from partial measurements of the original shape. Taking advantage of the sparsity cue, we advocate a novel variational approach for surface inpainting, integrating data fidelity constraints on the shape domain with coefficient sparsity constraints on the transformed domain. Because of the powerful properties of Laplacian eigenbasis, the inpainting results of our method tend to be globally coherent with the remaining shape. Informative and discriminative feature descriptors are vital in qualitative and quantitative shape analysis for a large variety of graphics applications. We advocate novel strategies to define generalized, user-specified features on shapes. Our new region descriptors are primarily built upon the coefficients of spectral graph wavelets that are both multi-scale and multi-level in nature, consisting of both local and global information. Based on our novel spectral feature descriptor, we developed a user-specified feature detection framework and a tensor-based shape matching algorithm. Through various experiments, we demonstrate the competitive performance of our proposed methods and the great potential of spectral basis and sparsity-driven methods for shape modeling.

Relation of exact Gaussian basis methods to the dephasing representation: Theory and application to time-resolved electronic spectra

NASA Astrophysics Data System (ADS)

Sulc, Miroslav; Hernandez, Henar; Martinez, Todd J.; Vanicek, Jiri

2014-03-01

We recently showed that the Dephasing Representation (DR) provides an efficient tool for computing ultrafast electronic spectra and that cellularization yields further acceleration [M. Šulc and J. Vaníček, Mol. Phys. 110, 945 (2012)]. Here we focus on increasing its accuracy by first implementing an exact Gaussian basis method (GBM) combining the accuracy of quantum dynamics and efficiency of classical dynamics. The DR is then derived together with ten other methods for computing time-resolved spectra with intermediate accuracy and efficiency. These include the Gaussian DR (GDR), an exact generalization of the DR, in which trajectories are replaced by communicating frozen Gaussians evolving classically with an average Hamiltonian. The methods are tested numerically on time correlation functions and time-resolved stimulated emission spectra in the harmonic potential, pyrazine S0 /S1 model, and quartic oscillator. Both the GBM and the GDR are shown to increase the accuracy of the DR. Surprisingly, in chaotic systems the GDR can outperform the presumably more accurate GBM, in which the two bases evolve separately. This research was supported by the Swiss NSF Grant No. 200021_124936/1 and NCCR Molecular Ultrafast Science & Technology (MUST), and by the EPFL.

Efficient computation of parameter sensitivities of discrete stochastic chemical reaction networks.

PubMed

Rathinam, Muruhan; Sheppard, Patrick W; Khammash, Mustafa

2010-01-21

Parametric sensitivity of biochemical networks is an indispensable tool for studying system robustness properties, estimating network parameters, and identifying targets for drug therapy. For discrete stochastic representations of biochemical networks where Monte Carlo methods are commonly used, sensitivity analysis can be particularly challenging, as accurate finite difference computations of sensitivity require a large number of simulations for both nominal and perturbed values of the parameters. In this paper we introduce the common random number (CRN) method in conjunction with Gillespie's stochastic simulation algorithm, which exploits positive correlations obtained by using CRNs for nominal and perturbed parameters. We also propose a new method called the common reaction path (CRP) method, which uses CRNs together with the random time change representation of discrete state Markov processes due to Kurtz to estimate the sensitivity via a finite difference approximation applied to coupled reaction paths that emerge naturally in this representation. While both methods reduce the variance of the estimator significantly compared to independent random number finite difference implementations, numerical evidence suggests that the CRP method achieves a greater variance reduction. We also provide some theoretical basis for the superior performance of CRP. The improved accuracy of these methods allows for much more efficient sensitivity estimation. In two example systems reported in this work, speedup factors greater than 300 and 10,000 are demonstrated.

Beyond Low-Rank Representations: Orthogonal clustering basis reconstruction with optimized graph structure for multi-view spectral clustering.

PubMed

Wang, Yang; Wu, Lin

2018-07-01

Low-Rank Representation (LRR) is arguably one of the most powerful paradigms for Multi-view spectral clustering, which elegantly encodes the multi-view local graph/manifold structures into an intrinsic low-rank self-expressive data similarity embedded in high-dimensional space, to yield a better graph partition than their single-view counterparts. In this paper we revisit it with a fundamentally different perspective by discovering LRR as essentially a latent clustered orthogonal projection based representation winged with an optimized local graph structure for spectral clustering; each column of the representation is fundamentally a cluster basis orthogonal to others to indicate its members, which intuitively projects the view-specific feature representation to be the one spanned by all orthogonal basis to characterize the cluster structures. Upon this finding, we propose our technique with the following: (1) We decompose LRR into latent clustered orthogonal representation via low-rank matrix factorization, to encode the more flexible cluster structures than LRR over primal data objects; (2) We convert the problem of LRR into that of simultaneously learning orthogonal clustered representation and optimized local graph structure for each view; (3) The learned orthogonal clustered representations and local graph structures enjoy the same magnitude for multi-view, so that the ideal multi-view consensus can be readily achieved. The experiments over multi-view datasets validate its superiority, especially over recent state-of-the-art LRR models. Copyright © 2018 Elsevier Ltd. All rights reserved.

Discrete variable representation in electronic structure theory: quadrature grids for least-squares tensor hypercontraction.

PubMed

Parrish, Robert M; Hohenstein, Edward G; Martínez, Todd J; Sherrill, C David

2013-05-21

We investigate the application of molecular quadratures obtained from either standard Becke-type grids or discrete variable representation (DVR) techniques to the recently developed least-squares tensor hypercontraction (LS-THC) representation of the electron repulsion integral (ERI) tensor. LS-THC uses least-squares fitting to renormalize a two-sided pseudospectral decomposition of the ERI, over a physical-space quadrature grid. While this procedure is technically applicable with any choice of grid, the best efficiency is obtained when the quadrature is tuned to accurately reproduce the overlap metric for quadratic products of the primary orbital basis. Properly selected Becke DFT grids can roughly attain this property. Additionally, we provide algorithms for adopting the DVR techniques of the dynamics community to produce two different classes of grids which approximately attain this property. The simplest algorithm is radial discrete variable representation (R-DVR), which diagonalizes the finite auxiliary-basis representation of the radial coordinate for each atom, and then combines Lebedev-Laikov spherical quadratures and Becke atomic partitioning to produce the full molecular quadrature grid. The other algorithm is full discrete variable representation (F-DVR), which uses approximate simultaneous diagonalization of the finite auxiliary-basis representation of the full position operator to produce non-direct-product quadrature grids. The qualitative features of all three grid classes are discussed, and then the relative efficiencies of these grids are compared in the context of LS-THC-DF-MP2. Coarse Becke grids are found to give essentially the same accuracy and efficiency as R-DVR grids; however, the latter are built from explicit knowledge of the basis set and may guide future development of atom-centered grids. F-DVR is found to provide reasonable accuracy with markedly fewer points than either Becke or R-DVR schemes.

A fractal concentration area method for assigning a color palette for image representation

NASA Astrophysics Data System (ADS)

Cheng, Qiuming; Li, Qingmou

2002-05-01

Displaying the remotely sensed image with a proper color palette is the first task in any kind of image processing and pattern recognition in GIS and image processing environments. The purpose of displaying the image should be not only to provide a visual representation of the variance of the image, although this has been the primary objective of most conventional methods, but also the color palette should reflect real-world features on the ground which must be the primary objective of employing remotely sensed data. Although most conventional methods focus only on the first purpose of image representation, the concentration-area ( C- A plot) fractal method proposed in this paper aims to meet both purposes on the basis of pixel values and pixel value frequency distribution as well as spatial and geometrical properties of image patterns. The C- A method can be used to establish power-law relationships between the area A(⩾ s) with the pixel values greater than s and the pixel value s itself after plotting these values on log-log paper. A number of straight-line segments can be manually or automatically fitted to the points on the log-log paper, each representing a power-law relationship between the area A and the cutoff pixel value for s in a particular range. These straight-line segments can yield a group of cutoff values on the basis of which the image can be classified into discrete classes or zones. These zones usually correspond to the real-world features on the ground. A Windows program has been prepared in ActiveX format for implementing the C- A method and integrating it into other GIS and image processing systems. A case study of Landsat TM band 5 has been used to demonstrate the application of the method and the flexibility of the computer program.

A configuration space of homologous proteins conserving mutual information and allowing a phylogeny inference based on pair-wise Z-score probabilities.

PubMed

Bastien, Olivier; Ortet, Philippe; Roy, Sylvaine; Maréchal, Eric

2005-03-10

Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topology. We have sought a representation of homologous proteins that would conserve the information of pair-wise sequence alignments, respect probabilistic properties of Z-scores (Monte Carlo methods applied to pair-wise comparisons) and be the basis for a novel method of consistent and stable phylogenetic reconstruction. We have built up a spatial representation of protein sequences using concepts from particle physics (configuration space) and respecting a frame of constraints deduced from pair-wise alignment score properties in information theory. The obtained configuration space of homologous proteins (CSHP) allows the representation of real and shuffled sequences, and thereupon an expression of the TULIP theorem for Z-score probabilities. Based on the CSHP, we propose a phylogeny reconstruction using Z-scores. Deduced trees, called TULIP trees, are consistent with multiple-alignment based trees. Furthermore, the TULIP tree reconstruction method provides a solution for some previously reported incongruent results, such as the apicomplexan enolase phylogeny. The CSHP is a unified model that conserves mutual information between proteins in the way physical models conserve energy. Applications include the reconstruction of evolutionary consistent and robust trees, the topology of which is based on a spatial representation that is not reordered after addition or removal of sequences. The CSHP and its assigned phylogenetic topology, provide a powerful and easily updated representation for massive pair-wise genome comparisons based on Z-score computations.

Microstructure Images Restoration of Metallic Materials Based upon KSVD and Smoothing Penalty Sparse Representation Approach.

PubMed

Li, Qing; Liang, Steven Y

2018-04-20

Microstructure images of metallic materials play a significant role in industrial applications. To address image degradation problem of metallic materials, a novel image restoration technique based on K-means singular value decomposition (KSVD) and smoothing penalty sparse representation (SPSR) algorithm is proposed in this work, the microstructure images of aluminum alloy 7075 (AA7075) material are used as examples. To begin with, to reflect the detail structure characteristics of the damaged image, the KSVD dictionary is introduced to substitute the traditional sparse transform basis (TSTB) for sparse representation. Then, due to the image restoration, modeling belongs to a highly underdetermined equation, and traditional sparse reconstruction methods may cause instability and obvious artifacts in the reconstructed images, especially reconstructed image with many smooth regions and the noise level is strong, thus the SPSR (here, q = 0.5) algorithm is designed to reconstruct the damaged image. The results of simulation and two practical cases demonstrate that the proposed method has superior performance compared with some state-of-the-art methods in terms of restoration performance factors and visual quality. Meanwhile, the grain size parameters and grain boundaries of microstructure image are discussed before and after they are restored by proposed method.

Concept Map Engineering: Methods and Tools Based on the Semantic Relation Approach

ERIC Educational Resources Information Center

Kim, Minkyu

2013-01-01

The purpose of this study is to develop a better understanding of technologies that use natural language as the basis for concept map construction. In particular, this study focuses on the semantic relation (SR) approach to drawing rich and authentic concept maps that reflect students' internal representations of a problem situation. The…

Predictors of the Acquisition and Portability of Transferable Skills: A Longitudinal Portuguese Case Study on Education

ERIC Educational Resources Information Center

Rocha, Magda

2015-01-01

The basis for this longitudinal study was to find the predictors of transferable skills acquisition and portability among university sophomore students. The method employed was the path analysis using as variables: (1) the theoretical framework of transferable skills representations (Evers and Rush in "Manag Learn" 27(4):275-300, 1996;…

The best of both Reps—Diabatized Gaussians on adiabatic surfaces

NASA Astrophysics Data System (ADS)

Meek, Garrett A.; Levine, Benjamin G.

2016-11-01

When simulating nonadiabatic molecular dynamics, choosing an electronic representation requires consideration of well-known trade-offs. The uniqueness and spatially local couplings of the adiabatic representation come at the expense of an electronic wave function that changes discontinuously with nuclear motion and associated singularities in the nonadiabatic coupling matrix elements. The quasi-diabatic representation offers a smoothly varying wave function and finite couplings, but identification of a globally well-behaved quasi-diabatic representation is a system-specific challenge. In this work, we introduce the diabatized Gaussians on adiabatic surfaces (DGAS) approximation, a variant of the ab initio multiple spawning (AIMS) method that preserves the advantages of both electronic representations while avoiding their respective pitfalls. The DGAS wave function is expanded in a basis of vibronic functions that are continuous in both electronic and nuclear coordinates, but potentially discontinuous in time. Because the time-dependent Schrödinger equation contains only first-order derivatives with respect to time, singularities in the second-derivative nonadiabatic coupling terms (i.e., diagonal Born-Oppenheimer correction; DBOC) at conical intersections are rigorously absent, though singular time-derivative couplings remain. Interpolation of the electronic wave function allows the accurate prediction of population transfer probabilities even in the presence of the remaining singularities. We compare DGAS calculations of the dynamics of photoexcited ethene to AIMS calculations performed in the adiabatic representation, including the DBOC. The 28 fs excited state lifetime observed in DGAS simulations is considerably shorter than the 50 fs lifetime observed in the adiabatic simulations. The slower decay in the adiabatic representation is attributable to the large, repulsive DBOC in the neighborhood of conical intersections. These repulsive DBOC terms are artifacts of the discontinuities in the individual adiabatic vibronic basis functions and therefore cannot reflect the behavior of the exact molecular wave function, which must be continuous.

A group matrix representation relevant to scales of measurement of clinical disease states via stratified vectors.

PubMed

Sawamura, Jitsuki; Morishita, Shigeru; Ishigooka, Jun

2016-02-09

Previously, we applied basic group theory and related concepts to scales of measurement of clinical disease states and clinical findings (including laboratory data). To gain a more concrete comprehension, we here apply the concept of matrix representation, which was not explicitly exploited in our previous work. Starting with a set of orthonormal vectors, called the basis, an operator Rj (an N-tuple patient disease state at the j-th session) was expressed as a set of stratified vectors representing plural operations on individual components, so as to satisfy the group matrix representation. The stratified vectors containing individual unit operations were combined into one-dimensional square matrices [Rj]s. The [Rj]s meet the matrix representation of a group (ring) as a K-algebra. Using the same-sized matrix of stratified vectors, we can also express changes in the plural set of [Rj]s. The method is demonstrated on simple examples. Despite the incompleteness of our model, the group matrix representation of stratified vectors offers a formal mathematical approach to clinical medicine, aligning it with other branches of natural science.

Dictionary Approaches to Image Compression and Reconstruction

NASA Technical Reports Server (NTRS)

Ziyad, Nigel A.; Gilmore, Erwin T.; Chouikha, Mohamed F.

1998-01-01

This paper proposes using a collection of parameterized waveforms, known as a dictionary, for the purpose of medical image compression. These waveforms, denoted as phi(sub gamma), are discrete time signals, where gamma represents the dictionary index. A dictionary with a collection of these waveforms is typically complete or overcomplete. Given such a dictionary, the goal is to obtain a representation image based on the dictionary. We examine the effectiveness of applying Basis Pursuit (BP), Best Orthogonal Basis (BOB), Matching Pursuits (MP), and the Method of Frames (MOF) methods for the compression of digitized radiological images with a wavelet-packet dictionary. The performance of these algorithms is studied for medical images with and without additive noise.

Dictionary Approaches to Image Compression and Reconstruction

NASA Technical Reports Server (NTRS)

Ziyad, Nigel A.; Gilmore, Erwin T.; Chouikha, Mohamed F.

1998-01-01

This paper proposes using a collection of parameterized waveforms, known as a dictionary, for the purpose of medical image compression. These waveforms, denoted as lambda, are discrete time signals, where y represents the dictionary index. A dictionary with a collection of these waveforms Is typically complete or over complete. Given such a dictionary, the goal is to obtain a representation Image based on the dictionary. We examine the effectiveness of applying Basis Pursuit (BP), Best Orthogonal Basis (BOB), Matching Pursuits (MP), and the Method of Frames (MOF) methods for the compression of digitized radiological images with a wavelet-packet dictionary. The performance of these algorithms is studied for medical images with and without additive noise.

Cognition and procedure representational requirements for predictive human performance models

NASA Technical Reports Server (NTRS)

Corker, K.

1992-01-01

Models and modeling environments for human performance are becoming significant contributors to early system design and analysis procedures. Issues of levels of automation, physical environment, informational environment, and manning requirements are being addressed by such man/machine analysis systems. The research reported here investigates the close interaction between models of human cognition and models that described procedural performance. We describe a methodology for the decomposition of aircrew procedures that supports interaction with models of cognition on the basis of procedures observed; that serves to identify cockpit/avionics information sources and crew information requirements; and that provides the structure to support methods for function allocation among crew and aiding systems. Our approach is to develop an object-oriented, modular, executable software representation of the aircrew, the aircraft, and the procedures necessary to satisfy flight-phase goals. We then encode in a time-based language, taxonomies of the conceptual, relational, and procedural constraints among the cockpit avionics and control system and the aircrew. We have designed and implemented a goals/procedures hierarchic representation sufficient to describe procedural flow in the cockpit. We then execute the procedural representation in simulation software and calculate the values of the flight instruments, aircraft state variables and crew resources using the constraints available from the relationship taxonomies. The system provides a flexible, extensible, manipulative and executable representation of aircrew and procedures that is generally applicable to crew/procedure task-analysis. The representation supports developed methods of intent inference, and is extensible to include issues of information requirements and functional allocation. We are attempting to link the procedural representation to models of cognitive functions to establish several intent inference methods including procedural backtracking with concurrent search, temporal reasoning, and constraint checking for partial ordering of procedures. Finally, the representation is being linked to models of human decision making processes that include heuristic, propositional and prescriptive judgement models that are sensitive to the procedural content in which the valuative functions are being performed.

From Semantics to Syntax and Back Again: Argument Structure in the Third Year of Life

ERIC Educational Resources Information Center

Fernandes, Keith J.; Marcus, Gary F.; Di Nubila, Jennifer A.; Vouloumanos, Athena

2006-01-01

An essential part of the human capacity for language is the ability to link conceptual or semantic representations with syntactic representations. On the basis of data from spontaneous production, Tomasello (2000) suggested that young children acquire such links on a verb-by-verb basis, with little in the way of a general understanding of…

Unfolding energy spectra of double-periodicity two-dimensional systems: Twisted bilayer graphene and MoS2 on graphene

NASA Astrophysics Data System (ADS)

Matsushita, Yu-ichiro; Nishi, Hirofumi; Iwata, Jun-ichi; Kosugi, Taichi; Oshiyama, Atsushi

2018-01-01

We propose an unfolding scheme to analyze energy spectra of complex large-scale systems which are inherently of double periodicity on the basis of the density-functional theory. Applying our method to a twisted bilayer graphene (tBLG) and a stack of monolayer MoS2 on graphene (MoS2/graphene) as examples, we first show that the conventional unfolding scheme in the past using a single primitive-cell representation causes serious problems in analyses of the energy spectra. We then introduce our multispace representation scheme in the unfolding method and clarify its validity. Velocity renormalization of Dirac electrons in tBLG and mini gaps of Dirac cones in MoS2/graphene are elucidated in the present unfolding scheme.

A searching and reporting system for relational databases using a graph-based metadata representation.

PubMed

Hewitt, Robin; Gobbi, Alberto; Lee, Man-Ling

2005-01-01

Relational databases are the current standard for storing and retrieving data in the pharmaceutical and biotech industries. However, retrieving data from a relational database requires specialized knowledge of the database schema and of the SQL query language. At Anadys, we have developed an easy-to-use system for searching and reporting data in a relational database to support our drug discovery project teams. This system is fast and flexible and allows users to access all data without having to write SQL queries. This paper presents the hierarchical, graph-based metadata representation and SQL-construction methods that, together, are the basis of this system's capabilities.

Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

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

Perkó, Zoltán, E-mail: Z.Perko@tudelft.nl; Gilli, Luca, E-mail: Gilli@nrg.eu; Lathouwers, Danny, E-mail: D.Lathouwers@tudelft.nl

2014-03-01

The demand for accurate and computationally affordable sensitivity and uncertainty techniques is constantly on the rise and has become especially pressing in the nuclear field with the shift to Best Estimate Plus Uncertainty methodologies in the licensing of nuclear installations. Besides traditional, already well developed methods – such as first order perturbation theory or Monte Carlo sampling – Polynomial Chaos Expansion (PCE) has been given a growing emphasis in recent years due to its simple application and good performance. This paper presents new developments of the research done at TU Delft on such Polynomial Chaos (PC) techniques. Our work ismore » focused on the Non-Intrusive Spectral Projection (NISP) approach and adaptive methods for building the PCE of responses of interest. Recent efforts resulted in a new adaptive sparse grid algorithm designed for estimating the PC coefficients. The algorithm is based on Gerstner's procedure for calculating multi-dimensional integrals but proves to be computationally significantly cheaper, while at the same it retains a similar accuracy as the original method. More importantly the issue of basis adaptivity has been investigated and two techniques have been implemented for constructing the sparse PCE of quantities of interest. Not using the traditional full PC basis set leads to further reduction in computational time since the high order grids necessary for accurately estimating the near zero expansion coefficients of polynomial basis vectors not needed in the PCE can be excluded from the calculation. Moreover the sparse PC representation of the response is easier to handle when used for sensitivity analysis or uncertainty propagation due to the smaller number of basis vectors. The developed grid and basis adaptive methods have been implemented in Matlab as the Fully Adaptive Non-Intrusive Spectral Projection (FANISP) algorithm and were tested on four analytical problems. These show consistent good performance both in terms of the accuracy of the resulting PC representation of quantities and the computational costs associated with constructing the sparse PCE. Basis adaptivity also seems to make the employment of PC techniques possible for problems with a higher number of input parameters (15–20), alleviating a well known limitation of the traditional approach. The prospect of larger scale applicability and the simplicity of implementation makes such adaptive PC algorithms particularly appealing for the sensitivity and uncertainty analysis of complex systems and legacy codes.« less

Unitary irreducible representations of SL(2,C) in discrete and continuous SU(1,1) bases

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

Conrady, Florian; Hnybida, Jeff; Department of Physics, University of Waterloo, Waterloo, Ontario

2011-01-15

We derive the matrix elements of generators of unitary irreducible representations of SL(2,C) with respect to basis states arising from a decomposition into irreducible representations of SU(1,1). This is done with regard to a discrete basis diagonalized by J{sup 3} and a continuous basis diagonalized by K{sup 1}, and for both the discrete and continuous series of SU(1,1). For completeness, we also treat the more conventional SU(2) decomposition as a fifth case. The derivation proceeds in a functional/differential framework and exploits the fact that state functions and differential operators have a similar structure in all five cases. The states aremore » defined explicitly and related to SU(1,1) and SU(2) matrix elements.« less

Representational analysis of extended disorder in atomistic ensembles derived from total scattering data

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

Neilson, James R.; McQueen, Tyrel M.

With the increased availability of high-intensity time-of-flight neutron and synchrotron X-ray scattering sources that can access wide ranges of momentum transfer, the pair distribution function method has become a standard analysis technique for studying disorder of local coordination spheres and at intermediate atomic separations. In some cases, rational modeling of the total scattering data (Bragg and diffuse) becomes intractable with least-squares approaches, necessitating reverse Monte Carlo simulations using large atomistic ensembles. However, the extraction of meaningful information from the resulting atomistic ensembles is challenging, especially at intermediate length scales. Representational analysis is used here to describe the displacements of atomsmore » in reverse Monte Carlo ensembles from an ideal crystallographic structure in an approach analogous to tight-binding methods. Rewriting the displacements in terms of a local basis that is descriptive of the ideal crystallographic symmetry provides a robust approach to characterizing medium-range order (and disorder) and symmetry breaking in complex and disordered crystalline materials. Lastly, this method enables the extraction of statistically relevant displacement modes (orientation, amplitude and distribution) of the crystalline disorder and provides directly meaningful information in a locally symmetry-adapted basis set that is most descriptive of the crystal chemistry and physics.« less

Representational analysis of extended disorder in atomistic ensembles derived from total scattering data

DOE PAGES

Neilson, James R.; McQueen, Tyrel M.

2015-09-20

With the increased availability of high-intensity time-of-flight neutron and synchrotron X-ray scattering sources that can access wide ranges of momentum transfer, the pair distribution function method has become a standard analysis technique for studying disorder of local coordination spheres and at intermediate atomic separations. In some cases, rational modeling of the total scattering data (Bragg and diffuse) becomes intractable with least-squares approaches, necessitating reverse Monte Carlo simulations using large atomistic ensembles. However, the extraction of meaningful information from the resulting atomistic ensembles is challenging, especially at intermediate length scales. Representational analysis is used here to describe the displacements of atomsmore » in reverse Monte Carlo ensembles from an ideal crystallographic structure in an approach analogous to tight-binding methods. Rewriting the displacements in terms of a local basis that is descriptive of the ideal crystallographic symmetry provides a robust approach to characterizing medium-range order (and disorder) and symmetry breaking in complex and disordered crystalline materials. Lastly, this method enables the extraction of statistically relevant displacement modes (orientation, amplitude and distribution) of the crystalline disorder and provides directly meaningful information in a locally symmetry-adapted basis set that is most descriptive of the crystal chemistry and physics.« less

Improved Classification of Lung Cancer Using Radial Basis Function Neural Network with Affine Transforms of Voss Representation.

PubMed

Adetiba, Emmanuel; Olugbara, Oludayo O

2015-01-01

Lung cancer is one of the diseases responsible for a large number of cancer related death cases worldwide. The recommended standard for screening and early detection of lung cancer is the low dose computed tomography. However, many patients diagnosed die within one year, which makes it essential to find alternative approaches for screening and early detection of lung cancer. We present computational methods that can be implemented in a functional multi-genomic system for classification, screening and early detection of lung cancer victims. Samples of top ten biomarker genes previously reported to have the highest frequency of lung cancer mutations and sequences of normal biomarker genes were respectively collected from the COSMIC and NCBI databases to validate the computational methods. Experiments were performed based on the combinations of Z-curve and tetrahedron affine transforms, Histogram of Oriented Gradient (HOG), Multilayer perceptron and Gaussian Radial Basis Function (RBF) neural networks to obtain an appropriate combination of computational methods to achieve improved classification of lung cancer biomarker genes. Results show that a combination of affine transforms of Voss representation, HOG genomic features and Gaussian RBF neural network perceptibly improves classification accuracy, specificity and sensitivity of lung cancer biomarker genes as well as achieving low mean square error.

Sequential Designs Based on Bayesian Uncertainty Quantification in Sparse Representation Surrogate Modeling

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

Chen, Ray -Bing; Wang, Weichung; Jeff Wu, C. F.

A numerical method, called OBSM, was recently proposed which employs overcomplete basis functions to achieve sparse representations. While the method can handle non-stationary response without the need of inverting large covariance matrices, it lacks the capability to quantify uncertainty in predictions. We address this issue by proposing a Bayesian approach which first imposes a normal prior on the large space of linear coefficients, then applies the MCMC algorithm to generate posterior samples for predictions. From these samples, Bayesian credible intervals can then be obtained to assess prediction uncertainty. A key application for the proposed method is the efficient construction ofmore » sequential designs. Several sequential design procedures with different infill criteria are proposed based on the generated posterior samples. As a result, numerical studies show that the proposed schemes are capable of solving problems of positive point identification, optimization, and surrogate fitting.« less

Sequential Designs Based on Bayesian Uncertainty Quantification in Sparse Representation Surrogate Modeling

DOE PAGES

Chen, Ray -Bing; Wang, Weichung; Jeff Wu, C. F.

2017-04-12

A numerical method, called OBSM, was recently proposed which employs overcomplete basis functions to achieve sparse representations. While the method can handle non-stationary response without the need of inverting large covariance matrices, it lacks the capability to quantify uncertainty in predictions. We address this issue by proposing a Bayesian approach which first imposes a normal prior on the large space of linear coefficients, then applies the MCMC algorithm to generate posterior samples for predictions. From these samples, Bayesian credible intervals can then be obtained to assess prediction uncertainty. A key application for the proposed method is the efficient construction ofmore » sequential designs. Several sequential design procedures with different infill criteria are proposed based on the generated posterior samples. As a result, numerical studies show that the proposed schemes are capable of solving problems of positive point identification, optimization, and surrogate fitting.« less

Divergence-free approach for obtaining decompositions of quantum-optical processes

NASA Astrophysics Data System (ADS)

Sabapathy, K. K.; Ivan, J. S.; García-Patrón, R.; Simon, R.

2018-02-01

Operator-sum representations of quantum channels can be obtained by applying the channel to one subsystem of a maximally entangled state and deploying the channel-state isomorphism. However, for continuous-variable systems, such schemes contain natural divergences since the maximally entangled state is ill defined. We introduce a method that avoids such divergences by utilizing finitely entangled (squeezed) states and then taking the limit of arbitrary large squeezing. Using this method, we derive an operator-sum representation for all single-mode bosonic Gaussian channels where a unique feature is that both quantum-limited and noisy channels are treated on an equal footing. This technique facilitates a proof that the rank-1 Kraus decomposition for Gaussian channels at its respective entanglement-breaking thresholds, obtained in the overcomplete coherent-state basis, is unique. The methods could have applications to simulation of continuous-variable channels.

Why learning and development can lead to poorer recognition memory.

PubMed

Hayes, Brett K; Heit, Evan

2004-08-01

Current models of inductive reasoning in children and adults assume a central role for categorical knowledge. A recent paper by Sloutsky and Fisher challenges this assumption, showing that children are more likely than adults to rely on perceptual similarity as a basis for induction, and introduces a more direct method for examining the representations activated during induction. This method has the potential to constrain models of induction in novel ways, although there are still important challenges.

Two-step superresolution approach for surveillance face image through radial basis function-partial least squares regression and locality-induced sparse representation

NASA Astrophysics Data System (ADS)

Jiang, Junjun; Hu, Ruimin; Han, Zhen; Wang, Zhongyuan; Chen, Jun

2013-10-01

Face superresolution (SR), or face hallucination, refers to the technique of generating a high-resolution (HR) face image from a low-resolution (LR) one with the help of a set of training examples. It aims at transcending the limitations of electronic imaging systems. Applications of face SR include video surveillance, in which the individual of interest is often far from cameras. A two-step method is proposed to infer a high-quality and HR face image from a low-quality and LR observation. First, we establish the nonlinear relationship between LR face images and HR ones, according to radial basis function and partial least squares (RBF-PLS) regression, to transform the LR face into the global face space. Then, a locality-induced sparse representation (LiSR) approach is presented to enhance the local facial details once all the global faces for each LR training face are constructed. A comparison of some state-of-the-art SR methods shows the superiority of the proposed two-step approach, RBF-PLS global face regression followed by LiSR-based local patch reconstruction. Experiments also demonstrate the effectiveness under both simulation conditions and some real conditions.

Classification of multiple sclerosis lesions using adaptive dictionary learning.

PubMed

Deshpande, Hrishikesh; Maurel, Pierre; Barillot, Christian

2015-12-01

This paper presents a sparse representation and an adaptive dictionary learning based method for automated classification of multiple sclerosis (MS) lesions in magnetic resonance (MR) images. Manual delineation of MS lesions is a time-consuming task, requiring neuroradiology experts to analyze huge volume of MR data. This, in addition to the high intra- and inter-observer variability necessitates the requirement of automated MS lesion classification methods. Among many image representation models and classification methods that can be used for such purpose, we investigate the use of sparse modeling. In the recent years, sparse representation has evolved as a tool in modeling data using a few basis elements of an over-complete dictionary and has found applications in many image processing tasks including classification. We propose a supervised classification approach by learning dictionaries specific to the lesions and individual healthy brain tissues, which include white matter (WM), gray matter (GM) and cerebrospinal fluid (CSF). The size of the dictionaries learned for each class plays a major role in data representation but it is an even more crucial element in the case of competitive classification. Our approach adapts the size of the dictionary for each class, depending on the complexity of the underlying data. The algorithm is validated using 52 multi-sequence MR images acquired from 13 MS patients. The results demonstrate the effectiveness of our approach in MS lesion classification. Copyright © 2015 Elsevier Ltd. All rights reserved.

Regularized spherical polar fourier diffusion MRI with optimal dictionary learning.

PubMed

Cheng, Jian; Jiang, Tianzi; Deriche, Rachid; Shen, Dinggang; Yap, Pew-Thian

2013-01-01

Compressed Sensing (CS) takes advantage of signal sparsity or compressibility and allows superb signal reconstruction from relatively few measurements. Based on CS theory, a suitable dictionary for sparse representation of the signal is required. In diffusion MRI (dMRI), CS methods proposed for reconstruction of diffusion-weighted signal and the Ensemble Average Propagator (EAP) utilize two kinds of Dictionary Learning (DL) methods: 1) Discrete Representation DL (DR-DL), and 2) Continuous Representation DL (CR-DL). DR-DL is susceptible to numerical inaccuracy owing to interpolation and regridding errors in a discretized q-space. In this paper, we propose a novel CR-DL approach, called Dictionary Learning - Spherical Polar Fourier Imaging (DL-SPFI) for effective compressed-sensing reconstruction of the q-space diffusion-weighted signal and the EAP. In DL-SPFI, a dictionary that sparsifies the signal is learned from the space of continuous Gaussian diffusion signals. The learned dictionary is then adaptively applied to different voxels using a weighted LASSO framework for robust signal reconstruction. Compared with the start-of-the-art CR-DL and DR-DL methods proposed by Merlet et al. and Bilgic et al., respectively, our work offers the following advantages. First, the learned dictionary is proved to be optimal for Gaussian diffusion signals. Second, to our knowledge, this is the first work to learn a voxel-adaptive dictionary. The importance of the adaptive dictionary in EAP reconstruction will be demonstrated theoretically and empirically. Third, optimization in DL-SPFI is only performed in a small subspace resided by the SPF coefficients, as opposed to the q-space approach utilized by Merlet et al. We experimentally evaluated DL-SPFI with respect to L1-norm regularized SPFI (L1-SPFI), which uses the original SPF basis, and the DR-DL method proposed by Bilgic et al. The experiment results on synthetic and real data indicate that the learned dictionary produces sparser coefficients than the original SPF basis and results in significantly lower reconstruction error than Bilgic et al.'s method.

Utilization of group theory in studies of molecular clusters

NASA Astrophysics Data System (ADS)

Ocak, Mahir E.

The structure of the molecular symmetry group of molecular clusters was analyzed and it is shown that the molecular symmetry group of a molecular cluster can be written as direct products and semidirect products of its subgroups. Symmetry adaptation of basis functions in direct product groups and semidirect product groups was considered in general and the sequential symmetry adaptation procedure which is already known for direct product groups was extended to the case of semidirect product groups. By using the sequential symmetry adaptation procedure a new method for calculating the VRT spectra of molecular clusters which is named as Monomer Basis Representation (MBR) method is developed. In the MBR method, calculations starts with a single monomer with the purpose of obtaining an optimized basis for that monomer as a linear combination of some primitive basis functions. Then, an optimized basis for each identical monomer is generated from the optimized basis of this monomer. By using the optimized bases of the monomers, a basis is generated generated for the solution of the full problem, and the VRT spectra of the cluster is obtained by using this basis. Since an optimized basis is used for each monomer which has a much smaller size than the primitive basis from which the optimized bases are generated, the MBR method leads to an exponential optimization in the size of the basis that is required for the calculations. Application of the MBR method has been illustrated by calculating the VRT spectra of water dimer by using the SAPT-5st potential surface of Groenenboom et al. The rest of the calculations are in good agreement with both the original calculations of Groenenboom et al. and also with the experimental results. Comparing the size of the optimized basis with the size of the primitive basis, it can be said that the method works efficiently. Because of its efficiency, the MBR method can be used for studies of clusters bigger than dimers. Thus, MBR method can be used for studying the many-body terms and for deriving accurate potential surfaces.

Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery.

PubMed

Xie, Qi; Zhao, Qian; Meng, Deyu; Xu, Zongben

2017-08-02

It is well known that the sparsity/low-rank of a vector/matrix can be rationally measured by nonzero-entries-number ($l_0$ norm)/nonzero- singular-values-number (rank), respectively. However, data from real applications are often generated by the interaction of multiple factors, which obviously cannot be sufficiently represented by a vector/matrix, while a high order tensor is expected to provide more faithful representation to deliver the intrinsic structure underlying such data ensembles. Unlike the vector/matrix case, constructing a rational high order sparsity measure for tensor is a relatively harder task. To this aim, in this paper we propose a measure for tensor sparsity, called Kronecker-basis-representation based tensor sparsity measure (KBR briefly), which encodes both sparsity insights delivered by Tucker and CANDECOMP/PARAFAC (CP) low-rank decompositions for a general tensor. Then we study the KBR regularization minimization (KBRM) problem, and design an effective ADMM algorithm for solving it, where each involved parameter can be updated with closed-form equations. Such an efficient solver makes it possible to extend KBR to various tasks like tensor completion and tensor robust principal component analysis. A series of experiments, including multispectral image (MSI) denoising, MSI completion and background subtraction, substantiate the superiority of the proposed methods beyond state-of-the-arts.

Derivation of Rigid Body Analysis Models from Vehicle Architecture Abstractions

DTIC Science & Technology

2011-06-17

models of every type have their basis in some type of physical representation of the design domain. Rather than describing three-dimensional continua of...arrangement, while capturing just enough physical detail to be used as the basis for a meaningful representation of the design , and eventually, analyses that...permit architecture assessment. The design information captured by the abstractions is available at the very earliest stages of the vehicle

Complex noise suppression using a sparse representation and 3D filtering of images

NASA Astrophysics Data System (ADS)

Kravchenko, V. F.; Ponomaryov, V. I.; Pustovoit, V. I.; Palacios-Enriquez, A.

2017-08-01

A novel method for the filtering of images corrupted by complex noise composed of randomly distributed impulses and additive Gaussian noise has been substantiated for the first time. The method consists of three main stages: the detection and filtering of pixels corrupted by impulsive noise, the subsequent image processing to suppress the additive noise based on 3D filtering and a sparse representation of signals in a basis of wavelets, and the concluding image processing procedure to clean the final image of the errors emerged at the previous stages. A physical interpretation of the filtering method under complex noise conditions is given. A filtering block diagram has been developed in accordance with the novel approach. Simulations of the novel image filtering method have shown an advantage of the proposed filtering scheme in terms of generally recognized criteria, such as the structural similarity index measure and the peak signal-to-noise ratio, and when visually comparing the filtered images.

Spectral properties from Matsubara Green's function approach: Application to molecules

NASA Astrophysics Data System (ADS)

Schüler, M.; Pavlyukh, Y.

2018-03-01

We present results for many-body perturbation theory for the one-body Green's function at finite temperatures using the Matsubara formalism. Our method relies on the accurate representation of the single-particle states in standard Gaussian basis sets, allowing to efficiently compute, among other observables, quasiparticle energies and Dyson orbitals of atoms and molecules. In particular, we challenge the second-order treatment of the Coulomb interaction by benchmarking its accuracy for a well-established test set of small molecules, which includes also systems where the usual Hartree-Fock treatment encounters difficulties. We discuss different schemes how to extract quasiparticle properties and assess their range of applicability. With an accurate solution and compact representation, our method is an ideal starting point to study electron dynamics in time-resolved experiments by the propagation of the Kadanoff-Baym equations.

Microstructure Images Restoration of Metallic Materials Based upon KSVD and Smoothing Penalty Sparse Representation Approach

PubMed Central

Liang, Steven Y.

2018-01-01

Microstructure images of metallic materials play a significant role in industrial applications. To address image degradation problem of metallic materials, a novel image restoration technique based on K-means singular value decomposition (KSVD) and smoothing penalty sparse representation (SPSR) algorithm is proposed in this work, the microstructure images of aluminum alloy 7075 (AA7075) material are used as examples. To begin with, to reflect the detail structure characteristics of the damaged image, the KSVD dictionary is introduced to substitute the traditional sparse transform basis (TSTB) for sparse representation. Then, due to the image restoration, modeling belongs to a highly underdetermined equation, and traditional sparse reconstruction methods may cause instability and obvious artifacts in the reconstructed images, especially reconstructed image with many smooth regions and the noise level is strong, thus the SPSR (here, q = 0.5) algorithm is designed to reconstruct the damaged image. The results of simulation and two practical cases demonstrate that the proposed method has superior performance compared with some state-of-the-art methods in terms of restoration performance factors and visual quality. Meanwhile, the grain size parameters and grain boundaries of microstructure image are discussed before and after they are restored by proposed method. PMID:29677163

Distributed representations in memory: Insights from functional brain imaging

PubMed Central

Rissman, Jesse; Wagner, Anthony D.

2015-01-01

Forging new memories for facts and events, holding critical details in mind on a moment-to-moment basis, and retrieving knowledge in the service of current goals all depend on a complex interplay between neural ensembles throughout the brain. Over the past decade, researchers have increasingly leveraged powerful analytical tools (e.g., multi-voxel pattern analysis) to decode the information represented within distributed fMRI activity patterns. In this review, we discuss how these methods can sensitively index neural representations of perceptual and semantic content, and how leverage on the engagement of distributed representations provides unique insights into distinct aspects of memory-guided behavior. We emphasize that, in addition to characterizing the contents of memories, analyses of distributed patterns shed light on the processes that influence how information is encoded, maintained, or retrieved, and thus inform memory theory. We conclude by highlighting open questions about memory that can be addressed through distributed pattern analyses. PMID:21943171

Finite basis representations with nondirect product basis functions having structure similar to that of spherical harmonics.

PubMed

Czakó, Gábor; Szalay, Viktor; Császár, Attila G

2006-01-07

The currently most efficient finite basis representation (FBR) method [Corey et al., in Numerical Grid Methods and Their Applications to Schrodinger Equation, NATO ASI Series C, edited by C. Cerjan (Kluwer Academic, New York, 1993), Vol. 412, p. 1; Bramley et al., J. Chem. Phys. 100, 6175 (1994)] designed specifically to deal with nondirect product bases of structures phi(n) (l)(s)f(l)(u), chi(m) (l)(t)phi(n) (l)(s)f(l)(u), etc., employs very special l-independent grids and results in a symmetric FBR. While highly efficient, this method is not general enough. For instance, it cannot deal with nondirect product bases of the above structure efficiently if the functions phi(n) (l)(s) [and/or chi(m) (l)(t)] are discrete variable representation (DVR) functions of the infinite type. The optimal-generalized FBR(DVR) method [V. Szalay, J. Chem. Phys. 105, 6940 (1996)] is designed to deal with general, i.e., direct and/or nondirect product, bases and grids. This robust method, however, is too general, and its direct application can result in inefficient computer codes [Czako et al., J. Chem. Phys. 122, 024101 (2005)]. It is shown here how the optimal-generalized FBR method can be simplified in the case of nondirect product bases of structures phi(n) (l)(s)f(l)(u), chi(m) (l)(t)phi(n) (l)(s)f(l)(u), etc. As a result the commonly used symmetric FBR is recovered and simplified nonsymmetric FBRs utilizing very special l-dependent grids are obtained. The nonsymmetric FBRs are more general than the symmetric FBR in that they can be employed efficiently even when the functions phi(n) (l)(s) [and/or chi(m) (l)(t)] are DVR functions of the infinite type. Arithmetic operation counts and a simple numerical example presented show unambiguously that setting up the Hamiltonian matrix requires significantly less computer time when using one of the proposed nonsymmetric FBRs than that in the symmetric FBR. Therefore, application of this nonsymmetric FBR is more efficient than that of the symmetric FBR when one wants to diagonalize the Hamiltonian matrix either by a direct or via a basis-set contraction method. Enormous decrease of computer time can be achieved, with respect to a direct application of the optimal-generalized FBR, by employing one of the simplified nonsymmetric FBRs as is demonstrated in noniterative calculations of the low-lying vibrational energy levels of the H3+ molecular ion. The arithmetic operation counts of the Hamiltonian matrix vector products and the properties of a recently developed diagonalization method [Andreozzi et al., J. Phys. A Math. Gen. 35, L61 (2002)] suggest that the nonsymmetric FBR applied along with this particular diagonalization method is suitable to large scale iterative calculations. Whether or not the nonsymmetric FBR is competitive with the symmetric FBR in large-scale iterative calculations still has to be investigated numerically.

The role of figure-ground segregation in change blindness.

PubMed

Landman, Rogier; Spekreijse, Henk; Lamme, Victor A F

2004-04-01

Partial report methods have shown that a large-capacity representation exists for a few hundred milliseconds after a picture has disappeared. However, change blindness studies indicate that very limited information remains available when a changed version of the image is presented subsequently. What happens to the large-capacity representation? New input after the first image may interfere, but this is likely to depend on the characteristics of the new input. In our first experiment, we show that a display containing homogeneous image elements between changing images does not render the large-capacity representation unavailable. Interference occurs when these new elements define objects. On that basis we introduce a new method to produce change blindness: The second experiment shows that change blindness can be induced by redefining figure and background, without an interval between the displays. The local features (line segments) that defined figures and background were swapped, while the contours of the figures remained where they were. Normally, changes are easily detected when there is no interval. However, our paradigm results in massive change blindness. We propose that in a change blindness experiment, there is a large-capacity representation of the original image when it is followed by a homogeneous interval display, but that change blindness occurs whenever the changed image forces resegregation of figures from the background.

Social representations of the health care of the Mbyá-Guarani indigenous population by health workers 1

PubMed Central

Falkenberg, Mirian Benites; Shimizu, Helena Eri; Bermudez, Ximena Pamela Díaz

2017-01-01

ABSTRACT Objective: to analyze the social representations of health care of the Mbyá-Guarani ethnic group by multidisciplinary teams from the Special Indigenous Health District in the south coast of Rio Grande do Sul state (Distrito Sanitário Especial Indígena Litoral Sul do Rio Grande do Sul), Brazil. Method: a qualitative method based on the theory of social representations was used. Data were collected via semi-structured interviews with 20 health workers and by participant observation. The interviews were analyzed with ALCESTE software, which conducts a lexical content analysis using quantitative techniques for the treatment of textual data. Results: there were disagreements in the health care concepts and practices between traditional medicine and biomedicine; however, some progress has been achieved in the area of intermedicality. The ethnic boundaries established between health workers and indigenous peoples based on their representations of culture and family, together with the lack of infrastructure and organization of health actions, are perceived as factors that hinder health care in an intercultural context. Conclusion: a new basis for the process of indigenous health care needs to be established by understanding the needs identified and by agreement among individuals, groups, and health professionals via intercultural exchange. PMID:28177056

A generalized algorithm to design finite field normal basis multipliers

NASA Technical Reports Server (NTRS)

Wang, C. C.

1986-01-01

Finite field arithmetic logic is central in the implementation of some error-correcting coders and some cryptographic devices. There is a need for good multiplication algorithms which can be easily realized. Massey and Omura recently developed a new multiplication algorithm for finite fields based on a normal basis representation. Using the normal basis representation, the design of the finite field multiplier is simple and regular. The fundamental design of the Massey-Omura multiplier is based on a design of a product function. In this article, a generalized algorithm to locate a normal basis in a field is first presented. Using this normal basis, an algorithm to construct the product function is then developed. This design does not depend on particular characteristics of the generator polynomial of the field.

Spectral properties of minimal-basis-set orbitals: Implications for molecular electronic continuum states

NASA Astrophysics Data System (ADS)

Langhoff, P. W.; Winstead, C. L.

Early studies of the electronically excited states of molecules by John A. Pople and coworkers employing ab initio single-excitation configuration interaction (SECI) calculations helped to simulate related applications of these methods to the partial-channel photoionization cross sections of polyatomic molecules. The Gaussian representations of molecular orbitals adopted by Pople and coworkers can describe SECI continuum states when sufficiently large basis sets are employed. Minimal-basis virtual Fock orbitals stabilized in the continuous portions of such SECI spectra are generally associated with strong photoionization resonances. The spectral attributes of these resonance orbitals are illustrated here by revisiting previously reported experimental and theoretical studies of molecular formaldehyde (H2CO) in combination with recently calculated continuum orbital amplitudes.

An object programming based environment for protein secondary structure prediction.

PubMed

Giacomini, M; Ruggiero, C; Sacile, R

1996-01-01

The most frequently used methods for protein secondary structure prediction are empirical statistical methods and rule based methods. A consensus system based on object-oriented programming is presented, which integrates the two approaches with the aim of improving the prediction quality. This system uses an object-oriented knowledge representation based on the concepts of conformation, residue and protein, where the conformation class is the basis, the residue class derives from it and the protein class derives from the residue class. The system has been tested with satisfactory results on several proteins of the Brookhaven Protein Data Bank. Its results have been compared with the results of the most widely used prediction methods, and they show a higher prediction capability and greater stability. Moreover, the system itself provides an index of the reliability of its current prediction. This system can also be regarded as a basis structure for programs of this kind.

Representation of Students in Solving Simultaneous Linear Equation Problems Based on Multiple Intelligence

NASA Astrophysics Data System (ADS)

Yanti, Y. R.; Amin, S. M.; Sulaiman, R.

2018-01-01

This study described representation of students who have musical, logical-mathematic and naturalist intelligence in solving a problem. Subjects were selected on the basis of multiple intelligence tests (TPM) consists of 108 statements, with 102 statements adopted from Chislet and Chapman and 6 statements equal to eksistensial intelligences. Data were analyzed based on problem-solving tests (TPM) and interviewing. See the validity of the data then problem-solving tests (TPM) and interviewing is given twice with an analyzed using the representation indikator and the problem solving step. The results showed that: the stage of presenting information known, stage of devising a plan, and stage of carrying out the plan those three subjects were using same form of representation. While he stage of presenting information asked and stage of looking back, subject of logical-mathematic was using different forms of representation with subjects of musical and naturalist intelligence. From this research is expected to provide input to the teacher in determining the learning strategy that will be used by considering the representation of students with the basis of multiple intelligences.

A new basis set for molecular bending degrees of freedom.

PubMed

Jutier, Laurent

2010-07-21

We present a new basis set as an alternative to Legendre polynomials for the variational treatment of bending vibrational degrees of freedom in order to highly reduce the number of basis functions. This basis set is inspired from the harmonic oscillator eigenfunctions but is defined for a bending angle in the range theta in [0:pi]. The aim is to bring the basis functions closer to the final (ro)vibronic wave functions nature. Our methodology is extended to complicated potential energy surfaces, such as quasilinearity or multiequilibrium geometries, by using several free parameters in the basis functions. These parameters allow several density maxima, linear or not, around which the basis functions will be mainly located. Divergences at linearity in integral computations are resolved as generalized Legendre polynomials. All integral computations required for the evaluation of molecular Hamiltonian matrix elements are given for both discrete variable representation and finite basis representation. Convergence tests for the low energy vibronic states of HCCH(++), HCCH(+), and HCCS are presented.

Functional Parallel Factor Analysis for Functions of One- and Two-dimensional Arguments.

PubMed

Choi, Ji Yeh; Hwang, Heungsun; Timmerman, Marieke E

2018-03-01

Parallel factor analysis (PARAFAC) is a useful multivariate method for decomposing three-way data that consist of three different types of entities simultaneously. This method estimates trilinear components, each of which is a low-dimensional representation of a set of entities, often called a mode, to explain the maximum variance of the data. Functional PARAFAC permits the entities in different modes to be smooth functions or curves, varying over a continuum, rather than a collection of unconnected responses. The existing functional PARAFAC methods handle functions of a one-dimensional argument (e.g., time) only. In this paper, we propose a new extension of functional PARAFAC for handling three-way data whose responses are sequenced along both a two-dimensional domain (e.g., a plane with x- and y-axis coordinates) and a one-dimensional argument. Technically, the proposed method combines PARAFAC with basis function expansion approximations, using a set of piecewise quadratic finite element basis functions for estimating two-dimensional smooth functions and a set of one-dimensional basis functions for estimating one-dimensional smooth functions. In a simulation study, the proposed method appeared to outperform the conventional PARAFAC. We apply the method to EEG data to demonstrate its empirical usefulness.

Linking Passive and Active Representation: A Review of the Literature and a Model for Testing the Linkage for Women Representatives.

ERIC Educational Resources Information Center

Robinson, Ted P.; And Others

Most research efforts concerning minority politics have focused on descriptive representation, which emphasizes (1) counting the minority or female persons in office, and (2) explaining representative levels on the basis of political, social and economic determinants. Descriptive representation, however, is passive and focuses on "being something"…

A Cross-Talk between Brain-Damage Patients and Infants on Action and Language

ERIC Educational Resources Information Center

Papeo, Liuba; Hochmann, Jean-Remy

2012-01-01

Sensorimotor representations in the brain encode the sensory and motor aspects of one's own bodily activity. It is highly debated whether sensorimotor representations are the core basis for the representation of action-related knowledge and, in particular, action words, such as verbs. In this review, we will address this question by bringing to…

A novel structured dictionary for fast processing of 3D medical images, with application to computed tomography restoration and denoising

NASA Astrophysics Data System (ADS)

Karimi, Davood; Ward, Rabab K.

2016-03-01

Sparse representation of signals in learned overcomplete dictionaries has proven to be a powerful tool with applications in denoising, restoration, compression, reconstruction, and more. Recent research has shown that learned overcomplete dictionaries can lead to better results than analytical dictionaries such as wavelets in almost all image processing applications. However, a major disadvantage of these dictionaries is that their learning and usage is very computationally intensive. In particular, finding the sparse representation of a signal in these dictionaries requires solving an optimization problem that leads to very long computational times, especially in 3D image processing. Moreover, the sparse representation found by greedy algorithms is usually sub-optimal. In this paper, we propose a novel two-level dictionary structure that improves the performance and the speed of standard greedy sparse coding methods. The first (i.e., the top) level in our dictionary is a fixed orthonormal basis, whereas the second level includes the atoms that are learned from the training data. We explain how such a dictionary can be learned from the training data and how the sparse representation of a new signal in this dictionary can be computed. As an application, we use the proposed dictionary structure for removing the noise and artifacts in 3D computed tomography (CT) images. Our experiments with real CT images show that the proposed method achieves results that are comparable with standard dictionary-based methods while substantially reducing the computational time.

Spectral resolution of SU(3)-invariant solutions of the Yang-Baxter equation

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

Alishauskas, S.I.; Kulish, P.P.

1986-11-20

The spectral resolution of invariant R-matrices is computed on the basis of solution of the defining equation. Multiple representations in the Clebsch-Gordon series are considered by means of the classifying operator A: a linear combination of known operators of third and fourth degrees in the group generators. The matrix elements of A in a nonorthonormal basis are found. Explicit expressions are presented for the spectral resolutions for a number of representations.

Spectral resolution of SU(3)-invariant solutions of the Yang-Baxter equation

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

Alishavskas, S.I.; Kulish, P.P.

1986-11-01

The spectral resolution of invariant R-matrices is computed on the basis of solution of the defining equation. Multiple representations in the Clebsch-Gordon series are considered by means of the classifying operator A: a linear combination of known operators of third and fourth degrees in the group generators. The matrix elements of A in a nonorthonormal basis are found. Explicit expressions are presented for the spectral resolutions for a number of representations.

Simple adaptive sparse representation based classification schemes for EEG based brain-computer interface applications.

PubMed

Shin, Younghak; Lee, Seungchan; Ahn, Minkyu; Cho, Hohyun; Jun, Sung Chan; Lee, Heung-No

2015-11-01

One of the main problems related to electroencephalogram (EEG) based brain-computer interface (BCI) systems is the non-stationarity of the underlying EEG signals. This results in the deterioration of the classification performance during experimental sessions. Therefore, adaptive classification techniques are required for EEG based BCI applications. In this paper, we propose simple adaptive sparse representation based classification (SRC) schemes. Supervised and unsupervised dictionary update techniques for new test data and a dictionary modification method by using the incoherence measure of the training data are investigated. The proposed methods are very simple and additional computation for the re-training of the classifier is not needed. The proposed adaptive SRC schemes are evaluated using two BCI experimental datasets. The proposed methods are assessed by comparing classification results with the conventional SRC and other adaptive classification methods. On the basis of the results, we find that the proposed adaptive schemes show relatively improved classification accuracy as compared to conventional methods without requiring additional computation. Copyright © 2015 Elsevier Ltd. All rights reserved.

Estimation of the Thermal Process in the Honeycomb Panel by a Monte Carlo Method

NASA Astrophysics Data System (ADS)

Gusev, S. A.; Nikolaev, V. N.

2018-01-01

A new Monte Carlo method for estimating the thermal state of the heat insulation containing honeycomb panels is proposed in the paper. The heat transfer in the honeycomb panel is described by a boundary value problem for a parabolic equation with discontinuous diffusion coefficient and boundary conditions of the third kind. To obtain an approximate solution, it is proposed to use the smoothing of the diffusion coefficient. After that, the obtained problem is solved on the basis of the probability representation. The probability representation is the expectation of the functional of the diffusion process corresponding to the boundary value problem. The process of solving the problem is reduced to numerical statistical modelling of a large number of trajectories of the diffusion process corresponding to the parabolic problem. It was used earlier the Euler method for this object, but that requires a large computational effort. In this paper the method is modified by using combination of the Euler and the random walk on moving spheres methods. The new approach allows us to significantly reduce the computation costs.

Relationships between magnitude representation, counting and memory in 4- to 7-year-old children: A developmental study

PubMed Central

2010-01-01

Background The development of an evolutionarily grounded analogue magnitude representation linked to the parietal lobes is frequently thought to be a major factor in the arithmetic development of humans. We investigated the relationship between counting and the development of magnitude representation in children, assessing also children's knowledge of number symbols, their arithmetic fact retrieval, their verbal skills, and their numerical and verbal short-term memory. Methods The magnitude representation was tested by a non-symbolic magnitude comparison task. We have perfected previous experimental designs measuring magnitude discrimination skills in 65 children kindergarten (4-7-year-olds) by controlling for several variables which were not controlled for in previous similar research. We also used a large number of trials which allowed for running a full factorial ANOVA including all relevant factors. Tests of verbal counting, of short term memory, of number knowledge, of problem solving abilities and of verbal fluency were administered and correlated with performance in the magnitude comparison task. Results and discussion Verbal counting knowledge and performance on simple arithmetic tests did not correlate with non-symbolic magnitude comparison at any age. Older children performed successfully on the number comparison task, showing behavioural patterns consistent with an analogue magnitude representation. In contrast, 4-year-olds were unable to discriminate number independently of task-irrelevant perceptual variables. Sensitivity to irrelevant perceptual features of the magnitude discrimination task was also affected by age, and correlated with memory, suggesting that more general cognitive abilities may play a role in performance in magnitude comparison tasks. Conclusion We conclude that young children are not able to discriminate numerical magnitudes when co-varying physical magnitudes are methodically pitted against number. We propose, along with others, that a rather domain general magnitude representation provides the later basis for a specialized representation of numerical magnitudes. For this representational specialization, the acquisition of the concept of abstract numbers, together with the development of other cognitive abilities, is indispensable. PMID:20167066

Synthesis of atmospheric turbulence point spread functions by sparse and redundant representations

NASA Astrophysics Data System (ADS)

Hunt, Bobby R.; Iler, Amber L.; Bailey, Christopher A.; Rucci, Michael A.

2018-02-01

Atmospheric turbulence is a fundamental problem in imaging through long slant ranges, horizontal-range paths, or uplooking astronomical cases through the atmosphere. An essential characterization of atmospheric turbulence is the point spread function (PSF). Turbulence images can be simulated to study basic questions, such as image quality and image restoration, by synthesizing PSFs of desired properties. In this paper, we report on a method to synthesize PSFs of atmospheric turbulence. The method uses recent developments in sparse and redundant representations. From a training set of measured atmospheric PSFs, we construct a dictionary of "basis functions" that characterize the atmospheric turbulence PSFs. A PSF can be synthesized from this dictionary by a properly weighted combination of dictionary elements. We disclose an algorithm to synthesize PSFs from the dictionary. The algorithm can synthesize PSFs in three orders of magnitude less computing time than conventional wave optics propagation methods. The resulting PSFs are also shown to be statistically representative of the turbulence conditions that were used to construct the dictionary.

Sparsity based target detection for compressive spectral imagery

NASA Astrophysics Data System (ADS)

Boada, David Alberto; Arguello Fuentes, Henry

2016-09-01

Hyperspectral imagery provides significant information about the spectral characteristics of objects and materials present in a scene. It enables object and feature detection, classification, or identification based on the acquired spectral characteristics. However, it relies on sophisticated acquisition and data processing systems able to acquire, process, store, and transmit hundreds or thousands of image bands from a given area of interest which demands enormous computational resources in terms of storage, computationm, and I/O throughputs. Specialized optical architectures have been developed for the compressed acquisition of spectral images using a reduced set of coded measurements contrary to traditional architectures that need a complete set of measurements of the data cube for image acquisition, dealing with the storage and acquisition limitations. Despite this improvement, if any processing is desired, the image has to be reconstructed by an inverse algorithm in order to be processed, which is also an expensive task. In this paper, a sparsity-based algorithm for target detection in compressed spectral images is presented. Specifically, the target detection model adapts a sparsity-based target detector to work in a compressive domain, modifying the sparse representation basis in the compressive sensing problem by means of over-complete training dictionaries and a wavelet basis representation. Simulations show that the presented method can achieve even better detection results than the state of the art methods.

Geometric and computer-aided spline hob modeling

NASA Astrophysics Data System (ADS)

Brailov, I. G.; Myasoedova, T. M.; Panchuk, K. L.; Krysova, I. V.; Rogoza, YU A.

2018-03-01

The paper considers acquiring the spline hob geometric model. The objective of the research is the development of a mathematical model of spline hob for spline shaft machining. The structure of the spline hob is described taking into consideration the motion in parameters of the machine tool system of cutting edge positioning and orientation. Computer-aided study is performed with the use of CAD and on the basis of 3D modeling methods. Vector representation of cutting edge geometry is accepted as the principal method of spline hob mathematical model development. The paper defines the correlations described by parametric vector functions representing helical cutting edges designed for spline shaft machining with consideration for helical movement in two dimensions. An application for acquiring the 3D model of spline hob is developed on the basis of AutoLISP for AutoCAD environment. The application presents the opportunity for the use of the acquired model for milling process imitation. An example of evaluation, analytical representation and computer modeling of the proposed geometrical model is reviewed. In the mentioned example, a calculation of key spline hob parameters assuring the capability of hobbing a spline shaft of standard design is performed. The polygonal and solid spline hob 3D models are acquired by the use of imitational computer modeling.

Neural basis for dynamic updating of object representation in visual working memory.

PubMed

Takahama, Sachiko; Miyauchi, Satoru; Saiki, Jun

2010-02-15

In real world, objects have multiple features and change dynamically. Thus, object representations must satisfy dynamic updating and feature binding. Previous studies have investigated the neural activity of dynamic updating or feature binding alone, but not both simultaneously. We investigated the neural basis of feature-bound object representation in a dynamically updating situation by conducting a multiple object permanence tracking task, which required observers to simultaneously process both the maintenance and dynamic updating of feature-bound objects. Using an event-related design, we separated activities during memory maintenance and change detection. In the search for regions showing selective activation in dynamic updating of feature-bound objects, we identified a network during memory maintenance that was comprised of the inferior precentral sulcus, superior parietal lobule, and middle frontal gyrus. In the change detection period, various prefrontal regions, including the anterior prefrontal cortex, were activated. In updating object representation of dynamically moving objects, the inferior precentral sulcus closely cooperates with a so-called "frontoparietal network", and subregions of the frontoparietal network can be decomposed into those sensitive to spatial updating and feature binding. The anterior prefrontal cortex identifies changes in object representation by comparing memory and perceptual representations rather than maintaining object representations per se, as previously suggested. Copyright 2009 Elsevier Inc. All rights reserved.

Eulerian formulation of the interacting particle representation model of homogeneous turbulence

DOE PAGES

Campos, Alejandro; Duraisamy, Karthik; Iaccarino, Gianluca

2016-10-21

The Interacting Particle Representation Model (IPRM) of homogeneous turbulence incorporates information about the morphology of turbulent structures within the con nes of a one-point model. In the original formulation [Kassinos & Reynolds, Center for Turbulence Research: Annual Research Briefs, 31{51, (1996)], the IPRM was developed in a Lagrangian setting by evolving second moments of velocity conditional on a given gradient vector. In the present work, the IPRM is re-formulated in an Eulerian framework and evolution equations are developed for the marginal PDFs. Eulerian methods avoid the issues associated with statistical estimators used by Lagrangian approaches, such as slow convergence. Amore » specific emphasis of this work is to use the IPRM to examine the long time evolution of homogeneous turbulence. We first describe the derivation of the marginal PDF in spherical coordinates, which reduces the number of independent variables and the cost associated with Eulerian simulations of PDF models. Next, a numerical method based on radial basis functions over a spherical domain is adapted to the IPRM. Finally, results obtained with the new Eulerian solution method are thoroughly analyzed. The sensitivity of the Eulerian simulations to parameters of the numerical scheme, such as the size of the time step and the shape parameter of the radial basis functions, is examined. A comparison between Eulerian and Lagrangian simulations is performed to discern the capabilities of each of the methods. Finally, a linear stability analysis based on the eigenvalues of the discrete differential operators is carried out for both the new Eulerian solution method and the original Lagrangian approach.« less

Speech transformations based on a sinusoidal representation

NASA Astrophysics Data System (ADS)

Quatieri, T. E.; McAulay, R. J.

1986-05-01

A new speech analysis/synthesis technique is presented which provides the basis for a general class of speech transformation including time-scale modification, frequency scaling, and pitch modification. These modifications can be performed with a time-varying change, permitting continuous adjustment of a speaker's fundamental frequency and rate of articulation. The method is based on a sinusoidal representation of the speech production mechanism that has been shown to produce synthetic speech that preserves the waveform shape and is essentially perceptually indistinguishable from the original. Although the analysis/synthesis system originally was designed for single-speaker signals, it is equally capable of recovering and modifying nonspeech signals such as music; multiple speakers, marine biologic sounds, and speakers in the presence of interferences such as noise and musical backgrounds.

The Cognitive and Perceptual Laws of the Inclined Plane.

PubMed

Masin, Sergio Cesare

2016-09-01

The study explored whether laypersons correctly tacitly know Galileo's law of the inclined plane and what the basis of such knowledge could be. Participants predicted the time a ball would take to roll down a slope with factorial combination of ball travel distance and slope angle. The resulting pattern of factorial curves relating the square of predicted time to travel distance for each slope angle was identical to that implied by Galileo's law, indicating a correct cognitive representation of this law. Intuitive physics research suggests that this cognitive representation may result from memories of past perceptions of objects rolling down a slope. Such a basis and the correct cognitive representation of Galileo's law led to the hypothesis that Galileo's law is also perceptually represented correctly. To test this hypothesis, participants were asked to judge the perceived travel time of a ball actually rolling down a slope, with perceived travel distance and perceived slope angle varied in a factorial design. The obtained pattern of factorial curves was equal to that implied by Galileo's law, indicating that the functional relationships defined in this law were perceptually represented correctly. The results foster the idea that laypersons may tacitly know both linear and nonlinear multiplicative physical laws of the everyday world. As a practical implication, the awareness of this conclusion may help develop more effective methods for teaching physics and for improving human performance in the physical environment.

Wissensstrukturierung im Unterricht: Neuere Forschung zur Wissensreprasentation und ihre Anwendung in der Didaktik (Knowledge Structuring in Instruction: Recent Research on Knowledge Representation and Its Application in the Classroom).

ERIC Educational Resources Information Center

Einsiedler, Wolfgang

1996-01-01

Asks whether theories of knowledge representation provide a basis for the development of theories of knowledge structuring in instruction. Discusses codes of knowledge, surface versus deep structures, semantic networks, and multiple memory systems. Reviews research on teaching, external representation of cognitive structures, hierarchical…

Using phrases and document metadata to improve topic modeling of clinical reports.

PubMed

Speier, William; Ong, Michael K; Arnold, Corey W

2016-06-01

Probabilistic topic models provide an unsupervised method for analyzing unstructured text, which have the potential to be integrated into clinical automatic summarization systems. Clinical documents are accompanied by metadata in a patient's medical history and frequently contains multiword concepts that can be valuable for accurately interpreting the included text. While existing methods have attempted to address these problems individually, we present a unified model for free-text clinical documents that integrates contextual patient- and document-level data, and discovers multi-word concepts. In the proposed model, phrases are represented by chained n-grams and a Dirichlet hyper-parameter is weighted by both document-level and patient-level context. This method and three other Latent Dirichlet allocation models were fit to a large collection of clinical reports. Examples of resulting topics demonstrate the results of the new model and the quality of the representations are evaluated using empirical log likelihood. The proposed model was able to create informative prior probabilities based on patient and document information, and captured phrases that represented various clinical concepts. The representation using the proposed model had a significantly higher empirical log likelihood than the compared methods. Integrating document metadata and capturing phrases in clinical text greatly improves the topic representation of clinical documents. The resulting clinically informative topics may effectively serve as the basis for an automatic summarization system for clinical reports. Copyright © 2016 Elsevier Inc. All rights reserved.

Constructing diabatic representations using adiabatic and approximate diabatic data--Coping with diabolical singularities.

PubMed

Zhu, Xiaolei; Yarkony, David R

2016-01-28

We have recently introduced a diabatization scheme, which simultaneously fits and diabatizes adiabatic ab initio electronic wave functions, Zhu and Yarkony J. Chem. Phys. 140, 024112 (2014). The algorithm uses derivative couplings in the defining equations for the diabatic Hamiltonian, H(d), and fits all its matrix elements simultaneously to adiabatic state data. This procedure ultimately provides an accurate, quantifiably diabatic, representation of the adiabatic electronic structure data. However, optimizing the large number of nonlinear parameters in the basis functions and adjusting the number and kind of basis functions from which the fit is built, which provide the essential flexibility, has proved challenging. In this work, we introduce a procedure that combines adiabatic state and diabatic state data to efficiently optimize the nonlinear parameters and basis function expansion. Further, we consider using direct properties based diabatizations to initialize the fitting procedure. To address this issue, we introduce a systematic method for eliminating the debilitating (diabolical) singularities in the defining equations of properties based diabatizations. We exploit the observation that if approximate diabatic data are available, the commonly used approach of fitting each matrix element of H(d) individually provides a starting point (seed) from which convergence of the full H(d) construction algorithm is rapid. The optimization of nonlinear parameters and basis functions and the elimination of debilitating singularities are, respectively, illustrated using the 1,2,3,4(1)A states of phenol and the 1,2(1)A states of NH3, states which are coupled by conical intersections.

SAR Polarimetry

NASA Technical Reports Server (NTRS)

vanZyl, Jakob J.

2012-01-01

Radar Scattering includes: Surface Characteristics, Geometric Properties, Dielectric Properties, Rough Surface Scattering, Geometrical Optics and Small Perturbation Method Solutions, Integral Equation Method, Magellan Image of Pancake Domes on Venus, Dickinson Impact Crater on Venus (Magellan), Lakes on Titan (Cassini Radar, Longitudinal Dunes on Titan (Cassini Radar), Rough Surface Scattering: Effect of Dielectric Constant, Vegetation Scattering, Effect of Soil Moisture. Polarimetric Radar includes: Principles of Polarimetry: Field Descriptions, Wave Polarizations: Geometrical Representations, Definition of Ellipse Orientation Angles, Scatter as Polarization Transformer, Scattering Matrix, Coordinate Systems, Scattering Matrix, Covariance Matrix, Pauli Basis and Coherency Matrix, Polarization Synthesis, Polarimeter Implementation.

Layer-by-layer design method for soft-X-ray multilayers

NASA Technical Reports Server (NTRS)

Yamamoto, Masaki; Namioka, Takeshi

1992-01-01

A new design method effective for a nontransparent system has been developed for soft-X-ray multilayers with the aid of graphic representation of the complex amplitude reflectance in a Gaussian plane. The method provides an effective means of attaining the absolute maximum reflectance on a layer-by-layer basis and also gives clear insight into the evolution of the amplitude reflectance on a multilayer as it builds up. An optical criterion is derived for the selection of a proper pair of materials needed for designing a high-reflectance multilayer. Some examples are given to illustrate the usefulness of this design method.

The Atom in a Molecule: Implications for Molecular Structure and Properties

DTIC Science & Technology

2016-05-23

unlimited. PA Clearance #16075.” Atomic- Product Representations of Molecules Employ “van der Waals” products of atomic states to represent molecules...representation the electrons “stay home” with each nucleus. Atomic fragment operators are well-defined over product representations. Expectation values of...release; distribution unlimited. PA Clearance #16075.” Hamiltonian Matrix in the Atomic- Product Basis Technical Questions Addressed: J. Chem. Phys

P, C and T: Different Properties on the Kinematical Level

NASA Astrophysics Data System (ADS)

Dvoeglazov, Valeriy V.

2018-04-01

We study the discrete symmetries (P,C and T) on the kinematical level within the extended Poincaré Group. On the basis of the Silagadze research, we investigate the question of the definitions of the discrete symmetry operators both on the classical level, and in the secondary-quantization scheme. We study the physical contents within several bases: light-front formulation, helicity basis, angular momentum basis, and so on, on several practical examples. We analize problems in construction of the neutral particles in the the (1/2, 0) + (0, 1/2) representation, the (1, 0) + (0, 1) and the (1/2, 1/2) representations of the Lorentz Group. As well known, the photon has the quantum numbers 1‑, so the (1, 0) + (0, 1) representation of the Lorentz group is relevant to its description. We have ambiguities in the definitions of the corresponding operators P, C; T, which lead to different physical consequences. It appears that the answers are connected with the helicity basis properties, and commutations/anticommutations of the corresponding operators, P, C, T, and C 2, P 2, (CP)2 properties. This contribution is the review paper of my previous work [2, 3].

Sparse regularization for force identification using dictionaries

NASA Astrophysics Data System (ADS)

Qiao, Baijie; Zhang, Xingwu; Wang, Chenxi; Zhang, Hang; Chen, Xuefeng

2016-04-01

The classical function expansion method based on minimizing l2-norm of the response residual employs various basis functions to represent the unknown force. Its difficulty lies in determining the optimum number of basis functions. Considering the sparsity of force in the time domain or in other basis space, we develop a general sparse regularization method based on minimizing l1-norm of the coefficient vector of basis functions. The number of basis functions is adaptively determined by minimizing the number of nonzero components in the coefficient vector during the sparse regularization process. First, according to the profile of the unknown force, the dictionary composed of basis functions is determined. Second, a sparsity convex optimization model for force identification is constructed. Third, given the transfer function and the operational response, Sparse reconstruction by separable approximation (SpaRSA) is developed to solve the sparse regularization problem of force identification. Finally, experiments including identification of impact and harmonic forces are conducted on a cantilever thin plate structure to illustrate the effectiveness and applicability of SpaRSA. Besides the Dirac dictionary, other three sparse dictionaries including Db6 wavelets, Sym4 wavelets and cubic B-spline functions can also accurately identify both the single and double impact forces from highly noisy responses in a sparse representation frame. The discrete cosine functions can also successfully reconstruct the harmonic forces including the sinusoidal, square and triangular forces. Conversely, the traditional Tikhonov regularization method with the L-curve criterion fails to identify both the impact and harmonic forces in these cases.

Atomic spectral-product representations of molecular electronic structure: metric matrices and atomic-product composition of molecular eigenfunctions.

PubMed

Ben-Nun, M; Mills, J D; Hinde, R J; Winstead, C L; Boatz, J A; Gallup, G A; Langhoff, P W

2009-07-02

Recent progress is reported in development of ab initio computational methods for the electronic structures of molecules employing the many-electron eigenstates of constituent atoms in spectral-product forms. The approach provides a universal atomic-product description of the electronic structure of matter as an alternative to more commonly employed valence-bond- or molecular-orbital-based representations. The Hamiltonian matrix in this representation is seen to comprise a sum over atomic energies and a pairwise sum over Coulombic interaction terms that depend only on the separations of the individual atomic pairs. Overall electron antisymmetry can be enforced by unitary transformation when appropriate, rather than as a possibly encumbering or unnecessary global constraint. The matrix representative of the antisymmetrizer in the spectral-product basis, which is equivalent to the metric matrix of the corresponding explicitly antisymmetric basis, provides the required transformation to antisymmetric or linearly independent states after Hamiltonian evaluation. Particular attention is focused in the present report on properties of the metric matrix and on the atomic-product compositions of molecular eigenstates as described in the spectral-product representations. Illustrative calculations are reported for simple but prototypically important diatomic (H(2), CH) and triatomic (H(3), CH(2)) molecules employing algorithms and computer codes devised recently for this purpose. This particular implementation of the approach combines Slater-orbital-based one- and two-electron integral evaluations, valence-bond constructions of standard tableau functions and matrices, and transformations to atomic eigenstate-product representations. The calculated metric matrices and corresponding potential energy surfaces obtained in this way elucidate a number of aspects of the spectral-product development, including the nature of closure in the representation, the general redundancy or linear dependence of its explicitly antisymmetrized form, the convergence of the apparently disparate atomic-product and explicitly antisymmetrized atomic-product forms to a common invariant subspace, and the nature of a chemical bonding descriptor provided by the atomic-product compositions of molecular eigenstates. Concluding remarks indicate additional studies in progress and the prognosis for performing atomic spectral-product calculations more generally and efficiently.

Representation and Exchange of Knowledge as a Basis of Information Processes. Proceedings of the International Research Forum in Information Science (5th, Heidelberg, West Germany, September 5-7, 1983).

ERIC Educational Resources Information Center

Dietschmann, Hans, Ed.

This 22-paper collection addresses a variety of issues related to representation and transfer of knowledge. Individual papers include an explanation of the usefulness of general scientific models versus case-specific approaches and a discussion of different empirical approaches to the general problem of knowledge representation for information…

Coherent States for Kronecker Products of Non Compact Groups: Formulation and Applications

NASA Technical Reports Server (NTRS)

Bambah, Bindu A.; Agarwal, Girish S.

1996-01-01

We introduce and study the properties of a class of coherent states for the group SU(1,1) X SU(1,1) and derive explicit expressions for these using the Clebsch-Gordan algebra for the SU(1,1) group. We restrict ourselves to the discrete series representations of SU(1,1). These are the generalization of the 'Barut Girardello' coherent states to the Kronecker Product of two non-compact groups. The resolution of the identity and the analytic phase space representation of these states is presented. This phase space representation is based on the basis of products of 'pair coherent states' rather than the standard number state canonical basis. We discuss the utility of the resulting 'bi-pair coherent states' in the context of four-mode interactions in quantum optics.

S-F graphic representation analysis of photoelectric facula focometer poroo-plate glass

NASA Astrophysics Data System (ADS)

Tong, Yilin; Han, Xuecai

2016-10-01

Optical system focal length is usually based on the magnification method with focal length measurement poroo-plate glass is used as base element measuring focal length of focometer. On the basis of using analysis of magnification method to measure the accuracy of optical lens focal length, an expression between the ruling span of poroo-plate glass and the focal length of measured optical system was deduced, an efficient method to work out S-F graph with AUTOCAD was developed, the selecting principle of focometer parameter was analyzed, and Applied examples for designing poroo-plate glass in S-F figure was obtained.

Geodesic Monte Carlo on Embedded Manifolds

PubMed Central

Byrne, Simon; Girolami, Mark

2013-01-01

Markov chain Monte Carlo methods explicitly defined on the manifold of probability distributions have recently been established. These methods are constructed from diffusions across the manifold and the solution of the equations describing geodesic flows in the Hamilton–Jacobi representation. This paper takes the differential geometric basis of Markov chain Monte Carlo further by considering methods to simulate from probability distributions that themselves are defined on a manifold, with common examples being classes of distributions describing directional statistics. Proposal mechanisms are developed based on the geodesic flows over the manifolds of support for the distributions, and illustrative examples are provided for the hypersphere and Stiefel manifold of orthonormal matrices. PMID:25309024

The Basic Principles and Methods of the System Approach to Compression of Telemetry Data

NASA Astrophysics Data System (ADS)

Levenets, A. V.

2018-01-01

The task of data compressing of measurement data is still urgent for information-measurement systems. In paper the basic principles necessary for designing of highly effective systems of compression of telemetric information are offered. A basis of the offered principles is representation of a telemetric frame as whole information space where we can find of existing correlation. The methods of data transformation and compressing algorithms realizing the offered principles are described. The compression ratio for offered compression algorithm is about 1.8 times higher, than for a classic algorithm. Thus, results of a research of methods and algorithms showing their good perspectives.

SEE: structured representation of scientific evidence in the biomedical domain using Semantic Web techniques

PubMed Central

2014-01-01

Background Accounts of evidence are vital to evaluate and reproduce scientific findings and integrate data on an informed basis. Currently, such accounts are often inadequate, unstandardized and inaccessible for computational knowledge engineering even though computational technologies, among them those of the semantic web, are ever more employed to represent, disseminate and integrate biomedical data and knowledge. Results We present SEE (Semantic EvidencE), an RDF/OWL based approach for detailed representation of evidence in terms of the argumentative structure of the supporting background for claims even in complex settings. We derive design principles and identify minimal components for the representation of evidence. We specify the Reasoning and Discourse Ontology (RDO), an OWL representation of the model of scientific claims, their subjects, their provenance and their argumentative relations underlying the SEE approach. We demonstrate the application of SEE and illustrate its design patterns in a case study by providing an expressive account of the evidence for certain claims regarding the isolation of the enzyme glutamine synthetase. Conclusions SEE is suited to provide coherent and computationally accessible representations of evidence-related information such as the materials, methods, assumptions, reasoning and information sources used to establish a scientific finding by adopting a consistently claim-based perspective on scientific results and their evidence. SEE allows for extensible evidence representations, in which the level of detail can be adjusted and which can be extended as needed. It supports representation of arbitrary many consecutive layers of interpretation and attribution and different evaluations of the same data. SEE and its underlying model could be a valuable component in a variety of use cases that require careful representation or examination of evidence for data presented on the semantic web or in other formats. PMID:25093070

SEE: structured representation of scientific evidence in the biomedical domain using Semantic Web techniques.

PubMed

Bölling, Christian; Weidlich, Michael; Holzhütter, Hermann-Georg

2014-01-01

Accounts of evidence are vital to evaluate and reproduce scientific findings and integrate data on an informed basis. Currently, such accounts are often inadequate, unstandardized and inaccessible for computational knowledge engineering even though computational technologies, among them those of the semantic web, are ever more employed to represent, disseminate and integrate biomedical data and knowledge. We present SEE (Semantic EvidencE), an RDF/OWL based approach for detailed representation of evidence in terms of the argumentative structure of the supporting background for claims even in complex settings. We derive design principles and identify minimal components for the representation of evidence. We specify the Reasoning and Discourse Ontology (RDO), an OWL representation of the model of scientific claims, their subjects, their provenance and their argumentative relations underlying the SEE approach. We demonstrate the application of SEE and illustrate its design patterns in a case study by providing an expressive account of the evidence for certain claims regarding the isolation of the enzyme glutamine synthetase. SEE is suited to provide coherent and computationally accessible representations of evidence-related information such as the materials, methods, assumptions, reasoning and information sources used to establish a scientific finding by adopting a consistently claim-based perspective on scientific results and their evidence. SEE allows for extensible evidence representations, in which the level of detail can be adjusted and which can be extended as needed. It supports representation of arbitrary many consecutive layers of interpretation and attribution and different evaluations of the same data. SEE and its underlying model could be a valuable component in a variety of use cases that require careful representation or examination of evidence for data presented on the semantic web or in other formats.

[A retrieval method of drug molecules based on graph collapsing].

PubMed

Qu, J W; Lv, X Q; Liu, Z M; Liao, Y; Sun, P H; Wang, B; Tang, Z

2018-04-18

To establish a compact and efficient hypergraph representation and a graph-similarity-based retrieval method of molecules to achieve effective and efficient medicine information retrieval. Chemical structural formula (CSF) was a primary search target as a unique and precise identifier for each compound at the molecular level in the research field of medicine information retrieval. To retrieve medicine information effectively and efficiently, a complete workflow of the graph-based CSF retrieval system was introduced. This system accepted the photos taken from smartphones and the sketches drawn on tablet personal computers as CSF inputs, and formalized the CSFs with the corresponding graphs. Then this paper proposed a compact and efficient hypergraph representation for molecules on the basis of analyzing factors that directly affected the efficiency of graph matching. According to the characteristics of CSFs, a hierarchical collapsing method combining graph isomorphism and frequent subgraph mining was adopted. There was yet a fundamental challenge, subgraph overlapping during the collapsing procedure, which hindered the method from establishing the correct compact hypergraph of an original CSF graph. Therefore, a graph-isomorphism-based algorithm was proposed to select dominant acyclic subgraphs on the basis of overlapping analysis. Finally, the spatial similarity among graphical CSFs was evaluated by multi-dimensional measures of similarity. To evaluate the performance of the proposed method, the proposed system was firstly compared with Wikipedia Chemical Structure Explorer (WCSE), the state-of-the-art system that allowed CSF similarity searching within Wikipedia molecules dataset, on retrieval accuracy. The system achieved higher values on mean average precision, discounted cumulative gain, rank-biased precision, and expected reciprocal rank than WCSE from the top-2 to the top-10 retrieved results. Specifically, the system achieved 10%, 1.41, 6.42%, and 1.32% higher than WCSE on these metrics for top-10 retrieval results, respectively. Moreover, several retrieval cases were presented to intuitively compare with WCSE. The results of the above comparative study demonstrated that the proposed method outperformed the existing method with regard to accuracy and effectiveness. This paper proposes a graph-similarity-based retrieval approach for medicine information. To obtain satisfactory retrieval results, an isomorphism-based algorithm is proposed for dominant subgraph selection based on the subgraph overlapping analysis, as well as an effective and efficient hypergraph representation of molecules. Experiment results demonstrate the effectiveness of the proposed approach.

Constructing diabatic representations using adiabatic and approximate diabatic data – Coping with diabolical singularities

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

Zhu, Xiaolei, E-mail: virtualzx@gmail.com; Yarkony, David R., E-mail: yarkony@jhu.edu

2016-01-28

We have recently introduced a diabatization scheme, which simultaneously fits and diabatizes adiabatic ab initio electronic wave functions, Zhu and Yarkony J. Chem. Phys. 140, 024112 (2014). The algorithm uses derivative couplings in the defining equations for the diabatic Hamiltonian, H{sup d}, and fits all its matrix elements simultaneously to adiabatic state data. This procedure ultimately provides an accurate, quantifiably diabatic, representation of the adiabatic electronic structure data. However, optimizing the large number of nonlinear parameters in the basis functions and adjusting the number and kind of basis functions from which the fit is built, which provide the essential flexibility,more » has proved challenging. In this work, we introduce a procedure that combines adiabatic state and diabatic state data to efficiently optimize the nonlinear parameters and basis function expansion. Further, we consider using direct properties based diabatizations to initialize the fitting procedure. To address this issue, we introduce a systematic method for eliminating the debilitating (diabolical) singularities in the defining equations of properties based diabatizations. We exploit the observation that if approximate diabatic data are available, the commonly used approach of fitting each matrix element of H{sup d} individually provides a starting point (seed) from which convergence of the full H{sup d} construction algorithm is rapid. The optimization of nonlinear parameters and basis functions and the elimination of debilitating singularities are, respectively, illustrated using the 1,2,3,4{sup 1}A states of phenol and the 1,2{sup 1}A states of NH{sub 3}, states which are coupled by conical intersections.« less

The neural basis of precise visual short-term memory for complex recognisable objects.

PubMed

Veldsman, Michele; Mitchell, Daniel J; Cusack, Rhodri

2017-10-01

Recent evidence suggests that visual short-term memory (VSTM) capacity estimated using simple objects, such as colours and oriented bars, may not generalise well to more naturalistic stimuli. More visual detail can be stored in VSTM when complex, recognisable objects are maintained compared to simple objects. It is not yet known if it is recognisability that enhances memory precision, nor whether maintenance of recognisable objects is achieved with the same network of brain regions supporting maintenance of simple objects. We used a novel stimulus generation method to parametrically warp photographic images along a continuum, allowing separate estimation of the precision of memory representations and the number of items retained. The stimulus generation method was also designed to create unrecognisable, though perceptually matched, stimuli, to investigate the impact of recognisability on VSTM. We adapted the widely-used change detection and continuous report paradigms for use with complex, photographic images. Across three functional magnetic resonance imaging (fMRI) experiments, we demonstrated greater precision for recognisable objects in VSTM compared to unrecognisable objects. This clear behavioural advantage was not the result of recruitment of additional brain regions, or of stronger mean activity within the core network. Representational similarity analysis revealed greater variability across item repetitions in the representations of recognisable, compared to unrecognisable complex objects. We therefore propose that a richer range of neural representations support VSTM for complex recognisable objects. Copyright © 2017 Elsevier Inc. All rights reserved.

Enhancing sparsity of Hermite polynomial expansions by iterative rotations

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

Yang, Xiu; Lei, Huan; Baker, Nathan A.

2016-02-01

Compressive sensing has become a powerful addition to uncertainty quantification in recent years. This paper identifies new bases for random variables through linear mappings such that the representation of the quantity of interest is more sparse with new basis functions associated with the new random variables. This sparsity increases both the efficiency and accuracy of the compressive sensing-based uncertainty quantification method. Specifically, we consider rotation- based linear mappings which are determined iteratively for Hermite polynomial expansions. We demonstrate the effectiveness of the new method with applications in solving stochastic partial differential equations and high-dimensional (O(100)) problems.

Sparse approximation of currents for statistics on curves and surfaces.

PubMed

Durrleman, Stanley; Pennec, Xavier; Trouvé, Alain; Ayache, Nicholas

2008-01-01

Computing, processing, visualizing statistics on shapes like curves or surfaces is a real challenge with many applications ranging from medical image analysis to computational geometry. Modelling such geometrical primitives with currents avoids feature-based approach as well as point-correspondence method. This framework has been proved to be powerful to register brain surfaces or to measure geometrical invariants. However, if the state-of-the-art methods perform efficiently pairwise registrations, new numerical schemes are required to process groupwise statistics due to an increasing complexity when the size of the database is growing. Statistics such as mean and principal modes of a set of shapes often have a heavy and highly redundant representation. We propose therefore to find an adapted basis on which mean and principal modes have a sparse decomposition. Besides the computational improvement, this sparse representation offers a way to visualize and interpret statistics on currents. Experiments show the relevance of the approach on 34 sets of 70 sulcal lines and on 50 sets of 10 meshes of deep brain structures.

Boson expansion based on the extended commutator method in the Tamm-Dancoff representation

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

Pedrocchi, V.G.; Tamura, T.

1983-07-01

Formal aspects of boson expansions in the Tamm-Dancoff representation are investigated in detail. This is carried out in the framework of the extended commutator method by solving in complete generality the coefficient equations, searching for Hermitian as well as non-Hermitian boson expansions. The solutions for the expansion coefficients are obtained in a new form, called the square root realization, which is then applied to carry out an analysis of the relationship between the type of expansion and the boson space in which the expansion is defined. It is shown that this new realization is reduced to various well-known boson theoriesmore » when the boson space is chosen in an appropriate manner. Further discussed, still on the basis of the square root realization, is the equivalence, on a practical level, of a few boson expansion approaches when the Tamm-Dancoff space is truncated to a single quadrupole collective component.« less

A critical review of the allocentric spatial representation and its neural underpinnings: toward a network-based perspective

PubMed Central

Ekstrom, Arne D.; Arnold, Aiden E. G. F.; Iaria, Giuseppe

2014-01-01

While the widely studied allocentric spatial representation holds a special status in neuroscience research, its exact nature and neural underpinnings continue to be the topic of debate, particularly in humans. Here, based on a review of human behavioral research, we argue that allocentric representations do not provide the kind of map-like, metric representation one might expect based on past theoretical work. Instead, we suggest that almost all tasks used in past studies involve a combination of egocentric and allocentric representation, complicating both the investigation of the cognitive basis of an allocentric representation and the task of identifying a brain region specifically dedicated to it. Indeed, as we discuss in detail, past studies suggest numerous brain regions important to allocentric spatial memory in addition to the hippocampus, including parahippocampal, retrosplenial, and prefrontal cortices. We thus argue that although allocentric computations will often require the hippocampus, particularly those involving extracting details across temporally specific routes, the hippocampus is not necessary for all allocentric computations. We instead suggest that a non-aggregate network process involving multiple interacting brain areas, including hippocampus and extra-hippocampal areas such as parahippocampal, retrosplenial, prefrontal, and parietal cortices, better characterizes the neural basis of spatial representation during navigation. According to this model, an allocentric representation does not emerge from the computations of a single brain region (i.e., hippocampus) nor is it readily decomposable into additive computations performed by separate brain regions. Instead, an allocentric representation emerges from computations partially shared across numerous interacting brain regions. We discuss our non-aggregate network model in light of existing data and provide several key predictions for future experiments. PMID:25346679

Indigenous Representation and Alternative Schooling: Prioritising an Epistemology of Relationality

ERIC Educational Resources Information Center

Keddie, Amanda

2014-01-01

This paper draws on a case study of a small alternative Indigenous school in Queensland, Australia. From the perspective of several of the school's Indigenous Elders, the paper foregrounds the significance of group differentiation at the school on the basis of Indigenous representation. However, it also considers how such…

Linearized self-consistent quasiparticle GW method: Application to semiconductors and simple metals

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

Kutepov, A. L.; Oudovenko, V. S.; Kotliar, G.

We present a code implementing the linearized self-consistent quasiparticle GW method (QSGW) in the LAPW basis. Our approach is based on the linearization of the self-energy around zero frequency which differs it from the existing implementations of the QSGW method. The linearization allows us to use Matsubara frequencies instead of working on the real axis. This results in efficiency gains by switching to the imaginary time representation in the same way as in the space time method. The all electron LAPW basis set eliminates the need for pseudopotentials. We discuss the advantages of our approach, such as its N 3more » scaling with the system size N, as well as its shortcomings. We apply our approach to study the electronic properties of selected semiconductors, insulators, and simple metals and show that our code produces the results very close to the previously published QSGW data. Our implementation is a good platform for further many body diagrammatic resummations such as the vertex-corrected GW approach and the GW+DMFT method.« less

Linearized self-consistent quasiparticle GW method: Application to semiconductors and simple metals

DOE PAGES

Kutepov, A. L.; Oudovenko, V. S.; Kotliar, G.

2017-06-23

We present a code implementing the linearized self-consistent quasiparticle GW method (QSGW) in the LAPW basis. Our approach is based on the linearization of the self-energy around zero frequency which differs it from the existing implementations of the QSGW method. The linearization allows us to use Matsubara frequencies instead of working on the real axis. This results in efficiency gains by switching to the imaginary time representation in the same way as in the space time method. The all electron LAPW basis set eliminates the need for pseudopotentials. We discuss the advantages of our approach, such as its N 3more » scaling with the system size N, as well as its shortcomings. We apply our approach to study the electronic properties of selected semiconductors, insulators, and simple metals and show that our code produces the results very close to the previously published QSGW data. Our implementation is a good platform for further many body diagrammatic resummations such as the vertex-corrected GW approach and the GW+DMFT method.« less

Estimating and Identifying Unspecified Correlation Structure for Longitudinal Data

PubMed Central

Hu, Jianhua; Wang, Peng; Qu, Annie

2014-01-01

Identifying correlation structure is important to achieving estimation efficiency in analyzing longitudinal data, and is also crucial for drawing valid statistical inference for large size clustered data. In this paper, we propose a nonparametric method to estimate the correlation structure, which is applicable for discrete longitudinal data. We utilize eigenvector-based basis matrices to approximate the inverse of the empirical correlation matrix and determine the number of basis matrices via model selection. A penalized objective function based on the difference between the empirical and model approximation of the correlation matrices is adopted to select an informative structure for the correlation matrix. The eigenvector representation of the correlation estimation is capable of reducing the risk of model misspecification, and also provides useful information on the specific within-cluster correlation pattern of the data. We show that the proposed method possesses the oracle property and selects the true correlation structure consistently. The proposed method is illustrated through simulations and two data examples on air pollution and sonar signal studies. PMID:26361433

A projection-free method for representing plane-wave DFT results in an atom-centered basis

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

Dunnington, Benjamin D.; Schmidt, J. R., E-mail: schmidt@chem.wisc.edu

2015-09-14

Plane wave density functional theory (DFT) is a powerful tool for gaining accurate, atomic level insight into bulk and surface structures. Yet, the delocalized nature of the plane wave basis set hinders the application of many powerful post-computation analysis approaches, many of which rely on localized atom-centered basis sets. Traditionally, this gap has been bridged via projection-based techniques from a plane wave to atom-centered basis. We instead propose an alternative projection-free approach utilizing direct calculation of matrix elements of the converged plane wave DFT Hamiltonian in an atom-centered basis. This projection-free approach yields a number of compelling advantages, including strictmore » orthonormality of the resulting bands without artificial band mixing and access to the Hamiltonian matrix elements, while faithfully preserving the underlying DFT band structure. The resulting atomic orbital representation of the Kohn-Sham wavefunction and Hamiltonian provides a gateway to a wide variety of analysis approaches. We demonstrate the utility of the approach for a diverse set of chemical systems and example analysis approaches.« less

Convergence to equilibrium under a random Hamiltonian.

PubMed

Brandão, Fernando G S L; Ćwikliński, Piotr; Horodecki, Michał; Horodecki, Paweł; Korbicz, Jarosław K; Mozrzymas, Marek

2012-09-01

We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first obtain results on such a matrix for a representation of an arbitrary finite group and then apply it to the particular representation of the permutation group under consideration.

Convergence to equilibrium under a random Hamiltonian

NASA Astrophysics Data System (ADS)

Brandão, Fernando G. S. L.; Ćwikliński, Piotr; Horodecki, Michał; Horodecki, Paweł; Korbicz, Jarosław K.; Mozrzymas, Marek

2012-09-01

We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first obtain results on such a matrix for a representation of an arbitrary finite group and then apply it to the particular representation of the permutation group under consideration.

Reduced Wiener Chaos representation of random fields via basis adaptation and projection

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

Tsilifis, Panagiotis, E-mail: tsilifis@usc.edu; Department of Civil Engineering, University of Southern California, Los Angeles, CA 90089; Ghanem, Roger G., E-mail: ghanem@usc.edu

2017-07-15

A new characterization of random fields appearing in physical models is presented that is based on their well-known Homogeneous Chaos expansions. We take advantage of the adaptation capabilities of these expansions where the core idea is to rotate the basis of the underlying Gaussian Hilbert space, in order to achieve reduced functional representations that concentrate the induced probability measure in a lower dimensional subspace. For a smooth family of rotations along the domain of interest, the uncorrelated Gaussian inputs are transformed into a Gaussian process, thus introducing a mesoscale that captures intermediate characteristics of the quantity of interest.

Reduced Wiener Chaos representation of random fields via basis adaptation and projection

NASA Astrophysics Data System (ADS)

Tsilifis, Panagiotis; Ghanem, Roger G.

2017-07-01

A new characterization of random fields appearing in physical models is presented that is based on their well-known Homogeneous Chaos expansions. We take advantage of the adaptation capabilities of these expansions where the core idea is to rotate the basis of the underlying Gaussian Hilbert space, in order to achieve reduced functional representations that concentrate the induced probability measure in a lower dimensional subspace. For a smooth family of rotations along the domain of interest, the uncorrelated Gaussian inputs are transformed into a Gaussian process, thus introducing a mesoscale that captures intermediate characteristics of the quantity of interest.

Vibrational spectra, DFT quantum chemical calculations and conformational analysis of P-iodoanisole.

PubMed

Arivazhagan, M; Anitha Rexalin, D; Geethapriya, J

2013-09-01

The solid phase FT-IR and FT-Raman spectra of P-iodoanisole (P-IA) have been recorded in the regions 400-4000 and 50-4000 cm(-1), respectively. The spectra were interpreted in terms of fundamentals modes, combination and overtone bands. The structure of the molecule was optimized and the structural characteristics were determined by ab initio (HF) and density functional theory (B3LYP) methods with LanL2DZ as basis set. The potential energy surface scan for the selected dihedral angle of P-IA has been performed to identify stable conformer. The optimized structure parameters and vibrational wavenumbers of stable conformer have been predicted by density functional B3LYP method with LanL2DZ (with effective core potential representations of electrons near the nuclei for post-third row atoms) basis set. The nucleophilic and electrophilic sites obtained from the molecular electrostatic potential (MEP) surface were calculated. The temperature dependence of thermodynamic properties has been analyzed. Several thermodynamic parameters have been calculated using B3LYP with LanL2DZ basis set. Copyright © 2013 Elsevier B.V. All rights reserved.

Linearized self-consistent quasiparticle GW method: Application to semiconductors and simple metals

NASA Astrophysics Data System (ADS)

Kutepov, A. L.; Oudovenko, V. S.; Kotliar, G.

2017-10-01

We present a code implementing the linearized quasiparticle self-consistent GW method (LQSGW) in the LAPW basis. Our approach is based on the linearization of the self-energy around zero frequency which differs it from the existing implementations of the QSGW method. The linearization allows us to use Matsubara frequencies instead of working on the real axis. This results in efficiency gains by switching to the imaginary time representation in the same way as in the space time method. The all electron LAPW basis set eliminates the need for pseudopotentials. We discuss the advantages of our approach, such as its N3 scaling with the system size N, as well as its shortcomings. We apply our approach to study the electronic properties of selected semiconductors, insulators, and simple metals and show that our code produces the results very close to the previously published QSGW data. Our implementation is a good platform for further many body diagrammatic resummations such as the vertex-corrected GW approach and the GW+DMFT method. Program Files doi:http://dx.doi.org/10.17632/cpchkfty4w.1 Licensing provisions: GNU General Public License Programming language: Fortran 90 External routines/libraries: BLAS, LAPACK, MPI (optional) Nature of problem: Direct implementation of the GW method scales as N4 with the system size, which quickly becomes prohibitively time consuming even in the modern computers. Solution method: We implemented the GW approach using a method that switches between real space and momentum space representations. Some operations are faster in real space, whereas others are more computationally efficient in the reciprocal space. This makes our approach scale as N3. Restrictions: The limiting factor is usually the memory available in a computer. Using 10 GB/core of memory allows us to study the systems up to 15 atoms per unit cell.

Distributed Compressive Sensing

DTIC Science & Technology

2009-01-01

example, smooth signals are sparse in the Fourier basis, and piecewise smooth signals are sparse in a wavelet basis [8]; the commercial coding standards MP3...including wavelets [8], Gabor bases [8], curvelets [35], etc., are widely used for representation and compression of natural signals, images, and...spikes and the sine waves of a Fourier basis, or the Fourier basis and wavelets . Signals that are sparsely represented in frames or unions of bases can

Representations of Death Among Italian Vegetarians: An Ethnographic Research on Environment, Disgust and Transcendence.

PubMed

Testoni, Ines; Ghellar, Tommaso; Rodelli, Maddalena; De Cataldo, Loriana; Zamperini, Adriano

2017-08-01

This paper focuses on the motives for vegetarian choices in contemporary Italian food culture, with specific reference to the role of the representations of death. The study adopts a qualitative research design aimed at an in-depth exploration of the reasons for avoiding meat, following an ethnographic method. Twenty-two participants (55% women, 45% men) aged 19-74, all vegetarians or vegans, mainly from Northern and Central Italy, were involved. Data from the Interpretative Phenomenological Analysis were examined according to the qualitative thematic analysis: the results show the role of death in the construction of disgust towards meat, running parallel with an emphasis on spirituality, ethical treatment of animals and the environment as reasons for avoiding meat, in particular, the concern-generating disgust and its relationship with the representation of death as a contaminating essence. The basis of disgust lies in this connection, from which the idea that oral consumption of contaminants characterized by corruptive properties, passing through the flesh of dead animals to humans, derives. The role of anti-speciesism is considered as a latent perspective, which may influence the vegetarian and vegan choices.

Assessing the effects of cocaine dependence and pathological gambling using group-wise sparse representation of natural stimulus FMRI data.

PubMed

Ren, Yudan; Fang, Jun; Lv, Jinglei; Hu, Xintao; Guo, Cong Christine; Guo, Lei; Xu, Jiansong; Potenza, Marc N; Liu, Tianming

2017-08-01

Assessing functional brain activation patterns in neuropsychiatric disorders such as cocaine dependence (CD) or pathological gambling (PG) under naturalistic stimuli has received rising interest in recent years. In this paper, we propose and apply a novel group-wise sparse representation framework to assess differences in neural responses to naturalistic stimuli across multiple groups of participants (healthy control, cocaine dependence, pathological gambling). Specifically, natural stimulus fMRI (N-fMRI) signals from all three groups of subjects are aggregated into a big data matrix, which is then decomposed into a common signal basis dictionary and associated weight coefficient matrices via an effective online dictionary learning and sparse coding method. The coefficient matrices associated with each common dictionary atom are statistically assessed for each group separately. With the inter-group comparisons based on the group-wise correspondence established by the common dictionary, our experimental results demonstrated that the group-wise sparse coding and representation strategy can effectively and specifically detect brain networks/regions affected by different pathological conditions of the brain under naturalistic stimuli.

Attractor Dynamics and Semantic Neighborhood Density: Processing Is Slowed by Near Neighbors and Speeded by Distant Neighbors

ERIC Educational Resources Information Center

Mirman, Daniel; Magnuson, James S.

2008-01-01

The authors investigated semantic neighborhood density effects on visual word processing to examine the dynamics of activation and competition among semantic representations. Experiment 1 validated feature-based semantic representations as a basis for computing semantic neighborhood density and suggested that near and distant neighbors have…

Forming Tool Use Representations: A Neurophysiological Investigation into Tool Exposure

ERIC Educational Resources Information Center

Mizelle, John Christopher; Tang, Teresa; Pirouz, Nikta; Wheaton, Lewis A.

2011-01-01

Prior work has identified a common left parietofrontal network for storage of tool-related information for various tasks. How these representations become established within this network on the basis of different modes of exposure is unclear. Here, healthy subjects engaged in physical practice (direct exposure) with familiar and unfamiliar tools.…

The Representation of Bilingual Mental Lexicon and English Vocabulary Acquisition

ERIC Educational Resources Information Center

Ying, Zhang

2017-01-01

This paper provides an overview of the theories on the organization and development of L1 mental lexicon and the representation mode of bilingual mental lexicon. It analyzes the structure and characteristics of Chinese EFL learners and their problems in English vocabulary acquisition. On the basis of this, it suggests that English vocabulary…

Kac determinant and singular vector of the level N representation of Ding-Iohara-Miki algebra

NASA Astrophysics Data System (ADS)

Ohkubo, Yusuke

2018-05-01

In this paper, we obtain the formula for the Kac determinant of the algebra arising from the level N representation of the Ding-Iohara-Miki algebra. It is also discovered that its singular vectors correspond to generalized Macdonald functions (the q-deformed version of the AFLT basis).

Neural representation of consciously imperceptible speech sound differences.

PubMed

Allen, J; Kraus, N; Bradlow, A

2000-10-01

The concept of subliminal perception has been a subject of interest and controversy for decades. Of interest in the present investigation was whether a neurophysiologic index of stimulus change could be elicited to speech sound contrasts that were consciously indiscriminable. The stimuli were chosen on the basis of each individual subject's discrimination threshold. The speech stimuli (which varied along an F3 onset frequency continuum from /da/ to /ga/) were synthesized so that the acoustical properties of the stimuli could be tightly controlled. Subthreshold and suprathreshold stimuli were chosen on the basis of behavioral ability demonstrated during psychophysical testing. A significant neural representation of stimulus change, reflected by the mismatch negativity response, was obtained in all but 1 subject in response to subthreshold stimuli. Grand average responses differed significantly from responses obtained in a control condition consisting of physiologic responses elicited by physically identical stimuli. Furthermore, responses to suprathreshold stimuli (close to threshold) did not differ significantly from subthreshold responses with respect to latency, amplitude, or area. These results suggest that neural representation of consciously imperceptible stimulus differences occurs and that this representation occurs at a preattentive level.

An unbiased Hessian representation for Monte Carlo PDFs.

PubMed

Carrazza, Stefano; Forte, Stefano; Kassabov, Zahari; Latorre, José Ignacio; Rojo, Juan

We develop a methodology for the construction of a Hessian representation of Monte Carlo sets of parton distributions, based on the use of a subset of the Monte Carlo PDF replicas as an unbiased linear basis, and of a genetic algorithm for the determination of the optimal basis. We validate the methodology by first showing that it faithfully reproduces a native Monte Carlo PDF set (NNPDF3.0), and then, that if applied to Hessian PDF set (MMHT14) which was transformed into a Monte Carlo set, it gives back the starting PDFs with minimal information loss. We then show that, when applied to a large Monte Carlo PDF set obtained as combination of several underlying sets, the methodology leads to a Hessian representation in terms of a rather smaller set of parameters (MC-H PDFs), thereby providing an alternative implementation of the recently suggested Meta-PDF idea and a Hessian version of the recently suggested PDF compression algorithm (CMC-PDFs). The mc2hessian conversion code is made publicly available together with (through LHAPDF6) a Hessian representations of the NNPDF3.0 set, and the MC-H PDF set.

Translational systems biology using an agent-based approach for dynamic knowledge representation: An evolutionary paradigm for biomedical research.

PubMed

An, Gary C

2010-01-01

The greatest challenge facing the biomedical research community is the effective translation of basic mechanistic knowledge into clinically effective therapeutics. This challenge is most evident in attempts to understand and modulate "systems" processes/disorders, such as sepsis, cancer, and wound healing. Formulating an investigatory strategy for these issues requires the recognition that these are dynamic processes. Representation of the dynamic behavior of biological systems can aid in the investigation of complex pathophysiological processes by augmenting existing discovery procedures by integrating disparate information sources and knowledge. This approach is termed Translational Systems Biology. Focusing on the development of computational models capturing the behavior of mechanistic hypotheses provides a tool that bridges gaps in the understanding of a disease process by visualizing "thought experiments" to fill those gaps. Agent-based modeling is a computational method particularly well suited to the translation of mechanistic knowledge into a computational framework. Utilizing agent-based models as a means of dynamic hypothesis representation will be a vital means of describing, communicating, and integrating community-wide knowledge. The transparent representation of hypotheses in this dynamic fashion can form the basis of "knowledge ecologies," where selection between competing hypotheses will apply an evolutionary paradigm to the development of community knowledge.

Internal representations for face detection: an application of noise-based image classification to BOLD responses.

PubMed

Nestor, Adrian; Vettel, Jean M; Tarr, Michael J

2013-11-01

What basic visual structures underlie human face detection and how can we extract such structures directly from the amplitude of neural responses elicited by face processing? Here, we address these issues by investigating an extension of noise-based image classification to BOLD responses recorded in high-level visual areas. First, we assess the applicability of this classification method to such data and, second, we explore its results in connection with the neural processing of faces. To this end, we construct luminance templates from white noise fields based on the response of face-selective areas in the human ventral cortex. Using behaviorally and neurally-derived classification images, our results reveal a family of simple but robust image structures subserving face representation and detection. Thus, we confirm the role played by classical face selective regions in face detection and we help clarify the representational basis of this perceptual function. From a theory standpoint, our findings support the idea of simple but highly diagnostic neurally-coded features for face detection. At the same time, from a methodological perspective, our work demonstrates the ability of noise-based image classification in conjunction with fMRI to help uncover the structure of high-level perceptual representations. Copyright © 2012 Wiley Periodicals, Inc.

Variational nonadiabatic dynamics in the moving crude adiabatic representation: Further merging of nuclear dynamics and electronic structure

NASA Astrophysics Data System (ADS)

Joubert-Doriol, Loïc; Izmaylov, Artur F.

2018-03-01

A new methodology of simulating nonadiabatic dynamics using frozen-width Gaussian wavepackets within the moving crude adiabatic representation with the on-the-fly evaluation of electronic structure is presented. The main feature of the new approach is the elimination of any global or local model representation of electronic potential energy surfaces; instead, the electron-nuclear interaction is treated explicitly using the Gaussian integration. As a result, the new scheme does not introduce any uncontrolled approximations. The employed variational principle ensures the energy conservation and leaves the number of electronic and nuclear basis functions as the only parameter determining the accuracy. To assess performance of the approach, a model with two electronic and two nuclear spacial degrees of freedom containing conical intersections between potential energy surfaces has been considered. Dynamical features associated with nonadiabatic transitions and nontrivial geometric (or Berry) phases were successfully reproduced within a limited basis expansion.

Protein Structure Classification and Loop Modeling Using Multiple Ramachandran Distributions.

PubMed

Najibi, Seyed Morteza; Maadooliat, Mehdi; Zhou, Lan; Huang, Jianhua Z; Gao, Xin

2017-01-01

Recently, the study of protein structures using angular representations has attracted much attention among structural biologists. The main challenge is how to efficiently model the continuous conformational space of the protein structures based on the differences and similarities between different Ramachandran plots. Despite the presence of statistical methods for modeling angular data of proteins, there is still a substantial need for more sophisticated and faster statistical tools to model the large-scale circular datasets. To address this need, we have developed a nonparametric method for collective estimation of multiple bivariate density functions for a collection of populations of protein backbone angles. The proposed method takes into account the circular nature of the angular data using trigonometric spline which is more efficient compared to existing methods. This collective density estimation approach is widely applicable when there is a need to estimate multiple density functions from different populations with common features. Moreover, the coefficients of adaptive basis expansion for the fitted densities provide a low-dimensional representation that is useful for visualization, clustering, and classification of the densities. The proposed method provides a novel and unique perspective to two important and challenging problems in protein structure research: structure-based protein classification and angular-sampling-based protein loop structure prediction.

Sensing the earthquake

NASA Astrophysics Data System (ADS)

Bichisao, Marta; Stallone, Angela

2017-04-01

Making science visual plays a crucial role in the process of building knowledge. In this view, art can considerably facilitate the representation of the scientific content, by offering a different perspective on how a specific problem could be approached. Here we explore the possibility of presenting the earthquake process through visual dance. From a choreographer's point of view, the focus is always on the dynamic relationships between moving objects. The observed spatial patterns (coincidences, repetitions, double and rhythmic configurations) suggest how objects organize themselves in the environment and what are the principles underlying that organization. The identified set of rules is then implemented as a basis for the creation of a complex rhythmic and visual dance system. Recently, scientists have turned seismic waves into sound and animations, introducing the possibility of "feeling" the earthquakes. We try to implement these results into a choreographic model with the aim to convert earthquake sound to a visual dance system, which could return a transmedia representation of the earthquake process. In particular, we focus on a possible method to translate and transfer the metric language of seismic sound and animations into body language. The objective is to involve the audience into a multisensory exploration of the earthquake phenomenon, through the stimulation of the hearing, eyesight and perception of the movements (neuromotor system). In essence, the main goal of this work is to develop a method for a simultaneous visual and auditory representation of a seismic event by means of a structured choreographic model. This artistic representation could provide an original entryway into the physics of earthquakes.

A Distributed, Developmental Model of Word Recognition and Naming

DTIC Science & Technology

1989-07-14

reading and clues to their neurophysiological bases (Patterson, M. Coltheart & Marshall, 1986). Our model provides the basis for an account of some aspects...is that distributed representations provide a basis for making lexical decisions; moreover, the model provides an enlightening account of some

The Prosodic Basis of the Tiberian Hebrew System of Accents.

ERIC Educational Resources Information Center

Dresher, Bezalel Elan

1994-01-01

It is argued that the Tiberian system of accents that annotate the text of the Hebrew Bible has a prosodic basis. Tiberian representation can best be understood by integrating results of phonological, phonetic, and psycholinguistic research on prosodic structure. (93 references) (Author/LB)

Parental Socioeconomic Status and the Neural Basis of Arithmetic: Differential Relations to Verbal and Visuo-Spatial Representations

ERIC Educational Resources Information Center

Demir, Özlem Ece; Prado, Jérôme; Booth, James R.

2015-01-01

We examined the relation of parental socioeconomic status (SES) to the neural bases of subtraction in school-age children (9- to 12-year-olds). We independently localized brain regions subserving verbal versus visuo-spatial representations to determine whether the parental SES-related differences in children's reliance on these neural…

Representation and Analysis of Chemistry Core Ideas in Science Education Standards between China and the United States

ERIC Educational Resources Information Center

Wan, Yanlan; Bi, Hualin

2016-01-01

Chemistry core ideas play an important role in students' chemistry learning. On the basis of the representations of chemistry core ideas about "substances" and "processes" in the Chinese Chemistry Curriculum Standards (CCCS) and the U.S. Next Generation Science Standards (NGSS), we conduct a critical comparison of chemistry…

(Re)Presentations of Islam in Albanian History Textbooks from 1990 to 2013

ERIC Educational Resources Information Center

Sulstarova, Enis

2017-01-01

This article investigates the role of Islam in representations of the self and the other in the contemporary Albanian national discourse, on the basis of an analysis of history textbooks published in postcommunist Albania between 1990 and 2013, focusing specifcally on texts used in pre-university education. Even after the dissolution of the…

Red Onions, "Elodea," or Decalcified Chicken Eggs? Selecting & Sequencing Representations for Teaching Diffusion & Osmosis

ERIC Educational Resources Information Center

Lankford, Deanna; Friedrichsen, Patricia

2012-01-01

Diffusion and osmosis are important biological concepts that students often struggle to understand. These are important concepts because they are the basis for many complex biological processes, such as photosynthesis and cellular respiration. We examine a wide variety of representations used by experienced teachers to teach diffusion and osmosis.…

Attention during natural vision warps semantic representation across the human brain.

PubMed

Çukur, Tolga; Nishimoto, Shinji; Huth, Alexander G; Gallant, Jack L

2013-06-01

Little is known about how attention changes the cortical representation of sensory information in humans. On the basis of neurophysiological evidence, we hypothesized that attention causes tuning changes to expand the representation of attended stimuli at the cost of unattended stimuli. To investigate this issue, we used functional magnetic resonance imaging to measure how semantic representation changed during visual search for different object categories in natural movies. We found that many voxels across occipito-temporal and fronto-parietal cortex shifted their tuning toward the attended category. These tuning shifts expanded the representation of the attended category and of semantically related, but unattended, categories, and compressed the representation of categories that were semantically dissimilar to the target. Attentional warping of semantic representation occurred even when the attended category was not present in the movie; thus, the effect was not a target-detection artifact. These results suggest that attention dynamically alters visual representation to optimize processing of behaviorally relevant objects during natural vision.

Comparing visual representations across human fMRI and computational vision

PubMed Central

Leeds, Daniel D.; Seibert, Darren A.; Pyles, John A.; Tarr, Michael J.

2013-01-01

Feedforward visual object perception recruits a cortical network that is assumed to be hierarchical, progressing from basic visual features to complete object representations. However, the nature of the intermediate features related to this transformation remains poorly understood. Here, we explore how well different computer vision recognition models account for neural object encoding across the human cortical visual pathway as measured using fMRI. These neural data, collected during the viewing of 60 images of real-world objects, were analyzed with a searchlight procedure as in Kriegeskorte, Goebel, and Bandettini (2006): Within each searchlight sphere, the obtained patterns of neural activity for all 60 objects were compared to model responses for each computer recognition algorithm using representational dissimilarity analysis (Kriegeskorte et al., 2008). Although each of the computer vision methods significantly accounted for some of the neural data, among the different models, the scale invariant feature transform (Lowe, 2004), encoding local visual properties gathered from “interest points,” was best able to accurately and consistently account for stimulus representations within the ventral pathway. More generally, when present, significance was observed in regions of the ventral-temporal cortex associated with intermediate-level object perception. Differences in model effectiveness and the neural location of significant matches may be attributable to the fact that each model implements a different featural basis for representing objects (e.g., more holistic or more parts-based). Overall, we conclude that well-known computer vision recognition systems may serve as viable proxies for theories of intermediate visual object representation. PMID:24273227

A method of classification for multisource data in remote sensing based on interval-valued probabilities

NASA Technical Reports Server (NTRS)

Kim, Hakil; Swain, Philip H.

1990-01-01

An axiomatic approach to intervalued (IV) probabilities is presented, where the IV probability is defined by a pair of set-theoretic functions which satisfy some pre-specified axioms. On the basis of this approach representation of statistical evidence and combination of multiple bodies of evidence are emphasized. Although IV probabilities provide an innovative means for the representation and combination of evidential information, they make the decision process rather complicated. It entails more intelligent strategies for making decisions. The development of decision rules over IV probabilities is discussed from the viewpoint of statistical pattern recognition. The proposed method, so called evidential reasoning method, is applied to the ground-cover classification of a multisource data set consisting of Multispectral Scanner (MSS) data, Synthetic Aperture Radar (SAR) data, and digital terrain data such as elevation, slope, and aspect. By treating the data sources separately, the method is able to capture both parametric and nonparametric information and to combine them. Then the method is applied to two separate cases of classifying multiband data obtained by a single sensor. In each case a set of multiple sources is obtained by dividing the dimensionally huge data into smaller and more manageable pieces based on the global statistical correlation information. By a divide-and-combine process, the method is able to utilize more features than the conventional maximum likelihood method.

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

NASA Astrophysics Data System (ADS)

Jia, C. J.; Wang, Y.; Mendl, C. B.; Moritz, B.; Devereaux, T. P.

2018-03-01

We describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the "checkerboard" decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

Density matrix renormalization group simulations of SU(N ) Heisenberg chains using standard Young tableaus: Fundamental representation and comparison with a finite-size Bethe ansatz

NASA Astrophysics Data System (ADS)

Nataf, Pierre; Mila, Frédéric

2018-04-01

We develop an efficient method to perform density matrix renormalization group simulations of the SU(N ) Heisenberg chain with open boundary conditions taking full advantage of the SU(N ) symmetry of the problem. This method is an extension of the method previously developed for exact diagonalizations and relies on a systematic use of the basis of standard Young tableaux. Concentrating on the model with the fundamental representation at each site (i.e., one particle per site in the fermionic formulation), we have benchmarked our results for the ground-state energy up to N =8 and up to 420 sites by comparing them with Bethe ansatz results on open chains, for which we have derived and solved the Bethe ansatz equations. The agreement for the ground-state energy is excellent for SU(3) (12 digits). It decreases with N , but it is still satisfactory for N =8 (six digits). Central charges c are also extracted from the entanglement entropy using the Calabrese-Cardy formula and agree with the theoretical values expected from the SU (N) 1 Wess-Zumino-Witten conformal field theories.

Relationships between magnitude representation, counting and memory in 4- to 7-year-old children: a developmental study.

PubMed

Soltész, Fruzsina; Szucs, Dénes; Szucs, Lívia

2010-02-18

The development of an evolutionarily grounded analogue magnitude representation linked to the parietal lobes is frequently thought to be a major factor in the arithmetic development of humans. We investigated the relationship between counting and the development of magnitude representation in children, assessing also children's knowledge of number symbols, their arithmetic fact retrieval, their verbal skills, and their numerical and verbal short-term memory. The magnitude representation was tested by a non-symbolic magnitude comparison task. We have perfected previous experimental designs measuring magnitude discrimination skills in 65 children kindergarten (4-7-year-olds) by controlling for several variables which were not controlled for in previous similar research. We also used a large number of trials which allowed for running a full factorial ANOVA including all relevant factors. Tests of verbal counting, of short term memory, of number knowledge, of problem solving abilities and of verbal fluency were administered and correlated with performance in the magnitude comparison task. Verbal counting knowledge and performance on simple arithmetic tests did not correlate with non-symbolic magnitude comparison at any age. Older children performed successfully on the number comparison task, showing behavioural patterns consistent with an analogue magnitude representation. In contrast, 4-year-olds were unable to discriminate number independently of task-irrelevant perceptual variables. Sensitivity to irrelevant perceptual features of the magnitude discrimination task was also affected by age, and correlated with memory, suggesting that more general cognitive abilities may play a role in performance in magnitude comparison tasks. We conclude that young children are not able to discriminate numerical magnitudes when co-varying physical magnitudes are methodically pitted against number. We propose, along with others, that a rather domain general magnitude representation provides the later basis for a specialized representation of numerical magnitudes. For this representational specialization, the acquisition of the concept of abstract numbers, together with the development of other cognitive abilities, is indispensable.

Tests of the Grobner Basis Solution for Lightning Ground Flash Fraction Retrieval

NASA Technical Reports Server (NTRS)

Koshak, William; Solakiewicz, Richard; Attele, Rohan

2011-01-01

Satellite lightning imagers such as the NASA Tropical Rainfall Measuring Mission Lightning Imaging Sensor (TRMM/LIS) and the future GOES-R Geostationary Lightning Mapper (GLM) are designed to detect total lightning (ground flashes + cloud flashes). However, there is a desire to discriminate ground flashes from cloud flashes from the vantage point of space since this would enhance the overall information content of the satellite lightning data and likely improve its operational and scientific applications (e.g., in severe weather warning, lightning nitrogen oxides studies, and global electric circuit analyses). A Bayesian inversion method was previously introduced for retrieving the fraction of ground flashes in a set of flashes observed from a satellite lightning imager. The method employed a constrained mixed exponential distribution model to describe the lightning optical measurements. To obtain the optimum model parameters (one of which is the ground flash fraction), a scalar function was minimized by a numerical method. In order to improve this optimization, a Grobner basis solution was introduced to obtain analytic representations of the model parameters that serve as a refined initialization scheme to the numerical optimization. In this study, we test the efficacy of the Grobner basis initialization using actual lightning imager measurements and ground flash truth derived from the national lightning network.

A Sparsity-Promoted Method Based on Majorization-Minimization for Weak Fault Feature Enhancement

PubMed Central

Hao, Yansong; Song, Liuyang; Tang, Gang; Yuan, Hongfang

2018-01-01

Fault transient impulses induced by faulty components in rotating machinery usually contain substantial interference. Fault features are comparatively weak in the initial fault stage, which renders fault diagnosis more difficult. In this case, a sparse representation method based on the Majorzation-Minimization (MM) algorithm is proposed to enhance weak fault features and extract the features from strong background noise. However, the traditional MM algorithm suffers from two issues, which are the choice of sparse basis and complicated calculations. To address these challenges, a modified MM algorithm is proposed in which a sparse optimization objective function is designed firstly. Inspired by the Basis Pursuit (BP) model, the optimization function integrates an impulsive feature-preserving factor and a penalty function factor. Second, a modified Majorization iterative method is applied to address the convex optimization problem of the designed function. A series of sparse coefficients can be achieved through iterating, which only contain transient components. It is noteworthy that there is no need to select the sparse basis in the proposed iterative method because it is fixed as a unit matrix. Then the reconstruction step is omitted, which can significantly increase detection efficiency. Eventually, envelope analysis of the sparse coefficients is performed to extract weak fault features. Simulated and experimental signals including bearings and gearboxes are employed to validate the effectiveness of the proposed method. In addition, comparisons are made to prove that the proposed method outperforms the traditional MM algorithm in terms of detection results and efficiency. PMID:29597280

A Sparsity-Promoted Method Based on Majorization-Minimization for Weak Fault Feature Enhancement.

PubMed

Ren, Bangyue; Hao, Yansong; Wang, Huaqing; Song, Liuyang; Tang, Gang; Yuan, Hongfang

2018-03-28

Fault transient impulses induced by faulty components in rotating machinery usually contain substantial interference. Fault features are comparatively weak in the initial fault stage, which renders fault diagnosis more difficult. In this case, a sparse representation method based on the Majorzation-Minimization (MM) algorithm is proposed to enhance weak fault features and extract the features from strong background noise. However, the traditional MM algorithm suffers from two issues, which are the choice of sparse basis and complicated calculations. To address these challenges, a modified MM algorithm is proposed in which a sparse optimization objective function is designed firstly. Inspired by the Basis Pursuit (BP) model, the optimization function integrates an impulsive feature-preserving factor and a penalty function factor. Second, a modified Majorization iterative method is applied to address the convex optimization problem of the designed function. A series of sparse coefficients can be achieved through iterating, which only contain transient components. It is noteworthy that there is no need to select the sparse basis in the proposed iterative method because it is fixed as a unit matrix. Then the reconstruction step is omitted, which can significantly increase detection efficiency. Eventually, envelope analysis of the sparse coefficients is performed to extract weak fault features. Simulated and experimental signals including bearings and gearboxes are employed to validate the effectiveness of the proposed method. In addition, comparisons are made to prove that the proposed method outperforms the traditional MM algorithm in terms of detection results and efficiency.

Efficient Bayesian hierarchical functional data analysis with basis function approximations using Gaussian-Wishart processes.

PubMed

Yang, Jingjing; Cox, Dennis D; Lee, Jong Soo; Ren, Peng; Choi, Taeryon

2017-12-01

Functional data are defined as realizations of random functions (mostly smooth functions) varying over a continuum, which are usually collected on discretized grids with measurement errors. In order to accurately smooth noisy functional observations and deal with the issue of high-dimensional observation grids, we propose a novel Bayesian method based on the Bayesian hierarchical model with a Gaussian-Wishart process prior and basis function representations. We first derive an induced model for the basis-function coefficients of the functional data, and then use this model to conduct posterior inference through Markov chain Monte Carlo methods. Compared to the standard Bayesian inference that suffers serious computational burden and instability in analyzing high-dimensional functional data, our method greatly improves the computational scalability and stability, while inheriting the advantage of simultaneously smoothing raw observations and estimating the mean-covariance functions in a nonparametric way. In addition, our method can naturally handle functional data observed on random or uncommon grids. Simulation and real studies demonstrate that our method produces similar results to those obtainable by the standard Bayesian inference with low-dimensional common grids, while efficiently smoothing and estimating functional data with random and high-dimensional observation grids when the standard Bayesian inference fails. In conclusion, our method can efficiently smooth and estimate high-dimensional functional data, providing one way to resolve the curse of dimensionality for Bayesian functional data analysis with Gaussian-Wishart processes. © 2017, The International Biometric Society.

Estimation of signal-dependent noise level function in transform domain via a sparse recovery model.

PubMed

Yang, Jingyu; Gan, Ziqiao; Wu, Zhaoyang; Hou, Chunping

2015-05-01

This paper proposes a novel algorithm to estimate the noise level function (NLF) of signal-dependent noise (SDN) from a single image based on the sparse representation of NLFs. Noise level samples are estimated from the high-frequency discrete cosine transform (DCT) coefficients of nonlocal-grouped low-variation image patches. Then, an NLF recovery model based on the sparse representation of NLFs under a trained basis is constructed to recover NLF from the incomplete noise level samples. Confidence levels of the NLF samples are incorporated into the proposed model to promote reliable samples and weaken unreliable ones. We investigate the behavior of the estimation performance with respect to the block size, sampling rate, and confidence weighting. Simulation results on synthetic noisy images show that our method outperforms existing state-of-the-art schemes. The proposed method is evaluated on real noisy images captured by three types of commodity imaging devices, and shows consistently excellent SDN estimation performance. The estimated NLFs are incorporated into two well-known denoising schemes, nonlocal means and BM3D, and show significant improvements in denoising SDN-polluted images.

A path-oriented matrix-based knowledge representation system

NASA Technical Reports Server (NTRS)

Feyock, Stefan; Karamouzis, Stamos T.

1993-01-01

Experience has shown that designing a good representation is often the key to turning hard problems into simple ones. Most AI (Artificial Intelligence) search/representation techniques are oriented toward an infinite domain of objects and arbitrary relations among them. In reality much of what needs to be represented in AI can be expressed using a finite domain and unary or binary predicates. Well-known vector- and matrix-based representations can efficiently represent finite domains and unary/binary predicates, and allow effective extraction of path information by generalized transitive closure/path matrix computations. In order to avoid space limitations a set of abstract sparse matrix data types was developed along with a set of operations on them. This representation forms the basis of an intelligent information system for representing and manipulating relational data.

Overcomplete compact representation of two-particle Green's functions

NASA Astrophysics Data System (ADS)

Shinaoka, Hiroshi; Otsuki, Junya; Haule, Kristjan; Wallerberger, Markus; Gull, Emanuel; Yoshimi, Kazuyoshi; Ohzeki, Masayuki

2018-05-01

Two-particle Green's functions and the vertex functions play a critical role in theoretical frameworks for describing strongly correlated electron systems. However, numerical calculations at the two-particle level often suffer from large computation time and massive memory consumption. We derive a general expansion formula for the two-particle Green's functions in terms of an overcomplete representation based on the recently proposed "intermediate representation" basis. The expansion formula is obtained by decomposing the spectral representation of the two-particle Green's function. We demonstrate that the expansion coefficients decay exponentially, while all high-frequency and long-tail structures in the Matsubara-frequency domain are retained. This representation therefore enables efficient treatment of two-particle quantities and opens a route to the application of modern many-body theories to realistic strongly correlated electron systems.

48 CFR 315.204-5 - Part IV-Representations and instructions.

Code of Federal Regulations, 2013 CFR

2013-10-01

... as using too few.) (3) Examples of topics that form a basis for evaluation factors. Typical examples of topics that form a basis for the development of evaluation factors are listed in the following... special research, test, and other equipment or facilities. (vii) Managerial capability (ability to achieve...

48 CFR 315.204-5 - Part IV-Representations and instructions.

Code of Federal Regulations, 2014 CFR

2014-10-01

... as using too few.) (3) Examples of topics that form a basis for evaluation factors. Typical examples of topics that form a basis for the development of evaluation factors are listed in the following... special research, test, and other equipment or facilities. (vii) Managerial capability (ability to achieve...

48 CFR 315.204-5 - Part IV-Representations and instructions.

Code of Federal Regulations, 2012 CFR

2012-10-01

... as using too few.) (3) Examples of topics that form a basis for evaluation factors. Typical examples of topics that form a basis for the development of evaluation factors are listed in the following... special research, test, and other equipment or facilities. (vii) Managerial capability (ability to achieve...

From needs to goals and representations: Foundations for a unified theory of motivation, personality, and development.

PubMed

Dweck, Carol S

2017-11-01

Drawing on both classic and current approaches, I propose a theory that integrates motivation, personality, and development within one framework, using a common set of principles and mechanisms. The theory begins by specifying basic needs and by suggesting how, as people pursue need-fulfilling goals, they build mental representations of their experiences (beliefs, representations of emotions, and representations of action tendencies). I then show how these needs, goals, and representations can serve as the basis of both motivation and personality, and can help to integrate disparate views of personality. The article builds on this framework to provide a new perspective on development, particularly on the forces that propel development and the roles of nature and nurture. I argue throughout that the focus on representations provides an important entry point for change and growth. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Advances in the computation of transonic separated flows over finite wings

NASA Technical Reports Server (NTRS)

Kaynak, Unver; Flores, Jolen

1989-01-01

Problems encountered in numerical simulations of transonic wind-tunnel experiments with low-aspect-ratio wings are surveyed and illustrated. The focus is on the zonal Euler/Navier-Stokes program developed by Holst et al. (1985) and its application to shock-induced separation. The physical basis and numerical implementation of the method are reviewed, and results are presented from studies of the effects of artificial dissipation, boundary conditions, grid refinement, the turbulence model, and geometry representation on the simulation accuracy. Extensive graphs and diagrams and typical flow visualizations are provided.

Excitation basis for (3+1)d topological phases

NASA Astrophysics Data System (ADS)

Delcamp, Clement

2017-12-01

We consider an exactly solvable model in 3+1 dimensions, based on a finite group, which is a natural generalization of Kitaev's quantum double model. The corresponding lattice Hamiltonian yields excitations located at torus-boundaries. By cutting open the three-torus, we obtain a manifold bounded by two tori which supports states satisfying a higher-dimensional version of Ocneanu's tube algebra. This defines an algebraic structure extending the Drinfel'd double. Its irreducible representations, labeled by two fluxes and one charge, characterize the torus-excitations. The tensor product of such representations is introduced in order to construct a basis for (3+1)d gauge models which relies upon the fusion of the defect excitations. This basis is defined on manifolds of the form Σ × S_1 , with Σ a two-dimensional Riemann surface. As such, our construction is closely related to dimensional reduction from (3+1)d to (2+1)d topological orders.

New Approach to Optimize the Apfs Placement Based on Instantaneous Reactive Power Theory by Genetic Algorithm

NASA Astrophysics Data System (ADS)

Hashemi-Dezaki, Hamed; Mohammadalizadeh-Shabestary, Masoud; Askarian-Abyaneh, Hossein; Rezaei-Jegarluei, Mohammad

2014-01-01

In electrical distribution systems, a great amount of power are wasting across the lines, also nowadays power factors, voltage profiles and total harmonic distortions (THDs) of most loads are not as would be desired. So these important parameters of a system play highly important role in wasting money and energy, and besides both consumers and sources are suffering from a high rate of distortions and even instabilities. Active power filters (APFs) are innovative ideas for solving of this adversity which have recently used instantaneous reactive power theory. In this paper, a novel method is proposed to optimize the allocation of APFs. The introduced method is based on the instantaneous reactive power theory in vectorial representation. By use of this representation, it is possible to asses different compensation strategies. Also, APFs proper placement in the system plays a crucial role in either reducing the losses costs and power quality improvement. To optimize the APFs placement, a new objective function has been defined on the basis of five terms: total losses, power factor, voltage profile, THD and cost. Genetic algorithm has been used to solve the optimization problem. The results of applying this method to a distribution network illustrate the method advantages.

Improving the learning of clinical reasoning through computer-based cognitive representation.

PubMed

Wu, Bian; Wang, Minhong; Johnson, Janice M; Grotzer, Tina A

2014-01-01

Objective Clinical reasoning is usually taught using a problem-solving approach, which is widely adopted in medical education. However, learning through problem solving is difficult as a result of the contextualization and dynamic aspects of actual problems. Moreover, knowledge acquired from problem-solving practice tends to be inert and fragmented. This study proposed a computer-based cognitive representation approach that externalizes and facilitates the complex processes in learning clinical reasoning. The approach is operationalized in a computer-based cognitive representation tool that involves argument mapping to externalize the problem-solving process and concept mapping to reveal the knowledge constructed from the problems. Methods Twenty-nine Year 3 or higher students from a medical school in east China participated in the study. Participants used the proposed approach implemented in an e-learning system to complete four learning cases in 4 weeks on an individual basis. For each case, students interacted with the problem to capture critical data, generate and justify hypotheses, make a diagnosis, recall relevant knowledge, and update their conceptual understanding of the problem domain. Meanwhile, students used the computer-based cognitive representation tool to articulate and represent the key elements and their interactions in the learning process. Results A significant improvement was found in students' learning products from the beginning to the end of the study, consistent with students' report of close-to-moderate progress in developing problem-solving and knowledge-construction abilities. No significant differences were found between the pretest and posttest scores with the 4-week period. The cognitive representation approach was found to provide more formative assessment. Conclusions The computer-based cognitive representation approach improved the learning of clinical reasoning in both problem solving and knowledge construction.

Improving the learning of clinical reasoning through computer-based cognitive representation

PubMed Central

Wu, Bian; Wang, Minhong; Johnson, Janice M.; Grotzer, Tina A.

2014-01-01

Objective Clinical reasoning is usually taught using a problem-solving approach, which is widely adopted in medical education. However, learning through problem solving is difficult as a result of the contextualization and dynamic aspects of actual problems. Moreover, knowledge acquired from problem-solving practice tends to be inert and fragmented. This study proposed a computer-based cognitive representation approach that externalizes and facilitates the complex processes in learning clinical reasoning. The approach is operationalized in a computer-based cognitive representation tool that involves argument mapping to externalize the problem-solving process and concept mapping to reveal the knowledge constructed from the problems. Methods Twenty-nine Year 3 or higher students from a medical school in east China participated in the study. Participants used the proposed approach implemented in an e-learning system to complete four learning cases in 4 weeks on an individual basis. For each case, students interacted with the problem to capture critical data, generate and justify hypotheses, make a diagnosis, recall relevant knowledge, and update their conceptual understanding of the problem domain. Meanwhile, students used the computer-based cognitive representation tool to articulate and represent the key elements and their interactions in the learning process. Results A significant improvement was found in students’ learning products from the beginning to the end of the study, consistent with students’ report of close-to-moderate progress in developing problem-solving and knowledge-construction abilities. No significant differences were found between the pretest and posttest scores with the 4-week period. The cognitive representation approach was found to provide more formative assessment. Conclusions The computer-based cognitive representation approach improved the learning of clinical reasoning in both problem solving and knowledge construction. PMID:25518871

Method of optimum channel switching in equipment of infocommunication network in conditions of cyber attacks to their telecommunication infrastructure.

NASA Astrophysics Data System (ADS)

Kochedykov, S. S.; Noev, A. N.; Dushkin, A. V.; Gubin, I. A.

2018-05-01

On the basis of the mathematical graph theory, the method of optimum switching of infocommunication networks in the conditions of cyber attacks is developed. The idea of representation of a set of possible ways on the graph in the form of the multilevel tree ordered by rules of algebra of a logic theory is the cornerstone of a method. As a criterion of optimization, the maximum of network transmission capacity to which assessment Ford- Falkerson's theorem is applied is used. The method is realized in the form of a numerical algorithm, which can be used not only for design, but also for operational management of infocommunication networks in conditions of violation of the functioning of their switching centers.

Accurate donor electron wave functions from a multivalley effective mass theory.

NASA Astrophysics Data System (ADS)

Pendo, Luke; Hu, Xuedong

Multivalley effective mass (MEM) theories combine physical intuition with a marginal need for computational resources, but they tend to be insensitive to variations in the wavefunction. However, recent papers suggest full Bloch functions and suitable central cell donor potential corrections are essential to replicating qualitative and quantitative features of the wavefunction. In this talk, we consider a variational MEM method that can accurately predict both spectrum and wavefunction of isolated phosphorus donors. As per Gamble et. al, we employ a truncated series representation of the Bloch function with a tetrahedrally symmetric central cell correction. We use a dynamic dielectric constant, a feature commonly seen in tight-binding methods. Uniquely, we use a freely extensible basis of either all Slater- or all Gaussian-type functions. With a large basis able to capture the influence of higher energy eigenstates, this method is well positioned to consider the influence of external perturbations, such as electric field or applied strain, on the charge density. This work is supported by the US Army Research Office (W911NF1210609).

Science, education and industry information resources complementarity as a basis for design of knowledge management systems

NASA Astrophysics Data System (ADS)

Maksimov, N. V.; Tikhomirov, G. V.; Golitsyna, O. L.

2017-01-01

The main problems and circumstances that influence the processes of creating effective knowledge management systems were described. These problems particularly include high species diversity of instruments for knowledge representation, lack of adequate lingware, including formal representation of semantic relationships. For semantic data descriptions development a conceptual model of the subject area and a conceptual-lexical system should be designed on proposals of ISO-15926 standard. It is proposed to conduct an information integration of educational and production processes on the basis of information systems technologies. Integrated knowledge management system information environment combines both traditional information resources and specific information resources of subject domain including task context and implicit/tacit knowledge.

Hierarchical representation and machine learning from faulty jet engine behavioral examples to detect real time abnormal conditions

NASA Technical Reports Server (NTRS)

Gupta, U. K.; Ali, M.

1988-01-01

The theoretical basis and operation of LEBEX, a machine-learning system for jet-engine performance monitoring, are described. The behavior of the engine is modeled in terms of four parameters (the rotational speeds of the high- and low-speed sections and the exhaust and combustion temperatures), and parameter variations indicating malfunction are transformed into structural representations involving instances and events. LEBEX extracts descriptors from a set of training data on normal and faulty engines, represents them hierarchically in a knowledge base, and uses them to diagnose and predict faults on a real-time basis. Diagrams of the system architecture and printouts of typical results are shown.

Numerical integration techniques for curved-element discretizations of molecule-solvent interfaces.

PubMed

Bardhan, Jaydeep P; Altman, Michael D; Willis, David J; Lippow, Shaun M; Tidor, Bruce; White, Jacob K

2007-07-07

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, here methods were developed to model several important surface formulations using exact surface discretizations. Following and refining Zauhar's work [J. Comput.-Aided Mol. Des. 9, 149 (1995)], two classes of curved elements were defined that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. Numerical integration techniques are presented that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, a set of calculations are presented that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planar-triangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute-solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved approximations with increasing discretization and associated increases in computational resources. The results clearly demonstrate that the methods for approximate integration on an exact geometry are far more accurate than exact integration on an approximate geometry. A MATLAB implementation of the presented integration methods and sample data files containing curved-element discretizations of several small molecules are available online as supplemental material.

High-resolution time-frequency representation of EEG data using multi-scale wavelets

NASA Astrophysics Data System (ADS)

Li, Yang; Cui, Wei-Gang; Luo, Mei-Lin; Li, Ke; Wang, Lina

2017-09-01

An efficient time-varying autoregressive (TVAR) modelling scheme that expands the time-varying parameters onto the multi-scale wavelet basis functions is presented for modelling nonstationary signals and with applications to time-frequency analysis (TFA) of electroencephalogram (EEG) signals. In the new parametric modelling framework, the time-dependent parameters of the TVAR model are locally represented by using a novel multi-scale wavelet decomposition scheme, which can allow the capability to capture the smooth trends as well as track the abrupt changes of time-varying parameters simultaneously. A forward orthogonal least square (FOLS) algorithm aided by mutual information criteria are then applied for sparse model term selection and parameter estimation. Two simulation examples illustrate that the performance of the proposed multi-scale wavelet basis functions outperforms the only single-scale wavelet basis functions or Kalman filter algorithm for many nonstationary processes. Furthermore, an application of the proposed method to a real EEG signal demonstrates the new approach can provide highly time-dependent spectral resolution capability.

Representation of the five- and six-dimensional harmonic oscillators in a u(5) ⊃ so(5) ⊃ so(3) basis

NASA Astrophysics Data System (ADS)

Rowe, D. J.

1994-06-01

The duality that exists between the two subgroups SU(1,1) and O(5) of Sp(5,R) to construct basis states for the five-dimensional harmonic oscillator which simultaneously reduce the Sp(5,R)⊇U(5)⊇O(5)⊇SO(3) and Sp(5,R)⊇ SU(1,1)⊇U(1) subgroup chains is used. It is shown that the vector-coherent-state wave functions of the fundamental five-dimensional SO(5) irrep [1,0] realize the traceless bosons introduced by Lohe and Hurst to classify the irreps of the orthogonal groups and employed in Chacon, Moshinsky, and Sharp's construction of a basis for the five-dimensional harmonic oscillator. Moreover, it is shown that VCS theory provides a simple mechanism for constructing matrix elements of the traceless boson operators. These matrix elements are used to extend the VCS representations of SO(5) in an SO(3) basis, given in a previous paper, to irreps of U(5) in an SO(5)⊇ SO(3) basis. The extension to U(6)⊇U(5)⊇SO(5)⊇SO(3) is also given.

Sparse representation of whole-brain fMRI signals for identification of functional networks.

PubMed

Lv, Jinglei; Jiang, Xi; Li, Xiang; Zhu, Dajiang; Chen, Hanbo; Zhang, Tuo; Zhang, Shu; Hu, Xintao; Han, Junwei; Huang, Heng; Zhang, Jing; Guo, Lei; Liu, Tianming

2015-02-01

There have been several recent studies that used sparse representation for fMRI signal analysis and activation detection based on the assumption that each voxel's fMRI signal is linearly composed of sparse components. Previous studies have employed sparse coding to model functional networks in various modalities and scales. These prior contributions inspired the exploration of whether/how sparse representation can be used to identify functional networks in a voxel-wise way and on the whole brain scale. This paper presents a novel, alternative methodology of identifying multiple functional networks via sparse representation of whole-brain task-based fMRI signals. Our basic idea is that all fMRI signals within the whole brain of one subject are aggregated into a big data matrix, which is then factorized into an over-complete dictionary basis matrix and a reference weight matrix via an effective online dictionary learning algorithm. Our extensive experimental results have shown that this novel methodology can uncover multiple functional networks that can be well characterized and interpreted in spatial, temporal and frequency domains based on current brain science knowledge. Importantly, these well-characterized functional network components are quite reproducible in different brains. In general, our methods offer a novel, effective and unified solution to multiple fMRI data analysis tasks including activation detection, de-activation detection, and functional network identification. Copyright © 2014 Elsevier B.V. All rights reserved.

Temporal abstraction and temporal Bayesian networks in clinical domains: a survey.

PubMed

Orphanou, Kalia; Stassopoulou, Athena; Keravnou, Elpida

2014-03-01

Temporal abstraction (TA) of clinical data aims to abstract and interpret clinical data into meaningful higher-level interval concepts. Abstracted concepts are used for diagnostic, prediction and therapy planning purposes. On the other hand, temporal Bayesian networks (TBNs) are temporal extensions of the known probabilistic graphical models, Bayesian networks. TBNs can represent temporal relationships between events and their state changes, or the evolution of a process, through time. This paper offers a survey on techniques/methods from these two areas that were used independently in many clinical domains (e.g. diabetes, hepatitis, cancer) for various clinical tasks (e.g. diagnosis, prognosis). A main objective of this survey, in addition to presenting the key aspects of TA and TBNs, is to point out important benefits from a potential integration of TA and TBNs in medical domains and tasks. The motivation for integrating these two areas is their complementary function: TA provides clinicians with high level views of data while TBNs serve as a knowledge representation and reasoning tool under uncertainty, which is inherent in all clinical tasks. Key publications from these two areas of relevance to clinical systems, mainly circumscribed to the latest two decades, are reviewed and classified. TA techniques are compared on the basis of: (a) knowledge acquisition and representation for deriving TA concepts and (b) methodology for deriving basic and complex temporal abstractions. TBNs are compared on the basis of: (a) representation of time, (b) knowledge representation and acquisition, (c) inference methods and the computational demands of the network, and (d) their applications in medicine. The survey performs an extensive comparative analysis to illustrate the separate merits and limitations of various TA and TBN techniques used in clinical systems with the purpose of anticipating potential gains through an integration of the two techniques, thus leading to a unified methodology for clinical systems. The surveyed contributions are evaluated using frameworks of respective key features. In addition, for the evaluation of TBN methods, a unifying clinical domain (diabetes) is used. The main conclusion transpiring from this review is that techniques/methods from these two areas, that so far are being largely used independently of each other in clinical domains, could be effectively integrated in the context of medical decision-support systems. The anticipated key benefits of the perceived integration are: (a) during problem solving, the reasoning can be directed at different levels of temporal and/or conceptual abstractions since the nodes of the TBNs can be complex entities, temporally and structurally and (b) during model building, knowledge generated in the form of basic and/or complex abstractions, can be deployed in a TBN. Copyright © 2014 Elsevier B.V. All rights reserved.

Machine learning of neural representations of suicide and emotion concepts identifies suicidal youth

PubMed Central

Just, Marcel Adam; Pan, Lisa; Cherkassky, Vladimir L.; McMakin, Dana; Cha, Christine; Nock, Matthew K.; Brent, David

2017-01-01

The clinical assessment of suicidal risk would be significantly complemented by a biologically-based measure that assesses alterations in the neural representations of concepts related to death and life in people who engage in suicidal ideation. This study used machine-learning algorithms (Gaussian Naïve Bayes) to identify such individuals (17 suicidal ideators vs 17 controls) with high (91%) accuracy, based on their altered fMRI neural signatures of death and life-related concepts. The most discriminating concepts were death, cruelty, trouble, carefree, good, and praise. A similar classification accurately (94%) discriminated 9 suicidal ideators who had made a suicide attempt from 8 who had not. Moreover, a major facet of the concept alterations was the evoked emotion, whose neural signature served as an alternative basis for accurate (85%) group classification. The study establishes a biological, neurocognitive basis for altered concept representations in participants with suicidal ideation, which enables highly accurate group membership classification. PMID:29367952

Representation and visualization of variability in a 3D anatomical atlas using the kidney as an example

NASA Astrophysics Data System (ADS)

Hacker, Silke; Handels, Heinz

2006-03-01

Computer-based 3D atlases allow an interactive exploration of the human body. However, in most cases such 3D atlases are derived from one single individual, and therefore do not regard the variability of anatomical structures concerning their shape and size. Since the geometric variability across humans plays an important role in many medical applications, our goal is to develop a framework of an anatomical atlas for representation and visualization of the variability of selected anatomical structures. The basis of the project presented is the VOXEL-MAN atlas of inner organs that was created from the Visible Human data set. For modeling anatomical shapes and their variability we utilize "m-reps" which allow a compact representation of anatomical objects on the basis of their skeletons. As an example we used a statistical model of the kidney that is based on 48 different variants. With the integration of a shape description into the VOXEL-MAN atlas it is now possible to query and visualize different shape variations of an organ, e.g. by specifying a person's age or gender. In addition to the representation of individual shape variants, the average shape of a population can be displayed. Besides a surface representation, a volume-based representation of the kidney's shape variants is also possible. It results from the deformation of the reference kidney of the volume-based model using the m-rep shape description. In this way a realistic visualization of the shape variants becomes possible, as well as the visualization of the organ's internal structures.

Tensor numerical methods in quantum chemistry: from Hartree-Fock to excitation energies.

PubMed

Khoromskaia, Venera; Khoromskij, Boris N

2015-12-21

We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely grid-based tensor-structured 3D Hartree-Fock eigenvalue solver. It benefits from tensor calculation of the core Hamiltonian and two-electron integrals (TEI) in O(n log n) complexity using the rank-structured approximation of basis functions, electron densities and convolution integral operators all represented on 3D n × n × n Cartesian grids. The algorithm for calculating TEI tensor in a form of the Cholesky decomposition is based on multiple factorizations using algebraic 1D "density fitting" scheme, which yield an almost irreducible number of product basis functions involved in the 3D convolution integrals, depending on a threshold ε > 0. The basis functions are not restricted to separable Gaussians, since the analytical integration is substituted by high-precision tensor-structured numerical quadratures. The tensor approaches to post-Hartree-Fock calculations for the MP2 energy correction and for the Bethe-Salpeter excitation energies, based on using low-rank factorizations and the reduced basis method, were recently introduced. Another direction is towards the tensor-based Hartree-Fock numerical scheme for finite lattices, where one of the numerical challenges is the summation of electrostatic potentials of a large number of nuclei. The 3D grid-based tensor method for calculation of a potential sum on a L × L × L lattice manifests the linear in L computational work, O(L), instead of the usual O(L(3) log L) scaling by the Ewald-type approaches.

Pneumothorax detection in chest radiographs using local and global texture signatures

NASA Astrophysics Data System (ADS)

Geva, Ofer; Zimmerman-Moreno, Gali; Lieberman, Sivan; Konen, Eli; Greenspan, Hayit

2015-03-01

A novel framework for automatic detection of pneumothorax abnormality in chest radiographs is presented. The suggested method is based on a texture analysis approach combined with supervised learning techniques. The proposed framework consists of two main steps: at first, a texture analysis process is performed for detection of local abnormalities. Labeled image patches are extracted in the texture analysis procedure following which local analysis values are incorporated into a novel global image representation. The global representation is used for training and detection of the abnormality at the image level. The presented global representation is designed based on the distinctive shape of the lung, taking into account the characteristics of typical pneumothorax abnormalities. A supervised learning process was performed on both the local and global data, leading to trained detection system. The system was tested on a dataset of 108 upright chest radiographs. Several state of the art texture feature sets were experimented with (Local Binary Patterns, Maximum Response filters). The optimal configuration yielded sensitivity of 81% with specificity of 87%. The results of the evaluation are promising, establishing the current framework as a basis for additional improvements and extensions.

Cortical representations of communication sounds.

PubMed

Heiser, Marc A; Cheung, Steven W

2008-10-01

This review summarizes recent research into cortical processing of vocalizations in animals and humans. There has been a resurgent interest in this topic accompanied by an increased number of studies using animal models with complex vocalizations and new methods in human brain imaging. Recent results from such studies are discussed. Experiments have begun to reveal the bilateral cortical fields involved in communication sound processing and the transformations of neural representations that occur among those fields. Advances have also been made in understanding the neuronal basis of interaction between developmental exposures and behavioral experiences with vocalization perception. Exposure to sounds during the developmental period produces large effects on brain responses, as do a variety of specific trained tasks in adults. Studies have also uncovered a neural link between the motor production of vocalizations and the representation of vocalizations in cortex. Parallel experiments in humans and animals are answering important questions about vocalization processing in the central nervous system. This dual approach promises to reveal microscopic, mesoscopic, and macroscopic principles of large-scale dynamic interactions between brain regions that underlie the complex phenomenon of vocalization perception. Such advances will yield a greater understanding of the causes, consequences, and treatment of disorders related to speech processing.

Toroidal gyro-Landau fluid model turbulence simulations in a nonlinear ballooning mode representation with radial modes

NASA Astrophysics Data System (ADS)

Waltz, R. E.; Kerbel, G. D.; Milovich, J.

1994-07-01

The method of Hammett and Perkins [Phys. Rev. Lett. 64, 3019 (1990)] to model Landau damping has been recently applied to the moments of the gyrokinetic equation with curvature drift by Waltz, Dominguez, and Hammett [Phys. Fluids B 4, 3138 (1992)]. The higher moments are truncated in terms of the lower moments (density, parallel velocity, and parallel and perpendicular pressure) by modeling the deviation from a perturbed Maxwellian to fit the kinetic response function at all values of the kinetic parameters: k∥vth/ω, b=(k⊥ρ)2/2, and ωD/ω. Here the resulting gyro-Landau fluid equations are applied to the simulation of ion temperature gradient (ITG) mode turbulence in toroidal geometry using a novel three-dimensional (3-D) nonlinear ballooning mode representation. The representation is a Fourier transform of a field line following basis (ky',kx',z') with periodicity in toroidal and poloidal angles. Particular emphasis is given to the role of nonlinearly generated n=0 (ky' = 0, kx' ≠ 0) ``radial modes'' in stabilizing the transport from the finite-n ITG ballooning modes. Detailing the parametric dependence of toroidal ITG turbulence is a key result.

Toroidal turbulence simulations with gyro-Landau fluid models in a nonlinear ballooning mode representation

NASA Astrophysics Data System (ADS)

Waltz, R. E.; Kerbel, G. D.

1994-05-01

The method of Hammett and Perkins [Phys. Rev. Lett. 64, 3019 (1990)] to model Landau damping has been recently applied to the moments of the gyro-kinetic equation with curvature drift by Waltz, Dominguez, and Hammett [Phys. Fluids B 4, 3138 (1992)]. The higher moments are truncated in terms of the lower moments (density, parallel velocity, and parallel and perpendicular pressure) by modeling the deviation from a perturbed Maxwellian to fit the kinetic response function at all values of the kinetic parameters: k∥vth/ω, b=(k⊥ρ)2/2, and ωD/ω. Here the resulting gyro-Landau fluid equations are applied to the simulation of ion temperature gradient (ITG) mode turbulence in toroidal geometry using a novel 3D nonlinear ballooning mode representation. The representation is a Fourier transform of the Cowley et al. [Phys. Fluids B 3, 2767 (1991)] field line following twisted eddy basis (kx',ky',z') with periodicity in toroidal and poloidal angles. Particular emphasis is given to the role of nonlinearly generated n=0 (ky'=0, kx'≠0) ``radial modes'' in stabilizing the transport from the finite-n ITG ballooning modes.

Representations of Death Among Italian Vegetarians: An Ethnographic Research on Environment, Disgust and Transcendence

PubMed Central

Testoni, Ines; Ghellar, Tommaso; Rodelli, Maddalena; De Cataldo, Loriana; Zamperini, Adriano

2017-01-01

This paper focuses on the motives for vegetarian choices in contemporary Italian food culture, with specific reference to the role of the representations of death. The study adopts a qualitative research design aimed at an in-depth exploration of the reasons for avoiding meat, following an ethnographic method. Twenty-two participants (55% women, 45% men) aged 19-74, all vegetarians or vegans, mainly from Northern and Central Italy, were involved. Data from the Interpretative Phenomenological Analysis were examined according to the qualitative thematic analysis: the results show the role of death in the construction of disgust towards meat, running parallel with an emphasis on spirituality, ethical treatment of animals and the environment as reasons for avoiding meat, in particular, the concern-generating disgust and its relationship with the representation of death as a contaminating essence. The basis of disgust lies in this connection, from which the idea that oral consumption of contaminants characterized by corruptive properties, passing through the flesh of dead animals to humans, derives. The role of anti-speciesism is considered as a latent perspective, which may influence the vegetarian and vegan choices. PMID:28904591

Space-Time and Architecture

NASA Astrophysics Data System (ADS)

Field, F.; Goodbun, J.; Watson, V.

Architects have a role to play in interplanetary space that has barely yet been explored. The architectural community is largely unaware of this new territory, for which there is still no agreed method of practice. There is moreover a general confusion, in scientific and related fields, over what architects might actually do there today. Current extra-planetary designs generally fail to explore the dynamic and relational nature of space-time, and often reduce human habitation to a purely functional problem. This is compounded by a crisis over the representation (drawing) of space-time. The present work returns to first principles of architecture in order to realign them with current socio-economic and technological trends surrounding the space industry. What emerges is simultaneously the basis for an ecological space architecture, and the representational strategies necessary to draw it. We explore this approach through a work of design-based research that describes the construction of Ocean; a huge body of water formed by the collision of two asteroids at the Translunar Lagrange Point (L2), that would serve as a site for colonisation, and as a resource to fuel future missions. Ocean is an experimental model for extra-planetary space design and its representation, within the autonomous discipline of architecture.

Non-Negative Spherical Deconvolution (NNSD) for estimation of fiber Orientation Distribution Function in single-/multi-shell diffusion MRI.

PubMed

Cheng, Jian; Deriche, Rachid; Jiang, Tianzi; Shen, Dinggang; Yap, Pew-Thian

2014-11-01

Spherical Deconvolution (SD) is commonly used for estimating fiber Orientation Distribution Functions (fODFs) from diffusion-weighted signals. Existing SD methods can be classified into two categories: 1) Continuous Representation based SD (CR-SD), where typically Spherical Harmonic (SH) representation is used for convenient analytical solutions, and 2) Discrete Representation based SD (DR-SD), where the signal profile is represented by a discrete set of basis functions uniformly oriented on the unit sphere. A feasible fODF should be non-negative and should integrate to unity throughout the unit sphere S(2). However, to our knowledge, most existing SH-based SD methods enforce non-negativity only on discretized points and not the whole continuum of S(2). Maximum Entropy SD (MESD) and Cartesian Tensor Fiber Orientation Distributions (CT-FOD) are the only SD methods that ensure non-negativity throughout the unit sphere. They are however computational intensive and are susceptible to errors caused by numerical spherical integration. Existing SD methods are also known to overestimate the number of fiber directions, especially in regions with low anisotropy. DR-SD introduces additional error in peak detection owing to the angular discretization of the unit sphere. This paper proposes a SD framework, called Non-Negative SD (NNSD), to overcome all the limitations above. NNSD is significantly less susceptible to the false-positive peaks, uses SH representation for efficient analytical spherical deconvolution, and allows accurate peak detection throughout the whole unit sphere. We further show that NNSD and most existing SD methods can be extended to work on multi-shell data by introducing a three-dimensional fiber response function. We evaluated NNSD in comparison with Constrained SD (CSD), a quadratic programming variant of CSD, MESD, and an L1-norm regularized non-negative least-squares DR-SD. Experiments on synthetic and real single-/multi-shell data indicate that NNSD improves estimation performance in terms of mean difference of angles, peak detection consistency, and anisotropy contrast between isotropic and anisotropic regions. Copyright © 2014 Elsevier Inc. All rights reserved.

Trend surface models in the representation and analysis of time factors in cancer mortality.

PubMed

Cislaghi, C; Negri, E; La Vecchia, C; Levi, F

1990-01-01

A method of graphic representation of time factors in cancer mortality is presented, based on different tonalities of grey applied to the surface of the matrix defined by various age-specific rates. It is illustrated using mortality data from cancers of the mouth or pharynx, oesophagus, larynx and lung in Italian and Swiss males. Progressively more complex regression surface equations are defined, on the basis of two independent variables (age and cohort) and a dependent one (each age-specific rate). General patterns of trends were thus identified, showing important similarities in cohort and period effects, but also noticeable differences in time-related factors in mortality from various neoplasms of the upper digestive and respiratory tract. For instance, there were declines in mortality from cancers of the mouth or pharynx in the oldest age groups, whereas rates were appreciably upwards at younger and middle age, particularly in Italy. Likewise, cancers of the oesophagus and, chiefly, of the larynx were substantially increasing, on a cohort basis, in oldest Italian males. Temporal pattern for laryngeal cancer in Italy was similar to that of lung cancer, thus suggesting that (cigarette) smoking has a greater impact on this cancer site as compared with alcohol. However, it is difficult to explain, on this basis alone, the totally diverging pattern for cancer of the larynx (downwards) and of the lung (upwards) observed among older Swiss males. These examples indicate that trend surface models are a useful summary guide to illustrate and understand the general patterns of age, period and cohort effects in cancer mortality.

From plane waves to local Gaussians for the simulation of correlated periodic systems

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

Booth, George H., E-mail: george.booth@kcl.ac.uk; Tsatsoulis, Theodoros; Grüneis, Andreas, E-mail: a.grueneis@fkf.mpg.de

2016-08-28

We present a simple, robust, and black-box approach to the implementation and use of local, periodic, atom-centered Gaussian basis functions within a plane wave code, in a computationally efficient manner. The procedure outlined is based on the representation of the Gaussians within a finite bandwidth by their underlying plane wave coefficients. The core region is handled within the projected augment wave framework, by pseudizing the Gaussian functions within a cutoff radius around each nucleus, smoothing the functions so that they are faithfully represented by a plane wave basis with only moderate kinetic energy cutoff. To mitigate the effects of themore » basis set superposition error and incompleteness at the mean-field level introduced by the Gaussian basis, we also propose a hybrid approach, whereby the complete occupied space is first converged within a large plane wave basis, and the Gaussian basis used to construct a complementary virtual space for the application of correlated methods. We demonstrate that these pseudized Gaussians yield compact and systematically improvable spaces with an accuracy comparable to their non-pseudized Gaussian counterparts. A key advantage of the described method is its ability to efficiently capture and describe electronic correlation effects of weakly bound and low-dimensional systems, where plane waves are not sufficiently compact or able to be truncated without unphysical artifacts. We investigate the accuracy of the pseudized Gaussians for the water dimer interaction, neon solid, and water adsorption on a LiH surface, at the level of second-order Møller–Plesset perturbation theory.« less

Dimensional analysis using toric ideals: primitive invariants.

PubMed

Atherton, Mark A; Bates, Ronald A; Wynn, Henry P

2014-01-01

Classical dimensional analysis in its original form starts by expressing the units for derived quantities, such as force, in terms of power products of basic units [Formula: see text] etc. This suggests the use of toric ideal theory from algebraic geometry. Within this the Graver basis provides a unique primitive basis in a well-defined sense, which typically has more terms than the standard Buckingham approach. Some textbook examples are revisited and the full set of primitive invariants found. First, a worked example based on convection is introduced to recall the Buckingham method, but using computer algebra to obtain an integer [Formula: see text] matrix from the initial integer [Formula: see text] matrix holding the exponents for the derived quantities. The [Formula: see text] matrix defines the dimensionless variables. But, rather than this integer linear algebra approach it is shown how, by staying with the power product representation, the full set of invariants (dimensionless groups) is obtained directly from the toric ideal defined by [Formula: see text]. One candidate for the set of invariants is a simple basis of the toric ideal. This, although larger than the rank of [Formula: see text], is typically not unique. However, the alternative Graver basis is unique and defines a maximal set of invariants, which are primitive in a simple sense. In addition to the running example four examples are taken from: a windmill, convection, electrodynamics and the hydrogen atom. The method reveals some named invariants. A selection of computer algebra packages is used to show the considerable ease with which both a simple basis and a Graver basis can be found.

An RBF-based compression method for image-based relighting.

PubMed

Leung, Chi-Sing; Wong, Tien-Tsin; Lam, Ping-Man; Choy, Kwok-Hung

2006-04-01

In image-based relighting, a pixel is associated with a number of sampled radiance values. This paper presents a two-level compression method. In the first level, the plenoptic property of a pixel is approximated by a spherical radial basis function (SRBF) network. That means that the spherical plenoptic function of each pixel is represented by a number of SRBF weights. In the second level, we apply a wavelet-based method to compress these SRBF weights. To reduce the visual artifact due to quantization noise, we develop a constrained method for estimating the SRBF weights. Our proposed approach is superior to JPEG, JPEG2000, and MPEG. Compared with the spherical harmonics approach, our approach has a lower complexity, while the visual quality is comparable. The real-time rendering method for our SRBF representation is also discussed.

On Holo-Hilbert Spectral Analysis: A Full Informational Spectral Representation for Nonlinear and Non-Stationary Data

NASA Technical Reports Server (NTRS)

Huang, Norden E.; Hu, Kun; Yang, Albert C. C.; Chang, Hsing-Chih; Jia, Deng; Liang, Wei-Kuang; Yeh, Jia Rong; Kao, Chu-Lan; Juan, Chi-Huang; Peng, Chung Kang;

On Holo-Hilbert spectral analysis: a full informational spectral representation for nonlinear and non-stationary data

PubMed Central

Huang, Norden E.; Hu, Kun; Yang, Albert C. C.; Chang, Hsing-Chih; Jia, Deng; Liang, Wei-Kuang; Yeh, Jia Rong; Kao, Chu-Lan; Juan, Chi-Hung; Peng, Chung Kang; Meijer, Johanna H.; Wang, Yung-Hung; Long, Steven R.; Wu, Zhauhua

2016-01-01

The Holo-Hilbert spectral analysis (HHSA) method is introduced to cure the deficiencies of traditional spectral analysis and to give a full informational representation of nonlinear and non-stationary data. It uses a nested empirical mode decomposition and Hilbert–Huang transform (HHT) approach to identify intrinsic amplitude and frequency modulations often present in nonlinear systems. Comparisons are first made with traditional spectrum analysis, which usually achieved its results through convolutional integral transforms based on additive expansions of an a priori determined basis, mostly under linear and stationary assumptions. Thus, for non-stationary processes, the best one could do historically was to use the time–frequency representations, in which the amplitude (or energy density) variation is still represented in terms of time. For nonlinear processes, the data can have both amplitude and frequency modulations (intra-mode and inter-mode) generated by two different mechanisms: linear additive or nonlinear multiplicative processes. As all existing spectral analysis methods are based on additive expansions, either a priori or adaptive, none of them could possibly represent the multiplicative processes. While the earlier adaptive HHT spectral analysis approach could accommodate the intra-wave nonlinearity quite remarkably, it remained that any inter-wave nonlinear multiplicative mechanisms that include cross-scale coupling and phase-lock modulations were left untreated. To resolve the multiplicative processes issue, additional dimensions in the spectrum result are needed to account for the variations in both the amplitude and frequency modulations simultaneously. HHSA accommodates all the processes: additive and multiplicative, intra-mode and inter-mode, stationary and non-stationary, linear and nonlinear interactions. The Holo prefix in HHSA denotes a multiple dimensional representation with both additive and multiplicative capabilities. PMID:26953180

High resolution OCT image generation using super resolution via sparse representation

NASA Astrophysics Data System (ADS)

Asif, Muhammad; Akram, Muhammad Usman; Hassan, Taimur; Shaukat, Arslan; Waqar, Razi

2017-02-01

In this paper we propose a technique for obtaining a high resolution (HR) image from a single low resolution (LR) image -using joint learning dictionary - on the basis of image statistic research. It suggests that with an appropriate choice of an over-complete dictionary, image patches can be well represented as a sparse linear combination. Medical imaging for clinical analysis and medical intervention is being used for creating visual representations of the interior of a body, as well as visual representation of the function of some organs or tissues (physiology). A number of medical imaging techniques are in use like MRI, CT scan, X-rays and Optical Coherence Tomography (OCT). OCT is one of the new technologies in medical imaging and one of its uses is in ophthalmology where it is being used for analysis of the choroidal thickness in the eyes in healthy and disease states such as age-related macular degeneration, central serous chorioretinopathy, diabetic retinopathy and inherited retinal dystrophies. We have proposed a technique for enhancing the OCT images which can be used for clearly identifying and analyzing the particular diseases. Our method uses dictionary learning technique for generating a high resolution image from a single input LR image. We train two joint dictionaries, one with OCT images and the second with multiple different natural images, and compare the results with previous SR technique. Proposed method for both dictionaries produces HR images which are comparatively superior in quality with the other proposed method of SR. Proposed technique is very effective for noisy OCT images and produces up-sampled and enhanced OCT images.

A Selective-Echo Method for Chemical-Shift Imaging of Two-Component Systems

NASA Astrophysics Data System (ADS)

Gerald, Rex E., II; Krasavin, Anatoly O.; Botto, Robert E.

A simple and effective method for selectively imaging either one of two chemical species in a two-component system is presented and demonstrated experimentally. The pulse sequence employed, selective- echo chemical- shift imaging (SECSI), is a hybrid (frequency-selective/ T1-contrast) technique that is executed in a short period of time, utilizes the full Boltzmann magnetization of each chemical species to form the corresponding image, and requires only hard pulses of quadrature phase. This approach provides a direct and unambiguous representation of the spatial distribution of the two chemical species. In addition, the performance characteristics and the advantages of the SECSI sequence are compared on a common basis to those of other pulse sequences.

Standard model of knowledge representation

NASA Astrophysics Data System (ADS)

Yin, Wensheng

2016-09-01

Knowledge representation is the core of artificial intelligence research. Knowledge representation methods include predicate logic, semantic network, computer programming language, database, mathematical model, graphics language, natural language, etc. To establish the intrinsic link between various knowledge representation methods, a unified knowledge representation model is necessary. According to ontology, system theory, and control theory, a standard model of knowledge representation that reflects the change of the objective world is proposed. The model is composed of input, processing, and output. This knowledge representation method is not a contradiction to the traditional knowledge representation method. It can express knowledge in terms of multivariate and multidimensional. It can also express process knowledge, and at the same time, it has a strong ability to solve problems. In addition, the standard model of knowledge representation provides a way to solve problems of non-precision and inconsistent knowledge.

An efficient approach to CI: General matrix element formulas for spin-coupled particle-hole excitations

NASA Astrophysics Data System (ADS)

Tavan, Paul; Schulten, Klaus

1980-03-01

A new, efficient algorithm for the evaluation of the matrix elements of the CI Hamiltonian in the basis of spin-coupled ν-fold excitations (over orthonormal orbitals) is developed for even electron systems. For this purpose we construct an orthonormal, spin-adapted CI basis in the framework of second quantization. As a prerequisite, spin and space parts of the fermion operators have to be separated; this makes it possible to introduce the representation theory of the permutation group. The ν-fold excitation operators are Serber spin-coupled products of particle-hole excitations. This construction is also designed for CI calculations from multireference (open-shell) states. The 2N-electron Hamiltonian is expanded in terms of spin-coupled particle-hole operators which map any ν-fold excitation on ν-, and ν±1-, and ν±2-fold excitations. For the calculation of the CI matrix this leaves one with only the evaluation of overlap matrix elements between spin-coupled excitations. This leads to a set of ten general matrix element formulas which contain Serber representation matrices of the permutation group Sν×Sν as parameters. Because of the Serber structure of the CI basis these group-theoretical parameters are kept to a minimum such that they can be stored readily in the central memory of a computer for ν?4 and even for higher excitations. As the computational effort required to obtain the CI matrix elements from the general formulas is very small, the algorithm presented appears to constitute for even electron systems a promising alternative to existing CI methods for multiply excited configurations, e.g., the unitary group approach. Our method makes possible the adaptation of spatial symmetries and the selection of any subset of configurations. The algorithm has been implemented in a computer program and tested extensively for ν?4 and singlet ground and excited states.

Rapid iterative reanalysis for automated design

NASA Technical Reports Server (NTRS)

Bhatia, K. G.

1973-01-01

A method for iterative reanalysis in automated structural design is presented for a finite-element analysis using the direct stiffness approach. A basic feature of the method is that the generalized stiffness and inertia matrices are expressed as functions of structural design parameters, and these generalized matrices are expanded in Taylor series about the initial design. Only the linear terms are retained in the expansions. The method is approximate because it uses static condensation, modal reduction, and the linear Taylor series expansions. The exact linear representation of the expansions of the generalized matrices is also described and a basis for the present method is established. Results of applications of the present method to the recalculation of the natural frequencies of two simple platelike structural models are presented and compared with results obtained by using a commonly applied analysis procedure used as a reference. In general, the results are in good agreement. A comparison of the computer times required for the use of the present method and the reference method indicated that the present method required substantially less time for reanalysis. Although the results presented are for relatively small-order problems, the present method will become more efficient relative to the reference method as the problem size increases. An extension of the present method to static reanalysis is described, ana a basis for unifying the static and dynamic reanalysis procedures is presented.

The Bravyi-Kitaev transformation for quantum computation of electronic structure

NASA Astrophysics Data System (ADS)

Seeley, Jacob T.; Richard, Martin J.; Love, Peter J.

2012-12-01

Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner transformation allows for representation of a fermionic operator by O(n) qubit operations. Here, we develop an alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev [Ann. Phys. 298, 210 (2002), 10.1006/aphy.2002.6254; e-print arXiv:quant-ph/0003137v2], that reduces the simulation cost to O(log n) qubit operations for one fermionic operation. We apply this new Bravyi-Kitaev transformation to the task of simulating quantum chemical Hamiltonians, and give a detailed example for the simplest possible case of molecular hydrogen in a minimal basis. We show that the quantum circuit for simulating a single Trotter time step of the Bravyi-Kitaev derived Hamiltonian for H2 requires fewer gate applications than the equivalent circuit derived from the Jordan-Wigner transformation. Since the scaling of the Bravyi-Kitaev method is asymptotically better than the Jordan-Wigner method, this result for molecular hydrogen in a minimal basis demonstrates the superior efficiency of the Bravyi-Kitaev method for all quantum computations of electronic structure.

Explicit correlation treatment of the six-dimensional potential energy surface and predicted infrared spectra for OCS-H2

NASA Astrophysics Data System (ADS)

Liu, Jing-Min; Zhai, Yu; Li, Hui

2017-07-01

An effective six-dimensional ab initio potential energy surface (PES) for H2-OCS which explicitly includes the intramolecular stretch normal modes of carbonyl sulfide (OCS) is presented. The electronic structure computations are carried out using the explicitly correlated coupled cluster [CCSD(T)-F12] method with the augmented correlation-consistent aug-cc-pVTZ basis set, and the accuracy is critically tested by performing a series of benchmark calculations. Analytic four-dimensional PESs are obtained by least-squares fitting vibrationally averaged interaction energies to the Morse/long-range potential model. These fits to 13 485 points have a root-mean-square deviation (RMSD) of 0.16 cm-1. The combined radial discrete variable representation/angular finite basis representation method and the Lanczos algorithm were employed to evaluate the rovibrational energy levels for five isotopic species of the OCS-hydrogen complexes. The predicted transition frequencies and intensities based on the resulting vibrationally averaged PESs are in good agreement with the available experimental values, whose RMSDs are smaller than 0.004 cm-1 for five different species of OCS-hydrogen complexes. The calculated infrared band origin shifts for all five species of OCS-hydrogen complexes are only 0.03 cm-1 smaller than the corresponding experimental values. These validate the high quality of our PESs which can be used for modeling OCS doped in hydrogen clusters to further study quantum solution and microscopic superfluidity. In addition, the analytic coordinate transformation functions between isotopologues are also derived due to the center of mass shifting of different isotope substitutes.

An exact variational method to calculate vibrational energies of five atom molecules beyond the normal mode approach

DOE PAGES

Yu, Hua-Gen

2002-01-01

We present a full dimensional variational algorithm to calculate vibrational energies of penta-atomic molecules. The quantum mechanical Hamiltonian of the system for J=0 is derived in a set of orthogonal polyspherical coordinates in the body-fixed frame without any dynamical approximation. Moreover, the vibrational Hamiltonian has been obtained in an explicitly Hermitian form. Variational calculations are performed in a direct product discrete variable representation basis set. The sine functions are used for the radial coordinates, whereas the Legendre polynomials are employed for the polar angles. For the azimuthal angles, the symmetrically adapted Fourier–Chebyshev basis functions are utilized. The eigenvalue problem ismore » solved by a Lanczos iterative diagonalization algorithm. The preliminary application to methane is given. Ultimately, we made a comparison with previous results.« less

Identifying Emotions on the Basis of Neural Activation

PubMed Central

Kassam, Karim S.; Markey, Amanda R.; Cherkassky, Vladimir L.; Loewenstein, George; Just, Marcel Adam

2013-01-01

We attempt to determine the discriminability and organization of neural activation corresponding to the experience of specific emotions. Method actors were asked to self-induce nine emotional states (anger, disgust, envy, fear, happiness, lust, pride, sadness, and shame) while in an fMRI scanner. Using a Gaussian Naïve Bayes pooled variance classifier, we demonstrate the ability to identify specific emotions experienced by an individual at well over chance accuracy on the basis of: 1) neural activation of the same individual in other trials, 2) neural activation of other individuals who experienced similar trials, and 3) neural activation of the same individual to a qualitatively different type of emotion induction. Factor analysis identified valence, arousal, sociality, and lust as dimensions underlying the activation patterns. These results suggest a structure for neural representations of emotion and inform theories of emotional processing. PMID:23840392

Identifying Emotions on the Basis of Neural Activation.

PubMed

Kassam, Karim S; Markey, Amanda R; Cherkassky, Vladimir L; Loewenstein, George; Just, Marcel Adam

2013-01-01

We attempt to determine the discriminability and organization of neural activation corresponding to the experience of specific emotions. Method actors were asked to self-induce nine emotional states (anger, disgust, envy, fear, happiness, lust, pride, sadness, and shame) while in an fMRI scanner. Using a Gaussian Naïve Bayes pooled variance classifier, we demonstrate the ability to identify specific emotions experienced by an individual at well over chance accuracy on the basis of: 1) neural activation of the same individual in other trials, 2) neural activation of other individuals who experienced similar trials, and 3) neural activation of the same individual to a qualitatively different type of emotion induction. Factor analysis identified valence, arousal, sociality, and lust as dimensions underlying the activation patterns. These results suggest a structure for neural representations of emotion and inform theories of emotional processing.

Linear-scaling explicitly correlated treatment of solids: periodic local MP2-F12 method.

PubMed

Usvyat, Denis

2013-11-21

Theory and implementation of the periodic local MP2-F12 method in the 3*A fixed-amplitude ansatz is presented. The method is formulated in the direct space, employing local representation for the occupied, virtual, and auxiliary orbitals in the form of Wannier functions (WFs), projected atomic orbitals (PAOs), and atom-centered Gaussian-type orbitals, respectively. Local approximations are introduced, restricting the list of the explicitly correlated pairs, as well as occupied, virtual, and auxiliary spaces in the strong orthogonality projector to the pair-specific domains on the basis of spatial proximity of respective orbitals. The 4-index two-electron integrals appearing in the formalism are approximated via the direct-space density fitting technique. In this procedure, the fitting orbital spaces are also restricted to local fit-domains surrounding the fitted densities. The formulation of the method and its implementation exploits the translational symmetry and the site-group symmetries of the WFs. Test calculations are performed on LiH crystal. The results show that the periodic LMP2-F12 method substantially accelerates basis set convergence of the total correlation energy, and even more so the correlation energy differences. The resulting energies are quite insensitive to the resolution-of-the-identity domain sizes and the quality of the auxiliary basis sets. The convergence with the orbital domain size is somewhat slower, but still acceptable. Moreover, inclusion of slightly more diffuse functions, than those usually used in the periodic calculations, improves the convergence of the LMP2-F12 correlation energy with respect to both the size of the PAO-domains and the quality of the orbital basis set. At the same time, the essentially diffuse atomic orbitals from standard molecular basis sets, commonly utilized in molecular MP2-F12 calculations, but problematic in the periodic context, are not necessary for LMP2-F12 treatment of crystals.

Data Representation, Coding, and Communication Standards.

PubMed

Amin, Milon; Dhir, Rajiv

2015-06-01

The immense volume of cases signed out by surgical pathologists on a daily basis gives little time to think about exactly how data are stored. An understanding of the basics of data representation has implications that affect a pathologist's daily practice. This article covers the basics of data representation and its importance in the design of electronic medical record systems. Coding in surgical pathology is also discussed. Finally, a summary of communication standards in surgical pathology is presented, including suggested resources that establish standards for select aspects of pathology reporting. Copyright © 2015 Elsevier Inc. All rights reserved.

Noisy bases in Hilbert space: A new class of thermal coherent states and their properties

NASA Technical Reports Server (NTRS)

Vourdas, A.; Bishop, R. F.

1995-01-01

Coherent mixed states (or thermal coherent states) associated with the displaced harmonic oscillator at finite temperature, are introduced as a 'random' (or 'thermal' or 'noisy') basis in Hilbert space. A resolution of the identity for these states is proved and used to generalize the usual coherent state formalism for the finite temperature case. The Bargmann representation of an operator is introduced and its relation to the P and Q representations is studied. Generalized P and Q representations for the finite temperature case are also considered and several interesting relations among them are derived.

Neural representations of social status hierarchy in human inferior parietal cortex.

PubMed

Chiao, Joan Y; Harada, Tokiko; Oby, Emily R; Li, Zhang; Parrish, Todd; Bridge, Donna J

2009-01-01

Mental representations of social status hierarchy share properties with that of numbers. Previous neuroimaging studies have shown that the neural representation of numerical magnitude lies within a network of regions within inferior parietal cortex. However the neural basis of social status hierarchy remains unknown. Using fMRI, we studied subjects while they compared social status magnitude of people, objects and symbols, as well as numerical magnitude. Both social status and number comparisons recruited bilateral intraparietal sulci. We also observed a semantic distance effect whereby neural activity within bilateral intraparietal sulci increased for semantically close relative to far numerical and social status comparisons. These results demonstrate that social status and number comparisons recruit distinct and overlapping neuronal representations within human inferior parietal cortex.

Feature-Selective Attentional Modulations in Human Frontoparietal Cortex.

PubMed

Ester, Edward F; Sutterer, David W; Serences, John T; Awh, Edward

2016-08-03

Control over visual selection has long been framed in terms of a dichotomy between "source" and "site," where top-down feedback signals originating in frontoparietal cortical areas modulate or bias sensory processing in posterior visual areas. This distinction is motivated in part by observations that frontoparietal cortical areas encode task-level variables (e.g., what stimulus is currently relevant or what motor outputs are appropriate), while posterior sensory areas encode continuous or analog feature representations. Here, we present evidence that challenges this distinction. We used fMRI, a roving searchlight analysis, and an inverted encoding model to examine representations of an elementary feature property (orientation) across the entire human cortical sheet while participants attended either the orientation or luminance of a peripheral grating. Orientation-selective representations were present in a multitude of visual, parietal, and prefrontal cortical areas, including portions of the medial occipital cortex, the lateral parietal cortex, and the superior precentral sulcus (thought to contain the human homolog of the macaque frontal eye fields). Additionally, representations in many-but not all-of these regions were stronger when participants were instructed to attend orientation relative to luminance. Collectively, these findings challenge models that posit a strict segregation between sources and sites of attentional control on the basis of representational properties by demonstrating that simple feature values are encoded by cortical regions throughout the visual processing hierarchy, and that representations in many of these areas are modulated by attention. Influential models of visual attention posit a distinction between top-down control and bottom-up sensory processing networks. These models are motivated in part by demonstrations showing that frontoparietal cortical areas associated with top-down control represent abstract or categorical stimulus information, while visual areas encode parametric feature information. Here, we show that multivariate activity in human visual, parietal, and frontal cortical areas encode representations of a simple feature property (orientation). Moreover, representations in several (though not all) of these areas were modulated by feature-based attention in a similar fashion. These results provide an important challenge to models that posit dissociable top-down control and sensory processing networks on the basis of representational properties. Copyright © 2016 the authors 0270-6474/16/368188-12$15.00/0.

An accurate, compact and computationally efficient representation of orbitals for quantum Monte Carlo calculations

NASA Astrophysics Data System (ADS)

Luo, Ye; Esler, Kenneth; Kent, Paul; Shulenburger, Luke

Quantum Monte Carlo (QMC) calculations of giant molecules, surface and defect properties of solids have been feasible recently due to drastically expanding computational resources. However, with the most computationally efficient basis set, B-splines, these calculations are severely restricted by the memory capacity of compute nodes. The B-spline coefficients are shared on a node but not distributed among nodes, to ensure fast evaluation. A hybrid representation which incorporates atomic orbitals near the ions and B-spline ones in the interstitial regions offers a more accurate and less memory demanding description of the orbitals because they are naturally more atomic like near ions and much smoother in between, thus allowing coarser B-spline grids. We will demonstrate the advantage of hybrid representation over pure B-spline and Gaussian basis sets and also show significant speed-up like computing the non-local pseudopotentials with our new scheme. Moreover, we discuss a new algorithm for atomic orbital initialization which used to require an extra workflow step taking a few days. With this work, the highly efficient hybrid representation paves the way to simulate large size even in-homogeneous systems using QMC. This work was supported by the U.S. Department of Energy, Office of Science, Basic Energy Sciences, Computational Materials Sciences Program.

[Between mind and body. Psychologicall methods for patients with musculoskeletal pain].

PubMed

Jabłońska-Brzozowska, Judyta

According to the currently prevailing trends in medicine in restoring the psychosomatic unity of human, it is important to ask the question about the function and role of psychology in the rehabilitation of patients with chronic musculoskeletal disorder, MSD. In this article authors present the theoretical basis of psychical and body rehabilitation of patients with MSD. In the first part of this article, problem of the prevalence of MSD in population, its biological, psychological and social components and its impact on the economy of the country, have been discussed. Secondly, there was a focus on the mental representation of the body and its role as a psychophysical integrating unit. The following sections discuss therapeutic methods, like cognitive-behavioral therapy and chosen body work methods as complex rehabilitation of patients with musculoskeletal pain.

A complete active space valence bond method with nonorthogonal orbitals

NASA Astrophysics Data System (ADS)

Hirao, Kimihiko; Nakano, Haruyuki; Nakayama, Kenichi

1997-12-01

A complete active space self-consistent field (SCF) wave function is transformed into a valence bond type representation built from nonorthogonal orbitals, each strongly localized on a single atom. Nonorthogonal complete active space SCF orbitals are constructed by Ruedenberg's projected localization procedure so that they have maximal overlaps with the corresponding minimum basis set of atomic orbitals of the free-atoms. The valence bond structures which are composed of such nonorthogonal quasiatomic orbitals constitute the wave function closest to the concept of the oldest and most simple valence bond method. The method is applied to benzene, butadiene, hydrogen, and methane molecules and compared to the previously proposed complete active space valence bond approach with orthogonal orbitals. The results demonstrate the validity of the method as a powerful tool for describing the electronic structure of various molecules.

Two dimensional J-matrix approach to quantum scattering

NASA Astrophysics Data System (ADS)

Olumegbon, Ismail Adewale

We present an extension of the J-matrix method of scattering to two dimensions in cylindrical coordinates. In the J-matrix approach we select a zeroth order Hamiltonian, H0, which is exactly solvable in the sense that we select a square integrable basis set that enable us to have an infinite tridiagonal representation for H0. Expanding the wavefunction in this basis makes the wave equation equivalent to a three-term recursion relation for the expansion coefficients. Consequently, finding solutions of the recursion relation is equivalent to solving the original H0 problem (i.e., determining the expansion coefficients of the system's wavefunction). The part of the original potential interaction which cannot be brought to an exact tridiagonal form is cut in an NxN basis space and its matrix elements are computed numerically using Gauss quadrature approach. Hence, this approach embodies powerful tools in the analysis of solutions of the wave equation by exploiting the intimate connection and interplay between tridiagonal matrices and the theory of orthogonal polynomials. In such analysis, one is at liberty to employ a wide range of well established methods and numerical techniques associated with these settings such as quadrature approximation and continued fractions. To demonstrate the utility, usefulness, and accuracy of the extended method we use it to obtain the bound states for an illustrative short range potential problem.

Two dimensional J-matrix approach to quantum scattering

NASA Astrophysics Data System (ADS)

Olumegbon, Ismail Adewale

2013-01-01

We present an extension of the J-matrix method of scattering to two dimensions in cylindrical coordinates. In the J-matrix approach we select a zeroth order Hamiltonian, H0, which is exactly solvable in the sense that we select a square integrable basis set that enable us to have an infinite tridiagonal representation for H0. Expanding the wavefunction in this basis makes the wave equation equivalent to a three-term recursion relation for the expansion coefficients. Consequently, finding solutions of the recursion relation is equivalent to solving the original H0 problem (i.e., determining the expansion coefficients of the system's wavefunction). The part of the original potential interaction which cannot be brought to an exact tridiagonal form is cut in an NxN basis space and its matrix elements are computed numerically using Gauss quadrature approach. Hence, this approach embodies powerful tools in the analysis of solutions of the wave equation by exploiting the intimate connection and interplay between tridiagonal matrices and the theory of orthogonal polynomials. In such analysis, one is at liberty to employ a wide range of well established methods and numerical techniques associated with these settings such as quadrature approximation and continued fractions. To demonstrate the utility, usefulness, and accuracy of the extended method we use it to obtain the bound states for an illustrative short range potential problem.

A systematic identification and analysis of scientists on Twitter.

PubMed

Ke, Qing; Ahn, Yong-Yeol; Sugimoto, Cassidy R

2017-01-01

Metrics derived from Twitter and other social media-often referred to as altmetrics-are increasingly used to estimate the broader social impacts of scholarship. Such efforts, however, may produce highly misleading results, as the entities that participate in conversations about science on these platforms are largely unknown. For instance, if altmetric activities are generated mainly by scientists, does it really capture broader social impacts of science? Here we present a systematic approach to identifying and analyzing scientists on Twitter. Our method can identify scientists across many disciplines, without relying on external bibliographic data, and be easily adapted to identify other stakeholder groups in science. We investigate the demographics, sharing behaviors, and interconnectivity of the identified scientists. We find that Twitter has been employed by scholars across the disciplinary spectrum, with an over-representation of social and computer and information scientists; under-representation of mathematical, physical, and life scientists; and a better representation of women compared to scholarly publishing. Analysis of the sharing of URLs reveals a distinct imprint of scholarly sites, yet only a small fraction of shared URLs are science-related. We find an assortative mixing with respect to disciplines in the networks between scientists, suggesting the maintenance of disciplinary walls in social media. Our work contributes to the literature both methodologically and conceptually-we provide new methods for disambiguating and identifying particular actors on social media and describing the behaviors of scientists, thus providing foundational information for the construction and use of indicators on the basis of social media metrics.

Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent.

PubMed

Guan, Naiyang; Tao, Dacheng; Luo, Zhigang; Yuan, Bo

2011-07-01

Nonnegative matrix factorization (NMF) has become a popular data-representation method and has been widely used in image processing and pattern-recognition problems. This is because the learned bases can be interpreted as a natural parts-based representation of data and this interpretation is consistent with the psychological intuition of combining parts to form a whole. For practical classification tasks, however, NMF ignores both the local geometry of data and the discriminative information of different classes. In addition, existing research results show that the learned basis is unnecessarily parts-based because there is neither explicit nor implicit constraint to ensure the representation parts-based. In this paper, we introduce the manifold regularization and the margin maximization to NMF and obtain the manifold regularized discriminative NMF (MD-NMF) to overcome the aforementioned problems. The multiplicative update rule (MUR) can be applied to optimizing MD-NMF, but it converges slowly. In this paper, we propose a fast gradient descent (FGD) to optimize MD-NMF. FGD contains a Newton method that searches the optimal step length, and thus, FGD converges much faster than MUR. In addition, FGD includes MUR as a special case and can be applied to optimizing NMF and its variants. For a problem with 165 samples in R(1600), FGD converges in 28 s, while MUR requires 282 s. We also apply FGD in a variant of MD-NMF and experimental results confirm its efficiency. Experimental results on several face image datasets suggest the effectiveness of MD-NMF.

A systematic identification and analysis of scientists on Twitter

PubMed Central

Ke, Qing; Ahn, Yong-Yeol; Sugimoto, Cassidy R.

2017-01-01

Metrics derived from Twitter and other social media—often referred to as altmetrics—are increasingly used to estimate the broader social impacts of scholarship. Such efforts, however, may produce highly misleading results, as the entities that participate in conversations about science on these platforms are largely unknown. For instance, if altmetric activities are generated mainly by scientists, does it really capture broader social impacts of science? Here we present a systematic approach to identifying and analyzing scientists on Twitter. Our method can identify scientists across many disciplines, without relying on external bibliographic data, and be easily adapted to identify other stakeholder groups in science. We investigate the demographics, sharing behaviors, and interconnectivity of the identified scientists. We find that Twitter has been employed by scholars across the disciplinary spectrum, with an over-representation of social and computer and information scientists; under-representation of mathematical, physical, and life scientists; and a better representation of women compared to scholarly publishing. Analysis of the sharing of URLs reveals a distinct imprint of scholarly sites, yet only a small fraction of shared URLs are science-related. We find an assortative mixing with respect to disciplines in the networks between scientists, suggesting the maintenance of disciplinary walls in social media. Our work contributes to the literature both methodologically and conceptually—we provide new methods for disambiguating and identifying particular actors on social media and describing the behaviors of scientists, thus providing foundational information for the construction and use of indicators on the basis of social media metrics. PMID:28399145

Optical coherence tomography retinal image reconstruction via nonlocal weighted sparse representation

NASA Astrophysics Data System (ADS)

Abbasi, Ashkan; Monadjemi, Amirhassan; Fang, Leyuan; Rabbani, Hossein

2018-03-01

We present a nonlocal weighted sparse representation (NWSR) method for reconstruction of retinal optical coherence tomography (OCT) images. To reconstruct a high signal-to-noise ratio and high-resolution OCT images, utilization of efficient denoising and interpolation algorithms are necessary, especially when the original data were subsampled during acquisition. However, the OCT images suffer from the presence of a high level of noise, which makes the estimation of sparse representations a difficult task. Thus, the proposed NWSR method merges sparse representations of multiple similar noisy and denoised patches to better estimate a sparse representation for each patch. First, the sparse representation of each patch is independently computed over an overcomplete dictionary, and then a nonlocal weighted sparse coefficient is computed by averaging representations of similar patches. Since the sparsity can reveal relevant information from noisy patches, combining noisy and denoised patches' representations is beneficial to obtain a more robust estimate of the unknown sparse representation. The denoised patches are obtained by applying an off-the-shelf image denoising method and our method provides an efficient way to exploit information from noisy and denoised patches' representations. The experimental results on denoising and interpolation of spectral domain OCT images demonstrated the effectiveness of the proposed NWSR method over existing state-of-the-art methods.

Resolution-of-identity stochastic time-dependent configuration interaction for dissipative electron dynamics in strong fields.

PubMed

Klinkusch, Stefan; Tremblay, Jean Christophe

2016-05-14

In this contribution, we introduce a method for simulating dissipative, ultrafast many-electron dynamics in intense laser fields. The method is based on the norm-conserving stochastic unraveling of the dissipative Liouville-von Neumann equation in its Lindblad form. The N-electron wave functions sampling the density matrix are represented in the basis of singly excited configuration state functions. The interaction with an external laser field is treated variationally and the response of the electronic density is included to all orders in this basis. The coupling to an external environment is included via relaxation operators inducing transition between the configuration state functions. Single electron ionization is represented by irreversible transition operators from the ionizing states to an auxiliary continuum state. The method finds its efficiency in the representation of the operators in the interaction picture, where the resolution-of-identity is used to reduce the size of the Hamiltonian eigenstate basis. The zeroth-order eigenstates can be obtained either at the configuration interaction singles level or from a time-dependent density functional theory reference calculation. The latter offers an alternative to explicitly time-dependent density functional theory which has the advantage of remaining strictly valid for strong field excitations while improving the description of the correlation as compared to configuration interaction singles. The method is tested on a well-characterized toy system, the excitation of the low-lying charge transfer state in LiCN.

Resolution-of-identity stochastic time-dependent configuration interaction for dissipative electron dynamics in strong fields

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

Klinkusch, Stefan; Tremblay, Jean Christophe

In this contribution, we introduce a method for simulating dissipative, ultrafast many-electron dynamics in intense laser fields. The method is based on the norm-conserving stochastic unraveling of the dissipative Liouville-von Neumann equation in its Lindblad form. The N-electron wave functions sampling the density matrix are represented in the basis of singly excited configuration state functions. The interaction with an external laser field is treated variationally and the response of the electronic density is included to all orders in this basis. The coupling to an external environment is included via relaxation operators inducing transition between the configuration state functions. Single electronmore » ionization is represented by irreversible transition operators from the ionizing states to an auxiliary continuum state. The method finds its efficiency in the representation of the operators in the interaction picture, where the resolution-of-identity is used to reduce the size of the Hamiltonian eigenstate basis. The zeroth-order eigenstates can be obtained either at the configuration interaction singles level or from a time-dependent density functional theory reference calculation. The latter offers an alternative to explicitly time-dependent density functional theory which has the advantage of remaining strictly valid for strong field excitations while improving the description of the correlation as compared to configuration interaction singles. The method is tested on a well-characterized toy system, the excitation of the low-lying charge transfer state in LiCN.« less

Developmental psycholinguistics teaches us that we need multi-method, not single-method, approaches to the study of linguistic representation.

PubMed

Rowland, Caroline F; Monaghan, Padraic

2017-01-01

In developmental psycholinguistics, we have, for many years, been generating and testing theories that propose both descriptions of adult representations and explanations of how those representations develop. We have learnt that restricting ourselves to any one methodology yields only incomplete data about the nature of linguistic representations. We argue that we need a multi-method approach to the study of representation.

Design of chemical space networks on the basis of Tversky similarity

NASA Astrophysics Data System (ADS)

Wu, Mengjun; Vogt, Martin; Maggiora, Gerald M.; Bajorath, Jürgen

2016-01-01

Chemical space networks (CSNs) have been introduced as a coordinate-free representation of chemical space. In CSNs, nodes represent compounds and edges pairwise similarity relationships. These network representations are mostly used to navigate sections of biologically relevant chemical space. Different types of CSNs have been designed on the basis of alternative similarity measures including continuous numerical similarity values or substructure-based similarity criteria. CSNs can be characterized and compared on the basis of statistical concepts from network science. Herein, a new CSN design is introduced that is based upon asymmetric similarity assessment using the Tversky coefficient and termed TV-CSN. Compared to other CSNs, TV-CSNs have unique features. While CSNs typically contain separate compound communities and exhibit small world character, many TV-CSNs are also scale-free in nature and contain hubs, i.e., extensively connected central compounds. Compared to other CSNs, these hubs are a characteristic of TV-CSN topology. Hub-containing compound communities are of particular interest for the exploration of structure-activity relationships.

Surface hopping simulation of vibrational predissociation of methanol dimer

NASA Astrophysics Data System (ADS)

Jiang, Ruomu; Sibert, Edwin L.

2012-06-01

The mixed quantum-classical surface hopping method is applied to the vibrational predissociation of methanol dimer, and the results are compared to more exact quantum calculations. Utilizing the vibrational SCF basis, the predissociation problem is cast into a curve crossing problem between dissociative and quasibound surfaces with different vibrational character. The varied features of the dissociative surfaces, arising from the large amplitude OH torsion, generate rich predissociation dynamics. The fewest switches surface hopping algorithm of Tully [J. Chem. Phys. 93, 1061 (1990), 10.1063/1.459170] is applied to both diabatic and adiabatic representations. The comparison affords new insight into the criterion for selecting the suitable representation. The adiabatic method's difficulty with low energy trajectories is highlighted. In the normal crossing case, the diabatic calculations yield good results, albeit showing its limitation in situations where tunneling is important. The quadratic scaling of the rates on coupling strength is confirmed. An interesting resonance behavior is identified and is dealt with using a simple decoherence scheme. For low lying dissociative surfaces that do not cross the quasibound surface, the diabatic method tends to overestimate the predissociation rate whereas the adiabatic method is qualitatively correct. Analysis reveals the major culprits involve Rabi-like oscillation, treatment of classically forbidden hops, and overcoherence. Improvements of the surface hopping results are achieved by adopting a few changes to the original surface hopping algorithms.

Refining Collective Coordinates and Improving Free Energy Representation in Variational Enhanced Sampling.

PubMed

Yang, Yi Isaac; Parrinello, Michele

2018-06-12

Collective variables are used often in many enhanced sampling methods, and their choice is a crucial factor in determining sampling efficiency. However, at times, searching for good collective variables can be challenging. In a recent paper, we combined time-lagged independent component analysis with well-tempered metadynamics in order to obtain improved collective variables from metadynamics runs that use lower quality collective variables [ McCarty, J.; Parrinello, M. J. Chem. Phys. 2017 , 147 , 204109 ]. In this work, we extend these ideas to variationally enhanced sampling. This leads to an efficient scheme that is able to make use of the many advantages of the variational scheme. We apply the method to alanine-3 in water. From an alanine-3 variationally enhanced sampling trajectory in which all the six dihedral angles are biased, we extract much better collective variables able to describe in exquisite detail the protein complex free energy surface in a low dimensional representation. The success of this investigation is helped by a more accurate way of calculating the correlation functions needed in the time-lagged independent component analysis and from the introduction of a new basis set to describe the dihedral angles arrangement.

Yangians and Yang-Baxter R-operators for ortho-symplectic superalgebras

NASA Astrophysics Data System (ADS)

Fuksa, J.; Isaev, A. P.; Karakhanyan, D.; Kirschner, R.

2017-04-01

Yang-Baxter relations symmetric with respect to the ortho-symplectic superalgebras are studied. We start with the formulation of graded algebras and the linear superspace carrying the vector (fundamental) representation of the ortho-symplectic supergroup. On this basis we study the analogy of the Yang-Baxter operators considered earlier for the cases of orthogonal and symplectic symmetries: the vector (fundamental) R-matrix, the L-operator defining the Yangian algebra and its first and second order evaluations. We investigate the condition for L (u) in the case of the truncated expansion in inverse powers of u and give examples of Lie algebra representations obeying these conditions. We construct the R-operator intertwining two superspinor representations and study the fusion of L-operators involving the tensor product of such representations.

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

DOE PAGES

Jia, C. J.; Wang, Y.; Mendl, C. B.; ...

2017-12-02

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrixmore » for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.« less

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

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

Jia, C. J.; Wang, Y.; Mendl, C. B.

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrixmore » for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.« less

A representational basis for the development of a distributed expert system for Space Shuttle flight control

NASA Technical Reports Server (NTRS)

Helly, J. J., Jr.; Bates, W. V.; Cutler, M.; Kelem, S.

1984-01-01

A new representation of malfunction procedure logic which permits the automation of these procedures using Boolean normal forms is presented. This representation is discussed in the context of the development of an expert system for space shuttle flight control including software and hardware implementation modes, and a distributed architecture. The roles and responsibility of the flight control team as well as previous work toward the development of expert systems for flight control support at Johnson Space Center are discussed. The notion of malfunction procedures as graphs is introduced as well as the concept of hardware-equivalence.

Application of wavefield compressive sensing in surface wave tomography

NASA Astrophysics Data System (ADS)

Zhan, Zhongwen; Li, Qingyang; Huang, Jianping

2018-06-01

Dense arrays allow sampling of seismic wavefield without significant aliasing, and surface wave tomography has benefitted from exploiting wavefield coherence among neighbouring stations. However, explicit or implicit assumptions about wavefield, irregular station spacing and noise still limit the applicability and resolution of current surface wave methods. Here, we propose to apply the theory of compressive sensing (CS) to seek a sparse representation of the surface wavefield using a plane-wave basis. Then we reconstruct the continuous surface wavefield on a dense regular grid before applying any tomographic methods. Synthetic tests demonstrate that wavefield CS improves robustness and resolution of Helmholtz tomography and wavefield gradiometry, especially when traditional approaches have difficulties due to sub-Nyquist sampling or complexities in wavefield.

Parameter dimension of turbulence-induced phase errors and its effects on estimation in phase diversity

NASA Technical Reports Server (NTRS)

Thelen, Brian J.; Paxman, Richard G.

1994-01-01

The method of phase diversity has been used in the context of incoherent imaging to estimate jointly an object that is being imaged and phase aberrations induced by atmospheric turbulence. The method requires a parametric model for the phase-aberration function. Typically, the parameters are coefficients to a finite set of basis functions. Care must be taken in selecting a parameterization that properly balances accuracy in the representation of the phase-aberration function with stability in the estimates. It is well known that over parameterization can result in unstable estimates. Thus a certain amount of model mismatch is often desirable. We derive expressions that quantify the bias and variance in object and aberration estimates as a function of parameter dimension.

Body representation in patients after vascular brain injuries.

PubMed

Razmus, Magdalena

2017-11-01

Neuropsychological literature suggests that body representation is a multidimensional concept consisting of various types of representations. Previous studies have demonstrated dissociations between three types of body representation specified by the kind of data and processes, i.e. body schema, body structural description, and body semantics. The aim of the study was to describe the state of body representation in patients after vascular brain injuries and to provide evidence for the different types of body representation. The question about correlations between body representation deficits and neuropsychological dysfunctions was also investigated. Fifty patients after strokes and 50 control individuals participated in the study. They were examined with tasks referring to dynamic representation of body parts positions, topological body map, and lexical and semantic knowledge about the body. Data analysis showed that vascular brain injuries result in deficits of body representation, which may co-occur with cognitive dysfunctions, but the latter are a possible risk factor for body representation deficits rather than sufficient or imperative requisites for them. The study suggests that types of body representation may be separated on the basis not only of their content, but also of their relation with self. Principal component analysis revealed three factors, which explained over 66% of results variance. The factors, which may be interpreted as types or dimensions of mental model of a body, represent different degrees of connection with self. The results indicate another possibility of body representation types classification, which should be verified in future research.

The Analytic Structure of Scattering Amplitudes in N = 4 Super-Yang-Mills Theory

NASA Astrophysics Data System (ADS)

Litsey, Sean Christopher

We begin the dissertation in Chapter 1 with a discussion of tree-level amplitudes in Yang-. Mills theories. The DDM and BCJ decompositions of the amplitudes are described and. related to one another by the introduction of a transformation matrix. This is related to the. Kleiss-Kuijf and BCJ amplitude identities, and we conjecture a connection to the existence. of a BCJ representation via a condition on the generalized inverse of that matrix. Under. two widely-believed assumptions, this relationship is proved. Switching gears somewhat, we introduce the RSVW formulation of the amplitude, and the extension of BCJ-like features to residues of the RSVW integrand is proposed. Using the previously proven connection of BCJ representations to the generalized inverse condition, this extension is validated, including a version of gravitational double copy. The remainder of the dissertation involves an analysis of the analytic properties of loop. amplitudes in N = 4 super-Yang-Mills theory. Chapter 2 contains a review of the planar case, including an exposition of dual variables and momentum twistors, dual conformal symmetry, and their implications for the amplitude. After defining the integrand and on-shell diagrams, we explain the crucial properties that the amplitude has no poles at infinite momentum and that its leading singularities are dual-conformally-invariant cross ratios, and can therefore be normalized to unity. We define the concept of a dlog form, and show that it is a feature of the planar integrand as well. This leads to the definition of a pure integrand basis. The proceeding setup is connected to the amplituhedron formulation, and we put forward the hypothesis that the amplitude is determined by zero conditions. Chapter 3 contains the primary computations of the dissertation. This chapter treats. amplitudes in fully nonplanar N = 4 super-Yang-Mills, analyzing the conjecture that they. follow the pattern of having no poles at infinity, can be written in dlog form, and can. be decomposed into a pure integrand basis, with each basis element having unit leading. singularity. Through explicit calculation, we show that this is true for the two-loop fourpoint, three-loop four-point, and two-loop five-point amplitudes, and discuss the features of. each case. We then discuss the zero condition hypothesis, showing explicitly that it holds for the two-loop four-particle amplitude, and showing the set of conditions that fix the amplitude in the three-loop four-particle and two-loop five-particle cases without explicitly performing the fixing. This concludes the body of the dissertation. Two appendices complete the dissertation. Appendix B includes an in-depth discussion of. dlog forms, including purely mathematical examples and a discussion of their appearance in one-loop amplitudes. Finally, Appendix C redoes portions of the analysis of Chapter 3 for the two- and three-loop four-particle amplitudes, but gives representations that are not in a pure integrand basis. Instead diagram symmetry is imposed on the basis elements, and diagrams that lack maximal cuts are pushed into maximal-cut diagrams. This gives representations closer in spirit to the previously-constructed representations of these amplitudes, such as the BCJ representations. It also highlights the role of color Jacobi identities and the freedom in the amplitude representation they can generate, and contains an explicit discussion of these features that is unpublished elsewhere.

Scattering by a groove in an impedance plane

NASA Technical Reports Server (NTRS)

Bindiganavale, Sunil; Volakis, John L.

1993-01-01

An analysis of two-dimensional scattering from a narrow groove in an impedance plane is presented. The groove is represented by a impedance surface and the problem reduces to that of scattering from an impedance strip in an otherwise uniform impedance plane. On the basis of this model, appropriate integral equations are constructed using a form of the impedance plane Green's functions involving rapidly convergent integrals. The integral equations are solved by introducing a single basis representation of the equivalent current on the narrow impedance insert. Both transverse electric (TE) and transverse magnetic (TM) polarizations are treated. The resulting solution is validated by comparison with results from the standard boundary integral method (BIM) and a high frequency solution. It is found that the presented solution for narrow impedance inserts can be used in conjunction with the high frequency solution for the characterization of impedance inserts of any given width.

Teaching structure: student use of software tools for understanding macromolecular structure in an undergraduate biochemistry course.

PubMed

Jaswal, Sheila S; O'Hara, Patricia B; Williamson, Patrick L; Springer, Amy L

2013-01-01

Because understanding the structure of biological macromolecules is critical to understanding their function, students of biochemistry should become familiar not only with viewing, but also with generating and manipulating structural representations. We report a strategy from a one-semester undergraduate biochemistry course to integrate use of structural representation tools into both laboratory and homework activities. First, early in the course we introduce the use of readily available open-source software for visualizing protein structure, coincident with modules on amino acid and peptide bond properties. Second, we use these same software tools in lectures and incorporate images and other structure representations in homework tasks. Third, we require a capstone project in which teams of students examine a protein-nucleic acid complex and then use the software tools to illustrate for their classmates the salient features of the structure, relating how the structure helps explain biological function. To ensure engagement with a range of software and database features, we generated a detailed template file that can be used to explore any structure, and that guides students through specific applications of many of the software tools. In presentations, students demonstrate that they are successfully interpreting structural information, and using representations to illustrate particular points relevant to function. Thus, over the semester students integrate information about structural features of biological macromolecules into the larger discussion of the chemical basis of function. Together these assignments provide an accessible introduction to structural representation tools, allowing students to add these methods to their biochemical toolboxes early in their scientific development. © 2013 by The International Union of Biochemistry and Molecular Biology.

VLSI architectures for computing multiplications and inverses in GF(2m)

NASA Technical Reports Server (NTRS)

Wang, C. C.; Truong, T. K.; Shao, H. M.; Deutsch, L. J.; Omura, J. K.

1985-01-01

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

VLSI architectures for computing multiplications and inverses in GF(2-m)

NASA Technical Reports Server (NTRS)

Wang, C. C.; Truong, T. K.; Shao, H. M.; Deutsch, L. J.; Omura, J. K.; Reed, I. S.

1983-01-01

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

VLSI architectures for computing multiplications and inverses in GF(2m).

PubMed

Wang, C C; Truong, T K; Shao, H M; Deutsch, L J; Omura, J K; Reed, I S

1985-08-01

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that can be easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. In this paper, a pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal basis representation used together with this multiplier, a pipeline architecture is developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable, and therefore, naturally suitable for VLSI implementation.

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

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

A parametric model order reduction technique for poroelastic finite element models.

PubMed

Lappano, Ettore; Polanz, Markus; Desmet, Wim; Mundo, Domenico

2017-10-01

This research presents a parametric model order reduction approach for vibro-acoustic problems in the frequency domain of systems containing poroelastic materials (PEM). The method is applied to the Finite Element (FE) discretization of the weak u-p integral formulation based on the Biot-Allard theory and makes use of reduced basis (RB) methods typically employed for parametric problems. The parametric reduction is obtained rewriting the Biot-Allard FE equations for poroelastic materials using an affine representation of the frequency (therefore allowing for RB methods) and projecting the frequency-dependent PEM system on a global reduced order basis generated with the proper orthogonal decomposition instead of standard modal approaches. This has proven to be better suited to describe the nonlinear frequency dependence and the strong coupling introduced by damping. The methodology presented is tested on two three-dimensional systems: in the first experiment, the surface impedance of a PEM layer sample is calculated and compared with results of the literature; in the second, the reduced order model of a multilayer system coupled to an air cavity is assessed and the results are compared to those of the reference FE model.

Increasing the efficiency and accuracy of time-resolved electronic spectra calculations with on-the-fly ab initio quantum dynamics methods

NASA Astrophysics Data System (ADS)

Vanicek, Jiri

2014-03-01

Rigorous quantum-mechanical calculations of coherent ultrafast electronic spectra remain difficult. I will present several approaches developed in our group that increase the efficiency and accuracy of such calculations: First, we justified the feasibility of evaluating time-resolved spectra of large systems by proving that the number of trajectories needed for convergence of the semiclassical dephasing representation/phase averaging is independent of dimensionality. Recently, we further accelerated this approximation with a cellular scheme employing inverse Weierstrass transform and optimal scaling of the cell size. The accuracy of potential energy surfaces was increased by combining the dephasing representation with accurate on-the-fly ab initio electronic structure calculations, including nonadiabatic and spin-orbit couplings. Finally, the inherent semiclassical approximation was removed in the exact quantum Gaussian dephasing representation, in which semiclassical trajectories are replaced by communicating frozen Gaussian basis functions evolving classically with an average Hamiltonian. Among other examples I will present an on-the-fly ab initio semiclassical dynamics calculation of the dispersed time-resolved stimulated emission spectrum of the 54-dimensional azulene. This research was supported by EPFL and by the Swiss National Science Foundation NCCR MUST (Molecular Ultrafast Science and Technology) and Grant No. 200021124936/1.

7 CFR 924.26 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... an alternate member of the committee to qualify, or in the event of the death, removal, resignation... vacancy without regard to nominations, which selection shall be made on the basis of representation...

7 CFR 929.26 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... member of the committee to qualify, or in the event of the death, removal, resignation, or... regard to nominations, which selection shall be made on the basis of representation provided for in...

Using an iterative eigensolver to compute vibrational energies with phase-spaced localized basis functions.

PubMed

Brown, James; Carrington, Tucker

2015-07-28

Although phase-space localized Gaussians are themselves poor basis functions, they can be used to effectively contract a discrete variable representation basis [A. Shimshovitz and D. J. Tannor, Phys. Rev. Lett. 109, 070402 (2012)]. This works despite the fact that elements of the Hamiltonian and overlap matrices labelled by discarded Gaussians are not small. By formulating the matrix problem as a regular (i.e., not a generalized) matrix eigenvalue problem, we show that it is possible to use an iterative eigensolver to compute vibrational energy levels in the Gaussian basis.

Variational treatment of electron-polyatomic-molecule scattering calculations using adaptive overset grids

NASA Astrophysics Data System (ADS)

Greenman, Loren; Lucchese, Robert R.; McCurdy, C. William

2017-11-01

The complex Kohn variational method for electron-polyatomic-molecule scattering is formulated using an overset-grid representation of the scattering wave function. The overset grid consists of a central grid and multiple dense atom-centered subgrids that allow the simultaneous spherical expansions of the wave function about multiple centers. Scattering boundary conditions are enforced by using a basis formed by the repeated application of the free-particle Green's function and potential Ĝ0+V ̂ on the overset grid in a Born-Arnoldi solution of the working equations. The theory is shown to be equivalent to a specific Padé approximant to the T matrix and has rapid convergence properties, in both the number of numerical basis functions employed and the number of partial waves employed in the spherical expansions. The method is demonstrated in calculations on methane and CF4 in the static-exchange approximation and compared in detail with calculations performed with the numerical Schwinger variational approach based on single-center expansions. An efficient procedure for operating with the free-particle Green's function and exchange operators (to which no approximation is made) is also described.

Highly Efficient and Scalable Compound Decomposition of Two-Electron Integral Tensor and Its Application in Coupled Cluster Calculations

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

Peng, Bo; Kowalski, Karol

The representation and storage of two-electron integral tensors are vital in large- scale applications of accurate electronic structure methods. Low-rank representation and efficient storage strategy of integral tensors can significantly reduce the numerical overhead and consequently time-to-solution of these methods. In this paper, by combining pivoted incomplete Cholesky decomposition (CD) with a follow-up truncated singular vector decomposition (SVD), we develop a decomposition strategy to approximately represent the two-electron integral tensor in terms of low-rank vectors. A systematic benchmark test on a series of 1-D, 2-D, and 3-D carbon-hydrogen systems demonstrates high efficiency and scalability of the compound two-step decomposition ofmore » the two-electron integral tensor in our implementation. For the size of atomic basis set N_b ranging from ~ 100 up to ~ 2, 000, the observed numerical scaling of our implementation shows O(N_b^{2.5~3}) versus O(N_b^{3~4}) of single CD in most of other implementations. More importantly, this decomposition strategy can significantly reduce the storage requirement of the atomic-orbital (AO) two-electron integral tensor from O(N_b^4) to O(N_b^2 log_{10}(N_b)) with moderate decomposition thresholds. The accuracy tests have been performed using ground- and excited-state formulations of coupled- cluster formalism employing single and double excitations (CCSD) on several bench- mark systems including the C_{60} molecule described by nearly 1,400 basis functions. The results show that the decomposition thresholds can be generally set to 10^{-4} to 10^{-3} to give acceptable compromise between efficiency and accuracy.« less

Highly Efficient and Scalable Compound Decomposition of Two-Electron Integral Tensor and Its Application in Coupled Cluster Calculations.

PubMed

Peng, Bo; Kowalski, Karol

2017-09-12

The representation and storage of two-electron integral tensors are vital in large-scale applications of accurate electronic structure methods. Low-rank representation and efficient storage strategy of integral tensors can significantly reduce the numerical overhead and consequently time-to-solution of these methods. In this work, by combining pivoted incomplete Cholesky decomposition (CD) with a follow-up truncated singular vector decomposition (SVD), we develop a decomposition strategy to approximately represent the two-electron integral tensor in terms of low-rank vectors. A systematic benchmark test on a series of 1-D, 2-D, and 3-D carbon-hydrogen systems demonstrates high efficiency and scalability of the compound two-step decomposition of the two-electron integral tensor in our implementation. For the size of the atomic basis set, N b , ranging from ∼100 up to ∼2,000, the observed numerical scaling of our implementation shows [Formula: see text] versus [Formula: see text] cost of performing single CD on the two-electron integral tensor in most of the other implementations. More importantly, this decomposition strategy can significantly reduce the storage requirement of the atomic orbital (AO) two-electron integral tensor from [Formula: see text] to [Formula: see text] with moderate decomposition thresholds. The accuracy tests have been performed using ground- and excited-state formulations of coupled cluster formalism employing single and double excitations (CCSD) on several benchmark systems including the C 60 molecule described by nearly 1,400 basis functions. The results show that the decomposition thresholds can be generally set to 10 -4 to 10 -3 to give acceptable compromise between efficiency and accuracy.

Identification of DNA-Binding Proteins Using Mixed Feature Representation Methods.

PubMed

Qu, Kaiyang; Han, Ke; Wu, Song; Wang, Guohua; Wei, Leyi

2017-09-22

DNA-binding proteins play vital roles in cellular processes, such as DNA packaging, replication, transcription, regulation, and other DNA-associated activities. The current main prediction method is based on machine learning, and its accuracy mainly depends on the features extraction method. Therefore, using an efficient feature representation method is important to enhance the classification accuracy. However, existing feature representation methods cannot efficiently distinguish DNA-binding proteins from non-DNA-binding proteins. In this paper, a multi-feature representation method, which combines three feature representation methods, namely, K-Skip-N-Grams, Information theory, and Sequential and structural features (SSF), is used to represent the protein sequences and improve feature representation ability. In addition, the classifier is a support vector machine. The mixed-feature representation method is evaluated using 10-fold cross-validation and a test set. Feature vectors, which are obtained from a combination of three feature extractions, show the best performance in 10-fold cross-validation both under non-dimensional reduction and dimensional reduction by max-relevance-max-distance. Moreover, the reduced mixed feature method performs better than the non-reduced mixed feature technique. The feature vectors, which are a combination of SSF and K-Skip-N-Grams, show the best performance in the test set. Among these methods, mixed features exhibit superiority over the single features.

Computational studies of metal-metal and metal-ligand interactions

NASA Technical Reports Server (NTRS)

Barnes, Leslie A.

1992-01-01

The geometric structure of Cr(CO)6 is optimized at the modified coupled-pair functional (MCPF), single and double excitation coupled-cluster (CCSD) and CCSD(T) levels of theory (including a perturbational estimate for connected triple excitations), and the force constants for the totally symmetric representation are determined. The geometry of Cr(CO)5 is partially optimized at the MCPF, CCSD and CCSD(T) levels of theory. Comparison with experimental data shows that the CCSD(T) method gives the best results for the structures and force constants, and that remaining errors are probably due to deficiencies in the one-particle basis sets used for CO. A detailed comparison of the properties of free CO is therefore given, at both the MCPF and CCSD/CCSD(T) levels of treatment, using a variety of basis sets. With very large one-particle basis sets, the SSCD(T) method gives excellent results for the bond distance, dipole moment and harmonic frequency of free CO. The total binding energies of Cr(CO)6 and Cr(CO)5 are also determined at the MCPF, CCSD and CCSD(T) levels of theory. The CCSD(T) method gives a much larger total binding energy than either the MCPF or CCSD methods. An analysis of the basis set superposition error (BSSE) at the MCPF level of treatment points out limitations in the one-particle basis used here and in a previous study. Calculations using larger basis sets reduced the BSSE, but the total binding energy of Cr(CO)6 is still significantly smaller than the experimental value, although the first CO bond dissociation energy of Cr(CO)6 is well described. An investigation of 3s3p correlation reveals only a small effect. The remaining discrepancy between the experimental and theoretical total binding energy of Cr(CO)6 is probably due to limitations in the one-particle basis, rather than limitations in the correlation treatment. In particular an additional d function and an f function on each C and O are needed to obtain quantitative results. This is underscored by the fact that even using a very large primitive se (1042 primitive functions contracted to 300 basis functions), the superposition error for the total binding energy of Cr(CO)6 is 22 kcal/mol at the MCPF level of treatment.

Sparse Coding and Counting for Robust Visual Tracking

PubMed Central

Liu, Risheng; Wang, Jing; Shang, Xiaoke; Wang, Yiyang; Su, Zhixun; Cai, Yu

2016-01-01

In this paper, we propose a novel sparse coding and counting method under Bayesian framework for visual tracking. In contrast to existing methods, the proposed method employs the combination of L0 and L1 norm to regularize the linear coefficients of incrementally updated linear basis. The sparsity constraint enables the tracker to effectively handle difficult challenges, such as occlusion or image corruption. To achieve real-time processing, we propose a fast and efficient numerical algorithm for solving the proposed model. Although it is an NP-hard problem, the proposed accelerated proximal gradient (APG) approach is guaranteed to converge to a solution quickly. Besides, we provide a closed solution of combining L0 and L1 regularized representation to obtain better sparsity. Experimental results on challenging video sequences demonstrate that the proposed method achieves state-of-the-art results both in accuracy and speed. PMID:27992474

The sentient self.

PubMed

Craig, A D Bud

2010-06-01

This article addresses the neuroanatomical evidence for a progression of integrative representations of affective feelings from the body that lead to an ultimate representation of all feelings in the bilateral anterior insulae, or "the sentient self." Evidence for somatotopy in the primary interoceptive sensory cortex is presented, and the organization of the mid-insula and the anterior insula is discussed. Issues that need to be addressed are highlighted. A possible basis for subjectivity in a cinemascopic model of awareness is presented.

7 CFR 958.30 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... alternate, to qualify, or in the event of the death, removal, resignation, or disqualification of any... shall be made on the basis of the representation provided for in this subpart. Expenses and Assessments ...

7 CFR 923.26 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... committee to qualify, or in the event of the death, removal, resignation, or disqualification of any member..., which selection shall be made on the basis of representation provided for in § 923.20. ...

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

Guedes, Carlos; Oriti, Daniele; Raasakka, Matti

The phase space given by the cotangent bundle of a Lie group appears in the context of several models for physical systems. A representation for the quantum system in terms of non-commutative functions on the (dual) Lie algebra, and a generalized notion of (non-commutative) Fourier transform, different from standard harmonic analysis, has been recently developed, and found several applications, especially in the quantum gravity literature. We show that this algebra representation can be defined on the sole basis of a quantization map of the classical Poisson algebra, and identify the conditions for its existence. In particular, the corresponding non-commutative star-productmore » carried by this representation is obtained directly from the quantization map via deformation quantization. We then clarify under which conditions a unitary intertwiner between such algebra representation and the usual group representation can be constructed giving rise to the non-commutative plane waves and consequently, the non-commutative Fourier transform. The compact groups U(1) and SU(2) are considered for different choices of quantization maps, such as the symmetric and the Duflo map, and we exhibit the corresponding star-products, algebra representations, and non-commutative plane waves.« less

The association of personal semantic memory to identity representations: insight into higher-order networks of autobiographical contents.

PubMed

Grilli, Matthew D

2017-11-01

Identity representations are higher-order knowledge structures that organise autobiographical memories on the basis of personality and role-based themes of one's self-concept. In two experiments, the extent to which different types of personal semantic content are reflected in these higher-order networks of memories was investigated. Healthy, young adult participants generated identity representations that varied in remoteness of formation and verbally reflected on these themes in an open-ended narrative task. The narrative responses were scored for retrieval of episodic, experience-near personal semantic and experience-far (i.e., abstract) personal semantic contents. Results revealed that to reflect on remotely formed identity representations, experience-far personal semantic contents were retrieved more than experience-near personal semantic contents. In contrast, to reflect on recently formed identity representations, experience-near personal semantic contents were retrieved more than experience-far personal semantic contents. Although episodic memory contents were retrieved less than both personal semantic content types to reflect on remotely formed identity representations, this content type was retrieved at a similar frequency as experience-far personal semantic content to reflect on recently formed identity representations. These findings indicate that the association of personal semantic content to identity representations is robust and related to time since acquisition of these knowledge structures.

Numerical Integration Techniques for Curved-Element Discretizations of Molecule–Solvent Interfaces

PubMed Central

Bardhan, Jaydeep P.; Altman, Michael D.; Willis, David J.; Lippow, Shaun M.; Tidor, Bruce; White, Jacob K.

2012-01-01

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, we have developed methods to model several important surface formulations using exact surface discretizations. Following and refining Zauhar’s work (J. Comp.-Aid. Mol. Des. 9:149-159, 1995), we define two classes of curved elements that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. We then present numerical integration techniques that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, we present a set of calculations that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planartriangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute–solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved approximations with increasing discretization and associated increases in computational resources. The results clearly demonstrate that our methods for approximate integration on an exact geometry are far more accurate than exact integration on an approximate geometry. A MATLAB implementation of the presented integration methods and sample data files containing curved-element discretizations of several small molecules are available online at http://web.mit.edu/tidor. PMID:17627358

7 CFR 947.34 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... as a committee member or as an alternate to qualify, or in the event of the death, removal... without regard to nominations, which selection shall be made on the basis of the representation provided...

7 CFR 987.26 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

..., resignation, disqualification, or death of any person nominated to serve on the Committee, or any member or... without regard to nominations, and the selection shall be made on the basis of representation provided in...

7 CFR 920.26 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... member or as an alternate member of the committee to qualify, or in the event of the death, removal... vacancy without regard to nominations, which selection shall be made on the basis of representation...

A Novel Cylindrical Representation for Characterizing Intrinsic Properties of Protein Sequences.

PubMed

Yu, Jia-Feng; Dou, Xiang-Hua; Wang, Hong-Bo; Sun, Xiao; Zhao, Hui-Ying; Wang, Ji-Hua

2015-06-22

The composition and sequence order of amino acid residues are the two most important characteristics to describe a protein sequence. Graphical representations facilitate visualization of biological sequences and produce biologically useful numerical descriptors. In this paper, we propose a novel cylindrical representation by placing the 20 amino acid residue types in a circle and sequence positions along the z axis. This representation allows visualization of the composition and sequence order of amino acids at the same time. Ten numerical descriptors and one weighted numerical descriptor have been developed to quantitatively describe intrinsic properties of protein sequences on the basis of the cylindrical model. Their applications to similarity/dissimilarity analysis of nine ND5 proteins indicated that these numerical descriptors are more effective than several classical numerical matrices. Thus, the cylindrical representation obtained here provides a new useful tool for visualizing and charactering protein sequences. An online server is available at http://biophy.dzu.edu.cn:8080/CNumD/input.jsp .

Weighted Discriminative Dictionary Learning based on Low-rank Representation

NASA Astrophysics Data System (ADS)

Chang, Heyou; Zheng, Hao

2017-01-01

Low-rank representation has been widely used in the field of pattern classification, especially when both training and testing images are corrupted with large noise. Dictionary plays an important role in low-rank representation. With respect to the semantic dictionary, the optimal representation matrix should be block-diagonal. However, traditional low-rank representation based dictionary learning methods cannot effectively exploit the discriminative information between data and dictionary. To address this problem, this paper proposed weighted discriminative dictionary learning based on low-rank representation, where a weighted representation regularization term is constructed. The regularization associates label information of both training samples and dictionary atoms, and encourages to generate a discriminative representation with class-wise block-diagonal structure, which can further improve the classification performance where both training and testing images are corrupted with large noise. Experimental results demonstrate advantages of the proposed method over the state-of-the-art methods.

New instantaneous frequency estimation method based on the use of image processing techniques

NASA Astrophysics Data System (ADS)

Borda, Monica; Nafornita, Ioan; Isar, Alexandru

2003-05-01

The aim of this paper is to present a new method for the estimation of the instantaneous frequency of a frequency modulated signal, corrupted by additive noise. This method represents an example of fusion of two theories: the time-frequency representations and the mathematical morphology. Any time-frequency representation of a useful signal is concentrated around its instantaneous frequency law and realizes the diffusion of the noise that perturbs the useful signal in the time - frequency plane. In this paper a new time-frequency representation, useful for the estimation of the instantaneous frequency, is proposed. This time-frequency representation is the product of two others time-frequency representations: the Wigner - Ville time-frequency representation and a new one obtained by filtering with a hard thresholding filter the Gabor representation of the signal to be processed. Using the image of this new time-frequency representation the instantaneous frequency of the useful signal can be extracted with the aid of some mathematical morphology operators: the conversion in binary form, the dilation and the skeleton. The simulations of the proposed method have proved its qualities. It is better than other estimation methods, like those based on the use of adaptive notch filters.

Orienting numbers in mental space: horizontal organization trumps vertical.

PubMed

Holmes, Kevin J; Lourenco, Stella F

2012-01-01

While research on the spatial representation of number has provided substantial evidence for a horizontally oriented mental number line, recent studies suggest vertical organization as well. Directly comparing the relative strength of horizontal and vertical organization, however, we found no evidence of spontaneous vertical orientation (upward or downward), and horizontal trumped vertical when pitted against each other (Experiment 1). Only when numbers were conceptualized as magnitudes (as opposed to nonmagnitude ordinal sequences) did reliable vertical organization emerge, with upward orientation preferred (Experiment 2). Altogether, these findings suggest that horizontal representations predominate, and that vertical representations, when elicited, may be relatively inflexible. Implications for spatial organization beyond number, and its ontogenetic basis, are discussed.

19 CFR 181.11 - Certificate of Origin.

Code of Federal Regulations, 2012 CFR

2012-04-01

... Certificate on the basis of: (1) Its knowledge of whether the good qualifies as an originating good; (2) Its reasonable reliance on the producer's written representation that the good qualifies as an originating good...

19 CFR 181.11 - Certificate of Origin.

Code of Federal Regulations, 2010 CFR

2010-04-01

... Certificate on the basis of: (1) Its knowledge of whether the good qualifies as an originating good; (2) Its reasonable reliance on the producer's written representation that the good qualifies as an originating good...

7 CFR 932.33 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... the event of the removal, resignation, disqualification, or death of any member or alternate member, a... nominations, but on the basis of the applicable representations and qualifications set forth in §§ 932.25, 932...

7 CFR 945.28 - Vacancies.

Code of Federal Regulations, 2010 CFR

2010-01-01

... member or as an alternate to qualify, or in the event of the death, removal, resignation, or... nominations, which selection shall be made on the basis of the representation provided for in § 945.24. ...

The structure and energetics of Cr(CO)6 and Cr(CO)5

NASA Technical Reports Server (NTRS)

Barnes, Leslie A.; Liu, Bowen; Lindh, Roland

1992-01-01

The geometric structure of Cr(CO)6 is optimized at the modified coupled pair functional (MCPF), single and double excitation coupled-cluster (CCSD) and CCSD(T) levels of theory (including a perturbational estimate for connected triple excitations), and the force constants for the totally symmetric representation are determined. The geometry of Cr(CO)5 is partially optimized at the MCPF, CCSD, and CCSD(T) levels of theory. Comparison with experimental data shows that the CCSD(T) method gives the best results for the structures and force constants, and that remaining errors are probably due to deficiencies in the one-particle basis sets used for CO. The total binding energies of Cr(CO)6 and Cr(CO)5 are also determined at the MCPF, CCSD, and CCSD(T) levels of theory. The CCSD(T) method gives a much larger total binding energy than either the MCPF or CCSD methods. An analysis of the basis set superposition error (BSSE) at the MCPF level of treatment points out limitations in the one-particle basis used. Calculations using larger basis sets reduce the BSSE, but the total binding energy of Cr(CO)6 is still significantly smaller than the experimental value, although the first CO bond dissociation energy of Cr(CO)6 is well described. An investigation of 3s3p correlation reveals only a small effect. In the largest basis set, the total CO binding energy of Cr(CO)6 is estimated to be 140 kcal/mol at the CCSD(T) level of theory, or about 86 percent of the experimental value. The remaining discrepancy between the experimental and theoretical value is probably due to limitations in the one-particle basis, rather than limitations in the correlation treatment. In particular an additional d function and an f function on each C and O are needed to obtain quantitative results. This is underscored by the fact that even using a very large primitive set (1042 primitive functions contracted to 300 basis functions), the superposition error for the total binding energy of Cr(CO)6 is 22 kcal/mol at the MCPF level of treatment.

Intelligent power consumption with two-way shift able feature and its implementation

NASA Astrophysics Data System (ADS)

Xu, Jing; Liu, Youwei

2017-10-01

This paper proposes an intelligent power consumption system with two-way shift able feature and its implementation. Based on power consumption information of standby load and load in working state, a dispatching system decomposes load regulation demand top-down to smart appliances and makes them response orderly as required. It designs a code-based representation method for power consumption information and takes account of standby load, which lays the information foundation for load increment. It also presents a shift able index, which can be used to comprehensively reflect feature of electrical equipment and users and provides a basis for load priority.

Characterizing optical chirality

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

Bliokh, Konstantin Y.; Advanced Science Institute, RIKEN, Wako-shi, Saitama 351-0198; Nori, Franco

We examine the recently introduced measure of chirality of a monochromatic optical field [Y. Tang and A. E. Cohen, Phys. Rev. Lett. 104, 163901 (2010)] using the momentum (plane-wave) representation and helicity basis. Our analysis clarifies the physical meaning of the measure of chirality and unveils its close relation to the polarization helicity, spin angular momentum, energy density, and Poynting energy flow. We derive the operators of the optical chirality and of the corresponding chiral momentum, which acquire remarkably simple forms in the helicity representation.

State Transition Matrix for Perturbed Orbital Motion Using Modified Chebyshev Picard Iteration

NASA Astrophysics Data System (ADS)

Read, Julie L.; Younes, Ahmad Bani; Macomber, Brent; Turner, James; Junkins, John L.

2015-06-01

The Modified Chebyshev Picard Iteration (MCPI) method has recently proven to be highly efficient for a given accuracy compared to several commonly adopted numerical integration methods, as a means to solve for perturbed orbital motion. This method utilizes Picard iteration, which generates a sequence of path approximations, and Chebyshev Polynomials, which are orthogonal and also enable both efficient and accurate function approximation. The nodes consistent with discrete Chebyshev orthogonality are generated using cosine sampling; this strategy also reduces the Runge effect and as a consequence of orthogonality, there is no matrix inversion required to find the basis function coefficients. The MCPI algorithms considered herein are parallel-structured so that they are immediately well-suited for massively parallel implementation with additional speedup. MCPI has a wide range of applications beyond ephemeris propagation, including the propagation of the State Transition Matrix (STM) for perturbed two-body motion. A solution is achieved for a spherical harmonic series representation of earth gravity (EGM2008), although the methodology is suitable for application to any gravity model. Included in this representation the normalized, Associated Legendre Functions are given and verified numerically. Modifications of the classical algorithm techniques, such as rewriting the STM equations in a second-order cascade formulation, gives rise to additional speedup. Timing results for the baseline formulation and this second-order formulation are given.

A Thin-Flux-Rope Approximation as a Basis for Modeling of Pre- and Post-Eruptive Magnetic Configurations

NASA Astrophysics Data System (ADS)

Titov, V. S.; Mikic, Z.; Torok, T.; Linker, J.

2016-12-01

Many existing models of solar flares and coronal mass ejections (CMEs) assume a key role of magnetic flux ropes in these phenomena. It is therefore important to have efficient methods for constructing flux-rope configurations consistent with the observed photospheric magnetic data and morphology of CMEs. As our new step in this direction, we propose an analytical formulation that succinctly represents the magnetic field of a thin flux rope, which has an axis of arbitrary shape and a circular cross-section with the diameter slowly varying along the axis. This representation implies also that the flux rope carries axial current I and axial flux F, so that the respective magnetic field is a curl of the sum of toroidal and poloidal vector potentials proportional to I and F, respectively. Each of the two potentials is individually expressed in terms of a modified Biot-Savart law with separate kernels, both regularized at the rope axis. We argue that the proposed representation is flexible enough to be used in MHD simulations for initializing pre-eruptive configurations in the low corona or post-eruptive configurations (interplanetary CMEs) in the heliosphere. We discuss the potential advantages of our approach, and the subsequent steps to be performed, to develop a fully operative and highly competitive method compared to existing methods. Research supported by NSF, NASA's HSR and LWS Programs, and AFOSR.

Chiral symmetry breaking and the spin content of hadrons

NASA Astrophysics Data System (ADS)

Glozman, L. Ya.; Lang, C. B.; Limmer, M.

2012-04-01

From the parton distributions in the infinite momentum frame, one finds that only about 30% of the nucleon spin is carried by spins of the valence quarks, which gave rise to the term “spin crisis”. Similar results hold for the lowest mesons, as it follows from the lattice simulations. We define the spin content of a meson in the rest frame and use a complete and orthogonal q¯q chiral basis and a unitary transformation from the chiral basis to the 2LJ basis. Then, given a mixture of different allowed chiral representations in the meson wave function at a given resolution scale, one can obtain its spin content at this scale. To obtain the mixture of the chiral representations in the meson, we measure in dynamical lattice simulations a ratio of couplings of interpolators with different chiral structure. For the ρ meson, we obtain practically the 3S1 state with no trace of the spin crisis. Then a natural question arises: which definition does reflect the spin content of a hadron?

Applicability of linearized-theory attached-flow methods to design and analysis of flap systems at low speeds for thin swept wings with sharp leading edges

NASA Technical Reports Server (NTRS)

Carlson, Harry W.; Darden, Christine M.

1987-01-01

Low-speed experimental force and data on a series of thin swept wings with sharp leading edges and leading and trailing-edge flaps are compared with predictions made using a linearized-theory method which includes estimates of vortex forces. These comparisons were made to assess the effectiveness of linearized-theory methods for use in the design and analysis of flap systems in subsonic flow. Results demonstrate that linearized-theory, attached-flow methods (with approximate representation of vortex forces) can form the basis of a rational system for flap design and analysis. Even attached-flow methods that do not take vortex forces into account can be used for the selection of optimized flap-system geometry, but design-point performance levels tend to be underestimated unless vortex forces are included. Illustrative examples of the use of these methods in the design of efficient low-speed flap systems are included.

Computational flow development for unsteady viscous flows: Foundation of the numerical method

NASA Technical Reports Server (NTRS)

Bratanow, T.; Spehert, T.

1978-01-01

A procedure is presented for effective consideration of viscous effects in computational development of high Reynolds number flows. The procedure is based on the interpretation of the Navier-Stokes equations as vorticity transport equations. The physics of the flow was represented in a form suitable for numerical analysis. Lighthill's concept for flow development for computational purposes was adapted. The vorticity transport equations were cast in a form convenient for computation. A statement for these equations was written using the method of weighted residuals and applying the Galerkin criterion. An integral representation of the induced velocity was applied on the basis of the Biot-Savart law. Distribution of new vorticity, produced at wing surfaces over small computational time intervals, was assumed to be confined to a thin region around the wing surfaces.

Sparse nonnegative matrix factorization with ℓ0-constraints

PubMed Central

Peharz, Robert; Pernkopf, Franz

2012-01-01

Although nonnegative matrix factorization (NMF) favors a sparse and part-based representation of nonnegative data, there is no guarantee for this behavior. Several authors proposed NMF methods which enforce sparseness by constraining or penalizing the ℓ1-norm of the factor matrices. On the other hand, little work has been done using a more natural sparseness measure, the ℓ0-pseudo-norm. In this paper, we propose a framework for approximate NMF which constrains the ℓ0-norm of the basis matrix, or the coefficient matrix, respectively. For this purpose, techniques for unconstrained NMF can be easily incorporated, such as multiplicative update rules, or the alternating nonnegative least-squares scheme. In experiments we demonstrate the benefits of our methods, which compare to, or outperform existing approaches. PMID:22505792

Comparison of Ionospheric Vertical Total Electron Content modelling approaches using spline based representations

NASA Astrophysics Data System (ADS)

Krypiak-Gregorczyk, Anna; Wielgosz, Pawel; Borkowski, Andrzej; Schmidt, Michael; Erdogan, Eren; Goss, Andreas

2017-04-01

Since electromagnetic measurements show dispersive characteristics, accurate modelling of the ionospheric electron content plays an important role for positioning and navigation applications to mitigate the effect of the ionospheric disturbances. Knowledge about the ionosphere contributes to a better understanding of space weather events as well as to forecast these events to enable protective measures in advance for electronic systems and satellite missions. In the last decades, advances in satellite technologies, data analysis techniques and models together with a rapidly growing number of analysis centres allow modelling the ionospheric electron content with an unprecedented accuracy in (near) real-time. In this sense, the representation of electron content variations in time and space with spline basis functions has gained practical importance in global and regional ionosphere modelling. This is due to their compact support and their flexibility to handle unevenly distributed observations and data gaps. In this contribution, the performances of two ionosphere models from UWM and DGFI-TUM, which are developed using spline functions are evaluated. The VTEC model of DGFI-TUM is based on tensor products of trigonometric B-spline functions in longitude and polynomial B-spline functions in latitude for a global representation. The UWM model uses two dimensional planar thin plate spline (TPS) with the Universal Transverse Mercator representation of ellipsoidal coordinates. In order to provide a smooth VTEC model, the TPS minimizes both, the squared norm of the Hessian matrix and deviations between data points and the model. In the evaluations, the differenced STEC analysis method and Jason-2 altimetry comparisons are applied.

Towards an Effective Theory of Reformulation. Part 1; Semantics

NASA Technical Reports Server (NTRS)

Benjamin, D. Paul

1992-01-01

This paper describes an investigation into the structure of representations of sets of actions, utilizing semigroup theory. The goals of this project are twofold: to shed light on the relationship between tasks and representations, leading to a classification of tasks according to the representations they admit; and to develop techniques for automatically transforming representations so as to improve problem-solving performance. A method is demonstrated for automatically generating serial algorithms for representations whose actions form a finite group. This method is then extended to representations whose actions form a finite inverse semigroup.

Structure factors for tunneling ionization rates of molecules: General Hartree-Fock-based integral representation

NASA Astrophysics Data System (ADS)

Madsen, Lars Bojer; Jensen, Frank; Dnestryan, Andrey I.; Tolstikhin, Oleg I.

2017-07-01

In the leading-order approximation of the weak-field asymptotic theory (WFAT), the dependence of the tunneling ionization rate of a molecule in an electric field on its orientation with respect to the field is determined by the structure factor of the ionizing molecular orbital. The WFAT yields an expression for the structure factor in terms of a local property of the orbital in the asymptotic region. However, in general quantum chemistry approaches molecular orbitals are expanded in a Gaussian basis which does not reproduce their asymptotic behavior correctly. This hinders the application of the WFAT to polyatomic molecules, which are attracting increasing interest in strong-field physics. Recently, an integral-equation approach to the WFAT for tunneling ionization of one electron from an arbitrary potential has been developed. The structure factor is expressed in an integral form as a matrix element involving the ionizing orbital. The integral is not sensitive to the asymptotic behavior of the orbital, which resolves the difficulty mentioned above. Here, we extend the integral representation for the structure factor to many-electron systems treated within the Hartree-Fock method and show how it can be implemented on the basis of standard quantum chemistry software packages. We validate the methodology by considering noble-gas atoms and the CO molecule, for which accurate structure factors exist in the literature. We also present benchmark results for CO2 and for NH3 in the pyramidal and planar geometries.

Place Cell Networks in Pre-weanling Rats Show Associative Memory Properties from the Onset of Exploratory Behavior.

PubMed

Muessig, L; Hauser, J; Wills, T J; Cacucci, F

2016-08-01

Place cells are hippocampal pyramidal cells that are active when an animal visits a restricted area of the environment, and collectively their activity constitutes a neural representation of space. Place cell populations in the adult rat hippocampus display fundamental properties consistent with an associative memory network: the ability to 1) generate new and distinct spatial firing patterns when encountering novel spatial contexts or changes in sensory input ("remapping") and 2) reinstate previously stored firing patterns when encountering a familiar context, including on the basis of an incomplete/degraded set of sensory cues ("pattern completion"). To date, it is unknown when these spatial memory responses emerge during brain development. Here, we show that, from the age of first exploration (postnatal day 16) onwards, place cell populations already exhibit these key features: they generate new representations upon exposure to a novel context and can reactivate familiar representations on the basis of an incomplete set of sensory cues. These results demonstrate that, as early as exploratory behaviors emerge, and despite the absence of an adult-like grid cell network, the developing hippocampus processes incoming sensory information as an associative memory network. © The Author 2016. Published by Oxford University Press.

The representation of object viewpoint in human visual cortex.

PubMed

Andresen, David R; Vinberg, Joakim; Grill-Spector, Kalanit

2009-04-01

Understanding the nature of object representations in the human brain is critical for understanding the neural basis of invariant object recognition. However, the degree to which object representations are sensitive to object viewpoint is unknown. Using fMRI we employed a parametric approach to examine the sensitivity to object view as a function of rotation (0 degrees-180 degrees ), category (animal/vehicle) and fMRI-adaptation paradigm (short or long-lagged). For both categories and fMRI-adaptation paradigms, object-selective regions recovered from adaptation when a rotated view of an object was shown after adaptation to a specific view of that object, suggesting that representations are sensitive to object rotation. However, we found evidence for differential representations across categories and ventral stream regions. Rotation cross-adaptation was larger for animals than vehicles, suggesting higher sensitivity to vehicle than animal rotation, and was largest in the left fusiform/occipito-temporal sulcus (pFUS/OTS), suggesting that this region has low sensitivity to rotation. Moreover, right pFUS/OTS and FFA responded more strongly to front than back views of animals (without adaptation) and rotation cross-adaptation depended both on the level of rotation and the adapting view. This result suggests a prevalence of neurons that prefer frontal views of animals in fusiform regions. Using a computational model of view-tuned neurons, we demonstrate that differential neural view tuning widths and relative distributions of neural-tuned populations in fMRI voxels can explain the fMRI results. Overall, our findings underscore the utility of parametric approaches for studying the neural basis of object invariance and suggest that there is no complete invariance to object view in the human ventral stream.

A Description of Exotic Nuclei by the Aid of Virtual States

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

Vertse, T.; University of Debrecen, Faculty of Information Science, H-4010 Debrecen, Pf. 12; Id Betan, R.

2005-11-21

A new unified shell model scheme is introduced in which the single particle basis is a generalization of the Berggren representation. This repesentation includes virtual i.e. antibound basis states as well. We apply the new scheme to the ground state of the exotic nucleus 11Li. Here the antibound pole and the complex continuum both have large contributions and neither of them can be neglected.

40 CFR 1620.3 - Administrative claim; who may file.

Code of Federal Regulations, 2010 CFR

2010-07-01

...) A claim based on death may be presented by the executor or administrator of the decedent's estate... that the basis for the representation is documented in writing. (d) A claim for loss totally...

Cognitive and artificial representations in handwriting recognition

NASA Astrophysics Data System (ADS)

Lenaghan, Andrew P.; Malyan, Ron

1996-03-01

Both cognitive processes and artificial recognition systems may be characterized by the forms of representation they build and manipulate. This paper looks at how handwriting is represented in current recognition systems and the psychological evidence for its representation in the cognitive processes responsible for reading. Empirical psychological work on feature extraction in early visual processing is surveyed to show that a sound psychological basis for feature extraction exists and to describe the features this approach leads to. The first stage of the development of an architecture for a handwriting recognition system which has been strongly influenced by the psychological evidence for the cognitive processes and representations used in early visual processing, is reported. This architecture builds a number of parallel low level feature maps from raw data. These feature maps are thresholded and a region labeling algorithm is used to generate sets of features. Fuzzy logic is used to quantify the uncertainty in the presence of individual features.

Representational constraints on children's suggestibility.

PubMed

Ceci, Stephen J; Papierno, Paul B; Kulkofsky, Sarah

2007-06-01

In a multistage experiment, twelve 4- and 9-year-old children participated in a triad rating task. Their ratings were mapped with multidimensional scaling, from which euclidean distances were computed to operationalize semantic distance between items in target pairs. These children and age-mates then participated in an experiment that employed these target pairs in a story, which was followed by a misinformation manipulation. Analyses linked individual and developmental differences in suggestibility to children's representations of the target items. Semantic proximity was a strong predictor of differences in suggestibility: The closer a suggested distractor was to the original item's representation, the greater was the distractor's suggestive influence. The triad participants' semantic proximity subsequently served as the basis for correctly predicting memory performance in the larger group. Semantic proximity enabled a priori counterintuitive predictions of reverse age-related trends to be confirmed whenever the distance between representations of items in a target pair was greater for younger than for older children.

Is the asymmetry in young infants' categorization of humans versus nonhuman animals based on head, body, or global gestalt information?

PubMed

Quinn, Paul C

2004-02-01

Quinn and Eimas (1998) reported an asymmetry in the exclusivity of the category representations that young infants form for humans and nonhuman animals: category representations for nonhuman animal species were found to exclude humans, whereas a category representation for humans was found to include nonhuman animal species (i.e., cats, horses). The present experiment utilized the familiarization/novelty-preference procedure with 3- and 4-month-olds to determine the perceptual cues (i.e., whole stimulus, head alone, body alone) that provided the basis for this asymmetry. The data revealed the asymmetry to be observable only with the whole animal stimuli and not when infants were provided with information from just the head or the body of the exemplars. The results indicate that the incorporation of nonhuman animal species into a category representation for humans is based on holistic information.

Linking Neural and Symbolic Representation and Processing of Conceptual Structures

PubMed Central

van der Velde, Frank; Forth, Jamie; Nazareth, Deniece S.; Wiggins, Geraint A.

2017-01-01

We compare and discuss representations in two cognitive architectures aimed at representing and processing complex conceptual (sentence-like) structures. First is the Neural Blackboard Architecture (NBA), which aims to account for representation and processing of complex and combinatorial conceptual structures in the brain. Second is IDyOT (Information Dynamics of Thinking), which derives sentence-like structures by learning statistical sequential regularities over a suitable corpus. Although IDyOT is designed at a level more abstract than the neural, so it is a model of cognitive function, rather than neural processing, there are strong similarities between the composite structures developed in IDyOT and the NBA. We hypothesize that these similarities form the basis of a combined architecture in which the individual strengths of each architecture are integrated. We outline and discuss the characteristics of this combined architecture, emphasizing the representation and processing of conceptual structures. PMID:28848460

Sparse and redundant representations for inverse problems and recognition

NASA Astrophysics Data System (ADS)

Patel, Vishal M.

Sparse and redundant representation of data enables the description of signals as linear combinations of a few atoms from a dictionary. In this dissertation, we study applications of sparse and redundant representations in inverse problems and object recognition. Furthermore, we propose two novel imaging modalities based on the recently introduced theory of Compressed Sensing (CS). This dissertation consists of four major parts. In the first part of the dissertation, we study a new type of deconvolution algorithm that is based on estimating the image from a shearlet decomposition. Shearlets provide a multi-directional and multi-scale decomposition that has been mathematically shown to represent distributed discontinuities such as edges better than traditional wavelets. We develop a deconvolution algorithm that allows for the approximation inversion operator to be controlled on a multi-scale and multi-directional basis. Furthermore, we develop a method for the automatic determination of the threshold values for the noise shrinkage for each scale and direction without explicit knowledge of the noise variance using a generalized cross validation method. In the second part of the dissertation, we study a reconstruction method that recovers highly undersampled images assumed to have a sparse representation in a gradient domain by using partial measurement samples that are collected in the Fourier domain. Our method makes use of a robust generalized Poisson solver that greatly aids in achieving a significantly improved performance over similar proposed methods. We will demonstrate by experiments that this new technique is more flexible to work with either random or restricted sampling scenarios better than its competitors. In the third part of the dissertation, we introduce a novel Synthetic Aperture Radar (SAR) imaging modality which can provide a high resolution map of the spatial distribution of targets and terrain using a significantly reduced number of needed transmitted and/or received electromagnetic waveforms. We demonstrate that this new imaging scheme, requires no new hardware components and allows the aperture to be compressed. Also, it presents many new applications and advantages which include strong resistance to countermesasures and interception, imaging much wider swaths and reduced on-board storage requirements. The last part of the dissertation deals with object recognition based on learning dictionaries for simultaneous sparse signal approximations and feature extraction. A dictionary is learned for each object class based on given training examples which minimize the representation error with a sparseness constraint. A novel test image is then projected onto the span of the atoms in each learned dictionary. The residual vectors along with the coefficients are then used for recognition. Applications to illumination robust face recognition and automatic target recognition are presented.

A New DEM Generalization Method Based on Watershed and Tree Structure

PubMed Central

Chen, Yonggang; Ma, Tianwu; Chen, Xiaoyin; Chen, Zhende; Yang, Chunju; Lin, Chenzhi; Shan, Ligang

2016-01-01

The DEM generalization is the basis of multi-dimensional observation, the basis of expressing and analyzing the terrain. DEM is also the core of building the Multi-Scale Geographic Database. Thus, many researchers have studied both the theory and the method of DEM generalization. This paper proposed a new method of generalizing terrain, which extracts feature points based on the tree model construction which considering the nested relationship of watershed characteristics. The paper used the 5 m resolution DEM of the Jiuyuan gully watersheds in the Loess Plateau as the original data and extracted the feature points in every single watershed to reconstruct the DEM. The paper has achieved generalization from 1:10000 DEM to 1:50000 DEM by computing the best threshold. The best threshold is 0.06. In the last part of the paper, the height accuracy of the generalized DEM is analyzed by comparing it with some other classic methods, such as aggregation, resample, and VIP based on the original 1:50000 DEM. The outcome shows that the method performed well. The method can choose the best threshold according to the target generalization scale to decide the density of the feature points in the watershed. Meanwhile, this method can reserve the skeleton of the terrain, which can meet the needs of different levels of generalization. Additionally, through overlapped contour contrast, elevation statistical parameters and slope and aspect analysis, we found out that the W8D algorithm performed well and effectively in terrain representation. PMID:27517296

Self-assessment procedure using fuzzy sets

NASA Astrophysics Data System (ADS)

Mimi, Fotini

2000-10-01

Self-Assessment processes, initiated by a company itself and carried out by its own people, are considered to be the starting point for a regular strategic or operative planning process to ensure a continuous quality improvement. Their importance has increased by the growing relevance and acceptance of international quality awards such as the Malcolm Baldrige National Quality Award, the European Quality Award and the Deming Prize. Especially award winners use the instrument of a systematic and regular Self-Assessment and not only because they have to verify their quality and business results for at least three years. The Total Quality Model of the European Foundation for Quality Management (EFQM), used for the European Quality Award, is the basis for Self-Assessment in Europe. This paper presents a self-assessment supporting method based on a methodology of fuzzy control systems providing an effective means of converting the linguistic approximation into an automatic control strategy. In particular, the elements of the Quality Model mentioned above are interpreted as linguistic variables. The LR-type of a fuzzy interval is used for their representation. The input data has a qualitative character based on empirical investigation and expert knowledge and therefore the base- variables are ordinal scaled. The aggregation process takes place on the basis of a hierarchical structure. Finally, in order to render the use of the method more practical a software system on PC basis is developed and implemented.

Methods to achieve accurate projection of regional and global raster databases

USGS Publications Warehouse

Usery, E.L.; Seong, J.C.; Steinwand, D.R.; Finn, M.P.

2002-01-01

This research aims at building a decision support system (DSS) for selecting an optimum projection considering various factors, such as pixel size, areal extent, number of categories, spatial pattern of categories, resampling methods, and error correction methods. Specifically, this research will investigate three goals theoretically and empirically and, using the already developed empirical base of knowledge with these results, develop an expert system for map projection of raster data for regional and global database modeling. The three theoretical goals are as follows: (1) The development of a dynamic projection that adjusts projection formulas for latitude on the basis of raster cell size to maintain equal-sized cells. (2) The investigation of the relationships between the raster representation and the distortion of features, number of categories, and spatial pattern. (3) The development of an error correction and resampling procedure that is based on error analysis of raster projection.

Computing multiple periodic solutions of nonlinear vibration problems using the harmonic balance method and Groebner bases

NASA Astrophysics Data System (ADS)

Grolet, Aurelien; Thouverez, Fabrice

2015-02-01

This paper is devoted to the study of vibration of mechanical systems with geometric nonlinearities. The harmonic balance method is used to derive systems of polynomial equations whose solutions give the frequency component of the possible steady states. Groebner basis methods are used for computing all solutions of polynomial systems. This approach allows to reduce the complete system to an unique polynomial equation in one variable driving all solutions of the problem. In addition, in order to decrease the number of variables, we propose to first work on the undamped system, and recover solution of the damped system using a continuation on the damping parameter. The search for multiple solutions is illustrated on a simple system, where the influence of the retained number of harmonic is studied. Finally, the procedure is applied on a simple cyclic system and we give a representation of the multiple states versus frequency.

Dissociative recombination by frame transformation to Siegert pseudostates: A comparison with a numerically solvable model

NASA Astrophysics Data System (ADS)

Hvizdoš, Dávid; Váňa, Martin; Houfek, Karel; Greene, Chris H.; Rescigno, Thomas N.; McCurdy, C. William; Čurík, Roman

2018-02-01

We present a simple two-dimensional model of the indirect dissociative recombination process. The model has one electronic and one nuclear degree of freedom and it can be solved to high precision, without making any physically motivated approximations, by employing the exterior complex scaling method together with the finite-elements method and discrete variable representation. The approach is applied to solve a model for dissociative recombination of H2 + in the singlet ungerade channels, and the results serve as a benchmark to test validity of several physical approximations commonly used in the computational modeling of dissociative recombination for real molecular targets. The second, approximate, set of calculations employs a combination of multichannel quantum defect theory and frame transformation into a basis of Siegert pseudostates. The cross sections computed with the two methods are compared in detail for collision energies from 0 to 2 eV.

Opaque models: Using drugs and dreams to explore the neurobiological basis of mental phenomena.

PubMed

Langlitz, Nicolas

2017-01-01

On the basis of four historical and ethnographic case studies of modeling in neuroscience laboratories, this chapter introduces a distinction between transparent and opaque models. A transparent model is a simplified representation of a real world phenomenon. If it is not patently clear, it is at least much better comprehended than its objects of representation. An opaque model, by contrast, looks at one only partially understood phenomenon to stand in for another partially understood phenomenon. Here, the model is often just as complex as its target. Examples of such opaque models discussed in this chapter are the use of hallucinogen intoxication in humans and animals as well as the dreaming brain as models of psychosis as well as the dreaming brain as a model of consciousness in general. Several functions of opaque models are discussed, ranging from the generation of funding to the formulation of new research questions. While science studies scholars have often emphasized the epistemic fertility of failures of representation, the opacity of hallucinogen intoxications and dreams seems to have diminished the potential to produce positive knowledge from the representational relationship between the supposed models and their targets. Bidirectional comparisons between inebriation, dreaming, and psychosis, however, proved to be generative on the level of basic science. Moreover, the opaque models discussed in this chapter implicated cosmologies that steered research endeavors into certain directions rather than others. © 2017 Elsevier B.V. All rights reserved.

Multimodal representation of limb endpoint position in the posterior parietal cortex.

PubMed

Shi, Ying; Apker, Gregory; Buneo, Christopher A

2013-04-01

Understanding the neural representation of limb position is important for comprehending the control of limb movements and the maintenance of body schema, as well as for the development of neuroprosthetic systems designed to replace lost limb function. Multiple subcortical and cortical areas contribute to this representation, but its multimodal basis has largely been ignored. Regarding the parietal cortex, previous results suggest that visual information about arm position is not strongly represented in area 5, although these results were obtained under conditions in which animals were not using their arms to interact with objects in their environment, which could have affected the relative weighting of relevant sensory signals. Here we examined the multimodal basis of limb position in the superior parietal lobule (SPL) as monkeys reached to and actively maintained their arm position at multiple locations in a frontal plane. On half of the trials both visual and nonvisual feedback of the endpoint of the arm were available, while on the other trials visual feedback was withheld. Many neurons were tuned to arm position, while a smaller number were modulated by the presence/absence of visual feedback. Visual modulation generally took the form of a decrease in both firing rate and variability with limb vision and was associated with more accurate decoding of position at the population level under these conditions. These findings support a multimodal representation of limb endpoint position in the SPL but suggest that visual signals are relatively weakly represented in this area, and only at the population level.

Navigation based on a sensorimotor representation: a virtual reality study

NASA Astrophysics Data System (ADS)

Zetzsche, Christoph; Galbraith, Christopher; Wolter, Johannes; Schill, Kerstin

2007-02-01

We investigate the hypothesis that the basic representation of space which underlies human navigation does not resemble an image-like map and is not restricted by the laws of Euclidean geometry. For this we developed a new experimental technique in which we use the properties of a virtual environment (VE) to directly influence the development of the representation. We compared the navigation performance of human observers under two conditions. Either the VE is consistent with the geometrical properties of physical space and could hence be represented in a map-like fashion, or it contains severe violations of Euclidean metric and planar topology, and would thus pose difficulties for the correct development of such a representation. Performance is not influenced by this difference, suggesting that a map-like representation is not the major basis of human navigation. Rather, the results are consistent with a representation which is similar to a non-planar graph augmented with path length information, or with a sensorimotor representation which combines sensory properties and motor actions. The latter may be seen as part of a revised view of perceptual processes due to recent results in psychology and neurobiology, which indicate that the traditional strict separation of sensory and motor systems is no longer tenable.

Illuminating the conceptual structure of the space of moral violations with searchlight representational similarity analysis.

PubMed

Wasserman, E A; Chakroff, A; Saxe, R; Young, L

2017-10-01

Characterizing how representations of moral violations are organized, cognitively and neurally, is central to understanding how people conceive and judge them. Past work has identified brain regions that represent morally relevant features and distinguish moral domains, but has not yet advanced a broader account of where and on what basis neural representations of moral violations are organized. With searchlight representational similarity analysis, we investigate where category membership drives similarity in neural patterns during moral judgment of violations from two key moral domains: Harm and Purity. Representations converge across domains in a network of regions resembling the mentalizing network. However, Harm and Purity violation representations respectively converge in different regions: precuneus (PC) and left inferior frontal gyrus (LIFG). Examining substructure within moral domains, Harm violations converge in PC regardless of subdomain (physical harms, psychological harms), while Purity subdomains (pathogen-related violations, sex-related violations) converge in distinct sets of regions - mirroring a dissociation observed in principal-component analysis of behavioral data. Further, we find initial evidence for representation of morally relevant features within these two domain-encoding regions. The present analyses offer a case study for understanding how organization within the complex conceptual space of moral violations is reflected in the organization of neural patterns across the cortex. Copyright © 2017 Elsevier Inc. All rights reserved.

Fusion basis for lattice gauge theory and loop quantum gravity

NASA Astrophysics Data System (ADS)

Delcamp, Clement; Dittrich, Bianca; Riello, Aldo

2017-02-01

We introduce a new basis for the gauge-invariant Hilbert space of lattice gauge theory and loop quantum gravity in (2 + 1) dimensions, the fusion basis. In doing so, we shift the focus from the original lattice (or spin-network) structure directly to that of the magnetic (curvature) and electric (torsion) excitations themselves. These excitations are classified by the irreducible representations of the Drinfel'd double of the gauge group, and can be readily "fused" together by studying the tensor product of such representations. We will also describe in detail the ribbon operators that create and measure these excitations and make the quasi-local structure of the observable algebra explicit. Since the fusion basis allows for both magnetic and electric excitations from the onset, it turns out to be a precious tool for studying the large scale structure and coarse-graining flow of lattice gauge theories and loop quantum gravity. This is in neat contrast with the widely used spin-network basis, in which it is much more complicated to account for electric excitations, i.e. for Gauß constraint violations, emerging at larger scales. Moreover, since the fusion basis comes equipped with a hierarchical structure, it readily provides the language to design states with sophisticated multi-scale structures. Another way to employ this hierarchical structure is to encode a notion of subsystems for lattice gauge theories and (2 + 1) gravity coupled to point particles. In a follow-up work, we have exploited this notion to provide a new definition of entanglement entropy for these theories.

Designing scalable product families by the radial basis function-high-dimensional model representation metamodelling technique

NASA Astrophysics Data System (ADS)

Pirmoradi, Zhila; Haji Hajikolaei, Kambiz; Wang, G. Gary

2015-10-01

Product family design is cost-efficient for achieving the best trade-off between commonalization and diversification. However, for computationally intensive design functions which are viewed as black boxes, the family design would be challenging. A two-stage platform configuration method with generalized commonality is proposed for a scale-based family with unknown platform configuration. Unconventional sensitivity analysis and information on variation in the individual variants' optimal design are used for platform configuration design. Metamodelling is employed to provide the sensitivity and variable correlation information, leading to significant savings in function calls. A family of universal electric motors is designed for product performance and the efficiency of this method is studied. The impact of the employed parameters is also analysed. Then, the proposed method is modified for obtaining higher commonality. The proposed method is shown to yield design solutions with better objective function values, allowable performance loss and higher commonality than the previously developed methods in the literature.

Impossibility Theorem in Proportional Representation Problem

NASA Astrophysics Data System (ADS)

Karpov, Alexander

2010-09-01

The study examines general axiomatics of Balinski and Young and analyzes existed proportional representation methods using this approach. The second part of the paper provides new axiomatics based on rational choice models. New system of axioms is applied to study known proportional representation systems. It is shown that there is no proportional representation method satisfying a minimal set of the axioms (monotonicity and neutrality).

[Sociophysiology: basic processes of empathy].

PubMed

Haker, Helene; Schimansky, Jenny; Rössler, Wulf

2010-01-01

The aim of this review is to describe sociophysiological and social cognitive processes that underlie the complex phenomenon of human empathy. Automatic reflexive processes such as physiological contagion and action mirroring are mediated by the mirror neuron system. They are a basis for further processing of social signals and a physiological link between two individuals. This link comprises simultaneous activation of shared motor representations. Shared representations lead implicitly via individual associations in the limbic and vegetative system to a shared affective state. These processes are called sociophysiology. Further controlled- reflective, self-referential processing of those social signals leads to explicit, conscious representations of others' minds. Those higher-order processes are called social cognition. The interaction of physiological and cognitive social processes lets arise the phenomenon of human empathy.

Students' meaning making in science: solving energy resource problems in virtual worlds combined with spreadsheets to develop graphs

NASA Astrophysics Data System (ADS)

Krange, Ingeborg; Arnseth, Hans Christian

2012-09-01

The aim of this study is to scrutinize the characteristics of conceptual meaning making when students engage with virtual worlds in combination with a spreadsheet with the aim to develop graphs. We study how these tools and the representations they contain or enable students to construct serve to influence their understanding of energy resource consumption. The data were gathered in 1st grade upper-secondary science classes and they constitute the basis for the interaction analysis of students' meaning making with representations. Our analyses demonstrate the difficulties involved in developing students' orientation toward more conceptual orientations to representations of the knowledge domain. Virtual worlds do not in themselves represent a solution to this problem.

Importance of perceptual representation in the visual control of action

NASA Astrophysics Data System (ADS)

Loomis, Jack M.; Beall, Andrew C.; Kelly, Jonathan W.; Macuga, Kristen L.

2005-03-01

In recent years, many experiments have demonstrated that optic flow is sufficient for visually controlled action, with the suggestion that perceptual representations of 3-D space are superfluous. In contrast, recent research in our lab indicates that some visually controlled actions, including some thought to be based on optic flow, are indeed mediated by perceptual representations. For example, we have demonstrated that people are able to perform complex spatial behaviors, like walking, driving, and object interception, in virtual environments which are rendered visible solely by cyclopean stimulation (random-dot cinematograms). In such situations, the absence of any retinal optic flow that is correlated with the objects and surfaces within the virtual environment means that people are using stereo-based perceptual representations to perform the behavior. The fact that people can perform such behaviors without training suggests that the perceptual representations are likely the same as those used when retinal optic flow is present. Other research indicates that optic flow, whether retinal or a more abstract property of the perceptual representation, is not the basis for postural control, because postural instability is related to perceived relative motion between self and the visual surroundings rather than to optic flow, even in the abstract sense.

On squares of representations of compact Lie algebras

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

Zeier, Robert, E-mail: robert.zeier@ch.tum.de; Zimborás, Zoltán, E-mail: zimboras@gmail.com

We study how tensor products of representations decompose when restricted from a compact Lie algebra to one of its subalgebras. In particular, we are interested in tensor squares which are tensor products of a representation with itself. We show in a classification-free manner that the sum of multiplicities and the sum of squares of multiplicities in the corresponding decomposition of a tensor square into irreducible representations has to strictly grow when restricted from a compact semisimple Lie algebra to a proper subalgebra. For this purpose, relevant details on tensor products of representations are compiled from the literature. Since the summore » of squares of multiplicities is equal to the dimension of the commutant of the tensor-square representation, it can be determined by linear-algebra computations in a scenario where an a priori unknown Lie algebra is given by a set of generators which might not be a linear basis. Hence, our results offer a test to decide if a subalgebra of a compact semisimple Lie algebra is a proper one without calculating the relevant Lie closures, which can be naturally applied in the field of controlled quantum systems.« less

Rapid tuning shifts in human auditory cortex enhance speech intelligibility

PubMed Central

Holdgraf, Christopher R.; de Heer, Wendy; Pasley, Brian; Rieger, Jochem; Crone, Nathan; Lin, Jack J.; Knight, Robert T.; Theunissen, Frédéric E.

2016-01-01

Experience shapes our perception of the world on a moment-to-moment basis. This robust perceptual effect of experience parallels a change in the neural representation of stimulus features, though the nature of this representation and its plasticity are not well-understood. Spectrotemporal receptive field (STRF) mapping describes the neural response to acoustic features, and has been used to study contextual effects on auditory receptive fields in animal models. We performed a STRF plasticity analysis on electrophysiological data from recordings obtained directly from the human auditory cortex. Here, we report rapid, automatic plasticity of the spectrotemporal response of recorded neural ensembles, driven by previous experience with acoustic and linguistic information, and with a neurophysiological effect in the sub-second range. This plasticity reflects increased sensitivity to spectrotemporal features, enhancing the extraction of more speech-like features from a degraded stimulus and providing the physiological basis for the observed ‘perceptual enhancement' in understanding speech. PMID:27996965

Perceptual inference.

PubMed

Aggelopoulos, Nikolaos C

2015-08-01

Perceptual inference refers to the ability to infer sensory stimuli from predictions that result from internal neural representations built through prior experience. Methods of Bayesian statistical inference and decision theory model cognition adequately by using error sensing either in guiding action or in "generative" models that predict the sensory information. In this framework, perception can be seen as a process qualitatively distinct from sensation, a process of information evaluation using previously acquired and stored representations (memories) that is guided by sensory feedback. The stored representations can be utilised as internal models of sensory stimuli enabling long term associations, for example in operant conditioning. Evidence for perceptual inference is contributed by such phenomena as the cortical co-localisation of object perception with object memory, the response invariance in the responses of some neurons to variations in the stimulus, as well as from situations in which perception can be dissociated from sensation. In the context of perceptual inference, sensory areas of the cerebral cortex that have been facilitated by a priming signal may be regarded as comparators in a closed feedback loop, similar to the better known motor reflexes in the sensorimotor system. The adult cerebral cortex can be regarded as similar to a servomechanism, in using sensory feedback to correct internal models, producing predictions of the outside world on the basis of past experience. Copyright © 2015 Elsevier Ltd. All rights reserved.

When Does Changing Representation Improve Problem-Solving Performance?

NASA Technical Reports Server (NTRS)

Holte, Robert; Zimmer, Robert; MacDonald, Alan

1992-01-01

The aim of changing representation is the improvement of problem-solving efficiency. For the most widely studied family of methods of change of representation it is shown that the value of a single parameter, called the expulsion factor, is critical in determining (1) whether the change of representation will improve or degrade problem-solving efficiency and (2) whether the solutions produced using the change of representation will or will not be exponentially longer than the shortest solution. A method of computing the expansion factor for a given change of representation is sketched in general and described in detail for homomorphic changes of representation. The results are illustrated with homomorphic decompositions of the Towers of Hanoi problem.

Two-body potential model based on cosine series expansion for ionic materials

DOE PAGES

Oda, Takuji; Weber, William J.; Tanigawa, Hisashi

2015-09-23

There is a method to construct a two-body potential model for ionic materials with a Fourier series basis and we examine it. For this method, the coefficients of cosine basis functions are uniquely determined by solving simultaneous linear equations to minimize the sum of weighted mean square errors in energy, force and stress, where first-principles calculation results are used as the reference data. As a validation test of the method, potential models for magnesium oxide are constructed. The mean square errors appropriately converge with respect to the truncation of the cosine series. This result mathematically indicates that the constructed potentialmore » model is sufficiently close to the one that is achieved with the non-truncated Fourier series and demonstrates that this potential virtually provides minimum error from the reference data within the two-body representation. The constructed potential models work appropriately in both molecular statics and dynamics simulations, especially if a two-step correction to revise errors expected in the reference data is performed, and the models clearly outperform two existing Buckingham potential models that were tested. Moreover, the good agreement over a broad range of energies and forces with first-principles calculations should enable the prediction of materials behavior away from equilibrium conditions, such as a system under irradiation.« less

Executive function depletion in children and its impact on theory of mind.

PubMed

Powell, Lindsey J; Carey, Susan

2017-07-01

The current studies provide an experimental, rather than correlational, method for testing hypotheses about the role of executive function (EF) in conceptual development. Previous research has established that adults' tendency to deploy EF can be temporarily diminished by use. Exercising self-control in one context decreases adults' performance on other EF demanding tasks immediately thereafter. Using two different depletion methods, Experiments 1 and 3 extend this finding to preschool-aged children. Experiments 2 and 4 make use of these EF depletion methods to elucidate the role of EF in children's theory of mind reasoning. Experiment 2 shows that EF depletion affects 5-year-olds' ability to predict another's behavior on the basis of that person's false belief, and Experiment 4 shows that this negative effect of depletion extends to 4- and 5-year-olds' ability to explain others' behavior on the basis of their false beliefs. These findings provide direct evidence that EF is required for the expression of an understanding of others' false beliefs across a variety of task demands, even in children who clearly have the capacity to construct such representations. We suggest ways in which depletion may be used as a tool for further investigating the role of executive function in cognitive development. Copyright © 2017. Published by Elsevier B.V.

Primate-inspired vehicle navigation using optic flow and mental rotations

NASA Astrophysics Data System (ADS)

Arkin, Ronald C.; Dellaert, Frank; Srinivasan, Natesh; Kerwin, Ryan

2013-05-01

Robot navigation already has many relatively efficient solutions: reactive control, simultaneous localization and mapping (SLAM), Rapidly-Exploring Random Trees (RRTs), etc. But many primates possess an additional inherent spatial reasoning capability: mental rotation. Our research addresses the question of what role, if any, mental rotations can play in enhancing existing robot navigational capabilities. To answer this question we explore the use of optical flow as a basis for extracting abstract representations of the world, comparing these representations with a goal state of similar format and then iteratively providing a control signal to a robot to allow it to move in a direction consistent with achieving that goal state. We study a range of transformation methods to implement the mental rotation component of the architecture, including correlation and matching based on cognitive studies. We also include a discussion of how mental rotations may play a key role in understanding spatial advice giving, particularly from other members of the species, whether in map-based format, gestures, or other means of communication. Results to date are presented on our robotic platform.

Gait recognition based on Gabor wavelets and modified gait energy image for human identification

NASA Astrophysics Data System (ADS)

Huang, Deng-Yuan; Lin, Ta-Wei; Hu, Wu-Chih; Cheng, Chih-Hsiang

2013-10-01

This paper proposes a method for recognizing human identity using gait features based on Gabor wavelets and modified gait energy images (GEIs). Identity recognition by gait generally involves gait representation, extraction, and classification. In this work, a modified GEI convolved with an ensemble of Gabor wavelets is proposed as a gait feature. Principal component analysis is then used to project the Gabor-wavelet-based gait features into a lower-dimension feature space for subsequent classification. Finally, support vector machine classifiers based on a radial basis function kernel are trained and utilized to recognize human identity. The major contributions of this paper are as follows: (1) the consideration of the shadow effect to yield a more complete segmentation of gait silhouettes; (2) the utilization of motion estimation to track people when walkers overlap; and (3) the derivation of modified GEIs to extract more useful gait information. Extensive performance evaluation shows a great improvement of recognition accuracy due to the use of shadow removal, motion estimation, and gait representation using the modified GEIs and Gabor wavelets.

Characterising switching behaviour in perceptual multi-stability.

PubMed

Denham, Susan; Bendixen, Alexandra; Mill, Robert; Tóth, Dénes; Wennekers, Thomas; Coath, Martin; Bőhm, Tamás; Szalardy, Orsolya; Winkler, István

2012-09-15

When people experience an unchanging sensory input for a long period of time, their perception tends to switch stochastically and unavoidably between alternative interpretations of the sensation; a phenomenon known as perceptual bi-stability or multi-stability. The huge variability in the experimental data obtained in such paradigms makes it difficult to distinguish typical patterns of behaviour, or to identify differences between switching patterns. Here we propose a new approach to characterising switching behaviour based upon the extraction of transition matrices from the data, which provide a compact representation that is well-understood mathematically. On the basis of this representation we can characterise patterns of perceptual switching, visualise and simulate typical switching patterns, and calculate the likelihood of observing a particular switching pattern. The proposed method can support comparisons between different observers, experimental conditions and even experiments. We demonstrate the insights offered by this approach using examples from our experiments investigating multi-stability in auditory streaming. However, the methodology is generic and thus widely applicable in studies of multi-stability in any domain. Copyright © 2012 Elsevier B.V. All rights reserved.

On the equivalence of dynamically orthogonal and bi-orthogonal methods: Theory and numerical simulations

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

Choi, Minseok; Sapsis, Themistoklis P.; Karniadakis, George Em, E-mail: george_karniadakis@brown.edu

2014-08-01

The Karhunen–Lòeve (KL) decomposition provides a low-dimensional representation for random fields as it is optimal in the mean square sense. Although for many stochastic systems of practical interest, described by stochastic partial differential equations (SPDEs), solutions possess this low-dimensional character, they also have a strongly time-dependent form and to this end a fixed-in-time basis may not describe the solution in an efficient way. Motivated by this limitation of standard KL expansion, Sapsis and Lermusiaux (2009) [26] developed the dynamically orthogonal (DO) field equations which allow for the simultaneous evolution of both the spatial basis where uncertainty ‘lives’ but also themore » stochastic characteristics of uncertainty. Recently, Cheng et al. (2013) [28] introduced an alternative approach, the bi-orthogonal (BO) method, which performs the exact same tasks, i.e. it evolves the spatial basis and the stochastic characteristics of uncertainty. In the current work we examine the relation of the two approaches and we prove theoretically and illustrate numerically their equivalence, in the sense that one method is an exact reformulation of the other. We show this by deriving a linear and invertible transformation matrix described by a matrix differential equation that connects the BO and the DO solutions. We also examine a pathology of the BO equations that occurs when two eigenvalues of the solution cross, resulting in an instantaneous, infinite-speed, internal rotation of the computed spatial basis. We demonstrate that despite the instantaneous duration of the singularity this has important implications on the numerical performance of the BO approach. On the other hand, it is observed that the BO is more stable in nonlinear problems involving a relatively large number of modes. Several examples, linear and nonlinear, are presented to illustrate the DO and BO methods as well as their equivalence.« less

Master equations and the theory of stochastic path integrals

NASA Astrophysics Data System (ADS)

Weber, Markus F.; Frey, Erwin

2017-04-01

This review provides a pedagogic and self-contained introduction to master equations and to their representation by path integrals. Since the 1930s, master equations have served as a fundamental tool to understand the role of fluctuations in complex biological, chemical, and physical systems. Despite their simple appearance, analyses of master equations most often rely on low-noise approximations such as the Kramers-Moyal or the system size expansion, or require ad-hoc closure schemes for the derivation of low-order moment equations. We focus on numerical and analytical methods going beyond the low-noise limit and provide a unified framework for the study of master equations. After deriving the forward and backward master equations from the Chapman-Kolmogorov equation, we show how the two master equations can be cast into either of four linear partial differential equations (PDEs). Three of these PDEs are discussed in detail. The first PDE governs the time evolution of a generalized probability generating function whose basis depends on the stochastic process under consideration. Spectral methods, WKB approximations, and a variational approach have been proposed for the analysis of the PDE. The second PDE is novel and is obeyed by a distribution that is marginalized over an initial state. It proves useful for the computation of mean extinction times. The third PDE describes the time evolution of a ‘generating functional’, which generalizes the so-called Poisson representation. Subsequently, the solutions of the PDEs are expressed in terms of two path integrals: a ‘forward’ and a ‘backward’ path integral. Combined with inverse transformations, one obtains two distinct path integral representations of the conditional probability distribution solving the master equations. We exemplify both path integrals in analysing elementary chemical reactions. Moreover, we show how a well-known path integral representation of averaged observables can be recovered from them. Upon expanding the forward and the backward path integrals around stationary paths, we then discuss and extend a recent method for the computation of rare event probabilities. Besides, we also derive path integral representations for processes with continuous state spaces whose forward and backward master equations admit Kramers-Moyal expansions. A truncation of the backward expansion at the level of a diffusion approximation recovers a classic path integral representation of the (backward) Fokker-Planck equation. One can rewrite this path integral in terms of an Onsager-Machlup function and, for purely diffusive Brownian motion, it simplifies to the path integral of Wiener. To make this review accessible to a broad community, we have used the language of probability theory rather than quantum (field) theory and do not assume any knowledge of the latter. The probabilistic structures underpinning various technical concepts, such as coherent states, the Doi-shift, and normal-ordered observables, are thereby made explicit.

Master equations and the theory of stochastic path integrals.

PubMed

Weber, Markus F; Frey, Erwin

2017-04-01

This review provides a pedagogic and self-contained introduction to master equations and to their representation by path integrals. Since the 1930s, master equations have served as a fundamental tool to understand the role of fluctuations in complex biological, chemical, and physical systems. Despite their simple appearance, analyses of master equations most often rely on low-noise approximations such as the Kramers-Moyal or the system size expansion, or require ad-hoc closure schemes for the derivation of low-order moment equations. We focus on numerical and analytical methods going beyond the low-noise limit and provide a unified framework for the study of master equations. After deriving the forward and backward master equations from the Chapman-Kolmogorov equation, we show how the two master equations can be cast into either of four linear partial differential equations (PDEs). Three of these PDEs are discussed in detail. The first PDE governs the time evolution of a generalized probability generating function whose basis depends on the stochastic process under consideration. Spectral methods, WKB approximations, and a variational approach have been proposed for the analysis of the PDE. The second PDE is novel and is obeyed by a distribution that is marginalized over an initial state. It proves useful for the computation of mean extinction times. The third PDE describes the time evolution of a 'generating functional', which generalizes the so-called Poisson representation. Subsequently, the solutions of the PDEs are expressed in terms of two path integrals: a 'forward' and a 'backward' path integral. Combined with inverse transformations, one obtains two distinct path integral representations of the conditional probability distribution solving the master equations. We exemplify both path integrals in analysing elementary chemical reactions. Moreover, we show how a well-known path integral representation of averaged observables can be recovered from them. Upon expanding the forward and the backward path integrals around stationary paths, we then discuss and extend a recent method for the computation of rare event probabilities. Besides, we also derive path integral representations for processes with continuous state spaces whose forward and backward master equations admit Kramers-Moyal expansions. A truncation of the backward expansion at the level of a diffusion approximation recovers a classic path integral representation of the (backward) Fokker-Planck equation. One can rewrite this path integral in terms of an Onsager-Machlup function and, for purely diffusive Brownian motion, it simplifies to the path integral of Wiener. To make this review accessible to a broad community, we have used the language of probability theory rather than quantum (field) theory and do not assume any knowledge of the latter. The probabilistic structures underpinning various technical concepts, such as coherent states, the Doi-shift, and normal-ordered observables, are thereby made explicit.

A Galerkin Approach to Define Measured Terrain Surfaces with Analytic Basis Vectors to Produce a Compact Representation

DTIC Science & Technology

2010-11-01

defined herein as terrain whose surface deformation due to a single vehicle traversing the surface is negligible, such as paved roads (both asphalt ...ground vehicle reliability predictions. Current application of this work is limited to the analysis of U.S. Highways, comprised of both asphalt and...Highways that are consistent between asphalt and concrete roads b. The principle terrain characteristics are defined with analytic basis vectors

Chronic non-communicable diseases, risk and health promotion: social construction of VIGITEL participants.

PubMed

Mássimo, Erika de Azevedo Leitão; de Souza, Hercília Najara Ferreira; Freitas, Maria Imaculada de Fátima

2015-03-01

The dimension of choice and adherence to healthy lifestyles is in the area of social constructions made in representations of individuals and had not yet been included in the Surveillance of Risk and Protective Factors for Chronic Diseases by Telephone Survey (VIGITEL) analysis systems. This article aims to understand, in individual narratives, representations contained in the trajectories of people's lives selected from the 2010 VIGITEL sample, in Belo Horizonte, Minas Gerais. It is a qualitative study based on Social Representation Theory. Thirty in-depth and open interviews with subjects selected from the 2010 VIGITEL sample were conducted in Belo Horizonte in the State of Minas Gerais. The Structural Analysis of Narrative technique was used to reveal the content of speeches. Age and heredity representations related to NCDs are part of the spectrum of current scientific information. Learning from childhood onwards is the basis of care. The lack of comprehension of the pathophysiology of NCDs, and the depth of representations of illness and death related to communicable diseases, is partly responsible for the difficulty of preventing NCDs.

fMRI-based Multivariate Pattern Analyses Reveal Imagery Modality and Imagery Content Specific Representations in Primary Somatosensory, Motor and Auditory Cortices.

PubMed

de Borst, Aline W; de Gelder, Beatrice

2017-08-01

Previous studies have shown that the early visual cortex contains content-specific representations of stimuli during visual imagery, and that these representational patterns of imagery content have a perceptual basis. To date, there is little evidence for the presence of a similar organization in the auditory and tactile domains. Using fMRI-based multivariate pattern analyses we showed that primary somatosensory, auditory, motor, and visual cortices are discriminative for imagery of touch versus sound. In the somatosensory, motor and visual cortices the imagery modality discriminative patterns were similar to perception modality discriminative patterns, suggesting that top-down modulations in these regions rely on similar neural representations as bottom-up perceptual processes. Moreover, we found evidence for content-specific representations of the stimuli during auditory imagery in the primary somatosensory and primary motor cortices. Both the imagined emotions and the imagined identities of the auditory stimuli could be successfully classified in these regions. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Multiresolution analysis over graphs for a motor imagery based online BCI game.

PubMed

Asensio-Cubero, Javier; Gan, John Q; Palaniappan, Ramaswamy

2016-01-01

Multiresolution analysis (MRA) over graph representation of EEG data has proved to be a promising method for offline brain-computer interfacing (BCI) data analysis. For the first time we aim to prove the feasibility of the graph lifting transform in an online BCI system. Instead of developing a pointer device or a wheel-chair controller as test bed for human-machine interaction, we have designed and developed an engaging game which can be controlled by means of imaginary limb movements. Some modifications to the existing MRA analysis over graphs for BCI have also been proposed, such as the use of common spatial patterns for feature extraction at the different levels of decomposition, and sequential floating forward search as a best basis selection technique. In the online game experiment we obtained for three classes an average classification rate of 63.0% for fourteen naive subjects. The application of a best basis selection method helps significantly decrease the computing resources needed. The present study allows us to further understand and assess the benefits of the use of tailored wavelet analysis for processing motor imagery data and contributes to the further development of BCI for gaming purposes. Copyright © 2015 Elsevier Ltd. All rights reserved.

A full-dimensional ab initio potential energy surface and rovibrational energies of the Ar–HF complex

NASA Astrophysics Data System (ADS)

Huang, Jing; Zhou, Yanzi; Xie, Daiqian

2018-04-01

We report a new full-dimensional ab initio potential energy surface for the Ar-HF van der Waals complex at the level of coupled-cluster singles and doubles with noniterative inclusion of connected triples levels [CCSD(T)] using augmented correlation-consistent quintuple-zeta basis set (aV5Z) plus bond functions. Full counterpoise correction was employed to correct the basis-set superposition error. The hypersurface was fitted using artificial neural network method with a root mean square error of 0.1085 cm-1 for more than 8000 ab initio points. The complex was found to prefer a linear Ar-H-F equilibrium structure. The three-dimensional discrete variable representation method and the Lanczos propagation algorithm were then employed to calculate the rovibrational states without separating inter- and intra- molecular nuclear motions. The calculated vibrational energies of Ar-HF differ from the experiment values within about 1 cm-1 on the first four HF vibrational states, and the predicted pure rotational energies on (0000) and (1000) vibrational states are deviated from the observed value by about 1%, which shows the accuracy of our new PES.

Non-perturbative calculation of orbital and spin effects in molecules subject to non-uniform magnetic fields

NASA Astrophysics Data System (ADS)

Sen, Sangita; Tellgren, Erik I.

2018-05-01

External non-uniform magnetic fields acting on molecules induce non-collinear spin densities and spin-symmetry breaking. This necessitates a general two-component Pauli spinor representation. In this paper, we report the implementation of a general Hartree-Fock method, without any spin constraints, for non-perturbative calculations with finite non-uniform fields. London atomic orbitals are used to ensure faster basis convergence as well as invariance under constant gauge shifts of the magnetic vector potential. The implementation has been applied to investigate the joint orbital and spin response to a field gradient—quantified through the anapole moments—of a set of small molecules. The relative contributions of orbital and spin-Zeeman interaction terms have been studied both theoretically and computationally. Spin effects are stronger and show a general paramagnetic behavior for closed shell molecules while orbital effects can have either direction. Basis set convergence and size effects of anapole susceptibility tensors have been reported. The relation of the mixed anapole susceptibility tensor to chirality is also demonstrated.

Predicting Time Series Outputs and Time-to-Failure for an Aircraft Controller Using Bayesian Modeling

NASA Technical Reports Server (NTRS)

He, Yuning

2015-01-01

Safety of unmanned aerial systems (UAS) is paramount, but the large number of dynamically changing controller parameters makes it hard to determine if the system is currently stable, and the time before loss of control if not. We propose a hierarchical statistical model using Treed Gaussian Processes to predict (i) whether a flight will be stable (success) or become unstable (failure), (ii) the time-to-failure if unstable, and (iii) time series outputs for flight variables. We first classify the current flight input into success or failure types, and then use separate models for each class to predict the time-to-failure and time series outputs. As different inputs may cause failures at different times, we have to model variable length output curves. We use a basis representation for curves and learn the mappings from input to basis coefficients. We demonstrate the effectiveness of our prediction methods on a NASA neuro-adaptive flight control system.

Orthogonal bases of invariants in tensor models

NASA Astrophysics Data System (ADS)

Diaz, Pablo; Rey, Soo-Jong

2018-02-01

Representation theory provides an efficient framework to count and classify invariants in tensor models of (gauge) symmetry G d = U( N 1) ⊗ · · · ⊗ U( N d ) . We show that there are two natural ways of counting invariants, one for arbitrary G d and another valid for large rank of G d . We construct basis of invariant operators based on the counting, and compute correlators of their elements. The basis associated with finite rank of G d diagonalizes two-point function. It is analogous to the restricted Schur basis used in matrix models. We comment on future directions for investigation.

Local unitary representation of braids and N-qubit entanglements

NASA Astrophysics Data System (ADS)

Yu, Li-Wei

2018-03-01

In this paper, by utilizing the idea of stabilizer codes, we give some relationships between one local unitary representation of braid group in N-qubit tensor space and the corresponding entanglement properties of the N-qubit pure state |Ψ >, where the N-qubit state |Ψ > is obtained by applying the braiding operation on the natural basis. Specifically, we show that the separability of |Ψ > =B|0> ^{⊗ N} is closely related to the diagrammatic version of the braid operator B. This may provide us more insights about the topological entanglement and quantum entanglement.

Separability criteria based on Heisenberg–Weyl representation of density matrices

NASA Astrophysics Data System (ADS)

Chang, Jingmei; Cui, Meiyu; Zhang, Tinggui; Fei, Shao-Ming

2018-03-01

Separability is an important problem in theory of quantum entanglement. By using the Bloch representation of quantum states in terms of the Heisenberg–Weyl observable basis, we present a new separability criterion for bipartite quantum systems. It is shown that this criterion can be better than the previous ones in detecting entanglement. The results are generalized to multipartite quantum states. Project supported by the National Natural Science Foundation of China (Grant Nos. 11501153, 11661031, and 11675113) and the National Natural Science Foundation of Hainan Province, China (Grant No. 20161006).

Genetic basis of mitochondrial sorting in cucumber

USDA-ARS?s Scientific Manuscript database

Regeneration of cucumber from cell cultures produces plants with distinct mosaic (MSC) phenotypes, misshapen cotyledons and leaves, reduced fertility, and low seed germination. The MSC phenotypes are paternally transmitted and associated with deletions or under-representations of specific regions of...

Genetic basis of mitochondrial sorting in cucumber

USDA-ARS?s Scientific Manuscript database

Regeneration of cucumber (Cucumis sativus) from cell cultures produces plants with distinct mosaic (MSC) phenotypes, misshapen cotyledons and leaves, reduced fertility, and low seed germination. The MSC phenotypes are paternally transmitted and associated with deletions or under-representations of s...

Comparison of variational real-space representations of the kinetic energy operator

NASA Astrophysics Data System (ADS)

Skylaris, Chris-Kriton; Diéguez, Oswaldo; Haynes, Peter D.; Payne, Mike C.

2002-08-01

We present a comparison of real-space methods based on regular grids for electronic structure calculations that are designed to have basis set variational properties, using as a reference the conventional method of finite differences (a real-space method that is not variational) and the reciprocal-space plane-wave method which is fully variational. We find that a definition of the finite-difference method [P. Maragakis, J. Soler, and E. Kaxiras, Phys. Rev. B 64, 193101 (2001)] satisfies one of the two properties of variational behavior at the cost of larger errors than the conventional finite-difference method. On the other hand, a technique which represents functions in a number of plane waves which is independent of system size closely follows the plane-wave method and therefore also the criteria for variational behavior. Its application is only limited by the requirement of having functions strictly localized in regions of real space, but this is a characteristic of an increasing number of modern real-space methods, as they are designed to have a computational cost that scales linearly with system size.

Radiative-emission analysis in charge-exchange collisions of O6 + with argon, water, and methane

NASA Astrophysics Data System (ADS)

Leung, Anthony C. K.; Kirchner, Tom

2017-04-01

Processes of electron capture followed by Auger and radiative decay were investigated in slow ion-atom and -molecule collisions. A quantum-mechanical analysis which utilizes the basis generator method within an independent electron model was carried out for collisions of O 6 + with Ar, H2O , and CH4 at impact energies of 1.17 and 2.33 keV/amu. At these impact energies, a closure approximation in the spectral representation of the Hamiltonian for molecules was found to be necessary to yield reliable results. Total single-, double-, and triple-electron-capture cross sections obtained show good agreement with previous measurements and calculations using the classical trajectory Monte Carlo method. The corresponding emission spectra from single capture for each collision system are in satisfactory agreement with previous calculations.

Isogeometric analysis and harmonic stator-rotor coupling for simulating electric machines

NASA Astrophysics Data System (ADS)

Bontinck, Zeger; Corno, Jacopo; Schöps, Sebastian; De Gersem, Herbert

2018-06-01

This work proposes Isogeometric Analysis as an alternative to classical finite elements for simulating electric machines. Through the spline-based Isogeometric discretization it is possible to parametrize the circular arcs exactly, thereby avoiding any geometrical error in the representation of the air gap where a high accuracy is mandatory. To increase the generality of the method, and to allow rotation, the rotor and the stator computational domains are constructed independently as multipatch entities. The two subdomains are then coupled using harmonic basis functions at the interface which gives rise to a saddle-point problem. The properties of Isogeometric Analysis combined with harmonic stator-rotor coupling are presented. The results and performance of the new approach are compared to the ones for a classical finite element method using a permanent magnet synchronous machine as an example.

Prescriptive unitarity

DOE PAGES

Bourjaily, Jacob L.; Herrmann, Enrico; Trnka, Jaroslav

2017-06-12

We introduce a prescriptive approach to generalized unitarity, resulting in a strictly-diagonal basis of loop integrands with coefficients given by specifically-tailored residues in field theory. We illustrate the power of this strategy in the case of planar, maximally supersymmetric Yang-Mills theory (SYM), where we construct closed-form representations of all (n-point N k MHV) scattering amplitudes through three loops. The prescriptive approach contrasts with the ordinary description of unitarity-based methods by avoiding any need for linear algebra to determine integrand coefficients. We describe this approach in general terms as it should have applications to many quantum field theories, including those withoutmore » planarity, supersymmetry, or massless spectra defined in any number of dimensions.« less

A Data Type for Efficient Representation of Other Data Types

NASA Technical Reports Server (NTRS)

James, Mark

2008-01-01

A self-organizing, monomorphic data type denoted a sequence has been conceived to address certain concerns that arise in programming parallel computers. A sequence in the present sense can be regarded abstractly as a vector, set, bag, queue, or other construct. Heretofore, in programming a parallel computer, it has been necessary for the programmer to state explicitly, at the outset, what parts of the program and the underlying data structures must be represented in parallel form. Not only is this requirement not optimal from the perspective of implementation; it entails an additional requirement that the programmer have intimate understanding of the underlying parallel structure. The present sequence data type overcomes both the implementation and parallel structure obstacles. In so doing, the sequence data type provides unified means by which the programmer can represent a data structure for natural and automatic decomposition to a parallel computing architecture. Sequences exhibit the behavioral and structural characteristics of vectors, but the underlying representations are automatically synthesized from combinations of programmers advice and execution use metrics. Sequences can vary bidirectionally between sparseness and density, making them excellent choices for many kinds of algorithms. The novelty and benefit of this behavior lies in the fact that it can relieve programmers of the details of implementations. The creation of a sequence enables decoupling of a conceptual representation from an implementation. The underlying representation of a sequence is a hybrid of representations composed of vectors, linked lists, connected blocks, and hash tables. The internal structure of a sequence can automatically change from time to time on the basis of how it is being used. Those portions of a sequence where elements have not been added or removed can be as efficient as vectors. As elements are inserted and removed in a given portion, then different methods are utilized to provide both an access and memory strategy that is optimized for that portion and the use to which it is put.

Diffusion Forecasting Model with Basis Functions from QR-Decomposition

NASA Astrophysics Data System (ADS)

Harlim, John; Yang, Haizhao

2018-06-01

The diffusion forecasting is a nonparametric approach that provably solves the Fokker-Planck PDE corresponding to Itô diffusion without knowing the underlying equation. The key idea of this method is to approximate the solution of the Fokker-Planck equation with a discrete representation of the shift (Koopman) operator on a set of basis functions generated via the diffusion maps algorithm. While the choice of these basis functions is provably optimal under appropriate conditions, computing these basis functions is quite expensive since it requires the eigendecomposition of an N× N diffusion matrix, where N denotes the data size and could be very large. For large-scale forecasting problems, only a few leading eigenvectors are computationally achievable. To overcome this computational bottleneck, a new set of basis functions constructed by orthonormalizing selected columns of the diffusion matrix and its leading eigenvectors is proposed. This computation can be carried out efficiently via the unpivoted Householder QR factorization. The efficiency and effectiveness of the proposed algorithm will be shown in both deterministically chaotic and stochastic dynamical systems; in the former case, the superiority of the proposed basis functions over purely eigenvectors is significant, while in the latter case forecasting accuracy is improved relative to using a purely small number of eigenvectors. Supporting arguments will be provided on three- and six-dimensional chaotic ODEs, a three-dimensional SDE that mimics turbulent systems, and also on the two spatial modes associated with the boreal winter Madden-Julian Oscillation obtained from applying the Nonlinear Laplacian Spectral Analysis on the measured Outgoing Longwave Radiation.

Diffusion Forecasting Model with Basis Functions from QR-Decomposition

NASA Astrophysics Data System (ADS)

Harlim, John; Yang, Haizhao

2017-12-01

The diffusion forecasting is a nonparametric approach that provably solves the Fokker-Planck PDE corresponding to Itô diffusion without knowing the underlying equation. The key idea of this method is to approximate the solution of the Fokker-Planck equation with a discrete representation of the shift (Koopman) operator on a set of basis functions generated via the diffusion maps algorithm. While the choice of these basis functions is provably optimal under appropriate conditions, computing these basis functions is quite expensive since it requires the eigendecomposition of an N× N diffusion matrix, where N denotes the data size and could be very large. For large-scale forecasting problems, only a few leading eigenvectors are computationally achievable. To overcome this computational bottleneck, a new set of basis functions constructed by orthonormalizing selected columns of the diffusion matrix and its leading eigenvectors is proposed. This computation can be carried out efficiently via the unpivoted Householder QR factorization. The efficiency and effectiveness of the proposed algorithm will be shown in both deterministically chaotic and stochastic dynamical systems; in the former case, the superiority of the proposed basis functions over purely eigenvectors is significant, while in the latter case forecasting accuracy is improved relative to using a purely small number of eigenvectors. Supporting arguments will be provided on three- and six-dimensional chaotic ODEs, a three-dimensional SDE that mimics turbulent systems, and also on the two spatial modes associated with the boreal winter Madden-Julian Oscillation obtained from applying the Nonlinear Laplacian Spectral Analysis on the measured Outgoing Longwave Radiation.

Computerized mappings of the cerebral cortex: a multiresolution flattening method and a surface-based coordinate system

NASA Technical Reports Server (NTRS)

Drury, H. A.; Van Essen, D. C.; Anderson, C. H.; Lee, C. W.; Coogan, T. A.; Lewis, J. W.

1996-01-01

We present a new method for generating two-dimensional maps of the cerebral cortex. Our computerized, two-stage flattening method takes as its input any well-defined representation of a surface within the three-dimensional cortex. The first stage rapidly converts this surface to a topologically correct two-dimensional map, without regard for the amount of distortion introduced. The second stage reduces distortions using a multiresolution strategy that makes gross shape changes on a coarsely sampled map and further shape refinements on progressively finer resolution maps. We demonstrate the utility of this approach by creating flat maps of the entire cerebral cortex in the macaque monkey and by displaying various types of experimental data on such maps. We also introduce a surface-based coordinate system that has advantages over conventional stereotaxic coordinates and is relevant to studies of cortical organization in humans as well as non-human primates. Together, these methods provide an improved basis for quantitative studies of individual variability in cortical organization.

ℓ1-norm and entanglement in screening out braiding from Yang-Baxter equation associated with Z3 parafermion

NASA Astrophysics Data System (ADS)

Yu, Li-Wei; Ge, Mo-Lin

2017-03-01

The relationships between quantum entangled states and braid matrices have been well studied in recent years. However, most of the results are based on qubits. In this paper, we investigate the applications of 2-qutrit entanglement in the braiding associated with Z3 parafermion. The 2-qutrit entangled state | Ψ (θ) >, generated by the action of the localized unitary solution R ˘ (θ) of YBE on 2-qutrit natural basis, achieves its maximal ℓ1-norm and maximal von Neumann entropy simultaneously at θ = π / 3. Meanwhile, at θ = π / 3, the solutions of YBE reduces braid matrices, which implies the role of ℓ1-norm and entropy plays in determining real physical quantities. On the other hand, we give a new realization of 4-anyon topological basis by qutrit entangled states, then the 9 × 9 localized braid representation in 4-qutrit tensor product space (C3) ⊗ 4 is reduced to Jones representation of braiding in the 4-anyon topological basis. Hence, we conclude that the entangled states are powerful tools in analysing the characteristics of braiding and R ˘ -matrix.

Differential geometry based solvation model II: Lagrangian formulation.

PubMed

Chen, Zhan; Baker, Nathan A; Wei, G W

2011-12-01

Solvation is an elementary process in nature and is of paramount importance to more sophisticated chemical, biological and biomolecular processes. The understanding of solvation is an essential prerequisite for the quantitative description and analysis of biomolecular systems. This work presents a Lagrangian formulation of our differential geometry based solvation models. The Lagrangian representation of biomolecular surfaces has a few utilities/advantages. First, it provides an essential basis for biomolecular visualization, surface electrostatic potential map and visual perception of biomolecules. Additionally, it is consistent with the conventional setting of implicit solvent theories and thus, many existing theoretical algorithms and computational software packages can be directly employed. Finally, the Lagrangian representation does not need to resort to artificially enlarged van der Waals radii as often required by the Eulerian representation in solvation analysis. The main goal of the present work is to analyze the connection, similarity and difference between the Eulerian and Lagrangian formalisms of the solvation model. Such analysis is important to the understanding of the differential geometry based solvation model. The present model extends the scaled particle theory of nonpolar solvation model with a solvent-solute interaction potential. The nonpolar solvation model is completed with a Poisson-Boltzmann (PB) theory based polar solvation model. The differential geometry theory of surfaces is employed to provide a natural description of solvent-solute interfaces. The optimization of the total free energy functional, which encompasses the polar and nonpolar contributions, leads to coupled potential driven geometric flow and PB equations. Due to the development of singularities and nonsmooth manifolds in the Lagrangian representation, the resulting potential-driven geometric flow equation is embedded into the Eulerian representation for the purpose of computation, thanks to the equivalence of the Laplace-Beltrami operator in the two representations. The coupled partial differential equations (PDEs) are solved with an iterative procedure to reach a steady state, which delivers desired solvent-solute interface and electrostatic potential for problems of interest. These quantities are utilized to evaluate the solvation free energies and protein-protein binding affinities. A number of computational methods and algorithms are described for the interconversion of Lagrangian and Eulerian representations, and for the solution of the coupled PDE system. The proposed approaches have been extensively validated. We also verify that the mean curvature flow indeed gives rise to the minimal molecular surface and the proposed variational procedure indeed offers minimal total free energy. Solvation analysis and applications are considered for a set of 17 small compounds and a set of 23 proteins. The salt effect on protein-protein binding affinity is investigated with two protein complexes by using the present model. Numerical results are compared to the experimental measurements and to those obtained by using other theoretical methods in the literature. © Springer-Verlag 2011

Differential geometry based solvation model II: Lagrangian formulation

PubMed Central

Chen, Zhan; Baker, Nathan A.; Wei, G. W.

2010-01-01

Solvation is an elementary process in nature and is of paramount importance to more sophisticated chemical, biological and biomolecular processes. The understanding of solvation is an essential prerequisite for the quantitative description and analysis of biomolecular systems. This work presents a Lagrangian formulation of our differential geometry based solvation model. The Lagrangian representation of biomolecular surfaces has a few utilities/advantages. First, it provides an essential basis for biomolecular visualization, surface electrostatic potential map and visual perception of biomolecules. Additionally, it is consistent with the conventional setting of implicit solvent theories and thus, many existing theoretical algorithms and computational software packages can be directly employed. Finally, the Lagrangian representation does not need to resort to artificially enlarged van der Waals radii as often required by the Eulerian representation in solvation analysis. The main goal of the present work is to analyze the connection, similarity and difference between the Eulerian and Lagrangian formalisms of the solvation model. Such analysis is important to the understanding of the differential geometry based solvation model. The present model extends the scaled particle theory (SPT) of nonpolar solvation model with a solvent-solute interaction potential. The nonpolar solvation model is completed with a Poisson-Boltzmann (PB) theory based polar solvation model. The differential geometry theory of surfaces is employed to provide a natural description of solvent-solute interfaces. The minimization of the total free energy functional, which encompasses the polar and nonpolar contributions, leads to coupled potential driven geometric flow and Poisson-Boltzmann equations. Due to the development of singularities and nonsmooth manifolds in the Lagrangian representation, the resulting potential-driven geometric flow equation is embedded into the Eulerian representation for the purpose of computation, thanks to the equivalence of the Laplace-Beltrami operator in the two representations. The coupled partial differential equations (PDEs) are solved with an iterative procedure to reach a steady state, which delivers desired solvent-solute interface and electrostatic potential for problems of interest. These quantities are utilized to evaluate the solvation free energies and protein-protein binding affinities. A number of computational methods and algorithms are described for the interconversion of Lagrangian and Eulerian representations, and for the solution of the coupled PDE system. The proposed approaches have been extensively validated. We also verify that the mean curvature flow indeed gives rise to the minimal molecular surface (MMS) and the proposed variational procedure indeed offers minimal total free energy. Solvation analysis and applications are considered for a set of 17 small compounds and a set of 23 proteins. The salt effect on protein-protein binding affinity is investigated with two protein complexes by using the present model. Numerical results are compared to the experimental measurements and to those obtained by using other theoretical methods in the literature. PMID:21279359

Neo: an object model for handling electrophysiology data in multiple formats

PubMed Central

Garcia, Samuel; Guarino, Domenico; Jaillet, Florent; Jennings, Todd; Pröpper, Robert; Rautenberg, Philipp L.; Rodgers, Chris C.; Sobolev, Andrey; Wachtler, Thomas; Yger, Pierre; Davison, Andrew P.

2014-01-01

Neuroscientists use many different software tools to acquire, analyze and visualize electrophysiological signals. However, incompatible data models and file formats make it difficult to exchange data between these tools. This reduces scientific productivity, renders potentially useful analysis methods inaccessible and impedes collaboration between labs. A common representation of the core data would improve interoperability and facilitate data-sharing. To that end, we propose here a language-independent object model, named “Neo,” suitable for representing data acquired from electroencephalographic, intracellular, or extracellular recordings, or generated from simulations. As a concrete instantiation of this object model we have developed an open source implementation in the Python programming language. In addition to representing electrophysiology data in memory for the purposes of analysis and visualization, the Python implementation provides a set of input/output (IO) modules for reading/writing the data from/to a variety of commonly used file formats. Support is included for formats produced by most of the major manufacturers of electrophysiology recording equipment and also for more generic formats such as MATLAB. Data representation and data analysis are conceptually separate: it is easier to write robust analysis code if it is focused on analysis and relies on an underlying package to handle data representation. For that reason, and also to be as lightweight as possible, the Neo object model and the associated Python package are deliberately limited to representation of data, with no functions for data analysis or visualization. Software for neurophysiology data analysis and visualization built on top of Neo automatically gains the benefits of interoperability, easier data sharing and automatic format conversion; there is already a burgeoning ecosystem of such tools. We intend that Neo should become the standard basis for Python tools in neurophysiology. PMID:24600386

Neo: an object model for handling electrophysiology data in multiple formats.

PubMed

Garcia, Samuel; Guarino, Domenico; Jaillet, Florent; Jennings, Todd; Pröpper, Robert; Rautenberg, Philipp L; Rodgers, Chris C; Sobolev, Andrey; Wachtler, Thomas; Yger, Pierre; Davison, Andrew P

2014-01-01

Neuroscientists use many different software tools to acquire, analyze and visualize electrophysiological signals. However, incompatible data models and file formats make it difficult to exchange data between these tools. This reduces scientific productivity, renders potentially useful analysis methods inaccessible and impedes collaboration between labs. A common representation of the core data would improve interoperability and facilitate data-sharing. To that end, we propose here a language-independent object model, named "Neo," suitable for representing data acquired from electroencephalographic, intracellular, or extracellular recordings, or generated from simulations. As a concrete instantiation of this object model we have developed an open source implementation in the Python programming language. In addition to representing electrophysiology data in memory for the purposes of analysis and visualization, the Python implementation provides a set of input/output (IO) modules for reading/writing the data from/to a variety of commonly used file formats. Support is included for formats produced by most of the major manufacturers of electrophysiology recording equipment and also for more generic formats such as MATLAB. Data representation and data analysis are conceptually separate: it is easier to write robust analysis code if it is focused on analysis and relies on an underlying package to handle data representation. For that reason, and also to be as lightweight as possible, the Neo object model and the associated Python package are deliberately limited to representation of data, with no functions for data analysis or visualization. Software for neurophysiology data analysis and visualization built on top of Neo automatically gains the benefits of interoperability, easier data sharing and automatic format conversion; there is already a burgeoning ecosystem of such tools. We intend that Neo should become the standard basis for Python tools in neurophysiology.

Visual management of large scale data mining projects.

PubMed

Shah, I; Hunter, L

2000-01-01

This paper describes a unified framework for visualizing the preparations for, and results of, hundreds of machine learning experiments. These experiments were designed to improve the accuracy of enzyme functional predictions from sequence, and in many cases were successful. Our system provides graphical user interfaces for defining and exploring training datasets and various representational alternatives, for inspecting the hypotheses induced by various types of learning algorithms, for visualizing the global results, and for inspecting in detail results for specific training sets (functions) and examples (proteins). The visualization tools serve as a navigational aid through a large amount of sequence data and induced knowledge. They provided significant help in understanding both the significance and the underlying biological explanations of our successes and failures. Using these visualizations it was possible to efficiently identify weaknesses of the modular sequence representations and induction algorithms which suggest better learning strategies. The context in which our data mining visualization toolkit was developed was the problem of accurately predicting enzyme function from protein sequence data. Previous work demonstrated that approximately 6% of enzyme protein sequences are likely to be assigned incorrect functions on the basis of sequence similarity alone. In order to test the hypothesis that more detailed sequence analysis using machine learning techniques and modular domain representations could address many of these failures, we designed a series of more than 250 experiments using information-theoretic decision tree induction and naive Bayesian learning on local sequence domain representations of problematic enzyme function classes. In more than half of these cases, our methods were able to perfectly discriminate among various possible functions of similar sequences. We developed and tested our visualization techniques on this application.

Basic statistics with Microsoft Excel: a review.

PubMed

Divisi, Duilio; Di Leonardo, Gabriella; Zaccagna, Gino; Crisci, Roberto

2017-06-01

The scientific world is enriched daily with new knowledge, due to new technologies and continuous discoveries. The mathematical functions explain the statistical concepts particularly those of mean, median and mode along with those of frequency and frequency distribution associated to histograms and graphical representations, determining elaborative processes on the basis of the spreadsheet operations. The aim of the study is to highlight the mathematical basis of statistical models that regulate the operation of spreadsheets in Microsoft Excel.

Basic statistics with Microsoft Excel: a review

PubMed Central

Di Leonardo, Gabriella; Zaccagna, Gino; Crisci, Roberto

2017-01-01

The scientific world is enriched daily with new knowledge, due to new technologies and continuous discoveries. The mathematical functions explain the statistical concepts particularly those of mean, median and mode along with those of frequency and frequency distribution associated to histograms and graphical representations, determining elaborative processes on the basis of the spreadsheet operations. The aim of the study is to highlight the mathematical basis of statistical models that regulate the operation of spreadsheets in Microsoft Excel. PMID:28740690

Proceedings of the Conference on Joint Problem Solving and Microcomputers.

DTIC Science & Technology

1983-08-01

socio - cultural norm, not as "truth" about the domain, nor on the basis of formal properties attributed to the expert’s mental model. According to Grif...the basis of the task studied or on the grounds of abstract hypotheses about . the domain. Socio - cultural domain representations cannot rely on these...orthogonal to concrete vs. abstract. The con- crete specific acts (some, genetically primary examples) occupy the top left cell. The set of socio - cultural

Solid-loaded flows: applications in technology

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

Molerus, O.

1983-01-01

The evaluation of experiments and the representation of the resulting data by nondimensional groups defined ad hoc largely governs the treatment of problems arising with solid-loaded flows in practice. Without doubt, this is a result of the very complex nature of solid-loaded flows and, consequently, empiricism tends to prevail, more or less. To overcome this situation, two sets of nondimensional groups, which take into consideration the translatory, as well as the rotary, motion of particles suspended in a fluid, are derived from the equations of motion of a solid body. The intuitive meaning of these nondimensional groups arises from theirmore » derivation. With respect to applications in engineering, the influence of the rotary motion of a particle on the motion of its center of gravity can thus be taken into account. As such, a common basis for the representation of the different phenomena observed with solid-loaded flows is established. The application of the above concepts to fluidization and hydraulic and pneumatic conveying proves their usefulness. New insights into well-known facts as well as new results demonstrate that taking the real nature of solid particles (i.e., those of finite dimensions) into consideration will provide a common and profound basis for the representation of different phenomena observed with solid-loaded flows in practice.« less

The representation of the back in idiomatic expressions--do idioms value the body?

PubMed

Cedraschi, C; Bove, D; Perrin, E; Vischer, T L

2000-01-01

Whilst investigating the influence of patients' representations on the impact of teaching in the back school, we took an interest in 1) the place of the back in the French idioms referring to the body; and 2) the meaning these idioms convey about the back. The idioms including body part terms were sought on the basis of a compilation of French idioms; it has to be noted that such a compilation, however excellent it may be, can only offer a partial view of lay conversation. Occurrence of body parts and of their connotations were assessed. Idioms were classified as positive, negative or neutral, keeping in mind the difficulties of a strict classification in such a field. Drawings were then performed on the basis of the results of the descriptive analysis. Globally, idiomatic expressions offer a rather negative picture of the body or at least suggest that the body is prominently used to express negative ideas and emotions. This is particularly striking for the idioms associated with the back. The analysis of idioms referring to the body allows us to 'see with our own eyes' another aspect of the representations of the body and the back, as they are conveyed in the French language.

Geohazards storytelling between reality and representation

NASA Astrophysics Data System (ADS)

Musacchio, Gemma; Candela, Andrea; Canel, Samanta; Roi, Cinzia

2015-04-01

Ethics towards geohazards might start at early age and it might radicate on narratives occuring in the media, as disfuctional ideas and perception are passed from school or society to children. In this paper we study the representations and imaginaries of natural hazards as they are in the media and how they are passed on chidren and laypeople. The investigation is led on an experimental basis on primary schools in Northern Italy (Varese province), where data concerning school education are collected. The approach is that of the storytelling that allow evaluation of children perception of hazard and risk. Narratives (news, rhetorics, images and pictures, symbols, metaphores and interpretations) that mass media and education generally used in order to explain and represent geohazards (earthquakes, volcanoes, hydrogeological instability, climate change and so on) are also analysed. They are responsible for certain individual and collective perceptions, indeed. The research has attempted to analyze how imaginaries and common "wrong" ideas can influence environmental education and public communication of natural hazards. A better understanding of feelings (fears and hopes), and all cultural behaviours included in the social construction of collective narratives and representations of environmental emergencies could be useful in order to re-orient education and communication strategies on the basis of more targeted and participatory approaches.

Problem of quantifying quantum correlations with non-commutative discord

NASA Astrophysics Data System (ADS)

Majtey, A. P.; Bussandri, D. G.; Osán, T. M.; Lamberti, P. W.; Valdés-Hernández, A.

2017-09-01

In this work we analyze a non-commutativity measure of quantum correlations recently proposed by Guo (Sci Rep 6:25241, 2016). By resorting to a systematic survey of a two-qubit system, we detected an undesirable behavior of such a measure related to its representation-dependence. In the case of pure states, this dependence manifests as a non-satisfactory entanglement measure whenever a representation other than the Schmidt's is used. In order to avoid this basis-dependence feature, we argue that a minimization procedure over the set of all possible representations of the quantum state is required. In the case of pure states, this minimization can be analytically performed and the optimal basis turns out to be that of Schmidt's. In addition, the resulting measure inherits the main properties of Guo's measure and, unlike the latter, it reduces to a legitimate entanglement measure in the case of pure states. Some examples involving general mixed states are also analyzed considering such an optimization. The results show that, in most cases of interest, the use of Guo's measure can result in an overestimation of quantum correlations. However, since Guo's measure has the advantage of being easily computable, it might be used as a qualitative estimator of the presence of quantum correlations.

Reconstructing Norms

ERIC Educational Resources Information Center

Gorgorio, Nuria; Planas, Nuria

2005-01-01

Starting from the constructs "cultural scripts" and "social representations", and on the basis of the empirical research we have been developing until now, we revisit the construct norms from a sociocultural perspective. Norms, both sociomathematical norms and norms of the mathematical practice, as cultural scripts influenced…

Dog Mathematics: Exploring Base-4

ERIC Educational Resources Information Center

Kurz, Terri L.; Yanik, H. Bahadir; Lee, Mi Yeon

2016-01-01

Using a dog's paw as a basis for numerical representation, sixth grade students explored how to count and regroup using the dog's four digital pads. Teachers can connect these base-4 explorations to the conceptual meaning of place value and regrouping using base-10.

Local air temperature tolerance: a sensible basis for estimating climate variability

NASA Astrophysics Data System (ADS)

Kärner, Olavi; Post, Piia

2016-11-01

The customary representation of climate using sample moments is generally biased due to the noticeably nonstationary behaviour of many climate series. In this study, we introduce a moment-free climate representation based on a statistical model fitted to a long-term daily air temperature anomaly series. This model allows us to separate the climate and weather scale variability in the series. As a result, the climate scale can be characterized using the mean annual cycle of series and local air temperature tolerance, where the latter is computed using the fitted model. The representation of weather scale variability is specified using the frequency and the range of outliers based on the tolerance. The scheme is illustrated using five long-term air temperature records observed by different European meteorological stations.

Parents’ Education Shapes, but Does Not Originate, the Disability Representations of Their Children

PubMed Central

Meloni, Fabio; Federici, Stefano; Dennis, John Lawrence

2015-01-01

The present research tested whether children’s disability representations are influenced by cultural variables (e.g., social activities, parent education, custom complex variables) or by cognitive constraints. Four questionnaires were administered to a sample of 76 primary school aged children and one of their parents (n = 152). Questionnaires included both open-ended and closed-ended questions. The open-ended questions were created to collect uncensored personal explanations of disability, whereas the closed-ended questions were designed to elicit a response of agreement for statements built on the basis of the three most widespread disability models: individual, social, and biopsychosocial. For youngest children (6–8 years old), people with disabilities are thought of as being sick. This early disability representation of children is consistent with the individual model of disability and independent from parents’ disability explanations and representations. As children grow older (9–11 years old), knowledge regarding disability increases and stereotypical beliefs about disability decrease, by tending to espouse their parents representations. The individual model remains in the background for the adults too, emerging when the respondents rely on their most immediately available mental representation of disability such as when they respond to an open-ended question. These findings support that the youngest children are not completely permeable to social representations of disability likely due to cognitive constraints. Nevertheless, as the age grows, children appear educable on perspectives of disability adhering to a model of disability representation integral with social context and parent perspective. PMID:26053585

Bird sound spectrogram decomposition through Non-Negative Matrix Factorization for the acoustic classification of bird species.

PubMed

Ludeña-Choez, Jimmy; Quispe-Soncco, Raisa; Gallardo-Antolín, Ascensión

2017-01-01

Feature extraction for Acoustic Bird Species Classification (ABSC) tasks has traditionally been based on parametric representations that were specifically developed for speech signals, such as Mel Frequency Cepstral Coefficients (MFCC). However, the discrimination capabilities of these features for ABSC could be enhanced by accounting for the vocal production mechanisms of birds, and, in particular, the spectro-temporal structure of bird sounds. In this paper, a new front-end for ABSC is proposed that incorporates this specific information through the non-negative decomposition of bird sound spectrograms. It consists of the following two different stages: short-time feature extraction and temporal feature integration. In the first stage, which aims at providing a better spectral representation of bird sounds on a frame-by-frame basis, two methods are evaluated. In the first method, cepstral-like features (NMF_CC) are extracted by using a filter bank that is automatically learned by means of the application of Non-Negative Matrix Factorization (NMF) on bird audio spectrograms. In the second method, the features are directly derived from the activation coefficients of the spectrogram decomposition as performed through NMF (H_CC). The second stage summarizes the most relevant information contained in the short-time features by computing several statistical measures over long segments. The experiments show that the use of NMF_CC and H_CC in conjunction with temporal integration significantly improves the performance of a Support Vector Machine (SVM)-based ABSC system with respect to conventional MFCC.

Bird sound spectrogram decomposition through Non-Negative Matrix Factorization for the acoustic classification of bird species

PubMed Central

Quispe-Soncco, Raisa

2017-01-01

Feature extraction for Acoustic Bird Species Classification (ABSC) tasks has traditionally been based on parametric representations that were specifically developed for speech signals, such as Mel Frequency Cepstral Coefficients (MFCC). However, the discrimination capabilities of these features for ABSC could be enhanced by accounting for the vocal production mechanisms of birds, and, in particular, the spectro-temporal structure of bird sounds. In this paper, a new front-end for ABSC is proposed that incorporates this specific information through the non-negative decomposition of bird sound spectrograms. It consists of the following two different stages: short-time feature extraction and temporal feature integration. In the first stage, which aims at providing a better spectral representation of bird sounds on a frame-by-frame basis, two methods are evaluated. In the first method, cepstral-like features (NMF_CC) are extracted by using a filter bank that is automatically learned by means of the application of Non-Negative Matrix Factorization (NMF) on bird audio spectrograms. In the second method, the features are directly derived from the activation coefficients of the spectrogram decomposition as performed through NMF (H_CC). The second stage summarizes the most relevant information contained in the short-time features by computing several statistical measures over long segments. The experiments show that the use of NMF_CC and H_CC in conjunction with temporal integration significantly improves the performance of a Support Vector Machine (SVM)-based ABSC system with respect to conventional MFCC. PMID:28628630

A reduced basis approach for implementing thermodynamic phase-equilibria information in geophysical and geodynamic studies

NASA Astrophysics Data System (ADS)

Afonso, J. C.; Zlotnik, S.; Diez, P.

2015-12-01

We present a flexible, general and efficient approach for implementing thermodynamic phase equilibria information (in the form of sets of physical parameters) into geophysical and geodynamic studies. The approach is based on multi-dimensional decomposition methods, which transform the original multi-dimensional discrete information into a dimensional-separated representation. This representation has the property of increasing the number of coefficients to be stored linearly with the number of dimensions (opposite to a full multi-dimensional cube requiring exponential storage depending on the number of dimensions). Thus, the amount of information to be stored in memory during a numerical simulation or geophysical inversion is drastically reduced. Accordingly, the amount and resolution of the thermodynamic information that can be used in a simulation or inversion increases substantially. In addition, the method is independent of the actual software used to obtain the primary thermodynamic information, and therefore it can be used in conjunction with any thermodynamic modeling program and/or database. Also, the errors associated with the decomposition procedure are readily controlled by the user, depending on her/his actual needs (e.g. preliminary runs vs full resolution runs). We illustrate the benefits, generality and applicability of our approach with several examples of practical interest for both geodynamic modeling and geophysical inversion/modeling. Our results demonstrate that the proposed method is a competitive and attractive candidate for implementing thermodynamic constraints into a broad range of geophysical and geodynamic studies.

Graphical tensor product reduction scheme for the Lie algebras so(5) = sp(2) , su(3) , and g(2)

NASA Astrophysics Data System (ADS)

Vlasii, N. D.; von Rütte, F.; Wiese, U.-J.

2016-08-01

We develop in detail a graphical tensor product reduction scheme, first described by Antoine and Speiser, for the simple rank 2 Lie algebras so(5) = sp(2) , su(3) , and g(2) . This leads to an efficient practical method to reduce tensor products of irreducible representations into sums of such representations. For this purpose, the 2-dimensional weight diagram of a given representation is placed in a ;landscape; of irreducible representations. We provide both the landscapes and the weight diagrams for a large number of representations for the three simple rank 2 Lie algebras. We also apply the algebraic ;girdle; method, which is much less efficient for calculations by hand for moderately large representations. Computer code for reducing tensor products, based on the graphical method, has been developed as well and is available from the authors upon request.

A reduced basis method for molecular dynamics simulation

NASA Astrophysics Data System (ADS)

Vincent-Finley, Rachel Elisabeth

In this dissertation, we develop a method for molecular simulation based on principal component analysis (PCA) of a molecular dynamics trajectory and least squares approximation of a potential energy function. Molecular dynamics (MD) simulation is a computational tool used to study molecular systems as they evolve through time. With respect to protein dynamics, local motions, such as bond stretching, occur within femtoseconds, while rigid body and large-scale motions, occur within a range of nanoseconds to seconds. To capture motion at all levels, time steps on the order of a femtosecond are employed when solving the equations of motion and simulations must continue long enough to capture the desired large-scale motion. To date, simulations of solvated proteins on the order of nanoseconds have been reported. It is typically the case that simulations of a few nanoseconds do not provide adequate information for the study of large-scale motions. Thus, the development of techniques that allow longer simulation times can advance the study of protein function and dynamics. In this dissertation we use principal component analysis (PCA) to identify the dominant characteristics of an MD trajectory and to represent the coordinates with respect to these characteristics. We augment PCA with an updating scheme based on a reduced representation of a molecule and consider equations of motion with respect to the reduced representation. We apply our method to butane and BPTI and compare the results to standard MD simulations of these molecules. Our results indicate that the molecular activity with respect to our simulation method is analogous to that observed in the standard MD simulation with simulations on the order of picoseconds.

[Municipal Health Councils: activity and representation of grassroots communities].

PubMed

Gerschman, Silvia

2004-01-01

This article was based on the results of research concerning health policy in municipalities that achieved the most extensive development of decentralization and innovation in the State of Rio de Janeiro, Brazil. The study applied a questionnaire for health system users' representatives in Municipal Health Councils. The central issues were: the Councils' political role; social control by the Councils, viewed as surveillance by organized society over government actions; the nature of social representation exercised by the Council members; and the type of mandate they serve. Community representatives in the Councils reinforce aspects pertaining to the exercise of representation in unequal societies. There is a predominance of a differentiated elite consisting of older males with more schooling and higher income than the community average. The notion of "social control" as the basis for the Councils is difficult for the members to grasp. Exercise of representation is diffuse, occurring by way of designation by community associations, election in assemblies, or designation by institutional health policy agencies.

Polarization ellipse and Stokes parameters in geometric algebra.

PubMed

Santos, Adler G; Sugon, Quirino M; McNamara, Daniel J

2012-01-01

In this paper, we use geometric algebra to describe the polarization ellipse and Stokes parameters. We show that a solution to Maxwell's equation is a product of a complex basis vector in Jackson and a linear combination of plane wave functions. We convert both the amplitudes and the wave function arguments from complex scalars to complex vectors. This conversion allows us to separate the electric field vector and the imaginary magnetic field vector, because exponentials of imaginary scalars convert vectors to imaginary vectors and vice versa, while exponentials of imaginary vectors only rotate the vector or imaginary vector they are multiplied to. We convert this expression for polarized light into two other representations: the Cartesian representation and the rotated ellipse representation. We compute the conversion relations among the representation parameters and their corresponding Stokes parameters. And finally, we propose a set of geometric relations between the electric and magnetic fields that satisfy an equation similar to the Poincaré sphere equation.

Distinguishing Representations as Origin and Representations as Input: Roles for Individual Neurons.

PubMed

Edwards, Jonathan C W

2016-01-01

It is widely perceived that there is a problem in giving a naturalistic account of mental representation that deals adequately with the issue of meaning, interpretation, or significance (semantic content). It is suggested here that this problem may arise partly from the conflation of two vernacular senses of representation: representation-as-origin and representation-as-input. The flash of a neon sign may in one sense represent a popular drink, but to function as a representation it must provide an input to a 'consumer' in the street. The arguments presented draw on two principles - the neuron doctrine and the need for a venue for 'presentation' or 'reception' of a representation at a specified site, consistent with the locality principle. It is also argued that domains of representation cannot be defined by signal traffic, since they can be expected to include 'null' elements based on non-firing cells. In this analysis, mental representations-as-origin are distributed patterns of cell firing. Each firing cell is given semantic value in its own right - some form of atomic propositional significance - since different axonal branches may contribute to integration with different populations of signals at different downstream sites. Representations-as-input are patterns of local co-arrival of signals in the form of synaptic potentials in dendrites. Meaning then draws on the relationships between active and null inputs, forming 'scenarios' comprising a molecular combination of 'premises' from which a new output with atomic propositional significance is generated. In both types of representation, meaning, interpretation or significance pivots on events in an individual cell. (This analysis only applies to 'occurrent' representations based on current neural activity.) The concept of representations-as-input emphasizes the need for an internal 'consumer' of a representation and the dependence of meaning on the co-relationships involved in an input interaction between signals and consumer. The acceptance of this necessity provides a basis for resolving the problem that representations appear both as distributed (representation-as-origin) and as local (representation-as-input). The key implications are that representations in the brain are massively multiple both in series and in parallel, and that individual cells play specific semantic roles. These roles are discussed in relation to traditional concepts of 'gnostic' cell types.

Distinguishing Representations as Origin and Representations as Input: Roles for Individual Neurons

PubMed Central

Edwards, Jonathan C. W.

2016-01-01

It is widely perceived that there is a problem in giving a naturalistic account of mental representation that deals adequately with the issue of meaning, interpretation, or significance (semantic content). It is suggested here that this problem may arise partly from the conflation of two vernacular senses of representation: representation-as-origin and representation-as-input. The flash of a neon sign may in one sense represent a popular drink, but to function as a representation it must provide an input to a ‘consumer’ in the street. The arguments presented draw on two principles – the neuron doctrine and the need for a venue for ‘presentation’ or ‘reception’ of a representation at a specified site, consistent with the locality principle. It is also argued that domains of representation cannot be defined by signal traffic, since they can be expected to include ‘null’ elements based on non-firing cells. In this analysis, mental representations-as-origin are distributed patterns of cell firing. Each firing cell is given semantic value in its own right – some form of atomic propositional significance – since different axonal branches may contribute to integration with different populations of signals at different downstream sites. Representations-as-input are patterns of local co-arrival of signals in the form of synaptic potentials in dendrites. Meaning then draws on the relationships between active and null inputs, forming ‘scenarios’ comprising a molecular combination of ‘premises’ from which a new output with atomic propositional significance is generated. In both types of representation, meaning, interpretation or significance pivots on events in an individual cell. (This analysis only applies to ‘occurrent’ representations based on current neural activity.) The concept of representations-as-input emphasizes the need for an internal ‘consumer’ of a representation and the dependence of meaning on the co-relationships involved in an input interaction between signals and consumer. The acceptance of this necessity provides a basis for resolving the problem that representations appear both as distributed (representation-as-origin) and as local (representation-as-input). The key implications are that representations in the brain are massively multiple both in series and in parallel, and that individual cells play specific semantic roles. These roles are discussed in relation to traditional concepts of ‘gnostic’ cell types. PMID:27746760

Orbital dependent functionals: An atom projector augmented wave method implementation

NASA Astrophysics Data System (ADS)

Xu, Xiao

This thesis explores the formulation and numerical implementation of orbital dependent exchange-correlation functionals within electronic structure calculations. These orbital-dependent exchange-correlation functionals have recently received renewed attention as a means to improve the physical representation of electron interactions within electronic structure calculations. In particular, electron self-interaction terms can be avoided. In this thesis, an orbital-dependent functional is considered in the context of Hartree-Fock (HF) theory as well as the Optimized Effective Potential (OEP) method and the approximate OEP method developed by Krieger, Li, and Iafrate, known as the KLI approximation. In this thesis, the Fock exchange term is used as a simple well-defined example of an orbital-dependent functional. The Projected Augmented Wave (PAW) method developed by P. E. Blochl has proven to be accurate and efficient for electronic structure calculations for local and semi-local functions because of its accurate evaluation of interaction integrals by controlling multiple moments. We have extended the PAW method to treat orbital-dependent functionals in Hartree-Fock theory and the Optimized Effective Potential method, particularly in the KLI approximation. In the course of study we develop a frozen-core orbital approximation that accurately treats the core electron contributions for above three methods. The main part of the thesis focuses on the treatment of spherical atoms. We have investigated the behavior of PAW-Hartree Fock and PAW-KLI basis, projector, and pseudopotential functions for several elements throughout the periodic table. We have also extended the formalism to the treatment of solids in a plane wave basis and implemented PWPAW-KLI code, which will appear in future publications.

Application of 2D graphic representation of protein sequence based on Huffman tree method.

PubMed

Qi, Zhao-Hui; Feng, Jun; Qi, Xiao-Qin; Li, Ling

2012-05-01

Based on Huffman tree method, we propose a new 2D graphic representation of protein sequence. This representation can completely avoid loss of information in the transfer of data from a protein sequence to its graphic representation. The method consists of two parts. One is about the 0-1 codes of 20 amino acids by Huffman tree with amino acid frequency. The amino acid frequency is defined as the statistical number of an amino acid in the analyzed protein sequences. The other is about the 2D graphic representation of protein sequence based on the 0-1 codes. Then the applications of the method on ten ND5 genes and seven Escherichia coli strains are presented in detail. The results show that the proposed model may provide us with some new sights to understand the evolution patterns determined from protein sequences and complete genomes. Copyright © 2012 Elsevier Ltd. All rights reserved.

Analytic Energy Gradients for Variational Two-Electron Reduced-Density-Matrix-Driven Complete Active Space Self-Consistent Field Theory.

PubMed

Maradzike, Elvis; Gidofalvi, Gergely; Turney, Justin M; Schaefer, Henry F; DePrince, A Eugene

2017-09-12

Analytic energy gradients are presented for a variational two-electron reduced-density-matrix (2-RDM)-driven complete active space self-consistent field (CASSCF) method. The active-space 2-RDM is determined using a semidefinite programing (SDP) algorithm built upon an augmented Lagrangian formalism. Expressions for analytic gradients are simplified by the fact that the Lagrangian is stationary with respect to variations in both the primal and the dual solutions to the SDP problem. Orbital response contributions to the gradient are identical to those that arise in conventional CASSCF methods in which the electronic structure of the active space is described by a full configuration interaction (CI) wave function. We explore the relative performance of variational 2-RDM (v2RDM)- and CI-driven CASSCF for the equilibrium geometries of 20 small molecules. When enforcing two-particle N-representability conditions, full-valence v2RDM-CASSCF-optimized bond lengths display a mean unsigned error of 0.0060 Å and a maximum unsigned error of 0.0265 Å, relative to those obtained from full-valence CI-CASSCF. When enforcing partial three-particle N-representability conditions, the mean and maximum unsigned errors are reduced to only 0.0006 and 0.0054 Å, respectively. For these same molecules, full-valence v2RDM-CASSCF bond lengths computed in the cc-pVQZ basis set deviate from experimentally determined ones on average by 0.017 and 0.011 Å when enforcing two- and three-particle conditions, respectively, whereas CI-CASSCF displays an average deviation of 0.010 Å. The v2RDM-CASSCF approach with two-particle conditions is also applied to the equilibrium geometry of pentacene; optimized bond lengths deviate from those derived from experiment, on average, by 0.015 Å when using a cc-pVDZ basis set and a (22e,22o) active space.

Representation learning via Dual-Autoencoder for recommendation.

PubMed

Zhuang, Fuzhen; Zhang, Zhiqiang; Qian, Mingda; Shi, Chuan; Xie, Xing; He, Qing

2017-06-01

Recommendation has provoked vast amount of attention and research in recent decades. Most previous works employ matrix factorization techniques to learn the latent factors of users and items. And many subsequent works consider external information, e.g., social relationships of users and items' attributions, to improve the recommendation performance under the matrix factorization framework. However, matrix factorization methods may not make full use of the limited information from rating or check-in matrices, and achieve unsatisfying results. Recently, deep learning has proven able to learn good representation in natural language processing, image classification, and so on. Along this line, we propose a new representation learning framework called Recommendation via Dual-Autoencoder (ReDa). In this framework, we simultaneously learn the new hidden representations of users and items using autoencoders, and minimize the deviations of training data by the learnt representations of users and items. Based on this framework, we develop a gradient descent method to learn hidden representations. Extensive experiments conducted on several real-world data sets demonstrate the effectiveness of our proposed method compared with state-of-the-art matrix factorization based methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

Method and apparatus for modeling interactions

DOEpatents

Xavier, Patrick G.

2000-08-08

A method and apparatus for modeling interactions between bodies. The method comprises representing two bodies undergoing translations and rotations by two hierarchical swept volume representations. Interactions such as nearest approach and collision can be modeled based on the swept body representations. The present invention can serve as a practical tool in motion planning, CAD systems, simulation systems, safety analysis, and applications that require modeling time-based interactions. A body can be represented in the present invention by a union of convex polygons and convex polyhedra. As used generally herein, polyhedron includes polygon, and polyhedra includes polygons. The body undergoing translation can be represented by a swept body representation, where the swept body representation comprises a hierarchical bounding volume representation whose leaves each contain a representation of the region swept by a section of the body during the translation, and where the union of the regions is a superset of the region swept by the surface of the body during translation. Interactions between two bodies thus represented can be modeled by modeling interactions between the convex hulls of the finite sets of discrete points in the swept body representations.

Sparse representation based SAR vehicle recognition along with aspect angle.

PubMed

Xing, Xiangwei; Ji, Kefeng; Zou, Huanxin; Sun, Jixiang

2014-01-01

As a method of representing the test sample with few training samples from an overcomplete dictionary, sparse representation classification (SRC) has attracted much attention in synthetic aperture radar (SAR) automatic target recognition (ATR) recently. In this paper, we develop a novel SAR vehicle recognition method based on sparse representation classification along with aspect information (SRCA), in which the correlation between the vehicle's aspect angle and the sparse representation vector is exploited. The detailed procedure presented in this paper can be summarized as follows. Initially, the sparse representation vector of a test sample is solved by sparse representation algorithm with a principle component analysis (PCA) feature-based dictionary. Then, the coefficient vector is projected onto a sparser one within a certain range of the vehicle's aspect angle. Finally, the vehicle is classified into a certain category that minimizes the reconstruction error with the novel sparse representation vector. Extensive experiments are conducted on the moving and stationary target acquisition and recognition (MSTAR) dataset and the results demonstrate that the proposed method performs robustly under the variations of depression angle and target configurations, as well as incomplete observation.

TINKTEP: A fully self-consistent, mutually polarizable QM/MM approach based on the AMOEBA force field

NASA Astrophysics Data System (ADS)

Dziedzic, Jacek; Mao, Yuezhi; Shao, Yihan; Ponder, Jay; Head-Gordon, Teresa; Head-Gordon, Martin; Skylaris, Chris-Kriton

2016-09-01

We present a novel quantum mechanical/molecular mechanics (QM/MM) approach in which a quantum subsystem is coupled to a classical subsystem described by the AMOEBA polarizable force field. Our approach permits mutual polarization between the QM and MM subsystems, effected through multipolar electrostatics. Self-consistency is achieved for both the QM and MM subsystems through a total energy minimization scheme. We provide an expression for the Hamiltonian of the coupled QM/MM system, which we minimize using gradient methods. The QM subsystem is described by the onetep linear-scaling DFT approach, which makes use of strictly localized orbitals expressed in a set of periodic sinc basis functions equivalent to plane waves. The MM subsystem is described by the multipolar, polarizable force field AMOEBA, as implemented in tinker. Distributed multipole analysis is used to obtain, on the fly, a classical representation of the QM subsystem in terms of atom-centered multipoles. This auxiliary representation is used for all polarization interactions between QM and MM, allowing us to treat them on the same footing as in AMOEBA. We validate our method in tests of solute-solvent interaction energies, for neutral and charged molecules, demonstrating the simultaneous optimization of the quantum and classical degrees of freedom. Encouragingly, we find that the inclusion of explicit polarization in the MM part of QM/MM improves the agreement with fully QM calculations.

Representation in development: from a model system to some general processes.

PubMed

Montuori, Luke M; Honey, Robert C

2015-03-01

The view that filial imprinting might serve as a useful model system for studying the neurobiological basis of memory was inspired, at least in part, by a simple idea: acquired filial preferences reflect the formation of a memory or representation of the imprinting object itself, as opposed to the change in the efficacy of stimulus-response pathways, for example. We provide a synthesis of the evidence that supports this idea; and show that the processes of memory formation observed in filial imprinting find surprisingly close counterparts in other species, including our own. Copyright © 2014 Elsevier Ltd. All rights reserved.

Region based route planning - Multi-abstraction route planning based on intermediate level vision processing

NASA Technical Reports Server (NTRS)

Doshi, Rajkumar S.; Lam, Raymond; White, James E.

1989-01-01

Intermediate and high level processing operations are performed on vision data for the organization of images into more meaningful, higher-level topological representations by means of a region-based route planner (RBRP). The RBRP operates in terrain scenarios where some or most of the terrain is occluded, proceeding without a priori maps on the basis of two-dimensional representations and gradient-and-roughness information. Route planning is accomplished by three successive abstractions and yields a detailed point-by-point path by searching only within the boundaries of relatively small regions.

The Differential Role of Verbal and Spatial Working Memory in the Neural Basis of Arithmetic

PubMed Central

Demir, Özlem Ece; Prado, Jérôme; Booth, James R.

2014-01-01

We examine the relations of verbal and spatial WM ability to the neural bases of arithmetic in school-age children. We independently localize brain regions subserving verbal versus spatial representations. For multiplication, higher verbal WM ability is associated with greater recruitment of the left temporal cortex, identified by the verbal localizer. For multiplication and subtraction, higher spatial WM ability is associated with greater recruitment of right parietal cortex, identified by the spatial localizer. Depending on their WM ability, children engage different neural systems that manipulate different representations to solve arithmetic problems. PMID:25144257

Analysis of the ST-T complex of the electrocardiogram using the Karhunen--Loeve transform: adaptive monitoring and alternans detection

NASA Technical Reports Server (NTRS)

Laguna, P.; Moody, G. B.; Garcia, J.; Goldberger, A. L.; Mark, R. G.

1999-01-01

The Karhunen-Loeve transform (KLT) is applied to study the ventricular repolarisation period as reflected in the ST-T complex of the surface ECG. The KLT coefficients provide a sensitive means of quantitating ST-T shapes. A training set of ST-T complexes is used to derive a set of KLT basis vectors that permits representation of 90% of the signal energy using four KLT coefficients. As a truncated KLT expansion tends to favor representation of the signal over any additive noise, a time series of KLT coefficients obtained from successive ST-T complexes is better suited for representation of both medium-term variations (such as ischemic changes) and short-term variations (such as ST-T alternans) than discrete parameters such as the ST level or other local indices. For analysis of ischemic changes, an adaptive filter is described that can be used to estimate the KLT coefficient, yielding an increase in the signal-to-noise ratio of 10 dB (u = 0.1), with a convergence time of about three beats. A beat spectrum of the unfiltered KLT coefficient series is used for detection of ST-T alterans. These methods are illustrated with examples from the European ST-T Database. About 20% of records revealed quasi-periodic salvos of ischemic ST-T change episodes and another 20% exhibit repetitive, but not clearly periodic patterns of ST-T change episodes. About 5% of ischemic episodes were associated with ST-T alterans.

Formalizing nursing knowledge: from theories and models to ontologies.

PubMed

Peace, Jane; Brennan, Patricia Flatley

2009-01-01

Knowledge representation in nursing is poised to address the depth of nursing knowledge about the specific phenomena of importance to nursing. Nursing theories and models may provide a starting point for making this knowledge explicit in representations. We combined knowledge building methods from nursing and ontology design methods from biomedical informatics to create a nursing representation of family health history. Our experience provides an example of how knowledge representations may be created to facilitate electronic support for nursing practice and knowledge development.

Age-related differences in the neural basis of the subjective vividness of memories: Evidence from multivoxel pattern classification

PubMed Central

Johnson, Marcia K.; Kuhl, Brice A.; Mitchell, Karen J.; Ankudowich, Elizabeth; Durbin, Kelly A.

2016-01-01

Although older adults often show reduced episodic memory accuracy, their ratings of the subjective vividness of their memories often equal or even exceed those of young adults. Such findings suggest that young and older adults may differentially access and/or weight different kinds of information in making vividness judgments. We examined this idea using multivoxel pattern classification of fMRI data to measure category representations while participants saw and remembered pictures of objects and scenes. Consistent with our hypothesis, there were age-related differences in how category representations related to the subjective sense of vividness. During remembering, older adults’ vividness ratings were more related, relative to young adults’, to category representations in prefrontal cortex. In contrast, young adults’ vividness ratings were more related, relative to older adults, to category representations in parietal cortex. In addition, category representations were more correlated among posterior regions in young than older adults, whereas correlations between PFC and posterior regions did not differ between the two groups. Together, these results are consistent with the idea that young and older adults differentially weight different types of information in assessing subjective vividness of their memories. PMID:25855004

A model for process representation and synthesis. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Thomas, R. H.

1971-01-01

The problem of representing groups of loosely connected processes is investigated, and a model for process representation useful for synthesizing complex patterns of process behavior is developed. There are three parts, the first part isolates the concepts which form the basis for the process representation model by focusing on questions such as: What is a process; What is an event; Should one process be able to restrict the capabilities of another? The second part develops a model for process representation which captures the concepts and intuitions developed in the first part. The model presented is able to describe both the internal structure of individual processes and the interface structure between interacting processes. Much of the model's descriptive power derives from its use of the notion of process state as a vehicle for relating the internal and external aspects of process behavior. The third part demonstrates by example that the model for process representation is a useful one for synthesizing process behavior patterns. In it the model is used to define a variety of interesting process behavior patterns. The dissertation closes by suggesting how the model could be used as a semantic base for a very potent language extension facility.

Improving Preschoolers’ Arithmetic through Number Magnitude Training: The Impact of Non-Symbolic and Symbolic Training

PubMed Central

2016-01-01

The numerical cognition literature offers two views to explain numerical and arithmetical development. The unique-representation view considers the approximate number system (ANS) to represent the magnitude of both symbolic and non-symbolic numbers and to be the basis of numerical learning. In contrast, the dual-representation view suggests that symbolic and non-symbolic skills rely on different magnitude representations and that it is the ability to build an exact representation of symbolic numbers that underlies math learning. Support for these hypotheses has come mainly from correlative studies with inconsistent results. In this study, we developed two training programs aiming at enhancing the magnitude processing of either non-symbolic numbers or symbolic numbers and compared their effects on arithmetic skills. Fifty-six preschoolers were randomly assigned to one of three 10-session-training conditions: (1) non-symbolic training (2) symbolic training and (3) control training working on story understanding. Both numerical training conditions were significantly more efficient than the control condition in improving magnitude processing. Moreover, symbolic training led to a significantly larger improvement in arithmetic than did non-symbolic training and the control condition. These results support the dual-representation view. PMID:27875540

On a categorial aspect of knowledge representation

NASA Astrophysics Data System (ADS)

Tataj, Emanuel; Mulawka, Jan; Nieznański, Edward

Adequate representation of data is crucial for modeling any type of data. To faithfully present and describe the relevant section of the world it is necessary to select the method that can easily be implemented on a computer system which will help in further description allowing reasoning. The main objective of this contribution is to present methods of knowledge representation using categorial approach. Next to identify the main advantages for computer implementation. Categorical aspect of knowledge representation is considered in semantic networks realisation. Such method borrows already known metaphysics properties for data modeling process. The potential topics of further development of categorical semantic networks implementations are also underlined.

45 CFR 1633.3 - Prohibition.

Code of Federal Regulations, 2012 CFR

2012-10-01

... proceeding is brought by a public housing agency on the basis that the illegal drug activity for which the... Regulations Relating to Public Welfare (Continued) LEGAL SERVICES CORPORATION RESTRICTION ON REPRESENTATION IN... with or has been convicted of the illegal sale, distribution, or manufacture of a controlled substance...

45 CFR 1633.3 - Prohibition.

Code of Federal Regulations, 2013 CFR

2013-10-01

... proceeding is brought by a public housing agency on the basis that the illegal drug activity for which the... Regulations Relating to Public Welfare (Continued) LEGAL SERVICES CORPORATION RESTRICTION ON REPRESENTATION IN... with or has been convicted of the illegal sale, distribution, or manufacture of a controlled substance...

45 CFR 1633.3 - Prohibition.

Code of Federal Regulations, 2011 CFR

2011-10-01

... proceeding is brought by a public housing agency on the basis that the illegal drug activity for which the... Regulations Relating to Public Welfare (Continued) LEGAL SERVICES CORPORATION RESTRICTION ON REPRESENTATION IN... with or has been convicted of the illegal sale, distribution, or manufacture of a controlled substance...

45 CFR 1633.3 - Prohibition.

Code of Federal Regulations, 2010 CFR

2010-10-01

... proceeding is brought by a public housing agency on the basis that the illegal drug activity for which the... Regulations Relating to Public Welfare (Continued) LEGAL SERVICES CORPORATION RESTRICTION ON REPRESENTATION IN... with or has been convicted of the illegal sale, distribution, or manufacture of a controlled substance...

45 CFR 1633.3 - Prohibition.

Code of Federal Regulations, 2014 CFR

2014-10-01

... proceeding is brought by a public housing agency on the basis that the illegal drug activity for which the... Regulations Relating to Public Welfare (Continued) LEGAL SERVICES CORPORATION RESTRICTION ON REPRESENTATION IN... with or has been convicted of the illegal sale, distribution, or manufacture of a controlled substance...

The Census, Constitution, Reapportionment, and Redistricting.

ERIC Educational Resources Information Center

Webster, Gerald R.

2000-01-01

Explains that census results are the basis for geographic distribution of political power in the United States. Discusses the census, offering historical information that focuses on the issue of territorial representation. Explores the "reapportionment revolution," its impact on the census, and the controversy surrounding the 2000…

Scaling in soils and other complex porous media

USDA-ARS?s Scientific Manuscript database

Scaling remains one of the most challenging topics in earth and environmental sciences, forming a basis for our understanding of process development across the multiple scales which make up the subsurface environment. Understanding and succinct representation of scaling properties can lead to the un...

Invariant operators, orthogonal bases and correlators in general tensor models

NASA Astrophysics Data System (ADS)

Diaz, Pablo; Rey, Soo-Jong

2018-07-01

We study invariant operators in general tensor models. We show that representation theory provides an efficient framework to count and classify invariants in tensor models of (gauge) symmetry Gd = U (N1) ⊗ ⋯ ⊗ U (Nd). As a continuation and completion of our earlier work, we present two natural ways of counting invariants, one for arbitrary Gd and another valid for large rank of Gd. We construct bases of invariant operators based on the counting, and compute correlators of their elements. The basis associated with finite rank of Gd diagonalizes the two-point function of the free theory. It is analogous to the restricted Schur basis used in matrix models. We show that the constructions get almost identical as we swap the Littlewood-Richardson numbers in multi-matrix models with Kronecker coefficients in general tensor models. We explore the parallelism between matrix model and tensor model in depth from the perspective of representation theory and comment on several ideas for future investigation.

The validity of multiphase DNS initialized on the basis of single--point statistics

NASA Astrophysics Data System (ADS)

Subramaniam, Shankar

1999-11-01

A study of the point--process statistical representation of a spray reveals that single--point statistical information contained in the droplet distribution function (ddf) is related to a sequence of single surrogate--droplet pdf's, which are in general different from the physical single--droplet pdf's. The results of this study have important consequences for the initialization and evolution of direct numerical simulations (DNS) of multiphase flows, which are usually initialized on the basis of single--point statistics such as the average number density in physical space. If multiphase DNS are initialized in this way, this implies that even the initial representation contains certain implicit assumptions concerning the complete ensemble of realizations, which are invalid for general multiphase flows. Also the evolution of a DNS initialized in this manner is shown to be valid only if an as yet unproven commutation hypothesis holds true. Therefore, it is questionable to what extent DNS that are initialized in this manner constitute a direct simulation of the physical droplets.

Wave function continuity and the diagonal Born-Oppenheimer correction at conical intersections

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

Meek, Garrett A.; Levine, Benjamin G., E-mail: levine@chemistry.msu.edu

2016-05-14

We demonstrate that though exact in principle, the expansion of the total molecular wave function as a sum over adiabatic Born-Oppenheimer (BO) vibronic states makes inclusion of the second-derivative nonadiabatic energy term near conical intersections practically problematic. In order to construct a well-behaved molecular wave function that has density at a conical intersection, the individual BO vibronic states in the summation must be discontinuous. When the second-derivative nonadiabatic terms are added to the Hamiltonian, singularities in the diagonal BO corrections (DBOCs) of the individual BO states arise from these discontinuities. In contrast to the well-known singularities in the first-derivative couplingsmore » at conical intersections, these singularities are non-integrable, resulting in undefined DBOC matrix elements. Though these singularities suggest that the exact molecular wave function may not have density at the conical intersection point, there is no physical basis for this constraint. Instead, the singularities are artifacts of the chosen basis of discontinuous functions. We also demonstrate that continuity of the total molecular wave function does not require continuity of the individual adiabatic nuclear wave functions. We classify nonadiabatic molecular dynamics methods according to the constraints placed on wave function continuity and analyze their formal properties. Based on our analysis, it is recommended that the DBOC be neglected when employing mixed quantum-classical methods and certain approximate quantum dynamical methods in the adiabatic representation.« less

Wave function continuity and the diagonal Born-Oppenheimer correction at conical intersections

NASA Astrophysics Data System (ADS)

Meek, Garrett A.; Levine, Benjamin G.

2016-05-01

We demonstrate that though exact in principle, the expansion of the total molecular wave function as a sum over adiabatic Born-Oppenheimer (BO) vibronic states makes inclusion of the second-derivative nonadiabatic energy term near conical intersections practically problematic. In order to construct a well-behaved molecular wave function that has density at a conical intersection, the individual BO vibronic states in the summation must be discontinuous. When the second-derivative nonadiabatic terms are added to the Hamiltonian, singularities in the diagonal BO corrections (DBOCs) of the individual BO states arise from these discontinuities. In contrast to the well-known singularities in the first-derivative couplings at conical intersections, these singularities are non-integrable, resulting in undefined DBOC matrix elements. Though these singularities suggest that the exact molecular wave function may not have density at the conical intersection point, there is no physical basis for this constraint. Instead, the singularities are artifacts of the chosen basis of discontinuous functions. We also demonstrate that continuity of the total molecular wave function does not require continuity of the individual adiabatic nuclear wave functions. We classify nonadiabatic molecular dynamics methods according to the constraints placed on wave function continuity and analyze their formal properties. Based on our analysis, it is recommended that the DBOC be neglected when employing mixed quantum-classical methods and certain approximate quantum dynamical methods in the adiabatic representation.

Wave function continuity and the diagonal Born-Oppenheimer correction at conical intersections.

PubMed

Meek, Garrett A; Levine, Benjamin G

2016-05-14

We demonstrate that though exact in principle, the expansion of the total molecular wave function as a sum over adiabatic Born-Oppenheimer (BO) vibronic states makes inclusion of the second-derivative nonadiabatic energy term near conical intersections practically problematic. In order to construct a well-behaved molecular wave function that has density at a conical intersection, the individual BO vibronic states in the summation must be discontinuous. When the second-derivative nonadiabatic terms are added to the Hamiltonian, singularities in the diagonal BO corrections (DBOCs) of the individual BO states arise from these discontinuities. In contrast to the well-known singularities in the first-derivative couplings at conical intersections, these singularities are non-integrable, resulting in undefined DBOC matrix elements. Though these singularities suggest that the exact molecular wave function may not have density at the conical intersection point, there is no physical basis for this constraint. Instead, the singularities are artifacts of the chosen basis of discontinuous functions. We also demonstrate that continuity of the total molecular wave function does not require continuity of the individual adiabatic nuclear wave functions. We classify nonadiabatic molecular dynamics methods according to the constraints placed on wave function continuity and analyze their formal properties. Based on our analysis, it is recommended that the DBOC be neglected when employing mixed quantum-classical methods and certain approximate quantum dynamical methods in the adiabatic representation.

Experimental Design and Interpretation of Functional Neuroimaging Studies of Cognitive Processes

PubMed Central

Caplan, David

2008-01-01

This article discusses how the relation between experimental and baseline conditions in functional neuroimaging studies affects the conclusions that can be drawn from a study about the neural correlates of components of the cognitive system and about the nature and organization of those components. I argue that certain designs in common use—in particular the contrast of qualitatively different representations that are processed at parallel stages of a functional architecture—can never identify the neural basis of a cognitive operation and have limited use in providing information about the nature of cognitive systems. Other types of designs—such as ones that contrast representations that are computed in immediately sequential processing steps and ones that contrast qualitatively similar representations that are parametrically related within a single processing stage—are more easily interpreted. PMID:17979122

Towards "Inverse" Character Tables? A One-Step Method for Decomposing Reducible Representations

ERIC Educational Resources Information Center

Piquemal, J.-Y.; Losno, R.; Ancian, B.

2009-01-01

In the framework of group theory, a new procedure is described for a one-step automated reduction of reducible representations. The matrix inversion tool, provided by standard spreadsheet software, is applied to the central part of the character table that contains the characters of the irreducible representation. This method is not restricted to…

Excited states of 4He

NASA Astrophysics Data System (ADS)

Aoyama, Shigeyoshi

2013-04-01

The study of the 4He nucleus is important because it is the most basic sub-unit (cluster) in nuclei. We have investigated the structures and the reaction mechanisms in 4He by using the correlated Gaussian basis function with the global vector representation. In order to treat the boundary condition for the ab-initio calculation of the four nucleons, we employ the Microscopic R-matrix Method (MRM) and the Complex Scaling Method (CSM) . Elastic-scattering phase shifts for four-nucleon systems are studied in an ab-initio type cluster model with MRM in order to clarify the role of the tensor force and to investigate cluster distortions in low energy d+d and t+p scattering. For 1S0, the calculated phase shifts show that the t+p and h+n channels are strongly coupled to the d+d channel for the case of the realistic interaction.

Assessing the Links Between Anthropometrics Data and Akabane Test Results.

PubMed

Muzhikov, Valery; Vershinina, Elena; Belenky, Vadim; Muzhikov, Ruslan

2018-02-01

According to popular belief, metabolic disorders and imbalances are one of the main factors contributing to various human illnesses. Early diagnosis of these disorders is one of the main methods for preventing serious diseases. The goal of this study was to assess the correlations between main physical indicators and the activity of certain acupuncture channels using the thermal Akabane test based on ancient Chinese diagnostic methods. This test measures the pain thresholds' temperature sensitivity when a point source of heat is applied to the "entrance-exit" points of each channel. The skin temperature sensitivity in our bodies is a basic reactive system; it is as significant as such important indicators as body temperature and provides a very clear representation of functional and psychophysiological profiles. On the basis of our statistical study, we revealed reliable correspondence between the activity of certain acupuncture channels and main anthropometric and biometric data. Copyright © 2018. Published by Elsevier B.V.

Wavepacket propagation using time-sliced semiclassical initial value methods

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

Wallace, Brett B.; Reimers, Jeffrey R.; School of Chemistry, University of Sydney, Sydney NSW 2006

2004-12-22

A new semiclassical initial value representation (SC-IVR) propagator and a SC-IVR propagator originally introduced by Kay [J. Chem. Phys. 100, 4432 (1994)], are investigated for use in the split-operator method for solving the time-dependent Schroedinger equation. It is shown that the SC-IVR propagators can be derived from a procedure involving modified Filinov filtering of the Van Vleck expression for the semiclassical propagator. The two SC-IVR propagators have been selected for investigation because they avoid the need to perform a coherent state basis set expansion that is necessary in other time-slicing propagation schemes. An efficient scheme for solving the propagators ismore » introduced and can be considered to be a semiclassical form of the effective propagators of Makri [Chem. Phys. Lett. 159, 489 (1989)]. Results from applications to a one-dimensional, two-dimensional, and three-dimensional Hamiltonian for a double-well potential are presented.« less

Uniform quantized electron gas

NASA Astrophysics Data System (ADS)

Høye, Johan S.; Lomba, Enrique

2016-10-01

In this work we study the correlation energy of the quantized electron gas of uniform density at temperature T  =  0. To do so we utilize methods from classical statistical mechanics. The basis for this is the Feynman path integral for the partition function of quantized systems. With this representation the quantum mechanical problem can be interpreted as, and is equivalent to, a classical polymer problem in four dimensions where the fourth dimension is imaginary time. Thus methods, results, and properties obtained in the statistical mechanics of classical fluids can be utilized. From this viewpoint we recover the well known RPA (random phase approximation). Then to improve it we modify the RPA by requiring the corresponding correlation function to be such that electrons with equal spins can not be on the same position. Numerical evaluations are compared with well known results of a standard parameterization of Monte Carlo correlation energies.

Accelerated computer generated holography using sparse bases in the STFT domain.

PubMed

Blinder, David; Schelkens, Peter

2018-01-22

Computer-generated holography at high resolutions is a computationally intensive task. Efficient algorithms are needed to generate holograms at acceptable speeds, especially for real-time and interactive applications such as holographic displays. We propose a novel technique to generate holograms using a sparse basis representation in the short-time Fourier space combined with a wavefront-recording plane placed in the middle of the 3D object. By computing the point spread functions in the transform domain, we update only a small subset of the precomputed largest-magnitude coefficients to significantly accelerate the algorithm over conventional look-up table methods. We implement the algorithm on a GPU, and report a speedup factor of over 30. We show that this transform is superior over wavelet-based approaches, and show quantitative and qualitative improvements over the state-of-the-art WASABI method; we report accuracy gains of 2dB PSNR, as well improved view preservation.

Designing electronic module based on learning content development system in fostering students’ multi representation skills

NASA Astrophysics Data System (ADS)

Resita, I.; Ertikanto, C.

2018-05-01

This study aims to develop electronic module design based on Learning Content Development System (LCDS) to foster students’ multi representation skills in physics subject material. This study uses research and development method to the product design. This study involves 90 students and 6 physics teachers who were randomly chosen from 3 different Senior High Schools in Lampung Province. The data were collected by using questionnaires and analyzed by using quantitative descriptive method. Based on the data, 95% of the students only use one form of representation in solving physics problems. Representation which is tend to be used by students is symbolic representation. Students are considered to understand the concept of physics if they are able to change from one form to the other forms of representation. Product design of LCDS-based electronic module presents text, image, symbolic, video, and animation representation.

VALUE - A Framework to Validate Downscaling Approaches for Climate Change Studies

NASA Astrophysics Data System (ADS)

Maraun, Douglas; Widmann, Martin; Gutiérrez, José M.; Kotlarski, Sven; Chandler, Richard E.; Hertig, Elke; Wibig, Joanna; Huth, Radan; Wilke, Renate A. I.

2015-04-01

VALUE is an open European network to validate and compare downscaling methods for climate change research. VALUE aims to foster collaboration and knowledge exchange between climatologists, impact modellers, statisticians, and stakeholders to establish an interdisciplinary downscaling community. A key deliverable of VALUE is the development of a systematic validation framework to enable the assessment and comparison of both dynamical and statistical downscaling methods. Here, we present the key ingredients of this framework. VALUE's main approach to validation is user-focused: starting from a specific user problem, a validation tree guides the selection of relevant validation indices and performance measures. Several experiments have been designed to isolate specific points in the downscaling procedure where problems may occur: what is the isolated downscaling skill? How do statistical and dynamical methods compare? How do methods perform at different spatial scales? Do methods fail in representing regional climate change? How is the overall representation of regional climate, including errors inherited from global climate models? The framework will be the basis for a comprehensive community-open downscaling intercomparison study, but is intended also to provide general guidance for other validation studies.

VALUE: A framework to validate downscaling approaches for climate change studies

NASA Astrophysics Data System (ADS)

Maraun, Douglas; Widmann, Martin; Gutiérrez, José M.; Kotlarski, Sven; Chandler, Richard E.; Hertig, Elke; Wibig, Joanna; Huth, Radan; Wilcke, Renate A. I.

2015-01-01

VALUE is an open European network to validate and compare downscaling methods for climate change research. VALUE aims to foster collaboration and knowledge exchange between climatologists, impact modellers, statisticians, and stakeholders to establish an interdisciplinary downscaling community. A key deliverable of VALUE is the development of a systematic validation framework to enable the assessment and comparison of both dynamical and statistical downscaling methods. In this paper, we present the key ingredients of this framework. VALUE's main approach to validation is user- focused: starting from a specific user problem, a validation tree guides the selection of relevant validation indices and performance measures. Several experiments have been designed to isolate specific points in the downscaling procedure where problems may occur: what is the isolated downscaling skill? How do statistical and dynamical methods compare? How do methods perform at different spatial scales? Do methods fail in representing regional climate change? How is the overall representation of regional climate, including errors inherited from global climate models? The framework will be the basis for a comprehensive community-open downscaling intercomparison study, but is intended also to provide general guidance for other validation studies.

An exact variational method to calculate rovibrational spectra of polyatomic molecules with large amplitude motion

NASA Astrophysics Data System (ADS)

Yu, Hua-Gen

2016-08-01

We report a new full-dimensional variational algorithm to calculate rovibrational spectra of polyatomic molecules using an exact quantum mechanical Hamiltonian. The rovibrational Hamiltonian of system is derived in a set of orthogonal polyspherical coordinates in the body-fixed frame. It is expressed in an explicitly Hermitian form. The Hamiltonian has a universal formulation regardless of the choice of orthogonal polyspherical coordinates and the number of atoms in molecule, which is suitable for developing a general program to study the spectra of many polyatomic systems. An efficient coupled-state approach is also proposed to solve the eigenvalue problem of the Hamiltonian using a multi-layer Lanczos iterative diagonalization approach via a set of direct product basis set in three coordinate groups: radial coordinates, angular variables, and overall rotational angles. A simple set of symmetric top rotational functions is used for the overall rotation whereas a potential-optimized discrete variable representation method is employed in radial coordinates. A set of contracted vibrationally diabatic basis functions is adopted in internal angular variables. Those diabatic functions are first computed using a neural network iterative diagonalization method based on a reduced-dimension Hamiltonian but only once. The final rovibrational energies are computed using a modified Lanczos method for a given total angular momentum J, which is usually fast. Two numerical applications to CH4 and H2CO are given, together with a comparison with previous results.

An exact variational method to calculate rovibrational spectra of polyatomic molecules with large amplitude motion

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

Yu, Hua-Gen, E-mail: hgy@bnl.gov

We report a new full-dimensional variational algorithm to calculate rovibrational spectra of polyatomic molecules using an exact quantum mechanical Hamiltonian. The rovibrational Hamiltonian of system is derived in a set of orthogonal polyspherical coordinates in the body-fixed frame. It is expressed in an explicitly Hermitian form. The Hamiltonian has a universal formulation regardless of the choice of orthogonal polyspherical coordinates and the number of atoms in molecule, which is suitable for developing a general program to study the spectra of many polyatomic systems. An efficient coupled-state approach is also proposed to solve the eigenvalue problem of the Hamiltonian using amore » multi-layer Lanczos iterative diagonalization approach via a set of direct product basis set in three coordinate groups: radial coordinates, angular variables, and overall rotational angles. A simple set of symmetric top rotational functions is used for the overall rotation whereas a potential-optimized discrete variable representation method is employed in radial coordinates. A set of contracted vibrationally diabatic basis functions is adopted in internal angular variables. Those diabatic functions are first computed using a neural network iterative diagonalization method based on a reduced-dimension Hamiltonian but only once. The final rovibrational energies are computed using a modified Lanczos method for a given total angular momentum J, which is usually fast. Two numerical applications to CH{sub 4} and H{sub 2}CO are given, together with a comparison with previous results.« less

New knowledge network evaluation method for design rationale management

NASA Astrophysics Data System (ADS)

Jing, Shikai; Zhan, Hongfei; Liu, Jihong; Wang, Kuan; Jiang, Hao; Zhou, Jingtao

2015-01-01

Current design rationale (DR) systems have not demonstrated the value of the approach in practice since little attention is put to the evaluation method of DR knowledge. To systematize knowledge management process for future computer-aided DR applications, a prerequisite is to provide the measure for the DR knowledge. In this paper, a new knowledge network evaluation method for DR management is presented. The method characterizes the DR knowledge value from four perspectives, namely, the design rationale structure scale, association knowledge and reasoning ability, degree of design justification support and degree of knowledge representation conciseness. The DR knowledge comprehensive value is also measured by the proposed method. To validate the proposed method, different style of DR knowledge network and the performance of the proposed measure are discussed. The evaluation method has been applied in two realistic design cases and compared with the structural measures. The research proposes the DR knowledge evaluation method which can provide object metric and selection basis for the DR knowledge reuse during the product design process. In addition, the method is proved to be more effective guidance and support for the application and management of DR knowledge.

Tick, Tock, Tick, Tock...

NASA Astrophysics Data System (ADS)

Evans, N. W.; Molloy, M.

2014-07-01

The Gaia dataset will require a huge leap forward in terms of modelling of the Milky Way. Two problems are highlighted here. First, models of the Galactic Bar remain primitive as compared to the Galactic Disk and Stellar Halo. Although Schwarzschild and N-body methods are useful, the future belongs to Made-to-Measure (M2M) models which have significant advantages in terms of storage and flexibility. Second, the Milky Way potential will need much better representation than hitherto. Most models still use very simple building blocks (Miyamoto-Nagai disks or Hernquist bulges) and these will not be fit for purpose in the Gaia Era. Expansions in terms of basis functions offer the possibility of incorporating cosmological information as priors, as well as mych greater adaptability.

Unified theory of effective interaction

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

Takayanagi, Kazuo, E-mail: k-takaya@sophia.ac.jp

2016-09-15

We present a unified description of effective interaction theories in both algebraic and graphic representations. In our previous work, we have presented the Rayleigh–Schrödinger and Bloch perturbation theories in a unified fashion by introducing the main frame expansion of the effective interaction. In this work, we start also from the main frame expansion, and present various nonperturbative theories in a coherent manner, which include generalizations of the Brandow, Brillouin–Wigner, and Bloch–Horowitz theories on the formal side, and the extended Krenciglowa–Kuo and the extended Lee–Suzuki methods on the practical side. We thus establish a coherent and comprehensive description of both perturbativemore » and nonperturbative theories on the basis of the main frame expansion.« less

ODF Maxima Extraction in Spherical Harmonic Representation via Analytical Search Space Reduction

PubMed Central

Aganj, Iman; Lenglet, Christophe; Sapiro, Guillermo

2015-01-01

By revealing complex fiber structure through the orientation distribution function (ODF), q-ball imaging has recently become a popular reconstruction technique in diffusion-weighted MRI. In this paper, we propose an analytical dimension reduction approach to ODF maxima extraction. We show that by expressing the ODF, or any antipodally symmetric spherical function, in the common fourth order real and symmetric spherical harmonic basis, the maxima of the two-dimensional ODF lie on an analytically derived one-dimensional space, from which we can detect the ODF maxima. This method reduces the computational complexity of the maxima detection, without compromising the accuracy. We demonstrate the performance of our technique on both artificial and human brain data. PMID:20879302

Multimodal Wavelet Embedding Representation for data Combination (MaWERiC): Integrating Magnetic Resonance Imaging and Spectroscopy for Prostate Cancer Detection

PubMed Central

Tiwari, Pallavi; Kurhanewicz, John; Viswanath, Satish; Sridhar, Akshay; Madabhushi, Anant

2011-01-01

Rationale and Objectives To develop a computerized data integration framework (MaWERiC) for quantitatively combining structural and metabolic information from different Magnetic Resonance (MR) imaging modalities. Materials and Methods In this paper, we present a novel computerized support system that we call Multimodal Wavelet Embedding Representation for data Combination (MaWERiC) which (1) employs wavelet theory and dimensionality reduction for providing a common, uniform representation of the different imaging (T2-w) and non-imaging (spectroscopy) MRI channels, and (2) leverages a random forest classifier for automated prostate cancer detection on a per voxel basis from combined 1.5 Tesla in vivo MRI and MRS. Results A total of 36 1.5 T endorectal in vivo T2-w MRI, MRS patient studies were evaluated on a per-voxel via MaWERiC, using a three-fold cross validation scheme across 25 iterations. Ground truth for evaluation of the results was obtained via ex-vivo whole-mount histology sections which served as the gold standard for expert radiologist annotations of prostate cancer on a per-voxel basis. The results suggest that MaWERiC based MRS-T2-w meta-classifier (mean AUC, μ = 0.89 ± 0.02) significantly outperformed (i) a T2-w MRI (employing wavelet texture features) classifier (μ = 0.55± 0.02), (ii) a MRS (employing metabolite ratios) classifier (μ= 0.77 ± 0.03), (iii) a decision-fusion classifier, obtained by combining individual T2-w MRI and MRS classifier outputs (μ = 0.85 ± 0.03) and (iv) a data combination scheme involving combination of metabolic MRS and MR signal intensity features (μ = 0.66± 0.02). Conclusion A novel data integration framework, MaWERiC, for combining imaging and non-imaging MRI channels was presented. Application to prostate cancer detection via combination of T2-w MRI and MRS data demonstrated significantly higher AUC and accuracy values compared to the individual T2-w MRI, MRS modalities and other data integration strategies. PMID:21960175

Using remote sensing and GIS techniques to estimate discharge and recharge. fluxes for the Death Valley regional groundwater flow system, USA

USGS Publications Warehouse

D'Agnese, F. A.; Faunt, C.C.; Keith, Turner A.

1996-01-01

The recharge and discharge components of the Death Valley regional groundwater flow system were defined by remote sensing and GIS techniques that integrated disparate data types to develop a spatially complex representation of near-surface hydrological processes. Image classification methods were applied to multispectral satellite data to produce a vegetation map. This map provided a basis for subsequent evapotranspiration and infiltration estimations. The vegetation map was combined with ancillary data in a GIS to delineate different types of wetlands, phreatophytes and wet playa areas. Existing evapotranspiration-rate estimates were then used to calculate discharge volumes for these areas. A previously used empirical method of groundwater recharge estimation was modified by GIS methods to incorporate data describing soil-moisture conditions, and a recharge potential map was produced. These discharge and recharge maps were readily converted to data arrays for numerical modelling codes. Inverse parameter estimation techniques also used these data to evaluate the reliability and sensitivity of estimated values.

Development and applications of two computational procedures for determining the vibration modes of structural systems. [aircraft structures - aerospaceplanes

NASA Technical Reports Server (NTRS)

Kvaternik, R. G.

1975-01-01

Two computational procedures for analyzing complex structural systems for their natural modes and frequencies of vibration are presented. Both procedures are based on a substructures methodology and both employ the finite-element stiffness method to model the constituent substructures. The first procedure is a direct method based on solving the eigenvalue problem associated with a finite-element representation of the complete structure. The second procedure is a component-mode synthesis scheme in which the vibration modes of the complete structure are synthesized from modes of substructures into which the structure is divided. The analytical basis of the methods contains a combination of features which enhance the generality of the procedures. The computational procedures exhibit a unique utilitarian character with respect to the versatility, computational convenience, and ease of computer implementation. The computational procedures were implemented in two special-purpose computer programs. The results of the application of these programs to several structural configurations are shown and comparisons are made with experiment.

Dual RBFNNs-Based Model-Free Adaptive Control With Aspen HYSYS Simulation.

PubMed

Zhu, Yuanming; Hou, Zhongsheng; Qian, Feng; Du, Wenli

2017-03-01

In this brief, we propose a new data-driven model-free adaptive control (MFAC) method with dual radial basis function neural networks (RBFNNs) for a class of discrete-time nonlinear systems. The main novelty lies in that it provides a systematic design method for controller structure by the direct usage of I/O data, rather than using the first-principle model or offline identified plant model. The controller structure is determined by equivalent-dynamic-linearization representation of the ideal nonlinear controller, and the controller parameters are tuned by the pseudogradient information extracted from the I/O data of the plant, which can deal with the unknown nonlinear system. The stability of the closed-loop control system and the stability of the training process for RBFNNs are guaranteed by rigorous theoretical analysis. Meanwhile, the effectiveness and the applicability of the proposed method are further demonstrated by the numerical example and Aspen HYSYS simulation of distillation column in crude styrene produce process.

Equations of motion for a spectrum-generating algebra: Lipkin Meshkov Glick model

NASA Astrophysics Data System (ADS)

Rosensteel, G.; Rowe, D. J.; Ho, S. Y.

2008-01-01

For a spectrum-generating Lie algebra, a generalized equations-of-motion scheme determines numerical values of excitation energies and algebra matrix elements. In the approach to the infinite particle number limit or, more generally, whenever the dimension of the quantum state space is very large, the equations-of-motion method may achieve results that are impractical to obtain by diagonalization of the Hamiltonian matrix. To test the method's effectiveness, we apply it to the well-known Lipkin-Meshkov-Glick (LMG) model to find its low-energy spectrum and associated generator matrix elements in the eigenenergy basis. When the dimension of the LMG representation space is 106, computation time on a notebook computer is a few minutes. For a large particle number in the LMG model, the low-energy spectrum makes a quantum phase transition from a nondegenerate harmonic vibrator to a twofold degenerate harmonic oscillator. The equations-of-motion method computes critical exponents at the transition point.

Representation and Reconconstruction of Triangular Irregular Networks with Vertical Walls

NASA Astrophysics Data System (ADS)

Gorte, B.; Lesparre, J.

2012-06-01

Point clouds obtained by aerial laser scanning are a convenient input source for high resolution 2.5d elevation models, such as the Dutch AHN-2. More challenging is the fully automatic reconstruction of 3d city models. An actual demand for a combined 2.5d terrain and 3d city model for an urban hydrology application led to the design of an extension to the well-known Delaunay triangulated irregular networks (TINs) as to accommodate vertical walls. In addition we introduce methods to generate and refine models adhering to our data structure. These are based on combining two approaches: a representation of the TIN using stars of vertices and triangles, together with segmenting the TIN on the basis of coplanarity of adjacent triangles. The approach is supposed to deliver the complete model including walls at the correct locations, without relying on additional map data, as these often lack completeness, actuality and accuracy, and moreover most of the time do not account for parts facades not going down to street level. However, automatic detection of height discontinuities to obtain the exact location of the walls is currently still under implementation.

Global Neural Pattern Similarity as a Common Basis for Categorization and Recognition Memory

PubMed Central

Xue, Gui; Love, Bradley C.; Preston, Alison R.; Poldrack, Russell A.

2014-01-01

Familiarity, or memory strength, is a central construct in models of cognition. In previous categorization and long-term memory research, correlations have been found between psychological measures of memory strength and activation in the medial temporal lobes (MTLs), which suggests a common neural locus for memory strength. However, activation alone is insufficient for determining whether the same mechanisms underlie neural function across domains. Guided by mathematical models of categorization and long-term memory, we develop a theory and a method to test whether memory strength arises from the global similarity among neural representations. In human subjects, we find significant correlations between global similarity among activation patterns in the MTLs and both subsequent memory confidence in a recognition memory task and model-based measures of memory strength in a category learning task. Our work bridges formal cognitive theories and neuroscientific models by illustrating that the same global similarity computations underlie processing in multiple cognitive domains. Moreover, by establishing a link between neural similarity and psychological memory strength, our findings suggest that there may be an isomorphism between psychological and neural representational spaces that can be exploited to test cognitive theories at both the neural and behavioral levels. PMID:24872552

A web-based system architecture for ontology-based data integration in the domain of IT benchmarking

NASA Astrophysics Data System (ADS)

Pfaff, Matthias; Krcmar, Helmut

2018-03-01

In the domain of IT benchmarking (ITBM), a variety of data and information are collected. Although these data serve as the basis for business analyses, no unified semantic representation of such data yet exists. Consequently, data analysis across different distributed data sets and different benchmarks is almost impossible. This paper presents a system architecture and prototypical implementation for an integrated data management of distributed databases based on a domain-specific ontology. To preserve the semantic meaning of the data, the ITBM ontology is linked to data sources and functions as the central concept for database access. Thus, additional databases can be integrated by linking them to this domain-specific ontology and are directly available for further business analyses. Moreover, the web-based system supports the process of mapping ontology concepts to external databases by introducing a semi-automatic mapping recommender and by visualizing possible mapping candidates. The system also provides a natural language interface to easily query linked databases. The expected result of this ontology-based approach of knowledge representation and data access is an increase in knowledge and data sharing in this domain, which will enhance existing business analysis methods.

Squeezing, Striking, and Vocalizing: Is Number Representation Fundamentally Spatial?

ERIC Educational Resources Information Center

Nunez, Rafael; Doan, D.; Nikoulina, Anastasia

2011-01-01

Numbers are fundamental entities in mathematics, but their cognitive bases are unclear. Abundant research points to linear space as a natural grounding for number representation. But, is number representation fundamentally spatial? We disentangle number representation from standard number-to-line reporting methods, and compare numerical…

A Novel Locally Linear KNN Method With Applications to Visual Recognition.

PubMed

Liu, Qingfeng; Liu, Chengjun

2017-09-01

A locally linear K Nearest Neighbor (LLK) method is presented in this paper with applications to robust visual recognition. Specifically, the concept of an ideal representation is first presented, which improves upon the traditional sparse representation in many ways. The objective function based on a host of criteria for sparsity, locality, and reconstruction is then optimized to derive a novel representation, which is an approximation to the ideal representation. The novel representation is further processed by two classifiers, namely, an LLK-based classifier and a locally linear nearest mean-based classifier, for visual recognition. The proposed classifiers are shown to connect to the Bayes decision rule for minimum error. Additional new theoretical analysis is presented, such as the nonnegative constraint, the group regularization, and the computational efficiency of the proposed LLK method. New methods such as a shifted power transformation for improving reliability, a coefficients' truncating method for enhancing generalization, and an improved marginal Fisher analysis method for feature extraction are proposed to further improve visual recognition performance. Extensive experiments are implemented to evaluate the proposed LLK method for robust visual recognition. In particular, eight representative data sets are applied for assessing the performance of the LLK method for various visual recognition applications, such as action recognition, scene recognition, object recognition, and face recognition.

The Neuroscience of Group Membership

ERIC Educational Resources Information Center

Morrison, Samantha; Decety, Jean; Molenberghs, Pascal

2012-01-01

The present study aimed to uncover the neural activity associated with specific in-group and out-group word related stimuli, to examine the neuroanatomical basis of group membership concept representation, and investigate to what extent neural processes represent "in-group" differently from "out-group". Participants' brain activity was measured…

Querying Proofs (Work in Progress)

NASA Technical Reports Server (NTRS)

Aspinall, David; Denney, Ewen; Lueth, Christoph

2011-01-01

We motivate and introduce the basis for a query language designed for inspecting electronic representations of proofs. We argue that there is much to learn from large proofs beyond their validity, and that a dedicated query language can provide a principled way of implementing a family of useful operations.

Self-Taught Learning Based on Sparse Autoencoder for E-Nose in Wound Infection Detection

PubMed Central

He, Peilin; Jia, Pengfei; Qiao, Siqi; Duan, Shukai

2017-01-01

For an electronic nose (E-nose) in wound infection distinguishing, traditional learning methods have always needed large quantities of labeled wound infection samples, which are both limited and expensive; thus, we introduce self-taught learning combined with sparse autoencoder and radial basis function (RBF) into the field. Self-taught learning is a kind of transfer learning that can transfer knowledge from other fields to target fields, can solve such problems that labeled data (target fields) and unlabeled data (other fields) do not share the same class labels, even if they are from entirely different distribution. In our paper, we obtain numerous cheap unlabeled pollutant gas samples (benzene, formaldehyde, acetone and ethylalcohol); however, labeled wound infection samples are hard to gain. Thus, we pose self-taught learning to utilize these gas samples, obtaining a basis vector θ. Then, using the basis vector θ, we reconstruct the new representation of wound infection samples under sparsity constraint, which is the input of classifiers. We compare RBF with partial least squares discriminant analysis (PLSDA), and reach a conclusion that the performance of RBF is superior to others. We also change the dimension of our data set and the quantity of unlabeled data to search the input matrix that produces the highest accuracy. PMID:28991154

Advances in visual representation of molecular potentials.

PubMed

Du, Qi-Shi; Huang, Ri-Bo; Chou, Kuo-Chen

2010-06-01

The recent advances in visual representations of molecular properties in 3D space are summarized, and their applications in molecular modeling study and rational drug design are introduced. The visual representation methods provide us with detailed insights into protein-ligand interactions, and hence can play a major role in elucidating the structure or reactivity of a biomolecular system. Three newly developed computation and visualization methods for studying the physical and chemical properties of molecules are introduced, including their electrostatic potential, lipophilicity potential and excess chemical potential. The newest application examples of visual representations in structure-based rational drug are presented. The 3D electrostatic potentials, calculated using the empirical method (EM-ESP), in which the classical Coulomb equation and traditional atomic partial changes are discarded, are highly consistent with the results by the higher level quantum chemical method. The 3D lipophilicity potentials, computed by the heuristic molecular lipophilicity potential method based on the principles of quantum mechanics and statistical mechanics, are more accurate and reliable than those by using the traditional empirical methods. The 3D excess chemical potentials, derived by the reference interaction site model-hypernetted chain theory, provide a new tool for computational chemistry and molecular modeling. For structure-based drug design, the visual representations of molecular properties will play a significant role in practical applications. It is anticipated that the new advances in computational chemistry will stimulate the development of molecular modeling methods, further enriching the visual representation techniques for rational drug design, as well as other relevant fields in life science.

Multi-channel EEG-based sleep stage classification with joint collaborative representation and multiple kernel learning.

PubMed

Shi, Jun; Liu, Xiao; Li, Yan; Zhang, Qi; Li, Yingjie; Ying, Shihui

2015-10-30

Electroencephalography (EEG) based sleep staging is commonly used in clinical routine. Feature extraction and representation plays a crucial role in EEG-based automatic classification of sleep stages. Sparse representation (SR) is a state-of-the-art unsupervised feature learning method suitable for EEG feature representation. Collaborative representation (CR) is an effective data coding method used as a classifier. Here we use CR as a data representation method to learn features from the EEG signal. A joint collaboration model is established to develop a multi-view learning algorithm, and generate joint CR (JCR) codes to fuse and represent multi-channel EEG signals. A two-stage multi-view learning-based sleep staging framework is then constructed, in which JCR and joint sparse representation (JSR) algorithms first fuse and learning the feature representation from multi-channel EEG signals, respectively. Multi-view JCR and JSR features are then integrated and sleep stages recognized by a multiple kernel extreme learning machine (MK-ELM) algorithm with grid search. The proposed two-stage multi-view learning algorithm achieves superior performance for sleep staging. With a K-means clustering based dictionary, the mean classification accuracy, sensitivity and specificity are 81.10 ± 0.15%, 71.42 ± 0.66% and 94.57 ± 0.07%, respectively; while with the dictionary learned using the submodular optimization method, they are 80.29 ± 0.22%, 71.26 ± 0.78% and 94.38 ± 0.10%, respectively. The two-stage multi-view learning based sleep staging framework outperforms all other classification methods compared in this work, while JCR is superior to JSR. The proposed multi-view learning framework has the potential for sleep staging based on multi-channel or multi-modality polysomnography signals. Copyright © 2015 Elsevier B.V. All rights reserved.

Spectral methods in edge-diffraction theories

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

Arnold, J.M.

Spectral methods for the construction of uniform asymptotic representations of the field diffracted by an aperture in a plane screen are reviewed. These are separated into contrasting approaches, roughly described as physical and geometrical. It is concluded that the geometrical methods provide a direct route to the construction of uniform representations that are formally identical to the equivalent-edge-current concept. Some interpretive and analytical difficulties that complicate the physical methods of obtaining uniform representations are analyzed. Spectral synthesis proceeds directly from the ray geometry and diffraction coefficients, without any intervening current representation, and the representation is uniform at shadow boundaries andmore » caustics of the diffracted field. The physical theory of diffraction postulates currents on the diffracting screen that give rise to the diffracted field. The difficulties encountered in evaluating the current integrals are throughly examined, and it is concluded that the additional data provided by the physical theory of diffraction (diffraction coefficients off the Keller diffraction cone) are not actually required for obtaining uniform asymptotics at the leading order. A new diffraction representation that generalizes to arbitrary plane-convex apertures a formula given by Knott and Senior [Proc. IEEE 62, 1468 (1974)] for circular apertures is deduced. 34 refs., 1 fig.« less

Medical Image Fusion Based on Feature Extraction and Sparse Representation

PubMed Central

Wei, Gao; Zongxi, Song

2017-01-01

As a novel multiscale geometric analysis tool, sparse representation has shown many advantages over the conventional image representation methods. However, the standard sparse representation does not take intrinsic structure and its time complexity into consideration. In this paper, a new fusion mechanism for multimodal medical images based on sparse representation and decision map is proposed to deal with these problems simultaneously. Three decision maps are designed including structure information map (SM) and energy information map (EM) as well as structure and energy map (SEM) to make the results reserve more energy and edge information. SM contains the local structure feature captured by the Laplacian of a Gaussian (LOG) and EM contains the energy and energy distribution feature detected by the mean square deviation. The decision map is added to the normal sparse representation based method to improve the speed of the algorithm. Proposed approach also improves the quality of the fused results by enhancing the contrast and reserving more structure and energy information from the source images. The experiment results of 36 groups of CT/MR, MR-T1/MR-T2, and CT/PET images demonstrate that the method based on SR and SEM outperforms five state-of-the-art methods. PMID:28321246

Menu driven heat treatment control of thin walled bodies

DOEpatents

Kothmann, Richard E.; Booth, Jr., Russell R.; Grimm, Noel P.; Batenburg, Abram; Thomas, Vaughn M.

1992-01-01

A process for controlling the heating of a thin-walled body according to a predetermined temperature program by means of electrically controllable heaters, comprising: disposing the heaters adjacent one surface of the body such that each heater is in facing relation with a respective zone of the surface; supplying heat-generating power to each heater and monitoring the temperature at each surface zone; and for each zone: deriving (16,18,20), on the basis of the temperature values obtained in the monitoring step, estimated temperature values of the surface at successive time intervals each having a first selected duration; generating (28), on the basis of the estimated temperature values derived in each time interval, representations of the temperature, THSIFUT, which each surface zone will have, based on the level of power presently supplied to each heater, at a future time which is separated from the present time interval by a second selected duration; determining (30) the difference between THSIFUT and the desired temperature, FUTREFTVZL, at the future time which is separated from the present time interval by the second selected duration; providing (52) a representation indicating the power level which sould be supplied to each heater in order to reduce the difference obtained in the determining step; and adjusting the power level supplied to each heater by the supplying step in response to the value of the representation provided in the providing step.

Learning viewpoint invariant perceptual representations from cluttered images.

PubMed

Spratling, Michael W

2005-05-01

In order to perform object recognition, it is necessary to form perceptual representations that are sufficiently specific to distinguish between objects, but that are also sufficiently flexible to generalize across changes in location, rotation, and scale. A standard method for learning perceptual representations that are invariant to viewpoint is to form temporal associations across image sequences showing object transformations. However, this method requires that individual stimuli be presented in isolation and is therefore unlikely to succeed in real-world applications where multiple objects can co-occur in the visual input. This paper proposes a simple modification to the learning method that can overcome this limitation and results in more robust learning of invariant representations.

Automated Classification of Medical Percussion Signals for the Diagnosis of Pulmonary Injuries

NASA Astrophysics Data System (ADS)

Bhuiyan, Md Moinuddin

Used for centuries in the clinical practice, audible percussion is a method of eliciting sounds by areas of the human body either by finger tips or by a percussion hammer. Despite its advantages, pulmonary diagnostics by percussion is still highly subjective, depends on the physician's skills, and requires quiet surroundings. Automation of this well-established technique could help amplify its existing merits while removing the above drawbacks. In this study, an attempt is made to automatically decompose clinical percussion signals into a sum of Exponentially Damped Sinusoids (EDS) using Matrix Pencil Method, which in this case form a more natural basis than Fourier harmonics and thus allow for a more robust representation of the signal in the parametric space. It is found that some EDS represent transient oscillation modes of the thorax/abdomen excited by the percussion event, while others are associated with the noise. It is demonstrated that relatively few EDS are usually enough to accurately reconstruct the original signal. It is shown that combining the frequency and damping parameters of these most significant EDS allows for efficient classification of percussion signals into the two main types historically known as "resonant" and "tympanic". This classification ability can provide a basis for the automated objective diagnostics of various pulmonary pathologies including pneumothorax.

Fast and accurate grid representations for atom-based docking with partner flexibility.

PubMed

de Vries, Sjoerd J; Zacharias, Martin

2017-06-30

Macromolecular docking methods can broadly be divided into geometric and atom-based methods. Geometric methods use fast algorithms that operate on simplified, grid-like molecular representations, while atom-based methods are more realistic and flexible, but far less efficient. Here, a hybrid approach of grid-based and atom-based docking is presented, combining precalculated grid potentials with neighbor lists for fast and accurate calculation of atom-based intermolecular energies and forces. The grid representation is compatible with simultaneous multibody docking and can tolerate considerable protein flexibility. When implemented in our docking method ATTRACT, grid-based docking was found to be ∼35x faster. With the OPLSX forcefield instead of the ATTRACT coarse-grained forcefield, the average speed improvement was >100x. Grid-based representations may allow atom-based docking methods to explore large conformational spaces with many degrees of freedom, such as multiple macromolecules including flexibility. This increases the domain of biological problems to which docking methods can be applied. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Unitary Transformations in the Quantum Model for Conceptual Conjunctions and Its Application to Data Representation

PubMed Central

Veloz, Tomas; Desjardins, Sylvie

2015-01-01

Quantum models of concept combinations have been successful in representing various experimental situations that cannot be accommodated by traditional models based on classical probability or fuzzy set theory. In many cases, the focus has been on producing a representation that fits experimental results to validate quantum models. However, these representations are not always consistent with the cognitive modeling principles. Moreover, some important issues related to the representation of concepts such as the dimensionality of the realization space, the uniqueness of solutions, and the compatibility of measurements, have been overlooked. In this paper, we provide a dimensional analysis of the realization space for the two-sector Fock space model for conjunction of concepts focusing on the first and second sectors separately. We then introduce various representation of concepts that arise from the use of unitary operators in the realization space. In these concrete representations, a pair of concepts and their combination are modeled by a single conceptual state, and by a collection of exemplar-dependent operators. Therefore, they are consistent with cognitive modeling principles. This framework not only provides a uniform approach to model an entire data set, but, because all measurement operators are expressed in the same basis, allows us to address the question of compatibility of measurements. In particular, we present evidence that it may be possible to predict non-commutative effects from partial measurements of conceptual combinations. PMID:26617556

Unitary Transformations in the Quantum Model for Conceptual Conjunctions and Its Application to Data Representation.

PubMed

Veloz, Tomas; Desjardins, Sylvie

2015-01-01

Quantum models of concept combinations have been successful in representing various experimental situations that cannot be accommodated by traditional models based on classical probability or fuzzy set theory. In many cases, the focus has been on producing a representation that fits experimental results to validate quantum models. However, these representations are not always consistent with the cognitive modeling principles. Moreover, some important issues related to the representation of concepts such as the dimensionality of the realization space, the uniqueness of solutions, and the compatibility of measurements, have been overlooked. In this paper, we provide a dimensional analysis of the realization space for the two-sector Fock space model for conjunction of concepts focusing on the first and second sectors separately. We then introduce various representation of concepts that arise from the use of unitary operators in the realization space. In these concrete representations, a pair of concepts and their combination are modeled by a single conceptual state, and by a collection of exemplar-dependent operators. Therefore, they are consistent with cognitive modeling principles. This framework not only provides a uniform approach to model an entire data set, but, because all measurement operators are expressed in the same basis, allows us to address the question of compatibility of measurements. In particular, we present evidence that it may be possible to predict non-commutative effects from partial measurements of conceptual combinations.

Hybrid image representation learning model with invariant features for basal cell carcinoma detection

NASA Astrophysics Data System (ADS)

Arevalo, John; Cruz-Roa, Angel; González, Fabio A.

2013-11-01

This paper presents a novel method for basal-cell carcinoma detection, which combines state-of-the-art methods for unsupervised feature learning (UFL) and bag of features (BOF) representation. BOF, which is a form of representation learning, has shown a good performance in automatic histopathology image classi cation. In BOF, patches are usually represented using descriptors such as SIFT and DCT. We propose to use UFL to learn the patch representation itself. This is accomplished by applying a topographic UFL method (T-RICA), which automatically learns visual invariance properties of color, scale and rotation from an image collection. These learned features also reveals these visual properties associated to cancerous and healthy tissues and improves carcinoma detection results by 7% with respect to traditional autoencoders, and 6% with respect to standard DCT representations obtaining in average 92% in terms of F-score and 93% of balanced accuracy.

Exploiting salient semantic analysis for information retrieval

NASA Astrophysics Data System (ADS)

Luo, Jing; Meng, Bo; Quan, Changqin; Tu, Xinhui

2016-11-01

Recently, many Wikipedia-based methods have been proposed to improve the performance of different natural language processing (NLP) tasks, such as semantic relatedness computation, text classification and information retrieval. Among these methods, salient semantic analysis (SSA) has been proven to be an effective way to generate conceptual representation for words or documents. However, its feasibility and effectiveness in information retrieval is mostly unknown. In this paper, we study how to efficiently use SSA to improve the information retrieval performance, and propose a SSA-based retrieval method under the language model framework. First, SSA model is adopted to build conceptual representations for documents and queries. Then, these conceptual representations and the bag-of-words (BOW) representations can be used in combination to estimate the language models of queries and documents. The proposed method is evaluated on several standard text retrieval conference (TREC) collections. Experiment results on standard TREC collections show the proposed models consistently outperform the existing Wikipedia-based retrieval methods.

Multilayer Extreme Learning Machine With Subnetwork Nodes for Representation Learning.

PubMed

Yang, Yimin; Wu, Q M Jonathan

2016-11-01

The extreme learning machine (ELM), which was originally proposed for "generalized" single-hidden layer feedforward neural networks, provides efficient unified learning solutions for the applications of clustering, regression, and classification. It presents competitive accuracy with superb efficiency in many applications. However, ELM with subnetwork nodes architecture has not attracted much research attentions. Recently, many methods have been proposed for supervised/unsupervised dimension reduction or representation learning, but these methods normally only work for one type of problem. This paper studies the general architecture of multilayer ELM (ML-ELM) with subnetwork nodes, showing that: 1) the proposed method provides a representation learning platform with unsupervised/supervised and compressed/sparse representation learning and 2) experimental results on ten image datasets and 16 classification datasets show that, compared to other conventional feature learning methods, the proposed ML-ELM with subnetwork nodes performs competitively or much better than other feature learning methods.

Aorta modeling with the element-based zero-stress state and isogeometric discretization

NASA Astrophysics Data System (ADS)

Takizawa, Kenji; Tezduyar, Tayfun E.; Sasaki, Takafumi

2017-02-01

Patient-specific arterial fluid-structure interaction computations, including aorta computations, require an estimation of the zero-stress state (ZSS), because the image-based arterial geometries do not come from a ZSS. We have earlier introduced a method for estimation of the element-based ZSS (EBZSS) in the context of finite element discretization of the arterial wall. The method has three main components. 1. An iterative method, which starts with a calculated initial guess, is used for computing the EBZSS such that when a given pressure load is applied, the image-based target shape is matched. 2. A method for straight-tube segments is used for computing the EBZSS so that we match the given diameter and longitudinal stretch in the target configuration and the "opening angle." 3. An element-based mapping between the artery and straight-tube is extracted from the mapping between the artery and straight-tube segments. This provides the mapping from the arterial configuration to the straight-tube configuration, and from the estimated EBZSS of the straight-tube configuration back to the arterial configuration, to be used as the initial guess for the iterative method that matches the image-based target shape. Here we present the version of the EBZSS estimation method with isogeometric wall discretization. With isogeometric discretization, we can obtain the element-based mapping directly, instead of extracting it from the mapping between the artery and straight-tube segments. That is because all we need for the element-based mapping, including the curvatures, can be obtained within an element. With NURBS basis functions, we may be able to achieve a similar level of accuracy as with the linear basis functions, but using larger-size and much fewer elements. Higher-order NURBS basis functions allow representation of more complex shapes within an element. To show how the new EBZSS estimation method performs, we first present 2D test computations with straight-tube configurations. Then we show how the method can be used in a 3D computation where the target geometry is coming from medical image of a human aorta.

Leveraging multiple gene networks to prioritize GWAS candidate genes via network representation learning.

PubMed

Wu, Mengmeng; Zeng, Wanwen; Liu, Wenqiang; Lv, Hairong; Chen, Ting; Jiang, Rui

2018-06-03

Genome-wide association studies (GWAS) have successfully discovered a number of disease-associated genetic variants in the past decade, providing an unprecedented opportunity for deciphering genetic basis of human inherited diseases. However, it is still a challenging task to extract biological knowledge from the GWAS data, due to such issues as missing heritability and weak interpretability. Indeed, the fact that the majority of discovered loci fall into noncoding regions without clear links to genes has been preventing the characterization of their functions and appealing for a sophisticated approach to bridge genetic and genomic studies. Towards this problem, network-based prioritization of candidate genes, which performs integrated analysis of gene networks with GWAS data, has emerged as a promising direction and attracted much attention. However, most existing methods overlook the sparse and noisy properties of gene networks and thus may lead to suboptimal performance. Motivated by this understanding, we proposed a novel method called REGENT for integrating multiple gene networks with GWAS data to prioritize candidate genes for complex diseases. We leveraged a technique called the network representation learning to embed a gene network into a compact and robust feature space, and then designed a hierarchical statistical model to integrate features of multiple gene networks with GWAS data for the effective inference of genes associated with a disease of interest. We applied our method to six complex diseases and demonstrated the superior performance of REGENT over existing approaches in recovering known disease-associated genes. We further conducted a pathway analysis and showed that the ability of REGENT to discover disease-associated pathways. We expect to see applications of our method to a broad spectrum of diseases for post-GWAS analysis. REGENT is freely available at https://github.com/wmmthu/REGENT. Copyright © 2018 Elsevier Inc. All rights reserved.

Modeling Seismic Anisotropy From the Top to the Bottom of the Mantle

NASA Astrophysics Data System (ADS)

Ribe, N. M.; Castelnau, O.

2011-12-01

Understanding the origin of seismic anisotropy in the mantle requires quantifying the link between the strain history experienced by a rock and the evolving orientation distribution of its constituent crystals (`crystal preferred orientation' or CPO). The fundamental quantity of interest in any model of CPO is the vector spin ω(g, d) of the crystallographic axes of each crystal, which depends on the crystal's orientation g and on the velocity gradient tensor d of the aggregate-scale deformation. Existing methods for determining ω(g, d) rely on unwieldy discrete representations of the crystal orientation distribution in terms of 103-104 individual grains. We propose a new method based on (1) an analytical expression for ω(g, d) and (2) a representation of CPO in terms of a small number (N≤4) of continuous functions of g (`structured basis functions' or SBFs) each of which satisfies the hyperbolic partial differential equation governing the evolution of CPO when only a single slip system is active. The SBFs are then combined via an appropriate weighting scheme to represent a realistic CPO produced by the simultaneous activity of several slip systems.The approach yields a set of N coupled ordinary differential equations for the temporal evolution of the coefficients of the SBFs, which can be solved numerically for an arbitrary strain history at a computational cost ≈10-6 that of homogenization methods such as VPSC. Example calculations will be shown for model mineralogies and strain histories appropriate for the uppermost and lowermost mantles.

Application of Radial Basis Functional Link Networks to Exploration for Proterozoic Mineral Deposits in Central Iran

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

Behnia, Pouran

2007-06-15

The metallogeny of Central Iran is characterized mainly by the presence of several iron, apatite, and uranium deposits of Proterozoic age. Radial Basis Function Link Networks (RBFLN) were used as a data-driven method for GIS-based predictive mapping of Proterozoic mineralization in this area. To generate the input data for RBFLN, the evidential maps comprising stratigraphic, structural, geophysical, and geochemical data were used. Fifty-eight deposits and 58 'nondeposits' were used to train the network. The operations for the application of neural networks employed in this study involve both multiclass and binary representation of evidential maps. Running RBFLN on different input datamore » showed that an increase in the number of evidential maps and classes leads to a larger classification sum of squared error (SSE). As a whole, an increase in the number of iterations resulted in the improvement of training SSE. The results of applying RBFLN showed that a successful classification depends on the existence of spatially well distributed deposits and nondeposits throughout the study area.« less

Spatial Bayesian Latent Factor Regression Modeling of Coordinate-based Meta-analysis Data

PubMed Central

Montagna, Silvia; Wager, Tor; Barrett, Lisa Feldman; Johnson, Timothy D.; Nichols, Thomas E.

2017-01-01

Summary Now over 20 years old, functional MRI (fMRI) has a large and growing literature that is best synthesised with meta-analytic tools. As most authors do not share image data, only the peak activation coordinates (foci) reported in the paper are available for Coordinate-Based Meta-Analysis (CBMA). Neuroimaging meta-analysis is used to 1) identify areas of consistent activation; and 2) build a predictive model of task type or cognitive process for new studies (reverse inference). To simultaneously address these aims, we propose a Bayesian point process hierarchical model for CBMA. We model the foci from each study as a doubly stochastic Poisson process, where the study-specific log intensity function is characterised as a linear combination of a high-dimensional basis set. A sparse representation of the intensities is guaranteed through latent factor modeling of the basis coefficients. Within our framework, it is also possible to account for the effect of study-level covariates (meta-regression), significantly expanding the capabilities of the current neuroimaging meta-analysis methods available. We apply our methodology to synthetic data and neuroimaging meta-analysis datasets. PMID:28498564

Public Relations & the Law.

ERIC Educational Resources Information Center

Walsh, Frank

This monograph synthesizes the laws and regulations that form the basis of the right to representation in the court of public opinion by all who would seek to influence public and private decisions. It expresses the framework of human and social values that underlie this constitutional freedom and that give public relations and other management…

12 CFR 1010.116 - Additional information.

Code of Federal Regulations, 2014 CFR

2014-01-01

..., sex, national origin, familial status, or handicap is: (1) Refusing to sell or lease lots after the... of 1968 by not directly or indirectly discriminating on the basis of race, color, religion, sex... attempting to induce any person to sell or lease any lot by representations regarding the entry or non-entry...

12 CFR 1010.116 - Additional information.

Code of Federal Regulations, 2012 CFR

2012-01-01

..., sex, national origin, familial status, or handicap is: (1) Refusing to sell or lease lots after the... of 1968 by not directly or indirectly discriminating on the basis of race, color, religion, sex... attempting to induce any person to sell or lease any lot by representations regarding the entry or non-entry...

12 CFR 1010.116 - Additional information.

Code of Federal Regulations, 2013 CFR

2013-01-01

..., sex, national origin, familial status, or handicap is: (1) Refusing to sell or lease lots after the... of 1968 by not directly or indirectly discriminating on the basis of race, color, religion, sex... attempting to induce any person to sell or lease any lot by representations regarding the entry or non-entry...

Executive Control in Bilingual Language Processing

ERIC Educational Resources Information Center

Rodriguez-Fornells, A.; Balaguer, R. De Deigo; Munte, T. F.

2006-01-01

Little is known in cognitive neuroscience about the brain mechanisms and brain representations involved in bilingual language processing. On the basis of previous studies on switching and bilingualism, it has been proposed that executive functions are engaged in the control and regulation of the languages in use. Here, we review the existing…

Fractional models of seismoacoustic and electromagnetic activity

NASA Astrophysics Data System (ADS)

Shevtsov, Boris; Sheremetyeva, Olga

2017-10-01

Statistical models of the seismoacoustic and electromagnetic activity caused by deformation disturbances are considered on the basis of compound Poisson process and its fractional generalizations. Wave representations of these processes are used too. It is discussed five regimes of deformation activity and their role in understanding of the earthquakes precursors nature.

32 CFR 716.9 - Erroneous payment.

Code of Federal Regulations, 2010 CFR

2010-07-01

... payment of the death gratuity has been made to an individual on the basis of representations of record... Defense Department of Defense (Continued) DEPARTMENT OF THE NAVY PERSONNEL DEATH GRATUITY Provisions... of fact or law, payment of the death gratuity is made to a person clearly not entitled thereto, and...

A Critical Review of Qualitative Interviews in Applied Linguistics

ERIC Educational Resources Information Center

Mann, Steve

2011-01-01

This article asks what applied linguistics can learn from related disciplines with regard to the collection, analysis and representation of qualitative interviews. It assesses the contributions of qualitative sociology, anthropology, discursive psychology and outlines four "discourse dilemmas" which might provide the basis for a more critical and…

Covariant harmonic oscillators: 1973 revisited

NASA Technical Reports Server (NTRS)

Noz, M. E.

1993-01-01

Using the relativistic harmonic oscillator, a physical basis is given to the phenomenological wave function of Yukawa which is covariant and normalizable. It is shown that this wave function can be interpreted in terms of the unitary irreducible representations of the Poincare group. The transformation properties of these covariant wave functions are also demonstrated.

19 CFR 210.13 - The response.

Code of Federal Regulations, 2012 CFR

2012-04-01

... to the process under which such article was produced; (2) Drawings, photographs, or other visual..., photographs, or other visual representations, should be labeled so that they can be read in conjunction with... unenforceable, the basis for such assertion, including, when prior art is relied on, a showing of how the prior...

The Media: Views and Perceptions of Black Families.

ERIC Educational Resources Information Center

Gill, Walter Arthur

This essay explores cultural differences in pictorial perception, cites historical developments and relationships of the media and the black family, and provides a basis for using educational media to effect positive self-concepts within the black family. The interpretation of representations of blacks in films, television, radio, recordings,…

Research on a Frame-Based Model of Reading Comprehension. Final Report.

ERIC Educational Resources Information Center

Goldstein, Ira

This report summarizes computational investigations of language comprehension based on Marvin Minsky's theory of frames, a recent advance in artifical intelligence theories about the representation of knowledge. The investigations discussed explored frame theory as a basis for text comprehension by implementing models of the theory and developing…

Metaphor, Simile, Analogy and the Brain

ERIC Educational Resources Information Center

Riddell, Patricia

2016-01-01

Fox argues that the poetic function of language fulfils the human need to symbolise. Metaphor, simile and analogy provide examples of the ways in which symbolic language can be used creatively. The neural representations of these processes therefore provide a means to determine the neurological basis of creative language. Neuro-imaging has…

Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation

NASA Astrophysics Data System (ADS)

Benner, Peter; Dolgov, Sergey; Khoromskaia, Venera; Khoromskij, Boris N.

2017-04-01

In this paper, we propose and study two approaches to approximate the solution of the Bethe-Salpeter equation (BSE) by using structured iterative eigenvalue solvers. Both approaches are based on the reduced basis method and low-rank factorizations of the generating matrices. We also propose to represent the static screen interaction part in the BSE matrix by a small active sub-block, with a size balancing the storage for rank-structured representations of other matrix blocks. We demonstrate by various numerical tests that the combination of the diagonal plus low-rank plus reduced-block approximation exhibits higher precision with low numerical cost, providing as well a distinct two-sided error estimate for the smallest eigenvalues of the Bethe-Salpeter operator. The complexity is reduced to O (Nb2) in the size of the atomic orbitals basis set, Nb, instead of the practically intractable O (Nb6) scaling for the direct diagonalization. In the second approach, we apply the quantized-TT (QTT) tensor representation to both, the long eigenvectors and the column vectors in the rank-structured BSE matrix blocks, and combine this with the ALS-type iteration in block QTT format. The QTT-rank of the matrix entities possesses almost the same magnitude as the number of occupied orbitals in the molecular systems, No

General methodology for simultaneous representation and discrimination of multiple object classes

NASA Astrophysics Data System (ADS)

Talukder, Ashit; Casasent, David P.

1998-03-01

We address a new general method for linear and nonlinear feature extraction for simultaneous representation and classification. We call this approach the maximum representation and discrimination feature (MRDF) method. We develop a novel nonlinear eigenfeature extraction technique to represent data with closed-form solutions and use it to derive a nonlinear MRDF algorithm. Results of the MRDF method on synthetic databases are shown and compared with results from standard Fukunaga-Koontz transform and Fisher discriminant function methods. The method is also applied to an automated product inspection problem and for classification and pose estimation of two similar objects under 3D aspect angle variations.

Representation matters: quantitative behavioral variation in wild worm strains

NASA Astrophysics Data System (ADS)

Brown, Andre

Natural genetic variation in populations is the basis of genome-wide association studies, an approach that has been applied in large studies of humans to study the genetic architecture of complex traits including disease risk. Of course, the traits you choose to measure determine which associated genes you discover (or miss). In large-scale human studies, the measured traits are usually taken as a given during the association step because they are expensive to collect and standardize. Working with the nematode worm C. elegans, we do not have the same constraints. In this talk I will describe how large-scale imaging of worm behavior allows us to develop alternative representations of behavior that vary differently across wild populations. The alternative representations yield novel traits that can be used for genome-wide association studies and may reveal basic properties of the genotype-phenotype map that are obscured if only a small set of fixed traits are used.

AND/OR graph representation of assembly plans

NASA Astrophysics Data System (ADS)

Homem de Mello, Luiz S.; Sanderson, Arthur C.

1990-04-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

AND/OR graph representation of assembly plans

NASA Technical Reports Server (NTRS)

Homem De Mello, Luiz S.; Sanderson, Arthur C.

1990-01-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

Numerical simulation of separated flows. Ph.D. Thesis - Stanford Univ., Calif.

NASA Technical Reports Server (NTRS)

Spalart, P. R.; Leonard, A.; Baganoff, D.

1983-01-01

A new numerical method, based on the Vortex Method, for the simulation of two-dimensional separated flows, was developed and tested on a wide range of gases. The fluid is incompressible and the Reynolds number is high. A rigorous analytical basis for the representation of the Navier-Stokes equation in terms of the vorticity is used. An equation for the control of circulation around each body is included. An inviscid outer flow (computed by the Vortex Method) was coupled with a viscous boundary layer flow (computed by an Eulerian method). This version of the Vortex Method treats bodies of arbitrary shape, and accurately computes the pressure and shear stress at the solid boundary. These two quantities reflect the structure of the boundary layer. Several versions of the method are presented and applied to various problems, most of which have massive separation. Comparison of its results with other results, generally experimental, demonstrates the reliability and the general accuracy of the new method, with little dependence on empirical parameters. Many of the complex features of the flow past a circular cylinder, over a wide range of Reynolds numbers, are correctly reproduced.

Parametric Representation of the Speaker's Lips for Multimodal Sign Language and Speech Recognition

NASA Astrophysics Data System (ADS)

Ryumin, D.; Karpov, A. A.

2017-05-01

In this article, we propose a new method for parametric representation of human's lips region. The functional diagram of the method is described and implementation details with the explanation of its key stages and features are given. The results of automatic detection of the regions of interest are illustrated. A speed of the method work using several computers with different performances is reported. This universal method allows applying parametrical representation of the speaker's lipsfor the tasks of biometrics, computer vision, machine learning, and automatic recognition of face, elements of sign languages, and audio-visual speech, including lip-reading.

Nekrasov and Argyres-Douglas theories in spherical Hecke algebra representation

NASA Astrophysics Data System (ADS)

Rim, Chaiho; Zhang, Hong

2017-06-01

AGT conjecture connects Nekrasov instanton partition function of 4D quiver gauge theory with 2D Liouville conformal blocks. We re-investigate this connection using the central extension of spherical Hecke algebra in q-coordinate representation, q being the instanton expansion parameter. Based on AFLT basis together with intertwiners we construct gauge conformal state and demonstrate its equivalence to the Liouville conformal state, with careful attention to the proper scaling behavior of the state. Using the colliding limit of regular states, we obtain the formal expression of irregular conformal states corresponding to Argyres-Douglas theory, which involves summation of functions over Young diagrams.

Two-rowed Hecke algebra representations at roots of unity

NASA Astrophysics Data System (ADS)

Welsh, Trevor Alan

1996-02-01

In this paper, we initiate a study into the explicit construction of irreducible representations of the Hecke algebraH n (q) of typeA n-1 in the non-generic case whereq is a root of unity. The approach is via the Specht modules ofH n (q) which are irreducible in the generic case, and possess a natural basis indexed by Young tableaux. The general framework in which the irreducible non-genericH n (q)-modules are to be constructed is set up and, in particular, the full set of modules corresponding to two-part partitions is described. Plentiful examples are given.

Newborn infants perceive abstract numbers

PubMed Central

Izard, Véronique; Sann, Coralie; Spelke, Elizabeth S.; Streri, Arlette

2009-01-01

Although infants and animals respond to the approximate number of elements in visual, auditory, and tactile arrays, only human children and adults have been shown to possess abstract numerical representations that apply to entities of all kinds (e.g., 7 samurai, seas, or sins). Do abstract numerical concepts depend on language or culture, or do they form a part of humans' innate, core knowledge? Here we show that newborn infants spontaneously associate stationary, visual-spatial arrays of 4–18 objects with auditory sequences of events on the basis of number. Their performance provides evidence for abstract numerical representations at the start of postnatal experience. PMID:19520833

Building an information model (with the help of PSL/PSA). [Problem Statement Language/Problem Statement Analyzer

NASA Technical Reports Server (NTRS)

Callender, E. D.; Farny, A. M.

1983-01-01

Problem Statement Language/Problem Statement Analyzer (PSL/PSA) applications, which were once a one-step process in which product system information was immediately translated into PSL statements, have in light of experience been shown to result in inconsistent representations. These shortcomings have prompted the development of an intermediate step, designated the Product System Information Model (PSIM), which provides a basis for the mutual understanding of customer terminology and the formal, conceptual representation of that product system in a PSA data base. The PSIM is initially captured as a paper diagram, followed by formal capture in the PSL/PSA data base.

Coherent States for the Two-Dimensional Dirac-Moshinsky Oscillator Coupled to an External Magnetic Field

NASA Astrophysics Data System (ADS)

Ojeda-Guillén, D.; Mota, R. D.; Granados, V. D.

2015-03-01

We show that the (2+1)-dimensional Dirac-Moshinsky oscillator coupled to an external magnetic field can be treated algebraically with the SU(1,1) group theory and its group basis. We use the su(1,1) irreducible representation theory to find the energy spectrum and the eigenfunctions. Also, with the su(1,1) group basis we construct the relativistic coherent states in a closed form for this problem. Supported by SNI-México, COFAA-IPN, EDI-IPN, EDD-IPN, SIP-IPN project number 20140598

On the representation of the diffracted field of Hermite-Gaussian modes in an alien basis and the young diffraction principle

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

Smirnov, V.N.; Strokovskii, G.A.

An analytical form of expansion coefficients of a diffracted field for an arbitrary Hermite-Gaussian beam in an alien Hermite-Gaussian basis is obtained. A possible physical interpretation of the well-known Young phenomenological diffraction principle and experiments on diffraction of Hermite-Gaussian beams of the lowest types (n = 0 - 5) from half-plane are discussed. The case of nearly homogenous expansion corresponding to misalignment and mismatch of optical systems is also analyzed. 7 refs., 2 figs.

A Gaussian Weave for Kinematical Loop Quantum Gravity

NASA Astrophysics Data System (ADS)

Corichi, A.; Reyes, J. M.; Ashtekar, A.

Remarkable efforts in the study of the semiclassical regime of kinematical loop quantum gravity are currently underway. In this note, we construct a ``quasicoherent'' weave state using Gaussian factors. In a similar fashion to some other proposals, this state is peaked in both the connection and the spin network basis. However, the state constructed here has the novel feature that, in the spin network basis, the main contribution for this state is given by the fundamental representation, independently of the value of the parameter that regulates the Gaussian width.

Construction of the Fock Matrix on a Grid-Based Molecular Orbital Basis Using GPGPUs.

PubMed

Losilla, Sergio A; Watson, Mark A; Aspuru-Guzik, Alán; Sundholm, Dage

2015-05-12

We present a GPGPU implementation of the construction of the Fock matrix in the molecular orbital basis using the fully numerical, grid-based bubbles representation. For a test set of molecules containing up to 90 electrons, the total Hartree-Fock energies obtained from reference GTO-based calculations are reproduced within 10(-4) Eh to 10(-8) Eh for most of the molecules studied. Despite the very large number of arithmetic operations involved, the high performance obtained made the calculations possible on a single Nvidia Tesla K40 GPGPU card.

Representations of the language recognition problem for a theorem prover

NASA Technical Reports Server (NTRS)

Minker, J.; Vanderbrug, G. J.

1972-01-01

Two representations of the language recognition problem for a theorem prover in first order logic are presented and contrasted. One of the representations is based on the familiar method of generating sentential forms of the language, and the other is based on the Cocke parsing algorithm. An augmented theorem prover is described which permits recognition of recursive languages. The state-transformation method developed by Cordell Green to construct problem solutions in resolution-based systems can be used to obtain the parse tree. In particular, the end-order traversal of the parse tree is derived in one of the representations. An inference system, termed the cycle inference system, is defined which makes it possible for the theorem prover to model the method on which the representation is based. The general applicability of the cycle inference system to state space problems is discussed. Given an unsatisfiable set S, where each clause has at most one positive literal, it is shown that there exists an input proof. The clauses for the two representations satisfy these conditions, as do many state space problems.

Graphic representation of data resulting from measurement comparison trials in cataract and refractive surgery.

PubMed

Krummenauer, Frank; Storkebaum, Kristin; Dick, H Burkhard

2003-01-01

The evaluation of new diagnostic measurement devices allows intraindividual comparison with an established standard method. However, reports in journal articles often omit the adequate incorporation of the intraindividual design into the graphic representation. This article illustrates the drawbacks and the possible erroneous conclusions caused by this misleading practice in terms of recent method comparison data resulting from axial length measurement in 220 consecutive patients by both applanation ultrasound and partial coherence interferometry. Graphic representation of such method comparison data should be based on boxplots for intraindividual differences or on Bland-Altman plots. Otherwise, severe deviations between the measurement devices could be erroneously ignored and false-positive conclusions on the concordance of the instruments could result. Graphic representation of method comparison data should sensitively incorporate the underlying study design for intraindividual comparison.

Intrinsic and Extrinsic Evaluation of Spatiotemporal Text Representations in Twitter Streams

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

Phillips, Lawrence A.; Shaffer, Kyle J.; Arendt, Dustin L.

Language in social media is a dynamic system, constantly evolving and adapting, with words and concepts rapidly emerging, disappearing, and changing their meaning. These changes can be estimated using word representations in context, over time and across locations. A number of methods have been proposed to track these spatiotemporal changes but no general method exists to evaluate the quality of these representations. Previous work largely focused on qualitative evaluation, which we improve by proposing a set of visualizations that highlight changes in text representation over both space and time. We demonstrate usefulness of novel spatiotemporal representations to explore and characterizemore » specific aspects of the corpus of tweets collected from European countries over a two-week period centered around the terrorist attacks in Brussels in March 2016. In addition, we quantitatively evaluate spatiotemporal representations by feeding them into a downstream classification task – event type prediction. Thus, our work is the first to provide both intrinsic (qualitative) and extrinsic (quantitative) evaluation of text representations for spatiotemporal trends.« less

Simulation of multivariate stationary stochastic processes using dimension-reduction representation methods

NASA Astrophysics Data System (ADS)

Liu, Zhangjun; Liu, Zenghui; Peng, Yongbo

2018-03-01

In view of the Fourier-Stieltjes integral formula of multivariate stationary stochastic processes, a unified formulation accommodating spectral representation method (SRM) and proper orthogonal decomposition (POD) is deduced. By introducing random functions as constraints correlating the orthogonal random variables involved in the unified formulation, the dimension-reduction spectral representation method (DR-SRM) and the dimension-reduction proper orthogonal decomposition (DR-POD) are addressed. The proposed schemes are capable of representing the multivariate stationary stochastic process with a few elementary random variables, bypassing the challenges of high-dimensional random variables inherent in the conventional Monte Carlo methods. In order to accelerate the numerical simulation, the technique of Fast Fourier Transform (FFT) is integrated with the proposed schemes. For illustrative purposes, the simulation of horizontal wind velocity field along the deck of a large-span bridge is proceeded using the proposed methods containing 2 and 3 elementary random variables. Numerical simulation reveals the usefulness of the dimension-reduction representation methods.

Corrected confidence bands for functional data using principal components.

PubMed

Goldsmith, J; Greven, S; Crainiceanu, C

2013-03-01

Functional principal components (FPC) analysis is widely used to decompose and express functional observations. Curve estimates implicitly condition on basis functions and other quantities derived from FPC decompositions; however these objects are unknown in practice. In this article, we propose a method for obtaining correct curve estimates by accounting for uncertainty in FPC decompositions. Additionally, pointwise and simultaneous confidence intervals that account for both model- and decomposition-based variability are constructed. Standard mixed model representations of functional expansions are used to construct curve estimates and variances conditional on a specific decomposition. Iterated expectation and variance formulas combine model-based conditional estimates across the distribution of decompositions. A bootstrap procedure is implemented to understand the uncertainty in principal component decomposition quantities. Our method compares favorably to competing approaches in simulation studies that include both densely and sparsely observed functions. We apply our method to sparse observations of CD4 cell counts and to dense white-matter tract profiles. Code for the analyses and simulations is publicly available, and our method is implemented in the R package refund on CRAN. Copyright © 2013, The International Biometric Society.

Corrected Confidence Bands for Functional Data Using Principal Components

PubMed Central

Goldsmith, J.; Greven, S.; Crainiceanu, C.

2014-01-01

Functional principal components (FPC) analysis is widely used to decompose and express functional observations. Curve estimates implicitly condition on basis functions and other quantities derived from FPC decompositions; however these objects are unknown in practice. In this article, we propose a method for obtaining correct curve estimates by accounting for uncertainty in FPC decompositions. Additionally, pointwise and simultaneous confidence intervals that account for both model- and decomposition-based variability are constructed. Standard mixed model representations of functional expansions are used to construct curve estimates and variances conditional on a specific decomposition. Iterated expectation and variance formulas combine model-based conditional estimates across the distribution of decompositions. A bootstrap procedure is implemented to understand the uncertainty in principal component decomposition quantities. Our method compares favorably to competing approaches in simulation studies that include both densely and sparsely observed functions. We apply our method to sparse observations of CD4 cell counts and to dense white-matter tract profiles. Code for the analyses and simulations is publicly available, and our method is implemented in the R package refund on CRAN. PMID:23003003

Reverse engineering of aircraft wing data using a partial differential equation surface model

NASA Astrophysics Data System (ADS)

Huband, Jacalyn Mann

Reverse engineering is a multi-step process used in industry to determine a production representation of an existing physical object. This representation is in the form of mathematical equations that are compatible with computer-aided design and computer-aided manufacturing (CAD/CAM) equipment. The four basic steps to the reverse engineering process are data acquisition, data separation, surface or curve fitting, and CAD/CAM production. The surface fitting step determines the design representation of the object, and thus is critical to the success or failure of the reverse engineering process. Although surface fitting methods described in the literature are used to model a variety of surfaces, they are not suitable for reversing aircraft wings. In this dissertation, we develop and demonstrate a new strategy for reversing a mathematical representation of an aircraft wing. The basis of our strategy is to take an aircraft design model and determine if an inverse model can be derived. A candidate design model for this research is the partial differential equation (PDE) surface model, proposed by Bloor and Wilson and used in the Rapid Airplane Parameter Input Design (RAPID) tool at the NASA-LaRC Geolab. There are several basic mathematical problems involved in reversing the PDE surface model: (i) deriving a computational approximation of the surface function; (ii) determining a radial parametrization of the wing; (iii) choosing mathematical models or classes of functions for representation of the boundary functions; (iv) fitting the boundary data points by the chosen boundary functions; and (v) simultaneously solving for the axial parameterization and the derivative boundary functions. The study of the techniques to solve the above mathematical problems has culminated in a reverse PDE surface model and two reverse PDE surface algorithms. One reverse PDE surface algorithm recovers engineering design parameters for the RAPID tool from aircraft wing data and the other generates a PDE surface model with spline boundary functions from an arbitrary set of grid points. Our numerical tests show that the reverse PDE surface model and the reverse PDE surface algorithms can be used for the reverse engineering of aircraft wing data.

Enhancing students’ mathematical representation and selfefficacy through situation-based learning assisted by geometer’s sketchpad program

NASA Astrophysics Data System (ADS)

Sowanto; Kusumah, Y. S.

2018-05-01

This research was conducted based on the problem of a lack of students’ mathematical representation ability as well as self-efficacy in accomplishing mathematical tasks. To overcome this problem, this research used situation-based learning (SBL) assisted by geometer’s sketchpad program (GSP). This research investigated students’ improvement of mathematical representation ability who were taught under situation-based learning (SBL) assisted by geometer’s sketchpad program (GSP) and regular method that viewed from the whole students’ prior knowledge (high, average, and low level). In addition, this research investigated the difference of students’ self-efficacy after learning was given. This research belongs to quasi experiment research using non-equivalent control group design with purposive sampling. The result of this research showed that students’ enhancement in their mathematical representation ability taught under SBL assisted by GSP was better than the regular method. Also, there was no interaction between learning methods and students prior knowledge in student’ enhancement of mathematical representation ability. There was significant difference of students’ enhancement of mathematical representation ability taught under SBL assisted by GSP viewed from students’ prior knowledge. Furthermore, there was no significant difference in terms of self-efficacy between those who were taught by SBL assisted by GSP with the regular method.

Deep graphs—A general framework to represent and analyze heterogeneous complex systems across scales

NASA Astrophysics Data System (ADS)

Traxl, Dominik; Boers, Niklas; Kurths, Jürgen

2016-06-01

Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. Particularly in recent years, a great progress has been made by augmenting "traditional" network theory in order to account for the multiplex nature of many networks, multiple types of connections between objects, the time-evolution of networks, networks of networks and other intricacies. However, existing network representations still lack crucial features in order to serve as a general data analysis tool. These include, most importantly, an explicit association of information with possibly heterogeneous types of objects and relations, and a conclusive representation of the properties of groups of nodes as well as the interactions between such groups on different scales. In this paper, we introduce a collection of definitions resulting in a framework that, on the one hand, entails and unifies existing network representations (e.g., network of networks and multilayer networks), and on the other hand, generalizes and extends them by incorporating the above features. To implement these features, we first specify the nodes and edges of a finite graph as sets of properties (which are permitted to be arbitrary mathematical objects). Second, the mathematical concept of partition lattices is transferred to the network theory in order to demonstrate how partitioning the node and edge set of a graph into supernodes and superedges allows us to aggregate, compute, and allocate information on and between arbitrary groups of nodes. The derived partition lattice of a graph, which we denote by deep graph, constitutes a concise, yet comprehensive representation that enables the expression and analysis of heterogeneous properties, relations, and interactions on all scales of a complex system in a self-contained manner. Furthermore, to be able to utilize existing network-based methods and models, we derive different representations of multilayer networks from our framework and demonstrate the advantages of our representation. On the basis of the formal framework described here, we provide a rich, fully scalable (and self-explanatory) software package that integrates into the PyData ecosystem and offers interfaces to popular network packages, making it a powerful, general-purpose data analysis toolkit. We exemplify an application of deep graphs using a real world dataset, comprising 16 years of satellite-derived global precipitation measurements. We deduce a deep graph representation of these measurements in order to track and investigate local formations of spatio-temporal clusters of extreme precipitation events.

Deep graphs-A general framework to represent and analyze heterogeneous complex systems across scales.

PubMed

Traxl, Dominik; Boers, Niklas; Kurths, Jürgen

2016-06-01

Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. Particularly in recent years, a great progress has been made by augmenting "traditional" network theory in order to account for the multiplex nature of many networks, multiple types of connections between objects, the time-evolution of networks, networks of networks and other intricacies. However, existing network representations still lack crucial features in order to serve as a general data analysis tool. These include, most importantly, an explicit association of information with possibly heterogeneous types of objects and relations, and a conclusive representation of the properties of groups of nodes as well as the interactions between such groups on different scales. In this paper, we introduce a collection of definitions resulting in a framework that, on the one hand, entails and unifies existing network representations (e.g., network of networks and multilayer networks), and on the other hand, generalizes and extends them by incorporating the above features. To implement these features, we first specify the nodes and edges of a finite graph as sets of properties (which are permitted to be arbitrary mathematical objects). Second, the mathematical concept of partition lattices is transferred to the network theory in order to demonstrate how partitioning the node and edge set of a graph into supernodes and superedges allows us to aggregate, compute, and allocate information on and between arbitrary groups of nodes. The derived partition lattice of a graph, which we denote by deep graph, constitutes a concise, yet comprehensive representation that enables the expression and analysis of heterogeneous properties, relations, and interactions on all scales of a complex system in a self-contained manner. Furthermore, to be able to utilize existing network-based methods and models, we derive different representations of multilayer networks from our framework and demonstrate the advantages of our representation. On the basis of the formal framework described here, we provide a rich, fully scalable (and self-explanatory) software package that integrates into the PyData ecosystem and offers interfaces to popular network packages, making it a powerful, general-purpose data analysis toolkit. We exemplify an application of deep graphs using a real world dataset, comprising 16 years of satellite-derived global precipitation measurements. We deduce a deep graph representation of these measurements in order to track and investigate local formations of spatio-temporal clusters of extreme precipitation events.