A General Exponential Framework for Dimensionality Reduction.

PubMed

Wang, Su-Jing; Yan, Shuicheng; Yang, Jian; Zhou, Chun-Guang; Fu, Xiaolan

2014-02-01

As a general framework, Laplacian embedding, based on a pairwise similarity matrix, infers low dimensional representations from high dimensional data. However, it generally suffers from three issues: 1) algorithmic performance is sensitive to the size of neighbors; 2) the algorithm encounters the well known small sample size (SSS) problem; and 3) the algorithm de-emphasizes small distance pairs. To address these issues, here we propose exponential embedding using matrix exponential and provide a general framework for dimensionality reduction. In the framework, the matrix exponential can be roughly interpreted by the random walk over the feature similarity matrix, and thus is more robust. The positive definite property of matrix exponential deals with the SSS problem. The behavior of the decay function of exponential embedding is more significant in emphasizing small distance pairs. Under this framework, we apply matrix exponential to extend many popular Laplacian embedding algorithms, e.g., locality preserving projections, unsupervised discriminant projections, and marginal fisher analysis. Experiments conducted on the synthesized data, UCI, and the Georgia Tech face database show that the proposed new framework can well address the issues mentioned above.

Second level semi-degenerate fields in W_3 Toda theory: matrix element and differential equation

NASA Astrophysics Data System (ADS)

Belavin, Vladimir; Cao, Xiangyu; Estienne, Benoit; Santachiara, Raoul

2017-03-01

In a recent study we considered W_3 Toda 4-point functions that involve matrix elements of a primary field with the highest-weight in the adjoint representation of sl_3 . We generalize this result by considering a semi-degenerate primary field, which has one null vector at level two. We obtain a sixth-order Fuchsian differential equation for the conformal blocks. We discuss the presence of multiplicities, the matrix elements and the fusion rules.

Non-Markovianity of Gaussian Channels.

PubMed

Torre, G; Roga, W; Illuminati, F

2015-08-14

We introduce a necessary and sufficient criterion for the non-Markovianity of Gaussian quantum dynamical maps based on the violation of divisibility. The criterion is derived by defining a general vectorial representation of the covariance matrix which is then exploited to determine the condition for the complete positivity of partial maps associated with arbitrary time intervals. Such construction does not rely on the Choi-Jamiolkowski representation and does not require optimization over states.

Matrix elements and duality for type 2 unitary representations of the Lie superalgebra gl(m|n)

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

Werry, Jason L.; Gould, Mark D.; Isaac, Phillip S.

The characteristic identity formalism discussed in our recent articles is further utilized to derive matrix elements of type 2 unitary irreducible gl(m|n) modules. In particular, we give matrix element formulae for all gl(m|n) generators, including the non-elementary generators, together with their phases on finite dimensional type 2 unitary irreducible representations which include the contravariant tensor representations and an additional class of essentially typical representations. Remarkably, we find that the type 2 unitary matrix element equations coincide with the type 1 unitary matrix element equations for non-vanishing matrix elements up to a phase.

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

Theophilou, Iris; Helbig, Nicole; Lathiotakis, Nektarios N.

Functionals of the one-body reduced density matrix (1-RDM) are routinely minimized under Coleman’s ensemble N-representability conditions. Recently, the topic of pure-state N-representability conditions, also known as generalized Pauli constraints, received increased attention following the discovery of a systematic way to derive them for any number of electrons and any finite dimensionality of the Hilbert space. The target of this work is to assess the potential impact of the enforcement of the pure-state conditions on the results of reduced density-matrix functional theory calculations. In particular, we examine whether the standard minimization of typical 1-RDM functionals under the ensemble N-representability conditions violatesmore » the pure-state conditions for prototype 3-electron systems. We also enforce the pure-state conditions, in addition to the ensemble ones, for the same systems and functionals and compare the correlation energies and optimal occupation numbers with those obtained by the enforcement of the ensemble conditions alone.« less

Exact representation of the asymptotic drift speed and diffusion matrix for a class of velocity-jump processes

NASA Astrophysics Data System (ADS)

Mascia, Corrado

2016-01-01

This paper examines a class of linear hyperbolic systems which generalizes the Goldstein-Kac model to an arbitrary finite number of speeds vi with transition rates μij. Under the basic assumptions that the transition matrix is symmetric and irreducible, and the differences vi -vj generate all the space, the system exhibits a large-time behavior described by a parabolic advection-diffusion equation. The main contribution is to determine explicit formulas for the asymptotic drift speed and diffusion matrix in term of the kinetic parameters vi and μij, establishing a complete connection between microscopic and macroscopic coefficients. It is shown that the drift speed is the arithmetic mean of the velocities vi. The diffusion matrix has a more complicate representation, based on the graph with vertices the velocities vi and arcs weighted by the transition rates μij. The approach is based on an exhaustive analysis of the dispersion relation and on the application of a variant of the Kirchoff's matrix tree Theorem from graph theory.

Matrix Representation of Symmetry Operators in Elementary Crystallography

ERIC Educational Resources Information Center

Cody, R. D.

1972-01-01

Presents the derivation of rotation and reflection matrix representation of symmetry operators as used in the initial discussion of crystal symmetry in elementary mineralogy at Iowa State University. Includes references and an appended list of matrix representations of the important crystallographic symmetry operators, excluding the trigonal and…

Coupling coefficients for tensor product representations of quantum SU(2)

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

Groenevelt, Wolter, E-mail: w.g.m.groenevelt@tudelft.nl

2014-10-15

We study tensor products of infinite dimensional irreducible {sup *}-representations (not corepresentations) of the SU(2) quantum group. We obtain (generalized) eigenvectors of certain self-adjoint elements using spectral analysis of Jacobi operators associated to well-known q-hypergeometric orthogonal polynomials. We also compute coupling coefficients between different eigenvectors corresponding to the same eigenvalue. Since the continuous spectrum has multiplicity two, the corresponding coupling coefficients can be considered as 2 × 2-matrix-valued orthogonal functions. We compute explicitly the matrix elements of these functions. The coupling coefficients can be considered as q-analogs of Bessel functions. As a results we obtain several q-integral identities involving q-hypergeometricmore » orthogonal polynomials and q-Bessel-type functions.« less

Dioptric power: its nature and its representation in three- and four-dimensional space.

PubMed

Harris, W F

1997-06-01

Dioptric power expressed in the familiar three-component form of sphere, cylinder, and axis is unsuited to mathematical and statistical treatments; there is a particular class of power that cannot be represented in the familiar form; and it is possible that sphere, cylinder, and axis will prove inadequate in future clinical and research applications in optometry and ophthalmology. Dioptric power expressed as the four-component dioptric power matrix, however, overcomes these shortcomings. The intention in this paper is to provide a definitive statement on the nature, function, and mathematical representation of dioptric power in terms of the matrix and within the limitations of paraxial or linear optics. The approach is universal in the sense that its point of departure is not power of the familiar form (that is, of thin systems) but of systems in general (thick or thin). Familiar types of power are then seen within the context of power in general. Dioptric power is defined, for systems that may be thick and astigmatic, in terms of the ray transfer matrix. A functional definition is presented for dioptric power and its components: it defines the additive contribution of incident position to emergent direction of a ray passing through the system. For systems that are thin (or thin-equivalent) it becomes possible to describe an alternative and more familiar function; for such systems dioptric power can be regarded as the increase in reduced surface curvature of a wavefront brought about by the system as the wavefront passes through it. The curvital and torsional components of the power are explored in some detail. Dioptric power, at its most general, defines a four-dimensional inner product space called dioptric power space. The familiar types of power define a three-dimensional subspace called symmetric dioptric power space. For completeness a one-dimensional antisymmetric power space is also defined: it is orthogonal in four dimensions to symmetric dioptric power space. Various bases are defined for the spaces as are coordinate vectors with respect to them. Vectorial representations of power in the literature apply only to thin systems and are not obviously generalizable to systems in general. They are shown to be merely different coordinate representations of the same subspace, the space of symmetric powers. Some of the uses and disadvantages of the different representations are described. None of the coordinate vectors fully represent, by themselves, the essential character of dioptric power. Their use is limited to applications, such as finding a mean, where addition and scalar multiplication are involved. The full character of power is represented by the dioptric power matrix; it is in this form that power is appropriate for all mathematical relationships.

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.

MRL and SuperFine+MRL: new supertree methods

PubMed Central

2012-01-01

Background Supertree methods combine trees on subsets of the full taxon set together to produce a tree on the entire set of taxa. Of the many supertree methods, the most popular is MRP (Matrix Representation with Parsimony), a method that operates by first encoding the input set of source trees by a large matrix (the "MRP matrix") over {0,1, ?}, and then running maximum parsimony heuristics on the MRP matrix. Experimental studies evaluating MRP in comparison to other supertree methods have established that for large datasets, MRP generally produces trees of equal or greater accuracy than other methods, and can run on larger datasets. A recent development in supertree methods is SuperFine+MRP, a method that combines MRP with a divide-and-conquer approach, and produces more accurate trees in less time than MRP. In this paper we consider a new approach for supertree estimation, called MRL (Matrix Representation with Likelihood). MRL begins with the same MRP matrix, but then analyzes the MRP matrix using heuristics (such as RAxML) for 2-state Maximum Likelihood. Results We compared MRP and SuperFine+MRP with MRL and SuperFine+MRL on simulated and biological datasets. We examined the MRP and MRL scores of each method on a wide range of datasets, as well as the resulting topological accuracy of the trees. Our experimental results show that MRL, coupled with a very good ML heuristic such as RAxML, produced more accurate trees than MRP, and MRL scores were more strongly correlated with topological accuracy than MRP scores. Conclusions SuperFine+MRP, when based upon a good MP heuristic, such as TNT, produces among the best scores for both MRP and MRL, and is generally faster and more topologically accurate than other supertree methods we tested. PMID:22280525

Sparse subspace clustering for data with missing entries and high-rank matrix completion.

PubMed

Fan, Jicong; Chow, Tommy W S

2017-09-01

Many methods have recently been proposed for subspace clustering, but they are often unable to handle incomplete data because of missing entries. Using matrix completion methods to recover missing entries is a common way to solve the problem. Conventional matrix completion methods require that the matrix should be of low-rank intrinsically, but most matrices are of high-rank or even full-rank in practice, especially when the number of subspaces is large. In this paper, a new method called Sparse Representation with Missing Entries and Matrix Completion is proposed to solve the problems of incomplete-data subspace clustering and high-rank matrix completion. The proposed algorithm alternately computes the matrix of sparse representation coefficients and recovers the missing entries of a data matrix. The proposed algorithm recovers missing entries through minimizing the representation coefficients, representation errors, and matrix rank. Thorough experimental study and comparative analysis based on synthetic data and natural images were conducted. The presented results demonstrate that the proposed algorithm is more effective in subspace clustering and matrix completion compared with other existing methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

A hierarchy of generalized Jaulent-Miodek equations and their explicit solutions

NASA Astrophysics Data System (ADS)

Geng, Xianguo; Guan, Liang; Xue, Bo

A hierarchy of generalized Jaulent-Miodek (JM) equations related to a new spectral problem with energy-dependent potentials is proposed. Depending on the Lax matrix and elliptic variables, the generalized JM hierarchy is decomposed into two systems of solvable ordinary differential equations. Explicit theta function representations of the meromorphic function and the Baker-Akhiezer function are constructed, the solutions of the hierarchy are obtained based on the theory of algebraic curves.

Micromechanical Modeling of Woven Metal Matrix Composites

NASA Technical Reports Server (NTRS)

Bednarcyk, Brett A.; Pindera, Marek-Jerzy

1997-01-01

This report presents the results of an extensive micromechanical modeling effort for woven metal matrix composites. The model is employed to predict the mechanical response of 8-harness (8H) satin weave carbon/copper (C/Cu) composites. Experimental mechanical results for this novel high thermal conductivity material were recently reported by Bednarcyk et al. along with preliminary model results. The micromechanics model developed herein is based on an embedded approach. A micromechanics model for the local (micro-scale) behavior of the woven composite, the original method of cells (Aboudi), is embedded in a global (macro-scale) micromechanics model (the three-dimensional generalized method of cells (GMC-3D) (Aboudi). This approach allows representation of true repeating unit cells for woven metal matrix composites via GMC-3D, and representation of local effects, such as matrix plasticity, yarn porosity, and imperfect fiber-matrix bonding. In addition, the equations of GMC-3D were reformulated to significantly reduce the number of unknown quantities that characterize the deformation fields at the microlevel in order to make possible the analysis of actual microstructures of woven composites. The resulting micromechanical model (WCGMC) provides an intermediate level of geometric representation, versatility, and computational efficiency with respect to previous analytical and numerical models for woven composites, but surpasses all previous modeling work by allowing the mechanical response of a woven metal matrix composite, with an elastoplastic matrix, to be examined for the first time. WCGMC is employed to examine the effects of composite microstructure, porosity, residual stresses, and imperfect fiber-matrix bonding on the predicted mechanical response of 8H satin C/Cu. The previously reported experimental results are summarized, and the model predictions are compared to monotonic and cyclic tensile and shear test data. By considering appropriate levels of porosity, residual stresses, and imperfect fiber-matrix debonding, reasonably good qualitative and quantitative correlation is achieved between model and experiment.

A path-oriented knowledge representation system: Defusing the combinatorial system

NASA Technical Reports Server (NTRS)

Karamouzis, Stamos T.; Barry, John S.; Smith, Steven L.; Feyock, Stefan

1995-01-01

LIMAP is a programming system oriented toward efficient information manipulation over fixed finite domains, and quantification over paths and predicates. A generalization of Warshall's Algorithm to precompute paths in a sparse matrix representation of semantic nets is employed to allow questions involving paths between components to be posed and answered easily. LIMAP's ability to cache all paths between two components in a matrix cell proved to be a computational obstacle, however, when the semantic net grew to realistic size. The present paper describes a means of mitigating this combinatorial explosion to an extent that makes the use of the LIMAP representation feasible for problems of significant size. The technique we describe radically reduces the size of the search space in which LIMAP must operate; semantic nets of more than 500 nodes have been attacked successfully. Furthermore, it appears that the procedure described is applicable not only to LIMAP, but to a number of other combinatorially explosive search space problems found in AI as well.

Local representation of the electronic dielectric response function

DOE PAGES

Lu, Deyu; Ge, Xiaochuan

2015-12-11

We present a local representation of the electronic dielectric response function, based on a spatial partition of the dielectric response into contributions from each occupied Wannier orbital using a generalized density functional perturbation theory. This procedure is fully ab initio, and therefore allows us to rigorously define local metrics, such as “bond polarizability,” on Wannier centers. We show that the locality of the bare response function is determined by the locality of three quantities: Wannier functions of the occupied manifold, the density matrix, and the Hamiltonian matrix. Furthermore, in systems with a gap, the bare dielectric response is exponentially localized,more » which supports the physical picture of the dielectric response function as a collection of interacting local responses that can be captured by a tight-binding model.« less

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.

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.

Modular invariant representations of infinite-dimensional Lie algebras and superalgebras

PubMed Central

Kac, Victor G.; Wakimoto, Minoru

1988-01-01

In this paper, we launch a program to describe and classify modular invariant representations of infinite-dimensional Lie algebras and superalgebras. We prove a character formula for a large class of highest weight representations L(λ) of a Kac-Moody algebra [unk] with a symmetrizable Cartan matrix, generalizing the Weyl-Kac character formula [Kac, V. G. (1974) Funct. Anal. Appl. 8, 68-70]. In the case of an affine [unk], this class includes modular invariant representations of arbitrary rational level m = t/u, where t [unk] Z and u [unk] N are relatively prime and m + g ≥ g/u (g is the dual Coxeter number). We write the characters of these representations in terms of theta functions and calculate their asymptotics, generalizing the results of Kac and Peterson [Kac, V. G. & Peterson, D. H. (1984) Adv. Math. 53, 125-264] and of Kac and Wakimoto [Kac, V. G. & Wakimoto, M. (1988) Adv. Math. 70, 156-234] for the u = 1 (integrable) case. We work out in detail the case [unk] = A1(1), in particular classifying all its modular invariant representations. Furthermore, we show that the modular invariant representations of the Virasoro algebra Vir are precisely the “minimal series” of Belavin et al. [Belavin, A. A., Polyakov, A. M. & Zamolodchikov, A. B. (1984) Nucl. Phys. B 241, 333-380] using the character formulas of Feigin and Fuchs [Feigin, B. L. & Fuchs, D. B. (1984) Lect. Notes Math. 1060, 230-245]. We show that tensoring the basic representation and modular invariant representations of A1(1) produces all modular invariant representations of Vir generalizing the results of Goddard et al. [Goddard P., Kent, A. & Olive, D. (1986) Commun. Math. Phys. 103, 105-119] and of Kac and Wakimoto [Kac, V. G. & Wakimoto, M. (1986) Lect. Notes Phys. 261, 345-371] in the unitary case. We study the general branching functions as well. All these results are generalized to the Kac-Moody superalgebras introduced by Kac [Kac, V. G. (1978) Adv. Math. 30, 85-136] and to N = 1 super Virasoro algebras. We work out in detail the case of the superalgebra B(0, 1)(1), showing, in particular, that restricting to its even part produces again all modular invariant representations of Vir. These results lead to general conjectures about asymptotic behavior of positive energy representations and classification of modular invariant representations. PMID:16593954

Finding Imaging Patterns of Structural Covariance via Non-Negative Matrix Factorization

PubMed Central

Sotiras, Aristeidis; Resnick, Susan M.; Davatzikos, Christos

2015-01-01

In this paper, we investigate the use of Non-Negative Matrix Factorization (NNMF) for the analysis of structural neuroimaging data. The goal is to identify the brain regions that co-vary across individuals in a consistent way, hence potentially being part of underlying brain networks or otherwise influenced by underlying common mechanisms such as genetics and pathologies. NNMF offers a directly data-driven way of extracting relatively localized co-varying structural regions, thereby transcending limitations of Principal Component Analysis (PCA), Independent Component Analysis (ICA) and other related methods that tend to produce dispersed components of positive and negative loadings. In particular, leveraging upon the well known ability of NNMF to produce parts-based representations of image data, we derive decompositions that partition the brain into regions that vary in consistent ways across individuals. Importantly, these decompositions achieve dimensionality reduction via highly interpretable ways and generalize well to new data as shown via split-sample experiments. We empirically validate NNMF in two data sets: i) a Diffusion Tensor (DT) mouse brain development study, and ii) a structural Magnetic Resonance (sMR) study of human brain aging. We demonstrate the ability of NNMF to produce sparse parts-based representations of the data at various resolutions. These representations seem to follow what we know about the underlying functional organization of the brain and also capture some pathological processes. Moreover, we show that these low dimensional representations favorably compare to descriptions obtained with more commonly used matrix factorization methods like PCA and ICA. PMID:25497684

Coherent states for quantum compact groups

NASA Astrophysics Data System (ADS)

Jurĉo, B.; Ŝťovíĉek, P.

1996-12-01

Coherent states are introduced and their properties are discussed for simple quantum compact groups A l, Bl, Cl and D l. The multiplicative form of the canonical element for the quantum double is used to introduce the holomorphic coordinates on a general quantum dressing orbit. The coherent state is interpreted as a holomorphic function on this orbit with values in the carrier Hilbert space of an irreducible representation of the corresponding quantized enveloping algebra. Using Gauss decomposition, the commutation relations for the holomorphic coordinates on the dressing orbit are derived explicitly and given in a compact R-matrix formulation (generalizing this way the q-deformed Grassmann and flag manifolds). The antiholomorphic realization of the irreducible representations of a compact quantum group (the analogue of the Borel-Weil construction) is described using the concept of coherent state. The relation between representation theory and non-commutative differential geometry is suggested.

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.

The Effects of Measurement Error on Statistical Models for Analyzing Change. Final Report.

ERIC Educational Resources Information Center

Dunivant, Noel

The results of six major projects are discussed including a comprehensive mathematical and statistical analysis of the problems caused by errors of measurement in linear models for assessing change. In a general matrix representation of the problem, several new analytic results are proved concerning the parameters which affect bias in…

Toric Calabi-Yau threefolds as quantum integrable systems. R-matrix and RTT relations

NASA Astrophysics Data System (ADS)

Awata, Hidetoshi; Kanno, Hiroaki; Mironov, Andrei; Morozov, Alexei; Morozov, Andrey; Ohkubo, Yusuke; Zenkevich, Yegor

2016-10-01

R-matrix is explicitly constructed for simplest representations of the Ding-Iohara-Miki algebra. Calculation is straightforward and significantly simpler than the one through the universal R-matrix used for a similar calculation in the Yangian case by A. Smirnov but less general. We investigate the interplay between the R-matrix structure and the structure of DIM algebra intertwiners, i.e. of refined topological vertices and show that the R-matrix is diagonalized by the action of the spectral duality belonging to the SL(2, ℤ) group of DIM algebra automorphisms. We also construct the T-operators satisfying the RTT relations with the R-matrix from refined amplitudes on resolved conifold. We thus show that topological string theories on the toric Calabi-Yau threefolds can be naturally interpreted as lattice integrable models. Integrals of motion for these systems are related to q-deformation of the reflection matrices of the Liouville/Toda theories.

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.

Finding imaging patterns of structural covariance via Non-Negative Matrix Factorization.

PubMed

Sotiras, Aristeidis; Resnick, Susan M; Davatzikos, Christos

2015-03-01

In this paper, we investigate the use of Non-Negative Matrix Factorization (NNMF) for the analysis of structural neuroimaging data. The goal is to identify the brain regions that co-vary across individuals in a consistent way, hence potentially being part of underlying brain networks or otherwise influenced by underlying common mechanisms such as genetics and pathologies. NNMF offers a directly data-driven way of extracting relatively localized co-varying structural regions, thereby transcending limitations of Principal Component Analysis (PCA), Independent Component Analysis (ICA) and other related methods that tend to produce dispersed components of positive and negative loadings. In particular, leveraging upon the well known ability of NNMF to produce parts-based representations of image data, we derive decompositions that partition the brain into regions that vary in consistent ways across individuals. Importantly, these decompositions achieve dimensionality reduction via highly interpretable ways and generalize well to new data as shown via split-sample experiments. We empirically validate NNMF in two data sets: i) a Diffusion Tensor (DT) mouse brain development study, and ii) a structural Magnetic Resonance (sMR) study of human brain aging. We demonstrate the ability of NNMF to produce sparse parts-based representations of the data at various resolutions. These representations seem to follow what we know about the underlying functional organization of the brain and also capture some pathological processes. Moreover, we show that these low dimensional representations favorably compare to descriptions obtained with more commonly used matrix factorization methods like PCA and ICA. Copyright © 2014 Elsevier Inc. All rights reserved.

Limited Rank Matrix Learning, discriminative dimension reduction and visualization.

PubMed

Bunte, Kerstin; Schneider, Petra; Hammer, Barbara; Schleif, Frank-Michael; Villmann, Thomas; Biehl, Michael

2012-02-01

We present an extension of the recently introduced Generalized Matrix Learning Vector Quantization algorithm. In the original scheme, adaptive square matrices of relevance factors parameterize a discriminative distance measure. We extend the scheme to matrices of limited rank corresponding to low-dimensional representations of the data. This allows to incorporate prior knowledge of the intrinsic dimension and to reduce the number of adaptive parameters efficiently. In particular, for very large dimensional data, the limitation of the rank can reduce computation time and memory requirements significantly. Furthermore, two- or three-dimensional representations constitute an efficient visualization method for labeled data sets. The identification of a suitable projection is not treated as a pre-processing step but as an integral part of the supervised training. Several real world data sets serve as an illustration and demonstrate the usefulness of the suggested method. Copyright © 2011 Elsevier Ltd. All rights reserved.

Scalar products of Bethe vectors in models with {\\mathfrak{gl}}(2| 1) symmetry 1. Super-analog of Reshetikhin formula

NASA Astrophysics Data System (ADS)

Hutsalyuk, A.; Liashyk, A.; Pakuliak, S. Z.; Ragoucy, E.; Slavnov, N. A.

2016-11-01

We study the scalar products of Bethe vectors in integrable models solvable by the nested algebraic Bethe ansatz and possessing {gl}(2| 1) symmetry. Using explicit formulas of the monodromy matrix entries’ multiple actions onto Bethe vectors we obtain a representation for the scalar product in the most general case. This explicit representation appears to be a sum over partitions of the Bethe parameters. It can be used for the analysis of scalar products involving on-shell Bethe vectors. As a by-product, we obtain a determinant representation for the scalar products of generic Bethe vectors in integrable models with {gl}(1| 1) symmetry. Dedicated to the memory of Petr Petrovich Kulish.

Distance learning in discriminative vector quantization.

PubMed

Schneider, Petra; Biehl, Michael; Hammer, Barbara

2009-10-01

Discriminative vector quantization schemes such as learning vector quantization (LVQ) and extensions thereof offer efficient and intuitive classifiers based on the representation of classes by prototypes. The original methods, however, rely on the Euclidean distance corresponding to the assumption that the data can be represented by isotropic clusters. For this reason, extensions of the methods to more general metric structures have been proposed, such as relevance adaptation in generalized LVQ (GLVQ) and matrix learning in GLVQ. In these approaches, metric parameters are learned based on the given classification task such that a data-driven distance measure is found. In this letter, we consider full matrix adaptation in advanced LVQ schemes. In particular, we introduce matrix learning to a recent statistical formalization of LVQ, robust soft LVQ, and we compare the results on several artificial and real-life data sets to matrix learning in GLVQ, a derivation of LVQ-like learning based on a (heuristic) cost function. In all cases, matrix adaptation allows a significant improvement of the classification accuracy. Interestingly, however, the principled behavior of the models with respect to prototype locations and extracted matrix dimensions shows several characteristic differences depending on the data sets.

Representation of the Coulomb Matrix Elements by Means of Appell Hypergeometric Function F 2

NASA Astrophysics Data System (ADS)

Bentalha, Zine el abidine

2018-06-01

Exact analytical representation for the Coulomb matrix elements by means of Appell's double series F 2 is derived. The finite sum obtained for the Appell function F 2 allows us to evaluate explicitly the matrix elements of the two-body Coulomb interaction in the lowest Landau level. An application requiring the matrix elements of Coulomb potential in quantum Hall effect regime is presented.

Generally astigmatic Gaussian beam representation and optimization using skew rays

NASA Astrophysics Data System (ADS)

Colbourne, Paul D.

2014-12-01

Methods are presented of using skew rays to optimize a generally astigmatic optical system to obtain the desired Gaussian beam focus and minimize aberrations, and to calculate the propagating generally astigmatic Gaussian beam parameters at any point. The optimization method requires very little computation beyond that of a conventional ray optimization, and requires no explicit calculation of the properties of the propagating Gaussian beam. Unlike previous methods, the calculation of beam parameters does not require matrix calculations or the introduction of non-physical concepts such as imaginary rays.

Matrix product operators, matrix product states, and ab initio density matrix renormalization group algorithms

NASA Astrophysics Data System (ADS)

Chan, Garnet Kin-Lic; Keselman, Anna; Nakatani, Naoki; Li, Zhendong; White, Steven R.

2016-07-01

Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.

Matrix product operators, matrix product states, and ab initio density matrix renormalization group algorithms.

PubMed

Chan, Garnet Kin-Lic; Keselman, Anna; Nakatani, Naoki; Li, Zhendong; White, Steven R

2016-07-07

Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.

Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra

NASA Astrophysics Data System (ADS)

Ablinger, J.; Behring, A.; Blümlein, J.; De Freitas, A.; von Manteuffel, A.; Schneider, C.

2016-05-01

Three loop ladder and V-topology diagrams contributing to the massive operator matrix element AQg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.

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

Niccoli, G.

The antiperiodic transfer matrices associated to higher spin representations of the rational 6-vertex Yang-Baxter algebra are analyzed by generalizing the approach introduced recently in the framework of Sklyanin's quantum separation of variables (SOV) for cyclic representations, spin-1/2 highest weight representations, and also for spin-1/2 representations of the 6-vertex reflection algebra. Such SOV approach allow us to derive exactly results which represent complicate tasks for more traditional methods based on Bethe ansatz and Baxter Q-operator. In particular, we both prove the completeness of the SOV characterization of the transfer matrix spectrum and its simplicity. Then, the derived characterization of local operatorsmore » by Sklyanin's quantum separate variables and the expression of the scalar products of separate states by determinant formulae allow us to compute the form factors of the local spin operators by one determinant formulae similar to those of the scalar products.« less

Matrix-Product-State Algorithm for Finite Fractional Quantum Hall Systems

NASA Astrophysics Data System (ADS)

Liu, Zhao; Bhatt, R. N.

2015-09-01

Exact diagonalization is a powerful tool to study fractional quantum Hall (FQH) systems. However, its capability is limited by the exponentially increasing computational cost. In order to overcome this difficulty, density-matrix-renormalization-group (DMRG) algorithms were developed for much larger system sizes. Very recently, it was realized that some model FQH states have exact matrix-product-state (MPS) representation. Motivated by this, here we report a MPS code, which is closely related to, but different from traditional DMRG language, for finite FQH systems on the cylinder geometry. By representing the many-body Hamiltonian as a matrix-product-operator (MPO) and using single-site update and density matrix correction, we show that our code can efficiently search the ground state of various FQH systems. We also compare the performance of our code with traditional DMRG. The possible generalization of our code to infinite FQH systems and other physical systems is also discussed.

Covariant n/sup 2/-plet mass formulas

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

Davidson, A.

Using a generalized internal symmetry group analogous to the Lorentz group, we have constructed a covariant n/sup 2/-plet mass operator. This operator is built as a scalar matrix in the (n;n*) representation, and its SU(n) breaking parameters are identified as intrinsic boost ones. Its basic properties are: covariance, Hermiticity, positivity, charge conjugation, quark contents, and a self-consistent n/sup 2/-1, 1 mixing. The GMO and the Okubo formulas are obtained by considering two different limits of the same generalized mass formula.

The association in a two-way contingency table through log odds ratio analysis: the case of Sarno river pollution.

PubMed

Camminatiello, Ida; D'Ambra, Antonello; Sarnacchiaro, Pasquale

2014-01-01

In this paper we are proposing a general framework for the analysis of the complete set of log Odds Ratios (ORs) generated by a two-way contingency table. Starting from the RC (M) association model and hypothesizing a Poisson distribution for the counts of the two-way contingency table we are obtaining the weighted Log Ratio Analysis that we are extending to the study of log ORs. Particularly we are obtaining an indirect representation of the log ORs and some synthesis measures. Then for studying the matrix of log ORs we are performing a generalized Singular Value Decomposition that allows us to obtain a direct representation of log ORs. We also expect to get summary measures of association too. We have considered the matrix of complete set of ORs, because, it is linked to the two-way contingency table in terms of variance and it allows us to represent all the ORs on a factorial plan. Finally, a two-way contingency table, which crosses pollution of the Sarno river and sampling points, is to be analyzed to illustrate the proposed framework.

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.

Density matrix renormalization group for a highly degenerate quantum system: Sliding environment block approach

NASA Astrophysics Data System (ADS)

Schmitteckert, Peter

2018-04-01

We present an infinite lattice density matrix renormalization group sweeping procedure which can be used as a replacement for the standard infinite lattice blocking schemes. Although the scheme is generally applicable to any system, its main advantages are the correct representation of commensurability issues and the treatment of degenerate systems. As an example we apply the method to a spin chain featuring a highly degenerate ground-state space where the new sweeping scheme provides an increase in performance as well as accuracy by many orders of magnitude compared to a recently published work.

Application of Semi-Definite Programming for Many-Fermion Systems

NASA Astrophysics Data System (ADS)

Zhao, Zhengji; Braams, Bastiaan; Fukuda, Mituhiro; Overton, Michael

2003-03-01

The ground state energy and other important observables of a many-fermion system with one- and two-body interactions only can all be obtained from the first order and second order Reduced Density Matrices (RDM's) of the system. Using these density matrices and a family of associated representability conditions one may obtain an approximation method for electronic structure theory that is in the mathematical form of Semi-Definite Programming (SDP): minimize a linear matrix functional over a space of positive semidefinite matrices subject to linear constraints. The representability conditions are some known necessary conditions, starting with the well-known P, Q, and G conditions [Claude Garrod and Jerome K. Percus, Reducation of the N-Particle Variational Problem, J. Math. Phys. 5 (1964) 1756-1776]. The RDM method with SDP has great potential advantages over the wave function method when the particle number N is large. The dimension of the full configuration space increases exponentially with N, but in RDM method with SDP the dimension of the objective matrix (which includes RDM's) increases only polynomially with N. We will report on the effect of adding the generalized three-index conditions proposed in [R. M. Erdahl, Representability, Int. J. Quantum Chem. 13 (1978) 697-718].

Symmetric quadratic Hamiltonians with pseudo-Hermitian matrix representation

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

Fernández, Francisco M., E-mail: fernande@quimica.unlp.edu.ar

2016-06-15

We prove that any symmetric Hamiltonian that is a quadratic function of the coordinates and momenta has a pseudo-Hermitian adjoint or regular matrix representation. The eigenvalues of the latter matrix are the natural frequencies of the Hamiltonian operator. When all the eigenvalues of the matrix are real, then the spectrum of the symmetric Hamiltonian is real and the operator is Hermitian. As illustrative examples we choose the quadratic Hamiltonians that model a pair of coupled resonators with balanced gain and loss, the electromagnetic self-force on an oscillating charged particle and an active LRC circuit. -- Highlights: •Symmetric quadratic operators aremore » useful models for many physical applications. •Any such operator exhibits a pseudo-Hermitian matrix representation. •Its eigenvalues are the natural frequencies of the Hamiltonian operator. •The eigenvalues may be real or complex and describe a phase transition.« less

Face recognition using tridiagonal matrix enhanced multivariance products representation

NASA Astrophysics Data System (ADS)

Ã-zay, Evrim Korkmaz

2017-01-01

This study aims to retrieve face images from a database according to a target face image. For this purpose, Tridiagonal Matrix Enhanced Multivariance Products Representation (TMEMPR) is taken into consideration. TMEMPR is a recursive algorithm based on Enhanced Multivariance Products Representation (EMPR). TMEMPR decomposes a matrix into three components which are a matrix of left support terms, a tridiagonal matrix of weight parameters for each recursion, and a matrix of right support terms, respectively. In this sense, there is an analogy between Singular Value Decomposition (SVD) and TMEMPR. However TMEMPR is a more flexible algorithm since its initial support terms (or vectors) can be chosen as desired. Low computational complexity is another advantage of TMEMPR because the algorithm has been constructed with recursions of certain arithmetic operations without requiring any iteration. The algorithm has been trained and tested with ORL face image database with 400 different grayscale images of 40 different people. TMEMPR's performance has been compared with SVD's performance as a result.

Theory and implementation of H-matrix based iterative and direct solvers for Helmholtz and elastodynamic oscillatory kernels

NASA Astrophysics Data System (ADS)

Chaillat, Stéphanie; Desiderio, Luca; Ciarlet, Patrick

2017-12-01

In this work, we study the accuracy and efficiency of hierarchical matrix (H-matrix) based fast methods for solving dense linear systems arising from the discretization of the 3D elastodynamic Green's tensors. It is well known in the literature that standard H-matrix based methods, although very efficient tools for asymptotically smooth kernels, are not optimal for oscillatory kernels. H2-matrix and directional approaches have been proposed to overcome this problem. However the implementation of such methods is much more involved than the standard H-matrix representation. The central questions we address are twofold. (i) What is the frequency-range in which the H-matrix format is an efficient representation for 3D elastodynamic problems? (ii) What can be expected of such an approach to model problems in mechanical engineering? We show that even though the method is not optimal (in the sense that more involved representations can lead to faster algorithms) an efficient solver can be easily developed. The capabilities of the method are illustrated on numerical examples using the Boundary Element Method.

New subspace methods for ATR

NASA Astrophysics Data System (ADS)

Zhang, Peng; Peng, Jing; Sims, S. Richard F.

2005-05-01

In ATR applications, each feature is a convolution of an image with a filter. It is important to use most discriminant features to produce compact representations. We propose two novel subspace methods for dimension reduction to address limitations associated with Fukunaga-Koontz Transform (FKT). The first method, Scatter-FKT, assumes that target is more homogeneous, while clutter can be anything other than target and anywhere. Thus, instead of estimating a clutter covariance matrix, Scatter-FKT computes a clutter scatter matrix that measures the spread of clutter from the target mean. We choose dimensions along which the difference in variation between target and clutter is most pronounced. When the target follows a Gaussian distribution, Scatter-FKT can be viewed as a generalization of FKT. The second method, Optimal Bayesian Subspace, is derived from the optimal Bayesian classifier. It selects dimensions such that the minimum Bayes error rate can be achieved. When both target and clutter follow Gaussian distributions, OBS computes optimal subspace representations. We compare our methods against FKT using character image as well as IR data.

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.

Kohn-Sham potentials from electron densities using a matrix representation within finite atomic orbital basis sets

NASA Astrophysics Data System (ADS)

Zhang, Xing; Carter, Emily A.

2018-01-01

We revisit the static response function-based Kohn-Sham (KS) inversion procedure for determining the KS effective potential that corresponds to a given target electron density within finite atomic orbital basis sets. Instead of expanding the potential in an auxiliary basis set, we directly update the potential in its matrix representation. Through numerical examples, we show that the reconstructed density rapidly converges to the target density. Preliminary results are presented to illustrate the possibility of obtaining a local potential in real space from the optimized potential in its matrix representation. We have further applied this matrix-based KS inversion approach to density functional embedding theory. A proof-of-concept study of a solvated proton transfer reaction demonstrates the method's promise.

Matrix elements for type 1 unitary irreducible representations of the Lie superalgebra gl(m|n)

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

Gould, Mark D.; Isaac, Phillip S.; Werry, Jason L.

Using our recent results on eigenvalues of invariants associated to the Lie superalgebra gl(m|n), we use characteristic identities to derive explicit matrix element formulae for all gl(m|n) generators, particularly non-elementary generators, on finite dimensional type 1 unitary irreducible representations. We compare our results with existing works that deal with only subsets of the class of type 1 unitary representations, all of which only present explicit matrix elements for elementary generators. Our work therefore provides an important extension to existing methods, and thus highlights the strength of our techniques which exploit the characteristic identities.

CPDES3: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in three dimensions

NASA Astrophysics Data System (ADS)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on three-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES3 allows each spatial operator to have 7, 15, 19, or 27 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect induces which is vectorizable on some of the newer scientific computers.

CPDES2: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in two dimensions

NASA Astrophysics Data System (ADS)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on two-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES2 allows each spatial operator to have 5 or 9 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect indices which is vectorizable on some of the newer scientific computers.

Ward Identity and Scattering Amplitudes for Nonlinear Sigma Models

NASA Astrophysics Data System (ADS)

Low, Ian; Yin, Zhewei

2018-02-01

We present a Ward identity for nonlinear sigma models using generalized nonlinear shift symmetries, without introducing current algebra or coset space. The Ward identity constrains correlation functions of the sigma model such that the Adler's zero is guaranteed for S -matrix elements, and gives rise to a subleading single soft theorem that is valid at the quantum level and to all orders in the Goldstone decay constant. For tree amplitudes, the Ward identity leads to a novel Berends-Giele recursion relation as well as an explicit form of the subleading single soft factor. Furthermore, interactions of the cubic biadjoint scalar theory associated with the single soft limit, which was previously discovered using the Cachazo-He-Yuan representation of tree amplitudes, can be seen to emerge from matrix elements of conserved currents corresponding to the generalized shift symmetry.

Discriminative Relational Topic Models.

PubMed

Chen, Ning; Zhu, Jun; Xia, Fei; Zhang, Bo

2015-05-01

Relational topic models (RTMs) provide a probabilistic generative process to describe both the link structure and document contents for document networks, and they have shown promise on predicting network structures and discovering latent topic representations. However, existing RTMs have limitations in both the restricted model expressiveness and incapability of dealing with imbalanced network data. To expand the scope and improve the inference accuracy of RTMs, this paper presents three extensions: 1) unlike the common link likelihood with a diagonal weight matrix that allows the-same-topic interactions only, we generalize it to use a full weight matrix that captures all pairwise topic interactions and is applicable to asymmetric networks; 2) instead of doing standard Bayesian inference, we perform regularized Bayesian inference (RegBayes) with a regularization parameter to deal with the imbalanced link structure issue in real networks and improve the discriminative ability of learned latent representations; and 3) instead of doing variational approximation with strict mean-field assumptions, we present collapsed Gibbs sampling algorithms for the generalized relational topic models by exploring data augmentation without making restricting assumptions. Under the generic RegBayes framework, we carefully investigate two popular discriminative loss functions, namely, the logistic log-loss and the max-margin hinge loss. Experimental results on several real network datasets demonstrate the significance of these extensions on improving prediction performance.

Classical simulation of quantum many-body systems

NASA Astrophysics Data System (ADS)

Huang, Yichen

Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In particular, merely encoding a generic quantum many-body state requires an exponential number of bits. However, condensed matter physicists are mostly interested in local Hamiltonians and especially their ground states, which are highly non-generic. Thus, we might hope that at least some physical systems allow efficient classical simulation. Starting with one-dimensional (1D) quantum systems (i.e., the simplest nontrivial case), the first basic question is: Which classes of states have efficient classical representations? It turns out that this question is quantitatively related to the amount of entanglement in the state, for states with "little entanglement'' are well approximated by matrix product states (a data structure that can be manipulated efficiently on a classical computer). At a technical level, the mathematical notion for "little entanglement'' is area law, which has been proved for unique ground states in 1D gapped systems. We establish an area law for constant-fold degenerate ground states in 1D gapped systems and thus explain the effectiveness of matrix-product-state methods in (e.g.) symmetry breaking phases. This result might not be intuitively trivial as degenerate ground states in gapped systems can be long-range correlated. Suppose an efficient classical representation exists. How can one find it efficiently? The density matrix renormalization group is the leading numerical method for computing ground states in 1D quantum systems. However, it is a heuristic algorithm and the possibility that it may fail in some cases cannot be completely ruled out. Recently, a provably efficient variant of the density matrix renormalization group has been developed for frustration-free 1D gapped systems. We generalize this algorithm to all (i.e., possibly frustrated) 1D gapped systems. Note that the ground-state energy of 1D gapless Hamiltonians is computationally intractable even in the presence of translational invariance. It is tempting to extend methods and tools in 1D to two and higher dimensions (2+D), e.g., matrix product states are generalized to tensor network states. Since an area law for entanglement (if formulated properly) implies efficient matrix product state representations in 1D, an interesting question is whether a similar implication holds in 2+D. Roughly speaking, we show that an area law for entanglement (in any reasonable formulation) does not always imply efficient tensor network representations of the ground states of 2+D local Hamiltonians even in the presence of translational invariance. It should be emphasized that this result does not contradict with the common sense that in practice quantum states with more entanglement usually require more space to be stored classically; rather, it demonstrates that the relationship between entanglement and efficient classical representations is still far from being well understood. Excited eigenstates participate in the dynamics of quantum systems and are particularly relevant to the phenomenon of many-body localization (absence of transport at finite temperature in strongly correlated systems). We study the entanglement of excited eigenstates in random spin chains and expect that its singularities coincide with dynamical quantum phase transitions. This expectation is confirmed in the disordered quantum Ising chain using both analytical and numerical methods. Finally, we study the problem of generating ground states (possibly with topological order) in 1D gapped systems using quantum circuits. This is an interesting problem both in theory and in practice. It not only characterizes the essential difference between the entanglement patterns that give rise to trivial and nontrivial topological order, but also quantifies the difficulty of preparing quantum states with a quantum computer (in experiments).

Higher rank ABJM Wilson loops from matrix models

DOE PAGES

Cookmeyer, Jonathan; Liu, James T.; Pando Zayas, Leopoldo A.

2016-11-21

We compute the vacuum expectation values of 1/6 supersymmetric Wilson loops in higher dimensional representations of the gauge group in ABJM theory. We then present results for the m-symmetric and m-antisymmetric representations by exploiting standard matrix model techniques. At leading order, in the saddle point approximation, our expressions reproduce holographic results from both D6 and D2 branes corresponding to the antisymmetric and symmetric representations, respectively. We also compute 1/N corrections to the leading saddle point results.

Computing Generalized Matrix Inverse on Spiking Neural Substrate.

PubMed

Shukla, Rohit; Khoram, Soroosh; Jorgensen, Erik; Li, Jing; Lipasti, Mikko; Wright, Stephen

2018-01-01

Emerging neural hardware substrates, such as IBM's TrueNorth Neurosynaptic System, can provide an appealing platform for deploying numerical algorithms. For example, a recurrent Hopfield neural network can be used to find the Moore-Penrose generalized inverse of a matrix, thus enabling a broad class of linear optimizations to be solved efficiently, at low energy cost. However, deploying numerical algorithms on hardware platforms that severely limit the range and precision of representation for numeric quantities can be quite challenging. This paper discusses these challenges and proposes a rigorous mathematical framework for reasoning about range and precision on such substrates. The paper derives techniques for normalizing inputs and properly quantizing synaptic weights originating from arbitrary systems of linear equations, so that solvers for those systems can be implemented in a provably correct manner on hardware-constrained neural substrates. The analytical model is empirically validated on the IBM TrueNorth platform, and results show that the guarantees provided by the framework for range and precision hold under experimental conditions. Experiments with optical flow demonstrate the energy benefits of deploying a reduced-precision and energy-efficient generalized matrix inverse engine on the IBM TrueNorth platform, reflecting 10× to 100× improvement over FPGA and ARM core baselines.

Eikonal Scattering in the sdg Interacting Boson Model:. Analytical Results in the SUsdg(3) Limit and Their Generalizations

NASA Astrophysics Data System (ADS)

Kota, V. K. B.

General expression for the representation matrix elements in the SUsdg(3) limit of the sdg interacting boson model (sdgIBM) is derived that determine the scattering amplitude in the eikonal approximation for medium energy proton-nucleus scattering when the target nucleus is deformed and it is described by the SUsdg(3) limit. The SUsdg(3) result is generalized to two important situations: (i) when the target nucleus ground band states are described as states arising out of angular momentum projection from a general single Kπ = 0+ intrinsic state in sdg space; (ii) for rotational bands built on one-phonon excitations in sdgIBM.

Exact solution of corner-modified banded block-Toeplitz eigensystems

NASA Astrophysics Data System (ADS)

Cobanera, Emilio; Alase, Abhijeet; Ortiz, Gerardo; Viola, Lorenza

2017-05-01

Motivated by the challenge of seeking a rigorous foundation for the bulk-boundary correspondence for free fermions, we introduce an algorithm for determining exactly the spectrum and a generalized-eigenvector basis of a class of banded block quasi-Toeplitz matrices that we call corner-modified. Corner modifications of otherwise arbitrary banded block-Toeplitz matrices capture the effect of boundary conditions and the associated breakdown of translational invariance. Our algorithm leverages the interplay between a non-standard, projector-based method of kernel determination (physically, a bulk-boundary separation) and families of linear representations of the algebra of matrix Laurent polynomials. Thanks to the fact that these representations act on infinite-dimensional carrier spaces in which translation symmetry is restored, it becomes possible to determine the eigensystem of an auxiliary projected block-Laurent matrix. This results in an analytic eigenvector Ansatz, independent of the system size, which we prove is guaranteed to contain the full solution of the original finite-dimensional problem. The actual solution is then obtained by imposing compatibility with a boundary matrix, whose shape is also independent of system size. As an application, we show analytically that eigenvectors of short-ranged fermionic tight-binding models may display power-law corrections to exponential behavior, and demonstrate the phenomenon for the paradigmatic Majorana chain of Kitaev.

Computational neural networks in chemistry: Model free mapping devices for predicting chemical reactivity from molecular structure

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

Elrod, D.W.

1992-01-01

Computational neural networks (CNNs) are a computational paradigm inspired by the brain's massively parallel network of highly interconnected neurons. The power of computational neural networks derives not so much from their ability to model the brain as from their ability to learn by example and to map highly complex, nonlinear functions, without the need to explicitly specify the functional relationship. Two central questions about CNNs were investigated in the context of predicting chemical reactions: (1) the mapping properties of neural networks and (2) the representation of chemical information for use in CNNs. Chemical reactivity is here considered an example ofmore » a complex, nonlinear function of molecular structure. CNN's were trained using modifications of the back propagation learning rule to map a three dimensional response surface similar to those typically observed in quantitative structure-activity and structure-property relationships. The computational neural network's mapping of the response surface was found to be robust to the effects of training sample size, noisy data and intercorrelated input variables. The investigation of chemical structure representation led to the development of a molecular structure-based connection-table representation suitable for neural network training. An extension of this work led to a BE-matrix structure representation that was found to be general for several classes of reactions. The CNN prediction of chemical reactivity and regiochemistry was investigated for electrophilic aromatic substitution reactions, Markovnikov addition to alkenes, Saytzeff elimination from haloalkanes, Diels-Alder cycloaddition, and retro Diels-Alder ring opening reactions using these connectivity-matrix derived representations. The reaction predictions made by the CNNs were more accurate than those of an expert system and were comparable to predictions made by chemists.« less

SU(p,q) coherent states and a Gaussian de Finetti theorem

NASA Astrophysics Data System (ADS)

Leverrier, Anthony

2018-04-01

We prove a generalization of the quantum de Finetti theorem when the local space is an infinite-dimensional Fock space. In particular, instead of considering the action of the permutation group on n copies of that space, we consider the action of the unitary group U(n) on the creation operators of the n modes and define a natural generalization of the symmetric subspace as the space of states invariant under unitaries in U(n). Our first result is a complete characterization of this subspace, which turns out to be spanned by a family of generalized coherent states related to the special unitary group SU(p, q) of signature (p, q). More precisely, this construction yields a unitary representation of the noncompact simple real Lie group SU(p, q). We therefore find a dual unitary representation of the pair of groups U(n) and SU(p, q) on an n(p + q)-mode Fock space. The (Gaussian) SU(p, q) coherent states resolve the identity on the symmetric subspace, which implies a Gaussian de Finetti theorem stating that tracing over a few modes of a unitary-invariant state yields a state close to a mixture of Gaussian states. As an application of this de Finetti theorem, we show that the n × n upper-left submatrix of an n × n Haar-invariant unitary matrix is close in total variation distance to a matrix of independent normal variables if n3 = O(m).

Spatial Pyramid Covariance based Compact Video Code for Robust Face Retrieval in TV-series.

PubMed

Li, Yan; Wang, Ruiping; Cui, Zhen; Shan, Shiguang; Chen, Xilin

2016-10-10

We address the problem of face video retrieval in TV-series which searches video clips based on the presence of specific character, given one face track of his/her. This is tremendously challenging because on one hand, faces in TV-series are captured in largely uncontrolled conditions with complex appearance variations, and on the other hand retrieval task typically needs efficient representation with low time and space complexity. To handle this problem, we propose a compact and discriminative representation for the huge body of video data, named Compact Video Code (CVC). Our method first models the face track by its sample (i.e., frame) covariance matrix to capture the video data variations in a statistical manner. To incorporate discriminative information and obtain more compact video signature suitable for retrieval, the high-dimensional covariance representation is further encoded as a much lower-dimensional binary vector, which finally yields the proposed CVC. Specifically, each bit of the code, i.e., each dimension of the binary vector, is produced via supervised learning in a max margin framework, which aims to make a balance between the discriminability and stability of the code. Besides, we further extend the descriptive granularity of covariance matrix from traditional pixel-level to more general patchlevel, and proceed to propose a novel hierarchical video representation named Spatial Pyramid Covariance (SPC) along with a fast calculation method. Face retrieval experiments on two challenging TV-series video databases, i.e., the Big Bang Theory and Prison Break, demonstrate the competitiveness of the proposed CVC over state-of-the-art retrieval methods. In addition, as a general video matching algorithm, CVC is also evaluated in traditional video face recognition task on a standard Internet database, i.e., YouTube Celebrities, showing its quite promising performance by using an extremely compact code with only 128 bits.

Graph-Theoretic Representations for Proximity Matrices through Strongly-Anti-Robinson or Circular Strongly-Anti-Robinson Matrices.

ERIC Educational Resources Information Center

Hubert, Lawrence; Arabie, Phipps; Meulman, Jacqueline

1998-01-01

Introduces a method for fitting order-constrained matrices that satisfy the strongly anti-Robinson restrictions (SAR). The method permits a representation of the fitted values in a (least-squares) SAR approximating matrix as lengths of paths in a graph. The approach is illustrated with a published proximity matrix. (SLD)

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, K.; Milman, M.

1988-01-01

A powerful new spatial operator algebra for modeling, control, and trajectory design of manipulators is discussed along with its implementation in the Ada programming language. Applications of this algebra to robotics include an operator representation of the manipulator Jacobian matrix; the robot dynamical equations formulated in terms of the spatial algebra, showing the complete equivalence between the recursive Newton-Euler formulations to robot dynamics; the operator factorization and inversion of the manipulator mass matrix which immediately results in O(N) recursive forward dynamics algorithms; the joint accelerations of a manipulator due to a tip contact force; the recursive computation of the equivalent mass matrix as seen at the tip of a manipulator; and recursive forward dynamics of a closed chain system. Finally, additional applications and current research involving the use of the spatial operator algebra are discussed in general terms.

Experimental and numerical characterization of the sound pressure in standing wave acoustic levitators

NASA Astrophysics Data System (ADS)

Stindt, A.; Andrade, M. A. B.; Albrecht, M.; Adamowski, J. C.; Panne, U.; Riedel, J.

2014-01-01

A novel method for predictions of the sound pressure distribution in acoustic levitators is based on a matrix representation of the Rayleigh integral. This method allows for a fast calculation of the acoustic field within the resonator. To make sure that the underlying assumptions and simplifications are justified, this approach was tested by a direct comparison to experimental data. The experimental sound pressure distributions were recorded by high spatially resolved frequency selective microphone scanning. To emphasize the general applicability of the two approaches, the comparative studies were conducted for four different resonator geometries. In all cases, the results show an excellent agreement, demonstrating the accuracy of the matrix method.

Variational Optimization of the Second-Order Density Matrix Corresponding to a Seniority-Zero Configuration Interaction Wave Function.

PubMed

Poelmans, Ward; Van Raemdonck, Mario; Verstichel, Brecht; De Baerdemacker, Stijn; Torre, Alicia; Lain, Luis; Massaccesi, Gustavo E; Alcoba, Diego R; Bultinck, Patrick; Van Neck, Dimitri

2015-09-08

We perform a direct variational determination of the second-order (two-particle) density matrix corresponding to a many-electron system, under a restricted set of the two-index N-representability P-, Q-, and G-conditions. In addition, we impose a set of necessary constraints that the two-particle density matrix must be derivable from a doubly occupied many-electron wave function, i.e., a singlet wave function for which the Slater determinant decomposition only contains determinants in which spatial orbitals are doubly occupied. We rederive the two-index N-representability conditions first found by Weinhold and Wilson and apply them to various benchmark systems (linear hydrogen chains, He, N2, and CN(-)). This work is motivated by the fact that a doubly occupied many-electron wave function captures in many cases the bulk of the static correlation. Compared to the general case, the structure of doubly occupied two-particle density matrices causes the associate semidefinite program to have a very favorable scaling as L(3), where L is the number of spatial orbitals. Since the doubly occupied Hilbert space depends on the choice of the orbitals, variational calculation steps of the two-particle density matrix are interspersed with orbital-optimization steps (based on Jacobi rotations in the space of the spatial orbitals). We also point to the importance of symmetry breaking of the orbitals when performing calculations in a doubly occupied framework.

Generic construction of efficient matrix product operators

NASA Astrophysics Data System (ADS)

Hubig, C.; McCulloch, I. P.; Schollwöck, U.

2017-01-01

Matrix product operators (MPOs) are at the heart of the second-generation density matrix renormalization group (DMRG) algorithm formulated in matrix product state language. We first summarize the widely known facts on MPO arithmetic and representations of single-site operators. Second, we introduce three compression methods (rescaled SVD, deparallelization, and delinearization) for MPOs and show that it is possible to construct efficient representations of arbitrary operators using MPO arithmetic and compression. As examples, we construct powers of a short-ranged spin-chain Hamiltonian, a complicated Hamiltonian of a two-dimensional system and, as proof of principle, the long-range four-body Hamiltonian from quantum chemistry.

Modeling the missile-launch tube problem in DYSCO

NASA Technical Reports Server (NTRS)

Berman, Alex; Gustavson, Bruce A.

1989-01-01

DYSCO is a versatile, general purpose dynamic analysis program which assembles equations and solves dynamics problems. The executive manages a library of technology modules which contain routines that compute the matrix coefficients of the second order ordinary differential equations of the components. The executive performs the coupling of the equations of the components and manages the solution of the coupled equations. Any new component representation may be added to the library if, given the state vector, a FORTRAN program can be written to compute M, C, K, and F. The problem described demonstrates the generality of this statement.

Second-order discrete Kalman filtering equations for control-structure interaction simulations

NASA Technical Reports Server (NTRS)

Park, K. C.; Belvin, W. Keith; Alvin, Kenneth F.

1991-01-01

A general form for the first-order representation of the continuous, second-order linear structural dynamics equations is introduced in order to derive a corresponding form of first-order Kalman filtering equations (KFE). Time integration of the resulting first-order KFE is carried out via a set of linear multistep integration formulas. It is shown that a judicious combined selection of computational paths and the undetermined matrices introduced in the general form of the first-order linear structural systems leads to a class of second-order discrete KFE involving only symmetric, N x N solution matrix.

Matrix product state description of Halperin states

NASA Astrophysics Data System (ADS)

Crépel, V.; Estienne, B.; Bernevig, B. A.; Lecheminant, P.; Regnault, N.

2018-04-01

Many fractional quantum Hall states can be expressed as a correlator of a given conformal field theory used to describe their edge physics. As a consequence, these states admit an economical representation as an exact matrix product state (MPS) that was extensively studied for the systems without any spin or any other internal degrees of freedom. In that case, the correlators are built from a single electronic operator, which is primary with respect to the underlying conformal field theory. We generalize this construction to the archetype of Abelian multicomponent fractional quantum Hall wave functions, the Halperin states. These can be written as conformal blocks involving multiple electronic operators and we explicitly derive their exact MPS representation. In particular, we deal with the caveat of the full wave-function symmetry and show that any additional SU(2) symmetry is preserved by the natural MPS truncation scheme provided by the conformal dimension. We use our method to characterize the topological order of the Halperin states by extracting the topological entanglement entropy. We also evaluate their bulk correlation lengths, which are compared to plasma analogy arguments.

beachmat: A Bioconductor C++ API for accessing high-throughput biological data from a variety of R matrix types

PubMed Central

Pagès, Hervé

2018-01-01

Biological experiments involving genomics or other high-throughput assays typically yield a data matrix that can be explored and analyzed using the R programming language with packages from the Bioconductor project. Improvements in the throughput of these assays have resulted in an explosion of data even from routine experiments, which poses a challenge to the existing computational infrastructure for statistical data analysis. For example, single-cell RNA sequencing (scRNA-seq) experiments frequently generate large matrices containing expression values for each gene in each cell, requiring sparse or file-backed representations for memory-efficient manipulation in R. These alternative representations are not easily compatible with high-performance C++ code used for computationally intensive tasks in existing R/Bioconductor packages. Here, we describe a C++ interface named beachmat, which enables agnostic data access from various matrix representations. This allows package developers to write efficient C++ code that is interoperable with dense, sparse and file-backed matrices, amongst others. We evaluated the performance of beachmat for accessing data from each matrix representation using both simulated and real scRNA-seq data, and defined a clear memory/speed trade-off to motivate the choice of an appropriate representation. We also demonstrate how beachmat can be incorporated into the code of other packages to drive analyses of a very large scRNA-seq data set. PMID:29723188

beachmat: A Bioconductor C++ API for accessing high-throughput biological data from a variety of R matrix types.

PubMed

Lun, Aaron T L; Pagès, Hervé; Smith, Mike L

2018-05-01

Biological experiments involving genomics or other high-throughput assays typically yield a data matrix that can be explored and analyzed using the R programming language with packages from the Bioconductor project. Improvements in the throughput of these assays have resulted in an explosion of data even from routine experiments, which poses a challenge to the existing computational infrastructure for statistical data analysis. For example, single-cell RNA sequencing (scRNA-seq) experiments frequently generate large matrices containing expression values for each gene in each cell, requiring sparse or file-backed representations for memory-efficient manipulation in R. These alternative representations are not easily compatible with high-performance C++ code used for computationally intensive tasks in existing R/Bioconductor packages. Here, we describe a C++ interface named beachmat, which enables agnostic data access from various matrix representations. This allows package developers to write efficient C++ code that is interoperable with dense, sparse and file-backed matrices, amongst others. We evaluated the performance of beachmat for accessing data from each matrix representation using both simulated and real scRNA-seq data, and defined a clear memory/speed trade-off to motivate the choice of an appropriate representation. We also demonstrate how beachmat can be incorporated into the code of other packages to drive analyses of a very large scRNA-seq data set.

Method for making 2-electron response reduced density matrices approximately N-representable

NASA Astrophysics Data System (ADS)

Lanssens, Caitlin; Ayers, Paul W.; Van Neck, Dimitri; De Baerdemacker, Stijn; Gunst, Klaas; Bultinck, Patrick

2018-02-01

In methods like geminal-based approaches or coupled cluster that are solved using the projected Schrödinger equation, direct computation of the 2-electron reduced density matrix (2-RDM) is impractical and one falls back to a 2-RDM based on response theory. However, the 2-RDMs from response theory are not N-representable. That is, the response 2-RDM does not correspond to an actual physical N-electron wave function. We present a new algorithm for making these non-N-representable 2-RDMs approximately N-representable, i.e., it has the right symmetry and normalization and it fulfills the P-, Q-, and G-conditions. Next to an algorithm which can be applied to any 2-RDM, we have also developed a 2-RDM optimization procedure specifically for seniority-zero 2-RDMs. We aim to find the 2-RDM with the right properties which is the closest (in the sense of the Frobenius norm) to the non-N-representable 2-RDM by minimizing the square norm of the difference between this initial response 2-RDM and the targeted 2-RDM under the constraint that the trace is normalized and the 2-RDM, Q-matrix, and G-matrix are positive semidefinite, i.e., their eigenvalues are non-negative. Our method is suitable for fixing non-N-representable 2-RDMs which are close to being N-representable. Through the N-representability optimization algorithm we add a small correction to the initial 2-RDM such that it fulfills the most important N-representability conditions.

On the asymptotic states and the quantum S matrix of the η-deformed AdS 5 × S 5 superstring

DOE PAGES

Engelund, Oluf Tang; Roiban, Radu

2015-03-31

We investigate the worldsheet S matrix of string theory in η-deformed AdS 5 × S 5. By computing the six-point tree-level S matrix we explicitly show that there is no particle production at this level, as required by the classical integrability of the theory. At one and two loops we show that integrability requires that the classical two-particle states be redefined in a non-local and η-dependent way. This is a significant departure from the undeformed theory which is probably related to the quantum group symmetry of the worldsheet theory. We use generalized unitarity to carry out the loop calculations andmore » identify a set of integrals that allow us to give a two-loop Feynman integral representation of the logarithmic terms of the two-loop S matrix. We finally also discuss aspects of the calculation of the two-loop rational terms.« less

Finding a Hadamard matrix by simulated annealing of spin vectors

NASA Astrophysics Data System (ADS)

Bayu Suksmono, Andriyan

2017-05-01

Reformulation of a combinatorial problem into optimization of a statistical-mechanics system enables finding a better solution using heuristics derived from a physical process, such as by the simulated annealing (SA). In this paper, we present a Hadamard matrix (H-matrix) searching method based on the SA on an Ising model. By equivalence, an H-matrix can be converted into a seminormalized Hadamard (SH) matrix, whose first column is unit vector and the rest ones are vectors with equal number of -1 and +1 called SH-vectors. We define SH spin vectors as representation of the SH vectors, which play a similar role as the spins on Ising model. The topology of the lattice is generalized into a graph, whose edges represent orthogonality relationship among the SH spin vectors. Starting from a randomly generated quasi H-matrix Q, which is a matrix similar to the SH-matrix without imposing orthogonality, we perform the SA. The transitions of Q are conducted by random exchange of {+, -} spin-pair within the SH-spin vectors that follow the Metropolis update rule. Upon transition toward zeroth energy, the Q-matrix is evolved following a Markov chain toward an orthogonal matrix, at which the H-matrix is said to be found. We demonstrate the capability of the proposed method to find some low-order H-matrices, including the ones that cannot trivially be constructed by the Sylvester method.

The open XXX spin chain in the SoV framework: scalar product of separate states

NASA Astrophysics Data System (ADS)

Kitanine, N.; Maillet, J. M.; Niccoli, G.; Terras, V.

2017-06-01

We consider the XXX open spin-1/2 chain with the most general non-diagonal boundary terms, that we solve by means of the quantum separation of variables (SoV) approach. We compute the scalar products of separate states, a class of states which notably contains all the eigenstates of the model. As usual for models solved by SoV, these scalar products can be expressed as some determinants with a non-trivial dependance in terms of the inhomogeneity parameters that have to be introduced for the method to be applicable. We show that these determinants can be transformed into alternative ones in which the homogeneous limit can easily be taken. These new representations can be considered as generalizations of the well-known determinant representation for the scalar products of the Bethe states of the periodic chain. In the particular case where a constraint is applied on the boundary parameters, such that the transfer matrix spectrum and eigenstates can be characterized in terms of polynomial solutions of a usual T-Q equation, the scalar product that we compute here corresponds to the scalar product between two off-shell Bethe-type states. If in addition one of the states is an eigenstate, the determinant representation can be simplified, hence leading in this boundary case to direct analogues of algebraic Bethe ansatz determinant representations of the scalar products for the periodic chain.

Derivatives in discrete mathematics: a novel graph-theoretical invariant for generating new 2/3D molecular descriptors. I. Theory and QSPR application

NASA Astrophysics Data System (ADS)

Marrero-Ponce, Yovani; Santiago, Oscar Martínez; López, Yoan Martínez; Barigye, Stephen J.; Torrens, Francisco

2012-11-01

In this report, we present a new mathematical approach for describing chemical structures of organic molecules at atomic-molecular level, proposing for the first time the use of the concept of the derivative ( partial ) of a molecular graph (MG) with respect to a given event ( E), to obtain a new family of molecular descriptors (MDs). With this purpose, a new matrix representation of the MG, which generalizes graph's theory's traditional incidence matrix, is introduced. This matrix, denominated the generalized incidence matrix, Q, arises from the Boolean representation of molecular sub- graphs that participate in the formation of the graph molecular skeleton MG and could be complete (representing all possible connected sub-graphs) or constitute sub-graphs of determined orders or types as well as a combination of these. The Q matrix is a non-quadratic and unsymmetrical in nature, its columns ( n) and rows ( m) are conditions (letters) and collection of conditions (words) with which the event occurs. This non-quadratic and unsymmetrical matrix is transformed, by algebraic manipulation, to a quadratic and symmetric matrix known as relations frequency matrix, F, which characterizes the participation intensity of the conditions (letters) in the events (words). With F, we calculate the derivative over a pair of atomic nuclei. The local index for the atomic nuclei i, Δ i , can therefore be obtained as a linear combination of all the pair derivatives of the atomic nuclei i with all the rest of the j's atomic nuclei. Here, we also define new strategies that generalize the present form of obtaining global or local (group or atom-type) invariants from atomic contributions (local vertex invariants, LOVIs). In respect to this, metric (norms), means and statistical invariants are introduced. These invariants are applied to a vector whose components are the values Δ i for the atomic nuclei of the molecule or its fragments. Moreover, with the purpose of differentiating among different atoms, an atomic weighting scheme (atom-type labels) is used in the formation of the matrix Q or in LOVIs state. The obtained indices were utilized to describe the partition coefficient (Log P) and the reactivity index (Log K) of the 34 derivatives of 2-furylethylenes. In all the cases, our MDs showed better statistical results than those previously obtained using some of the most used families of MDs in chemometric practice. Therefore, it has been demonstrated to that the proposed MDs are useful in molecular design and permit obtaining easier and robust mathematical models than the majority of those reported in the literature. All this range of mentioned possibilities open "the doors" to the creation of a new family of MDs, using the graph derivative, and avail a new tool for QSAR/QSPR and molecular diversity/similarity studies.

Derivatives in discrete mathematics: a novel graph-theoretical invariant for generating new 2/3D molecular descriptors. I. Theory and QSPR application.

PubMed

Marrero-Ponce, Yovani; Santiago, Oscar Martínez; López, Yoan Martínez; Barigye, Stephen J; Torrens, Francisco

2012-11-01

In this report, we present a new mathematical approach for describing chemical structures of organic molecules at atomic-molecular level, proposing for the first time the use of the concept of the derivative ([Formula: see text]) of a molecular graph (MG) with respect to a given event (E), to obtain a new family of molecular descriptors (MDs). With this purpose, a new matrix representation of the MG, which generalizes graph's theory's traditional incidence matrix, is introduced. This matrix, denominated the generalized incidence matrix, Q, arises from the Boolean representation of molecular sub-graphs that participate in the formation of the graph molecular skeleton MG and could be complete (representing all possible connected sub-graphs) or constitute sub-graphs of determined orders or types as well as a combination of these. The Q matrix is a non-quadratic and unsymmetrical in nature, its columns (n) and rows (m) are conditions (letters) and collection of conditions (words) with which the event occurs. This non-quadratic and unsymmetrical matrix is transformed, by algebraic manipulation, to a quadratic and symmetric matrix known as relations frequency matrix, F, which characterizes the participation intensity of the conditions (letters) in the events (words). With F, we calculate the derivative over a pair of atomic nuclei. The local index for the atomic nuclei i, Δ(i), can therefore be obtained as a linear combination of all the pair derivatives of the atomic nuclei i with all the rest of the j's atomic nuclei. Here, we also define new strategies that generalize the present form of obtaining global or local (group or atom-type) invariants from atomic contributions (local vertex invariants, LOVIs). In respect to this, metric (norms), means and statistical invariants are introduced. These invariants are applied to a vector whose components are the values Δ(i) for the atomic nuclei of the molecule or its fragments. Moreover, with the purpose of differentiating among different atoms, an atomic weighting scheme (atom-type labels) is used in the formation of the matrix Q or in LOVIs state. The obtained indices were utilized to describe the partition coefficient (Log P) and the reactivity index (Log K) of the 34 derivatives of 2-furylethylenes. In all the cases, our MDs showed better statistical results than those previously obtained using some of the most used families of MDs in chemometric practice. Therefore, it has been demonstrated to that the proposed MDs are useful in molecular design and permit obtaining easier and robust mathematical models than the majority of those reported in the literature. All this range of mentioned possibilities open "the doors" to the creation of a new family of MDs, using the graph derivative, and avail a new tool for QSAR/QSPR and molecular diversity/similarity studies.

On the formulation of a minimal uncertainty model for robust control with structured uncertainty

NASA Technical Reports Server (NTRS)

Belcastro, Christine M.; Chang, B.-C.; Fischl, Robert

1991-01-01

In the design and analysis of robust control systems for uncertain plants, representing the system transfer matrix in the form of what has come to be termed an M-delta model has become widely accepted and applied in the robust control literature. The M represents a transfer function matrix M(s) of the nominal closed loop system, and the delta represents an uncertainty matrix acting on M(s). The nominal closed loop system M(s) results from closing the feedback control system, K(s), around a nominal plant interconnection structure P(s). The uncertainty can arise from various sources, such as structured uncertainty from parameter variations or multiple unsaturated uncertainties from unmodeled dynamics and other neglected phenomena. In general, delta is a block diagonal matrix, but for real parameter variations delta is a diagonal matrix of real elements. Conceptually, the M-delta structure can always be formed for any linear interconnection of inputs, outputs, transfer functions, parameter variations, and perturbations. However, very little of the currently available literature addresses computational methods for obtaining this structure, and none of this literature addresses a general methodology for obtaining a minimal M-delta model for a wide class of uncertainty, where the term minimal refers to the dimension of the delta matrix. Since having a minimally dimensioned delta matrix would improve the efficiency of structured singular value (or multivariable stability margin) computations, a method of obtaining a minimal M-delta would be useful. Hence, a method of obtaining the interconnection system P(s) is required. A generalized procedure for obtaining a minimal P-delta structure for systems with real parameter variations is presented. Using this model, the minimal M-delta model can then be easily obtained by closing the feedback loop. The procedure involves representing the system in a cascade-form state-space realization, determining the minimal uncertainty matrix, delta, and constructing the state-space representation of P(s). Three examples are presented to illustrate the procedure.

Tensor models, Kronecker coefficients and permutation centralizer algebras

NASA Astrophysics Data System (ADS)

Geloun, Joseph Ben; Ramgoolam, Sanjaye

2017-11-01

We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin decompositions into matrix blocks are given in terms of Clebsch-Gordan coefficients of symmetric groups. The matrix basis for the algebras also gives an orthogonal basis for the tensor observables which diagonalizes the Gaussian two-point functions. The centres of the algebras are associated with correlators which are expressible in terms of Kronecker coefficients (Clebsch-Gordan multiplicities of symmetric groups). The color-exchange symmetry present in the Gaussian model, as well as a large class of interacting models, is used to refine the description of the permutation centralizer algebras. This discussion is extended to a general number of colors d: it is used to prove the integrality of an infinite family of number sequences related to color-symmetrizations of colored graphs, and expressible in terms of symmetric group representation theory data. Generalizing a connection between matrix models and Belyi maps, correlators in Gaussian tensor models are interpreted in terms of covers of singular 2-complexes. There is an intriguing difference, between matrix and higher rank tensor models, in the computational complexity of superficially comparable correlators of observables parametrized by Young diagrams.

Computing Generalized Matrix Inverse on Spiking Neural Substrate

PubMed Central

Shukla, Rohit; Khoram, Soroosh; Jorgensen, Erik; Li, Jing; Lipasti, Mikko; Wright, Stephen

2018-01-01

Emerging neural hardware substrates, such as IBM's TrueNorth Neurosynaptic System, can provide an appealing platform for deploying numerical algorithms. For example, a recurrent Hopfield neural network can be used to find the Moore-Penrose generalized inverse of a matrix, thus enabling a broad class of linear optimizations to be solved efficiently, at low energy cost. However, deploying numerical algorithms on hardware platforms that severely limit the range and precision of representation for numeric quantities can be quite challenging. This paper discusses these challenges and proposes a rigorous mathematical framework for reasoning about range and precision on such substrates. The paper derives techniques for normalizing inputs and properly quantizing synaptic weights originating from arbitrary systems of linear equations, so that solvers for those systems can be implemented in a provably correct manner on hardware-constrained neural substrates. The analytical model is empirically validated on the IBM TrueNorth platform, and results show that the guarantees provided by the framework for range and precision hold under experimental conditions. Experiments with optical flow demonstrate the energy benefits of deploying a reduced-precision and energy-efficient generalized matrix inverse engine on the IBM TrueNorth platform, reflecting 10× to 100× improvement over FPGA and ARM core baselines. PMID:29593483

Control Synthesis of Discrete-Time T-S Fuzzy Systems: Reducing the Conservatism Whilst Alleviating the Computational Burden.

PubMed

Xie, Xiangpeng; Yue, Dong; Zhang, Huaguang; Peng, Chen

2017-09-01

The augmented multi-indexed matrix approach acts as a powerful tool in reducing the conservatism of control synthesis of discrete-time Takagi-Sugeno fuzzy systems. However, its computational burden is sometimes too heavy as a tradeoff. Nowadays, reducing the conservatism whilst alleviating the computational burden becomes an ideal but very challenging problem. This paper is toward finding an efficient way to achieve one of satisfactory answers. Different from the augmented multi-indexed matrix approach in the literature, we aim to design a more efficient slack variable approach under a general framework of homogenous matrix polynomials. Thanks to the introduction of a new extended representation for homogeneous matrix polynomials, related matrices with the same coefficient are collected together into one sole set and thus those redundant terms of the augmented multi-indexed matrix approach can be removed, i.e., the computational burden can be alleviated in this paper. More importantly, due to the fact that more useful information is involved into control design, the conservatism of the proposed approach as well is less than the counterpart of the augmented multi-indexed matrix approach. Finally, numerical experiments are given to show the effectiveness of the proposed approach.

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.

Characterizing the inverses of block tridiagonal, block Toeplitz matrices

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

Boffi, Nicholas M.; Hill, Judith C.; Reuter, Matthew G.

2014-12-04

We consider the inversion of block tridiagonal, block Toeplitz matrices and comment on the behaviour of these inverses as one moves away from the diagonal. Using matrix M bius transformations, we first present an O(1) representation (with respect to the number of block rows and block columns) for the inverse matrix and subsequently use this representation to characterize the inverse matrix. There are four symmetry-distinct cases where the blocks of the inverse matrix (i) decay to zero on both sides of the diagonal, (ii) oscillate on both sides, (iii) decay on one side and oscillate on the other and (iv)more » decay on one side and grow on the other. This characterization exposes the necessary conditions for the inverse matrix to be numerically banded and may also aid in the design of preconditioners and fast algorithms. Finally, we present numerical examples of these matrix types.« less

Hamiltonian structure and Darboux theorem for families of generalized Lotka-Volterra systems

NASA Astrophysics Data System (ADS)

Hernández-Bermejo, Benito; Fairén, Víctor

1998-11-01

This work is devoted to the establishment of a Poisson structure for a format of equations known as generalized Lotka-Volterra systems. These equations, which include the classical Lotka-Volterra systems as a particular case, have been deeply studied in the literature. They have been shown to constitute a whole hierarchy of systems, the characterization of which is made in the context of simple algebra. Our main result is to show that this algebraic structure is completely translatable into the Poisson domain. Important Poisson structures features, such as the symplectic foliation and the Darboux canonical representation, rise as a result of rather simple matrix manipulations.

Dynamic graph system for a semantic database

DOEpatents

Mizell, David

2016-04-12

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Dynamic graph system for a semantic database

DOEpatents

Mizell, David

2015-01-27

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Smoothed low rank and sparse matrix recovery by iteratively reweighted least squares minimization.

PubMed

Lu, Canyi; Lin, Zhouchen; Yan, Shuicheng

2015-02-01

This paper presents a general framework for solving the low-rank and/or sparse matrix minimization problems, which may involve multiple nonsmooth terms. The iteratively reweighted least squares (IRLSs) method is a fast solver, which smooths the objective function and minimizes it by alternately updating the variables and their weights. However, the traditional IRLS can only solve a sparse only or low rank only minimization problem with squared loss or an affine constraint. This paper generalizes IRLS to solve joint/mixed low-rank and sparse minimization problems, which are essential formulations for many tasks. As a concrete example, we solve the Schatten-p norm and l2,q-norm regularized low-rank representation problem by IRLS, and theoretically prove that the derived solution is a stationary point (globally optimal if p,q ≥ 1). Our convergence proof of IRLS is more general than previous one that depends on the special properties of the Schatten-p norm and l2,q-norm. Extensive experiments on both synthetic and real data sets demonstrate that our IRLS is much more efficient.

Performance and Accuracy of LAPACK's Symmetric TridiagonalEigensolvers

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

Demmel, Jim W.; Marques, Osni A.; Parlett, Beresford N.

2007-04-19

We compare four algorithms from the latest LAPACK 3.1 release for computing eigenpairs of a symmetric tridiagonal matrix. These include QR iteration, bisection and inverse iteration (BI), the Divide-and-Conquer method (DC), and the method of Multiple Relatively Robust Representations (MR). Our evaluation considers speed and accuracy when computing all eigenpairs, and additionally subset computations. Using a variety of carefully selected test problems, our study includes a variety of today's computer architectures. Our conclusions can be summarized as follows. (1) DC and MR are generally much faster than QR and BI on large matrices. (2) MR almost always does the fewestmore » floating point operations, but at a lower MFlop rate than all the other algorithms. (3) The exact performance of MR and DC strongly depends on the matrix at hand. (4) DC and QR are the most accurate algorithms with observed accuracy O({radical}ne). The accuracy of BI and MR is generally O(ne). (5) MR is preferable to BI for subset computations.« less

Entanglement classification in the noninteracting Fermi gas

NASA Astrophysics Data System (ADS)

Jafarizadeh, M. A.; Eghbalifam, F.; Nami, S.; Yahyavi, M.

In this paper, entanglement classification shared among the spins of localized fermions in the noninteracting Fermi gas is studied. It is proven that the Fermi gas density matrix is block diagonal on the basis of the projection operators to the irreducible representations of symmetric group Sn. Every block of density matrix is in the form of the direct product of a matrix and identity matrix. Then it is useful to study entanglement in every block of density matrix separately. The basis of corresponding Hilbert space are identified from the Schur-Weyl duality theorem. Also, it can be shown that the symmetric part of the density matrix is fully separable. Then it has been shown that the entanglement measure which is introduced in Eltschka et al. [New J. Phys. 10, 043104 (2008)] and Guhne et al. [New J. Phys. 7, 229 (2005)], is zero for the even n qubit Fermi gas density matrix. Then by focusing on three spin reduced density matrix, the entanglement classes have been investigated. In three qubit states there is an entanglement measure which is called 3-tangle. It can be shown that 3-tangle is zero for three qubit density matrix, but the density matrix is not biseparable for all possible values of its parameters and its eigenvectors are in the form of W-states. Then an entanglement witness for detecting non-separable state and an entanglement witness for detecting nonbiseparable states, have been introduced for three qubit density matrix by using convex optimization problem. Finally, the four spin reduced density matrix has been investigated by restricting the density matrix to the irreducible representations of Sn. The restricted density matrix to the subspaces of the irreducible representations: Ssym, S3,1 and S2,2 are denoted by ρsym, ρ3,1 and ρ2,2, respectively. It has been shown that some highly entangled classes (by using the results of Miyake [Phys. Rev. A 67, 012108 (2003)] for entanglement classification) do not exist in the blocks of density matrix ρ3,1 and ρ2,2, so these classes do not exist in the total Fermi gas density matrix.

BPS States, Crystals, and Matrices

DOE PAGES

Sułkowski, Piotr

2011-01-01

We review free fermion, melting crystal, and matrix model representations of wall-crossing phenomena on local, toric Calabi-Yau manifolds. We consider both unrefined and refined BPS counting of closed BPS states involving D2- and D0-branes bound to a D6-brane, as well as open BPS states involving open D2-branes ending on an additional D4-brane. Appropriate limit of these constructions provides, among the others, matrix model representation of refined and unrefined topological string amplitudes.

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.

Semi-analytical Karhunen-Loeve representation of irregular waves based on the prolate spheroidal wave functions

NASA Astrophysics Data System (ADS)

Lee, Gibbeum; Cho, Yeunwoo

2018-01-01

A new semi-analytical approach is presented to solving the matrix eigenvalue problem or the integral equation in Karhunen-Loeve (K-L) representation of random data such as irregular ocean waves. Instead of direct numerical approach to this matrix eigenvalue problem, which may suffer from the computational inaccuracy for big data, a pair of integral and differential equations are considered, which are related to the so-called prolate spheroidal wave functions (PSWF). First, the PSWF is expressed as a summation of a small number of the analytical Legendre functions. After substituting them into the PSWF differential equation, a much smaller size matrix eigenvalue problem is obtained than the direct numerical K-L matrix eigenvalue problem. By solving this with a minimal numerical effort, the PSWF and the associated eigenvalue of the PSWF differential equation are obtained. Then, the eigenvalue of the PSWF integral equation is analytically expressed by the functional values of the PSWF and the eigenvalues obtained in the PSWF differential equation. Finally, the analytically expressed PSWFs and the eigenvalues in the PWSF integral equation are used to form the kernel matrix in the K-L integral equation for the representation of exemplary wave data such as ordinary irregular waves. It is found that, with the same accuracy, the required memory size of the present method is smaller than that of the direct numerical K-L representation and the computation time of the present method is shorter than that of the semi-analytical method based on the sinusoidal functions.

Algebro-geometric approach for a centrally extended Uq[sl(2|2)] R-matrix

NASA Astrophysics Data System (ADS)

Martins, M. J.

2017-04-01

In this paper we investigate the algebraic geometric nature of a solution of the Yang-Baxter equation based on the quantum deformation of the centrally extended sl (2 | 2) superalgebra proposed by Beisert and Koroteev [1]. We derive an alternative representation for the R-matrix in which the matrix elements are given in terms of rational functions depending on weights sited on a degree six surface. For generic gauge the weights geometry are governed by a genus one ruled surface while for a symmetric gauge choice the weights lie instead on a genus five curve. We have written down the polynomial identities satisfied by the R-matrix entries needed to uncover the corresponding geometric properties. For arbitrary gauge the R-matrix geometry is argued to be birational to the direct product CP1 ×CP1 × A where A is an Abelian surface. For the symmetric gauge we present evidences that the geometric content is that of a surface of general type lying on the so-called Severi line with irregularity two and geometric genus nine. We discuss potential geometric degenerations when the two free couplings are restricted to certain one-dimensional subspaces.

Factorization of differential expansion for non-rectangular representations

NASA Astrophysics Data System (ADS)

Morozov, A.

2018-04-01

Factorization of the differential expansion (DE) coefficients for colored HOMFLY-PT polynomials of antiparallel double braids, originally discovered for rectangular representations R, in the case of rectangular representations R, is extended to the first non-rectangular representations R = [2, 1] and R = [3, 1]. This increases chances that such factorization will take place for generic R, thus fixing the shape of the DE. We illustrate the power of the method by conjecturing the DE-induced expression for double-braid polynomials for all R = [r, 1]. In variance with the rectangular case, the knowledge for double braids is not fully sufficient to deduce the exclusive Racah matrix S¯ — the entries in the sectors with nontrivial multiplicities sum up and remain unseparated. Still, a considerable piece of the matrix is extracted directly and its other elements can be found by solving the unitarity constraints.

Matrix approaches to assess terrestrial nitrogen scheme in CLM4.5

NASA Astrophysics Data System (ADS)

Du, Z.

2017-12-01

Terrestrial carbon (C) and nitrogen (N) cycles have been commonly represented by a series of balance equations to track their influxes into and effluxes out of individual pools in earth system models (ESMs). This representation matches our understanding of C and N cycle processes well but makes it difficult to track model behaviors. To overcome these challenges, we developed a matrix approach, which reorganizes the series of terrestrial C and N balance equations in the CLM4.5 into two matrix equations based on original representation of C and N cycle processes and mechanisms. The matrix approach would consequently help improve the comparability of models and data, evaluate impacts of additional model components, facilitate benchmark analyses, model intercomparisons, and data-model fusion, and improve model predictive power.

Polynomial Supertree Methods Revisited

PubMed Central

Brinkmeyer, Malte; Griebel, Thasso; Böcker, Sebastian

2011-01-01

Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an extensive simulation study comparing the performance of MRP and the polynomial supertree methods MinCut Supertree, Modified MinCut Supertree, Build-with-distances, PhySIC, PhySIC_IST, and super distance matrix. We consider both quality and resolution of the reconstructed supertrees. Our findings illustrate the tradeoff between accuracy and running time in supertree construction, as well as the pros and cons of voting- and veto-based supertree approaches. Based on our results, we make some general suggestions for supertree methods yet to come. PMID:22229028

The neuroscience of body memory: From the self through the space to the others.

PubMed

Riva, Giuseppe

2017-07-25

Our experience of the body is not direct; rather, it is mediated by perceptual information, influenced by internal information, and recalibrated through stored implicit and explicit body representation (body memory). This paper presents an overview of the current investigations related to body memory by bringing together recent studies from neuropsychology, neuroscience, and evolutionary and cognitive psychology. To do so, in the paper, I explore the origin of representations of human body to elucidate their developmental process and, in particular, their relationship with more explicit concepts of self. First, it is suggested that our bodily experience is constructed from early development through the continuous integration of sensory and cultural data from six different representations of the body, i.e., the Sentient Body (Minimal Selfhood), the Spatial Body (Self Location), the Active Body (Agency), the Personal Body (Whole Body Ownership - Me); the Objectified Body (Objectified Self - Mine), and the Social Body (Body Satisfaction - Ideal Me). Then, it is suggested that these six representations can be combined in a coherent supramodal representation, i.e. the "body matrix", through a predictive, multisensory processing activated by central, top-down, attentional processes. From an evolutionary perspective, the main goal of the body matrix is to allow the self to protect and extend its boundaries at both the homeostatic and psychological levels. From one perspective, the self extends its boundaries (peripersonal space) through the enactment and recognition of motor schemas. From another perspective, the body matrix, by defining the boundaries of the body, also defines where the self is present, i.e., in the body that is processed by the body matrix as the most likely to be its one, and in the space surrounding it. In the paper I also introduce and discuss the concept of "embodied medicine": the use of advanced technology for altering the body matrix with the goal of improving our health and well-being. Copyright © 2017 The Author(s). Published by Elsevier Ltd.. All rights reserved.

A real-space stochastic density matrix approach for density functional electronic structure.

PubMed

Beck, Thomas L

2015-12-21

The recent development of real-space grid methods has led to more efficient, accurate, and adaptable approaches for large-scale electrostatics and density functional electronic structure modeling. With the incorporation of multiscale techniques, linear-scaling real-space solvers are possible for density functional problems if localized orbitals are used to represent the Kohn-Sham energy functional. These methods still suffer from high computational and storage overheads, however, due to extensive matrix operations related to the underlying wave function grid representation. In this paper, an alternative stochastic method is outlined that aims to solve directly for the one-electron density matrix in real space. In order to illustrate aspects of the method, model calculations are performed for simple one-dimensional problems that display some features of the more general problem, such as spatial nodes in the density matrix. This orbital-free approach may prove helpful considering a future involving increasingly parallel computing architectures. Its primary advantage is the near-locality of the random walks, allowing for simultaneous updates of the density matrix in different regions of space partitioned across the processors. In addition, it allows for testing and enforcement of the particle number and idempotency constraints through stabilization of a Feynman-Kac functional integral as opposed to the extensive matrix operations in traditional approaches.

Exponentially more precise quantum simulation of fermions in the configuration interaction representation

NASA Astrophysics Data System (ADS)

Babbush, Ryan; Berry, Dominic W.; Sanders, Yuval R.; Kivlichan, Ian D.; Scherer, Artur; Wei, Annie Y.; Love, Peter J.; Aspuru-Guzik, Alán

2018-01-01

We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in Babbush et al (2016 New Journal of Physics 18, 033032), we employ a recently developed technique for simulating Hamiltonian evolution using a truncated Taylor series to obtain logarithmic scaling with the inverse of the desired precision. The algorithm of this paper involves simulation under an oracle for the sparse, first-quantized representation of the molecular Hamiltonian known as the configuration interaction (CI) matrix. We construct and query the CI matrix oracle to allow for on-the-fly computation of molecular integrals in a way that is exponentially more efficient than classical numerical methods. Whereas second-quantized representations of the wavefunction require \\widetilde{{ O }}(N) qubits, where N is the number of single-particle spin-orbitals, the CI matrix representation requires \\widetilde{{ O }}(η ) qubits, where η \\ll N is the number of electrons in the molecule of interest. We show that the gate count of our algorithm scales at most as \\widetilde{{ O }}({η }2{N}3t).

Matrix elements of hyperfine structure operators in the SL and jj representations for the s, p{sup N}, and d{sup N} configurations and the SL-jj transformation

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

Childs, W.J.

1997-09-01

Matrix elements of the hyperfine operators corresponding to the magnetic-dipole (A) and electric-quadrupole (B) hyperfine structures constants are given as linear combinations of the appropriate radial integrals for all states of the s, p{sup N}, and d{sub N} configurations in both the SL and pure jj representations. The associated SL-jj transformations are also given. 13 refs., 10 tabs.

Communication: GAIMS—Generalized Ab Initio Multiple Spawning for both internal conversion and intersystem crossing processes

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

Curchod, Basile F. E.; Martínez, Todd J., E-mail: toddjmartinez@gmail.com; SLAC National Accelerator Laboratory, Menlo Park, California 94025

2016-03-14

Full multiple spawning is a formally exact method to describe the excited-state dynamics of molecular systems beyond the Born-Oppenheimer approximation. However, it has been limited until now to the description of radiationless transitions taking place between electronic states with the same spin multiplicity. This Communication presents a generalization of the full and ab initio multiple spawning methods to both internal conversion (mediated by nonadiabatic coupling terms) and intersystem crossing events (triggered by spin-orbit coupling matrix elements) based on a spin-diabatic representation. The results of two numerical applications, a model system and the deactivation of thioformaldehyde, validate the presented formalism andmore » its implementation.« less

Vector-valued Jack polynomials and wavefunctions on the torus

NASA Astrophysics Data System (ADS)

Dunkl, Charles F.

2017-06-01

The Hamiltonian of the quantum Calogero-Sutherland model of N identical particles on the circle with 1/r 2 interactions has eigenfunctions consisting of Jack polynomials times the base state. By use of the generalized Jack polynomials taking values in modules of the symmetric group and the matrix solution of a system of linear differential equations one constructs novel eigenfunctions of the Hamiltonian. Like the usual wavefunctions each eigenfunction determines a symmetric probability density on the N-torus. The construction applies to any irreducible representation of the symmetric group. The methods depend on the theory of generalized Jack polynomials due to Griffeth, and the Yang-Baxter graph approach of Luque and the author.

Communication: GAIMS—generalized ab initio multiple spawning for both internal conversion and intersystem crossing processes

DOE PAGES

Curchod, Basile F. E.; Rauer, Clemens; Marquetand, Philipp; ...

2016-03-11

Full Multiple Spawning is a formally exact method to describe the excited-state dynamics of molecular systems beyond the Born-Oppenheimer approximation. However, it has been limited until now to the description of radiationless transitions taking place between electronic states with the same spin multiplicity. This Communication presents a generalization of the full and ab initio Multiple Spawning methods to both internal conversion (mediated by nonadiabatic coupling terms) and intersystem crossing events (triggered by spin-orbit coupling matrix elements) based on a spin-diabatic representation. Lastly, the results of two numerical applications, a model system and the deactivation of thioformaldehyde, validate the presented formalismmore » and its implementation.« less

Coupled tensorial forms of the second-order effective Hamiltonian for open-subshell atoms in jj-coupling

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

Jursenas, Rytis, E-mail: Rytis.Jursenas@tfai.vu.l; Merkelis, Gintaras

2011-01-15

General expressions for the second-order effective atomic Hamiltonian are derived for open-subshell atoms in jj-coupling. The expansion terms are presented as N-body (N=0,1,2,3) effective operators given in the second quantization representation in coupled tensorial form. Two alternative coupled tensorial forms for each expansion term have been developed. To reduce the number of expressions of the effective Hamiltonian, the reduced matrix elements of antisymmetric two-particle wavefunctions are involved in the consideration. The general expressions presented allow the determination of the spin-angular part of expansion terms when studying correlation effects dealing with a number of problems in atomic structure calculations.

Comment on "Nonuniqueness of algebraic first-order density-matrix functionals"

NASA Astrophysics Data System (ADS)

Gritsenko, O. V.

2018-02-01

Wang and Knowles (WK) [Phys. Rev. A 92, 012520 (2015), 10.1103/PhysRevA.92.012520] have given a counterexample to the conventional in reduced density-matrix functional theory representation of the second-order reduced density matrix (2RDM) Γi j ,k l in the basis of the natural orbitals as a function Γi j ,k l(n ) of the orbital occupation numbers (ONs) ni. The observed nonuniqueness of Γi j ,k l for prototype systems of different symmetry has been interpreted as the inherent inability of ON functions to reproduce the 2RDM, due to the insufficient information contained in the 1RDM spectrum. In this Comment, it is argued that, rather than totally invalidating Γi j ,k l(n ) , the WK example exposes its symmetry dependence which, as well as the previously established analogous dependence in density functional theory, is demonstrated with a general formulation based on the Levy constrained search.

A New Local Debonding Model with Application to the Transverse Tensile and Creep Behavior of Continuously Reinforced Titanium Composites

NASA Technical Reports Server (NTRS)

Bednarcyk, Brett A.; Arnold, Steven M.

2000-01-01

A new, widely applicable model for local interfacial debonding in composite materials is presented. Unlike its direct predecessors, the new model allows debonding to progress via unloading of interfacial stresses even as global loading of the composite continues. Previous debonding models employed for analysis of titanium matrix composites are surpassed by the accuracy, simplicity, and efficiency demonstrated by the new model. The new model was designed to operate seamlessly within NASA Glenn's Micromechanics Analysis Code with Generalized Method of Cells (MAC/GMC), which was employed to simulate the time- and rate-dependent (viscoplastic) transverse tensile and creep behavior of SiC/Ti composites. MAC/GMC's ability to simulate the transverse behavior of titanium matrix composites has been significantly improved by the new debonding model. Further, results indicate the need for a more accurate constitutive representation of the titanium matrix behavior in order to enable predictions of the composite transverse response, without resorting to recalibration of the debonding model parameters.

Almost analytical Karhunen-Loeve representation of irregular waves based on the prolate spheroidal wave functions

NASA Astrophysics Data System (ADS)

Lee, Gibbeum; Cho, Yeunwoo

2017-11-01

We present an almost analytical new approach to solving the matrix eigenvalue problem or the integral equation in Karhunen-Loeve (K-L) representation of random data such as irregular ocean waves. Instead of solving this matrix eigenvalue problem purely numerically, which may suffer from the computational inaccuracy for big data, first, we consider a pair of integral and differential equations, which are related to the so-called prolate spheroidal wave functions (PSWF). For the PSWF differential equation, the pair of the eigenvectors (PSWF) and eigenvalues can be obtained from a relatively small number of analytical Legendre functions. Then, the eigenvalues in the PSWF integral equation are expressed in terms of functional values of the PSWF and the eigenvalues of the PSWF differential equation. Finally, the analytically expressed PSWFs and the eigenvalues in the PWSF integral equation are used to form the kernel matrix in the K-L integral equation for the representation of exemplary wave data; ordinary irregular waves and rogue waves. We found that the present almost analytical method is better than the conventional data-independent Fourier representation and, also, the conventional direct numerical K-L representation in terms of both accuracy and computational cost. This work was supported by the National Research Foundation of Korea (NRF). (NRF-2017R1D1A1B03028299).

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…

Prolongation structures of nonlinear evolution equations

NASA Technical Reports Server (NTRS)

Wahlquist, H. D.; Estabrook, F. B.

1975-01-01

A technique is developed for systematically deriving a 'prolongation structure' - a set of interrelated potentials and pseudopotentials - for nonlinear partial differential equations in two independent variables. When this is applied to the Korteweg-de Vries equation, a new infinite set of conserved quantities is obtained. Known solution techniques are shown to result from the discovery of such a structure: related partial differential equations for the potential functions, linear 'inverse scattering' equations for auxiliary functions, Backlund transformations. Generalizations of these techniques will result from the use of irreducible matrix representations of the prolongation structure.

A non-symmetric Yang-Baxter algebra for the quantum nonlinear Schrödinger model

NASA Astrophysics Data System (ADS)

Vlaar, Bart

2013-06-01

We study certain non-symmetric wavefunctions associated with the quantum nonlinear Schrödinger model, introduced by Komori and Hikami using Gutkin’s propagation operator, which involves representations of the degenerate affine Hecke algebra. We highlight how these functions can be generated using a vertex-type operator formalism similar to the recursion defining the symmetric (Bethe) wavefunction in the quantum inverse scattering method. Furthermore, some of the commutation relations encoded in the Yang-Baxter equation for the relevant monodromy matrix are generalized to the non-symmetric case.

Transfer matrix spectrum for cyclic representations of the 6-vertex reflection algebra by quantum separation of variables

NASA Astrophysics Data System (ADS)

Pezelier, Baptiste

2018-02-01

In this proceeding, we recall the notion of quantum integrable systems on a lattice and then introduce the Sklyanin’s Separation of Variables method. We sum up the main results for the transfer matrix spectral problem for the cyclic representations of the trigonometric 6-vertex reflection algebra associated to the Bazanov-Stroganov Lax operator. These results apply as well to the spectral analysis of the lattice sine-Gordon model with open boundary conditions. The transfer matrix spectrum (both eigenvalues and eigenstates) is completely characterized in terms of the set of solutions to a discrete system of polynomial equations. We state an equivalent characterization as the set of solutions to a Baxter’s like T-Q functional equation, allowing us to rewrite the transfer matrix eigenstates in an algebraic Bethe ansatz form.

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

Do Public Involvement Activities in Biomedical Research and Innovation Recruit Representatively? A Systematic Qualitative Review.

PubMed

Lander, Jonas; Hainz, Tobias; Hirschberg, Irene; Bossert, Sabine; Strech, Daniel

2016-01-01

Public involvement activities (PIAs) may contribute to the governance of ethically challenging biomedical research and innovation by informing, consulting with and engaging the public in developments and decision-making processes. For PIAs to capture a population's preferences (e.g. on issues in whole genome sequencing, biobanks or genome editing), a central methodological requirement is to involve a sufficiently representative subgroup of the general public. While the existing literature focusses on theoretical and normative aspects of 'representation', this study assesses empirically how such considerations are implemented in practice. It evaluates how PIA reports describe representation objectives, the recruitment process and levels of representation achieved. PIA reports were included from a systematic literature search if they directly reported a PIA conducted in a relevant discipline such as genomics, biobanks, biotechnology or others. PIA reports were analyzed with thematic text analysis. The text analysis was guided by an assessment matrix based on PIA-specific guidelines and frameworks. We included 46 relevant reports, most focusing on issues in genomics. 27 reports (59%) explicitly described representation objectives, though mostly without adjusting eligibility criteria and recruiting methods to the specific objective. 11 reports (24%) explicitly reported to have achieved the intended representation; the rest either reported failure or were silent on this issue. Representation of study samples in PIAs in biomedical research and innovation is currently not reported systematically. Improved reporting on representation would not only improve the validity and value of PIAs, but could also contribute to PIA results being used more often in relevant policy and decision-making processes. © 2016 S. Karger AG, Basel.

Extended spin symmetry and the standard model

NASA Astrophysics Data System (ADS)

Besprosvany, J.; Romero, R.

2010-12-01

We review unification ideas and explain the spin-extended model in this context. Its consideration is also motivated by the standard-model puzzles. With the aim of constructing a common description of discrete degrees of freedom, as spin and gauge quantum numbers, the model departs from q-bits and generalized Hilbert spaces. Physical requirements reduce the space to one that is represented by matrices. The classification of the representations is performed through Clifford algebras, with its generators associated with Lorentz and scalar symmetries. We study a reduced space with up to two spinor elements within a matrix direct product. At given dimension, the demand that Lorentz symmetry be maintained, determines the scalar symmetries, which connect to vector-and-chiral gauge-interacting fields; we review the standard-model information in each dimension. We obtain fermions and bosons, with matter fields in the fundamental representation, radiation fields in the adjoint, and scalar particles with the Higgs quantum numbers. We relate the fields' representation in such spaces to the quantum-field-theory one, and the Lagrangian. The model provides a coupling-constant definition.

Another elementary proof of the Jordan form of a matrix

NASA Astrophysics Data System (ADS)

Budhi, Wono Setya

2012-05-01

In this paper we establish the Jordan Form for a matrix using the elementary concepts of vector differentiation and partial fractions. The idea comes from the resolvent of the operator. For the matrix, the Laurent series is finite and easy to compute through rational representation. We also give a proof of some famous theorems in matrix analysis as consequences from the result.

Visual Tracking Based on Extreme Learning Machine and Sparse Representation

PubMed Central

Wang, Baoxian; Tang, Linbo; Yang, Jinglin; Zhao, Baojun; Wang, Shuigen

2015-01-01

The existing sparse representation-based visual trackers mostly suffer from both being time consuming and having poor robustness problems. To address these issues, a novel tracking method is presented via combining sparse representation and an emerging learning technique, namely extreme learning machine (ELM). Specifically, visual tracking can be divided into two consecutive processes. Firstly, ELM is utilized to find the optimal separate hyperplane between the target observations and background ones. Thus, the trained ELM classification function is able to remove most of the candidate samples related to background contents efficiently, thereby reducing the total computational cost of the following sparse representation. Secondly, to further combine ELM and sparse representation, the resultant confidence values (i.e., probabilities to be a target) of samples on the ELM classification function are used to construct a new manifold learning constraint term of the sparse representation framework, which tends to achieve robuster results. Moreover, the accelerated proximal gradient method is used for deriving the optimal solution (in matrix form) of the constrained sparse tracking model. Additionally, the matrix form solution allows the candidate samples to be calculated in parallel, thereby leading to a higher efficiency. Experiments demonstrate the effectiveness of the proposed tracker. PMID:26506359

Three Interpretations of the Matrix Equation Ax = b

ERIC Educational Resources Information Center

Larson, Christine; Zandieh, Michelle

2013-01-01

Many of the central ideas in an introductory undergraduate linear algebra course are closely tied to a set of interpretations of the matrix equation Ax = b (A is a matrix, x and b are vectors): linear combination interpretations, systems interpretations, and transformation interpretations. We consider graphic and symbolic representations for each,…

Assessment of Matrix Multiplication Learning with a Rule-Based Analytical Model--"A Bayesian Network Representation"

ERIC Educational Resources Information Center

Zhang, Zhidong

2016-01-01

This study explored an alternative assessment procedure to examine learning trajectories of matrix multiplication. It took rule-based analytical and cognitive task analysis methods specifically to break down operation rules for a given matrix multiplication. Based on the analysis results, a hierarchical Bayesian network, an assessment model,…

Introduction to Matrix Algebra, Student's Text, Unit 23.

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

Unit 23 in the SMSG secondary school mathematics series is a student text covering the following topics in matrix algebra: matrix operations, the algebra of 2 X 2 matrices, matrices and linear systems, representation of column matrices as geometric vectors, and transformations of the plane. Listed in the appendix are four research exercises in…

Green's function of multi-layered poroelastic half-space for models of ground vibration due to railway traffic

NASA Astrophysics Data System (ADS)

Wang, Futong; Tao, Xiaxin; Xie, Lili; Raj, Siddharthan

2017-04-01

This study proposes a Green's function, an essential representation of water-saturated ground under moving excitation, to simulate ground borne vibration from trains. First, general solutions to the governing equations of poroelastic medium are derived by means of integral transform. Secondly, the transmission and reflection matrix approach is used to formulate the relationship between displacement and stress of the stratified ground, which results in the matrix of the Green's function. Then the Green's function is combined into a train-track-ground model, and is verified by typical examples and a field test. Additional simulations show that the computed ground vibration attenuates faster in the immediate vicinity of the track than in the surrounding area. The wavelength of wheel-rail unevenness has a notable effect on computed displacement and pore pressure. The variation of vibration intensity with the depth of ground is significantly influenced by the layering of the strata soil. When the train speed is equal to the velocity of the Rayleigh wave, the Mach cone appears in the simulated wave field. The proposed Green's function is an appropriate representation for a layered ground with shallow ground water table, and will be helpful to understand the dynamic responses of the ground to complicated moving excitation.

Helicopter vibration suppression using simple pendulum absorbers on the rotor blade

NASA Technical Reports Server (NTRS)

Hamouda, M.-N. H.; Pierce, G. A.

1981-01-01

A design procedure is presented for the installation of simple pendulums on the blades of a helicopter rotor to suppress the root reactions. The procedure consists of a frequency response analysis for a hingeless rotor blade excited by a harmonic variation of spanwise airload distributions during forward flight, as well as a concentrated load at the tip. The structural modeling of the blade provides for elastic degrees of freedom in flap and lead-lag bending plus torsion. Simple flap and lead-lag pendulums are considered individually. Using a rational order scheme, the general nonlinear equations of motion are linearized. A quasi-steady aerodynamic representation is used in the formation of the airloads. The solution of the system equations derives from their representation as a transfer matrix. The results include the effect of pendulum tuning on the minimization of the hub reactions.

Some applications of the Kronecker product in Hubbard representation

NASA Astrophysics Data System (ADS)

Enríquez, Marco; Rosas-Ortiz, Oscar

2014-10-01

The properties of the Kronecker product are revisited in terms of Hubbard operators. The simplest representation of a Hubbard operator Xi,jn is a square matrix of size n with an entry equal to 1 and zero elsewhere. This framework simplifies the calculation of the Kronecker product of arbitrary matrices no matter the size or the number of the involved factors. Some applications are presented, these include the algebra of permutation matrices, the Hadamard matrix, the XXX Heisenberg model and the interaction of an atom with radiation fields.

N=2 Minimal Conformal Field Theories and Matrix Bifactorisations of x d

NASA Astrophysics Data System (ADS)

Davydov, Alexei; Camacho, Ana Ros; Runkel, Ingo

2018-01-01

We establish an action of the representations of N = 2-superconformal symmetry on the category of matrix factorisations of the potentials x d and x d - y d , for d odd. More precisely we prove a tensor equivalence between (a) the category of Neveu-Schwarz-type representations of the N = 2 minimal super vertex operator algebra at central charge 3-6/d, and (b) a full subcategory of graded matrix factorisations of the potential x d - y d . The subcategory in (b) is given by permutation-type matrix factorisations with consecutive index sets. The physical motivation for this result is the Landau-Ginzburg/conformal field theory correspondence, where it amounts to the equivalence of a subset of defects on both sides of the correspondence. Our work builds on results by Brunner and Roggenkamp [BR], where an isomorphism of fusion rules was established.

Subspace Clustering via Learning an Adaptive Low-Rank Graph.

PubMed

Yin, Ming; Xie, Shengli; Wu, Zongze; Zhang, Yun; Gao, Junbin

2018-08-01

By using a sparse representation or low-rank representation of data, the graph-based subspace clustering has recently attracted considerable attention in computer vision, given its capability and efficiency in clustering data. However, the graph weights built using the representation coefficients are not the exact ones as the traditional definition is in a deterministic way. The two steps of representation and clustering are conducted in an independent manner, thus an overall optimal result cannot be guaranteed. Furthermore, it is unclear how the clustering performance will be affected by using this graph. For example, the graph parameters, i.e., the weights on edges, have to be artificially pre-specified while it is very difficult to choose the optimum. To this end, in this paper, a novel subspace clustering via learning an adaptive low-rank graph affinity matrix is proposed, where the affinity matrix and the representation coefficients are learned in a unified framework. As such, the pre-computed graph regularizer is effectively obviated and better performance can be achieved. Experimental results on several famous databases demonstrate that the proposed method performs better against the state-of-the-art approaches, in clustering.

Automatic Overset Grid Generation with Heuristic Feedback Control

NASA Technical Reports Server (NTRS)

Robinson, Peter I.

2001-01-01

An advancing front grid generation system for structured Overset grids is presented which automatically modifies Overset structured surface grids and control lines until user-specified grid qualities are achieved. The system is demonstrated on two examples: the first refines a space shuttle fuselage control line until global truncation error is achieved; the second advances, from control lines, the space shuttle orbiter fuselage top and fuselage side surface grids until proper overlap is achieved. Surface grids are generated in minutes for complex geometries. The system is implemented as a heuristic feedback control (HFC) expert system which iteratively modifies the input specifications for Overset control line and surface grids. It is developed as an extension of modern control theory, production rules systems and subsumption architectures. The methodology provides benefits over the full knowledge lifecycle of an expert system for knowledge acquisition, knowledge representation, and knowledge execution. The vector/matrix framework of modern control theory systematically acquires and represents expert system knowledge. Missing matrix elements imply missing expert knowledge. The execution of the expert system knowledge is performed through symbolic execution of the matrix algebra equations of modern control theory. The dot product operation of matrix algebra is generalized for heuristic symbolic terms. Constant time execution is guaranteed.

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

Generalized Reduction Formula for Discrete Wigner Functions of Multiqubit Systems

NASA Astrophysics Data System (ADS)

Srinivasan, K.; Raghavan, G.

2018-03-01

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

Effect of atomic spontaneous decay on entanglement in the generalized Jaynes-Cummings model

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

Hessian, H.A.; Obada, A.-S.F.; Mohamed, A.-B.A.

2010-03-15

Some aspects of the irreversible dynamics of a generalized Jaynes-Cummings model are addressed. By working in the dressed-state representation, it is possible to split the dynamics of the entanglement and coherence. The exact solution of the master equation in the case of a high-Q cavity with atomic decay is found. Effects of the atomic spontaneous decay on the temporal evolution of partial entropies of the atom or the field and the total entropy as a quantitative measure entanglement are elucidated. The degree of entanglement, through the sum of the negative eigenvalues of the partially transposed density matrix and the negativemore » mutual information has been studied and compared with other measures.« 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

Left caloric vestibular stimulation as a tool to reveal implicit and explicit parameters of body representation.

PubMed

Sedda, A; Tonin, D; Salvato, G; Gandola, M; Bottini, G

2016-04-01

Homeostatic parameters, such as temperature, are related to body representation. In this study, we measured whether caloric vestibular stimulation (CVS) alters body temperature and tactile processing, and if in the direction predicted by a holistic body matrix representation. Skin temperature and tactile two-point discrimination (TPD) acuity were measured for both arms before, immediately after and with a delay from CVS. Participants were also administered a personality questionnaire and an anxiety inventory to rule out confounding factors. Two control experiments were planned to exclude casual variations. Our results show that temperature drops significantly in both arms after CVS. CVS also induces a bilateral improvement in tactile acuity (even though not immediately after but in the delayed condition). Finally, these effects are not due to learning, as demonstrated by the control experiment. In summary, our results suggest that vestibular stimulation updates body representation, supporting the evidence in favor of a body matrix. Copyright © 2016 Elsevier Inc. All rights reserved.

Visualising elastic anisotropy: theoretical background and computational implementation

NASA Astrophysics Data System (ADS)

Nordmann, J.; Aßmus, M.; Altenbach, H.

2018-02-01

In this article, we present the technical realisation for visualisations of characteristic parameters of the fourth-order elasticity tensor, which is classified by three-dimensional symmetry groups. Hereby, expressions for spatial representations of uc(Young)'s modulus and bulk modulus as well as plane representations of shear modulus and uc(Poisson)'s ratio are derived and transferred into a comprehensible form to computer algebra systems. Additionally, we present approaches for spatial representations of both latter parameters. These three- and two-dimensional representations are implemented into the software MATrix LABoratory. Exemplary representations of characteristic materials complete the present treatise.

Characterizing and differentiating task-based and resting state fMRI signals via two-stage sparse representations.

PubMed

Zhang, Shu; Li, Xiang; Lv, Jinglei; Jiang, Xi; Guo, Lei; Liu, Tianming

2016-03-01

A relatively underexplored question in fMRI is whether there are intrinsic differences in terms of signal composition patterns that can effectively characterize and differentiate task-based or resting state fMRI (tfMRI or rsfMRI) signals. In this paper, we propose a novel two-stage sparse representation framework to examine the fundamental difference between tfMRI and rsfMRI signals. Specifically, in the first stage, the whole-brain tfMRI or rsfMRI signals of each subject were composed into a big data matrix, which was then factorized into a subject-specific dictionary matrix and a weight coefficient matrix for sparse representation. In the second stage, all of the dictionary matrices from both tfMRI/rsfMRI data across multiple subjects were composed into another big data-matrix, which was further sparsely represented by a cross-subjects common dictionary and a weight matrix. This framework has been applied on the recently publicly released Human Connectome Project (HCP) fMRI data and experimental results revealed that there are distinctive and descriptive atoms in the cross-subjects common dictionary that can effectively characterize and differentiate tfMRI and rsfMRI signals, achieving 100% classification accuracy. Moreover, our methods and results can be meaningfully interpreted, e.g., the well-known default mode network (DMN) activities can be recovered from the very noisy and heterogeneous aggregated big-data of tfMRI and rsfMRI signals across all subjects in HCP Q1 release.

Representation of viruses in the remediated PDB archive

PubMed Central

Lawson, Catherine L.; Dutta, Shuchismita; Westbrook, John D.; Henrick, Kim; Berman, Helen M.

2008-01-01

A new scheme has been devised to represent viruses and other biological assemblies with regular noncrystallographic symmetry in the Protein Data Bank (PDB). The scheme describes existing and anticipated PDB entries of this type using generalized descriptions of deposited and experimental coordinate frames, symmetry and frame transformations. A simplified notation has been adopted to express the symmetry generation of assemblies from deposited coordinates and matrix operations describing the required point, helical or crystallographic symmetry. Complete correct information for building full assemblies, subassemblies and crystal asymmetric units of all virus entries is now available in the remediated PDB archive. PMID:18645236

Colored knot polynomials for arbitrary pretzel knots and links

DOE PAGES

Galakhov, D.; Melnikov, D.; Mironov, A.; ...

2015-04-01

A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich (g+1)-parametric family of pretzel knots and links. The answer for the Jones and HOMFLY is fully and explicitly expressed through the Racah matrix of Uq(SU N), and looks related to a modular transformation of toric conformal block. Knot polynomials are among the hottest topics in modern theory. They are supposed to summarize nicely representation theory of quantum algebras and modular properties of conformal blocks. The result reported in the present letter, provides a spectacular illustration and support to this general expectation.

Reconstruction of 2D PET data with Monte Carlo generated system matrix for generalized natural pixels

NASA Astrophysics Data System (ADS)

Vandenberghe, Stefaan; Staelens, Steven; Byrne, Charles L.; Soares, Edward J.; Lemahieu, Ignace; Glick, Stephen J.

2006-06-01

In discrete detector PET, natural pixels are image basis functions calculated from the response of detector pairs. By using reconstruction with natural pixel basis functions, the discretization of the object into a predefined grid can be avoided. Here, we propose to use generalized natural pixel reconstruction. Using this approach, the basis functions are not the detector sensitivity functions as in the natural pixel case but uniform parallel strips. The backprojection of the strip coefficients results in the reconstructed image. This paper proposes an easy and efficient way to generate the matrix M directly by Monte Carlo simulation. Elements of the generalized natural pixel system matrix are formed by calculating the intersection of a parallel strip with the detector sensitivity function. These generalized natural pixels are easier to use than conventional natural pixels because the final step from solution to a square pixel representation is done by simple backprojection. Due to rotational symmetry in the PET scanner, the matrix M is block circulant and only the first blockrow needs to be stored. Data were generated using a fast Monte Carlo simulator using ray tracing. The proposed method was compared to a listmode MLEM algorithm, which used ray tracing for doing forward and backprojection. Comparison of the algorithms with different phantoms showed that an improved resolution can be obtained using generalized natural pixel reconstruction with accurate system modelling. In addition, it was noted that for the same resolution a lower noise level is present in this reconstruction. A numerical observer study showed the proposed method exhibited increased performance as compared to a standard listmode EM algorithm. In another study, more realistic data were generated using the GATE Monte Carlo simulator. For these data, a more uniform contrast recovery and a better contrast-to-noise performance were observed. It was observed that major improvements in contrast recovery were obtained with MLEM when the correct system matrix was used instead of simple ray tracing. The correct modelling was the major cause of improved contrast for the same background noise. Less important factors were the choice of the algorithm (MLEM performed better than ART) and the basis functions (generalized natural pixels gave better results than pixels).

On some 3-point functions in the W 4 CFT and related braiding matrix

NASA Astrophysics Data System (ADS)

Furlan, P.; Petkova, V. B.

2015-12-01

We construct a class of 3-point constants in the sl(4) Toda conformal theory W 4, extending the examples in Fateev and Litvinov [1]. Their knowledge allows to determine the braiding/fusing matrix transforming 4-point conformal blocks of one fundamental, labelled by the 6-dimensional sl(4) representation, and three partially degenerate vertex operators. It is a 3 × 3 submatrix of the generic 6 × 6 fusing matrix consistent with the fusion rules for the particular class of representations. We check a braiding relation which has wider applications to conformal models with sl(4) symmetry. The 3-point constants in dual regions of central charge are compared in preparation for a BPS like relation in the widehat{sl}(4) WZW model.

A simplified formalism of the algebra of partially transposed permutation operators with applications

NASA Astrophysics Data System (ADS)

Mozrzymas, Marek; Studziński, Michał; Horodecki, Michał

2018-03-01

Herein we continue the study of the representation theory of the algebra of permutation operators acting on the n -fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced irreducible representations, which allows us to significantly simplify previously proved theorems and, most importantly, derive new results for irreducible representations of the mentioned algebra. In our analysis we are able to reduce the complexity of the central expressions by getting rid of sums over all permutations from the symmetric group, obtaining equations which are much more handy in practical applications. We also find relatively simple matrix representations for the generators of the underlying algebra. The obtained simplifications and developments are applied to derive the characteristics of a deterministic port-based teleportation scheme written purely in terms of irreducible representations of the studied algebra. We solve an eigenproblem for the generators of the algebra, which is the first step towards a hybrid port-based teleportation scheme and gives us new proofs of the asymptotic behaviour of teleportation fidelity. We also show a connection between the density operator characterising port-based teleportation and a particular matrix composed of an irreducible representation of the symmetric group, which encodes properties of the investigated algebra.

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.

On non-negative matrix factorization algorithms for signal-dependent noise with application to electromyography data

PubMed Central

Devarajan, Karthik; Cheung, Vincent C.K.

2017-01-01

Non-negative matrix factorization (NMF) by the multiplicative updates algorithm is a powerful machine learning method for decomposing a high-dimensional nonnegative matrix V into two nonnegative matrices, W and H where V ~ WH. It has been successfully applied in the analysis and interpretation of large-scale data arising in neuroscience, computational biology and natural language processing, among other areas. A distinctive feature of NMF is its nonnegativity constraints that allow only additive linear combinations of the data, thus enabling it to learn parts that have distinct physical representations in reality. In this paper, we describe an information-theoretic approach to NMF for signal-dependent noise based on the generalized inverse Gaussian model. Specifically, we propose three novel algorithms in this setting, each based on multiplicative updates and prove monotonicity of updates using the EM algorithm. In addition, we develop algorithm-specific measures to evaluate their goodness-of-fit on data. Our methods are demonstrated using experimental data from electromyography studies as well as simulated data in the extraction of muscle synergies, and compared with existing algorithms for signal-dependent noise. PMID:24684448

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

Mozrzymas, Marek; Horodecki, Michał; Studziński, Michał

We consider the structure of algebra of operators, acting in n-fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its regular representation, we derive basic properties of the algebra. In particular, we describe all irreducible representations of the algebra of partially transposed operators and derive expressions for matrix elements of the representations. It appears that there are two kinds of irreducible representations of the algebra. The first one is strictly connected with the representations of the group S(n − 1) induced by irreduciblemore » representations of the group S(n − 2). The second kind is structurally connected with irreducible representations of the group S(n − 1)« less

Determinant representations of spin-operator matrix elements in the XX spin chain and their applications

NASA Astrophysics Data System (ADS)

Wu, Ning

2018-01-01

For the one-dimensional spin-1/2 XX model with either periodic or open boundary conditions, it is shown by using a fermionic approach that the matrix element of the spin operator Sj- (Sj-Sj'+ ) between two eigenstates with numbers of excitations n and n +1 (n and n ) can be expressed as the determinant of an appropriate (n +1 )×(n +1 ) matrix whose entries involve the coefficients of the canonical transformations diagonalizing the model. In the special case of a homogeneous periodic XX chain, the matrix element of Sj- reduces to a variant of the Cauchy determinant that can be evaluated analytically to yield a factorized expression. The obtained compact representations of these matrix elements are then applied to two physical scenarios: (i) Nonlinear optical response of molecular aggregates, for which the determinant representation of the transition dipole matrix elements between eigenstates provides a convenient way to calculate the third-order nonlinear responses for aggregates from small to large sizes compared with the optical wavelength; and (ii) real-time dynamics of an interacting Dicke model consisting of a single bosonic mode coupled to a one-dimensional XX spin bath. In this setup, full quantum calculation up to N ≤16 spins for vanishing intrabath coupling shows that the decay of the reduced bosonic occupation number approaches a finite plateau value (in the long-time limit) that depends on the ratio between the number of excitations and the total number of spins. Our results can find useful applications in various "system-bath" systems, with the system part inhomogeneously coupled to an interacting XX chain.

Information Geometry for Landmark Shape Analysis: Unifying Shape Representation and Deformation

PubMed Central

Peter, Adrian M.; Rangarajan, Anand

2010-01-01

Shape matching plays a prominent role in the comparison of similar structures. We present a unifying framework for shape matching that uses mixture models to couple both the shape representation and deformation. The theoretical foundation is drawn from information geometry wherein information matrices are used to establish intrinsic distances between parametric densities. When a parameterized probability density function is used to represent a landmark-based shape, the modes of deformation are automatically established through the information matrix of the density. We first show that given two shapes parameterized by Gaussian mixture models (GMMs), the well-known Fisher information matrix of the mixture model is also a Riemannian metric (actually, the Fisher-Rao Riemannian metric) and can therefore be used for computing shape geodesics. The Fisher-Rao metric has the advantage of being an intrinsic metric and invariant to reparameterization. The geodesic—computed using this metric—establishes an intrinsic deformation between the shapes, thus unifying both shape representation and deformation. A fundamental drawback of the Fisher-Rao metric is that it is not available in closed form for the GMM. Consequently, shape comparisons are computationally very expensive. To address this, we develop a new Riemannian metric based on generalized ϕ-entropy measures. In sharp contrast to the Fisher-Rao metric, the new metric is available in closed form. Geodesic computations using the new metric are considerably more efficient. We validate the performance and discriminative capabilities of these new information geometry-based metrics by pairwise matching of corpus callosum shapes. We also study the deformations of fish shapes that have various topological properties. A comprehensive comparative analysis is also provided using other landmark-based distances, including the Hausdorff distance, the Procrustes metric, landmark-based diffeomorphisms, and the bending energies of the thin-plate (TPS) and Wendland splines. PMID:19110497

Quantifying matrix product state

NASA Astrophysics Data System (ADS)

Bhatia, Amandeep Singh; Kumar, Ajay

2018-03-01

Motivated by the concept of quantum finite-state machines, we have investigated their relation with matrix product state of quantum spin systems. Matrix product states play a crucial role in the context of quantum information processing and are considered as a valuable asset for quantum information and communication purpose. It is an effective way to represent states of entangled systems. In this paper, we have designed quantum finite-state machines of one-dimensional matrix product state representations for quantum spin systems.

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.

A unified statistical approach to non-negative matrix factorization and probabilistic latent semantic indexing

PubMed Central

Wang, Guoli; Ebrahimi, Nader

2014-01-01

Non-negative matrix factorization (NMF) is a powerful machine learning method for decomposing a high-dimensional nonnegative matrix V into the product of two nonnegative matrices, W and H, such that V ∼ W H. It has been shown to have a parts-based, sparse representation of the data. NMF has been successfully applied in a variety of areas such as natural language processing, neuroscience, information retrieval, image processing, speech recognition and computational biology for the analysis and interpretation of large-scale data. There has also been simultaneous development of a related statistical latent class modeling approach, namely, probabilistic latent semantic indexing (PLSI), for analyzing and interpreting co-occurrence count data arising in natural language processing. In this paper, we present a generalized statistical approach to NMF and PLSI based on Renyi's divergence between two non-negative matrices, stemming from the Poisson likelihood. Our approach unifies various competing models and provides a unique theoretical framework for these methods. We propose a unified algorithm for NMF and provide a rigorous proof of monotonicity of multiplicative updates for W and H. In addition, we generalize the relationship between NMF and PLSI within this framework. We demonstrate the applicability and utility of our approach as well as its superior performance relative to existing methods using real-life and simulated document clustering data. PMID:25821345

A unified statistical approach to non-negative matrix factorization and probabilistic latent semantic indexing.

PubMed

Devarajan, Karthik; Wang, Guoli; Ebrahimi, Nader

2015-04-01

Non-negative matrix factorization (NMF) is a powerful machine learning method for decomposing a high-dimensional nonnegative matrix V into the product of two nonnegative matrices, W and H , such that V ∼ W H . It has been shown to have a parts-based, sparse representation of the data. NMF has been successfully applied in a variety of areas such as natural language processing, neuroscience, information retrieval, image processing, speech recognition and computational biology for the analysis and interpretation of large-scale data. There has also been simultaneous development of a related statistical latent class modeling approach, namely, probabilistic latent semantic indexing (PLSI), for analyzing and interpreting co-occurrence count data arising in natural language processing. In this paper, we present a generalized statistical approach to NMF and PLSI based on Renyi's divergence between two non-negative matrices, stemming from the Poisson likelihood. Our approach unifies various competing models and provides a unique theoretical framework for these methods. We propose a unified algorithm for NMF and provide a rigorous proof of monotonicity of multiplicative updates for W and H . In addition, we generalize the relationship between NMF and PLSI within this framework. We demonstrate the applicability and utility of our approach as well as its superior performance relative to existing methods using real-life and simulated document clustering data.

The 2-D lattice theory of Flower Constellations

NASA Astrophysics Data System (ADS)

Avendaño, Martín E.; Davis, Jeremy J.; Mortari, Daniele

2013-08-01

The 2-D lattice theory of Flower Constellations, generalizing Harmonic Flower Constellations (the symmetric subset of Flower Constellations) as well as the Walker/ Mozhaev constellations, is presented here. This theory is a new general framework to design symmetric constellations using a 2× 2 lattice matrix of integers or by its minimal representation, the Hermite normal form. From a geometrical point of view, the phasing of satellites is represented by a regular pattern (lattice) on a two-Dimensional torus. The 2-D lattice theory of Flower Constellations does not require any compatibility condition and uses a minimum set of integer parameters whose meaning are explored throughout the paper. This general minimum-parametrization framework allows us to obtain all symmetric distribution of satellites. Due to the J_2 effect this design framework is meant for circular orbits and for elliptical orbits at critical inclination, or to design elliptical constellations for the unperturbed Keplerian case.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

NASA Astrophysics Data System (ADS)

Ablinger, Jakob; Blümlein, Johannes; Raab, Clemens; Schneider, Carsten; Wißbrock, Fabian

2014-08-01

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝aN,a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Berry phase and entanglement of three qubits in a new Yang-Baxter system

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

Hu Taotao; Xue Kang; Wu Chunfeng

2009-08-15

In this paper we construct a new 8x8M matrix from the 4x4M matrix, where M/M is the image of the braid group representation. The 8x8M matrix and the 4x4M matrix both satisfy extraspecial 2-group algebra relations. By Yang-Baxteration approach, we derive a unitary R({theta},{phi}) matrix from the M matrix with parameters {phi} and {theta}. Three-qubit entangled states can be generated by using the R({theta},{phi}) matrix. A Hamiltonian for three qubits is constructed from the unitary R({theta},{phi}) matrix. We then study the entanglement and Berry phase of the Yang-Baxter system.

Adjoints and Low-rank Covariance Representation

NASA Technical Reports Server (NTRS)

Tippett, Michael K.; Cohn, Stephen E.

2000-01-01

Quantitative measures of the uncertainty of Earth System estimates can be as important as the estimates themselves. Second moments of estimation errors are described by the covariance matrix, whose direct calculation is impractical when the number of degrees of freedom of the system state is large. Ensemble and reduced-state approaches to prediction and data assimilation replace full estimation error covariance matrices by low-rank approximations. The appropriateness of such approximations depends on the spectrum of the full error covariance matrix, whose calculation is also often impractical. Here we examine the situation where the error covariance is a linear transformation of a forcing error covariance. We use operator norms and adjoints to relate the appropriateness of low-rank representations to the conditioning of this transformation. The analysis is used to investigate low-rank representations of the steady-state response to random forcing of an idealized discrete-time dynamical system.

Representations of the quantum doubles of finite group algebras and spectral parameter dependent solutions of the Yang-Baxter equation

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

Dancer, K. A.; Isac, P. S.; Links, J.

2006-10-15

Quantum doubles of finite group algebras form a class of quasitriangular Hopf algebras that algebraically solve the Yang-Baxter equation. Each representation of the quantum double then gives a matrix solution of the Yang-Baxter equation. Such solutions do not depend on a spectral parameter, and to date there has been little investigation into extending these solutions such that they do depend on a spectral parameter. Here we first explicitly construct the matrix elements of the generators for all irreducible representations of quantum doubles of the dihedral groups D{sub n}. These results may be used to determine constant solutions of the Yang-Baxtermore » equation. We then discuss Baxterization ansaetze to obtain solutions of the Yang-Baxter equation with a spectral parameter and give several examples, including a new 21-vertex model. We also describe this approach in terms of minimal-dimensional representations of the quantum doubles of the alternating group A{sub 4} and the symmetric group S{sub 4}.« less

A matrix solution for the simulation of magnetic fields with ideal current loops

NASA Technical Reports Server (NTRS)

Stankiewicz, N.

1979-01-01

A matrix formulation is presented for describing axisymmetric magnetic field data with ideal current loops. A computer program written in APL is used to invert the matrix and hence to solve for the coil strengths which are used to represent the field data. Examples are given of the coil representation for (1) measured magnetic data, (2) refocusing fields, and (3) PPM focusing fields.

Attitude Representations for Kalman Filtering

NASA Technical Reports Server (NTRS)

Markley, F. Landis; Bauer, Frank H. (Technical Monitor)

2001-01-01

The four-component quaternion has the lowest dimensionality possible for a globally nonsingular attitude representation, it represents the attitude matrix as a homogeneous quadratic function, and its dynamic propagation equation is bilinear in the quaternion and the angular velocity. The quaternion is required to obey a unit norm constraint, though, so Kalman filters often employ a quaternion for the global attitude estimate and a three-component representation for small errors about the estimate. We consider these mixed attitude representations for both a first-order Extended Kalman filter and a second-order filter, as well for quaternion-norm-preserving attitude propagation.

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.

Path-integral approach to the Wigner-Kirkwood expansion.

PubMed

Jizba, Petr; Zatloukal, Václav

2014-01-01

We study the high-temperature behavior of quantum-mechanical path integrals. Starting from the Feynman-Kac formula, we derive a functional representation of the Wigner-Kirkwood perturbation expansion for quantum Boltzmann densities. As shown by its applications to different potentials, the presented expansion turns out to be quite efficient in generating analytic form of the higher-order expansion coefficients. To put some flesh on the bare bones, we apply the expansion to obtain basic thermodynamic functions of the one-dimensional anharmonic oscillator. Further salient issues, such as generalization to the Bloch density matrix and comparison with the more customary world-line formulation, are discussed.

Analytic tools for investigating the structure of network reliability measures with regard to observation correlations

NASA Astrophysics Data System (ADS)

Prószyński, W.; Kwaśniak, M.

2018-03-01

A global measure of observation correlations in a network is proposed, together with the auxiliary indices related to non-diagonal elements of the correlation matrix. Based on the above global measure, a specific representation of the correlation matrix is presented, being the result of rigorously proven theorem formulated within the present research. According to the theorem, each positive definite correlation matrix can be expressed by a scale factor and a so-called internal weight matrix. Such a representation made it possible to investigate the structure of the basic reliability measures with regard to observation correlations. Numerical examples carried out for two test networks illustrate the structure of those measures that proved to be dependent on global correlation index. Also, the levels of global correlation are proposed. It is shown that one can readily find an approximate value of the global correlation index, and hence the correlation level, for the expected values of auxiliary indices being the only knowledge about a correlation matrix of interest. The paper is an extended continuation of the previous study of authors that was confined to the elementary case termed uniform correlation. The extension covers arbitrary correlation matrices and a structure of correlation effect.

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.

Application of Fuzzy Logic to Matrix FMECA

NASA Astrophysics Data System (ADS)

Shankar, N. Ravi; Prabhu, B. S.

2001-04-01

A methodology combining the benefits of Fuzzy Logic and Matrix FMEA is presented in this paper. The presented methodology extends the risk prioritization beyond the conventional Risk Priority Number (RPN) method. Fuzzy logic is used to calculate the criticality rank. Also the matrix approach is improved further to develop a pictorial representation retaining all relevant qualitative and quantitative information of several FMEA elements relationships. The methodology presented is demonstrated by application to an illustrative example.

Description of quantum states using in free space optic communication

NASA Astrophysics Data System (ADS)

Kučera, Petr

2017-11-01

In the article we concentrate our attention on the quantum description of states which are prepared by light sources. The main goal of the article is the determination of density matrix of background radiation source. It is shown that these matrix elements satisfy Geometric distribution in the number state representation.

Matrix models and stochastic growth in Donaldson-Thomas theory

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

Szabo, Richard J.; Tierz, Miguel; Departamento de Analisis Matematico, Facultad de Ciencias Matematicas, Universidad Complutense de Madrid, Plaza de Ciencias 3, 28040 Madrid

We show that the partition functions which enumerate Donaldson-Thomas invariants of local toric Calabi-Yau threefolds without compact divisors can be expressed in terms of specializations of the Schur measure. We also discuss the relevance of the Hall-Littlewood and Jack measures in the context of BPS state counting and study the partition functions at arbitrary points of the Kaehler moduli space. This rewriting in terms of symmetric functions leads to a unitary one-matrix model representation for Donaldson-Thomas theory. We describe explicitly how this result is related to the unitary matrix model description of Chern-Simons gauge theory. This representation is used tomore » show that the generating functions for Donaldson-Thomas invariants are related to tau-functions of the integrable Toda and Toeplitz lattice hierarchies. The matrix model also leads to an interpretation of Donaldson-Thomas theory in terms of non-intersecting paths in the lock-step model of vicious walkers. We further show that these generating functions can be interpreted as normalization constants of a corner growth/last-passage stochastic model.« less

Quantum groups, Yang-Baxter maps and quasi-determinants

NASA Astrophysics Data System (ADS)

Tsuboi, Zengo

2018-01-01

For any quasi-triangular Hopf algebra, there exists the universal R-matrix, which satisfies the Yang-Baxter equation. It is known that the adjoint action of the universal R-matrix on the elements of the tensor square of the algebra constitutes a quantum Yang-Baxter map, which satisfies the set-theoretic Yang-Baxter equation. The map has a zero curvature representation among L-operators defined as images of the universal R-matrix. We find that the zero curvature representation can be solved by the Gauss decomposition of a product of L-operators. Thereby obtained a quasi-determinant expression of the quantum Yang-Baxter map associated with the quantum algebra Uq (gl (n)). Moreover, the map is identified with products of quasi-Plücker coordinates over a matrix composed of the L-operators. We also consider the quasi-classical limit, where the underlying quantum algebra reduces to a Poisson algebra. The quasi-determinant expression of the quantum Yang-Baxter map reduces to ratios of determinants, which give a new expression of a classical Yang-Baxter map.

Implementation of a digital optical matrix-vector multiplier using a holographic look-up table and residue arithmetic

NASA Technical Reports Server (NTRS)

Habiby, Sarry F.

1987-01-01

The design and implementation of a digital (numerical) optical matrix-vector multiplier are presented. The objective is to demonstrate the operation of an optical processor designed to minimize computation time in performing a practical computing application. This is done by using the large array of processing elements in a Hughes liquid crystal light valve, and relying on the residue arithmetic representation, a holographic optical memory, and position coded optical look-up tables. In the design, all operations are performed in effectively one light valve response time regardless of matrix size. The features of the design allowing fast computation include the residue arithmetic representation, the mapping approach to computation, and the holographic memory. In addition, other features of the work include a practical light valve configuration for efficient polarization control, a model for recording multiple exposures in silver halides with equal reconstruction efficiency, and using light from an optical fiber for a reference beam source in constructing the hologram. The design can be extended to implement larger matrix arrays without increasing computation time.

Matrix product representation of the stationary state of the open zero range process

NASA Astrophysics Data System (ADS)

Bertin, Eric; Vanicat, Matthieu

2018-06-01

Many one-dimensional lattice particle models with open boundaries, like the paradigmatic asymmetric simple exclusion process (ASEP), have their stationary states represented in the form of a matrix product, with matrices that do not explicitly depend on the lattice site. In contrast, the stationary state of the open 1D zero-range process (ZRP) takes an inhomogeneous factorized form, with site-dependent probability weights. We show that in spite of the absence of correlations, the stationary state of the open ZRP can also be represented in a matrix product form, where the matrices are site-independent, non-commuting and determined from algebraic relations resulting from the master equation. We recover the known distribution of the open ZRP in two different ways: first, using an explicit representation of the matrices and boundary vectors; second, from the sole knowledge of the algebraic relations satisfied by these matrices and vectors. Finally, an interpretation of the relation between the matrix product form and the inhomogeneous factorized form is proposed within the framework of hidden Markov chains.

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.

Singularity-free extraction of a quaternion from a direction-cosine matrix. [for spacecraft control and guidance

NASA Technical Reports Server (NTRS)

Klumpp, A. R.

1976-01-01

A computer algorithm for extracting a quaternion from a direction-cosine matrix (DCM) is described. The quaternion provides a four-parameter representation of rotation, as against the nine-parameter representation afforded by a DCM. Commanded attitude in space shuttle steering is conveniently computed by DCM, while actual attitude is computed most compactly as a quaternion, as is attitude error. The unit length of the rotation quaternion, and interchangeable of a quaternion and its negative, are used to advantage in the extraction algorithm. Protection of the algorithm against square root failure and division overflow are considered. Necessary and sufficient conditions for handling the rotation vector element of largest magnitude are discussed

System identification of analytical models of damped structures

NASA Technical Reports Server (NTRS)

Fuh, J.-S.; Chen, S.-Y.; Berman, A.

1984-01-01

A procedure is presented for identifying linear nonproportionally damped system. The system damping is assumed to be representable by a real symmetric matrix. Analytical mass, stiffness and damping matrices which constitute an approximate representation of the system are assumed to be available. Given also are an incomplete set of measured natural frequencies, damping ratios and complex mode shapes of the structure, normally obtained from test data. A method is developed to find the smallest changes in the analytical model so that the improved model can exactly predict the measured modal parameters. The present method uses the orthogonality relationship to improve mass and damping matrices and the dynamic equation to find the improved stiffness matrix.

BMS symmetry, soft particles and memory

NASA Astrophysics Data System (ADS)

Chatterjee, Atreya; Lowe, David A.

2018-05-01

In this work, we revisit unitary irreducible representations of the Bondi–Metzner–Sachs (BMS) group discovered by McCarthy. Representations are labelled by an infinite number of supermomenta in addition to 4-momentum. Tensor products of these irreducible representations lead to particle-like states dressed by soft gravitational modes. Conservation of 4-momentum and supermomentum in the scattering of such states leads to a memory effect encoded in the outgoing soft modes. We note there exist irreducible representations corresponding to soft states with strictly vanishing 4-momentum, which may nevertheless be produced by scattering of particle-like states. This fact has interesting implications for the S-matrix in gravitational theories.

Graph characterization via Ihara coefficients.

PubMed

Ren, Peng; Wilson, Richard C; Hancock, Edwin R

2011-02-01

The novel contributions of this paper are twofold. First, we demonstrate how to characterize unweighted graphs in a permutation-invariant manner using the polynomial coefficients from the Ihara zeta function, i.e., the Ihara coefficients. Second, we generalize the definition of the Ihara coefficients to edge-weighted graphs. For an unweighted graph, the Ihara zeta function is the reciprocal of a quasi characteristic polynomial of the adjacency matrix of the associated oriented line graph. Since the Ihara zeta function has poles that give rise to infinities, the most convenient numerically stable representation is to work with the coefficients of the quasi characteristic polynomial. Moreover, the polynomial coefficients are invariant to vertex order permutations and also convey information concerning the cycle structure of the graph. To generalize the representation to edge-weighted graphs, we make use of the reduced Bartholdi zeta function. We prove that the computation of the Ihara coefficients for unweighted graphs is a special case of our proposed method for unit edge weights. We also present a spectral analysis of the Ihara coefficients and indicate their advantages over other graph spectral methods. We apply the proposed graph characterization method to capturing graph-class structure and clustering graphs. Experimental results reveal that the Ihara coefficients are more effective than methods based on Laplacian spectra.

Robust Image Regression Based on the Extended Matrix Variate Power Exponential Distribution of Dependent Noise.

PubMed

Luo, Lei; Yang, Jian; Qian, Jianjun; Tai, Ying; Lu, Gui-Fu

2017-09-01

Dealing with partial occlusion or illumination is one of the most challenging problems in image representation and classification. In this problem, the characterization of the representation error plays a crucial role. In most current approaches, the error matrix needs to be stretched into a vector and each element is assumed to be independently corrupted. This ignores the dependence between the elements of error. In this paper, it is assumed that the error image caused by partial occlusion or illumination changes is a random matrix variate and follows the extended matrix variate power exponential distribution. This has the heavy tailed regions and can be used to describe a matrix pattern of l×m dimensional observations that are not independent. This paper reveals the essence of the proposed distribution: it actually alleviates the correlations between pixels in an error matrix E and makes E approximately Gaussian. On the basis of this distribution, we derive a Schatten p -norm-based matrix regression model with L q regularization. Alternating direction method of multipliers is applied to solve this model. To get a closed-form solution in each step of the algorithm, two singular value function thresholding operators are introduced. In addition, the extended Schatten p -norm is utilized to characterize the distance between the test samples and classes in the design of the classifier. Extensive experimental results for image reconstruction and classification with structural noise demonstrate that the proposed algorithm works much more robustly than some existing regression-based methods.

Automatic face naming by learning discriminative affinity matrices from weakly labeled images.

PubMed

Xiao, Shijie; Xu, Dong; Wu, Jianxin

2015-10-01

Given a collection of images, where each image contains several faces and is associated with a few names in the corresponding caption, the goal of face naming is to infer the correct name for each face. In this paper, we propose two new methods to effectively solve this problem by learning two discriminative affinity matrices from these weakly labeled images. We first propose a new method called regularized low-rank representation by effectively utilizing weakly supervised information to learn a low-rank reconstruction coefficient matrix while exploring multiple subspace structures of the data. Specifically, by introducing a specially designed regularizer to the low-rank representation method, we penalize the corresponding reconstruction coefficients related to the situations where a face is reconstructed by using face images from other subjects or by using itself. With the inferred reconstruction coefficient matrix, a discriminative affinity matrix can be obtained. Moreover, we also develop a new distance metric learning method called ambiguously supervised structural metric learning by using weakly supervised information to seek a discriminative distance metric. Hence, another discriminative affinity matrix can be obtained using the similarity matrix (i.e., the kernel matrix) based on the Mahalanobis distances of the data. Observing that these two affinity matrices contain complementary information, we further combine them to obtain a fused affinity matrix, based on which we develop a new iterative scheme to infer the name of each face. Comprehensive experiments demonstrate the effectiveness of our approach.

EvolQG - An R package for evolutionary quantitative genetics

PubMed Central

Melo, Diogo; Garcia, Guilherme; Hubbe, Alex; Assis, Ana Paula; Marroig, Gabriel

2016-01-01

We present an open source package for performing evolutionary quantitative genetics analyses in the R environment for statistical computing. Evolutionary theory shows that evolution depends critically on the available variation in a given population. When dealing with many quantitative traits this variation is expressed in the form of a covariance matrix, particularly the additive genetic covariance matrix or sometimes the phenotypic matrix, when the genetic matrix is unavailable and there is evidence the phenotypic matrix is sufficiently similar to the genetic matrix. Given this mathematical representation of available variation, the \\textbf{EvolQG} package provides functions for calculation of relevant evolutionary statistics; estimation of sampling error; corrections for this error; matrix comparison via correlations, distances and matrix decomposition; analysis of modularity patterns; and functions for testing evolutionary hypotheses on taxa diversification. PMID:27785352

PEDIATRICIANS’ REPRESENTATIONS ON DAIRY ALTERNATIVES WHEN WEANING IS UNAVOIDABLE

PubMed Central

Sarubbi, Vicente; Muylaert, Camila Junqueira; Bastos, Isabella Teixeira; Gallo, Paulo Rogério; Leone, Claudio

2017-01-01

ABSTRACT Objective: To analyze pediatricians’ representations on the nutritional alternatives that are adopted when weaning becomes inevitable. Methods: This is a mixed cross-sectional analytical study with probabilistic sampling. Fifty-seven randomly selected pediatricians were interviewed with the use of a semi-structured script for thematic analysis. The technique of free evocations was used, and the terms were processed using software EVOC 2005. The thematic categories were established on software NVivo10, and their co-occurrence matrix was exported and analyzed in terms of their simple similarity hierarchy on software CHIC. Results: In the pediatricians’ representations, whole milk was cited as a foodstuff with high allergenic risk (35.1%) and nutritionally inappropriate, and they did not recommend its use if weaning occurred before 1 year of age. The infant formula, referred by 98.3% of the pediatricians as the best alternative at the moment of weaning, was cited by 38.1% of them owing to its nutritional adequacy. The points quoted as unfavorable to the use of the formula were the price, the possibility of causing allergy and the risk of the inadequate use of such a highly industrialized product. Conclusions: The pediatricians’ representations show that they are sensitive to the importance of breast-feeding and at the same time, to the sociocultural difficulties inherent in the practice. Generally speaking, the interviewed pediatricians recommend the use of milk formulas, and not of whole cow’s milk, if weaning occurs before the end of the first year of life. PMID:28977316

Featureless classification of light curves

NASA Astrophysics Data System (ADS)

Kügler, S. D.; Gianniotis, N.; Polsterer, K. L.

2015-08-01

In the era of rapidly increasing amounts of time series data, classification of variable objects has become the main objective of time-domain astronomy. Classification of irregularly sampled time series is particularly difficult because the data cannot be represented naturally as a vector which can be directly fed into a classifier. In the literature, various statistical features serve as vector representations. In this work, we represent time series by a density model. The density model captures all the information available, including measurement errors. Hence, we view this model as a generalization to the static features which directly can be derived, e.g. as moments from the density. Similarity between each pair of time series is quantified by the distance between their respective models. Classification is performed on the obtained distance matrix. In the numerical experiments, we use data from the OGLE (Optical Gravitational Lensing Experiment) and ASAS (All Sky Automated Survey) surveys and demonstrate that the proposed representation performs up to par with the best currently used feature-based approaches. The density representation preserves all static information present in the observational data, in contrast to a less-complete description by features. The density representation is an upper boundary in terms of information made available to the classifier. Consequently, the predictive power of the proposed classification depends on the choice of similarity measure and classifier, only. Due to its principled nature, we advocate that this new approach of representing time series has potential in tasks beyond classification, e.g. unsupervised learning.

Building Hierarchical Representations for Oracle Character and Sketch Recognition.

PubMed

Jun Guo; Changhu Wang; Roman-Rangel, Edgar; Hongyang Chao; Yong Rui

2016-01-01

In this paper, we study oracle character recognition and general sketch recognition. First, a data set of oracle characters, which are the oldest hieroglyphs in China yet remain a part of modern Chinese characters, is collected for analysis. Second, typical visual representations in shape- and sketch-related works are evaluated. We analyze the problems suffered when addressing these representations and determine several representation design criteria. Based on the analysis, we propose a novel hierarchical representation that combines a Gabor-related low-level representation and a sparse-encoder-related mid-level representation. Extensive experiments show the effectiveness of the proposed representation in both oracle character recognition and general sketch recognition. The proposed representation is also complementary to convolutional neural network (CNN)-based models. We introduce a solution to combine the proposed representation with CNN-based models, and achieve better performances over both approaches. This solution has beaten humans at recognizing general sketches.

Geometric multiaxial representation of N -qubit mixed symmetric separable states

NASA Astrophysics Data System (ADS)

SP, Suma; Sirsi, Swarnamala; Hegde, Subramanya; Bharath, Karthik

2017-08-01

The study of N -qubit mixed symmetric separable states is a longstanding challenging problem as no unique separability criterion exists. In this regard, we take up the N -qubit mixed symmetric separable states for a detailed study as these states are of experimental importance and offer an elegant mathematical analysis since the dimension of the Hilbert space is reduced from 2N to N +1 . Since there exists a one-to-one correspondence between the spin-j system and an N -qubit symmetric state, we employ Fano statistical tensor parameters for the parametrization of the spin-density matrix. Further, we use a geometric multiaxial representation (MAR) of the density matrix to characterize the mixed symmetric separable states. Since the separability problem is NP-hard, we choose to study it in the continuum limit where mixed symmetric separable states are characterized by the P -distribution function λ (θ ,ϕ ) . We show that the N -qubit mixed symmetric separable states can be visualized as a uniaxial system if the distribution function is independent of θ and ϕ . We further choose a distribution function to be the most general positive function on a sphere and observe that the statistical tensor parameters characterizing the N -qubit symmetric system are the expansion coefficients of the distribution function. As an example for the discrete case, we investigate the MAR of a uniformly weighted two-qubit mixed symmetric separable state. We also observe that there exists a correspondence between the separability and classicality of states.

RPBS: Rotational Projected Binary Structure for point cloud representation

NASA Astrophysics Data System (ADS)

Fang, Bin; Zhou, Zhiwei; Ma, Tao; Hu, Fangyu; Quan, Siwen; Ma, Jie

2018-03-01

In this paper, we proposed a novel three-dimension local surface descriptor named RPBS for point cloud representation. First, points cropped form the query point within a predefined radius is regard as a local surface patch. Then pose normalization is done to the local surface to equip our descriptor with the invariance to rotation transformation. To obtain more information about the cropped surface, multi-view representation is formed by successively rotating it along the coordinate axis. Further, orthogonal projections to the three coordinate plane are adopted to construct two-dimension distribution matrixes, and binarization is applied to each matrix by following the rule that whether the grid is occupied, if yes, set the grid one, otherwise zero. We calculate the binary maps from all the viewpoints and concatenate them together as the final descriptor. Comparative experiments for evaluating our proposed descriptor is conducted on the standard dataset named Bologna with several state-of-the-art 3D descriptors, and results show that our descriptor achieves the best performance on feature matching experiments.

Studying effects of non-equilibrium radiative transfer via HPC

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

Holladay, Daniel

This report presents slides on Ph.D. Research Goals; Local Thermodynamic Equilibrium (LTE) Implications; Calculating an Opacity; Opacity: Pictographic Representation; Opacity: Pictographic Representation; Opacity: Pictographic Representation; Collisional Radiative Modeling; Radiative and Collisional Excitation; Photo and Electron Impact Ionization; Autoionization; The Rate Matrix; Example: Total Photoionization rate; The Rate Coefficients; inlinlte version 1.1; inlinlte: Verification; New capabilities: Rate Matrix – Flexibility; Memory Option Comparison; Improvements over previous DCA solver; Inter- and intra-node load balancing; Load Balance – Full Picture; Load Balance – Full Picture; Load Balance – Internode; Load Balance – Scaling; Description; Performance; xRAGE Simulation; Post-process @ 2hr; Post-process @ 4hr;more » Post-process @ 8hr; Takeaways; Performance for 1 realization; Motivation for QOI; Multigroup Er; Transport and NLTE large effects (1mm, 1keV); Transport large effect, NLTE lesser (1mm, 750eV); Blastwave Diagnostici – Description & Performance; Temperature Comparison; NLTE has effect on dynamics at wall; NLTE has lesser effect in the foam; Global Takeaways; The end.« less

Thermal form factor approach to the ground-state correlation functions of the XXZ chain in the antiferromagnetic massive regime

NASA Astrophysics Data System (ADS)

Dugave, Maxime; Göhmann, Frank; Kozlowski, Karol K.; Suzuki, Junji

2016-09-01

We use the form factors of the quantum transfer matrix in the zero-temperature limit in order to study the two-point ground-state correlation functions of the XXZ chain in the antiferromagnetic massive regime. We obtain novel form factor series representations of the correlation functions which differ from those derived either from the q-vertex-operator approach or from the algebraic Bethe Ansatz approach to the usual transfer matrix. We advocate that our novel representations are numerically more efficient and allow for a straightforward calculation of the large-distance asymptotic behaviour of the two-point functions. Keeping control over the temperature corrections to the two-point functions we see that these are of order {T}∞ in the whole antiferromagnetic massive regime. The isotropic limit of our result yields a novel form factor series representation for the two-point correlation functions of the XXX chain at zero magnetic field. Dedicated to the memory of Petr Petrovich Kulish.

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.

Fast Eigensolver for Computing 3D Earth's Normal Modes

NASA Astrophysics Data System (ADS)

Shi, J.; De Hoop, M. V.; Li, R.; Xi, Y.; Saad, Y.

2017-12-01

We present a novel parallel computational approach to compute Earth's normal modes. We discretize Earth via an unstructured tetrahedral mesh and apply the continuous Galerkin finite element method to the elasto-gravitational system. To resolve the eigenvalue pollution issue, following the analysis separating the seismic point spectrum, we utilize explicitly a representation of the displacement for describing the oscillations of the non-seismic modes in the fluid outer core. Effectively, we separate out the essential spectrum which is naturally related to the Brunt-Väisälä frequency. We introduce two Lanczos approaches with polynomial and rational filtering for solving this generalized eigenvalue problem in prescribed intervals. The polynomial filtering technique only accesses the matrix pair through matrix-vector products and is an ideal candidate for solving three-dimensional large-scale eigenvalue problems. The matrix-free scheme allows us to deal with fluid separation and self-gravitation in an efficient way, while the standard shift-and-invert method typically needs an explicit shifted matrix and its factorization. The rational filtering method converges much faster than the standard shift-and-invert procedure when computing all the eigenvalues inside an interval. Both two Lanczos approaches solve for the internal eigenvalues extremely accurately, comparing with the standard eigensolver. In our computational experiments, we compare our results with the radial earth model benchmark, and visualize the normal modes using vector plots to illustrate the properties of the displacements in different modes.

A unified data representation theory for network visualization, ordering and coarse-graining

PubMed Central

Kovács, István A.; Mizsei, Réka; Csermely, Péter

2015-01-01

Representation of large data sets became a key question of many scientific disciplines in the last decade. Several approaches for network visualization, data ordering and coarse-graining accomplished this goal. However, there was no underlying theoretical framework linking these problems. Here we show an elegant, information theoretic data representation approach as a unified solution of network visualization, data ordering and coarse-graining. The optimal representation is the hardest to distinguish from the original data matrix, measured by the relative entropy. The representation of network nodes as probability distributions provides an efficient visualization method and, in one dimension, an ordering of network nodes and edges. Coarse-grained representations of the input network enable both efficient data compression and hierarchical visualization to achieve high quality representations of larger data sets. Our unified data representation theory will help the analysis of extensive data sets, by revealing the large-scale structure of complex networks in a comprehensible form. PMID:26348923

A Statistical Test of Walrasian Equilibrium by Means of Complex Networks Theory

NASA Astrophysics Data System (ADS)

Bargigli, Leonardo; Viaggiu, Stefano; Lionetto, Andrea

2016-10-01

We represent an exchange economy in terms of statistical ensembles for complex networks by introducing the concept of market configuration. This is defined as a sequence of nonnegative discrete random variables {w_{ij}} describing the flow of a given commodity from agent i to agent j. This sequence can be arranged in a nonnegative matrix W which we can regard as the representation of a weighted and directed network or digraph G. Our main result consists in showing that general equilibrium theory imposes highly restrictive conditions upon market configurations, which are in most cases not fulfilled by real markets. An explicit example with reference to the e-MID interbank credit market is provided.

System for information discovery

DOEpatents

Pennock, Kelly A [Richland, WA; Miller, Nancy E [Kennewick, WA

2002-11-19

A sequence of word filters are used to eliminate terms in the database which do not discriminate document content, resulting in a filtered word set and a topic word set whose members are highly predictive of content. These two word sets are then formed into a two dimensional matrix with matrix entries calculated as the conditional probability that a document will contain a word in a row given that it contains the word in a column. The matrix representation allows the resultant vectors to be utilized to interpret document contents.

Local-global analysis of crack growth in continuously reinfoced ceramic matrix composites

NASA Technical Reports Server (NTRS)

Ballarini, Roberto; Ahmed, Shamim

1989-01-01

This paper describes the development of a mathematical model for predicting the strength and micromechanical failure characteristics of continuously reinforced ceramic matrix composites. The local-global analysis models the vicinity of a propagating crack tip as a local heterogeneous region (LHR) consisting of spring-like representation of the matrix, fibers and interfaces. Parametric studies are conducted to investigate the effects of LHR size, component properties, and interface conditions on the strength and sequence of the failure processes in the unidirectional composite system.

Higher Rank ABJM Wilson Loops from Matrix Models

NASA Astrophysics Data System (ADS)

Cookmeyer, Jonathan; Liu, James; Zayas, Leopoldo

2017-01-01

We compute the expectation values of 1/6 supersymmetric Wilson Loops in ABJM theory in higher rank representations. Using standard matrix model techniques, we calculate the expectation value in the rank m fully symmetric and fully antisymmetric representation where m is scaled with N. To leading order, we find agreement with the classical action of D6 and D2 branes in AdS4 ×CP3 respectively. Further, we compute the first subleading order term, which, on the AdS side, makes a prediction for the one-loop effective action of the corresponding D6 and D2 branes. Supported by the National Science Foundation under Grant No. PHY 1559988 and the US Department of Energy under Grant No. DE-SC0007859.

Diagrammatic technique for calculating matrix elements of collective operators in superradiance. [eigenstates for N two-level atom systems

NASA Technical Reports Server (NTRS)

Lee, C. T.

1975-01-01

Adopting the so-called genealogical construction, one can express the eigenstates of collective operators corresponding to a specified mode for an N-atom system in terms of those for an (N-1) atom system. Using these Dicke states as bases and using the Wigner-Eckart theorem, a matrix element of a collective operator of an arbitrary mode can be written as the product of an m-dependent factor and an m-independent reduced matrix element (RME). A set of recursion formulas for the RME is obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups is then introduced. This gives a simple and systematic way of calculating the RME. This method is especially useful when the cooperation number r is close to N/2, where almost exact asymptotic expressions can be obtained easily. The result shows explicity the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes.

Robust infrared targets tracking with covariance matrix representation

NASA Astrophysics Data System (ADS)

Cheng, Jian

2009-07-01

Robust infrared target tracking is an important and challenging research topic in many military and security applications, such as infrared imaging guidance, infrared reconnaissance, scene surveillance, etc. To effectively tackle the nonlinear and non-Gaussian state estimation problems, particle filtering is introduced to construct the theory framework of infrared target tracking. Under this framework, the observation probabilistic model is one of main factors for infrared targets tracking performance. In order to improve the tracking performance, covariance matrices are introduced to represent infrared targets with the multi-features. The observation probabilistic model can be constructed by computing the distance between the reference target's and the target samples' covariance matrix. Because the covariance matrix provides a natural tool for integrating multiple features, and is scale and illumination independent, target representation with covariance matrices can hold strong discriminating ability and robustness. Two experimental results demonstrate the proposed method is effective and robust for different infrared target tracking, such as the sensor ego-motion scene, and the sea-clutter scene.

Frequency domain system identification methods - Matrix fraction description approach

NASA Technical Reports Server (NTRS)

Horta, Luca G.; Juang, Jer-Nan

1993-01-01

This paper presents the use of matrix fraction descriptions for least-squares curve fitting of the frequency spectra to compute two matrix polynomials. The matrix polynomials are intermediate step to obtain a linearized representation of the experimental transfer function. Two approaches are presented: first, the matrix polynomials are identified using an estimated transfer function; second, the matrix polynomials are identified directly from the cross/auto spectra of the input and output signals. A set of Markov parameters are computed from the polynomials and subsequently realization theory is used to recover a minimum order state space model. Unevenly spaced frequency response functions may be used. Results from a simple numerical example and an experiment are discussed to highlight some of the important aspect of the algorithm.

MATRIX-VBS Condensing Organic Aerosols in an Aerosol Microphysics Model

NASA Technical Reports Server (NTRS)

Gao, Chloe Y.; Tsigaridis, Konstas; Bauer, Susanne E.

2015-01-01

The condensation of organic aerosols is represented in a newly developed box-model scheme, where its effect on the growth and composition of particles are examined. We implemented the volatility-basis set (VBS) framework into the aerosol mixing state resolving microphysical scheme Multiconfiguration Aerosol TRacker of mIXing state (MATRIX). This new scheme is unique and advances the representation of organic aerosols in models in that, contrary to the traditional treatment of organic aerosols as non-volatile in most climate models and in the original version of MATRIX, this new scheme treats them as semi-volatile. Such treatment is important because low-volatility organics contribute significantly to the growth of particles. The new scheme includes several classes of semi-volatile organic compounds from the VBS framework that can partition among aerosol populations in MATRIX, thus representing the growth of particles via condensation of low volatility organic vapors. Results from test cases representing Mexico City and a Finish forrest condistions show good representation of the time evolutions of concentration for VBS species in the gas phase and in the condensed particulate phase. Emitted semi-volatile primary organic aerosols evaporate almost completely in the high volatile range, and they condense more efficiently in the low volatility range.

Protein Sub-Nuclear Localization Based on Effective Fusion Representations and Dimension Reduction Algorithm LDA.

PubMed

Wang, Shunfang; Liu, Shuhui

2015-12-19

An effective representation of a protein sequence plays a crucial role in protein sub-nuclear localization. The existing representations, such as dipeptide composition (DipC), pseudo-amino acid composition (PseAAC) and position specific scoring matrix (PSSM), are insufficient to represent protein sequence due to their single perspectives. Thus, this paper proposes two fusion feature representations of DipPSSM and PseAAPSSM to integrate PSSM with DipC and PseAAC, respectively. When constructing each fusion representation, we introduce the balance factors to value the importance of its components. The optimal values of the balance factors are sought by genetic algorithm. Due to the high dimensionality of the proposed representations, linear discriminant analysis (LDA) is used to find its important low dimensional structure, which is essential for classification and location prediction. The numerical experiments on two public datasets with KNN classifier and cross-validation tests showed that in terms of the common indexes of sensitivity, specificity, accuracy and MCC, the proposed fusing representations outperform the traditional representations in protein sub-nuclear localization, and the representation treated by LDA outperforms the untreated one.

Protein Sub-Nuclear Localization Based on Effective Fusion Representations and Dimension Reduction Algorithm LDA

PubMed Central

Wang, Shunfang; Liu, Shuhui

2015-01-01

An effective representation of a protein sequence plays a crucial role in protein sub-nuclear localization. The existing representations, such as dipeptide composition (DipC), pseudo-amino acid composition (PseAAC) and position specific scoring matrix (PSSM), are insufficient to represent protein sequence due to their single perspectives. Thus, this paper proposes two fusion feature representations of DipPSSM and PseAAPSSM to integrate PSSM with DipC and PseAAC, respectively. When constructing each fusion representation, we introduce the balance factors to value the importance of its components. The optimal values of the balance factors are sought by genetic algorithm. Due to the high dimensionality of the proposed representations, linear discriminant analysis (LDA) is used to find its important low dimensional structure, which is essential for classification and location prediction. The numerical experiments on two public datasets with KNN classifier and cross-validation tests showed that in terms of the common indexes of sensitivity, specificity, accuracy and MCC, the proposed fusing representations outperform the traditional representations in protein sub-nuclear localization, and the representation treated by LDA outperforms the untreated one. PMID:26703574

Representing k-graphs as Matrix Algebras

NASA Astrophysics Data System (ADS)

Rosjanuardi, R.

2018-05-01

For any commutative unital ring R and finitely aligned k-graph Λ with |Λ| < ∞ without cycles, we can realise Kumjian-Pask algebra KP R (Λ) as a direct sum of of matrix algebra over some vertices v with properties ν = νΛ, i.e: ⊕ νΛ=ν M |Λv|(R). When there is only a single vertex ν ∈ Λ° such that ν = νΛ, we can realise the Kumjian-Pask algebra as the matrix algebra M |ΛV|(R). Hence the matrix algebra M |vΛ|(R) can be regarded as a representation of the k-graph Λ. In this talk we will figure out the relation between finitely aligned k-graph and matrix algebra.

La structure de Jordan des matrices de transfert des modeles de boucles et la relation avec les hamiltoniens XXZ

NASA Astrophysics Data System (ADS)

Morin-Duchesne, Alexi

Lattice models such as percolation, the Ising model and the Potts model are useful for the description of phase transitions in two dimensions. Finding analytical solutions is done by calculating the partition function, which in turn requires finding eigenvalues of transfer matrices. At the critical point, the two dimensional statistical models are invariant under conformal transformations and the construction of rational conformal field theories, as the continuum limit of these lattice models, allows one to compute the partition function at the critical point. Many researchers think however that the paradigm of rational conformal conformal field theories can be extended to include models with non diagonalizable transfer matrices. These models would then be described, in the scaling limit, by logarithmic conformal field theories and the representations of the Virasoro algebra coming into play would be indecomposable. We recall the construction of the double-row transfer matrix DN (λ, u) of the Fortuin-Kasteleyn model, seen as an element of the Temperley-Lieb algebra. This transfer matrix comes into play in physical theories through its representation in link modules (or standard modules). The vector space on which this representation acts decomposes into sectors labelled by a physical parameter d, the number of defects, which remains constant or decreases in the link representations. This thesis is devoted to the identification of the Jordan structure of DN(λ, u) in the link representations. The parameter β = 2 cos λ = -(q + q-1) fixes the theory : for instance β = 1 for percolation and 2 for the Ising model. On the geometry of the strip with open boundary conditions, we show that DN(λ, u) has the same Jordan blocks as its highest Fourier coefficient, FN. We study the non-diagonalizability of FN through the divergences of some of the eigenstates of ρ(F N) that appear at the critical values of λ. The Jordan cells we find in ρ(DN(λ, u)) have rank 2 and couple sectors d and d' when specific constraints on λ, d, d' and N are satisfied. For the model of critical dense polymers (β = 0) on the strip, the eigenvalues of ρ(DN(λ, u)) were known, but their degeneracies only conjectured. By constructing an isomorphism between the link modules on the strip and a subspace of spin modules of the XXZ model at q = i, we prove this conjecture. We also show that the restriction of the Hamiltonian to any sector d is diagonalizable, and that the XX Hamiltonian has rank 2 Jordan cells when N is even. Finally, we study the Jordan structure of the transfer matrix T N(λ, ν) for periodic boundary conditions. When λ = πa/b and a, b ∈ Z× , the matrix TN(λ, ν) has Jordan blocks between sectors, but also within sectors. The approach using FN admits a generalization to the present case and allows us to probe the Jordan cells that tie different sectors. The rank of these cells exceeds 2 in some cases and can grow indefinitely with N. For the Jordan blocks within a sector, we show that the link modules on the cylinder and the XXZ spin modules are isomorphic except for specific curves in the (q, ν) plane. By using the behavior of the transformation ĩd N in a neighborhood of the critical values (qc, ν c), we explicitly build Jordan partners of rank 2 and discuss the existence of Jordan cells with higher rank. Keywords : phase transitions, Ising model, Potts model, Fortuin-Kasteleyn model, transfer matrix method, XXZ Hamiltonian, logarithmic conformal field theory, Jordan structure.

Tomographic PIV: particles versus blobs

NASA Astrophysics Data System (ADS)

Champagnat, Frédéric; Cornic, Philippe; Cheminet, Adam; Leclaire, Benjamin; Le Besnerais, Guy; Plyer, Aurélien

2014-08-01

We present an alternative approach to tomographic particle image velocimetry (tomo-PIV) that seeks to recover nearly single voxel particles rather than blobs of extended size. The baseline of our approach is a particle-based representation of image data. An appropriate discretization of this representation yields an original linear forward model with a weight matrix built with specific samples of the system’s point spread function (PSF). Such an approach requires only a few voxels to explain the image appearance, therefore it favors much more sparsely reconstructed volumes than classic tomo-PIV. The proposed forward model is general and flexible and can be embedded in a classical multiplicative algebraic reconstruction technique (MART) or a simultaneous multiplicative algebraic reconstruction technique (SMART) inversion procedure. We show, using synthetic PIV images and by way of a large exploration of the generating conditions and a variety of performance metrics, that the model leads to better results than the classical tomo-PIV approach, in particular in the case of seeding densities greater than 0.06 particles per pixel and of PSFs characterized by a standard deviation larger than 0.8 pixels.

Comments on higher rank Wilson loops in N = 2∗

NASA Astrophysics Data System (ADS)

Liu, James T.; Zayas, Leopoldo A. Pando; Zhou, Shan

2018-01-01

For N = 2∗ theory with U( N ) gauge group we evaluate expectation values of Wilson loops in representations described by a rectangular Young tableau with n rows and k columns. The evaluation reduces to a two-matrix model and we explain, using a combination of numerical and analytical techniques, the general properties of the eigen-value distributions in various regimes of parameters ( N, λ , n, k) where λ is the 't Hooft coupling. In the large N limit we present analytic results for the leading and sub-leading contributions. In the particular cases of only one row or one column we reproduce previously known results for the totally symmetry and totally antisymmetric representations. We also extensively discusss the N = 4 limit of the N = 2∗ theory. While establishing these connections we clarify aspects of various orders of limits and how to relax them; we also find it useful to explicitly address details of the genus expansion. As a result, for the totally symmetric Wilson loop we find new contributions that improve the comparison with the dual holographic computation at one loop order in the appropriate regime.

Task-driven dictionary learning.

PubMed

Mairal, Julien; Bach, Francis; Ponce, Jean

2012-04-01

Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal processing. For signals such as natural images that admit such sparse representations, it is now well established that these models are well suited to restoration tasks. In this context, learning the dictionary amounts to solving a large-scale matrix factorization problem, which can be done efficiently with classical optimization tools. The same approach has also been used for learning features from data for other purposes, e.g., image classification, but tuning the dictionary in a supervised way for these tasks has proven to be more difficult. In this paper, we present a general formulation for supervised dictionary learning adapted to a wide variety of tasks, and present an efficient algorithm for solving the corresponding optimization problem. Experiments on handwritten digit classification, digital art identification, nonlinear inverse image problems, and compressed sensing demonstrate that our approach is effective in large-scale settings, and is well suited to supervised and semi-supervised classification, as well as regression tasks for data that admit sparse representations.

Network representation of protein interactions: Theory of graph description and analysis.

PubMed

Kurzbach, Dennis

2016-09-01

A methodological framework is presented for the graph theoretical interpretation of NMR data of protein interactions. The proposed analysis generalizes the idea of network representations of protein structures by expanding it to protein interactions. This approach is based on regularization of residue-resolved NMR relaxation times and chemical shift data and subsequent construction of an adjacency matrix that represents the underlying protein interaction as a graph or network. The network nodes represent protein residues. Two nodes are connected if two residues are functionally correlated during the protein interaction event. The analysis of the resulting network enables the quantification of the importance of each amino acid of a protein for its interactions. Furthermore, the determination of the pattern of correlations between residues yields insights into the functional architecture of an interaction. This is of special interest for intrinsically disordered proteins, since the structural (three-dimensional) architecture of these proteins and their complexes is difficult to determine. The power of the proposed methodology is demonstrated at the example of the interaction between the intrinsically disordered protein osteopontin and its natural ligand heparin. © 2016 The Protein Society.

Neural representations and the cortical body matrix: implications for sports medicine and future directions.

PubMed

Wallwork, Sarah B; Bellan, Valeria; Catley, Mark J; Moseley, G Lorimer

2016-08-01

Neural representations, or neurotags, refer to the idea that networks of brain cells, distributed across multiple brain areas, work in synergy to produce outputs. The brain can be considered then, a complex array of neurotags, each influencing and being influenced by each other. The output of some neurotags act on other systems, for example, movement, or on consciousness, for example, pain. This concept of neurotags has sparked a new body of research into pain and rehabilitation. We draw on this research and the concept of a cortical body matrix-a network of representations that subserves the regulation and protection of the body and the space around it-to suggest important implications for rehabilitation of sports injury and for sports performance. Protective behaviours associated with pain have been reinterpreted in light of these conceptual models. With a particular focus on rehabilitation of the injured athlete, this review presents the theoretical underpinnings of the cortical body matrix and its application within the sporting context. Therapeutic approaches based on these ideas are discussed and the efficacy of the most tested approaches is addressed. By integrating current thought in pain and cognitive neuroscience related to sports rehabilitation, recommendations for clinical practice and future research are suggested. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

NoGOA: predicting noisy GO annotations using evidences and sparse representation.

PubMed

Yu, Guoxian; Lu, Chang; Wang, Jun

2017-07-21

Gene Ontology (GO) is a community effort to represent functional features of gene products. GO annotations (GOA) provide functional associations between GO terms and gene products. Due to resources limitation, only a small portion of annotations are manually checked by curators, and the others are electronically inferred. Although quality control techniques have been applied to ensure the quality of annotations, the community consistently report that there are still considerable noisy (or incorrect) annotations. Given the wide application of annotations, however, how to identify noisy annotations is an important but yet seldom studied open problem. We introduce a novel approach called NoGOA to predict noisy annotations. NoGOA applies sparse representation on the gene-term association matrix to reduce the impact of noisy annotations, and takes advantage of sparse representation coefficients to measure the semantic similarity between genes. Secondly, it preliminarily predicts noisy annotations of a gene based on aggregated votes from semantic neighborhood genes of that gene. Next, NoGOA estimates the ratio of noisy annotations for each evidence code based on direct annotations in GOA files archived on different periods, and then weights entries of the association matrix via estimated ratios and propagates weights to ancestors of direct annotations using GO hierarchy. Finally, it integrates evidence-weighted association matrix and aggregated votes to predict noisy annotations. Experiments on archived GOA files of six model species (H. sapiens, A. thaliana, S. cerevisiae, G. gallus, B. Taurus and M. musculus) demonstrate that NoGOA achieves significantly better results than other related methods and removing noisy annotations improves the performance of gene function prediction. The comparative study justifies the effectiveness of integrating evidence codes with sparse representation for predicting noisy GO annotations. Codes and datasets are available at http://mlda.swu.edu.cn/codes.php?name=NoGOA .

Motor memory is encoded as a gain-field combination of intrinsic and extrinsic action representations.

PubMed

Brayanov, Jordan B; Press, Daniel Z; Smith, Maurice A

2012-10-24

Actions can be planned in either an intrinsic (body-based) reference frame or an extrinsic (world-based) frame, and understanding how the internal representations associated with these frames contribute to the learning of motor actions is a key issue in motor control. We studied the internal representation of this learning in human subjects by analyzing generalization patterns across an array of different movement directions and workspaces after training a visuomotor rotation in a single movement direction in one workspace. This provided a dense sampling of the generalization function across intrinsic and extrinsic reference frames, which allowed us to dissociate intrinsic and extrinsic representations and determine the manner in which they contributed to the motor memory for a trained action. A first experiment showed that the generalization pattern reflected a memory that was intermediate between intrinsic and extrinsic representations. A second experiment showed that this intermediate representation could not arise from separate intrinsic and extrinsic learning. Instead, we find that the representation of learning is based on a gain-field combination of local representations in intrinsic and extrinsic coordinates. This gain-field representation generalizes between actions by effectively computing similarity based on the (Mahalanobis) distance across intrinsic and extrinsic coordinates and is in line with neural recordings showing mixed intrinsic-extrinsic representations in motor and parietal cortices.

The role of physical digit representation and numerical magnitude representation in children's multiplication fact retrieval.

PubMed

De Visscher, Alice; Noël, Marie-Pascale; De Smedt, Bert

2016-12-01

Arithmetic facts, in particular multiplication tables, are thought to be stored in long-term memory and to be interference prone. At least two representations underpinning these arithmetic facts have been suggested: a physical representation of the digits and a numerical magnitude representation. We hypothesized that both representations are possible sources of interference that could explain individual differences in multiplication fact performance and/or in strategy use. We investigated the specificity of these interferences on arithmetic fact retrieval and explored the relation between interference and performance on the different arithmetic operations and on general mathematics achievement. Participants were 79 fourth-grade children (M age =9.6 years) who completed a products comparison and a multiplication production task with verbal strategy reports. Performances on a speeded calculation test including the four operations and on a general mathematics achievement test were also collected. Only the interference coming from physical representations was a significant predictor of the performance across multiplications. However, both the magnitude and physical representations were unique predictors of individual differences in multiplication. The frequency of the retrieval strategy across multiplication problems and across individuals was determined only by the physical representation, which therefore is suggested as being responsible for memory storage issues. Interestingly, this impact of physical representation was not observed when predicting performance on subtraction or on general mathematical achievement. In contrast, the impact of the numerical magnitude representation was more general in that it was observed across all arithmetic operations and in general mathematics achievement. Copyright © 2016 Elsevier Inc. All rights reserved.

Reconstructing householder vectors from Tall-Skinny QR

DOE PAGES

Ballard, Grey Malone; Demmel, James; Grigori, Laura; ...

2015-08-05

The Tall-Skinny QR (TSQR) algorithm is more communication efficient than the standard Householder algorithm for QR decomposition of matrices with many more rows than columns. However, TSQR produces a different representation of the orthogonal factor and therefore requires more software development to support the new representation. Further, implicitly applying the orthogonal factor to the trailing matrix in the context of factoring a square matrix is more complicated and costly than with the Householder representation. We show how to perform TSQR and then reconstruct the Householder vector representation with the same asymptotic communication efficiency and little extra computational cost. We demonstratemore » the high performance and numerical stability of this algorithm both theoretically and empirically. The new Householder reconstruction algorithm allows us to design more efficient parallel QR algorithms, with significantly lower latency cost compared to Householder QR and lower bandwidth and latency costs compared with Communication-Avoiding QR (CAQR) algorithm. Experiments on supercomputers demonstrate the benefits of the communication cost improvements: in particular, our experiments show substantial improvements over tuned library implementations for tall-and-skinny matrices. Furthermore, we also provide algorithmic improvements to the Householder QR and CAQR algorithms, and we investigate several alternatives to the Householder reconstruction algorithm that sacrifice guarantees on numerical stability in some cases in order to obtain higher performance.« less

Modified signed-digit arithmetic based on redundant bit representation.

PubMed

Huang, H; Itoh, M; Yatagai, T

1994-09-10

Fully parallel modified signed-digit arithmetic operations are realized based on redundant bit representation of the digits proposed. A new truth-table minimizing technique is presented based on redundant-bitrepresentation coding. It is shown that only 34 minterms are enough for implementing one-step modified signed-digit addition and subtraction with this new representation. Two optical implementation schemes, correlation and matrix multiplication, are described. Experimental demonstrations of the correlation architecture are presented. Both architectures use fixed minterm masks for arbitrary-length operands, taking full advantage of the parallelism of the modified signed-digit number system and optics.

Theory and experimental results of transfer-NOE experiments. 1. The influence of the off rate versus cross-relaxation rates

NASA Astrophysics Data System (ADS)

Lippens, R. M.; Cerf, C.; Hallenga, K.

The theory of the transferred nuclear Overhauser effect is presented in the framework of an extended relaxation matrix representation. This matrix representation allows a coherent description of all one- and two-dimensional experiments. We present analytical solutions for the buildup of magnetization in the 2D transfer-NOE experiment, for all ratios of the off rate k to the cross-relaxation rates R involved. We show that systematic deviations in distance determination occur when the off rate becomes comparable to or smaller than the relaxation rates. Experimental results on the peptide/protein system oxytocin/neurophysin confirming this analysis are presented. The importance of residual mobility in the bound ligand, as demonstrated by the experimental data, is also discussed.

The controversial nuclear matrix: a balanced point of view.

PubMed

Martelli, A M; Falcieri, E; Zweyer, M; Bortul, R; Tabellini, G; Cappellini, A; Cocco, L; Manzoli, L

2002-10-01

The nuclear matrix is defined as the residual framework after the removal of the nuclear envelope, chromatin, and soluble components by sequential extractions. According to several investigators the nuclear matrix provides the structural basis for intranuclear order. However, the existence itself and the nature of this structure is still uncertain. Although the techniques used for the visualization of the nuclear matrix have improved over the years, it is still unclear to what extent the isolated nuclear matrix corresponds to an in vivo existing structure. Therefore, considerable skepticism continues to surround the nuclear matrix fraction as an accurate representation of the situation in living cells. Here, we summarize the experimental evidence in favor of, or against, the presence of a diffuse nucleoskeleton as a facilitating organizational nonchromatin structure of the nucleus.

GENERALIZED DIGITAL CONTOURING PROGRAM

NASA Technical Reports Server (NTRS)

Jones, R. L.

1994-01-01

This is a digital computer contouring program developed by combining desirable characteristics from several existing contouring programs. It can easily be adapted to many different research requirements. The overlaid structure of the program permits desired modifications to be made with ease. The contouring program performs both the task of generating a depth matrix from either randomly or regularly spaced surface heights and the task of contouring the data. Each element of the depth matrix is computed as a weighted mean of heights predicted at an element by planes tangent to the surface at neighboring control points. Each contour line is determined by its intercepts with the sides of geometrical figures formed by connecting the various elements of the depth matrix with straight lines. Although contour charts are usually thought of as being two-dimensional pictorial representations of topographic formations of land masses, they can also be useful in portraying data which are obtained during the course of research in various scientific disciplines and which would ordinarily be tabulated. Any set of data which can be referenced to a two-dimensional coordinate system can be graphically represented by this program. This program is written in FORTRAN IV and ASSEMBLER for batch execution and has been implemented on the CDC 6000 Series. This program was developed in 1971.

Algebraic techniques for diagonalization of a split quaternion matrix in split quaternionic mechanics

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

Jiang, Tongsong, E-mail: jiangtongsong@sina.com; Department of Mathematics, Heze University, Heze, Shandong 274015; Jiang, Ziwu

In the study of the relation between complexified classical and non-Hermitian quantum mechanics, physicists found that there are links to quaternionic and split quaternionic mechanics, and this leads to the possibility of employing algebraic techniques of split quaternions to tackle some problems in complexified classical and quantum mechanics. This paper, by means of real representation of a split quaternion matrix, studies the problem of diagonalization of a split quaternion matrix and gives algebraic techniques for diagonalization of split quaternion matrices in split quaternionic mechanics.

Lattice Symmetry and Identification-The Fundamental Role of Reduced Cells in Materials Characterization.

PubMed

Mighell, A D

2001-01-01

In theory, physical crystals can be represented by idealized mathematical lattices. Under appropriate conditions, these representations can be used for a variety of purposes such as identifying, classifying, and understanding the physical properties of materials. Critical to these applications is the ability to construct a unique representation of the lattice. The vital link that enabled this theory to be realized in practice was provided by the 1970 paper on the determination of reduced cells. This seminal paper led to a mathematical approach to lattice analysis initially based on systematic reduction procedures and the use of standard cells. Subsequently, the process evolved to a matrix approach based on group theory and linear algebra that offered a more abstract and powerful way to look at lattices and their properties. Application of the reduced cell to both database work and laboratory research at NIST was immediately successful. Currently, this cell and/or procedures based on reduction are widely and routinely used by the general scientific community: (i) for calculating standard cells for the reporting of crystalline materials, (ii) for classifying materials, (iii) in crystallographic database work (iv) in routine x-ray and neutron diffractometry, and (v) in general crystallographic research. Especially important is its use in symmetry determination and in identification. The focus herein is on the role of the reduced cell in lattice symmetry determination.

A general framework for numerical simulation of improvised explosive device (IED)-detection scenarios using density functional theory (DFT) and terahertz (THz) spectra.

PubMed

Shabaev, Andrew; Lambrakos, Samuel G; Bernstein, Noam; Jacobs, Verne L; Finkenstadt, Daniel

2011-04-01

We have developed a general framework for numerical simulation of various types of scenarios that can occur for the detection of improvised explosive devices (IEDs) through the use of excitation using incident electromagnetic waves. A central component model of this framework is an S-matrix representation of a multilayered composite material system. Each layer of the system is characterized by an average thickness and an effective electric permittivity function. The outputs of this component are the reflectivity and the transmissivity as functions of frequency and angle of the incident electromagnetic wave. The input of the component is a parameterized analytic-function representation of the electric permittivity as a function of frequency, which is provided by another component model of the framework. The permittivity function is constructed by fitting response spectra calculated using density functional theory (DFT) and parameter adjustment according to any additional information that may be available, e.g., experimentally measured spectra or theory-based assumptions concerning spectral features. A prototype simulation is described that considers response characteristics for THz excitation of the high explosive β-HMX. This prototype simulation includes a description of a procedure for calculating response spectra using DFT as input to the Smatrix model. For this purpose, the DFT software NRLMOL was adopted. © 2011 Society for Applied Spectroscopy

Lattice Symmetry and Identification—The Fundamental Role of Reduced Cells in Materials Characterization

PubMed Central

Mighell, Alan D.

2001-01-01

In theory, physical crystals can be represented by idealized mathematical lattices. Under appropriate conditions, these representations can be used for a variety of purposes such as identifying, classifying, and understanding the physical properties of materials. Critical to these applications is the ability to construct a unique representation of the lattice. The vital link that enabled this theory to be realized in practice was provided by the 1970 paper on the determination of reduced cells. This seminal paper led to a mathematical approach to lattice analysis initially based on systematic reduction procedures and the use of standard cells. Subsequently, the process evolved to a matrix approach based on group theory and linear algebra that offered a more abstract and powerful way to look at lattices and their properties. Application of the reduced cell to both database work and laboratory research at NIST was immediately successful. Currently, this cell and/or procedures based on reduction are widely and routinely used by the general scientific community: (i) for calculating standard cells for the reporting of crystalline materials, (ii) for classifying materials, (iii) in crystallographic database work (iv) in routine x-ray and neutron diffractometry, and (v) in general crystallographic research. Especially important is its use in symmetry determination and in identification. The focus herein is on the role of the reduced cell in lattice symmetry determination. PMID:27500059

CUGatesDensity—Quantum circuit analyser extended to density matrices

NASA Astrophysics Data System (ADS)

Loke, T.; Wang, J. B.

2013-12-01

CUGatesDensity is an extension of the original quantum circuit analyser CUGates (Loke and Wang, 2011) [7] to provide explicit support for the use of density matrices. The new package enables simulation of quantum circuits involving statistical ensemble of mixed quantum states. Such analysis is of vital importance in dealing with quantum decoherence, measurements, noise and error correction, and fault tolerant computation. Several examples involving mixed state quantum computation are presented to illustrate the use of this package. Catalogue identifier: AEPY_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEPY_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 5368 No. of bytes in distributed program, including test data, etc.: 143994 Distribution format: tar.gz Programming language: Mathematica. Computer: Any computer installed with a copy of Mathematica 6.0 or higher. Operating system: Any system with a copy of Mathematica 6.0 or higher installed. Classification: 4.15. Nature of problem: To simulate arbitrarily complex quantum circuits comprised of single/multiple qubit and qudit quantum gates with mixed state registers. Solution method: A density matrix representation for mixed states and a state vector representation for pure states are used. The construct is based on an irreducible form of matrix decomposition, which allows a highly efficient implementation of general controlled gates with multiple conditionals. Running time: The examples provided in the notebook CUGatesDensity.nb take approximately 30 s to run on a laptop PC.

How do agents represent?

NASA Astrophysics Data System (ADS)

Ryan, Alex

Representation is inherent to the concept of an agent, but its importance in complex systems has not yet been widely recognised. In this paper I introduce Peirce's theory of signs, which facilitates a definition of representation in general. In summary, representation means that for some agent, a model is used to stand in for another entity in a way that shapes the behaviour of the agent with respect to that entity. Representation in general is then related to the theories of representation that have developed within different disciplines. I compare theories of representation from metaphysics, military theory and systems theory. Additional complications arise in explaining the special case of mental representations, which is the focus of cognitive science. I consider the dominant theory of cognition — that the brain is a representational device — as well as the sceptical anti-representational response. Finally, I argue that representation distinguishes agents from non-representational objects: agents are objects capable of representation.

Mean first passage times of Brownian rotators from differential recurrence relations

NASA Astrophysics Data System (ADS)

Coffey, W. T.

1999-11-01

An exact method of calculation of mean first passage times (analogous to that previously used [W. T. Coffey, Yu. P. Kalmykov, E. S. Massawe, and J. T. Waldron, J. Chem. Phys. 99, 4011 (1993)] for the correlation time) is developed in terms of continued fractions from the zero frequency limit of the Laplace transform of the set of differential recurrence relations generated by the Fokker-Planck or Langevin equations. The method because it is based on a Floquet representation avoids the use of quadratures and so may be easily generalized to multidegree of freedom systems by the use of matrix continued fractions. The procedure is illustrated by considering the mean first passage time of a fixed axis rotator with two equivalent sites.

Representation of viruses in the remediated PDB archive

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

Lawson, Catherine L., E-mail: cathy.lawson@rutgers.edu; Dutta, Shuchismita; Westbrook, John D.

2008-08-01

A new data model for PDB entries of viruses and other biological assemblies with regular noncrystallographic symmetry is described. A new scheme has been devised to represent viruses and other biological assemblies with regular noncrystallographic symmetry in the Protein Data Bank (PDB). The scheme describes existing and anticipated PDB entries of this type using generalized descriptions of deposited and experimental coordinate frames, symmetry and frame transformations. A simplified notation has been adopted to express the symmetry generation of assemblies from deposited coordinates and matrix operations describing the required point, helical or crystallographic symmetry. Complete correct information for building full assemblies,more » subassemblies and crystal asymmetric units of all virus entries is now available in the remediated PDB archive.« less

On the Solutions of Two-Extended Principal Conformal Toda Theory

NASA Astrophysics Data System (ADS)

Chao, L.; Hou, B. Y.

1994-02-01

The solutions of the two-extended principal conformal Toda theory (2-EPCT theory, also called bosonic superconformal Toda theory) are constructed in two different ways: (1) Leznov-Saveliev algebraic analysis and (2) the associated chiral embedding surface. The first approach gives rise to the general solution in terms of appropriate matrix elements in different fundamental representations of the underlying Lie algebra, whilst the second one leads to a special solution in the form of Wronski determinants and their co-minors, and it gives an explicit geometrical interpretation of the WZNW → 2-EPCT reduction. The key points of both approaches are the chiral vectors derived recently by the authors, which constitute a closed exchange algebra of the theory.

Semiclassical IVR treatment of reactive collisions

NASA Astrophysics Data System (ADS)

Elran, Y.; Kay, K. G.

2002-06-01

We generalize a recently-developed semiclassical uniform initial value representation (IVR) treatment of the S-matrix [Y. Elran and K. G. Kay, J. Chem. Phys. 114, 4362 (2001)] to chaotic nonreactive and reactive collinear scattering. The present modifications allow one to determine the phase of the complex IVR integrand in a unique and practical manner even when the integrand is discontinuous or rapidly varying. The method is applied to the collinear H+H2 exchange reaction on the Porter-Karplus surface. A strategy is introduced for adapting the integration over the chaotic chattering zones to the fractal nature of the integrand. The results indicate that the technique is capable of good accuracy while requiring a relatively small number of trajectories per energy.

Motor Memory Is Encoded as a Gain-Field Combination of Intrinsic and Extrinsic Action Representations

PubMed Central

Brayanov, Jordan B.; Press, Daniel Z.; Smith, Maurice A.

2013-01-01

Actions can be planned in either an intrinsic (body-based) reference frame or an extrinsic (world-based) frame, and understanding how the internal representations associated with these frames contribute to the learning of motor actions is a key issue in motor control. We studied the internal representation of this learning in human subjects by analyzing generalization patterns across an array of different movement directions and workspaces after training a visuomotor rotation in a single movement direction in one workspace. This provided a dense sampling of the generalization function across intrinsic and extrinsic reference frames, which allowed us to dissociate intrinsic and extrinsic representations and determine the manner in which they contributed to the motor memory for a trained action. A first experiment showed that the generalization pattern reflected a memory that was intermediate between intrinsic and extrinsic representations. A second experiment showed that this intermediate representation could not arise from separate intrinsic and extrinsic learning. Instead, we find that the representation of learning is based on a gain-field combination of local representations in intrinsic and extrinsic coordinates. This gain-field representation generalizes between actions by effectively computing similarity based on the (Mahalanobis) distance across intrinsic and extrinsic coordinates and is in line with neural recordings showing mixed intrinsic-extrinsic representations in motor and parietal cortices. PMID:23100418

29 CFR 4003.6 - Representation.

Code of Federal Regulations, 2010 CFR

2010-07-01

... Relating to Labor (Continued) PENSION BENEFIT GUARANTY CORPORATION GENERAL RULES FOR ADMINISTRATIVE REVIEW OF AGENCY DECISIONS General Provisions § 4003.6 Representation. A person may file any document or... of attorney, signed by the person making the designation, which authorizes the representation and...

Direct Iterative Nonlinear Inversion by Multi-frequency T-matrix Completion

NASA Astrophysics Data System (ADS)

Jakobsen, M.; Wu, R. S.

2016-12-01

Researchers in the mathematical physics community have recently proposed a conceptually new method for solving nonlinear inverse scattering problems (like FWI) which is inspired by the theory of nonlocality of physical interactions. The conceptually new method, which may be referred to as the T-matrix completion method, is very interesting since it is not based on linearization at any stage. Also, there are no gradient vectors or (inverse) Hessian matrices to calculate. However, the convergence radius of this promising T-matrix completion method is seriously restricted by it's use of single-frequency scattering data only. In this study, we have developed a modified version of the T-matrix completion method which we believe is more suitable for applications to nonlinear inverse scattering problems in (exploration) seismology, because it makes use of multi-frequency data. Essentially, we have simplified the single-frequency T-matrix completion method of Levinson and Markel and combined it with the standard sequential frequency inversion (multi-scale regularization) method. For each frequency, we first estimate the experimental T-matrix by using the Moore-Penrose pseudo inverse concept. Then this experimental T-matrix is used to initiate an iterative procedure for successive estimation of the scattering potential and the T-matrix using the Lippmann-Schwinger for the nonlinear relation between these two quantities. The main physical requirements in the basic iterative cycle is that the T-matrix should be data-compatible and the scattering potential operator should be dominantly local; although a non-local scattering potential operator is allowed in the intermediate iterations. In our simplified T-matrix completion strategy, we ensure that the T-matrix updates are always data compatible simply by adding a suitable correction term in the real space coordinate representation. The use of singular-value decomposition representations are not required in our formulation since we have developed an efficient domain decomposition method. The results of several numerical experiments for the SEG/EAGE salt model illustrate the importance of using multi-frequency data when performing frequency domain full waveform inversion in strongly scattering media via the new concept of T-matrix completion.

A representation for error detection and recovery in robot task plans

NASA Technical Reports Server (NTRS)

Lyons, D. M.; Vijaykumar, R.; Venkataraman, S. T.

1990-01-01

A general definition is given of the problem of error detection and recovery in robot assembly systems, and a general representation is developed for dealing with the problem. This invariant representation involves a monitoring process which is concurrent, with one monitor per task plan. A plan hierarchy is discussed, showing how diagnosis and recovery can be handled using the representation.

A canonical state-space representation for SISO systems using multipoint Jordan CFE. [Continued-Fraction Expansion

NASA Technical Reports Server (NTRS)

Hwang, Chyi; Guo, Tong-Yi; Shieh, Leang-San

1991-01-01

A canonical state-space realization based on the multipoint Jordan continued-fraction expansion (CFE) is presented for single-input-single-output (SISO) systems. The similarity transformation matrix which relates the new canonical form to the phase-variable canonical form is also derived. The presented canonical state-space representation is particularly attractive for the application of SISO system theory in which a reduced-dimensional time-domain model is necessary.

The impact of category structure and training methodology on learning and generalizing within-category representations.

PubMed

Ell, Shawn W; Smith, David B; Peralta, Gabriela; Hélie, Sébastien

2017-08-01

When interacting with categories, representations focused on within-category relationships are often learned, but the conditions promoting within-category representations and their generalizability are unclear. We report the results of three experiments investigating the impact of category structure and training methodology on the learning and generalization of within-category representations (i.e., correlational structure). Participants were trained on either rule-based or information-integration structures using classification (Is the stimulus a member of Category A or Category B?), concept (e.g., Is the stimulus a member of Category A, Yes or No?), or inference (infer the missing component of the stimulus from a given category) and then tested on either an inference task (Experiments 1 and 2) or a classification task (Experiment 3). For the information-integration structure, within-category representations were consistently learned, could be generalized to novel stimuli, and could be generalized to support inference at test. For the rule-based structure, extended inference training resulted in generalization to novel stimuli (Experiment 2) and inference training resulted in generalization to classification (Experiment 3). These data help to clarify the conditions under which within-category representations can be learned. Moreover, these results make an important contribution in highlighting the impact of category structure and training methodology on the generalization of categorical knowledge.

N-fold Darboux Transformation for Integrable Couplings of AKNS Equations

NASA Astrophysics Data System (ADS)

Yu, Jing; Chen, Shou-Ting; Han, Jing-Wei; Ma, Wen-Xiu

2018-04-01

For the integrable couplings of Ablowitz-Kaup-Newell-Segur (ICAKNS) equations, N-fold Darboux transformation (DT) TN, which is a 4 × 4 matrix, is constructed in this paper. Each element of this matrix is expressed by a ratio of the (4N + 1)-order determinant and 4N-order determinant of eigenfunctions. By making use of these formulae, the determinant expressions of N-transformed new solutions p [N], q [N], r [N] and s [N] are generated by this N-fold DT. Furthermore, when the reduced conditions q = ‑p* and s = ‑r* are chosen, we obtain determinant representations of N-fold DT and N-transformed solutions for the integrable couplings of nonlinear Schrödinger (ICNLS) equations. Starting from the zero seed solutions, one-soliton solutions are explicitly given as an example. Supported by the National Natural Science Foundation of China under Grant Nos. 61771174, 11371326, 11371361, 11301454, and 11271168, Natural Science Fund for Colleges and Universities of Jiangsu Province of China under Grant No. 17KJB110020, and General Research Project of Department of Education of Zhejiang Province (Y201636538)

Implementation of a fast digital optical matrix-vector multiplier using a holographic look-up table and residue arithmetic

NASA Technical Reports Server (NTRS)

Habiby, Sarry F.; Collins, Stuart A., Jr.

1987-01-01

The design and implementation of a digital (numerical) optical matrix-vector multiplier are presented. A Hughes liquid crystal light valve, the residue arithmetic representation, and a holographic optical memory are used to construct position coded optical look-up tables. All operations are performed in effectively one light valve response time with a potential for a high information density.

Implementation of a fast digital optical matrix-vector multiplier using a holographic look-up table and residue arithmetic.

PubMed

Habiby, S F; Collins, S A

1987-11-01

The design and implementation of a digital (numerical) optical matrix-vector multiplier are presented. A Hughes liquid crystal light valve, the residue arithmetic representation, and a holographic optical memory are used to construct position coded optical look-up tables. All operations are performed in effectively one light valve response time with a potential for a high information density.

DYMAFLEX: DYnamic Manipulation FLight EXperiment

DTIC Science & Technology

2013-09-03

thrust per nozzle and minimize propellant mass and tank mass. This study compared carbon dioxide, nitrous oxide, and R134-A. These results were...equations of mo- tion of a space manipulator, showing their top- level, matrix- vector representation to be of iden- tical form to those of a fixed-base...the system inertia matrix, q is the po- sition state vector (consisting of the manipulator joint angles θ, spacecraft attitude quaternion, and

Dielectric constant adjustments in computations of the scattering properties of solid ice crystals using the Generalized Multi-particle Mie method

NASA Astrophysics Data System (ADS)

Lu, Yinghui; Aydin, Kültegin; Clothiaux, Eugene E.; Verlinde, Johannes

2014-03-01

Ice crystal scattering properties at microwave radar wavelengths can be modeled with the Generalized Multi-particle Mie (GMM) method by decomposing an ice crystal into a cluster of tiny spheres composed of solid ice. In this decomposition the mass distribution of the tiny spheres in the cluster is no longer equivalent to that in the original ice crystal because of gaps between the tiny spheres. To compensate for the gaps in the cluster representation of an ice crystal in the GMM computation of crystal scattering properties, the Maxwell Garnett approximation is used to estimate what the dielectric function of the tiny spheres (i.e., the inclusions) in the cluster must be to make the cluster of tiny spheres with associated air gaps (i.e., the background matrix) dielectrically equivalent to the original solid ice crystal. Overall, compared with the T-matrix method for spheroids outside resonance regions this approach agrees to within mostly 0.3 dB (and often better) in the horizontal backscattering cross section σhh and the ratio of horizontal and vertical backscattering cross sections σhh/σvv, and 6% for the amplitude scattering matrix elements Re{S22-S11} and Im{S22} in the forward direction. For crystal sizes and wavelengths near resonances, where the scattering parameters are highly sensitive to the crystal shape, the differences are generally within 1.2 dB for σhh and σhh/σvv, 20% for Re{S22-S11} and 6% for Im{S22}. The Discrete Dipole Approximation (DDA) results for the same spheroids are generally closer than those of GMM to the T-matrix results. For hexagonal plates the differences between GMM and the DDA at a W-band wavelength (3.19 mm) are mostly within 0.6 dB for σhh, 1 dB for σhh/σvv, 11% for Re{S22-S11} and 12% for Im{S22}. For columns the differences are within 0.3 dB for σhh and σhh/σvv, 8% for Re{S22-S11} and 4% for Im{S22}. This method shows higher accuracy than an alternative method that artificially increases the thickness of ice plates to provide the same mass as the original ice crystal.

Kalman Filter Estimation of Spinning Spacecraft Attitude using Markley Variables

NASA Technical Reports Server (NTRS)

Sedlak, Joseph E.; Harman, Richard

2004-01-01

There are several different ways to represent spacecraft attitude and its time rate of change. For spinning or momentum-biased spacecraft, one particular representation has been put forward as a superior parameterization for numerical integration. Markley has demonstrated that these new variables have fewer rapidly varying elements for spinning spacecraft than other commonly used representations and provide advantages when integrating the equations of motion. The current work demonstrates how a Kalman filter can be devised to estimate the attitude using these new variables. The seven Markley variables are subject to one constraint condition, making the error covariance matrix singular. The filter design presented here explicitly accounts for this constraint by using a six-component error state in the filter update step. The reduced dimension error state is unconstrained and its covariance matrix is nonsingular.

Coherent state constructions of bases for some physically relevant group chains

NASA Technical Reports Server (NTRS)

Hecht, Karl T.

1995-01-01

Rotor coherent state constructions are given for the Wigner supermultiplet SU(4) contains SU(2)xSU(2) and for the special irreducible representations (N0) of the SO(5) contains SO(3) contains SO(2) group chain in exact parallel with the rotor coherent state construction for the SU(3) contains SO(3) contains SO(2) case given by Rowe, LeBlanc,, and Repka. Matrix elements of the coherent state realizations of the group generators are given in all cases by very simple expressions in terms of angular momentum Wigner coefficients involving intrinsic projection labels K. The K-matrix technique of vector coherent state theory is used to effectively elevate these K labels to the status of good quantum numbers. Analytic expressions are given for the (K K*)-matrices for many of the more important irreducible representations.

Magnetic Photon Splitting: The S-Matrix Formulation in the Landau Representation

NASA Technical Reports Server (NTRS)

Baring, Matthew G.

1999-01-01

Calculations of reaction rates for the third-order QED process of photon splitting gamma yields gamma.gamma in strong magnetic fields traditionally have employed either the effective Lagrangian method or variants of Schwinger's proper-time technique. Recently, Mentzel, Berg and Wunner [1] presented an alternative derivation via an S-matrix formulation in the Landau representation. Advantages of such a formulation include the ability to compute rates near pair resonances above pair threshold. This paper presents new developments of the Landau representation formalism as applied to photon splitting, providing significant, advances beyond the work of [1] by summing over the spin quantum numbers of the electron propagators, and analytically integrating over the component of momentum of the intermediate states that is parallel to field. The ensuing tractable expressions for the scattering amplitudes are satisfyingly compact, and of an appearance familiar to S-matrix theory applications. Such developments can facilitate numerical computations of splitting considerably both below and above pair threshold. Specializations to two regimes of interest are obtained, namely the limit of highly supercritical fields and the domain where photon energies are far inferior to that for the threshold of single-photon pair creation. In particular, for the first time the low-frequency amplitudes are simply expressed in terms of the Gamma function, its integral and its derivatives. In addition, the equivalence of the asymptotic forms in these two domains to extant results from effective Lagrangian/proper- time formulations is demonstrated.

Quantum Stochastic Trajectories: The Fokker-Planck-Bohm Equation Driven by the Reduced Density Matrix.

PubMed

Avanzini, Francesco; Moro, Giorgio J

2018-03-15

The quantum molecular trajectory is the deterministic trajectory, arising from the Bohm theory, that describes the instantaneous positions of the nuclei of molecules by assuring the agreement with the predictions of quantum mechanics. Therefore, it provides the suitable framework for representing the geometry and the motions of molecules without neglecting their quantum nature. However, the quantum molecular trajectory is extremely demanding from the computational point of view, and this strongly limits its applications. To overcome such a drawback, we derive a stochastic representation of the quantum molecular trajectory, through projection operator techniques, for the degrees of freedom of an open quantum system. The resulting Fokker-Planck operator is parametrically dependent upon the reduced density matrix of the open system. Because of the pilot role played by the reduced density matrix, this stochastic approach is able to represent accurately the main features of the open system motions both at equilibrium and out of equilibrium with the environment. To verify this procedure, the predictions of the stochastic and deterministic representation are compared for a model system of six interacting harmonic oscillators, where one oscillator is taken as the open quantum system of interest. The undeniable advantage of the stochastic approach is that of providing a simplified and self-contained representation of the dynamics of the open system coordinates. Furthermore, it can be employed to study the out of equilibrium dynamics and the relaxation of quantum molecular motions during photoinduced processes, like photoinduced conformational changes and proton transfers.

COMPADRE: an R and web resource for pathway activity analysis by component decompositions.

PubMed

Ramos-Rodriguez, Roberto-Rafael; Cuevas-Diaz-Duran, Raquel; Falciani, Francesco; Tamez-Peña, Jose-Gerardo; Trevino, Victor

2012-10-15

The analysis of biological networks has become essential to study functional genomic data. Compadre is a tool to estimate pathway/gene sets activity indexes using sub-matrix decompositions for biological networks analyses. The Compadre pipeline also includes one of the direct uses of activity indexes to detect altered gene sets. For this, the gene expression sub-matrix of a gene set is decomposed into components, which are used to test differences between groups of samples. This procedure is performed with and without differentially expressed genes to decrease false calls. During this process, Compadre also performs an over-representation test. Compadre already implements four decomposition methods [principal component analysis (PCA), Isomaps, independent component analysis (ICA) and non-negative matrix factorization (NMF)], six statistical tests (t- and f-test, SAM, Kruskal-Wallis, Welch and Brown-Forsythe), several gene sets (KEGG, BioCarta, Reactome, GO and MsigDB) and can be easily expanded. Our simulation results shown in Supplementary Information suggest that Compadre detects more pathways than over-representation tools like David, Babelomics and Webgestalt and less false positives than PLAGE. The output is composed of results from decomposition and over-representation analyses providing a more complete biological picture. Examples provided in Supplementary Information show the utility, versatility and simplicity of Compadre for analyses of biological networks. Compadre is freely available at http://bioinformatica.mty.itesm.mx:8080/compadre. The R package is also available at https://sourceforge.net/p/compadre.

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.

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.

Fast Kalman Filter for Random Walk Forecast model

NASA Astrophysics Data System (ADS)

Saibaba, A.; Kitanidis, P. K.

2013-12-01

Kalman filtering is a fundamental tool in statistical time series analysis to understand the dynamics of large systems for which limited, noisy observations are available. However, standard implementations of the Kalman filter are prohibitive because they require O(N^2) in memory and O(N^3) in computational cost, where N is the dimension of the state variable. In this work, we focus our attention on the Random walk forecast model which assumes the state transition matrix to be the identity matrix. This model is frequently adopted when the data is acquired at a timescale that is faster than the dynamics of the state variables and there is considerable uncertainty as to the physics governing the state evolution. We derive an efficient representation for the a priori and a posteriori estimate covariance matrices as a weighted sum of two contributions - the process noise covariance matrix and a low rank term which contains eigenvectors from a generalized eigenvalue problem, which combines information from the noise covariance matrix and the data. We describe an efficient algorithm to update the weights of the above terms and the computation of eigenmodes of the generalized eigenvalue problem (GEP). The resulting algorithm for the Kalman filter with Random walk forecast model scales as O(N) or O(N log N), both in memory and computational cost. This opens up the possibility of real-time adaptive experimental design and optimal control in systems of much larger dimension than was previously feasible. For a small number of measurements (~ 300 - 400), this procedure can be made numerically exact. However, as the number of measurements increase, for several choices of measurement operators and noise covariance matrices, the spectrum of the (GEP) decays rapidly and we are justified in only retaining the dominant eigenmodes. We discuss tradeoffs between accuracy and computational cost. The resulting algorithms are applied to an example application from ray-based travel time tomography.

Stereo-tomography in triangulated models

NASA Astrophysics Data System (ADS)

Yang, Kai; Shao, Wei-Dong; Xing, Feng-yuan; Xiong, Kai

2018-04-01

Stereo-tomography is a distinctive tomographic method. It is capable of estimating the scatterer position, the local dip of scatterer and the background velocity simultaneously. Building a geologically consistent velocity model is always appealing for applied and earthquake seismologists. Differing from the previous work to incorporate various regularization techniques into the cost function of stereo-tomography, we think extending stereo-tomography to the triangulated model will be the most straightforward way to achieve this goal. In this paper, we provided all the Fréchet derivatives of stereo-tomographic data components with respect to model components for slowness-squared triangulated model (or sloth model) in 2D Cartesian coordinate based on the ray perturbation theory for interfaces. A sloth model representation means a sparser model representation when compared with conventional B-spline model representation. A sparser model representation leads to a smaller scale of stereo-tomographic (Fréchet) matrix, a higher-accuracy solution when solving linear equations, a faster convergence rate and a lower requirement for quantity of data space. Moreover, a quantitative representation of interface strengthens the relationships among different model components, which makes the cross regularizations among these model components, such as node coordinates, scatterer coordinates and scattering angles, etc., more straightforward and easier to be implemented. The sensitivity analysis, the model resolution matrix analysis and a series of synthetic data examples demonstrate the correctness of the Fréchet derivatives, the applicability of the regularization terms and the robustness of the stereo-tomography in triangulated model. It provides a solid theoretical foundation for the real applications in the future.

Matrix Transfer Function Design for Flexible Structures: An Application

NASA Technical Reports Server (NTRS)

Brennan, T. J.; Compito, A. V.; Doran, A. L.; Gustafson, C. L.; Wong, C. L.

1985-01-01

The application of matrix transfer function design techniques to the problem of disturbance rejection on a flexible space structure is demonstrated. The design approach is based on parameterizing a class of stabilizing compensators for the plant and formulating the design specifications as a constrained minimization problem in terms of these parameters. The solution yields a matrix transfer function representation of the compensator. A state space realization of the compensator is constructed to investigate performance and stability on the nominal and perturbed models. The application is made to the ACOSSA (Active Control of Space Structures) optical structure.

A Few Integrable Dynamical Systems, Recurrence Operators, Expanding Integrable Models and Hamiltonian Structures by the r-Matrix Method

NASA Astrophysics Data System (ADS)

Zhang, Yu-Feng; Muhammad, Iqbal; Yue, Chao

2017-10-01

We extend two known dynamical systems obtained by Blaszak, et al. via choosing Casimir functions and utilizing Novikov-Lax equation so that a series of novel dynamical systems including generalized Burgers dynamical system, heat equation, and so on, are followed to be generated. Then we expand some differential operators presented in the paper to deduce two types of expanding dynamical models. By taking the generalized Burgers dynamical system as an example, we deform its expanding model to get a half-expanding system, whose recurrence operator is derived from Lax representation, and its Hamiltonian structure is also obtained by adopting a new way. Finally, we expand the generalized Burgers dynamical system to the (2+1)-dimensional case whose Hamiltonian structure is derived by Poisson tensor and gradient of the Casimir function. Besides, a kind of (2+1)-dimensional expanding dynamical model of the (2+1)-dimensional dynamical system is generated as well. Supported by the Fundamental Research Funds for the Central University under Grant No. 2017XKZD11

An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package

NASA Astrophysics Data System (ADS)

Oppe, Thomas C.; Joubert, Wayne D.; Kincaid, David R.

1989-05-01

The most recent research-oriented software package developed as part of the ITPACK Project is called "NSPCG" since it contains many nonsymmetric preconditioned conjugate gradient procedures. It is designed to solve large sparse systems of linear algebraic equations by a variety of different iterative methods. One of the main purposes for the development of the package is to provide a common modular structure for research on iterative methods for nonsymmetric matrices. Another purpose for the development of the package is to investigate the suitability of several iterative methods for vector computers. Since the vectorizability of an iterative method depends greatly on the matrix structure, NSPCG allows great flexibility in the operator representation. The coefficient matrix can be passed in one of several different matrix data storage schemes. These sparse data formats allow matrices with a wide range of structures from highly structured ones such as those with all nonzeros along a relatively small number of diagonals to completely unstructured sparse matrices. Alternatively, the package allows the user to call the accelerators directly with user-supplied routines for performing certain matrix operations. In this case, one can use the data format from an application program and not be required to copy the matrix into one of the package formats. This is particularly advantageous when memory space is limited. Some of the basic preconditioners that are available are point methods such as Jacobi, Incomplete LU Decomposition and Symmetric Successive Overrelaxation as well as block and multicolor preconditioners. The user can select from a large collection of accelerators such as Conjugate Gradient (CG), Chebyshev (SI, for semi-iterative), Generalized Minimal Residual (GMRES), Biconjugate Gradient Squared (BCGS) and many others. The package is modular so that almost any accelerator can be used with almost any preconditioner.

A unified development of several techniques for the representation of random vectors and data sets

NASA Technical Reports Server (NTRS)

Bundick, W. T.

1973-01-01

Linear vector space theory is used to develop a general representation of a set of data vectors or random vectors by linear combinations of orthonormal vectors such that the mean squared error of the representation is minimized. The orthonormal vectors are shown to be the eigenvectors of an operator. The general representation is applied to several specific problems involving the use of the Karhunen-Loeve expansion, principal component analysis, and empirical orthogonal functions; and the common properties of these representations are developed.

Jones's matrix representation of optical instruments. II - Fourier interferometers /spectrometers and spectropolarimeters/.

NASA Technical Reports Server (NTRS)

Fymat, A. L.

1971-01-01

Our method of matrix synthesis of optical components and instruments is applied to the derivation of Jones's matrices appropriate for Fourier interferometers (spectrometers and spectropolarimeters). These matrices are obtained for both the source beam and the detector beam. In the course of synthesis, Jones's matrices of the various reflectors (plane mirrors; retroreflectors: roofed mirror, trihedral and prism cube corner, cat's eye) used by these interferometers are also obtained.

Rank restriction for the variational calculation of two-electron reduced density matrices of many-electron atoms and molecules

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

Naftchi-Ardebili, Kasra; Hau, Nathania W.; Mazziotti, David A.

2011-11-15

Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary N-representability conditions, provides a polynomial-scaling approach to studying strongly correlated molecules without computing the many-electron wave function. Here we introduce a route to enhancing necessary conditions for N representability through rank restriction of the 2-RDM. Rather than adding computationally more expensive N-representability conditions, we directly enhance the accuracy of two-particle (2-positivity) conditions through rank restriction, which removes degrees of freedom in the 2-RDM that are not sufficiently constrained. We select the rank of the particle-hole 2-RDM by deriving the ranks associatedmore » with model wave functions, including both mean-field and antisymmetrized geminal power (AGP) wave functions. Because the 2-positivity conditions are exact for quantum systems with AGP ground states, the rank of the particle-hole 2-RDM from the AGP ansatz provides a minimum for its value in variational 2-RDM calculations of general quantum systems. To implement the rank-restricted conditions, we extend a first-order algorithm for large-scale semidefinite programming. The rank-restricted conditions significantly improve the accuracy of the energies; for example, the percentages of correlation energies recovered for HF, CO, and N{sub 2} improve from 115.2%, 121.7%, and 121.5% without rank restriction to 97.8%, 101.1%, and 100.0% with rank restriction. Similar results are found at both equilibrium and nonequilibrium geometries. While more accurate, the rank-restricted N-representability conditions are less expensive computationally than the full-rank conditions.« less

The trellis complexity of convolutional codes

NASA Technical Reports Server (NTRS)

Mceliece, R. J.; Lin, W.

1995-01-01

It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm. It has gradually become apparent that linear block codes also have a natural, though not in general a regular, 'minimal' trellis structure, which allows them to be decoded with a Viterbi-like algorithm. In both cases, the complexity of the Viterbi decoding algorithm can be accurately estimated by the number of trellis edges per encoded bit. It would, therefore, appear that we are in a good position to make a fair comparison of the Viterbi decoding complexity of block and convolutional codes. Unfortunately, however, this comparison is somewhat muddled by the fact that some convolutional codes, the punctured convolutional codes, are known to have trellis representations that are significantly less complex than the conventional trellis. In other words, the conventional trellis representation for a convolutional code may not be the minimal trellis representation. Thus, ironically, at present we seem to know more about the minimal trellis representation for block than for convolutional codes. In this article, we provide a remedy, by developing a theory of minimal trellises for convolutional codes. (A similar theory has recently been given by Sidorenko and Zyablov). This allows us to make a direct performance-complexity comparison for block and convolutional codes. A by-product of our work is an algorithm for choosing, from among all generator matrices for a given convolutional code, what we call a trellis-minimal generator matrix, from which the minimal trellis for the code can be directly constructed. Another by-product is that, in the new theory, punctured convolutional codes no longer appear as a special class, but simply as high-rate convolutional codes whose trellis complexity is unexpectedly small.

N-representability-driven reconstruction of the two-electron reduced-density matrix for a real-time time-dependent electronic structure method

NASA Astrophysics Data System (ADS)

Jeffcoat, David B.; DePrince, A. Eugene

2014-12-01

Propagating the equations of motion (EOM) for the one-electron reduced-density matrix (1-RDM) requires knowledge of the corresponding two-electron RDM (2-RDM). We show that the indeterminacy of this expression can be removed through a constrained optimization that resembles the variational optimization of the ground-state 2-RDM subject to a set of known N-representability conditions. Electronic excitation energies can then be obtained by propagating the EOM for the 1-RDM and following the dipole moment after the system interacts with an oscillating external electric field. For simple systems with well-separated excited states whose symmetry differs from that of the ground state, excitation energies obtained from this method are comparable to those obtained from full configuration interaction computations. Although the optimized 2-RDM satisfies necessary N-representability conditions, the procedure cannot guarantee a unique mapping from the 1-RDM to the 2-RDM. This deficiency is evident in the mean-field-quality description of transitions to states of the same symmetry as the ground state, as well as in the inability of the method to describe Rabi oscillations.

On determinant representations of scalar products and form factors in the SoV approach: the XXX case

NASA Astrophysics Data System (ADS)

Kitanine, N.; Maillet, J. M.; Niccoli, G.; Terras, V.

2016-03-01

In the present article we study the form factors of quantum integrable lattice models solvable by the separation of variables (SoVs) method. It was recently shown that these models admit universal determinant representations for the scalar products of the so-called separate states (a class which includes in particular all the eigenstates of the transfer matrix). These results permit to obtain simple expressions for the matrix elements of local operators (form factors). However, these representations have been obtained up to now only for the completely inhomogeneous versions of the lattice models considered. In this article we give a simple algebraic procedure to rewrite the scalar products (and hence the form factors) for the SoV related models as Izergin or Slavnov type determinants. This new form leads to simple expressions for the form factors in the homogeneous and thermodynamic limits. To make the presentation of our method clear, we have chosen to explain it first for the simple case of the XXX Heisenberg chain with anti-periodic boundary conditions. We would nevertheless like to stress that the approach presented in this article applies as well to a wide range of models solved in the SoV framework.

Comments on higher rank Wilson loops in N$$ \\mathcal{N} $$ = 2∗

DOE PAGES

Liu, James T.; Zayas, Leopoldo A. Pando; Zhou, Shan

2018-01-01

For N = 2∗ theory with U(N) gauge group we evaluate expectation values of Wilson loops in representations described by a rectangular Young tableau with n rows and k columns. The evaluation reduces to a two-matrix model and we explain, using a combination of numerical and analytical techniques, the general properties of the eigenvalue distributions in various regimes of parameters (N, λ, n, k) where λ is the ’t Hooft coupling. In the large N limit we present analytic results for the leading and sub-leading contributions. In the particular cases of only one row or one column we reproduce previouslymore » known results for the totally symmetry and totally antisymmetric representations. We also extensively discusss the N = 4 limit of the N = 2∗ theory. While establishing these connections we clarify aspects of various orders of limits and how to relax them; we also find it useful to explicitly address details of the genus expansion. As a result, for the totally symmetric Wilson loop we find new contributions that improve the comparison with the dual holographic computation at one loop order in the appropriate regime.« less

Multi-scale Material Appearance

NASA Astrophysics Data System (ADS)

Wu, Hongzhi

Modeling and rendering the appearance of materials is important for a diverse range of applications of computer graphics - from automobile design to movies and cultural heritage. The appearance of materials varies considerably at different scales, posing significant challenges due to the sheer complexity of the data, as well the need to maintain inter-scale consistency constraints. This thesis presents a series of studies around the modeling, rendering and editing of multi-scale material appearance. To efficiently render material appearance at multiple scales, we develop an object-space precomputed adaptive sampling method, which precomputes a hierarchy of view-independent points that preserve multi-level appearance. To support bi-scale material appearance design, we propose a novel reflectance filtering algorithm, which rapidly computes the large-scale appearance from small-scale details, by exploiting the low-rank structures of Bidirectional Visible Normal Distribution Functions and pre-rotated Bidirectional Reflectance Distribution Functions in the matrix formulation of the rendering algorithm. This approach can guide the physical realization of appearance, as well as the modeling of real-world materials using very sparse measurements. Finally, we present a bi-scale-inspired high-quality general representation for material appearance described by Bidirectional Texture Functions. Our representation is at once compact, easily editable, and amenable to efficient rendering.

Decoherence and Noise in Spin-based Solid State Quantum Computers. Approximation-Free Numerical Simulations

DTIC Science & Technology

2007-07-21

the spin coherent states P-representation", Conference on Quantum Computations and Many- Body Systems, February 2006, Key West, FL 9. B. N. Harmon...solid-state spin-based qubit systems was the focus of our project. Since decoherence is a complex many- body non-equilibrium process, and its...representation of the density matrix, see Sec. 3 below). This work prompted J. Taylor from the experimental group of C. Marcus and M. Lukin (funded by

A generalized graph-theoretical matrix of heterosystems and its application to the VMV procedure.

PubMed

Mozrzymas, Anna

2011-12-14

The extensions of generalized (molecular) graph-theoretical matrix and vector-matrix-vector procedure are considered. The elements of the generalized matrix are redefined in order to describe molecules containing heteroatoms and multiple bonds. The adjacency, distance, detour and reciprocal distance matrices of heterosystems, and corresponding vectors are derived from newly defined generalized graph matrix. The topological indices, which are most widely used in predicting physicochemical and biological properties/activities of various compounds, can be calculated from the new generalized vector-matrix-vector invariant. Copyright © 2011 Elsevier Ltd. All rights reserved.

A general diagrammatic algorithm for contraction and subsequent simplification of second-quantized expressions.

PubMed

Bochevarov, Arteum D; Sherrill, C David

2004-08-22

We present a general computer algorithm to contract an arbitrary number of second-quantized expressions and simplify the obtained analytical result. The functions that perform these operations are a part of the program Nostromo which facilitates the handling and analysis of the complicated mathematical formulas which are often encountered in modern quantum-chemical models. In contrast to existing codes of this kind, Nostromo is based solely on the Goldstone-diagrammatic representation of algebraic expressions in Fock space and has capabilities to work with operators as well as scalars. Each Goldstone diagram is internally represented by a line of text which is easy to interpret and transform. The calculation of matrix elements does not exploit Wick's theorem in a direct way, but uses diagrammatic techniques to produce only nonzero terms. The identification of equivalent expressions and their subsequent factorization in the final result is performed easily by analyzing the topological structure of the diagrammatic expressions. (c) 2004 American Institute of Physics

Free-time and fixed end-point optimal control theory in dissipative media: application to entanglement generation and maintenance.

PubMed

Mishima, K; Yamashita, K

2009-07-07

We develop monotonically convergent free-time and fixed end-point optimal control theory (OCT) in the density-matrix representation to deal with quantum systems showing dissipation. Our theory is more general and flexible for tailoring optimal laser pulses in order to control quantum dynamics with dissipation than the conventional fixed-time and fixed end-point OCT in that the optimal temporal duration of laser pulses can also be optimized exactly. To show the usefulness of our theory, it is applied to the generation and maintenance of the vibrational entanglement of carbon monoxide adsorbed on the copper (100) surface, CO/Cu(100). We demonstrate the numerical results and clarify how to combat vibrational decoherence as much as possible by the tailored shapes of the optimal laser pulses. It is expected that our theory will be general enough to be applied to a variety of dissipative quantum dynamics systems because the decoherence is one of the quantum phenomena sensitive to the temporal duration of the quantum dynamics.

A formulation of rotor-airframe coupling for design analysis of vibrations of helicopter airframes

NASA Technical Reports Server (NTRS)

Kvaternik, R. G.; Walton, W. C., Jr.

1982-01-01

A linear formulation of rotor airframe coupling intended for vibration analysis in airframe structural design is presented. The airframe is represented by a finite element analysis model; the rotor is represented by a general set of linear differential equations with periodic coefficients; and the connections between the rotor and airframe are specified through general linear equations of constraint. Coupling equations are applied to the rotor and airframe equations to produce one set of linear differential equations governing vibrations of the combined rotor airframe system. These equations are solved by the harmonic balance method for the system steady state vibrations. A feature of the solution process is the representation of the airframe in terms of forced responses calculated at the rotor harmonics of interest. A method based on matrix partitioning is worked out for quick recalculations of vibrations in design studies when only relatively few airframe members are varied. All relations are presented in forms suitable for direct computer implementation.

The general 2-D moments via integral transform method for acoustic radiation and scattering

NASA Astrophysics Data System (ADS)

Smith, Jerry R.; Mirotznik, Mark S.

2004-05-01

The moments via integral transform method (MITM) is a technique to analytically reduce the 2-D method of moments (MoM) impedance double integrals into single integrals. By using a special integral representation of the Green's function, the impedance integral can be analytically simplified to a single integral in terms of transformed shape and weight functions. The reduced expression requires fewer computations and reduces the fill times of the MoM impedance matrix. Furthermore, the resulting integral is analytic for nearly arbitrary shape and weight function sets. The MITM technique is developed for mixed boundary conditions and predictions with basic shape and weight function sets are presented. Comparisons of accuracy and speed between MITM and brute force are presented. [Work sponsored by ONR and NSWCCD ILIR Board.

Entropy of isolated quantum systems after a quench.

PubMed

Santos, Lea F; Polkovnikov, Anatoli; Rigol, Marcos

2011-07-22

A diagonal entropy, which depends only on the diagonal elements of the system's density matrix in the energy representation, has been recently introduced as the proper definition of thermodynamic entropy in out-of-equilibrium quantum systems. We study this quantity after an interaction quench in lattice hard-core bosons and spinless fermions, and after a local chemical potential quench in a system of hard-core bosons in a superlattice potential. The former systems have a chaotic regime, where the diagonal entropy becomes equivalent to the equilibrium microcanonical entropy, coinciding with the onset of thermalization. The latter system is integrable. We show that its diagonal entropy is additive and different from the entropy of a generalized Gibbs ensemble, which has been introduced to account for the effects of conserved quantities at integrability.

Kraus operator solutions to a fermionic master equation describing a thermal bath and their matrix representation

NASA Astrophysics Data System (ADS)

Xiang-Guo, Meng; Ji-Suo, Wang; Hong-Yi, Fan; Cheng-Wei, Xia

2016-04-01

We solve the fermionic master equation for a thermal bath to obtain its explicit Kraus operator solutions via the fermionic state approach. The normalization condition of the Kraus operators is proved. The matrix representation for these solutions is obtained, which is incongruous with the result in the book completed by Nielsen and Chuang [Quantum Computation and Quantum Information, Cambridge University Press, 2000]. As especial cases, we also present the Kraus operator solutions to master equations for describing the amplitude-decay model and the diffusion process at finite temperature. Project supported by the National Natural Science Foundation of China (Grant No. 11347026), the Natural Science Foundation of Shandong Province, China (Grant Nos. ZR2013AM012 and ZR2012AM004), and the Research Fund for the Doctoral Program and Scientific Research Project of Liaocheng University, Shandong Province, China.

The finite scaling for S = 1 XXZ chains with uniaxial single-ion-type anisotropy

NASA Astrophysics Data System (ADS)

Wang, Honglei; Xiong, Xingliang

2014-03-01

The scaling behavior of criticality for spin-1 XXZ chains with uniaxial single-ion-type anisotropy is investigated by employing the infinite matrix product state representation with the infinite time evolving block decimation method. At criticality, the accuracy of the ground state of a system is limited by the truncation dimension χ of the local Hilbert space. We present four evidences for the scaling of the entanglement entropy, the largest eigenvalue of the Schmidt decomposition, the correlation length, and the connection between the actual correlation length ξ and the energy. The result shows that the finite scalings are governed by the central charge of the critical system. Also, it demonstrates that the infinite time evolving block decimation algorithm by the infinite matrix product state representation can be a quite accurate method to simulate the critical properties at criticality.

Quasi-periodic Solutions of the Kaup-Kupershmidt Hierarchy

NASA Astrophysics Data System (ADS)

Geng, Xianguo; Wu, Lihua; He, Guoliang

2013-08-01

Based on solving the Lenard recursion equations and the zero-curvature equation, we derive the Kaup-Kupershmidt hierarchy associated with a 3×3 matrix spectral problem. Resorting to the characteristic polynomial of the Lax matrix for the Kaup-Kupershmidt hierarchy, we introduce a trigonal curve {K}_{m-1} and present the corresponding Baker-Akhiezer function and meromorphic function on it. The Abel map is introduced to straighten out the Kaup-Kupershmidt flows. With the aid of the properties of the Baker-Akhiezer function and the meromorphic function and their asymptotic expansions, we arrive at their explicit Riemann theta function representations. The Riemann-Jacobi inversion problem is achieved by comparing the asymptotic expansion of the Baker-Akhiezer function and its Riemann theta function representation, from which quasi-periodic solutions of the entire Kaup-Kupershmidt hierarchy are obtained in terms of the Riemann theta functions.

Superradiant effects on pulse propagation in resonant media. [atomic excitations/coherent radiation - operators (mathematics)/matrices (mathematics)

NASA Technical Reports Server (NTRS)

Lee, C.

1975-01-01

Adopting the so-called genealogical construction, the eigenstates of collective operators can be expressed corresponding to a specified mode for an N-atom system in terms of those for an (N-1)-atom system. Matrix element of a collective operator of an arbitrary mode is presented which can be written as the product of an m-dependent factor and an m-independent reduced matrix element (RME). A set of recursion formulas for the RME was obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups was then introduced. This gave a simple and systematic way of calculating the RME. Results show explicitly the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes and clears up the chief difficulty encounted in the problem of N two-level atoms, spread over large regions, interacting with a multimode radiation field.

[Medication advertisements in the illustrated press and the image of Brazilian nurses (1920-1925)].

PubMed

Porto, Fernando; Santos, Tânia Cristina Franco

2010-09-01

This is a historical and social study about the symbolic effect of medication advertisements presented by women using object representations used by nurses, featured on Fon-Fon Magazine, which describes the medication advertisements featured on Fon-Fon Magazine; analyzes the object representations of the nurse image present in the referred advertisements and discusses on the symbolic effect of those representations on the consumption of medication by the Brazilian society. The document sources were in print, iconographic and literature referring to the History of Brazil, the Press, Advertising and of Nursing. The medication advertisements, analyzed using an analysis matrix based on concepts of semiotics, were obtained from the Fon-Fon Magazine. The study showed that the analyzed advertisements invested in object representations used by nurses to gain reliability regarding the medication being announced.

The coprime quantum chain

NASA Astrophysics Data System (ADS)

Mussardo, G.; Giudici, G.; Viti, J.

2017-03-01

In this paper we introduce and study the coprime quantum chain, i.e. a strongly correlated quantum system defined in terms of the integer eigenvalues n i of the occupation number operators at each site of a chain of length M. The n i ’s take value in the interval [2,q] and may be regarded as S z eigenvalues in the spin representation j  =  (q  -  2)/2. The distinctive interaction of the model is based on the coprimality matrix \\boldsymbolΦ : for the ferromagnetic case, this matrix assigns lower energy to configurations where occupation numbers n i and n i+1 of neighbouring sites share a common divisor, while for the anti-ferromagnetic case it assigns a lower energy to configurations where n i and n i+1 are coprime. The coprime chain, both in the ferro and anti-ferromagnetic cases, may present an exponential number of ground states whose values can be exactly computed by means of graph theoretical tools. In the ferromagnetic case there are generally also frustration phenomena. A fine tuning of local operators may lift the exponential ground state degeneracy and, according to which operators are switched on, the system may be driven into different classes of universality, among which the Ising or Potts universality class. The paper also contains an appendix by Don Zagier on the exact eigenvalues and eigenvectors of the coprimality matrix in the limit q\\to ∞ .

Collaborative sparse priors for multi-view ATR

NASA Astrophysics Data System (ADS)

Li, Xuelu; Monga, Vishal

2018-04-01

Recent work has seen a surge of sparse representation based classification (SRC) methods applied to automatic target recognition problems. While traditional SRC approaches used l0 or l1 norm to quantify sparsity, spike and slab priors have established themselves as the gold standard for providing general tunable sparse structures on vectors. In this work, we employ collaborative spike and slab priors that can be applied to matrices to encourage sparsity for the problem of multi-view ATR. That is, target images captured from multiple views are expanded in terms of a training dictionary multiplied with a coefficient matrix. Ideally, for a test image set comprising of multiple views of a target, coefficients corresponding to its identifying class are expected to be active, while others should be zero, i.e. the coefficient matrix is naturally sparse. We develop a new approach to solve the optimization problem that estimates the sparse coefficient matrix jointly with the sparsity inducing parameters in the collaborative prior. ATR problems are investigated on the mid-wave infrared (MWIR) database made available by the US Army Night Vision and Electronic Sensors Directorate, which has a rich collection of views. Experimental results show that the proposed joint prior and coefficient estimation method (JPCEM) can: 1.) enable improved accuracy when multiple views vs. a single one are invoked, and 2.) outperform state of the art alternatives particularly when training imagery is limited.

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

Calixto, M., E-mail: calixto@ugr.es; Pérez-Romero, E.

We revise the unireps. of U(2, 2) describing conformal particles with continuous mass spectrum from a many-body perspective, which shows massive conformal particles as compounds of two correlated massless particles. The statistics of the compound (boson/fermion) depends on the helicity h of the massless components (integer/half-integer). Coherent states (CS) of particle-hole pairs (“excitons”) are also explicitly constructed as the exponential action of exciton (non-canonical) creation operators on the ground state of unpaired particles. These CS are labeled by points Z (2×2 complex matrices) on the Cartan-Bergman domain D₄=U(2,2)/U(2)², and constitute a generalized (matrix) version of Perelomov U(1, 1) coherent statesmore » labeled by points z on the unit disk D₁=U(1,1)/U(1)². First, we follow a geometric approach to the construction of CS, orthonormal basis, U(2, 2) generators and their matrix elements and symbols in the reproducing kernel Hilbert space H{sub λ}(D₄) of analytic square-integrable holomorphic functions on D₄, which carries a unitary irreducible representation of U(2, 2) with index λϵN (the conformal or scale dimension). Then we introduce a many-body representation of the previous construction through an oscillator realization of the U(2, 2) Lie algebra generators in terms of eight boson operators with constraints. This particle picture allows us for a physical interpretation of our abstract mathematical construction in the many-body jargon. In particular, the index λ is related to the number 2(λ – 2) of unpaired quanta and to the helicity h = (λ – 2)/2 of each massless particle forming the massive compound.« less

Reflection K-matrices for a nineteen vertex model with Uq [ osp (2 | 2) (2) ] symmetry

NASA Astrophysics Data System (ADS)

Vieira, R. S.; Lima Santos, A.

2017-09-01

We derive the solutions of the boundary Yang-Baxter equation associated with a supersymmetric nineteen vertex model constructed from the three-dimensional representation of the twisted quantum affine Lie superalgebra Uq [ osp (2 | 2) (2) ]. We found three classes of solutions. The type I solution is characterized by three boundary free-parameters and all elements of the corresponding reflection K-matrix are different from zero. In the type II solution, the reflection K-matrix is even (every element of the K-matrix with an odd parity is null) and it has only one boundary free-parameter. Finally, the type III solution corresponds to a diagonal reflection K-matrix with two boundary free-parameters.

Implementing the SU(2) Symmetry for the DMRG

NASA Astrophysics Data System (ADS)

Alvarez, Gonzalo

2010-03-01

In the Density Matrix Renormalization Group (DMRG) algorithm (White, 1992), Hamiltonian symmetries play an important role. Using symmetries, the matrix representation of the Hamiltonian can be blocked. Diagonalizing each matrix block is more efficient than diagonalizing the original matrix. This talk will explain how the DMRG++ codefootnotetextarXiv:0902.3185 or Computer Physics Communications 180 (2009) 1572-1578. has been extended to handle the non-local SU(2) symmetry in a model independent way. Improvements in CPU times compared to runs with only local symmetries will be discussed for typical tight-binding models of strongly correlated electronic systems. The computational bottleneck of the algorithm, and the use of shared memory parallelization will also be addressed. Finally, a roadmap for future work on DMRG++ will be presented.

Implementation of the SU(2) Hamiltonian Symmetry for the DMRG Algorithm

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

Alvarez, Gonzalo

2012-01-01

In the Density Matrix Renormalization Group (DMRG) algorithm (White, 1992, 1993) and Hamiltonian symmetries play an important role. Using symmetries, the matrix representation of the Hamiltonian can be blocked. Diagonalizing each matrix block is more efficient than diagonalizing the original matrix. This paper explains how the the DMRG++ code (Alvarez, 2009) has been extended to handle the non-local SU(2) symmetry in a model independent way. Improvements in CPU times compared to runs with only local symmetries are discussed for the one-orbital Hubbard model, and for a two-orbital Hubbard model for iron-based superconductors. The computational bottleneck of the algorithm and themore » use of shared memory parallelization are also addressed.« less

The exponential parameterization of the neutrino mixing matrix as an SU(3) group element and an account for new experimental data

NASA Astrophysics Data System (ADS)

Zhukovsky, K. V.

2017-09-01

The exponential form of the Pontecorvo-Maki-Nakagawa-Sakata mixing matrix for neutrinos is considered in the context of the fundamental representation of the SU(3) group. The logarithm of the mixing matrix is obtained. Based on the most recent experimental data on neutrino mixing, the exact values of the entries of the exponential matrix are calculated. The exact values for its real and imaginary parts are determined, respectively, in charge of the mixing without CP violation and of the pure CP violation effect. The hypothesis of complementarity for quarks and neutrinos is confirmed. The factorization of the exponential mixing matrix, which allows the separation of the mixing and of the CP violation itself in the form of the product of rotations around the real and imaginary axes, is demonstrated.

Spectral Approaches to Learning Predictive Representations

DTIC Science & Technology

2012-09-01

conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed...to the mean to form an initial prediction of x̂(ht). Similarly, Equation 2.3b can be interpreted as using the dynamics matrix A and error covarianceQ...in the sense of Lyapunov if its dynamics matrix A is. Thus, the Lyapunov criterion can be interpreted as holding for an LDS if, for a given covariance

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.

Fock space, symbolic algebra, and analytical solutions for small stochastic systems.

PubMed

Santos, Fernando A N; Gadêlha, Hermes; Gaffney, Eamonn A

2015-12-01

Randomness is ubiquitous in nature. From single-molecule biochemical reactions to macroscale biological systems, stochasticity permeates individual interactions and often regulates emergent properties of the system. While such systems are regularly studied from a modeling viewpoint using stochastic simulation algorithms, numerous potential analytical tools can be inherited from statistical and quantum physics, replacing randomness due to quantum fluctuations with low-copy-number stochasticity. Nevertheless, classical studies remained limited to the abstract level, demonstrating a more general applicability and equivalence between systems in physics and biology rather than exploiting the physics tools to study biological systems. Here the Fock space representation, used in quantum mechanics, is combined with the symbolic algebra of creation and annihilation operators to consider explicit solutions for the chemical master equations describing small, well-mixed, biochemical, or biological systems. This is illustrated with an exact solution for a Michaelis-Menten single enzyme interacting with limited substrate, including a consideration of very short time scales, which emphasizes when stiffness is present even for small copy numbers. Furthermore, we present a general matrix representation for Michaelis-Menten kinetics with an arbitrary number of enzymes and substrates that, following diagonalization, leads to the solution of this ubiquitous, nonlinear enzyme kinetics problem. For this, a flexible symbolic maple code is provided, demonstrating the prospective advantages of this framework compared to stochastic simulation algorithms. This further highlights the possibilities for analytically based studies of stochastic systems in biology and chemistry using tools from theoretical quantum physics.

Abstract memory representations in the ventromedial prefrontal cortex and hippocampus support concept generalization.

PubMed

Bowman, Caitlin R; Zeithamova, Dagmar

2018-02-07

Memory function involves both the ability to remember details of individual experiences and the ability to link information across events to create new knowledge. Prior research has identified the ventromedial prefrontal cortex (VMPFC) and the hippocampus as important for integrating across events in service of generalization in episodic memory. The degree to which these memory integration mechanisms contribute to other forms of generalization, such as concept learning, is unclear. The present study used a concept-learning task in humans (both sexes) coupled with model-based fMRI to test whether VMPFC and hippocampus contribute to concept generalization, and whether they do so by maintaining specific category exemplars or abstract category representations. Two formal categorization models were fit to individual subject data: a prototype model that posits abstract category representations and an exemplar model that posits category representations based on individual category members. Latent variables from each of these models were entered into neuroimaging analyses to determine whether VMPFC and the hippocampus track prototype or exemplar information during concept generalization. Behavioral model fits indicated that almost three quarters of the subjects relied on prototype information when making judgments about new category members. Paralleling prototype dominance in behavior, correlates of the prototype model were identified in VMPFC and the anterior hippocampus with no significant exemplar correlates. These results indicate that the VMPFC and portions of the hippocampus play a broad role in memory generalization and that they do so by representing abstract information integrated from multiple events. SIGNIFICANCE STATEMENT Whether people represent concepts as a set of individual category members or by deriving generalized concept representations abstracted across exemplars has been debated. In episodic memory, generalized memory representations have been shown to arise through integration across events supported by the ventromedial prefrontal cortex (VMPFC) and hippocampus. The current study combined formal categorization models with fMRI data analysis to show that the VMPFC and anterior hippocampus represent abstract prototype information during concept generalization, contributing novel evidence of generalized concept representations in the brain. Results indicate that VMPFC-hippocampal memory integration mechanisms contribute to knowledge generalization across multiple cognitive domains, with the degree of abstraction of memory representations varying along the long axis of the hippocampus. Copyright © 2018 the authors.

An efficient matrix product operator representation of the quantum chemical Hamiltonian

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

Keller, Sebastian, E-mail: sebastian.keller@phys.chem.ethz.ch; Reiher, Markus, E-mail: markus.reiher@phys.chem.ethz.ch; Dolfi, Michele, E-mail: dolfim@phys.ethz.ch

We describe how to efficiently construct the quantum chemical Hamiltonian operator in matrix product form. We present its implementation as a density matrix renormalization group (DMRG) algorithm for quantum chemical applications. Existing implementations of DMRG for quantum chemistry are based on the traditional formulation of the method, which was developed from the point of view of Hilbert space decimation and attained higher performance compared to straightforward implementations of matrix product based DMRG. The latter variationally optimizes a class of ansatz states known as matrix product states, where operators are correspondingly represented as matrix product operators (MPOs). The MPO construction schememore » presented here eliminates the previous performance disadvantages while retaining the additional flexibility provided by a matrix product approach, for example, the specification of expectation values becomes an input parameter. In this way, MPOs for different symmetries — abelian and non-abelian — and different relativistic and non-relativistic models may be solved by an otherwise unmodified program.« less

Is Hidden Crossings Theory a New MOCC Method?

NASA Astrophysics Data System (ADS)

Krstić, Predrag; Schultz, David

1998-05-01

We find un unitary transformation of the scaled adiabatic Hamiltonian of a two-center, one-electron collision system which yields a new representation for the matrix elements of nonadiabatic radial coupling, valid for low-to-intermediate collision velocities. These are given in analytic form once the topology of the branch points of the adiabatic Hamiltonian in the plane of complex internuclear distance R is known. The matrix elements do not depend on origin of electronic coordinates and properly vanish at large internuclear distances. The role of the rotational couplings in the new representation is also discussed. The aproach is appropriately extended and compared with the PSS treatment in the fully quantal description of the collision. We apply new radial and rotational matrix elements in the standard Molecular Orbital Close Coupling (MOCC) approach to describe excitation and ionization in collisions of antiprotons with He^+ and of alpha-particles with hydrogen(P.S. Krstić et al, J. Phys. B. 31, in press (1998).). The results are compared with those obtained from the standard MOCC method and from the direct solutions of the Schrödinger equation on lattice (LTDSE)(D.R. Schultz et al, Phys. Rev. A 56, 3710 (1997)).

Bodily illusions in health and disease: physiological and clinical perspectives and the concept of a cortical 'body matrix'.

PubMed

Moseley, G Lorimer; Gallace, Alberto; Spence, Charles

2012-01-01

Illusions that induce a feeling of ownership over an artificial body or body-part have been used to explore the complex relationships that exist between the brain's representation of the body and the integrity of the body itself. Here we discuss recent findings in both healthy volunteers and clinical populations that highlight the robust relationship that exists between a person's sense of ownership over a body part, cortical processing of tactile input from that body part, and its physiological regulation. We propose that a network of multisensory and homeostatic brain areas may be responsible for maintaining a 'body-matrix'. That is, a dynamic neural representation that not only extends beyond the body surface to integrate both somatotopic and peripersonal sensory data, but also integrates body-centred spatial sensory data. The existence of such a 'body-matrix' allows our brain to adapt to even profound anatomical and configurational changes to our body. It also plays an important role in maintaining homeostatic control over the body. Its alteration can be seen to have both deleterious and beneficial effects in various clinical populations. Copyright © 2011 Elsevier Ltd. All rights reserved.

A Family of Finite-Dimensional Representations of Generalized Double Affine Hecke Algebras of Higher Rank

NASA Astrophysics Data System (ADS)

Fu, Yuchen; Shelley-Abrahamson, Seth

2016-06-01

We give explicit constructions of some finite-dimensional representations of generalized double affine Hecke algebras (GDAHA) of higher rank using R-matrices for U_q(sl_N). Our construction is motivated by an analogous construction of Silvia Montarani in the rational case. Using the Drinfeld-Kohno theorem for Knizhnik-Zamolodchikov differential equations, we prove that the explicit representations we produce correspond to Montarani's representations under a monodromy functor introduced by Etingof, Gan, and Oblomkov.

The principles of the Brazilian Unified Health System, studied based on similitude analysis

PubMed Central

de Pontes, Ana Paula Munhen; de Oliveira, Denize Cristina; Gomes, Antonio Marcos Tosoli

2014-01-01

Objectives to analyze and compare the incorporation of the ethical-doctrinal and organizational principles into the social representations of the Unified Health System (SUS) among health professionals. Method a study grounded in Social Representations Theory, undertaken with 125 subjects, in eight health institutions in Rio de Janeiro. The free word association technique was applied to the induction term "SUS", the words evoked being analyzed using the techniques of the Vergès matrix and similitude analysis. Results it was identified that the professionals' social representations vary depending on their level of education, and that those with higher education represent a subgroup responsible for the process of representational change identified. This result was confirmed through similitude analysis. Conclusion a process of representational change is ongoing, in which it was ascertained that the professionals incorporated the principles of the SUS into their symbolic constructions. The similitude analysis was shown to be a fruitful technique for research in nursing. PMID:24553704

Flux-Based Finite Volume representations for general thermal problems

NASA Technical Reports Server (NTRS)

Mohan, Ram V.; Tamma, Kumar K.

1993-01-01

Flux-Based Finite Volume (FV) element representations for general thermal problems are given in conjunction with a generalized trapezoidal gamma-T family of algorithms, formulated following the spirit of what we term as the Lax-Wendroff based FV formulations. The new flux-based representations introduced offer an improved physical interpretation of the problem along with computationally convenient and attractive features. The space and time discretization emanate from a conservation form of the governing equation for thermal problems, and in conjunction with the flux-based element representations give rise to a physically improved and locally conservative numerical formulations. The present representations seek to involve improved locally conservative properties, improved physical representations and computational features; these are based on a 2D, bilinear FV element and can be extended for other cases. Time discretization based on a gamma-T family of algorithms in the spirit of a Lax-Wendroff based FV formulations are employed. Numerical examples involving linear/nonlinear steady and transient situations are shown to demonstrate the applicability of the present representations for thermal analysis situations.

Gyro-gauge-independent formulation of the guiding-center reduction to arbitrary order in the Larmor radius

NASA Astrophysics Data System (ADS)

de Guillebon, L.; Vittot, M.

2013-10-01

Guiding-center reduction is studied using gyro-gauge-independent coordinates. The Lagrangian 1-form of charged particle dynamics is Lie transformed without introducing a gyro-gauge, but using directly the unit vector of the component of the velocity perpendicular to the magnetic field as the coordinate corresponding to Larmor gyration. The reduction is shown to provide a maximal reduction for the Lagrangian and to work for all orders in the Larmor radius, following exactly the same procedure as when working with the standard gauge-dependent coordinate. The gauge-dependence is removed from the coordinate system by using a constrained variable for the gyro-angle. The closed 1-form dθ is replaced by a more general non-closed 1-form, which is equal to dθ in the gauge-dependent case. The gauge vector is replaced by a more general connection in the definition of the gradient, which behaves as a covariant derivative, in perfect agreement with the circle-bundle picture. This explains some results of previous works, whose gauge-independent expressions did not correspond to gauge fixing but did indeed correspond to connection fixing. In addition, some general results are obtained for the guiding-center reduction. The expansion is polynomial in the cotangent of the pitch-angle as an effect of the structure of the Lagrangian, preserved by Lie derivatives. The induction for the reduction is shown to rely on the inversion of a matrix, which is the same for all orders higher than three. It is inverted and explicit induction relations are obtained to go to an arbitrary order in the perturbation expansion. The Hamiltonian and symplectic representations of the guiding-center reduction are recovered, but conditions for the symplectic representation at each order are emphasized.

Adinkras from ordered quartets of BC4 Coxeter group elements and regarding 1,358,954,496 matrix elements of the Gadget

NASA Astrophysics Data System (ADS)

Gates, S. James; Guyton, Forrest; Harmalkar, Siddhartha; Kessler, David S.; Korotkikh, Vadim; Meszaros, Victor A.

2017-06-01

We examine values of the Adinkra Holoraumy-induced Gadget representation space metric over all possible four-color, four-open node, and four-closed node adinkras. Of the 1,358,954,496 gadget matrix elements, only 226,492,416 are non-vanishing and take on one of three values: -1/3, 1/3, or 1 and thus a subspace isomorphic to a description of a body-centered tetrahedral molecule emerges.

Density-matrix-based algorithm for solving eigenvalue problems

NASA Astrophysics Data System (ADS)

Polizzi, Eric

2009-03-01

A fast and stable numerical algorithm for solving the symmetric eigenvalue problem is presented. The technique deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other Davidson-Jacobi techniques and takes its inspiration from the contour integration and density-matrix representation in quantum mechanics. It will be shown that this algorithm—named FEAST—exhibits high efficiency, robustness, accuracy, and scalability on parallel architectures. Examples from electronic structure calculations of carbon nanotubes are presented, and numerical performances and capabilities are discussed.

Neutrino Mixing and the Double Tetrahedral Group

NASA Astrophysics Data System (ADS)

Bentov, Yoni; Zee, A.

2013-11-01

In the spirit of a previous study of the tetrahedral group T ≃A4, we discuss a minimalist scheme to derive the neutrino mixing matrix using the double tetrahedral group T‧, the double cover of T. The new features are three distinct two-dimensional representations and complex Clebsch-Gordan coefficients, which can result in a geometric source of CP violation in the neutrino mass matrix. In an appendix, we derive explicitly the relevant group theory for the tetrahedral group T and its double cover T‧.

Modelling Near-Surface Metallic Clutter Without the Excruciating Pain

NASA Astrophysics Data System (ADS)

Downs, C. M.; Weiss, C. J.; Bach, J.; Williams, J. T.

2016-12-01

An ongoing problem in modeling electromagnetic (EM) interactions with the near-surface and related anthropogenic metal clutter is the large difference in length scale between the clutter dimensions and their resulting EM response. For example, observational evidence shows that cables, pipes and rail lines can have a strong influence far from where they are located, even in situations where these artefacts are volumetrically insignificant over the scale of the model. This poses a significant modeling problem for understanding geohazards in urban environments, for example, because of the very fine numerical discretization required for accurate representation of an artefact embedded in a larger computational domain. We adopt a sub-grid approximation and impose a boundary condition along grid edges to capture the vanishing fields of a perfect conductor. We work in a Cartesian system where the EM fields are solved via finite volumes in the frequency domain in terms of the Lorenz gauged magnetic vector (A) and electric scalar (Phi) potentials. The electric fied is given simply by A-grad(Phi), and set identically to zero along edges of the mesh that coincide with the center of long, slender metallic conductors. A simple extension to bulky artefacts like blocks or slabs involves endowing all such edges in their interior with the same "internal" boundary condition. In essence, we apply the "perfect electric conductor" boundary condition to select edges interior to the modeling domain. We note a few minor numerical consequences of this approach, namely: the zero-E field internal boundary condition destroys the symmetry of the finite volume coefficient matrix; and, the accuracy of the representation of the conducting artefact is restricted by the relatively coarse discretization mesh. The former is overcome with the use of preconditioned bi-conjugate gradient methods instead of the quasi-minimal-residual method. Both are matrix-free iterative solvers - thus avoiding unnecessary storage- and both exhibit generally good convergence for well-posed problems. The latter is more difficult to overcome without either modifying the mesh (potentially degrading the condition number of the coefficient matrix) or with novel mesh sub-gridding. Initial results show qualitative agreement with the expected physics.

Color Sparse Representations for Image Processing: Review, Models, and Prospects.

PubMed

Barthélemy, Quentin; Larue, Anthony; Mars, Jérôme I

2015-11-01

Sparse representations have been extended to deal with color images composed of three channels. A review of dictionary-learning-based sparse representations for color images is made here, detailing the differences between the models, and comparing their results on the real and simulated data. These models are considered in a unifying framework that is based on the degrees of freedom of the linear filtering/transformation of the color channels. Moreover, this allows it to be shown that the scalar quaternionic linear model is equivalent to constrained matrix-based color filtering, which highlights the filtering implicitly applied through this model. Based on this reformulation, the new color filtering model is introduced, using unconstrained filters. In this model, spatial morphologies of color images are encoded by atoms, and colors are encoded by color filters. Color variability is no longer captured in increasing the dictionary size, but with color filters, this gives an efficient color representation.

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

PubMed Central

Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements. PMID:29209364

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.

PubMed

Hussain, Abid; Muhammad, Yousaf Shad; Nauman Sajid, M; Hussain, Ijaz; Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.

Boundary Quantum Knizhnik-Zamolodchikov Equations and Bethe Vectors

NASA Astrophysics Data System (ADS)

Reshetikhin, Nicolai; Stokman, Jasper; Vlaar, Bart

2015-06-01

Solutions to boundary quantum Knizhnik-Zamolodchikov equations are constructed as bilateral sums involving "off-shell" Bethe vectors in case the reflection matrix is diagonal and only the 2-dimensional representation of is involved. We also consider their rational and classical degenerations.

Current algebras, measures quasi-invariant under diffeomorphism groups, and infinite quantum systems with accumulation points

NASA Astrophysics Data System (ADS)

Sakuraba, Takao

The approach to quantum physics via current algebra and unitary representations of the diffeomorphism group is established. This thesis studies possible infinite Bose gas systems using this approach. Systems of locally finite configurations and systems of configurations with accumulation points are considered, with the main emphasis on the latter. In Chapter 2, canonical quantization, quantization via current algebra and unitary representations of the diffeomorphism group are reviewed. In Chapter 3, a new definition of the space of configurations is proposed and an axiom for general configuration spaces is abstracted. Various subsets of the configuration space, including those specifying the number of points in a Borel set and those specifying the number of accumulation points in a Borel set are proved to be measurable using this axiom. In Chapter 4, known results on the space of locally finite configurations and Poisson measure are reviewed in the light of the approach developed in Chapter 3, including the approach to current algebra in the Poisson space by Albeverio, Kondratiev, and Rockner. Goldin and Moschella considered unitary representations of the group of diffeomorphisms of the line based on self-similar random processes, which may describe infinite quantum gas systems with clusters. In Chapter 5, the Goldin-Moschella theory is developed further. Their construction of measures quasi-invariant under diffeomorphisms is reviewed, and a rigorous proof of their conjectures is given. It is proved that their measures with distinct correlation parameters are mutually singular. A quasi-invariant measure constructed by Ismagilov on the space of configurations with accumulation points on the circle is proved to be singular with respect to the Goldin-Moschella measures. Finally a generalization of the Goldin-Moschella measures to the higher-dimensional case is studied, where the notion of covariance matrix and the notion of condition number play important roles. A rigorous construction of measures quasi-invariant under the group of diffeomorphisms of d-dimensional space stabilizing a point is given.

Yang-Baxter maps, discrete integrable equations and quantum groups

NASA Astrophysics Data System (ADS)

Bazhanov, Vladimir V.; Sergeev, Sergey M.

2018-01-01

For every quantized Lie algebra there exists a map from the tensor square of the algebra to itself, which by construction satisfies the set-theoretic Yang-Baxter equation. This map allows one to define an integrable discrete quantum evolution system on quadrilateral lattices, where local degrees of freedom (dynamical variables) take values in a tensor power of the quantized Lie algebra. The corresponding equations of motion admit the zero curvature representation. The commuting Integrals of Motion are defined in the standard way via the Quantum Inverse Problem Method, utilizing Baxter's famous commuting transfer matrix approach. All elements of the above construction have a meaningful quasi-classical limit. As a result one obtains an integrable discrete Hamiltonian evolution system, where the local equation of motion are determined by a classical Yang-Baxter map and the action functional is determined by the quasi-classical asymptotics of the universal R-matrix of the underlying quantum algebra. In this paper we present detailed considerations of the above scheme on the example of the algebra Uq (sl (2)) leading to discrete Liouville equations, however the approach is rather general and can be applied to any quantized Lie algebra.

Discriminative Dictionary Learning With Two-Level Low Rank and Group Sparse Decomposition for Image Classification.

PubMed

Wen, Zaidao; Hou, Zaidao; Jiao, Licheng

2017-11-01

Discriminative dictionary learning (DDL) framework has been widely used in image classification which aims to learn some class-specific feature vectors as well as a representative dictionary according to a set of labeled training samples. However, interclass similarities and intraclass variances among input samples and learned features will generally weaken the representability of dictionary and the discrimination of feature vectors so as to degrade the classification performance. Therefore, how to explicitly represent them becomes an important issue. In this paper, we present a novel DDL framework with two-level low rank and group sparse decomposition model. In the first level, we learn a class-shared and several class-specific dictionaries, where a low rank and a group sparse regularization are, respectively, imposed on the corresponding feature matrices. In the second level, the class-specific feature matrix will be further decomposed into a low rank and a sparse matrix so that intraclass variances can be separated to concentrate the corresponding feature vectors. Extensive experimental results demonstrate the effectiveness of our model. Compared with the other state-of-the-arts on several popular image databases, our model can achieve a competitive or better performance in terms of the classification accuracy.

Unique semantic space in the brain of each beholder predicts perceived similarity

PubMed Central

Charest, Ian; Kievit, Rogier A.; Schmitz, Taylor W.; Deca, Diana; Kriegeskorte, Nikolaus

2014-01-01

The unique way in which each of us perceives the world must arise from our brain representations. If brain imaging could reveal an individual’s unique mental representation, it could help us understand the biological substrate of our individual experiential worlds in mental health and disease. However, imaging studies of object vision have focused on commonalities between individuals rather than individual differences and on category averages rather than representations of particular objects. Here we investigate the individually unique component of brain representations of particular objects with functional MRI (fMRI). Subjects were presented with unfamiliar and personally meaningful object images while we measured their brain activity on two separate days. We characterized the representational geometry by the dissimilarity matrix of activity patterns elicited by particular object images. The representational geometry remained stable across scanning days and was unique in each individual in early visual cortex and human inferior temporal cortex (hIT). The hIT representation predicted perceived similarity as reflected in dissimilarity judgments. Importantly, hIT predicted the individually unique component of the judgments when the objects were personally meaningful. Our results suggest that hIT brain representational idiosyncrasies accessible to fMRI are expressed in an individual's perceptual judgments. The unique way each of us perceives the world thus might reflect the individually unique representation in high-level visual areas. PMID:25246586

Knowledge of damage identification about tensegrities via flexibility disassembly

NASA Astrophysics Data System (ADS)

Jiang, Ge; Feng, Xiaodong; Du, Shigui

2017-12-01

Tensegrity structures composing of continuous cables and discrete struts are under tension and compression, respectively. In order to determine the damage extents of tensegrity structures, a new method for tensegrity structural damage identification is presented based on flexibility disassembly. To decompose a tensegrity structural flexibility matrix into the matrix represention of the connectivity between degress-of-freedoms and the diagonal matrix comprising of magnitude informations. Step 1: Calculate perturbation flexibility; Step 2: Compute the flexibility connectivity matrix and perturbation flexibility parameters; Step 3: Calculate the perturbation stiffness parameters. The efficiency of the proposed method is demonstrated by a numeical example comprising of 12 cables and 4 struts with pretensioned. Accurate identification of local damage depends on the availability of good measured data, an accurate and reasonable algorithm.

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

Stochastic determination of matrix determinants

NASA Astrophysics Data System (ADS)

Dorn, Sebastian; Enßlin, Torsten A.

2015-07-01

Matrix determinants play an important role in data analysis, in particular when Gaussian processes are involved. Due to currently exploding data volumes, linear operations—matrices—acting on the data are often not accessible directly but are only represented indirectly in form of a computer routine. Such a routine implements the transformation a data vector undergoes under matrix multiplication. While efficient probing routines to estimate a matrix's diagonal or trace, based solely on such computationally affordable matrix-vector multiplications, are well known and frequently used in signal inference, there is no stochastic estimate for its determinant. We introduce a probing method for the logarithm of a determinant of a linear operator. Our method rests upon a reformulation of the log-determinant by an integral representation and the transformation of the involved terms into stochastic expressions. This stochastic determinant determination enables large-size applications in Bayesian inference, in particular evidence calculations, model comparison, and posterior determination.

Critique of Macro Flow/Damage Surface Representations for Metal Matrix Composites Using Micromechanics

NASA Technical Reports Server (NTRS)

Lissenden, Cliff J.; Arnold, Steven M.

1996-01-01

Guidance for the formulation of robust, multiaxial, constitutive models for advanced materials is provided by addressing theoretical and experimental issues using micromechanics. The multiaxial response of metal matrix composites, depicted in terms of macro flow/damage surfaces, is predicted at room and elevated temperatures using an analytical micromechanical model that includes viscoplastic matrix response as well as fiber-matrix debonding. Macro flow/damage surfaces (i.e., debonding envelopes, matrix threshold surfaces, macro 'yield' surfaces, surfaces of constant inelastic strain rate, and surfaces of constant dissipation rate) are determined for silicon carbide/titanium in three stress spaces. Residual stresses are shown to offset the centers of the flow/damage surfaces from the origin and their shape is significantly altered by debonding. The results indicate which type of flow/damage surfaces should be characterized and what loadings applied to provide the most meaningful experimental data for guiding theoretical model development and verification.

Stochastic determination of matrix determinants.

PubMed

Dorn, Sebastian; Ensslin, Torsten A

2015-07-01

Matrix determinants play an important role in data analysis, in particular when Gaussian processes are involved. Due to currently exploding data volumes, linear operations-matrices-acting on the data are often not accessible directly but are only represented indirectly in form of a computer routine. Such a routine implements the transformation a data vector undergoes under matrix multiplication. While efficient probing routines to estimate a matrix's diagonal or trace, based solely on such computationally affordable matrix-vector multiplications, are well known and frequently used in signal inference, there is no stochastic estimate for its determinant. We introduce a probing method for the logarithm of a determinant of a linear operator. Our method rests upon a reformulation of the log-determinant by an integral representation and the transformation of the involved terms into stochastic expressions. This stochastic determinant determination enables large-size applications in Bayesian inference, in particular evidence calculations, model comparison, and posterior determination.

Domain-Generality versus Domain-Specificity: The Life and Impending Death of a False Dichotomy.

ERIC Educational Resources Information Center

Sternberg, Robert J.

1989-01-01

Argues that the question of whether information representation and processing are domain-general or domain-specific is neither meaningful nor answerable. Researchers should be asking questions about ways in which representation and processing are domain-general and ways in which they are domain-specific. (RH)

The temporal evolution of conceptual object representations revealed through models of behavior, semantics and deep neural networks.

PubMed

Bankson, B B; Hebart, M N; Groen, I I A; Baker, C I

2018-05-17

Visual object representations are commonly thought to emerge rapidly, yet it has remained unclear to what extent early brain responses reflect purely low-level visual features of these objects and how strongly those features contribute to later categorical or conceptual representations. Here, we aimed to estimate a lower temporal bound for the emergence of conceptual representations by defining two criteria that characterize such representations: 1) conceptual object representations should generalize across different exemplars of the same object, and 2) these representations should reflect high-level behavioral judgments. To test these criteria, we compared magnetoencephalography (MEG) recordings between two groups of participants (n = 16 per group) exposed to different exemplar images of the same object concepts. Further, we disentangled low-level from high-level MEG responses by estimating the unique and shared contribution of models of behavioral judgments, semantics, and different layers of deep neural networks of visual object processing. We find that 1) both generalization across exemplars as well as generalization of object-related signals across time increase after 150 ms, peaking around 230 ms; 2) representations specific to behavioral judgments emerged rapidly, peaking around 160 ms. Collectively, these results suggest a lower bound for the emergence of conceptual object representations around 150 ms following stimulus onset. Copyright © 2018 Elsevier Inc. All rights reserved.

Why Representations?

ERIC Educational Resources Information Center

Schultz, James E.; Waters, Michael S.

2000-01-01

Discusses representations in the context of solving a system of linear equations. Views representations (concrete, tables, graphs, algebraic, matrices) from perspectives of understanding, technology, generalization, exact versus approximate solution, and learning style. (KHR)

Features of Representations in General Chemistry Textbooks: A Peek through the Lens of the Cognitive Load Theory

ERIC Educational Resources Information Center

Nyachwaya, James M.; Gillaspie, Merry

2016-01-01

The goals of this study were (1) determine the prevalence of various features of representations in five general chemistry textbooks used in the United States, and (2) use cognitive load theory to draw implications of the various features of analyzed representations. We adapted the Graphical Analysis Protocol (GAP) (Slough et al., 2010) to look at…

Analytical representation of dynamical quantities in G W from a matrix resolvent

NASA Astrophysics Data System (ADS)

Gesenhues, J.; Nabok, D.; Rohlfing, M.; Draxl, C.

2017-12-01

The power of the G W formalism is, to a large extent, based on the explicit treatment of dynamical correlations in the self-energy. This dynamics is taken into account by calculating the energy dependence of the screened Coulomb interaction W , followed by a convolution with the Green's function G . In order to obtain the energy dependence of W the prevalent methods are plasmon-pole models and numerical integration techniques. In this paper, we discuss an alternative approach, in which the energy-dependent screening is calculated by determining the resolvent, which is set up from a matrix representation of the dielectric function. On the one hand, this refrains from a numerical energy convolution and allows one to actually write down the energy dependence of W explicitly (like in the plasmon-pole models). On the other hand, the method is at least as accurate as the numerical approaches due to its multipole nature. We discuss the theoretical setup in some detail, give insight into the computational aspects, and present results for Si, C, GaAs, and LiF. Finally, we argue that the analytic representability is not only useful for educational purposes but may also be of avail for the development of theory that goes beyond G W .

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

Exact steady state of a Kerr resonator with one- and two-photon driving and dissipation: Controllable Wigner-function multimodality and dissipative phase transitions

NASA Astrophysics Data System (ADS)

Bartolo, Nicola; Minganti, Fabrizio; Casteels, Wim; Ciuti, Cristiano

2016-09-01

We present exact results for the steady-state density matrix of a general class of driven-dissipative systems consisting of a nonlinear Kerr resonator in the presence of both coherent (one-photon) and parametric (two-photon) driving and dissipation. Thanks to the analytical solution, obtained via the complex P -representation formalism, we are able to explore any regime, including photon blockade, multiphoton resonant effects, and a mesoscopic regime with large photon density and quantum correlations. We show how the interplay between one- and two-photon driving provides a way to control the multimodality of the Wigner function in regimes where the semiclassical theory exhibits multistability. We also study the emergence of dissipative phase transitions in the thermodynamic limit of large photon numbers.

Correlated Noise: How it Breaks NMF, and What to Do About It.

PubMed

Plis, Sergey M; Potluru, Vamsi K; Lane, Terran; Calhoun, Vince D

2011-01-12

Non-negative matrix factorization (NMF) is a problem of decomposing multivariate data into a set of features and their corresponding activations. When applied to experimental data, NMF has to cope with noise, which is often highly correlated. We show that correlated noise can break the Donoho and Stodden separability conditions of a dataset and a regular NMF algorithm will fail to decompose it, even when given freedom to be able to represent the noise as a separate feature. To cope with this issue, we present an algorithm for NMF with a generalized least squares objective function (glsNMF) and derive multiplicative updates for the method together with proving their convergence. The new algorithm successfully recovers the true representation from the noisy data. Robust performance can make glsNMF a valuable tool for analyzing empirical data.

Correlated Noise: How it Breaks NMF, and What to Do About It

PubMed Central

Plis, Sergey M.; Potluru, Vamsi K.; Lane, Terran; Calhoun, Vince D.

2010-01-01

Non-negative matrix factorization (NMF) is a problem of decomposing multivariate data into a set of features and their corresponding activations. When applied to experimental data, NMF has to cope with noise, which is often highly correlated. We show that correlated noise can break the Donoho and Stodden separability conditions of a dataset and a regular NMF algorithm will fail to decompose it, even when given freedom to be able to represent the noise as a separate feature. To cope with this issue, we present an algorithm for NMF with a generalized least squares objective function (glsNMF) and derive multiplicative updates for the method together with proving their convergence. The new algorithm successfully recovers the true representation from the noisy data. Robust performance can make glsNMF a valuable tool for analyzing empirical data. PMID:23750288

32 CFR 776.29 - Imputed disqualification: General rule.

Code of Federal Regulations, 2012 CFR

2012-07-01

... their federal, state, and local bar rules governing the representation of multiple or adverse clients within the same office before such representation is initiated, as such representation may expose them to... military (or Government) service may require representation of opposing sides by covered USG attorneys...

32 CFR 776.29 - Imputed disqualification: General rule.

Code of Federal Regulations, 2014 CFR

2014-07-01

... their federal, state, and local bar rules governing the representation of multiple or adverse clients within the same office before such representation is initiated, as such representation may expose them to... military (or Government) service may require representation of opposing sides by covered USG attorneys...

32 CFR 776.29 - Imputed disqualification: General rule.

Code of Federal Regulations, 2013 CFR

2013-07-01

... their federal, state, and local bar rules governing the representation of multiple or adverse clients within the same office before such representation is initiated, as such representation may expose them to... military (or Government) service may require representation of opposing sides by covered USG attorneys...

Graphics Flutter Analysis Methods, an interactive computing system at Lockheed-California Company

NASA Technical Reports Server (NTRS)

Radovcich, N. A.

1975-01-01

An interactive computer graphics system, Graphics Flutter Analysis Methods (GFAM), was developed to complement FAMAS, a matrix-oriented batch computing system, and other computer programs in performing complex numerical calculations using a fully integrated data management system. GFAM has many of the matrix operation capabilities found in FAMAS, but on a smaller scale, and is utilized when the analysis requires a high degree of interaction between the engineer and computer, and schedule constraints exclude the use of batch entry programs. Applications of GFAM to a variety of preliminary design, development design, and project modification programs suggest that interactive flutter analysis using matrix representations is a feasible and cost effective computing tool.

A penny-shaped crack in a filament reinforced matrix. 1: The filament model

NASA Technical Reports Server (NTRS)

Erdogan, F.; Pacella, A. H.

1973-01-01

The electrostatic problem of a penny-shaped crack in an elastic matrix which reinforced by filaments or fibers perpendicular to the plane of the crack was studied. The elastic filament model was developed for application to evaluation studies of the stress intensity factor along the periphery of the crack, the stresses in the filaments or fibers, and the interface shear between the matrix and the filaments or fibers. The requirements expected of the model are a sufficiently accurate representation of the filament and applicability to the interaction problems involving a cracked elastic continuum with multi-filament reinforcements. The technique for developing the model and numerical examples of it are shown.

Highest-weight representations of Brocherd`s algebras

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

Slansky, R.

1997-01-01

General features of highest-weight representations of Borcherd`s algebras are described. to show their typical features, several representations of Borcherd`s extensions of finite-dimensional algebras are analyzed. Then the example of the extension of affine- su(2) to a Borcherd`s algebra is examined. These algebras provide a natural way to extend a Kac-Moody algebra to include the hamiltonian and number-changing operators in a generalized symmetry structure.

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…

On the Representation of Aquifer Compressibility in General Subsurface Flow Codes: How an Alternate Definition of Aquifer Compressibility Matches Results from the Groundwater Flow Equation

NASA Astrophysics Data System (ADS)

Birdsell, D.; Karra, S.; Rajaram, H.

2016-12-01

The governing equations for subsurface flow codes in deformable porous media are derived from the fluid mass balance equation. One class of these codes, which we call general subsurface flow (GSF) codes, does not explicitly track the motion of the solid porous media but does accept general constitutive relations for porosity, density, and fluid flux. Examples of GSF codes include PFLOTRAN, FEHM, STOMP, and TOUGH2. Meanwhile, analytical and numerical solutions based on the groundwater flow equation have assumed forms for porosity, density, and fluid flux. We review the derivation of the groundwater flow equation, which uses the form of Darcy's equation that accounts for the velocity of fluids with respect to solids and defines the soil matrix compressibility accordingly. We then show how GSF codes have a different governing equation if they use the form of Darcy's equation that is written only in terms of fluid velocity. The difference is seen in the porosity change, which is part of the specific storage term in the groundwater flow equation. We propose an alternative definition of soil matrix compressibility to correct for the untracked solid velocity. Simulation results show significantly less error for our new compressibility definition than the traditional compressibility when compared to analytical solutions from the groundwater literature. For example, the error in one calculation for a pumped sandstone aquifer goes from 940 to <70 Pa when the new compressibility is used. Code users and developers need to be aware of assumptions in the governing equations and constitutive relations in subsurface flow codes, and our newly-proposed compressibility function should be incorporated into GSF codes.

On the Representation of Aquifer Compressibility in General Subsurface Flow Codes: How an Alternate Definition of Aquifer Compressibility Matches Results from the Groundwater Flow Equation

NASA Astrophysics Data System (ADS)

Birdsell, D.; Karra, S.; Rajaram, H.

2017-12-01

The governing equations for subsurface flow codes in deformable porous media are derived from the fluid mass balance equation. One class of these codes, which we call general subsurface flow (GSF) codes, does not explicitly track the motion of the solid porous media but does accept general constitutive relations for porosity, density, and fluid flux. Examples of GSF codes include PFLOTRAN, FEHM, STOMP, and TOUGH2. Meanwhile, analytical and numerical solutions based on the groundwater flow equation have assumed forms for porosity, density, and fluid flux. We review the derivation of the groundwater flow equation, which uses the form of Darcy's equation that accounts for the velocity of fluids with respect to solids and defines the soil matrix compressibility accordingly. We then show how GSF codes have a different governing equation if they use the form of Darcy's equation that is written only in terms of fluid velocity. The difference is seen in the porosity change, which is part of the specific storage term in the groundwater flow equation. We propose an alternative definition of soil matrix compressibility to correct for the untracked solid velocity. Simulation results show significantly less error for our new compressibility definition than the traditional compressibility when compared to analytical solutions from the groundwater literature. For example, the error in one calculation for a pumped sandstone aquifer goes from 940 to <70 Pa when the new compressibility is used. Code users and developers need to be aware of assumptions in the governing equations and constitutive relations in subsurface flow codes, and our newly-proposed compressibility function should be incorporated into GSF codes.

Quantum theory of open systems based on stochastic differential equations of generalized Langevin (non-Wiener) type

NASA Astrophysics Data System (ADS)

Basharov, A. M.

2012-09-01

It is shown that the effective Hamiltonian representation, as it is formulated in author's papers, serves as a basis for distinguishing, in a broadband environment of an open quantum system, independent noise sources that determine, in terms of the stationary quantum Wiener and Poisson processes in the Markov approximation, the effective Hamiltonian and the equation for the evolution operator of the open system and its environment. General stochastic differential equations of generalized Langevin (non-Wiener) type for the evolution operator and the kinetic equation for the density matrix of an open system are obtained, which allow one to analyze the dynamics of a wide class of localized open systems in the Markov approximation. The main distinctive features of the dynamics of open quantum systems described in this way are the stabilization of excited states with respect to collective processes and an additional frequency shift of the spectrum of the open system. As an illustration of the general approach developed, the photon dynamics in a single-mode cavity without losses on the mirrors is considered, which contains identical intracavity atoms coupled to the external vacuum electromagnetic field. For some atomic densities, the photons of the cavity mode are "locked" inside the cavity, thus exhibiting a new phenomenon of radiation trapping and non-Wiener dynamics.

An Efficient Spectral Method for Ordinary Differential Equations with Rational Function Coefficients

NASA Technical Reports Server (NTRS)

Coutsias, Evangelos A.; Torres, David; Hagstrom, Thomas

1994-01-01

We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.

Extraction of food consumption systems by nonnegative matrix factorization (NMF) for the assessment of food choices.

PubMed

Zetlaoui, Mélanie; Feinberg, Max; Verger, Philippe; Clémençon, Stephan

2011-12-01

In Western countries where food supply is satisfactory, consumers organize their diets around a large combination of foods. It is the purpose of this article to examine how recent nonnegative matrix factorization (NMF) techniques can be applied to food consumption data to understand these combinations. Such data are nonnegative by nature and of high dimension. The NMF model provides a representation of consumption data through latent vectors with nonnegative coefficients, that we call consumption systems (CS), in a small number. As the NMF approach may encourage sparsity of the data representation produced, the resulting CS are easily interpretable. Beyond the illustration of its properties we provide through a simple simulation result, the NMF method is applied to data issued from a French consumption survey. The numerical results thus obtained are displayed and thoroughly discussed. A clustering based on the k-means method is also achieved in the resulting latent consumption space, to recover food consumption patterns easily usable for nutritionists. © 2011, The International Biometric Society.

Strings in bubbling geometries and dual Wilson loop correlators

NASA Astrophysics Data System (ADS)

Aguilera-Damia, Jeremías; Correa, Diego H.; Fucito, Francesco; Giraldo-Rivera, Victor I.; Morales, Jose F.; Pando Zayas, Leopoldo A.

2017-12-01

We consider a fundamental string in a bubbling geometry of arbitrary genus dual to a half-supersymmetric Wilson loop in a general large representation R of the SU( N) gauge group in N=4 Supersymmetric Yang-Mills. We demonstrate, under some mild conditions, that the minimum value of the string classical action for a bubbling geometry of arbitrary genus precisely matches the correlator of a Wilson loop in the fundamental representation and one in a general large representation. We work out the case in which the large representation is given by a rectangular Young tableau, corresponding to a genus one bubbling geometry, explicitly. We also present explicit results in the field theory for a correlator of two Wilson loops: a large one in an arbitrary representation and a "small" one in the fundamental, totally symmetric or totally antisymmetric representation.

Evaluating and Evolving Metadata in Multiple Dialects

NASA Technical Reports Server (NTRS)

Kozimore, John; Habermann, Ted; Gordon, Sean; Powers, Lindsay

2016-01-01

Despite many long-term homogenization efforts, communities continue to develop focused metadata standards along with related recommendations and (typically) XML representations (aka dialects) for sharing metadata content. Different representations easily become obstacles to sharing information because each representation generally requires a set of tools and skills that are designed, built, and maintained specifically for that representation. In contrast, community recommendations are generally described, at least initially, at a more conceptual level and are more easily shared. For example, most communities agree that dataset titles should be included in metadata records although they write the titles in different ways.

Nonnegative matrix factorization and sparse representation for the automated detection of periodic limb movements in sleep.

PubMed

Shokrollahi, Mehrnaz; Krishnan, Sridhar; Dopsa, Dustin D; Muir, Ryan T; Black, Sandra E; Swartz, Richard H; Murray, Brian J; Boulos, Mark I

2016-11-01

Stroke is a leading cause of death and disability in adults, and incurs a significant economic burden to society. Periodic limb movements (PLMs) in sleep are repetitive movements involving the great toe, ankle, and hip. Evolving evidence suggests that PLMs may be associated with high blood pressure and stroke, but this relationship remains underexplored. Several issues limit the study of PLMs including the need to manually score them, which is time-consuming and costly. For this reason, we developed a novel automated method for nocturnal PLM detection, which was shown to be correlated with (a) the manually scored PLM index on polysomnography, and (b) white matter hyperintensities on brain imaging, which have been demonstrated to be associated with PLMs. Our proposed algorithm consists of three main stages: (1) representing the signal in the time-frequency plane using time-frequency matrices (TFM), (2) applying K-nonnegative matrix factorization technique to decompose the TFM matrix into its significant components, and (3) applying kernel sparse representation for classification (KSRC) to the decomposed signal. Our approach was applied to a dataset that consisted of 65 subjects who underwent polysomnography. An overall classification of 97 % was achieved for discrimination of the aforementioned signals, demonstrating the potential of the presented method.

Matrix form for the instrument line shape of Fourier-transform spectrometers yielding a fast integration algorithm to theoretical spectra.

PubMed

Desbiens, Raphaël; Tremblay, Pierre; Genest, Jérôme; Bouchard, Jean-Pierre

2006-01-20

The instrument line shape (ILS) of a Fourier-transform spectrometer is expressed in a matrix form. For all line shape effects that scale with wavenumber, the ILS matrix is shown to be transposed in the spectral and interferogram domains. The novel representation of the ILS matrix in the interferogram domain yields an insightful physical interpretation of the underlying process producing self-apodization. Working in the interferogram domain circumvents the problem of taking into account the effects of finite optical path difference and permits a proper discretization of the equations. A fast algorithm in O(N log2 N), based on the fractional Fourier transform, is introduced that permits the application of a constant resolving power line shape to theoretical spectra or forward models. The ILS integration formalism is validated with experimental data.

General and specific consciousness: a first-order representationalist approach

PubMed Central

Mehta, Neil; Mashour, George A.

2013-01-01

It is widely acknowledged that a complete theory of consciousness should explain general consciousness (what makes a state conscious at all) and specific consciousness (what gives a conscious state its particular phenomenal quality). We defend first-order representationalism, which argues that consciousness consists of sensory representations directly available to the subject for action selection, belief formation, planning, etc. We provide a neuroscientific framework for this primarily philosophical theory, according to which neural correlates of general consciousness include prefrontal cortex, posterior parietal cortex, and non-specific thalamic nuclei, while neural correlates of specific consciousness include sensory cortex and specific thalamic nuclei. We suggest that recent data support first-order representationalism over biological theory, higher-order representationalism, recurrent processing theory, information integration theory, and global workspace theory. PMID:23882231

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.

The effect of training methodology on knowledge representation in categorization.

PubMed

Hélie, Sébastien; Shamloo, Farzin; Ell, Shawn W

2017-01-01

Category representations can be broadly classified as containing within-category information or between-category information. Although such representational differences can have a profound impact on decision-making, relatively little is known about the factors contributing to the development and generalizability of different types of category representations. These issues are addressed by investigating the impact of training methodology and category structures using a traditional empirical approach as well as the novel adaptation of computational modeling techniques from the machine learning literature. Experiment 1 focused on rule-based (RB) category structures thought to promote between-category representations. Participants learned two sets of two categories during training and were subsequently tested on a novel categorization problem using the training categories. Classification training resulted in a bias toward between-category representations whereas concept training resulted in a bias toward within-category representations. Experiment 2 focused on information-integration (II) category structures thought to promote within-category representations. With II structures, there was a bias toward within-category representations regardless of training methodology. Furthermore, in both experiments, computational modeling suggests that only within-category representations could support generalization during the test phase. These data suggest that within-category representations may be dominant and more robust for supporting the reconfiguration of current knowledge to support generalization.

The effect of training methodology on knowledge representation in categorization

PubMed Central

Shamloo, Farzin; Ell, Shawn W.

2017-01-01

Category representations can be broadly classified as containing within–category information or between–category information. Although such representational differences can have a profound impact on decision–making, relatively little is known about the factors contributing to the development and generalizability of different types of category representations. These issues are addressed by investigating the impact of training methodology and category structures using a traditional empirical approach as well as the novel adaptation of computational modeling techniques from the machine learning literature. Experiment 1 focused on rule–based (RB) category structures thought to promote between–category representations. Participants learned two sets of two categories during training and were subsequently tested on a novel categorization problem using the training categories. Classification training resulted in a bias toward between–category representations whereas concept training resulted in a bias toward within–category representations. Experiment 2 focused on information-integration (II) category structures thought to promote within–category representations. With II structures, there was a bias toward within–category representations regardless of training methodology. Furthermore, in both experiments, computational modeling suggests that only within–category representations could support generalization during the test phase. These data suggest that within–category representations may be dominant and more robust for supporting the reconfiguration of current knowledge to support generalization. PMID:28846732

Antisymmetric Wilson loops in N = 4 SYM beyond the planar limit

NASA Astrophysics Data System (ADS)

Gordon, James

2018-01-01

We study the 1/2 -BPS circular Wilson loop in the totally antisymmetric representation of the gauge group in N = 4 supersymmetric Yang-Mills. This observable is captured by a Gaussian matrix model with appropriate insertion. We compute the first 1 /N correction at leading order in 't Hooft coupling by means of the matrix model loop equations. Disagreement with the 1-loop effective action of the holographically dual D5-brane suggests the need to account for gravitational backreaction on the string theory side.

The topological particle and Morse theory

NASA Astrophysics Data System (ADS)

Rogers, Alice

2000-09-01

Canonical BRST quantization of the topological particle defined by a Morse function h is described. Stochastic calculus, using Brownian paths which implement the WKB method in a new way providing rigorous tunnelling results even in curved space, is used to give an explicit and simple expression for the matrix elements of the evolution operator for the BRST Hamiltonian. These matrix elements lead to a representation of the manifold cohomology in terms of critical points of h along lines developed by Witten (Witten E 1982 J. Diff. Geom. 17 661-92).

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.

Integrable hierarchies of Heisenberg ferromagnet equation

NASA Astrophysics Data System (ADS)

Nugmanova, G.; Azimkhanova, A.

2016-08-01

In this paper we consider the coupled Kadomtsev-Petviashvili system. From compatibility conditions we obtain the form of matrix operators. After using a gauge transformation, obtained a new type of Lax representation for the hierarchy of Heisenberg ferromagnet equation, which is equivalent to the gauge coupled Kadomtsev-Petviashvili system.

Strings in bubbling geometries and dual Wilson loop correlators

DOE PAGES

Aguilera-Damia, Jeremias; Correa, Diego H.; Fucito, Francesco; ...

2017-12-20

We consider a fundamental string in a bubbling geometry of arbitrary genus dual to a half-supersymmetric Wilson loop in a general large representation R of the SU(N) gauge group in N = 4 Supersymmetric Yang-Mills. We demonstrate, under some mild conditions, that the minimum value of the string classical action for a bubbling geometry of arbitrary genus precisely matches the correlator of a Wilson loop in the fundamental representation and one in a general large representation. We work out the case in which the large representation is given by a rectangular Young tableau, corresponding to a genus one bubbling geometry,more » explicitly. Lastly, we also present explicit results in the field theory for a correlator of two Wilson loops: a large one in an arbitrary representation and a “small” one in the fundamental, totally symmetric or totally antisymmetric representation.« less

Strings in bubbling geometries and dual Wilson loop correlators

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

Aguilera-Damia, Jeremias; Correa, Diego H.; Fucito, Francesco

We consider a fundamental string in a bubbling geometry of arbitrary genus dual to a half-supersymmetric Wilson loop in a general large representation R of the SU(N) gauge group in N = 4 Supersymmetric Yang-Mills. We demonstrate, under some mild conditions, that the minimum value of the string classical action for a bubbling geometry of arbitrary genus precisely matches the correlator of a Wilson loop in the fundamental representation and one in a general large representation. We work out the case in which the large representation is given by a rectangular Young tableau, corresponding to a genus one bubbling geometry,more » explicitly. Lastly, we also present explicit results in the field theory for a correlator of two Wilson loops: a large one in an arbitrary representation and a “small” one in the fundamental, totally symmetric or totally antisymmetric representation.« less

A Nakanishi-based model illustrating the covariant extension of the pion GPD overlap representation and its ambiguities

NASA Astrophysics Data System (ADS)

Chouika, N.; Mezrag, C.; Moutarde, H.; Rodríguez-Quintero, J.

2018-05-01

A systematic approach for the model building of Generalized Parton Distributions (GPDs), based on their overlap representation within the DGLAP kinematic region and a further covariant extension to the ERBL one, is applied to the valence-quark pion's case, using light-front wave functions inspired by the Nakanishi representation of the pion Bethe-Salpeter amplitudes (BSA). This simple but fruitful pion GPD model illustrates the general model building technique and, in addition, allows for the ambiguities related to the covariant extension, grounded on the Double Distribution (DD) representation, to be constrained by requiring a soft-pion theorem to be properly observed.

Mental disability and discriminatory practices: effects of social representations of the Mexican population.

PubMed

Mariana, Espinola-Nadurille; Guadalupe, Delgado

2009-05-01

The prevalence of mental disorders in Mexico is 26.1%. This shows that an important percentage of the population suffers from mental disability. Despite this the country's healthcare system does not provide the least acceptable standard of care for the mentally disabled. The aim of this study was to describe the general population's social representations of the disabled and analyze their relationship with the discriminatory practices from the state towards the mentally ill with respect to their right to health. This study was a secondary analysis of the First National Survey on Discrimination in Mexico. In the survey 1,437 effective interviews that comprised a representative sample, were obtained from people aged 18 to 60 living in rural and urban settings. The response rate was 76.5%. The assessment tool was a self-administered questionnaire that yielded perceptions, attitudes, values and social representations about discrimination towards groups of people that supposedly were targets of discrimination by the general population. In the survey the mentally ill were included under disability. As a secondary analysis of the survey for the purpose of this study, we selected a subset of questions that provided important information about social representations of the general Mexican population towards persons with disabilities. The general population's social representations of the disabled were analyzed. The disabled are the second group after the elderly perceived as the most discriminated and neglected and bearing more suffering. A whole set of negative representations concerning the disabled, such as lack of acceptance and respect, low self-confidence, mistreatment, incomprehension, isolation, intolerance, indifference and bad attitudes from others, were elicited. Social representations are social correspondents of the discriminatory practices that the state exerts toward the mentally ill with respect to their right to health. These representations serve to maintain, naturalize and legitimize these practices. All sectors of society should make an effort to change the negative social representations towards this vulnerable section of society.

Precision pointing of scientific instruments on space station: The LFGGREC perspective

NASA Technical Reports Server (NTRS)

Blackwell, C. C.; Sirlin, S. W.; Laskin, R. A.

1988-01-01

An application of Lyapunov function-gradient-generated robustness-enhancing control (LFGGREC) is explored. The attention is directed to a reduced-complexity representation of the pointing problem presented by the system composed of the Space Infrared Telescope Facility gimbaled to a space station configuration. Uncertainties include disturbance forces applied in the crew compartment area and control moments applied to adjacent scientific payloads (modeled as disturbance moments). Also included are uncertainties in gimbal friction and in the structural component of the system, as reflected in the inertia matrix, the damping matrix, and the stiffness matrix, and the effect of the ignored vibrational dynamics of the structure. The emphasis is on the adaptation of LFGGREC to this particular configuration and on the robustness analysis.

Irreducible representations of finitely generated nilpotent groups

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

Beloshapka, I V; Gorchinskiy, S O

2016-01-31

We prove that irreducible complex representations of finitely generated nilpotent groups are monomial if and only if they have finite weight, which was conjectured by Parshin. Note that we consider (possibly infinite-dimensional) representations without any topological structure. In addition, we prove that for certain induced representations, irreducibility is implied by Schur irreducibility. Both results are obtained in a more general form for representations over an arbitrary field. Bibliography: 21 titles.

Cups and Downs

ERIC Educational Resources Information Center

Stewart, Ian

2012-01-01

Martin Gardner wrote about a coin-flipping trick, performed by a blindfolded magician. The paper analyses this trick, and compares it with a similar trick using three cups flipped in pairs. Several different methods of analysis are discussed, including a graphical analysis of the state space and a representation in terms of a matrix. These methods…

The Circumplex Pattern of the Life Styles Inventory: A Reanalysis.

ERIC Educational Resources Information Center

Levin, Joseph

1991-01-01

A reanalysis of the intercorrelation matrix from a principal components analysis of the Life Styles Inventory was conducted using a Canadian sample. Using nonmetric multidimensional scaling, analyses show an almost perfect circumplex pattern. Results illustrate the inadequacy of factor analytic procedures for the analysis and representation of a…

A Vector Representation for Thermodynamic Relationships

ERIC Educational Resources Information Center

Pogliani, Lionello

2006-01-01

The existing vector formalism method for thermodynamic relationship maintains tractability and uses accessible mathematics, which can be seen as a diverting and entertaining step into the mathematical formalism of thermodynamics and as an elementary application of matrix algebra. The method is based on ideas and operations apt to improve the…

Multiview alignment hashing for efficient image search.

PubMed

Liu, Li; Yu, Mengyang; Shao, Ling

2015-03-01

Hashing is a popular and efficient method for nearest neighbor search in large-scale data spaces by embedding high-dimensional feature descriptors into a similarity preserving Hamming space with a low dimension. For most hashing methods, the performance of retrieval heavily depends on the choice of the high-dimensional feature descriptor. Furthermore, a single type of feature cannot be descriptive enough for different images when it is used for hashing. Thus, how to combine multiple representations for learning effective hashing functions is an imminent task. In this paper, we present a novel unsupervised multiview alignment hashing approach based on regularized kernel nonnegative matrix factorization, which can find a compact representation uncovering the hidden semantics and simultaneously respecting the joint probability distribution of data. In particular, we aim to seek a matrix factorization to effectively fuse the multiple information sources meanwhile discarding the feature redundancy. Since the raised problem is regarded as nonconvex and discrete, our objective function is then optimized via an alternate way with relaxation and converges to a locally optimal solution. After finding the low-dimensional representation, the hashing functions are finally obtained through multivariable logistic regression. The proposed method is systematically evaluated on three data sets: 1) Caltech-256; 2) CIFAR-10; and 3) CIFAR-20, and the results show that our method significantly outperforms the state-of-the-art multiview hashing techniques.

Matrix basis for plane and modal waves in a Timoshenko beam.

PubMed

Claeyssen, Julio Cesar Ruiz; Tolfo, Daniela de Rosso; Tonetto, Leticia

2016-11-01

Plane waves and modal waves of the Timoshenko beam model are characterized in closed form by introducing robust matrix basis that behave according to the nature of frequency and wave or modal numbers. These new characterizations are given in terms of a finite number of coupling matrices and closed form generating scalar functions. Through Liouville's technique, these latter are well behaved at critical or static situations. Eigenanalysis is formulated for exponential and modal waves. Modal waves are superposition of four plane waves, but there are plane waves that cannot be modal waves. Reflected and transmitted waves at an interface point are formulated in matrix terms, regardless of having a conservative or a dissipative situation. The matrix representation of modal waves is used in a crack problem for determining the reflected and transmitted matrices. Their euclidean norms are seen to be dominated by certain components at low and high frequencies. The matrix basis technique is also used with a non-local Timoshenko model and with the wave interaction with a boundary. The matrix basis allows to characterize reflected and transmitted waves in spectral and non-spectral form.

Noncommutative Field Theories and (super)string Field Theories

NASA Astrophysics Data System (ADS)

Aref'eva, I. Ya.; Belov, D. M.; Giryavets, A. A.; Koshelev, A. S.; Medvedev, P. B.

2002-11-01

In this lecture notes we explain and discuss some ideas concerning noncommutative geometry in general, as well as noncommutative field theories and string field theories. We consider noncommutative quantum field theories emphasizing an issue of their renormalizability and the UV/IR mixing. Sen's conjectures on open string tachyon condensation and their application to the D-brane physics have led to wide investigations of the covariant string field theory proposed by Witten about 15 years ago. We review main ingredients of cubic (super)string field theories using various formulations: functional, operator, conformal and the half string formalisms. The main technical tools that are used to study conjectured D-brane decay into closed string vacuum through the tachyon condensation are presented. We describe also methods which are used to study the cubic open string field theory around the tachyon vacuum: construction of the sliver state, "comma" and matrix representations of vertices.

Fusion yield: Guderley model and Tsallis statistics

NASA Astrophysics Data System (ADS)

Haubold, H. J.; Kumar, D.

2011-02-01

The reaction rate probability integral is extended from Maxwell-Boltzmann approach to a more general approach by using the pathway model introduced by Mathai in 2005 (A pathway to matrix-variate gamma and normal densities. Linear Algebr. Appl. 396, 317-328). The extended thermonuclear reaction rate is obtained in the closed form via a Meijer's G-function and the so-obtained G-function is represented as a solution of a homogeneous linear differential equation. A physical model for the hydrodynamical process in a fusion plasma-compressed and laser-driven spherical shock wave is used for evaluating the fusion energy integral by integrating the extended thermonuclear reaction rate integral over the temperature. The result obtained is compared with the standard fusion yield obtained by Haubold and John in 1981 (Analytical representation of the thermonuclear reaction rate and fusion energy production in a spherical plasma shock wave. Plasma Phys. 23, 399-411). An interpretation for the pathway parameter is also given.

Entanglement Holographic Mapping of Many-Body Localized System by Spectrum Bifurcation Renormalization Group

NASA Astrophysics Data System (ADS)

You, Yi-Zhuang; Qi, Xiao-Liang; Xu, Cenke

We introduce the spectrum bifurcation renormalization group (SBRG) as a generalization of the real-space renormalization group for the many-body localized (MBL) system without truncating the Hilbert space. Starting from a disordered many-body Hamiltonian in the full MBL phase, the SBRG flows to the MBL fixed-point Hamiltonian, and generates the local conserved quantities and the matrix product state representations for all eigenstates. The method is applicable to both spin and fermion models with arbitrary interaction strength on any lattice in all dimensions, as long as the models are in the MBL phase. In particular, we focus on the 1 d interacting Majorana chain with strong disorder, and map out its phase diagram using the entanglement entropy. The SBRG flow also generates an entanglement holographic mapping, which duals the MBL state to a fragmented holographic space decorated with small blackholes.

Bovine vaginal strain Kocuria kristinae and its characterization.

PubMed

Styková, Eva; Nemcová, Radomíra; Gancarčíková, Soňa; Valocký, Igor; Lauková, Andrea

2016-05-01

Kocuria spp. are widely distributed in nature. They are Gram-positive, coagulase-negative, coccoid bacteria belonging to the family Micrococcaceae, suborder Micrococcineae, order Actinomycetales, class Actinobacteria. In general, limited knowledge exists concerning the properties associated with the representants of the genus Kocuria, Kocuria kristinae as well. Following our previous results, K. kristinae Kk2014 Biocenol(™) (CCM 8628) was isolated from vagina of a healthy cow. Its taxonomical allottation was confirmed by matrix-assisted laser desorption/ionization time-of-flight (MALDI-TOF) identification system and phenotypic characteristics. Kk2014 strain showed strong adherence capability to the vaginal mucus, produced organic acids which can play a role in prevention of unsuitable contamination, and showed in vitro antagonistic/antimicrobial activity against strains Arcanobacterium pyogenes CCM 5753, Fusobacterium necrophorum CCM 5982, Streptococcus equi subsp. zooepidemicus CCM 7316, and Gardnerella vaginalis CCM 6221. Antimicrobial activity ranged from 100 to 200 AU/mL, up to 32 mm in size, respectively.

Constructing 1/omegaalpha noise from reversible Markov chains.

PubMed

Erland, Sveinung; Greenwood, Priscilla E

2007-09-01

This paper gives sufficient conditions for the output of 1/omegaalpha noise from reversible Markov chains on finite state spaces. We construct several examples exhibiting this behavior in a specified range of frequencies. We apply simple representations of the covariance function and the spectral density in terms of the eigendecomposition of the probability transition matrix. The results extend to hidden Markov chains. We generalize the results for aggregations of AR1-processes of C. W. J. Granger [J. Econometrics 14, 227 (1980)]. Given the eigenvalue function, there is a variety of ways to assign values to the states such that the 1/omegaalpha condition is satisfied. We show that a random walk on a certain state space is complementary to the point process model of 1/omega noise of B. Kaulakys and T. Meskauskas [Phys. Rev. E 58, 7013 (1998)]. Passing to a continuous state space, we construct 1/omegaalpha noise which also has a long memory.

Computational strategies in the dynamic simulation of constrained flexible MBS

NASA Technical Reports Server (NTRS)

Amirouche, F. M. L.; Xie, M.

1993-01-01

This research focuses on the computational dynamics of flexible constrained multibody systems. At first a recursive mapping formulation of the kinematical expressions in a minimum dimension as well as the matrix representation of the equations of motion are presented. The method employs Kane's equation, FEM, and concepts of continuum mechanics. The generalized active forces are extended to include the effects of high temperature conditions, such as creep, thermal stress, and elastic-plastic deformation. The time variant constraint relations for rolling/contact conditions between two flexible bodies are also studied. The constraints for validation of MBS simulation of gear meshing contact using a modified Timoshenko beam theory are also presented. The last part deals with minimization of vibration/deformation of the elastic beam in multibody systems making use of time variant boundary conditions. The above methodologies and computational procedures developed are being implemented in a program called DYAMUS.

Local matrix learning in clustering and applications for manifold visualization.

PubMed

Arnonkijpanich, Banchar; Hasenfuss, Alexander; Hammer, Barbara

2010-05-01

Electronic data sets are increasing rapidly with respect to both, size of the data sets and data resolution, i.e. dimensionality, such that adequate data inspection and data visualization have become central issues of data mining. In this article, we present an extension of classical clustering schemes by local matrix adaptation, which allows a better representation of data by means of clusters with an arbitrary spherical shape. Unlike previous proposals, the method is derived from a global cost function. The focus of this article is to demonstrate the applicability of this matrix clustering scheme to low-dimensional data embedding for data inspection. The proposed method is based on matrix learning for neural gas and manifold charting. This provides an explicit mapping of a given high-dimensional data space to low dimensionality. We demonstrate the usefulness of this method for data inspection and manifold visualization. 2009 Elsevier Ltd. All rights reserved.

47 CFR 1.22 - Authority for representation.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 1 2010-10-01 2010-10-01 false Authority for representation. 1.22 Section 1.22 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL PRACTICE AND PROCEDURE General Rules of Practice and... representative capacity, transacting business with the Commission, may be required to show his authority to act...

Changes in Self-Representations Following Psychoanalytic Psychotherapy for Young Adults: A Comparative Typology.

PubMed

Werbart, Andrzej; Brusell, Lars; Iggedal, Rebecka; Lavfors, Kristin; Widholm, Alexander

2016-10-01

Changes in dynamic psychological structures are often a treatment goal in psychotherapy. The present study aimed at creating a typology of self-representations among young women and men in psychoanalytic psychotherapy, to study longitudinal changes in self-representations, and to compare self-representations in the clinical sample with those of a nonclinical group. Twenty-five women and sixteen men were interviewed according to Blatt's Object Relations Inventory pretreatment, at termination, and at a 1.5-year follow-up. In the comparison group, eleven women and nine men were interviewed at baseline, 1.5 years, and three years later. Typologies of the 123 self-descriptions in the clinical group and 60 in the nonclinical group were constructed by means of ideal-type analysis for men and women separately. Clusters of self-representations could be depicted on a two-dimensional matrix with the axes Relatedness-Self-definition and Integration-Nonintegration. In most cases, the self-descriptions changed over time in terms of belonging to different ideal-type clusters. In the clinical group, there was a movement toward increased integration in self-representations, but above all toward a better balance between relatedness and self-definition. The changes continued after termination, paralleled by reduced symptoms, improved functioning, and higher developmental levels of representations. No corresponding tendency could be observed in the nonclinical group.

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.

Japanese representation in leading general medicine and basic science journals: a comparison of two decades.

PubMed

Fukui, Tsuguya; Takahashi, Osamu; Rahman, Mahbubur

2013-11-01

During 1991-2000, Japan contribution to the top general medicine journals was very small although the contribution to the top basic science journals was sizeable. However, it has not been examined whether the contribution to the top general medicine and basic science journals has changed during the last decade (2001-2010). The objective of this study was to compare Japan representation in high-impact general medicine and basic science journals between the years 1991-2000 and 2001-2010. We used PubMed database to examine the frequency of articles originated from Japan and published in 7 high-impact general medicine and 6 high-impact basic science journals. Several Boolean operators were used to connect name of the journal, year of publication and corresponding authors' affiliation in Japan. Compared to the 1991-2000 decade, Japan contribution to the top general medicine journals did not increase over the 2001-2010 period (0.66% vs. 0.74%, P = 0.255). However, compared to the same period, its contribution to the top basic science journals increased during 2001-2010 (2.51% vs. 3.60%, P < 0.001). Japan representation in basic science journals showed an upward trend over the 1991-2000 period (P < 0.001) but remained flat during 2001-2010 (P = 0.177). In contrast, the trend of Japan representation in general medicine journals remained flat both during 1991-2000 (P = 0.273) and 2001-2010 (P = 0.073). Overall, Japan contribution to the top general medicine journals has remained small and unchanged over the last two decades. However, top basic science journals had higher Japan representation during 2001-2010 compared to 1991-2000.

77 FR 30265 - Submission for OMB Review; Small Business Size Representation

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-22

... Information Collection 9000- 0163, Small Business Size Representation, by any of the following methods... Business Size Representation AGENCY: Department of Defense (DOD), General Services Administration (GSA... of a previously approved information collection requirement regarding small business size...

Joint and collaborative representation with local Volterra kernels convolution feature for face recognition

NASA Astrophysics Data System (ADS)

Feng, Guang; Li, Hengjian; Dong, Jiwen; Chen, Xi; Yang, Huiru

2018-04-01

In this paper, we proposed a joint and collaborative representation with Volterra kernel convolution feature (JCRVK) for face recognition. Firstly, the candidate face images are divided into sub-blocks in the equal size. The blocks are extracted feature using the two-dimensional Voltera kernels discriminant analysis, which can better capture the discrimination information from the different faces. Next, the proposed joint and collaborative representation is employed to optimize and classify the local Volterra kernels features (JCR-VK) individually. JCR-VK is very efficiently for its implementation only depending on matrix multiplication. Finally, recognition is completed by using the majority voting principle. Extensive experiments on the Extended Yale B and AR face databases are conducted, and the results show that the proposed approach can outperform other recently presented similar dictionary algorithms on recognition accuracy.

Similarity preserving low-rank representation for enhanced data representation and effective subspace learning.

PubMed

Zhang, Zhao; Yan, Shuicheng; Zhao, Mingbo

2014-05-01

Latent Low-Rank Representation (LatLRR) delivers robust and promising results for subspace recovery and feature extraction through mining the so-called hidden effects, but the locality of both similar principal and salient features cannot be preserved in the optimizations. To solve this issue for achieving enhanced performance, a boosted version of LatLRR, referred to as Regularized Low-Rank Representation (rLRR), is proposed through explicitly including an appropriate Laplacian regularization that can maximally preserve the similarity among local features. Resembling LatLRR, rLRR decomposes given data matrix from two directions by seeking a pair of low-rank matrices. But the similarities of principal and salient features can be effectively preserved by rLRR. As a result, the correlated features are well grouped and the robustness of representations is also enhanced. Based on the outputted bi-directional low-rank codes by rLRR, an unsupervised subspace learning framework termed Low-rank Similarity Preserving Projections (LSPP) is also derived for feature learning. The supervised extension of LSPP is also discussed for discriminant subspace learning. The validity of rLRR is examined by robust representation and decomposition of real images. Results demonstrated the superiority of our rLRR and LSPP in comparison to other related state-of-the-art algorithms. Copyright © 2014 Elsevier Ltd. All rights reserved.

Nonnegative matrix factorization with the Itakura-Saito divergence: with application to music analysis.

PubMed

Févotte, Cédric; Bertin, Nancy; Durrieu, Jean-Louis

2009-03-01

This letter presents theoretical, algorithmic, and experimental results about nonnegative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. We describe how IS-NMF is underlaid by a well-defined statistical model of superimposed gaussian components and is equivalent to maximum likelihood estimation of variance parameters. This setting can accommodate regularization constraints on the factors through Bayesian priors. In particular, inverse-gamma and gamma Markov chain priors are considered in this work. Estimation can be carried out using a space-alternating generalized expectation-maximization (SAGE) algorithm; this leads to a novel type of NMF algorithm, whose convergence to a stationary point of the IS cost function is guaranteed. We also discuss the links between the IS divergence and other cost functions used in NMF, in particular, the Euclidean distance and the generalized Kullback-Leibler (KL) divergence. As such, we describe how IS-NMF can also be performed using a gradient multiplicative algorithm (a standard algorithm structure in NMF) whose convergence is observed in practice, though not proven. Finally, we report a furnished experimental comparative study of Euclidean-NMF, KL-NMF, and IS-NMF algorithms applied to the power spectrogram of a short piano sequence recorded in real conditions, with various initializations and model orders. Then we show how IS-NMF can successfully be employed for denoising and upmix (mono to stereo conversion) of an original piece of early jazz music. These experiments indicate that IS-NMF correctly captures the semantics of audio and is better suited to the representation of music signals than NMF with the usual Euclidean and KL costs.

A general representation for axial-flow fans and turbines

NASA Technical Reports Server (NTRS)

Perl, W; Tucker, M

1945-01-01

A general representation of fan and turbine arrangements on a single classification chart is presented that is made possible by a particular definition of the stage of an axial-flow fan or turbine. Several unconventional fan and turbine arrangements are indicated and the applications of these arrangements are discussed.

Morphological Idiosyncracies in Classical Arabic: Evidence Favoring Lexical Representations over Rules.

ERIC Educational Resources Information Center

Miller, Ann M.

A lexical representational analysis of Classical Arabic is proposed that captures a generalization that McCarthy's (1979, 1981) autosegmental analysis misses, namely that idiosyncratic characteristics of the derivational binyanim in Arabic are lexical, not morphological. This analysis captures that generalization by treating all the idiosyncracies…

Orthonormal vector general polynomials derived from the Cartesian gradient of the orthonormal Zernike-based polynomials.

PubMed

Mafusire, Cosmas; Krüger, Tjaart P J

2018-06-01

The concept of orthonormal vector circle polynomials is revisited by deriving a set from the Cartesian gradient of Zernike polynomials in a unit circle using a matrix-based approach. The heart of this model is a closed-form matrix equation of the gradient of Zernike circle polynomials expressed as a linear combination of lower-order Zernike circle polynomials related through a gradient matrix. This is a sparse matrix whose elements are two-dimensional standard basis transverse Euclidean vectors. Using the outer product form of the Cholesky decomposition, the gradient matrix is used to calculate a new matrix, which we used to express the Cartesian gradient of the Zernike circle polynomials as a linear combination of orthonormal vector circle polynomials. Since this new matrix is singular, the orthonormal vector polynomials are recovered by reducing the matrix to its row echelon form using the Gauss-Jordan elimination method. We extend the model to derive orthonormal vector general polynomials, which are orthonormal in a general pupil by performing a similarity transformation on the gradient matrix to give its equivalent in the general pupil. The outer form of the Gram-Schmidt procedure and the Gauss-Jordan elimination method are then applied to the general pupil to generate the orthonormal vector general polynomials from the gradient of the orthonormal Zernike-based polynomials. The performance of the model is demonstrated with a simulated wavefront in a square pupil inscribed in a unit circle.

Network representations of angular regions for electromagnetic scattering

PubMed Central

2017-01-01

Network modeling in electromagnetics is an effective technique in treating scattering problems by canonical and complex structures. Geometries constituted of angular regions (wedges) together with planar layers can now be approached with the Generalized Wiener-Hopf Technique supported by network representation in spectral domain. Even if the network representations in spectral planes are of great importance by themselves, the aim of this paper is to present a theoretical base and a general procedure for the formulation of complex scattering problems using network representation for the Generalized Wiener Hopf Technique starting basically from the wave equation. In particular while the spectral network representations are relatively well known for planar layers, the network modelling for an angular region requires a new theory that will be developed in this paper. With this theory we complete the formulation of a network methodology whose effectiveness is demonstrated by the application to a complex scattering problem with practical solutions given in terms of GTD/UTD diffraction coefficients and total far fields for engineering applications. The methodology can be applied to other physics fields. PMID:28817573

Evidence-Based Practice: A Matrix for Predicting Phonological Generalization

ERIC Educational Resources Information Center

Gierut, Judith A.; Hulse, Lauren E.

2010-01-01

This paper describes a matrix for clinical use in the selection of phonological treatment targets to induce generalization, and in the identification of probe sounds to monitor during the course of intervention. The matrix appeals to a set of factors that have been shown to promote phonological generalization in the research literature, including…

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

Application of Discrete Fracture Modeling and Upscaling Techniques to Complex Fractured Reservoirs

NASA Astrophysics Data System (ADS)

Karimi-Fard, M.; Lapene, A.; Pauget, L.

2012-12-01

During the last decade, an important effort has been made to improve data acquisition (seismic and borehole imaging) and workflow for reservoir characterization which has greatly benefited the description of fractured reservoirs. However, the geological models resulting from the interpretations need to be validated or calibrated against dynamic data. Flow modeling in fractured reservoirs remains a challenge due to the difficulty of representing mass transfers at different heterogeneity scales. The majority of the existing approaches are based on dual continuum representation where the fracture network and the matrix are represented separately and their interactions are modeled using transfer functions. These models are usually based on idealized representation of the fracture distribution which makes the integration of real data difficult. In recent years, due to increases in computer power, discrete fracture modeling techniques (DFM) are becoming popular. In these techniques the fractures are represented explicitly allowing the direct use of data. In this work we consider the DFM technique developed by Karimi-Fard et al. [1] which is based on an unstructured finite-volume discretization. The mass flux between two adjacent control-volumes is evaluated using an optimized two-point flux approximation. The result of the discretization is a list of control-volumes with the associated pore-volumes and positions, and a list of connections with the associated transmissibilities. Fracture intersections are simplified using a connectivity transformation which contributes considerably to the efficiency of the methodology. In addition, the method is designed for general purpose simulators and any connectivity based simulator can be used for flow simulations. The DFM technique is either used standalone or as part of an upscaling technique. The upscaling techniques are required for large reservoirs where the explicit representation of all fractures and faults is not possible. Karimi-Fard et al. [2] have developed an upscaling technique based on DFM representation. The original version of this technique was developed to construct a dual-porosity model from a discrete fracture description. This technique has been extended and generalized so it can be applied to a wide range of problems from reservoirs with a few or no fracture to highly fractured reservoirs. In this work, we present the application of these techniques to two three-dimensional fractured reservoirs constructed using real data. The first model contains more than 600 medium and large scale fractures. The fractures are not always connected which requires a general modeling technique. The reservoir has 50 wells (injectors and producers) and water flooding simulations are performed. The second test case is a larger reservoir with sparsely distributed faults. Single-phase simulations are performed with 5 producing wells. [1] Karimi-Fard M., Durlofsky L.J., and Aziz K. 2004. An efficient discrete-fracture model applicable for general-purpose reservoir simulators. SPE Journal, 9(2): 227-236. [2] Karimi-Fard M., Gong B., and Durlofsky L.J. 2006. Generation of coarse-scale continuum flow models from detailed fracture characterizations. Water Resources Research, 42(10): W10423.

Quantum mechanics in non-inertial reference frames: Time-dependent rotations and loop prolongations

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

Klink, W.H., E-mail: william-klink@uiowa.edu; Wickramasekara, S., E-mail: wickrama@grinnell.edu; Department of Physics, Grinnell College, Grinnell, IA 50112

2013-09-15

This is the fourth in a series of papers on developing a formulation of quantum mechanics in non-inertial reference frames. This formulation is grounded in a class of unitary cocycle representations of what we have called the Galilean line group, the generalization of the Galilei group to include transformations amongst non-inertial reference frames. These representations show that in quantum mechanics, just as the case in classical mechanics, the transformations to accelerating reference frames give rise to fictitious forces. In previous work, we have shown that there exist representations of the Galilean line group that uphold the non-relativistic equivalence principle asmore » well as representations that violate the equivalence principle. In these previous studies, the focus was on linear accelerations. In this paper, we undertake an extension of the formulation to include rotational accelerations. We show that the incorporation of rotational accelerations requires a class of loop prolongations of the Galilean line group and their unitary cocycle representations. We recover the centrifugal and Coriolis force effects from these loop representations. Loops are more general than groups in that their multiplication law need not be associative. Hence, our broad theoretical claim is that a Galilean quantum theory that holds in arbitrary non-inertial reference frames requires going beyond groups and group representations, the well-established framework for implementing symmetry transformations in quantum mechanics. -- Highlights: •A formulation of Galilean quantum mechanics in non-inertial reference frames is presented. •The Galilei group is generalized to infinite dimensional Galilean line group. •Loop prolongations of Galilean line group contain central extensions of Galilei group. •Unitary representations of the loops are constructed. •These representations lead to terms in the Hamiltonian corresponding to fictitious forces, including centrifugal and Coriolis forces.« less

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.

Dynamic Textures Modeling via Joint Video Dictionary Learning.

PubMed

Wei, Xian; Li, Yuanxiang; Shen, Hao; Chen, Fang; Kleinsteuber, Martin; Wang, Zhongfeng

2017-04-06

Video representation is an important and challenging task in the computer vision community. In this paper, we consider the problem of modeling and classifying video sequences of dynamic scenes which could be modeled in a dynamic textures (DT) framework. At first, we assume that image frames of a moving scene can be modeled as a Markov random process. We propose a sparse coding framework, named joint video dictionary learning (JVDL), to model a video adaptively. By treating the sparse coefficients of image frames over a learned dictionary as the underlying "states", we learn an efficient and robust linear transition matrix between two adjacent frames of sparse events in time series. Hence, a dynamic scene sequence is represented by an appropriate transition matrix associated with a dictionary. In order to ensure the stability of JVDL, we impose several constraints on such transition matrix and dictionary. The developed framework is able to capture the dynamics of a moving scene by exploring both sparse properties and the temporal correlations of consecutive video frames. Moreover, such learned JVDL parameters can be used for various DT applications, such as DT synthesis and recognition. Experimental results demonstrate the strong competitiveness of the proposed JVDL approach in comparison with state-of-the-art video representation methods. Especially, it performs significantly better in dealing with DT synthesis and recognition on heavily corrupted data.

The application of trigonal curve to the Mikhailov-Shabat-Sokolov flows

NASA Astrophysics Data System (ADS)

He, Guoliang; Geng, Xianguo; Wu, Lihua

2016-08-01

Resorting to the characteristic polynomial of Lax matrix for the Mikhailov-Shabat-Sokolov hierarchy associated with a {3 × 3} matrix spectral problem, we introduce a trigonal curve, from which we deduce the associated Baker-Akhiezer function, meromorphic functions and Dubrovin-type equations. The straightening out of the Mikhailov-Shabat-Sokolov flows is exactly given through the Abel map. On the basis of these results and the theory of trigonal curve, we obtain the explicit theta function representations of the Baker-Akhiezer function, the meromorphic functions, and in particular, that of solutions for the entire Mikhailov-Shabat-Sokolov hierarchy.

New Three-Mode Squeezing Operators Gained via Tripartite Entangled State Representation

NASA Astrophysics Data System (ADS)

Jiang, Nian-Quan; Fan, Hong-Yi

2008-01-01

We show that the Agarwal Simon representation of single-mode squeezed states can be generalized to find new form of three-mode squeezed states. We use the tripartite entangled state representations |p,y,z> and |x,u,v> to realize this goal.

Correcting for diffusion in carbon-14 dating of ground water

USGS Publications Warehouse

Sanford, W.E.

1997-01-01

It has generally been recognized that molecular diffusion can be a significant process affecting the transport of carbon-14 in the subsurface when occurring either from a permeable aquifer into a confining layer or from a fracture into a rock matrix. An analytical solution that is valid for steady-state radionuclide transport through fractured rock is shown to be applicable to many multilayered aquifer systems. By plotting the ratio of the rate of diffusion to the rate of decay of carbon-14 over the length scales representative of several common hydrogeologic settings, it is demonstrated that diffusion of carbon-14 should often be not only a significant process, but a dominant one relative to decay. An age-correction formula is developed and applied to the Bangkok Basin of Thailand, where a mean carbon-14-based age of 21,000 years was adjusted to 11,000 years to account for diffusion. This formula and its graphical representation should prove useful for many studies, for they can be used first to estimate the potential role of diffusion and then to make a simple first-order age correction if necessary.It has generally been recognized that molecular diffusion can be a significant process affecting the transport of carbon-14 in the subsurface when occurring either from a permeable aquifer into a confining layer or from a fracture into a rock matrix. An analytical solution that is valid for steady-state radionuclide transport through fractured rock is shown to be applicable to many multilayered aquifer systems. By plotting the ratio of the rate of diffusion to the rate of decay of carbon-14 over the length scales representative of several common hydrogeologic settings, it is demonstrated that diffusion of carbon-14 should often be not only a significant process, but a dominant one relative to decay. An age-correction formula is developed and applied to the Bangkok Basin of Thailand, where a mean carbon-14-based age of 21,000 years was adjusted to 11,000 years to account for diffusion. This formula and its graphical representation should prove useful for many studies, for they can be used first to estimate the potential role of diffusion and then to make a simple first-order age correction if necessary.

Evaluation of non-negative matrix factorization of grey matter in age prediction.

PubMed

Varikuti, Deepthi P; Genon, Sarah; Sotiras, Aristeidis; Schwender, Holger; Hoffstaedter, Felix; Patil, Kaustubh R; Jockwitz, Christiane; Caspers, Svenja; Moebus, Susanne; Amunts, Katrin; Davatzikos, Christos; Eickhoff, Simon B

2018-06-01

The relationship between grey matter volume (GMV) patterns and age can be captured by multivariate pattern analysis, allowing prediction of individuals' age based on structural imaging. Raw data, voxel-wise GMV and non-sparse factorization (with Principal Component Analysis, PCA) show good performance but do not promote relatively localized brain components for post-hoc examinations. Here we evaluated a non-negative matrix factorization (NNMF) approach to provide a reduced, but also interpretable representation of GMV data in age prediction frameworks in healthy and clinical populations. This examination was performed using three datasets: a multi-site cohort of life-span healthy adults, a single site cohort of older adults and clinical samples from the ADNI dataset with healthy subjects, participants with Mild Cognitive Impairment and patients with Alzheimer's disease (AD) subsamples. T1-weighted images were preprocessed with VBM8 standard settings to compute GMV values after normalization, segmentation and modulation for non-linear transformations only. Non-negative matrix factorization was computed on the GM voxel-wise values for a range of granularities (50-690 components) and LASSO (Least Absolute Shrinkage and Selection Operator) regression were used for age prediction. First, we compared the performance of our data compression procedure (i.e., NNMF) to various other approaches (i.e., uncompressed VBM data, PCA-based factorization and parcellation-based compression). We then investigated the impact of the granularity on the accuracy of age prediction, as well as the transferability of the factorization and model generalization across datasets. We finally validated our framework by examining age prediction in ADNI samples. Our results showed that our framework favorably compares with other approaches. They also demonstrated that the NNMF based factorization derived from one dataset could be efficiently applied to compress VBM data of another dataset and that granularities between 300 and 500 components give an optimal representation for age prediction. In addition to the good performance in healthy subjects our framework provided relatively localized brain regions as the features contributing to the prediction, thereby offering further insights into structural changes due to brain aging. Finally, our validation in clinical populations showed that our framework is sensitive to deviance from normal structural variations in pathological aging. Copyright © 2018 Elsevier Inc. All rights reserved.

Stress distribution retrieval in granular materials: A multi-scale model and digital image correlation measurements

NASA Astrophysics Data System (ADS)

Bruno, Luigi; Decuzzi, Paolo; Gentile, Francesco

2016-01-01

The promise of nanotechnology lies in the possibility of engineering matter on the nanoscale and creating technological interfaces that, because of their small scales, may directly interact with biological objects, creating new strategies for the treatment of pathologies that are otherwise beyond the reach of conventional medicine. Nanotechnology is inherently a multiscale, multiphenomena challenge. Fundamental understanding and highly accurate predictive methods are critical to successful manufacturing of nanostructured materials, bio/mechanical devices and systems. In biomedical engineering, and in the mechanical analysis of biological tissues, classical continuum approaches are routinely utilized, even if these disregard the discrete nature of tissues, that are an interpenetrating network of a matrix (the extra cellular matrix, ECM) and a generally large but finite number of cells with a size falling in the micrometer range. Here, we introduce a nano-mechanical theory that accounts for the-non continuum nature of bio systems and other discrete systems. This discrete field theory, doublet mechanics (DM), is a technique to model the mechanical behavior of materials over multiple scales, ranging from some millimeters down to few nanometers. In the paper, we use this theory to predict the response of a granular material to an external applied load. Such a representation is extremely attractive in modeling biological tissues which may be considered as a spatial set of a large number of particulate (cells) dispersed in an extracellular matrix. Possibly more important of this, using digital image correlation (DIC) optical methods, we provide an experimental verification of the model.

Orbit-product representation and correction of Gaussian belief propagation

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

Johnson, Jason K; Chertkov, Michael; Chernyak, Vladimir

We present a new interpretation of Gaussian belief propagation (GaBP) based on the 'zeta function' representation of the determinant as a product over orbits of a graph. We show that GaBP captures back-tracking orbits of the graph and consider how to correct this estimate by accounting for non-backtracking orbits. We show that the product over non-backtracking orbits may be interpreted as the determinant of the non-backtracking adjacency matrix of the graph with edge weights based on the solution of GaBP. An efficient method is proposed to compute a truncated correction factor including all non-backtracking orbits up to a specified length.

[x, p] = i{h_bar} ?

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

Tang, Jau

1996-03-01

Heisenberg`s commutation relation for position x and momentum p, and its validity for relativistic harmonic oscillators are examined, using the techniques of Lie algebra and dual-bosonic representation of x, p and the Hamiltonian H. A modification with [x, p] =i{h_bar}({minus_plus} 1 + H/m{sub 0}c{sup 2}) is proposed for a particle and an antiparticle in a harmonic potential. For a 2 {times} 2 matrix representation for x, p and H operators, the quantized eigenenergy E is given by (E - m{sub 0}c{sup 2})/{h_bar}{omega} = 3/2, 5/2, 7/2, ..., where 1/2 is not allowed.

Phase dilemma in natural orbital functional theory from the N-representability perspective

NASA Astrophysics Data System (ADS)

Mitxelena, Ion; Rodriguez-Mayorga, Mauricio; Piris, Mario

2018-06-01

Any rigorous approach to first-order reduced density matrix ( Γ) functional theory faces the phase dilemma, that is, having to deal with a large number of possible combinations of signs in terms of the electron-electron interaction energy. This problem was discovered by reducing a ground-state energy generated from an approximate N-particle wavefunction into a functional of Γ, known as the top-down method. Here, we show that the phase dilemma also appears in the bottom-up method, in which the functional E[ Γ] is generated by progressive inclusion of N-representability conditions on the reconstructed two-particle reduced density matrix. It is shown that an adequate choice of signs is essential to accurately describe model systems with strong non-dynamic (static) electron correlation, specifically, the one-dimensional Hubbard model with periodic boundary conditions and hydrogen rings. For the latter, the Piris natural orbital functional 7 (PNOF7), with phases equal to -1 for the inter-pair energy terms containing the exchange-time-inversion integrals, agrees with exact diagonalization results.

A network of discrete events for the representation and analysis of diffusion dynamics.

PubMed

Pintus, Alberto M; Pazzona, Federico G; Demontis, Pierfranco; Suffritti, Giuseppe B

2015-11-14

We developed a coarse-grained description of the phenomenology of diffusive processes, in terms of a space of discrete events and its representation as a network. Once a proper classification of the discrete events underlying the diffusive process is carried out, their transition matrix is calculated on the basis of molecular dynamics data. This matrix can be represented as a directed, weighted network where nodes represent discrete events, and the weight of edges is given by the probability that one follows the other. The structure of this network reflects dynamical properties of the process of interest in such features as its modularity and the entropy rate of nodes. As an example of the applicability of this conceptual framework, we discuss here the physics of diffusion of small non-polar molecules in a microporous material, in terms of the structure of the corresponding network of events, and explain on this basis the diffusivity trends observed. A quantitative account of these trends is obtained by considering the contribution of the various events to the displacement autocorrelation function.

Genomicus update 2015: KaryoView and MatrixView provide a genome-wide perspective to multispecies comparative genomics

PubMed Central

Louis, Alexandra; Nguyen, Nga Thi Thuy; Muffato, Matthieu; Roest Crollius, Hugues

2015-01-01

The Genomicus web server (http://www.genomicus.biologie.ens.fr/genomicus) is a visualization tool allowing comparative genomics in four different phyla (Vertebrate, Fungi, Metazoan and Plants). It provides access to genomic information from extant species, as well as ancestral gene content and gene order for vertebrates and flowering plants. Here we present the new features available for vertebrate genome with a focus on new graphical tools. The interface to enter the database has been improved, two pairwise genome comparison tools are now available (KaryoView and MatrixView) and the multiple genome comparison tools (PhyloView and AlignView) propose three new kinds of representation and a more intuitive menu. These new developments have been implemented for Genomicus portal dedicated to vertebrates. This allows the analysis of 68 extant animal genomes, as well as 58 ancestral reconstructed genomes. The Genomicus server also provides access to ancestral gene orders, to facilitate evolutionary and comparative genomics studies, as well as computationally predicted regulatory interactions, thanks to the representation of conserved non-coding elements with their putative gene targets. PMID:25378326

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

Kolda, Tamara Gibson

We propose two new multilinear operators for expressing the matrix compositions that are needed in the Tucker and PARAFAC (CANDECOMP) decompositions. The first operator, which we call the Tucker operator, is shorthand for performing an n-mode matrix multiplication for every mode of a given tensor and can be employed to concisely express the Tucker decomposition. The second operator, which we call the Kruskal operator, is shorthand for the sum of the outer-products of the columns of N matrices and allows a divorce from a matricized representation and a very concise expression of the PARAFAC decomposition. We explore the properties ofmore » the Tucker and Kruskal operators independently of the related decompositions. Additionally, we provide a review of the matrix and tensor operations that are frequently used in the context of tensor decompositions.« less

Coherent orthogonal polynomials

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

Celeghini, E., E-mail: celeghini@fi.infn.it; Olmo, M.A. del, E-mail: olmo@fta.uva.es

2013-08-15

We discuss a fundamental characteristic of orthogonal polynomials, like the existence of a Lie algebra behind them, which can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we include thus–in addition to differential equations, recurrence relations, Hilbert spaces and square integrable functions–Lie algebra theory. We start here from the square integrable functions on the open connected subset of the real line whose bases are related to orthogonal polynomials. All these one-dimensional continuous spaces allow, besides the standard uncountable basis (|x〉), for an alternative countable basis (|n〉). The matrix elements that relatemore » these two bases are essentially the orthogonal polynomials: Hermite polynomials for the line and Laguerre and Legendre polynomials for the half-line and the line interval, respectively. Differential recurrence relations of orthogonal polynomials allow us to realize that they determine an infinite-dimensional irreducible representation of a non-compact Lie algebra, whose second order Casimir C gives rise to the second order differential equation that defines the corresponding family of orthogonal polynomials. Thus, the Weyl–Heisenberg algebra h(1) with C=0 for Hermite polynomials and su(1,1) with C=−1/4 for Laguerre and Legendre polynomials are obtained. Starting from the orthogonal polynomials the Lie algebra is extended both to the whole space of the L{sup 2} functions and to the corresponding Universal Enveloping Algebra and transformation group. Generalized coherent states from each vector in the space L{sup 2} and, in particular, generalized coherent polynomials are thus obtained. -- Highlights: •Fundamental characteristic of orthogonal polynomials (OP): existence of a Lie algebra. •Differential recurrence relations of OP determine a unitary representation of a non-compact Lie group. •2nd order Casimir originates a 2nd order differential equation that defines the corresponding OP family. •Generalized coherent polynomials are obtained from OP.« less

Students' Understanding of Analogy after a Core (Chemical Observations, Representations, Experimentation) Learning Cycle, General Chemistry Experiment

ERIC Educational Resources Information Center

Avargil, Shirly; Bruce, Mitchell R. M.; Amar, Franc¸ois G.; Bruce, Alice E.

2015-01-01

Students' understanding about analogy was investigated after a CORE learning cycle general chemistry experiment. CORE (Chemical Observations, Representations, Experimentation) is a new three-phase learning cycle that involves (phase 1) guiding students through chemical observations while they consider a series of open-ended questions, (phase 2)…

Testing the Predictive Capability of the High-Fidelity Generalized Method of Cells Using an Efficient Reformulation

NASA Technical Reports Server (NTRS)

Arnold, Steven M. (Technical Monitor); Bansal, Yogesh; Pindera, Marek-Jerzy

2004-01-01

The High-Fidelity Generalized Method of Cells is a new micromechanics model for unidirectionally reinforced periodic multiphase materials that was developed to overcome the original model's shortcomings. The high-fidelity version predicts the local stress and strain fields with dramatically greater accuracy relative to the original model through the use of a better displacement field representation. Herein, we test the high-fidelity model's predictive capability in estimating the elastic moduli of periodic composites characterized by repeating unit cells obtained by rotation of an infinite square fiber array through an angle about the fiber axis. Such repeating unit cells may contain a few or many fibers, depending on the rotation angle. In order to analyze such multi-inclusion repeating unit cells efficiently, the high-fidelity micromechanics model's framework is reformulated using the local/global stiffness matrix approach. The excellent agreement with the corresponding results obtained from the standard transformation equations confirms the new model's predictive capability for periodic composites characterized by multi-inclusion repeating unit cells lacking planes of material symmetry. Comparison of the effective moduli and local stress fields with the corresponding results obtained from the original Generalized Method of Cells dramatically highlights the original model's shortcomings for certain classes of unidirectional composites.

The Cognitive Advantages of Counting Specifically: A Representational Analysis of Verbal Numeration Systems in Oceanic Languages.

PubMed

Bender, Andrea; Schlimm, Dirk; Beller, Sieghard

2015-10-01

The domain of numbers provides a paradigmatic case for investigating interactions of culture, language, and cognition: Numerical competencies are considered a core domain of knowledge, and yet the development of specifically human abilities presupposes cultural and linguistic input by way of counting sequences. These sequences constitute systems with distinct structural properties, the cross-linguistic variability of which has implications for number representation and processing. Such representational effects are scrutinized for two types of verbal numeration systems-general and object-specific ones-that were in parallel use in several Oceanic languages (English with its general system is included for comparison). The analysis indicates that the object-specific systems outperform the general systems with respect to counting and mental arithmetic, largely due to their regular and more compact representation. What these findings reveal on cognitive diversity, how the conjectures involved speak to more general issues in cognitive science, and how the approach taken here might help to bridge the gap between anthropology and other cognitive sciences is discussed in the conclusion. Copyright © 2015 Cognitive Science Society, Inc.

Cognitive regulation alters social and dietary choice by changing attribute representations in domain-general and domain-specific brain circuits

PubMed Central

Hutcherson, Cendri A

2018-01-01

Are some people generally more successful using cognitive regulation or does it depend on the choice domain? Why? We combined behavioral computational modeling and multivariate decoding of fMRI responses to identify neural loci of regulation-related shifts in value representations across goals and domains (dietary or altruistic choice). Surprisingly, regulatory goals did not alter integrative value representations in the ventromedial prefrontal cortex, which represented all choice-relevant attributes across goals and domains. Instead, the dorsolateral prefrontal cortex (DLPFC) flexibly encoded goal-consistent values and predicted regulatory success for the majority of choice-relevant attributes, using attribute-specific neural codes. We also identified domain-specific exceptions: goal-dependent encoding of prosocial attributes localized to precuneus and temporo-parietal junction (not DLPFC). Our results suggest that cognitive regulation operated by changing specific attribute representations (not integrated values). Evidence of domain-general and domain-specific neural loci reveals important divisions of labor, explaining when and why regulatory success generalizes (or doesn’t) across contexts and domains. PMID:29813018

Mirror representations innate versus determined by experience: a viewpoint from learning theory.

PubMed

Giese, Martin A

2014-04-01

From the viewpoint of pattern recognition and computational learning, mirror neurons form an interesting multimodal representation that links action perception and planning. While it seems unlikely that all details of such representations are specified by the genetic code, robust learning of such complex representations likely requires an appropriate interplay between plasticity, generalization, and anatomical constraints of the underlying neural architecture.

40 CFR 97.51 - Establishment of accounts.

Code of Federal Regulations, 2014 CFR

2014-07-01

... a complete account certificate of representation under § 97.13, the Administrator will establish: (1) A compliance account for each NOX Budget unit for which the account certificate of representation... representation was submitted and that has two or more NOX Budget units. (b) General accounts—(1) Application for...

40 CFR 97.51 - Establishment of accounts.

Code of Federal Regulations, 2013 CFR

2013-07-01

... a complete account certificate of representation under § 97.13, the Administrator will establish: (1) A compliance account for each NOX Budget unit for which the account certificate of representation... representation was submitted and that has two or more NOX Budget units. (b) General accounts—(1) Application for...

40 CFR 97.51 - Establishment of accounts.

Code of Federal Regulations, 2011 CFR

2011-07-01

... a complete account certificate of representation under § 97.13, the Administrator will establish: (1) A compliance account for each NOX Budget unit for which the account certificate of representation... representation was submitted and that has two or more NOX Budget units. (b) General accounts—(1) Application for...

40 CFR 97.51 - Establishment of accounts.

Code of Federal Regulations, 2012 CFR

2012-07-01

... a complete account certificate of representation under § 97.13, the Administrator will establish: (1) A compliance account for each NOX Budget unit for which the account certificate of representation... representation was submitted and that has two or more NOX Budget units. (b) General accounts—(1) Application for...

19 CFR 111.5 - Representation before Government agencies.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 19 Customs Duties 1 2014-04-01 2014-04-01 false Representation before Government agencies. 111.5 Section 111.5 Customs Duties U.S. CUSTOMS AND BORDER PROTECTION, DEPARTMENT OF HOMELAND SECURITY; DEPARTMENT OF THE TREASURY CUSTOMS BROKERS General Provisions § 111.5 Representation before Government...

19 CFR 111.5 - Representation before Government agencies.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 19 Customs Duties 1 2012-04-01 2012-04-01 false Representation before Government agencies. 111.5 Section 111.5 Customs Duties U.S. CUSTOMS AND BORDER PROTECTION, DEPARTMENT OF HOMELAND SECURITY; DEPARTMENT OF THE TREASURY CUSTOMS BROKERS General Provisions § 111.5 Representation before Government...

19 CFR 111.5 - Representation before Government agencies.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 19 Customs Duties 1 2013-04-01 2013-04-01 false Representation before Government agencies. 111.5 Section 111.5 Customs Duties U.S. CUSTOMS AND BORDER PROTECTION, DEPARTMENT OF HOMELAND SECURITY; DEPARTMENT OF THE TREASURY CUSTOMS BROKERS General Provisions § 111.5 Representation before Government...

19 CFR 111.5 - Representation before Government agencies.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 19 Customs Duties 1 2011-04-01 2011-04-01 false Representation before Government agencies. 111.5 Section 111.5 Customs Duties U.S. CUSTOMS AND BORDER PROTECTION, DEPARTMENT OF HOMELAND SECURITY; DEPARTMENT OF THE TREASURY CUSTOMS BROKERS General Provisions § 111.5 Representation before Government...

Making Implicit Multivariable Calculus Representations Explicit: A Clinical Study

ERIC Educational Resources Information Center

McGee, Daniel; Moore-Russo, Deborah; Martinez-Planell, Rafael

2015-01-01

Reviewing numerous textbooks, we found that in both differential and integral calculus textbooks the authors commonly assume that: (i) students can generalize associations between representations in two dimensions to associations between representations of the same mathematical concept in three dimensions on their own; and (ii) explicit…

47 CFR 0.560 - Penalty for false representation of identity.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 1 2010-10-01 2010-10-01 false Penalty for false representation of identity. 0.560 Section 0.560 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION Privacy Act Regulations § 0.560 Penalty for false representation of identity. Any individual who knowingly...

13 CFR 107.502 - Representations to the public.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Representations to the public. 107.502 Section 107.502 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION SMALL BUSINESS INVESTMENT COMPANIES Managing the Operations of a Licensee General Requirements § 107.502 Representations to...

19 CFR 111.5 - Representation before Government agencies.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 19 Customs Duties 1 2010-04-01 2010-04-01 false Representation before Government agencies. 111.5 Section 111.5 Customs Duties U.S. CUSTOMS AND BORDER PROTECTION, DEPARTMENT OF HOMELAND SECURITY; DEPARTMENT OF THE TREASURY CUSTOMS BROKERS General Provisions § 111.5 Representation before Government...

47 CFR 0.560 - Penalty for false representation of identity.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 1 2012-10-01 2012-10-01 false Penalty for false representation of identity. 0.560 Section 0.560 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION Privacy Act Regulations § 0.560 Penalty for false representation of identity. Any individual who knowingly...

47 CFR 0.560 - Penalty for false representation of identity.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 1 2011-10-01 2011-10-01 false Penalty for false representation of identity. 0.560 Section 0.560 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION Privacy Act Regulations § 0.560 Penalty for false representation of identity. Any individual who knowingly...

47 CFR 0.560 - Penalty for false representation of identity.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 1 2014-10-01 2014-10-01 false Penalty for false representation of identity. 0.560 Section 0.560 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION Privacy Act Regulations § 0.560 Penalty for false representation of identity. Any individual who knowingly...

47 CFR 0.560 - Penalty for false representation of identity.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 1 2013-10-01 2013-10-01 false Penalty for false representation of identity. 0.560 Section 0.560 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION Privacy Act Regulations § 0.560 Penalty for false representation of identity. Any individual who knowingly...

A new bidirectional generalization of (2+1)-dimensional matrix k-constrained Kadomtsev-Petviashvili hierarchy

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

Chvartatskyi, O. I., E-mail: alex.chvartatskyy@gmail.com; Sydorenko, Yu. M., E-mail: y-sydorenko@franko.lviv.ua

We introduce a new bidirectional generalization of (2+1)-dimensional k-constrained Kadomtsev-Petviashvili (KP) hierarchy ((2+1)-BDk-cKPH). This new hierarchy generalizes (2+1)-dimensional k-cKP hierarchy, (t{sub A}, τ{sub B}) and (γ{sub A}, σ{sub B}) matrix hierarchies. (2+1)-BDk-cKPH contains a new matrix (1+1)-k-constrained KP hierarchy. Some members of (2+1)-BDk-cKPH are also listed. In particular, it contains matrix generalizations of Davey-Stewartson (DS) systems, (2+1)-dimensional modified Korteweg-de Vries equation and the Nizhnik equation. (2+1)-BDk-cKPH also includes new matrix (2+1)-dimensional generalizations of the Yajima-Oikawa and Melnikov systems. Binary Darboux Transformation Dressing Method is also proposed for construction of exact solutions for equations from (2+1)-BDk-cKPH. As an example the exactmore » form of multi-soliton solutions for vector generalization of the DS system is given.« less

Combinatorial approach to the representation of the Schur-Weyl duality in one-dimensional spin systems

NASA Astrophysics Data System (ADS)

Jakubczyk, Dorota; Jakubczyk, Paweł

2018-02-01

We propose combinatorial approach to the representation of Schur-Weyl duality in physical systems on the example of one-dimensional spin chains. Exploiting the Robinson-Schensted-Knuth algorithm, we perform decomposition of the dual group representations into irreducible representations in a fully combinatorial way. As representation space, we choose the Hilbert space of the spin chains, but this approach can be easily generalized to an arbitrary physical system where the Schur-Weyl duality works.

Heading-vector navigation based on head-direction cells and path integration.

PubMed

Kubie, John L; Fenton, André A

2009-05-01

Insect navigation is guided by heading vectors that are computed by path integration. Mammalian navigation models, on the other hand, are typically based on map-like place representations provided by hippocampal place cells. Such models compute optimal routes as a continuous series of locations that connect the current location to a goal. We propose a "heading-vector" model in which head-direction cells or their derivatives serve both as key elements in constructing the optimal route and as the straight-line guidance during route execution. The model is based on a memory structure termed the "shortcut matrix," which is constructed during the initial exploration of an environment when a set of shortcut vectors between sequential pairs of visited waypoint locations is stored. A mechanism is proposed for calculating and storing these vectors that relies on a hypothesized cell type termed an "accumulating head-direction cell." Following exploration, shortcut vectors connecting all pairs of waypoint locations are computed by vector arithmetic and stored in the shortcut matrix. On re-entry, when local view or place representations query the shortcut matrix with a current waypoint and goal, a shortcut trajectory is retrieved. Since the trajectory direction is in head-direction compass coordinates, navigation is accomplished by tracking the firing of head-direction cells that are tuned to the heading angle. Section 1 of the manuscript describes the properties of accumulating head-direction cells. It then shows how accumulating head-direction cells can store local vectors and perform vector arithmetic to perform path-integration-based homing. Section 2 describes the construction and use of the shortcut matrix for computing direct paths between any pair of locations that have been registered in the shortcut matrix. In the discussion, we analyze the advantages of heading-based navigation over map-based navigation. Finally, we survey behavioral evidence that nonhippocampal, heading-based navigation is used in small mammals and humans. Copyright 2008 Wiley-Liss, Inc.

Artificial intelligence systems based on texture descriptors for vaccine development.

PubMed

Nanni, Loris; Brahnam, Sheryl; Lumini, Alessandra

2011-02-01

The aim of this work is to analyze and compare several feature extraction methods for peptide classification that are based on the calculation of texture descriptors starting from a matrix representation of the peptide. This texture-based representation of the peptide is then used to train a support vector machine classifier. In our experiments, the best results are obtained using local binary patterns variants and the discrete cosine transform with selected coefficients. These results are better than those previously reported that employed texture descriptors for peptide representation. In addition, we perform experiments that combine standard approaches based on amino acid sequence. The experimental section reports several tests performed on a vaccine dataset for the prediction of peptides that bind human leukocyte antigens and on a human immunodeficiency virus (HIV-1). Experimental results confirm the usefulness of our novel descriptors. The matlab implementation of our approaches is available at http://bias.csr.unibo.it/nanni/TexturePeptide.zip.

Generalized zeta function representation of groups and 2-dimensional topological Yang-Mills theory: The example of GL(2, #Mathematical Double-Struck Capital F#{sub q}) and PGL(2, #Mathematical Double-Struck Capital F#{sub q})

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

Roche, Ph., E-mail: philippe.roche@univ-montp2.fr

We recall the relation between zeta function representation of groups and two-dimensional topological Yang-Mills theory through Mednikh formula. We prove various generalisations of Mednikh formulas and define generalization of zeta function representations of groups. We compute some of these functions in the case of the finite group GL(2, #Mathematical Double-Struck Capital F#{sub q}) and PGL(2, #Mathematical Double-Struck Capital F#{sub q}). We recall the table characters of these groups for any q, compute the Frobenius-Schur indicator of their irreducible representations, and give the explicit structure of their fusion rings.

40 CFR 96.51 - Establishment of accounts.

Code of Federal Regulations, 2013 CFR

2013-07-01

... accounts. Upon receipt of a complete account certificate of representation under § 96.13, the Administrator... representation was submitted; and (2) An overdraft account for each source for which the account certificate of representation was submitted and that has two or more NOX Budget units. (b) General accounts. (1) Any person may...

40 CFR 97.351 - Establishment of accounts.

Code of Federal Regulations, 2014 CFR

2014-07-01

... § 97.384(e), upon receipt of a complete certificate of representation under § 97.313, the Administrator... representation was submitted, unless the source already has a compliance account. (b) General accounts—(1... Program on behalf of such persons and that each such person shall be fully bound by my representations...

40 CFR 96.51 - Establishment of accounts.

Code of Federal Regulations, 2012 CFR

2012-07-01

... accounts. Upon receipt of a complete account certificate of representation under § 96.13, the Administrator... representation was submitted; and (2) An overdraft account for each source for which the account certificate of representation was submitted and that has two or more NOX Budget units. (b) General accounts. (1) Any person may...

40 CFR 96.51 - Establishment of accounts.

Code of Federal Regulations, 2011 CFR

2011-07-01

... accounts. Upon receipt of a complete account certificate of representation under § 96.13, the Administrator... representation was submitted; and (2) An overdraft account for each source for which the account certificate of representation was submitted and that has two or more NOX Budget units. (b) General accounts. (1) Any person may...

40 CFR 96.51 - Establishment of accounts.

Code of Federal Regulations, 2014 CFR

2014-07-01

... accounts. Upon receipt of a complete account certificate of representation under § 96.13, the Administrator... representation was submitted; and (2) An overdraft account for each source for which the account certificate of representation was submitted and that has two or more NOX Budget units. (b) General accounts. (1) Any person may...

40 CFR 97.351 - Establishment of accounts.

Code of Federal Regulations, 2013 CFR

2013-07-01

... § 97.384(e), upon receipt of a complete certificate of representation under § 97.313, the Administrator... representation was submitted, unless the source already has a compliance account. (b) General accounts—(1... Program on behalf of such persons and that each such person shall be fully bound by my representations...

37 CFR 2.17 - Recognition for representation.

Code of Federal Regulations, 2010 CFR

2010-07-01

..., registrant, or party (e.g., a corporate officer or general partner of a partnership). In the case of joint..., DEPARTMENT OF COMMERCE RULES OF PRACTICE IN TRADEMARK CASES Representation by Attorneys Or Other Authorized Persons § 2.17 Recognition for representation. (a) Authority to practice in trademark cases. Only an...

Effects of dynamically variable saturation and matrix-conduit coupling of flow in karst aquifers

USGS Publications Warehouse

Reimann, T.; Geyer, T.; Shoemaker, W.B.; Liedl, R.; Sauter, M.

2011-01-01

Well-developed karst aquifers consist of highly conductive conduits and a relatively low permeability fractured and/or porous rock matrix and therefore behave as a dual-hydraulic system. Groundwater flow within highly permeable strata is rapid and transient and depends on local flow conditions, i.e., pressurized or nonpressurized flow. The characterization of karst aquifers is a necessary and challenging task because information about hydraulic and spatial conduit properties is poorly defined or unknown. To investigate karst aquifers, hydraulic stresses such as large recharge events can be simulated with hybrid (coupled discrete continuum) models. Since existing hybrid models are simplifications of the system dynamics, a new karst model (ModBraC) is presented that accounts for unsteady and nonuniform discrete flow in variably saturated conduits employing the Saint-Venant equations. Model performance tests indicate that ModBraC is able to simulate (1) unsteady and nonuniform flow in variably filled conduits, (2) draining and refilling of conduits with stable transition between free-surface and pressurized flow and correct storage representation, (3) water exchange between matrix and variably filled conduits, and (4) discharge routing through branched and intermeshed conduit networks. Subsequently, ModBraC is applied to an idealized catchment to investigate the significance of free-surface flow representation. A parameter study is conducted with two different initial conditions: (1) pressurized flow and (2) free-surface flow. If free-surface flow prevails, the systems is characterized by (1) a time lag for signal transmission, (2) a typical spring discharge pattern representing the transition from pressurized to free-surface flow, and (3) a reduced conduit-matrix interaction during free-surface flow. Copyright 2011 by the American Geophysical Union.

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

A Common Neural Code for Perceived and Inferred Emotion

PubMed Central

Saxe, Rebecca

2014-01-01

Although the emotions of other people can often be perceived from overt reactions (e.g., facial or vocal expressions), they can also be inferred from situational information in the absence of observable expressions. How does the human brain make use of these diverse forms of evidence to generate a common representation of a target's emotional state? In the present research, we identify neural patterns that correspond to emotions inferred from contextual information and find that these patterns generalize across different cues from which an emotion can be attributed. Specifically, we use functional neuroimaging to measure neural responses to dynamic facial expressions with positive and negative valence and to short animations in which the valence of a character's emotion could be identified only from the situation. Using multivoxel pattern analysis, we test for regions that contain information about the target's emotional state, identifying representations specific to a single stimulus type and representations that generalize across stimulus types. In regions of medial prefrontal cortex (MPFC), a classifier trained to discriminate emotional valence for one stimulus (e.g., animated situations) could successfully discriminate valence for the remaining stimulus (e.g., facial expressions), indicating a representation of valence that abstracts away from perceptual features and generalizes across different forms of evidence. Moreover, in a subregion of MPFC, this neural representation generalized to trials involving subjectively experienced emotional events, suggesting partial overlap in neural responses to attributed and experienced emotions. These data provide a step toward understanding how the brain transforms stimulus-bound inputs into abstract representations of emotion. PMID:25429141

A common neural code for perceived and inferred emotion.

PubMed

Skerry, Amy E; Saxe, Rebecca

2014-11-26

Although the emotions of other people can often be perceived from overt reactions (e.g., facial or vocal expressions), they can also be inferred from situational information in the absence of observable expressions. How does the human brain make use of these diverse forms of evidence to generate a common representation of a target's emotional state? In the present research, we identify neural patterns that correspond to emotions inferred from contextual information and find that these patterns generalize across different cues from which an emotion can be attributed. Specifically, we use functional neuroimaging to measure neural responses to dynamic facial expressions with positive and negative valence and to short animations in which the valence of a character's emotion could be identified only from the situation. Using multivoxel pattern analysis, we test for regions that contain information about the target's emotional state, identifying representations specific to a single stimulus type and representations that generalize across stimulus types. In regions of medial prefrontal cortex (MPFC), a classifier trained to discriminate emotional valence for one stimulus (e.g., animated situations) could successfully discriminate valence for the remaining stimulus (e.g., facial expressions), indicating a representation of valence that abstracts away from perceptual features and generalizes across different forms of evidence. Moreover, in a subregion of MPFC, this neural representation generalized to trials involving subjectively experienced emotional events, suggesting partial overlap in neural responses to attributed and experienced emotions. These data provide a step toward understanding how the brain transforms stimulus-bound inputs into abstract representations of emotion. Copyright © 2014 the authors 0270-6474/14/3315997-12$15.00/0.

A novel physical eco-hydrological model concept for preferential flow based on experimental applications.

NASA Astrophysics Data System (ADS)

Jackisch, Conrad; van Schaik, Loes; Graeff, Thomas; Zehe, Erwin

2014-05-01

Preferential flow through macropores often determines hydrological characteristics - especially regarding runoff generation and fast transport of solutes. Macropore settings may yet be very different in nature and dynamics, depending on their origin. While biogenic structures follow activity cycles (e.g. earth worms) and population conditions (e.g. roots), pedogenic and geogenic structures may depend on water stress (e.g. cracks) or large events (e.g. flushed voids between skeleton and soil pipes) or simply persist (e.g. bedrock interface). On the one hand, such dynamic site characteristics can be observed in seasonal changes in its reaction to precipitation. On the other hand, sprinkling experiments accompanied by tracers or time-lapse 3D Ground-Penetrating-Radar are suitable tools to determine infiltration patterns and macropore configuration. However, model representation of the macropore-matrix system is still problematic, because models either rely on effective parameters (assuming well-mixed state) or on explicit advection strongly simplifying or neglecting interaction with the diffusive flow domain. Motivated by the dynamic nature of macropores, we present a novel model approach for interacting diffusive and advective water, solutes and energy transport in structured soils. It solely relies on scale- and process-aware observables. A representative set of macropores (data from sprinkling experiments) determines the process model scale through 1D advective domains. These are connected to a 2D matrix domain which is defined by pedo-physical retention properties. Water is represented as particles. Diffusive flow is governed by a 2D random walk of these particles while advection may take place in the macropore domain. Macropore-matrix interaction is computed as dissipation of the advective momentum of a particle by its experienced drag from the matrix domain. Through a representation of matrix and macropores as connected diffusive and advective domains for water transport we open up double domain concepts linking porescale physics to preferential macroscale fingerprints without effective parameterisation or mixing assumptions. Moreover, solute transport, energy balance aspects and lateral heterogeneity in soil moisture distribution are intrinsically captured. In addition, macropore and matrix domain settings may change over time based on physical and stochastic observations. The representativity concept allows scaleability from plotscale to the lower mesoscale.

Thermodynamic characterization of networks using graph polynomials

NASA Astrophysics Data System (ADS)

Ye, Cheng; Comin, César H.; Peron, Thomas K. DM.; Silva, Filipi N.; Rodrigues, Francisco A.; Costa, Luciano da F.; Torsello, Andrea; Hancock, Edwin R.

2015-09-01

In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.

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.

On inducing finite dimensional physical field representations for massless particles in even dimensions

NASA Technical Reports Server (NTRS)

Bhansali, Vineer

1993-01-01

Assuming trivial action of Euclidean translations, the method of induced representations is used to derive a correspondence between massless field representations transforming under the full generalized even dimensional Lorentz group, and highest weight states of the relevant little group. This gives a connection between 'helicity' and 'chirality' in all dimensions. Restrictions on 'gauge independent' representations for physical particles that this induction imposes are also stated.

Language-General Biases and Language-Specific Experience Contribute to Phonological Detail in Toddlers' Word Representations

ERIC Educational Resources Information Center

Tsuji, Sho; Fikkert, Paula; Yamane, Naoto; Mazuka, Reiko

2016-01-01

Although toddlers in their 2nd year of life generally have phonologically detailed representations of words, a consistent lack of sensitivity to certain kinds of phonological changes has been reported. The origin of these insensitivities is poorly understood, and uncovering their cause is crucial for obtaining a complete picture of early…

Mathematical developments regarding the general theory of the Earth magnetism

NASA Technical Reports Server (NTRS)

Schmidt, A.

1983-01-01

A literature survey on the Earth's magnetic field, citing the works of Gauss, Erman-Petersen, Quintus Icilius and Neumayer is presented. The general formulas for the representation of the potential and components of the Earth's magnetic force are presented. An analytical representation of magnetic condition of the Earth based on observations is also made.

A Coordinated Approach to Curricular Review and Development in Undergraduate Geoscience Programs: Using a Matrix to Identify and Track Skills and Skill Development

NASA Astrophysics Data System (ADS)

MacDonald, R.; Savina, M. E.

2003-12-01

One approach to curriculum review and development is to construct a matrix of the desired skills versus courses in the departmental curriculum. The matrix approach requires faculty to articulate their goals, identify specific skills, and assess where in the curriculum students will learn and practice these skills and where there are major skills gaps. Faculty members in the Geology Department at Carleton College developed a matrix of skills covered in geology courses with the following objectives: 1) Geology majors should begin their "senior integrative exercise" having practiced multiple times all of the formal steps in the research process (recognizing problems, writing proposals, carrying out a project, reporting a project in several ways); 2) Geology majors should learn and practice a variety of professional and life skills life (e.g. computer skills, field skills, lab skills, and interpretive skills).The matrix was used to identify where in the curriculum various research methods and skills were addressed and to map potential student experiences to the objectives. In Carleton's non-hierarchical curriculum, the matrix was used to verify that students have many opportunities to practice research and life skills regardless of the path they take to completion of the major. In William and Mary's more structured curriculum, the matrix was used to ensure that skills build upon each other from course to course. Faculty members in the Geology Department at the College of William and Mary first used this approach to focus on teaching quantitative skills across the geology curriculum, and later used it in terms of teaching research, communication, and information literacy skills. After articulating goals and skills, faculty members in both departments developed more specific skill lists within each category of skills, then described the current assignments and activities in each course relative to the specific components of the matrix and discussed whether to add assignment or activities. We have found that much conversation among faculty and change within courses happens simply as a result of compiling the matrix. One effect of the use of the matrix is that faculty in the department know fairly specifically what skills students are learning and practicing in their other geology courses. Moreover, some faculty members are better suited by background or inclination to teach certain sets of skills. This coordinated approach avoids unnecessary duplication and allows faculty to build on skills and topics developed in previous courses. The matrix can also be used as a planning tool to identify gaps in the curriculum. In our experience, the skills matrix is a powerful organizational and communication tool. The skills matrix is a representation of what the department believes actually happens in the curriculum. Thus, development of a skills matrix provides a basis for departmental discussions of student learning goals and objectives as well as for describing the existing curriculum. The matrix is also a graphic representation, to college administrators and outside evaluators, of the "intentionality" of an entire curriculum, going beyond single courses and their syllabi. It can be used effectively to engage administration in discussions of departmental planning and needs analysis.

Matrix basis for plane and modal waves in a Timoshenko beam

PubMed Central

Tolfo, Daniela de Rosso; Tonetto, Leticia

2016-01-01

Plane waves and modal waves of the Timoshenko beam model are characterized in closed form by introducing robust matrix basis that behave according to the nature of frequency and wave or modal numbers. These new characterizations are given in terms of a finite number of coupling matrices and closed form generating scalar functions. Through Liouville’s technique, these latter are well behaved at critical or static situations. Eigenanalysis is formulated for exponential and modal waves. Modal waves are superposition of four plane waves, but there are plane waves that cannot be modal waves. Reflected and transmitted waves at an interface point are formulated in matrix terms, regardless of having a conservative or a dissipative situation. The matrix representation of modal waves is used in a crack problem for determining the reflected and transmitted matrices. Their euclidean norms are seen to be dominated by certain components at low and high frequencies. The matrix basis technique is also used with a non-local Timoshenko model and with the wave interaction with a boundary. The matrix basis allows to characterize reflected and transmitted waves in spectral and non-spectral form. PMID:28018668

3D tensor-based blind multispectral image decomposition for tumor demarcation

NASA Astrophysics Data System (ADS)

Kopriva, Ivica; Peršin, Antun

2010-03-01

Blind decomposition of multi-spectral fluorescent image for tumor demarcation is formulated exploiting tensorial structure of the image. First contribution of the paper is identification of the matrix of spectral responses and 3D tensor of spatial distributions of the materials present in the image from Tucker3 or PARAFAC models of 3D image tensor. Second contribution of the paper is clustering based estimation of the number of the materials present in the image as well as matrix of their spectral profiles. 3D tensor of the spatial distributions of the materials is recovered through 3-mode multiplication of the multi-spectral image tensor and inverse of the matrix of spectral profiles. Tensor representation of the multi-spectral image preserves its local spatial structure that is lost, due to vectorization process, when matrix factorization-based decomposition methods (such as non-negative matrix factorization and independent component analysis) are used. Superior performance of the tensor-based image decomposition over matrix factorization-based decompositions is demonstrated on experimental red-green-blue (RGB) image with known ground truth as well as on RGB fluorescent images of the skin tumor (basal cell carcinoma).

Adaptive multi-view clustering based on nonnegative matrix factorization and pairwise co-regularization

NASA Astrophysics Data System (ADS)

Zhang, Tianzhen; Wang, Xiumei; Gao, Xinbo

2018-04-01

Nowadays, several datasets are demonstrated by multi-view, which usually include shared and complementary information. Multi-view clustering methods integrate the information of multi-view to obtain better clustering results. Nonnegative matrix factorization has become an essential and popular tool in clustering methods because of its interpretation. However, existing nonnegative matrix factorization based multi-view clustering algorithms do not consider the disagreement between views and neglects the fact that different views will have different contributions to the data distribution. In this paper, we propose a new multi-view clustering method, named adaptive multi-view clustering based on nonnegative matrix factorization and pairwise co-regularization. The proposed algorithm can obtain the parts-based representation of multi-view data by nonnegative matrix factorization. Then, pairwise co-regularization is used to measure the disagreement between views. There is only one parameter to auto learning the weight values according to the contribution of each view to data distribution. Experimental results show that the proposed algorithm outperforms several state-of-the-arts algorithms for multi-view clustering.

Integrable Floquet dynamics, generalized exclusion processes and "fused" matrix ansatz

NASA Astrophysics Data System (ADS)

Vanicat, Matthieu

2018-04-01

We present a general method for constructing integrable stochastic processes, with two-step discrete time Floquet dynamics, from the transfer matrix formalism. The models can be interpreted as a discrete time parallel update. The method can be applied for both periodic and open boundary conditions. We also show how the stationary distribution can be built as a matrix product state. As an illustration we construct parallel discrete time dynamics associated with the R-matrix of the SSEP and of the ASEP, and provide the associated stationary distributions in a matrix product form. We use this general framework to introduce new integrable generalized exclusion processes, where a fixed number of particles is allowed on each lattice site in opposition to the (single particle) exclusion process models. They are constructed using the fusion procedure of R-matrices (and K-matrices for open boundary conditions) for the SSEP and ASEP. We develop a new method, that we named "fused" matrix ansatz, to build explicitly the stationary distribution in a matrix product form. We use this algebraic structure to compute physical observables such as the correlation functions and the mean particle current.

Quantum groups, roots of unity and particles on quantized Anti-de Sitter space

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

Steinacker, Harold

1997-05-23

Quantum groups in general and the quantum Anti-de Sitter group U q(so(2,3)) in particular are studied from the point of view of quantum field theory. The author shows that if q is a suitable root of unity, there exist finite-dimensional, unitary representations corresponding to essentially all the classical one-particle representations with (half) integer spin, with the same structure at low energies as in the classical case. In the massless case for spin ≥ 1, "naive" representations are unitarizable only after factoring out a subspace of "pure gauges", as classically. Unitary many-particle representations are defined, with the correct classical limit. Furthermore,more » the author identifies a remarkable element Q in the center of U q(g), which plays the role of a BRST operator in the case of U q(so(2,3)) at roots of unity, for any spin ≥ 1. The associated ghosts are an intrinsic part of the indecomposable representations. The author shows how to define an involution on algebras of creation and anihilation operators at roots of unity, in an example corresponding to non-identical particles. It is shown how nonabelian gauge fields appear naturally in this framework, without having to define connections on fiber bundles. Integration on Quantum Euclidean space and sphere and on Anti-de Sitter space is studied as well. The author gives a conjecture how Q can be used in general to analyze the structure of indecomposable representations, and to define a new, completely reducible associative (tensor) product of representations at roots of unity, which generalizes the standard "truncated" tensor product as well as many-particle representations.« less

Visual learning with reduced adaptation is eccentricity-specific.

PubMed

Harris, Hila; Sagi, Dov

2018-01-12

Visual learning is known to be specific to the trained target location, showing little transfer to untrained locations. Recently, learning was shown to transfer across equal-eccentricity retinal-locations when sensory adaptation due to repetitive stimulation was minimized. It was suggested that learning transfers to previously untrained locations when the learned representation is location invariant, with sensory adaptation introducing location-dependent representations, thus preventing transfer. Spatial invariance may also fail when the trained and tested locations are at different distance from the center of gaze (different retinal eccentricities), due to differences in the corresponding low-level cortical representations (e.g. allocated cortical area decreases with eccentricity). Thus, if learning improves performance by better classifying target-dependent early visual representations, generalization is predicted to fail when locations of different retinal eccentricities are trained and tested in the absence sensory adaptation. Here, using the texture discrimination task, we show specificity of learning across different retinal eccentricities (4-8°) using reduced adaptation training. The existence of generalization across equal-eccentricity locations but not across different eccentricities demonstrates that learning accesses visual representations preceding location independent representations, with specificity of learning explained by inhomogeneous sensory representation.

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

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

Rouet, François-Henry; Li, Xiaoye S.; Ghysels, Pieter

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, reliesmore » on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.« less

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

DOE PAGES

Rouet, François-Henry; Li, Xiaoye S.; Ghysels, Pieter; ...

2016-06-30

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, reliesmore » on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.« less

Corrigendum: New Form of Kane's Equations of Motion for Constrained Systems

NASA Technical Reports Server (NTRS)

Roithmayr, Carlos M.; Bajodah, Abdulrahman H.; Hodges, Dewey H.; Chen, Ye-Hwa

2007-01-01

A correction to the previously published article "New Form of Kane's Equations of Motion for Constrained Systems" is presented. Misuse of the transformation matrix between time rates of change of the generalized coordinates and generalized speeds (sometimes called motion variables) resulted in a false conclusion concerning the symmetry of the generalized inertia matrix. The generalized inertia matrix (sometimes referred to as the mass matrix) is in fact symmetric and usually positive definite when one forms nonminimal Kane's equations for holonomic or simple nonholonomic systems, systems subject to nonlinear nonholonomic constraints, and holonomic or simple nonholonomic systems subject to impulsive constraints according to Refs. 1, 2, and 3, respectively. The mass matrix is of course symmetric when one forms minimal equations for holonomic or simple nonholonomic systems using Kane s method as set forth in Ref. 4.

Fuzzy associative memories

NASA Technical Reports Server (NTRS)

Kosko, Bart

1991-01-01

Mappings between fuzzy cubes are discussed. This level of abstraction provides a surprising and fruitful alternative to the propositional and predicate-calculas reasoning techniques used in expert systems. It allows one to reason with sets instead of propositions. Discussed here are fuzzy and neural function estimators, neural vs. fuzzy representation of structured knowledge, fuzzy vector-matrix multiplication, and fuzzy associative memory (FAM) system architecture.

The Matrix: A Pedagogical Tool for Teaching Employment Discrimination Law

ERIC Educational Resources Information Center

Johns, Roger J.

2008-01-01

The teaching of law in collegiate schools of business has a long history and a set of purposes that includes training students to know and understand their basic legal rights and obligations in the business arena, to recognize and avoid the liability-laden situations that would necessitate legal representation, to know when to engage legal…

Vectors, Change of Basis and Matrix Representation: Onto-Semiotic Approach in the Analysis of Creating Meaning

ERIC Educational Resources Information Center

Montiel, Mariana; Wilhelmi, Miguel R.; Vidakovic, Draga; Elstak, Iwan

2012-01-01

In a previous study, the onto-semiotic approach was employed to analyse the mathematical notion of different coordinate systems, as well as some situations and university students' actions related to these coordinate systems in the context of multivariate calculus. This study approaches different coordinate systems through the process of change of…

A Compact Formula for Rotations as Spin Matrix Polynomials

DOE PAGES

Curtright, Thomas L.; Fairlie, David B.; Zachos, Cosmas K.

2014-08-12

Group elements of SU(2) are expressed in closed form as finite polynomials of the Lie algebra generators, for all definite spin representations of the rotation group. Here, the simple explicit result exhibits connections between group theory, combinatorics, and Fourier analysis, especially in the large spin limit. Salient intuitive features of the formula are illustrated and discussed.

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.

Asymptotic Representations of Quantum Affine Superalgebras

NASA Astrophysics Data System (ADS)

Zhang, Huafeng

2017-08-01

We study representations of the quantum affine superalgebra associated with a general linear Lie superalgebra. In the spirit of Hernandez-Jimbo, we construct inductive systems of Kirillov-Reshetikhin modules based on a cyclicity result that we established previously on tensor products of these modules, and realize their inductive limits as modules over its Borel subalgebra, the so-called q-Yangian. A new generic asymptotic limit of the same inductive systems is proposed, resulting in modules over the full quantum affine superalgebra. We derive generalized Baxter's relations in the sense of Frenkel-Hernandez for representations of the full quantum group.

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.

40 CFR 97.620 - Establishment of compliance accounts, assurance accounts, and general accounts.

Code of Federal Regulations, 2013 CFR

2013-07-01

... representation under § 97.616, the Administrator will establish a compliance account for the TR SO2 Group 1 source for which the certificate of representation was submitted, unless the source already has a... such persons and that each such person shall be fully bound by my representations, actions, inactions...

40 CFR 97.720 - Establishment of compliance accounts, assurance accounts, and general accounts.

Code of Federal Regulations, 2013 CFR

2013-07-01

... representation under § 97.716, the Administrator will establish a compliance account for the TR SO2 Group 2 source for which the certificate of representation was submitted, unless the source already has a... such persons and that each such person shall be fully bound by my representations, actions, inactions...

40 CFR 97.420 - Establishment of compliance accounts, assurance accounts, and general accounts.

Code of Federal Regulations, 2013 CFR

2013-07-01

... representation under § 97.416, the Administrator will establish a compliance account for the TR NOX Annual source for which the certificate of representation was submitted, unless the source already has a compliance... such persons and that each such person shall be fully bound by my representations, actions, inactions...

Coupled-cluster based R-matrix codes (CCRM): Recent developments

NASA Astrophysics Data System (ADS)

Sur, Chiranjib; Pradhan, Anil K.

2008-05-01

We report the ongoing development of the new coupled-cluster R-matrix codes (CCRM) for treating electron-ion scattering and radiative processes within the framework of the relativistic coupled-cluster method (RCC), interfaced with the standard R-matrix methodology. The RCC method is size consistent and in principle equivalent to an all-order many-body perturbation theory. The RCC method is one of the most accurate many-body theories, and has been applied for several systems. This project should enable the study of electron-interactions with heavy atoms/ions, utilizing not only high speed computing platforms but also improved theoretical description of the relativistic and correlation effects for the target atoms/ions as treated extensively within the RCC method. Here we present a comprehensive outline of the newly developed theoretical method and a schematic representation of the new suite of CCRM codes. We begin with the flowchart and description of various stages involved in this development. We retain the notations and nomenclature of different stages as analogous to the standard R-matrix codes.

Mueller coherency matrix method for contrast image in tissue polarimetry

NASA Astrophysics Data System (ADS)

Arce-Diego, J. L.; Fanjul-Vélez, F.; Samperio-García, D.; Pereda-Cubián, D.

2007-07-01

In this work, we propose the use of the Mueller Coherency matrix of biological tissues in order to increase the information from tissue images and so their contrast. This method involves different Mueller Coherency matrix based parameters, like the eigenvalues analysis, the entropy factor calculation, polarization components crosstalks, linear and circular polarization degrees, hermiticity or the Quaternions analysis in case depolarisation properties of tissue are sufficiently low. All these parameters make information appear clearer and so increase image contrast, so pathologies like cancer could be detected in a sooner stage of development. The election will depend on the concrete pathological process under study. This Mueller Coherency matrix method can be applied to a single tissue point, or it can be combined with a tomographic technique, so as to obtain a 3D representation of polarization contrast parameters in pathological tissues. The application of this analysis to concrete diseases can lead to tissue burn depth estimation or cancer early detection.

A parallel computer implementation of fast low-rank QR approximation of the Biot-Savart law

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

White, D A; Fasenfest, B J; Stowell, M L

2005-11-07

In this paper we present a low-rank QR method for evaluating the discrete Biot-Savart law on parallel computers. It is assumed that the known current density and the unknown magnetic field are both expressed in a finite element expansion, and we wish to compute the degrees-of-freedom (DOF) in the basis function expansion of the magnetic field. The matrix that maps the current DOF to the field DOF is full, but if the spatial domain is properly partitioned the matrix can be written as a block matrix, with blocks representing distant interactions being low rank and having a compressed QR representation.more » The matrix partitioning is determined by the number of processors, the rank of each block (i.e. the compression) is determined by the specific geometry and is computed dynamically. In this paper we provide the algorithmic details and present computational results for large-scale computations.« less

Kinetic damping in the spectra of the spherical impedance probe

NASA Astrophysics Data System (ADS)

Oberrath, J.

2018-04-01

The impedance probe is a measurement device to measure plasma parameters, such as electron density. It consists of one electrode connected to a network analyzer via a coaxial cable and is immersed into a plasma. A bias potential superposed with an alternating potential is applied to the electrode and the response of the plasma is measured. Its dynamical interaction with the plasma in an electrostatic, kinetic description can be modeled in an abstract notation based on functional analytic methods. These methods provide the opportunity to derive a general solution, which is given as the response function of the probe–plasma system. It is defined by the matrix elements of the resolvent of an appropriate dynamical operator. Based on the general solution, a residual damping for vanishing pressure can be predicted and can only be explained by kinetic effects. In this paper, an explicit response function of the spherical impedance probe is derived. Therefore, the resolvent is determined by its algebraic representation based on an expansion in orthogonal basis functions. This allows one to compute an approximated response function and its corresponding spectra. These spectra show additional damping due to kinetic effects and are in good agreement with former kinetically determined spectra.

On existence of the σ(600) Its physical implications and related problems

NASA Astrophysics Data System (ADS)

Ishida, Shin

1998-05-01

We make a re-analysis of 1=0 ππ scattering phase shift δ00 through a new method of S-matrix parametrization (IA; interfering amplitude method), and show a result suggesting strongly for the existence of σ-particle-long-sought Chiral partner of π-meson. Furthermore, through the phenomenological analyses of typical production processes of the 2π-system, the pp-central collision and the J/Ψ→ωππ decay, by applying an intuitive formula as sum of Breit-Wigner amplitudes, (VMW; variant mass and width method), the other evidences for the σ-existence are given. The validity of the methods used in the above analyses is investigated, using a simple field theoretical model, from the general viewpoint of unitarity and the applicability of final state interaction (FSI-) theorem, especially in relation to the "universality" argument. It is shown that the IA and VMW are obtained as the physical state representations of scattering and production amplitudes, respectively. The VMW is shown to be an effective method to obtain the resonance properties from production processes, which generally have the unknown strong-phases. The conventional analyses based on the "universality" seem to be powerless for this purpose.

Thermal form-factor approach to dynamical correlation functions of integrable lattice models

NASA Astrophysics Data System (ADS)

Göhmann, Frank; Karbach, Michael; Klümper, Andreas; Kozlowski, Karol K.; Suzuki, Junji

2017-11-01

We propose a method for calculating dynamical correlation functions at finite temperature in integrable lattice models of Yang-Baxter type. The method is based on an expansion of the correlation functions as a series over matrix elements of a time-dependent quantum transfer matrix rather than the Hamiltonian. In the infinite Trotter-number limit the matrix elements become time independent and turn into the thermal form factors studied previously in the context of static correlation functions. We make this explicit with the example of the XXZ model. We show how the form factors can be summed utilizing certain auxiliary functions solving finite sets of nonlinear integral equations. The case of the XX model is worked out in more detail leading to a novel form-factor series representation of the dynamical transverse two-point function.

Simplified microstrip discontinuity modeling using the transmission line matrix method interfaced to microwave CAD

NASA Astrophysics Data System (ADS)

Thompson, James H.; Apel, Thomas R.

1990-07-01

A technique for modeling microstrip discontinuities is presented which is derived from the transmission line matrix method of solving three-dimensional electromagnetic problems. In this technique the microstrip patch under investigation is divided into an integer number of square and half-square (triangle) subsections. An equivalent lumped-element model is calculated for each subsection. These individual models are then interconnected as dictated by the geometry of the patch. The matrix of lumped elements is then solved using either of two microwave CAD software interfaces with each port properly defined. Closed-form expressions for the lumped-element representation of the individual subsections is presented and experimentally verified through the X-band frequency range. A model demonstrating the use of symmetry and block construction of a circuit element is discussed, along with computer program development and CAD software interface.

Length-Two Representations of Quantum Affine Superalgebras and Baxter Operators

NASA Astrophysics Data System (ADS)

Zhang, Huafeng

2018-03-01

Associated to quantum affine general linear Lie superalgebras are two families of short exact sequences of representations whose first and third terms are irreducible: the Baxter TQ relations involving infinite-dimensional representations; the extended T-systems of Kirillov-Reshetikhin modules. We make use of these representations over the full quantum affine superalgebra to define Baxter operators as transfer matrices for the quantum integrable model and to deduce Bethe Ansatz Equations, under genericity conditions.

Entanglement classification with matrix product states

NASA Astrophysics Data System (ADS)

Sanz, M.; Egusquiza, I. L.; di Candia, R.; Saberi, H.; Lamata, L.; Solano, E.

2016-07-01

We propose an entanglement classification for symmetric quantum states based on their diagonal matrix-product-state (MPS) representation. The proposed classification, which preserves the stochastic local operation assisted with classical communication (SLOCC) criterion, relates entanglement families to the interaction length of Hamiltonians. In this manner, we establish a connection between entanglement classification and condensed matter models from a quantum information perspective. Moreover, we introduce a scalable nesting property for the proposed entanglement classification, in which the families for N parties carry over to the N + 1 case. Finally, using techniques from algebraic geometry, we prove that the minimal nontrivial interaction length n for any symmetric state is bounded by .

An efficient method for computation of the manipulator inertia matrix

NASA Technical Reports Server (NTRS)

Fijany, Amir; Bejczy, Antal K.

1989-01-01

An efficient method of computation of the manipulator inertia matrix is presented. Using spatial notations, the method leads to the definition of the composite rigid-body spatial inertia, which is a spatial representation of the notion of augmented body. The previously proposed methods, the physical interpretations leading to their derivation, and their redundancies are analyzed. The proposed method achieves a greater efficiency by eliminating the redundancy in the intrinsic equations as well as by a better choice of coordinate frame for their projection. In this case, removing the redundancy leads to greater efficiency of the computation in both serial and parallel senses.

Narcissism and relational representations among psychiatric outpatients.

PubMed

Kealy, David; Ogrodniczuk, John S; Joyce, Anthony S; Steinberg, Paul I; Piper, William E

2015-06-01

Pathological narcissism is associated with maladaptive interpersonal behavior, although less is known regarding the internal relational representations of narcissistic patients. The authors examined the relationship between pathological narcissism and two constructs that reflect internal representations of relational patterns: quality of object relations and attachment style. Patients attending a psychiatric day treatment program (N = 218) completed measures of narcissism, general psychiatric distress, and attachment style in terms of attachment avoidance and anxiety. A semistructured interview was used to assess quality of object relations. Multiple regression analysis was conducted, controlling for general psychiatric distress. Pathological narcissism was associated with anxious attachment, but not with avoidant attachment. Narcissism was also associated with lower levels of quality of object relations. The implications of these results are discussed in terms of internal representations of self-other relations.

Brain Activity Associated with Translation between Graphical and Symbolic Representations of Functions in Generally Gifted and Excelling in Mathematics Adolescents

ERIC Educational Resources Information Center

Waisman, Ilana; Leikin, Mark; Shaul, Shelley; Leikin, Roza

2014-01-01

In this study, we examine the impact and the interplay of general giftedness (G) and excellence in mathematics (EM) on high school students' mathematical performance associated with translations from graphical to symbolic representations of functions, as reflected in cortical electrical activity (by means of ERP--event-related…

Attitude Estimation or Quaternion Estimation?

NASA Technical Reports Server (NTRS)

Markley, F. Landis

2003-01-01

The attitude of spacecraft is represented by a 3x3 orthogonal matrix with unity determinant, which belongs to the three-dimensional special orthogonal group SO(3). The fact that all three-parameter representations of SO(3) are singular or discontinuous for certain attitudes has led to the use of higher-dimensional nonsingular parameterizations, especially the four-component quaternion. In attitude estimation, we are faced with the alternatives of using an attitude representation that is either singular or redundant. Estimation procedures fall into three broad classes. The first estimates a three-dimensional representation of attitude deviations from a reference attitude parameterized by a higher-dimensional nonsingular parameterization. The deviations from the reference are assumed to be small enough to avoid any singularity or discontinuity of the three-dimensional parameterization. The second class, which estimates a higher-dimensional representation subject to enough constraints to leave only three degrees of freedom, is difficult to formulate and apply consistently. The third class estimates a representation of SO(3) with more than three dimensions, treating the parameters as independent. We refer to the most common member of this class as quaternion estimation, to contrast it with attitude estimation. We analyze the first and third of these approaches in the context of an extended Kalman filter with simplified kinematics and measurement models.

Machine learning reveals orbital interaction in materials

NASA Astrophysics Data System (ADS)

Lam Pham, Tien; Kino, Hiori; Terakura, Kiyoyuki; Miyake, Takashi; Tsuda, Koji; Takigawa, Ichigaku; Chi Dam, Hieu

2017-12-01

We propose a novel representation of materials named an 'orbital-field matrix (OFM)', which is based on the distribution of valence shell electrons. We demonstrate that this new representation can be highly useful in mining material data. Experimental investigation shows that the formation energies of crystalline materials, atomization energies of molecular materials, and local magnetic moments of the constituent atoms in bimetal alloys of lanthanide metal and transition-metal can be predicted with high accuracy using the OFM. Knowledge regarding the role of the coordination numbers of the transition-metal and lanthanide elements in determining the local magnetic moments of the transition-metal sites can be acquired directly from decision tree regression analyses using the OFM.

On the representation matrices of the spin permutation group. [for atomic and molecular electronic structures

NASA Technical Reports Server (NTRS)

Wilson, S.

1977-01-01

A method is presented for the determination of the representation matrices of the spin permutation group (symmetric group), a detailed knowledge of these matrices being required in the study of the electronic structure of atoms and molecules. The method is characterized by the use of two different coupling schemes. Unlike the Yamanouchi spin algebraic scheme, the method is not recursive. The matrices for the fundamental transpositions can be written down directly in one of the two bases. The method results in a computationally significant reduction in the number of matrix elements that have to be stored when compared with, say, the standard Young tableaux group theoretical approach.

Characterization of high order spatial discretizations and lumping techniques for discontinuous finite element SN transport

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

Maginot, P. G.; Ragusa, J. C.; Morel, J. E.

2013-07-01

We examine several possible methods of mass matrix lumping for discontinuous finite element discrete ordinates transport using a Lagrange interpolatory polynomial trial space. Though positive outflow angular flux is guaranteed with traditional mass matrix lumping in a purely absorbing 1-D slab cell for the linear discontinuous approximation, we show that when used with higher degree interpolatory polynomial trial spaces, traditional lumping does yield strictly positive outflows and does not increase in accuracy with an increase in trial space polynomial degree. As an alternative, we examine methods which are 'self-lumping'. Self-lumping methods yield diagonal mass matrices by using numerical quadrature restrictedmore » to the Lagrange interpolatory points. Using equally-spaced interpolatory points, self-lumping is achieved through the use of closed Newton-Cotes formulas, resulting in strictly positive outflows in pure absorbers for odd power polynomials in 1-D slab geometry. By changing interpolatory points from the traditional equally-spaced points to the quadrature points of the Gauss-Legendre or Lobatto-Gauss-Legendre quadratures, it is possible to generate solution representations with a diagonal mass matrix and a strictly positive outflow for any degree polynomial solution representation in a pure absorber medium in 1-D slab geometry. Further, there is no inherent limit to local truncation error order of accuracy when using interpolatory points that correspond to the quadrature points of high order accuracy numerical quadrature schemes. (authors)« less

Modeling reactive transport processes in fractured rock using the time domain random walk approach within a dual-porosity framework

NASA Astrophysics Data System (ADS)

Roubinet, D.; Russian, A.; Dentz, M.; Gouze, P.

2017-12-01

Characterizing and modeling hydrodynamic reactive transport in fractured rock are critical challenges for various research fields and applications including environmental remediation, geological storage, and energy production. To this end, we consider a recently developed time domain random walk (TDRW) approach, which is adapted to reproduce anomalous transport behaviors and capture heterogeneous structural and physical properties. This method is also very well suited to optimize numerical simulations by memory-shared massive parallelization and provide numerical results at various scales. So far, the TDRW approach has been applied for modeling advective-diffusive transport with mass transfer between mobile and immobile regions and simple (theoretical) reactions in heterogeneous porous media represented as single continuum domains. We extend this approach to dual-continuum representations considering a highly permeable fracture network embedded into a poorly permeable rock matrix with heterogeneous geochemical reactions occurring in both geological structures. The resulting numerical model enables us to extend the range of the modeled heterogeneity scales with an accurate representation of solute transport processes and no assumption on the Fickianity of these processes. The proposed model is compared to existing particle-based methods that are usually used to model reactive transport in fractured rocks assuming a homogeneous surrounding matrix, and is used to evaluate the impact of the matrix heterogeneity on the apparent reaction rates for different 2D and 3D simple-to-complex fracture network configurations.

BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees.

PubMed

Fleischauer, Markus; Böcker, Sebastian

2018-01-01

Supertree methods enable the reconstruction of large phylogenies. The supertree problem can be formalized in different ways in order to cope with contradictory information in the input. Some supertree methods are based on encoding the input trees in a matrix; other methods try to find minimum cuts in some graph. Recently, we introduced Bad Clade Deletion (BCD) supertrees which combines the graph-based computation of minimum cuts with optimizing a global objective function on the matrix representation of the input trees. The BCD supertree method has guaranteed polynomial running time and is very swift in practice. The quality of reconstructed supertrees was superior to matrix representation with parsimony (MRP) and usually on par with SuperFine for simulated data; but particularly for biological data, quality of BCD supertrees could not keep up with SuperFine supertrees. Here, we present a beam search extension for the BCD algorithm that keeps alive a constant number of partial solutions in each top-down iteration phase. The guaranteed worst-case running time of the new algorithm is still polynomial in the size of the input. We present an exact and a randomized subroutine to generate suboptimal partial solutions. Both beam search approaches consistently improve supertree quality on all evaluated datasets when keeping 25 suboptimal solutions alive. Supertree quality of the BCD Beam Search algorithm is on par with MRP and SuperFine even for biological data. This is the best performance of a polynomial-time supertree algorithm reported so far.

An Efficient Local Correlation Matrix Decomposition Approach for the Localization Implementation of Ensemble-Based Assimilation Methods

NASA Astrophysics Data System (ADS)

Zhang, Hongqin; Tian, Xiangjun

2018-04-01

Ensemble-based data assimilation methods often use the so-called localization scheme to improve the representation of the ensemble background error covariance (Be). Extensive research has been undertaken to reduce the computational cost of these methods by using the localized ensemble samples to localize Be by means of a direct decomposition of the local correlation matrix C. However, the computational costs of the direct decomposition of the local correlation matrix C are still extremely high due to its high dimension. In this paper, we propose an efficient local correlation matrix decomposition approach based on the concept of alternating directions. This approach is intended to avoid direct decomposition of the correlation matrix. Instead, we first decompose the correlation matrix into 1-D correlation matrices in the three coordinate directions, then construct their empirical orthogonal function decomposition at low resolution. This procedure is followed by the 1-D spline interpolation process to transform the above decompositions to the high-resolution grid. Finally, an efficient correlation matrix decomposition is achieved by computing the very similar Kronecker product. We conducted a series of comparison experiments to illustrate the validity and accuracy of the proposed local correlation matrix decomposition approach. The effectiveness of the proposed correlation matrix decomposition approach and its efficient localization implementation of the nonlinear least-squares four-dimensional variational assimilation are further demonstrated by several groups of numerical experiments based on the Advanced Research Weather Research and Forecasting model.

The conformal characters

NASA Astrophysics Data System (ADS)

Bourget, Antoine; Troost, Jan

2018-04-01

We revisit the study of the multiplets of the conformal algebra in any dimension. The theory of highest weight representations is reviewed in the context of the Bernstein-Gelfand-Gelfand category of modules. The Kazhdan-Lusztig polynomials code the relation between the Verma modules and the irreducible modules in the category and are the key to the characters of the conformal multiplets (whether finite dimensional, infinite dimensional, unitary or non-unitary). We discuss the representation theory and review in full generality which representations are unitarizable. The mathematical theory that allows for both the general treatment of characters and the full analysis of unitarity is made accessible. A good understanding of the mathematics of conformal multiplets renders the treatment of all highest weight representations in any dimension uniform, and provides an overarching comprehension of case-by-case results. Unitary highest weight representations and their characters are classified and computed in terms of data associated to cosets of the Weyl group of the conformal algebra. An executive summary is provided, as well as look-up tables up to and including rank four.

A new mathematical formulation of the line-by-line method in case of weak line overlapping

NASA Technical Reports Server (NTRS)

Ishov, Alexander G.; Krymova, Natalie V.

1994-01-01

A rigorous mathematical proof is presented for multiline representation on the equivalent width of a molecular band which consists in the general case of n overlapping spectral lines. The multiline representation includes a principal term and terms of minor significance. The principal term is the equivalent width of the molecular band consisting of the same n nonoverlapping spectral lines. The terms of minor significance take into consideration the overlapping of two, three and more spectral lines. They are small in case of the weak overlapping of spectral lines in the molecular band. The multiline representation can be easily generalized for optically inhomogeneous gas media and holds true for combinations of molecular bands. If the band lines overlap weakly the standard formulation of line-by-line method becomes too labor-consuming. In this case the multiline representation permits line-by-line calculations to be performed more effectively. Other useful properties of the multiline representation are pointed out.

Shared Representations in Language Processing and Verbal Short-Term Memory: The Case of Grammatical Gender

ERIC Educational Resources Information Center

Schweppe, Judith; Rummer, Ralf

2007-01-01

The general idea of language-based accounts of short-term memory is that retention of linguistic materials is based on representations within the language processing system. In the present sentence recall study, we address the question whether the assumption of shared representations holds for morphosyntactic information (here: grammatical gender…

40 CFR 97.520 - Establishment of compliance accounts, assurance accounts, and general accounts.

Code of Federal Regulations, 2013 CFR

2013-07-01

... representation under § 97.516, the Administrator will establish a compliance account for the TR NOX Ozone Season source for which the certificate of representation was submitted, unless the source already has a... Program on behalf of such persons and that each such person shall be fully bound by my representations...

Effects of Direct Instruction of Visual Literacy Skills on Science Achievement When Integrated into Inquiry Learning

ERIC Educational Resources Information Center

Galyas, Lesley Crowell

2016-01-01

Understanding of visual representations is a pivotal skill necessary in science. These visual, verbal, and numeric representations are the crux of science discourses "by scientists, with students and the general public" (Pauwels, 2006, p.viii). Those who lack the understanding of these representations see it as a foreign language, one…

Large-scale Cross-modality Search via Collective Matrix Factorization Hashing.

PubMed

Ding, Guiguang; Guo, Yuchen; Zhou, Jile; Gao, Yue

2016-09-08

By transforming data into binary representation, i.e., Hashing, we can perform high-speed search with low storage cost, and thus Hashing has collected increasing research interest in the recent years. Recently, how to generate Hashcode for multimodal data (e.g., images with textual tags, documents with photos, etc) for large-scale cross-modality search (e.g., searching semantically related images in database for a document query) is an important research issue because of the fast growth of multimodal data in the Web. To address this issue, a novel framework for multimodal Hashing is proposed, termed as Collective Matrix Factorization Hashing (CMFH). The key idea of CMFH is to learn unified Hashcodes for different modalities of one multimodal instance in the shared latent semantic space in which different modalities can be effectively connected. Therefore, accurate cross-modality search is supported. Based on the general framework, we extend it in the unsupervised scenario where it tries to preserve the Euclidean structure, and in the supervised scenario where it fully exploits the label information of data. The corresponding theoretical analysis and the optimization algorithms are given. We conducted comprehensive experiments on three benchmark datasets for cross-modality search. The experimental results demonstrate that CMFH can significantly outperform several state-of-the-art cross-modality Hashing methods, which validates the effectiveness of the proposed CMFH.

Quantum mechanics in noninertial reference frames: Violations of the nonrelativistic equivalence principle

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

Klink, W.H.; Wickramasekara, S., E-mail: wickrama@grinnell.edu; Department of Physics, Grinnell College, Grinnell, IA 50112

2014-01-15

In previous work we have developed a formulation of quantum mechanics in non-inertial reference frames. This formulation is grounded in a class of unitary cocycle representations of what we have called the Galilean line group, the generalization of the Galilei group that includes transformations amongst non-inertial reference frames. These representations show that in quantum mechanics, just as is the case in classical mechanics, the transformations to accelerating reference frames give rise to fictitious forces. A special feature of these previously constructed representations is that they all respect the non-relativistic equivalence principle, wherein the fictitious forces associated with linear acceleration canmore » equivalently be described by gravitational forces. In this paper we exhibit a large class of cocycle representations of the Galilean line group that violate the equivalence principle. Nevertheless the classical mechanics analogue of these cocycle representations all respect the equivalence principle. -- Highlights: •A formulation of Galilean quantum mechanics in non-inertial reference frames is given. •The key concept is the Galilean line group, an infinite dimensional group. •A large class of general cocycle representations of the Galilean line group is constructed. •These representations show violations of the equivalence principle at the quantum level. •At the classical limit, no violations of the equivalence principle are detected.« less

From Spatial Intelligence to Spatial Competences: The Results of Applied Geo-Research in Italian Schools

ERIC Educational Resources Information Center

Sarno, Emilia

2012-01-01

This contribution explains the connection between spatial intelligence and spatial competences and by indicating how the first is the cognitive matrix of abilities necessary to move in space as well as to represent it. Indeed, two are principal factors involved in the spatial intelligence: orientation and representation. Both are based on a close…

Sparse Matrix Motivated Reconstruction of Far-Field Radiation Patterns

DTIC Science & Technology

2015-03-01

method for base - station antenna radiation patterns. IEEE Antennas Propagation Magazine. 2001;43(2):132. 4. Vasiliadis TG, Dimitriou D, Sergiadis JD...algorithm based on sparse representations of radiation patterns using the inverse Discrete Fourier Transform (DFT) and the inverse Discrete Cosine...patterns using a Model- Based Parameter Estimation (MBPE) technique that reduces the computational time required to model radiation patterns. Another

Birefringence of Cellotape: Jones Representation and Experimental Analysis

ERIC Educational Resources Information Center

Belendez, Augusto; Fernandez, Elena; Frances, Jorge; Neipp, Cristian

2010-01-01

In this paper, we analyse a simple experiment to study the effects of polarized light. A simple optical system composed of a polarizer, a retarder (cellotape) and an analyser is used to study the effect on the polarization state of the light which impinges on the setup. The optical system is characterized by means of a Jones matrix, and a simple…

Computer Aided Multi-Data Fusion Dismount Modeling

DTIC Science & Technology

2012-03-22

The ability of geometric morphometric methods to estimate a known covariance matrix., volume 49. Systematic Biology, 2000. [39] Wang C., Yuen M...the use of human shape descriptors like landmarks, body composition, body segmentation, skeletonisation, body representation using geometrical shapes...Springer. [10] Bookstein, F. L. “ Morphometric Tools for Landmark Data: Geometry and Biology.” Cambridge University Press, 1991. [11] Borengasser, M

The Effective Potential Energy Surfaces of the Nonadiabatic Collision

DTIC Science & Technology

2009-03-01

effective PESs data was extracted for the equilibrium H2 bond length and used to calculate inelastic scattering matrix elements using the time ...very grateful not only for the time he devoted each week to discussing the status of the work, but also his infectious love of learning that is...33 Structure of the Asymptotic Representation ................................................................. 43 The Time -Dependent

Position Error Covariance Matrix Validation and Correction

NASA Technical Reports Server (NTRS)

Frisbee, Joe, Jr.

2016-01-01

In order to calculate operationally accurate collision probabilities, the position error covariance matrices predicted at times of closest approach must be sufficiently accurate representations of the position uncertainties. This presentation will discuss why the Gaussian distribution is a reasonable expectation for the position uncertainty and how this assumed distribution type is used in the validation and correction of position error covariance matrices.

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.

ORNL Resolved Resonance Covariance Generation for ENDF/B-VII.1

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

Leal, Luiz C.; Guber, Klaus H.; Wiarda, Dorothea

2012-12-01

Resonance-parameter covariance matrix (RPCM) evaluations in the resolved resonance regionwere done at the Oak Ridge National Laboratory (ORNL) for the chromium isotopes, titanium isotopes, 19F, 58Ni, 60Ni, 35Cl, 37Cl, 39K, 41K, 55Mn, 233U, 235U, 238U, and 239Pu using the computer code SAMMY. The retroactive approach of the code SAMMY was used to generate the RPCMs for 233U. For 235U, the approach used for covariance generation was similar to the retroactive approach with the distinction that real experimental data were used as opposed to data generated from the resonance parameters. RPCMs for 238U and 239Pu were generated together with the resonancemore » parameter evaluations. The RPCMs were then converted in the ENDF format using the FILE32 representation. Alternatively, for computer storage reasons, the FILE32 was converted in the FILE33 cross section covariance matrix (CSCM). Both representations were processed using the computer code PUFF-IV. This paper describes the procedures used to generate the RPCM and CSCM in the resonance region for ENDF/B-VII.1. The impact of data uncertainty in nuclear reactor benchmark calculations is also presented.« less

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.

Genomicus update 2015: KaryoView and MatrixView provide a genome-wide perspective to multispecies comparative genomics.

PubMed

Louis, Alexandra; Nguyen, Nga Thi Thuy; Muffato, Matthieu; Roest Crollius, Hugues

2015-01-01

The Genomicus web server (http://www.genomicus.biologie.ens.fr/genomicus) is a visualization tool allowing comparative genomics in four different phyla (Vertebrate, Fungi, Metazoan and Plants). It provides access to genomic information from extant species, as well as ancestral gene content and gene order for vertebrates and flowering plants. Here we present the new features available for vertebrate genome with a focus on new graphical tools. The interface to enter the database has been improved, two pairwise genome comparison tools are now available (KaryoView and MatrixView) and the multiple genome comparison tools (PhyloView and AlignView) propose three new kinds of representation and a more intuitive menu. These new developments have been implemented for Genomicus portal dedicated to vertebrates. This allows the analysis of 68 extant animal genomes, as well as 58 ancestral reconstructed genomes. The Genomicus server also provides access to ancestral gene orders, to facilitate evolutionary and comparative genomics studies, as well as computationally predicted regulatory interactions, thanks to the representation of conserved non-coding elements with their putative gene targets. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Distortion Representation of Forecast Errors for Model Skill Assessment and Objective Analysis. Revision 1.12

NASA Technical Reports Server (NTRS)

Hoffman, Ross N.; Nehrkorn, Thomas; Grassotti, Christopher

1997-01-01

We proposed a novel characterization of errors for numerical weather predictions. In its simplest form we decompose the error into a part attributable to phase errors and a remainder. The phase error is represented in the same fashion as a velocity field and is required to vary slowly and smoothly with position. A general distortion representation allows for the displacement and amplification or bias correction of forecast anomalies. Characterizing and decomposing forecast error in this way has two important applications, which we term the assessment application and the objective analysis application. For the assessment application, our approach results in new objective measures of forecast skill which are more in line with subjective measures of forecast skill and which are useful in validating models and diagnosing their shortcomings. With regard to the objective analysis application, meteorological analysis schemes balance forecast error and observational error to obtain an optimal analysis. Presently, representations of the error covariance matrix used to measure the forecast error are severely limited. For the objective analysis application our approach will improve analyses by providing a more realistic measure of the forecast error. We expect, a priori, that our approach should greatly improve the utility of remotely sensed data which have relatively high horizontal resolution, but which are indirectly related to the conventional atmospheric variables. In this project, we are initially focusing on the assessment application, restricted to a realistic but univariate 2-dimensional situation. Specifically, we study the forecast errors of the sea level pressure (SLP) and 500 hPa geopotential height fields for forecasts of the short and medium range. Since the forecasts are generated by the GEOS (Goddard Earth Observing System) data assimilation system with and without ERS 1 scatterometer data, these preliminary studies serve several purposes. They (1) provide a testbed for the use of the distortion representation of forecast errors, (2) act as one means of validating the GEOS data assimilation system and (3) help to describe the impact of the ERS 1 scatterometer data.

Quasiprobability Representations of Quantum Mechanics with Minimal Negativity

NASA Astrophysics Data System (ADS)

Zhu, Huangjun

2016-09-01

Quasiprobability representations, such as the Wigner function, play an important role in various research areas. The inevitable appearance of negativity in such representations is often regarded as a signature of nonclassicality, which has profound implications for quantum computation. However, little is known about the minimal negativity that is necessary in general quasiprobability representations. Here we focus on a natural class of quasiprobability representations that is distinguished by simplicity and economy. We introduce three measures of negativity concerning the representations of quantum states, unitary transformations, and quantum channels, respectively. Quite surprisingly, all three measures lead to the same representations with minimal negativity, which are in one-to-one correspondence with the elusive symmetric informationally complete measurements. In addition, most representations with minimal negativity are automatically covariant with respect to the Heisenberg-Weyl groups. Furthermore, our study reveals an interesting tradeoff between negativity and symmetry in quasiprobability representations.

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.

Deep Learning and Developmental Learning: Emergence of Fine-to-Coarse Conceptual Categories at Layers of Deep Belief Network.

PubMed

Sadeghi, Zahra

2016-09-01

In this paper, I investigate conceptual categories derived from developmental processing in a deep neural network. The similarity matrices of deep representation at each layer of neural network are computed and compared with their raw representation. While the clusters generated by raw representation stand at the basic level of abstraction, conceptual categories obtained from deep representation shows a bottom-up transition procedure. Results demonstrate a developmental course of learning from specific to general level of abstraction through learned layers of representations in a deep belief network. © The Author(s) 2016.

The decay process of rotating unstable systems through the passage time distribution

NASA Astrophysics Data System (ADS)

Jiménez-Aquino, J. I.; Cortés, Emilio; Aquino, N.

2001-05-01

In this work we propose a general scheme to characterize, through the passage time distribution, the decay process of rotational unstable systems in the presence of external forces of large amplitude. The formalism starts with a matricial Langevin type equation formulated in the context of two dynamical representations given, respectively, by the vectors x and y, both related by a time dependent rotation matrix. The transformation preserves the norm of the vector and decouples the set of dynamical equations in the transformed space y. We study the dynamical characterization of the systems of two variables and show that the statistical properties of the passage time distribution are essentially equivalent in both dynamics. The theory is applied to the laser system studied in Dellunde et al. (Opt. Commun. 102 (1993) 277), where the effect of large injected signals on the transient dynamics of the laser has been studied in terms of complex electric field. The analytical results are compared with numerical simulation.