Central Limit Theorems for Linear Statistics of Heavy Tailed Random Matrices

NASA Astrophysics Data System (ADS)

Benaych-Georges, Florent; Guionnet, Alice; Male, Camille

2014-07-01

We show central limit theorems (CLT) for the linear statistics of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of α-stable laws and entries with moments exploding with the dimension, as in the adjacency matrices of Erdös-Rényi graphs. For the second model, we also prove a central limit theorem of the moments of its empirical eigenvalues distribution. The limit laws are Gaussian, but unlike the case of standard Wigner matrices, the normalization is the one of the classical CLT for independent random variables.

Diffusion amid random overlapping obstacles: Similarities, invariants, approximations

PubMed Central

Novak, Igor L.; Gao, Fei; Kraikivski, Pavel; Slepchenko, Boris M.

2011-01-01

Efficient and accurate numerical techniques are used to examine similarities of effective diffusion in a void between random overlapping obstacles: essential invariance of effective diffusion coefficients (Deff) with respect to obstacle shapes and applicability of a two-parameter power law over nearly entire range of excluded volume fractions (ϕ), except for a small vicinity of a percolation threshold. It is shown that while neither of the properties is exact, deviations from them are remarkably small. This allows for quick estimation of void percolation thresholds and approximate reconstruction of Deff (ϕ) for obstacles of any given shape. In 3D, the similarities of effective diffusion yield a simple multiplication “rule” that provides a fast means of estimating Deff for a mixture of overlapping obstacles of different shapes with comparable sizes. PMID:21513372

Large-deviation theory for diluted Wishart random matrices

NASA Astrophysics Data System (ADS)

Castillo, Isaac Pérez; Metz, Fernando L.

2018-03-01

Wishart random matrices with a sparse or diluted structure are ubiquitous in the processing of large datasets, with applications in physics, biology, and economy. In this work, we develop a theory for the eigenvalue fluctuations of diluted Wishart random matrices based on the replica approach of disordered systems. We derive an analytical expression for the cumulant generating function of the number of eigenvalues IN(x ) smaller than x ∈R+ , from which all cumulants of IN(x ) and the rate function Ψx(k ) controlling its large-deviation probability Prob[IN(x ) =k N ] ≍e-N Ψx(k ) follow. Explicit results for the mean value and the variance of IN(x ) , its rate function, and its third cumulant are discussed and thoroughly compared to numerical diagonalization, showing very good agreement. The present work establishes the theoretical framework put forward in a recent letter [Phys. Rev. Lett. 117, 104101 (2016), 10.1103/PhysRevLett.117.104101] as an exact and compelling approach to deal with eigenvalue fluctuations of sparse random matrices.

Realistic Many-Body Quantum Systems vs. Full Random Matrices: Static and Dynamical Properties

NASA Astrophysics Data System (ADS)

Karp, Jonathan; Torres-Herrera, Jonathan; TáVora, Marco; Santos, Lea

We study the static and dynamical properties of isolated spin 1/2 systems as prototypes of many-body quantum systems and compare the results to those of full random matrices from a Gaussian orthogonal ensemble. Full random matrices do not represent realistic systems, because they imply that all particles interact at the same time, as opposed to realistic Hamiltonians, which are sparse and have only few-body interactions. Nevertheless, with full random matrices we can derive analytical results that can be used as references and bounds for the corresponding properties of realistic systems. In particular, we show that the results for the Shannon information entropy are very similar to those for the von Neumann entanglement entropy, with the former being computationally less expensive. We also discuss the behavior of the survival probability of the initial state at different time scales and show that it contains more information about the system than the entropies. Support from the NSF Grant No. DMR-1147430.

Random walk of passive tracers among randomly moving obstacles.

PubMed

Gori, Matteo; Donato, Irene; Floriani, Elena; Nardecchia, Ilaria; Pettini, Marco

2016-04-14

This study is mainly motivated by the need of understanding how the diffusion behavior of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell, whence the possibility of understanding whether or not a randomly walking biomolecule is also subject to a long-range force field driving it to its target. By means of the Continuous Time Random Walk (CTRW) technique the topic of random walk in random environment is here considered in the case of a passively diffusing particle among randomly moving and interacting obstacles. The relevant physical quantity which is worked out is the diffusion coefficient of the passive tracer which is computed as a function of the average inter-obstacles distance. The results reported here suggest that if a biomolecule, let us call it a test molecule, moves towards its target in the presence of other independently interacting molecules, its motion can be considerably slowed down.

Disentangling giant component and finite cluster contributions in sparse random matrix spectra.

PubMed

Kühn, Reimer

2016-04-01

We describe a method for disentangling giant component and finite cluster contributions to sparse random matrix spectra, using sparse symmetric random matrices defined on Erdős-Rényi graphs as an example and test bed. Our methods apply to sparse matrices defined in terms of arbitrary graphs in the configuration model class, as long as they have finite mean degree.

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

DOE PAGES

Ghysels, Pieter; Li, Xiaoye S.; Rouet, Francois -Henry; ...

2016-10-27

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite.more » The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.« less

Random density matrices versus random evolution of open system

NASA Astrophysics Data System (ADS)

Pineda, Carlos; Seligman, Thomas H.

2015-10-01

We present and compare two families of ensembles of random density matrices. The first, static ensemble, is obtained foliating an unbiased ensemble of density matrices. As criterion we use fixed purity as the simplest example of a useful convex function. The second, dynamic ensemble, is inspired in random matrix models for decoherence where one evolves a separable pure state with a random Hamiltonian until a given value of purity in the central system is achieved. Several families of Hamiltonians, adequate for different physical situations, are studied. We focus on a two qubit central system, and obtain exact expressions for the static case. The ensemble displays a peak around Werner-like states, modulated by nodes on the degeneracies of the density matrices. For moderate and strong interactions good agreement between the static and the dynamic ensembles is found. Even in a model where one qubit does not interact with the environment excellent agreement is found, but only if there is maximal entanglement with the interacting one. The discussion is started recalling similar considerations for scattering theory. At the end, we comment on the reach of the results for other convex functions of the density matrix, and exemplify the situation with the von Neumann entropy.

Bi-dimensional null model analysis of presence-absence binary matrices.

PubMed

Strona, Giovanni; Ulrich, Werner; Gotelli, Nicholas J

2018-01-01

Comparing the structure of presence/absence (i.e., binary) matrices with those of randomized counterparts is a common practice in ecology. However, differences in the randomization procedures (null models) can affect the results of the comparisons, leading matrix structural patterns to appear either "random" or not. Subjectivity in the choice of one particular null model over another makes it often advisable to compare the results obtained using several different approaches. Yet, available algorithms to randomize binary matrices differ substantially in respect to the constraints they impose on the discrepancy between observed and randomized row and column marginal totals, which complicates the interpretation of contrasting patterns. This calls for new strategies both to explore intermediate scenarios of restrictiveness in-between extreme constraint assumptions, and to properly synthesize the resulting information. Here we introduce a new modeling framework based on a flexible matrix randomization algorithm (named the "Tuning Peg" algorithm) that addresses both issues. The algorithm consists of a modified swap procedure in which the discrepancy between the row and column marginal totals of the target matrix and those of its randomized counterpart can be "tuned" in a continuous way by two parameters (controlling, respectively, row and column discrepancy). We show how combining the Tuning Peg with a wise random walk procedure makes it possible to explore the complete null space embraced by existing algorithms. This exploration allows researchers to visualize matrix structural patterns in an innovative bi-dimensional landscape of significance/effect size. We demonstrate the rational and potential of our approach with a set of simulated and real matrices, showing how the simultaneous investigation of a comprehensive and continuous portion of the null space can be extremely informative, and possibly key to resolving longstanding debates in the analysis of ecological matrices. © 2017 The Authors. Ecology, published by Wiley Periodicals, Inc., on behalf of the Ecological Society of America.

Universality for 1d Random Band Matrices: Sigma-Model Approximation

NASA Astrophysics Data System (ADS)

Shcherbina, Mariya; Shcherbina, Tatyana

2018-02-01

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233-1260, 2016; Commun Math Phys 351:1009-1044, 2017). We consider random Hermitian block band matrices consisting of W× W random Gaussian blocks (parametrized by j,k \\in Λ =[1,n]^d\\cap Z^d ) with a fixed entry's variance J_{jk}=δ _{j,k}W^{-1}+β Δ _{j,k}W^{-2} , β >0 in each block. Taking the limit W→ ∞ with fixed n and β , we derive the sigma-model approximation of the second correlation function similar to Efetov's one. Then, considering the limit β , n→ ∞, we prove that in the dimension d=1 the behaviour of the sigma-model approximation in the bulk of the spectrum, as β ≫ n , is determined by the classical Wigner-Dyson statistics.

Residence time of symmetric random walkers in a strip with large reflective obstacles

NASA Astrophysics Data System (ADS)

Ciallella, Alessandro; Cirillo, Emilio N. M.; Sohier, Julien

2018-05-01

We study the effect of a large obstacle on the so-called residence time, i.e., the time that a particle performing a symmetric random walk in a rectangular (two-dimensional, 2D) domain needs to cross the strip. We observe complex behavior: We find out that the residence time does not depend monotonically on the geometric properties of the obstacle, such as its width, length, and position. In some cases, due to the presence of the obstacle, the mean residence time is shorter with respect to the one measured for the obstacle-free strip. We explain the residence time behavior by developing a one-dimensional (1D) analog of the 2D model where the role of the obstacle is played by two defect sites having smaller probability to be crossed with respect to all the other regular sites. The 1D and 2D models behave similarly, but in the 1D case we are able to compute exactly the residence time, finding a perfect match with the Monte Carlo simulations.

Fungible Correlation Matrices: A Method for Generating Nonsingular, Singular, and Improper Correlation Matrices for Monte Carlo Research.

PubMed

Waller, Niels G

2016-01-01

For a fixed set of standardized regression coefficients and a fixed coefficient of determination (R-squared), an infinite number of predictor correlation matrices will satisfy the implied quadratic form. I call such matrices fungible correlation matrices. In this article, I describe an algorithm for generating positive definite (PD), positive semidefinite (PSD), or indefinite (ID) fungible correlation matrices that have a random or fixed smallest eigenvalue. The underlying equations of this algorithm are reviewed from both algebraic and geometric perspectives. Two simulation studies illustrate that fungible correlation matrices can be profitably used in Monte Carlo research. The first study uses PD fungible correlation matrices to compare penalized regression algorithms. The second study uses ID fungible correlation matrices to compare matrix-smoothing algorithms. R code for generating fungible correlation matrices is presented in the supplemental materials.

Obstacles of Teaching Mathematics Faced by the Class Teachers in Jordan

ERIC Educational Resources Information Center

Nejem, Khamis Mousa; Muhanna, Waffa

2013-01-01

The purpose of the study is to investigate the obstacles of teaching mathematics faced by the class teachers in Jordan. To achieve this purpose a study sample of 192 male and female class teachers was selected randomly from government schools. The instrument of the study was a questionnaire used to investigate the obstacles of mathematics…

Efficient, massively parallel eigenvalue computation

NASA Technical Reports Server (NTRS)

Huo, Yan; Schreiber, Robert

1993-01-01

In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. An effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD computers, the Maspar MP-1 and MP-2 systems, is described. Results of numerical tests and timings are also presented.

Imparting protean behavior to mobile robots accomplishing patrolling tasks in the presence of adversaries.

PubMed

Curiac, Daniel-Ioan; Volosencu, Constantin

2015-10-08

Providing unpredictable trajectories for patrol robots is essential when coping with adversaries. In order to solve this problem we developed an effective approach based on the known protean behavior of individual prey animals-random zig-zag movement. The proposed bio-inspired method modifies the normal robot's path by incorporating sudden and irregular direction changes without jeopardizing the robot's mission. Such a tactic is aimed to confuse the enemy (e.g. a sniper), offering less time to acquire and retain sight alignment and sight picture. This idea is implemented by simulating a series of fictive-temporary obstacles that will randomly appear in the robot's field of view, deceiving the obstacle avoiding mechanism to react. The new general methodology is particularized by using the Arnold's cat map to obtain the timely random appearance and disappearance of the fictive obstacles. The viability of the proposed method is confirmed through an extensive simulation case study.

Random matrix approach to cross correlations in financial data

NASA Astrophysics Data System (ADS)

Plerou, Vasiliki; Gopikrishnan, Parameswaran; Rosenow, Bernd; Amaral, Luís A.; Guhr, Thomas; Stanley, H. Eugene

2002-06-01

We analyze cross correlations between price fluctuations of different stocks using methods of random matrix theory (RMT). Using two large databases, we calculate cross-correlation matrices C of returns constructed from (i) 30-min returns of 1000 US stocks for the 2-yr period 1994-1995, (ii) 30-min returns of 881 US stocks for the 2-yr period 1996-1997, and (iii) 1-day returns of 422 US stocks for the 35-yr period 1962-1996. We test the statistics of the eigenvalues λi of C against a ``null hypothesis'' - a random correlation matrix constructed from mutually uncorrelated time series. We find that a majority of the eigenvalues of C fall within the RMT bounds [λ-,λ+] for the eigenvalues of random correlation matrices. We test the eigenvalues of C within the RMT bound for universal properties of random matrices and find good agreement with the results for the Gaussian orthogonal ensemble of random matrices-implying a large degree of randomness in the measured cross-correlation coefficients. Further, we find that the distribution of eigenvector components for the eigenvectors corresponding to the eigenvalues outside the RMT bound display systematic deviations from the RMT prediction. In addition, we find that these ``deviating eigenvectors'' are stable in time. We analyze the components of the deviating eigenvectors and find that the largest eigenvalue corresponds to an influence common to all stocks. Our analysis of the remaining deviating eigenvectors shows distinct groups, whose identities correspond to conventionally identified business sectors. Finally, we discuss applications to the construction of portfolios of stocks that have a stable ratio of risk to return.

Quantum-inspired algorithm for estimating the permanent of positive semidefinite matrices

NASA Astrophysics Data System (ADS)

Chakhmakhchyan, L.; Cerf, N. J.; Garcia-Patron, R.

2017-08-01

We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the permanent of a Hermitian positive semidefinite matrix can be expressed in terms of the expected value of a random variable, which stands for a specific photon-counting probability when measuring a linear-optically evolved random multimode coherent state. Our algorithm then approximates the matrix permanent from the corresponding sample mean and is shown to run in polynomial time for various sets of Hermitian positive semidefinite matrices, achieving a precision that improves over known techniques. This work illustrates how quantum optics may benefit algorithm development.

A matrix contraction process

NASA Astrophysics Data System (ADS)

Wilkinson, Michael; Grant, John

2018-03-01

We consider a stochastic process in which independent identically distributed random matrices are multiplied and where the Lyapunov exponent of the product is positive. We continue multiplying the random matrices as long as the norm, ɛ, of the product is less than unity. If the norm is greater than unity we reset the matrix to a multiple of the identity and then continue the multiplication. We address the problem of determining the probability density function of the norm, \

Suspension Matrices for Improved Schwann-Cell Survival after Implantation into the Injured Rat Spinal Cord

PubMed Central

Patel, Vivek; Joseph, Gravil; Patel, Amit; Patel, Samik; Bustin, Devin; Mawson, David; Tuesta, Luis M.; Puentes, Rocio; Ghosh, Mousumi

2010-01-01

Abstract Trauma to the spinal cord produces endogenously irreversible tissue and functional loss, requiring the application of therapeutic approaches to achieve meaningful restoration. Cellular strategies, in particular Schwann-cell implantation, have shown promise in overcoming many of the obstacles facing successful repair of the injured spinal cord. Here, we show that the implantation of Schwann cells as cell suspensions with in-situ gelling laminin:collagen matrices after spinal-cord contusion significantly enhances long-term cell survival but not proliferation, as well as improves graft vascularization and the degree of axonal in-growth over the standard implantation vehicle, minimal media. The use of a matrix to suspend cells prior to implantation should be an important consideration for achieving improved survival and effectiveness of cellular therapies for future clinical application. PMID:20144012

Derivatives of random matrix characteristic polynomials with applications to elliptic curves

NASA Astrophysics Data System (ADS)

Snaith, N. C.

2005-12-01

The value distribution of derivatives of characteristic polynomials of matrices from SO(N) is calculated at the point 1, the symmetry point on the unit circle of the eigenvalues of these matrices. We consider subsets of matrices from SO(N) that are constrained to have at least n eigenvalues equal to 1 and investigate the first non-zero derivative of the characteristic polynomial at that point. The connection between the values of random matrix characteristic polynomials and values of L-functions in families has been well established. The motivation for this work is the expectation that through this connection with L-functions derived from families of elliptic curves, and using the Birch and Swinnerton-Dyer conjecture to relate values of the L-functions to the rank of elliptic curves, random matrix theory will be useful in probing important questions concerning these ranks.

Computation of transform domain covariance matrices

NASA Technical Reports Server (NTRS)

Fino, B. J.; Algazi, V. R.

1975-01-01

It is often of interest in applications to compute the covariance matrix of a random process transformed by a fast unitary transform. Here, the recursive definition of fast unitary transforms is used to derive recursive relations for the covariance matrices of the transformed process. These relations lead to fast methods of computation of covariance matrices and to substantial reductions of the number of arithmetic operations required.

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

Ghysels, Pieter; Li, Xiaoye S.; Rouet, Francois -Henry

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite.more » The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.« less

Intermittency and random matrices

NASA Astrophysics Data System (ADS)

Sokoloff, Dmitry; Illarionov, E. A.

2015-08-01

A spectacular phenomenon of intermittency, i.e. a progressive growth of higher statistical moments of a physical field excited by an instability in a random medium, attracted the attention of Zeldovich in the last years of his life. At that time, the mathematical aspects underlying the physical description of this phenomenon were still under development and relations between various findings in the field remained obscure. Contemporary results from the theory of the product of independent random matrices (the Furstenberg theory) allowed the elaboration of the phenomenon of intermittency in a systematic way. We consider applications of the Furstenberg theory to some problems in cosmology and dynamo theory.

Obstacle Characterization in a Geocrowdsourced Accessibility System

NASA Astrophysics Data System (ADS)

Qin, H.; Aburizaiza, A. O.; Rice, R. M.; Paez, F.; Rice, M. T.

2015-08-01

Transitory obstacles - random, short-lived and unpredictable objects - are difficult to capture in any traditional mapping system, yet they have significant negative impacts on the accessibility of mobility- and visually-impaired individuals. These transitory obstacles include sidewalk obstructions, construction detours, and poor surface conditions. To identify these obstacles and assist the navigation of mobility- and visually- impaired individuals, crowdsourced mapping applications have been developed to harvest and analyze the volunteered obstacles reports from local students, faculty, staff, and residents. In this paper, we introduce a training program designed and implemented for recruiting and motivating contributors to participate in our geocrowdsourced accessibility system, and explore the quality of geocrowdsourced data with a comparative analysis methodology.

Neopolyploidy and diversification in Heuchera grossulariifolia

PubMed Central

Oswald, Benjamin P.; Nuismer, Scott L.

2013-01-01

Newly formed polyploid lineages must contend with several obstacles to avoid extinction, including minority cytotype exclusion, competition, and inbreeding depression. If polyploidization results in immediate divergence of phenotypic characters these hurdles may be reduced and establishment made more likely. In addition, if polyploidization alters the phenotypic and genotypic associations between traits, i.e. the P and G matrices, polyploids may be able to explore novel evolutionary paths, facilitating their divergence and successful establishment. Here we report results from a study of the perennial plant Heuchera grossulariifolia in which the phenotypic divergence and changes in phenotypic and genotypic covariance matrices caused by neopolyploidization have been estimated. Our results reveal that polyploidization causes immediate divergence for traits relevant to establishment and results in significant changes in the structure of the phenotypic covariance matrix. In contrast, our results do not provide evidence that polyploidization results in immediate and substantial shifts in the genetic covariance matrix. PMID:21143472

Finite-range Coulomb gas models of banded random matrices and quantum kicked rotors

NASA Astrophysics Data System (ADS)

Pandey, Akhilesh; Kumar, Avanish; Puri, Sanjay

2017-11-01

Dyson demonstrated an equivalence between infinite-range Coulomb gas models and classical random matrix ensembles for the study of eigenvalue statistics. We introduce finite-range Coulomb gas (FRCG) models via a Brownian matrix process, and study them analytically and by Monte Carlo simulations. These models yield new universality classes, and provide a theoretical framework for the study of banded random matrices (BRMs) and quantum kicked rotors (QKRs). We demonstrate that, for a BRM of bandwidth b and a QKR of chaos parameter α , the appropriate FRCG model has the effective range d =b2/N =α2/N , for large N matrix dimensionality. As d increases, there is a transition from Poisson to classical random matrix statistics.

Finite-range Coulomb gas models of banded random matrices and quantum kicked rotors.

PubMed

Pandey, Akhilesh; Kumar, Avanish; Puri, Sanjay

2017-11-01

Dyson demonstrated an equivalence between infinite-range Coulomb gas models and classical random matrix ensembles for the study of eigenvalue statistics. We introduce finite-range Coulomb gas (FRCG) models via a Brownian matrix process, and study them analytically and by Monte Carlo simulations. These models yield new universality classes, and provide a theoretical framework for the study of banded random matrices (BRMs) and quantum kicked rotors (QKRs). We demonstrate that, for a BRM of bandwidth b and a QKR of chaos parameter α, the appropriate FRCG model has the effective range d=b^{2}/N=α^{2}/N, for large N matrix dimensionality. As d increases, there is a transition from Poisson to classical random matrix statistics.

Computer-Access-Code Matrices

NASA Technical Reports Server (NTRS)

Collins, Earl R., Jr.

1990-01-01

Authorized users respond to changing challenges with changing passwords. Scheme for controlling access to computers defeats eavesdroppers and "hackers". Based on password system of challenge and password or sign, challenge, and countersign correlated with random alphanumeric codes in matrices of two or more dimensions. Codes stored on floppy disk or plug-in card and changed frequently. For even higher security, matrices of four or more dimensions used, just as cubes compounded into hypercubes in concurrent processing.

Simple techniques for improving deep neural network outcomes on commodity hardware

NASA Astrophysics Data System (ADS)

Colina, Nicholas Christopher A.; Perez, Carlos E.; Paraan, Francis N. C.

2017-08-01

We benchmark improvements in the performance of deep neural networks (DNN) on the MNIST data test upon imple-menting two simple modifications to the algorithm that have little overhead computational cost. First is GPU parallelization on a commodity graphics card, and second is initializing the DNN with random orthogonal weight matrices prior to optimization. Eigenspectra analysis of the weight matrices reveal that the initially orthogonal matrices remain nearly orthogonal after training. The probability distributions from which these orthogonal matrices are drawn are also shown to significantly affect the performance of these deep neural networks.

New distributed fusion filtering algorithm based on covariances over sensor networks with random packet dropouts

NASA Astrophysics Data System (ADS)

Caballero-Águila, R.; Hermoso-Carazo, A.; Linares-Pérez, J.

2017-07-01

This paper studies the distributed fusion estimation problem from multisensor measured outputs perturbed by correlated noises and uncertainties modelled by random parameter matrices. Each sensor transmits its outputs to a local processor over a packet-erasure channel and, consequently, random losses may occur during transmission. Different white sequences of Bernoulli variables are introduced to model the transmission losses. For the estimation, each lost output is replaced by its estimator based on the information received previously, and only the covariances of the processes involved are used, without requiring the signal evolution model. First, a recursive algorithm for the local least-squares filters is derived by using an innovation approach. Then, the cross-correlation matrices between any two local filters is obtained. Finally, the distributed fusion filter weighted by matrices is obtained from the local filters by applying the least-squares criterion. The performance of the estimators and the influence of both sensor uncertainties and transmission losses on the estimation accuracy are analysed in a numerical example.

Obstacles in Using Randomization Tests in Single-Case Experimentation.

ERIC Educational Resources Information Center

Kazdin, Alan E.

1980-01-01

Problems associated with randomization tests in single- case experiments are discussed. This article follows a discussion of randomization tests in single case studies in the same issue of this journal. (See TM 505 799; 505 801).(Author/JKS)

Aquatic obstacle training improves freezing of gait in Parkinson's disease patients: a randomized controlled trial.

PubMed

Zhu, Zhizhong; Yin, Miaomiao; Cui, Liling; Zhang, Ying; Hou, Weijia; Li, Yaqing; Zhao, Hua

2018-01-01

Our aim was to evaluate the effect of aquatic obstacle training on balance parameters in comparison with a traditional aquatic therapy in patients with Parkinson's disease. A randomized single-blind controlled trial. Outpatients in the rehabilitation department. A total of 46 patients with Parkinson's disease in Hoehn-Yahr stage 2-3. Participants were randomly assigned to (1) aquatic therapy or (2) obstacle aquatic therapy. All participants undertook aquatic therapy for 30 minutes, five times per week for six weeks. The Freezing of Gait Questionnaire, Functional Reach Test, Timed Up and Go test and Berg Balance Scale were assessed at baseline, posttreatment and at six-month follow-up. Both groups of patients had improved primary outcomes after the training program. A between-group comparison of the changes revealed that obstacle aquatic therapy was significantly higher for the Freezing of Gait Questionnaire (after treatment: 8.7 ± 3.3 vs 6.2 ± 2.1, P = 0.004; posttest: 7.7 ± 3.1 vs 5.3 ± 2.0, P = 0.003) and Timed Up and Go test (after treatment: 17.1 ± 2.9 vs 13.8 ± 1.9, P < 0.001; posttest: 16.3 ± 2.8 vs 12.9 ± 1.4, P < 0.001). Obstacle aquatic therapy in this protocol seems to be more effective than traditional protocols for gait and balance in patients with Parkinson's disease, and the effect lasts for six months.

Allowing for Correlations between Correlations in Random-Effects Meta-Analysis of Correlation Matrices

ERIC Educational Resources Information Center

Prevost, A. Toby; Mason, Dan; Griffin, Simon; Kinmonth, Ann-Louise; Sutton, Stephen; Spiegelhalter, David

2007-01-01

Practical meta-analysis of correlation matrices generally ignores covariances (and hence correlations) between correlation estimates. The authors consider various methods for allowing for covariances, including generalized least squares, maximum marginal likelihood, and Bayesian approaches, illustrated using a 6-dimensional response in a series of…

Dimension from covariance matrices.

PubMed

Carroll, T L; Byers, J M

2017-02-01

We describe a method to estimate embedding dimension from a time series. This method includes an estimate of the probability that the dimension estimate is valid. Such validity estimates are not common in algorithms for calculating the properties of dynamical systems. The algorithm described here compares the eigenvalues of covariance matrices created from an embedded signal to the eigenvalues for a covariance matrix of a Gaussian random process with the same dimension and number of points. A statistical test gives the probability that the eigenvalues for the embedded signal did not come from the Gaussian random process.

Emergence of a spectral gap in a class of random matrices associated with split graphs

NASA Astrophysics Data System (ADS)

Bassler, Kevin E.; Zia, R. K. P.

2018-01-01

Motivated by the intriguing behavior displayed in a dynamic network that models a population of extreme introverts and extroverts (XIE), we consider the spectral properties of ensembles of random split graph adjacency matrices. We discover that, in general, a gap emerges in the bulk spectrum between -1 and 0 that contains a single eigenvalue. An analytic expression for the bulk distribution is derived and verified with numerical analysis. We also examine their relation to chiral ensembles, which are associated with bipartite graphs.

Communication Optimal Parallel Multiplication of Sparse Random Matrices

DTIC Science & Technology

2013-02-21

Definition 2.1), and (2) the algorithm is sparsity- independent, where the computation is statically partitioned to processors independent of the sparsity...struc- ture of the input matrices (see Definition 2.5). The second assumption applies to nearly all existing al- gorithms for general sparse matrix-matrix...where A and B are n× n ER(d) matrices: Definition 2.1 An ER(d) matrix is an adjacency matrix of an Erdős-Rényi graph with parameters n and d/n. That

Learn to Avoid or Overcome Leadership Obstacles

ERIC Educational Resources Information Center

D'Auria, John

2015-01-01

Leadership is increasingly recognized as an important factor in moving schools forward, yet we have been relatively random in how we prepare and support them. Four obstacles often block or diminish their effectiveness. Avoiding or overcoming each of these requires an underlying set of skills and knowledge that we believe can be learned and…

Partial transpose of random quantum states: Exact formulas and meanders

NASA Astrophysics Data System (ADS)

Fukuda, Motohisa; Śniady, Piotr

2013-04-01

We investigate the asymptotic behavior of the empirical eigenvalues distribution of the partial transpose of a random quantum state. The limiting distribution was previously investigated via Wishart random matrices indirectly (by approximating the matrix of trace 1 by the Wishart matrix of random trace) and shown to be the semicircular distribution or the free difference of two free Poisson distributions, depending on how dimensions of the concerned spaces grow. Our use of Wishart matrices gives exact combinatorial formulas for the moments of the partial transpose of the random state. We find three natural asymptotic regimes in terms of geodesics on the permutation groups. Two of them correspond to the above two cases; the third one turns out to be a new matrix model for the meander polynomials. Moreover, we prove the convergence to the semicircular distribution together with its extreme eigenvalues under weaker assumptions, and show large deviation bound for the latter.

RANDOM MATRIX DIAGONALIZATION--A COMPUTER PROGRAM

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

Fuchel, K.; Greibach, R.J.; Porter, C.E.

A computer prograra is described which generates random matrices, diagonalizes them and sorts appropriately the resulting eigenvalues and eigenvector components. FAP and FORTRAN listings for the IBM 7090 computer are included. (auth)

Fine structure of spectral properties for random correlation matrices: An application to financial markets

NASA Astrophysics Data System (ADS)

Livan, Giacomo; Alfarano, Simone; Scalas, Enrico

2011-07-01

We study some properties of eigenvalue spectra of financial correlation matrices. In particular, we investigate the nature of the large eigenvalue bulks which are observed empirically, and which have often been regarded as a consequence of the supposedly large amount of noise contained in financial data. We challenge this common knowledge by acting on the empirical correlation matrices of two data sets with a filtering procedure which highlights some of the cluster structure they contain, and we analyze the consequences of such filtering on eigenvalue spectra. We show that empirically observed eigenvalue bulks emerge as superpositions of smaller structures, which in turn emerge as a consequence of cross correlations between stocks. We interpret and corroborate these findings in terms of factor models, and we compare empirical spectra to those predicted by random matrix theory for such models.

On-Chip Neural Data Compression Based On Compressed Sensing With Sparse Sensing Matrices.

PubMed

Zhao, Wenfeng; Sun, Biao; Wu, Tong; Yang, Zhi

2018-02-01

On-chip neural data compression is an enabling technique for wireless neural interfaces that suffer from insufficient bandwidth and power budgets to transmit the raw data. The data compression algorithm and its implementation should be power and area efficient and functionally reliable over different datasets. Compressed sensing is an emerging technique that has been applied to compress various neurophysiological data. However, the state-of-the-art compressed sensing (CS) encoders leverage random but dense binary measurement matrices, which incur substantial implementation costs on both power and area that could offset the benefits from the reduced wireless data rate. In this paper, we propose two CS encoder designs based on sparse measurement matrices that could lead to efficient hardware implementation. Specifically, two different approaches for the construction of sparse measurement matrices, i.e., the deterministic quasi-cyclic array code (QCAC) matrix and -sparse random binary matrix [-SRBM] are exploited. We demonstrate that the proposed CS encoders lead to comparable recovery performance. And efficient VLSI architecture designs are proposed for QCAC-CS and -SRBM encoders with reduced area and total power consumption.

Collective rotations of active particles interacting with obstacles

NASA Astrophysics Data System (ADS)

Mokhtari, Zahra; Aspelmeier, Timo; Zippelius, Annette

2017-10-01

We consider active particles in a heterogeneous medium, modeled by static, random obstacles. In accordance with the known tendency of active particles to cluster, we observe accumulation and crystallization of active particles around the obstacles which serve as nucleation sites. In the limit of high activity, the crystals start to rotate spontaneously, resembling a rotating rigid body. We trace the occurrence of these oscillations to the enhanced attraction of particles whose orientation points along the rotational velocity as compared to those whose orientation points in the opposite direction.

Optical image encryption using triplet of functions

NASA Astrophysics Data System (ADS)

Yatish; Fatima, Areeba; Nishchal, Naveen Kumar

2018-03-01

We propose an image encryption scheme that brings into play a technique using a triplet of functions to manipulate complex-valued functions. Optical cryptosystems using this method are an easier approach toward the ciphertext generation that avoids the use of holographic setup to record phase. The features of this method were shown in the context of double random phase encoding and phase-truncated Fourier transform-based cryptosystems using gyrator transform. In the first step, the complex function is split into two matrices. These matrices are separated, so they contain the real and imaginary parts. In the next step, these two matrices and a random distribution function are acted upon by one of the functions in the triplet. During decryption, the other two functions in the triplet help us retrieve the complex-valued function. The simulation results demonstrate the effectiveness of the proposed idea. To check the robustness of the proposed scheme, attack analyses were carried out.

Fluctuations of Wigner-type random matrices associated with symmetric spaces of class DIII and CI

NASA Astrophysics Data System (ADS)

Stolz, Michael

2018-02-01

Wigner-type randomizations of the tangent spaces of classical symmetric spaces can be thought of as ordinary Wigner matrices on which additional symmetries have been imposed. In particular, they fall within the scope of a framework, due to Schenker and Schulz-Baldes, for the study of fluctuations of Wigner matrices with additional dependencies among their entries. In this contribution, we complement the results of these authors by explicit calculations of the asymptotic covariances for symmetry classes DIII and CI and thus obtain explicit CLTs for these classes. On the technical level, the present work is an exercise in controlling the cumulative effect of systematically occurring sign factors in an involved sum of products by setting up a suitable combinatorial model for the summands. This aspect may be of independent interest. Research supported by Deutsche Forschungsgemeinschaft (DFG) via SFB 878.

Using distributed partial memories to improve self-organizing collective movements.

PubMed

Winder, Ransom; Reggia, James A

2004-08-01

Past self-organizing models of collectively moving "particles" (simulated bird flocks, fish schools, etc.) have typically been based on purely reflexive agents that have no significant memory of past movements. We hypothesized that giving such individual particles a limited distributed memory of past obstacles they encountered could lead to significantly faster travel between goal destinations. Systematic computational experiments using six terrains that had different arrangements of obstacles demonstrated that, at least in some domains, this conjecture is true. Furthermore, these experiments demonstrated that improved performance over time came not only from the avoidance of previously seen obstacles, but also (surprisingly) immediately after first encountering obstacles due to decreased delays in circumventing those obstacles. Simulations also showed that, of the four strategies we tested for removal of remembered obstacles when memory was full and a new obstacle was to be saved, none was better than random selection. These results may be useful in interpreting future experimental research on group movements in biological populations, and in improving existing methodologies for control of collective movements in computer graphics, robotic teams, particle swarm optimization, and computer games.

A Monocular Vision Sensor-Based Obstacle Detection Algorithm for Autonomous Robots.

PubMed

Lee, Tae-Jae; Yi, Dong-Hoon; Cho, Dong-Il Dan

2016-03-01

This paper presents a monocular vision sensor-based obstacle detection algorithm for autonomous robots. Each individual image pixel at the bottom region of interest is labeled as belonging either to an obstacle or the floor. While conventional methods depend on point tracking for geometric cues for obstacle detection, the proposed algorithm uses the inverse perspective mapping (IPM) method. This method is much more advantageous when the camera is not high off the floor, which makes point tracking near the floor difficult. Markov random field-based obstacle segmentation is then performed using the IPM results and a floor appearance model. Next, the shortest distance between the robot and the obstacle is calculated. The algorithm is tested by applying it to 70 datasets, 20 of which include nonobstacle images where considerable changes in floor appearance occur. The obstacle segmentation accuracies and the distance estimation error are quantitatively analyzed. For obstacle datasets, the segmentation precision and the average distance estimation error of the proposed method are 81.4% and 1.6 cm, respectively, whereas those for a conventional method are 57.5% and 9.9 cm, respectively. For nonobstacle datasets, the proposed method gives 0.0% false positive rates, while the conventional method gives 17.6%.

Neopolyploidy and diversification in Heuchera grossulariifolia.

PubMed

Oswald, Benjamin P; Nuismer, Scott L

2011-06-01

Newly formed polyploid lineages must contend with several obstacles to avoid extinction, including minority cytotype exclusion, competition, and inbreeding depression. If polyploidization results in immediate divergence of phenotypic characters these hurdles may be reduced and establishment made more likely. In addition, if polyploidization alters the phenotypic and genotypic associations between traits, that is, the P and G matrices, polyploids may be able to explore novel evolutionary paths, facilitating their divergence and successful establishment. Here, we report results from a study of the perennial plant Heuchera grossulariifolia in which the phenotypic divergence and changes in phenotypic and genotypic covariance matrices caused by neopolyploidization have been estimated. Our results reveal that polyploidization causes immediate divergence for traits relevant to establishment and results in significant changes in the structure of the phenotypic covariance matrix. In contrast, our results do not provide evidence that polyploidization results in immediate and substantial shifts in the genetic covariance matrix. © 2010 The Author(s). Evolution© 2010 The Society for the Study of Evolution.

BCH codes for large IC random-access memory systems

NASA Technical Reports Server (NTRS)

Lin, S.; Costello, D. J., Jr.

1983-01-01

In this report some shortened BCH codes for possible applications to large IC random-access memory systems are presented. These codes are given by their parity-check matrices. Encoding and decoding of these codes are discussed.

Large leptonic Dirac CP phase from broken democracy with random perturbations

NASA Astrophysics Data System (ADS)

Ge, Shao-Feng; Kusenko, Alexander; Yanagida, Tsutomu T.

2018-06-01

A large value of the leptonic Dirac CP phase can arise from broken democracy, where the mass matrices are democratic up to small random perturbations. Such perturbations are a natural consequence of broken residual S3 symmetries that dictate the democratic mass matrices at leading order. With random perturbations, the leptonic Dirac CP phase has a higher probability to attain a value around ± π / 2. Comparing with the anarchy model, broken democracy can benefit from residual S3 symmetries, and it can produce much better, realistic predictions for the mass hierarchy, mixing angles, and Dirac CP phase in both quark and lepton sectors. Our approach provides a general framework for a class of models in which a residual symmetry determines the general features at leading order, and where, in the absence of other fundamental principles, the symmetry breaking appears in the form of random perturbations.

Anomalous diffusion due to hindering by mobile obstacles undergoing Brownian motion or Orstein-Ulhenbeck processes.

PubMed

Berry, Hugues; Chaté, Hugues

2014-02-01

In vivo measurements of the passive movements of biomolecules or vesicles in cells consistently report "anomalous diffusion," where mean-squared displacements scale as a power law of time with exponent α<1 (subdiffusion). While the detailed mechanisms causing such behaviors are not always elucidated, movement hindrance by obstacles is often invoked. However, our understanding of how hindered diffusion leads to subdiffusion is based on diffusion amidst randomly located immobile obstacles. Here, we have used Monte Carlo simulations to investigate transient subdiffusion due to mobile obstacles with various modes of mobility. Our simulations confirm that the anomalous regimes rapidly disappear when the obstacles move by Brownian motion. By contrast, mobile obstacles with more confined displacements, e.g., Orstein-Ulhenbeck motion, are shown to preserve subdiffusive regimes. The mean-squared displacement of tracked protein displays convincing power laws with anomalous exponent α that varies with the density of Orstein-Ulhenbeck (OU) obstacles or the relaxation time scale of the OU process. In particular, some of the values we observed are significantly below the universal value predicted for immobile obstacles in two dimensions. Therefore, our results show that subdiffusion due to mobile obstacles with OU type of motion may account for the large variation range exhibited by experimental measurements in living cells and may explain that some experimental estimates are below the universal value predicted for immobile obstacles.

Hurwitz numbers and products of random matrices

NASA Astrophysics Data System (ADS)

Orlov, A. Yu.

2017-09-01

We study multimatrix models, which may be viewed as integrals of products of tau functions depending on the eigenvalues of products of random matrices. We consider tau functions of the two-component Kadomtsev-Petviashvili (KP) hierarchy (semi-infinite relativistic Toda lattice) and of the B-type KP (BKP) hierarchy introduced by Kac and van de Leur. Such integrals are sometimes tau functions themselves. We consider models that generate Hurwitz numbers HE,F, where E is the Euler characteristic of the base surface and F is the number of branch points. We show that in the case where the integrands contain the product of n > 2 matrices, the integral generates Hurwitz numbers with E ≤ 2 and F ≤ n+2. Both the numbers E and F depend both on n and on the order of the factors in the matrix product. The Euler characteristic E can be either an even or an odd number, i.e., it can match both orientable and nonorientable (Klein) base surfaces depending on the presence of the tau function of the BKP hierarchy in the integrand. We study two cases, the products of complex and the products of unitary matrices.

Search efficiency of biased migration towards stationary or moving targets in heterogeneously structured environments

NASA Astrophysics Data System (ADS)

Azimzade, Youness; Mashaghi, Alireza

2017-12-01

Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously structured environment where obstacles limit migration. An open generic question is whether random or directionally biased motions or a combination of both provide an optimal search efficiency and how that depends on the motility and density of targets and obstacles. To address this question, we develop a simple model that involves a random walker searching for its targets in a heterogeneous medium of bond percolation square lattice and used mean first passage time (〈T 〉 ) as an indication of average search time. Our analysis reveals a dual effect of directional bias on the minimum value of 〈T 〉 . For a homogeneous medium, directionality always decreases 〈T 〉 and a pure directional migration (a ballistic motion) serves as the optimized strategy, while for a heterogeneous environment, we find that the optimized strategy involves a combination of directed and random migrations. The relative contribution of these modes is determined by the density of obstacles and motility of targets. Existence of randomness and motility of targets add to the efficiency of search. Our study reveals generic and simple rules that govern search efficiency. Our findings might find application in a number of areas including immunology, cell biology, ecology, and robotics.

A new phase of disordered phonons modelled by random matrices

NASA Astrophysics Data System (ADS)

Schmittner, Sebastian; Zirnbauer, Martin

2015-03-01

Starting from the clean harmonic crystal and not invoking two-level systems, we propose a model for phonons in a disordered solid. In this model the strength of mass and spring constant disorder can be increased separately. Both types of disorder are modelled by random matrices that couple the degrees of freedom locally. Treated in coherent potential approximation (CPA), the speed of sound decreases with increasing disorder until it reaches zero at finite disorder strength. There, a critical transition to a strong disorder phase occurs. In this novel phase, we find the density of states at zero energy in three dimensions to be finite, leading to a linear temperature dependence of the heat capacity, as observed experimentally for vitreous systems. For any disorder strength, our model is stable, i.e. masses and spring constants are positive, and there are no runaway dynamics. This is ensured by using appropriate probability distributions, inspired by Wishart ensembles, for the random matrices. The CPA self-consistency equations are derived in a very accessible way using planar diagrams. The talk focuses on the model and the results. The first author acknowledges financial support by the Deutsche Telekom Stiftung.

Random matrix theory of singular values of rectangular complex matrices I: Exact formula of one-body distribution function in fixed-trace ensemble

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

Adachi, Satoshi; Toda, Mikito; Kubotani, Hiroto

The fixed-trace ensemble of random complex matrices is the fundamental model that excellently describes the entanglement in the quantum states realized in a coupled system by its strongly chaotic dynamical evolution [see H. Kubotani, S. Adachi, M. Toda, Phys. Rev. Lett. 100 (2008) 240501]. The fixed-trace ensemble fully takes into account the conservation of probability for quantum states. The present paper derives for the first time the exact analytical formula of the one-body distribution function of singular values of random complex matrices in the fixed-trace ensemble. The distribution function of singular values (i.e. Schmidt eigenvalues) of a quantum state ismore » so important since it describes characteristics of the entanglement in the state. The derivation of the exact analytical formula utilizes two recent achievements in mathematics, which appeared in 1990s. The first is the Kaneko theory that extends the famous Selberg integral by inserting a hypergeometric type weight factor into the integrand to obtain an analytical formula for the extended integral. The second is the Petkovsek-Wilf-Zeilberger theory that calculates definite hypergeometric sums in a closed form.« less

Clogging and depinning of ballistic active matter systems in disordered media

NASA Astrophysics Data System (ADS)

Reichhardt, C.; Reichhardt, C. J. O.

2018-05-01

We numerically examine ballistic active disks driven through a random obstacle array. Formation of a pinned or clogged state occurs at much lower obstacle densities for the active disks than for passive disks. As a function of obstacle density, we identify several distinct phases including a depinned fluctuating cluster state, a pinned single-cluster or jammed state, a pinned multicluster state, a pinned gel state, and a pinned disordered state. At lower active disk densities, a drifting uniform liquid forms in the absence of obstacles, but when even a small number of obstacles are introduced, the disks organize into a pinned phase-separated cluster state in which clusters nucleate around the obstacles, similar to a wetting phenomenon. We examine how the depinning threshold changes as a function of disk or obstacle density and find a crossover from a collectively pinned cluster state to a disordered plastic depinning transition as a function of increasing obstacle density. We compare this to the behavior of nonballistic active particles and show that as we vary the activity from completely passive to completely ballistic, a clogged phase-separated state appears in both the active and passive limits, while for intermediate activity, a readily flowing liquid state appears and there is an optimal activity level that maximizes the flux through the sample.

A Monocular Vision Sensor-Based Obstacle Detection Algorithm for Autonomous Robots

PubMed Central

Lee, Tae-Jae; Yi, Dong-Hoon; Cho, Dong-Il “Dan”

2016-01-01

This paper presents a monocular vision sensor-based obstacle detection algorithm for autonomous robots. Each individual image pixel at the bottom region of interest is labeled as belonging either to an obstacle or the floor. While conventional methods depend on point tracking for geometric cues for obstacle detection, the proposed algorithm uses the inverse perspective mapping (IPM) method. This method is much more advantageous when the camera is not high off the floor, which makes point tracking near the floor difficult. Markov random field-based obstacle segmentation is then performed using the IPM results and a floor appearance model. Next, the shortest distance between the robot and the obstacle is calculated. The algorithm is tested by applying it to 70 datasets, 20 of which include nonobstacle images where considerable changes in floor appearance occur. The obstacle segmentation accuracies and the distance estimation error are quantitatively analyzed. For obstacle datasets, the segmentation precision and the average distance estimation error of the proposed method are 81.4% and 1.6 cm, respectively, whereas those for a conventional method are 57.5% and 9.9 cm, respectively. For nonobstacle datasets, the proposed method gives 0.0% false positive rates, while the conventional method gives 17.6%. PMID:26938540

Diffusion, subdiffusion, and localization of active colloids in random post lattices

NASA Astrophysics Data System (ADS)

Morin, Alexandre; Lopes Cardozo, David; Chikkadi, Vijayakumar; Bartolo, Denis

2017-10-01

Combining experiments and theory, we address the dynamics of self-propelled particles in crowded environments. We first demonstrate that motile colloids cruising at constant speed through random lattices undergo a smooth transition from diffusive to subdiffusive to localized dynamics upon increasing the obstacle density. We then elucidate the nature of these transitions by performing extensive simulations constructed from a detailed analysis of the colloid-obstacle interactions. We evidence that repulsion at a distance and hard-core interactions both contribute to slowing down the long-time diffusion of the colloids. In contrast, the localization transition stems solely from excluded-volume interactions and occurs at the void-percolation threshold. Within this critical scenario, equivalent to that of the random Lorentz gas, genuine asymptotic subdiffusion is found only at the critical density where the motile particles explore a fractal maze.

Effective Brownian ratchet separation by a combination of molecular filtering and a self-spreading lipid bilayer system.

PubMed

Motegi, Toshinori; Nabika, Hideki; Fu, Yingqiang; Chen, Lili; Sun, Yinlu; Zhao, Jianwei; Murakoshi, Kei

2014-07-01

A new molecular manipulation method in the self-spreading lipid bilayer membrane by combining Brownian ratchet and molecular filtering effects is reported. The newly designed ratchet obstacle was developed to effectively separate dye-lipid molecules. The self-spreading lipid bilayer acted as both a molecular transport system and a manipulation medium. By controlling the size and shape of ratchet obstacles, we achieved a significant increase in the separation angle for dye-lipid molecules compared to that with the previous ratchet obstacle. A clear difference was observed between the experimental results and the simple random walk simulation that takes into consideration only the geometrical effect of the ratchet obstacles. This difference was explained by considering an obstacle-dependent local decrease in molecular diffusivity near the obstacles, known as the molecular filtering effect at nanospace. Our experimental findings open up a novel controlling factor in the Brownian ratchet manipulation that allow the efficient separation of molecules in the lipid bilayer based on the combination of Brownian ratchet and molecular filtering effects.

Temporal evolution of financial-market correlations.

PubMed

Fenn, Daniel J; Porter, Mason A; Williams, Stacy; McDonald, Mark; Johnson, Neil F; Jones, Nick S

2011-08-01

We investigate financial market correlations using random matrix theory and principal component analysis. We use random matrix theory to demonstrate that correlation matrices of asset price changes contain structure that is incompatible with uncorrelated random price changes. We then identify the principal components of these correlation matrices and demonstrate that a small number of components accounts for a large proportion of the variability of the markets that we consider. We characterize the time-evolving relationships between the different assets by investigating the correlations between the asset price time series and principal components. Using this approach, we uncover notable changes that occurred in financial markets and identify the assets that were significantly affected by these changes. We show in particular that there was an increase in the strength of the relationships between several different markets following the 2007-2008 credit and liquidity crisis.

Temporal evolution of financial-market correlations

NASA Astrophysics Data System (ADS)

Fenn, Daniel J.; Porter, Mason A.; Williams, Stacy; McDonald, Mark; Johnson, Neil F.; Jones, Nick S.

2011-08-01

We investigate financial market correlations using random matrix theory and principal component analysis. We use random matrix theory to demonstrate that correlation matrices of asset price changes contain structure that is incompatible with uncorrelated random price changes. We then identify the principal components of these correlation matrices and demonstrate that a small number of components accounts for a large proportion of the variability of the markets that we consider. We characterize the time-evolving relationships between the different assets by investigating the correlations between the asset price time series and principal components. Using this approach, we uncover notable changes that occurred in financial markets and identify the assets that were significantly affected by these changes. We show in particular that there was an increase in the strength of the relationships between several different markets following the 2007-2008 credit and liquidity crisis.

The performance of the Congruence Among Distance Matrices (CADM) test in phylogenetic analysis

PubMed Central

2011-01-01

Background CADM is a statistical test used to estimate the level of Congruence Among Distance Matrices. It has been shown in previous studies to have a correct rate of type I error and good power when applied to dissimilarity matrices and to ultrametric distance matrices. Contrary to most other tests of incongruence used in phylogenetic analysis, the null hypothesis of the CADM test assumes complete incongruence of the phylogenetic trees instead of congruence. In this study, we performed computer simulations to assess the type I error rate and power of the test. It was applied to additive distance matrices representing phylogenies and to genetic distance matrices obtained from nucleotide sequences of different lengths that were simulated on randomly generated trees of varying sizes, and under different evolutionary conditions. Results Our results showed that the test has an accurate type I error rate and good power. As expected, power increased with the number of objects (i.e., taxa), the number of partially or completely congruent matrices and the level of congruence among distance matrices. Conclusions Based on our results, we suggest that CADM is an excellent candidate to test for congruence and, when present, to estimate its level in phylogenomic studies where numerous genes are analysed simultaneously. PMID:21388552

Products of random matrices from fixed trace and induced Ginibre ensembles

NASA Astrophysics Data System (ADS)

Akemann, Gernot; Cikovic, Milan

2018-05-01

We investigate the microcanonical version of the complex induced Ginibre ensemble, by introducing a fixed trace constraint for its second moment. Like for the canonical Ginibre ensemble, its complex eigenvalues can be interpreted as a two-dimensional Coulomb gas, which are now subject to a constraint and a modified, collective confining potential. Despite the lack of determinantal structure in this fixed trace ensemble, we compute all its density correlation functions at finite matrix size and compare to a fixed trace ensemble of normal matrices, representing a different Coulomb gas. Our main tool of investigation is the Laplace transform, that maps back the fixed trace to the induced Ginibre ensemble. Products of random matrices have been used to study the Lyapunov and stability exponents for chaotic dynamical systems, where the latter are based on the complex eigenvalues of the product matrix. Because little is known about the universality of the eigenvalue distribution of such product matrices, we then study the product of m induced Ginibre matrices with a fixed trace constraint—which are clearly non-Gaussian—and M  ‑  m such Ginibre matrices without constraint. Using an m-fold inverse Laplace transform, we obtain a concise result for the spectral density of such a mixed product matrix at finite matrix size, for arbitrary fixed m and M. Very recently local and global universality was proven by the authors and their coworker for a more general, single elliptic fixed trace ensemble in the bulk of the spectrum. Here, we argue that the spectral density of mixed products is in the same universality class as the product of M independent induced Ginibre ensembles.

Noisy covariance matrices and portfolio optimization

NASA Astrophysics Data System (ADS)

Pafka, S.; Kondor, I.

2002-05-01

According to recent findings [#!bouchaud!#,#!stanley!#], empirical covariance matrices deduced from financial return series contain such a high amount of noise that, apart from a few large eigenvalues and the corresponding eigenvectors, their structure can essentially be regarded as random. In [#!bouchaud!#], e.g., it is reported that about 94% of the spectrum of these matrices can be fitted by that of a random matrix drawn from an appropriately chosen ensemble. In view of the fundamental role of covariance matrices in the theory of portfolio optimization as well as in industry-wide risk management practices, we analyze the possible implications of this effect. Simulation experiments with matrices having a structure such as described in [#!bouchaud!#,#!stanley!#] lead us to the conclusion that in the context of the classical portfolio problem (minimizing the portfolio variance under linear constraints) noise has relatively little effect. To leading order the solutions are determined by the stable, large eigenvalues, and the displacement of the solution (measured in variance) due to noise is rather small: depending on the size of the portfolio and on the length of the time series, it is of the order of 5 to 15%. The picture is completely different, however, if we attempt to minimize the variance under non-linear constraints, like those that arise e.g. in the problem of margin accounts or in international capital adequacy regulation. In these problems the presence of noise leads to a serious instability and a high degree of degeneracy of the solutions.

Reply to ``Comment on `Free surface Hele-Shaw flows around an obstacle: A random walk simulation' ''

NASA Astrophysics Data System (ADS)

Bogoyavlenskiy, Vladislav A.; Cotts, Eric J.

2007-09-01

As pointed out by Vasconcelos in his Comment, our computer simulations of Hele-Shaw flows around series of wedges differ from analytical solutions existing for this problem. We attribute the discrepancy to the notion that these analytical solutions correspond to ideal, steady-state flow regimes which are hardly applicable when a rigid obstacle interacts with a moving liquid-gas interface.

Learning in the Machine: Random Backpropagation and the Deep Learning Channel.

PubMed

Baldi, Pierre; Sadowski, Peter; Lu, Zhiqin

2018-07-01

Random backpropagation (RBP) is a variant of the backpropagation algorithm for training neural networks, where the transpose of the forward matrices are replaced by fixed random matrices in the calculation of the weight updates. It is remarkable both because of its effectiveness, in spite of using random matrices to communicate error information, and because it completely removes the taxing requirement of maintaining symmetric weights in a physical neural system. To better understand random backpropagation, we first connect it to the notions of local learning and learning channels. Through this connection, we derive several alternatives to RBP, including skipped RBP (SRPB), adaptive RBP (ARBP), sparse RBP, and their combinations (e.g. ASRBP) and analyze their computational complexity. We then study their behavior through simulations using the MNIST and CIFAR-10 bechnmark datasets. These simulations show that most of these variants work robustly, almost as well as backpropagation, and that multiplication by the derivatives of the activation functions is important. As a follow-up, we study also the low-end of the number of bits required to communicate error information over the learning channel. We then provide partial intuitive explanations for some of the remarkable properties of RBP and its variations. Finally, we prove several mathematical results, including the convergence to fixed points of linear chains of arbitrary length, the convergence to fixed points of linear autoencoders with decorrelated data, the long-term existence of solutions for linear systems with a single hidden layer and convergence in special cases, and the convergence to fixed points of non-linear chains, when the derivative of the activation functions is included.

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

An assessment of auditory-guided locomotion in an obstacle circumvention task.

PubMed

Kolarik, Andrew J; Scarfe, Amy C; Moore, Brian C J; Pardhan, Shahina

2016-06-01

This study investigated how effectively audition can be used to guide navigation around an obstacle. Ten blindfolded normally sighted participants navigated around a 0.6 × 2 m obstacle while producing self-generated mouth click sounds. Objective movement performance was measured using a Vicon motion capture system. Performance with full vision without generating sound was used as a baseline for comparison. The obstacle's location was varied randomly from trial to trial: it was either straight ahead or 25 cm to the left or right relative to the participant. Although audition provided sufficient information to detect the obstacle and guide participants around it without collision in the majority of trials, buffer space (clearance between the shoulder and obstacle), overall movement times, and number of velocity corrections were significantly (p < 0.05) greater with auditory guidance than visual guidance. Collisions sometime occurred under auditory guidance, suggesting that audition did not always provide an accurate estimate of the space between the participant and obstacle. Unlike visual guidance, participants did not always walk around the side that afforded the most space during auditory guidance. Mean buffer space was 1.8 times higher under auditory than under visual guidance. Results suggest that sound can be used to generate buffer space when vision is unavailable, allowing navigation around an obstacle without collision in the majority of trials.

A comparative study on managers', staffs' and clients' viewpoints about organizational and structural obstacles in family planning counseling in health-care centers in Isfahan in 2012.

PubMed

Taheri, Safoura; Ehsanpour, Soheila; Kohan, Shahnaz

2014-03-01

Organizational and structural obstacles are a group of major obstacles in achievement of appropriate family planning counseling. Detection of these obstacles from the viewpoint of managers, staffs and clients who are key members in health services providing system is a major step toward appropriate planning to modify or delete this group of obstacles. The present study was conducted with the goal of comparing managers', staffs' and clients' viewpoints about organizational and structural obstacles in family planning counseling in health-care centers in Isfahan in 2012. This is a cross-sectional one-step three-group comparative descriptive study conducted on 295 subjects including 59 managers, 110 staffs and 126 clients in medical health-care centers in Isfahan in 2012. Managers and the staffs were selected by census sampling and the clients were recruited through convenient random sampling. The date collection tool was a researcher made questionnaire, which was designed in two sections of fertility and personal characteristics and viewpoint measurement. Descriptive and inferential statistical test were used to analyze the data. The obtained results showed no significant difference between mean scores of viewpoints in three groups of managers, staffs and clients concerning organizational and structural obstacles in family planning counseling (P = 0.677). In addition, most of the managers, staffs and clients reported organizational and structural obstacles as the obstacles in the process of family planning in moderate level. The results showed the necessity of health services managers' planning to modify or delete organizational and structural obstacles especially the agreed obstacles from the viewpoint of managers, staffs and clients.

A comparison of SuperLU solvers on the intel MIC architecture

NASA Astrophysics Data System (ADS)

Tuncel, Mehmet; Duran, Ahmet; Celebi, M. Serdar; Akaydin, Bora; Topkaya, Figen O.

2016-10-01

In many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2D problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from UFMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential SuperLU benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.

SMERFS: Stochastic Markov Evaluation of Random Fields on the Sphere

NASA Astrophysics Data System (ADS)

Creasey, Peter; Lang, Annika

2018-04-01

SMERFS (Stochastic Markov Evaluation of Random Fields on the Sphere) creates large realizations of random fields on the sphere. It uses a fast algorithm based on Markov properties and fast Fourier Transforms in 1d that generates samples on an n X n grid in O(n2 log n) and efficiently derives the necessary conditional covariance matrices.

Random matrices and the New York City subway system

NASA Astrophysics Data System (ADS)

Jagannath, Aukosh; Trogdon, Thomas

2017-09-01

We analyze subway arrival times in the New York City subway system. We find regimes where the gaps between trains are well modeled by (unitarily invariant) random matrix statistics and Poisson statistics. The departure from random matrix statistics is captured by the value of the Coulomb potential along the subway route. This departure becomes more pronounced as trains make more stops.

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

Forrester, Peter J., E-mail: p.forrester@ms.unimelb.edu.au; Thompson, Colin J.

The Golden-Thompson inequality, Tr (e{sup A+B}) ⩽ Tr (e{sup A}e{sup B}) for A, B Hermitian matrices, appeared in independent works by Golden and Thompson published in 1965. Both of these were motivated by considerations in statistical mechanics. In recent years the Golden-Thompson inequality has found applications to random matrix theory. In this article, we detail some historical aspects relating to Thompson's work, giving in particular a hitherto unpublished proof due to Dyson, and correspondence with Pólya. We show too how the 2 × 2 case relates to hyperbolic geometry, and how the original inequality holds true with the trace operation replaced bymore » any unitarily invariant norm. In relation to the random matrix applications, we review its use in the derivation of concentration type lemmas for sums of random matrices due to Ahlswede-Winter, and Oliveira, generalizing various classical results.« less

QMC Goes BOINC: Using Public Resource Computing to Perform Quantum Monte Carlo Calculations

NASA Astrophysics Data System (ADS)

Rainey, Cameron; Engelhardt, Larry; Schröder, Christian; Hilbig, Thomas

2008-10-01

Theoretical modeling of magnetic molecules traditionally involves the diagonalization of quantum Hamiltonian matrices. However, as the complexity of these molecules increases, the matrices become so large that this process becomes unusable. An additional challenge to this modeling is that many repetitive calculations must be performed, further increasing the need for computing power. Both of these obstacles can be overcome by using a quantum Monte Carlo (QMC) method and a distributed computing project. We have recently implemented a QMC method within the Spinhenge@home project, which is a Public Resource Computing (PRC) project where private citizens allow part-time usage of their PCs for scientific computing. The use of PRC for scientific computing will be described in detail, as well as how you can contribute to the project. See, e.g., L. Engelhardt, et. al., Angew. Chem. Int. Ed. 47, 924 (2008). C. Schröoder, in Distributed & Grid Computing - Science Made Transparent for Everyone. Principles, Applications and Supporting Communities. (Weber, M.H.W., ed., 2008). Project URL: http://spin.fh-bielefeld.de

Using Randomized Controlled Trials to Evaluate Interventions for Releasing Prisoners

ERIC Educational Resources Information Center

Pettus-Davis, Carrie; Howard, Matthew Owen; Dunnigan, Allison; Scheyett, Anna M.; Roberts-Lewis, Amelia

2016-01-01

Randomized controlled trials (RCTs) are rarely used to evaluate social and behavioral interventions designed for releasing prisoners. Objective: We use a pilot RCT of a social support intervention (Support Matters) as a case example to discuss obstacles and strategies for conducting RCT intervention evaluations that span prison and community…

Factors influencing the recruitment and retention of literacy learners in Oman

NASA Astrophysics Data System (ADS)

Al-Barwani, Thuwayba; Kelly, Edward F.

1985-12-01

The study investigates factors influencing the recruitment and retention of learners in the national adult literacy programme in Oman. Personal interviews were conducted in the interior and Capital regions of Oman (N=102). Respondents included 46 randomly selected enrolled learners, 26 randomly selected dropouts and 30 unenrolled adults. Results of the interviews were content-analyzed and frequencies, cross tabulations and Chi-square were calculated. Findings indicated regional differences in the adults' motivation for enrolling, but the spiritual motive was over all the most significant. Men and women reported different patterns of conflict and obstacles in completing their literacy studies: Men indicated work demands as their biggest obstacle while women complained about family responsibilities. Programme attrition was mainly attributed to structural characteristics of the programme.

A Geometrical Framework for Covariance Matrices of Continuous and Categorical Variables

ERIC Educational Resources Information Center

Vernizzi, Graziano; Nakai, Miki

2015-01-01

It is well known that a categorical random variable can be represented geometrically by a simplex. Accordingly, several measures of association between categorical variables have been proposed and discussed in the literature. Moreover, the standard definitions of covariance and correlation coefficient for continuous random variables have been…

Negative differential mobility and trapping in active matter systems

NASA Astrophysics Data System (ADS)

Reichhardt, C.; Reichhardt, C. J. O.

2018-01-01

Using simulations, we examine the average velocity as a function of applied drift force for active matter particles moving through a random obstacle array. We find that for low drift force, there is an initial flow regime where the mobility increases linearly with drive, while for higher drift forces a regime of negative differential mobility appears in which the velocity decreases with increasing drive due to the trapping of active particles behind obstacles. A fully clogged regime exists at very high drift forces when all the particles are permanently trapped behind obstacles. We find for increasing activity that the overall mobility is nonmonotonic, with an enhancement of the mobility for small levels of activity and a decrease in mobility for large activity levels. We show how these effects evolve as a function of disk and obstacle density, active run length, drift force, and motor force.

Correlations of RMT characteristic polynomials and integrability: Hermitean matrices

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

Osipov, Vladimir Al., E-mail: Vladimir.Osipov@uni-due.d; Kanzieper, Eugene, E-mail: Eugene.Kanzieper@hit.ac.i; Department of Physics of Complex Systems, Weizmann Institute of Science, Rehovot 76100

Integrable theory is formulated for correlation functions of characteristic polynomials associated with invariant non-Gaussian ensembles of Hermitean random matrices. By embedding the correlation functions of interest into a more general theory of {tau} functions, we (i) identify a zoo of hierarchical relations satisfied by {tau} functions in an abstract infinite-dimensional space and (ii) present a technology to translate these relations into hierarchically structured nonlinear differential equations describing the correlation functions of characteristic polynomials in the physical, spectral space. Implications of this formalism for fermionic, bosonic, and supersymmetric variations of zero-dimensional replica field theories are discussed at length. A particular emphasismore » is placed on the phenomenon of fermionic-bosonic factorisation of random-matrix-theory correlation functions.« less

A Note on Parameters of Random Substitutions by γ-Diagonal Matrices

NASA Astrophysics Data System (ADS)

Kang, Ju-Sung

Random substitutions are very useful and practical method for privacy-preserving schemes. In this paper we obtain the exact relationship between the estimation errors and three parameters used in the random substitutions, namely the privacy assurance metric γ, the total number n of data records, and the size N of transition matrix. We also demonstrate some simulations concerning the theoretical result.

Key-Generation Algorithms for Linear Piece In Hand Matrix Method

NASA Astrophysics Data System (ADS)

Tadaki, Kohtaro; Tsujii, Shigeo

The linear Piece In Hand (PH, for short) matrix method with random variables was proposed in our former work. It is a general prescription which can be applicable to any type of multivariate public-key cryptosystems for the purpose of enhancing their security. Actually, we showed, in an experimental manner, that the linear PH matrix method with random variables can certainly enhance the security of HFE against the Gröbner basis attack, where HFE is one of the major variants of multivariate public-key cryptosystems. In 1998 Patarin, Goubin, and Courtois introduced the plus method as a general prescription which aims to enhance the security of any given MPKC, just like the linear PH matrix method with random variables. In this paper we prove the equivalence between the plus method and the primitive linear PH matrix method, which is introduced by our previous work to explain the notion of the PH matrix method in general in an illustrative manner and not for a practical use to enhance the security of any given MPKC. Based on this equivalence, we show that the linear PH matrix method with random variables has the substantial advantage over the plus method with respect to the security enhancement. In the linear PH matrix method with random variables, the three matrices, including the PH matrix, play a central role in the secret-key and public-key. In this paper, we clarify how to generate these matrices and thus present two probabilistic polynomial-time algorithms to generate these matrices. In particular, the second one has a concise form, and is obtained as a byproduct of the proof of the equivalence between the plus method and the primitive linear PH matrix method.

Not all that glitters is RMT in the forecasting of risk of portfolios in the Brazilian stock market

NASA Astrophysics Data System (ADS)

Sandoval, Leonidas; Bortoluzzo, Adriana Bruscato; Venezuela, Maria Kelly

2014-09-01

Using stocks of the Brazilian stock exchange (BM&F-Bovespa), we build portfolios of stocks based on Markowitz's theory and test the predicted and realized risks. This is done using the correlation matrices between stocks, and also using Random Matrix Theory in order to clean such correlation matrices from noise. We also calculate correlation matrices using a regression model in order to remove the effect of common market movements and their cleaned versions using Random Matrix Theory. This is done for years of both low and high volatility of the Brazilian stock market, from 2004 to 2012. The results show that the use of regression to subtract the market effect on returns greatly increases the accuracy of the prediction of risk, and that, although the cleaning of the correlation matrix often leads to portfolios that better predict risks, in periods of high volatility of the market this procedure may fail to do so. The results may be used in the assessment of the true risks when one builds a portfolio of stocks during periods of crisis.

Does physical exercise improve obstacle negotiation in the elderly? A systematic review.

PubMed

Guadagnin, Eliane C; da Rocha, Emmanuel S; Duysens, Jacques; Carpes, Felipe P

2016-01-01

Physical exercise improves walking in the elderly but much less is known about its effect on more challenged gait, such as obstacle negotiation. We conducted a systematic review to discuss the effects of regular physical exercise on kinematics and kinetics of obstacle negotiation in the elderly. A comprehensive literature search revealed 859 citations for review, whereof 206 studies entered the full-text analysis. After application of inclusion and exclusion criteria, 13 studies were included in this systematic review. Most of them presented a reasonable quality (average 0.68) but none of them reached the level of a randomized control trial. Interventions were heterogeneous, with training periods lasting from 5 days to 10 months. Studies assessed obstacle negotiation basically considering 3 types of testing paradigm, namely a walkway with either a single obstacle crossing, or with multiple obstacles, or else a treadmill with an obstacle avoidance task under time pressure. In general, longer training programs had better results and very short ones were not effective. A weekly frequency of 2-3 times was the most common among the studies showing positive effects. Regardless of exercises types performed, most of them were effective and so far, there is no consensus about the best exercise for improving obstacle negotiation. A lack of studies on this topic still is evident. Including a record of fall score can further help in deciding which programs are to be preferred. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Asymmetric correlation matrices: an analysis of financial data

NASA Astrophysics Data System (ADS)

Livan, G.; Rebecchi, L.

2012-06-01

We analyse the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non-symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random matrix theory results on the average eigenvalue density of this type of matrix to distinguish between noise and non-trivial correlation structures, and we focus on financial data as a case study. Namely, we employ daily prices of stocks belonging to the American and British stock exchanges, and look for the emergence of correlations between two such markets in the eigenvalue spectrum of their non-symmetric correlation matrix. We find several non trivial results when considering time-lagged correlations over short lags, and we corroborate our findings by additionally studying the asymmetric correlation matrix of the principal components of our datasets.

Kinematic effect of Nintendo WiiTM sports program exercise on obstacle gait in elderly women with falling risk

PubMed Central

Jung, Dae-In; Ko, Dae-Sik; Jeong, Mi-Ae

2015-01-01

[Purpose] This study evaluated the changes in balance ability and obstacle gait after lumbar stabilization exercise and Nintendo WiiTM Sports in elderly at risk for falls. [Subjects and Methods] Twenty-four elderly women with at risk for falls were randomly divided into the control, lumbar stabilization exercise, and Nintendo Wii Sports groups. Static balance was measured by the Berg Balance Scale and functional reach test, dynamic balance by the timed up-and-go test, and obstacle negotiation function by crossing velocity and maximum vertical heel clearance. [Results] Both the lumbar stabilization exercise and Nintendo Wii Sports groups showed significant improvements in obstacle negotiation function after the exercise compared to the control group. Berg Balance Scale and functional reach test scores were greater in the lumbar stabilization exercise group, while the timed up-and-go test time was significantly better in the Nintendo Wii Sports groups. [Conclusion] Lumbar stabilization exercises and Nintendo Wii Sports improve falling related balance and obstacle negotiation function in elderly women at risk for falls. PMID:26157228

Kinematic effect of Nintendo Wii(TM) sports program exercise on obstacle gait in elderly women with falling risk.

PubMed

Jung, Dae-In; Ko, Dae-Sik; Jeong, Mi-Ae

2015-05-01

[Purpose] This study evaluated the changes in balance ability and obstacle gait after lumbar stabilization exercise and Nintendo Wii(TM) Sports in elderly at risk for falls. [Subjects and Methods] Twenty-four elderly women with at risk for falls were randomly divided into the control, lumbar stabilization exercise, and Nintendo Wii Sports groups. Static balance was measured by the Berg Balance Scale and functional reach test, dynamic balance by the timed up-and-go test, and obstacle negotiation function by crossing velocity and maximum vertical heel clearance. [Results] Both the lumbar stabilization exercise and Nintendo Wii Sports groups showed significant improvements in obstacle negotiation function after the exercise compared to the control group. Berg Balance Scale and functional reach test scores were greater in the lumbar stabilization exercise group, while the timed up-and-go test time was significantly better in the Nintendo Wii Sports groups. [Conclusion] Lumbar stabilization exercises and Nintendo Wii Sports improve falling related balance and obstacle negotiation function in elderly women at risk for falls.

Random-Effects Models for Meta-Analytic Structural Equation Modeling: Review, Issues, and Illustrations

ERIC Educational Resources Information Center

Cheung, Mike W.-L.; Cheung, Shu Fai

2016-01-01

Meta-analytic structural equation modeling (MASEM) combines the techniques of meta-analysis and structural equation modeling for the purpose of synthesizing correlation or covariance matrices and fitting structural equation models on the pooled correlation or covariance matrix. Both fixed-effects and random-effects models can be defined in MASEM.…

Modeling fluid diffusion in cerebral white matter with random walks in complex environments

NASA Astrophysics Data System (ADS)

Levy, Amichai; Cwilich, Gabriel; Buldyrev, Sergey V.; Weeden, Van J.

2012-02-01

Recent studies with diffusion MRI have shown new aspects of geometric order in the brain, including complex path coherence within the cerebral cortex, and organization of cerebral white matter and connectivity across multiple scales. The main assumption of these studies is that water molecules diffuse along myelin sheaths of neuron axons in the white matter and thus the anisotropy of their diffusion tensor observed by MRI can provide information about the direction of the axons connecting different parts of the brain. We model the diffusion of particles confined in the space of between the bundles of cylindrical obstacles representing fibrous structures of various orientations. We have investigated the directional properties of the diffusion, by studying the angular distribution of the end point of the random walks as a function of their length, to understand the scale over which the distribution randomizes. We will show evidence of qualitative change in the behavior of the diffusion for different volume fractions of obstacles. Comparisons with three-dimensional MRI images will be illustrated.

Dimensional study of the dynamical arrest in a random Lorentz gas.

PubMed

Jin, Yuliang; Charbonneau, Patrick

2015-04-01

The random Lorentz gas (RLG) is a minimal model for transport in heterogeneous media. Upon increasing the obstacle density, it exhibits a growing subdiffusive transport regime and then a dynamical arrest. Here, we study the dimensional dependence of the dynamical arrest, which can be mapped onto the void percolation transition for Poisson-distributed point obstacles. We numerically determine the arrest in dimensions d=2-6. Comparison of the results with standard mode-coupling theory reveals that the dynamical theory prediction grows increasingly worse with d. In an effort to clarify the origin of this discrepancy, we relate the dynamical arrest in the RLG to the dynamic glass transition of the infinite-range Mari-Kurchan-model glass former. Through a mixed static and dynamical analysis, we then extract an improved dimensional scaling form as well as a geometrical upper bound for the arrest. The results suggest that understanding the asymptotic behavior of the random Lorentz gas may be key to surmounting fundamental difficulties with the mode-coupling theory of glasses.

Obstacle crossing with dual tasking is a danger for individuals with Alzheimer's disease and for healthy older people.

PubMed

Simieli, Lucas; Barbieri, Fabio Augusto; Orcioli-Silva, Diego; Lirani-Silva, Ellen; Stella, Florindo; Gobbi, Lilian Teresa Bucken

2015-01-01

The aim of this study was to analyze the effects of dual tasking on obstacle crossing during walking by individuals with Alzheimer's disease (AD) and by healthy older people. Thirty four elderly individuals (16 healthy subjects and 18 individuals with AD) were recruited to participate in this study. Three AD individuals and one control participant were excluded due to exclusion criteria. The participants were instructed to walk barefoot at their own speed along an 8 m long pathway. Each participant performed five trials for each condition (unobstructed walking, unobstructed walking with dual tasking, and obstacle crossing during walking with dual tasking). The trials were completely randomized for each participant. The mid-pathway stride was measured in the unobstructed walking trials and the stride that occurred during the obstacle avoidance was measured in the trials that involved obstacle crossing. The behavior of the healthy elderly subjects and individuals with AD was similar for obstacle crossing during walking with dual tasking. Both groups used the "posture first" strategy to prioritize stability and showed decreased attention to executive tasking while walking. Additionally, AD had a strong influence on the modifications that are made by the elderly while walking under different walking conditions.

Weighted network analysis of high-frequency cross-correlation measures

NASA Astrophysics Data System (ADS)

Iori, Giulia; Precup, Ovidiu V.

2007-03-01

In this paper we implement a Fourier method to estimate high-frequency correlation matrices from small data sets. The Fourier estimates are shown to be considerably less noisy than the standard Pearson correlation measures and thus capable of detecting subtle changes in correlation matrices with just a month of data. The evolution of correlation at different time scales is analyzed from the full correlation matrix and its minimum spanning tree representation. The analysis is performed by implementing measures from the theory of random weighted networks.

An Interactive Computer Model for Improved Student Understanding of Random Particle Motion and Osmosis

ERIC Educational Resources Information Center

Kottonau, Johannes

2011-01-01

Effectively teaching the concepts of osmosis to college-level students is a major obstacle in biological education. Therefore, a novel computer model is presented that allows students to observe the random nature of particle motion simultaneously with the seemingly directed net flow of water across a semipermeable membrane during osmotic…

Stalled ERP at Random Textiles

ERIC Educational Resources Information Center

Brumberg, Robert; Kops, Eric; Little, Elizabeth; Gamble, George; Underbakke, Jesse; Havelka, Douglas

2016-01-01

Andre Raymond, Executive Vice President of Sales and Marketing for Random Textiles Co. Inc. (RTC), stood in front of the podium to address his team of 70 sales consultants in Las Vegas, NV. The organization had increased market share and achieved record sales over the past three years; however, in the shadow of this success lurked an obstacle that…

Evolutionary Games with Randomly Changing Payoff Matrices

NASA Astrophysics Data System (ADS)

Yakushkina, Tatiana; Saakian, David B.; Bratus, Alexander; Hu, Chin-Kun

2015-06-01

Evolutionary games are used in various fields stretching from economics to biology. In most of these games a constant payoff matrix is assumed, although some works also consider dynamic payoff matrices. In this article we assume a possibility of switching the system between two regimes with different sets of payoff matrices. Potentially such a model can qualitatively describe the development of bacterial or cancer cells with a mutator gene present. A finite population evolutionary game is studied. The model describes the simplest version of annealed disorder in the payoff matrix and is exactly solvable at the large population limit. We analyze the dynamics of the model, and derive the equations for both the maximum and the variance of the distribution using the Hamilton-Jacobi equation formalism.

Generating and using truly random quantum states in Mathematica

NASA Astrophysics Data System (ADS)

Miszczak, Jarosław Adam

2012-01-01

The problem of generating random quantum states is of a great interest from the quantum information theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The described package implements a number of functions for generating random states, which use Quantis QRNG as a source of randomness. It also provides procedures which can be used in simulations not related directly to quantum information processing. Program summaryProgram title: TRQS Catalogue identifier: AEKA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKA_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.: 7924 No. of bytes in distributed program, including test data, etc.: 88 651 Distribution format: tar.gz Programming language: Mathematica, C Computer: Requires a Quantis quantum random number generator (QRNG, http://www.idquantique.com/true-random-number-generator/products-overview.html) and supporting a recent version of Mathematica Operating system: Any platform supporting Mathematica; tested with GNU/Linux (32 and 64 bit) RAM: Case dependent Classification: 4.15 Nature of problem: Generation of random density matrices. Solution method: Use of a physical quantum random number generator. Running time: Generating 100 random numbers takes about 1 second, generating 1000 random density matrices takes more than a minute.

Fidelity decay in interacting two-level boson systems: Freezing and revivals

NASA Astrophysics Data System (ADS)

Benet, Luis; Hernández-Quiroz, Saúl; Seligman, Thomas H.

2011-05-01

We study the fidelity decay in the k-body embedded ensembles of random matrices for bosons distributed in two single-particle states, considering the reference or unperturbed Hamiltonian as the one-body terms and the diagonal part of the k-body embedded ensemble of random matrices and the perturbation as the residual off-diagonal part of the interaction. We calculate the ensemble-averaged fidelity with respect to an initial random state within linear response theory to second order on the perturbation strength and demonstrate that it displays the freeze of the fidelity. During the freeze, the average fidelity exhibits periodic revivals at integer values of the Heisenberg time tH. By selecting specific k-body terms of the residual interaction, we find that the periodicity of the revivals during the freeze of fidelity is an integer fraction of tH, thus relating the period of the revivals with the range of the interaction k of the perturbing terms. Numerical calculations confirm the analytical results.

Eigenvalue density of cross-correlations in Sri Lankan financial market

NASA Astrophysics Data System (ADS)

Nilantha, K. G. D. R.; Ranasinghe; Malmini, P. K. C.

2007-05-01

We apply the universal properties with Gaussian orthogonal ensemble (GOE) of random matrices namely spectral properties, distribution of eigenvalues, eigenvalue spacing predicted by random matrix theory (RMT) to compare cross-correlation matrix estimators from emerging market data. The daily stock prices of the Sri Lankan All share price index and Milanka price index from August 2004 to March 2005 were analyzed. Most eigenvalues in the spectrum of the cross-correlation matrix of stock price changes agree with the universal predictions of RMT. We find that the cross-correlation matrix satisfies the universal properties of the GOE of real symmetric random matrices. The eigen distribution follows the RMT predictions in the bulk but there are some deviations at the large eigenvalues. The nearest-neighbor spacing and the next nearest-neighbor spacing of the eigenvalues were examined and found that they follow the universality of GOE. RMT with deterministic correlations found that each eigenvalue from deterministic correlations is observed at values, which are repelled from the bulk distribution.

Age-related changes in gait adaptability in response to unpredictable obstacles and stepping targets.

PubMed

Caetano, Maria Joana D; Lord, Stephen R; Schoene, Daniel; Pelicioni, Paulo H S; Sturnieks, Daina L; Menant, Jasmine C

2016-05-01

A large proportion of falls in older people occur when walking. Limitations in gait adaptability might contribute to tripping; a frequently reported cause of falls in this group. To evaluate age-related changes in gait adaptability in response to obstacles or stepping targets presented at short notice, i.e.: approximately two steps ahead. Fifty older adults (aged 74±7 years; 34 females) and 21 young adults (aged 26±4 years; 12 females) completed 3 usual gait speed (baseline) trials. They then completed the following randomly presented gait adaptability trials: obstacle avoidance, short stepping target, long stepping target and no target/obstacle (3 trials of each). Compared with the young, the older adults slowed significantly in no target/obstacle trials compared with the baseline trials. They took more steps and spent more time in double support while approaching the obstacle and stepping targets, demonstrated poorer stepping accuracy and made more stepping errors (failed to hit the stepping targets/avoid the obstacle). The older adults also reduced velocity of the two preceding steps and shortened the previous step in the long stepping target condition and in the obstacle avoidance condition. Compared with their younger counterparts, the older adults exhibited a more conservative adaptation strategy characterised by slow, short and multiple steps with longer time in double support. Even so, they demonstrated poorer stepping accuracy and made more stepping errors. This reduced gait adaptability may place older adults at increased risk of falling when negotiating unexpected hazards. Copyright © 2016 Elsevier B.V. All rights reserved.

Do characteristics of a stationary obstacle lead to adjustments in obstacle stepping strategies?

PubMed

Worden, Timothy A; De Jong, Audrey F; Vallis, Lori Ann

2016-01-01

Navigating cluttered and complex environments increases the risk of falling. To decrease this risk, it is important to understand the influence of obstacle visual cues on stepping parameters, however the specific obstacle characteristics that have the greatest influence on avoidance strategies is still under debate. The purpose of the current work is to provide further insight on the relationship between obstacle appearance in the environment and modulation of stepping parameters. Healthy young adults (N=8) first stepped over an obstacle with one visible top edge ("floating"; 8 trials) followed by trials where experimenters randomly altered the location of a ground reference object to one of 7 different positions (8 trials per location), which ranged from 6cm in front of, directly under, or up to 6cm behind the floating obstacle (at 2cm intervals). Mean take-off and landing distance as well as minimum foot clearance values were unchanged across different positions of the ground reference object; a consistent stepping trajectory was observed for all experimental conditions. Contrary to our hypotheses, results of this study indicate that ground based visual cues are not essential for the planning of stepping and clearance strategies. The simultaneous presentation of both floating and ground based objects may have provided critical information that lead to the adoption of a consistent strategy for clearing the top edge of the obstacle. The invariant foot placement observed here may be an appropriate stepping strategy for young adults, however this may not be the case across the lifespan or in special populations. Copyright © 2015 Elsevier B.V. All rights reserved.

Chaos and random matrices in supersymmetric SYK

NASA Astrophysics Data System (ADS)

Hunter-Jones, Nicholas; Liu, Junyu

2018-05-01

We use random matrix theory to explore late-time chaos in supersymmetric quantum mechanical systems. Motivated by the recent study of supersymmetric SYK models and their random matrix classification, we consider the Wishart-Laguerre unitary ensemble and compute the spectral form factors and frame potentials to quantify chaos and randomness. Compared to the Gaussian ensembles, we observe the absence of a dip regime in the form factor and a slower approach to Haar-random dynamics. We find agreement between our random matrix analysis and predictions from the supersymmetric SYK model, and discuss the implications for supersymmetric chaotic systems.

Progress toward Making Epoxy/Carbon-Nanotube Composites

NASA Technical Reports Server (NTRS)

Tiano, Thomas; Roylance, Margaret; Gassner, John; Kyle, William

2008-01-01

A modicum of progress has been made in an effort to exploit single-walled carbon nanotubes as fibers in epoxy-matrix/fiber composite materials. Two main obstacles to such use of carbon nanotubes are the following: (1) bare nanotubes are not soluble in epoxy resins and so they tend to agglomerate instead of becoming dispersed as desired; and (2) because of lack of affinity between nanotubes and epoxy matrices, there is insufficient transfer of mechanical loads between the nanotubes and the matrices. Part of the effort reported here was oriented toward (1) functionalization of single-walled carbon nanotubes with methyl methacrylate (MMA) to increase their dispersability in epoxy resins and increase transfer of mechanical loads and (2) ultrasonic dispersion of the functionalized nanotubes in tetrahydrofuran, which was used as an auxiliary solvent to aid in dispersing the functionalized nanotubes into a epoxy resin. In another part of this effort, poly(styrene sulfonic acid) was used as the dispersant and water as the auxiliary solvent. In one experiment, the strength of composite of epoxy with MMA-functionalized-nanotubes was found to be 29 percent greater than that of a similar composite of epoxy with the same proportion of untreated nanotubes.

Investigation of polymeric scaffold degradation for drug delivery and neovascularization applications

NASA Astrophysics Data System (ADS)

Bulusu, Kartik V.; Alibouzar, Mitra; Castro, Nathan J.; Zhang, Lijie G.; Sarkar, Kausik; Plesniak, Michael W.

2016-11-01

Degradable polymer-based prosthetics for the treatment of osseous tissue defects, maxillo-/cranio-facial trauma and brain injury face two common clinical obstacles impeding efficient tissue engraftment i.e., controlled material release and neovascularization. Ascertaining the time scales of polymer degradation for controlled delivery of drugs and nutrients is critical to treatment efficacy and strategy. We incorporated multiple experimental methodologies to understand the driving forces of transport mechanisms in polyvinyl alcohol-based (PVA) 3D-printed scaffolds of different porosity. Scaffold degradation was monitored various pulsatile flow conditions using MEMS-based pressure catheters and an ultrasonic flow rate sensor. Ultrasonic properties (bulk attenuation and sound velocity) were measured to monitor the degradation process in a static, alkaline medium. Viscosity and the absorption spectra variations with PVA-solute concentrations were measured using a rheometer and a spectrophotometer, respectively. A simple mathematical model based on Fick's law of diffusion provides the fundamental description of solute transport from the scaffold matrices. However, macroscopic material release could become anomalous or non-Fickian in complex polymeric scaffold matrices. Supported by the GW Center for Biomimetics and Bioinspired Engineering and NIH Director's New Innovator Award 1DP2EB020549-01.

The Effect of Obstacle Training in Water on Static Balance of Chronic Stroke Patients

PubMed Central

Jung, JaeHyun; Lee, JiYeun; Chung, EunJung; Kim, Kyoung

2014-01-01

[Purpose] This study evaluated the effects of water and land-based obstacle training on static balance of chronic stroke patients. [Subjects] The subjects were randomly allocated to an aqua group (n=15) and a land group (n=15). [Methods] Both groups trained for 40 minutes, 3 times a week for 12 weeks. Static balance was assessed by measuring the mean velocities of mediolateral (ML) and anteroposterior (AP), and sway area with the eyes closed. [Results] Following the intervention, both groups showed significant changes in ML velocity, AP velocity, and sway area. The static balance of the aqua group was significantly better than the land group. [Conclusion] The results of this study suggest the feasibility and suitability of obstacle training in water for stroke patients. PMID:24707102

An efficient parallel-processing method for transposing large matrices in place.

PubMed

Portnoff, M R

1999-01-01

We have developed an efficient algorithm for transposing large matrices in place. The algorithm is efficient because data are accessed either sequentially in blocks or randomly within blocks small enough to fit in cache, and because the same indexing calculations are shared among identical procedures operating on independent subsets of the data. This inherent parallelism makes the method well suited for a multiprocessor computing environment. The algorithm is easy to implement because the same two procedures are applied to the data in various groupings to carry out the complete transpose operation. Using only a single processor, we have demonstrated nearly an order of magnitude increase in speed over the previously published algorithm by Gate and Twigg for transposing a large rectangular matrix in place. With multiple processors operating in parallel, the processing speed increases almost linearly with the number of processors. A simplified version of the algorithm for square matrices is presented as well as an extension for matrices large enough to require virtual memory.

The feasibility and stability of large complex biological networks: a random matrix approach.

PubMed

Stone, Lewi

2018-05-29

In the 70's, Robert May demonstrated that complexity creates instability in generic models of ecological networks having random interaction matrices A. Similar random matrix models have since been applied in many disciplines. Central to assessing stability is the "circular law" since it describes the eigenvalue distribution for an important class of random matrices A. However, despite widespread adoption, the "circular law" does not apply for ecological systems in which density-dependence operates (i.e., where a species growth is determined by its density). Instead one needs to study the far more complicated eigenvalue distribution of the community matrix S = DA, where D is a diagonal matrix of population equilibrium values. Here we obtain this eigenvalue distribution. We show that if the random matrix A is locally stable, the community matrix S = DA will also be locally stable, providing the system is feasible (i.e., all species have positive equilibria D > 0). This helps explain why, unusually, nearly all feasible systems studied here are locally stable. Large complex systems may thus be even more fragile than May predicted, given the difficulty of assembling a feasible system. It was also found that the degree of stability, or resilience of a system, depended on the minimum equilibrium population.

Random matrix theory analysis of cross-correlations in the US stock market: Evidence from Pearson’s correlation coefficient and detrended cross-correlation coefficient

NASA Astrophysics Data System (ADS)

Wang, Gang-Jin; Xie, Chi; Chen, Shou; Yang, Jiao-Jiao; Yang, Ming-Yan

2013-09-01

In this study, we first build two empirical cross-correlation matrices in the US stock market by two different methods, namely the Pearson’s correlation coefficient and the detrended cross-correlation coefficient (DCCA coefficient). Then, combining the two matrices with the method of random matrix theory (RMT), we mainly investigate the statistical properties of cross-correlations in the US stock market. We choose the daily closing prices of 462 constituent stocks of S&P 500 index as the research objects and select the sample data from January 3, 2005 to August 31, 2012. In the empirical analysis, we examine the statistical properties of cross-correlation coefficients, the distribution of eigenvalues, the distribution of eigenvector components, and the inverse participation ratio. From the two methods, we find some new results of the cross-correlations in the US stock market in our study, which are different from the conclusions reached by previous studies. The empirical cross-correlation matrices constructed by the DCCA coefficient show several interesting properties at different time scales in the US stock market, which are useful to the risk management and optimal portfolio selection, especially to the diversity of the asset portfolio. It will be an interesting and meaningful work to find the theoretical eigenvalue distribution of a completely random matrix R for the DCCA coefficient because it does not obey the Marčenko-Pastur distribution.

Multiscale Modeling of Thermal Conductivity of Polymer/Carbon Nanocomposites

NASA Technical Reports Server (NTRS)

Clancy, Thomas C.; Frankland, Sarah-Jane V.; Hinkley, Jeffrey A.; Gates, Thomas S.

2010-01-01

Molecular dynamics simulation was used to estimate the interfacial thermal (Kapitza) resistance between nanoparticles and amorphous and crystalline polymer matrices. Bulk thermal conductivities of the nanocomposites were then estimated using an established effective medium approach. To study functionalization, oligomeric ethylene-vinyl alcohol copolymers were chemically bonded to a single wall carbon nanotube. The results, in a poly(ethylene-vinyl acetate) matrix, are similar to those obtained previously for grafted linear hydrocarbon chains. To study the effect of noncovalent functionalization, two types of polyethylene matrices. -- aligned (extended-chain crystalline) vs. amorphous (random coils) were modeled. Both matrices produced the same interfacial thermal resistance values. Finally, functionalization of edges and faces of plate-like graphite nanoparticles was found to be only modestly effective in reducing the interfacial thermal resistance and improving the composite thermal conductivity

Lyapunov exponents for one-dimensional aperiodic photonic bandgap structures

NASA Astrophysics Data System (ADS)

Kissel, Glen J.

2011-10-01

Existing in the "gray area" between perfectly periodic and purely randomized photonic bandgap structures are the socalled aperoidic structures whose layers are chosen according to some deterministic rule. We consider here a onedimensional photonic bandgap structure, a quarter-wave stack, with the layer thickness of one of the bilayers subject to being either thin or thick according to five deterministic sequence rules and binary random selection. To produce these aperiodic structures we examine the following sequences: Fibonacci, Thue-Morse, Period doubling, Rudin-Shapiro, as well as the triadic Cantor sequence. We model these structures numerically with a long chain (approximately 5,000,000) of transfer matrices, and then use the reliable algorithm of Wolf to calculate the (upper) Lyapunov exponent for the long product of matrices. The Lyapunov exponent is the statistically well-behaved variable used to characterize the Anderson localization effect (exponential confinement) when the layers are randomized, so its calculation allows us to more precisely compare the purely randomized structure with its aperiodic counterparts. It is found that the aperiodic photonic systems show much fine structure in their Lyapunov exponents as a function of frequency, and, in a number of cases, the exponents are quite obviously fractal.

Convergence in High Probability of the Quantum Diffusion in a Random Band Matrix Model

NASA Astrophysics Data System (ADS)

Margarint, Vlad

2018-06-01

We consider Hermitian random band matrices H in d ≥slant 1 dimensions. The matrix elements H_{xy}, indexed by x, y \\in Λ \\subset Z^d, are independent, uniformly distributed random variable if |x-y| is less than the band width W, and zero otherwise. We update the previous results of the converge of quantum diffusion in a random band matrix model from convergence of the expectation to convergence in high probability. The result is uniformly in the size |Λ| of the matrix.

Rules to fly by: pigeons navigating horizontal obstacles limit steering by selecting gaps most aligned to their flight direction.

PubMed

Ros, Ivo G; Bhagavatula, Partha S; Lin, Huai-Ti; Biewener, Andrew A

2017-02-06

Flying animals must successfully contend with obstacles in their natural environments. Inspired by the robust manoeuvring abilities of flying animals, unmanned aerial systems are being developed and tested to improve flight control through cluttered environments. We previously examined steering strategies that pigeons adopt to fly through an array of vertical obstacles (VOs). Modelling VO flight guidance revealed that pigeons steer towards larger visual gaps when making fast steering decisions. In the present experiments, we recorded three-dimensional flight kinematics of pigeons as they flew through randomized arrays of horizontal obstacles (HOs). We found that pigeons still decelerated upon approach but flew faster through a denser array of HOs compared with the VO array previously tested. Pigeons exhibited limited steering and chose gaps between obstacles most aligned to their immediate flight direction, in contrast to VO navigation that favoured widest gap steering. In addition, pigeons navigated past the HOs with more variable and decreased wing stroke span and adjusted their wing stroke plane to reduce contact with the obstacles. Variability in wing extension, stroke plane and wing stroke path was greater during HO flight. Pigeons also exhibited pronounced head movements when negotiating HOs, which potentially serve a visual function. These head-bobbing-like movements were most pronounced in the horizontal (flight direction) and vertical directions, consistent with engaging motion vision mechanisms for obstacle detection. These results show that pigeons exhibit a keen kinesthetic sense of their body and wings in relation to obstacles. Together with aerodynamic flapping flight mechanics that favours vertical manoeuvring, pigeons are able to navigate HOs using simple rules, with remarkable success.

Virtual Reality-Based Training to Improve Obstacle-Crossing Performance and Dynamic Balance in Patients With Parkinson's Disease.

PubMed

Liao, Ying-Yi; Yang, Yea-Ru; Cheng, Shih-Jung; Wu, Yih-Ru; Fuh, Jong-Ling; Wang, Ray-Yau

2015-08-01

Obstacle crossing is a balance-challenging task and can cause falls in people with Parkinson's disease (PD). However, programs for people with PD that effectively target obstacle crossing and dynamic balance have not been established. To examine the effects of virtual reality-based exercise on obstacle crossing performance and dynamic balance in participants with PD. Thirty-six participants with a diagnosis of PD (Hoehn and Yahr score ranging 1 to 3) were randomly assigned to one of three groups. In the exercise groups, participants received virtual reality-based Wii Fit exercise (VRWii group) or traditional exercise (TE group) for 45 minutes, followed by 15 minutes of treadmill training in each session for a total of 12 sessions over 6 weeks. Participants in the control group received no structured exercise program. Primary outcomes included obstacle crossing performance (crossing velocity, stride length, and vertical toe obstacle clearance) and dynamic balance (maximal excursion, movement velocity, and directional control measured by the limits-of-stability test). Secondary outcomes included sensory organization test (SOT), Parkinson's Disease Questionnaire (PDQ39), fall efficacy scale (FES-I), and timed up and go test (TUG). All outcomes were assessed at baseline, after training, and at 1-month follow-up. The VRWii group showed greater improvement in obstacle crossing velocity, crossing stride length, dynamic balance, SOT, TUG, FES-I, and PDQ39 than the control group. VRWii training also resulted in greater improvement in movement velocity of limits-of-stability test than TE training. VRWii training significantly improved obstacle crossing performance and dynamic balance, supporting implementation of VRWii training in participants with PD. © The Author(s) 2014.

Rules to fly by: pigeons navigating horizontal obstacles limit steering by selecting gaps most aligned to their flight direction

PubMed Central

Ros, Ivo G.; Bhagavatula, Partha S.; Lin, Huai-Ti

2017-01-01

Flying animals must successfully contend with obstacles in their natural environments. Inspired by the robust manoeuvring abilities of flying animals, unmanned aerial systems are being developed and tested to improve flight control through cluttered environments. We previously examined steering strategies that pigeons adopt to fly through an array of vertical obstacles (VOs). Modelling VO flight guidance revealed that pigeons steer towards larger visual gaps when making fast steering decisions. In the present experiments, we recorded three-dimensional flight kinematics of pigeons as they flew through randomized arrays of horizontal obstacles (HOs). We found that pigeons still decelerated upon approach but flew faster through a denser array of HOs compared with the VO array previously tested. Pigeons exhibited limited steering and chose gaps between obstacles most aligned to their immediate flight direction, in contrast to VO navigation that favoured widest gap steering. In addition, pigeons navigated past the HOs with more variable and decreased wing stroke span and adjusted their wing stroke plane to reduce contact with the obstacles. Variability in wing extension, stroke plane and wing stroke path was greater during HO flight. Pigeons also exhibited pronounced head movements when negotiating HOs, which potentially serve a visual function. These head-bobbing-like movements were most pronounced in the horizontal (flight direction) and vertical directions, consistent with engaging motion vision mechanisms for obstacle detection. These results show that pigeons exhibit a keen kinesthetic sense of their body and wings in relation to obstacles. Together with aerodynamic flapping flight mechanics that favours vertical manoeuvring, pigeons are able to navigate HOs using simple rules, with remarkable success. PMID:28163883

A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm.

PubMed

Wei, Kun; Ren, Bingyin

2018-02-13

In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on random sampling has been widely applied in dynamic path planning for a high-dimensional robotic manipulator, especially in a complex environment because of its probability completeness, perfect expansion, and fast exploring speed over other planning methods. However, the existing RRT algorithm has a limitation in path planning for a robotic manipulator in a dynamic unstructured environment. Therefore, an autonomous obstacle avoidance dynamic path-planning method for a robotic manipulator based on an improved RRT algorithm, called Smoothly RRT (S-RRT), is proposed. This method that targets a directional node extends and can increase the sampling speed and efficiency of RRT dramatically. A path optimization strategy based on the maximum curvature constraint is presented to generate a smooth and curved continuous executable path for a robotic manipulator. Finally, the correctness, effectiveness, and practicability of the proposed method are demonstrated and validated via a MATLAB static simulation and a Robot Operating System (ROS) dynamic simulation environment as well as a real autonomous obstacle avoidance experiment in a dynamic unstructured environment for a robotic manipulator. The proposed method not only provides great practical engineering significance for a robotic manipulator's obstacle avoidance in an intelligent factory, but also theoretical reference value for other type of robots' path planning.

Implementation of an Aggressive Random Drug-Testing Policy in a Rural School District: Student Attitudes Regarding Program Fairness and Effectiveness

ERIC Educational Resources Information Center

Evans, Garret D.; Reader, Steven; Liss, Heidi J.; Wiens, Brenda A.; Roy, Antara

2006-01-01

School districts are increasingly initiating random drug-testing (RDT) programs in an effort to curb substance-use rates among students, yet little is known about student attitudes toward RDT and potential obstacles to program acceptance and effectiveness. The authors surveyed 1011 9th through 11th grade students in 2 rural high schools in North…

Note on coefficient matrices from stochastic Galerkin methods for random diffusion equations

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

Zhou Tao, E-mail: tzhou@lsec.cc.ac.c; Tang Tao, E-mail: ttang@hkbu.edu.h

2010-11-01

In a recent work by Xiu and Shen [D. Xiu, J. Shen, Efficient stochastic Galerkin methods for random diffusion equations, J. Comput. Phys. 228 (2009) 266-281], the Galerkin methods are used to solve stochastic diffusion equations in random media, where some properties for the coefficient matrix of the resulting system are provided. They also posed an open question on the properties of the coefficient matrix. In this work, we will provide some results related to the open question.

Singular Behavior of the Leading Lyapunov Exponent of a Product of Random {2 × 2} Matrices

NASA Astrophysics Data System (ADS)

Genovese, Giuseppe; Giacomin, Giambattista; Greenblatt, Rafael Leon

2017-05-01

We consider a certain infinite product of random {2 × 2} matrices appearing in the solution of some 1 and 1 + 1 dimensional disordered models in statistical mechanics, which depends on a parameter ɛ > 0 and on a real random variable with distribution {μ}. For a large class of {μ}, we prove the prediction by Derrida and Hilhorst (J Phys A 16:2641, 1983) that the Lyapunov exponent behaves like {C ɛ^{2 α}} in the limit {ɛ \\searrow 0}, where {α \\in (0,1)} and {C > 0} are determined by {μ}. Derrida and Hilhorst performed a two-scale analysis of the integral equation for the invariant distribution of the Markov chain associated to the matrix product and obtained a probability measure that is expected to be close to the invariant one for small {ɛ}. We introduce suitable norms and exploit contractivity properties to show that such a probability measure is indeed close to the invariant one in a sense that implies a suitable control of the Lyapunov exponent.

A time-series approach to dynamical systems from classical and quantum worlds

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

Fossion, Ruben

2014-01-08

This contribution discusses some recent applications of time-series analysis in Random Matrix Theory (RMT), and applications of RMT in the statistial analysis of eigenspectra of correlation matrices of multivariate time series.

Derivation of an eigenvalue probability density function relating to the Poincaré disk

NASA Astrophysics Data System (ADS)

Forrester, Peter J.; Krishnapur, Manjunath

2009-09-01

A result of Zyczkowski and Sommers (2000 J. Phys. A: Math. Gen. 33 2045-57) gives the eigenvalue probability density function for the top N × N sub-block of a Haar distributed matrix from U(N + n). In the case n >= N, we rederive this result, starting from knowledge of the distribution of the sub-blocks, introducing the Schur decomposition and integrating over all variables except the eigenvalues. The integration is done by identifying a recursive structure which reduces the dimension. This approach is inspired by an analogous approach which has been recently applied to determine the eigenvalue probability density function for random matrices A-1B, where A and B are random matrices with entries standard complex normals. We relate the eigenvalue distribution of the sub-blocks to a many-body quantum state, and to the one-component plasma, on the pseudosphere.

Randomized interpolative decomposition of separated representations

NASA Astrophysics Data System (ADS)

Biagioni, David J.; Beylkin, Daniel; Beylkin, Gregory

2015-01-01

We introduce an algorithm to compute tensor interpolative decomposition (dubbed CTD-ID) for the reduction of the separation rank of Canonical Tensor Decompositions (CTDs). Tensor ID selects, for a user-defined accuracy ɛ, a near optimal subset of terms of a CTD to represent the remaining terms via a linear combination of the selected terms. CTD-ID can be used as an alternative to or in combination with the Alternating Least Squares (ALS) algorithm. We present examples of its use within a convergent iteration to compute inverse operators in high dimensions. We also briefly discuss the spectral norm as a computational alternative to the Frobenius norm in estimating approximation errors of tensor ID. We reduce the problem of finding tensor IDs to that of constructing interpolative decompositions of certain matrices. These matrices are generated via randomized projection of the terms of the given tensor. We provide cost estimates and several examples of the new approach to the reduction of separation rank.

Asymptotic Linear Spectral Statistics for Spiked Hermitian Random Matrices

NASA Astrophysics Data System (ADS)

Passemier, Damien; McKay, Matthew R.; Chen, Yang

2015-07-01

Using the Coulomb Fluid method, this paper derives central limit theorems (CLTs) for linear spectral statistics of three "spiked" Hermitian random matrix ensembles. These include Johnstone's spiked model (i.e., central Wishart with spiked correlation), non-central Wishart with rank-one non-centrality, and a related class of non-central matrices. For a generic linear statistic, we derive simple and explicit CLT expressions as the matrix dimensions grow large. For all three ensembles under consideration, we find that the primary effect of the spike is to introduce an correction term to the asymptotic mean of the linear spectral statistic, which we characterize with simple formulas. The utility of our proposed framework is demonstrated through application to three different linear statistics problems: the classical likelihood ratio test for a population covariance, the capacity analysis of multi-antenna wireless communication systems with a line-of-sight transmission path, and a classical multiple sample significance testing problem.

Fast method to compute scattering by a buried object under a randomly rough surface: PILE combined with FB-SA.

PubMed

Bourlier, Christophe; Kubické, Gildas; Déchamps, Nicolas

2008-04-01

A fast, exact numerical method based on the method of moments (MM) is developed to calculate the scattering from an object below a randomly rough surface. Déchamps et al. [J. Opt. Soc. Am. A23, 359 (2006)] have recently developed the PILE (propagation-inside-layer expansion) method for a stack of two one-dimensional rough interfaces separating homogeneous media. From the inversion of the impedance matrix by block (in which two impedance matrices of each interface and two coupling matrices are involved), this method allows one to calculate separately and exactly the multiple-scattering contributions inside the layer in which the inverses of the impedance matrices of each interface are involved. Our purpose here is to apply this method for an object below a rough surface. In addition, to invert a matrix of large size, the forward-backward spectral acceleration (FB-SA) approach of complexity O(N) (N is the number of unknowns on the interface) proposed by Chou and Johnson [Radio Sci.33, 1277 (1998)] is applied. The new method, PILE combined with FB-SA, is tested on perfectly conducting circular and elliptic cylinders located below a dielectric rough interface obeying a Gaussian process with Gaussian and exponential height autocorrelation functions.

Visual control of foot placement when walking over complex terrain.

PubMed

Matthis, Jonathan S; Fajen, Brett R

2014-02-01

The aim of this study was to investigate the role of visual information in the control of walking over complex terrain with irregularly spaced obstacles. We developed an experimental paradigm to measure how far along the future path people need to see in order to maintain forward progress and avoid stepping on obstacles. Participants walked over an array of randomly distributed virtual obstacles that were projected onto the floor by an LCD projector while their movements were tracked by a full-body motion capture system. Walking behavior in a full-vision control condition was compared with behavior in a number of other visibility conditions in which obstacles did not appear until they fell within a window of visibility centered on the moving observer. Collisions with obstacles were more frequent and, for some participants, walking speed was slower when the visibility window constrained vision to less than two step lengths ahead. When window sizes were greater than two step lengths, the frequency of collisions and walking speed were weakly affected or unaffected. We conclude that visual information from at least two step lengths ahead is needed to guide foot placement when walking over complex terrain. When placed in the context of recent research on the biomechanics of walking, the findings suggest that two step lengths of visual information may be needed because it allows walkers to exploit the passive mechanical forces inherent to bipedal locomotion, thereby avoiding obstacles while maximizing energetic efficiency. PsycINFO Database Record (c) 2014 APA, all rights reserved.

Random matrix approach to plasmon resonances in the random impedance network model of disordered nanocomposites

NASA Astrophysics Data System (ADS)

Olekhno, N. A.; Beltukov, Y. M.

2018-05-01

Random impedance networks are widely used as a model to describe plasmon resonances in disordered metal-dielectric and other two-component nanocomposites. In the present work, the spectral properties of resonances in random networks are studied within the framework of the random matrix theory. We have shown that the appropriate ensemble of random matrices for the considered problem is the Jacobi ensemble (the MANOVA ensemble). The obtained analytical expressions for the density of states in such resonant networks show a good agreement with the results of numerical simulations in a wide range of metal filling fractions 0

Anomalous behaviors during infiltration into heterogeneous porous media

NASA Astrophysics Data System (ADS)

Aarão Reis, F. D. A.; Bolster, D.; Voller, V. R.

2018-03-01

Flow and transport in heterogeneous porous media often exhibit anomalous behavior. A physical analog example is the uni-directional infiltration of a viscous liquid into a horizontal oriented Hele-Shaw cell containing through thickness flow obstacles; a system designed to mimic a gravel/sand medium with impervious inclusions. When there are no obstacles present or the obstacles form a multi-repeating pattern, the change of the length of infiltration F with time t tends to follow a Fickian like scaling, F ∼t1/2 . In the presence of obstacle fields laid out as Sierpinski carpet fractals, infiltration is anomalous, i.e., F ∼ tn, n ≠ 1/2. Here, we study infiltration into such Hele-Shaw cells. First we investigate infiltration into a square cell containing one fractal carpet and make the observation that it is possible to generate both sub (n < 1/2) and super (n > 1/2) diffusive behaviors within identical heterogeneity configurations. We show that this can be explained in terms of a scaling analysis developed from results of random-walk simulations in fractal obstacles; a result indicating that the nature of the domain boundary controls the exponent n of the resulting anomalous transport. Further, we investigate infiltration into a rectangular cell containing several repeats of a given Sierpinski carpet. At very early times, before the liquid encounters any obstacles, the infiltration is Fickian. When the liquid encounters the first (smallest scale) obstacle the infiltration sharply transitions to sub-diffusive. Subsequently, around the time where the liquid has sampled all of the heterogeneity length scales in the system, there is a rapid transition back to Fickian behavior. An explanation for this second transition is obtained by developing a simplified infiltration model based on the definition of a representative averaged hydraulic conductivity.

Attenuated Total Reflection Fourier Transform Infrared (ATR FT-IR) Spectroscopy as an Analytical Method to Investigate the Secondary Structure of a Model Protein Embedded in Solid Lipid Matrices.

PubMed

Zeeshan, Farrukh; Tabbassum, Misbah; Jorgensen, Lene; Medlicott, Natalie J

2018-02-01

Protein drugs may encounter conformational perturbations during the formulation processing of lipid-based solid dosage forms. In aqueous protein solutions, attenuated total reflection Fourier transform infrared (ATR FT-IR) spectroscopy can investigate these conformational changes following the subtraction of spectral interference of solvent with protein amide I bands. However, in solid dosage forms, the possible spectral contribution of lipid carriers to protein amide I band may be an obstacle to determine conformational alterations. The objective of this study was to develop an ATR FT-IR spectroscopic method for the analysis of protein secondary structure embedded in solid lipid matrices. Bovine serum albumin (BSA) was chosen as a model protein, while Precirol AT05 (glycerol palmitostearate, melting point 58 ℃) was employed as the model lipid matrix. Bovine serum albumin was incorporated into lipid using physical mixing, melting and mixing, or wet granulation mixing methods. Attenuated total reflection FT-IR spectroscopy and size exclusion chromatography (SEC) were performed for the analysis of BSA secondary structure and its dissolution in aqueous media, respectively. The results showed significant interference of Precirol ATO5 with BSA amide I band which was subtracted up to 90% w/w lipid content to analyze BSA secondary structure. In addition, ATR FT-IR spectroscopy also detected thermally denatured BSA solid alone and in the presence of lipid matrix indicating its suitability for the detection of denatured protein solids in lipid matrices. Despite being in the solid state, conformational changes occurred to BSA upon incorporation into solid lipid matrices. However, the extent of these conformational alterations was found to be dependent on the mixing method employed as indicated by area overlap calculations. For instance, the melting and mixing method imparted negligible effect on BSA secondary structure, whereas the wet granulation mixing method promoted more changes. Size exclusion chromatography analysis depicted the complete dissolution of BSA in the aqueous media employed in the wet granulation method. In conclusion, an ATR FT-IR spectroscopic method was successfully developed to investigate BSA secondary structure in solid lipid matrices following the subtraction of lipid spectral interference. The ATR FT-IR spectroscopy could further be applied to investigate the secondary structure perturbations of therapeutic proteins during their formulation development.

A transfer matrix approach to vibration localization in mistuned blade assemblies

NASA Technical Reports Server (NTRS)

Ottarson, Gisli; Pierre, Chritophe

1993-01-01

A study of mode localization in mistuned bladed disks is performed using transfer matrices. The transfer matrix approach yields the free response of a general, mono-coupled, perfectly cyclic assembly in closed form. A mistuned structure is represented by random transfer matrices, and the expansion of these matrices in terms of the small mistuning parameter leads to the definition of a measure of sensitivity to mistuning. An approximation of the localization factor, the spatially averaged rate of exponential attenuation per blade-disk sector, is obtained through perturbation techniques in the limits of high and low sensitivity. The methodology is applied to a common model of a bladed disk and the results verified by Monte Carlo simulations. The easily calculated sensitivity measure may prove to be a valuable design tool due to its system-independent quantification of mistuning effects such as mode localization.

Medium-induced change of the optical response of metal clusters in rare-gas matrices

NASA Astrophysics Data System (ADS)

Xuan, Fengyuan; Guet, Claude

2017-10-01

Interaction with the surrounding medium modifies the optical response of embedded metal clusters. For clusters from about ten to a few hundreds of silver atoms, embedded in rare-gas matrices, we study the environment effect within the matrix random phase approximation with exact exchange (RPAE) quantum approach, which has proved successful for free silver clusters. The polarizable surrounding medium screens the residual two-body RPAE interaction, adds a polarization term to the one-body potential, and shifts the vacuum energy of the active delocalized valence electrons. Within this model, we calculate the dipole oscillator strength distribution for Ag clusters embedded in helium droplets, neon, argon, krypton, and xenon matrices. The main contribution to the dipole surface plasmon red shift originates from the rare-gas polarization screening of the two-body interaction. The large size limit of the dipole surface plasmon agrees well with the classical prediction.

Minimax Rate-optimal Estimation of High-dimensional Covariance Matrices with Incomplete Data*

PubMed Central

Cai, T. Tony; Zhang, Anru

2016-01-01

Missing data occur frequently in a wide range of applications. In this paper, we consider estimation of high-dimensional covariance matrices in the presence of missing observations under a general missing completely at random model in the sense that the missingness is not dependent on the values of the data. Based on incomplete data, estimators for bandable and sparse covariance matrices are proposed and their theoretical and numerical properties are investigated. Minimax rates of convergence are established under the spectral norm loss and the proposed estimators are shown to be rate-optimal under mild regularity conditions. Simulation studies demonstrate that the estimators perform well numerically. The methods are also illustrated through an application to data from four ovarian cancer studies. The key technical tools developed in this paper are of independent interest and potentially useful for a range of related problems in high-dimensional statistical inference with missing data. PMID:27777471

Minimax Rate-optimal Estimation of High-dimensional Covariance Matrices with Incomplete Data.

PubMed

Cai, T Tony; Zhang, Anru

2016-09-01

Missing data occur frequently in a wide range of applications. In this paper, we consider estimation of high-dimensional covariance matrices in the presence of missing observations under a general missing completely at random model in the sense that the missingness is not dependent on the values of the data. Based on incomplete data, estimators for bandable and sparse covariance matrices are proposed and their theoretical and numerical properties are investigated. Minimax rates of convergence are established under the spectral norm loss and the proposed estimators are shown to be rate-optimal under mild regularity conditions. Simulation studies demonstrate that the estimators perform well numerically. The methods are also illustrated through an application to data from four ovarian cancer studies. The key technical tools developed in this paper are of independent interest and potentially useful for a range of related problems in high-dimensional statistical inference with missing data.

A random matrix approach to credit risk.

PubMed

Münnix, Michael C; Schäfer, Rudi; Guhr, Thomas

2014-01-01

We estimate generic statistical properties of a structural credit risk model by considering an ensemble of correlation matrices. This ensemble is set up by Random Matrix Theory. We demonstrate analytically that the presence of correlations severely limits the effect of diversification in a credit portfolio if the correlations are not identically zero. The existence of correlations alters the tails of the loss distribution considerably, even if their average is zero. Under the assumption of randomly fluctuating correlations, a lower bound for the estimation of the loss distribution is provided.

A Random Matrix Approach to Credit Risk

PubMed Central

Guhr, Thomas

2014-01-01

We estimate generic statistical properties of a structural credit risk model by considering an ensemble of correlation matrices. This ensemble is set up by Random Matrix Theory. We demonstrate analytically that the presence of correlations severely limits the effect of diversification in a credit portfolio if the correlations are not identically zero. The existence of correlations alters the tails of the loss distribution considerably, even if their average is zero. Under the assumption of randomly fluctuating correlations, a lower bound for the estimation of the loss distribution is provided. PMID:24853864

Preventing Epilepsy After Traumatic Brain Injury

DTIC Science & Technology

2008-02-01

early seizures to the standard of care ( phenytoin ). A secondary objective is to obtain the data necessary to design a randomized clinical trial to...protocol was revised to eliminate several major obstacles. We have enrolled 5 subjects into the study; two in the phenytoin arm, one in the short term...prevent early seizures better than the current standard of care ( phenytoin ). A secondary objective is to obtain the data necessary to design a randomized

The impact of eszopiclone on sleep and cognition in patients with schizophrenia and insomnia: a double-blind, randomized, placebo-controlled trial.

PubMed

Tek, Cenk; Palmese, Laura B; Krystal, Andrew D; Srihari, Vinod H; DeGeorge, Pamela C; Reutenauer, Erin L; Guloksuz, Sinan

2014-12-01

Insomnia is frequent in schizophrenia and may contribute to cognitive impairment as well as overuse of weight inducing sedative antipsychotics. We investigated the effects of eszopiclone on sleep and cognition for patients with schizophrenia-related insomnia in a double-blind placebo controlled study, followed by a two-week, single-blind placebo phase. Thirty-nine clinically stable outpatients with schizophrenia or schizoaffective disorder and insomnia were randomized to either 3mg eszopiclone (n=20) or placebo (n=19). Primary outcome measure was change in Insomnia Severity Index (ISI) over 8 weeks. Secondary outcome measure was change in MATRICS Consensus Cognitive Battery (MATRICS). Sleep diaries, psychiatric symptoms, and quality of life were also monitored. ISI significantly improved more in eszopiclone (mean=-10.7, 95% CI=-13.2; -8.2) than in placebo (mean=-6.9, 95% CI=-9.5; -4.3) with a between-group difference of -3.8 (95% CI=-7.5; -0.2). MATRICS score change did not differ between groups. On further analysis there was a significant improvement in the working memory test, letter-number span component of MATRICS (mean=9.8±9.2, z=-2.00, p=0.045) only for subjects with schizophrenia on eszopiclone. There were improvements in sleep diary items in both groups with no between-group differences. Psychiatric symptoms remained stable. Discontinuation rates were similar. Sleep remained improved during single-blind placebo phase after eszopiclone was stopped, but the working memory improvement in patients with schizophrenia was not durable. Eszopiclone stands as a safe and effective alternative for the treatment of insomnia in patients with schizophrenia. Its effects on cognition require further study. Copyright © 2014 Elsevier B.V. All rights reserved.

Large computer simulations on elastic networks: Small eigenvalues and eigenvalue spectra of the Kirchhoff matrix

NASA Astrophysics Data System (ADS)

Shy, L. Y.; Eichinger, B. E.

1989-05-01

Computer simulations of the formation of trifunctional and tetrafunctional polydimethyl-siloxane networks that are crosslinked by condensation of telechelic chains with multifunctional crosslinking agents have been carried out on systems containing up to 1.05×106 chains. Eigenvalue spectra of Kirchhoff matrices for these networks have been evaluated at two levels of approximation: (1) inclusion of all midchain modes, and (2) suppression of midchain modes. By use of the recursion method of Haydock and Nex, we have been able to effectively diagonalize matrices with 730 498 rows and columns without actually constructing matrices of this size. The small eigenvalues have been computed by use of the Lanczos algorithm. We demonstrate the following results: (1) The smallest eigenvalues (with chain modes suppressed) vary as μ-2/3 for sufficiently large μ, where μ is the number of junctions in the network; (2) the eigenvalue spectra of the Kirchhoff matrices are well described by McKay's theory for random regular graphs in the range of the larger eigenvalues, but there are significant departures in the region of small eigenvalues where computed spectra have many more small eigenvalues than random regular graphs; (3) the smallest eigenvalues vary as n-1.78 where n is the number of Rouse beads in the chains that comprise the network. Computations are done for both monodisperse and polydisperse chain length distributions. Large eigenvalues associated with localized motion of the junctions are found as predicted by theory. The relationship between the small eigenvalues and the equilibrium modulus of elasticity is discussed, as is the relationship between viscoelasticity and the band edge of the spectrum.

A system identification technique based on the random decrement signatures. Part 1: Theory and simulation

NASA Technical Reports Server (NTRS)

Bedewi, Nabih E.; Yang, Jackson C. S.

1987-01-01

Identification of the system parameters of a randomly excited structure may be treated using a variety of statistical techniques. Of all these techniques, the Random Decrement is unique in that it provides the homogeneous component of the system response. Using this quality, a system identification technique was developed based on a least-squares fit of the signatures to estimate the mass, damping, and stiffness matrices of a linear randomly excited system. The mathematics of the technique is presented in addition to the results of computer simulations conducted to demonstrate the prediction of the response of the system and the random forcing function initially introduced to excite the system.

The price of privately releasing contingency tables, and the spectra of random matrices with correlated rows

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

Kasiviswanathan, Shiva; Rudelson, Mark; Smith, Adam

2009-01-01

Contingency tables are the method of choice of government agencies for releasing statistical summaries of categorical data. In this paper, we consider lower bounds on how much distortion (noise) is necessary in these tables to provide privacy guarantees when the data being summarized is sensitive. We extend a line of recent work on lower bounds on noise for private data analysis [10, 13. 14, 15] to a natural and important class of functionalities. Our investigation also leads to new results on the spectra of random matrices with correlated rows. Consider a database D consisting of n rows (one per individual),more » each row comprising d binary attributes. For any subset of T attributes of size |T| = k, the marginal table for T has 2{sup k} entries; each entry counts how many times in the database a particular setting of these attributes occurs. Imagine an agency that wishes to release all (d/k) contingency tables for a given database. For constant k, previous work showed that distortion {tilde {Omicron}}(min{l_brace}n, (n{sup 2}d){sup 1/3}, {radical}d{sup k}{r_brace}) is sufficient for satisfying differential privacy, a rigorous definition of privacy that has received extensive recent study. Our main contributions are: (1) For {epsilon}- and ({epsilon}, {delta})-differential privacy (with {epsilon} constant and {delta} = 1/poly(n)), we give a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}), which is tight for n = {tilde {Omega}}(d{sup k}). Moreover, for a natural and popular class of mechanisms based on additive noise, our bound can be strengthened to {Omega}({radical}d{sup k}), which is tight for all n. Our bounds extend even to non-constant k, losing roughly a factor of {radical}2{sup k} compared to the best known upper bounds for large n. (2) We give efficient polynomial time attacks which allow an adversary to reconstruct sensitive infonnation given insufficiently perturbed contingency table releases. For constant k, we obtain a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}) that applies to a large class of privacy notions, including K-anonymity (along with its variants) and differential privacy. In contrast to our bounds for differential privacy, this bound (a) is shown only for constant k, but (b) is tight for all values of n when k is constant. (3) Our reconstruction-based attacks require a new lower bound on the least singular values of random matrices with correlated rows. For a constant k, consider a matrix M with (d/k) rows which are formed by taking all possible k-way entry-wise products of an underlying set of d random vectors. We show that even for nearly square matrices with d{sup k}/log d columns, the least singular value is {Omega}({radical}d{sup k}) with high probability - asymptotically, the same bound as one gets for a matrix with independent rows. The proof requires several new ideas for analyzing random matrices and could be of independent interest.« less

Average fidelity between random quantum states

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

Zyczkowski, Karol; Centrum Fizyki Teoretycznej, Polska Akademia Nauk, Aleja Lotnikow 32/44, 02-668 Warsaw; Perimeter Institute, Waterloo, Ontario, N2L 2Y5

2005-03-01

We analyze mean fidelity between random density matrices of size N, generated with respect to various probability measures in the space of mixed quantum states: the Hilbert-Schmidt measure, the Bures (statistical) measure, the measure induced by the partial trace, and the natural measure on the space of pure states. In certain cases explicit probability distributions for the fidelity are derived. The results obtained may be used to gauge the quality of quantum-information-processing schemes.

Needle path planning and steering in a three-dimensional non-static environment using two-dimensional ultrasound images

PubMed Central

Vrooijink, Gustaaf J.; Abayazid, Momen; Patil, Sachin; Alterovitz, Ron; Misra, Sarthak

2015-01-01

Needle insertion is commonly performed in minimally invasive medical procedures such as biopsy and radiation cancer treatment. During such procedures, accurate needle tip placement is critical for correct diagnosis or successful treatment. Accurate placement of the needle tip inside tissue is challenging, especially when the target moves and anatomical obstacles must be avoided. We develop a needle steering system capable of autonomously and accurately guiding a steerable needle using two-dimensional (2D) ultrasound images. The needle is steered to a moving target while avoiding moving obstacles in a three-dimensional (3D) non-static environment. Using a 2D ultrasound imaging device, our system accurately tracks the needle tip motion in 3D space in order to estimate the tip pose. The needle tip pose is used by a rapidly exploring random tree-based motion planner to compute a feasible needle path to the target. The motion planner is sufficiently fast such that replanning can be performed repeatedly in a closed-loop manner. This enables the system to correct for perturbations in needle motion, and movement in obstacle and target locations. Our needle steering experiments in a soft-tissue phantom achieves maximum targeting errors of 0.86 ± 0.35 mm (without obstacles) and 2.16 ± 0.88 mm (with a moving obstacle). PMID:26279600

A system identification technique based on the random decrement signatures. Part 2: Experimental results

NASA Technical Reports Server (NTRS)

Bedewi, Nabih E.; Yang, Jackson C. S.

1987-01-01

Identification of the system parameters of a randomly excited structure may be treated using a variety of statistical techniques. Of all these techniques, the Random Decrement is unique in that it provides the homogeneous component of the system response. Using this quality, a system identification technique was developed based on a least-squares fit of the signatures to estimate the mass, damping, and stiffness matrices of a linear randomly excited system. The results of an experiment conducted on an offshore platform scale model to verify the validity of the technique and to demonstrate its application in damage detection are presented.

On the Concept of Random Orientation in Far-Field Electromagnetic Scattering by Nonspherical Particles

NASA Technical Reports Server (NTRS)

Mishchenko, Michael I.; Yurkin, Maxim A.

2017-01-01

Although the model of randomly oriented nonspherical particles has been used in a great variety of applications of far-field electromagnetic scattering, it has never been defined in strict mathematical terms. In this Letter we use the formalism of Euler rigid-body rotations to clarify the concept of statistically random particle orientations and derive its immediate corollaries in the form of most general mathematical properties of the orientation-averaged extinction and scattering matrices. Our results serve to provide a rigorous mathematical foundation for numerous publications in which the notion of randomly oriented particles and its light-scattering implications have been considered intuitively obvious.

Engineering Design Handbook. Military Vehicle

DTIC Science & Technology

1998-05-01

C0NNECTIN6 NOD HEARINGS. CAMSHAFT BEARINGS. AND VALVE THAIH PRESSURE REGULATOR VALVE SB PSI sc OIL PAH SCAVENGE PUMP INLET SCREEN Figure 1-6...to 40 percent, hogbacks, ditches, racks, embankments, random log obstacles, brush, tree stumps, dust, and mud. Most vehicles have requirements for

Visual feedback training improves postural adjustments associated with moving obstacle avoidance in elderly women.

PubMed

Hatzitaki, V; Voudouris, D; Nikodelis, T; Amiridis, I G

2009-02-01

The study examined the impact of visually guided weight shifting (WS) practice on the postural adjustments evoked by elderly women when avoiding collision with a moving obstacle while standing. Fifty-six healthy elderly women (70.9+/-5.7 years, 87.5+/-9.6 kg) were randomly assigned into one of three groups: a group that completed 12 sessions (25 min, 3s/week) of WS practice in the Anterior/Posterior direction (A/P group, n=20), a group that performed the same practice in the medio/lateral direction (M/L group, n=20) and a control group (n=16). Pre- and post-training, participants were tested in a moving obstacle avoidance task. As a result of practice, postural response onset shifted closer to the time of collision with the obstacle. Side-to-side WS resulted in a reduction of the M/L sway amplitude and an increase of the trunk's velocity during avoidance. It is concluded that visually guided WS practice enhances elderly's ability for on-line visuo-motor processing when avoiding collision eliminating reliance on anticipatory scaling. Specifying the direction of WS seems to be critical for optimizing the transfer of training adaptations.

The didactic situation in geometry learning based on analysis of learning obstacles and learning trajectory

NASA Astrophysics Data System (ADS)

Sulistyowati, Fitria; Budiyono, Slamet, Isnandar

2017-12-01

This study aims to design a didactic situation based on the analysis of learning obstacles and learning trajectory on prism volume. The type of this research is qualitative and quantitative research with steps: analyzing the learning obstacles and learning trajectory, preparing the didactic situation, applying the didactic situation in the classroom, mean difference test of problem solving ability with t-test statistic. The subjects of the study were 8th grade junior high school students in Magelang 2016/2017 selected randomly from eight existing classes. The result of this research is the design of didactic situations that can be implemented in prism volume learning. The effectiveness of didactic situations that have been designed is shown by the mean difference test that is the problem solving ability of the students after the application of the didactic situation better than before the application. The didactic situation that has been generated is expected to be a consideration for teachers to design lessons that match the character of learners, classrooms and teachers themselves, so that the potential thinking of learners can be optimized to avoid the accumulation of learning obstacles.

lme4qtl: linear mixed models with flexible covariance structure for genetic studies of related individuals.

PubMed

Ziyatdinov, Andrey; Vázquez-Santiago, Miquel; Brunel, Helena; Martinez-Perez, Angel; Aschard, Hugues; Soria, Jose Manuel

2018-02-27

Quantitative trait locus (QTL) mapping in genetic data often involves analysis of correlated observations, which need to be accounted for to avoid false association signals. This is commonly performed by modeling such correlations as random effects in linear mixed models (LMMs). The R package lme4 is a well-established tool that implements major LMM features using sparse matrix methods; however, it is not fully adapted for QTL mapping association and linkage studies. In particular, two LMM features are lacking in the base version of lme4: the definition of random effects by custom covariance matrices; and parameter constraints, which are essential in advanced QTL models. Apart from applications in linkage studies of related individuals, such functionalities are of high interest for association studies in situations where multiple covariance matrices need to be modeled, a scenario not covered by many genome-wide association study (GWAS) software. To address the aforementioned limitations, we developed a new R package lme4qtl as an extension of lme4. First, lme4qtl contributes new models for genetic studies within a single tool integrated with lme4 and its companion packages. Second, lme4qtl offers a flexible framework for scenarios with multiple levels of relatedness and becomes efficient when covariance matrices are sparse. We showed the value of our package using real family-based data in the Genetic Analysis of Idiopathic Thrombophilia 2 (GAIT2) project. Our software lme4qtl enables QTL mapping models with a versatile structure of random effects and efficient computation for sparse covariances. lme4qtl is available at https://github.com/variani/lme4qtl .

Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing

NASA Astrophysics Data System (ADS)

Zhang, Peng; Gan, Lu; Ling, Cong; Sun, Sumei

2018-04-01

We study the problem of recovering an $s$-sparse signal $\\mathbf{x}^{\\star}\\in\\mathbb{C}^n$ from corrupted measurements $\\mathbf{y} = \\mathbf{A}\\mathbf{x}^{\\star}+\\mathbf{z}^{\\star}+\\mathbf{w}$, where $\\mathbf{z}^{\\star}\\in\\mathbb{C}^m$ is a $k$-sparse corruption vector whose nonzero entries may be arbitrarily large and $\\mathbf{w}\\in\\mathbb{C}^m$ is a dense noise with bounded energy. The aim is to exactly and stably recover the sparse signal with tractable optimization programs. In this paper, we prove the uniform recovery guarantee of this problem for two classes of structured sensing matrices. The first class can be expressed as the product of a unit-norm tight frame (UTF), a random diagonal matrix and a bounded columnwise orthonormal matrix (e.g., partial random circulant matrix). When the UTF is bounded (i.e. $\\mu(\\mathbf{U})\\sim1/\\sqrt{m}$), we prove that with high probability, one can recover an $s$-sparse signal exactly and stably by $l_1$ minimization programs even if the measurements are corrupted by a sparse vector, provided $m = \\mathcal{O}(s \\log^2 s \\log^2 n)$ and the sparsity level $k$ of the corruption is a constant fraction of the total number of measurements. The second class considers randomly sub-sampled orthogonal matrix (e.g., random Fourier matrix). We prove the uniform recovery guarantee provided that the corruption is sparse on certain sparsifying domain. Numerous simulation results are also presented to verify and complement the theoretical results.

On the number of Bose-selected modes in driven-dissipative ideal Bose gases

NASA Astrophysics Data System (ADS)

Schnell, Alexander; Ketzmerick, Roland; Eckardt, André

2018-03-01

In an ideal Bose gas that is driven into a steady state far from thermal equilibrium, a generalized form of Bose condensation can occur. Namely, the single-particle states unambiguously separate into two groups: the group of Bose-selected states, whose occupations increase linearly with the total particle number, and the group of all other states whose occupations saturate [Phys. Rev. Lett. 111, 240405 (2013), 10.1103/PhysRevLett.111.240405]. However, so far very little is known about how the number of Bose-selected states depends on the properties of the system and its coupling to the environment. The answer to this question is crucial since systems hosting a single, a few, or an extensive number of Bose-selected states will show rather different behavior. While in the former two scenarios each selected mode acquires a macroscopic occupation, corresponding to (fragmented) Bose condensation, the latter case rather bears resemblance to a high-temperature state of matter. In this paper, we systematically investigate the number of Bose-selected states, considering different classes of the rate matrices that characterize the driven-dissipative ideal Bose gases in the limit of weak system-bath coupling. These include rate matrices with continuum limit, rate matrices of chaotic driven systems, random rate matrices, and rate matrices resulting from thermal baths that couple to a few observables only.

On the number of Bose-selected modes in driven-dissipative ideal Bose gases.

PubMed

Schnell, Alexander; Ketzmerick, Roland; Eckardt, André

2018-03-01

In an ideal Bose gas that is driven into a steady state far from thermal equilibrium, a generalized form of Bose condensation can occur. Namely, the single-particle states unambiguously separate into two groups: the group of Bose-selected states, whose occupations increase linearly with the total particle number, and the group of all other states whose occupations saturate [Phys. Rev. Lett. 111, 240405 (2013)PRLTAO0031-900710.1103/PhysRevLett.111.240405]. However, so far very little is known about how the number of Bose-selected states depends on the properties of the system and its coupling to the environment. The answer to this question is crucial since systems hosting a single, a few, or an extensive number of Bose-selected states will show rather different behavior. While in the former two scenarios each selected mode acquires a macroscopic occupation, corresponding to (fragmented) Bose condensation, the latter case rather bears resemblance to a high-temperature state of matter. In this paper, we systematically investigate the number of Bose-selected states, considering different classes of the rate matrices that characterize the driven-dissipative ideal Bose gases in the limit of weak system-bath coupling. These include rate matrices with continuum limit, rate matrices of chaotic driven systems, random rate matrices, and rate matrices resulting from thermal baths that couple to a few observables only.

Towards rigorous analysis of the Levitov-Mirlin-Evers recursion

NASA Astrophysics Data System (ADS)

Fyodorov, Y. V.; Kupiainen, A.; Webb, C.

2016-12-01

This paper aims to develop a rigorous asymptotic analysis of an approximate renormalization group recursion for inverse participation ratios P q of critical powerlaw random band matrices. The recursion goes back to the work by Mirlin and Evers (2000 Phys. Rev. B 62 7920) and earlier works by Levitov (1990 Phys. Rev. Lett. 64 547, 1999 Ann. Phys. 8 697-706) and is aimed to describe the ensuing multifractality of the eigenvectors of such matrices. We point out both similarities and dissimilarities between the LME recursion and those appearing in the theory of multiplicative cascades and branching random walks and show that the methods developed in those fields can be adapted to the present case. In particular the LME recursion is shown to exhibit a phase transition, which we expect is a freezing transition, where the role of temperature is played by the exponent q. However, the LME recursion has features that make its rigorous analysis considerably harder and we point out several open problems for further study.

Critical Care Nurses' Perceptions of End-of-Life Care Obstacles: Comparative 17-Year Data.

PubMed

Beckstrand, Renea L; Lamoreaux, Nicole; Luthy, Karlen E; Macintosh, Janelle L B

Nurses working in intensive care units (ICUs) frequently care for patients and their families at the end of life (EOL). Providing high-quality EOL care is important for both patients and families, yet ICU nurses face many obstacles that hinder EOL care. Researchers have identified various ICU nurse-perceived obstacles, but no studies have been found addressing the progress that has been made for the last 17 years. The aims of this study were to determine the most common and current obstacles in EOL care as perceived by ICU nurses and then to evaluate whether meaningful changes have occurred since data were first gathered in 1998. A quantitative-qualitative mixed methods design was used. A random, geographically dispersed sample of 2000 members of the American Association of Critical-Care Nurses was surveyed. Five obstacle items increased in mean score and rank as compared with 1999 data including (1) family not understanding what the phrase "lifesaving measures" really means, (2) providing lifesaving measures at families' requests despite patient's advance directive listing no such care, (3) family not accepting patient's poor prognosis, (4) family members fighting about the use of life support, and (5) not enough time to provide EOL care because the nurse is consumed with lifesaving measures attempting to save the patient's life. Five obstacle items decreased in mean score and rank compared with 1999 data including (1) physicians differing in opinion about care of the patient, (2) family and friends who continually call the nurse rather than calling the designated family member, (3) physicians who are evasive and avoid families, (4) nurses having to deal with angry families, and (5) nurses not knowing their patient's wishes regarding continuing with tests and treatments. Obstacles in EOL care, as perceived by critical care nurses, still exist. Family-related obstacles have increased over time. Obstacles related to families may not be easily overcome as each family, dealing with a dying family member in an ICU, likely has not previously experienced a similar situation. On the basis of the current top 5 obstacles, recommendations for possible areas of focus include (1) improved health literacy assessment of families followed by earlier directed, appropriate, and specific EOL information; (2) improved physician/team communication; and (3) ensuring patients' wishes are followed as written. In general, patient- and family-centered care using clear and open EOL communication regarding wishes and desires between patients and families, their physicians, and nurses will help decrease common obstacles, thus improving the quality of EOL care provided to dying patients and families.

Linear sampling method applied to non destructive testing of an elastic waveguide: theory, numerics and experiments

NASA Astrophysics Data System (ADS)

Baronian, Vahan; Bourgeois, Laurent; Chapuis, Bastien; Recoquillay, Arnaud

2018-07-01

This paper presents an application of the linear sampling method to ultrasonic non destructive testing of an elastic waveguide. In particular, the NDT context implies that both the solicitations and the measurements are located on the surface of the waveguide and are given in the time domain. Our strategy consists in using a modal formulation of the linear sampling method at multiple frequencies, such modal formulation being justified theoretically in Bourgeois et al (2011 Inverse Problems 27 055001) for rigid obstacles and in Bourgeois and Lunéville (2013 Inverse Problems 29 025017) for cracks. Our strategy requires the inversion of some emission and reception matrices which deserve some special attention due to potential ill-conditioning. The feasibility of our method is proved with the help of artificial data as well as real data.

Performance-Based Scholarships: Replication at Six Sites Using Randomized Controlled Trials

ERIC Educational Resources Information Center

Mayer, Alexander

2014-01-01

Performance-based scholarships were developed to help tackle some of the financial obstacles facing students in the postsecondary education system. In general, these scholarships aim to help reduce the financial burdens of low-income college students, and are structured to help incentivize good academic progress. Performance-based scholarships…

A Program to Improve Student Engagement at Research-Focused Universities

ERIC Educational Resources Information Center

Whillans, Ashley V.; Hope, Sally E.; Wylie, Lauren J.; Zhao, Bob; Souza, Michael J.

2018-01-01

Promoting undergraduate engagement is an important and challenging obstacle at large research-focused universities. Thus, the current study evaluated whether a peer-led program of student-geared events could improve engagement among a diverse group of psychology students early on in their degrees. We randomly assigned interested second-year…

The Value of Removing Daily Obstacles via Everyday Problem-Solving Theory: Developing an Applied Novel Procedure to Increase Self-Efficacy for Exercise

PubMed Central

Artistico, Daniele; Pinto, Angela Marinilli; Douek, Jill; Black, Justin; Pezzuti, Lina

2012-01-01

The objective of the study was to develop a novel procedure to increase self-efficacy for exercise. Gains in one’s ability to resolve day-to-day obstacles for entering an exercise routine were expected to cause an increase in self-efficacy for exercise. Fifty-five sedentary participants (did not exercise regularly for at least 4 months prior to the study) who expressed an intention to exercise in the near future were selected for the study. Participants were randomly assigned to one of three conditions: (1) an Experimental Group in which they received a problem-solving training session to learn new strategies for solving day-to-day obstacles that interfere with exercise, (2) a Control Group with Problem-Solving Training which received a problem-solving training session focused on a typical day-to-day problem unrelated to exercise, or (3) a Control Group which did not receive any problem-solving training. Assessment of obstacles to exercise and perceived self-efficacy for exercise were conducted at baseline; perceived self-efficacy for exercise was reassessed post-intervention (1 week later). No differences in perceived challenges posed by obstacles to exercise or self-efficacy for exercise were observed across groups at baseline. The Experimental Group reported greater improvement in self-efficacy for exercise compared to the Control Group with Training and the Control Group. Results of this study suggest that a novel procedure that focuses on removing obstacles to intended planned fitness activities is effective in increasing self-efficacy to engage in exercise among sedentary adults. Implications of these findings for use in applied settings and treatment studies are discussed. PMID:23372560

The Value of Removing Daily Obstacles via Everyday Problem-Solving Theory: Developing an Applied Novel Procedure to Increase Self-Efficacy for Exercise.

PubMed

Artistico, Daniele; Pinto, Angela Marinilli; Douek, Jill; Black, Justin; Pezzuti, Lina

2013-01-01

The objective of the study was to develop a novel procedure to increase self-efficacy for exercise. Gains in one's ability to resolve day-to-day obstacles for entering an exercise routine were expected to cause an increase in self-efficacy for exercise. Fifty-five sedentary participants (did not exercise regularly for at least 4 months prior to the study) who expressed an intention to exercise in the near future were selected for the study. Participants were randomly assigned to one of three conditions: (1) an Experimental Group in which they received a problem-solving training session to learn new strategies for solving day-to-day obstacles that interfere with exercise, (2) a Control Group with Problem-Solving Training which received a problem-solving training session focused on a typical day-to-day problem unrelated to exercise, or (3) a Control Group which did not receive any problem-solving training. Assessment of obstacles to exercise and perceived self-efficacy for exercise were conducted at baseline; perceived self-efficacy for exercise was reassessed post-intervention (1 week later). No differences in perceived challenges posed by obstacles to exercise or self-efficacy for exercise were observed across groups at baseline. The Experimental Group reported greater improvement in self-efficacy for exercise compared to the Control Group with Training and the Control Group. Results of this study suggest that a novel procedure that focuses on removing obstacles to intended planned fitness activities is effective in increasing self-efficacy to engage in exercise among sedentary adults. Implications of these findings for use in applied settings and treatment studies are discussed.

Up-date on the NeoVitaA Trial: Obstacles, challenges, perspectives, and local experiences.

PubMed

Meyer, Sascha; Gortner, Ludwig

2017-09-01

The aim of the NeoVitaA Trial is to assess the role of postnatal additional high-dose oral vitamin A supplementation for 28 days in reducing Bronchopulmonary dysplasia (BPD) or death in extremely low birth weight (ELBW) infants at 36 weeks postmenstrual age (PMA). All infants (both intervention and control group) will be provided with basic vitamin A (1000 IU/kg/day) in addition to trial intervention.In this short communication, we will give an up-date on obstacles, challenges as well as perspectives and potential solutions when putting into place a multicenter, double-blind, randomized trial in this cohort of extremely susceptible infants.

Giving blood and enrolling on the stem cell donor registry: ranking of obstacles and motives in Switzerland.

PubMed

Bart, Thomas; Volken, Thomas; Fischer, Yvonne; Taleghani, Behrouz Mansouri

2014-07-01

To obtain a better understanding of factors affecting blood and blood stem cell donation behavior in Switzerland, a series of studies has been performed. In the recent study of this series, which is described here, motivators and barriers in the field of blood and blood stem cell donation were identified. Web-based survey data from a non-random sample of the Swiss population 2012/2013 (n = 3,153) were used to describe and compare the ranking of motives and obstacles to donate blood and to enroll on the Swiss blood stem cell registry. Wilcoxon rank-sum test and Spearman's rank correlations were used to assess differences and associations between ranks and groups. The prospect of saving lives and solidarity were the top two motives to donate blood or to enroll on the blood stem cell registry. The top two obstacles to enroll on the blood stem cell registry were lack of general information on blood stem cell donation and on its risks, whereas the top two obstacles to donate blood were the lack of information where and when to donate and deferral of or exclusion from blood donation. Classical altruistic motives are top drivers for giving blood as well as registering for blood stem cell donation. Recruitment campaigns should focus on these motivators. Similarities in motivational factors as well as in obstacles regarding blood and blood stem cell donation can be found.

Non-universal tracer diffusion in crowded media of non-inert obstacles.

PubMed

Ghosh, Surya K; Cherstvy, Andrey G; Metzler, Ralf

2015-01-21

We study the diffusion of a tracer particle, which moves in continuum space between a lattice of excluded volume, immobile non-inert obstacles. In particular, we analyse how the strength of the tracer-obstacle interactions and the volume occupancy of the crowders alter the diffusive motion of the tracer. From the details of partitioning of the tracer diffusion modes between trapping states when bound to obstacles and bulk diffusion, we examine the degree of localisation of the tracer in the lattice of crowders. We study the properties of the tracer diffusion in terms of the ensemble and time averaged mean squared displacements, the trapping time distributions, the amplitude variation of the time averaged mean squared displacements, and the non-Gaussianity parameter of the diffusing tracer. We conclude that tracer-obstacle adsorption and binding triggers a transient anomalous diffusion. From a very narrow spread of recorded individual time averaged trajectories we exclude continuous type random walk processes as the underlying physical model of the tracer diffusion in our system. For moderate tracer-crowder attraction the motion is found to be fully ergodic, while at stronger attraction strength a transient disparity between ensemble and time averaged mean squared displacements occurs. We also put our results into perspective with findings from experimental single-particle tracking and simulations of the diffusion of tagged tracers in dense crowded suspensions. Our results have implications for the diffusion, transport, and spreading of chemical components in highly crowded environments inside living cells and other structured liquids.

Random harmonic analysis program, L221 (TEV156). Volume 1: Engineering and usage

NASA Technical Reports Server (NTRS)

Miller, R. D.; Graham, M. L.

1979-01-01

A digital computer program capable of calculating steady state solutions for linear second order differential equations due to sinusoidal forcing functions is described. The field of application of the program, the analysis of airplane response and loads due to continuous random air turbulence, is discussed. Optional capabilities including frequency dependent input matrices, feedback damping, gradual gust penetration, multiple excitation forcing functions, and a static elastic solution are described. Program usage and a description of the analysis used are presented.

Wigner surmises and the two-dimensional homogeneous Poisson point process.

PubMed

Sakhr, Jamal; Nieminen, John M

2006-04-01

We derive a set of identities that relate the higher-order interpoint spacing statistics of the two-dimensional homogeneous Poisson point process to the Wigner surmises for the higher-order spacing distributions of eigenvalues from the three classical random matrix ensembles. We also report a remarkable identity that equates the second-nearest-neighbor spacing statistics of the points of the Poisson process and the nearest-neighbor spacing statistics of complex eigenvalues from Ginibre's ensemble of 2 x 2 complex non-Hermitian random matrices.

Rational decisions, random matrices and spin glasses

NASA Astrophysics Data System (ADS)

Galluccio, Stefano; Bouchaud, Jean-Philippe; Potters, Marc

We consider the problem of rational decision making in the presence of nonlinear constraints. By using tools borrowed from spin glass and random matrix theory, we focus on the portfolio optimisation problem. We show that the number of optimal solutions is generally exponentially large, and each of them is fragile: rationality is in this case of limited use. In addition, this problem is related to spin glasses with Lévy-like (long-ranged) couplings, for which we show that the ground state is not exponentially degenerate.

Application of microencapsulation for the safe delivery of green tea polyphenols in food systems: Review and recent advances.

PubMed

Massounga Bora, Awa Fanny; Ma, Shaojie; Li, Xiaodong; Liu, Lu

2018-03-01

Green tea has been associated with the prevention and reduction of a wide range of severe health conditions such as cancer, immune, and cardiovascular diseases. The health benefits associated with green tea consumption have been predominantly attributed to green tea polyphenols. The functional properties of green tea polyphenols are mainly anti-oxidative, antimutagenic, anticarcinogenic, anti-microbial, etc. These excellent properties have recently gained considerable attention in the food industry. However, their application is limited by their sensitivity to factors like temperature, light, pH, oxygen, etc. More, studies have reported the occurrence of unpleasant taste and color transfer during food processing. Lastly, the production of functional food requires to maintain the stability, bioactivity, and bioavailability of the active compounds. To tackle these obstacles, technological approaches like microencapsulation have been developed and applied for the formulation of green tea-enriched food products. The present review discusses the novelty in microencapsulation techniques for the safe delivery of green tea polyphenols in food matrices. After a literature on the green tea polyphenols composition, and their health attributes, the encapsulation methods and the coating materials are presented. The application of green tea encapsulates in food matrices as well as their effect on food functional and sensory properties are also discussed. Copyright © 2017 Elsevier Ltd. All rights reserved.

Vast Portfolio Selection with Gross-exposure Constraints*

PubMed Central

Fan, Jianqing; Zhang, Jingjin; Yu, Ke

2012-01-01

We introduce the large portfolio selection using gross-exposure constraints. We show that with gross-exposure constraint the empirically selected optimal portfolios based on estimated covariance matrices have similar performance to the theoretical optimal ones and there is no error accumulation effect from estimation of vast covariance matrices. This gives theoretical justification to the empirical results in Jagannathan and Ma (2003). We also show that the no-short-sale portfolio can be improved by allowing some short positions. The applications to portfolio selection, tracking, and improvements are also addressed. The utility of our new approach is illustrated by simulation and empirical studies on the 100 Fama-French industrial portfolios and the 600 stocks randomly selected from Russell 3000. PMID:23293404

What Randomized Benchmarking Actually Measures

DOE PAGES

Proctor, Timothy; Rudinger, Kenneth; Young, Kevin; ...

2017-09-28

Randomized benchmarking (RB) is widely used to measure an error rate of a set of quantum gates, by performing random circuits that would do nothing if the gates were perfect. In the limit of no finite-sampling error, the exponential decay rate of the observable survival probabilities, versus circuit length, yields a single error metric r. For Clifford gates with arbitrary small errors described by process matrices, r was believed to reliably correspond to the mean, over all Clifford gates, of the average gate infidelity between the imperfect gates and their ideal counterparts. We show that this quantity is not amore » well-defined property of a physical gate set. It depends on the representations used for the imperfect and ideal gates, and the variant typically computed in the literature can differ from r by orders of magnitude. We present new theories of the RB decay that are accurate for all small errors describable by process matrices, and show that the RB decay curve is a simple exponential for all such errors. Here, these theories allow explicit computation of the error rate that RB measures (r), but as far as we can tell it does not correspond to the infidelity of a physically allowed (completely positive) representation of the imperfect gates.« less

Fidelity decay of the two-level bosonic embedded ensembles of random matrices

NASA Astrophysics Data System (ADS)

Benet, Luis; Hernández-Quiroz, Saúl; Seligman, Thomas H.

2010-12-01

We study the fidelity decay of the k-body embedded ensembles of random matrices for bosons distributed over two single-particle states. Fidelity is defined in terms of a reference Hamiltonian, which is a purely diagonal matrix consisting of a fixed one-body term and includes the diagonal of the perturbing k-body embedded ensemble matrix, and the perturbed Hamiltonian which includes the residual off-diagonal elements of the k-body interaction. This choice mimics the typical mean-field basis used in many calculations. We study separately the cases k = 2 and 3. We compute the ensemble-averaged fidelity decay as well as the fidelity of typical members with respect to an initial random state. Average fidelity displays a revival at the Heisenberg time, t = tH = 1, and a freeze in the fidelity decay, during which periodic revivals of period tH are observed. We obtain the relevant scaling properties with respect to the number of bosons and the strength of the perturbation. For certain members of the ensemble, we find that the period of the revivals during the freeze of fidelity occurs at fractional times of tH. These fractional periodic revivals are related to the dominance of specific k-body terms in the perturbation.

Properties of networks with partially structured and partially random connectivity

NASA Astrophysics Data System (ADS)

Ahmadian, Yashar; Fumarola, Francesco; Miller, Kenneth D.

2015-01-01

Networks studied in many disciplines, including neuroscience and mathematical biology, have connectivity that may be stochastic about some underlying mean connectivity represented by a non-normal matrix. Furthermore, the stochasticity may not be independent and identically distributed (iid) across elements of the connectivity matrix. More generally, the problem of understanding the behavior of stochastic matrices with nontrivial mean structure and correlations arises in many settings. We address this by characterizing large random N ×N matrices of the form A =M +L J R , where M ,L , and R are arbitrary deterministic matrices and J is a random matrix of zero-mean iid elements. M can be non-normal, and L and R allow correlations that have separable dependence on row and column indices. We first provide a general formula for the eigenvalue density of A . For A non-normal, the eigenvalues do not suffice to specify the dynamics induced by A , so we also provide general formulas for the transient evolution of the magnitude of activity and frequency power spectrum in an N -dimensional linear dynamical system with a coupling matrix given by A . These quantities can also be thought of as characterizing the stability and the magnitude of the linear response of a nonlinear network to small perturbations about a fixed point. We derive these formulas and work them out analytically for some examples of M ,L , and R motivated by neurobiological models. We also argue that the persistence as N →∞ of a finite number of randomly distributed outlying eigenvalues outside the support of the eigenvalue density of A , as previously observed, arises in regions of the complex plane Ω where there are nonzero singular values of L-1(z 1 -M ) R-1 (for z ∈Ω ) that vanish as N →∞ . When such singular values do not exist and L and R are equal to the identity, there is a correspondence in the normalized Frobenius norm (but not in the operator norm) between the support of the spectrum of A for J of norm σ and the σ pseudospectrum of M .

On Connected Diagrams and Cumulants of Erdős-Rényi Matrix Models

NASA Astrophysics Data System (ADS)

Khorunzhiy, O.

2008-08-01

Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian we introduce two families of discrete matrix models constructed both with the help of the Erdős-Rényi ensemble of random graphs. Corresponding matrix sums represent the characteristic functions of the average number of walks and closed walks over the random graph. These sums can be considered as discrete analogues of the matrix integrals of random matrix theory. We study the diagram structure of the cumulant expansions of logarithms of these matrix sums and analyze the limiting expressions as n → ∞ in the cases of constant and vanishing edge probabilities.

Universality in chaos: Lyapunov spectrum and random matrix theory.

PubMed

Hanada, Masanori; Shimada, Hidehiko; Tezuka, Masaki

2018-02-01

We propose the existence of a new universality in classical chaotic systems when the number of degrees of freedom is large: the statistical property of the Lyapunov spectrum is described by random matrix theory. We demonstrate it by studying the finite-time Lyapunov exponents of the matrix model of a stringy black hole and the mass-deformed models. The massless limit, which has a dual string theory interpretation, is special in that the universal behavior can be seen already at t=0, while in other cases it sets in at late time. The same pattern is demonstrated also in the product of random matrices.

Universality in chaos: Lyapunov spectrum and random matrix theory

NASA Astrophysics Data System (ADS)

Hanada, Masanori; Shimada, Hidehiko; Tezuka, Masaki

2018-02-01

We propose the existence of a new universality in classical chaotic systems when the number of degrees of freedom is large: the statistical property of the Lyapunov spectrum is described by random matrix theory. We demonstrate it by studying the finite-time Lyapunov exponents of the matrix model of a stringy black hole and the mass-deformed models. The massless limit, which has a dual string theory interpretation, is special in that the universal behavior can be seen already at t =0 , while in other cases it sets in at late time. The same pattern is demonstrated also in the product of random matrices.

Dose reduction of risperidone and olanzapine can improve cognitive function and negative symptoms in stable schizophrenic patients: A single-blinded, 52-week, randomized controlled study.

PubMed

Zhou, Yanling; Li, Guannan; Li, Dan; Cui, Hongmei; Ning, Yuping

2018-05-01

The long-term effects of dose reduction of atypical antipsychotics on cognitive function and symptomatology in stable patients with schizophrenia remain unclear. We sought to determine the change in cognitive function and symptomatology after reducing risperidone or olanzapine dosage in stable schizophrenic patients. Seventy-five stabilized schizophrenic patients prescribed risperidone (≥4 mg/day) or olanzapine (≥10 mg/day) were randomly divided into a dose-reduction group ( n=37) and a maintenance group ( n=38). For the dose-reduction group, the dose of antipsychotics was reduced by 50%; for the maintenance group, the dose remained unchanged throughout the whole study. The Positive and Negative Syndrome Scale, Negative Symptom Assessment-16, Rating Scale for Extrapyramidal Side Effects, and Measurement and Treatment Research to Improve Cognition in Schizophrenia (MATRICS) Consensus Cognitive Battery were measured at baseline, 12, 28, and 52 weeks. Linear mixed models were performed to compare the Positive and Negative Syndrome Scale, Negative Symptom Assessment-16, Rating Scale for Extrapyramidal Side Effects and MATRICS Consensus Cognitive Battery scores between groups. The linear mixed model showed significant time by group interactions on the Positive and Negative Syndrome Scale negative symptoms, Negative Symptom Assessment-16, Rating Scale for Extrapyramidal Side Effects, speed of processing, attention/vigilance, working memory and total score of MATRICS Consensus Cognitive Battery (all p<0.05). Post hoc analyses showed significant improvement in Positive and Negative Syndrome Scale negative subscale, Negative Symptom Assessment-16, Rating Scale for Extrapyramidal Side Effects, speed of processing, working memory and total score of MATRICS Consensus Cognitive Battery for the dose reduction group compared with those for the maintenance group (all p<0.05). This study indicated that a risperidone or olanzapine dose reduction of 50% may not lead to more severe symptomatology but can improve speed of processing, working memory and negative symptoms in patients with stabilized schizophrenia.

Random sampling and validation of covariance matrices of resonance parameters

NASA Astrophysics Data System (ADS)

Plevnik, Lucijan; Zerovnik, Gašper

2017-09-01

Analytically exact methods for random sampling of arbitrary correlated parameters are presented. Emphasis is given on one hand on the possible inconsistencies in the covariance data, concentrating on the positive semi-definiteness and consistent sampling of correlated inherently positive parameters, and on the other hand on optimization of the implementation of the methods itself. The methods have been applied in the program ENDSAM, written in the Fortran language, which from a file from a nuclear data library of a chosen isotope in ENDF-6 format produces an arbitrary number of new files in ENDF-6 format which contain values of random samples of resonance parameters (in accordance with corresponding covariance matrices) in places of original values. The source code for the program ENDSAM is available from the OECD/NEA Data Bank. The program works in the following steps: reads resonance parameters and their covariance data from nuclear data library, checks whether the covariance data is consistent, and produces random samples of resonance parameters. The code has been validated with both realistic and artificial data to show that the produced samples are statistically consistent. Additionally, the code was used to validate covariance data in existing nuclear data libraries. A list of inconsistencies, observed in covariance data of resonance parameters in ENDF-VII.1, JEFF-3.2 and JENDL-4.0 is presented. For now, the work has been limited to resonance parameters, however the methods presented are general and can in principle be extended to sampling and validation of any nuclear data.

Crossover ensembles of random matrices and skew-orthogonal polynomials

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

Kumar, Santosh, E-mail: skumar.physics@gmail.com; Pandey, Akhilesh, E-mail: ap0700@mail.jnu.ac.in

2011-08-15

Highlights: > We study crossover ensembles of Jacobi family of random matrices. > We consider correlations for orthogonal-unitary and symplectic-unitary crossovers. > We use the method of skew-orthogonal polynomials and quaternion determinants. > We prove universality of spectral correlations in crossover ensembles. > We discuss applications to quantum conductance and communication theory problems. - Abstract: In a recent paper (S. Kumar, A. Pandey, Phys. Rev. E, 79, 2009, p. 026211) we considered Jacobi family (including Laguerre and Gaussian cases) of random matrix ensembles and reported exact solutions of crossover problems involving time-reversal symmetry breaking. In the present paper we givemore » details of the work. We start with Dyson's Brownian motion description of random matrix ensembles and obtain universal hierarchic relations among the unfolded correlation functions. For arbitrary dimensions we derive the joint probability density (jpd) of eigenvalues for all transitions leading to unitary ensembles as equilibrium ensembles. We focus on the orthogonal-unitary and symplectic-unitary crossovers and give generic expressions for jpd of eigenvalues, two-point kernels and n-level correlation functions. This involves generalization of the theory of skew-orthogonal polynomials to crossover ensembles. We also consider crossovers in the circular ensembles to show the generality of our method. In the large dimensionality limit, correlations in spectra with arbitrary initial density are shown to be universal when expressed in terms of a rescaled symmetry breaking parameter. Applications of our crossover results to communication theory and quantum conductance problems are also briefly discussed.« less

Short-Term Memory in Orthogonal Neural Networks

NASA Astrophysics Data System (ADS)

White, Olivia L.; Lee, Daniel D.; Sompolinsky, Haim

2004-04-01

We study the ability of linear recurrent networks obeying discrete time dynamics to store long temporal sequences that are retrievable from the instantaneous state of the network. We calculate this temporal memory capacity for both distributed shift register and random orthogonal connectivity matrices. We show that the memory capacity of these networks scales with system size.

Accuracy of the Parallel Analysis Procedure with Polychoric Correlations

ERIC Educational Resources Information Center

Cho, Sun-Joo; Li, Feiming; Bandalos, Deborah

2009-01-01

The purpose of this study was to investigate the application of the parallel analysis (PA) method for choosing the number of factors in component analysis for situations in which data are dichotomous or ordinal. Although polychoric correlations are sometimes used as input for component analyses, the random data matrices generated for use in PA…

Computation of mean and variance of the radiotherapy dose for PCA-modeled random shape and position variations of the target.

PubMed

Budiarto, E; Keijzer, M; Storchi, P R M; Heemink, A W; Breedveld, S; Heijmen, B J M

2014-01-20

Radiotherapy dose delivery in the tumor and surrounding healthy tissues is affected by movements and deformations of the corresponding organs between fractions. The random variations may be characterized by non-rigid, anisotropic principal component analysis (PCA) modes. In this article new dynamic dose deposition matrices, based on established PCA modes, are introduced as a tool to evaluate the mean and the variance of the dose at each target point resulting from any given set of fluence profiles. The method is tested for a simple cubic geometry and for a prostate case. The movements spread out the distributions of the mean dose and cause the variance of the dose to be highest near the edges of the beams. The non-rigidity and anisotropy of the movements are reflected in both quantities. The dynamic dose deposition matrices facilitate the inclusion of the mean and the variance of the dose in the existing fluence-profile optimizer for radiotherapy planning, to ensure robust plans with respect to the movements.

Measurement Matrix Design for Phase Retrieval Based on Mutual Information

NASA Astrophysics Data System (ADS)

Shlezinger, Nir; Dabora, Ron; Eldar, Yonina C.

2018-01-01

In phase retrieval problems, a signal of interest (SOI) is reconstructed based on the magnitude of a linear transformation of the SOI observed with additive noise. The linear transform is typically referred to as a measurement matrix. Many works on phase retrieval assume that the measurement matrix is a random Gaussian matrix, which, in the noiseless scenario with sufficiently many measurements, guarantees invertability of the transformation between the SOI and the observations, up to an inherent phase ambiguity. However, in many practical applications, the measurement matrix corresponds to an underlying physical setup, and is therefore deterministic, possibly with structural constraints. In this work we study the design of deterministic measurement matrices, based on maximizing the mutual information between the SOI and the observations. We characterize necessary conditions for the optimality of a measurement matrix, and analytically obtain the optimal matrix in the low signal-to-noise ratio regime. Practical methods for designing general measurement matrices and masked Fourier measurements are proposed. Simulation tests demonstrate the performance gain achieved by the proposed techniques compared to random Gaussian measurements for various phase recovery algorithms.

Raney Distributions and Random Matrix Theory

NASA Astrophysics Data System (ADS)

Forrester, Peter J.; Liu, Dang-Zheng

2015-03-01

Recent works have shown that the family of probability distributions with moments given by the Fuss-Catalan numbers permit a simple parameterized form for their density. We extend this result to the Raney distribution which by definition has its moments given by a generalization of the Fuss-Catalan numbers. Such computations begin with an algebraic equation satisfied by the Stieltjes transform, which we show can be derived from the linear differential equation satisfied by the characteristic polynomial of random matrix realizations of the Raney distribution. For the Fuss-Catalan distribution, an equilibrium problem characterizing the density is identified. The Stieltjes transform for the limiting spectral density of the singular values squared of the matrix product formed from inverse standard Gaussian matrices, and standard Gaussian matrices, is shown to satisfy a variant of the algebraic equation relating to the Raney distribution. Supported on , we show that it too permits a simple functional form upon the introduction of an appropriate choice of parameterization. As an application, the leading asymptotic form of the density as the endpoints of the support are approached is computed, and is shown to have some universal features.

Non-continuum, anisotropic nanomechanics of random and aligned electrospun nanofiber matrices

NASA Astrophysics Data System (ADS)

Chery, Daphney; Han, Biao; Mauck, Robert; Shenoy, Vivek; Han, Lin

Polymer nanofiber assemblies are widely used in cell culture and tissue engineering, while their nanomechanical characteristics have received little attention. In this study, to understand their nanoscale structure-mechanics relations, nanofibers of polycaprolactone (PCL) and poly(vinyl alcohol) (PVA) were fabricated via electrospinning, and tested via AFM-nanoindentation with a microspherical tip (R ~10 μm) in PBS. For the hydrophobic, less-swollen PCL, a novel, non-continuum linear F-D dependence was observed, instead of the typical Hertzian F-D3/2 behavior, which is usually expected for continuum materials. This linear trend is likely resulted from the tensile stretch of a few individual nanofibers as they were indented in the normal plane. In contrast, for the hydrophilic, highly swollen PVA, the observed typical Hertzian response indicates the dominance of localized deformation within each nanofiber, which had swollen to become hydrogels. Furthermore, for both matrices, aligned fibers showed significantly higher stiffness than random fibers. These results provide a fundamental basis on the nanomechanics of biomaterials for specialized applications in cell phenotype and tissue repair.

Critical Care Nurses' Suggestions to Improve End-of-Life Care Obstacles: Minimal Change Over 17 Years.

PubMed

Beckstrand, Renea L; Hadley, Kacie Hart; Luthy, Karlen E; Macintosh, Janelle L B

Critical-care nurses (CCNs) provide end-of-life (EOL) care on a daily basis as 1 in 5 patients dies while in intensive care units. Critical-care nurses overcome many obstacles to perform quality EOL care for dying patients. The purposes of this study were to collect CCNs' current suggestions for improving EOL care and determine if EOL care obstacles have changed by comparing results to data gathered in 1998. A 72-item questionnaire regarding EOL care perceptions was mailed to a national, geographically dispersed, random sample of 2000 members of the American Association of Critical-Care Nurses. One of 3 qualitative questions asked CCNs for suggestions to improve EOL care. Comparative obstacle size (quantitative) data were previously published. Of the 509 returned questionnaires, 322 (63.3%) had 385 written suggestions for improving EOL care. Major themes identified were ensuring characteristics of a good death, improving physician communication with patients and families, adjusting nurse-to-patient ratios to 1:1, recognizing and avoiding futile care, increasing EOL education, physicians who are present and "on the same page," not allowing families to override patients' wishes, and the need for more support staff. When compared with data gathered 17 years previously, major themes remained the same but in a few cases changed in order and possible causation. Critical-care nurses' suggestions were similar to those recommendations from 17 years ago. Although the order of importance changed minimally, the number of similar themes indicated that obstacles to providing EOL care to dying intensive care unit patients continue to exist over time.

The enigma of Darwin.

PubMed

De Vries, A

1984-01-01

Darwin's theory of evolution by natural selection on the basis of inherited random individual variation and excessive offspring remains controversial. Arguments derive from religion (creationism)--disagreement with the Darwinian reduction of teleology to physical causation, from science--nonselective mechanism, and from logic--negation of the possibility of proof of any scientific theory allowing only for validity thusfar. Experimentation on Darwinism is beset with a practical obstacle--unattainable duration, and a logical one--nonpredictability inherent in the randomness of variation. Evolution and creationism need not be contradictive if viewed in their separate domains--rational versus miraculous.

Distributed Adaptive Containment Control for a Class of Nonlinear Multiagent Systems With Input Quantization.

PubMed

Wang, Chenliang; Wen, Changyun; Hu, Qinglei; Wang, Wei; Zhang, Xiuyu

2018-06-01

This paper is devoted to distributed adaptive containment control for a class of nonlinear multiagent systems with input quantization. By employing a matrix factorization and a novel matrix normalization technique, some assumptions involving control gain matrices in existing results are relaxed. By fusing the techniques of sliding mode control and backstepping control, a two-step design method is proposed to construct controllers and, with the aid of neural networks, all system nonlinearities are allowed to be unknown. Moreover, a linear time-varying model and a similarity transformation are introduced to circumvent the obstacle brought by quantization, and the controllers need no information about the quantizer parameters. The proposed scheme is able to ensure the boundedness of all closed-loop signals and steer the containment errors into an arbitrarily small residual set. The simulation results illustrate the effectiveness of the scheme.

Non-equilibrium many-body dynamics following a quantum quench

NASA Astrophysics Data System (ADS)

Vyas, Manan

2017-12-01

We study analytically and numerically the non-equilibrium dynamics of an isolated interacting many-body quantum system following a random quench. We model the system Hamiltonian by Embedded Gaussian Orthogonal Ensemble (EGOE) of random matrices with one plus few-body interactions for fermions. EGOE are paradigmatic models to study the crossover from integrability to chaos in interacting many-body quantum systems. We obtain a generic formulation, based on spectral variances, for describing relaxation dynamics of survival probabilities as a function of rank of interactions. Our analytical results are in good agreement with numerics.

Optimal neighborhood indexing for protein similarity search.

PubMed

Peterlongo, Pierre; Noé, Laurent; Lavenier, Dominique; Nguyen, Van Hoa; Kucherov, Gregory; Giraud, Mathieu

2008-12-16

Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes. In order to speed up this technique, the index can be enhanced by storing additional information to limit the number of random memory accesses. However, this improvement leads to a larger index that may become a bottleneck. In the case of protein similarity search, we propose to decrease the index size by reducing the amino acid alphabet. The paper presents two main contributions. First, we show that an optimal neighborhood indexing combining an alphabet reduction and a longer neighborhood leads to a reduction of 35% of memory involved into the process, without sacrificing the quality of results nor the computational time. Second, our approach led us to develop a new kind of substitution score matrices and their associated e-value parameters. In contrast to usual matrices, these matrices are rectangular since they compare amino acid groups from different alphabets. We describe the method used for computing those matrices and we provide some typical examples that can be used in such comparisons. Supplementary data can be found on the website http://bioinfo.lifl.fr/reblosum. We propose a practical index size reduction of the neighborhood data, that does not negatively affect the performance of large-scale search in protein sequences. Such an index can be used in any study involving large protein data. Moreover, rectangular substitution score matrices and their associated statistical parameters can have applications in any study involving an alphabet reduction.

Optimal neighborhood indexing for protein similarity search

PubMed Central

Peterlongo, Pierre; Noé, Laurent; Lavenier, Dominique; Nguyen, Van Hoa; Kucherov, Gregory; Giraud, Mathieu

2008-01-01

Background Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes. In order to speed up this technique, the index can be enhanced by storing additional information to limit the number of random memory accesses. However, this improvement leads to a larger index that may become a bottleneck. In the case of protein similarity search, we propose to decrease the index size by reducing the amino acid alphabet. Results The paper presents two main contributions. First, we show that an optimal neighborhood indexing combining an alphabet reduction and a longer neighborhood leads to a reduction of 35% of memory involved into the process, without sacrificing the quality of results nor the computational time. Second, our approach led us to develop a new kind of substitution score matrices and their associated e-value parameters. In contrast to usual matrices, these matrices are rectangular since they compare amino acid groups from different alphabets. We describe the method used for computing those matrices and we provide some typical examples that can be used in such comparisons. Supplementary data can be found on the website . Conclusion We propose a practical index size reduction of the neighborhood data, that does not negatively affect the performance of large-scale search in protein sequences. Such an index can be used in any study involving large protein data. Moreover, rectangular substitution score matrices and their associated statistical parameters can have applications in any study involving an alphabet reduction. PMID:19087280

Non-Hermitian localization in biological networks.

PubMed

Amir, Ariel; Hatano, Naomichi; Nelson, David R

2016-04-01

We explore the spectra and localization properties of the N-site banded one-dimensional non-Hermitian random matrices that arise naturally in sparse neural networks. Approximately equal numbers of random excitatory and inhibitory connections lead to spatially localized eigenfunctions and an intricate eigenvalue spectrum in the complex plane that controls the spontaneous activity and induced response. A finite fraction of the eigenvalues condense onto the real or imaginary axes. For large N, the spectrum has remarkable symmetries not only with respect to reflections across the real and imaginary axes but also with respect to 90^{∘} rotations, with an unusual anisotropic divergence in the localization length near the origin. When chains with periodic boundary conditions become directed, with a systematic directional bias superimposed on the randomness, a hole centered on the origin opens up in the density-of-states in the complex plane. All states are extended on the rim of this hole, while the localized eigenvalues outside the hole are unchanged. The bias-dependent shape of this hole tracks the bias-independent contours of constant localization length. We treat the large-N limit by a combination of direct numerical diagonalization and using transfer matrices, an approach that allows us to exploit an electrostatic analogy connecting the "charges" embodied in the eigenvalue distribution with the contours of constant localization length. We show that similar results are obtained for more realistic neural networks that obey "Dale's law" (each site is purely excitatory or inhibitory) and conclude with perturbation theory results that describe the limit of large directional bias, when all states are extended. Related problems arise in random ecological networks and in chains of artificial cells with randomly coupled gene expression patterns.

Non-Hermitian localization in biological networks

NASA Astrophysics Data System (ADS)

Amir, Ariel; Hatano, Naomichi; Nelson, David R.

2016-04-01

We explore the spectra and localization properties of the N -site banded one-dimensional non-Hermitian random matrices that arise naturally in sparse neural networks. Approximately equal numbers of random excitatory and inhibitory connections lead to spatially localized eigenfunctions and an intricate eigenvalue spectrum in the complex plane that controls the spontaneous activity and induced response. A finite fraction of the eigenvalues condense onto the real or imaginary axes. For large N , the spectrum has remarkable symmetries not only with respect to reflections across the real and imaginary axes but also with respect to 90∘ rotations, with an unusual anisotropic divergence in the localization length near the origin. When chains with periodic boundary conditions become directed, with a systematic directional bias superimposed on the randomness, a hole centered on the origin opens up in the density-of-states in the complex plane. All states are extended on the rim of this hole, while the localized eigenvalues outside the hole are unchanged. The bias-dependent shape of this hole tracks the bias-independent contours of constant localization length. We treat the large-N limit by a combination of direct numerical diagonalization and using transfer matrices, an approach that allows us to exploit an electrostatic analogy connecting the "charges" embodied in the eigenvalue distribution with the contours of constant localization length. We show that similar results are obtained for more realistic neural networks that obey "Dale's law" (each site is purely excitatory or inhibitory) and conclude with perturbation theory results that describe the limit of large directional bias, when all states are extended. Related problems arise in random ecological networks and in chains of artificial cells with randomly coupled gene expression patterns.

Work distributions for random sudden quantum quenches

NASA Astrophysics Data System (ADS)

Łobejko, Marcin; Łuczka, Jerzy; Talkner, Peter

2017-05-01

The statistics of work performed on a system by a sudden random quench is investigated. Considering systems with finite dimensional Hilbert spaces we model a sudden random quench by randomly choosing elements from a Gaussian unitary ensemble (GUE) consisting of Hermitian matrices with identically, Gaussian distributed matrix elements. A probability density function (pdf) of work in terms of initial and final energy distributions is derived and evaluated for a two-level system. Explicit results are obtained for quenches with a sharply given initial Hamiltonian, while the work pdfs for quenches between Hamiltonians from two independent GUEs can only be determined in explicit form in the limits of zero and infinite temperature. The same work distribution as for a sudden random quench is obtained for an adiabatic, i.e., infinitely slow, protocol connecting the same initial and final Hamiltonians.

Assessing Sensitivity to Unmeasured Confounding Using a Simulated Potential Confounder

ERIC Educational Resources Information Center

Carnegie, Nicole Bohme; Harada, Masataka; Hill, Jennifer L.

2016-01-01

A major obstacle to developing evidenced-based policy is the difficulty of implementing randomized experiments to answer all causal questions of interest. When using a nonexperimental study, it is critical to assess how much the results could be affected by unmeasured confounding. We present a set of graphical and numeric tools to explore the…

Research productivity among faculty members at medical and health schools in Saudi Arabia. Prevalence, obstacles, and associated factors.

PubMed

Alghanim, Saad A; Alhamali, Rashid M

2011-12-01

To identify the prevalence, factors and obstacles affecting research productivity among academic staff at medical and health colleges in the Kingdom of Saudi Arabia. This cross-sectional survey employed self-administered questionnaires to collect data on faculty members' profile, research activities, and obstacles impeding research productivity. The questionnaires were distributed randomly to 500 faculty members, of which 389 (77.8%) completed the questionnaire at 10 medical and health colleges during January to April 2011. The data were analyzed and presented in a descriptive fashion. Only 150 (38.6%) respondents reported published work in the past 2 years. Of these, 80% indicated sole-authors research and around a quarter (26%) reported co-authors work. Males and young faculty members were more likely to publish research than their counterparts. Faculty members who reported involvement in administrative activities were less likely to publish. Those who reported supervising postgraduate students or had attained training on research methods were more likely to produce research. Respondents perceived that lack of time, lack of research assistants, lack of funds for research, and being busy with teaching load were the most cited obstacles impeding research productivity. Understanding factors and barriers impeding research productivity is a prerequisite for interventions that are directed to promote health services research among faculty members in medical schools.

Tensor Dictionary Learning for Positive Definite Matrices.

PubMed

Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikolaos

2015-11-01

Sparse models have proven to be extremely successful in image processing and computer vision. However, a majority of the effort has been focused on sparse representation of vectors and low-rank models for general matrices. The success of sparse modeling, along with popularity of region covariances, has inspired the development of sparse coding approaches for these positive definite descriptors. While in earlier work, the dictionary was formed from all, or a random subset of, the training signals, it is clearly advantageous to learn a concise dictionary from the entire training set. In this paper, we propose a novel approach for dictionary learning over positive definite matrices. The dictionary is learned by alternating minimization between sparse coding and dictionary update stages, and different atom update methods are described. A discriminative version of the dictionary learning approach is also proposed, which simultaneously learns dictionaries for different classes in classification or clustering. Experimental results demonstrate the advantage of learning dictionaries from data both from reconstruction and classification viewpoints. Finally, a software library is presented comprising C++ binaries for all the positive definite sparse coding and dictionary learning approaches presented here.

A five-week exercise program can reduce falls and improve obstacle avoidance in the elderly.

PubMed

Weerdesteyn, Vivian; Rijken, Hennie; Geurts, Alexander C H; Smits-Engelsman, Bouwien C M; Mulder, Theo; Duysens, Jacques

2006-01-01

Falls in the elderly are a major health problem. Although exercise programs have been shown to reduce the risk of falls, the optimal exercise components, as well as the working mechanisms that underlie the effectiveness of these programs, have not yet been established. To test whether the Nijmegen Falls Prevention Program was effective in reducing falls and improving standing balance, balance confidence, and obstacle avoidance performance in community-dwelling elderly people. A total of 113 elderly with a history of falls participated in this study (exercise group, n = 79; control group, n = 28; dropouts before randomization, n = 6). Exercise sessions were held twice weekly for 5 weeks. Pre- and post-intervention fall monitoring and quantitative motor control assessments were performed. The outcome measures were the number of falls, standing balance and obstacle avoidance performance, and balance confidence scores. The number of falls in the exercise group decreased by 46% (incidence rate ratio (IRR) 0.54, 95% confidence interval (CI) 0.36-0.79) compared to the number of falls during the baseline period and by 46% (IRR 0.54, 95% CI 0.34-0.86) compared to the control group. Obstacle avoidance success rates improved significantly more in the exercise group (on average 12%) compared to the control group (on average 6%). Quiet stance and weight-shifting measures did not show significant effects of exercise. The exercise group also had a 6% increase of balance confidence scores. The Nijmegen Falls Prevention Program was effective in reducing the incidence of falls in otherwise healthy elderly. There was no evidence of improved control of posture as a mechanism underlying this result. In contrast, an obstacle avoidance task indicated that subjects improved their performance. Laboratory obstacle avoidance tests may therefore be better instruments to evaluate future fall prevention studies than posturographic balance assessments. Copyright (c) 2006 S. Karger AG, Basel.

Number statistics for β-ensembles of random matrices: Applications to trapped fermions at zero temperature.

PubMed

Marino, Ricardo; Majumdar, Satya N; Schehr, Grégory; Vivo, Pierpaolo

2016-09-01

Let P_{β}^{(V)}(N_{I}) be the probability that a N×Nβ-ensemble of random matrices with confining potential V(x) has N_{I} eigenvalues inside an interval I=[a,b] on the real line. We introduce a general formalism, based on the Coulomb gas technique and the resolvent method, to compute analytically P_{β}^{(V)}(N_{I}) for large N. We show that this probability scales for large N as P_{β}^{(V)}(N_{I})≈exp[-βN^{2}ψ^{(V)}(N_{I}/N)], where β is the Dyson index of the ensemble. The rate function ψ^{(V)}(k_{I}), independent of β, is computed in terms of single integrals that can be easily evaluated numerically. The general formalism is then applied to the classical β-Gaussian (I=[-L,L]), β-Wishart (I=[1,L]), and β-Cauchy (I=[-L,L]) ensembles. Expanding the rate function around its minimum, we find that generically the number variance var(N_{I}) exhibits a nonmonotonic behavior as a function of the size of the interval, with a maximum that can be precisely characterized. These analytical results, corroborated by numerical simulations, provide the full counting statistics of many systems where random matrix models apply. In particular, we present results for the full counting statistics of zero-temperature one-dimensional spinless fermions in a harmonic trap.

Comparability of item quality indices from sparse data matrices with random and non-random missing data patterns.

PubMed

Wolfe, Edward W; McGill, Michael T

2011-01-01

This article summarizes a simulation study of the performance of five item quality indicators (the weighted and unweighted versions of the mean square and standardized mean square fit indices and the point-measure correlation) under conditions of relatively high and low amounts of missing data under both random and conditional patterns of missing data for testing contexts such as those encountered in operational administrations of a computerized adaptive certification or licensure examination. The results suggest that weighted fit indices, particularly the standardized mean square index, and the point-measure correlation provide the most consistent information between random and conditional missing data patterns and that these indices perform more comparably for items near the passing score than for items with extreme difficulty values.

An efficient method to transcription factor binding sites imputation via simultaneous completion of multiple matrices with positional consistency.

PubMed

Guo, Wei-Li; Huang, De-Shuang

2017-08-22

Transcription factors (TFs) are DNA-binding proteins that have a central role in regulating gene expression. Identification of DNA-binding sites of TFs is a key task in understanding transcriptional regulation, cellular processes and disease. Chromatin immunoprecipitation followed by high-throughput sequencing (ChIP-seq) enables genome-wide identification of in vivo TF binding sites. However, it is still difficult to map every TF in every cell line owing to cost and biological material availability, which poses an enormous obstacle for integrated analysis of gene regulation. To address this problem, we propose a novel computational approach, TFBSImpute, for predicting additional TF binding profiles by leveraging information from available ChIP-seq TF binding data. TFBSImpute fuses the dataset to a 3-mode tensor and imputes missing TF binding signals via simultaneous completion of multiple TF binding matrices with positional consistency. We show that signals predicted by our method achieve overall similarity with experimental data and that TFBSImpute significantly outperforms baseline approaches, by assessing the performance of imputation methods against observed ChIP-seq TF binding profiles. Besides, motif analysis shows that TFBSImpute preforms better in capturing binding motifs enriched in observed data compared with baselines, indicating that the higher performance of TFBSImpute is not simply due to averaging related samples. We anticipate that our approach will constitute a useful complement to experimental mapping of TF binding, which is beneficial for further study of regulation mechanisms and disease.

Green electrospun pantothenic acid/silk fibroin composite nanofibers: fabrication, characterization and biological activity.

PubMed

Fan, Linpeng; Cai, Zengxiao; Zhang, Kuihua; Han, Feng; Li, Jingliang; He, Chuanglong; Mo, Xiumei; Wang, Xungai; Wang, Hongsheng

2014-05-01

Silk fibroin (SF) from Bombyx mori has many established excellent properties and has found various applications in the biomedical field. However, some abilities or capacities of SF still need improving to meet the need for using practically. Indeed, diverse SF-based composite biomaterials have been developed. Here we report the feasibility of fabricating pantothenic acid (vitamin B5, VB5)-reinforcing SF nanofibrous matrices for biomedical applications through green electrospinning. Results demonstrated the successful loading of D-pantothenic acid hemicalcium salt (VB5-hs) into resulting composite nanofibers. The introduction of VB5-hs did not alter the smooth ribbon-like morphology and the silk I structure of SF, but significantly decreased the mean width of SF fibers. SF conformation transformed into β-sheet from random coil when composite nanofibrous matrices were exposed to 75% (v/v) ethanol vapor. Furthermore, nanofibers still remained good morphology after being soaked in water environment for five days. Interestingly, as-prepared composite nanofibrous matrices supported a higher level of cell viability, especially in a long culture period and significantly assisted skin cells to survive under oxidative stress compared with pure SF nanofibrous matrices. These findings provide a basis for further extending the application of SF in the biomedical field, especially in the personal skin-care field. Copyright © 2013 Elsevier B.V. All rights reserved.

Measuring the effects of a visual or auditory Stroop task on dual-task costs during obstacle crossing.

PubMed

Worden, Timothy A; Mendes, Matthew; Singh, Pratham; Vallis, Lori Ann

2016-10-01

Successful planning and execution of motor strategies while concurrently performing a cognitive task has been previously examined, but unfortunately the varied and numerous cognitive tasks studied has limited our fundamental understanding of how the central nervous system successfully integrates and executes these tasks simultaneously. To gain a better understanding of these mechanisms we used a set of cognitive tasks requiring similar central executive function processes and response outputs but requiring different perceptual mechanisms to perform the motor task. Thirteen healthy young adults (20.6±1.6years old) were instrumented with kinematic markers (60Hz) and completed 5 practice, 10 single-task obstacle walking trials and two 40 trial experimental blocks. Each block contained 20 trials of seated (single-task) trials followed by 20 cognitive and obstacle (30% lower leg length) crossing trials (dual-task). Blocks were randomly presented and included either an auditory Stroop task (AST; central interference only) or a visual Stroop task (VST; combined central and structural interference). Higher accuracy rates and shorter response times were observed for the VST versus AST single-task trials (p<0.05). Conversely, for the obstacle stepping performance, larger dual task costs were observed for the VST as compared to the AST for clearance measures (the VST induced larger clearance values for both the leading and trailing feet), indicating VST tasks caused greater interference for obstacle crossing (p<0.05). These results supported the hypothesis that structural interference has a larger effect on motor performance in a dual-task situation compared to cognitive tasks that pose interference at only the central processing stage. Copyright © 2016 Elsevier B.V. All rights reserved.

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

NASA Technical Reports Server (NTRS)

Takaki, Mitsuo; Cavalcanti, Diego; Gheyi, Rohit; Iyoda, Juliano; dAmorim, Marcelo; Prudencio, Ricardo

2009-01-01

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Localization in covariance matrices of coupled heterogenous Ornstein-Uhlenbeck processes

NASA Astrophysics Data System (ADS)

Barucca, Paolo

2014-12-01

We define a random-matrix ensemble given by the infinite-time covariance matrices of Ornstein-Uhlenbeck processes at different temperatures coupled by a Gaussian symmetric matrix. The spectral properties of this ensemble are shown to be in qualitative agreement with some stylized facts of financial markets. Through the presented model formulas are given for the analysis of heterogeneous time series. Furthermore evidence for a localization transition in eigenvectors related to small and large eigenvalues in cross-correlations analysis of this model is found, and a simple explanation of localization phenomena in financial time series is provided. Finally we identify both in our model and in real financial data an inverted-bell effect in correlation between localized components and their local temperature: high- and low-temperature components are the most localized ones.

Eigenvalue distributions for a class of covariance matrices with application to Bienenstock-Cooper-Munro neurons under noisy conditions.

PubMed

Bazzani, Armando; Castellani, Gastone C; Cooper, Leon N

2010-05-01

We analyze the effects of noise correlations in the input to, or among, Bienenstock-Cooper-Munro neurons using the Wigner semicircular law to construct random, positive-definite symmetric correlation matrices and compute their eigenvalue distributions. In the finite dimensional case, we compare our analytic results with numerical simulations and show the effects of correlations on the lifetimes of synaptic strengths in various visual environments. These correlations can be due either to correlations in the noise from the input lateral geniculate nucleus neurons, or correlations in the variability of lateral connections in a network of neurons. In particular, we find that for fixed dimensionality, a large noise variance can give rise to long lifetimes of synaptic strengths. This may be of physiological significance.

Preliminary Analysis of a Randomized Trial of Computer Attention Training in Children with Attention-Deficit/Hyperactivity Disorder

ERIC Educational Resources Information Center

Steiner, N.; Sidhu, T. K.; Frenette, E. C.; Mitchell, K.; Perrin, E. C.

2011-01-01

Clinically significant attention problems among children present a significant obstacle to increasing student achievement. Computer-based attention training holds great promise as a way for schools to address this problem. The aim of this project is to evaluate the efficacy of two computer-based attention training systems in schools. One program…

A Random Algorithm for Low-Rank Decomposition of Large-Scale Matrices With Missing Entries.

PubMed

Liu, Yiguang; Lei, Yinjie; Li, Chunguang; Xu, Wenzheng; Pu, Yifei

2015-11-01

A random submatrix method (RSM) is proposed to calculate the low-rank decomposition U(m×r)V(n×r)(T) (r < m, n) of the matrix Y∈R(m×n) (assuming m > n generally) with known entry percentage 0 < ρ ≤ 1. RSM is very fast as only O(mr(2)ρ(r)) or O(n(3)ρ(3r)) floating-point operations (flops) are required, compared favorably with O(mnr+r(2)(m+n)) flops required by the state-of-the-art algorithms. Meanwhile, RSM has the advantage of a small memory requirement as only max(n(2),mr+nr) real values need to be saved. With the assumption that known entries are uniformly distributed in Y, submatrices formed by known entries are randomly selected from Y with statistical size k×nρ(k) or mρ(l)×l , where k or l takes r+1 usually. We propose and prove a theorem, under random noises the probability that the subspace associated with a smaller singular value will turn into the space associated to anyone of the r largest singular values is smaller. Based on the theorem, the nρ(k)-k null vectors or the l-r right singular vectors associated with the minor singular values are calculated for each submatrix. The vectors ought to be the null vectors of the submatrix formed by the chosen nρ(k) or l columns of the ground truth of V(T). If enough submatrices are randomly chosen, V and U can be estimated accordingly. The experimental results on random synthetic matrices with sizes such as 13 1072 ×10(24) and on real data sets such as dinosaur indicate that RSM is 4.30 ∼ 197.95 times faster than the state-of-the-art algorithms. It, meanwhile, has considerable high precision achieving or approximating to the best.

Inflation with a graceful exit in a random landscape

NASA Astrophysics Data System (ADS)

Pedro, F. G.; Westphal, A.

2017-03-01

We develop a stochastic description of small-field inflationary histories with a graceful exit in a random potential whose Hessian is a Gaussian random matrix as a model of the unstructured part of the string landscape. The dynamical evolution in such a random potential from a small-field inflation region towards a viable late-time de Sitter (dS) minimum maps to the dynamics of Dyson Brownian motion describing the relaxation of non-equilibrium eigenvalue spectra in random matrix theory. We analytically compute the relaxation probability in a saddle point approximation of the partition function of the eigenvalue distribution of the Wigner ensemble describing the mass matrices of the critical points. When applied to small-field inflation in the landscape, this leads to an exponentially strong bias against small-field ranges and an upper bound N ≪ 10 on the number of light fields N participating during inflation from the non-observation of negative spatial curvature.

Crack Modelling for Radiography

NASA Astrophysics Data System (ADS)

Chady, T.; Napierała, L.

2010-02-01

In this paper, possibility of creation of three-dimensional crack models, both random type and based on real-life radiographic images is discussed. Method for storing cracks in a number of two-dimensional matrices, as well algorithm for their reconstruction into three-dimensional objects is presented. Also the possibility of using iterative algorithm for matching simulated images of cracks to real-life radiographic images is discussed.

Frequency dispersion of sound propagation in Rouse polymer melts via generalized dynamic random phase approximation.

PubMed

Erukhimovich, I Ya; Kudryavtsev, Ya V

2003-08-01

An extended generalization of the dynamic random phase approximation (DRPA) for L-component polymer systems is presented. Unlike the original version of the DRPA, which relates the (LxL) matrices of the collective density-density time correlation functions and the corresponding susceptibilities of concentrated polymer systems to those of the tracer macromolecules and so-called broken-links system (BLS), our generalized DRPA solves this problem for the (5xL) x (5xL) matrices of the coupled susceptibilities and time correlation functions of the component number, kinetic energy and flux densities. The presented technique is used to study propagation of sound and dynamic form-factor in disentangled (Rouse) monodisperse homopolymer melt. The calculated ultrasonic velocity and absorption coefficient reveal substantial frequency dispersion. The relaxation time tau is proportional to the degree of polymerization N, which is N times less than the Rouse time and evidences strong dynamic screening because of interchain interaction. We discuss also some peculiarities of the Brillouin scattering in polymer melts. Besides, a new convenient expression for the dynamic structure function of the single Rouse chain in (q,p) representation is found.

Interaction between moving tandem wheels and an infinite rail with periodic supports - Green's matrices of the track method in stationary reference frame

NASA Astrophysics Data System (ADS)

Mazilu, Traian

2017-08-01

This paper approaches the issue of the interaction between moving tandem wheels and an infinite periodically supported rail and points out at the basic characteristics in the steady-state interaction behaviour and in the interaction in the presence of the rail random irregularity. The rail is modelled as an infinite Timoshenko beam resting on supports which are discretely modelling the inertia of the sleepers and ballast and also the viscoelastic features of the rail pads, the ballast and the subgrade. Green‧s matrices of the track method in stationary reference frame were applied so as to conduct the time-domain analysis. This method allows to consider the nonlinearities of the wheel/rail contact and the Doppler effect. The study highlights certain aspects regarding the influence of the wheel base on the wheels/rail contact forces, particularly at the parametric resonance, due to the coincidence between the wheel/rail natural frequency and the passing frequency and also when the rail surface exhibits random irregularity. It has been shown that the wheel/rail dynamic behaviour is less intense when the wheel base equals integer multiple of the sleeper bay.

Multiple-image encryption based on double random phase encoding and compressive sensing by using a measurement array preprocessed with orthogonal-basis matrices

NASA Astrophysics Data System (ADS)

Zhang, Luozhi; Zhou, Yuanyuan; Huo, Dongming; Li, Jinxi; Zhou, Xin

2018-09-01

A method is presented for multiple-image encryption by using the combination of orthogonal encoding and compressive sensing based on double random phase encoding. As an original thought in optical encryption, it is demonstrated theoretically and carried out by using the orthogonal-basis matrices to build a modified measurement array, being projected onto the images. In this method, all the images can be compressed in parallel into a stochastic signal and be diffused to be a stationary white noise. Meanwhile, each single-image can be separately reestablished by adopting a proper decryption key combination through the block-reconstruction rather than the entire-rebuilt, for its costs of data and decryption time are greatly decreased, which may be promising both in multi-user multiplexing and huge-image encryption/decryption. Besides, the security of this method is characterized by using the bit-length of key, and the parallelism is investigated as well. The simulations and discussions are also made on the effects of decryption as well as the correlation coefficient by using a series of sampling rates, occlusion attacks, keys with various error rates, etc.

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

Proctor, Timothy; Rudinger, Kenneth; Young, Kevin

Randomized benchmarking (RB) is widely used to measure an error rate of a set of quantum gates, by performing random circuits that would do nothing if the gates were perfect. In the limit of no finite-sampling error, the exponential decay rate of the observable survival probabilities, versus circuit length, yields a single error metric r. For Clifford gates with arbitrary small errors described by process matrices, r was believed to reliably correspond to the mean, over all Clifford gates, of the average gate infidelity between the imperfect gates and their ideal counterparts. We show that this quantity is not amore » well-defined property of a physical gate set. It depends on the representations used for the imperfect and ideal gates, and the variant typically computed in the literature can differ from r by orders of magnitude. We present new theories of the RB decay that are accurate for all small errors describable by process matrices, and show that the RB decay curve is a simple exponential for all such errors. Here, these theories allow explicit computation of the error rate that RB measures (r), but as far as we can tell it does not correspond to the infidelity of a physically allowed (completely positive) representation of the imperfect gates.« less

Absorption and scattering of light by nonspherical particles. [in atmosphere

NASA Technical Reports Server (NTRS)

Bohren, C. F.

1986-01-01

Using the example of the polarization of scattered light, it is shown that the scattering matrices for identical, randomly ordered particles and for spherical particles are unequal. The spherical assumptions of Mie theory are therefore inconsistent with the random shapes and sizes of atmospheric particulates. The implications for corrections made to extinction measurements of forward scattering light are discussed. Several analytical methods are examined as potential bases for developing more accurate models, including Rayleigh theory, Fraunhoffer Diffraction theory, anomalous diffraction theory, Rayleigh-Gans theory, the separation of variables technique, the Purcell-Pennypacker method, the T-matrix method, and finite difference calculations.

Noisy covariance matrices and portfolio optimization II

NASA Astrophysics Data System (ADS)

Pafka, Szilárd; Kondor, Imre

2003-03-01

Recent studies inspired by results from random matrix theory (Galluccio et al.: Physica A 259 (1998) 449; Laloux et al.: Phys. Rev. Lett. 83 (1999) 1467; Risk 12 (3) (1999) 69; Plerou et al.: Phys. Rev. Lett. 83 (1999) 1471) found that covariance matrices determined from empirical financial time series appear to contain such a high amount of noise that their structure can essentially be regarded as random. This seems, however, to be in contradiction with the fundamental role played by covariance matrices in finance, which constitute the pillars of modern investment theory and have also gained industry-wide applications in risk management. Our paper is an attempt to resolve this embarrassing paradox. The key observation is that the effect of noise strongly depends on the ratio r= n/ T, where n is the size of the portfolio and T the length of the available time series. On the basis of numerical experiments and analytic results for some toy portfolio models we show that for relatively large values of r (e.g. 0.6) noise does, indeed, have the pronounced effect suggested by Galluccio et al. (1998), Laloux et al. (1999) and Plerou et al. (1999) and illustrated later by Laloux et al. (Int. J. Theor. Appl. Finance 3 (2000) 391), Plerou et al. (Phys. Rev. E, e-print cond-mat/0108023) and Rosenow et al. (Europhys. Lett., e-print cond-mat/0111537) in a portfolio optimization context, while for smaller r (around 0.2 or below), the error due to noise drops to acceptable levels. Since the length of available time series is for obvious reasons limited in any practical application, any bound imposed on the noise-induced error translates into a bound on the size of the portfolio. In a related set of experiments we find that the effect of noise depends also on whether the problem arises in asset allocation or in a risk measurement context: if covariance matrices are used simply for measuring the risk of portfolios with a fixed composition rather than as inputs to optimization, the effect of noise on the measured risk may become very small.

Subjective randomness as statistical inference.

PubMed

Griffiths, Thomas L; Daniels, Dylan; Austerweil, Joseph L; Tenenbaum, Joshua B

2018-06-01

Some events seem more random than others. For example, when tossing a coin, a sequence of eight heads in a row does not seem very random. Where do these intuitions about randomness come from? We argue that subjective randomness can be understood as the result of a statistical inference assessing the evidence that an event provides for having been produced by a random generating process. We show how this account provides a link to previous work relating randomness to algorithmic complexity, in which random events are those that cannot be described by short computer programs. Algorithmic complexity is both incomputable and too general to capture the regularities that people can recognize, but viewing randomness as statistical inference provides two paths to addressing these problems: considering regularities generated by simpler computing machines, and restricting the set of probability distributions that characterize regularity. Building on previous work exploring these different routes to a more restricted notion of randomness, we define strong quantitative models of human randomness judgments that apply not just to binary sequences - which have been the focus of much of the previous work on subjective randomness - but also to binary matrices and spatial clustering. Copyright © 2018 Elsevier Inc. All rights reserved.

Spike Train Similarity Space (SSIMS) Method Detects Effects of Obstacle Proximity and Experience on Temporal Patterning of Bat Biosonar

PubMed Central

Accomando, Alyssa W.; Vargas-Irwin, Carlos E.; Simmons, James A.

2018-01-01

Bats emit biosonar pulses in complex temporal patterns that change to accommodate dynamic surroundings. Efforts to quantify these patterns have included analyses of inter-pulse intervals, sonar sound groups, and changes in individual signal parameters such as duration or frequency. Here, the similarity in temporal structure between trains of biosonar pulses is assessed. The spike train similarity space (SSIMS) algorithm, originally designed for neural activity pattern analysis, was applied to determine which features of the environment influence temporal patterning of pulses emitted by flying big brown bats, Eptesicus fuscus. In these laboratory experiments, bats flew down a flight corridor through an obstacle array. The corridor varied in width (100, 70, or 40 cm) and shape (straight or curved). Using a relational point-process framework, SSIMS was able to discriminate between echolocation call sequences recorded from flights in each of the corridor widths. SSIMS was also able to tell the difference between pulse trains recorded during flights where corridor shape through the obstacle array matched the previous trials (fixed, or expected) as opposed to those recorded from flights with randomized corridor shape (variable, or unexpected), but only for the flight path shape in which the bats had previous training. The results show that experience influences the temporal patterns with which bats emit their echolocation calls. It is demonstrated that obstacle proximity to the bat affects call patterns more dramatically than flight path shape. PMID:29472848

Spike Train Similarity Space (SSIMS) Method Detects Effects of Obstacle Proximity and Experience on Temporal Patterning of Bat Biosonar.

PubMed

Accomando, Alyssa W; Vargas-Irwin, Carlos E; Simmons, James A

2018-01-01

Bats emit biosonar pulses in complex temporal patterns that change to accommodate dynamic surroundings. Efforts to quantify these patterns have included analyses of inter-pulse intervals, sonar sound groups, and changes in individual signal parameters such as duration or frequency. Here, the similarity in temporal structure between trains of biosonar pulses is assessed. The spike train similarity space (SSIMS) algorithm, originally designed for neural activity pattern analysis, was applied to determine which features of the environment influence temporal patterning of pulses emitted by flying big brown bats, Eptesicus fuscus . In these laboratory experiments, bats flew down a flight corridor through an obstacle array. The corridor varied in width (100, 70, or 40 cm) and shape (straight or curved). Using a relational point-process framework, SSIMS was able to discriminate between echolocation call sequences recorded from flights in each of the corridor widths. SSIMS was also able to tell the difference between pulse trains recorded during flights where corridor shape through the obstacle array matched the previous trials (fixed, or expected) as opposed to those recorded from flights with randomized corridor shape (variable, or unexpected), but only for the flight path shape in which the bats had previous training. The results show that experience influences the temporal patterns with which bats emit their echolocation calls. It is demonstrated that obstacle proximity to the bat affects call patterns more dramatically than flight path shape.

Emergency nurses' perceptions of size, frequency, and magnitude of obstacles and supportive behaviors in end-of-life care.

PubMed

Beckstrand, Renea L; Smith, Michelle D; Heaston, Sondra; Bond, A Elaine

2008-08-01

Emergency nurses care for dying patients daily. The process of dying in an emergency department can be complicated. Research on specific obstacles that impede the delivery of end-of-life care in emergency departments and behaviors that support it is limited. A 70-item questionnaire was mailed to randomly selected ENA members. Subjects were asked to rate items on the size, frequency, and magnitude of obstacles and supportive behaviors that relate to end-of-life care for ED patients. The perceived obstacles with the greatest magnitude were as follows: (a) ED nurses' work loads being too high to allow adequate time for patient care, (b) poor design of emergency departments, and (c) family members not understanding what "life-saving measures" really mean. The three highest-scoring supportive behaviors were as follows: (a) allowing family members adequate time to be alone with the patient after he or she has died; (b) having good communication between the physician and RN; and (c) providing a peaceful, dignified bedside scene for family members once the patient has died. It is hoped that the results of this study will help increase and facilitate the discussions regarding end-of-life care in emergency departments. Realistic initial implications include finding ways to decrease workloads of emergency nurses and increase direct patient care. Another important implication would be the improvement of ED designs. Further research in the area of end-of-life care in emergency settings is recommended.

What is the effect of matrices on cartilage repair? A systematic review.

PubMed

Wylie, James D; Hartley, Melissa K; Kapron, Ashley L; Aoki, Stephen K; Maak, Travis G

2015-05-01

Articular cartilage has minimal endogenous ability to undergo repair. Multiple chondral restoration strategies have been attempted with varied results. The purpose of our review was to determine: (1) Does articular chondrocyte transplantation or matrix-assisted articular chondrocyte transplantation provide better patient-reported outcomes scores, MRI morphologic measurements, or histologic quality of repair tissue compared with microfracture in prospective comparative studies of articular cartilage repair; and (2) which available matrices for matrix-assisted articular chondrocyte transplantation show the best patient-reported outcomes scores, MRI morphologic measurements, or histologic quality of repair tissue? We conducted a systematic review of PubMed, CINAHL, and MEDLINE from March 2004 to February 2014 using keywords determined to be important for articular cartilage repair, including "cartilage", "chondral", "cell source", "chondrocyte", "matrix", "augment", "articular", "joint", "repair", "treatment", "regeneration", and "restoration" to find articles related to cell-based articular cartilage repair of the knee. The articles were reviewed by two authors (JDW, MKH), our study exclusion criteria were applied, and articles were determined to be relevant (or not) to the research questions. The Methodological Index for Nonrandomized Studies (MINORS) scale was used to judge the quality of nonrandomized manuscripts used in this review and the Jadad score was used to judge the quality of randomized trials. Seventeen articles were reviewed for the first research question and 83 articles were reviewed in the second research question from 301 articles identified in the original systematic search. The average MINORS score was 9.9 (62%) for noncomparative studies and 16.1 (67%) for comparative studies. The average Jadad score was 2.3 for the randomized studies. Articular chondrocyte transplantation shows better patient-reported outcomes at 5 years in patients without chronic symptoms preoperatively compared with microfracture (p = 0.026). Matrix-assisted articular chondrocyte transplantation consistently showed improved patient-reported functional outcomes compared with microfracture (p values ranging from < 0.001 to 0.029). Hyalograft C(®) (Anika Therapeutics Inc, Bedford, MA, USA) and Chondro-gide(®) (Genzyme Biosurgery, Kastrup, Denmark) are the matrices with the most published evidence in the literature, but no studies comparing different matrices met our inclusion criteria, because the literature consists only of uncontrolled case series. Matrix-assisted articular chondrocyte transplantation leads to better patient-reported outcomes in cartilage repair compared with microfracture; however, future prospective research is needed comparing different matrices to determine which products optimize cartilage repair. Level IV, therapeutic study.

Multiple image encryption scheme based on pixel exchange operation and vector decomposition

NASA Astrophysics Data System (ADS)

Xiong, Y.; Quan, C.; Tay, C. J.

2018-02-01

We propose a new multiple image encryption scheme based on a pixel exchange operation and a basic vector decomposition in Fourier domain. In this algorithm, original images are imported via a pixel exchange operator, from which scrambled images and pixel position matrices are obtained. Scrambled images encrypted into phase information are imported using the proposed algorithm and phase keys are obtained from the difference between scrambled images and synthesized vectors in a charge-coupled device (CCD) plane. The final synthesized vector is used as an input in a random phase encoding (DRPE) scheme. In the proposed encryption scheme, pixel position matrices and phase keys serve as additional private keys to enhance the security of the cryptosystem which is based on a 4-f system. Numerical simulations are presented to demonstrate the feasibility and robustness of the proposed encryption scheme.

Product of Ginibre matrices: Fuss-Catalan and Raney distributions

NASA Astrophysics Data System (ADS)

Penson, Karol A.; Życzkowski, Karol

2011-06-01

Squared singular values of a product of s square random Ginibre matrices are asymptotically characterized by probability distributions Ps(x), such that their moments are equal to the Fuss-Catalan numbers of order s. We find a representation of the Fuss-Catalan distributions Ps(x) in terms of a combination of s hypergeometric functions of the type sFs-1. The explicit formula derived here is exact for an arbitrary positive integer s, and for s=1 it reduces to the Marchenko-Pastur distribution. Using similar techniques, involving the Mellin transform and the Meijer G function, we find exact expressions for the Raney probability distributions, the moments of which are given by a two-parameter generalization of the Fuss-Catalan numbers. These distributions can also be considered as a two-parameter generalization of the Wigner semicircle law.

Product of Ginibre matrices: Fuss-Catalan and Raney distributions.

PubMed

Penson, Karol A; Zyczkowski, Karol

2011-06-01

Squared singular values of a product of s square random Ginibre matrices are asymptotically characterized by probability distributions P(s)(x), such that their moments are equal to the Fuss-Catalan numbers of order s. We find a representation of the Fuss-Catalan distributions P(s)(x) in terms of a combination of s hypergeometric functions of the type (s)F(s-1). The explicit formula derived here is exact for an arbitrary positive integer s, and for s=1 it reduces to the Marchenko-Pastur distribution. Using similar techniques, involving the Mellin transform and the Meijer G function, we find exact expressions for the Raney probability distributions, the moments of which are given by a two-parameter generalization of the Fuss-Catalan numbers. These distributions can also be considered as a two-parameter generalization of the Wigner semicircle law.

Probabilistic Signal Recovery and Random Matrices

DTIC Science & Technology

2016-12-08

applications in statistics , biomedical data analysis, quantization, dimen- sion reduction, and networks science. 1. High-dimensional inference and geometry Our...low-rank approxima- tion, with applications to community detection in networks, Annals of Statistics 44 (2016), 373–400. [7] C. Le, E. Levina, R...approximation, with applications to community detection in networks, Annals of Statistics 44 (2016), 373–400. C. Le, E. Levina, R. Vershynin, Concentration

Learning Circulant Sensing Kernels

DTIC Science & Technology

2014-03-01

Furthermore, we test learning the circulant sensing matrix/operator and the nonparametric dictionary altogether and obtain even better performance. We...scale. Furthermore, we test learning the circulant sensing matrix/operator and the nonparametric dictionary altogether and obtain even better performance...matrices, Tropp et al.[28] de - scribes a random filter for acquiring a signal x̄; Haupt et al.[12] describes a channel estimation problem to identify a

Quantification of cellular penetrative forces using lab-on-a-chip technology and finite element modeling

PubMed Central

Sanati Nezhad, Amir; Naghavi, Mahsa; Packirisamy, Muthukumaran; Bhat, Rama; Geitmann, Anja

2013-01-01

Tip-growing cells have the unique property of invading living tissues and abiotic growth matrices. To do so, they exert significant penetrative forces. In plant and fungal cells, these forces are generated by the hydrostatic turgor pressure. Using the TipChip, a microfluidic lab-on-a-chip device developed for tip-growing cells, we tested the ability to exert penetrative forces generated in pollen tubes, the fastest-growing plant cells. The tubes were guided to grow through microscopic gaps made of elastic polydimethylsiloxane material. Based on the deformation of the gaps, the force exerted by the elongating tubes to permit passage was determined using finite element methods. The data revealed that increasing mechanical impedance was met by the pollen tubes through modulation of the cell wall compliance and, thus, a change in the force acting on the obstacle. Tubes that successfully passed a narrow gap frequently burst, raising questions about the sperm discharge mechanism in the flowering plants. PMID:23630253

Overview of existing cartilage repair technology.

PubMed

McNickle, Allison G; Provencher, Matthew T; Cole, Brian J

2008-12-01

Currently, autologous chondrocyte implantation and osteochondral grafting bridge the gap between palliation of cartilage injury and resurfacing via arthroplasty. Emerging technologies seek to advance first generation techniques and accomplish several goals including predictable outcomes, cost-effective technology, single-stage procedures, and creation of durable repair tissue. The biologic pipeline represents a variety of technologies including synthetics, scaffolds, cell therapy, and cell-infused matrices. Synthetic constructs, an alternative to biologic repair, resurface a focal chondral defect rather than the entire joint surface. Scaffolds are cell-free constructs designed as a biologic "net" to augment marrow stimulation techniques. Minced cartilage technology uses stabilized autologous or allogeneic fragments in 1-stage transplantation. Second and third generation cell-based methods include alternative membranes, chondrocyte seeding, and culturing onto scaffolds. Despite the promising early results of these products, significant technical obstacles remain along with unknown long-term durability. The vast array of developing technologies has exceptional promise and the potential to revolutionize the cartilage treatment algorithm within the next decade.

Single-qubit decoherence under a separable coupling to a random matrix environment

NASA Astrophysics Data System (ADS)

Carrera, M.; Gorin, T.; Seligman, T. H.

2014-08-01

This paper describes the dynamics of a quantum two-level system (qubit) under the influence of an environment modeled by an ensemble of random matrices. In distinction to earlier work, we consider here separable couplings and focus on a regime where the decoherence time is of the same order of magnitude as the environmental Heisenberg time. We derive an analytical expression in the linear response approximation, and study its accuracy by comparison with numerical simulations. We discuss a series of unusual properties, such as purity oscillations, strong signatures of spectral correlations (in the environment Hamiltonian), memory effects, and symmetry-breaking equilibrium states.

Probabilistic Structures Analysis Methods (PSAM) for select space propulsion system components

NASA Technical Reports Server (NTRS)

1991-01-01

The basic formulation for probabilistic finite element analysis is described and demonstrated on a few sample problems. This formulation is based on iterative perturbation that uses the factorized stiffness on the unperturbed system as the iteration preconditioner for obtaining the solution to the perturbed problem. This approach eliminates the need to compute, store and manipulate explicit partial derivatives of the element matrices and force vector, which not only reduces memory usage considerably, but also greatly simplifies the coding and validation tasks. All aspects for the proposed formulation were combined in a demonstration problem using a simplified model of a curved turbine blade discretized with 48 shell elements, and having random pressure and temperature fields with partial correlation, random uniform thickness, and random stiffness at the root.

A probabilistic model of a porous heat exchanger

NASA Technical Reports Server (NTRS)

Agrawal, O. P.; Lin, X. A.

1995-01-01

This paper presents a probabilistic one-dimensional finite element model for heat transfer processes in porous heat exchangers. The Galerkin approach is used to develop the finite element matrices. Some of the submatrices are asymmetric due to the presence of the flow term. The Neumann expansion is used to write the temperature distribution as a series of random variables, and the expectation operator is applied to obtain the mean and deviation statistics. To demonstrate the feasibility of the formulation, a one-dimensional model of heat transfer phenomenon in superfluid flow through a porous media is considered. Results of this formulation agree well with the Monte-Carlo simulations and the analytical solutions. Although the numerical experiments are confined to parametric random variables, a formulation is presented to account for the random spatial variations.

Initiation Mechanisms of Low-loss Swept-ramp Obstacles for Deflagration to Detonation Transition in Pulse Detonation Combustors

DTIC Science & Technology

2009-12-01

minimal pressure losses. 15. NUMBER OF PAGES 113 14. SUBJECT TERMS Pulse Detonation Combustors, PDC, Pulse Detonation Engines, PDE , PDE ...Postgraduate School PDC Pulse Detonation Combustor PDE Pulse Detonation Engine RAM Random Access Memory RDT Research, Design and Test RPL...inhibiting the implementation of this advanced propulsion system. The primary advantage offered by pulse detonation engines ( PDEs ) is the high efficiency

Functional Mobility Performance and Balance Confidence in Older Adults after Sensorimotor Adaptation Training

NASA Technical Reports Server (NTRS)

Buccello-Stout, Regina R.; Cromwell, Ronita L.; Bloomberg, Jacob J.; Weaver, G. D.

2010-01-01

Research indicates a main contributor of injury in older adults is from falling. The decline in sensory systems limits information needed to successfully maneuver through the environment. The objective of this study was to determine if prolonged exposure to the realignment of perceptual-motor systems increases adaptability of balance, and if balance confidence improves after training. A total of 16 older adults between ages 65-85 were randomized to a control group (walking on a treadmill while viewing a static visual scene) and an experimental group (walking on a treadmill while viewing a rotating visual scene). Prior to visual exposure, participants completed six trials of walking through a soft foamed obstacle course. Participants came in twice a week for 4 weeks to complete training of walking on a treadmill and viewing the visual scene for 20 minutes each session. Participants completed the obstacle course after training and four weeks later. Average time, penalty, and Activity Balance Confidence Scale scores were computed for both groups across testing times. The older adults who trained, significantly improved their time through the obstacle course F (2, 28) = 9.41, p < 0.05, as well as reduced their penalty scores F (2, 28) = 21.03, p < 0.05, compared to those who did not train. There was no difference in balance confidence scores between groups across testing times F (2, 28) = 0.503, p > 0.05. Although the training group improved mobility through the obstacle course, there were no differences between the groups in balance confidence.

Motion planning with complete knowledge using a colored SOM.

PubMed

Vleugels, J; Kok, J N; Overmars, M

1997-01-01

The motion planning problem requires that a collision-free path be determined for a robot moving amidst a fixed set of obstacles. Most neural network approaches to this problem are for the situation in which only local knowledge about the configuration space is available. The main goal of the paper is to show that neural networks are also suitable tools in situations with complete knowledge of the configuration space. In this paper we present an approach that combines a neural network and deterministic techniques. We define a colored version of Kohonen's self-organizing map that consists of two different classes of nodes. The network is presented with random configurations of the robot and, from this information, it constructs a road map of possible motions in the work space. The map is a growing network, and different nodes are used to approximate boundaries of obstacles and the Voronoi diagram of the obstacles, respectively. In a second phase, the positions of the two kinds of nodes are combined to obtain the road map. In this way a number of typical problems with small obstacles and passages are avoided, and the required number of nodes for a given accuracy is within reasonable limits. This road map is searched to find a motion connecting the given source and goal configurations of the robot. The algorithm is simple and general; the only specific computation that is required is a check for intersection of two polygons. We implemented the algorithm for planar robots allowing both translation and rotation and experiments show that compared to conventional techniques it performs well, even for difficult motion planning scenes.

Collision recognition and direction changes for small scale fish robots by acceleration sensors

NASA Astrophysics Data System (ADS)

Na, Seung Y.; Shin, Daejung; Kim, Jin Y.; Lee, Bae-Ho

2005-05-01

Typical obstacles are walls, rocks, water plants and other nearby robots for a group of small scale fish robots and submersibles that have been constructed in our lab. Sonar sensors are not employed to make the robot structure simple enough. All of circuits, sensors and processor cards are contained in a box of 9 x 7 x 4 cm dimension except motors, fins and external covers. Therefore, image processing results are applied to avoid collisions. However, it is useful only when the obstacles are located far enough to give images processing time for detecting them. Otherwise, acceleration sensors are used to detect collision immediately after it happens. Two of 2-axes acceleration sensors are employed to measure the three components of collision angles, collision magnitudes, and the angles of robot propulsion. These data are integrated to calculate the amount of propulsion direction change. The angle of a collision incident upon an obstacle is the fundamental value to obtain a direction change needed to design a following path. But there is a significant amount of noise due to a caudal fin motor. Because caudal fin provides the main propulsion for a fish robot, there is a periodic swinging noise at the head of a robot. This noise provides a random acceleration effect on the measured acceleration data at the collision. We propose an algorithm which shows that the MEMS-type accelerometers are very effective to provide information for direction changes in spite of the intrinsic noise after the small scale fish robots have made obstacle collision.

Long-range correlations in time series generated by time-fractional diffusion: A numerical study

NASA Astrophysics Data System (ADS)

Barbieri, Davide; Vivoli, Alessandro

2005-09-01

Time series models showing power law tails in autocorrelation functions are common in econometrics. A special non-Markovian model for such kind of time series is provided by the random walk introduced by Gorenflo et al. as a discretization of time fractional diffusion. The time series so obtained are analyzed here from a numerical point of view in terms of autocorrelations and covariance matrices.

Orbit Determination Using Vinti’s Solution

DTIC Science & Technology

2016-09-15

Surveillance Network STK Systems Tool Kit TBP Two Body Problem TLE Two-line Element Set xv Acronym Definition UKF Unscented Kalman Filter WPAFB Wright...simplicity, stability, and speed. On the other hand, Kalman filters would be best suited for sequential estimation of stochastic or random components of a...be likened to how an Unscented Kalman Filter samples a system’s nonlinearities directly, avoiding linearizing the dynamics in the partials matrices

Spiked Models of Large Dimensional Random Matrices Applied to Wireless Communications and Array Signal Processing

DTIC Science & Technology

2013-12-14

population covariance matrix with application to array signal processing; and 5) a sample covariance matrix for which a CLT is studied on linear...Applications , (01 2012): 1150004. doi: Walid Hachem, Malika Kharouf, Jamal Najim, Jack W. Silverstein. A CLT FOR INFORMATION- THEORETIC STATISTICS...for Multi-source Power Estimation, (04 2010) Malika Kharouf, Jamal Najim, Jack W. Silverstein, Walid Hachem. A CLT FOR INFORMATION- THEORETIC

Gait Pattern Alterations during Walking, Texting and Walking and Texting during Cognitively Distractive Tasks while Negotiating Common Pedestrian Obstacles

PubMed Central

Licence, Sammy; Smith, Robynne; McGuigan, Miranda P.; Earnest, Conrad P.

2015-01-01

Objectives Mobile phone texting is a common daily occurrence with a paucity of research examining corresponding gait characteristics. To date, most studies have participants walk in a straight line vs. overcoming barriers and obstacles that occur during regular walking. The aim of our study is to examine the effect of mobile phone texting during periods of cognitive distraction while walking and negotiating barriers synonymous with pedestrian traffic. Methods Thirty participants (18-50y) completed three randomized, counter-balanced walking tasks over a course during: (1) normal walking (control), (2) texting and walking, and (3) texting and walking whilst being cognitively distraction via a standard mathematical test performed while negotiating the obstacle course. We analyzed gait characteristics during course negotiation using a 3-dimensional motion analysis system and a general linear model and Dunnet-Hsu post-hoc procedure the normal walking condition to assess gait characteristic differences. Primary outcomes included the overall time to complete the course time and barrier contact. Secondary outcomes included obstacle clearance height, step frequency, step time, double support phase and lateral deviation. Results Participants took significantly longer (mean ± SD) to complete the course while texting (24.96±4.20 sec) and during cognitive distraction COG (24.09±3.36 sec) vs. normal walking (19.32±2.28 sec; all, P<0.001). No significant differences were noted for barrier contacts (P = 0.28). Step frequency, step time, double support phase and lateral deviation all increased in duration during the texting and cognitive distraction trial. Texting and being cognitively distracted also increased obstacle clearance versus the walking condition (all, P<0.02). Conclusions Texting while walking and/or being cognitively distracted significantly affect gait characteristics concordant to mobile phone usage resulting in a more cautious gate pattern. Future research should also examine a similar study in older participants who may be at a greater risk of tripping with such walking deviations. PMID:26222430

Spectral analysis of finite-time correlation matrices near equilibrium phase transitions

NASA Astrophysics Data System (ADS)

Vinayak; Prosen, T.; Buča, B.; Seligman, T. H.

2014-10-01

We study spectral densities for systems on lattices, which, at a phase transition display, power-law spatial correlations. Constructing the spatial correlation matrix we prove that its eigenvalue density shows a power law that can be derived from the spatial correlations. In practice time series are short in the sense that they are either not stationary over long time intervals or not available over long time intervals. Also we usually do not have time series for all variables available. We shall make numerical simulations on a two-dimensional Ising model with the usual Metropolis algorithm as time evolution. Using all spins on a grid with periodic boundary conditions we find a power law, that is, for large grids, compatible with the analytic result. We still find a power law even if we choose a fairly small subset of grid points at random. The exponents of the power laws will be smaller under such circumstances. For very short time series leading to singular correlation matrices we use a recently developed technique to lift the degeneracy at zero in the spectrum and find a significant signature of critical behavior even in this case as compared to high temperature results which tend to those of random matrix models.

Event-Based Variance-Constrained ${\\mathcal {H}}_{\\infty }$ Filtering for Stochastic Parameter Systems Over Sensor Networks With Successive Missing Measurements.

PubMed

Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

2018-03-01

This paper is concerned with the distributed filtering problem for a class of discrete time-varying stochastic parameter systems with error variance constraints over a sensor network where the sensor outputs are subject to successive missing measurements. The phenomenon of the successive missing measurements for each sensor is modeled via a sequence of mutually independent random variables obeying the Bernoulli binary distribution law. To reduce the frequency of unnecessary data transmission and alleviate the communication burden, an event-triggered mechanism is introduced for the sensor node such that only some vitally important data is transmitted to its neighboring sensors when specific events occur. The objective of the problem addressed is to design a time-varying filter such that both the requirements and the variance constraints are guaranteed over a given finite-horizon against the random parameter matrices, successive missing measurements, and stochastic noises. By recurring to stochastic analysis techniques, sufficient conditions are established to ensure the existence of the time-varying filters whose gain matrices are then explicitly characterized in term of the solutions to a series of recursive matrix inequalities. A numerical simulation example is provided to illustrate the effectiveness of the developed event-triggered distributed filter design strategy.

Multi-dimensional Fokker-Planck equation analysis using the modified finite element method

NASA Astrophysics Data System (ADS)

Náprstek, J.; Král, R.

2016-09-01

The Fokker-Planck equation (FPE) is a frequently used tool for the solution of cross probability density function (PDF) of a dynamic system response excited by a vector of random processes. FEM represents a very effective solution possibility, particularly when transition processes are investigated or a more detailed solution is needed. Actual papers deal with single degree of freedom (SDOF) systems only. So the respective FPE includes two independent space variables only. Stepping over this limit into MDOF systems a number of specific problems related to a true multi-dimensionality must be overcome. Unlike earlier studies, multi-dimensional simplex elements in any arbitrary dimension should be deployed and rectangular (multi-brick) elements abandoned. Simple closed formulae of integration in multi-dimension domain have been derived. Another specific problem represents the generation of multi-dimensional finite element mesh. Assembling of system global matrices should be subjected to newly composed algorithms due to multi-dimensionality. The system matrices are quite full and no advantages following from their sparse character can be profited from, as is commonly used in conventional FEM applications in 2D/3D problems. After verification of partial algorithms, an illustrative example dealing with a 2DOF non-linear aeroelastic system in combination with random and deterministic excitations is discussed.

Cryptosystem for Securing Image Encryption Using Structured Phase Masks in Fresnel Wavelet Transform Domain

NASA Astrophysics Data System (ADS)

Singh, Hukum

2016-12-01

A cryptosystem for securing image encryption is considered by using double random phase encoding in Fresnel wavelet transform (FWT) domain. Random phase masks (RPMs) and structured phase masks (SPMs) based on devil's vortex toroidal lens (DVTL) are used in spatial as well as in Fourier planes. The images to be encrypted are first Fresnel transformed and then single-level discrete wavelet transform (DWT) is apply to decompose LL,HL, LH and HH matrices. The resulting matrices from the DWT are multiplied by additional RPMs and the resultants are subjected to inverse DWT for the encrypted images. The scheme is more secure because of many parameters used in the construction of SPM. The original images are recovered by using the correct parameters of FWT and SPM. Phase mask SPM based on DVTL increases security that enlarges the key space for encryption and decryption. The proposed encryption scheme is a lens-less optical system and its digital implementation has been performed using MATLAB 7.6.0 (R2008a). The computed value of mean-squared-error between the retrieved and the input images shows the efficacy of scheme. The sensitivity to encryption parameters, robustness against occlusion, entropy and multiplicative Gaussian noise attacks have been analysed.

The q-dependent detrended cross-correlation analysis of stock market

NASA Astrophysics Data System (ADS)

Zhao, Longfeng; Li, Wei; Fenu, Andrea; Podobnik, Boris; Wang, Yougui; Stanley, H. Eugene

2018-02-01

Properties of the q-dependent cross-correlation matrices of the stock market have been analyzed by using random matrix theory and complex networks. The correlation structures of the fluctuations at different magnitudes have unique properties. The cross-correlations among small fluctuations are much stronger than those among large fluctuations. The large and small fluctuations are dominated by different groups of stocks. We use complex network representation to study these q-dependent matrices and discover some new identities. By utilizing those q-dependent correlation-based networks, we are able to construct some portfolios of those more independent stocks which consistently perform better. The optimal multifractal order for portfolio optimization is around q  =  2 under the mean-variance portfolio framework, and q\\in[2, 6] under the expected shortfall criterion. These results have deepened our understanding regarding the collective behavior of the complex financial system.

Uncovering the spatial structure of mobility networks

NASA Astrophysics Data System (ADS)

Louail, Thomas; Lenormand, Maxime; Picornell, Miguel; García Cantú, Oliva; Herranz, Ricardo; Frias-Martinez, Enrique; Ramasco, José J.; Barthelemy, Marc

2015-01-01

The extraction of a clear and simple footprint of the structure of large, weighted and directed networks is a general problem that has relevance for many applications. An important example is seen in origin-destination matrices, which contain the complete information on commuting flows, but are difficult to analyze and compare. We propose here a versatile method, which extracts a coarse-grained signature of mobility networks, under the form of a 2 × 2 matrix that separates the flows into four categories. We apply this method to origin-destination matrices extracted from mobile phone data recorded in 31 Spanish cities. We show that these cities essentially differ by their proportion of two types of flows: integrated (between residential and employment hotspots) and random flows, whose importance increases with city size. Finally, the method allows the determination of categories of networks, and in the mobility case, the classification of cities according to their commuting structure.

Effects of imputation on correlation: implications for analysis of mass spectrometry data from multiple biological matrices.

PubMed

Taylor, Sandra L; Ruhaak, L Renee; Kelly, Karen; Weiss, Robert H; Kim, Kyoungmi

2017-03-01

With expanded access to, and decreased costs of, mass spectrometry, investigators are collecting and analyzing multiple biological matrices from the same subject such as serum, plasma, tissue and urine to enhance biomarker discoveries, understanding of disease processes and identification of therapeutic targets. Commonly, each biological matrix is analyzed separately, but multivariate methods such as MANOVAs that combine information from multiple biological matrices are potentially more powerful. However, mass spectrometric data typically contain large amounts of missing values, and imputation is often used to create complete data sets for analysis. The effects of imputation on multiple biological matrix analyses have not been studied. We investigated the effects of seven imputation methods (half minimum substitution, mean substitution, k-nearest neighbors, local least squares regression, Bayesian principal components analysis, singular value decomposition and random forest), on the within-subject correlation of compounds between biological matrices and its consequences on MANOVA results. Through analysis of three real omics data sets and simulation studies, we found the amount of missing data and imputation method to substantially change the between-matrix correlation structure. The magnitude of the correlations was generally reduced in imputed data sets, and this effect increased with the amount of missing data. Significant results from MANOVA testing also were substantially affected. In particular, the number of false positives increased with the level of missing data for all imputation methods. No one imputation method was universally the best, but the simple substitution methods (Half Minimum and Mean) consistently performed poorly. © The Author 2016. Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

Dynamic statistical optimization of GNSS radio occultation bending angles: advanced algorithm and performance analysis

NASA Astrophysics Data System (ADS)

Li, Y.; Kirchengast, G.; Scherllin-Pirscher, B.; Norman, R.; Yuan, Y. B.; Fritzer, J.; Schwaerz, M.; Zhang, K.

2015-08-01

We introduce a new dynamic statistical optimization algorithm to initialize ionosphere-corrected bending angles of Global Navigation Satellite System (GNSS)-based radio occultation (RO) measurements. The new algorithm estimates background and observation error covariance matrices with geographically varying uncertainty profiles and realistic global-mean correlation matrices. The error covariance matrices estimated by the new approach are more accurate and realistic than in simplified existing approaches and can therefore be used in statistical optimization to provide optimal bending angle profiles for high-altitude initialization of the subsequent Abel transform retrieval of refractivity. The new algorithm is evaluated against the existing Wegener Center Occultation Processing System version 5.6 (OPSv5.6) algorithm, using simulated data on two test days from January and July 2008 and real observed CHAllenging Minisatellite Payload (CHAMP) and Constellation Observing System for Meteorology, Ionosphere, and Climate (COSMIC) measurements from the complete months of January and July 2008. The following is achieved for the new method's performance compared to OPSv5.6: (1) significant reduction of random errors (standard deviations) of optimized bending angles down to about half of their size or more; (2) reduction of the systematic differences in optimized bending angles for simulated MetOp data; (3) improved retrieval of refractivity and temperature profiles; and (4) realistically estimated global-mean correlation matrices and realistic uncertainty fields for the background and observations. Overall the results indicate high suitability for employing the new dynamic approach in the processing of long-term RO data into a reference climate record, leading to well-characterized and high-quality atmospheric profiles over the entire stratosphere.

Effect of cane length and swing arc width on drop-off and obstacle detection with the long cane

PubMed Central

Kim, Dae Shik; Emerson, Robert Wall; Naghshineh, Koorosh

2017-01-01

A repeated-measures design with block randomization was used for the study, in which 15 adults with visual impairments attempted to detect the drop-offs and obstacles with the canes of different lengths, swinging the cane in different widths (narrow vs wide). Participants detected the drop-offs significantly more reliably with the standard-length cane (79.5% ± 6.5% of the time) than with the extended-length cane (67.6% ± 9.1%), p <.001. The drop-off detection threshold of the standard-length cane (4.1 ± 1.1 cm) was also significantly smaller than that of the extended-length cane (6.5±1.8cm), p <.001. In addition, participants detected drop-offs at a significantly higher percentage when they swung the cane approximately 3 cm beyond the widest part of the body (78.6% ± 7.6%) than when they swung it substantially wider (30 cm; 68.5% ± 8.3%), p <.001. In contrast, neither cane length (p =.074) nor cane swing arc width (p =.185) had a significant effect on obstacle detection performance. The findings of the study may help orientation and mobility specialists recommend appropriate cane length and cane swing arc width to visually impaired cane users. PMID:29276326

Effect of cane length and swing arc width on drop-off and obstacle detection with the long cane.

PubMed

Kim, Dae Shik; Emerson, Robert Wall; Naghshineh, Koorosh

2017-09-01

A repeated-measures design with block randomization was used for the study, in which 15 adults with visual impairments attempted to detect the drop-offs and obstacles with the canes of different lengths, swinging the cane in different widths (narrow vs wide). Participants detected the drop-offs significantly more reliably with the standard-length cane (79.5% ± 6.5% of the time) than with the extended-length cane (67.6% ± 9.1%), p <.001. The drop-off detection threshold of the standard-length cane (4.1 ± 1.1 cm) was also significantly smaller than that of the extended-length cane (6.5±1.8cm), p <.001. In addition, participants detected drop-offs at a significantly higher percentage when they swung the cane approximately 3 cm beyond the widest part of the body (78.6% ± 7.6%) than when they swung it substantially wider (30 cm; 68.5% ± 8.3%), p <.001. In contrast, neither cane length ( p =.074) nor cane swing arc width ( p =.185) had a significant effect on obstacle detection performance. The findings of the study may help orientation and mobility specialists recommend appropriate cane length and cane swing arc width to visually impaired cane users.

An efficient algorithm for the generalized Foldy-Lax formulation

NASA Astrophysics Data System (ADS)

Huang, Kai; Li, Peijun; Zhao, Hongkai

2013-02-01

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

Needle Steering in 3-D Via Rapid Replanning

PubMed Central

Patil, Sachin; Burgner, Jessica; Webster, Robert J.; Alterovitz, Ron

2014-01-01

Steerable needles have the potential to improve the effectiveness of needle-based clinical procedures such as biopsy and drug delivery by improving targeting accuracy and reaching previously inaccessible targets that are behind sensitive or impenetrable anatomical regions. We present a new needle steering system capable of automatically reaching targets in 3-D environments while avoiding obstacles and compensating for real-world uncertainties. Given a specification of anatomical obstacles and a clinical target (e.g., from preoperative medical images), our system plans and controls needle motion in a closed-loop fashion under sensory feedback to optimize a clinical metric. We unify planning and control using a new fast algorithm that continuously replans the needle motion. Our rapid replanning approach is enabled by an efficient sampling-based rapidly exploring random tree (RRT) planner that achieves orders-of-magnitude reduction in computation time compared with prior 3-D approaches by incorporating variable curvature kinematics and a novel distance metric for planning. Our system uses an electromagnetic tracking system to sense the state of the needle tip during the procedure. We experimentally evaluate our needle steering system using tissue phantoms and animal tissue ex vivo. We demonstrate that our rapid replanning strategy successfully guides the needle around obstacles to desired 3-D targets with an average error of less than 3 mm. PMID:25435829

Differences in Military Obstacle Course Performance Between Three Energy-Storing and Shock-Adapting Prosthetic Feet in High-Functioning Transtibial Amputees: A Double-Blind, Randomized Control Trial.

PubMed

Highsmith, M Jason; Kahle, Jason T; Miro, Rebecca M; Lura, Derek J; Carey, Stephanie L; Wernke, Matthew M; Kim, Seok Hun; Quillen, William S

2016-11-01

Approximately 683 persons engaged in military service experienced transtibial amputation (TTA) related to recent war in Iraq and Afghanistan. Military TTAs function at a level beyond basic ambulation. No empirical data demonstrate which higher functioning prosthetic feet maximize injured service personnel's ability to continue performing at a level commensurate with return to duty. This study's purpose was to determine which of three high-functioning, energy-storing prosthetic feet maximize performance and preference in a field obstacle course (OC) and to quantify physical performance differences between TTAs and high-functioning nonamputees. A randomized, double-blind, repeated measures experimental design compared three prosthetic feet (Ossur Variflex, Endolite Elite Blade, and Ossur Re-Flex Rotate) during performance on a field OC. TTAs accommodated with study feet and the OC before assessment. 14 TTAs and 14 nonamputee controls completed the course. Subjective and objective performance differences were compared across feet conditions and between groups. Total OC completion times were similar between prosthetic feet: Elite-Blade (419 seconds ± 130), Variflex (425 seconds ± 144), and Re-Flex Rotate (444 seconds ± 220). Controls' OC completion time (287.2 seconds ± 58) was less (p ≤ 0.05) than TTA times. In total, controls had faster completion times (p ≤ 0.05) compared to all prosthetic feet conditions in 13/17 obstacles. Re-Flex Rotate had 2 additional obstacles different (p ≤ 0.05) than controls and required more time to complete. Median RPE values were lower (p ≤ 0.05) for controls than TTA regardless of foot. Regarding foot preference for OC completion, 7/14 (50%) preferred Elite Blade, 5/14 (36%) preferred Re-Flex Rotate, and the remaining 2/14 (14%) preferred Variflex. Controls completed the OC faster and with less effort than TTAs regardless of prosthetic foot. No clear differences in prosthetic feet emerged during OC completion; however, individual task performance, perceived effort, and preference resulted in trends of slight performance improvement with and preference for Elite Blade, a dual function energy-storing and return foot combined with vertical shock absorption. Understanding how to maximally improve performance in such functional tasks may allow service members to best sustain physical fitness, return to their military occupational specialty and possibly in-theater duty. Reprint & Copyright © 2016 Association of Military Surgeons of the U.S.

Genomic relations among 31 species of Mammillaria haworth (Cactaceae) using random amplified polymorphic DNA.

PubMed

Mattagajasingh, Ilwola; Mukherjee, Arup Kumar; Das, Premananda

2006-01-01

Thirty-one species of Mammillaria were selected to study the molecular phylogeny using random amplified polymorphic DNA (RAPD) markers. High amount of mucilage (gelling polysaccharides) present in Mammillaria was a major obstacle in isolating good quality genomic DNA. The CTAB (cetyl trimethyl ammonium bromide) method was modified to obtain good quality genomic DNA. Twenty-two random decamer primers resulted in 621 bands, all of which were polymorphic. The similarity matrix value varied from 0.109 to 0.622 indicating wide variability among the studied species. The dendrogram obtained from the unweighted pair group method using arithmetic averages (UPGMA) analysis revealed that some of the species did not follow the conventional classification. The present work shows the usefulness of RAPD markers for genetic characterization to establish phylogenetic relations among Mammillaria species.

Proteolytic and non-proteolytic regulation of collective cell invasion: tuning by ECM density and organization

PubMed Central

Kumar, Sandeep; Kapoor, Aastha; Desai, Sejal; Inamdar, Mandar M.; Sen, Shamik

2016-01-01

Cancer cells manoeuvre through extracellular matrices (ECMs) using different invasion modes, including single cell and collective cell invasion. These modes rely on MMP-driven ECM proteolysis to make space for cells to move. How cancer-associated alterations in ECM influence the mode of invasion remains unclear. Further, the sensitivity of the two invasion modes to MMP dynamics remains unexplored. In this paper, we address these open questions using a multiscale hybrid computational model combining ECM density-dependent MMP secretion, MMP diffusion, ECM degradation by MMP and active cell motility. Our results demonstrate that in randomly aligned matrices, collective cell invasion is more efficient than single cell invasion. Although increase in MMP secretion rate enhances invasiveness independent of cell–cell adhesion, sustenance of collective invasion in dense matrices requires high MMP secretion rates. However, matrix alignment can sustain both single cell and collective cell invasion even without ECM proteolysis. Similar to our in-silico observations, increase in ECM density and MMP inhibition reduced migration of MCF-7 cells embedded in sandwich gels. Together, our results indicate that apart from cell intrinsic factors (i.e., high cell–cell adhesion and MMP secretion rates), ECM density and organization represent two important extrinsic parameters that govern collective cell invasion and invasion plasticity. PMID:26832069

Easy way to determine quantitative spatial resolution distribution for a general inverse problem

NASA Astrophysics Data System (ADS)

An, M.; Feng, M.

2013-12-01

The spatial resolution computation of a solution was nontrivial and more difficult than solving an inverse problem. Most geophysical studies, except for tomographic studies, almost uniformly neglect the calculation of a practical spatial resolution. In seismic tomography studies, a qualitative resolution length can be indicatively given via visual inspection of the restoration of a synthetic structure (e.g., checkerboard tests). An effective strategy for obtaining quantitative resolution length is to calculate Backus-Gilbert resolution kernels (also referred to as a resolution matrix) by matrix operation. However, not all resolution matrices can provide resolution length information, and the computation of resolution matrix is often a difficult problem for very large inverse problems. A new class of resolution matrices, called the statistical resolution matrices (An, 2012, GJI), can be directly determined via a simple one-parameter nonlinear inversion performed based on limited pairs of random synthetic models and their inverse solutions. The total procedure were restricted to forward/inversion processes used in the real inverse problem and were independent of the degree of inverse skill used in the solution inversion. Spatial resolution lengths can be directly given during the inversion. Tests on 1D/2D/3D model inversion demonstrated that this simple method can be at least valid for a general linear inverse problem.

Limited Rationality and Its Quantification Through the Interval Number Judgments With Permutations.

PubMed

Liu, Fang; Pedrycz, Witold; Zhang, Wei-Guo

2017-12-01

The relative importance of alternatives expressed in terms of interval numbers in the fuzzy analytic hierarchy process aims to capture the uncertainty experienced by decision makers (DMs) when making a series of comparisons. Under the assumption of full rationality, the judgements of DMs in the typical analytic hierarchy process could be consistent. However, since the uncertainty in articulating the opinions of DMs is unavoidable, the interval number judgements are associated with the limited rationality. In this paper, we investigate the concept of limited rationality by introducing interval multiplicative reciprocal comparison matrices. By analyzing the consistency of interval multiplicative reciprocal comparison matrices, it is observed that the interval number judgements are inconsistent. By considering the permutations of alternatives, the concepts of approximation-consistency and acceptable approximation-consistency of interval multiplicative reciprocal comparison matrices are proposed. The exchange method is designed to generate all the permutations. A novel method of determining the interval weight vector is proposed under the consideration of randomness in comparing alternatives, and a vector of interval weights is determined. A new algorithm of solving decision making problems with interval multiplicative reciprocal preference relations is provided. Two numerical examples are carried out to illustrate the proposed approach and offer a comparison with the methods available in the literature.

Scalable randomized benchmarking of non-Clifford gates

NASA Astrophysics Data System (ADS)

Cross, Andrew; Magesan, Easwar; Bishop, Lev; Smolin, John; Gambetta, Jay

Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of n-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomized benchmarking procedure over n-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabilizer codes. We present efficient methods for representing and composing group elements, sampling them uniformly, and synthesizing corresponding poly (n) -sized circuits. The procedure provides experimental access to two independent parameters that together characterize the average gate fidelity of a group element. We acknowledge support from ARO under Contract W911NF-14-1-0124.

The Restricted Isometry Property for Time-Frequency Structured Random Matrices

DTIC Science & Technology

2011-06-16

tests illustrating the use of Ψg for compressive sensing are presented in [41]. They illustrate that empirically Ψg performs very similarly to a...E.J., J., Tao, T., Romberg , J.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans...Inform. Theory 52(2), 489–509 (2006) [12] Candès, E.J., Romberg , J., Tao, T.: Stable signal recovery from incomplete and inaccurate mea- surements. Comm

Asymptotic analysis of the density of states in random matrix models associated with a slowly decaying weight

NASA Astrophysics Data System (ADS)

Kuijlaars, A. B. J.

2001-08-01

The asymptotic behavior of polynomials that are orthogonal with respect to a slowly decaying weight is very different from the asymptotic behavior of polynomials that are orthogonal with respect to a Freud-type weight. While the latter has been extensively studied, much less is known about the former. Following an earlier investigation into the zero behavior, we study here the asymptotics of the density of states in a unitary ensemble of random matrices with a slowly decaying weight. This measure is also naturally connected with the orthogonal polynomials. It is shown that, after suitable rescaling, the weak limit is the same as the weak limit of the rescaled zeros.

Electromagnetic Scattering by Spheroidal Volumes of Discrete Random Medium

NASA Technical Reports Server (NTRS)

Dlugach, Janna M.; Mishchenko, Michael I.

2017-01-01

We use the superposition T-matrix method to compare the far-field scattering matrices generated by spheroidal and spherical volumes of discrete random medium having the same volume and populated by identical spherical particles. Our results fully confirm the robustness of the previously identified coherent and diffuse scattering regimes and associated optical phenomena exhibited by spherical particulate volumes and support their explanation in terms of the interference phenomenon coupled with the order-of-scattering expansion of the far-field Foldy equations. We also show that increasing non-sphericity of particulate volumes causes discernible (albeit less pronounced) optical effects in forward and backscattering directions and explain them in terms of the same interference/multiple-scattering phenomenon.

Computer access security code system

NASA Technical Reports Server (NTRS)

Collins, Earl R., Jr. (Inventor)

1990-01-01

A security code system for controlling access to computer and computer-controlled entry situations comprises a plurality of subsets of alpha-numeric characters disposed in random order in matrices of at least two dimensions forming theoretical rectangles, cubes, etc., such that when access is desired, at least one pair of previously unused character subsets not found in the same row or column of the matrix is chosen at random and transmitted by the computer. The proper response to gain access is transmittal of subsets which complete the rectangle, and/or a parallelepiped whose opposite corners were defined by first groups of code. Once used, subsets are not used again to absolutely defeat unauthorized access by eavesdropping, and the like.

Monocular Depth Perception and Robotic Grasping of Novel Objects

DTIC Science & Technology

2009-06-01

resulting algorithm is able to learn monocular vision cues that accurately estimate the relative depths of obstacles in a scene. Reinforcement learning ... learning still make sense in these settings? Since many of the cues that are useful for estimating depth can be re-created in synthetic images, we...supervised learning approach to this problem, and use a Markov Random Field (MRF) to model the scene depth as a function of the image features. We show

Communication: Distinguishing between short-time non-Fickian diffusion and long-time Fickian diffusion for a random walk on a crowded lattice

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

Ellery, Adam J.; Simpson, Matthew J.; Baker, Ruth E.

2016-05-07

The motion of cells and molecules through biological environments is often hindered by the presence of other cells and molecules. A common approach to modeling this kind of hindered transport is to examine the mean squared displacement (MSD) of a motile tracer particle in a lattice-based stochastic random walk in which some lattice sites are occupied by obstacles. Unfortunately, stochastic models can be computationally expensive to analyze because we must average over a large ensemble of identically prepared realizations to obtain meaningful results. To overcome this limitation we describe an exact method for analyzing a lattice-based model of the motionmore » of an agent moving through a crowded environment. Using our approach we calculate the exact MSD of the motile agent. Our analysis confirms the existence of a transition period where, at first, the MSD does not follow a power law with time. However, after a sufficiently long period of time, the MSD increases in proportion to time. This latter phase corresponds to Fickian diffusion with a reduced diffusivity owing to the presence of the obstacles. Our main result is to provide a mathematically motivated, reproducible, and objective estimate of the amount of time required for the transport to become Fickian. Our new method to calculate this crossover time does not rely on stochastic simulations.« less

Anomalous versus Slowed-Down Brownian Diffusion in the Ligand-Binding Equilibrium

PubMed Central

Soula, Hédi; Caré, Bertrand; Beslon, Guillaume; Berry, Hugues

2013-01-01

Measurements of protein motion in living cells and membranes consistently report transient anomalous diffusion (subdiffusion) that converges back to a Brownian motion with reduced diffusion coefficient at long times after the anomalous diffusion regime. Therefore, slowed-down Brownian motion could be considered the macroscopic limit of transient anomalous diffusion. On the other hand, membranes are also heterogeneous media in which Brownian motion may be locally slowed down due to variations in lipid composition. Here, we investigate whether both situations lead to a similar behavior for the reversible ligand-binding reaction in two dimensions. We compare the (long-time) equilibrium properties obtained with transient anomalous diffusion due to obstacle hindrance or power-law-distributed residence times (continuous-time random walks) to those obtained with space-dependent slowed-down Brownian motion. Using theoretical arguments and Monte Carlo simulations, we show that these three scenarios have distinctive effects on the apparent affinity of the reaction. Whereas continuous-time random walks decrease the apparent affinity of the reaction, locally slowed-down Brownian motion and local hindrance by obstacles both improve it. However, only in the case of slowed-down Brownian motion is the affinity maximal when the slowdown is restricted to a subregion of the available space. Hence, even at long times (equilibrium), these processes are different and exhibit irreconcilable behaviors when the area fraction of reduced mobility changes. PMID:24209851

Random Matrix Theory in molecular dynamics analysis.

PubMed

Palese, Luigi Leonardo

2015-01-01

It is well known that, in some situations, principal component analysis (PCA) carried out on molecular dynamics data results in the appearance of cosine-shaped low index projections. Because this is reminiscent of the results obtained by performing PCA on a multidimensional Brownian dynamics, it has been suggested that short-time protein dynamics is essentially nothing more than a noisy signal. Here we use Random Matrix Theory to analyze a series of short-time molecular dynamics experiments which are specifically designed to be simulations with high cosine content. We use as a model system the protein apoCox17, a mitochondrial copper chaperone. Spectral analysis on correlation matrices allows to easily differentiate random correlations, simply deriving from the finite length of the process, from non-random signals reflecting the intrinsic system properties. Our results clearly show that protein dynamics is not really Brownian also in presence of the cosine-shaped low index projections on principal axes. Copyright © 2014 Elsevier B.V. All rights reserved.

Are Randomized Controlled Trials the (G)old Standard? From Clinical Intelligence to Prescriptive Analytics.

PubMed

Van Poucke, Sven; Thomeer, Michiel; Heath, John; Vukicevic, Milan

2016-07-06

Despite the accelerating pace of scientific discovery, the current clinical research enterprise does not sufficiently address pressing clinical questions. Given the constraints on clinical trials, for a majority of clinical questions, the only relevant data available to aid in decision making are based on observation and experience. Our purpose here is 3-fold. First, we describe the classic context of medical research guided by Poppers' scientific epistemology of "falsificationism." Second, we discuss challenges and shortcomings of randomized controlled trials and present the potential of observational studies based on big data. Third, we cover several obstacles related to the use of observational (retrospective) data in clinical studies. We conclude that randomized controlled trials are not at risk for extinction, but innovations in statistics, machine learning, and big data analytics may generate a completely new ecosystem for exploration and validation.

Are Randomized Controlled Trials the (G)old Standard? From Clinical Intelligence to Prescriptive Analytics

PubMed Central

2016-01-01

Despite the accelerating pace of scientific discovery, the current clinical research enterprise does not sufficiently address pressing clinical questions. Given the constraints on clinical trials, for a majority of clinical questions, the only relevant data available to aid in decision making are based on observation and experience. Our purpose here is 3-fold. First, we describe the classic context of medical research guided by Poppers’ scientific epistemology of “falsificationism.” Second, we discuss challenges and shortcomings of randomized controlled trials and present the potential of observational studies based on big data. Third, we cover several obstacles related to the use of observational (retrospective) data in clinical studies. We conclude that randomized controlled trials are not at risk for extinction, but innovations in statistics, machine learning, and big data analytics may generate a completely new ecosystem for exploration and validation. PMID:27383622

Spatio-temporal Hotelling observer for signal detection from image sequences

PubMed Central

Caucci, Luca; Barrett, Harrison H.; Rodríguez, Jeffrey J.

2010-01-01

Detection of signals in noisy images is necessary in many applications, including astronomy and medical imaging. The optimal linear observer for performing a detection task, called the Hotelling observer in the medical literature, can be regarded as a generalization of the familiar prewhitening matched filter. Performance on the detection task is limited by randomness in the image data, which stems from randomness in the object, randomness in the imaging system, and randomness in the detector outputs due to photon and readout noise, and the Hotelling observer accounts for all of these effects in an optimal way. If multiple temporal frames of images are acquired, the resulting data set is a spatio-temporal random process, and the Hotelling observer becomes a spatio-temporal linear operator. This paper discusses the theory of the spatio-temporal Hotelling observer and estimation of the required spatio-temporal covariance matrices. It also presents a parallel implementation of the observer on a cluster of Sony PLAYSTATION 3 gaming consoles. As an example, we consider the use of the spatio-temporal Hotelling observer for exoplanet detection. PMID:19550494

Spatio-temporal Hotelling observer for signal detection from image sequences.

PubMed

Caucci, Luca; Barrett, Harrison H; Rodriguez, Jeffrey J

2009-06-22

Detection of signals in noisy images is necessary in many applications, including astronomy and medical imaging. The optimal linear observer for performing a detection task, called the Hotelling observer in the medical literature, can be regarded as a generalization of the familiar prewhitening matched filter. Performance on the detection task is limited by randomness in the image data, which stems from randomness in the object, randomness in the imaging system, and randomness in the detector outputs due to photon and readout noise, and the Hotelling observer accounts for all of these effects in an optimal way. If multiple temporal frames of images are acquired, the resulting data set is a spatio-temporal random process, and the Hotelling observer becomes a spatio-temporal linear operator. This paper discusses the theory of the spatio-temporal Hotelling observer and estimation of the required spatio-temporal covariance matrices. It also presents a parallel implementation of the observer on a cluster of Sony PLAYSTATION 3 gaming consoles. As an example, we consider the use of the spatio-temporal Hotelling observer for exoplanet detection.

Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability

NASA Astrophysics Data System (ADS)

Kar, Soummya; Moura, José M. F.

2011-04-01

The paper presents the gossip interactive Kalman filter (GIKF) for distributed Kalman filtering for networked systems and sensor networks, where inter-sensor communication and observations occur at the same time-scale. The communication among sensors is random; each sensor occasionally exchanges its filtering state information with a neighbor depending on the availability of the appropriate network link. We show that under a weak distributed detectability condition: 1. the GIKF error process remains stochastically bounded, irrespective of the instability properties of the random process dynamics; and 2. the network achieves \\emph{weak consensus}, i.e., the conditional estimation error covariance at a (uniformly) randomly selected sensor converges in distribution to a unique invariant measure on the space of positive semi-definite matrices (independent of the initial state.) To prove these results, we interpret the filtered states (estimates and error covariances) at each node in the GIKF as stochastic particles with local interactions. We analyze the asymptotic properties of the error process by studying as a random dynamical system the associated switched (random) Riccati equation, the switching being dictated by a non-stationary Markov chain on the network graph.

Preliminary Evaluation of an Algorithm for Analysis of Stationary Random Data from a Multiple-Input Linear System.

DTIC Science & Technology

1979-07-01

nel for low-frequency filters with Lg92/Lgl = 4.4 for S/N1 = 1. 71. CASE 1, S/NF= 1, S/I1 1 M=5 M1=10 M1=20 C! a ip a a a a 00 2 3Ma a0 0 M𔃺 M 3...Gantmacher, The Theory of Matrices, VoZ . 1, Chelsea Publishing Co., New York, NJ.Y., 1959. 163

Mechanical environmental test program for the Communications Technology Satellite

NASA Technical Reports Server (NTRS)

Buckingham, R.; Sharp, G. R.

1974-01-01

This paper describes the spacecraft and subsystem level mechanical environmental test program which was developed for the Communications Technology Satellite (CTS). At the spacecraft level it includes sine and random vibration, static loading, centrifuge loading, pyrotechnic and separation shock simulation and (tentatively) acoustics. At the subsystem level it entails the same type of environmental exposure as applicable. Matrices of system and subsystem tests are presented showing type, level and hardware status for each major test.

A computational proposal for designing structured RNA pools for in vitro selection of RNAs.

PubMed

Kim, Namhee; Gan, Hin Hark; Schlick, Tamar

2007-04-01

Although in vitro selection technology is a versatile experimental tool for discovering novel synthetic RNA molecules, finding complex RNA molecules is difficult because most RNAs identified from random sequence pools are simple motifs, consistent with recent computational analysis of such sequence pools. Thus, enriching in vitro selection pools with complex structures could increase the probability of discovering novel RNAs. Here we develop an approach for engineering sequence pools that links RNA sequence space regions with corresponding structural distributions via a "mixing matrix" approach combined with a graph theory analysis. We define five classes of mixing matrices motivated by covariance mutations in RNA; these constructs define nucleotide transition rates and are applied to chosen starting sequences to yield specific nonrandom pools. We examine the coverage of sequence space as a function of the mixing matrix and starting sequence via clustering analysis. We show that, in contrast to random sequences, which are associated only with a local region of sequence space, our designed pools, including a structured pool for GTP aptamers, can target specific motifs. It follows that experimental synthesis of designed pools can benefit from using optimized starting sequences, mixing matrices, and pool fractions associated with each of our constructed pools as a guide. Automation of our approach could provide practical tools for pool design applications for in vitro selection of RNAs and related problems.

Comprehensive Metabolomic Analysis in Blood, Urine, Fat, and Muscle in Men with Metabolic Syndrome: A Randomized, Placebo-Controlled Clinical Trial on the Effects of Resveratrol after Four Months' Treatment.

PubMed

Korsholm, Anne Sofie; Kjær, Thomas Nordstrøm; Ornstrup, Marie Juul; Pedersen, Steen Bønløkke

2017-03-04

Resveratrol possesses several beneficial metabolic effects in rodents, while the effects of resveratrol in humans remain unclear. Therefore, we performed a non-targeted comprehensive metabolomic analysis on blood, urine, adipose tissue, and skeletal muscle tissue in middle-aged men with metabolic syndrome randomized to either resveratrol or placebo treatment for four months. Changes in steroid hormones across all four matrices were the most pronounced changes observed. Resveratrol treatment reduced sulfated androgen precursors in blood, adipose tissue, and muscle tissue, and increased these metabolites in urine. Furthermore, markers of muscle turnover were increased and lipid metabolism was affected, with increased intracellular glycerol and accumulation of long-chain saturated, monounsaturated, and polyunsaturated (n3 and n6) free fatty acids in resveratrol-treated men. Finally, urinary derivatives of aromatic amino acids, which mainly reflect the composition of the gut microbiota, were altered upon resveratrol treatment. In conclusion, the non-targeted metabolomics approach applied to four different matrices provided evidence of subtle but robust effects on several metabolic pathways following resveratrol treatment for four months in men with metabolic syndrome-effects that, for the most part, would not have been detected by routine analyses. The affected pathways should be the focus of future clinical trials on resveratrol's effects, and perhaps particularly the areas of steroid metabolism and the gut microbiome.

Application of Optical Flow Sensors for Dead Reckoning, Heading Reference, Obstacle Detection, and Obstacle Avoidance

DTIC Science & Technology

2015-09-01

OPTICAL FLOW SENSORS FOR DEAD RECKONING, HEADING REFERENCE, OBSTACLE DETECTION, AND OBSTACLE AVOIDANCE by Tarek M. Nejah September 2015...SENSORS FOR DEAD RECKONING, HEADING REFERENCE, OBSTACLE DETECTION, AND OBSTACLE AVOIDANCE 5. FUNDING NUMBERS 6. AUTHOR(S) Nejah, Tarek M. 7...DISTRIBUTION CODE 13. ABSTRACT (maximum 200 words) A novel approach for dead reckoning, heading reference, obstacle detection, and obstacle

Stepping over obstacles: gait patterns of healthy young and old adults.

PubMed

Chen, H C; Ashton-Miller, J A; Alexander, N B; Schultz, A B

1991-11-01

Falls associated with tripping over an obstacle can be devastating to elderly individuals, yet little is known about the strategies used for stepping over obstacles by either old or young adults. The gait of gender-matched groups of 24 young and 24 old healthy adults (mean ages 22 and 71 years) was studied during a 4 m approach to and while stepping over obstacles of 0, 25, 51, or 152 mm height and in level obstacle-free walking. Optoelectronic cameras and recorders were used to record approach and obstacle crossing speeds as well as bilateral lower extremity kinematic parameters that described foot placement and movement trajectories relative to the obstacle. The results showed that age had no effect on minimum swing foot clearance (FC) over an obstacle. For the 25 mm obstacle, mean FC was 64 mm, or approximately three times that used in level gait; FC increased nonlinearly with obstacle height for all subjects. Although no age differences were found in obstacle-free gait, old adults exhibited a significantly more conservative strategy when crossing obstacles, with slower crossing speed, shorter step length, and shorter obstacle-heel strike distance. In addition, the old adults crossed the obstacle so that it was 10% further forward in their obstacle-crossing step. Although all subjects successfully avoided the riskiest form of obstacle contact, tripping, 4/24 healthy old adults stepped on an obstacle, demonstrating an increased risk for obstacle contact with age.

A stochastic Markov chain model to describe lung cancer growth and metastasis.

PubMed

Newton, Paul K; Mason, Jeremy; Bethel, Kelly; Bazhenova, Lyudmila A; Nieva, Jorge; Kuhn, Peter

2012-01-01

A stochastic Markov chain model for metastatic progression is developed for primary lung cancer based on a network construction of metastatic sites with dynamics modeled as an ensemble of random walkers on the network. We calculate a transition matrix, with entries (transition probabilities) interpreted as random variables, and use it to construct a circular bi-directional network of primary and metastatic locations based on postmortem tissue analysis of 3827 autopsies on untreated patients documenting all primary tumor locations and metastatic sites from this population. The resulting 50 potential metastatic sites are connected by directed edges with distributed weightings, where the site connections and weightings are obtained by calculating the entries of an ensemble of transition matrices so that the steady-state distribution obtained from the long-time limit of the Markov chain dynamical system corresponds to the ensemble metastatic distribution obtained from the autopsy data set. We condition our search for a transition matrix on an initial distribution of metastatic tumors obtained from the data set. Through an iterative numerical search procedure, we adjust the entries of a sequence of approximations until a transition matrix with the correct steady-state is found (up to a numerical threshold). Since this constrained linear optimization problem is underdetermined, we characterize the statistical variance of the ensemble of transition matrices calculated using the means and variances of their singular value distributions as a diagnostic tool. We interpret the ensemble averaged transition probabilities as (approximately) normally distributed random variables. The model allows us to simulate and quantify disease progression pathways and timescales of progression from the lung position to other sites and we highlight several key findings based on the model.

Right unilateral electroconvulsive therapy does not cause more cognitive impairment than pharmacologic treatment in treatment-resistant bipolar depression: A 6-month randomized controlled trial follow-up study.

PubMed

Bjoerke-Bertheussen, Jeanette; Schoeyen, Helle; Andreassen, Ole A; Malt, Ulrik F; Oedegaard, Ketil J; Morken, Gunnar; Sundet, Kjetil; Vaaler, Arne E; Auestad, Bjoern; Kessler, Ute

2017-12-21

Electroconvulsive therapy is an effective treatment for bipolar depression, but there are concerns about whether it causes long-term neurocognitive impairment. In this multicenter randomized controlled trial, in-patients with treatment-resistant bipolar depression were randomized to either algorithm-based pharmacologic treatment or right unilateral electroconvulsive therapy. After the 6-week treatment period, all of the patients received maintenance pharmacotherapy as recommended by their clinician guided by a relevant treatment algorithm. Patients were assessed at baseline and at 6 months. Neurocognitive functions were assessed using the Measurement and Treatment Research to Improve Cognition in Schizophrenia (MATRICS) Consensus Cognitive Battery, and autobiographical memory consistency was assessed using the Autobiographical Memory Interview-Short Form. Seventy-three patients entered the trial, of whom 51 and 26 completed neurocognitive assessments at baseline and 6 months, respectively. The MATRICS Consensus Cognitive Battery composite score improved by 4.1 points in both groups (P = .042) from baseline to 6 months (from 40.8 to 44.9 and from 41.9 to 46.0 in the algorithm-based pharmacologic treatment and electroconvulsive therapy groups, respectively). The Autobiographical Memory Interview-Short Form consistency scores were reduced in both groups (72.3% vs 64.3% in the algorithm-based pharmacologic treatment and electroconvulsive therapy groups, respectively; P = .085). This study did not find that right unilateral electroconvulsive therapy caused long-term impairment in neurocognitive functions compared to algorithm-based pharmacologic treatment in bipolar depression as measured using standard neuropsychological tests, but due to the low number of patients in the study the results should be interpreted with caution. ClinicalTrials.gov: NCT00664976. © 2017 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

The difference between two random mixed quantum states: exact and asymptotic spectral analysis

NASA Astrophysics Data System (ADS)

Mejía, José; Zapata, Camilo; Botero, Alonso

2017-01-01

We investigate the spectral statistics of the difference of two density matrices, each of which is independently obtained by partially tracing a random bipartite pure quantum state. We first show how a closed-form expression for the exact joint eigenvalue probability density function for arbitrary dimensions can be obtained from the joint probability density function of the diagonal elements of the difference matrix, which is straightforward to compute. Subsequently, we use standard results from free probability theory to derive a relatively simple analytic expression for the asymptotic eigenvalue density (AED) of the difference matrix ensemble, and using Carlson’s theorem, we obtain an expression for its absolute moments. These results allow us to quantify the typical asymptotic distance between the two random mixed states using various distance measures; in particular, we obtain the almost sure asymptotic behavior of the operator norm distance and the trace distance.

H∞ control for uncertain linear system over networks with Bernoulli data dropout and actuator saturation.

PubMed

Yu, Jimin; Yang, Chenchen; Tang, Xiaoming; Wang, Ping

2018-03-01

This paper investigates the H ∞ control problems for uncertain linear system over networks with random communication data dropout and actuator saturation. The random data dropout process is modeled by a Bernoulli distributed white sequence with a known conditional probability distribution and the actuator saturation is confined in a convex hull by introducing a group of auxiliary matrices. By constructing a quadratic Lyapunov function, effective conditions for the state feedback-based H ∞ controller and the observer-based H ∞ controller are proposed in the form of non-convex matrix inequalities to take the random data dropout and actuator saturation into consideration simultaneously, and the problem of non-convex feasibility is solved by applying cone complementarity linearization (CCL) procedure. Finally, two simulation examples are given to demonstrate the effectiveness of the proposed new design techniques. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Pruning a minimum spanning tree

NASA Astrophysics Data System (ADS)

Sandoval, Leonidas

2012-04-01

This work employs various techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the study of random networks with the same probability density distribution of the original data. The second technique is to judge the strength of a connection by its survival rate, which is the amount of time a connection between two stock market indices endures. The idea is that true connections will survive for longer periods of time, and that random connections will not. That information is then combined with the information obtained from the first technique in order to create a smaller network, in which most of the connections are either strong or enduring in time.

Correlation Energies from the Two-Component Random Phase Approximation.

PubMed

Kühn, Michael

2014-02-11

The correlation energy within the two-component random phase approximation accounting for spin-orbit effects is derived. The resulting plasmon equation is rewritten-analogously to the scalar relativistic case-in terms of the trace of two Hermitian matrices for (Kramers-restricted) closed-shell systems and then represented as an integral over imaginary frequency using the resolution of the identity approximation. The final expression is implemented in the TURBOMOLE program suite. The code is applied to the computation of equilibrium distances and vibrational frequencies of heavy diatomic molecules. The efficiency is demonstrated by calculation of the relative energies of the Oh-, D4h-, and C5v-symmetric isomers of Pb6. Results within the random phase approximation are obtained based on two-component Kohn-Sham reference-state calculations, using effective-core potentials. These values are finally compared to other two-component and scalar relativistic methods, as well as experimental data.

The Effect of Variability of Practice at Execution Redundancy Level in Skilled and Novice Basketball Players.

PubMed

Taheri, Hamidreza; Fazeli, Davoud; Poureghbali, Sogand

2017-04-01

We investigated the effect of practice variability through execution redundancy in skilled and novice basketball players on free throw skills. Twelve skilled basketball players and 12 novices (mean age = 25.4 years, SD = 4.3) were divided into four groups (skilled constant, skilled variable, novice constant, and novice variable). After a pretest, participants practiced free throw action. The variable groups threw the ball over an obstacle of varying heights on each trial in random order, whereas the obstacle's height was fixed for the constant groups. After 7 and 14 consecutive days of practice, participants performed two posttests with constant and variable distances from the basket. The results showed that practicing different solutions of a task did not affect the performance of skilled players but had an immediate negative effect on the performance of novice players. Learning a complex task is the result of learning task-related parameters, and practice variability can create a mismatch between task difficulty and new learner skill levels.

Disaster Planning and Risk Communication With Vulnerable Communities: Lessons From Hurricane Katrina

PubMed Central

Eisenman, David P.; Cordasco, Kristina M.; Asch, Steve; Golden, Joya F.; Glik, Deborah

2007-01-01

Objectives. We studied the experience of Hurricane Katrina evacuees to better understand factors influencing evacuation decisions in impoverished, mainly minority communities that were most severely affected by the disaster. Methods. We performed qualitative interviews with 58 randomly selected evacuees living in Houston’s major evacuation centers from September 9 to 12, 2005. Transcripts were content analyzed using grounded theory methodology. Results. Participants were mainly African American, had low incomes, and were from New Orleans. Participants’ strong ties to extended family, friends, and community groups influenced other factors affecting evacuation, including transportation, access to shelter, and perception of evacuation messages. These social connections cut both ways, which facilitated and hindered evacuation decisions. Conclusions. Effective disaster plans must account for the specific obstacles encountered by vulnerable and minority communities. Removing the more apparent obstacles of shelter and transportation will likely be insufficient for improving disaster plans for impoverished, minority communities. The important influence of extended families and social networks demand better community-based communication and preparation strategies. PMID:17413069

Maintenance of weight loss: a needs assessment.

PubMed

DePue, J D; Clark, M M; Ruggiero, L; Medeiros, M L; Pera, V

1995-05-01

This study identified facilitators and obstacles to maintenance of weight loss following a very-low-calorie-diet and behavior modification program. A survey was mailed to a random sample of 178 program completers and received a 61% response rate; the most frequent follow-up period was more than 2 years. Twenty-nine percent reported weighing the same (within 10 lbs) or less than the end of their participation in the treatment program (maintainers), while 71% reported their present weight was a mean of 65% higher than their initial weight loss (regainers). Maintainers were significantly more likely to report engaging in regular aerobic exercise, attending a maintenance support group, and confidence in their ability to manage their weight in the future, while regainers were more likely to report stress and motivation as frequent weight management obstacles. Respondents consistently identified the need for low/no cost ongoing support. Maintainers and relapsers reported similar challenges in managing their weight, yet with different results, suggesting the need to identify subgroups for which different post-treatment support options could be applied.

Optimal Navigation of Self-Propelled Colloids in Microstructured Mazes

NASA Astrophysics Data System (ADS)

Yang, Yuguang; Bevan, Michael

Controlling navigation of self-propelled microscopic `robots' subject to random Brownian motion in complex microstructured environments (e.g., porous media, tumor vasculature) is important to many emerging applications (e.g., enhanced oil recovery, drug delivery). In this work, we design an optimal feedback policy to navigate an active self-propelled colloidal rod in complex mazes with various obstacle types. Actuation of the rods is modelled based on a light-controlled osmotic flow mechanism, which produces different propulsion velocities along the rod's long axis. Actuator-parameterized Langevin equations, with soft rod-obstacle repulsive interactions, are developed to describe the system dynamics. A Markov decision process (MDP) framework is used for optimal policy calculations with design goals of colloidal rods reaching target end points in minimum time. Simulations show that optimal MDP-based policies are able to control rod trajectories to reach target regions order-of-magnitudes faster than uncontrolled rods, which diverges as maze complexity increases. An efficient multi-graph based implementation for MDP is also presented, which scales linearly with the maze dimension.

Distribution of Schmidt-like eigenvalues for Gaussian ensembles of the random matrix theory

NASA Astrophysics Data System (ADS)

Pato, Mauricio P.; Oshanin, Gleb

2013-03-01

We study the probability distribution function P(β)n(w) of the Schmidt-like random variable w = x21/(∑j = 1nx2j/n), where xj, (j = 1, 2, …, n), are unordered eigenvalues of a given n × n β-Gaussian random matrix, β being the Dyson symmetry index. This variable, by definition, can be considered as a measure of how any individual (randomly chosen) eigenvalue deviates from the arithmetic mean value of all eigenvalues of a given random matrix, and its distribution is calculated with respect to the ensemble of such β-Gaussian random matrices. We show that in the asymptotic limit n → ∞ and for arbitrary β the distribution P(β)n(w) converges to the Marčenko-Pastur form, i.e. is defined as P_{n}^{( \\beta )}(w) \\sim \\sqrt{(4 - w)/w} for w ∈ [0, 4] and equals zero outside of the support, despite the fact that formally w is defined on the interval [0, n]. Furthermore, for Gaussian unitary ensembles (β = 2) we present exact explicit expressions for P(β = 2)n(w) which are valid for arbitrary n and analyse their behaviour.

The current status of clinical proteomics and the use of MRM and MRM(3) for biomarker validation.

PubMed

Lemoine, Jérôme; Fortin, Tanguy; Salvador, Arnaud; Jaffuel, Aurore; Charrier, Jean-Philippe; Choquet-Kastylevsky, Geneviève

2012-05-01

The transfer of biomarkers from the discovery field to clinical use is still, despite progress, on a road filled with pitfalls. Since the emergence of proteomics, thousands of putative biomarkers have been published, often with overlapping diagnostic capacities. The strengthening of the robustness of discovery technologies, particularly in mass spectrometry, has been followed by intense discussions on establishing well-defined evaluation procedures for the identified targets to ultimately allow the clinical validation and then the clinical use of some of these biomarkers. Some of the obstacles to the evaluation process have been the lack of the availability of quick and easy-to-develop, easy-to-use, robust, specific and sensitive alternative quantitative methods when immunoaffinity-based tests are unavailable. Multiple reaction monitoring (MRM; also called selected reaction monitoring) is currently proving its capabilities as a complementary or alternative technique to ELISA for large biomarker panel evaluation. Here, we present how MRM(3) can overcome the lack of specificity and sensitivity often encountered by MRM when tracking minor proteins diluted by complex biological matrices.

The effects of multiple obstacles on the locomotor behavior and performance of a terrestrial lizard.

PubMed

Parker, Seth E; McBrayer, Lance D

2016-04-01

Negotiation of variable terrain is important for many small terrestrial vertebrates. Variation in the running surface resulting from obstacles (woody debris, vegetation, rocks) can alter escape paths and running performance. The ability to navigate obstacles likely influences survivorship through predator evasion success and other key ecological tasks (finding mates, acquiring food). Earlier work established that running posture and sprint performance are altered when organisms face an obstacle, and yet studies involving multiple obstacles are limited. Indeed, some habitats are cluttered with obstacles, whereas others are not. For many species, obstacle density may be important in predator escape and/or colonization potential by conspecifics. This study examines how multiple obstacles influence running behavior and locomotor posture in lizards. We predict that an increasing number of obstacles will increase the frequency of pausing and decrease sprint velocity. Furthermore, bipedal running over multiple obstacles is predicted to maintain greater mean sprint velocity compared with quadrupedal running, thereby revealing a potential advantage of bipedalism. Lizards were filmed running through a racetrack with zero, one or two obstacles. Bipedal running posture over one obstacle was significantly faster than quadrupedal posture. Bipedal running trials contained fewer total strides than quadrupedal ones. But on addition of a second obstacle, the number of bipedal strides decreased. Increasing obstacle number led to slower and more intermittent locomotion. Bipedalism provided clear advantages for one obstacle, but was not associated with further benefits for an additional obstacle. Hence, bipedalism helps mitigate obstacle negotiation, but not when numerous obstacles are encountered in succession. © 2016. Published by The Company of Biologists Ltd.

On Statistics of Bi-Orthogonal Eigenvectors in Real and Complex Ginibre Ensembles: Combining Partial Schur Decomposition with Supersymmetry

NASA Astrophysics Data System (ADS)

Fyodorov, Yan V.

2018-06-01

We suggest a method of studying the joint probability density (JPD) of an eigenvalue and the associated `non-orthogonality overlap factor' (also known as the `eigenvalue condition number') of the left and right eigenvectors for non-selfadjoint Gaussian random matrices of size {N× N} . First we derive the general finite N expression for the JPD of a real eigenvalue {λ} and the associated non-orthogonality factor in the real Ginibre ensemble, and then analyze its `bulk' and `edge' scaling limits. The ensuing distribution is maximally heavy-tailed, so that all integer moments beyond normalization are divergent. A similar calculation for a complex eigenvalue z and the associated non-orthogonality factor in the complex Ginibre ensemble is presented as well and yields a distribution with the finite first moment. Its `bulk' scaling limit yields a distribution whose first moment reproduces the well-known result of Chalker and Mehlig (Phys Rev Lett 81(16):3367-3370, 1998), and we provide the `edge' scaling distribution for this case as well. Our method involves evaluating the ensemble average of products and ratios of integer and half-integer powers of characteristic polynomials for Ginibre matrices, which we perform in the framework of a supersymmetry approach. Our paper complements recent studies by Bourgade and Dubach (The distribution of overlaps between eigenvectors of Ginibre matrices, 2018. arXiv:1801.01219).

A new measure based on degree distribution that links information theory and network graph analysis

PubMed Central

2012-01-01

Background Detailed connection maps of human and nonhuman brains are being generated with new technologies, and graph metrics have been instrumental in understanding the general organizational features of these structures. Neural networks appear to have small world properties: they have clustered regions, while maintaining integrative features such as short average pathlengths. Results We captured the structural characteristics of clustered networks with short average pathlengths through our own variable, System Difference (SD), which is computationally simple and calculable for larger graph systems. SD is a Jaccardian measure generated by averaging all of the differences in the connection patterns between any two nodes of a system. We calculated SD over large random samples of matrices and found that high SD matrices have a low average pathlength and a larger number of clustered structures. SD is a measure of degree distribution with high SD matrices maximizing entropic properties. Phi (Φ), an information theory metric that assesses a system’s capacity to integrate information, correlated well with SD - with SD explaining over 90% of the variance in systems above 11 nodes (tested for 4 to 13 nodes). However, newer versions of Φ do not correlate well with the SD metric. Conclusions The new network measure, SD, provides a link between high entropic structures and degree distributions as related to small world properties. PMID:22726594

Vertices cannot be hidden from quantum spatial search for almost all random graphs

NASA Astrophysics Data System (ADS)

Glos, Adam; Krawiec, Aleksandra; Kukulski, Ryszard; Puchała, Zbigniew

2018-04-01

In this paper, we show that all nodes can be found optimally for almost all random Erdős-Rényi G(n,p) graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices, though under different conditions. The first one requires p=ω (log ^8(n)/n), while the second requires p≥ (1+ɛ )log (n)/n, where ɛ >0. The proof was made by analyzing the convergence of eigenvectors corresponding to outlying eigenvalues in the \\Vert \\cdot \\Vert _∞ norm. At the same time for p<(1-ɛ )log (n)/n, the property does not hold for any matrix, due to the connectivity issues. Hence, our derivation concerning Laplacian matrix is tight.

Virtual reality-based navigation task to reveal obstacle avoidance performance in individuals with visuospatial neglect.

PubMed

Aravind, Gayatri; Darekar, Anuja; Fung, Joyce; Lamontagne, Anouk

2015-03-01

Persons with post-stroke visuospatial neglect (VSN) often collide with moving obstacles while walking. It is not well understood whether the collisions occur as a result of attentional-perceptual deficits caused by VSN or due to post-stroke locomotor deficits. We assessed individuals with VSN on a seated, joystick-driven obstacle avoidance task, thus eliminating the influence of locomotion. Twelve participants with VSN were tested on obstacle detection and obstacle avoidance tasks in a virtual environment that included three obstacles approaching head-on or 30 (°) contralesionally/ipsilesionally. Our results indicate that in the detection task, the contralesional and head-on obstacles were detected at closer proximities compared to the ipsilesional obstacle. For the avoidance task collisions were observed only for the contralesional and head-on obstacle approaches. For the contralesional obstacle approach, participants initiated their avoidance strategies at smaller distances from the obstacle and maintained smaller minimum distances from the obstacles. The distance at detection showed a negative association with the distance at the onset of avoidance strategy for all three obstacle approaches. We conclusion the observation of collisions with contralesional and head-on obstacles, in the absence of locomotor burden, provides evidence that attentional-perceptual deficits due to VSN, independent of post-stroke locomotor deficits, alter obstacle avoidance abilities.

Spectra of Adjacency Matrices in Networks of Extreme Introverts and Extroverts

NASA Astrophysics Data System (ADS)

Bassler, Kevin E.; Ezzatabadipour, Mohammadmehdi; Zia, R. K. P.

Many interesting properties were discovered in recent studies of preferred degree networks, suitable for describing social behavior of individuals who tend to prefer a certain number of contacts. In an extreme version (coined the XIE model), introverts always cut links while extroverts always add them. While the intra-group links are static, the cross-links are dynamic and lead to an ensemble of bipartite graphs, with extraordinary correlations between elements of the incidence matrix: nij In the steady state, this system can be regarded as one in thermal equilibrium with long-ranged interactions between the nij's, and displays an extreme Thouless effect. Here, we report simulation studies of a different perspective of networks, namely, the spectra associated with this ensemble of adjacency matrices {aij } . As a baseline, we first consider the spectra associated with a simple random (Erdős-Rényi) ensemble of bipartite graphs, where simulation results can be understood analytically. Work supported by the NSF through Grant DMR-1507371.

Power laws for the backscattering matrices in the case of lidar sensing of cirrus clouds

NASA Astrophysics Data System (ADS)

Kustova, Natalia V.; Konoshonkin, Alexander V.; Borovoi, Anatoli; Okamoto, Hajime; Sato, Kaori; Katagiri, Shuichiro

2017-11-01

The data bank for the backscattering matrixes of cirrus clouds that was calculated earlier by the authors and was available in the internet for free access has been replaced in the case of randomly oriented crystals by simple analytic equations. Four microphysical ratios conventionally measured by lidars have been calculated for different shapes and the effective size of the crystals. These values could be used for retrieving shapes of the crystals in cirrus clouds.

IEEE International Symposium Information Theory, held at Santa Monica California, February 9-12, 1981.

DTIC Science & Technology

1981-01-01

Channel and study permutation codes as a special case. ,uch a code is generated by an initial vector x, a group G of orthogonal n by n matrices, and a...random-access components, is introduced and studied . Under this scheme, the network stations are divided into groups , each of which is assigned a...IEEE INFORMATION THEORY GROUP CO-SPONSORED BY: UNION RADIO SCIENTIFIQUE INTERNATIONALE IEEE Catalog Number 81 CH 1609-7 IT 𔃻. 81 ~20 04Q SECURITY

Prefrontal cortex activation during obstacle negotiation: What's the effect size and timing?

PubMed

Maidan, Inbal; Shustak, Shiran; Sharon, Topaz; Bernad-Elazari, Hagar; Geffen, Nimrod; Giladi, Nir; Hausdorff, Jeffrey M; Mirelman, Anat

2018-04-01

Obstacle negotiation is a daily activity that requires the integration of sensorimotor and cognitive information. Recent studies provide evidence for the important role of prefrontal cortex during obstacle negotiation. We aimed to explore the effects of obstacle height and available response time on prefrontal activation. Twenty healthy young adults (age: 30.1 ± 1.0 years; 50% women) walked in an obstacle course while negotiating anticipated and unanticipated obstacles at heights of 50 mm and 100 mm. Prefrontal activation was measured using a functional near-infrared spectroscopy system. Kinect cameras measured the obstacle negotiation strategy. Prefrontal activation was defined based on mean level of HbO 2 before, during and after obstacle negotiation and the HbO 2 slope from gait initiation and throughout the task. Changes between types of obstacles were assessed using linear-mix models and partial correlation analyses evaluated the relationship between prefrontal activation and the distance between the feet as the subjects traversed the obstacles. Different obstacle heights showed similar changes in prefrontal activation measures (p > 0.210). However, during unanticipated obstacles, the slope of the HbO 2 response was steeper (p = 0.048), as compared to anticipated obstacles. These changes in prefrontal activation during negotiation of unanticipated obstacles were correlated with greater distance of the leading foot after the obstacles (r = 0.831, p = 0.041). These findings are the first to show that the pattern of prefrontal activation depends on the nature of the obstacle. More specifically, during unanticipated obstacles the recruitment of the prefrontal cortex is faster and greater than during negotiating anticipated obstacles. These results provide evidence of the important role of the prefrontal cortex and the ability of healthy young adults to tailor the activation pattern to different types of obstacles. Copyright © 2018 Elsevier Inc. All rights reserved.

Experiences of randomization: interviews with patients and clinicians in the SPCG-IV trial.

PubMed

Bill-Axelson, Anna; Christensson, Anna; Carlsson, Marianne; Norlén, Bo Johan; Holmberg, Lars

2008-01-01

Recruitment of both patients and clinicians to randomized trials is difficult. Low participation carries the risk of terminating studies early and making them invalid owing to insufficient statistical power. This study investigated patients' and clinicians' experiences of randomization with the aim of facilitating trial participation in the future. This was a qualitative study using content analysis. Patients offered to participate in a randomized trial and randomizing clinicians were interviewed. Five participants, four non-participants and five randomizing clinicians were interviewed, 2-8 years from randomization. Clinicians used strategies in interaction with the patients to facilitate decision making. Patients' attitudes differed and experiences of relatives or friends were often stated as reasons for treatment preferences. Patients described that letting chance decide treatment was a difficult barrier to overcome for randomization. The clinicians used a number of different strategies perceived to make randomization more acceptable to their patients. The clinicians' own motivation for randomizing patients for trials depended on the medical relevance of the study question and the clinicians' major obstacle was to maintain equipoise over time. Regular meetings with the study group helped to maintain equipoise and motivation. To establish a good platform for randomization the clinician needs to know about the patient's treatment preferences and the patient's attitude concerning the role of the clinician to facilitate decision making. The strategies used by the clinicians were perceived as helpful and could be tested in an intervention study.

An Analysis of the Max-Min Texture Measure.

DTIC Science & Technology

1982-01-01

PANC 33 D2 Confusion Matrices for Scene A, IR 34 D3 Confusion Matrices for Scene B, PANC 35 D4 Confusion Matrices for Scene B, IR 36 D5 Confusion...Matrices for Scene C, PANC 37 D6 Confusion Matrices for Scene C, IR 38 D7 Confusion Matrices for Scene E, PANC 39 D8 Confusion Matrices for Scene E, IR 40...D9 Confusion Matrices for Scene H, PANC 41 DIO Confusion Matrices for Scene H, JR 42 3 .D 10CnuinMtie o cn ,IR4 AN ANALYSIS OF THE MAX-MIN TEXTURE

Age-associated changes in obstacle negotiation strategies: Does size and timing matter?

PubMed

Maidan, I; Eyal, S; Kurz, I; Geffen, N; Gazit, E; Ravid, L; Giladi, N; Mirelman, A; Hausdorff, J M

2018-01-01

Tripping over an obstacle is one of the most common causes of falls among older adults. However, the effects of aging, obstacle height and anticipation time on negotiation strategies have not been systematically evaluated. Twenty older adults (ages: 77.7±3.4years; 50% women) and twenty young adults (age: 29.3±3.8years; 50% women) walked through an obstacle course while negotiating anticipated and unanticipated obstacles at heights of 25mm and 75mm. Kinect cameras captured the: (1) distance of the subject's trailing foot before the obstacles, (2) distance of the leading foot after the obstacles, (3) clearance of the leading foot above the obstacles, and (4) clearance of the trailing foot above the obstacles. Linear-mix models assessed changes between groups and conditions. Older adults placed their leading foot closer to the obstacle after landing, compared to young adults (p<0.001). This pattern was enhanced in high obstacles (group*height interaction, p=0.033). Older adults had lower clearance over the obstacles, compared to young adults (p=0.007). This was more pronounced during unanticipated obstacles (group*ART interaction, p=0.003). The distance of the leading foot and clearance of the trailing foot after the obstacles were correlated with motor, cognitive, and functional abilities. These findings suggest that there are age-related changes in obstacle crossing strategies that are dependent on the specific characteristics of the obstacle. The results have important implications for clinical practice, suggesting that functional exercise should include obstacle negotiation training with variable practice of height and available response times. Further studies are needed to better understand the effects of motor and cognitive abilities. Copyright © 2017 Elsevier B.V. All rights reserved.

Robust obstacle detection for unmanned surface vehicles

NASA Astrophysics Data System (ADS)

Qin, Yueming; Zhang, Xiuzhi

2018-03-01

Obstacle detection is of essential importance for Unmanned Surface Vehicles (USV). Although some obstacles (e.g., ships, islands) can be detected by Radar, there are many other obstacles (e.g., floating pieces of woods, swimmers) which are difficult to be detected via Radar because these obstacles have low radar cross section. Therefore, detecting obstacle from images taken onboard is an effective supplement. In this paper, a robust vision-based obstacle detection method for USVs is developed. The proposed method employs the monocular image sequence captured by the camera on the USVs and detects obstacles on the sea surface from the image sequence. The experiment results show that the proposed scheme is efficient to fulfill the obstacle detection task.

Fast obstacle detection based on multi-sensor information fusion

NASA Astrophysics Data System (ADS)

Lu, Linli; Ying, Jie

2014-11-01

Obstacle detection is one of the key problems in areas such as driving assistance and mobile robot navigation, which cannot meet the actual demand by using a single sensor. A method is proposed to realize the real-time access to the information of the obstacle in front of the robot and calculating the real size of the obstacle area according to the mechanism of the triangle similarity in process of imaging by fusing datum from a camera and an ultrasonic sensor, which supports the local path planning decision. In the part of image analyzing, the obstacle detection region is limited according to complementary principle. We chose ultrasonic detection range as the region for obstacle detection when the obstacle is relatively near the robot, and the travelling road area in front of the robot is the region for a relatively-long-distance detection. The obstacle detection algorithm is adapted from a powerful background subtraction algorithm ViBe: Visual Background Extractor. We extracted an obstacle free region in front of the robot in the initial frame, this region provided a reference sample set of gray scale value for obstacle detection. Experiments of detecting different obstacles at different distances respectively, give the accuracy of the obstacle detection and the error percentage between the calculated size and the actual size of the detected obstacle. Experimental results show that the detection scheme can effectively detect obstacles in front of the robot and provide size of the obstacle with relatively high dimensional accuracy.

Anomalous versus slowed-down Brownian diffusion in the ligand-binding equilibrium.

PubMed

Soula, Hédi; Caré, Bertrand; Beslon, Guillaume; Berry, Hugues

2013-11-05

Measurements of protein motion in living cells and membranes consistently report transient anomalous diffusion (subdiffusion) that converges back to a Brownian motion with reduced diffusion coefficient at long times after the anomalous diffusion regime. Therefore, slowed-down Brownian motion could be considered the macroscopic limit of transient anomalous diffusion. On the other hand, membranes are also heterogeneous media in which Brownian motion may be locally slowed down due to variations in lipid composition. Here, we investigate whether both situations lead to a similar behavior for the reversible ligand-binding reaction in two dimensions. We compare the (long-time) equilibrium properties obtained with transient anomalous diffusion due to obstacle hindrance or power-law-distributed residence times (continuous-time random walks) to those obtained with space-dependent slowed-down Brownian motion. Using theoretical arguments and Monte Carlo simulations, we show that these three scenarios have distinctive effects on the apparent affinity of the reaction. Whereas continuous-time random walks decrease the apparent affinity of the reaction, locally slowed-down Brownian motion and local hindrance by obstacles both improve it. However, only in the case of slowed-down Brownian motion is the affinity maximal when the slowdown is restricted to a subregion of the available space. Hence, even at long times (equilibrium), these processes are different and exhibit irreconcilable behaviors when the area fraction of reduced mobility changes. Copyright © 2013 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Periodic GMP Matrices

NASA Astrophysics Data System (ADS)

Eichinger, Benjamin

2016-07-01

We recall criteria on the spectrum of Jacobi matrices such that the corresponding isospectral torus consists of periodic operators. Motivated by those known results for Jacobi matrices, we define a new class of operators called GMP matrices. They form a certain Generalization of matrices related to the strong Moment Problem. This class allows us to give a parametrization of almost periodic finite gap Jacobi matrices by periodic GMP matrices. Moreover, due to their structural similarity we can carry over numerous results from the direct and inverse spectral theory of periodic Jacobi matrices to the class of periodic GMP matrices. In particular, we prove an analogue of the remarkable ''magic formula'' for this new class.

Deterministic diffusion in flower-shaped billiards.

PubMed

Harayama, Takahisa; Klages, Rainer; Gaspard, Pierre

2002-08-01

We propose a flower-shaped billiard in order to study the irregular parameter dependence of chaotic normal diffusion. Our model is an open system consisting of periodically distributed obstacles in the shape of a flower, and it is strongly chaotic for almost all parameter values. We compute the parameter dependent diffusion coefficient of this model from computer simulations and analyze its functional form using different schemes, all generalizing the simple random walk approximation of Machta and Zwanzig. The improved methods we use are based either on heuristic higher-order corrections to the simple random walk model, on lattice gas simulation methods, or they start from a suitable Green-Kubo formula for diffusion. We show that dynamical correlations, or memory effects, are of crucial importance in reproducing the precise parameter dependence of the diffusion coefficent.

Evacuation simulation with consideration of obstacle removal and using game theory

NASA Astrophysics Data System (ADS)

Lin, Guan-Wen; Wong, Sai-Keung

2018-06-01

In this paper, we integrate a cellular automaton model with game theory to simulate crowd evacuation from a room with consideration of obstacle removal. The room has one or more exits, one of which is blocked by obstacles. The obstacles at the exit can be removed by volunteers. We investigate the cooperative and defective behaviors of pedestrians during evacuation. The yielder game and volunteer's dilemma game are employed to resolve interpedestrian conflict. An anticipation floor field is proposed to guide the pedestrians to avoid obstacles that are being removed. We conducted experiments to determine how a variety of conditions affect overall crowd evacuation and volunteer evacuation times. The conditions were the start time of obstacle removal, number of obstacles, placement of obstacles, time spent in obstacle removal, strength of the anticipation floor field, and obstacle visibility distance. We demonstrate how reciprocity can be achieved among pedestrians and increases the efficiency of the entire evacuation process.

Unpinning of spiral waves from rectangular obstacles by stimulated wave trains

NASA Astrophysics Data System (ADS)

Ponboonjaroenchai, Benjamas; Srithamma, Panatda; Kumchaiseemak, Nakorn; Sutthiopad, Malee; Müller, Stefan C.; Luengviriya, Chaiya; Luengviriya, Jiraporn

2017-09-01

Pinned spiral waves are exhibited in many excitable media. In cardiology, lengthened tachycardia correspond to propagating action potential in forms of spiral waves pinned to anatomical obstacles including veins and scares. Thus, elimination such waves is important particularly in medical treatments. We present study of unpinning of a spiral wave by a wave train initiated by periodic stimuli at a given location. The spiral wave is forced to leave the rectangular obstacle when the period of the wave train is shorter than a threshold Tunpin. For small obstacles, Tunpin decreases when the obstacle size is increased. Furthermore, Tunpin depends on the obstacle orientation with respect to the wave train propagation. For large obstacles, Tunpin is independent to the obstacle size. It implies that the orientation of the obstacle plays an important role in the unpinning of the spiral wave, especially for small rectangular obstacles.

The addition of stripes (a version of the 'horizontal-vertical illusion') increases foot clearance when crossing low-height obstacles.

PubMed

Foster, Richard J; Buckley, John G; Whitaker, David; Elliott, David B

2016-07-01

Trips over obstacles are one of the main causes of falling in older adults, with vision playing an important role in successful obstacle negotiation. We determined whether a horizontal-vertical illusion, superimposed onto low-height obstacles to create a perceived increase in obstacle height, increased foot clearances during obstacle negotiation thus reducing the likelihood of tripping. Eleven adults (mean ± 1 SD: age 27.3 ± 5.1 years) negotiated obstacles of varying heights (3, 5, 7 cm) with four different appearance conditions; two were obstacles with a horizontal-vertical illusion (vertical stripes of different thickness) superimposed on the front, one was a plain obstacle and the fourth a plain obstacle with a horizontal black line painted on the top edge. Foot clearance parameters were compared across conditions. Both illusions led to a significant increase in foot clearance when crossing the obstacle, compared to the plain condition, irrespective of obstacle height. Superimposing a horizontal-vertical illusion onto low-height obstacles can increase foot clearance, and its use on the floor section of a double-glazing door frame for example may reduce the incidence of tripping in the home. Practitioner Summary: Low-height obstacles such as the floor section of a double-glazing door frame are potential tripping hazards. In a gait lab-based study we found that a horizontal-vertical illusion superimposed onto low-height obstacles led to significantly higher foot clearances; indicating their potential as a useful safety measure.

Full-Duplex Bidirectional Secure Communications Under Perfect and Distributionally Ambiguous Eavesdropper's CSI

NASA Astrophysics Data System (ADS)

Li, Qiang; Zhang, Ying; Lin, Jingran; Wu, Sissi Xiaoxiao

2017-09-01

Consider a full-duplex (FD) bidirectional secure communication system, where two communication nodes, named Alice and Bob, simultaneously transmit and receive confidential information from each other, and an eavesdropper, named Eve, overhears the transmissions. Our goal is to maximize the sum secrecy rate (SSR) of the bidirectional transmissions by optimizing the transmit covariance matrices at Alice and Bob. To tackle this SSR maximization (SSRM) problem, we develop an alternating difference-of-concave (ADC) programming approach to alternately optimize the transmit covariance matrices at Alice and Bob. We show that the ADC iteration has a semi-closed-form beamforming solution, and is guaranteed to converge to a stationary solution of the SSRM problem. Besides the SSRM design, this paper also deals with a robust SSRM transmit design under a moment-based random channel state information (CSI) model, where only some roughly estimated first and second-order statistics of Eve's CSI are available, but the exact distribution or other high-order statistics is not known. This moment-based error model is new and different from the widely used bounded-sphere error model and the Gaussian random error model. Under the consider CSI error model, the robust SSRM is formulated as an outage probability-constrained SSRM problem. By leveraging the Lagrangian duality theory and DC programming, a tractable safe solution to the robust SSRM problem is derived. The effectiveness and the robustness of the proposed designs are demonstrated through simulations.

Atomistic modeling of thermomechanical properties of SWNT/Epoxy nanocomposites

NASA Astrophysics Data System (ADS)

Fasanella, Nicholas; Sundararaghavan, Veera

2015-09-01

Molecular dynamics simulations are performed to compute thermomechanical properties of cured epoxy resins reinforced with pristine and covalently functionalized carbon nanotubes. A DGEBA-DDS epoxy network was built using the ‘dendrimer’ growth approach where 75% of available epoxy sites were cross-linked. The epoxy model is verified through comparisons to experiments, and simulations are performed on nanotube reinforced cross-linked epoxy matrix using the CVFF force field in LAMMPS. Full stiffness matrices and linear coefficient of thermal expansion vectors are obtained for the nanocomposite. Large increases in stiffness and large decreases in thermal expansion were seen along the direction of the nanotube for both nanocomposite systems when compared to neat epoxy. The direction transverse to nanotube saw a 40% increase in stiffness due to covalent functionalization over neat epoxy at 1 K whereas the pristine nanotube system only saw a 7% increase due to van der Waals effects. The functionalized SWNT/epoxy nanocomposite showed an additional 42% decrease in thermal expansion along the nanotube direction when compared to the pristine SWNT/epoxy nanocomposite. The stiffness matrices are rotated over every possible orientation to simulate the effects of an isotropic system of randomly oriented nanotubes in the epoxy. The randomly oriented covalently functionalized SWNT/Epoxy nanocomposites showed substantial improvements over the plain epoxy in terms of higher stiffness (200% increase) and lower thermal expansion (32% reduction). Through MD simulations, we develop means to build simulation cells, perform annealing to reach correct densities, compute thermomechanical properties and compare with experiments.

Constructing acoustic timefronts using random matrix theory.

PubMed

Hegewisch, Katherine C; Tomsovic, Steven

2013-10-01

In a recent letter [Hegewisch and Tomsovic, Europhys. Lett. 97, 34002 (2012)], random matrix theory is introduced for long-range acoustic propagation in the ocean. The theory is expressed in terms of unitary propagation matrices that represent the scattering between acoustic modes due to sound speed fluctuations induced by the ocean's internal waves. The scattering exhibits a power-law decay as a function of the differences in mode numbers thereby generating a power-law, banded, random unitary matrix ensemble. This work gives a more complete account of that approach and extends the methods to the construction of an ensemble of acoustic timefronts. The result is a very efficient method for studying the statistical properties of timefronts at various propagation ranges that agrees well with propagation based on the parabolic equation. It helps identify which information about the ocean environment can be deduced from the timefronts and how to connect features of the data to that environmental information. It also makes direct connections to methods used in other disordered waveguide contexts where the use of random matrix theory has a multi-decade history.

Sequential time interleaved random equivalent sampling for repetitive signal.

PubMed

Zhao, Yijiu; Liu, Jingjing

2016-12-01

Compressed sensing (CS) based sampling techniques exhibit many advantages over other existing approaches for sparse signal spectrum sensing; they are also incorporated into non-uniform sampling signal reconstruction to improve the efficiency, such as random equivalent sampling (RES). However, in CS based RES, only one sample of each acquisition is considered in the signal reconstruction stage, and it will result in more acquisition runs and longer sampling time. In this paper, a sampling sequence is taken in each RES acquisition run, and the corresponding block measurement matrix is constructed using a Whittaker-Shannon interpolation formula. All the block matrices are combined into an equivalent measurement matrix with respect to all sampling sequences. We implemented the proposed approach with a multi-cores analog-to-digital converter (ADC), whose ADC cores are time interleaved. A prototype realization of this proposed CS based sequential random equivalent sampling method has been developed. It is able to capture an analog waveform at an equivalent sampling rate of 40 GHz while sampled at 1 GHz physically. Experiments indicate that, for a sparse signal, the proposed CS based sequential random equivalent sampling exhibits high efficiency.

Universal shocks in the Wishart random-matrix ensemble.

PubMed

Blaizot, Jean-Paul; Nowak, Maciej A; Warchoł, Piotr

2013-05-01

We show that the derivative of the logarithm of the average characteristic polynomial of a diffusing Wishart matrix obeys an exact partial differential equation valid for an arbitrary value of N, the size of the matrix. In the large N limit, this equation generalizes the simple inviscid Burgers equation that has been obtained earlier for Hermitian or unitary matrices. The solution, through the method of characteristics, presents singularities that we relate to the precursors of shock formation in the Burgers equation. The finite N effects appear as a viscosity term in the Burgers equation. Using a scaling analysis of the complete equation for the characteristic polynomial, in the vicinity of the shocks, we recover in a simple way the universal Bessel oscillations (so-called hard-edge singularities) familiar in random-matrix theory.

Linear discriminant analysis with misallocation in training samples

NASA Technical Reports Server (NTRS)

Chhikara, R. (Principal Investigator); Mckeon, J.

1982-01-01

Linear discriminant analysis for a two-class case is studied in the presence of misallocation in training samples. A general appraoch to modeling of mislocation is formulated, and the mean vectors and covariance matrices of the mixture distributions are derived. The asymptotic distribution of the discriminant boundary is obtained and the asymptotic first two moments of the two types of error rate given. Certain numerical results for the error rates are presented by considering the random and two non-random misallocation models. It is shown that when the allocation procedure for training samples is objectively formulated, the effect of misallocation on the error rates of the Bayes linear discriminant rule can almost be eliminated. If, however, this is not possible, the use of Fisher rule may be preferred over the Bayes rule.

Virtual obstacle crossing: Reliability and differences in stroke survivors who prospectively experienced falls or no falls.

PubMed

Punt, Michiel; Bruijn, Sjoerd M; Wittink, Harriet; van de Port, Ingrid G; Wubbels, Gijs; van Dieën, Jaap H

2017-10-01

Stroke survivors often fall during walking. To reduce fall risk, gait testing and training with avoidance of virtual obstacles is gaining popularity. However, it is unknown whether and how virtual obstacle crossing is associated with fall risk. The present study assessed whether obstacle crossing characteristics are reliable and assessed differences in stroke survivors who prospectively experienced falls or no falls. We recruited twenty-nine community dwelling chronic stroke survivors. Participants crossed five virtual obstacles with increasing lengths. After a break, the test was repeated to assess test-retest reliability. For each obstacle length and trial, we determined; success rate, leading limb preference, pre and post obstacle distance, margins of stability, toe clearance, and crossing step length and speed. Subsequently, fall incidence was monitored using a fall calendar and monthly phone calls over a six-month period. Test-retest reliability was poor, but improved with increasing obstacle-length. Twelve participants reported at least one fall. No association of fall incidence with any of the obstacle crossing characteristics was found. Given the absence of height of the virtual obstacles, obstacle avoidance may have been relatively easy, allowing participants to cross obstacles in multiple ways, increasing variability of crossing characteristics and reducing the association with fall risk. These finding cast some doubt on current protocols for testing and training of obstacle avoidance in stroke rehabilitation. Copyright © 2017 Elsevier B.V. All rights reserved.

A Real-Time Reaction Obstacle Avoidance Algorithm for Autonomous Underwater Vehicles in Unknown Environments.

PubMed

Yan, Zheping; Li, Jiyun; Zhang, Gengshi; Wu, Yi

2018-02-02

A novel real-time reaction obstacle avoidance algorithm (RRA) is proposed for autonomous underwater vehicles (AUVs) that must adapt to unknown complex terrains, based on forward looking sonar (FLS). To accomplish this algorithm, obstacle avoidance rules are planned, and the RRA processes are split into five steps Introduction only lists 4 so AUVs can rapidly respond to various environment obstacles. The largest polar angle algorithm (LPAA) is designed to change detected obstacle's irregular outline into a convex polygon, which simplifies the obstacle avoidance process. A solution is designed to solve the trapping problem existing in U-shape obstacle avoidance by an outline memory algorithm. Finally, simulations in three unknown obstacle scenes are carried out to demonstrate the performance of this algorithm, where the obtained obstacle avoidance trajectories are safety, smooth and near-optimal.

Structure-Function Network Mapping and Its Assessment via Persistent Homology

PubMed Central

2017-01-01

Understanding the relationship between brain structure and function is a fundamental problem in network neuroscience. This work deals with the general method of structure-function mapping at the whole-brain level. We formulate the problem as a topological mapping of structure-function connectivity via matrix function, and find a stable solution by exploiting a regularization procedure to cope with large matrices. We introduce a novel measure of network similarity based on persistent homology for assessing the quality of the network mapping, which enables a detailed comparison of network topological changes across all possible thresholds, rather than just at a single, arbitrary threshold that may not be optimal. We demonstrate that our approach can uncover the direct and indirect structural paths for predicting functional connectivity, and our network similarity measure outperforms other currently available methods. We systematically validate our approach with (1) a comparison of regularized vs. non-regularized procedures, (2) a null model of the degree-preserving random rewired structural matrix, (3) different network types (binary vs. weighted matrices), and (4) different brain parcellation schemes (low vs. high resolutions). Finally, we evaluate the scalability of our method with relatively large matrices (2514x2514) of structural and functional connectivity obtained from 12 healthy human subjects measured non-invasively while at rest. Our results reveal a nonlinear structure-function relationship, suggesting that the resting-state functional connectivity depends on direct structural connections, as well as relatively parsimonious indirect connections via polysynaptic pathways. PMID:28046127

Influence of chocolate matrix composition on cocoa flavan-3-ol bioaccessibility in vitro and bioavailability in humans.

PubMed

Neilson, Andrew P; George, Judy C; Janle, Elsa M; Mattes, Richard D; Rudolph, Ralf; Matusheski, Nathan V; Ferruzzi, Mario G

2009-10-28

Conflicting data exist regarding the influence of chocolate matrices on the bioavailability of epicatechin (EC) from cocoa. The objective of this study was to assess the bioavailability of EC from matrices varying in macronutrient composition and physical form. EC bioavailability was assessed from chocolate confections [reference dark chocolate (CDK), high sucrose (CHS), high milk protein (CMP)] and cocoa beverages [sucrose milk protein (BSMP), non-nutritive sweetener milk protein (BNMP)], in humans and in vitro. Six subjects consumed each product in a randomized crossover design, with serum EC concentrations monitored over 6 h post consumption. Areas under the serum concentration-time curve (AUC) were similar among chocolate matrices. However, AUCs were significantly increased for BSMP and BNMP (132 and 143 nM h) versus CMP (101 nM h). Peak serum concentrations (C(MAX)) were also increased for BSMP and BNMP (43 and 42 nM) compared to CDK and CMP (32 and 25 nM). Mean T(MAX) values were lower, although not statistically different, for beverages (0.9-1.1 h) versus confections (1.8-2.3 h), reflecting distinct shapes of the pharmacokinetic curves for beverages and confections. In vitro bioaccessibility and Caco-2 accumulation did not differ between treatments. These data suggest that bioavailability of cocoa flavan-3-ols is likely similar from typical commercial cocoa based foods and beverages, but that the physical form and sucrose content may influence T(MAX) and C(MAX).

MODIS Aerosol Optical Depth Bias Adjustment Using Machine Learning Algorithms

NASA Technical Reports Server (NTRS)

Albayrak, Arif; Wei, Jennifer; Petrenko, Maksym; Lary, David; Leptoukh, Gregory

2011-01-01

To monitor the earth atmosphere and its surface changes, satellite based instruments collect continuous data. While some of the data is directly used, some others such as aerosol properties are indirectly retrieved from the observation data. While retrieved variables (RV) form very powerful products, they don't come without obstacles. Different satellite viewing geometries, calibration issues, dynamically changing atmospheric and earth surface conditions, together with complex interactions between observed entities and their environment affect them greatly. This results in random and systematic errors in the final products.

Obstacles for Teachers to Integrate Technology with Instruction

ERIC Educational Resources Information Center

Alenezi, Abdullah

2017-01-01

This paper covers type one and two educational obstacles in using technology in the classrooms, and considering those obstacles tries to find the answer to the following overarching research question which can help to gauge some obstacles for the educational technology integration for elementary and high school education: What obstacles do…

Canonical Naimark extension for generalized measurements involving sets of Pauli quantum observables chosen at random

NASA Astrophysics Data System (ADS)

Sparaciari, Carlo; Paris, Matteo G. A.

2013-01-01

We address measurement schemes where certain observables Xk are chosen at random within a set of nondegenerate isospectral observables and then measured on repeated preparations of a physical system. Each observable has a probability zk to be measured, with ∑kzk=1, and the statistics of this generalized measurement is described by a positive operator-valued measure. This kind of scheme is referred to as quantum roulettes, since each observable Xk is chosen at random, e.g., according to the fluctuating value of an external parameter. Here we focus on quantum roulettes for qubits involving the measurements of Pauli matrices, and we explicitly evaluate their canonical Naimark extensions, i.e., their implementation as indirect measurements involving an interaction scheme with a probe system. We thus provide a concrete model to realize the roulette without destroying the signal state, which can be measured again after the measurement or can be transmitted. Finally, we apply our results to the description of Stern-Gerlach-like experiments on a two-level system.

Generic dynamical features of quenched interacting quantum systems: Survival probability, density imbalance, and out-of-time-ordered correlator

NASA Astrophysics Data System (ADS)

Torres-Herrera, E. J.; García-García, Antonio M.; Santos, Lea F.

2018-02-01

We study numerically and analytically the quench dynamics of isolated many-body quantum systems. Using full random matrices from the Gaussian orthogonal ensemble, we obtain analytical expressions for the evolution of the survival probability, density imbalance, and out-of-time-ordered correlator. They are compared with numerical results for a one-dimensional-disordered model with two-body interactions and shown to bound the decay rate of this realistic system. Power-law decays are seen at intermediate times, and dips below the infinite time averages (correlation holes) occur at long times for all three quantities when the system exhibits level repulsion. The fact that these features are shared by both the random matrix and the realistic disordered model indicates that they are generic to nonintegrable interacting quantum systems out of equilibrium. Assisted by the random matrix analytical results, we propose expressions that describe extremely well the dynamics of the realistic chaotic system at different time scales.

Influences of periodic mechanical deformation on pinned spiral waves

NASA Astrophysics Data System (ADS)

Chen, Jiang-Xing; Peng, Liang; Zheng, Qiang; Zhao, Ye-Hua; Ying, He-Ping

2014-09-01

In a generic model of excitable media, we study the behavior of spiral waves interacting with obstacles and their dynamics under the influences of simple periodic mechanical deformation (PMD). Depending on the characteristics of the obstacles, i.e., size and excitability, the rotation of a pinned spiral wave shows different scenarios, e.g., embedding into or anchoring on an obstacle. Three different drift phenomena induced by PMD are observed: scattering on small partial-excitable obstacles, meander-induced unpinning on big partial-excitable obstacles, and drifting around small unexcitable obstacles. Their underlying mechanisms are discussed. The dependence of the threshold amplitude of PMD on the characteristics of the obstacles to successfully remove pinned spiral waves on big partial-excitable obstacles is studied.

Vision Based Obstacle Detection in Uav Imaging

NASA Astrophysics Data System (ADS)

Badrloo, S.; Varshosaz, M.

2017-08-01

Detecting and preventing incidence with obstacles is crucial in UAV navigation and control. Most of the common obstacle detection techniques are currently sensor-based. Small UAVs are not able to carry obstacle detection sensors such as radar; therefore, vision-based methods are considered, which can be divided into stereo-based and mono-based techniques. Mono-based methods are classified into two groups: Foreground-background separation, and brain-inspired methods. Brain-inspired methods are highly efficient in obstacle detection; hence, this research aims to detect obstacles using brain-inspired techniques, which try to enlarge the obstacle by approaching it. A recent research in this field, has concentrated on matching the SIFT points along with, SIFT size-ratio factor and area-ratio of convex hulls in two consecutive frames to detect obstacles. This method is not able to distinguish between near and far obstacles or the obstacles in complex environment, and is sensitive to wrong matched points. In order to solve the above mentioned problems, this research calculates the dist-ratio of matched points. Then, each and every point is investigated for Distinguishing between far and close obstacles. The results demonstrated the high efficiency of the proposed method in complex environments.

Strategies for obstacle avoidance during walking in the cat.

PubMed

Chu, Kevin M I; Seto, Sandy H; Beloozerova, Irina N; Marlinski, Vladimir

2017-08-01

Avoiding obstacles is essential for successful navigation through complex environments. This study aimed to clarify what strategies are used by a typical quadruped, the cat, to avoid obstacles during walking. Four cats walked along a corridor 2.5 m long and 25 or 15 cm wide. Obstacles, small round objects 2.5 cm in diameter and 1 cm in height, were placed on the floor in various locations. Movements of the paw were recorded with a motion capture and analysis system (Visualeyez, PTI). During walking in the wide corridor, cats' preferred strategy for avoiding a single obstacle was circumvention, during which the stride direction changed while stride duration and swing-to-stride duration ratio were preserved. Another strategy, stepping over the obstacle, was used during walking in the narrow corridor, when lateral deviations of walking trajectory were restricted. Stepping over the obstacle involved changes in two consecutive strides. The stride preceding the obstacle was shortened, and swing-to-stride ratio was reduced. The obstacle was negotiated in the next stride of increased height and normal duration and swing-to-stride ratio. During walking on a surface with multiple obstacles, both strategies were used. To avoid contact with the obstacle, cats placed the paw away from the object at a distance roughly equal to the diameter of the paw. During obstacle avoidance cats prefer to alter muscle activities without altering the locomotor rhythm. We hypothesize that a choice of the strategy for obstacle avoidance is determined by minimizing the complexity of neuro-motor processes required to achieve the behavioral goal. NEW & NOTEWORTHY In a study of feline locomotor behavior we found that the preferred strategy to avoid a small obstacle is circumvention. During circumvention, stride direction changes but length and temporal structure are preserved. Another strategy, stepping over the obstacle, is used in narrow walkways. During overstepping, two strides adjust. A stride preceding the obstacle decreases in length and duration. The following stride negotiating the obstacle increases in height while retaining normal temporal structure and nearly normal length. Copyright © 2017 the American Physiological Society.

Collective effects in force generation by multiple cytoskeletal filaments pushing an obstacle

NASA Astrophysics Data System (ADS)

Aparna, J. S.; Das, Dipjyoti; Padinhateeri, Ranjith; Das, Dibyendu

2015-09-01

We report here recent findings that multiple cytoskeletal filaments (assumed rigid) pushing an obstacle typically generate more force than just the sum of the forces due to individual ones. This interesting phenomenon, due to the hydrolysis process being out of equilibrium, escaped attention in previous experimental and theoretical literature. We first demonstrate this numerically within a constant force ensemble, for a well known model of cytoskeletal filament dynamics with random mechanism of hydrolysis. Two methods of detecting the departure from additivity of the collective stall force, namely from the force-velocity curve in the growing phase, and from the average collapse time versus force curve in the bounded phase, is discussed. Since experiments have already been done for a similar system of multiple microtubules in a harmonic optical trap, we study the problem theoretically under harmonic force. We show that within the varying harmonic force ensemble too, the mean collective stall force of N filaments is greater than N times the mean stall force due to a single filament; the actual extent of departure is a function of the monomer concentration.

Sociopolitical Participation of Kuwaiti Women in the Development Process: Current State and Challenges Ahead

PubMed Central

Alzuabi, Ali Z.

2016-01-01

ABSTRACT This study explores the sociocultural status of Kuwaiti women and examines the obstacles that may hinder them from participating in socioeconomic development of Kuwait. The study analyzes the nature of legislative, political, sociocultural, and economic challenges faced by Kuwaiti women and suggests measures to overcome these obstacles to help women in attaining a prime role in the development process. The survey sample included 300 Kuwaiti citizens of both genders selected randomly from different social and professional backgrounds. Statistical analyses including mean values and covariance analysis revealed the awareness of gender-based differences in attitudes on the nature of constraints faced in moving toward the progress of Kuwaiti women. Discussed are social, economic, and knowledge-based constraints that restrain women from playing an active role in the socioeconomic development of Kuwait. Future directions include the acknowledgement of increased levels of education among Kuwaiti women and the available talent pool that will remain underutilized if women are not raised to leadership levels. Further research is needed on the scope and challenges in implementing strategies for the empowerment of women as a part of legislation. PMID:27812232

The Value of Community Health Workers in Diabetes Management in Low-Income Populations: A Qualitative Study.

PubMed

Silverman, Julie; Krieger, James; Sayre, George; Nelson, Karin

2018-03-01

To describe community health workers (CHWs) roles in a diabetes self-management intervention. Retrospective qualitative inductive analysis of open text home visit encounter form from Peer Support for Achieving Independence in Diabetes (Peer AID), a randomized controlled trial in which low-income individuals with poorly controlled diabetes received either CHW home visits or usual care. Following visits, CHWs completed encounter forms documenting the health goal of the visit, the self-management strategies discussed and participant concerns. 634 encounter reports were completed for the 145 intervention participants. CHW notes revealed three main obstacles to optimal disease control: gaps in diabetes knowledge and self-management skills; socioeconomic conditions; and the complexity of the healthcare system. CHWs helped participants overcome these obstacles through extensive, hands-on education, connecting participants to community resources, and assistance navigating the medical system. In addition, the CHWs offered uncomplicated accessibility and availability to their clients. CHWs can be a valuable asset for low-income patients with chronic health conditions who may require more support than what can provided in a typical primary care visit.

Regulatory sequence analysis tools.

PubMed

van Helden, Jacques

2003-07-01

The web resource Regulatory Sequence Analysis Tools (RSAT) (http://rsat.ulb.ac.be/rsat) offers a collection of software tools dedicated to the prediction of regulatory sites in non-coding DNA sequences. These tools include sequence retrieval, pattern discovery, pattern matching, genome-scale pattern matching, feature-map drawing, random sequence generation and other utilities. Alternative formats are supported for the representation of regulatory motifs (strings or position-specific scoring matrices) and several algorithms are proposed for pattern discovery. RSAT currently holds >100 fully sequenced genomes and these data are regularly updated from GenBank.

Population Structure of the Primary Malaria Vector in South America, Anopheles darlingi, Using Isozyme, Random Amplified Polymorphic DNA, Internal Transcribed Spacer 2, and Morphologic Markers

DTIC Science & Technology

1999-01-01

distances and identities and Roger?’ genetic distances were clustered by the unweighted pair group method using arithmetic average ( UPGMA ) to produce...Seattle, WA) using the NEIGHBOR program with the UPGMA option and a phenogram was produced with DRAWGRAM, also in PHYLIP 3.X RAPDBOOT5’ was used to...generate 100 pseudoreplicate distance matrices, which were collapsed to form 100 trees with UPGMA . The bootstrap consensus tree was derived from the 100

Dynamical entropy via entropy of non-random matrices: application to stability and complexity in modelling ecosystems.

PubMed

Chakrabarti, C G; Ghosh, Koyel

2013-10-01

In the present paper we have first introduced a measure of dynamical entropy of an ecosystem on the basis of the dynamical model of the system. The dynamical entropy which depends on the eigenvalues of the community matrix of the system leads to a consistent measure of complexity of the ecosystem to characterize the dynamical behaviours such as the stability, instability and periodicity around the stationary states of the system. We have illustrated the theory with some model ecosystems. Copyright © 2013 Elsevier Inc. All rights reserved.

Model selection with multiple regression on distance matrices leads to incorrect inferences.

PubMed

Franckowiak, Ryan P; Panasci, Michael; Jarvis, Karl J; Acuña-Rodriguez, Ian S; Landguth, Erin L; Fortin, Marie-Josée; Wagner, Helene H

2017-01-01

In landscape genetics, model selection procedures based on Information Theoretic and Bayesian principles have been used with multiple regression on distance matrices (MRM) to test the relationship between multiple vectors of pairwise genetic, geographic, and environmental distance. Using Monte Carlo simulations, we examined the ability of model selection criteria based on Akaike's information criterion (AIC), its small-sample correction (AICc), and the Bayesian information criterion (BIC) to reliably rank candidate models when applied with MRM while varying the sample size. The results showed a serious problem: all three criteria exhibit a systematic bias toward selecting unnecessarily complex models containing spurious random variables and erroneously suggest a high level of support for the incorrectly ranked best model. These problems effectively increased with increasing sample size. The failure of AIC, AICc, and BIC was likely driven by the inflated sample size and different sum-of-squares partitioned by MRM, and the resulting effect on delta values. Based on these findings, we strongly discourage the continued application of AIC, AICc, and BIC for model selection with MRM.

Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications

NASA Astrophysics Data System (ADS)

Julaiti, Alafate; Wu, Bin; Zhang, Zhongzhi

2013-05-01

The eigenvalues of the normalized Laplacian matrix of a network play an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian matrices of a family of fractal trees and dendrimers modeled by Cayley trees, both of which are built in an iterative way. For the fractal trees, we apply the spectral decimation approach to determine analytically all the eigenvalues and their corresponding multiplicities, with the eigenvalues provided by a recursive relation governing the eigenvalues of networks at two successive generations. For Cayley trees, we show that all their eigenvalues can be obtained by computing the roots of several small-degree polynomials defined recursively. By using the relation between normalized Laplacian spectra and eigentime identity, we derive the explicit solution to the eigentime identity for random walks on the two treelike networks, the leading scalings of which follow quite different behaviors. In addition, we corroborate the obtained eigenvalues and their degeneracies through the link between them and the number of spanning trees.

Real-time monitoring of river water quality using in-line continuous acquisition of fluorescence excitation and emission matrices

NASA Astrophysics Data System (ADS)

Carstea, E.; Baker, A.; Johnson, R.; Reynolds, D. M.

2009-12-01

In-line fluorescence EEM monitoring has been performed over an eleven-day period for Bournbrook River, Birmingham, UK. River water was diverted to a portable laboratory via a continuous flow pump and filter system. Fluorescence excitation-emission matrices data was recorded every 3 minutes using a flow cell (1cm pathlength) coupled to a fiber optic probe. This real-time fluorescence EEM data (Excitation, 225-400 nm at 5 nm steps, emission, 280-500 nm at 2 nm steps) was collected 'in-line'and directly compared with the spectrophotometric properties and physical and chemical parameters of river water samples collected off-line at known time intervals. Over the monitoring period, minor pollution pulses from cross connections were detected and identified hourly along with a random diesel pollution event. This work addresses the practicalities of measuring and detecting fluorescence EEM in the field and discusses the potential of this technological approach for further understanding important hydrological and biogeochemical processes. Problems associated with fouling and system failure are also reported. Example of the data generated from the continuous fluorescence EEM monitoring.

Power flow prediction in vibrating systems via model reduction

NASA Astrophysics Data System (ADS)

Li, Xianhui

This dissertation focuses on power flow prediction in vibrating systems. Reduced order models (ROMs) are built based on rational Krylov model reduction which preserve power flow information in the original systems over a specified frequency band. Stiffness and mass matrices of the ROMs are obtained by projecting the original system matrices onto the subspaces spanned by forced responses. A matrix-free algorithm is designed to construct ROMs directly from the power quantities at selected interpolation frequencies. Strategies for parallel implementation of the algorithm via message passing interface are proposed. The quality of ROMs is iteratively refined according to the error estimate based on residual norms. Band capacity is proposed to provide a priori estimate of the sizes of good quality ROMs. Frequency averaging is recast as ensemble averaging and Cauchy distribution is used to simplify the computation. Besides model reduction for deterministic systems, details of constructing ROMs for parametric and nonparametric random systems are also presented. Case studies have been conducted on testbeds from Harwell-Boeing collections. Input and coupling power flow are computed for the original systems and the ROMs. Good agreement is observed in all cases.

Aviation obstacle auto-extraction using remote sensing information

NASA Astrophysics Data System (ADS)

Zimmer, N.; Lugsch, W.; Ravenscroft, D.; Schiefele, J.

2008-10-01

An Obstacle, in the aviation context, may be any natural, man-made, fixed or movable object, permanent or temporary. Currently, the most common way to detect relevant aviation obstacles from an aircraft or helicopter for navigation purposes and collision avoidance is the use of merged infrared and synthetic information of obstacle data. Several algorithms have been established to utilize synthetic and infrared images to generate obstacle information. There might be a situation however where the system is error-prone and may not be able to consistently determine the current environment. This situation can be avoided when the system knows the true position of the obstacle. The quality characteristics of the obstacle data strongly depends on the quality of the source data such as maps and official publications. In some countries such as newly industrializing and developing countries, quality and quantity of obstacle information is not available. The aviation world has two specifications - RTCA DO-276A and ICAO ANNEX 15 Ch. 10 - which describe the requirements for aviation obstacles. It is essential to meet these requirements to be compliant with the specifications and to support systems based on these specifications, e.g. 3D obstacle warning systems where accurate coordinates based on WGS-84 is a necessity. Existing aerial and satellite or soon to exist high quality remote sensing data makes it feasible to think about automated aviation obstacle data origination. This paper will describe the feasibility to auto-extract aviation obstacles from remote sensing data considering limitations of image and extraction technologies. Quality parameters and possible resolution of auto-extracted obstacle data will be discussed and presented.

Basal Cell Carcinoma With Matrical Differentiation: Clinicopathologic, Immunohistochemical, and Molecular Biological Study of 22 Cases.

PubMed

Kyrpychova, Liubov; Carr, Richard A; Martinek, Petr; Vanecek, Tomas; Perret, Raul; Chottová-Dvořáková, Magdalena; Zamecnik, Michal; Hadravsky, Ladislav; Michal, Michal; Kazakov, Dmitry V

2017-06-01

Basal cell carcinoma (BCC) with matrical differentiation is a fairly rare neoplasm, with about 30 cases documented mainly as isolated case reports. We studied a series of this neoplasm, including cases with an atypical matrical component, a hitherto unreported feature. Lesions coded as BCC with matrical differentiation were reviewed; 22 cases were included. Immunohistochemical studies were performed using antibodies against BerEp4, β-catenin, and epithelial membrane antigen (EMA). Molecular genetic studies using Ion AmpliSeq Cancer Hotspot Panel v2 by massively parallel sequencing on Ion Torrent PGM were performed in 2 cases with an atypical matrical component (1 was previously subjected to microdissection to sample the matrical and BCC areas separately). There were 13 male and 9 female patients, ranging in age from 41 to 89 years. Microscopically, all lesions manifested at least 2 components, a BCC area (follicular germinative differentiation) and areas with matrical differentiation. A BCC component dominated in 14 cases, whereas a matrical component dominated in 4 cases. Matrical differentiation was recognized as matrical/supramatrical cells (n=21), shadow cells (n=21), bright red trichohyaline granules (n=18), and blue-gray corneocytes (n=18). In 2 cases, matrical areas manifested cytologic atypia, and a third case exhibited an infiltrative growth pattern, with the tumor metastasizing to a lymph node. BerEP4 labeled the follicular germinative cells, whereas it was markedly reduced or negative in matrical areas. The reverse pattern was seen with β-catenin. EMA was negative in BCC areas but stained a proportion of matrical/supramatrical cells. Genetic studies revealed mutations of the following genes: CTNNB1, KIT, CDKN2A, TP53, SMAD4, ERBB4, and PTCH1, with some differences between the matrical and BCC components. It is concluded that matrical differentiation in BCC in most cases occurs as multiple foci. Rare neoplasms manifest atypia in the matrical areas. Immunohistochemical analysis for BerEP4, EMA, and β-catenin can be helpful in limited biopsy specimens. From a molecular biological prospective, BCC and matrical components appear to share some of the gene mutations but have differences in others, but this observation must be validated in a large series.

Research on UAV Intelligent Obstacle Avoidance Technology During Inspection of Transmission Line

NASA Astrophysics Data System (ADS)

Wei, Chuanhu; Zhang, Fei; Yin, Chaoyuan; Liu, Yue; Liu, Liang; Li, Zongyu; Wang, Wanguo

Autonomous obstacle avoidance of unmanned aerial vehicle (hereinafter referred to as UAV) in electric power line inspection process has important significance for operation safety and economy for UAV intelligent inspection system of transmission line as main content of UAV intelligent inspection system on transmission line. In the paper, principles of UAV inspection obstacle avoidance technology of transmission line are introduced. UAV inspection obstacle avoidance technology based on particle swarm global optimization algorithm is proposed after common obstacle avoidance technologies are studied. Stimulation comparison is implemented with traditional UAV inspection obstacle avoidance technology which adopts artificial potential field method. Results show that UAV inspection strategy of particle swarm optimization algorithm, adopted in the paper, is prominently better than UAV inspection strategy of artificial potential field method in the aspects of obstacle avoidance effect and the ability of returning to preset inspection track after passing through the obstacle. An effective method is provided for UAV inspection obstacle avoidance of transmission line.

A Real-Time Reaction Obstacle Avoidance Algorithm for Autonomous Underwater Vehicles in Unknown Environments

PubMed Central

Yan, Zheping; Li, Jiyun; Zhang, Gengshi; Wu, Yi

2018-01-01

A novel real-time reaction obstacle avoidance algorithm (RRA) is proposed for autonomous underwater vehicles (AUVs) that must adapt to unknown complex terrains, based on forward looking sonar (FLS). To accomplish this algorithm, obstacle avoidance rules are planned, and the RRA processes are split into five steps Introduction only lists 4 so AUVs can rapidly respond to various environment obstacles. The largest polar angle algorithm (LPAA) is designed to change detected obstacle’s irregular outline into a convex polygon, which simplifies the obstacle avoidance process. A solution is designed to solve the trapping problem existing in U-shape obstacle avoidance by an outline memory algorithm. Finally, simulations in three unknown obstacle scenes are carried out to demonstrate the performance of this algorithm, where the obtained obstacle avoidance trajectories are safety, smooth and near-optimal. PMID:29393915

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.

Spectra of random networks in the weak clustering regime

NASA Astrophysics Data System (ADS)

Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen; Rodrigues, Francisco A.

2018-03-01

The asymptotic behavior of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of traditional configuration models, networks generated through these models fail to describe many topological features of real-world networks, in particular non-null values of the clustering coefficient. Here we study effects of cycles of order three (triangles) in network spectra. By using recent advances in random matrix theory, we determine the spectral distribution of the network adjacency matrix as a function of the average number of triangles attached to each node for networks without modular structure and degree-degree correlations. Implications to network dynamics are discussed. Our findings can shed light in the study of how particular kinds of subgraphs influence network dynamics.

Individual eigenvalue distributions of crossover chiral random matrices and low-energy constants of SU(2) × U(1) lattice gauge theory

NASA Astrophysics Data System (ADS)

Yamamoto, Takuya; Nishigaki, Shinsuke M.

2018-02-01

We compute individual distributions of low-lying eigenvalues of a chiral random matrix ensemble interpolating symplectic and unitary symmetry classes by the Nyström-type method of evaluating the Fredholm Pfaffian and resolvents of the quaternion kernel. The one-parameter family of these distributions is shown to fit excellently the Dirac spectra of SU(2) lattice gauge theory with a constant U(1) background or dynamically fluctuating U(1) gauge field, which weakly breaks the pseudoreality of the unperturbed SU(2) Dirac operator. The observed linear dependence of the crossover parameter with the strength of the U(1) perturbations leads to precise determination of the pseudo-scalar decay constant, as well as the chiral condensate in the effective chiral Lagrangian of the AI class.

Vanishing-Overhead Linear-Scaling Random Phase Approximation by Cholesky Decomposition and an Attenuated Coulomb-Metric.

PubMed

Luenser, Arne; Schurkus, Henry F; Ochsenfeld, Christian

2017-04-11

A reformulation of the random phase approximation within the resolution-of-the-identity (RI) scheme is presented, that is competitive to canonical molecular orbital RI-RPA already for small- to medium-sized molecules. For electronically sparse systems drastic speedups due to the reduced scaling behavior compared to the molecular orbital formulation are demonstrated. Our reformulation is based on two ideas, which are independently useful: First, a Cholesky decomposition of density matrices that reduces the scaling with basis set size for a fixed-size molecule by one order, leading to massive performance improvements. Second, replacement of the overlap RI metric used in the original AO-RPA by an attenuated Coulomb metric. Accuracy is significantly improved compared to the overlap metric, while locality and sparsity of the integrals are retained, as is the effective linear scaling behavior.

A simple and sensitive enzymatic method for cholesterol quantification in macrophages and foam cells

PubMed Central

Robinet, Peggy; Wang, Zeneng; Hazen, Stanley L.; Smith, Jonathan D.

2010-01-01

A precise and sensitive method for measuring cellular free and esterified cholesterol is required in order to perform studies of macrophage cholesterol loading, metabolism, storage, and efflux. Until now, the use of an enzymatic cholesterol assay, commonly used for aqueous phase plasma cholesterol assays, has not been optimized for use with solid phase samples such as cells, due to inefficient solubilization of total cholesterol in enzyme compatible solvents. We present an efficient solubilization protocol compatible with an enzymatic cholesterol assay that does not require chemical saponification or chromatographic separation. Another issue with enzyme compatible solvents is the presence of endogenous peroxides that interfere with the enzymatic cholesterol assay. We overcame this obstacle by pretreatment of the reaction solution with the enzyme catalase, which consumed endogenous peroxides resulting in reduced background and increased sensitivity in our method. Finally, we demonstrated that this method for cholesterol quantification in macrophages yields results that are comparable to those measured by stable isotope dilution gas chromatography with mass spectrometry detection. In conclusion, we describe a sensitive, simple, and high-throughput enzymatic method to quantify cholesterol in complex matrices such as cells. PMID:20688754

Future technologies for monitoring HIV drug resistance and cure.

PubMed

Parikh, Urvi M; McCormick, Kevin; van Zyl, Gert; Mellors, John W

2017-03-01

Sensitive, scalable and affordable assays are critically needed for monitoring the success of interventions for preventing, treating and attempting to cure HIV infection. This review evaluates current and emerging technologies that are applicable for both surveillance of HIV drug resistance (HIVDR) and characterization of HIV reservoirs that persist despite antiretroviral therapy and are obstacles to curing HIV infection. Next-generation sequencing (NGS) has the potential to be adapted into high-throughput, cost-efficient approaches for HIVDR surveillance and monitoring during continued scale-up of antiretroviral therapy and rollout of preexposure prophylaxis. Similarly, improvements in PCR and NGS are resulting in higher throughput single genome sequencing to detect intact proviruses and to characterize HIV integration sites and clonal expansions of infected cells. Current population genotyping methods for resistance monitoring are high cost and low throughput. NGS, combined with simpler sample collection and storage matrices (e.g. dried blood spots), has considerable potential to broaden global surveillance and patient monitoring for HIVDR. Recent adaptions of NGS to identify integration sites of HIV in the human genome and to characterize the integrated HIV proviruses are likely to facilitate investigations of the impact of experimental 'curative' interventions on HIV reservoirs.

Range Sensor-Based Efficient Obstacle Avoidance through Selective Decision-Making.

PubMed

Shim, Youngbo; Kim, Gon-Woo

2018-03-29

In this paper, we address a collision avoidance method for mobile robots. Many conventional obstacle avoidance methods have been focused solely on avoiding obstacles. However, this can cause instability when passing through a narrow passage, and can also generate zig-zag motions. We define two strategies for obstacle avoidance, known as Entry mode and Bypass mode. Entry mode is a pattern for passing through the gap between obstacles, while Bypass mode is a pattern for making a detour around obstacles safely. With these two modes, we propose an efficient obstacle avoidance method based on the Expanded Guide Circle (EGC) method with selective decision-making. The simulation and experiment results show the validity of the proposed method.

A Brief Historical Introduction to Matrices and Their Applications

ERIC Educational Resources Information Center

Debnath, L.

2014-01-01

This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer's Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical…

Laminin active peptide/agarose matrices as multifunctional biomaterials for tissue engineering.

PubMed

Yamada, Yuji; Hozumi, Kentaro; Aso, Akihiro; Hotta, Atsushi; Toma, Kazunori; Katagiri, Fumihiko; Kikkawa, Yamato; Nomizu, Motoyoshi

2012-06-01

Cell adhesive peptides derived from extracellular matrix components are potential candidates to afford bio-adhesiveness to cell culture scaffolds for tissue engineering. Previously, we covalently conjugated bioactive laminin peptides to polysaccharides, such as chitosan and alginate, and demonstrated their advantages as biomaterials. Here, we prepared functional polysaccharide matrices by mixing laminin active peptides and agarose gel. Several laminin peptide/agarose matrices showed cell attachment activity. In particular, peptide AG73 (RKRLQVQLSIRT)/agarose matrices promoted strong cell attachment and the cell behavior depended on the stiffness of agarose matrices. Fibroblasts formed spheroid structures on the soft AG73/agarose matrices while the cells formed a monolayer with elongated morphologies on the stiff matrices. On the stiff AG73/agarose matrices, neuronal cells extended neuritic processes and endothelial cells formed capillary-like networks. In addition, salivary gland cells formed acini-like structures on the soft matrices. These results suggest that the peptide/agarose matrices are useful for both two- and three-dimensional cell culture systems as a multifunctional biomaterial for tissue engineering. Copyright © 2012 Elsevier Ltd. All rights reserved.

Laminar CuO-water nano-fluid flow and heat transfer in a backward-facing step with and without obstacle

NASA Astrophysics Data System (ADS)

Togun, Hussein

2016-03-01

This paper presents a numerical investigate on CuO-water nano-fluid and heat transfer in a backward-facing step with and without obstacle. The range of Reynolds number varied from 75 to 225 with volume fraction on CuO nanoparticles varied from 1 to 4 % at constant heat flux was investigated. Continuity, momentum, and energy equations with finite volume method in two dimensions were employed. Four different configurations of backward-facing step (without obstacle, with obstacle of 1.5 mm, with obstacle of 3 mm, with obstacle of 4.5 mm) were considered to find the best thermal performance. The results show that the maximum augmentation in heat transfer was about 22 % for backward-facing step with obstacle of 4.5 mm and using CuO nanoparticles at Reynolds number of 225 compared with backward-facing step without obstacle. It is also observed that increase in size of recirculation region with increase of height obstacle on the channel wall has remarkable effect on thermal performance. The results also found that increases in Reynolds number, height obstacle, and volume fractions of CuO nanoparticles lead to increase of pressure drop.

Obstacle avoidance handling and mixed integer predictive control for space robots

NASA Astrophysics Data System (ADS)

Zong, Lijun; Luo, Jianjun; Wang, Mingming; Yuan, Jianping

2018-04-01

This paper presents a novel obstacle avoidance constraint and a mixed integer predictive control (MIPC) method for space robots avoiding obstacles and satisfying physical limits during performing tasks. Firstly, a novel kind of obstacle avoidance constraint of space robots, which needs the assumption that the manipulator links and the obstacles can be represented by convex bodies, is proposed by limiting the relative velocity between two closest points which are on the manipulator and the obstacle, respectively. Furthermore, the logical variables are introduced into the obstacle avoidance constraint, which have realized the constraint form is automatically changed to satisfy different obstacle avoidance requirements in different distance intervals between the space robot and the obstacle. Afterwards, the obstacle avoidance constraint and other system physical limits, such as joint angle ranges, the amplitude boundaries of joint velocities and joint torques, are described as inequality constraints of a quadratic programming (QP) problem by using the model predictive control (MPC) method. To guarantee the feasibility of the obtained multi-constraint QP problem, the constraints are treated as soft constraints and assigned levels of priority based on the propositional logic theory, which can realize that the constraints with lower priorities are always firstly violated to recover the feasibility of the QP problem. Since the logical variables have been introduced, the optimization problem including obstacle avoidance and system physical limits as prioritized inequality constraints is termed as MIPC method of space robots, and its computational complexity as well as possible strategies for reducing calculation amount are analyzed. Simulations of the space robot unfolding its manipulator and tracking the end-effector's desired trajectories with the existence of obstacles and physical limits are presented to demonstrate the effectiveness of the proposed obstacle avoidance strategy and MIPC control method of space robots.

Access to HIV prevention services among gender based violence survivors in Tanzania

PubMed Central

Mboya, Beati; Temu, Florence; Awadhi, Bayoum; Ngware, Zubeda; Ndyetabura, Elly; Kiondo, Gloria; Maridadi, Janneth

2012-01-01

Introduction Currently, Tanzania's HIV prevalence is 5.7%. Gender inequality and Gender Based Violence (GBV) are among factors fuelling the spread of HIV in Tanzania. This study was conducted to assess universal access to HIV prevention services among GBV survivors in Iringa and Dar-es-Salaam where HIV prevalence is as high as 14.7% and 9% respectively compared to a national average of 5.7%. Methods In 2010, a mixed methods study using triangulation model was conducted in Iringa and Dar-es-Salaam regions to represent rural and urban settings respectively. Questionnaires were administered to 283 randomly selected survivors and 37 health providers while 28 in-depth interviews and 16 focus group discussions were conducted among various stakeholders. Quantitative data was analyzed in SPSS by comparing descriptive statistics while qualitative data was analyzed using thematic framework approach. Results Counseling and testing was the most common type of HIV prevention services received by GBV survivors (29%). Obstacles for HIV prevention among GBV survivors included: stigma, male dominance culture and fear of marital separation. Bribery in service delivery points, lack of confidentiality, inadequate GBV knowledge among health providers, and fear of being involved in legal matters were mentioned to be additional obstacles to service accessibility by survivors. Reported consequences of GBV included: psychological problems, physical trauma, chronic illness, HIV infection. Conclusion GBV related stigma and cultural norms are obstacles to HIV services accessibility. Initiation of friendly health services, integration of GBV into HIV services and community based interventions addressing GBV related stigma and cultural norms are recommended. PMID:23467278

Access to HIV prevention services among gender based violence survivors in Tanzania.

PubMed

Mboya, Beati; Temu, Florence; Awadhi, Bayoum; Ngware, Zubeda; Ndyetabura, Elly; Kiondo, Gloria; Maridadi, Janneth

2012-01-01

Currently, Tanzania's HIV prevalence is 5.7%. Gender inequality and Gender Based Violence (GBV) are among factors fuelling the spread of HIV in Tanzania. This study was conducted to assess universal access to HIV prevention services among GBV survivors in Iringa and Dar-es-Salaam where HIV prevalence is as high as 14.7% and 9% respectively compared to a national average of 5.7%. In 2010, a mixed methods study using triangulation model was conducted in Iringa and Dar-es-Salaam regions to represent rural and urban settings respectively. Questionnaires were administered to 283 randomly selected survivors and 37 health providers while 28 in-depth interviews and 16 focus group discussions were conducted among various stakeholders. Quantitative data was analyzed in SPSS by comparing descriptive statistics while qualitative data was analyzed using thematic framework approach. Counseling and testing was the most common type of HIV prevention services received by GBV survivors (29%). Obstacles for HIV prevention among GBV survivors included: stigma, male dominance culture and fear of marital separation. Bribery in service delivery points, lack of confidentiality, inadequate GBV knowledge among health providers, and fear of being involved in legal matters were mentioned to be additional obstacles to service accessibility by survivors. Reported consequences of GBV included: psychological problems, physical trauma, chronic illness, HIV infection. GBV related stigma and cultural norms are obstacles to HIV services accessibility. Initiation of friendly health services, integration of GBV into HIV services and community based interventions addressing GBV related stigma and cultural norms are recommended.

Effects of soft interactions and bound mobility on diffusion in crowded environments: a model of sticky and slippery obstacles

NASA Astrophysics Data System (ADS)

Stefferson, Michael W.; Norris, Samantha L.; Vernerey, Franck J.; Betterton, Meredith D.; E Hough, Loren

2017-08-01

Crowded environments modify the diffusion of macromolecules, generally slowing their movement and inducing transient anomalous subdiffusion. The presence of obstacles also modifies the kinetics and equilibrium behavior of tracers. While previous theoretical studies of particle diffusion have typically assumed either impenetrable obstacles or binding interactions that immobilize the particle, in many cellular contexts bound particles remain mobile. Examples include membrane proteins or lipids with some entry and diffusion within lipid domains and proteins that can enter into membraneless organelles or compartments such as the nucleolus. Using a lattice model, we studied the diffusive movement of tracer particles which bind to soft obstacles, allowing tracers and obstacles to occupy the same lattice site. For sticky obstacles, bound tracer particles are immobile, while for slippery obstacles, bound tracers can hop without penalty to adjacent obstacles. In both models, binding significantly alters tracer motion. The type and degree of motion while bound is a key determinant of the tracer mobility: slippery obstacles can allow nearly unhindered diffusion, even at high obstacle filling fraction. To mimic compartmentalization in a cell, we examined how obstacle size and a range of bound diffusion coefficients affect tracer dynamics. The behavior of the model is similar in two and three spatial dimensions. Our work has implications for protein movement and interactions within cells.

Miscellaneous methods for measuring matric or water potential

USGS Publications Warehouse

Scanlon, Bridget R.; Andraski, Brian J.; Bilskie, Jim; Dane, Jacob H.; Topp, G. Clarke

2002-01-01

A variety of techniques to measure matric potential or water potential in the laboratory and in the field are described in this section. The techniques described herein require equilibration of some medium whose matric or water potential can be determined from previous calibration or can be measured directly. Under equilibrium conditions the matric or water potential of the medium is equal to that of the soil. The techniques can be divided into: (i) those that measure matric potential and (ii) those that measure water potential (sum of matric and osmotic potentials). Matric potential is determined when the sensor matrix is in direct contact with the soil, so salts are free to diffuse in or out of the sensor matrix, and the equilibrium measurement therefore reflects matric forces acting on the water. Water potential is determined when the sensor is separated from the soil by a vapor gap, so salts are not free to move in or out of the sensor, and the equilibrium measurement reflects the sum of the matric and osmotic forces acting on the water.Seven different techniques are described in this section. Those that measure matric potential include (i) heat dissipation sensors, (ii) electrical resistance sensors, (iii) frequency domain and time domain sensors, and (iv) electro-optical switches. A method that can be used to measure matric potential or water potential is the (v) filter paper method. Techniques that measure water potential include (vi) the Dew Point Potentiameter (Decagon Devices, Inc., Pullman, WA1) (water activity meter) and (vii) vapor equilibration.The first four techniques are electronically based methods for measuring matric potential. Heat dissipation sensors and electrical resistance sensors infer matric potential from previously determined calibration relations between sensor heat dissipation or electrical resistance and matric potential. Frequency-domain and timedomain matric potential sensors measure water content, which is related to matric potential of the sensor through calibration. Electro-optical switches measure changes in light transmission through thin, nylon filters as they absorb or desorb water in response to changes in matric potential. Heat dissipation sensors and electrical resistance sensors are used primarily in the field to provide information on matric potential. Frequency domain matric potential sensors are new and have not been widely used. Time domain matric potential sensors and electro-optical switches are new and have not been commercialized. For the fifth technique, filter paper is used as the standard matrix. The filter paper technique measures matric potential when the filter paper is in direct contact with soil or water potential when separated from soil by a vapor gap. The Dew Point Potentiameter calculates water potential from the measured dew point and sample temperature. The vapor equilibration technique involves equilibration of soil samples with salt solutions of known osmotic potential. The filter paper, Dew Point Potentiameter, and vapor equilibration techniques are generally used in the laboratory to measure water potential of disturbed field samples or to measure water potential for water retention functions.

Neutrino mass priors for cosmology from random matrices

NASA Astrophysics Data System (ADS)

Long, Andrew J.; Raveri, Marco; Hu, Wayne; Dodelson, Scott

2018-02-01

Cosmological measurements of structure are placing increasingly strong constraints on the sum of the neutrino masses, Σ mν, through Bayesian inference. Because these constraints depend on the choice for the prior probability π (Σ mν), we argue that this prior should be motivated by fundamental physical principles rather than the ad hoc choices that are common in the literature. The first step in this direction is to specify the prior directly at the level of the neutrino mass matrix Mν, since this is the parameter appearing in the Lagrangian of the particle physics theory. Thus by specifying a probability distribution over Mν, and by including the known squared mass splittings, we predict a theoretical probability distribution over Σ mν that we interpret as a Bayesian prior probability π (Σ mν). Assuming a basis-invariant probability distribution on Mν, also known as the anarchy hypothesis, we find that π (Σ mν) peaks close to the smallest Σ mν allowed by the measured mass splittings, roughly 0.06 eV (0.1 eV) for normal (inverted) ordering, due to the phenomenon of eigenvalue repulsion in random matrices. We consider three models for neutrino mass generation: Dirac, Majorana, and Majorana via the seesaw mechanism; differences in the predicted priors π (Σ mν) allow for the possibility of having indications about the physical origin of neutrino masses once sufficient experimental sensitivity is achieved. We present fitting functions for π (Σ mν), which provide a simple means for applying these priors to cosmological constraints on the neutrino masses or marginalizing over their impact on other cosmological parameters.

Eigenvalues of Random Matrices with Isotropic Gaussian Noise and the Design of Diffusion Tensor Imaging Experiments.

PubMed

Gasbarra, Dario; Pajevic, Sinisa; Basser, Peter J

2017-01-01

Tensor-valued and matrix-valued measurements of different physical properties are increasingly available in material sciences and medical imaging applications. The eigenvalues and eigenvectors of such multivariate data provide novel and unique information, but at the cost of requiring a more complex statistical analysis. In this work we derive the distributions of eigenvalues and eigenvectors in the special but important case of m×m symmetric random matrices, D , observed with isotropic matrix-variate Gaussian noise. The properties of these distributions depend strongly on the symmetries of the mean tensor/matrix, D̄ . When D̄ has repeated eigenvalues, the eigenvalues of D are not asymptotically Gaussian, and repulsion is observed between the eigenvalues corresponding to the same D̄ eigenspaces. We apply these results to diffusion tensor imaging (DTI), with m = 3, addressing an important problem of detecting the symmetries of the diffusion tensor, and seeking an experimental design that could potentially yield an isotropic Gaussian distribution. In the 3-dimensional case, when the mean tensor is spherically symmetric and the noise is Gaussian and isotropic, the asymptotic distribution of the first three eigenvalue central moment statistics is simple and can be used to test for isotropy. In order to apply such tests, we use quadrature rules of order t ≥ 4 with constant weights on the unit sphere to design a DTI-experiment with the property that isotropy of the underlying true tensor implies isotropy of the Fisher information. We also explain the potential implications of the methods using simulated DTI data with a Rician noise model.

Multichannel Compressive Sensing MRI Using Noiselet Encoding

PubMed Central

Pawar, Kamlesh; Egan, Gary; Zhang, Jingxin

2015-01-01

The incoherence between measurement and sparsifying transform matrices and the restricted isometry property (RIP) of measurement matrix are two of the key factors in determining the performance of compressive sensing (CS). In CS-MRI, the randomly under-sampled Fourier matrix is used as the measurement matrix and the wavelet transform is usually used as sparsifying transform matrix. However, the incoherence between the randomly under-sampled Fourier matrix and the wavelet matrix is not optimal, which can deteriorate the performance of CS-MRI. Using the mathematical result that noiselets are maximally incoherent with wavelets, this paper introduces the noiselet unitary bases as the measurement matrix to improve the incoherence and RIP in CS-MRI. Based on an empirical RIP analysis that compares the multichannel noiselet and multichannel Fourier measurement matrices in CS-MRI, we propose a multichannel compressive sensing (MCS) framework to take the advantage of multichannel data acquisition used in MRI scanners. Simulations are presented in the MCS framework to compare the performance of noiselet encoding reconstructions and Fourier encoding reconstructions at different acceleration factors. The comparisons indicate that multichannel noiselet measurement matrix has better RIP than that of its Fourier counterpart, and that noiselet encoded MCS-MRI outperforms Fourier encoded MCS-MRI in preserving image resolution and can achieve higher acceleration factors. To demonstrate the feasibility of the proposed noiselet encoding scheme, a pulse sequences with tailored spatially selective RF excitation pulses was designed and implemented on a 3T scanner to acquire the data in the noiselet domain from a phantom and a human brain. The results indicate that noislet encoding preserves image resolution better than Fouirer encoding. PMID:25965548

Random matrix theory filters in portfolio optimisation: A stability and risk assessment

NASA Astrophysics Data System (ADS)

Daly, J.; Crane, M.; Ruskin, H. J.

2008-07-01

Random matrix theory (RMT) filters, applied to covariance matrices of financial returns, have recently been shown to offer improvements to the optimisation of stock portfolios. This paper studies the effect of three RMT filters on the realised portfolio risk, and on the stability of the filtered covariance matrix, using bootstrap analysis and out-of-sample testing. We propose an extension to an existing RMT filter, (based on Krzanowski stability), which is observed to reduce risk and increase stability, when compared to other RMT filters tested. We also study a scheme for filtering the covariance matrix directly, as opposed to the standard method of filtering correlation, where the latter is found to lower the realised risk, on average, by up to 6.7%. We consider both equally and exponentially weighted covariance matrices in our analysis, and observe that the overall best method out-of-sample was that of the exponentially weighted covariance, with our Krzanowski stability-based filter applied to the correlation matrix. We also find that the optimal out-of-sample decay factors, for both filtered and unfiltered forecasts, were higher than those suggested by Riskmetrics [J.P. Morgan, Reuters, Riskmetrics technical document, Technical Report, 1996. http://www.riskmetrics.com/techdoc.html], with those for the latter approaching a value of α=1. In conclusion, RMT filtering reduced the realised risk, on average, and in the majority of cases when tested out-of-sample, but increased the realised risk on a marked number of individual days-in some cases more than doubling it.

Eigenvalues of Random Matrices with Isotropic Gaussian Noise and the Design of Diffusion Tensor Imaging Experiments*

PubMed Central

Gasbarra, Dario; Pajevic, Sinisa; Basser, Peter J.

2017-01-01

Tensor-valued and matrix-valued measurements of different physical properties are increasingly available in material sciences and medical imaging applications. The eigenvalues and eigenvectors of such multivariate data provide novel and unique information, but at the cost of requiring a more complex statistical analysis. In this work we derive the distributions of eigenvalues and eigenvectors in the special but important case of m×m symmetric random matrices, D, observed with isotropic matrix-variate Gaussian noise. The properties of these distributions depend strongly on the symmetries of the mean tensor/matrix, D̄. When D̄ has repeated eigenvalues, the eigenvalues of D are not asymptotically Gaussian, and repulsion is observed between the eigenvalues corresponding to the same D̄ eigenspaces. We apply these results to diffusion tensor imaging (DTI), with m = 3, addressing an important problem of detecting the symmetries of the diffusion tensor, and seeking an experimental design that could potentially yield an isotropic Gaussian distribution. In the 3-dimensional case, when the mean tensor is spherically symmetric and the noise is Gaussian and isotropic, the asymptotic distribution of the first three eigenvalue central moment statistics is simple and can be used to test for isotropy. In order to apply such tests, we use quadrature rules of order t ≥ 4 with constant weights on the unit sphere to design a DTI-experiment with the property that isotropy of the underlying true tensor implies isotropy of the Fisher information. We also explain the potential implications of the methods using simulated DTI data with a Rician noise model. PMID:28989561

Genetic code, hamming distance and stochastic matrices.

PubMed

He, Matthew X; Petoukhov, Sergei V; Ricci, Paolo E

2004-09-01

In this paper we use the Gray code representation of the genetic code C=00, U=10, G=11 and A=01 (C pairs with G, A pairs with U) to generate a sequence of genetic code-based matrices. In connection with these code-based matrices, we use the Hamming distance to generate a sequence of numerical matrices. We then further investigate the properties of the numerical matrices and show that they are doubly stochastic and symmetric. We determine the frequency distributions of the Hamming distances, building blocks of the matrices, decomposition and iterations of matrices. We present an explicit decomposition formula for the genetic code-based matrix in terms of permutation matrices, which provides a hypercube representation of the genetic code. It is also observed that there is a Hamiltonian cycle in a genetic code-based hypercube.

Improvements in Obstacle Clearance Parameters and Reaction Time Over a Series of Obstacles Revealed After Five Repeated Testing Sessions in Older Adults.

PubMed

Jehu, Deborah A; Lajoie, Yves; Paquet, Nicole

2017-12-21

The purpose of this study was to investigate obstacle clearance and reaction time parameters when crossing a series of six obstacles in older adults. A second aim was to examine the repeated exposure of this testing protocol once per week for 5 weeks. In total, 10 older adults (five females; age: 67.0 ± 6.9 years) walked onto and over six obstacles of varying heights (range: 100-200 mm) while completing no reaction time, simple reaction time, and choice reaction time tasks once per week for 5 weeks. The highest obstacles elicited the lowest toe clearance, and the first three obstacles revealed smaller heel clearance compared with the last three obstacles. Dual tasking negatively impacted obstacle clearance parameters when information processing demands were high. Longer and less consistent time to completion was observed in Session 1 compared with Sessions 2-5. Finally, improvements in simple reaction time were displayed after Session 2, but choice reaction time gradually improved and did not reach a plateau after repeated testing.

Numerical investigation on layout optimization of obstacles in a three-dimensional passive micromixer.

PubMed

Chen, Xueye; Zhao, Zhongyi

2017-04-29

This paper aims at layout optimization design of obstacles in a three-dimensional T-type micromixer. Numerical analysis shows that the direction of flow velocity change constantly due to the obstacles blocking, which produces the chaotic convection and increases species mixing effectively. The orthogonal experiment method was applied for determining the effects of some key parameters on mixing efficiency. The weights in the order are: height of obstacles > geometric shape > symmetry = number of obstacles. Based on the optimized results, a multi-units obstacle micromixer was designed. Compared with T-type micromixer, the multi-units obstacle micromixer is more efficient, and more than 90% mixing efficiency were obtained for a wide range of peclet numbers. It can be demonstrated that the presented optimal design method of obstacles layout in three-dimensional microchannels is a simple and effective technology to improve species mixing in microfluidic devices. The obstacles layout methodology has the potential for applications in chemical engineering and bioengineering. Copyright © 2017 Elsevier B.V. All rights reserved.

Numerical approach of collision avoidance and optimal control on robotic manipulators

NASA Technical Reports Server (NTRS)

Wang, Jyhshing Jack

1990-01-01

Collision-free optimal motion and trajectory planning for robotic manipulators are solved by a method of sequential gradient restoration algorithm. Numerical examples of a two degree-of-freedom (DOF) robotic manipulator are demonstrated to show the excellence of the optimization technique and obstacle avoidance scheme. The obstacle is put on the midway, or even further inward on purpose, of the previous no-obstacle optimal trajectory. For the minimum-time purpose, the trajectory grazes by the obstacle and the minimum-time motion successfully avoids the obstacle. The minimum-time is longer for the obstacle avoidance cases than the one without obstacle. The obstacle avoidance scheme can deal with multiple obstacles in any ellipsoid forms by using artificial potential fields as penalty functions via distance functions. The method is promising in solving collision-free optimal control problems for robotics and can be applied to any DOF robotic manipulators with any performance indices and mobile robots as well. Since this method generates optimum solution based on Pontryagin Extremum Principle, rather than based on assumptions, the results provide a benchmark against which any optimization techniques can be measured.

Exploring performance obstacles of intensive care nurses.

PubMed

Gurses, Ayse P; Carayon, Pascale

2009-05-01

High nursing workload, poor patient safety, and poor nursing quality of working life (QWL) are major issues in intensive care units (ICUs). Characteristics of the ICU and performance obstacles may contribute to these issues. The goal of this study was to comprehensively identify the performance obstacles perceived by ICU nurses. We used a qualitative research design and conducted semi-structured interviews with 15 ICU nurses of a medical-surgical ICU. Based on this qualitative study and a previously reported quantitative study, we identified seven main types of performance obstacles experienced by ICU nurses. Obstacles related to the physical environment (e.g., noise, amount of space), family relations (e.g., distractions caused by family, lack of time to spend with family), and equipment (e.g., unavailability, misplacement) were the most frequently experienced performance obstacles. The qualitative interview data provided rich information regarding the factors contributing to the performance obstacles. Overall, ICU nurses experience a variety of performance obstacles in their work on a daily basis. Future research is needed to understand the impact of performance obstacles on nursing workload, nursing QWL, and quality and safety of care.

Selective randomized load balancing and mesh networks with changing demands

NASA Astrophysics Data System (ADS)

Shepherd, F. B.; Winzer, P. J.

2006-05-01

We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.

Autonomous dynamic obstacle avoidance for bacteria-powered microrobots (BPMs) with modified vector field histogram

PubMed Central

Kim, Hoyeon; Cheang, U. Kei

2017-01-01

In order to broaden the use of microrobots in practical fields, autonomous control algorithms such as obstacle avoidance must be further developed. However, most previous studies of microrobots used manual motion control to navigate past tight spaces and obstacles while very few studies demonstrated the use of autonomous motion. In this paper, we demonstrated a dynamic obstacle avoidance algorithm for bacteria-powered microrobots (BPMs) using electric field in fluidic environments. A BPM consists of an artificial body, which is made of SU-8, and a high dense layer of harnessed bacteria. BPMs can be controlled using externally applied electric fields due to the electrokinetic property of bacteria. For developing dynamic obstacle avoidance for BPMs, a kinematic model of BPMs was utilized to prevent collision and a finite element model was used to characteristic the deformation of an electric field near the obstacle walls. In order to avoid fast moving obstacles, we modified our previously static obstacle avoidance approach using a modified vector field histogram (VFH) method. To validate the advanced algorithm in experiments, magnetically controlled moving obstacles were used to intercept the BPMs as the BPMs move from the initial position to final position. The algorithm was able to successfully guide the BPMs to reach their respective goal positions while avoiding the dynamic obstacles. PMID:29020016

Autonomous dynamic obstacle avoidance for bacteria-powered microrobots (BPMs) with modified vector field histogram.

PubMed

Kim, Hoyeon; Cheang, U Kei; Kim, Min Jun

2017-01-01

In order to broaden the use of microrobots in practical fields, autonomous control algorithms such as obstacle avoidance must be further developed. However, most previous studies of microrobots used manual motion control to navigate past tight spaces and obstacles while very few studies demonstrated the use of autonomous motion. In this paper, we demonstrated a dynamic obstacle avoidance algorithm for bacteria-powered microrobots (BPMs) using electric field in fluidic environments. A BPM consists of an artificial body, which is made of SU-8, and a high dense layer of harnessed bacteria. BPMs can be controlled using externally applied electric fields due to the electrokinetic property of bacteria. For developing dynamic obstacle avoidance for BPMs, a kinematic model of BPMs was utilized to prevent collision and a finite element model was used to characteristic the deformation of an electric field near the obstacle walls. In order to avoid fast moving obstacles, we modified our previously static obstacle avoidance approach using a modified vector field histogram (VFH) method. To validate the advanced algorithm in experiments, magnetically controlled moving obstacles were used to intercept the BPMs as the BPMs move from the initial position to final position. The algorithm was able to successfully guide the BPMs to reach their respective goal positions while avoiding the dynamic obstacles.

Cell-adhesive RGD peptide-displaying M13 bacteriophage/PLGA nanofiber matrices for growth of fibroblasts.

PubMed

Shin, Yong Cheol; Lee, Jong Ho; Jin, Linhua; Kim, Min Jeong; Oh, Jin-Woo; Kim, Tai Wan; Han, Dong-Wook

2014-01-01

M13 bacteriophages can be readily fabricated as nanofibers due to non-toxic bacterial virus with a nanofiber-like shape. In the present study, we prepared hybrid nanofiber matrices composed of poly(lactic-co-glycolic acid, PLGA) and M13 bacteriophages which were genetically modified to display the RGD peptide on their surface (RGD-M13 phage). The surface morphology and chemical composition of hybrid nanofiber matrices were characterized by scanning electron microscopy (SEM) and Raman spectroscopy, respectively. Immunofluorescence staining was conducted to investigate the existence of M13 bacteriophages in RGD-M13 phage/PLGA hybrid nanofibers. In addition, the attachment and proliferation of three different types of fibroblasts on RGD-M13 phage/PLGA nanofiber matrices were evaluated to explore how fibroblasts interact with these matrices. SEM images showed that RGD-M13 phage/PLGA hybrid matrices had the non-woven porous structure, quite similar to that of natural extracellular matrices, having an average fiber diameter of about 190 nm. Immunofluorescence images and Raman spectra revealed that RGD-M13 phages were homogeneously distributed in entire matrices. Moreover, the attachment and proliferation of fibroblasts cultured on RGD-M13 phage/PLGA matrices were significantly enhanced due to enriched RGD moieties on hybrid matrices. These results suggest that RGD-M13 phage/PLGA matrices can be efficiently used as biomimetic scaffolds for tissue engineering applications.

Observation of Noise Correlated by the Hawking Effect in a Water Tank.

PubMed

Euvé, L-P; Michel, F; Parentani, R; Philbin, T G; Rousseaux, G

2016-09-16

We measured the power spectrum and two-point correlation function for the randomly fluctuating free surface on the downstream side of a stationary flow with a maximum Froude number F_{max}≈0.85 reached above a localized obstacle. On such a flow the scattering of incident long wavelength modes is analogous to that responsible for black hole radiation (the Hawking effect). Our measurements of the noise show a clear correlation between pairs of modes of opposite energies. We also measure the scattering coefficients by applying the same analysis of correlations to waves produced by a wave maker.

When an object appears unexpectedly: anticipatory movement and object circumvention in individuals with and without Developmental Coordination Disorder.

PubMed

Wilmut, K; Barnett, A L

2017-05-01

Obstacles often appear unexpectedly in our pathway and these require us to make adjustments to avoid collision. Previous research has demonstrated that healthy adults will make anticipatory adjustments to gait where they have been told there is the possibility of an obstacle appearing. One population that may find this type of anticipatory movement difficult is individuals with Developmental Coordination Disorder (DCD). The current study considered how individuals with and without DCD adjust to the possibility of an obstacle appearing which would require circumvention. Fortyfour individuals with DCD and 44 age-matched controls (aged from 7 to 34 years of age) walked down an 11 m walkway under three conditions. Initially they were told this was a clear pathway and nothing in the environment would change (1, no possibility of an obstacle, no obstacle). They then performed a series of trials in which a gate may (2, possibility of an obstacle, obstacle) or may not (3, possibility of an obstacle, no obstacle) partially obstruct their pathway. We found that all participants increased medio-lateral trunk acceleration when there was the possibility of an obstacle but before the obstacle appeared, in addition the typical adults and older children also increased step width. When describing circumvention we found that the younger children showed an increase in trunk velocity and acceleration in all three directions compared to older children and adults. We also found that the individuals with DCD adjusted their path sooner and deviated more than their peers. The degree of adjustment to step width in anticipation of an obstacle was related to later medio-lateral velocity and timing of the deviation. Therefore, the lack of 'readying' the system where there is the possibility of an obstacle appearing seen in the individuals with DCD and the younger typical children may explain the increased medio-lateral velocity seen during circumvention.

A novel artificial immune algorithm for spatial clustering with obstacle constraint and its applications.

PubMed

Sun, Liping; Luo, Yonglong; Ding, Xintao; Zhang, Ji

2014-01-01

An important component of a spatial clustering algorithm is the distance measure between sample points in object space. In this paper, the traditional Euclidean distance measure is replaced with innovative obstacle distance measure for spatial clustering under obstacle constraints. Firstly, we present a path searching algorithm to approximate the obstacle distance between two points for dealing with obstacles and facilitators. Taking obstacle distance as similarity metric, we subsequently propose the artificial immune clustering with obstacle entity (AICOE) algorithm for clustering spatial point data in the presence of obstacles and facilitators. Finally, the paper presents a comparative analysis of AICOE algorithm and the classical clustering algorithms. Our clustering model based on artificial immune system is also applied to the case of public facility location problem in order to establish the practical applicability of our approach. By using the clone selection principle and updating the cluster centers based on the elite antibodies, the AICOE algorithm is able to achieve the global optimum and better clustering effect.

A stereo vision-based obstacle detection system in vehicles

NASA Astrophysics Data System (ADS)

Huh, Kunsoo; Park, Jaehak; Hwang, Junyeon; Hong, Daegun

2008-02-01

Obstacle detection is a crucial issue for driver assistance systems as well as for autonomous vehicle guidance function and it has to be performed with high reliability to avoid any potential collision with the front vehicle. The vision-based obstacle detection systems are regarded promising for this purpose because they require little infrastructure on a highway. However, the feasibility of these systems in passenger car requires accurate and robust sensing performance. In this paper, an obstacle detection system using stereo vision sensors is developed. This system utilizes feature matching, epipoplar constraint and feature aggregation in order to robustly detect the initial corresponding pairs. After the initial detection, the system executes the tracking algorithm for the obstacles. The proposed system can detect a front obstacle, a leading vehicle and a vehicle cutting into the lane. Then, the position parameters of the obstacles and leading vehicles can be obtained. The proposed obstacle detection system is implemented on a passenger car and its performance is verified experimentally.

Obstacle Avoidance On Roadways Using Range Data

NASA Astrophysics Data System (ADS)

Dunlay, R. Terry; Morgenthaler, David G.

1987-02-01

This report describes range data based obstacle avoidance techniques developed for use on an autonomous road-following robot vehicle. The purpose of these techniques is to detect and locate obstacles present in a road environment for navigation of a robot vehicle equipped with an active laser-based range sensor. Techniques are presented for obstacle detection, obstacle location, and coordinate transformations needed in the construction of Scene Models (symbolic structures representing the 3-D obstacle boundaries used by the vehicle's Navigator for path planning). These techniques have been successfully tested on an outdoor robotic vehicle, the Autonomous Land Vehicle (ALV), at speeds up to 3.5 km/hour.

Stepping over obstacles: anticipatory modifications in children with and without Down syndrome.

PubMed

Virji-Babul, Naznin; Brown, Michelle

2004-12-01

The purpose of this study was to explore the mechanism of anticipatory control of gait in relation to the perception of an obstacle. Typically developing (TD) children (4-7 years of age) and children with Down syndrome (5-6 years of age) walked and stepped over obstacles of two different heights-a "subtle" obstacle that was placed at a very low distance from the floor (1% of total body height) and an "obvious" obstacle that was placed at a much higher distance from the floor (15% of total body height). Spatial and temporal measures of the gait cycle were analyzed. TD children showed increased variability in pre-obstacle step lengths only in response to the higher obstacle. Children with DS showed a decrease in variability in response to the higher obstacle and marked qualitative changes in their gait cycle. Both groups of children were able to scale toe clearance with obstacle height. These results show that TD young children can make task-specific anticipatory adjustments by modulating step length and toe clearance. Children with DS show appropriate scaling of toe clearance and are beginning to show the emergence of anticipatory responses under specific environmental conditions.

Dynamic Obstacle Avoidance for Unmanned Underwater Vehicles Based on an Improved Velocity Obstacle Method

PubMed Central

Zhang, Wei; Wei, Shilin; Teng, Yanbin; Zhang, Jianku; Wang, Xiufang; Yan, Zheping

2017-01-01

In view of a dynamic obstacle environment with motion uncertainty, we present a dynamic collision avoidance method based on the collision risk assessment and improved velocity obstacle method. First, through the fusion optimization of forward-looking sonar data, the redundancy of the data is reduced and the position, size and velocity information of the obstacles are obtained, which can provide an accurate decision-making basis for next-step collision avoidance. Second, according to minimum meeting time and the minimum distance between the obstacle and unmanned underwater vehicle (UUV), this paper establishes the collision risk assessment model, and screens key obstacles to avoid collision. Finally, the optimization objective function is established based on the improved velocity obstacle method, and a UUV motion characteristic is used to calculate the reachable velocity sets. The optimal collision speed of UUV is searched in velocity space. The corresponding heading and speed commands are calculated, and outputted to the motion control module. The above is the complete dynamic obstacle avoidance process. The simulation results show that the proposed method can obtain a better collision avoidance effect in the dynamic environment, and has good adaptability to the unknown dynamic environment. PMID:29186878

Effects of overweight and obese body mass on motor planning and motor skills during obstacle crossing in children.

PubMed

Gill, Simone V; Hung, Ya-Ching

2014-01-01

Little is known about how obesity relates to motor planning and skills during functional tasks. We collected 3-D kinematics and kinetics as normal weight (n=10) and overweight/obese (n=12) children walked on flat ground and as they crossed low, medium, and high obstacles. We investigated if motor planning and motor skill impairments were evident during obstacle crossing. Baseline conditions showed no group differences (all ps>.05). Increased toe clearance was found on low obstacles (p=.01) for the overweight/obese group and on high obstacles (p=.01) for the normal weight group. With the crossing leg, the overweight/obese group had larger hip abduction angles (p=.01) and medial ground reaction forces (p=.006) on high obstacles and high anterior ground reaction forces on low obstacles (p=.001). With the trailing leg, overweight/obese children had higher vertical ground reaction forces on high obstacles (p=.005) and higher knee angles (p=.01) and anterior acceleration in the center of mass (p=.01) on low obstacles. These findings suggest that differences in motor planning and skills in overweight/obese children may be more apparent during functional activities. Copyright © 2013 Elsevier Ltd. All rights reserved.

Shock interaction behind a pair of cylindrical obstacles

NASA Astrophysics Data System (ADS)

Liu, Heng; Mazumdar, Raoul; Eliasson, Veronica

2014-11-01

The body of work focuses on two-dimensional numerical simulations of shock interaction with a pair of cylindrical obstacles, varying the obstacle separation and incident shock strength. With the shock waves propagating parallel to the center-line between the two cylindrical obstacles, the shock strengths simulated vary from a Mach of 1.4 to a Mach of 2.4, against a wide range of obstacle separation distance to their diameters. These cases are simulated via a software package called Overture, which is used to solve the inviscid Euler equations of gas dynamics on overlapping grids with adaptive mesh refinement. The goal of these cases is to find a so-called ``safe'' region for obstacle spacing and varying shock Mach numbers, such that the pressure in the ``safe'' region is reduced downstream of the obstacles. The benefits apply to both building and armor design for the purpose of shock wave mitigation to keep humans and equipment safe. The results obtained from the simulations confirm that the length of the ``safe'' region and the degree of shock wave attenuation depend on the ratio of obstacle separation distance to obstacle diameter. The influence of various Mach number is also discussed.

Limitations of the Porter-Thomas distribution

NASA Astrophysics Data System (ADS)

Weidenmüller, Hans A.

2017-12-01

Data on the distribution of reduced partial neutron widths and on the distribution of total gamma decay widths disagree with the Porter-Thomas distribution (PTD) for reduced partial widths or with predictions of the statistical model. We recall why the disagreement is important: The PTD is a direct consequence of the orthogonal invariance of the Gaussian Orthogonal Ensemble (GOE) of random matrices. The disagreement is reviewed. Two possible causes for violation of orthogonal invariance of the GOE are discussed, and their consequences explored. The disagreement of the distribution of total gamma decay widths with theoretical predictions cannot be blamed on the statistical model.

On the analogues of Szegő's theorem for ergodic operators

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

Kirsch, W; Pastur, L A

2015-01-31

Szegő's theorem on the asymptotic behaviour of the determinants of large Toeplitz matrices is generalized to the class of ergodic operators. The generalization is formulated in terms of a triple consisting of an ergodic operator and two functions, the symbol and the test function. It is shown that in the case of the one-dimensional discrete Schrödinger operator with random ergodic or quasiperiodic potential and various choices of the symbol and the test function this generalization leads to asymptotic formulae which have no analogues in the situation of Toeplitz operators. Bibliography: 22 titles.

Typical entanglement

NASA Astrophysics Data System (ADS)

Deelan Cunden, Fabio; Facchi, Paolo; Florio, Giuseppe; Pascazio, Saverio

2013-05-01

Let a pure state | ψ> be chosen randomly in an NM-dimensional Hilbert space, and consider the reduced density matrix ρ A of an N-dimensional subsystem. The bipartite entanglement properties of | ψ> are encoded in the spectrum of ρ A . By means of a saddle point method and using a "Coulomb gas" model for the eigenvalues, we obtain the typical spectrum of reduced density matrices. We consider the cases of an unbiased ensemble of pure states and of a fixed value of the purity. We finally obtain the eigenvalue distribution by using a statistical mechanics approach based on the introduction of a partition function.

Markov Chain Analysis of Musical Dice Games

NASA Astrophysics Data System (ADS)

Volchenkov, D.; Dawin, J. R.

2012-07-01

A system for using dice to compose music randomly is known as the musical dice game. The discrete time MIDI models of 804 pieces of classical music written by 29 composers have been encoded into the transition matrices and studied by Markov chains. Contrary to human languages, entropy dominates over redundancy, in the musical dice games based on the compositions of classical music. The maximum complexity is achieved on the blocks consisting of just a few notes (8 notes, for the musical dice games generated over Bach's compositions). First passage times to notes can be used to resolve tonality and feature a composer.

Musical Markov Chains

NASA Astrophysics Data System (ADS)

Volchenkov, Dima; Dawin, Jean René

A system for using dice to compose music randomly is known as the musical dice game. The discrete time MIDI models of 804 pieces of classical music written by 29 composers have been encoded into the transition matrices and studied by Markov chains. Contrary to human languages, entropy dominates over redundancy, in the musical dice games based on the compositions of classical music. The maximum complexity is achieved on the blocks consisting of just a few notes (8 notes, for the musical dice games generated over Bach's compositions). First passage times to notes can be used to resolve tonality and feature a composer.

Development Administration: Obstacles, Theories and Implications for Planning. IIEP Occasional Papers No. 2.

ERIC Educational Resources Information Center

Rodman, Peter W.

In developing countries, public administration is hampered by a number of obstacles foreign to large industrialized nations. Some of these obstacles are shortages of tools and skilled personnel, outmoded organizational structures, political competition, and cultural and attitudinal barriers. The administrative obstacles and their…

A mathematical analysis of the effects of Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks.

PubMed

Siri, Benoît; Berry, Hugues; Cessac, Bruno; Delord, Bruno; Quoy, Mathias

2008-12-01

We present a mathematical analysis of the effects of Hebbian learning in random recurrent neural networks, with a generic Hebbian learning rule, including passive forgetting and different timescales, for neuronal activity and learning dynamics. Previous numerical work has reported that Hebbian learning drives the system from chaos to a steady state through a sequence of bifurcations. Here, we interpret these results mathematically and show that these effects, involving a complex coupling between neuronal dynamics and synaptic graph structure, can be analyzed using Jacobian matrices, which introduce both a structural and a dynamical point of view on neural network evolution. Furthermore, we show that sensitivity to a learned pattern is maximal when the largest Lyapunov exponent is close to 0. We discuss how neural networks may take advantage of this regime of high functional interest.

Statistical analysis of effective singular values in matrix rank determination

NASA Technical Reports Server (NTRS)

Konstantinides, Konstantinos; Yao, Kung

1988-01-01

A major problem in using SVD (singular-value decomposition) as a tool in determining the effective rank of a perturbed matrix is that of distinguishing between significantly small and significantly large singular values to the end, conference regions are derived for the perturbed singular values of matrices with noisy observation data. The analysis is based on the theories of perturbations of singular values and statistical significance test. Threshold bounds for perturbation due to finite-precision and i.i.d. random models are evaluated. In random models, the threshold bounds depend on the dimension of the matrix, the noisy variance, and predefined statistical level of significance. Results applied to the problem of determining the effective order of a linear autoregressive system from the approximate rank of a sample autocorrelation matrix are considered. Various numerical examples illustrating the usefulness of these bounds and comparisons to other previously known approaches are given.

Spectra of empirical autocorrelation matrices: A random-matrix-theory-inspired perspective

NASA Astrophysics Data System (ADS)

Jamali, Tayeb; Jafari, G. R.

2015-07-01

We construct an autocorrelation matrix of a time series and analyze it based on the random-matrix theory (RMT) approach. The autocorrelation matrix is capable of extracting information which is not easily accessible by the direct analysis of the autocorrelation function. In order to provide a precise conclusion based on the information extracted from the autocorrelation matrix, the results must be first evaluated. In other words they need to be compared with some sort of criterion to provide a basis for the most suitable and applicable conclusions. In the context of the present study, the criterion is selected to be the well-known fractional Gaussian noise (fGn). We illustrate the applicability of our method in the context of stock markets. For the former, despite the non-Gaussianity in returns of the stock markets, a remarkable agreement with the fGn is achieved.

Analysis on Vertical Scattering Signatures in Forestry with PolInSAR

NASA Astrophysics Data System (ADS)

Guo, Shenglong; Li, Yang; Zhang, Jingjing; Hong, Wen

2014-11-01

We apply accurate topographic phase to the Freeman-Durden decomposition for polarimetric SAR interferometry (PolInSAR) data. The cross correlation matrix obtained from PolInSAR observations can be decomposed into three scattering mechanisms matrices accounting for the odd-bounce, double-bounce and volume scattering. We estimate the phase based on the Random volume over Ground (RVoG) model, and as the initial input parameter of the numerical method which is used to solve the parameters of decomposition. In addition, the modified volume scattering model introduced by Y. Yamaguchi is applied to the PolInSAR target decomposition in forest areas rather than the pure random volume scattering as proposed by Freeman-Durden to make best fit to the actual measured data. This method can accurately retrieve the magnitude associated with each mechanism and their vertical location along the vertical dimension. We test the algorithms with L- and P- band simulated data.

Supporting Sustainable Food Consumption: Mental Contrasting with Implementation Intentions (MCII) Aligns Intentions and Behavior

PubMed Central

Loy, Laura S.; Wieber, Frank; Gollwitzer, Peter M.; Oettingen, Gabriele

2016-01-01

With growing awareness that sustainable consumption is important for quality of life on earth, many individuals intend to act more sustainably. In this regard, interest in reducing meat consumption is on the rise. However, people often do not translate intentions into actual behavior change. To address this intention-behavior gap, we tested the self-regulation strategy of mental contrasting with implementation intentions (MCII). Here, people identify and imagine a desired future and current obstacles standing in its way. They address the obstacles with if-then plans specifying when, where, and how to act differently. In a 5-week randomized controlled experimental study, we compared an information + MCII intervention with an information-only control intervention. As hypothesized, only MCII participants’ intention of reducing their meat consumption was predictive of their actual reduction, while no correspondence between intention and behavior change was found for control participants. Participants with a moderate to strong intention to reduce their meat consumption reduced it more in the MCII than in the control condition. Thus, MCII helped to narrow the intention-behavior gap and supported behavior change for those holding moderate and strong respective intentions. PMID:27199840

Nonlinear transport of soft droplets in pore networks

NASA Astrophysics Data System (ADS)

Vernerey, Franck; Benet Cerda, Eduard; Koo, Kanghyeon

A large number of biological and technological processes depend on the transport of soft colloidal particles through porous media; this includes the transport and separation of cells, viruses or drugs through tissues, membranes and microfluidic devices. In these systems, the interactions between soft particles, background fluid and the surrounding pore space yield complex, nonlinear behaviors such as non-Darcy flows, localization and jamming. We devise a computational strategy to investigate the transport of non-wetting and deformable water droplets in a microfluidic device made of a random distribution of cylindrical obstacles. We first derive scaling laws for the entry of the droplet in a single pore and discuss the role of surface tension, contact angle and size in this process. This information is then used to study the transport of multiple droplets in an obstacle network. We find that when the droplet size is close to the pore size, fluid flow and droplet trafficking strongly interact, leading to local redistributions in pressure fields, intermittent clogging and jamming. Importantly, it is found that the overall droplet and fluid transport display three different scaling regimes depending on the forcing pressure, and that these regimes can be related to droplet properties.

Flow of foams in two-dimensional disordered porous media

NASA Astrophysics Data System (ADS)

Dollet, Benjamin; Geraud, Baudouin; Jones, Sian A.; Meheust, Yves; Cantat, Isabelle; Institut de Physique de Rennes Team; Geosciences Rennes Team

2015-11-01

Liquid foams are a yield stress fluid with elastic properties. When a foam flow is confined by solid walls, viscous dissipation arises from the contact zones between soap films and walls, giving very peculiar friction laws. In particular, foams potentially invade narrow pores much more efficiently than Newtonian fluids, which is of great importance for enhanced oil recovery. To quantify this effect, we study experimentally flows of foam in a model two-dimensional porous medium, consisting of an assembly of circular obstacles placed randomly in a Hele-Shaw cell, and use image analysis to quantify foam flow at the local scale. We show that bubbles split as they flow through the porous medium, by a mechanism of film pinching during contact with an obstacle, yielding two daughter bubbles per split bubble. We quantify the evolution of the bubble size distribution as a function of the distance along the porous medium, the splitting probability as a function of bubble size, and the probability distribution function of the daughter bubbles. We propose an evolution equation to model this splitting phenomenon and compare it successfully to the experiments, showing how at long distance, the porous medium itself dictates the size distribution of the foam.

Random walks with long-range steps generated by functions of Laplacian matrices

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Michelitsch, T. M.; Collet, B. A.; Nowakowski, A. F.; Nicolleau, F. C. G. A.

2018-04-01

In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information in the Laplacian matrix, that describes the connections of a network, to a dynamic determined by functions of this matrix. The resulting processes are non-local allowing transitions of the random walker from one node to nodes beyond its nearest neighbors. We find that only two types of Laplacian functions are admissible with distinct behaviors for long-range steps in the infinite network limit: type (i) functions generate Brownian motions, type (ii) functions Lévy flights. For this asymptotic long-range step behavior only the lowest non-vanishing order of the Laplacian function is relevant, namely first order for type (i), and fractional order for type (ii) functions. In the first part, we discuss spectral properties of the Laplacian matrix and a series of relations that are maintained by a particular type of functions that allow to define random walks on any type of undirected connected networks. Once described general properties, we explore characteristics of random walk strategies that emerge from particular cases with functions defined in terms of exponentials, logarithms and powers of the Laplacian as well as relations of these dynamics with non-local strategies like Lévy flights and fractional transport. Finally, we analyze the global capacity of these random walk strategies to explore networks like lattices and trees and different types of random and complex networks.

The wasteland of random supergravities

NASA Astrophysics Data System (ADS)

Marsh, David; McAllister, Liam; Wrase, Timm

2012-03-01

We show that in a general {N} = {1} supergravity with N ≫ 1 scalar fields, an exponentially small fraction of the de Sitter critical points are metastable vacua. Taking the superpotential and Kähler potential to be random functions, we construct a random matrix model for the Hessian matrix, which is well-approximated by the sum of a Wigner matrix and two Wishart matrices. We compute the eigenvalue spectrum analytically from the free convolution of the constituent spectra and find that in typical configurations, a significant fraction of the eigenvalues are negative. Building on the Tracy-Widom law governing fluctuations of extreme eigenvalues, we determine the probability P of a large fluctuation in which all the eigenvalues become positive. Strong eigenvalue repulsion makes this extremely unlikely: we find P ∝ exp(- c N p ), with c, p being constants. For generic critical points we find p ≈ 1 .5, while for approximately-supersymmetric critical points, p ≈ 1 .3. Our results have significant implications for the counting of de Sitter vacua in string theory, but the number of vacua remains vast.

Finite plateau in spectral gap of polychromatic constrained random networks

NASA Astrophysics Data System (ADS)

Avetisov, V.; Gorsky, A.; Nechaev, S.; Valba, O.

2017-12-01

We consider critical behavior in the ensemble of polychromatic Erdős-Rényi networks and regular random graphs, where network vertices are painted in different colors. The links can be randomly removed and added to the network subject to the condition of the vertex degree conservation. In these constrained graphs we run the Metropolis procedure, which favors the connected unicolor triads of nodes. Changing the chemical potential, μ , of such triads, for some wide region of μ , we find the formation of a finite plateau in the number of intercolor links, which exactly matches the finite plateau in the network algebraic connectivity (the value of the first nonvanishing eigenvalue of the Laplacian matrix, λ2). We claim that at the plateau the spontaneously broken Z2 symmetry is restored by the mechanism of modes collectivization in clusters of different colors. The phenomena of a finite plateau formation holds also for polychromatic networks with M ≥2 colors. The behavior of polychromatic networks is analyzed via the spectral properties of their adjacency and Laplacian matrices.

Renormalized Energy Concentration in Random Matrices

NASA Astrophysics Data System (ADS)

Borodin, Alexei; Serfaty, Sylvia

2013-05-01

We define a "renormalized energy" as an explicit functional on arbitrary point configurations of constant average density in the plane and on the real line. The definition is inspired by ideas of Sandier and Serfaty (From the Ginzburg-Landau model to vortex lattice problems, 2012; 1D log-gases and the renormalized energy, 2013). Roughly speaking, it is obtained by subtracting two leading terms from the Coulomb potential on a growing number of charges. The functional is expected to be a good measure of disorder of a configuration of points. We give certain formulas for its expectation for general stationary random point processes. For the random matrix β-sine processes on the real line ( β = 1,2,4), and Ginibre point process and zeros of Gaussian analytic functions process in the plane, we compute the expectation explicitly. Moreover, we prove that for these processes the variance of the renormalized energy vanishes, which shows concentration near the expected value. We also prove that the β = 2 sine process minimizes the renormalized energy in the class of determinantal point processes with translation invariant correlation kernels.

Analysis of cross-correlations between financial markets after the 2008 crisis

NASA Astrophysics Data System (ADS)

Sensoy, A.; Yuksel, S.; Erturk, M.

2013-10-01

We analyze the cross-correlation matrix C of the index returns of the main financial markets after the 2008 crisis using methods of random matrix theory. We test the eigenvalues of C for universal properties of random matrices and find that the majority of the cross-correlation coefficients arise from randomness. We show that the eigenvector of the largest deviating eigenvalue of C represents a global market itself. We reveal that high volatility of financial markets is observed at the same times with high correlations between them which lowers the risk diversification potential even if one constructs a widely internationally diversified portfolio of stocks. We identify and compare the connection and cluster structure of markets before and after the crisis using minimal spanning and ultrametric hierarchical trees. We find that after the crisis, the co-movement degree of the markets increases. We also highlight the key financial markets of pre and post crisis using main centrality measures and analyze the changes. We repeat the study using rank correlation and compare the differences. Further implications are discussed.

Nonlocal torque operators in ab initio theory of the Gilbert damping in random ferromagnetic alloys

NASA Astrophysics Data System (ADS)

Turek, I.; Kudrnovský, J.; Drchal, V.

2015-12-01

We present an ab initio theory of the Gilbert damping in substitutionally disordered ferromagnetic alloys. The theory rests on introduced nonlocal torques which replace traditional local torque operators in the well-known torque-correlation formula and which can be formulated within the atomic-sphere approximation. The formalism is sketched in a simple tight-binding model and worked out in detail in the relativistic tight-binding linear muffin-tin orbital method and the coherent potential approximation (CPA). The resulting nonlocal torques are represented by nonrandom, non-site-diagonal, and spin-independent matrices, which simplifies the configuration averaging. The CPA-vertex corrections play a crucial role for the internal consistency of the theory and for its exact equivalence to other first-principles approaches based on the random local torques. This equivalence is also illustrated by the calculated Gilbert damping parameters for binary NiFe and FeCo random alloys, for pure iron with a model atomic-level disorder, and for stoichiometric FePt alloys with a varying degree of L 10 atomic long-range order.

Tracked robot controllers for climbing obstacles autonomously

NASA Astrophysics Data System (ADS)

Vincent, Isabelle

2009-05-01

Research in mobile robot navigation has demonstrated some success in navigating flat indoor environments while avoiding obstacles. However, the challenge of analyzing complex environments to climb obstacles autonomously has had very little success due to the complexity of the task. Unmanned ground vehicles currently exhibit simple autonomous behaviours compared to the human ability to move in the world. This paper presents the control algorithms designed for a tracked mobile robot to autonomously climb obstacles by varying its tracks configuration. Two control algorithms are proposed to solve the autonomous locomotion problem for climbing obstacles. First, a reactive controller evaluates the appropriate geometric configuration based on terrain and vehicle geometric considerations. Then, a reinforcement learning algorithm finds alternative solutions when the reactive controller gets stuck while climbing an obstacle. The methodology combines reactivity to learning. The controllers have been demonstrated in box and stair climbing simulations. The experiments illustrate the effectiveness of the proposed approach for crossing obstacles.

Use of job-exposure matrices to estimate occupational exposure to pesticides: A review.

PubMed

Carles, Camille; Bouvier, Ghislaine; Lebailly, Pierre; Baldi, Isabelle

2017-03-01

The health effects of pesticides have been extensively studied in epidemiology, mainly in agricultural populations. However, pesticide exposure assessment remains a key methodological issue for epidemiological studies. Besides self-reported information, expert assessment or metrology, job-exposure matrices still appear to be an interesting tool. We reviewed all existing matrices assessing occupational exposure to pesticides in epidemiological studies and described the exposure parameters they included. We identified two types of matrices, (i) generic ones that are generally used in case-control studies and document broad categories of pesticides in a large range of jobs, and (ii) specific matrices, developed for use in agricultural cohorts, that generally provide exposure metrics at the active ingredient level. The various applications of these matrices in epidemiological studies have proven that they are valuable tools to assess pesticide exposure. Specific matrices are particularly promising for use in agricultural cohorts. However, results obtained with matrices have rarely been compared with those obtained with other tools. In addition, the external validity of the given estimates has not been adequately discussed. Yet, matrices would help in reducing misclassification and in quantifying cumulated exposures, to improve knowledge about the chronic health effects of pesticides.

Stochastic local operations and classical communication (SLOCC) and local unitary operations (LU) classifications of n qubits via ranks and singular values of the spin-flipping matrices

NASA Astrophysics Data System (ADS)

Li, Dafa

2018-06-01

We construct ℓ -spin-flipping matrices from the coefficient matrices of pure states of n qubits and show that the ℓ -spin-flipping matrices are congruent and unitary congruent whenever two pure states of n qubits are SLOCC and LU equivalent, respectively. The congruence implies the invariance of ranks of the ℓ -spin-flipping matrices under SLOCC and then permits a reduction of SLOCC classification of n qubits to calculation of ranks of the ℓ -spin-flipping matrices. The unitary congruence implies the invariance of singular values of the ℓ -spin-flipping matrices under LU and then permits a reduction of LU classification of n qubits to calculation of singular values of the ℓ -spin-flipping matrices. Furthermore, we show that the invariance of singular values of the ℓ -spin-flipping matrices Ω 1^{(n)} implies the invariance of the concurrence for even n qubits and the invariance of the n-tangle for odd n qubits. Thus, the concurrence and the n-tangle can be used for LU classification and computing the concurrence and the n-tangle only performs additions and multiplications of coefficients of states.

Challenges in Learning to Speak Arabic

ERIC Educational Resources Information Center

Haron, Sueraya Che; Ahmed, Ismaiel Hassanien; Mamat, Arifin; Ahmad, Wan Rusli Wan; Rawash, Fouad Mahmoud M.

2016-01-01

This paper describes a study to investigate the challenges and obstacles to speaking Arabic faced by good and poor Malay speakers of Arabic. The study used individual and focus group interviews with 14 participants to elicit data. The findings revealed 2 types of obstacles, namely, internal and external obstacles. Internal obstacles refer to the…

Women's orgasm obstacles: A qualitative study.

PubMed

Nekoolaltak, Maryam; Keshavarz, Zohreh; Simbar, Masoumeh; Nazari, Ali Mohammad; Baghestani, Ahmad Reza

2017-08-01

Woman's orgasm plays a vital role in sexual compatibility and marital satisfaction. Orgasm in women is a learnable phenomenon that is influenced by several factors. The aim of this study is exploring obstacles to orgasm in Iranian married women. This qualitative study with directed content analysis approach was conducted in 2015-2016, on 20 Iranian married women who were individually interviewed at two medical clinics in Tehran, Iran. Orgasm obstacles were explored in one category, 4 subcategories, and 25 codes. The main category was "Multidimensionality of women's orgasm obstacles". Subcategories and some codes included: Physical obstacles (wife's or husband's boredom, vaginal infection, insufficient vaginal lubrication), psychological obstacles (lack of sexual knowledge, shame, lack of concentration on sex due to household and children problems), relational obstacles (husband's hurry, having a dispute and annoyance with spouse) and contextual obstacles (Irregular sleep hours, lack of privacy and inability to separate children's bedroom from their parents, lack of peace at home). For prevention or treatment of female orgasm disorders, attention to physical factors is not enough. Obtaining a comprehensive history about physical, psychological, relational and contextual dimensions of woman's life is necessary.

Stochastic performance modeling and evaluation of obstacle detectability with imaging range sensors

NASA Technical Reports Server (NTRS)

Matthies, Larry; Grandjean, Pierrick

1993-01-01

Statistical modeling and evaluation of the performance of obstacle detection systems for Unmanned Ground Vehicles (UGVs) is essential for the design, evaluation, and comparison of sensor systems. In this report, we address this issue for imaging range sensors by dividing the evaluation problem into two levels: quality of the range data itself and quality of the obstacle detection algorithms applied to the range data. We review existing models of the quality of range data from stereo vision and AM-CW LADAR, then use these to derive a new model for the quality of a simple obstacle detection algorithm. This model predicts the probability of detecting obstacles and the probability of false alarms, as a function of the size and distance of the obstacle, the resolution of the sensor, and the level of noise in the range data. We evaluate these models experimentally using range data from stereo image pairs of a gravel road with known obstacles at several distances. The results show that the approach is a promising tool for predicting and evaluating the performance of obstacle detection with imaging range sensors.

Biologically-inspired adaptive obstacle negotiation behavior of hexapod robots

PubMed Central

Goldschmidt, Dennis; Wörgötter, Florentin; Manoonpong, Poramate

2014-01-01

Neurobiological studies have shown that insects are able to adapt leg movements and posture for obstacle negotiation in changing environments. Moreover, the distance to an obstacle where an insect begins to climb is found to be a major parameter for successful obstacle negotiation. Inspired by these findings, we present an adaptive neural control mechanism for obstacle negotiation behavior in hexapod robots. It combines locomotion control, backbone joint control, local leg reflexes, and neural learning. While the first three components generate locomotion including walking and climbing, the neural learning mechanism allows the robot to adapt its behavior for obstacle negotiation with respect to changing conditions, e.g., variable obstacle heights and different walking gaits. By successfully learning the association of an early, predictive signal (conditioned stimulus, CS) and a late, reflex signal (unconditioned stimulus, UCS), both provided by ultrasonic sensors at the front of the robot, the robot can autonomously find an appropriate distance from an obstacle to initiate climbing. The adaptive neural control was developed and tested first on a physical robot simulation, and was then successfully transferred to a real hexapod robot, called AMOS II. The results show that the robot can efficiently negotiate obstacles with a height up to 85% of the robot's leg length in simulation and 75% in a real environment. PMID:24523694

Matrix computations in MACSYMA

NASA Technical Reports Server (NTRS)

Wang, P. S.

1977-01-01

Facilities built into MACSYMA for manipulating matrices with numeric or symbolic entries are described. Computations will be done exactly, keeping symbols as symbols. Topics discussed include how to form a matrix and create other matrices by transforming existing matrices within MACSYMA; arithmetic and other computation with matrices; and user control of computational processes through the use of optional variables. Two algorithms designed for sparse matrices are given. The computing times of several different ways to compute the determinant of a matrix are compared.

Complex symmetric matrices with strongly stable iterates

NASA Technical Reports Server (NTRS)

Tadmor, E.

1985-01-01

Complex-valued symmetric matrices are studied. A simple expression for the spectral norm of such matrices is obtained, by utilizing a unitarily congruent invariant form. A sharp criterion is provided for identifying those symmetric matrices whose spectral norm is not exceeding one: such strongly stable matrices are usually sought in connection with convergent difference approximations to partial differential equations. As an example, the derived criterion is applied to conclude the strong stability of a Lax-Wendroff scheme.

The quality of visual information about the lower extremities influences visuomotor coordination during virtual obstacle negotiation.

PubMed

Kim, Aram; Kretch, Kari S; Zhou, Zixuan; Finley, James M

2018-05-09

Successful negotiation of obstacles during walking relies on the integration of visual information about the environment with ongoing locomotor commands. When information about the body and environment are removed through occlusion of the lower visual field, individuals increase downward head pitch angle, reduce foot placement precision, and increase safety margins during crossing. However, whether these effects are mediated by loss of visual information about the lower extremities, the obstacle, or both remains to be seen. Here, we used a fully immersive, virtual obstacle negotiation task to investigate how visual information about the lower extremities is integrated with information about the environment to facilitate skillful obstacle negotiation. Participants stepped over virtual obstacles while walking on a treadmill with one of three types of visual feedback about the lower extremities: no feedback, end-point feedback, or a link-segment model. We found that absence of visual information about the lower extremities led to an increase in the variability of leading foot placement after crossing. The presence of a visual representation of the lower extremities promoted greater downward head pitch angle during the approach to and subsequent crossing of an obstacle. In addition, having greater downward head pitch was associated with closer placement of the trailing foot to the obstacle, further placement of the leading foot after the obstacle, and higher trailing foot clearance. These results demonstrate that the fidelity of visual information about the lower extremities influences both feed-forward and feedback aspects of visuomotor coordination during obstacle negotiation.

Calculation of controllability and observability matrices for special case of continuous-time multi-order fractional systems.

PubMed

Hassanzadeh, Iman; Tabatabaei, Mohammad

2017-03-28

In this paper, controllability and observability matrices for pseudo upper or lower triangular multi-order fractional systems are derived. It is demonstrated that these systems are controllable and observable if and only if their controllability and observability matrices are full rank. In other words, the rank of these matrices should be equal to the inner dimension of their corresponding state space realizations. To reduce the computational complexities, these matrices are converted to simplified matrices with smaller dimensions. Numerical examples are provided to show the usefulness of the mentioned matrices for controllability and observability analysis of this case of multi-order fractional systems. These examples clarify that the duality concept is not necessarily true for these special systems. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Obstacle avoidance locomotor tasks: adaptation, memory and skill transfer.

PubMed

Kloter, Evelyne; Dietz, Volker

2012-05-01

The aim of this study was to explore the neural basis of adaptation, memory and skill transfer during human stepping over obstacles. Whilst walking on a treadmill, subjects had to perform uni- and bilateral obstacle steps. Acoustic feedback information about foot clearance was provided. Non-noxious electrical stimuli were applied to the right tibial nerve during the mid-stance phase of the right leg, i.e. 'prior' to the right or 'during' the left leg swing over the obstacle. The electromyogram (EMG) responses evoked by these stimuli in arm and leg muscles are known to reflect the neural coordination during normal and obstacle steps. The leading and trailing legs rapidly adapted foot clearance during obstacle steps with small further changes when the same obstacle condition was repeated. This adaptation was associated with a corresponding decrease in arm and leg muscle reflex EMG responses. Arm (but not leg) muscle EMG responses were greater when the stimulus was applied 'during' obstacle crossing by the left leg leading compared with stimulation 'prior' to right leg swing over the obstacle. A corresponding difference existed in arm muscle background EMG. The results indicate that, firstly, the somatosensory information gained by the performance and adaptation of uni- and bilateral obstacle stepping becomes transferred to the trailing leg in a context-specific manner. Secondly, EMG activity in arm and leg muscles parallels biomechanical adaptation of foot clearance. Thirdly, a consistently high EMG activity in the arm muscles during swing over the obstacle is required for equilibrium control. Thus, such a precision locomotor task is achieved by a context-specific, coordinated activation of arm and leg muscles for performance and equilibrium control that includes adaptation, memory and skill transfer. © 2012 The Authors. European Journal of Neuroscience © 2012 Federation of European Neuroscience Societies and Blackwell Publishing Ltd.

Sex and age-level differences of walking time in preschool children on an obstacle frame

PubMed Central

2012-01-01

Background Stepping over an obstacle is a kind of compound movement that makes walking more difficult, especially for preschool children. This study examines sex and age-level differences in walking time in preschool children on an obstacle frame. Methods The participants included 324 healthy preschool children: four-year-old boys (51) and girls (51), five-year-old boys (50) and girls (60), and six-year-old boys (62) and girls (50). A 5 cm- or 10 cm-high obstacle (depth 11.5 cm, width 23.5 cm) was set at the halfway point of a 200 cm × 10 cm walking course. Results The participants walked to the end of the course and back as fast as possible under three conditions: no obstacle, low obstacle and high obstacle. Walking time showed age-level differences in all conditions, but there were no differences in sex. Age levels were divided into two groups, with one group within the first six months of their birthday, and the second group within the last six months of that year. Walking time for children in the first half of their fourth year was longer than that of the five- and six-year-old children. In addition, for children in the last half of their fourth year, walking time was longer than both sexes in the last half of their fifth and sixth years. The children in the latter half of their fifth year had a longer walking time in the high obstacle condition than those in the last half of their sixth year. In the four-year-old participants, walking time was shorter with no obstacles than with a high obstacle frame. Conclusions In the above data, obstacle course walking time does not show a gender difference, except that the four-year-old participants needed longer than the five- and six-year-old children. Setting the obstacle 10 cm high also produced a different walking time in the five- and six-year-old participants. The high obstacle step test (10 cm) best evaluated the dynamic balance of preschool children. PMID:22738328

The flow across a street canyon of variable width—Part 2:. Scalar dispersion from a street level line source

NASA Astrophysics Data System (ADS)

Simoëns, Serge; Wallace, James M.

As described in Part 1 [Simoëns et al., 2007. The flow across a street canyon of variable width—Part 1: kinematic description. Atmospheric Environment 41, 9002-9017] measurements have been made of the velocity field around and within the canyon formed by two obstacles placed on the wall of a turbulent boundary layer. Here in Part 2 measurements of the scalar dispersion of smoke released from a two-dimensional slot in the wall perpendicular to the mean flow and located parallel to and midway between these two square obstacles are presented. The Reynolds number of the boundary layer at the slot location without the obstacles in place was Rθ≈980. Statistical properties of the concentration field and the scalar fluxes in the streamwise plane are reported here for canyon openings that have been chosen based on characteristics of the kinematic description. These opening widths, expressed as multiples of the obstacle height, are 1 h, 4 h and 8 h. The mean concentration field revealed that the much of the scalar is trapped on the leeward side of the upstream obstacle before some of it escapes the canyon and is entrained on the roof of the upstream obstacle. It then is spread downstream by the turbulence in the wake of this obstacle. Surprisingly, the root mean square (rms) concentration field reveals that high concentration fluctuations exist in a zone where velocity field turbulence is very low. Measured streamwise scalar fluxes were found to be negative above the obstacles, whereas they are mainly positive between the obstacles. The measured wall normal scalar fluxes have an inverse behavior. Within the canyon, the scalar fluxes are greatest in the region between the large primary vortex, evident in the kinematic field, and the secondary vortex located in the corner of the leeward side of the upstream obstacle. In the flow above the obstacle roofs the wake of the upstream obstacle seems to dominate the scalar transport. Between the obstacles in and above the canyon, the existence of intermittent and intense events appear to prevent the modelling of these fluxes with a simple mean concentration gradient model.

Anticipatory Postural Control of Stability during Gait Initiation Over Obstacles of Different Height and Distance Made Under Reaction-Time and Self-Initiated Instructions.

PubMed

Yiou, Eric; Artico, Romain; Teyssedre, Claudine A; Labaune, Ombeline; Fourcade, Paul

2016-01-01

Despite the abundant literature on obstacle crossing in humans, the question of how the central nervous system (CNS) controls postural stability during gait initiation with the goal to clear an obstacle remains unclear. Stabilizing features of gait initiation include anticipatory postural adjustments (APAs) and lateral swing foot placement. To answer the above question, 14 participants initiated gait as fast as possible in three conditions of obstacle height, three conditions of obstacle distance and one obstacle-free (control) condition. Each of these conditions was performed with two levels of temporal pressure: reaction-time (high-pressure) and self-initiated (low-pressure) movements. A mechanical model of the body falling laterally under the influence of gravity and submitted to an elastic restoring force is proposed to assess the effect of initial (foot-off) center-of-mass position and velocity (or "initial center-of-mass set") on the stability at foot-contact. Results showed that the anticipatory peak of mediolateral (ML) center-of-pressure shift, the initial ML center-of-mass velocity and the duration of the swing phase, of gait initiation increased with obstacle height, but not with obstacle distance. These results suggest that ML APAs are scaled with swing duration in order to maintain an equivalent stability across experimental conditions. This statement is strengthened by the results obtained with the mechanical model, which showed how stability would be degraded if there was no adaptation of the initial center-of-mass set to swing duration. The anteroposterior (AP) component of APAs varied also according to obstacle height and distance, but in an opposite way to the ML component. Indeed, results showed that the anticipatory peak of backward center-of-pressure shift and the initial forward center-of-mass set decreased with obstacle height, probably in order to limit the risk to trip over the obstacle, while the forward center-of-mass velocity at foot-off increased with obstacle distance, allowing a further step to be taken. These effects of obstacle height and distance were globally similar under low and high-temporal pressure. Collectively, these findings imply that the CNS is able to predict the potential instability elicited by the obstacle clearance and that it scales the spatiotemporal parameters of APAs accordingly.

Anticipatory Postural Control of Stability during Gait Initiation Over Obstacles of Different Height and Distance Made Under Reaction-Time and Self-Initiated Instructions

PubMed Central

Yiou, Eric; Artico, Romain; Teyssedre, Claudine A.; Labaune, Ombeline; Fourcade, Paul

2016-01-01

Despite the abundant literature on obstacle crossing in humans, the question of how the central nervous system (CNS) controls postural stability during gait initiation with the goal to clear an obstacle remains unclear. Stabilizing features of gait initiation include anticipatory postural adjustments (APAs) and lateral swing foot placement. To answer the above question, 14 participants initiated gait as fast as possible in three conditions of obstacle height, three conditions of obstacle distance and one obstacle-free (control) condition. Each of these conditions was performed with two levels of temporal pressure: reaction-time (high-pressure) and self-initiated (low-pressure) movements. A mechanical model of the body falling laterally under the influence of gravity and submitted to an elastic restoring force is proposed to assess the effect of initial (foot-off) center-of-mass position and velocity (or “initial center-of-mass set”) on the stability at foot-contact. Results showed that the anticipatory peak of mediolateral (ML) center-of-pressure shift, the initial ML center-of-mass velocity and the duration of the swing phase, of gait initiation increased with obstacle height, but not with obstacle distance. These results suggest that ML APAs are scaled with swing duration in order to maintain an equivalent stability across experimental conditions. This statement is strengthened by the results obtained with the mechanical model, which showed how stability would be degraded if there was no adaptation of the initial center-of-mass set to swing duration. The anteroposterior (AP) component of APAs varied also according to obstacle height and distance, but in an opposite way to the ML component. Indeed, results showed that the anticipatory peak of backward center-of-pressure shift and the initial forward center-of-mass set decreased with obstacle height, probably in order to limit the risk to trip over the obstacle, while the forward center-of-mass velocity at foot-off increased with obstacle distance, allowing a further step to be taken. These effects of obstacle height and distance were globally similar under low and high-temporal pressure. Collectively, these findings imply that the CNS is able to predict the potential instability elicited by the obstacle clearance and that it scales the spatiotemporal parameters of APAs accordingly. PMID:27656138

Restricted maximum likelihood estimation of genetic principal components and smoothed covariance matrices

PubMed Central

Meyer, Karin; Kirkpatrick, Mark

2005-01-01

Principal component analysis is a widely used 'dimension reduction' technique, albeit generally at a phenotypic level. It is shown that we can estimate genetic principal components directly through a simple reparameterisation of the usual linear, mixed model. This is applicable to any analysis fitting multiple, correlated genetic effects, whether effects for individual traits or sets of random regression coefficients to model trajectories. Depending on the magnitude of genetic correlation, a subset of the principal component generally suffices to capture the bulk of genetic variation. Corresponding estimates of genetic covariance matrices are more parsimonious, have reduced rank and are smoothed, with the number of parameters required to model the dispersion structure reduced from k(k + 1)/2 to m(2k - m + 1)/2 for k effects and m principal components. Estimation of these parameters, the largest eigenvalues and pertaining eigenvectors of the genetic covariance matrix, via restricted maximum likelihood using derivatives of the likelihood, is described. It is shown that reduced rank estimation can reduce computational requirements of multivariate analyses substantially. An application to the analysis of eight traits recorded via live ultrasound scanning of beef cattle is given. PMID:15588566

Filtered gradient reconstruction algorithm for compressive spectral imaging

NASA Astrophysics Data System (ADS)

Mejia, Yuri; Arguello, Henry

2017-04-01

Compressive sensing matrices are traditionally based on random Gaussian and Bernoulli entries. Nevertheless, they are subject to physical constraints, and their structure unusually follows a dense matrix distribution, such as the case of the matrix related to compressive spectral imaging (CSI). The CSI matrix represents the integration of coded and shifted versions of the spectral bands. A spectral image can be recovered from CSI measurements by using iterative algorithms for linear inverse problems that minimize an objective function including a quadratic error term combined with a sparsity regularization term. However, current algorithms are slow because they do not exploit the structure and sparse characteristics of the CSI matrices. A gradient-based CSI reconstruction algorithm, which introduces a filtering step in each iteration of a conventional CSI reconstruction algorithm that yields improved image quality, is proposed. Motivated by the structure of the CSI matrix, Φ, this algorithm modifies the iterative solution such that it is forced to converge to a filtered version of the residual ΦTy, where y is the compressive measurement vector. We show that the filtered-based algorithm converges to better quality performance results than the unfiltered version. Simulation results highlight the relative performance gain over the existing iterative algorithms.

Somatotype and intellectual ability (Raven Progressive Matrices Test) in Chilean school-age children.

PubMed

Tapia, Liliana U; Lizana, Pablo A; Orellana, Yasna Z; Villagrán, Francisca S; Arias, Vanessa F; Almagià, Atilio F; Burrows, Raquel A; Ivanovic, Daniza M

2013-01-01

The aim of this study was to determine the relationship between somatotype and intellectual ability (IA) in 11-12 and 15-16 year-old students (n = 1,015) in the Chile's Metropolitan Region from a representative sample of 33 educational establishments chosen at random. The Heath-Carter somatotype and the IA assessed through the Raven Progressive Matrices Test were measured. The endomorph was observed in 59% of the students; 28% had a mesomorph and 13% ectomorph. The IA was distributed in: 11.2% Grade I, 26.8% Grade II, 41% Grade III, 17.6% Grade IV and 3.2% Grade V. A positive and significant correlation of IA with the endomorphic component (r = 0.074, p = 0.02) was found in the total sample and only in females (r = 0.109, p = 0.02); at the same time, a positive and significant correlation with the ectomorph component was also observed (r = 0.067, p < 0.05). This suggests that other variables would influence more strongly the IA for which further research is needed to quantitate this multifactorial problem. Copyright © AULA MEDICA EDICIONES 2013. Published by AULA MEDICA. All rights reserved.

Rab-coupling protein coordinates recycling of alpha5beta1 integrin and EGFR1 to promote cell migration in 3D microenvironments.

PubMed

Caswell, Patrick T; Chan, May; Lindsay, Andrew J; McCaffrey, Mary W; Boettiger, David; Norman, Jim C

2008-10-06

Here we show that blocking the adhesive function of alphavbeta3 integrin with soluble RGD ligands, such as osteopontin or cilengitide, promoted association of Rab-coupling protein (RCP) with alpha5beta1 integrin and drove RCP-dependent recycling of alpha5beta1 to the plasma membrane and its mobilization to dynamic ruffling protrusions at the cell front. These RCP-driven changes in alpha5beta1 trafficking led to acquisition of rapid/random movement on two-dimensional substrates and to a marked increase in fibronectin-dependent migration of tumor cells into three-dimensional matrices. Recycling of alpha5beta1 integrin did not affect its regulation or ability to form adhesive bonds with substrate fibronectin. Instead, alpha5beta1 controlled the association of EGFR1 with RCP to promote the coordinate recycling of these two receptors. This modified signaling downstream of EGFR1 to increase its autophosphorylation and activation of the proinvasive kinase PKB/Akt. We conclude that RCP provides a scaffold that promotes the physical association and coordinate trafficking of alpha5beta1 and EGFR1 and that this drives migration of tumor cells into three-dimensional matrices.

The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising.

PubMed

Donoho, David L; Gavish, Matan; Montanari, Andrea

2013-05-21

Let X(0) be an unknown M by N matrix. In matrix recovery, one takes n < MN linear measurements y(1),…,y(n) of X(0), where y(i) = Tr(A(T)iX(0)) and each A(i) is an M by N matrix. A popular approach for matrix recovery is nuclear norm minimization (NNM): solving the convex optimization problem min ||X||*subject to y(i) =Tr(A(T)(i)X) for all 1 ≤ i ≤ n, where || · ||* denotes the nuclear norm, namely, the sum of singular values. Empirical work reveals a phase transition curve, stated in terms of the undersampling fraction δ(n,M,N) = n/(MN), rank fraction ρ=rank(X0)/min {M,N}, and aspect ratio β=M/N. Specifically when the measurement matrices Ai have independent standard Gaussian random entries, a curve δ*(ρ) = δ*(ρ;β) exists such that, if δ > δ*(ρ), NNM typically succeeds for large M,N, whereas if δ < δ*(ρ), it typically fails. An apparently quite different problem is matrix denoising in Gaussian noise, in which an unknown M by N matrix X(0) is to be estimated based on direct noisy measurements Y =X(0) + Z, where the matrix Z has independent and identically distributed Gaussian entries. A popular matrix denoising scheme solves the unconstrained optimization problem min|| Y-X||(2)(F)/2+λ||X||*. When optimally tuned, this scheme achieves the asymptotic minimax mean-squared error M(ρ;β) = lim(M,N → ∞)inf(λ)sup(rank(X) ≤ ρ · M)MSE(X,X(λ)), where M/N → . We report extensive experiments showing that the phase transition δ*(ρ) in the first problem, matrix recovery from Gaussian measurements, coincides with the minimax risk curve M(ρ)=M(ρ;β) in the second problem, matrix denoising in Gaussian noise: δ*(ρ)=M(ρ), for any rank fraction 0 < ρ < 1 (at each common aspect ratio β). Our experiments considered matrices belonging to two constraint classes: real M by N matrices, of various ranks and aspect ratios, and real symmetric positive-semidefinite N by N matrices, of various ranks.

76 FR 52239 - Standard Instrument Approach Procedures, and Takeoff Minimums and Obstacle Departure Procedures...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-22

... Minimums & Obstacle DP, Orig-A Red Oak, IA, Red Oak Muni, Takeoff Minimums & Obstacle DP, Amdt 3 Storm Lake, IA, Storm Lake Muni, Takeoff Minimums & Obstacle DP, Orig Dwight, IL, Dwight, Takeoff Minimums..., Florence Rgnl, RNAV (GPS) RWY 9, Orig-A Spearfish, SD, Black Hills-Clydes Ice Field, RNAV (GPS) RWY 13...

Student with Asperger's Overcomes Obstacles: Devon's Journey to Independence

ERIC Educational Resources Information Center

Williams, Sarah Blackwelder

2010-01-01

Devon is a bright, engaging 22-year-old with a proud sense of accomplishment. He believes that while people encounter obstacles during their lives, these obstacles can be overcome with motivation and perseverance. Devon says people simply need to identify what they value, set goals and move beyond the obstacles. Devon has been faced with multiple…

Inertial navigation sensor integrated obstacle detection system

NASA Technical Reports Server (NTRS)

Bhanu, Bir (Inventor); Roberts, Barry A. (Inventor)

1992-01-01

A system that incorporates inertial sensor information into optical flow computations to detect obstacles and to provide alternative navigational paths free from obstacles. The system is a maximally passive obstacle detection system that makes selective use of an active sensor. The active detection typically utilizes a laser. Passive sensor suite includes binocular stereo, motion stereo and variable fields-of-view. Optical flow computations involve extraction, derotation and matching of interest points from sequential frames of imagery, for range interpolation of the sensed scene, which in turn provides obstacle information for purposes of safe navigation.

A method of real-time detection for distant moving obstacles by monocular vision

NASA Astrophysics Data System (ADS)

Jia, Bao-zhi; Zhu, Ming

2013-12-01

In this paper, we propose an approach for detection of distant moving obstacles like cars and bicycles by a monocular camera to cooperate with ultrasonic sensors in low-cost condition. We are aiming at detecting distant obstacles that move toward our autonomous navigation car in order to give alarm and keep away from them. Method of frame differencing is applied to find obstacles after compensation of camera's ego-motion. Meanwhile, each obstacle is separated from others in an independent area and given a confidence level to indicate whether it is coming closer. The results on an open dataset and our own autonomous navigation car have proved that the method is effective for detection of distant moving obstacles in real-time.

Beyond the excised ensemble: modelling elliptic curve L-functions with random matrices

NASA Astrophysics Data System (ADS)

Cooper, I. A.; Morris, Patrick W.; Snaith, N. C.

2016-02-01

The ‘excised ensemble’, a random matrix model for the zeros of quadratic twist families of elliptic curve L-functions, was introduced by Dueñez et al (2012 J. Phys. A: Math. Theor. 45 115207) The excised model is motivated by a formula for central values of these L-functions in a paper by Kohnen and Zagier (1981 Invent. Math. 64 175-98). This formula indicates that for a finite set of L-functions from a family of quadratic twists, the central values are all either zero or are greater than some positive cutoff. The excised model imposes this same condition on the central values of characteristic polynomials of matrices from {SO}(2N). Strangely, the cutoff on the characteristic polynomials that results in a convincing model for the L-function zeros is significantly smaller than that which we would obtain by naively transferring Kohnen and Zagier’s cutoff to the {SO}(2N) ensemble. In this current paper we investigate a modification to the excised model. It lacks the simplicity of the original excised ensemble, but it serves to explain the reason for the unexpectedly low cutoff in the original excised model. Additionally, the distribution of central L-values is ‘choppier’ than the distribution of characteristic polynomials, in the sense that it is a superposition of a series of peaks: the characteristic polynomial distribution is a smooth approximation to this. The excised model did not attempt to incorporate these successive peaks, only the initial cutoff. Here we experiment with including some of the structure of the L-value distribution. The conclusion is that a critical feature of a good model is to associate the correct mass to the first peak of the L-value distribution.

Neutrino mass priors for cosmology from random matrices

DOE PAGES

Long, Andrew J.; Raveri, Marco; Hu, Wayne; ...

2018-02-13

Cosmological measurements of structure are placing increasingly strong constraints on the sum of the neutrino masses, Σm ν, through Bayesian inference. Because these constraints depend on the choice for the prior probability π(Σm ν), we argue that this prior should be motivated by fundamental physical principles rather than the ad hoc choices that are common in the literature. The first step in this direction is to specify the prior directly at the level of the neutrino mass matrix M ν, since this is the parameter appearing in the Lagrangian of the particle physics theory. Thus by specifying a probability distribution overmore » M ν, and by including the known squared mass splittings, we predict a theoretical probability distribution over Σm ν that we interpret as a Bayesian prior probability π(Σm ν). Assuming a basis-invariant probability distribution on M ν, also known as the anarchy hypothesis, we find that π(Σm ν) peaks close to the smallest Σm ν allowed by the measured mass splittings, roughly 0.06 eV (0.1 eV) for normal (inverted) ordering, due to the phenomenon of eigenvalue repulsion in random matrices. We consider three models for neutrino mass generation: Dirac, Majorana, and Majorana via the seesaw mechanism; differences in the predicted priors π(Σm ν) allow for the possibility of having indications about the physical origin of neutrino masses once sufficient experimental sensitivity is achieved. In conclusion, we present fitting functions for π(Σm ν), which provide a simple means for applying these priors to cosmological constraints on the neutrino masses or marginalizing over their impact on other cosmological parameters.« less

Neutrino mass priors for cosmology from random matrices

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

Long, Andrew J.; Raveri, Marco; Hu, Wayne

Cosmological measurements of structure are placing increasingly strong constraints on the sum of the neutrino masses, Σm ν, through Bayesian inference. Because these constraints depend on the choice for the prior probability π(Σm ν), we argue that this prior should be motivated by fundamental physical principles rather than the ad hoc choices that are common in the literature. The first step in this direction is to specify the prior directly at the level of the neutrino mass matrix M ν, since this is the parameter appearing in the Lagrangian of the particle physics theory. Thus by specifying a probability distribution overmore » M ν, and by including the known squared mass splittings, we predict a theoretical probability distribution over Σm ν that we interpret as a Bayesian prior probability π(Σm ν). Assuming a basis-invariant probability distribution on M ν, also known as the anarchy hypothesis, we find that π(Σm ν) peaks close to the smallest Σm ν allowed by the measured mass splittings, roughly 0.06 eV (0.1 eV) for normal (inverted) ordering, due to the phenomenon of eigenvalue repulsion in random matrices. We consider three models for neutrino mass generation: Dirac, Majorana, and Majorana via the seesaw mechanism; differences in the predicted priors π(Σm ν) allow for the possibility of having indications about the physical origin of neutrino masses once sufficient experimental sensitivity is achieved. In conclusion, we present fitting functions for π(Σm ν), which provide a simple means for applying these priors to cosmological constraints on the neutrino masses or marginalizing over their impact on other cosmological parameters.« less

Almost commuting self-adjoint matrices: The real and self-dual cases

NASA Astrophysics Data System (ADS)

Loring, Terry A.; Sørensen, Adam P. W.

2016-08-01

We show that a pair of almost commuting self-adjoint, symmetric matrices is close to a pair of commuting self-adjoint, symmetric matrices (in a uniform way). Moreover, we prove that the same holds with self-dual in place of symmetric and also for paths of self-adjoint matrices. Since a symmetric, self-adjoint matrix is real, we get a real version of Huaxin Lin’s famous theorem on almost commuting matrices. Similarly, the self-dual case gives a version for matrices over the quaternions. To prove these results, we develop a theory of semiprojectivity for real C*-algebras and also examine various definitions of low-rank for real C*-algebras.

Decision Matrices: Tools to Enhance Middle School Engineering Instruction

ERIC Educational Resources Information Center

Gonczi, Amanda L.; Bergman, Brenda G.; Huntoon, Jackie; Allen, Robin; McIntyre, Barb; Turner, Sheri; Davis, Jen; Handler, Rob

2017-01-01

Decision matrices are valuable engineering tools. They allow engineers to objectively examine solution options. Decision matrices can be incorporated in K-12 classrooms to support authentic engineering instruction. In this article we provide examples of how decision matrices have been incorporated into 6th and 7th grade classrooms as part of an…

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 19 Customs Duties 1 2011-04-01 2011-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 19 Customs Duties 1 2013-04-01 2013-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 19 Customs Duties 1 2014-04-01 2014-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 19 Customs Duties 1 2012-04-01 2012-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 19 Customs Duties 1 2010-04-01 2010-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

Dynamical Localization for Unitary Anderson Models

NASA Astrophysics Data System (ADS)

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

2009-11-01

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

Benford's law and continuous dependent random variables

NASA Astrophysics Data System (ADS)

Becker, Thealexa; Burt, David; Corcoran, Taylor C.; Greaves-Tunnell, Alec; Iafrate, Joseph R.; Jing, Joy; Miller, Steven J.; Porfilio, Jaclyn D.; Ronan, Ryan; Samranvedhya, Jirapat; Strauch, Frederick W.; Talbut, Blaine

2018-01-01

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11% of the time, as one would expect if all digits were equally likely, but rather 30%. This phenomenon is known as Benford's Law. Analyzing which datasets adhere to Benford's Law and how quickly Benford behavior sets in are the two most important problems in the field. Most previous work studied systems of independent random variables, and relied on the independence in their analyses. Inspired by natural processes such as particle decay, we study the dependent random variables that emerge from models of decomposition of conserved quantities. We prove that in many instances the distribution of lengths of the resulting pieces converges to Benford behavior as the number of divisions grow, and give several conjectures for other fragmentation processes. The main difficulty is that the resulting random variables are dependent. We handle this by using tools from Fourier analysis and irrationality exponents to obtain quantified convergence rates as well as introducing and developing techniques to measure and control the dependencies. The construction of these tools is one of the major motivations of this work, as our approach can be applied to many other dependent systems. As an example, we show that the n ! entries in the determinant expansions of n × n matrices with entries independently drawn from nice random variables converges to Benford's Law.

Crosslinked type II collagen matrices: preparation, characterization, and potential for cartilage engineering.

PubMed

Pieper, J S; van der Kraan, P M; Hafmans, T; Kamp, J; Buma, P; van Susante, J L C; van den Berg, W B; Veerkamp, J H; van Kuppevelt, T H

2002-08-01

The limited intrinsic repair capacity of articular cartilage has stimulated continuing efforts to develop tissue engineered analogues. Matrices composed of type II collagen and chondroitin sulfate (CS), the major constituents of hyaline cartilage, may create an appropriate environment for the generation of cartilage-like tissue. In this study, we prepared, characterized, and evaluated type 11 collagen matrices with and without CS. Type II collagen matrices were prepared using purified, pepsin-treated, type II collagen. Techniques applied to prepare type I collagen matrices were found unsuitable for type II collagen. Crosslinking of collagen and covalent attachment of CS was performed using 1-ethyl-3-(3-dimethyl aminopropyl)carbodiimide. Porous matrices were prepared by freezing and lyophilization, and their physico-chemical characteristics (degree of crosslinking, denaturing temperature, collagenase-resistance, amount of CS incorporated) established. Matrices were evaluated for their capacity to sustain chondrocyte proliferation and differentiation in vitro. After 7 d of culture, chondrocytes were mainly located at the periphery of the matrices. In contrast to type I collagen, type II collagen supported the distribution of cells throughout the matrix. After 14 d of culture, matrices were surfaced with a cartilagenous-like layer, and occasionally clusters of chondrocytes were present inside the matrix. Chondrocytes proliferated and differentiated as indicated by biochemical analyses, ultrastructural observations, and reverse transcriptase PCR for collagen types I, II and X. No major differences were observed with respect to the presence or absence of CS in the matrices.

Tolcapone-Enhanced Neurocognition in Healthy Adults: Neural Basis and Predictors.

PubMed

Bhakta, Savita G; Light, Gregory A; Talledo, Jo A; Balvaneda, Bryan; Hughes, Erica; Alvarez, Alexis; Rana, Brinda K; Young, Jared W; Swerdlow, Neal R

2017-12-01

Failure of procognitive drug trials in schizophrenia may reflect the clinical heterogeneity of schizophrenia, underscoring the need to identify biomarkers of treatment sensitivity. We used an experimental medicine design to test the procognitive effects of a putative procognitive agent, tolcapone, using an electroencephalogram-based cognitive control task in healthy subjects. Healthy men and women (n=27; ages 18-35 years), homozygous for either the Met/Met or Val/Val rs4680 genotype, received placebo and tolcapone 200 mg orally across 2 test days separated by 1 week in a double-blind, randomized, counterbalanced, within-subject design. On each test day, neurocognitive performance was assessed using the MATRICS Consensus Cognitive Battery and an electroencephalogram-based 5 Choice-Continuous Performance Test. Tolcapone enhanced visual learning in low-baseline MATRICS Consensus Cognitive Battery performers (d=0.35) and had an opposite effect in high performers (d=0.5), and enhanced verbal fluency across all subjects (P=.03) but had no effect on overall MATRICS Consensus Cognitive Battery performance. Tolcapone reduced false alarm rate (d=0.8) and enhanced frontal P200 amplitude during correctly identified nontarget trials (d=0.6) in low-baseline 5 Choice-Continuous Performance Test performers and had opposite effects in high performers (d=0.5 and d=0.25, respectively). Tolcapone's effect on frontal P200 amplitude and false alarm rate was correlated (rs=-0.4, P=.05). All neurocognitive effects of tolcapone were independent of rs4680 genotype. Tolcapone enhanced neurocognition and engaged electroencephalogram measures relevant to cognitive processes in specific subgroups of healthy individuals. These findings support an experimental medicine model for identifying procognitive treatments and provide a strong basis for future biomarker-informed procognitive studies in schizophrenia patients. © The Author 2017. Published by Oxford University Press on behalf of CINP.

Manipulating the fidelity of lower extremity visual feedback to identify obstacle negotiation strategies in immersive virtual reality.

PubMed

Kim, Aram; Zhou, Zixuan; Kretch, Kari S; Finley, James M

2017-07-01

The ability to successfully navigate obstacles in our environment requires integration of visual information about the environment with estimates of our body's state. Previous studies have used partial occlusion of the visual field to explore how information about the body and impending obstacles are integrated to mediate a successful clearance strategy. However, because these manipulations often remove information about both the body and obstacle, it remains to be seen how information about the lower extremities alone is utilized during obstacle crossing. Here, we used an immersive virtual reality (VR) interface to explore how visual feedback of the lower extremities influences obstacle crossing performance. Participants wore a head-mounted display while walking on treadmill and were instructed to step over obstacles in a virtual corridor in four different feedback trials. The trials involved: (1) No visual feedback of the lower extremities, (2) an endpoint-only model, (3) a link-segment model, and (4) a volumetric multi-segment model. We found that the volumetric model improved success rate, placed their trailing foot before crossing and leading foot after crossing more consistently, and placed their leading foot closer to the obstacle after crossing compared to no model. This knowledge is critical for the design of obstacle negotiation tasks in immersive virtual environments as it may provide information about the fidelity necessary to reproduce ecologically valid practice environments.

Dynamic clearance measure to evaluate locomotor and perceptuo-motor strategies used for obstacle circumvention in a virtual environment.

PubMed

Darekar, Anuja; Lamontagne, Anouk; Fung, Joyce

2015-04-01

Circumvention around an obstacle entails a dynamic interaction with the obstacle to maintain a safe clearance. We used a novel mathematical interpolation method based on the modified Shepard's method of Inverse Distance Weighting to compute dynamic clearance that reflected this interaction as well as minimal clearance. This proof-of-principle study included seven young healthy, four post-stroke and four healthy age-matched individuals. A virtual environment designed to assess obstacle circumvention was used to administer a locomotor (walking) and a perceptuo-motor (navigation with a joystick) task. In both tasks, participants were asked to navigate towards a target while avoiding collision with a moving obstacle that approached from either head-on, or 30° left or right. Among young individuals, dynamic clearance did not differ significantly between obstacle approach directions in both tasks. Post-stroke individuals maintained larger and smaller dynamic clearance during the locomotor and the perceptuo-motor task respectively as compared to age-matched controls. Dynamic clearance was larger than minimal distance from the obstacle irrespective of the group, task and obstacle approach direction. Also, in contrast to minimal distance, dynamic clearance can respond differently to different avoidance behaviors. Such a measure can be beneficial in contrasting obstacle avoidance behaviors in different populations with mobility problems. Copyright © 2015 Elsevier B.V. All rights reserved.

A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

PubMed

Guan, Xin; Wu, Huayang; Bi, Shujun

2011-01-01

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

Performance and three-dimensional kinematics of bipedal lizards during obstacle negotiation.

PubMed

Olberding, Jeffrey P; McBrayer, Lance D; Higham, Timothy E

2012-01-15

Bipedal running is common among lizard species, but although the kinematics and performance of this gait have been well characterized, the advantages in biologically relevant situations are still unclear. Obstacle negotiation is a task that is ecologically relevant to many animals while moving at high speeds, such as during bipedal running, yet little is known about how obstacles impact locomotion and performance. We examined the effects of obstacle negotiation on the kinematics and performance of lizards during bipedal locomotion. We quantified three-dimensional kinematics from high-speed video (500 Hz) of six-lined racerunners (Aspidoscelis sexlineata) running on a 3 m racetrack both with and without an obstacle spanning the width of the track. The lizards did not alter their kinematics prior to contacting the obstacle. Although contact with the obstacle caused changes to the hindlimb kinematics, mean forward speed did not differ between treatments. The deviation of the vertical position of the body center of mass did not differ between treatments, suggesting that in the absence of a cost to overall performance, lizards forgo maintaining normal kinematics while negotiating obstacles in favor of a steady body center of mass height to avoid destabilizing locomotion.

Learning robotic eye-arm-hand coordination from human demonstration: a coupled dynamical systems approach.

PubMed

Lukic, Luka; Santos-Victor, José; Billard, Aude

2014-04-01

We investigate the role of obstacle avoidance in visually guided reaching and grasping movements. We report on a human study in which subjects performed prehensile motion with obstacle avoidance where the position of the obstacle was systematically varied across trials. These experiments suggest that reaching with obstacle avoidance is organized in a sequential manner, where the obstacle acts as an intermediary target. Furthermore, we demonstrate that the notion of workspace travelled by the hand is embedded explicitly in a forward planning scheme, which is actively involved in detecting obstacles on the way when performing reaching. We find that the gaze proactively coordinates the pattern of eye-arm motion during obstacle avoidance. This study provides also a quantitative assessment of the coupling between the eye-arm-hand motion. We show that the coupling follows regular phase dependencies and is unaltered during obstacle avoidance. These observations provide a basis for the design of a computational model. Our controller extends the coupled dynamical systems framework and provides fast and synchronous control of the eyes, the arm and the hand within a single and compact framework, mimicking similar control system found in humans. We validate our model for visuomotor control of a humanoid robot.

Negative obstacle detection by thermal signature

NASA Technical Reports Server (NTRS)

Matthies, Larry; Rankin, A.

2003-01-01

Detecting negative obstacles (ditches, potholes, and other depressions) is one of the most difficult problems in perception for autonomous, off-road navigation. Past work has largely relied on range imagery, because that is based on the geometry of the obstacle, is largely insensitive to illumination variables, and because there have not been other reliable alternatives. However, the visible aspect of negative obstacles shrinks rapidly with range, making them impossible to detect in time to avoid them at high speed. To relive this problem, we show that the interiors of negative obstacles generally remain warmer than the surrounding terrain throughout the night, making thermal signature a stable property for night-time negative obstacle detection. Experimental results to date have achieved detection distances 45% greater by using thermal signature than by using range data alone. Thermal signature is the first known observable with potential to reveal a deep negative obstacle without actually seeing far into it. Modeling solar illumination has potential to extend the usefulness of thermal signature through daylight hours.

Method for surmounting an obstacle by a robot vehicle

NASA Technical Reports Server (NTRS)

Wilcox, Brian H. (Inventor); Ohm, Timothy R. (Inventor)

1994-01-01

Surmounting obstacles in the path of a robot vehicle is accomplished by rotating the wheel forks of the vehicle about their transverse axes with respect to the vehicle body so as to shift most of the vehicle weight onto the rear wheels, and then driving the vehicle forward so as to drive the now lightly-loaded front wheels (only) over the obstacle. Then, after the front wheels have either surmounted or completely passed the obstacle (depending upon the length of the obstacle), the forks are again rotated about their transverse axes so as to shift most of the vehicle weight onto the front wheels. Then the vehicle is again driven forward so as to drive the now lightly-loaded rear wheels over the obstacle. Once the obstacle has been completely cleared and the vehicle is again on relatively level terrain, the forks are again rotated so as to uniformly distribute the vehicle weight between the front and rear wheels.

The Effects of Shoe Traction and Obstacle Height on Lower Extremity Coordination Dynamics during Walking

PubMed Central

Decker, Leslie; Houser, Jeremy J.; Noble, John M.; Karst, Gregory M.; Stergiou, Nicholas

2009-01-01

This study aims to investigate the effects of shoe traction and obstacle height on lower extremity relative phase dynamics (analysis of intralimb coordination) during walking to better understand the mechanisms employed to avoid slippage following obstacle clearance. Ten participants walked at a self-selected pace during eight conditions: four obstacle heights (0%, 10%, 20%, and 40% of limb length) while wearing two pairs of shoes (low and high traction). A coordination analysis was used and phasing relationships between lower extremity segments were examined. The results demonstrated that significant behavioral changes were elicited under varied obstacle heights and frictional conditions. Both decreasing shoe traction and increasing obstacle height resulted in a more in-phase relationship between the interacting lower limb segments. The higher the obstacle and the lower the shoe traction, the more unstable the system became. These changes in phasing relationship and variability are indicators of alterations in coordinative behavior, which if pushed further may have lead to falling. PMID:19187929

Matrices. New Topics for Secondary School Mathematics: Materials and Software.

ERIC Educational Resources Information Center

North Carolina School of Science and Mathematics. Dept. of Mathematics and Computer Science.

This material on matrices is part of "Introduction to College Mathematics" (ICM), designed to prepare high school students who have students who have completed algebra II for the variety of mathematics they will encounter in college and beyond. The concept goals of this unit are to use matrices to model real-world phenomena, to use matrices as…

Generalized matrix summability of a conjugate derived Fourier series.

PubMed

Mursaleen, M; Alotaibi, Abdullah

2017-01-01

The study of infinite matrices is important in the theory of summability and in approximation. In particular, Toeplitz matrices or regular matrices and almost regular matrices have been very useful in this context. In this paper, we propose to use a more general matrix method to obtain necessary and sufficient conditions to sum the conjugate derived Fourier series.

Rhotrix Vector Spaces

ERIC Educational Resources Information Center

Aminu, Abdulhadi

2010-01-01

By rhotrix we understand an object that lies in some way between (n x n)-dimensional matrices and (2n - 1) x (2n - 1)-dimensional matrices. Representation of vectors in rhotrices is different from the representation of vectors in matrices. A number of vector spaces in matrices and their properties are known. On the other hand, little seems to be…

Local Random Quantum Circuits are Approximate Polynomial-Designs

NASA Astrophysics Data System (ADS)

Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał

2016-09-01

We prove that local random quantum circuits acting on n qubits composed of O( t 10 n 2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are ∞-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O( t 10 n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O( n k ) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O( n ( k-9)/11) that are given oracle access to U.

Commutative semigroups of real and complex matrices. [with use of the jordan form

NASA Technical Reports Server (NTRS)

Brown, D. R.

1974-01-01

The computation of divergence is studied. Covariance matrices to be analyzed admit a common diagonalization, or even triangulation. Sufficient conditions are given for such phenomena to take place, the arguments cover both real and complex matrices, and are not restricted to Hermotian or other special forms. Specifically, it is shown to be sufficient that the matrices in question commute in order to admit a common triangulation. Several results hold in the case that the matrices in question form a closed and bounded set, rather than only in the finite case.

Field matric potential sensor

DOEpatents

Hubbell, Joel M.; Sisson, James B.

2001-01-01

A method of determining matric potential of a sample, the method comprising placing the sample in a container, the container having an opening; and contacting the sample with a tensiometer via the opening. An apparatus for determining matric potential of a sample, the apparatus comprising a housing configured to receive a sample; a portable matric potential sensing device extending into the housing and having a porous member; and a wall closing the housing to insulate the sample and at least a portion of the matric potential sensing device including the porous member.

Imaging objects behind small obstacles using axicon lens

NASA Astrophysics Data System (ADS)

Perinchery, Sandeep M.; Shinde, Anant; Murukeshan, V. M.

2017-06-01

Axicon lenses are conical prisms, which are known to focus a light source to a line comprising of multiple points along the optical axis. In this study, we analyze the potential of axicon lenses to view, image and record the object behind opaque obstacles in free space. The advantage of an axicon lens over a regular lens is demonstrated experimentally. Parameters such as obstacle size, object and the obstacle position in the context of imaging behind obstacles are tested using Zemax optical simulation. This proposed concept can be easily adapted to most of the optical imaging methods and microscopy modalities.

Eye Movement Training and Suggested Gaze Strategies in Tunnel Vision - A Randomized and Controlled Pilot Study.

PubMed

Ivanov, Iliya V; Mackeben, Manfred; Vollmer, Annika; Martus, Peter; Nguyen, Nhung X; Trauzettel-Klosinski, Susanne

2016-01-01

Degenerative retinal diseases, especially retinitis pigmentosa (RP), lead to severe peripheral visual field loss (tunnel vision), which impairs mobility. The lack of peripheral information leads to fewer horizontal eye movements and, thus, diminished scanning in RP patients in a natural environment walking task. This randomized controlled study aimed to improve mobility and the dynamic visual field by applying a compensatory Exploratory Saccadic Training (EST). Oculomotor responses during walking and avoiding obstacles in a controlled environment were studied before and after saccade or reading training in 25 RP patients. Eye movements were recorded using a mobile infrared eye tracker (Tobii glasses) that measured a range of spatial and temporal variables. Patients were randomly assigned to two training conditions: Saccade (experimental) and reading (control) training. All subjects who first performed reading training underwent experimental training later (waiting list control group). To assess the effect of training on subjects, we measured performance in the training task and the following outcome variables related to daily life: Response Time (RT) during exploratory saccade training, Percent Preferred Walking Speed (PPWS), the number of collisions with obstacles, eye position variability, fixation duration, and the total number of fixations including the ones in the subjects' blind area of the visual field. In the saccade training group, RTs on average decreased, while the PPWS significantly increased. The improvement persisted, as tested 6 weeks after the end of the training. On average, the eye movement range of RP patients before and after training was similar to that of healthy observers. In both, the experimental and reading training groups, we found many fixations outside the subjects' seeing visual field before and after training. The average fixation duration was significantly shorter after the training, but only in the experimental training condition. We conclude that the exploratory saccade training was beneficial for RP patients and resulted in shorter fixation durations after the training. We also found a significant improvement in relative walking speed during navigation in a real-world like controlled environment.

Eye Movement Training and Suggested Gaze Strategies in Tunnel Vision - A Randomized and Controlled Pilot Study

PubMed Central

Ivanov, Iliya V.; Mackeben, Manfred; Vollmer, Annika; Martus, Peter; Nguyen, Nhung X.; Trauzettel-Klosinski, Susanne

2016-01-01

Purpose Degenerative retinal diseases, especially retinitis pigmentosa (RP), lead to severe peripheral visual field loss (tunnel vision), which impairs mobility. The lack of peripheral information leads to fewer horizontal eye movements and, thus, diminished scanning in RP patients in a natural environment walking task. This randomized controlled study aimed to improve mobility and the dynamic visual field by applying a compensatory Exploratory Saccadic Training (EST). Methods Oculomotor responses during walking and avoiding obstacles in a controlled environment were studied before and after saccade or reading training in 25 RP patients. Eye movements were recorded using a mobile infrared eye tracker (Tobii glasses) that measured a range of spatial and temporal variables. Patients were randomly assigned to two training conditions: Saccade (experimental) and reading (control) training. All subjects who first performed reading training underwent experimental training later (waiting list control group). To assess the effect of training on subjects, we measured performance in the training task and the following outcome variables related to daily life: Response Time (RT) during exploratory saccade training, Percent Preferred Walking Speed (PPWS), the number of collisions with obstacles, eye position variability, fixation duration, and the total number of fixations including the ones in the subjects' blind area of the visual field. Results In the saccade training group, RTs on average decreased, while the PPWS significantly increased. The improvement persisted, as tested 6 weeks after the end of the training. On average, the eye movement range of RP patients before and after training was similar to that of healthy observers. In both, the experimental and reading training groups, we found many fixations outside the subjects' seeing visual field before and after training. The average fixation duration was significantly shorter after the training, but only in the experimental training condition. Conclusions We conclude that the exploratory saccade training was beneficial for RP patients and resulted in shorter fixation durations after the training. We also found a significant improvement in relative walking speed during navigation in a real-world like controlled environment. PMID:27351629

Obstacle avoidance for redundant robots using configuration control

NASA Technical Reports Server (NTRS)

Seraji, Homayoun (Inventor); Colbaugh, Richard D. (Inventor); Glass, Kristin L. (Inventor)

1992-01-01

A redundant robot control scheme is provided for avoiding obstacles in a workspace during the motion of an end effector along a preselected trajectory by stopping motion of the critical point on the robot closest to the obstacle when the distance between is reduced to a predetermined sphere of influence surrounding the obstacle. Algorithms are provided for conveniently determining the critical point and critical distance.

Planar Gradient Diffusion System to Investigate Chemotaxis in a 3D Collagen Matrix.

PubMed

Stout, David A; Toyjanova, Jennet; Franck, Christian

2015-06-12

The importance of cell migration can be seen through the development of human life. When cells migrate, they generate forces and transfer these forces to their surrounding area, leading to cell movement and migration. In order to understand the mechanisms that can alter and/or affect cell migration, one can study these forces. In theory, understanding the fundamental mechanisms and forces underlying cell migration holds the promise of effective approaches for treating diseases and promoting cellular transplantation. Unfortunately, modern chemotaxis chambers that have been developed are usually restricted to two dimensions (2D) and have complex diffusion gradients that make the experiment difficult to interpret. To this end, we have developed, and describe in this paper, a direct-viewing chamber for chemotaxis studies, which allows one to overcome modern chemotaxis chamber obstacles able to measure cell forces and specific concentration within the chamber in a 3D environment to study cell 3D migration. More compelling, this approach allows one to successfully model diffusion through 3D collagen matrices and calculate the coefficient of diffusion of a chemoattractant through multiple different concentrations of collagen, while keeping the system simple and user friendly for traction force microscopy (TFM) and digital volume correlation (DVC) analysis.

People with stroke who fail an obstacle crossing task have a higher incidence of falls and utilize different gait patterns compared with people who pass the task.

PubMed

Said, Catherine M; Galea, Mary P; Lythgo, Noel

2013-03-01

Obstacle crossing is impaired in people following stroke. It is not known whether people with stroke who fail an obstacle crossing task have more falls or whether the gait adjustments used to cross an obstacle differ from those used by people who pass the task. The purposes of this study were (1) to identify whether a group of people with stroke who failed an obstacle crossing task had a greater incidence of falling and (2) to determine whether people who fail an obstacle crossing task utilize different gait adjustments. This was a prospective, observational study. Thirty-two participants with a recent stroke were recruited. Participants walked at self-selected speed and stepped over a 4-cm-high obstacle. Performance was rated as pass or fail, and spatiotemporal, center of mass (COM), and center of pressure (COP) data were collected. Prospective falls data were recorded for 20 participants over a 6-month period. The incidence of fallers was significantly higher (incidence rate=0.833) in the group that failed the obstacle crossing task than in the group that passed the task (incidence rate=0.143). The group that failed the task had a slower walking speed and greater normalized separation between the trail heel (unaffected support limb) and COM as the affected lead toe cleared the obstacle. This group exhibited greater normalized times from affected lead toe clearance to landing, unaffected trail toe clearance to landing, and affected trail toe-off to toe clearance. The sample size was small, and falls data were available for only 20 participants. Obstacle crossing is an important task to consider in people following stroke and may be useful in identifying those at risk of falls.

A bio-inspired kinematic controller for obstacle avoidance during reaching tasks with real robots.

PubMed

Srinivasa, Narayan; Bhattacharyya, Rajan; Sundareswara, Rashmi; Lee, Craig; Grossberg, Stephen

2012-11-01

This paper describes a redundant robot arm that is capable of learning to reach for targets in space in a self-organized fashion while avoiding obstacles. Self-generated movement commands that activate correlated visual, spatial and motor information are used to learn forward and inverse kinematic control models while moving in obstacle-free space using the Direction-to-Rotation Transform (DIRECT). Unlike prior DIRECT models, the learning process in this work was realized using an online Fuzzy ARTMAP learning algorithm. The DIRECT-based kinematic controller is fault tolerant and can handle a wide range of perturbations such as joint locking and the use of tools despite not having experienced them during learning. The DIRECT model was extended based on a novel reactive obstacle avoidance direction (DIRECT-ROAD) model to enable redundant robots to avoid obstacles in environments with simple obstacle configurations. However, certain configurations of obstacles in the environment prevented the robot from reaching the target with purely reactive obstacle avoidance. To address this complexity, a self-organized process of mental rehearsals of movements was modeled, inspired by human and animal experiments on reaching, to generate plans for movement execution using DIRECT-ROAD in complex environments. These mental rehearsals or plans are self-generated by using the Fuzzy ARTMAP algorithm to retrieve multiple solutions for reaching each target while accounting for all the obstacles in its environment. The key aspects of the proposed novel controller were illustrated first using simple examples. Experiments were then performed on real robot platforms to demonstrate successful obstacle avoidance during reaching tasks in real-world environments. Copyright © 2012 Elsevier Ltd. All rights reserved.

Mesoscopic model for filament orientation in growing actin networks: the role of obstacle geometry

NASA Astrophysics Data System (ADS)

Weichsel, Julian; Schwarz, Ulrich S.

2013-03-01

Propulsion by growing actin networks is a universal mechanism used in many different biological systems, ranging from the sheet-like lamellipodium of crawling animal cells to the actin comet tails induced by certain bacteria and viruses in order to move within their host cells. Although the core molecular machinery for actin network growth is well preserved in all of these cases, the geometry of the propelled obstacle varies considerably. During recent years, filament orientation distribution has emerged as an important observable characterizing the structure and dynamical state of the growing network. Here we derive several continuum equations for the orientation distribution of filaments growing behind stiff obstacles of various shapes and validate the predicted steady state orientation patterns by stochastic computer simulations based on discrete filaments. We use an ordinary differential equation approach to demonstrate that for flat obstacles of finite size, two fundamentally different orientation patterns peaked at either ±35° or +70°/0°/ - 70° exhibit mutually exclusive stability, in agreement with earlier results for flat obstacles of very large lateral extension. We calculate and validate phase diagrams as a function of model parameters and show how this approach can be extended to obstacles with piecewise straight contours. For curved obstacles, we arrive at a partial differential equation in the continuum limit, which again is in good agreement with the computer simulations. In all cases, we can identify the same two fundamentally different orientation patterns, but only within an appropriate reference frame, which is adjusted to the local orientation of the obstacle contour. Our results suggest that two fundamentally different network architectures compete with each other in growing actin networks, irrespective of obstacle geometry, and clarify how simulated and electron tomography data have to be analyzed for non-flat obstacle geometries.

Obstacle Detection and Avoidance System Based on Monocular Camera and Size Expansion Algorithm for UAVs

PubMed Central

Al-Kaff, Abdulla; García, Fernando; Martín, David; De La Escalera, Arturo; Armingol, José María

2017-01-01

One of the most challenging problems in the domain of autonomous aerial vehicles is the designing of a robust real-time obstacle detection and avoidance system. This problem is complex, especially for the micro and small aerial vehicles, that is due to the Size, Weight and Power (SWaP) constraints. Therefore, using lightweight sensors (i.e., Digital camera) can be the best choice comparing with other sensors; such as laser or radar.For real-time applications, different works are based on stereo cameras in order to obtain a 3D model of the obstacles, or to estimate their depth. Instead, in this paper, a method that mimics the human behavior of detecting the collision state of the approaching obstacles using monocular camera is proposed. The key of the proposed algorithm is to analyze the size changes of the detected feature points, combined with the expansion ratios of the convex hull constructed around the detected feature points from consecutive frames. During the Aerial Vehicle (UAV) motion, the detection algorithm estimates the changes in the size of the area of the approaching obstacles. First, the method detects the feature points of the obstacles, then extracts the obstacles that have the probability of getting close toward the UAV. Secondly, by comparing the area ratio of the obstacle and the position of the UAV, the method decides if the detected obstacle may cause a collision. Finally, by estimating the obstacle 2D position in the image and combining with the tracked waypoints, the UAV performs the avoidance maneuver. The proposed algorithm was evaluated by performing real indoor and outdoor flights, and the obtained results show the accuracy of the proposed algorithm compared with other related works. PMID:28481277

Effect of visuospatial neglect on spatial navigation and heading after stroke.

PubMed

Aravind, Gayatri; Lamontagne, Anouk

2017-06-09

Visuospatial neglect (VSN) impairs the control of locomotor heading in post-stroke individuals, which may affect their ability to safely avoid moving objects while walking. We aimed to compare VSN+ and VSN- stroke individuals in terms of changes in heading and head orientation in space while avoiding obstacles approaching from different directions and reorienting toward the final target. Stroke participants with VSN (VSN+) and without VSN (VSN-) walked in a virtual environment avoiding obstacles that approached contralesionally, head-on or ipsilesionally. Measures of obstacle avoidance (onset-of-heading change, maximum mediolateral deviation) and target alignment (heading and head-rotation errors with respect to target) were compared across groups and obstacle directions. In total, 26 participants with right-hemisphere stroke participated (13 VSN+ and 13 VSN-; 24 males; mean age 60.3 years, range 48 to 72 years). A larger proportion of VSN+ (75%) than VSN- (38%) participants collided with contralesional and head-on obstacles. For VSN- participants, deviating to the same side as the obstacle was a safe strategy to avoid diagonal obstacles and deviating to the opposite-side led to occasional collisions. VSN+ participants deviated ipsilesionally, displaying same-side and opposite-side strategies for ipsilesional and contralesional obstacles, respectively. Overall, VSN+ participants showed greater distances at onset-of-heading change, smaller maximum mediolateral deviation and larger errors in target alignment as compared with VSN- participants. The ipsilesional bias arising from VSN influences the modulation of heading in response to obstacles and, along with the adoption of the "riskier" strategies, contribute to the higher number colliders and poor goal-directed walking abilities in stroke survivors with VSN. Future research should focus on developing assessment and training tools for complex locomotor tasks such as obstacle avoidance in this population. Copyright © 2017 Elsevier Masson SAS. All rights reserved.

Accelerating confined premixed flames using a transverse slot jet

NASA Astrophysics Data System (ADS)

Richter, Joseph P.

2011-12-01

An experimental study of the transient interaction of a premixed laminar methane-air flame propagating into a transverse fluidic obstacle is considered. The de agration-to-detonation transition (DDT) mechanism for use in pulse detonation engines (PDE) is the main but not only motivation for this study. When DDT is initiated through the use of solid obstacles, the system incurs a drag penalty and subsequent total pressure losses due to the physical obstacle impeding on the flow. This study utilizes a fluidic obstacle to generate flame acceleration without the subsequent penalties associated with form drag of a solid obstacle. The experimental setup was designed specifically for non-intrusive optical measurement techniques such as schlieren, CH* chemiluminescence and digital particle image velocimetry (DPIV). The channel utilizes a length to width aspect ratio of L/W = 6, and was chosen along with the fuel (CH4) to guarantee the impossibility of excessive overpressures associated with unanticipated detonations. The mixture is ignited in the center of the closed end of the channel, and the flame propagates towards the obstacle located at 3.1H. The medium emitted from the slot-jet orifice is the same methane-air mixture used to fill the channel and is released post ignition to allow an interaction with the laminar propagating flame. A comparison of this transverse fluidic slot jet obstacle is made to four different solid obstacle geometries at various blockage ratios (BR) and at stoichiometric and lean (φ = 0:88) equivalence ratios. The results of this study show that a transverse slot jet is capable of increasing heat release, flame surface area and subsequently flame speed compared to that of any tested solid obstacle with similar maximum flame deflection over an obstacle.

The underexposed role of food matrices in probiotic products: Reviewing the relationship between carrier matrices and product parameters.

PubMed

Flach, Joost; van der Waal, Mark B; van den Nieuwboer, Maurits; Claassen, Eric; Larsen, Olaf F A

2017-06-13

Probiotic microorganisms are increasingly incorporated into food matrices in order to confer proposed health benefits on the consumer. It is important that the health benefits, sensory properties, shelf-life and probiotic gastrointestinal tract (GIT) survival of these products are carefully balanced as they determine functionality and drive consumer acceptance. The strain-specific effects of probiotic species are imperative in this process but carrier matrices may play a pivotal role as well. This study therefore recapitulates the wealth of knowledge on carrier matrices and their interaction with probiotic strains. The most substantiated carrier matrices, factors that influence probiotic functionality and matrix effects on shelf-life, GIT survival and clinical efficacy are reviewed. Results indicate that carrier matrices have a significant impact on the quality of probiotic products. Matrix components, such as proteins, carbohydrates and flavoring agents are shown to alter probiotic efficacy and viability. In vivo studies furthermore revealed strain-dependent matrix effects on the GIT survival of probiotic bacteria. However, only a limited number of studies have specifically addressed the effects of carrier matrices on the aforementioned product-parameters; most studies seem to focus solely on the strain-specific effects of probiotic microorganisms. This hampers the innovation of probiotic products. More human studies, comparing not only different probiotic strains but different carrier matrices as well, are needed to drive the innovation cycle.

Electrospun Zein/PCL Fibrous Matrices Release Tetracycline in a Controlled Manner, Killing Staphylococcus aureus Both in Biofilms and Ex Vivo on Pig Skin, and are Compatible with Human Skin Cells.

PubMed

Alhusein, Nour; Blagbrough, Ian S; Beeton, Michael L; Bolhuis, Albert; De Bank, Paul A

2016-01-01

To investigate the destruction of clinically-relevant bacteria within biofilms via the sustained release of the antibiotic tetracycline from zein-based electrospun polymeric fibrous matrices and to demonstrate the compatibility of such wound dressing matrices with human skin cells. Zein/PCL triple layered fibrous dressings with entrapped tetracycline were electrospun. The successful entrapment of tetracycline in these dressings was validated. The successful release of bioactive tetracycline, the destruction of preformed biofilms, and the viability of fibroblast (FEK4) cells were investigated. The sustained release of tetracycline from these matrices led to the efficient destruction of preformed biofilms from Staphylococcus aureus MRSA252 in vitro, and of MRSA252 and ATCC 25923 bacteria in an ex vivo pig skin model using 1 × 1 cm square matrices containing tetracycline (30 μg). Human FEK4 cells grew normally in the presence of these matrices. The ability of the zein-based matrices to destroy bacteria within increasingly complex in vitro biofilm models was clearly established. An ex vivo pig skin assay showed that these matrices, with entrapped tetracycline, efficiently kill bacteria and this, combined with their compatibility with a human skin cell line suggest these matrices are well suited for applications in wound healing and infection control.

Core-shell alginate-ghatti gum modified montmorillonite composite matrices for stomach-specific flurbiprofen delivery.

PubMed

Bera, Hriday; Ippagunta, Sohitha Reddy; Kumar, Sanoj; Vangala, Pavani

2017-07-01

Novel alginate-arabic gum (AG) gel membrane coated alginate-ghatti gum (GG) modified montmorillonite (MMT) composite matrices were developed for intragastric flurbiprofen (FLU) delivery by combining floating and mucoadhesion mechanisms. The clay-biopolymer composite matrices containing FLU as core were accomplished by ionic-gelation technique. Effects of polymer-blend (alginate:GG) ratios and crosslinker (CaCl 2 ) concentrations on drug entrapment efficiency (DEE, %) and cumulative drug release after 8h (Q 8h , %) were studied to optimize the core matrices by a 3 2 factorial design. The optimized matrices (F-O) demonstrated DEE of 91.69±1.43% and Q 8h of 74.96±1.56% with minimum errors in prediction. The alginate-AG gel membrane enveloped optimized matrices (F-O, coated) exhibited superior buoyancy, better ex vivo mucoadhesion and slower drug release rate. The drug release profile of FLU-loaded uncoated and coated optimized matrices was best fitted in Korsmeyer-Peppas model with anomalous diffusion and case-II transport driven mechanism, respectively. The uncoated and coated matrices containing FLU were also characterized for drug-excipients compatibility, drug crystallinity, thermal behaviour and surface morphology. Thus, the newly developed alginate-AG gel membrane coated alginate-GG modified MMT composite matrices are appropriate for intragastric delivery of FLU over an extended period of time with improved therapeutic benefits. Copyright © 2017 Elsevier B.V. All rights reserved.

Novel value-added uses for sweet potato juice and flour in polyphenol- and protein-enriched functional food ingredients.

PubMed

Grace, Mary H; Truong, An N; Truong, Van-Den; Raskin, Ilya; Lila, Mary Ann

2015-09-01

Blackcurrant, blueberry, and muscadine grape juices were efficiently sorbed, concentrated, and stabilized into dry granular ingredient matrices which combined anti-inflammatory and antioxidant fruit polyphenols with sweet potato functional constituents (carotenoids, vitamins, polyphenols, fibers). Total phenolics were highest in blackcurrant-orange sweet potato ingredient matrices (34.03 mg/g), and lowest in muscadine grape-yellow sweet potato matrices (10.56 mg/g). Similarly, anthocyanins were most concentrated in blackcurrant-fortified orange and yellow sweet potato matrices (5.40 and 6.54 mg/g, respectively). Alternatively, other protein-rich edible matrices (defatted soy flour, light roasted peanut flour, and rice protein concentrate) efficiently captured polyphenols (6.09-9.46 mg/g) and anthocyanins (0.77-1.27 mg/g) from purple-fleshed sweet potato juice, with comparable efficiency. Antioxidant activity correlated well with total phenolic content. All formulated ingredient matrices stabilized and preserved polyphenols for up to 24 weeks, even when stored at 37°C. Complexation with juice-derived polyphenols did not significantly alter protein or carbohydrate profiles of the matrices. Sensory evaluation of the ingredient matrices suggested potential uses for a wide range of functional food products.

Recognition of an obstacle in a flow using artificial neural networks.

PubMed

Carrillo, Mauricio; Que, Ulices; González, José A; López, Carlos

2017-08-01

In this work a series of artificial neural networks (ANNs) has been developed with the capacity to estimate the size and location of an obstacle obstructing the flow in a pipe. The ANNs learn the size and location of the obstacle by reading the profiles of the dynamic pressure q or the x component of the velocity v_{x} of the fluid at a certain distance from the obstacle. Data to train the ANN were generated using numerical simulations with a two-dimensional lattice Boltzmann code. We analyzed various cases varying both the diameter and the position of the obstacle on the y axis, obtaining good estimations using the R^{2} coefficient for the cases under study. Although the ANN showed problems with the classification of very small obstacles, the general results show a very good capacity for prediction.

Simulation of Molecular Transport in Systems Containing Mobile Obstacles.

PubMed

Polanowski, Piotr; Sikorski, Andrzej

2016-08-04

In this paper, we investigate the movement of molecules in crowded environments with obstacles undergoing Brownian motion by means of extensive Monte Carlo simulations. Our investigations were performed using the dynamic lattice liquid model, which was based on the cooperative movement concept and allowed to mimic systems at high densities where the motion of all elements (obstacles as well as moving particles) were highly correlated. The crowded environments are modeled on a two-dimensional triangular lattice containing obstacles (particles whose mobility was significantly reduced) moving by a Brownian motion. The subdiffusive motion of both elements in the system was analyzed. It was shown that the percolation transition does not exist in such systems in spite of the cooperative character of the particles' motion. The reduction of the obstacle mobility leads to the longer caging of liquid particles by mobile obstacles.

Collective strategy for obstacle navigation during cooperative transport by ants.

PubMed

McCreery, Helen F; Dix, Zachary A; Breed, Michael D; Nagpal, Radhika

2016-11-01

Group cohesion and consensus have primarily been studied in the context of discrete decisions, but some group tasks require making serial decisions that build on one another. We examine such collective problem solving by studying obstacle navigation during cooperative transport in ants. In cooperative transport, ants work together to move a large object back to their nest. We blocked cooperative transport groups of Paratrechina longicornis with obstacles of varying complexity, analyzing groups' trajectories to infer what kind of strategy the ants employed. Simple strategies require little information, but more challenging, robust strategies succeed with a wider range of obstacles. We found that transport groups use a stochastic strategy that leads to efficient navigation around simple obstacles, and still succeeds at difficult obstacles. While groups navigating obstacles preferentially move directly toward the nest, they change their behavior over time; the longer the ants are obstructed, the more likely they are to move away from the nest. This increases the chance of finding a path around the obstacle. Groups rapidly changed directions and rarely stalled during navigation, indicating that these ants maintain consensus even when the nest direction is blocked. Although some decisions were aided by the arrival of new ants, at many key points, direction changes were initiated within the group, with no apparent external cause. This ant species is highly effective at navigating complex environments, and implements a flexible strategy that works for both simple and more complex obstacles. © 2016. Published by The Company of Biologists Ltd.

Characterizations of matrix and operator-valued Φ-entropies, and operator Efron-Stein inequalities.

PubMed

Cheng, Hao-Chung; Hsieh, Min-Hsiu

2016-03-01

We derive new characterizations of the matrix Φ-entropy functionals introduced in Chen & Tropp (Chen, Tropp 2014 Electron. J. Prob. 19 , 1-30. (doi:10.1214/ejp.v19-2964)). These characterizations help us to better understand the properties of matrix Φ-entropies, and are a powerful tool for establishing matrix concentration inequalities for random matrices. Then, we propose an operator-valued generalization of matrix Φ-entropy functionals, and prove the subadditivity under Löwner partial ordering. Our results demonstrate that the subadditivity of operator-valued Φ-entropies is equivalent to the convexity. As an application, we derive the operator Efron-Stein inequality.

Covariances for the 56Fe radiation damage cross sections

NASA Astrophysics Data System (ADS)

Simakov, Stanislav P.; Koning, Arjan; Konobeyev, Alexander Yu.

2017-09-01

The energy-energy and reaction-reaction covariance matrices were calculated for the n + 56Fe damage cross-sections by Total Monte Carlo method using the TENDL-2013 random files. They were represented in the ENDF-6 format and added to the unperturbed evaluation file. The uncertainties for the spectrum averaged radiation quantities in the representative fission, fusion and spallation facilities were first time assessed as 5-25%. Additional 5 to 20% have to be added to the atom displacement rate uncertainties to account for accuracy of the primary defects simulation in materials. The reaction-reaction correlation were shown to be 1% or less.

Inference for High-dimensional Differential Correlation Matrices.

PubMed

Cai, T Tony; Zhang, Anru

2016-01-01

Motivated by differential co-expression analysis in genomics, we consider in this paper estimation and testing of high-dimensional differential correlation matrices. An adaptive thresholding procedure is introduced and theoretical guarantees are given. Minimax rate of convergence is established and the proposed estimator is shown to be adaptively rate-optimal over collections of paired correlation matrices with approximately sparse differences. Simulation results show that the procedure significantly outperforms two other natural methods that are based on separate estimation of the individual correlation matrices. The procedure is also illustrated through an analysis of a breast cancer dataset, which provides evidence at the gene co-expression level that several genes, of which a subset has been previously verified, are associated with the breast cancer. Hypothesis testing on the differential correlation matrices is also considered. A test, which is particularly well suited for testing against sparse alternatives, is introduced. In addition, other related problems, including estimation of a single sparse correlation matrix, estimation of the differential covariance matrices, and estimation of the differential cross-correlation matrices, are also discussed.

Prosthodontic maintenance of overdentures on zirconia implants: 1-year results of a randomized controlled trial.

PubMed

Osman, Reham B; Ma, Sunyoung

2014-01-01

The purpose of this study was to determine the prosthodontic outcomes of one-piece zirconia implants and their attachment systems in edentulous participants with maxillary and mandibular overdentures after 1 year of a randomized controlled trial. Random allocation of 24 edentulous participants (age range: 45 to 86 years) into titanium (control) or zirconia (test) groups using onepiece implants and a planned unsplinted prosthodontic design was performed. Four maxillary implants (one midpalatal; three anterior crestal) and three mandibular implants (one midsymphyseal; two bilateral distal) were conventionally loaded with the overdentures. Similar attachment systems were used throughout: ball abutment-type patrices (diameter: 2.25 to 3.1 mm as part of the one-piece implants) and custommade plastic matrices (with or without metal housings depending on the patrix size). Prosthodontic outcomes were documented during the first year of the clinical trial. Following three deaths and two dropouts, there were 19 participants who were available at the 1-year recall. Of these participants, 3 had early maxillary implant failure and had to be converted to conventional maxillary complete dentures opposing mandibular implant overdentures. There were 79 maintenance events, 34 in the titanium (control) group and 45 in the zirconia (test) group. Patrix loss occurred as a result of three zirconia implant fractures (one mandibular and two crestal maxillary implants). Maintenance events were principally the replacement of matrices and overdenture fracture. Although relines and replacement overdentures also occurred, overall there were no significant differences in prosthodontic maintenance between the control and test groups. A six-field prosthodontic-success analysis table showed no statistically significant difference between the two groups; however, 50% of participants in each group were allocated to the retreatment (repair) field, which produced a low prosthodontic success rate. Removable overdentures can be used on both one-piece titanium and zirconia implants with these attachment systems, due to no difference in prosthodontic maintenance and success. Before recommending routine use of a "metal-free" overdenture treatment option in clinical practice, consideration must be given to the success of the implants themselves.

An Approximate Approach to Automatic Kernel Selection.

PubMed

Ding, Lizhong; Liao, Shizhong

2016-02-02

Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.

Obstacle Avoidance for Quadcopter using Ultrasonic Sensor

NASA Astrophysics Data System (ADS)

Fazlur Rahman, Muhammad; Adhy Sasongko, Rianto

2018-04-01

An obstacle avoidance system is being proposed. The system will combine available flight controller with a proposed avoidance method as a proof of concept. Quadcopter as a UAV is integrated with the system which consist of several modes in order to do avoidance. As the previous study, obstacle will be determined using ultrasonic sensor and servo. As result, the quadcopter will move according to its mode and successfully avoid obstacle.

Detecting Negative Obstacles by Use of Radar

NASA Technical Reports Server (NTRS)

Mittskus, Anthony; Lux, James

2006-01-01

Robotic land vehicles would be equipped with small radar systems to detect negative obstacles, according to a proposal. The term "negative obstacles" denotes holes, ditches, and any other terrain features characterized by abrupt steep downslopes that could be hazardous for vehicles. Video cameras and other optically based obstacle-avoidance sensors now installed on some robotic vehicles cannot detect obstacles under adverse lighting conditions. Even under favorable lighting conditions, they cannot detect negative obstacles. A radar system according to the proposal would be of the frequency-modulation/ continuous-wave (FM/CW) type. It would be installed on a vehicle, facing forward, possibly with a downward slant of the main lobe(s) of the radar beam(s) (see figure). It would utilize one or more wavelength(s) of the order of centimeters. Because such wavelengths are comparable to the characteristic dimensions of terrain features associated with negative hazards, a significant amount of diffraction would occur at such features. In effect, the diffraction would afford a limited ability to see corners and to see around corners. Hence, the system might utilize diffraction to detect corners associated with negative obstacles. At the time of reporting the information for this article, preliminary analyses of diffraction at simple negative obstacles had been performed, but an explicit description of how the system would utilize diffraction was not available.

Impact of Performance Obstacles on Intensive Care Nurses‘ Workload, Perceived Quality and Safety of Care, and Quality of Working Life

PubMed Central

Gurses, Ayse P; Carayon, Pascale; Wall, Melanie

2009-01-01

Objectives To study the impact of performance obstacles on intensive care nurses‘ workload, quality and safety of care, and quality of working life (QWL). Performance obstacles are factors that hinder nurses‘ capacity to perform their job and that are closely associated with their immediate work system. Data Sources/Study Setting Data were collected from 265 nurses in 17 intensive care units (ICUs) between February and August 2004 via a structured questionnaire, yielding a response rate of 80 percent. Study Design A cross-sectional study design was used. Data were analyzed by correlation analyses and structural equation modeling. Principal Findings Performance obstacles were found to affect perceived quality and safety of care and QWL of ICU nurses. Workload mediated the impact of performance obstacles with the exception of equipment-related issues on perceived quality and safety of care as well as QWL. Conclusions Performance obstacles in ICUs are a major determinant of nursing workload, perceived quality and safety of care, and QWL. In general, performance obstacles increase nursing workload, which in turn negatively affect perceived quality and safety of care and QWL. Redesigning the ICU work system to reduce performance obstacles may improve nurses‘ work. PMID:19207589

Homology search with binary and trinary scoring matrices.

PubMed

Smith, Scott F

2006-01-01

Protein homology search can be accelerated with the use of bit-parallel algorithms in conjunction with constraints on the values contained in the scoring matrices. Trinary scoring matrices (containing only the values -1, 0, and 1) allow for significant acceleration without significant reduction in the receiver operating characteristic (ROC) score of a Smith-Waterman search. Binary scoring matrices (containing the values 0 and 1) result in some reduction in ROC score, but result in even more acceleration. Binary scoring matrices and five-bit saturating scores can be used for fast prefilters to the Smith-Waterman algorithm.

Methods for Quantum Circuit Design and Simulation

DTIC Science & Technology

2010-03-01

cannot be deter- mined given the one output. Reversible gates, expressed mathematically, are unitary matrices. 16 3.3.1 PAULI Gates/Matrices Three...common single-qubit gates are expressed mathematically as Pauli matrices, which are 2x2 matrices. A 2x2 quantum gate can be applied to a single quantum...bit (a 2x1 column vector). The Pauli matrices are expressed as follows: X =   0 1 1 0   Y =   0 −i i 0   Z =   1 0 0 −1   (3.10) where i

An automated procedure for calculating system matrices from perturbation data generated by an EAI Pacer and 100 hybrid computer system

NASA Technical Reports Server (NTRS)

Milner, E. J.; Krosel, S. M.

1977-01-01

Techniques are presented for determining the elements of the A, B, C, and D state variable matrices for systems simulated on an EAI Pacer 100 hybrid computer. An automated procedure systematically generates disturbance data necessary to linearize the simulation model and stores these data on a floppy disk. A separate digital program verifies this data, calculates the elements of the system matrices, and prints these matrices appropriately labeled. The partial derivatives forming the elements of the state variable matrices are approximated by finite difference calculations.

Obstacle detectors for automated transit vehicles: A technoeconomic and market analysis

NASA Technical Reports Server (NTRS)

Lockerby, C. E.

1979-01-01

A search was conducted to identify the technical and economic characteristics of both NASA and nonNASA obstacle detectors. The findings, along with market information were compiled and analyzed for consideration by DOT and NASA in decisions about any future automated transit vehicle obstacle detector research, development, or applications project. Currently available obstacle detectors and systems under development are identified by type (sonic, capacitance, infrared/optical, guided radar, and probe contact) and compared with the three NASA devices selected as possible improvements or solutions to the problems in existing obstacle detection systems. Cost analyses and market forecasts individually for the AGT and AMTV markets are included.

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

Stroemqvist, Martin H., E-mail: stromqv@kth.se

We study the problem of optimally controlling the solution of the obstacle problem in a domain perforated by small periodically distributed holes. The solution is controlled by the choice of a perforated obstacle which is to be chosen in such a fashion that the solution is close to a given profile and the obstacle is not too irregular. We prove existence, uniqueness and stability of an optimal obstacle and derive necessary and sufficient conditions for optimality. When the number of holes increase indefinitely we determine the limit of the sequence of optimal obstacles and solutions. This limit depends strongly onmore » the rate at which the size of the holes shrink.« less

Effect of form of obstacle on speed of crowd evacuation

NASA Astrophysics Data System (ADS)

Yano, Ryosuke

2018-03-01

This paper investigates the effect of the form of an obstacle on the time that a crowd takes to evacuate a room, using a toy model. Pedestrians are modeled as active soft matter moving toward a point with intended velocities. An obstacle is placed in front of the exit, and it has one of four shapes: a cylindrical column, a triangular prism, a quadratic prism, or a diamond prism. Numerical results indicate that the evacuation-completion time depends on the shape of the obstacle. Obstacles with a circular cylinder (C.C.) shape yield the shortest evacuation-completion time in the proposed model.

Research on robot mobile obstacle avoidance control based on visual information

NASA Astrophysics Data System (ADS)

Jin, Jiang

2018-03-01

Robots to detect obstacles and control robots to avoid obstacles has been a key research topic of robot control. In this paper, a scheme of visual information acquisition is proposed. By judging visual information, the visual information is transformed into the information source of path processing. In accordance with the established route, in the process of encountering obstacles, the algorithm real-time adjustment trajectory to meet the purpose of intelligent control of mobile robots. Simulation results show that, through the integration of visual sensing information, the obstacle information is fully obtained, while the real-time and accuracy of the robot movement control is guaranteed.

Generation of spiral waves pinned to obstacles in a simulated excitable system

NASA Astrophysics Data System (ADS)

Phantu, Metinee; Kumchaiseemak, Nakorn; Porjai, Porramain; Sutthiopad, Malee; Müller, Stefan C.; Luengviriya, Chaiya; Luengviriya, Jiraporn

2017-09-01

Pinning phenomena emerge in many dynamical systems. They are found to stabilize extreme conditions such as superconductivity and super fluidity. The dynamics of pinned spiral waves, whose tips trace the boundary of obstacles, also play an important role in the human health. In heart, such pinned waves cause longer tachycardia. In this article, we present two methods for generating pinned spiral waves in a simulated excitable system. In method A, an obstacle is set in the system prior to an ignition of a spiral wave. This method may be suitable only for the case of large obstacles since it often fails when used for small obstacles. In method B, a spiral wave is generated before an obstacle is placed at the spiral tip. With this method, a pinned spiral wave is always obtained, regardless the obstacle size. We demonstrate that after a transient interval the dynamics of the pinned spiral waves generated by the methods A and B are identical. The initiation of pinned spiral waves in both two- and three-dimensional systems is illustrated.

Cascading a systolic array and a feedforward neural network for navigation and obstacle avoidance using potential fields

NASA Technical Reports Server (NTRS)

Plumer, Edward S.

1991-01-01

A technique is developed for vehicle navigation and control in the presence of obstacles. A potential function was devised that peaks at the surface of obstacles and has its minimum at the proper vehicle destination. This function is computed using a systolic array and is guaranteed not to have local minima. A feedfoward neural network is then used to control the steering of the vehicle using local potential field information. In this case, the vehicle is a trailer truck backing up. Previous work has demonstrated the capability of a neural network to control steering of such a trailer truck backing to a loading platform, but without obstacles. Now, the neural network was able to learn to navigate a trailer truck around obstacles while backing toward its destination. The network is trained in an obstacle free space to follow the negative gradient of the field, after which the network is able to control and navigate the truck to its target destination in a space of obstacles which may be stationary or movable.

Laser development for optimal helicopter obstacle warning system LADAR performance

NASA Astrophysics Data System (ADS)

Yaniv, A.; Krupkin, V.; Abitbol, A.; Stern, J.; Lurie, E.; German, A.; Solomonovich, S.; Lubashitz, B.; Harel, Y.; Engart, S.; Shimoni, Y.; Hezy, S.; Biltz, S.; Kaminetsky, E.; Goldberg, A.; Chocron, J.; Zuntz, N.; Zajdman, A.

2005-04-01

Low lying obstacles present immediate danger to both military and civilian helicopters performing low-altitude flight missions. A LADAR obstacle detection system is the natural solution for enhancing helicopter safety and improving the pilot situation awareness. Elop is currently developing an advanced Surveillance and Warning Obstacle Ranging and Display (SWORD) system for the Israeli Air Force. Several key factors and new concepts have contributed to system optimization. These include an adaptive FOV, data memorization, autonomous obstacle detection and warning algorithms and the use of an agile laser transmitter. In the present work we describe the laser design and performance and discuss some of the experimental results. Our eye-safe laser is characterized by its pulse energy, repetition rate and pulse length agility. By dynamically controlling these parameters, we are able to locally optimize the system"s obstacle detection range and scan density in accordance with the helicopter instantaneous maneuver.

Influence of obstacles on bubbles rising in water-saturated sand

NASA Astrophysics Data System (ADS)

Poryles, Raphaël; Varas, Germán; Vidal, Valérie

2017-06-01

This work investigates the dynamics of air rising through a water-saturated sand confined in a Hele- Shaw cell in which a circular obstacle is trapped. The air is injected at constant flow rate through a single nozzle at the bottom center of the cell. Without obstacle, in a similar configuration, previous studies pointed out the existence of a fluidized zone generated by the central upward gas motion which entrains two granular convection rolls on its sides. Here, a circular obstacle which diameter is of the order of the central air channel width is trapped at the vertical of the injection nozzle. We analyze the influence of the obstacle location on the size of the fluidized zone and its impact on the morphology of the central air channel. Finally, we quantify the variations of the granular free surface. Two configurations with multiple obstacles are also considered.

Overcoming obstacles to behavior change in diabetes self-management.

PubMed

Hall, Rosemary F; Joseph, Dayle Hunt; Schwartz-Barcott, Donna

2003-01-01

This study describes how 5 individuals with type 2 diabetes overcame obstacles that interfered with maintaining behavior changes in diet, exercise, and self-monitoring of blood glucose (SMBG). In-depth interviews provided the framework for this descriptive study. During audiotaped, face-to-face, follow-up structured and unstructured interviews, the participants shared their experiences about obstacles encountered and strategies used to overcome them. Each case was examined independently, and all cases were then compared with each other. Obstacles that interfered with maintaining a diet plan were hunger, planned and unplanned meal events, and the desire for new foods. Physical illness and unexpected life events were obstacles to maintaining an exercise and SMBG plan. Health professionals who assist patients who are beginning behavior change or having difficult maintaining changes need to have an understanding of the various obstacles and how patients can maintain behavior changes over time.

Dynamics of spiral waves rotating around an obstacle and the existence of a minimal obstacle

NASA Astrophysics Data System (ADS)

Gao, Xiang; Feng, Xia; Li, Teng-Chao; Qu, Shixian; Wang, Xingang; Zhang, Hong

2017-05-01

Pinning of vortices by obstacles plays an important role in various systems. In the heart, anatomical reentry is created when a vortex, also known as the spiral wave, is pinned to an anatomical obstacle, leading to a class of physiologically very important arrhythmias. Previous analyses of its dynamics and instability provide fine estimates in some special circumstances, such as large obstacles or weak excitabilities. Here, to expand theoretical analyses to all circumstances, we propose a general theory whose results quantitatively agree with direct numerical simulations. In particular, when obstacles are small and pinned spiral waves are destabilized, an accurate explanation of the instability in two-dimensional media is provided by the usage of a mapping rule and dimension reduction. The implications of our results are to better understand the mechanism of arrhythmia and thus improve its early prevention.