On the use of finite difference matrix-vector products in Newton-Krylov solvers for implicit climate dynamics with spectral elements

DOE PAGES

Woodward, Carol S.; Gardner, David J.; Evans, Katherine J.

2015-01-01

Efficient solutions of global climate models require effectively handling disparate length and time scales. Implicit solution approaches allow time integration of the physical system with a step size governed by accuracy of the processes of interest rather than by stability of the fastest time scales present. Implicit approaches, however, require the solution of nonlinear systems within each time step. Usually, a Newton's method is applied to solve these systems. Each iteration of the Newton's method, in turn, requires the solution of a linear model of the nonlinear system. This model employs the Jacobian of the problem-defining nonlinear residual, but thismore » Jacobian can be costly to form. If a Krylov linear solver is used for the solution of the linear system, the action of the Jacobian matrix on a given vector is required. In the case of spectral element methods, the Jacobian is not calculated but only implemented through matrix-vector products. The matrix-vector multiply can also be approximated by a finite difference approximation which may introduce inaccuracy in the overall nonlinear solver. In this paper, we review the advantages and disadvantages of finite difference approximations of these matrix-vector products for climate dynamics within the spectral element shallow water dynamical core of the Community Atmosphere Model.« less

Elements of the quality management in the materials' industry

NASA Astrophysics Data System (ADS)

Ioana, Adrian; Semenescu, Augustin; Costoiu, Mihnea; Marcu, Dragoş

2017-12-01

The criteria function concept consists of transforming the criteria function (CF) in a quality-economical matrix math MQE. The levels of prescribing the criteria function was obtained by using a composition algorithm for three vectors: T¯ vector - technical parameters' vector (ti); Ē vector - economical parameters' vector (ej) and P¯ vector - weight vector (p1). For each product or service, the area of the circle represents the value of its sales. The BCG Matrix thus offers a very useful map of the organization's service strengths and weaknesses, at least in terms of current profitability, as well as the likely cash flows.

Finding a Hadamard matrix by simulated annealing of spin vectors

NASA Astrophysics Data System (ADS)

Bayu Suksmono, Andriyan

2017-05-01

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

An efficient parallel algorithm for matrix-vector multiplication

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

Hendrickson, B.; Leland, R.; Plimpton, S.

The multiplication of a vector by a matrix is the kernel computation of many algorithms in scientific computation. A fast parallel algorithm for this calculation is therefore necessary if one is to make full use of the new generation of parallel supercomputers. This paper presents a high performance, parallel matrix-vector multiplication algorithm that is particularly well suited to hypercube multiprocessors. For an n x n matrix on p processors, the communication cost of this algorithm is O(n/[radical]p + log(p)), independent of the matrix sparsity pattern. The performance of the algorithm is demonstrated by employing it as the kernel in themore » well-known NAS conjugate gradient benchmark, where a run time of 6.09 seconds was observed. This is the best published performance on this benchmark achieved to date using a massively parallel supercomputer.« less

Method and apparatus for second-rank tensor generation

NASA Technical Reports Server (NTRS)

Liu, Hua-Kuang (Inventor)

1991-01-01

A method and apparatus are disclosed for generation of second-rank tensors using a photorefractive crystal to perform the outer-product between two vectors via four-wave mixing, thereby taking 2n input data to a control n squared output data points. Two orthogonal amplitude modulated coherent vector beams x and y are expanded and then parallel sides of the photorefractive crystal in exact opposition. A beamsplitter is used to direct a coherent pumping beam onto the crystal at an appropriate angle so as to produce a conjugate beam that is the matrix product of the vector beam that propagates in the exact opposite direction from the pumping beam. The conjugate beam thus separated is the tensor output xy (sup T).

Using a multifrontal sparse solver in a high performance, finite element code

NASA Technical Reports Server (NTRS)

King, Scott D.; Lucas, Robert; Raefsky, Arthur

1990-01-01

We consider the performance of the finite element method on a vector supercomputer. The computationally intensive parts of the finite element method are typically the individual element forms and the solution of the global stiffness matrix both of which are vectorized in high performance codes. To further increase throughput, new algorithms are needed. We compare a multifrontal sparse solver to a traditional skyline solver in a finite element code on a vector supercomputer. The multifrontal solver uses the Multiple-Minimum Degree reordering heuristic to reduce the number of operations required to factor a sparse matrix and full matrix computational kernels (e.g., BLAS3) to enhance vector performance. The net result in an order-of-magnitude reduction in run time for a finite element application on one processor of a Cray X-MP.

Using monomer vibrational wavefunctions to compute numerically exact (12D) rovibrational levels of water dimer

NASA Astrophysics Data System (ADS)

Wang, Xiao-Gang; Carrington, Tucker

2018-02-01

We compute numerically exact rovibrational levels of water dimer, with 12 vibrational coordinates, on the accurate CCpol-8sf ab initio flexible monomer potential energy surface [C. Leforestier et al., J. Chem. Phys. 137, 014305 (2012)]. It does not have a sum-of-products or multimode form and therefore quadrature in some form must be used. To do the calculation, it is necessary to use an efficient basis set and to develop computational tools, for evaluating the matrix-vector products required to calculate the spectrum, that obviate the need to store the potential on a 12D quadrature grid. The basis functions we use are products of monomer vibrational wavefunctions and standard rigid-monomer basis functions (which involve products of three Wigner functions). Potential matrix-vector products are evaluated using the F matrix idea previously used to compute rovibrational levels of 5-atom and 6-atom molecules. When the coupling between inter- and intra-monomer coordinates is weak, this crude adiabatic type basis is efficient (only a few monomer vibrational wavefunctions are necessary), although the calculation of matrix elements is straightforward. It is much easier to use than an adiabatic basis. The product structure of the basis is compatible with the product structure of the kinetic energy operator and this facilitates computation of matrix-vector products. Compared with the results obtained using a [6 + 6]D adiabatic approach, we find good agreement for the inter-molecular levels and larger differences for the intra-molecular water bend levels.

Using monomer vibrational wavefunctions to compute numerically exact (12D) rovibrational levels of water dimer.

PubMed

Wang, Xiao-Gang; Carrington, Tucker

2018-02-21

We compute numerically exact rovibrational levels of water dimer, with 12 vibrational coordinates, on the accurate CCpol-8sf ab initio flexible monomer potential energy surface [C. Leforestier et al., J. Chem. Phys. 137, 014305 (2012)]. It does not have a sum-of-products or multimode form and therefore quadrature in some form must be used. To do the calculation, it is necessary to use an efficient basis set and to develop computational tools, for evaluating the matrix-vector products required to calculate the spectrum, that obviate the need to store the potential on a 12D quadrature grid. The basis functions we use are products of monomer vibrational wavefunctions and standard rigid-monomer basis functions (which involve products of three Wigner functions). Potential matrix-vector products are evaluated using the F matrix idea previously used to compute rovibrational levels of 5-atom and 6-atom molecules. When the coupling between inter- and intra-monomer coordinates is weak, this crude adiabatic type basis is efficient (only a few monomer vibrational wavefunctions are necessary), although the calculation of matrix elements is straightforward. It is much easier to use than an adiabatic basis. The product structure of the basis is compatible with the product structure of the kinetic energy operator and this facilitates computation of matrix-vector products. Compared with the results obtained using a [6 + 6]D adiabatic approach, we find good agreement for the inter-molecular levels and larger differences for the intra-molecular water bend levels.

Acceleration of GPU-based Krylov solvers via data transfer reduction

DOE PAGES

Anzt, Hartwig; Tomov, Stanimire; Luszczek, Piotr; ...

2015-04-08

Krylov subspace iterative solvers are often the method of choice when solving large sparse linear systems. At the same time, hardware accelerators such as graphics processing units continue to offer significant floating point performance gains for matrix and vector computations through easy-to-use libraries of computational kernels. However, as these libraries are usually composed of a well optimized but limited set of linear algebra operations, applications that use them often fail to reduce certain data communications, and hence fail to leverage the full potential of the accelerator. In this study, we target the acceleration of Krylov subspace iterative methods for graphicsmore » processing units, and in particular the Biconjugate Gradient Stabilized solver that significant improvement can be achieved by reformulating the method to reduce data-communications through application-specific kernels instead of using the generic BLAS kernels, e.g. as provided by NVIDIA’s cuBLAS library, and by designing a graphics processing unit specific sparse matrix-vector product kernel that is able to more efficiently use the graphics processing unit’s computing power. Furthermore, we derive a model estimating the performance improvement, and use experimental data to validate the expected runtime savings. Finally, considering that the derived implementation achieves significantly higher performance, we assert that similar optimizations addressing algorithm structure, as well as sparse matrix-vector, are crucial for the subsequent development of high-performance graphics processing units accelerated Krylov subspace iterative methods.« less

Parallel-vector unsymmetric Eigen-Solver on high performance computers

NASA Technical Reports Server (NTRS)

Nguyen, Duc T.; Jiangning, Qin

1993-01-01

The popular QR algorithm for solving all eigenvalues of an unsymmetric matrix is reviewed. Among the basic components in the QR algorithm, it was concluded from this study, that the reduction of an unsymmetric matrix to a Hessenberg form (before applying the QR algorithm itself) can be done effectively by exploiting the vector speed and multiple processors offered by modern high-performance computers. Numerical examples of several test cases have indicated that the proposed parallel-vector algorithm for converting a given unsymmetric matrix to a Hessenberg form offers computational advantages over the existing algorithm. The time saving obtained by the proposed methods is increased as the problem size increased.

Recognition and defect detection of dot-matrix text via variation-model based learning

NASA Astrophysics Data System (ADS)

Ohyama, Wataru; Suzuki, Koushi; Wakabayashi, Tetsushi

2017-03-01

An algorithm for recognition and defect detection of dot-matrix text printed on products is proposed. Extraction and recognition of dot-matrix text contains several difficulties, which are not involved in standard camera-based OCR, that the appearance of dot-matrix characters is corrupted and broken by illumination, complex texture in the background and other standard characters printed on product packages. We propose a dot-matrix text extraction and recognition method which does not require any user interaction. The method employs detected location of corner points and classification score. The result of evaluation experiment using 250 images shows that recall and precision of extraction are 78.60% and 76.03%, respectively. Recognition accuracy of correctly extracted characters is 94.43%. Detecting printing defect of dot-matrix text is also important in the production scene to avoid illegal productions. We also propose a detection method for printing defect of dot-matrix characters. The method constructs a feature vector of which elements are classification scores of each character class and employs support vector machine to classify four types of printing defect. The detection accuracy of the proposed method is 96.68 %.

Efficient Kriging via Fast Matrix-Vector Products

NASA Technical Reports Server (NTRS)

Memarsadeghi, Nargess; Raykar, Vikas C.; Duraiswami, Ramani; Mount, David M.

2008-01-01

Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrixvector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.

High precision computing with charge domain devices and a pseudo-spectral method therefor

NASA Technical Reports Server (NTRS)

Barhen, Jacob (Inventor); Toomarian, Nikzad (Inventor); Fijany, Amir (Inventor); Zak, Michail (Inventor)

1997-01-01

The present invention enhances the bit resolution of a CCD/CID MVM processor by storing each bit of each matrix element as a separate CCD charge packet. The bits of each input vector are separately multiplied by each bit of each matrix element in massive parallelism and the resulting products are combined appropriately to synthesize the correct product. In another aspect of the invention, such arrays are employed in a pseudo-spectral method of the invention, in which partial differential equations are solved by expressing each derivative analytically as matrices, and the state function is updated at each computation cycle by multiplying it by the matrices. The matrices are treated as synaptic arrays of a neural network and the state function vector elements are treated as neurons. In a further aspect of the invention, moving target detection is performed by driving the soliton equation with a vector of detector outputs. The neural architecture consists of two synaptic arrays corresponding to the two differential terms of the soliton-equation and an adder connected to the output thereof and to the output of the detector array to drive the soliton equation.

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

NASA Astrophysics Data System (ADS)

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

2016-11-01

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

Separable decompositions of bipartite mixed states

NASA Astrophysics Data System (ADS)

Li, Jun-Li; Qiao, Cong-Feng

2018-04-01

We present a practical scheme for the decomposition of a bipartite mixed state into a sum of direct products of local density matrices, using the technique developed in Li and Qiao (Sci. Rep. 8:1442, 2018). In the scheme, the correlation matrix which characterizes the bipartite entanglement is first decomposed into two matrices composed of the Bloch vectors of local states. Then, we show that the symmetries of Bloch vectors are consistent with that of the correlation matrix, and the magnitudes of the local Bloch vectors are lower bounded by the correlation matrix. Concrete examples for the separable decompositions of bipartite mixed states are presented for illustration.

Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication

ERIC Educational Resources Information Center

Wolf, Michael Maclean

2009-01-01

Combinatorial scientific computing plays an important enabling role in computational science, particularly in high performance scientific computing. In this thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two different problems in combinatorial scientific…

Constraints on anomalous Higgs boson couplings using production and decay information in the four-lepton final state

NASA Astrophysics Data System (ADS)

Sirunyan, A. M.; Tumasyan, A.; Adam, W.; Ambrogi, F.; Asilar, E.; Bergauer, T.; Brandstetter, J.; Brondolin, E.; Dragicevic, M.; Erö, J.; Flechl, M.; Friedl, M.; Frühwirth, R.; Ghete, V. M.; Grossmann, J.; Hrubec, J.; Jeitler, M.; König, A.; Krammer, N.; Krätschmer, I.; Liko, D.; Madlener, T.; Mikulec, I.; Pree, E.; Rabady, D.; Rad, N.; Rohringer, H.; Schieck, J.; Schöfbeck, R.; Spanring, M.; Spitzbart, D.; Waltenberger, W.; Wittmann, J.; Wulz, C.-E.; Zarucki, M.; Chekhovsky, V.; Mossolov, V.; Suarez Gonzalez, J.; De Wolf, E. A.; Di Croce, D.; Janssen, X.; Lauwers, J.; Van Haevermaet, H.; Van Mechelen, P.; Van Remortel, N.; Abu Zeid, S.; Blekman, F.; D'Hondt, J.; De Bruyn, I.; De Clercq, J.; Deroover, K.; Flouris, G.; Lontkovskyi, D.; Lowette, S.; Moortgat, S.; Moreels, L.; Python, Q.; Skovpen, K.; Tavernier, S.; Van Doninck, W.; Van Mulders, P.; Van Parijs, I.; Brun, H.; Clerbaux, B.; De Lentdecker, G.; Delannoy, H.; Fasanella, G.; Favart, L.; Goldouzian, R.; Grebenyuk, A.; Karapostoli, G.; Lenzi, T.; Luetic, J.; Maerschalk, T.; Marinov, A.; Randle-conde, A.; Vander Velde, C.; Vanlaer, P.; Vannerom, D.; Yonamine, R.; Zenoni, F.; Zhang, F.; Cimmino, A.; Cornelis, T.; Dobur, D.; Fagot, A.; Gul, M.; Khvastunov, I.; Poyraz, D.; Roskas, C.; Salva, S.; Tytgat, M.; Verbeke, W.; Zaganidis, N.; Bakhshiansohi, H.; Bondu, O.; Brochet, S.; Bruno, G.; Caputo, C.; Caudron, A.; De Visscher, S.; Delaere, C.; Delcourt, M.; Francois, B.; Giammanco, A.; Jafari, A.; Komm, M.; Krintiras, G.; Lemaitre, V.; Magitteri, A.; Mertens, A.; Musich, M.; Piotrzkowski, K.; Quertenmont, L.; Vidal Marono, M.; Wertz, S.; Beliy, N.; Aldá Júnior, W. L.; Alves, F. L.; Alves, G. A.; Brito, L.; Correa Martins Junior, M.; Hensel, C.; Moraes, A.; Pol, M. E.; Rebello Teles, P.; Belchior Batista Das Chagas, E.; Carvalho, W.; Chinellato, J.; Custódio, A.; Da Costa, E. M.; Da Silveira, G. G.; De Jesus Damiao, D.; Fonseca De Souza, S.; Huertas Guativa, L. M.; Malbouisson, H.; Melo De Almeida, M.; Mora Herrera, C.; Mundim, L.; Nogima, H.; Santoro, A.; Sznajder, A.; Tonelli Manganote, E. J.; Torres Da Silva De Araujo, F.; Vilela Pereira, A.; Ahuja, S.; Bernardes, C. A.; Fernandez Perez Tomei, T. R.; Gregores, E. M.; Mercadante, P. G.; Novaes, S. F.; Padula, Sandra S.; Romero Abad, D.; Ruiz Vargas, J. C.; Aleksandrov, A.; Hadjiiska, R.; Iaydjiev, P.; Misheva, M.; Rodozov, M.; Shopova, M.; Stoykova, S.; Sultanov, G.; Dimitrov, A.; Glushkov, I.; Litov, L.; Pavlov, B.; Petkov, P.; Fang, W.; Gao, X.; Ahmad, M.; Bian, J. G.; Chen, G. M.; Chen, H. S.; Chen, M.; Chen, Y.; Jiang, C. H.; Leggat, D.; Liao, H.; Liu, Z.; Romeo, F.; Shaheen, S. M.; Spiezia, A.; Tao, J.; Wang, C.; Wang, Z.; Yazgan, E.; Zhang, H.; Zhang, S.; Zhao, J.; Ban, Y.; Chen, G.; Li, Q.; Liu, S.; Mao, Y.; Qian, S. J.; Wang, D.; Xu, Z.; Avila, C.; Cabrera, A.; Chaparro Sierra, L. F.; Florez, C.; González Hernández, C. F.; Ruiz Alvarez, J. D.; Courbon, B.; Godinovic, N.; Lelas, D.; Puljak, I.; Ribeiro Cipriano, P. M.; Sculac, T.; Antunovic, Z.; Kovac, M.; Brigljevic, V.; Ferencek, D.; Kadija, K.; Mesic, B.; Starodumov, A.; Susa, T.; Ather, M. W.; Attikis, A.; Mavromanolakis, G.; Mousa, J.; Nicolaou, C.; Ptochos, F.; Razis, P. A.; Rykaczewski, H.; Finger, M.; Finger, M.; Carrera Jarrin, E.; Assran, Y.; Elgammal, S.; Mahrous, A.; Dewanjee, R. K.; Kadastik, M.; Perrini, L.; Raidal, M.; Tiko, A.; Veelken, C.; Eerola, P.; Pekkanen, J.; Voutilainen, M.; Härkönen, J.; Järvinen, T.; Karimäki, V.; Kinnunen, R.; Lampén, T.; Lassila-Perini, K.; Lehti, S.; Lindén, T.; Luukka, P.; Tuominen, E.; Tuominiemi, J.; Tuovinen, E.; Talvitie, J.; Tuuva, T.; Besancon, M.; Couderc, F.; Dejardin, M.; Denegri, D.; Faure, J. L.; Ferri, F.; Ganjour, S.; Ghosh, S.; Givernaud, A.; Gras, P.; Hamel de Monchenault, G.; Jarry, P.; Kucher, I.; Locci, E.; Machet, M.; Malcles, J.; Negro, G.; Rander, J.; Rosowsky, A.; Sahin, M. Ö.; Titov, M.; Abdulsalam, A.; Antropov, I.; Baffioni, S.; Beaudette, F.; Busson, P.; Cadamuro, L.; Charlot, C.; Granier de Cassagnac, R.; Jo, M.; Lisniak, S.; Lobanov, A.; Martin Blanco, J.; Nguyen, M.; Ochando, C.; Ortona, G.; Paganini, P.; Pigard, P.; Regnard, S.; Salerno, R.; Sauvan, J. B.; Sirois, Y.; Stahl Leiton, A. G.; Strebler, T.; Yilmaz, Y.; Zabi, A.; Zghiche, A.; Agram, J.-L.; Andrea, J.; Bloch, D.; Brom, J.-M.; Buttignol, M.; Chabert, E. C.; Chanon, N.; Collard, C.; Conte, E.; Coubez, X.; Fontaine, J.-C.; Gelé, D.; Goerlach, U.; Jansová, M.; Le Bihan, A.-C.; Tonon, N.; Van Hove, P.; Gadrat, S.; Beauceron, S.; Bernet, C.; Boudoul, G.; Chierici, R.; Contardo, D.; Depasse, P.; El Mamouni, H.; Fay, J.; Finco, L.; Gascon, S.; Gouzevitch, M.; Grenier, G.; Ille, B.; Lagarde, F.; Laktineh, I. B.; Lethuillier, M.; Mirabito, L.; Pequegnot, A. L.; Perries, S.; Popov, A.; Sordini, V.; Vander Donckt, M.; Viret, S.; Khvedelidze, A.; Tsamalaidze, Z.; Autermann, C.; Beranek, S.; Feld, L.; Kiesel, M. K.; Klein, K.; Lipinski, M.; Preuten, M.; Schomakers, C.; Schulz, J.; Verlage, T.; Albert, A.; Dietz-Laursonn, E.; Duchardt, D.; Endres, M.; Erdmann, M.; Erdweg, S.; Esch, T.; Fischer, R.; Güth, A.; Hamer, M.; Hebbeker, T.; Heidemann, C.; Hoepfner, K.; Knutzen, S.; Merschmeyer, M.; Meyer, A.; Millet, P.; Mukherjee, S.; Olschewski, M.; Padeken, K.; Pook, T.; Radziej, M.; Reithler, H.; Rieger, M.; Scheuch, F.; Teyssier, D.; Thüer, S.; Flügge, G.; Kargoll, B.; Kress, T.; Künsken, A.; Lingemann, J.; Müller, T.; Nehrkorn, A.; Nowack, A.; Pistone, C.; Pooth, O.; Stahl, A.; Aldaya Martin, M.; Arndt, T.; Asawatangtrakuldee, C.; Beernaert, K.; Behnke, O.; Behrens, U.; Bermúdez Martínez, A.; Bin Anuar, A. A.; Borras, K.; Botta, V.; Campbell, A.; Connor, P.; Contreras-Campana, C.; Costanza, F.; Diez Pardos, C.; Eckerlin, G.; Eckstein, D.; Eichhorn, T.; Eren, E.; Gallo, E.; Garay Garcia, J.; Geiser, A.; Gizhko, A.; Grados Luyando, J. M.; Grohsjean, A.; Gunnellini, P.; Guthoff, M.; Harb, A.; Hauk, J.; Hempel, M.; Jung, H.; Kalogeropoulos, A.; Kasemann, M.; Keaveney, J.; Kleinwort, C.; Korol, I.; Krücker, D.; Lange, W.; Lelek, A.; Lenz, T.; Leonard, J.; Lipka, K.; Lohmann, W.; Mankel, R.; Melzer-Pellmann, I.-A.; Meyer, A. B.; Mittag, G.; Mnich, J.; Mussgiller, A.; Ntomari, E.; Pitzl, D.; Raspereza, A.; Roland, B.; Savitskyi, M.; Saxena, P.; Shevchenko, R.; Spannagel, S.; Stefaniuk, N.; Van Onsem, G. P.; Walsh, R.; Wen, Y.; Wichmann, K.; Wissing, C.; Zenaiev, O.; Bein, S.; Blobel, V.; Centis Vignali, M.; Dreyer, T.; Garutti, E.; Gonzalez, D.; Haller, J.; Hinzmann, A.; Hoffmann, M.; Karavdina, A.; Klanner, R.; Kogler, R.; Kovalchuk, N.; Kurz, S.; Lapsien, T.; Marchesini, I.; Marconi, D.; Meyer, M.; Niedziela, M.; Nowatschin, D.; Pantaleo, F.; Peiffer, T.; Perieanu, A.; Scharf, C.; Schleper, P.; Schmidt, A.; Schumann, S.; Schwandt, J.; Sonneveld, J.; Stadie, H.; Steinbrück, G.; Stober, F. M.; Stöver, M.; Tholen, H.; Troendle, D.; Usai, E.; Vanelderen, L.; Vanhoefer, A.; Vormwald, B.; Akbiyik, M.; Barth, C.; Baur, S.; Butz, E.; Caspart, R.; Chwalek, T.; Colombo, F.; De Boer, W.; Dierlamm, A.; Freund, B.; Friese, R.; Giffels, M.; Gilbert, A.; Haitz, D.; Hartmann, F.; Heindl, S. M.; Husemann, U.; Kassel, F.; Kudella, S.; Mildner, H.; Mozer, M. U.; Müller, Th.; Plagge, M.; Quast, G.; Rabbertz, K.; Schröder, M.; Shvetsov, I.; Sieber, G.; Simonis, H. J.; Ulrich, R.; Wayand, S.; Weber, M.; Weiler, T.; Williamson, S.; Wöhrmann, C.; Wolf, R.; Anagnostou, G.; Daskalakis, G.; Geralis, T.; Giakoumopoulou, V. A.; Kyriakis, A.; Loukas, D.; Topsis-Giotis, I.; Karathanasis, G.; Kesisoglou, S.; Panagiotou, A.; Saoulidou, N.; Kousouris, K.; Evangelou, I.; Foudas, C.; Kokkas, P.; Mallios, S.; Manthos, N.; Papadopoulos, I.; Paradas, E.; Strologas, J.; Triantis, F. A.; Csanad, M.; Filipovic, N.; Pasztor, G.; Veres, G. I.; Bencze, G.; Hajdu, C.; Horvath, D.; Hunyadi, Á.; Sikler, F.; Veszpremi, V.; Zsigmond, A. J.; Beni, N.; Czellar, S.; Karancsi, J.; Makovec, A.; Molnar, J.; Szillasi, Z.; Bartók, M.; Raics, P.; Trocsanyi, Z. L.; Ujvari, B.; Choudhury, S.; Komaragiri, J. R.; Bahinipati, S.; Bhowmik, S.; Mal, P.; Mandal, K.; Nayak, A.; Sahoo, D. K.; Sahoo, N.; Swain, S. K.; Bansal, S.; Beri, S. B.; Bhatnagar, V.; Chawla, R.; Dhingra, N.; Kalsi, A. K.; Kaur, A.; Kaur, M.; Kumar, R.; Kumari, P.; Mehta, A.; Singh, J. B.; Walia, G.; Kumar, Ashok; Aashaq, Shah; Bhardwaj, A.; Chauhan, S.; Choudhary, B. C.; Garg, R. B.; Keshri, S.; Kumar, A.; Malhotra, S.; Naimuddin, M.; Ranjan, K.; Sharma, R.; Bhardwaj, R.; Bhattacharya, R.; Bhattacharya, S.; Bhawandeep, U.; Dey, S.; Dutt, S.; Dutta, S.; Ghosh, S.; Majumdar, N.; Modak, A.; Mondal, K.; Mukhopadhyay, S.; Nandan, S.; Purohit, A.; Roy, A.; Roy, D.; Roy Chowdhury, S.; Sarkar, S.; Sharan, M.; Thakur, S.; Behera, P. K.; Chudasama, R.; Dutta, D.; Jha, V.; Kumar, V.; Mohanty, A. K.; Netrakanti, P. K.; Pant, L. M.; Shukla, P.; Topkar, A.; Aziz, T.; Dugad, S.; Mahakud, B.; Mitra, S.; Mohanty, G. B.; Sur, N.; Sutar, B.; Banerjee, S.; Bhattacharya, S.; Chatterjee, S.; Das, P.; Guchait, M.; Jain, Sa.; Kumar, S.; Maity, M.; Majumder, G.; Mazumdar, K.; Sarkar, T.; Wickramage, N.; Chauhan, S.; Dube, S.; Hegde, V.; Kapoor, A.; Kothekar, K.; Pandey, S.; Rane, A.; Sharma, S.; Chenarani, S.; Eskandari Tadavani, E.; Etesami, S. M.; Khakzad, M.; Mohammadi Najafabadi, M.; Naseri, M.; Paktinat Mehdiabadi, S.; Rezaei Hosseinabadi, F.; Safarzadeh, B.; Zeinali, M.; Felcini, M.; Grunewald, M.; Abbrescia, M.; Calabria, C.; Colaleo, A.; Creanza, D.; Cristella, L.; De Filippis, N.; De Palma, M.; Errico, F.; Fiore, L.; Iaselli, G.; Lezki, S.; Maggi, G.; Maggi, M.; Miniello, G.; My, S.; Nuzzo, S.; Pompili, A.; Pugliese, G.; Radogna, R.; Ranieri, A.; Selvaggi, G.; Sharma, A.; Silvestris, L.; Venditti, R.; Verwilligen, P.; Abbiendi, G.; Battilana, C.; Bonacorsi, D.; Braibant-Giacomelli, S.; Campanini, R.; Capiluppi, P.; Castro, A.; Cavallo, F. R.; Chhibra, S. S.; Codispoti, G.; Cuffiani, M.; Dallavalle, G. M.; Fabbri, F.; Fanfani, A.; Fasanella, D.; Giacomelli, P.; Grandi, C.; Guiducci, L.; Marcellini, S.; Masetti, G.; Montanari, A.; Navarria, F. L.; Perrotta, A.; Rossi, A. M.; Rovelli, T.; Siroli, G. P.; Tosi, N.; Albergo, S.; Costa, S.; Di Mattia, A.; Giordano, F.; Potenza, R.; Tricomi, A.; Tuve, C.; Barbagli, G.; Chatterjee, K.; Ciulli, V.; Civinini, C.; D'Alessandro, R.; Focardi, E.; Lenzi, P.; Meschini, M.; Paoletti, S.; Russo, L.; Sguazzoni, G.; Strom, D.; Viliani, L.; Benussi, L.; Bianco, S.; Fabbri, F.; Piccolo, D.; Primavera, F.; Calvelli, V.; Ferro, F.; Robutti, E.; Tosi, S.; Benaglia, A.; Brianza, L.; Brivio, F.; Ciriolo, V.; Dinardo, M. E.; Fiorendi, S.; Gennai, S.; Ghezzi, A.; Govoni, P.; Malberti, M.; Malvezzi, S.; Manzoni, R. A.; Menasce, D.; Moroni, L.; Paganoni, M.; Pauwels, K.; Pedrini, D.; Pigazzini, S.; Ragazzi, S.; Tabarelli de Fatis, T.; Buontempo, S.; Cavallo, N.; Di Guida, S.; Fabozzi, F.; Fienga, F.; Iorio, A. O. M.; Khan, W. A.; Lista, L.; Meola, S.; Paolucci, P.; Sciacca, C.; Thyssen, F.; Azzi, P.; Bacchetta, N.; Benato, L.; Bisello, D.; Boletti, A.; Carlin, R.; Carvalho Antunes De Oliveira, A.; Checchia, P.; Dall'Osso, M.; De Castro Manzano, P.; Dorigo, T.; Gasparini, F.; Gasparini, U.; Gozzelino, A.; Lacaprara, S.; Lujan, P.; Margoni, M.; Meneguzzo, A. T.; Pozzobon, N.; Ronchese, P.; Rossin, R.; Simonetto, F.; Torassa, E.; Zanetti, M.; Zotto, P.; Zumerle, G.; Braghieri, A.; Magnani, A.; Montagna, P.; Ratti, S. P.; Re, V.; Ressegotti, M.; Riccardi, C.; Salvini, P.; Vai, I.; Vitulo, P.; Alunni Solestizi, L.; Biasini, M.; Bilei, G. M.; Cecchi, C.; Ciangottini, D.; Fanò, L.; Lariccia, P.; Leonardi, R.; Manoni, E.; Mantovani, G.; Mariani, V.; Menichelli, M.; Rossi, A.; Santocchia, A.; Spiga, D.; Androsov, K.; Azzurri, P.; Bagliesi, G.; Bernardini, J.; Boccali, T.; Borrello, L.; Castaldi, R.; Ciocci, M. A.; Dell'Orso, R.; Fedi, G.; Giannini, L.; Giassi, A.; Grippo, M. T.; Ligabue, F.; Lomtadze, T.; Manca, E.; Mandorli, G.; Martini, L.; Messineo, A.; Palla, F.; Rizzi, A.; Savoy-Navarro, A.; Spagnolo, P.; Tenchini, R.; Tonelli, G.; Venturi, A.; Verdini, P. G.; Barone, L.; Cavallari, F.; Cipriani, M.; Del Re, D.; Di Marco, E.; Diemoz, M.; Gelli, S.; Longo, E.; Margaroli, F.; Marzocchi, B.; Meridiani, P.; Organtini, G.; Paramatti, R.; Preiato, F.; Rahatlou, S.; Rovelli, C.; Santanastasio, F.; Amapane, N.; Arcidiacono, R.; Argiro, S.; Arneodo, M.; Bartosik, N.; Bellan, R.; Biino, C.; Cartiglia, N.; Cenna, F.; Costa, M.; Covarelli, R.; Degano, A.; Demaria, N.; Kiani, B.; Mariotti, C.; Maselli, S.; Migliore, E.; Monaco, V.; Monteil, E.; Monteno, M.; Obertino, M. M.; Pacher, L.; Pastrone, N.; Pelliccioni, M.; Pinna Angioni, G. L.; Ravera, F.; Romero, A.; Ruspa, M.; Sacchi, R.; Shchelina, K.; Sola, V.; Solano, A.; Staiano, A.; Traczyk, P.; Belforte, S.; Casarsa, M.; Cossutti, F.; Della Ricca, G.; Zanetti, A.; Kim, D. H.; Kim, G. N.; Kim, M. S.; Lee, J.; Lee, S.; Lee, S. W.; Moon, C. S.; Oh, Y. D.; Sekmen, S.; Son, D. C.; Yang, Y. C.; Lee, A.; Kim, H.; Moon, D. H.; Oh, G.; Brochero Cifuentes, J. A.; Goh, J.; Kim, T. J.; Cho, S.; Choi, S.; Go, Y.; Gyun, D.; Ha, S.; Hong, B.; Jo, Y.; Kim, Y.; Lee, K.; Lee, K. S.; Lee, S.; Lim, J.; Park, S. K.; Roh, Y.; Almond, J.; Kim, J.; Kim, J. S.; Lee, H.; Lee, K.; Nam, K.; Oh, S. B.; Radburn-Smith, B. C.; Seo, S. h.; Yang, U. K.; Yoo, H. D.; Yu, G. B.; Choi, M.; Kim, H.; Kim, J. H.; Lee, J. S. H.; Park, I. C.; Choi, Y.; Hwang, C.; Lee, J.; Yu, I.; Dudenas, V.; Juodagalvis, A.; Vaitkus, J.; Ahmed, I.; Ibrahim, Z. A.; Md Ali, M. A. B.; Mohamad Idris, F.; Wan Abdullah, W. A. T.; Yusli, M. N.; Zolkapli, Z.; Reyes-Almanza, R.; Ramirez-Sanchez, G.; Duran-Osuna, M. C.; Castilla-Valdez, H.; De La Cruz-Burelo, E.; Heredia-De La Cruz, I.; Rabadan-Trejo, R. I.; Lopez-Fernandez, R.; Mejia Guisao, J.; Sanchez-Hernandez, A.; Carrillo Moreno, S.; Oropeza Barrera, C.; Vazquez Valencia, F.; Pedraza, I.; Salazar Ibarguen, H. A.; Uribe Estrada, C.; Morelos Pineda, A.; Krofcheck, D.; Butler, P. H.; Ahmad, A.; Ahmad, M.; Hassan, Q.; Hoorani, H. R.; Saddique, A.; Shah, M. A.; Shoaib, M.; Waqas, M.; Bialkowska, H.; Bluj, M.; Boimska, B.; Frueboes, T.; Górski, M.; Kazana, M.; Nawrocki, K.; Szleper, M.; Zalewski, P.; Bunkowski, K.; Byszuk, A.; Doroba, K.; Kalinowski, A.; Konecki, M.; Krolikowski, J.; Misiura, M.; Olszewski, M.; Pyskir, A.; Walczak, M.; Bargassa, P.; Beirão Da Cruz E Silva, C.; Di Francesco, A.; Faccioli, P.; Galinhas, B.; Gallinaro, M.; Hollar, J.; Leonardo, N.; Lloret Iglesias, L.; Nemallapudi, M. V.; Seixas, J.; Strong, G.; Toldaiev, O.; Vadruccio, D.; Varela, J.; Afanasiev, S.; Bunin, P.; Gavrilenko, M.; Golutvin, I.; Gorbunov, I.; Kamenev, A.; Karjavin, V.; Lanev, A.; Malakhov, A.; Matveev, V.; Palichik, V.; Perelygin, V.; Shmatov, S.; Shulha, S.; Skatchkov, N.; Smirnov, V.; Voytishin, N.; Zarubin, A.; Ivanov, Y.; Kim, V.; Kuznetsova, E.; Levchenko, P.; Murzin, V.; Oreshkin, V.; Smirnov, I.; Sulimov, V.; Uvarov, L.; Vavilov, S.; Vorobyev, A.; Andreev, Yu.; Dermenev, A.; Gninenko, S.; Golubev, N.; Karneyeu, A.; Kirsanov, M.; Krasnikov, N.; Pashenkov, A.; Tlisov, D.; Toropin, A.; Epshteyn, V.; Gavrilov, V.; Lychkovskaya, N.; Popov, V.; Pozdnyakov, I.; Safronov, G.; Spiridonov, A.; Stepennov, A.; Toms, M.; Vlasov, E.; Zhokin, A.; Aushev, T.; Bylinkin, A.; Chadeeva, M.; Markin, O.; Parygin, P.; Philippov, D.; Polikarpov, S.; Rusinov, V.; Andreev, V.; Azarkin, M.; Dremin, I.; Kirakosyan, M.; Terkulov, A.; Baskakov, A.; Belyaev, A.; Boos, E.; Bunichev, V.; Dubinin, M.; Dudko, L.; Ershov, A.; Gribushin, A.; Klyukhin, V.; Kodolova, O.; Lokhtin, I.; Miagkov, I.; Obraztsov, S.; Petrushanko, S.; Savrin, V.; Blinov, V.; Skovpen, Y.; Shtol, D.; Azhgirey, I.; Bayshev, I.; Bitioukov, S.; Elumakhov, D.; Kachanov, V.; Kalinin, A.; Konstantinov, D.; Krychkine, V.; Petrov, V.; Ryutin, R.; Sobol, A.; Troshin, S.; Tyurin, N.; Uzunian, A.; Volkov, A.; Adzic, P.; Cirkovic, P.; Devetak, D.; Dordevic, M.; Milosevic, J.; Rekovic, V.; Alcaraz Maestre, J.; Barrio Luna, M.; Cerrada, M.; Colino, N.; De La Cruz, B.; Delgado Peris, A.; Escalante Del Valle, A.; Fernandez Bedoya, C.; Fernández Ramos, J. P.; Flix, J.; Fouz, M. C.; Garcia-Abia, P.; Gonzalez Lopez, O.; Goy Lopez, S.; Hernandez, J. M.; Josa, M. I.; Pérez-Calero Yzquierdo, A.; Puerta Pelayo, J.; Quintario Olmeda, A.; Redondo, I.; Romero, L.; Soares, M. S.; Álvarez Fernández, A.; de Trocóniz, J. F.; Missiroli, M.; Moran, D.; Cuevas, J.; Erice, C.; Fernandez Menendez, J.; Gonzalez Caballero, I.; González Fernández, J. R.; Palencia Cortezon, E.; Sanchez Cruz, S.; Suárez Andrés, I.; Vischia, P.; Vizan Garcia, J. M.; Cabrillo, I. J.; Calderon, A.; Chazin Quero, B.; Curras, E.; Duarte Campderros, J.; Fernandez, M.; Garcia-Ferrero, J.; Gomez, G.; Lopez Virto, A.; Marco, J.; Martinez Rivero, C.; Martinez Ruiz del Arbol, P.; Matorras, F.; Piedra Gomez, J.; Rodrigo, T.; Ruiz-Jimeno, A.; Scodellaro, L.; Trevisani, N.; Vila, I.; Vilar Cortabitarte, R.; Abbaneo, D.; Auffray, E.; Baillon, P.; Ball, A. H.; Barney, D.; Bianco, M.; Bloch, P.; Bocci, A.; Botta, C.; Camporesi, T.; Castello, R.; Cepeda, M.; Cerminara, G.; Chapon, E.; Chen, Y.; d'Enterria, D.; Dabrowski, A.; Daponte, V.; David, A.; De Gruttola, M.; De Roeck, A.; Dobson, M.; Dorney, B.; du Pree, T.; Dünser, M.; Dupont, N.; Elliott-Peisert, A.; Everaerts, P.; Fallavollita, F.; Franzoni, G.; Fulcher, J.; Funk, W.; Gigi, D.; Gill, K.; Glege, F.; Gulhan, D.; Harris, P.; Hegeman, J.; Innocente, V.; Janot, P.; Karacheban, O.; Kieseler, J.; Kirschenmann, H.; Knünz, V.; Kornmayer, A.; Kortelainen, M. J.; Lange, C.; Lecoq, P.; Lourenço, C.; Lucchini, M. T.; Malgeri, L.; Mannelli, M.; Martelli, A.; Meijers, F.; Merlin, J. A.; Mersi, S.; Meschi, E.; Milenovic, P.; Moortgat, F.; Mulders, M.; Neugebauer, H.; Orfanelli, S.; Orsini, L.; Pape, L.; Perez, E.; Peruzzi, M.; Petrilli, A.; Petrucciani, G.; Pfeiffer, A.; Pierini, M.; Racz, A.; Reis, T.; Rolandi, G.; Rovere, M.; Sakulin, H.; Schäfer, C.; Schwick, C.; Seidel, M.; Selvaggi, M.; Sharma, A.; Silva, P.; Sphicas, P.; Stakia, A.; Steggemann, J.; Stoye, M.; Tosi, M.; Treille, D.; Triossi, A.; Tsirou, A.; Veckalns, V.; Verweij, M.; Zeuner, W. D.; Bertl, W.; Caminada, L.; Deiters, K.; Erdmann, W.; Horisberger, R.; Ingram, Q.; Kaestli, H. C.; Kotlinski, D.; Langenegger, U.; Rohe, T.; Wiederkehr, S. A.; Bachmair, F.; Bäni, L.; Berger, P.; Bianchini, L.; Casal, B.; Dissertori, G.; Dittmar, M.; Donegà, M.; Grab, C.; Heidegger, C.; Hits, D.; Hoss, J.; Kasieczka, G.; Klijnsma, T.; Lustermann, W.; Mangano, B.; Marionneau, M.; Meinhard, M. T.; Meister, D.; Micheli, F.; Musella, P.; Nessi-Tedaldi, F.; Pandolfi, F.; Pata, J.; Pauss, F.; Perrin, G.; Perrozzi, L.; Quittnat, M.; Reichmann, M.; Schönenberger, M.; Shchutska, L.; Tavolaro, V. R.; Theofilatos, K.; Vesterbacka Olsson, M. L.; Wallny, R.; Zhu, D. H.; Aarrestad, T. K.; Amsler, C.; Canelli, M. F.; De Cosa, A.; Del Burgo, R.; Donato, S.; Galloni, C.; Hreus, T.; Kilminster, B.; Ngadiuba, J.; Pinna, D.; Rauco, G.; Robmann, P.; Salerno, D.; Seitz, C.; Takahashi, Y.; Zucchetta, A.; Candelise, V.; Doan, T. H.; Jain, Sh.; Khurana, R.; Kuo, C. M.; Lin, W.; Pozdnyakov, A.; Yu, S. S.; Kumar, Arun; Chang, P.; Chao, Y.; Chen, K. F.; Chen, P. H.; Fiori, F.; Hou, W.-S.; Hsiung, Y.; Liu, Y. F.; Lu, R.-S.; Paganis, E.; Psallidas, A.; Steen, A.; Tsai, J. f.; Asavapibhop, B.; Kovitanggoon, K.; Singh, G.; Srimanobhas, N.; Boran, F.; Cerci, S.; Damarseckin, S.; Demiroglu, Z. S.; Dozen, C.; Dumanoglu, I.; Girgis, S.; Gokbulut, G.; Guler, Y.; Hos, I.; Kangal, E. E.; Kara, O.; Kayis Topaksu, A.; Kiminsu, U.; Oglakci, M.; Onengut, G.; Ozdemir, K.; Sunar Cerci, D.; Tali, B.; Turkcapar, S.; Zorbakir, I. S.; Zorbilmez, C.; Bilin, B.; Karapinar, G.; Ocalan, K.; Yalvac, M.; Zeyrek, M.; Gülmez, E.; Kaya, M.; Kaya, O.; Tekten, S.; Yetkin, E. A.; Agaras, M. N.; Atay, S.; Cakir, A.; Cankocak, K.; Grynyov, B.; Levchuk, L.; Sorokin, P.; Aggleton, R.; Ball, F.; Beck, L.; Brooke, J. J.; Burns, D.; Clement, E.; Cussans, D.; Davignon, O.; Flacher, H.; Goldstein, J.; Grimes, M.; Heath, G. P.; Heath, H. F.; Jacob, J.; Kreczko, L.; Lucas, C.; Newbold, D. M.; Paramesvaran, S.; Poll, A.; Sakuma, T.; Seif El Nasr-storey, S.; Smith, D.; Smith, V. J.; Bell, K. W.; Belyaev, A.; Brew, C.; Brown, R. M.; Calligaris, L.; Cieri, D.; Cockerill, D. J. A.; Coughlan, J. A.; Harder, K.; Harper, S.; Olaiya, E.; Petyt, D.; Shepherd-Themistocleous, C. H.; Thea, A.; Tomalin, I. R.; Williams, T.; Auzinger, G.; Bainbridge, R.; Breeze, S.; Buchmuller, O.; Bundock, A.; Casasso, S.; Citron, M.; Colling, D.; Corpe, L.; Dauncey, P.; Davies, G.; De Wit, A.; Della Negra, M.; Di Maria, R.; Elwood, A.; Haddad, Y.; Hall, G.; Iles, G.; James, T.; Lane, R.; Laner, C.; Lyons, L.; Magnan, A.-M.; Malik, S.; Mastrolorenzo, L.; Matsushita, T.; Nash, J.; Nikitenko, A.; Palladino, V.; Pesaresi, M.; Raymond, D. M.; Richards, A.; Rose, A.; Scott, E.; Seez, C.; Shtipliyski, A.; Summers, S.; Tapper, A.; Uchida, K.; Vazquez Acosta, M.; Virdee, T.; Wardle, N.; Winterbottom, D.; Wright, J.; Zenz, S. C.; Cole, J. E.; Hobson, P. R.; Khan, A.; Kyberd, P.; Reid, I. D.; Symonds, P.; Teodorescu, L.; Turner, M.; Borzou, A.; Call, K.; Dittmann, J.; Hatakeyama, K.; Liu, H.; Pastika, N.; Smith, C.; Bartek, R.; Dominguez, A.; Buccilli, A.; Cooper, S. I.; Henderson, C.; Rumerio, P.; West, C.; Arcaro, D.; Avetisyan, A.; Bose, T.; Gastler, D.; Rankin, D.; Richardson, C.; Rohlf, J.; Sulak, L.; Zou, D.; Benelli, G.; Cutts, D.; Garabedian, A.; Hakala, J.; Heintz, U.; Hogan, J. M.; Kwok, K. H. M.; Laird, E.; Landsberg, G.; Mao, Z.; Narain, M.; Pazzini, J.; Piperov, S.; Sagir, S.; Syarif, R.; Yu, D.; Band, R.; Brainerd, C.; Burns, D.; Calderon De La Barca Sanchez, M.; Chertok, M.; Conway, J.; Conway, R.; Cox, P. T.; Erbacher, R.; Flores, C.; Funk, G.; Gardner, M.; Ko, W.; Lander, R.; Mclean, C.; Mulhearn, M.; Pellett, D.; Pilot, J.; Shalhout, S.; Shi, M.; Smith, J.; Squires, M.; Stolp, D.; Tos, K.; Tripathi, M.; Wang, Z.; Bachtis, M.; Bravo, C.; Cousins, R.; Dasgupta, A.; Florent, A.; Hauser, J.; Ignatenko, M.; Mccoll, N.; Saltzberg, D.; Schnaible, C.; Valuev, V.; Bouvier, E.; Burt, K.; Clare, R.; Ellison, J.; Gary, J. W.; Ghiasi Shirazi, S. M. A.; Hanson, G.; Heilman, J.; Jandir, P.; Kennedy, E.; Lacroix, F.; Long, O. R.; Olmedo Negrete, M.; Paneva, M. I.; Shrinivas, A.; Si, W.; Wang, L.; Wei, H.; Wimpenny, S.; Yates, B. R.; Branson, J. G.; Cittolin, S.; Derdzinski, M.; Hashemi, B.; Holzner, A.; Klein, D.; Kole, G.; Krutelyov, V.; Letts, J.; Macneill, I.; Masciovecchio, M.; Olivito, D.; Padhi, S.; Pieri, M.; Sani, M.; Sharma, V.; Simon, S.; Tadel, M.; Vartak, A.; Wasserbaech, S.; Wood, J.; Würthwein, F.; Yagil, A.; Zevi Della Porta, G.; Amin, N.; Bhandari, R.; Bradmiller-Feld, J.; Campagnari, C.; Dishaw, A.; Dutta, V.; Franco Sevilla, M.; George, C.; Golf, F.; Gouskos, L.; Gran, J.; Heller, R.; Incandela, J.; Mullin, S. D.; Ovcharova, A.; Qu, H.; Richman, J.; Stuart, D.; Suarez, I.; Yoo, J.; Anderson, D.; Bendavid, J.; Bornheim, A.; Lawhorn, J. M.; Newman, H. B.; Nguyen, T.; Pena, C.; Spiropulu, M.; Vlimant, J. R.; Xie, S.; Zhang, Z.; Zhu, R. Y.; Andrews, M. B.; Ferguson, T.; Mudholkar, T.; Paulini, M.; Russ, J.; Sun, M.; Vogel, H.; Vorobiev, I.; Weinberg, M.; Cumalat, J. P.; Ford, W. T.; Jensen, F.; Johnson, A.; Krohn, M.; Leontsinis, S.; Mulholland, T.; Stenson, K.; Wagner, S. R.; Alexander, J.; Chaves, J.; Chu, J.; Dittmer, S.; Mcdermott, K.; Mirman, N.; Patterson, J. R.; Rinkevicius, A.; Ryd, A.; Skinnari, L.; Soffi, L.; Tan, S. M.; Tao, Z.; Thom, J.; Tucker, J.; Wittich, P.; Zientek, M.; Abdullin, S.; Albrow, M.; Apollinari, G.; Apresyan, A.; Apyan, A.; Banerjee, S.; Bauerdick, L. A. T.; Beretvas, A.; Berryhill, J.; Bhat, P. C.; Bolla, G.; Burkett, K.; Butler, J. N.; Canepa, A.; Cerati, G. B.; Cheung, H. W. K.; Chlebana, F.; Cremonesi, M.; Duarte, J.; Elvira, V. D.; Freeman, J.; Gecse, Z.; Gottschalk, E.; Gray, L.; Green, D.; Grünendahl, S.; Gutsche, O.; Harris, R. M.; Hasegawa, S.; Hirschauer, J.; Hu, Z.; Jayatilaka, B.; Jindariani, S.; Johnson, M.; Joshi, U.; Klima, B.; Kreis, B.; Lammel, S.; Lincoln, D.; Lipton, R.; Liu, M.; Liu, T.; Lopes De Sá, R.; Lykken, J.; Maeshima, K.; Magini, N.; Marraffino, J. M.; Maruyama, S.; Mason, D.; McBride, P.; Merkel, P.; Mrenna, S.; Nahn, S.; O'Dell, V.; Pedro, K.; Prokofyev, O.; Rakness, G.; Ristori, L.; Schneider, B.; Sexton-Kennedy, E.; Soha, A.; Spalding, W. J.; Spiegel, L.; Stoynev, S.; Strait, J.; Strobbe, N.; Taylor, L.; Tkaczyk, S.; Tran, N. V.; Uplegger, L.; Vaandering, E. W.; Vernieri, C.; Verzocchi, M.; Vidal, R.; Wang, M.; Weber, H. A.; Whitbeck, A.; Acosta, D.; Avery, P.; Bortignon, P.; Bourilkov, D.; Brinkerhoff, A.; Carnes, A.; Carver, M.; Curry, D.; Field, R. D.; Furic, I. K.; Konigsberg, J.; Korytov, A.; Kotov, K.; Ma, P.; Matchev, K.; Mei, H.; Mitselmakher, G.; Rank, D.; Sperka, D.; Terentyev, N.; Thomas, L.; Wang, J.; Wang, S.; Yelton, J.; Joshi, Y. R.; Linn, S.; Markowitz, P.; Rodriguez, J. L.; Ackert, A.; Adams, T.; Askew, A.; Hagopian, S.; Hagopian, V.; Johnson, K. F.; Kolberg, T.; Martinez, G.; Perry, T.; Prosper, H.; Saha, A.; Santra, A.; Sharma, V.; Yohay, R.; Baarmand, M. M.; Bhopatkar, V.; Colafranceschi, S.; Hohlmann, M.; Noonan, D.; Roy, T.; Yumiceva, F.; Adams, M. R.; Apanasevich, L.; Berry, D.; Betts, R. R.; Cavanaugh, R.; Chen, X.; Evdokimov, O.; Gerber, C. E.; Hangal, D. A.; Hofman, D. J.; Jung, K.; Kamin, J.; Sandoval Gonzalez, I. D.; Tonjes, M. B.; Trauger, H.; Varelas, N.; Wang, H.; Wu, Z.; Zhang, J.; Bilki, B.; Clarida, W.; Dilsiz, K.; Durgut, S.; Gandrajula, R. P.; Haytmyradov, M.; Khristenko, V.; Merlo, J.-P.; Mermerkaya, H.; Mestvirishvili, A.; Moeller, A.; Nachtman, J.; Ogul, H.; Onel, Y.; Ozok, F.; Penzo, A.; Snyder, C.; Tiras, E.; Wetzel, J.; Yi, K.; Blumenfeld, B.; Cocoros, A.; Eminizer, N.; Fehling, D.; Feng, L.; Gritsan, A. V.; Maksimovic, P.; Roskes, J.; Sarica, U.; Swartz, M.; Xiao, M.; You, C.; Al-bataineh, A.; Baringer, P.; Bean, A.; Boren, S.; Bowen, J.; Castle, J.; Khalil, S.; Kropivnitskaya, A.; Majumder, D.; Mcbrayer, W.; Murray, M.; Royon, C.; Sanders, S.; Schmitz, E.; Stringer, R.; Tapia Takaki, J. D.; Wang, Q.; Ivanov, A.; Kaadze, K.; Maravin, Y.; Mohammadi, A.; Saini, L. K.; Skhirtladze, N.; Toda, S.; Rebassoo, F.; Wright, D.; Anelli, C.; Baden, A.; Baron, O.; Belloni, A.; Calvert, B.; Eno, S. C.; Ferraioli, C.; Hadley, N. J.; Jabeen, S.; Jeng, G. Y.; Kellogg, R. G.; Kunkle, J.; Mignerey, A. C.; Ricci-Tam, F.; Shin, Y. H.; Skuja, A.; Tonwar, S. C.; Abercrombie, D.; Allen, B.; Azzolini, V.; Barbieri, R.; Baty, A.; Bi, R.; Brandt, S.; Busza, W.; Cali, I. A.; D'Alfonso, M.; Demiragli, Z.; Gomez Ceballos, G.; Goncharov, M.; Hsu, D.; Iiyama, Y.; Innocenti, G. M.; Klute, M.; Kovalskyi, D.; Lai, Y. S.; Lee, Y.-J.; Levin, A.; Luckey, P. D.; Maier, B.; Marini, A. C.; Mcginn, C.; Mironov, C.; Narayanan, S.; Niu, X.; Paus, C.; Roland, C.; Roland, G.; Salfeld-Nebgen, J.; Stephans, G. S. F.; Tatar, K.; Velicanu, D.; Wang, J.; Wang, T. W.; Wyslouch, B.; Benvenuti, A. C.; Chatterjee, R. M.; Evans, A.; Hansen, P.; Kalafut, S.; Kubota, Y.; Lesko, Z.; Mans, J.; Nourbakhsh, S.; Ruckstuhl, N.; Rusack, R.; Turkewitz, J.; Acosta, J. G.; Oliveros, S.; Avdeeva, E.; Bloom, K.; Claes, D. R.; Fangmeier, C.; Gonzalez Suarez, R.; Kamalieddin, R.; Kravchenko, I.; Monroy, J.; Siado, J. E.; Snow, G. R.; Stieger, B.; Alyari, M.; Dolen, J.; Godshalk, A.; Harrington, C.; Iashvili, I.; Nguyen, D.; Parker, A.; Rappoccio, S.; Roozbahani, B.; Alverson, G.; Barberis, E.; Hortiangtham, A.; Massironi, A.; Morse, D. M.; Nash, D.; Orimoto, T.; Teixeira De Lima, R.; Trocino, D.; Wood, D.; Bhattacharya, S.; Charaf, O.; Hahn, K. A.; Mucia, N.; Odell, N.; Pollack, B.; Schmitt, M. H.; Sung, K.; Trovato, M.; Velasco, M.; Dev, N.; Hildreth, M.; Hurtado Anampa, K.; Jessop, C.; Karmgard, D. J.; Kellams, N.; Lannon, K.; Loukas, N.; Marinelli, N.; Meng, F.; Mueller, C.; Musienko, Y.; Planer, M.; Reinsvold, A.; Ruchti, R.; Smith, G.; Taroni, S.; Wayne, M.; Wolf, M.; Woodard, A.; Alimena, J.; Antonelli, L.; Bylsma, B.; Durkin, L. S.; Flowers, S.; Francis, B.; Hart, A.; Hill, C.; Ji, W.; Liu, B.; Luo, W.; Puigh, D.; Winer, B. L.; Wulsin, H. W.; Cooperstein, S.; Driga, O.; Elmer, P.; Hardenbrook, J.; Hebda, P.; Higginbotham, S.; Lange, D.; Luo, J.; Marlow, D.; Mei, K.; Ojalvo, I.; Olsen, J.; Palmer, C.; Piroué, P.; Stickland, D.; Tully, C.; Malik, S.; Norberg, S.; Barker, A.; Barnes, V. E.; Das, S.; Folgueras, S.; Gutay, L.; Jha, M. K.; Jones, M.; Jung, A. W.; Khatiwada, A.; Miller, D. H.; Neumeister, N.; Peng, C. C.; Schulte, J. F.; Sun, J.; Wang, F.; Xie, W.; Cheng, T.; Parashar, N.; Stupak, J.; Adair, A.; Akgun, B.; Chen, Z.; Ecklund, K. M.; Geurts, F. J. M.; Guilbaud, M.; Li, W.; Michlin, B.; Northup, M.; Padley, B. P.; Roberts, J.; Rorie, J.; Tu, Z.; Zabel, J.; Bodek, A.; de Barbaro, P.; Demina, R.; Duh, Y. t.; Ferbel, T.; Galanti, M.; Garcia-Bellido, A.; Han, J.; Hindrichs, O.; Khukhunaishvili, A.; Lo, K. H.; Tan, P.; Verzetti, M.; Ciesielski, R.; Goulianos, K.; Mesropian, C.; Agapitos, A.; Chou, J. P.; Gershtein, Y.; Gómez Espinosa, T. A.; Halkiadakis, E.; Heindl, M.; Hughes, E.; Kaplan, S.; Kunnawalkam Elayavalli, R.; Kyriacou, S.; Lath, A.; Montalvo, R.; Nash, K.; Osherson, M.; Saka, H.; Salur, S.; Schnetzer, S.; Sheffield, D.; Somalwar, S.; Stone, R.; Thomas, S.; Thomassen, P.; Walker, M.; Delannoy, A. G.; Foerster, M.; Heideman, J.; Riley, G.; Rose, K.; Spanier, S.; Thapa, K.; Bouhali, O.; Castaneda Hernandez, A.; Celik, A.; Dalchenko, M.; De Mattia, M.; Delgado, A.; Dildick, S.; Eusebi, R.; Gilmore, J.; Huang, T.; Kamon, T.; Mueller, R.; Pakhotin, Y.; Patel, R.; Perloff, A.; Perniè, L.; Rathjens, D.; Safonov, A.; Tatarinov, A.; Ulmer, K. A.; Akchurin, N.; Damgov, J.; De Guio, F.; Dudero, P. R.; Faulkner, J.; Gurpinar, E.; Kunori, S.; Lamichhane, K.; Lee, S. W.; Libeiro, T.; Peltola, T.; Undleeb, S.; Volobouev, I.; Wang, Z.; Greene, S.; Gurrola, A.; Janjam, R.; Johns, W.; Maguire, C.; Melo, A.; Ni, H.; Sheldon, P.; Tuo, S.; Velkovska, J.; Xu, Q.; Arenton, M. W.; Barria, P.; Cox, B.; Hirosky, R.; Ledovskoy, A.; Li, H.; Neu, C.; Sinthuprasith, T.; Wang, Y.; Wolfe, E.; Xia, F.; Harr, R.; Karchin, P. E.; Sturdy, J.; Zaleski, S.; Brodski, M.; Buchanan, J.; Caillol, C.; Dasu, S.; Dodd, L.; Duric, S.; Gomber, B.; Grothe, M.; Herndon, M.; Hervé, A.; Hussain, U.; Klabbers, P.; Lanaro, A.; Levine, A.; Long, K.; Loveless, R.; Pierro, G. A.; Polese, G.; Ruggles, T.; Savin, A.; Smith, N.; Smith, W. H.; Taylor, D.; Woods, N.; CMS Collaboration

2017-12-01

A search is performed for anomalous interactions of the recently discovered Higgs boson using matrix element techniques with the information from its decay to four leptons and from associated Higgs boson production with two quark jets in either vector boson fusion or associated production with a vector boson. The data were recorded by the CMS experiment at the LHC at a center-of-mass energy of 13TeV and correspond to an integrated luminosity of 38.6fb-1. They are combined with the data collected at center-of-mass energies of 7 and 8TeV, corresponding to integrated luminosities of 5.1 and 19.7fb-1, respectively. All observations are consistent with the expectations for the standard model Higgs boson.

Adenoviral transduction supports matrix expression of alginate cultured articular chondrocytes.

PubMed

Pohle, D; Kasch, R; Herlyn, P; Bader, R; Mittlmeier, T; Pützer, B M; Müller-Hilke, B

2012-09-01

The present study examines the effects of adenoviral (Ad) transduction of human primary chondrocyte on transgene expression and matrix production. Primary chondrocytes were isolated from healthy articular cartilage and from cartilage with mild osteoarthritis (OA), transduced with an Ad vector and either immediately cultured in alginate or expanded in monolayer before alginate culture. Proteoglycan production was measured using dimethylmethylene blue (DMMB) assay and matrix gene expression was quantified by real-time PCR. Viral infection of primary chondrocytes results in a stable long time transgene expression for up to 13 weeks. Ad transduction does not significantly alter gene expression and matrix production if chondrocytes are immediately embedded in alginate. However, if expanded prior to three dimension (3D) culture in alginate, chondrocytes produce not only more proteoglycans compared to non-transduced controls, but also display an increased anabolic and decreased catabolic activity compared to non-transduced controls. We therefore suggest that successful autologous chondrocyte transplantation (ACT) should combine adenoviral transduction of primary chondrocytes with expansion in monolayer followed by 3D culture. Future studies will be needed to investigate whether the subsequent matrix production can be further improved by using Ad vectors bearing genes encoding matrix proteins. Copyright © 2012 Wiley Periodicals, Inc.

Analysis of structural response data using discrete modal filters. M.S. Thesis

NASA Technical Reports Server (NTRS)

Freudinger, Lawrence C.

1991-01-01

The application of reciprocal modal vectors to the analysis of structural response data is described. Reciprocal modal vectors are constructed using an existing experimental modal model and an existing frequency response matrix of a structure, and can be assembled into a matrix that effectively transforms the data from the physical space to a modal space within a particular frequency range. In other words, the weighting matrix necessary for modal vector orthogonality (typically the mass matrix) is contained within the reciprocal model matrix. The underlying goal of this work is mostly directed toward observing the modal state responses in the presence of unknown, possibly closed loop forcing functions, thus having an impact on both operating data analysis techniques and independent modal space control techniques. This study investigates the behavior of reciprocol modal vectors as modal filters with respect to certain calculation parameters and their performance with perturbed system frequency response data.

Signal processing applications of massively parallel charge domain computing devices

NASA Technical Reports Server (NTRS)

Fijany, Amir (Inventor); Barhen, Jacob (Inventor); Toomarian, Nikzad (Inventor)

1999-01-01

The present invention is embodied in a charge coupled device (CCD)/charge injection device (CID) architecture capable of performing a Fourier transform by simultaneous matrix vector multiplication (MVM) operations in respective plural CCD/CID arrays in parallel in O(1) steps. For example, in one embodiment, a first CCD/CID array stores charge packets representing a first matrix operator based upon permutations of a Hartley transform and computes the Fourier transform of an incoming vector. A second CCD/CID array stores charge packets representing a second matrix operator based upon different permutations of a Hartley transform and computes the Fourier transform of an incoming vector. The incoming vector is applied to the inputs of the two CCD/CID arrays simultaneously, and the real and imaginary parts of the Fourier transform are produced simultaneously in the time required to perform a single MVM operation in a CCD/CID array.

Arrowheaded enhanced multivariance products representation for matrices (AEMPRM): Specifically focusing on infinite matrices and converting arrowheadedness to tridiagonality

NASA Astrophysics Data System (ADS)

Özdemir, Gizem; Demiralp, Metin

2015-12-01

In this work, Enhanced Multivariance Products Representation (EMPR) approach which is a Demiralp-and-his- group extension to the Sobol's High Dimensional Model Representation (HDMR) has been used as the basic tool. Their discrete form have also been developed and used in practice by Demiralp and his group in addition to some other authors for the decomposition of the arrays like vectors, matrices, or multiway arrays. This work specifically focuses on the decomposition of infinite matrices involving denumerable infinitely many rows and columns. To this end the target matrix is first decomposed to the sum of certain outer products and then each outer product is treated by Tridiagonal Matrix Enhanced Multivariance Products Representation (TMEMPR) which has been developed by Demiralp and his group. The result is a three-matrix- factor-product whose kernel (the middle factor) is an arrowheaded matrix while the pre and post factors are invertable matrices decomposed of the support vectors of TMEMPR. This new method is called as Arrowheaded Enhanced Multivariance Products Representation for Matrices. The general purpose is approximation of denumerably infinite matrices with the new method.

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

NASA Astrophysics Data System (ADS)

Bertin, Eric; Vanicat, Matthieu

2018-06-01

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

A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations

DOE PAGES

Aktulga, Hasan Metin; Afibuzzaman, Md.; Williams, Samuel; ...

2017-06-01

As on-node parallelism increases and the performance gap between the processor and the memory system widens, achieving high performance in large-scale scientific applications requires an architecture-aware design of algorithms and solvers. We focus on the eigenvalue problem arising in nuclear Configuration Interaction (CI) calculations, where a few extreme eigenpairs of a sparse symmetric matrix are needed. Here, we consider a block iterative eigensolver whose main computational kernels are the multiplication of a sparse matrix with multiple vectors (SpMM), and tall-skinny matrix operations. We then present techniques to significantly improve the SpMM and the transpose operation SpMM T by using themore » compressed sparse blocks (CSB) format. We achieve 3-4× speedup on the requisite operations over good implementations with the commonly used compressed sparse row (CSR) format. We develop a performance model that allows us to correctly estimate the performance of our SpMM kernel implementations, and we identify cache bandwidth as a potential performance bottleneck beyond DRAM. We also analyze and optimize the performance of LOBPCG kernels (inner product and linear combinations on multiple vectors) and show up to 15× speedup over using high performance BLAS libraries for these operations. The resulting high performance LOBPCG solver achieves 1.4× to 1.8× speedup over the existing Lanczos solver on a series of CI computations on high-end multicore architectures (Intel Xeons). We also analyze the performance of our techniques on an Intel Xeon Phi Knights Corner (KNC) processor.« less

A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations

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

Aktulga, Hasan Metin; Afibuzzaman, Md.; Williams, Samuel

As on-node parallelism increases and the performance gap between the processor and the memory system widens, achieving high performance in large-scale scientific applications requires an architecture-aware design of algorithms and solvers. We focus on the eigenvalue problem arising in nuclear Configuration Interaction (CI) calculations, where a few extreme eigenpairs of a sparse symmetric matrix are needed. Here, we consider a block iterative eigensolver whose main computational kernels are the multiplication of a sparse matrix with multiple vectors (SpMM), and tall-skinny matrix operations. We then present techniques to significantly improve the SpMM and the transpose operation SpMM T by using themore » compressed sparse blocks (CSB) format. We achieve 3-4× speedup on the requisite operations over good implementations with the commonly used compressed sparse row (CSR) format. We develop a performance model that allows us to correctly estimate the performance of our SpMM kernel implementations, and we identify cache bandwidth as a potential performance bottleneck beyond DRAM. We also analyze and optimize the performance of LOBPCG kernels (inner product and linear combinations on multiple vectors) and show up to 15× speedup over using high performance BLAS libraries for these operations. The resulting high performance LOBPCG solver achieves 1.4× to 1.8× speedup over the existing Lanczos solver on a series of CI computations on high-end multicore architectures (Intel Xeons). We also analyze the performance of our techniques on an Intel Xeon Phi Knights Corner (KNC) processor.« less

Assessing Fit of Item Response Models Using the Information Matrix Test

ERIC Educational Resources Information Center

Ranger, Jochen; Kuhn, Jorg-Tobias

2012-01-01

The information matrix can equivalently be determined via the expectation of the Hessian matrix or the expectation of the outer product of the score vector. The identity of these two matrices, however, is only valid in case of a correctly specified model. Therefore, differences between the two versions of the observed information matrix indicate…

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

PubMed

Kubie, John L; Fenton, André A

2009-05-01

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

Rank-Optimized Logistic Matrix Regression toward Improved Matrix Data Classification.

PubMed

Zhang, Jianguang; Jiang, Jianmin

2018-02-01

While existing logistic regression suffers from overfitting and often fails in considering structural information, we propose a novel matrix-based logistic regression to overcome the weakness. In the proposed method, 2D matrices are directly used to learn two groups of parameter vectors along each dimension without vectorization, which allows the proposed method to fully exploit the underlying structural information embedded inside the 2D matrices. Further, we add a joint [Formula: see text]-norm on two parameter matrices, which are organized by aligning each group of parameter vectors in columns. This added co-regularization term has two roles-enhancing the effect of regularization and optimizing the rank during the learning process. With our proposed fast iterative solution, we carried out extensive experiments. The results show that in comparison to both the traditional tensor-based methods and the vector-based regression methods, our proposed solution achieves better performance for matrix data classifications.

Optical systolic array processor using residue arithmetic

NASA Technical Reports Server (NTRS)

Jackson, J.; Casasent, D.

1983-01-01

The use of residue arithmetic to increase the accuracy and reduce the dynamic range requirements of optical matrix-vector processors is evaluated. It is determined that matrix-vector operations and iterative algorithms can be performed totally in residue notation. A new parallel residue quantizer circuit is developed which significantly improves the performance of the systolic array feedback processor. Results are presented of a computer simulation of this system used to solve a set of three simultaneous equations.

General MoM Solutions for Large Arrays

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

Fasenfest, B; Capolino, F; Wilton, D R

2003-07-22

This paper focuses on a numerical procedure that addresses the difficulties of dealing with large, finite arrays while preserving the generality and robustness of full-wave methods. We present a fast method based on approximating interactions between sufficiently separated array elements via a relatively coarse interpolation of the Green's function on a uniform grid commensurate with the array's periodicity. The interaction between the basis and testing functions is reduced to a three-stage process. The first stage is a projection of standard (e.g., RWG) subdomain bases onto a set of interpolation functions that interpolate the Green's function on the array face. Thismore » projection, which is used in a matrix/vector product for each array cell in an iterative solution process, need only be carried out once for a single cell and results in a low-rank matrix. An intermediate stage matrix/vector product computation involving the uniformly sampled Green's function is of convolutional form in the lateral (transverse) directions so that a 2D FFT may be used. The final stage is a third matrix/vector product computation involving a matrix resulting from projecting testing functions onto the Green's function interpolation functions; the low-rank matrix is either identical to (using Galerkin's method) or similar to that for the bases projection. An effective MoM solution scheme is developed for large arrays using a modification of the AIM (Adaptive Integral Method) method. The method permits the analysis of arrays with arbitrary contours and nonplanar elements. Both fill and solve times within the MoM method are improved with respect to more standard MoM solvers.« less

Vectorial laws of refraction and reflection using the cross product and dot product.

PubMed

Tkaczyk, Eric R

2012-03-01

We demonstrate that published vectorial laws of reflection and refraction of light based solely on the cross product do not, in general, uniquely determine the direction of the reflected and refracted waves without additional information. This is because the cross product does not have a unique inverse operation, which is explained in this Letter in linear algebra terms. However, a vector is in fact uniquely determined if both the cross product (vector product) and dot product (scalar product) with a known vector are specified, which can be written as a single equation with a left-invertible matrix. It is thus possible to amend the vectorial laws of reflection and refraction to incorporate both the cross and dot products for a complete specification with unique solution. This enables highly efficient, unambiguous computation of reflected and refracted wave vectors from the incident wave and surface normal. © 2012 Optical Society of America

Constraints on anomalous Higgs boson couplings using production and decay information in the four-lepton final state

DOE PAGES

Sirunyan, A. M.; Tumasyan, A.; Adam, W.; ...

2017-10-16

A search is performed for anomalous interactions of the recently discovered Higgs boson using matrix element techniques with the information from its decay to four leptons and from associated Higgs boson production with two quark jets in either vector boson fusion or associated production with a vector boson. The data were recorded by the CMS experiment at the LHC at a center-of-mass energy of 13 TeV and correspond to an integrated luminosity of 38.6 fb –1. These data are combined with the data collected at center-of-mass energies of 7 and 8 TeV, corresponding to integrated luminosities of 5.1 and 19.7more » fb –1, respectively. As a result, all observations are consistent with the expectations for the standard model Higgs boson.« less

Constraints on anomalous Higgs boson couplings using production and decay information in the four-lepton final state

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

Sirunyan, A. M.; Tumasyan, A.; Adam, W.

A search is performed for anomalous interactions of the recently discovered Higgs boson using matrix element techniques with the information from its decay to four leptons and from associated Higgs boson production with two quark jets in either vector boson fusion or associated production with a vector boson. The data were recorded by the CMS experiment at the LHC at a center-of-mass energy of 13 TeV and correspond to an integrated luminosity of 38.6 fb –1. These data are combined with the data collected at center-of-mass energies of 7 and 8 TeV, corresponding to integrated luminosities of 5.1 and 19.7more » fb –1, respectively. As a result, all observations are consistent with the expectations for the standard model Higgs boson.« less

Multitasking 3-D forward modeling using high-order finite difference methods on the Cray X-MP/416

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

Terki-Hassaine, O.; Leiss, E.L.

1988-01-01

The CRAY X-MP/416 was used to multitask 3-D forward modeling by the high-order finite difference method. Flowtrace analysis reveals that the most expensive operation in the unitasked program is a matrix vector multiplication. The in-core and out-of-core versions of a reentrant subroutine can perform any fraction of the matrix vector multiplication independently, a pattern compatible with multitasking. The matrix vector multiplication routine can be distributed over two to four processors. The rest of the program utilizes the microtasking feature that lets the system treat independent iterations of DO-loops as subtasks to be performed by any available processor. The availability ofmore » the Solid-State Storage Device (SSD) meant the I/O wait time was virtually zero. A performance study determined a theoretical speedup, taking into account the multitasking overhead. Multitasking programs utilizing both macrotasking and microtasking features obtained actual speedups that were approximately 80% of the ideal speedup.« less

3-D Magnetotelluric Forward Modeling And Inversion Incorporating Topography By Using Vector Finite-Element Method Combined With Divergence Corrections Based On The Magnetic Field (VFEH++)

NASA Astrophysics Data System (ADS)

Shi, X.; Utada, H.; Jiaying, W.

2009-12-01

The vector finite-element method combined with divergence corrections based on the magnetic field H, referred to as VFEH++ method, is developed to simulate the magnetotelluric (MT) responses of 3-D conductivity models. The advantages of the new VFEH++ method are the use of edge-elements to eliminate the vector parasites and the divergence corrections to explicitly guarantee the divergence-free conditions in the whole modeling domain. 3-D MT topographic responses are modeling using the new VFEH++ method, and are compared with those calculated by other numerical methods. The results show that MT responses can be modeled highly accurate using the VFEH+ +method. The VFEH++ algorithm is also employed for the 3-D MT data inversion incorporating topography. The 3-D MT inverse problem is formulated as a minimization problem of the regularized misfit function. In order to avoid the huge memory requirement and very long time for computing the Jacobian sensitivity matrix for Gauss-Newton method, we employ the conjugate gradient (CG) approach to solve the inversion equation. In each iteration of CG algorithm, the cost computation is the product of the Jacobian sensitivity matrix with a model vector x or its transpose with a data vector y, which can be transformed into two pseudo-forwarding modeling. This avoids the full explicitly Jacobian matrix calculation and storage which leads to considerable savings in the memory required by the inversion program in PC computer. The performance of CG algorithm will be illustrated by several typical 3-D models with horizontal earth surface and topographic surfaces. The results show that the VFEH++ and CG algorithms can be effectively employed to 3-D MT field data inversion.

Matrix-vector multiplication using digital partitioning for more accurate optical computing

NASA Technical Reports Server (NTRS)

Gary, C. K.

1992-01-01

Digital partitioning offers a flexible means of increasing the accuracy of an optical matrix-vector processor. This algorithm can be implemented with the same architecture required for a purely analog processor, which gives optical matrix-vector processors the ability to perform high-accuracy calculations at speeds comparable with or greater than electronic computers as well as the ability to perform analog operations at a much greater speed. Digital partitioning is compared with digital multiplication by analog convolution, residue number systems, and redundant number representation in terms of the size and the speed required for an equivalent throughput as well as in terms of the hardware requirements. Digital partitioning and digital multiplication by analog convolution are found to be the most efficient alogrithms if coding time and hardware are considered, and the architecture for digital partitioning permits the use of analog computations to provide the greatest throughput for a single processor.

Design and experimental verification for optical module of optical vector-matrix multiplier.

PubMed

Zhu, Weiwei; Zhang, Lei; Lu, Yangyang; Zhou, Ping; Yang, Lin

2013-06-20

Optical computing is a new method to implement signal processing functions. The multiplication between a vector and a matrix is an important arithmetic algorithm in the signal processing domain. The optical vector-matrix multiplier (OVMM) is an optoelectronic system to carry out this operation, which consists of an electronic module and an optical module. In this paper, we propose an optical module for OVMM. To eliminate the cross talk and make full use of the optical elements, an elaborately designed structure that involves spherical lenses and cylindrical lenses is utilized in this optical system. The optical design software package ZEMAX is used to optimize the parameters and simulate the whole system. Finally, experimental data is obtained through experiments to evaluate the overall performance of the system. The results of both simulation and experiment indicate that the system constructed can implement the multiplication between a matrix with dimensions of 16 by 16 and a vector with a dimension of 16 successfully.

Effective matrix-free preconditioning for the augmented immersed interface method

NASA Astrophysics Data System (ADS)

Xia, Jianlin; Li, Zhilin; Ye, Xin

2015-12-01

We present effective and efficient matrix-free preconditioning techniques for the augmented immersed interface method (AIIM). AIIM has been developed recently and is shown to be very effective for interface problems and problems on irregular domains. GMRES is often used to solve for the augmented variable(s) associated with a Schur complement A in AIIM that is defined along the interface or the irregular boundary. The efficiency of AIIM relies on how quickly the system for A can be solved. For some applications, there are substantial difficulties involved, such as the slow convergence of GMRES (particularly for free boundary and moving interface problems), and the inconvenience in finding a preconditioner (due to the situation that only the products of A and vectors are available). Here, we propose matrix-free structured preconditioning techniques for AIIM via adaptive randomized sampling, using only the products of A and vectors to construct a hierarchically semiseparable matrix approximation to A. Several improvements over existing schemes are shown so as to enhance the efficiency and also avoid potential instability. The significance of the preconditioners includes: (1) they do not require the entries of A or the multiplication of AT with vectors; (2) constructing the preconditioners needs only O (log ⁡ N) matrix-vector products and O (N) storage, where N is the size of A; (3) applying the preconditioners needs only O (N) flops; (4) they are very flexible and do not require any a priori knowledge of the structure of A. The preconditioners are observed to significantly accelerate the convergence of GMRES, with heuristical justifications of the effectiveness. Comprehensive tests on several important applications are provided, such as Navier-Stokes equations on irregular domains with traction boundary conditions, interface problems in incompressible flows, mixed boundary problems, and free boundary problems. The preconditioning techniques are also useful for several other problems and methods.

SHIP, a novel factor to ameliorate extracellular matrix accumulation via suppressing PI3K/Akt/CTGF signaling in diabetic kidney disease.

PubMed

Li, Fan; Li, Lisha; Cheng, Meijuan; Wang, Xiumin; Hao, Jun; Liu, Shuxia; Duan, Huijun

2017-01-22

Tubular interstitial extracellular matrix accumulation, which plays a key role in the pathogenesis and progression of diabetic kidney disease (DKD), is believed to be mediated by activation of PI3K/Akt signal pathway. However, it is still not clear whether SH2 domain-containing inositol 5'-phosphatase (SHIP), known as a negative regulator of PI3K/Akt pathway is also involved in extracellular matrix metabolism of diabetic kidney. In the present study, decreased SHIP and increased phospho-Akt (Ser 473, Thr 308) were found in renal tubular cells of diabetic mice accompanied by overexpression of connective tissue growth factor (CTGF) and extracellular matrix deposition versus normal mice. Again, high glucose attenuated SHIP expression in a time-dependent manner, concomitant with activation of PI3K/Akt signaling and extracellular matrix production in human renal proximal tubular epithelial cells (HK2) cultured in vitro, which was significantly prevented by transfection of M90-SHIP vector. Furthermore, in vivo delivery of rAd-INPP5D vector (SHIP expression vector) via intraperitoneal injection in diabetic mice increased SHIP expression by 3.36 times followed by 65.26%, 70.38% and 46.71% decreases of phospho-Akt (Ser 473), phospho-Akt (Thr 308) and CTGF expression versus diabetic mice receiving rAd-EGFP vector. Meanwhile, increased renal extracellular matrix accumulation of diabetic mice was also inhibited with intraperitoneal injection of rAd-INPP5D vector. These above data suggested that overexpression of SHIP might be a potent method to lessen renal extracellular matrix accumulation via inactivation of PI3K/Akt pathway and suppression of CTGF expression in DKD. Copyright © 2016 Elsevier Inc. All rights reserved.

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

NASA Technical Reports Server (NTRS)

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

1987-01-01

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

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

PubMed

Habiby, S F; Collins, S A

1987-11-01

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

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

Sparse matrix-vector multiplication on network-on-chip

NASA Astrophysics Data System (ADS)

Sun, C.-C.; Götze, J.; Jheng, H.-Y.; Ruan, S.-J.

2010-12-01

In this paper, we present an idea for performing matrix-vector multiplication by using Network-on-Chip (NoC) architecture. In traditional IC design on-chip communications have been designed with dedicated point-to-point interconnections. Therefore, regular local data transfer is the major concept of many parallel implementations. However, when dealing with the parallel implementation of sparse matrix-vector multiplication (SMVM), which is the main step of all iterative algorithms for solving systems of linear equation, the required data transfers depend on the sparsity structure of the matrix and can be extremely irregular. Using the NoC architecture makes it possible to deal with arbitrary structure of the data transfers; i.e. with the irregular structure of the sparse matrices. So far, we have already implemented the proposed SMVM-NoC architecture with the size 4×4 and 5×5 in IEEE 754 single float point precision using FPGA.

Compressed Continuous Computation v. 12/20/2016

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

Gorodetsky, Alex

2017-02-17

A library for performing numerical computation with low-rank functions. The (C3) library enables performing continuous linear and multilinear algebra with multidimensional functions. Common tasks include taking "matrix" decompositions of vector- or matrix-valued functions, approximating multidimensional functions in low-rank format, adding or multiplying functions together, integrating multidimensional functions.

Effect of cross-correlation on track-to-track fusion

NASA Astrophysics Data System (ADS)

Saha, Rajat K.

1994-07-01

Since the advent of target tracking systems employing a diverse mixture of sensors, there has been increasing recognition by air defense system planners and other military system analysts of the need to integrate these tracks so that a clear air picture can be obtained in a command center. A popular methodology to achieve this goal is to perform track-to-track fusion, which performs track-to-track association as well as kinematic state vector fusion. This paper seeks to answer analytically the extent of improvement achievable by means of kinetic state vector fusion when the tracks are obtained from dissimilar sensors (e.g., Radar/ESM/IRST/IFF). It is well known that evaluation of the performance of state vector fusion algorithms at steady state must take into account the effects of cross-correlation between eligible tracks introduced by the input noise which, unfortunately, is often neglected because of added computational complexity. In this paper, an expression for the steady-state cross-covariance matrix for a 2D state vector track-to-track fusion is obtained. This matrix is shown to be a function of the parameters of the Kalman filters associated with the candidate tracks being fused. Conditions for positive definiteness of the cross-covariance matrix have been derived and the effect of positive definiteness on performance of track-to-track fusion is also discussed.

AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, A. R.

1994-01-01

This package extends the Ada programming language to include linear algebra capabilities similar to those of the HAL/S programming language. The package is designed for avionics applications such as Space Station flight software. In addition to the HAL/S built-in functions, the package incorporates the quaternion functions used in the Shuttle and Galileo projects, and routines from LINPAK that solve systems of equations involving general square matrices. Language conventions in this package follow those of HAL/S to the maximum extent practical and minimize the effort required for writing new avionics software and translating existent software into Ada. Valid numeric types in this package include scalar, vector, matrix, and quaternion declarations. (Quaternions are fourcomponent vectors used in representing motion between two coordinate frames). Single precision and double precision floating point arithmetic is available in addition to the standard double precision integer manipulation. Infix operators are used instead of function calls to define dot products, cross products, quaternion products, and mixed scalar-vector, scalar-matrix, and vector-matrix products. The package contains two generic programs: one for floating point, and one for integer. The actual component type is passed as a formal parameter to the generic linear algebra package. The procedures for solving systems of linear equations defined by general matrices include GEFA, GECO, GESL, and GIDI. The HAL/S functions include ABVAL, UNIT, TRACE, DET, INVERSE, TRANSPOSE, GET, PUT, FETCH, PLACE, and IDENTITY. This package is written in Ada (Version 1.2) for batch execution and is machine independent. The linear algebra software depends on nothing outside the Ada language except for a call to a square root function for floating point scalars (such as SQRT in the DEC VAX MATHLIB library). This program was developed in 1989, and is a copyrighted work with all copyright vested in NASA.

Design of distributed PID-type dynamic matrix controller for fractional-order systems

NASA Astrophysics Data System (ADS)

Wang, Dawei; Zhang, Ridong

2018-01-01

With the continuous requirements for product quality and safety operation in industrial production, it is difficult to describe the complex large-scale processes with integer-order differential equations. However, the fractional differential equations may precisely represent the intrinsic characteristics of such systems. In this paper, a distributed PID-type dynamic matrix control method based on fractional-order systems is proposed. First, the high-order approximate model of integer order is obtained by utilising the Oustaloup method. Then, the step response model vectors of the plant is obtained on the basis of the high-order model, and the online optimisation for multivariable processes is transformed into the optimisation of each small-scale subsystem that is regarded as a sub-plant controlled in the distributed framework. Furthermore, the PID operator is introduced into the performance index of each subsystem and the fractional-order PID-type dynamic matrix controller is designed based on Nash optimisation strategy. The information exchange among the subsystems is realised through the distributed control structure so as to complete the optimisation task of the whole large-scale system. Finally, the control performance of the designed controller in this paper is verified by an example.

An efficient blocking M2L translation for low-frequency fast multipole method in three dimensions

NASA Astrophysics Data System (ADS)

Takahashi, Toru; Shimba, Yuta; Isakari, Hiroshi; Matsumoto, Toshiro

2016-05-01

We propose an efficient scheme to perform the multipole-to-local (M2L) translation in the three-dimensional low-frequency fast multipole method (LFFMM). Our strategy is to combine a group of matrix-vector products associated with M2L translation into a matrix-matrix product in order to diminish the memory traffic. For this purpose, we first developed a grouping method (termed as internal blocking) based on the congruent transformations (rotational and reflectional symmetries) of M2L-translators for each target box in the FMM hierarchy (adaptive octree). Next, we considered another method of grouping (termed as external blocking) that was able to handle M2L translations for multiple target boxes collectively by using the translational invariance of the M2L translation. By combining these internal and external blockings, the M2L translation can be performed efficiently whilst preservingthe numerical accuracy exactly. We assessed the proposed blocking scheme numerically and applied it to the boundary integral equation method to solve electromagnetic scattering problems for perfectly electrical conductor. From the numerical results, it was found that the proposed M2L scheme achieved a few times speedup compared to the non-blocking scheme.

Removal of envelope protein-free retroviral vectors by anion-exchange chromatography to improve product quality.

PubMed

Rodrigues, Teresa; Alves, Ana; Lopes, António; Carrondo, Manuel J T; Alves, Paula M; Cruz, Pedro E

2008-10-01

We have investigated the role of the retroviral lipid bilayer and envelope proteins in the adsorption of retroviral vectors (RVs) to a Fractogel DEAE matrix. Intact RVs and their degradation components (envelope protein-free vectors and solubilized vector components) were adsorbed to this matrix and eluted using a linear gradient. Envelope protein-free RVs (Env(-)) and soluble envelope proteins (gp70) eluted in a significantly lower range of conductivities than intact RVs (Env(+)) (13.7-30 mS/cm for Env(-) and gp70 proteins vs. 47-80 mS/cm for Env(+)). The zeta (zeta)-potential of Env(+) and Env(-) vectors was evaluated showing that envelope proteins define the pI of the viral particles (pI (Env(+)) < 2 versus 3 < pI (Env(-)) < 4) and that Env(+) and Env(-) vectors have similar zeta-potentials within pH 5 and 8. The results presented herein indicate that the adsorption of retroviral particles occurs through multi-point interaction of the envelope proteins with the cationic groups on the chromatographic matrix. The strength of this adsorption is thus dependent on the amount of envelope protein present in the viral lipid bilayer. In conclusion, AEXc enables the separation of gp70 proteins as well as envelope protein-free vectors constituting a significant improvement to the quality of retroviral preparations for gene therapy applications.

Optimization of the Brillouin operator on the KNL architecture

NASA Astrophysics Data System (ADS)

Dürr, Stephan

2018-03-01

Experiences with optimizing the matrix-times-vector application of the Brillouin operator on the Intel KNL processor are reported. Without adjustments to the memory layout, performance figures of 360 Gflop/s in single and 270 Gflop/s in double precision are observed. This is with Nc = 3 colors, Nv = 12 right-hand-sides, Nthr = 256 threads, on lattices of size 323 × 64, using exclusively OMP pragmas. Interestingly, the same routine performs quite well on Intel Core i7 architectures, too. Some observations on the much harderWilson fermion matrix-times-vector optimization problem are added.

Optical laboratory solution and error model simulation of a linear time-varying finite element equation

NASA Technical Reports Server (NTRS)

Taylor, B. K.; Casasent, D. P.

1989-01-01

The use of simplified error models to accurately simulate and evaluate the performance of an optical linear-algebra processor is described. The optical architecture used to perform banded matrix-vector products is reviewed, along with a linear dynamic finite-element case study. The laboratory hardware and ac-modulation technique used are presented. The individual processor error-source models and their simulator implementation are detailed. Several significant simplifications are introduced to ease the computational requirements and complexity of the simulations. The error models are verified with a laboratory implementation of the processor, and are used to evaluate its potential performance.

Cost Study of Educational Media Systems and Their Equipment Components. Volume II, Technical Report. Final Report.

ERIC Educational Resources Information Center

General Learning Corp., Washington, DC.

A common instructional task and a set of educational environments are hypothesized for analysis of media cost data. The analytic structure may be conceptulized as a three-dimensional matrix: the first vector separates costs into production, distribution, and reception; the second vector delineates capital (initial) and operating (annual) costs;…

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

PubMed

Mozrzymas, Anna

2011-12-14

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

Speeding Up Non-Parametric Bootstrap Computations for Statistics Based on Sample Moments in Small/Moderate Sample Size Applications

PubMed Central

Chaibub Neto, Elias

2015-01-01

In this paper we propose a vectorized implementation of the non-parametric bootstrap for statistics based on sample moments. Basically, we adopt the multinomial sampling formulation of the non-parametric bootstrap, and compute bootstrap replications of sample moment statistics by simply weighting the observed data according to multinomial counts instead of evaluating the statistic on a resampled version of the observed data. Using this formulation we can generate a matrix of bootstrap weights and compute the entire vector of bootstrap replications with a few matrix multiplications. Vectorization is particularly important for matrix-oriented programming languages such as R, where matrix/vector calculations tend to be faster than scalar operations implemented in a loop. We illustrate the application of the vectorized implementation in real and simulated data sets, when bootstrapping Pearson’s sample correlation coefficient, and compared its performance against two state-of-the-art R implementations of the non-parametric bootstrap, as well as a straightforward one based on a for loop. Our investigations spanned varying sample sizes and number of bootstrap replications. The vectorized bootstrap compared favorably against the state-of-the-art implementations in all cases tested, and was remarkably/considerably faster for small/moderate sample sizes. The same results were observed in the comparison with the straightforward implementation, except for large sample sizes, where the vectorized bootstrap was slightly slower than the straightforward implementation due to increased time expenditures in the generation of weight matrices via multinomial sampling. PMID:26125965

Some Correlation Functions in Matrix Product Ground States of One-Dimensional Two-State Chains

NASA Astrophysics Data System (ADS)

Shariati, Ahmad; Aghamohammadi, Amir; Fatollahi, Amir H.; Khorrami, Mohammad

2014-04-01

Consider one-dimensional chains with nearest neighbour interactions, for which to each site correspond two independent states (say up and down), and the ground state is a matrix product state. It has been shown [23] that for such systems, the ground states are linear combinations of specific vectors which are essentially direct products of specific numbers of ups and downs, symmetrized in a generalized manner. By a generalized manner, it is meant that the coefficient corresponding to the interchange of states of two sites, in not necessarily plus one or minus one, but a phase which depends on the Hamiltonian and the position of the two sites. Such vectors are characterized by a phase χ, the N-th power of which is one (where N is the number of sites), and an integer. Corresponding to χ, there is another integer M which is the smallest positive integer that χM is one. Two classes of correlation functions for such systems (basically correlation functions for such vectors) are calculated. The first class consists of correlation functions of tensor products of one-site diagonal observables; the second class consists of correlation functions of tensor products of less than M one-site observables (but not necessarily diagonal).

Efficient solution of parabolic equations by Krylov approximation methods

NASA Technical Reports Server (NTRS)

Gallopoulos, E.; Saad, Y.

1990-01-01

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Nucleon matrix elements with Nf=2+1+1 maximally twisted fermions

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

Simon Dinter, Constantia Alexandrou, Martha Constantinou, Vincent Drach, Karl Jansen, Dru Renner

2010-06-01

We present the first lattice calculation of nucleon matrix elements using four dynamical flavors. We use the Nf=2+1+1 maximally twisted mass formulation. The renormalization is performed non-perturbatively in the RI'-MOM scheme and results are given for the vector and axial vector operators with up to one-derivative. Our calculation of the average momentum of the unpolarized non-singlet parton distribution is presented and compared to our previous results obtained from the Nf=2 case.

Automatic Overset Grid Generation with Heuristic Feedback Control

NASA Technical Reports Server (NTRS)

Robinson, Peter I.

2001-01-01

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

Solution of nonlinear time-dependent PDEs through componentwise approximation of matrix functions

NASA Astrophysics Data System (ADS)

Cibotarica, Alexandru; Lambers, James V.; Palchak, Elisabeth M.

2016-09-01

Exponential propagation iterative (EPI) methods provide an efficient approach to the solution of large stiff systems of ODEs, compared to standard integrators. However, the bulk of the computational effort in these methods is due to products of matrix functions and vectors, which can become very costly at high resolution due to an increase in the number of Krylov projection steps needed to maintain accuracy. In this paper, it is proposed to modify EPI methods by using Krylov subspace spectral (KSS) methods, instead of standard Krylov projection methods, to compute products of matrix functions and vectors. Numerical experiments demonstrate that this modification causes the number of Krylov projection steps to become bounded independently of the grid size, thus dramatically improving efficiency and scalability. As a result, for each test problem featured, as the total number of grid points increases, the growth in computation time is just below linear, while other methods achieved this only on selected test problems or not at all.

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

NASA Technical Reports Server (NTRS)

Larson, J. W.; Guo, J.; Lyster, P. M.

1999-01-01

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational reproducibility is well known in the parallel computing community. It is a requirement that the parallel code perform calculations in a fashion that will yield identical results on different configurations of processing elements on the same platform. In some cases this problem can be solved by sacrificing performance. Meeting this requirement and still achieving high performance is very difficult. Topics to be discussed include: current PSAS design and parallelization strategy; reproducibility issues; load balance vs. database memory demands, possible solutions to these problems.

Effective implementation of wavelet Galerkin method

NASA Astrophysics Data System (ADS)

Finěk, Václav; Šimunková, Martina

2012-11-01

It was proved by W. Dahmen et al. that an adaptive wavelet scheme is asymptotically optimal for a wide class of elliptic equations. This scheme approximates the solution u by a linear combination of N wavelets and a benchmark for its performance is the best N-term approximation, which is obtained by retaining the N largest wavelet coefficients of the unknown solution. Moreover, the number of arithmetic operations needed to compute the approximate solution is proportional to N. The most time consuming part of this scheme is the approximate matrix-vector multiplication. In this contribution, we will introduce our implementation of wavelet Galerkin method for Poisson equation -Δu = f on hypercube with homogeneous Dirichlet boundary conditions. In our implementation, we identified nonzero elements of stiffness matrix corresponding to the above problem and we perform matrix-vector multiplication only with these nonzero elements.

Brief announcement: Hypergraph parititioning for parallel sparse matrix-matrix multiplication

DOE PAGES

Ballard, Grey; Druinsky, Alex; Knight, Nicholas; ...

2015-01-01

The performance of parallel algorithms for sparse matrix-matrix multiplication is typically determined by the amount of interprocessor communication performed, which in turn depends on the nonzero structure of the input matrices. In this paper, we characterize the communication cost of a sparse matrix-matrix multiplication algorithm in terms of the size of a cut of an associated hypergraph that encodes the computation for a given input nonzero structure. Obtaining an optimal algorithm corresponds to solving a hypergraph partitioning problem. Furthermore, our hypergraph model generalizes several existing models for sparse matrix-vector multiplication, and we can leverage hypergraph partitioners developed for that computationmore » to improve application-specific algorithms for multiplying sparse matrices.« less

Lanczos eigensolution method for high-performance computers

NASA Technical Reports Server (NTRS)

Bostic, Susan W.

1991-01-01

The theory, computational analysis, and applications are presented of a Lanczos algorithm on high performance computers. The computationally intensive steps of the algorithm are identified as: the matrix factorization, the forward/backward equation solution, and the matrix vector multiples. These computational steps are optimized to exploit the vector and parallel capabilities of high performance computers. The savings in computational time from applying optimization techniques such as: variable band and sparse data storage and access, loop unrolling, use of local memory, and compiler directives are presented. Two large scale structural analysis applications are described: the buckling of a composite blade stiffened panel with a cutout, and the vibration analysis of a high speed civil transport. The sequential computational time for the panel problem executed on a CONVEX computer of 181.6 seconds was decreased to 14.1 seconds with the optimized vector algorithm. The best computational time of 23 seconds for the transport problem with 17,000 degs of freedom was on the the Cray-YMP using an average of 3.63 processors.

A multi-dimensional Smolyak collocation method in curvilinear coordinates for computing vibrational spectra

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

Avila, Gustavo, E-mail: Gustavo-Avila@telefonica.net; Carrington, Tucker, E-mail: Tucker.Carrington@queensu.ca

In this paper, we improve the collocation method for computing vibrational spectra that was presented in Avila and Carrington, Jr. [J. Chem. Phys. 139, 134114 (2013)]. Using an iterative eigensolver, energy levels and wavefunctions are determined from values of the potential on a Smolyak grid. The kinetic energy matrix-vector product is evaluated by transforming a vector labelled with (nondirect product) grid indices to a vector labelled by (nondirect product) basis indices. Both the transformation and application of the kinetic energy operator (KEO) scale favorably. Collocation facilitates dealing with complicated KEOs because it obviates the need to calculate integrals of coordinatemore » dependent coefficients of differential operators. The ideas are tested by computing energy levels of HONO using a KEO in bond coordinates.« less

HO2 rovibrational eigenvalue studies for nonzero angular momentum

NASA Astrophysics Data System (ADS)

Wu, Xudong T.; Hayes, Edward F.

1997-08-01

An efficient parallel algorithm is reported for determining all bound rovibrational energy levels for the HO2 molecule for nonzero angular momentum values, J=1, 2, and 3. Performance tests on the CRAY T3D indicate that the algorithm scales almost linearly when up to 128 processors are used. Sustained performance levels of up to 3.8 Gflops have been achieved using 128 processors for J=3. The algorithm uses a direct product discrete variable representation (DVR) basis and the implicitly restarted Lanczos method (IRLM) of Sorensen to compute the eigenvalues of the polyatomic Hamiltonian. Since the IRLM is an iterative method, it does not require storage of the full Hamiltonian matrix—it only requires the multiplication of the Hamiltonian matrix by a vector. When the IRLM is combined with a formulation such as DVR, which produces a very sparse matrix, both memory and computation times can be reduced dramatically. This algorithm has the potential to achieve even higher performance levels for larger values of the total angular momentum.

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

PubMed

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

2017-01-10

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

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

PubMed Central

2016-01-01

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

A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals.

PubMed

Soto-Quiros, Pablo

2015-01-01

This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT): the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, and implementation of parallel algorithms in multicore processors. In this work, an implementation and experimental investigation of the mathematical framework are performed using MATLAB with the Parallel Computing Toolbox. We found that there is advantage to use multicore processors and a parallel computing environment to minimize the high execution time. Additionally, speedup increases when the number of logical processors and length of the signal increase.

Quantum and electromagnetic propagation with the conjugate symmetric Lanczos method.

PubMed

Acevedo, Ramiro; Lombardini, Richard; Turner, Matthew A; Kinsey, James L; Johnson, Bruce R

2008-02-14

The conjugate symmetric Lanczos (CSL) method is introduced for the solution of the time-dependent Schrodinger equation. This remarkably simple and efficient time-domain algorithm is a low-order polynomial expansion of the quantum propagator for time-independent Hamiltonians and derives from the time-reversal symmetry of the Schrodinger equation. The CSL algorithm gives forward solutions by simply complex conjugating backward polynomial expansion coefficients. Interestingly, the expansion coefficients are the same for each uniform time step, a fact that is only spoiled by basis incompleteness and finite precision. This is true for the Krylov basis and, with further investigation, is also found to be true for the Lanczos basis, important for efficient orthogonal projection-based algorithms. The CSL method errors roughly track those of the short iterative Lanczos method while requiring fewer matrix-vector products than the Chebyshev method. With the CSL method, only a few vectors need to be stored at a time, there is no need to estimate the Hamiltonian spectral range, and only matrix-vector and vector-vector products are required. Applications using localized wavelet bases are made to harmonic oscillator and anharmonic Morse oscillator systems as well as electrodynamic pulse propagation using the Hamiltonian form of Maxwell's equations. For gold with a Drude dielectric function, the latter is non-Hermitian, requiring consideration of corrections to the CSL algorithm.

Method of assessing the state of a rolling bearing based on the relative compensation distance of multiple-domain features and locally linear embedding

NASA Astrophysics Data System (ADS)

Kang, Shouqiang; Ma, Danyang; Wang, Yujing; Lan, Chaofeng; Chen, Qingguo; Mikulovich, V. I.

2017-03-01

To effectively assess different fault locations and different degrees of performance degradation of a rolling bearing with a unified assessment index, a novel state assessment method based on the relative compensation distance of multiple-domain features and locally linear embedding is proposed. First, for a single-sample signal, time-domain and frequency-domain indexes can be calculated for the original vibration signal and each sensitive intrinsic mode function obtained by improved ensemble empirical mode decomposition, and the singular values of the sensitive intrinsic mode function matrix can be extracted by singular value decomposition to construct a high-dimensional hybrid-domain feature vector. Second, a feature matrix can be constructed by arranging each feature vector of multiple samples, the dimensions of each row vector of the feature matrix can be reduced by the locally linear embedding algorithm, and the compensation distance of each fault state of the rolling bearing can be calculated using the support vector machine. Finally, the relative distance between different fault locations and different degrees of performance degradation and the normal-state optimal classification surface can be compensated, and on the basis of the proposed relative compensation distance, the assessment model can be constructed and an assessment curve drawn. Experimental results show that the proposed method can effectively assess different fault locations and different degrees of performance degradation of the rolling bearing under certain conditions.

Portable implementation model for CFD simulations. Application to hybrid CPU/GPU supercomputers

NASA Astrophysics Data System (ADS)

Oyarzun, Guillermo; Borrell, Ricard; Gorobets, Andrey; Oliva, Assensi

2017-10-01

Nowadays, high performance computing (HPC) systems experience a disruptive moment with a variety of novel architectures and frameworks, without any clarity of which one is going to prevail. In this context, the portability of codes across different architectures is of major importance. This paper presents a portable implementation model based on an algebraic operational approach for direct numerical simulation (DNS) and large eddy simulation (LES) of incompressible turbulent flows using unstructured hybrid meshes. The strategy proposed consists in representing the whole time-integration algorithm using only three basic algebraic operations: sparse matrix-vector product, a linear combination of vectors and dot product. The main idea is based on decomposing the nonlinear operators into a concatenation of two SpMV operations. This provides high modularity and portability. An exhaustive analysis of the proposed implementation for hybrid CPU/GPU supercomputers has been conducted with tests using up to 128 GPUs. The main objective consists in understanding the challenges of implementing CFD codes on new architectures.

Implementation and Assessment of Advanced Analog Vector-Matrix Processor

NASA Technical Reports Server (NTRS)

Gary, Charles K.; Bualat, Maria G.; Lum, Henry, Jr. (Technical Monitor)

1994-01-01

This paper discusses the design and implementation of an analog optical vecto-rmatrix coprocessor with a throughput of 128 Mops for a personal computer. Vector matrix calculations are inherently parallel, providing a promising domain for the use of optical calculators. However, to date, digital optical systems have proven too cumbersome to replace electronics, and analog processors have not demonstrated sufficient accuracy in large scale systems. The goal of the work described in this paper is to demonstrate a viable optical coprocessor for linear operations. The analog optical processor presented has been integrated with a personal computer to provide full functionality and is the first demonstration of an optical linear algebra processor with a throughput greater than 100 Mops. The optical vector matrix processor consists of a laser diode source, an acoustooptical modulator array to input the vector information, a liquid crystal spatial light modulator to input the matrix information, an avalanche photodiode array to read out the result vector of the vector matrix multiplication, as well as transport optics and the electronics necessary to drive the optical modulators and interface to the computer. The intent of this research is to provide a low cost, highly energy efficient coprocessor for linear operations. Measurements of the analog accuracy of the processor performing 128 Mops are presented along with an assessment of the implications for future systems. A range of noise sources, including cross-talk, source amplitude fluctuations, shot noise at the detector, and non-linearities of the optoelectronic components are measured and compared to determine the most significant source of error. The possibilities for reducing these sources of error are discussed. Also, the total error is compared with that expected from a statistical analysis of the individual components and their relation to the vector-matrix operation. The sufficiency of the measured accuracy of the processor is compared with that required for a range of typical problems. Calculations resolving alloy concentrations from spectral plume data of rocket engines are implemented on the optical processor, demonstrating its sufficiency for this problem. We also show how this technology can be easily extended to a 100 x 100 10 MHz (200 Cops) processor.

Optical implementation of systolic array processing

NASA Technical Reports Server (NTRS)

Caulfield, H. J.; Rhodes, W. T.; Foster, M. J.; Horvitz, S.

1981-01-01

Algorithms for matrix vector multiplication are implemented using acousto-optic cells for multiplication and input data transfer and using charge coupled devices detector arrays for accumulation and output of the results. No two dimensional matrix mask is required; matrix changes are implemented electronically. A system for multiplying a 50 component nonnegative real vector by a 50 by 50 nonnegative real matrix is described. Modifications for bipolar real and complex valued processing are possible, as are extensions to matrix-matrix multiplication and multiplication of a vector by multiple matrices.

A sparse matrix-vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms

NASA Astrophysics Data System (ADS)

Ghale, Purnima; Johnson, Harley T.

2018-06-01

We present an efficient sparse matrix-vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev-Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix-matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in the sparse Hamiltonian H, the nonzero structure of intermediate estimates of P depends on products of H and evolves over the course of computation. On the other hand, an expansion of the density matrix P in terms of Chebyshev polynomials is straightforward and SpMV based; however, the resulting density matrix may not satisfy the required constraints exactly. In this paper, we analyze the strengths and weaknesses of the Chebyshev-Jackson polynomials and the second order spectral projection purification (SP2) method, and propose to combine them so that the accurate density matrix can be computed using the SpMV computational kernel only, and without having to store the density matrix P. Our method accomplishes these objectives by using the Chebyshev polynomial estimate as the initial guess for SP2, which is followed by using sparse matrix-vector multiplications (SpMVs) to replicate the behavior of the SP2 algorithm for purification. We demonstrate the method on a tight-binding model system of an oxide material containing more than 3 million atoms. In addition, we also present the predicted behavior of our method when applied to near-metallic Hamiltonians with a wide energy spectrum.

Solving large sparse eigenvalue problems on supercomputers

NASA Technical Reports Server (NTRS)

Philippe, Bernard; Saad, Youcef

1988-01-01

An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed.

Vector 33: A reduce program for vector algebra and calculus in orthogonal curvilinear coordinates

NASA Astrophysics Data System (ADS)

Harper, David

1989-06-01

This paper describes a package with enables REDUCE 3.3 to perform algebra and calculus operations upon vectors. Basic algebraic operations between vectors and between scalars and vectors are provided, including scalar (dot) product and vector (cross) product. The vector differential operators curl, divergence, gradient and Laplacian are also defined, and are valid in any orthogonal curvilinear coordinate system. The package is written in RLISP to allow algebra and calculus to be performed using notation identical to that for operations. Scalars and vectors can be mixed quite freely in the same expression. The package will be of interest to mathematicians, engineers and scientists who need to perform vector calculations in orthogonal curvilinear coordinates.

Probing the dark sector through mono-Z boson leptonic decays

NASA Astrophysics Data System (ADS)

Yang, Daneng; Li, Qiang

2018-02-01

Collider search for dark matter production has been performed over the years based on high p T standard model signatures balanced by large missing transverse energy. The mono-Z boson production with leptonic decay has a clean signature with the advantage that the decaying electrons and muons can be precisely measured. This signature not only enables reconstruction of the Z boson rest frame, but also makes possible recovery of the underlying production dynamics through the decaying lepton angular distribution. In this work, we exploit full information carried by the leptonic Z boson decays to set limits on coupling strength parameters of the dark sector. We study simplified dark sector models with scalar, vector, and tensor mediators and observe among them different signatures in the distribution of angular coefficients. Specifically, we show that angular coefficients can be used to distinguish different scenarios of the spin-0 and spin-1 models, including the ones with parity-odd and charge conjugation parity-odd operators. To maximize the statistical power, we perform a matrix element method study with a dynamic construction of event likelihood function. We parametrize the test statistic such that sensitivity from the matrix element is quantified through a term measuring the shape difference. Our results show that the shape differences provide significant improvements in the limits, especially for the scalar mediator models. We also present an example application of a matrix-element-kinematic-discriminator, an easier approach that is applicable for experimental data.

An intertwined method for making low-rank, sum-of-product basis functions that makes it possible to compute vibrational spectra of molecules with more than 10 atoms

PubMed Central

Thomas, Phillip S.

2017-01-01

We propose a method for solving the vibrational Schrödinger equation with which one can compute spectra for molecules with more than ten atoms. It uses sum-of-product (SOP) basis functions stored in a canonical polyadic tensor format and generated by evaluating matrix-vector products. By doing a sequence of partial optimizations, in each of which the factors in a SOP basis function for a single coordinate are optimized, the rank of the basis functions is reduced as matrix-vector products are computed. This is better than using an alternating least squares method to reduce the rank, as is done in the reduced-rank block power method. Partial optimization is better because it speeds up the calculation by about an order of magnitude and allows one to significantly reduce the memory cost. We demonstrate the effectiveness of the new method by computing vibrational spectra of two molecules, ethylene oxide (C2H4O) and cyclopentadiene (C5H6), with 7 and 11 atoms, respectively. PMID:28571348

An intertwined method for making low-rank, sum-of-product basis functions that makes it possible to compute vibrational spectra of molecules with more than 10 atoms.

PubMed

Thomas, Phillip S; Carrington, Tucker

2017-05-28

We propose a method for solving the vibrational Schrödinger equation with which one can compute spectra for molecules with more than ten atoms. It uses sum-of-product (SOP) basis functions stored in a canonical polyadic tensor format and generated by evaluating matrix-vector products. By doing a sequence of partial optimizations, in each of which the factors in a SOP basis function for a single coordinate are optimized, the rank of the basis functions is reduced as matrix-vector products are computed. This is better than using an alternating least squares method to reduce the rank, as is done in the reduced-rank block power method. Partial optimization is better because it speeds up the calculation by about an order of magnitude and allows one to significantly reduce the memory cost. We demonstrate the effectiveness of the new method by computing vibrational spectra of two molecules, ethylene oxide (C 2 H 4 O) and cyclopentadiene (C 5 H 6 ), with 7 and 11 atoms, respectively.

Efficient sparse matrix-matrix multiplication for computing periodic responses by shooting method on Intel Xeon Phi

NASA Astrophysics Data System (ADS)

Stoykov, S.; Atanassov, E.; Margenov, S.

2016-10-01

Many of the scientific applications involve sparse or dense matrix operations, such as solving linear systems, matrix-matrix products, eigensolvers, etc. In what concerns structural nonlinear dynamics, the computations of periodic responses and the determination of stability of the solution are of primary interest. Shooting method iswidely used for obtaining periodic responses of nonlinear systems. The method involves simultaneously operations with sparse and dense matrices. One of the computationally expensive operations in the method is multiplication of sparse by dense matrices. In the current work, a new algorithm for sparse matrix by dense matrix products is presented. The algorithm takes into account the structure of the sparse matrix, which is obtained by space discretization of the nonlinear Mindlin's plate equation of motion by the finite element method. The algorithm is developed to use the vector engine of Intel Xeon Phi coprocessors. It is compared with the standard sparse matrix by dense matrix algorithm and the one developed by Intel MKL and it is shown that by considering the properties of the sparse matrix better algorithms can be developed.

Spectral functions with the density matrix renormalization group: Krylov-space approach for correction vectors

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

None, None

Frequency-dependent correlations, such as the spectral function and the dynamical structure factor, help illustrate condensed matter experiments. Within the density matrix renormalization group (DMRG) framework, an accurate method for calculating spectral functions directly in frequency is the correction-vector method. The correction vector can be computed by solving a linear equation or by minimizing a functional. Our paper proposes an alternative to calculate the correction vector: to use the Krylov-space approach. This paper also studies the accuracy and performance of the Krylov-space approach, when applied to the Heisenberg, the t-J, and the Hubbard models. The cases we studied indicate that themore » Krylov-space approach can be more accurate and efficient than the conjugate gradient, and that the error of the former integrates best when a Krylov-space decomposition is also used for ground state DMRG.« less

Spectral functions with the density matrix renormalization group: Krylov-space approach for correction vectors

DOE PAGES

None, None

2016-11-21

Frequency-dependent correlations, such as the spectral function and the dynamical structure factor, help illustrate condensed matter experiments. Within the density matrix renormalization group (DMRG) framework, an accurate method for calculating spectral functions directly in frequency is the correction-vector method. The correction vector can be computed by solving a linear equation or by minimizing a functional. Our paper proposes an alternative to calculate the correction vector: to use the Krylov-space approach. This paper also studies the accuracy and performance of the Krylov-space approach, when applied to the Heisenberg, the t-J, and the Hubbard models. The cases we studied indicate that themore » Krylov-space approach can be more accurate and efficient than the conjugate gradient, and that the error of the former integrates best when a Krylov-space decomposition is also used for ground state DMRG.« less

An efficient numerical method for the solution of the problem of elasticity for 3D-homogeneous elastic medium with cracks and inclusions

NASA Astrophysics Data System (ADS)

Kanaun, S.; Markov, A.

2017-06-01

An efficient numerical method for solution of static problems of elasticity for an infinite homogeneous medium containing inhomogeneities (cracks and inclusions) is developed. Finite number of heterogeneous inclusions and planar parallel cracks of arbitrary shapes is considered. The problem is reduced to a system of surface integral equations for crack opening vectors and volume integral equations for stress tensors inside the inclusions. For the numerical solution of these equations, a class of Gaussian approximating functions is used. The method based on these functions is mesh free. For such functions, the elements of the matrix of the discretized system are combinations of explicit analytical functions and five standard 1D-integrals that can be tabulated. Thus, the numerical integration is excluded from the construction of the matrix of the discretized problem. For regular node grids, the matrix of the discretized system has Toeplitz's properties, and Fast Fourier Transform technique can be used for calculation matrix-vector products of such matrices.

Photon and vector meson exchanges in the production of light meson pairs and elementary atoms

NASA Astrophysics Data System (ADS)

Gevorkyan, S. R.; Kuraev, E. A.; Volkov, M. K.

2013-01-01

The production of pseudoscalar and scalar meson pairs ππ, ηη, η‧η‧, σσ as well as bound states in high energy γγ collisions are considered. The exchange by a vector particle in the binary process γ + γ → ha + hb with hadronic states ha, hb in fragmentation regions of the initial particle leads to nondecreasing cross sections with increasing energy, that is a priority of peripheral kinematics. Unlike the photon exchange the vector meson exchange needs a reggeization leading to fall with energy growth. Nevertheless, due to the peripheral kinematics beyond very forward production angles the vector meson exchanges dominate over all possible exchanges. The proposed approach allows one to express the matrix elements of the considered processes through impacting factors, which can be calculated in perturbation models like chiral perturbation theory (ChPT) or the Nambu-Jona-Lasinio (NJL) model. In particular cases the impact factors can be determined from relevant γγ sub-processes or the vector meson radiative decay width. The pionium atom production in the collisions of high energy electrons and pions with protons is considered and the relevant cross sections have been estimated.

Rotations with Rodrigues' Vector

ERIC Educational Resources Information Center

Pina, E.

2011-01-01

The rotational dynamics was studied from the point of view of Rodrigues' vector. This vector is defined here by its connection with other forms of parametrization of the rotation matrix. The rotation matrix was expressed in terms of this vector. The angular velocity was computed using the components of Rodrigues' vector as coordinates. It appears…

Flexible body stability analysis of Space Shuttle ascent flight control system by using lambda matrix solution techniques

NASA Technical Reports Server (NTRS)

Bown, R. L.; Christofferson, A.; Lardas, M.; Flanders, H.

1980-01-01

A lambda matrix solution technique is being developed to perform an open loop frequency analysis of a high order dynamic system. The procedure evaluates the right and left latent vectors corresponding to the respective latent roots. The latent vectors are used to evaluate the partial fraction expansion formulation required to compute the flexible body open loop feedback gains for the Space Shuttle Digital Ascent Flight Control System. The algorithm is in the final stages of development and will be used to insure that the feedback gains meet the design specification.

Energy Dissipation of Rayleigh Waves due to Absorption Along the Path by the Use of Finite Element Method

DTIC Science & Technology

1979-07-31

3 x 3 t Strain vector a ij,j Space derivative of the stress tensor Fi Force vector per unit volume o Density x CHAPTER III F Total force K Stiffness...matrix 6Vector displacements M Mass matrix B Space operating matrix DO Matrix moduli 2 x 3 DZ Operating matrix in Z direction N Matrix of shape...dissipating medium the deformation of a solid is a function of time, temperature and space . Creep phenomenon is a deformation process in which there is

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

NASA Technical Reports Server (NTRS)

Habiby, Sarry F.

1987-01-01

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

A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity

NASA Astrophysics Data System (ADS)

Mercier, Sylvain; Gratton, Serge; Tardieu, Nicolas; Vasseur, Xavier

2017-12-01

Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.

An efficient sparse matrix multiplication scheme for the CYBER 205 computer

NASA Technical Reports Server (NTRS)

Lambiotte, Jules J., Jr.

1988-01-01

This paper describes the development of an efficient algorithm for computing the product of a matrix and vector on a CYBER 205 vector computer. The desire to provide software which allows the user to choose between the often conflicting goals of minimizing central processing unit (CPU) time or storage requirements has led to a diagonal-based algorithm in which one of four types of storage is selected for each diagonal. The candidate storage types employed were chosen to be efficient on the CYBER 205 for diagonals which have nonzero structure which is dense, moderately sparse, very sparse and short, or very sparse and long; however, for many densities, no diagonal type is most efficient with respect to both resource requirements, and a trade-off must be made. For each diagonal, an initialization subroutine estimates the CPU time and storage required for each storage type based on results from previously performed numerical experimentation. These requirements are adjusted by weights provided by the user which reflect the relative importance the user places on the two resources. The adjusted resource requirements are then compared to select the most efficient storage and computational scheme.

Quantum Search in Hilbert Space

NASA Technical Reports Server (NTRS)

Zak, Michail

2003-01-01

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Econo-ESA in semantic text similarity.

PubMed

Rahutomo, Faisal; Aritsugi, Masayoshi

2014-01-01

Explicit semantic analysis (ESA) utilizes an immense Wikipedia index matrix in its interpreter part. This part of the analysis multiplies a large matrix by a term vector to produce a high-dimensional concept vector. A similarity measurement between two texts is performed between two concept vectors with numerous dimensions. The cost is expensive in both interpretation and similarity measurement steps. This paper proposes an economic scheme of ESA, named econo-ESA. We investigate two aspects of this proposal: dimensional reduction and experiments with various data. We use eight recycling test collections in semantic text similarity. The experimental results show that both the dimensional reduction and test collection characteristics can influence the results. They also show that an appropriate concept reduction of econo-ESA can decrease the cost with minor differences in the results from the original ESA.

Fuzzy Relational Compression Applied on Feature Vectors for Infant Cry Recognition

NASA Astrophysics Data System (ADS)

Reyes-Galaviz, Orion Fausto; Reyes-García, Carlos Alberto

Data compression is always advisable when it comes to handling and processing information quickly and efficiently. There are two main problems that need to be solved when it comes to handling data; store information in smaller spaces and processes it in the shortest possible time. When it comes to infant cry analysis (ICA), there is always the need to construct large sound repositories from crying babies. Samples that have to be analyzed and be used to train and test pattern recognition algorithms; making this a time consuming task when working with uncompressed feature vectors. In this work, we show a simple, but efficient, method that uses Fuzzy Relational Product (FRP) to compresses the information inside a feature vector, building with this a compressed matrix that will help us recognize two kinds of pathologies in infants; Asphyxia and Deafness. We describe the sound analysis, which consists on the extraction of Mel Frequency Cepstral Coefficients that generate vectors which will later be compressed by using FRP. There is also a description of the infant cry database used in this work, along with the training and testing of a Time Delay Neural Network with the compressed features, which shows a performance of 96.44% with our proposed feature vector compression.

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

PubMed

Sawamura, Jitsuki; Morishita, Shigeru; Ishigooka, Jun

2016-02-09

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

Research on Extrusion of Rubber Composites Reinforced by Short Fibers Orientation Based on FEA

NASA Astrophysics Data System (ADS)

Zhang, Dewei; Wang, Chuansheng; Shen, Bo; Li, Shaoming; Bian, Huiguang

2018-06-01

In recent years, rubber composites reinforced by short fibers has been researched deeply, because of its good performances such as higher wear resistance, higher cut resistance and so on. Some research results indicated that if short fibers get orientation in rubber composites, the performances of rubber products could be promoted greatly. But how to make short fibers get orientation in rubber matrix during extrusion is still a real problem. And there are many parameters affect the short fibers orientation. So, in this paper, the effects of die structure including expansion-die and dam-expansion-die on extrusion flow field of short fiber and rubber composite material during extrusion process has been researched by Polyflow. And the FEA results about the pressure field, velocity field and the velocity vector of the rubber composites flow field indicate that, comparing with expansion-die and the dam-expansion-die, the latter one is better for the extrusion process of rubber composites and making short fibers get radial orientation in rubber matrix.

Amino acid "little Big Bang": representing amino acid substitution matrices as dot products of Euclidian vectors.

PubMed

Zimmermann, Karel; Gibrat, Jean-François

2010-01-04

Sequence comparisons make use of a one-letter representation for amino acids, the necessary quantitative information being supplied by the substitution matrices. This paper deals with the problem of finding a representation that provides a comprehensive description of amino acid intrinsic properties consistent with the substitution matrices. We present a Euclidian vector representation of the amino acids, obtained by the singular value decomposition of the substitution matrices. The substitution matrix entries correspond to the dot product of amino acid vectors. We apply this vector encoding to the study of the relative importance of various amino acid physicochemical properties upon the substitution matrices. We also characterize and compare the PAM and BLOSUM series substitution matrices. This vector encoding introduces a Euclidian metric in the amino acid space, consistent with substitution matrices. Such a numerical description of the amino acid is useful when intrinsic properties of amino acids are necessary, for instance, building sequence profiles or finding consensus sequences, using machine learning algorithms such as Support Vector Machine and Neural Networks algorithms.

Hybrid state vector methods for structural dynamic and aeroelastic boundary value problems

NASA Technical Reports Server (NTRS)

Lehman, L. L.

1982-01-01

A computational technique is developed that is suitable for performing preliminary design aeroelastic and structural dynamic analyses of large aspect ratio lifting surfaces. The method proves to be quite general and can be adapted to solving various two point boundary value problems. The solution method, which is applicable to both fixed and rotating wing configurations, is based upon a formulation of the structural equilibrium equations in terms of a hybrid state vector containing generalized force and displacement variables. A mixed variational formulation is presented that conveniently yields a useful form for these state vector differential equations. Solutions to these equations are obtained by employing an integrating matrix method. The application of an integrating matrix provides a discretization of the differential equations that only requires solutions of standard linear matrix systems. It is demonstrated that matrix partitioning can be used to reduce the order of the required solutions. Results are presented for several example problems in structural dynamics and aeroelasticity to verify the technique and to demonstrate its use. These problems examine various types of loading and boundary conditions and include aeroelastic analyses of lifting surfaces constructed from anisotropic composite materials.

Implementation of hierarchical clustering using k-mer sparse matrix to analyze MERS-CoV genetic relationship

NASA Astrophysics Data System (ADS)

Bustamam, A.; Ulul, E. D.; Hura, H. F. A.; Siswantining, T.

2017-07-01

Hierarchical clustering is one of effective methods in creating a phylogenetic tree based on the distance matrix between DNA (deoxyribonucleic acid) sequences. One of the well-known methods to calculate the distance matrix is k-mer method. Generally, k-mer is more efficient than some distance matrix calculation techniques. The steps of k-mer method are started from creating k-mer sparse matrix, and followed by creating k-mer singular value vectors. The last step is computing the distance amongst vectors. In this paper, we analyze the sequences of MERS-CoV (Middle East Respiratory Syndrome - Coronavirus) DNA by implementing hierarchical clustering using k-mer sparse matrix in order to perform the phylogenetic analysis. Our results show that the ancestor of our MERS-CoV is coming from Egypt. Moreover, we found that the MERS-CoV infection that occurs in one country may not necessarily come from the same country of origin. This suggests that the process of MERS-CoV mutation might not only be influenced by geographical factor.

Application of the Backward-Smoothing Extended Kalman Filter to Attitude Estimation and Prediction using Radar Observations

DTIC Science & Technology

2009-06-01

projection, the measurement matrix is of rank 3. This is known as the rank theorem and enables the matrix Y to be factored into the product of two...Interface 270 6.5.5. Bistatic Radar Measurements 271 6.5.6. Computer Aided Image-Model Matching 273 8 6.5.7. Tomasi-Kanade Factorization Method...the vectors of an orthonormal basis satisfy the following scalar- product relations (2 p. 239): = i. ir = n (2.1) i-j = i-k j-k 0 i-i= j • j = k-k

A feedforward artificial neural network based on quantum effect vector-matrix multipliers.

PubMed

Levy, H J; McGill, T C

1993-01-01

The vector-matrix multiplier is the engine of many artificial neural network implementations because it can simulate the way in which neurons collect weighted input signals from a dendritic arbor. A new technology for building analog weighting elements that is theoretically capable of densities and speeds far beyond anything that conventional VLSI in silicon could ever offer is presented. To illustrate the feasibility of such a technology, a small three-layer feedforward prototype network with five binary neurons and six tri-state synapses was built and used to perform all of the fundamental logic functions: XOR, AND, OR, and NOT.

Hypergraph partitioning implementation for parallelizing matrix-vector multiplication using CUDA GPU-based parallel computing

NASA Astrophysics Data System (ADS)

Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.

2017-07-01

Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).

Generalized sidelobe canceller beamforming method for ultrasound imaging.

PubMed

Wang, Ping; Li, Na; Luo, Han-Wu; Zhu, Yong-Kun; Cui, Shi-Gang

2017-03-01

A modified generalized sidelobe canceller (IGSC) algorithm is proposed to enhance the resolution and robustness against the noise of the traditional generalized sidelobe canceller (GSC) and coherence factor combined method (GSC-CF). In the GSC algorithm, weighting vector is divided into adaptive and non-adaptive parts, while the non-adaptive part does not block all the desired signal. A modified steer vector of the IGSC algorithm is generated by the projection of the non-adaptive vector on the signal space constructed by the covariance matrix of received data. The blocking matrix is generated based on the orthogonal complementary space of the modified steer vector and the weighting vector is updated subsequently. The performance of IGSC was investigated by simulations and experiments. Through simulations, IGSC outperformed GSC-CF in terms of spatial resolution by 0.1 mm regardless there is noise or not, as well as the contrast ratio respect. The proposed IGSC can be further improved by combining with CF. The experimental results also validated the effectiveness of the proposed algorithm with dataset provided by the University of Michigan.

Singular value description of a digital radiographic detector: Theory and measurements

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

Kyprianou, Iacovos S.; Badano, Aldo; Gallas, Brandon D.

The H operator represents the deterministic performance of any imaging system. For a linear, digital imaging system, this system operator can be written in terms of a matrix, H, that describes the deterministic response of the system to a set of point objects. A singular value decomposition of this matrix results in a set of orthogonal functions (singular vectors) that form the system basis. A linear combination of these vectors completely describes the transfer of objects through the linear system, where the respective singular values associated with each singular vector describe the magnitude with which that contribution to the objectmore » is transferred through the system. This paper is focused on the measurement, analysis, and interpretation of the H matrix for digital x-ray detectors. A key ingredient in the measurement of the H matrix is the detector response to a single x ray (or infinitestimal x-ray beam). The authors have developed a method to estimate the 2D detector shift-variant, asymmetric ray response function (RRF) from multiple measured line response functions (LRFs) using a modified edge technique. The RRF measurements cover a range of x-ray incident angles from 0 deg. (equivalent location at the detector center) to 30 deg. (equivalent location at the detector edge) for a standard radiographic or cone-beam CT geometric setup. To demonstrate the method, three beam qualities were tested using the inherent, Lu/Er, and Yb beam filtration. The authors show that measures using the LRF, derived from an edge measurement, underestimate the system's performance when compared with the H matrix derived using the RRF. Furthermore, the authors show that edge measurements must be performed at multiple directions in order to capture rotational asymmetries of the RRF. The authors interpret the results of the H matrix SVD and provide correlations with the familiar MTF methodology. Discussion is made about the benefits of the H matrix technique with regards to signal detection theory, and the characterization of shift-variant imaging systems.« less

Gain in computational efficiency by vectorization in the dynamic simulation of multi-body systems

NASA Technical Reports Server (NTRS)

Amirouche, F. M. L.; Shareef, N. H.

1991-01-01

An improved technique for the identification and extraction of the exact quantities associated with the degrees of freedom at the element as well as the flexible body level is presented. It is implemented in the dynamic equations of motions based on the recursive formulation of Kane et al. (1987) and presented in a matrix form, integrating the concepts of strain energy, the finite-element approach, modal analysis, and reduction of equations. This technique eliminates the CPU intensive matrix multiplication operations in the code's hot spots for the dynamic simulation of the interconnected rigid and flexible bodies. A study of a simple robot with flexible links is presented by comparing the execution times on a scalar machine and a vector-processor with and without vector options. Performance figures demonstrating the substantial gains achieved by the technique are plotted.

Efficient diagonalization of the sparse matrices produced within the framework of the UK R-matrix molecular codes

NASA Astrophysics Data System (ADS)

Galiatsatos, P. G.; Tennyson, J.

2012-11-01

The most time consuming step within the framework of the UK R-matrix molecular codes is that of the diagonalization of the inner region Hamiltonian matrix (IRHM). Here we present the method that we follow to speed up this step. We use shared memory machines (SMM), distributed memory machines (DMM), the OpenMP directive based parallel language, the MPI function based parallel language, the sparse matrix diagonalizers ARPACK and PARPACK, a variation for real symmetric matrices of the official coordinate sparse matrix format and finally a parallel sparse matrix-vector product (PSMV). The efficient application of the previous techniques rely on two important facts: the sparsity of the matrix is large enough (more than 98%) and in order to get back converged results we need a small only part of the matrix spectrum.

An iterative technique to stabilize a linear time invariant multivariable system with output feedback

NASA Technical Reports Server (NTRS)

Sankaran, V.

1974-01-01

An iterative procedure for determining the constant gain matrix that will stabilize a linear constant multivariable system using output feedback is described. The use of this procedure avoids the transformation of variables which is required in other procedures. For the case in which the product of the output and input vector dimensions is greater than the number of states of the plant, general solution is given. In the case in which the states exceed the product of input and output vector dimensions, a least square solution which may not be stable in all cases is presented. The results are illustrated with examples.

Detection Performance of Horizontal Linear Hydrophone Arrays in Shallow Water.

DTIC Science & Technology

1980-12-15

random phase G gain G angle interval covariance matrix h processor vector H matrix matched filter; generalized beamformer I unity matrix 4 SACLANTCEN SR...omnidirectional sensor is h*Ph P G = - h [Eq. 47] G = h* Q h P s The following two sections evaluate a few examples of application of the OLP. Following the...At broadside the signal covariance matrix reduces to a dyadic: P 󈧬 s s*;therefore, the gain (e.g. Eq. 37) becomes tr(H* P H) Pn * -1 Q -1 Pn G ~OQp

Multi-color incomplete Cholesky conjugate gradient methods for vector computers. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Poole, E. L.

1986-01-01

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Low-memory iterative density fitting.

PubMed

Grajciar, Lukáš

2015-07-30

A new low-memory modification of the density fitting approximation based on a combination of a continuous fast multipole method (CFMM) and a preconditioned conjugate gradient solver is presented. Iterative conjugate gradient solver uses preconditioners formed from blocks of the Coulomb metric matrix that decrease the number of iterations needed for convergence by up to one order of magnitude. The matrix-vector products needed within the iterative algorithm are calculated using CFMM, which evaluates them with the linear scaling memory requirements only. Compared with the standard density fitting implementation, up to 15-fold reduction of the memory requirements is achieved for the most efficient preconditioner at a cost of only 25% increase in computational time. The potential of the method is demonstrated by performing density functional theory calculations for zeolite fragment with 2592 atoms and 121,248 auxiliary basis functions on a single 12-core CPU workstation. © 2015 Wiley Periodicals, Inc.

Geometry of matrix product states: Metric, parallel transport, and curvature

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

Haegeman, Jutho, E-mail: jutho.haegeman@gmail.com; Verstraete, Frank; Faculty of Physics and Astronomy, University of Ghent, Krijgslaan 281 S9, 9000 Gent

2014-02-15

We study the geometric properties of the manifold of states described as (uniform) matrix product states. Due to the parameter redundancy in the matrix product state representation, matrix product states have the mathematical structure of a (principal) fiber bundle. The total space or bundle space corresponds to the parameter space, i.e., the space of tensors associated to every physical site. The base manifold is embedded in Hilbert space and can be given the structure of a Kähler manifold by inducing the Hilbert space metric. Our main interest is in the states living in the tangent space to the base manifold,more » which have recently been shown to be interesting in relation to time dependence and elementary excitations. By lifting these tangent vectors to the (tangent space) of the bundle space using a well-chosen prescription (a principal bundle connection), we can define and efficiently compute an inverse metric, and introduce differential geometric concepts such as parallel transport (related to the Levi-Civita connection) and the Riemann curvature tensor.« less

An Improved TA-SVM Method Without Matrix Inversion and Its Fast Implementation for Nonstationary Datasets.

PubMed

Shi, Yingzhong; Chung, Fu-Lai; Wang, Shitong

2015-09-01

Recently, a time-adaptive support vector machine (TA-SVM) is proposed for handling nonstationary datasets. While attractive performance has been reported and the new classifier is distinctive in simultaneously solving several SVM subclassifiers locally and globally by using an elegant SVM formulation in an alternative kernel space, the coupling of subclassifiers brings in the computation of matrix inversion, thus resulting to suffer from high computational burden in large nonstationary dataset applications. To overcome this shortcoming, an improved TA-SVM (ITA-SVM) is proposed using a common vector shared by all the SVM subclassifiers involved. ITA-SVM not only keeps an SVM formulation, but also avoids the computation of matrix inversion. Thus, we can realize its fast version, that is, improved time-adaptive core vector machine (ITA-CVM) for large nonstationary datasets by using the CVM technique. ITA-CVM has the merit of asymptotic linear time complexity for large nonstationary datasets as well as inherits the advantage of TA-SVM. The effectiveness of the proposed classifiers ITA-SVM and ITA-CVM is also experimentally confirmed.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

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

Poole, E.L.

1986-01-01

This research is concerned with the solution on vector computers of linear systems of equations. Ax = b, where A is a large, sparse symmetric positive definite matrix with non-zero elements lying only along a few diagonals of the matrix. The system is solved using the incomplete Cholesky conjugate gradient method (ICCG). Multi-color orderings are used of the unknowns in the linear system to obtain p-color matrices for which a no-fill block ICCG method is implemented on the CYBER 205 with O(N/p) length vector operations in both the decomposition of A and, more importantly, in the forward and back solvesmore » necessary at each iteration of the method. (N is the number of unknowns and p is a small constant). A p-colored matrix is a matrix that can be partitioned into a p x p block matrix where the diagonal blocks are diagonal matrices. The matrix is stored by diagonals and matrix multiplication by diagonals is used to carry out the decomposition of A and the forward and back solves. Additionally, if the vectors across adjacent blocks line up, then some of the overhead associated with vector startups can be eliminated in the matrix vector multiplication necessary at each conjugate gradient iteration. Necessary and sufficient conditions are given to determine which multi-color orderings of the unknowns correspond to p-color matrices, and a process is indicated for choosing multi-color orderings.« less

Intersection of Three Planes Revisited--An Algebraic Approach

ERIC Educational Resources Information Center

Trenkler, Götz; Trenkler, Dietrich

2017-01-01

Given three planes in space, a complete characterization of their intersection is provided. Special attention is paid to the case when the intersection set does not exist of one point only. Besides the vector cross product, the tool of generalized inverse of a matrix is used extensively.

Mapping the Conjugate Gradient Algorithm onto High Performance Heterogeneous Computers

DTIC Science & Technology

2014-05-01

Matrix Storage Formats According to J . Dongarra (Dongerra 2000), the efficiency of most iterative methods, such as CG, can be attributed to the...valh = aij) ⇒ (colh = j ). The ptr integer vector is of length n + 1 and contains the index in val where each matrix row starts. For example, the...first nonzero element of matrix rowm is found at index ptrm of val. By convention, ptrn+1 ≡ nz + 1. Notice that (aij) ⇒ (ptri ≤ j < ptri+1) for all i. An

HQE parameters from unquenched lattice data on pseudoscalar and vector heavy-light meson masses

NASA Astrophysics Data System (ADS)

Gambino, Paolo; Melis, Aurora; Simula, Silvano

2018-03-01

We present a new lattice determination of some of the parameters appearing both in the Operator Product Expansion (OPE) analysis of the inclusive semileptonic B-meson decays and in the Heavy Quark Expansion (HQE) of the pseudoscalar (PS) and vector (V) heavy-light meson masses. We perform a lattice QCD (LQCD) computation of PS and V heavy-light meson masses for heavy-quark masses mh in the range from mcphys to ≃ 4mbphys. We employed the Nf = 2 + 1 + 1 gauge configurations of the European Twisted Mass Collaboration (ETMC) at three values of the lattice spacing a ≃ (0.062,0.082,0.089) fm with pion masses in the range Mπ ≃ (210 - 450) MeV. The heavy-quark mass is simulated directly on the lattice up to ≃ 3mcphys. The interpolation to the physical mbphys is performed using the ETMC ratio method and adopting the kinetic mass scheme. We obtain mbkin (1 GeV) = 4.61(20) GeV (m̅b(m̅b) = 4.26(18) GeV in the MS scheme). The lattice data are analyzed in terms of the HQE and the matrix elements of dimension-4 and dimension-5 operators are extracted with good precision, namely: Λ¯ = 0.552(26) GeV, μπ2 = 0.321(32) GeV2 and μG2(mb) = 0.253(25)GeV2. The data also allow for an estimate of the dimension-6 operator matrix elements.

Forces Associated with Nonlinear Nonholonomic Constraint Equations

NASA Technical Reports Server (NTRS)

Roithmayr, Carlos M.; Hodges, Dewey H.

2010-01-01

A concise method has been formulated for identifying a set of forces needed to constrain the behavior of a mechanical system, modeled as a set of particles and rigid bodies, when it is subject to motion constraints described by nonholonomic equations that are inherently nonlinear in velocity. An expression in vector form is obtained for each force; a direction is determined, together with the point of application. This result is a consequence of expressing constraint equations in terms of dot products of vectors rather than in the usual way, which is entirely in terms of scalars and matrices. The constraint forces in vector form are used together with two new analytical approaches for deriving equations governing motion of a system subject to such constraints. If constraint forces are of interest they can be brought into evidence in explicit dynamical equations by employing the well-known nonholonomic partial velocities associated with Kane's method; if they are not of interest, equations can be formed instead with the aid of vectors introduced here as nonholonomic partial accelerations. When the analyst requires only the latter, smaller set of equations, they can be formed directly; it is not necessary to expend the labor to form the former, larger set first and subsequently perform matrix multiplications.

Real-time optical laboratory solution of parabolic differential equations

NASA Technical Reports Server (NTRS)

Casasent, David; Jackson, James

1988-01-01

An optical laboratory matrix-vector processor is used to solve parabolic differential equations (the transient diffusion equation with two space variables and time) by an explicit algorithm. This includes optical matrix-vector nonbase-2 encoded laboratory data, the combination of nonbase-2 and frequency-multiplexed data on such processors, a high-accuracy optical laboratory solution of a partial differential equation, new data partitioning techniques, and a discussion of a multiprocessor optical matrix-vector architecture.

Closed-form integrator for the quaternion (euler angle) kinematics equations

NASA Technical Reports Server (NTRS)

Whitmore, Stephen A. (Inventor)

2000-01-01

The invention is embodied in a method of integrating kinematics equations for updating a set of vehicle attitude angles of a vehicle using 3-dimensional angular velocities of the vehicle, which includes computing an integrating factor matrix from quantities corresponding to the 3-dimensional angular velocities, computing a total integrated angular rate from the quantities corresponding to a 3-dimensional angular velocities, computing a state transition matrix as a sum of (a) a first complementary function of the total integrated angular rate and (b) the integrating factor matrix multiplied by a second complementary function of the total integrated angular rate, and updating the set of vehicle attitude angles using the state transition matrix. Preferably, the method further includes computing a quanternion vector from the quantities corresponding to the 3-dimensional angular velocities, in which case the updating of the set of vehicle attitude angles using the state transition matrix is carried out by (a) updating the quanternion vector by multiplying the quanternion vector by the state transition matrix to produce an updated quanternion vector and (b) computing an updated set of vehicle attitude angles from the updated quanternion vector. The first and second trigonometric functions are complementary, such as a sine and a cosine. The quantities corresponding to the 3-dimensional angular velocities include respective averages of the 3-dimensional angular velocities over plural time frames. The updating of the quanternion vector preserves the norm of the vector, whereby the updated set of vehicle attitude angles are virtually error-free.

Decoding and optimized implementation of SECDED codes over GF(q)

DOEpatents

Ward, H. Lee; Ganti, Anand; Resnick, David R

2013-10-22

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

Design, decoding and optimized implementation of SECDED codes over GF(q)

DOEpatents

Ward, H Lee; Ganti, Anand; Resnick, David R

2014-06-17

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

Decoding and optimized implementation of SECDED codes over GF(q)

DOEpatents

Ward, H Lee; Ganti, Anand; Resnick, David R

2014-11-18

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

A transversal approach to predict gene product networks from ontology-based similarity

PubMed Central

Chabalier, Julie; Mosser, Jean; Burgun, Anita

2007-01-01

Background Interpretation of transcriptomic data is usually made through a "standard" approach which consists in clustering the genes according to their expression patterns and exploiting Gene Ontology (GO) annotations within each expression cluster. This approach makes it difficult to underline functional relationships between gene products that belong to different expression clusters. To address this issue, we propose a transversal analysis that aims to predict functional networks based on a combination of GO processes and data expression. Results The transversal approach presented in this paper consists in computing the semantic similarity between gene products in a Vector Space Model. Through a weighting scheme over the annotations, we take into account the representativity of the terms that annotate a gene product. Comparing annotation vectors results in a matrix of gene product similarities. Combined with expression data, the matrix is displayed as a set of functional gene networks. The transversal approach was applied to 186 genes related to the enterocyte differentiation stages. This approach resulted in 18 functional networks proved to be biologically relevant. These results were compared with those obtained through a standard approach and with an approach based on information content similarity. Conclusion Complementary to the standard approach, the transversal approach offers new insight into the cellular mechanisms and reveals new research hypotheses by combining gene product networks based on semantic similarity, and data expression. PMID:17605807

Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications

NASA Astrophysics Data System (ADS)

Lesieur, Thibault; Krzakala, Florent; Zdeborová, Lenka

2017-07-01

This article is an extended version of previous work of Lesieur et al (2015 IEEE Int. Symp. on Information Theory Proc. pp 1635-9 and 2015 53rd Annual Allerton Conf. on Communication, Control and Computing (IEEE) pp 680-7) on low-rank matrix estimation in the presence of constraints on the factors into which the matrix is factorized. Low-rank matrix factorization is one of the basic methods used in data analysis for unsupervised learning of relevant features and other types of dimensionality reduction. We present a framework to study the constrained low-rank matrix estimation for a general prior on the factors, and a general output channel through which the matrix is observed. We draw a parallel with the study of vector-spin glass models—presenting a unifying way to study a number of problems considered previously in separate statistical physics works. We present a number of applications for the problem in data analysis. We derive in detail a general form of the low-rank approximate message passing (Low-RAMP) algorithm, that is known in statistical physics as the TAP equations. We thus unify the derivation of the TAP equations for models as different as the Sherrington-Kirkpatrick model, the restricted Boltzmann machine, the Hopfield model or vector (xy, Heisenberg and other) spin glasses. The state evolution of the Low-RAMP algorithm is also derived, and is equivalent to the replica symmetric solution for the large class of vector-spin glass models. In the section devoted to result we study in detail phase diagrams and phase transitions for the Bayes-optimal inference in low-rank matrix estimation. We present a typology of phase transitions and their relation to performance of algorithms such as the Low-RAMP or commonly used spectral methods.

Families of vector-like deformations of relativistic quantum phase spaces, twists and symmetries

NASA Astrophysics Data System (ADS)

Meljanac, Daniel; Meljanac, Stjepan; Pikutić, Danijel

2017-12-01

Families of vector-like deformed relativistic quantum phase spaces and corresponding realizations are analyzed. A method for a general construction of the star product is presented. The corresponding twist, expressed in terms of phase space coordinates, in the Hopf algebroid sense is presented. General linear realizations are considered and corresponding twists, in terms of momenta and Poincaré-Weyl generators or gl(n) generators are constructed and R-matrix is discussed. A classification of linear realizations leading to vector-like deformed phase spaces is given. There are three types of spaces: (i) commutative spaces, (ii) κ -Minkowski spaces and (iii) κ -Snyder spaces. The corresponding star products are (i) associative and commutative (but non-local), (ii) associative and non-commutative and (iii) non-associative and non-commutative, respectively. Twisted symmetry algebras are considered. Transposed twists and left-right dual algebras are presented. Finally, some physical applications are discussed.

[Orthogonal Vector Projection Algorithm for Spectral Unmixing].

PubMed

Song, Mei-ping; Xu, Xing-wei; Chang, Chein-I; An, Ju-bai; Yao, Li

2015-12-01

Spectrum unmixing is an important part of hyperspectral technologies, which is essential for material quantity analysis in hyperspectral imagery. Most linear unmixing algorithms require computations of matrix multiplication and matrix inversion or matrix determination. These are difficult for programming, especially hard for realization on hardware. At the same time, the computation costs of the algorithms increase significantly as the number of endmembers grows. Here, based on the traditional algorithm Orthogonal Subspace Projection, a new method called. Orthogonal Vector Projection is prompted using orthogonal principle. It simplifies this process by avoiding matrix multiplication and inversion. It firstly computes the final orthogonal vector via Gram-Schmidt process for each endmember spectrum. And then, these orthogonal vectors are used as projection vector for the pixel signature. The unconstrained abundance can be obtained directly by projecting the signature to the projection vectors, and computing the ratio of projected vector length and orthogonal vector length. Compared to the Orthogonal Subspace Projection and Least Squares Error algorithms, this method does not need matrix inversion, which is much computation costing and hard to implement on hardware. It just completes the orthogonalization process by repeated vector operations, easy for application on both parallel computation and hardware. The reasonability of the algorithm is proved by its relationship with Orthogonal Sub-space Projection and Least Squares Error algorithms. And its computational complexity is also compared with the other two algorithms', which is the lowest one. At last, the experimental results on synthetic image and real image are also provided, giving another evidence for effectiveness of the method.

Super-resolution Doppler beam sharpening method using fast iterative adaptive approach-based spectral estimation

NASA Astrophysics Data System (ADS)

Mao, Deqing; Zhang, Yin; Zhang, Yongchao; Huang, Yulin; Yang, Jianyu

2018-01-01

Doppler beam sharpening (DBS) is a critical technology for airborne radar ground mapping in forward-squint region. In conventional DBS technology, the narrow-band Doppler filter groups formed by fast Fourier transform (FFT) method suffer from low spectral resolution and high side lobe levels. The iterative adaptive approach (IAA), based on the weighted least squares (WLS), is applied to the DBS imaging applications, forming narrower Doppler filter groups than the FFT with lower side lobe levels. Regrettably, the IAA is iterative, and requires matrix multiplication and inverse operation when forming the covariance matrix, its inverse and traversing the WLS estimate for each sampling point, resulting in a notably high computational complexity for cubic time. We propose a fast IAA (FIAA)-based super-resolution DBS imaging method, taking advantage of the rich matrix structures of the classical narrow-band filtering. First, we formulate the covariance matrix via the FFT instead of the conventional matrix multiplication operation, based on the typical Fourier structure of the steering matrix. Then, by exploiting the Gohberg-Semencul representation, the inverse of the Toeplitz covariance matrix is computed by the celebrated Levinson-Durbin (LD) and Toeplitz-vector algorithm. Finally, the FFT and fast Toeplitz-vector algorithm are further used to traverse the WLS estimates based on the data-dependent trigonometric polynomials. The method uses the Hermitian feature of the echo autocorrelation matrix R to achieve its fast solution and uses the Toeplitz structure of R to realize its fast inversion. The proposed method enjoys a lower computational complexity without performance loss compared with the conventional IAA-based super-resolution DBS imaging method. The results based on simulations and measured data verify the imaging performance and the operational efficiency.

MATLAB Simulation of Gradient-Based Neural Network for Online Matrix Inversion

NASA Astrophysics Data System (ADS)

Zhang, Yunong; Chen, Ke; Ma, Weimu; Li, Xiao-Dong

This paper investigates the simulation of a gradient-based recurrent neural network for online solution of the matrix-inverse problem. Several important techniques are employed as follows to simulate such a neural system. 1) Kronecker product of matrices is introduced to transform a matrix-differential-equation (MDE) to a vector-differential-equation (VDE); i.e., finally, a standard ordinary-differential-equation (ODE) is obtained. 2) MATLAB routine "ode45" is introduced to solve the transformed initial-value ODE problem. 3) In addition to various implementation errors, different kinds of activation functions are simulated to show the characteristics of such a neural network. Simulation results substantiate the theoretical analysis and efficacy of the gradient-based neural network for online constant matrix inversion.

GaAs Supercomputing: Architecture, Language, And Algorithms For Image Processing

NASA Astrophysics Data System (ADS)

Johl, John T.; Baker, Nick C.

1988-10-01

The application of high-speed GaAs processors in a parallel system matches the demanding computational requirements of image processing. The architecture of the McDonnell Douglas Astronautics Company (MDAC) vector processor is described along with the algorithms and language translator. Most image and signal processing algorithms can utilize parallel processing and show a significant performance improvement over sequential versions. The parallelization performed by this system is within each vector instruction. Since each vector has many elements, each requiring some computation, useful concurrent arithmetic operations can easily be performed. Balancing the memory bandwidth with the computation rate of the processors is an important design consideration for high efficiency and utilization. The architecture features a bus-based execution unit consisting of four to eight 32-bit GaAs RISC microprocessors running at a 200 MHz clock rate for a peak performance of 1.6 BOPS. The execution unit is connected to a vector memory with three buses capable of transferring two input words and one output word every 10 nsec. The address generators inside the vector memory perform different vector addressing modes and feed the data to the execution unit. The functions discussed in this paper include basic MATRIX OPERATIONS, 2-D SPATIAL CONVOLUTION, HISTOGRAM, and FFT. For each of these algorithms, assembly language programs were run on a behavioral model of the system to obtain performance figures.

Improved analysis of SP and CoSaMP under total perturbations

NASA Astrophysics Data System (ADS)

Li, Haifeng

2016-12-01

Practically, in the underdetermined model y= A x, where x is a K sparse vector (i.e., it has no more than K nonzero entries), both y and A could be totally perturbed. A more relaxed condition means less number of measurements are needed to ensure the sparse recovery from theoretical aspect. In this paper, based on restricted isometry property (RIP), for subspace pursuit (SP) and compressed sampling matching pursuit (CoSaMP), two relaxed sufficient conditions are presented under total perturbations to guarantee that the sparse vector x is recovered. Taking random matrix as measurement matrix, we also discuss the advantage of our condition. Numerical experiments validate that SP and CoSaMP can provide oracle-order recovery performance.

Digital techniques for ULF wave polarization analysis

NASA Technical Reports Server (NTRS)

Arthur, C. W.

1979-01-01

Digital power spectral and wave polarization analysis are powerful techniques for studying ULF waves in the earth's magnetosphere. Four different techniques for using the spectral matrix to perform such an analysis have been presented in the literature. Three of these techniques are similar in that they require transformation of the spectral matrix to the principal axis system prior to performing the polarization analysis. The differences in the three techniques lie in the manner in which determine this transformation. A comparative study of these three techniques using both simulated and real data has shown them to be approximately equal in quality of performance. The fourth technique does not require transformation of the spectral matrix. Rather, it uses the measured spectral matrix and state vectors for a desired wave type to design a polarization detector function in the frequency domain. The design of various detector functions and their application to both simulated and real data will be presented.

An Alternative Method for Computing Mean and Covariance Matrix of Some Multivariate Distributions

ERIC Educational Resources Information Center

Radhakrishnan, R.; Choudhury, Askar

2009-01-01

Computing the mean and covariance matrix of some multivariate distributions, in particular, multivariate normal distribution and Wishart distribution are considered in this article. It involves a matrix transformation of the normal random vector into a random vector whose components are independent normal random variables, and then integrating…

Polar decomposition for attitude determination from vector observations

NASA Technical Reports Server (NTRS)

Bar-Itzhack, Itzhack Y.

1993-01-01

This work treats the problem of weighted least squares fitting of a 3D Euclidean-coordinate transformation matrix to a set of unit vectors measured in the reference and transformed coordinates. A closed-form analytic solution to the problem is re-derived. The fact that the solution is the closest orthogonal matrix to some matrix defined on the measured vectors and their weights is clearly demonstrated. Several known algorithms for computing the analytic closed form solution are considered. An algorithm is discussed which is based on the polar decomposition of matrices into the closest unitary matrix to the decomposed matrix and a Hermitian matrix. A somewhat longer improved algorithm is suggested too. A comparison of several algorithms is carried out using simulated data as well as real data from the Upper Atmosphere Research Satellite. The comparison is based on accuracy and time consumption. It is concluded that the algorithms based on polar decomposition yield a simple although somewhat less accurate solution. The precision of the latter algorithms increase with the number of the measured vectors and with the accuracy of their measurement.

Optical computation using residue arithmetic.

PubMed

Huang, A; Tsunoda, Y; Goodman, J W; Ishihara, S

1979-01-15

Using residue arithmetic it is possible to perform additions, subtractions, multiplications, and polynomial evaluation without the necessity for carry operations. Calculations can, therefore, be performed in a fully parallel manner. Several different optical methods for performing residue arithmetic operations are described. A possible combination of such methods to form a matrix vector multiplier is considered. The potential advantages of optics in performing these kinds of operations are discussed.

Acoustooptic linear algebra processors - Architectures, algorithms, and applications

NASA Technical Reports Server (NTRS)

Casasent, D.

1984-01-01

Architectures, algorithms, and applications for systolic processors are described with attention to the realization of parallel algorithms on various optical systolic array processors. Systolic processors for matrices with special structure and matrices of general structure, and the realization of matrix-vector, matrix-matrix, and triple-matrix products and such architectures are described. Parallel algorithms for direct and indirect solutions to systems of linear algebraic equations and their implementation on optical systolic processors are detailed with attention to the pipelining and flow of data and operations. Parallel algorithms and their optical realization for LU and QR matrix decomposition are specifically detailed. These represent the fundamental operations necessary in the implementation of least squares, eigenvalue, and SVD solutions. Specific applications (e.g., the solution of partial differential equations, adaptive noise cancellation, and optimal control) are described to typify the use of matrix processors in modern advanced signal processing.

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

PubMed

Wen, Zaidao; Hou, Zaidao; Jiao, Licheng

2017-11-01

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

Tensor manifold-based extreme learning machine for 2.5-D face recognition

NASA Astrophysics Data System (ADS)

Chong, Lee Ying; Ong, Thian Song; Teoh, Andrew Beng Jin

2018-01-01

We explore the use of the Gabor regional covariance matrix (GRCM), a flexible matrix-based descriptor that embeds the Gabor features in the covariance matrix, as a 2.5-D facial descriptor and an effective means of feature fusion for 2.5-D face recognition problems. Despite its promise, matching is not a trivial problem for GRCM since it is a special instance of a symmetric positive definite (SPD) matrix that resides in non-Euclidean space as a tensor manifold. This implies that GRCM is incompatible with the existing vector-based classifiers and distance matchers. Therefore, we bridge the gap of the GRCM and extreme learning machine (ELM), a vector-based classifier for the 2.5-D face recognition problem. We put forward a tensor manifold-compliant ELM and its two variants by embedding the SPD matrix randomly into reproducing kernel Hilbert space (RKHS) via tensor kernel functions. To preserve the pair-wise distance of the embedded data, we orthogonalize the random-embedded SPD matrix. Hence, classification can be done using a simple ridge regressor, an integrated component of ELM, on the random orthogonal RKHS. Experimental results show that our proposed method is able to improve the recognition performance and further enhance the computational efficiency.

Solving periodic block tridiagonal systems using the Sherman-Morrison-Woodbury formula

NASA Technical Reports Server (NTRS)

Yarrow, Maurice

1989-01-01

Many algorithms for solving the Navier-Stokes equations require the solution of periodic block tridiagonal systems of equations. By applying a splitting to the matrix representing this system of equations, it may first be reduced to a block tridiagonal matrix plus an outer product of two block vectors. The Sherman-Morrison-Woodbury formula is then applied. The algorithm thus reduces a periodic banded system to a non-periodic banded system with additional right-hand sides and is of higher efficiency than standard Thomas algorithm/LU decompositions.

A statistical-textural-features based approach for classification of solid drugs using surface microscopic images.

PubMed

Tahir, Fahima; Fahiem, Muhammad Abuzar

2014-01-01

The quality of pharmaceutical products plays an important role in pharmaceutical industry as well as in our lives. Usage of defective tablets can be harmful for patients. In this research we proposed a nondestructive method to identify defective and nondefective tablets using their surface morphology. Three different environmental factors temperature, humidity and moisture are analyzed to evaluate the performance of the proposed method. Multiple textural features are extracted from the surface of the defective and nondefective tablets. These textural features are gray level cooccurrence matrix, run length matrix, histogram, autoregressive model and HAAR wavelet. Total textural features extracted from images are 281. We performed an analysis on all those 281, top 15, and top 2 features. Top 15 features are extracted using three different feature reduction techniques: chi-square, gain ratio and relief-F. In this research we have used three different classifiers: support vector machine, K-nearest neighbors and naïve Bayes to calculate the accuracies against proposed method using two experiments, that is, leave-one-out cross-validation technique and train test models. We tested each classifier against all selected features and then performed the comparison of their results. The experimental work resulted in that in most of the cases SVM performed better than the other two classifiers.

A robust variant of block Jacobi-Davidson for extracting a large number of eigenpairs: Application to grid-based real-space density functional theory

NASA Astrophysics Data System (ADS)

Lee, M.; Leiter, K.; Eisner, C.; Breuer, A.; Wang, X.

2017-09-01

In this work, we investigate a block Jacobi-Davidson (J-D) variant suitable for sparse symmetric eigenproblems where a substantial number of extremal eigenvalues are desired (e.g., ground-state real-space quantum chemistry). Most J-D algorithm variations tend to slow down as the number of desired eigenpairs increases due to frequent orthogonalization against a growing list of solved eigenvectors. In our specification of block J-D, all of the steps of the algorithm are performed in clusters, including the linear solves, which allows us to greatly reduce computational effort with blocked matrix-vector multiplies. In addition, we move orthogonalization against locked eigenvectors and working eigenvectors outside of the inner loop but retain the single Ritz vector projection corresponding to the index of the correction vector. Furthermore, we minimize the computational effort by constraining the working subspace to the current vectors being updated and the latest set of corresponding correction vectors. Finally, we incorporate accuracy thresholds based on the precision required by the Fermi-Dirac distribution. The net result is a significant reduction in the computational effort against most previous block J-D implementations, especially as the number of wanted eigenpairs grows. We compare our approach with another robust implementation of block J-D (JDQMR) and the state-of-the-art Chebyshev filter subspace (CheFSI) method for various real-space density functional theory systems. Versus CheFSI, for first-row elements, our method yields competitive timings for valence-only systems and 4-6× speedups for all-electron systems with up to 10× reduced matrix-vector multiplies. For all-electron calculations on larger elements (e.g., gold) where the wanted spectrum is quite narrow compared to the full spectrum, we observe 60× speedup with 200× fewer matrix-vector multiples vs. CheFSI.

A robust variant of block Jacobi-Davidson for extracting a large number of eigenpairs: Application to grid-based real-space density functional theory.

PubMed

Lee, M; Leiter, K; Eisner, C; Breuer, A; Wang, X

2017-09-21

In this work, we investigate a block Jacobi-Davidson (J-D) variant suitable for sparse symmetric eigenproblems where a substantial number of extremal eigenvalues are desired (e.g., ground-state real-space quantum chemistry). Most J-D algorithm variations tend to slow down as the number of desired eigenpairs increases due to frequent orthogonalization against a growing list of solved eigenvectors. In our specification of block J-D, all of the steps of the algorithm are performed in clusters, including the linear solves, which allows us to greatly reduce computational effort with blocked matrix-vector multiplies. In addition, we move orthogonalization against locked eigenvectors and working eigenvectors outside of the inner loop but retain the single Ritz vector projection corresponding to the index of the correction vector. Furthermore, we minimize the computational effort by constraining the working subspace to the current vectors being updated and the latest set of corresponding correction vectors. Finally, we incorporate accuracy thresholds based on the precision required by the Fermi-Dirac distribution. The net result is a significant reduction in the computational effort against most previous block J-D implementations, especially as the number of wanted eigenpairs grows. We compare our approach with another robust implementation of block J-D (JDQMR) and the state-of-the-art Chebyshev filter subspace (CheFSI) method for various real-space density functional theory systems. Versus CheFSI, for first-row elements, our method yields competitive timings for valence-only systems and 4-6× speedups for all-electron systems with up to 10× reduced matrix-vector multiplies. For all-electron calculations on larger elements (e.g., gold) where the wanted spectrum is quite narrow compared to the full spectrum, we observe 60× speedup with 200× fewer matrix-vector multiples vs. CheFSI.

Large-region acoustic source mapping using a movable array and sparse covariance fitting.

PubMed

Zhao, Shengkui; Tuna, Cagdas; Nguyen, Thi Ngoc Tho; Jones, Douglas L

2017-01-01

Large-region acoustic source mapping is important for city-scale noise monitoring. Approaches using a single-position measurement scheme to scan large regions using small arrays cannot provide clean acoustic source maps, while deploying large arrays spanning the entire region of interest is prohibitively expensive. A multiple-position measurement scheme is applied to scan large regions at multiple spatial positions using a movable array of small size. Based on the multiple-position measurement scheme, a sparse-constrained multiple-position vectorized covariance matrix fitting approach is presented. In the proposed approach, the overall sample covariance matrix of the incoherent virtual array is first estimated using the multiple-position array data and then vectorized using the Khatri-Rao (KR) product. A linear model is then constructed for fitting the vectorized covariance matrix and a sparse-constrained reconstruction algorithm is proposed for recovering source powers from the model. The user parameter settings are discussed. The proposed approach is tested on a 30 m × 40 m region and a 60 m × 40 m region using simulated and measured data. Much cleaner acoustic source maps and lower sound pressure level errors are obtained compared to the beamforming approaches and the previous sparse approach [Zhao, Tuna, Nguyen, and Jones, Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP) (2016)].

Symbolic computer vector analysis

NASA Technical Reports Server (NTRS)

Stoutemyer, D. R.

1977-01-01

A MACSYMA program is described which performs symbolic vector algebra and vector calculus. The program can combine and simplify symbolic expressions including dot products and cross products, together with the gradient, divergence, curl, and Laplacian operators. The distribution of these operators over sums or products is under user control, as are various other expansions, including expansion into components in any specific orthogonal coordinate system. There is also a capability for deriving the scalar or vector potential of a vector field. Examples include derivation of the partial differential equations describing fluid flow and magnetohydrodynamics, for 12 different classic orthogonal curvilinear coordinate systems.

CUDAICA: GPU Optimization of Infomax-ICA EEG Analysis

PubMed Central

Raimondo, Federico; Kamienkowski, Juan E.; Sigman, Mariano; Fernandez Slezak, Diego

2012-01-01

In recent years, Independent Component Analysis (ICA) has become a standard to identify relevant dimensions of the data in neuroscience. ICA is a very reliable method to analyze data but it is, computationally, very costly. The use of ICA for online analysis of the data, used in brain computing interfaces, results are almost completely prohibitive. We show an increase with almost no cost (a rapid video card) of speed of ICA by about 25 fold. The EEG data, which is a repetition of many independent signals in multiple channels, is very suitable for processing using the vector processors included in the graphical units. We profiled the implementation of this algorithm and detected two main types of operations responsible of the processing bottleneck and taking almost 80% of computing time: vector-matrix and matrix-matrix multiplications. By replacing function calls to basic linear algebra functions to the standard CUBLAS routines provided by GPU manufacturers, it does not increase performance due to CUDA kernel launch overhead. Instead, we developed a GPU-based solution that, comparing with the original BLAS and CUBLAS versions, obtains a 25x increase of performance for the ICA calculation. PMID:22811699

Split Octonion Reformulation for Electromagnetic Chiral Media of Massive Dyons

NASA Astrophysics Data System (ADS)

Chanyal, B. C.

2017-12-01

In an explicit, unified, and covariant formulation of an octonion algebra, we study and generalize the electromagnetic chiral fields equations of massive dyons with the split octonionic representation. Starting with 2×2 Zorn’s vector matrix realization of split-octonion and its dual Euclidean spaces, we represent the unified structure of split octonionic electric and magnetic induction vectors for chiral media. As such, in present paper, we describe the chiral parameter and pairing constants in terms of split octonionic matrix representation of Drude-Born-Fedorov constitutive relations. We have expressed a split octonionic electromagnetic field vector for chiral media, which exhibits the unified field structure of electric and magnetic chiral fields of dyons. The beauty of split octonionic representation of Zorn vector matrix realization is that, the every scalar and vector components have its own meaning in the generalized chiral electromagnetism of dyons. Correspondingly, we obtained the alternative form of generalized Proca-Maxwell’s equations of massive dyons in chiral media. Furthermore, the continuity equations, Poynting theorem and wave propagation for generalized electromagnetic fields of chiral media of massive dyons are established by split octonionic form of Zorn vector matrix algebra.

A static investigation of the thrust vectoring system of the F/A-18 high-alpha research vehicle

NASA Technical Reports Server (NTRS)

Mason, Mary L.; Capone, Francis J.; Asbury, Scott C.

1992-01-01

A static (wind-off) test was conducted in the static test facility of the Langley 16-foot Transonic Tunnel to evaluate the vectoring capability and isolated nozzle performance of the proposed thrust vectoring system of the F/A-18 high alpha research vehicle (HARV). The thrust vectoring system consisted of three asymmetrically spaced vanes installed externally on a single test nozzle. Two nozzle configurations were tested: A maximum afterburner-power nozzle and a military-power nozzle. Vane size and vane actuation geometry were investigated, and an extensive matrix of vane deflection angles was tested. The nozzle pressure ratios ranged from two to six. The results indicate that the three vane system can successfully generate multiaxis (pitch and yaw) thrust vectoring. However, large resultant vector angles incurred large thrust losses. Resultant vector angles were always lower than the vane deflection angles. The maximum thrust vectoring angles achieved for the military-power nozzle were larger than the angles achieved for the maximum afterburner-power nozzle.

Single-Sided Noinvasive Inspection of Multielement Sample Using Fan-Beam Multiplexed Compton Scatter Tomography

DTIC Science & Technology

2000-05-01

a vector , ρ "# represents the set of voxel densities sorted into a vector , and ( )A ρ $# "# represents a 8 mapping of the voxel densities to...density vector in equation (4) suggests that solving for ρ "# by direct inversion is not possible, calling for an iterative technique beginning with...the vector of measured spectra, and D is the diagonal matrix of the inverse of the variances. The diagonal matrix provides weighting terms, which

Insecticide resistance profile of Anopheles gambiae from a phase II field station in Cové, southern Benin: implications for the evaluation of novel vector control products.

PubMed

Ngufor, Corine; N'Guessan, Raphael; Fagbohoun, Josias; Subramaniam, Krishanthi; Odjo, Abibatou; Fongnikin, Augustin; Akogbeto, Martin; Weetman, David; Rowland, Mark

2015-11-18

Novel indoor residual spraying (IRS) and long-lasting insecticidal net (LLIN) products aimed at improving the control of pyrethroid-resistant malaria vectors have to be evaluated in Phase II semi-field experimental studies against highly pyrethroid-resistant mosquitoes. To better understand their performance it is necessary to fully characterize the species composition, resistance status and resistance mechanisms of the vector populations in the experimental hut sites. Bioassays were performed to assess phenotypic insecticide resistance in the malaria vector population at a newly constructed experimental hut site in Cové, a rice growing area in southern Benin, being used for WHOPES Phase II evaluation of newly developed LLIN and IRS products. The efficacy of standard WHOPES-approved pyrethroid LLIN and IRS products was also assessed in the experimental huts. Diagnostic genotyping techniques and microarray studies were performed to investigate the genetic basis of pyrethroid resistance in the Cové Anopheles gambiae population. The vector population at the Cové experimental hut site consisted of a mixture of Anopheles coluzzii and An. gambiae s.s. with the latter occurring at lower frequencies (23 %) and only in samples collected in the dry season. There was a high prevalence of resistance to pyrethroids and DDT (>90 % bioassay survival) with pyrethroid resistance intensity reaching 200-fold compared to the laboratory susceptible An. gambiae Kisumu strain. Standard WHOPES-approved pyrethroid IRS and LLIN products were ineffective in the experimental huts against this vector population (8-29 % mortality). The L1014F allele frequency was 89 %. CYP6P3, a cytochrome P450 validated as an efficient metabolizer of pyrethroids, was over-expressed. Characterizing pyrethroid resistance at Phase II field sites is crucial to the accurate interpretation of the performance of novel vector control products. The strong levels of pyrethroid resistance at the Cové experimental hut station make it a suitable site for Phase II experimental hut evaluations of novel vector control products, which aim for improved efficacy against pyrethroid-resistant malaria vectors to WHOPES standards. The resistance genes identified can be used as markers for further studies investigating the resistance management potential of novel mixture LLIN and IRS products tested at the site.

Alphavirus Replicon DNA Vectors Expressing Ebola GP and VP40 Antigens Induce Humoral and Cellular Immune Responses in Mice

PubMed Central

Ren, Shoufeng; Wei, Qimei; Cai, Liya; Yang, Xuejing; Xing, Cuicui; Tan, Feng; Leavenworth, Jianmei W.; Liang, Shaohui; Liu, Wenquan

2018-01-01

Ebola virus (EBOV) causes severe hemorrhagic fevers in humans, and no approved therapeutics or vaccine is currently available. Glycoprotein (GP) is the major protective antigen of EBOV, and can generate virus-like particles (VLPs) by co-expression with matrix protein (VP40). In this study, we constructed a recombinant Alphavirus Semliki Forest virus (SFV) replicon vector DREP to express EBOV GP and matrix viral protein (VP40). EBOV VLPs were successfully generated and achieved budding from 293 cells after co-transfection with DREP-based GP and VP40 vectors (DREP-GP+DREP-VP40). Vaccination of BALB/c mice with DREP-GP, DREP-VP40, or DREP-GP+DREP-VP40 vectors, followed by immediate electroporation resulted in a mixed IgG subclass production, which recognized EBOV GP and/or VP40 proteins. This vaccination regimen also led to the generation of both Th1 and Th2 cellular immune responses in mice. Notably, vaccination with DREP-GP and DREP-VP40, which produces both GP and VP40 antigens, induced a significantly higher level of anti-GP IgG2a antibody and increased IFN-γ secreting CD8+ T-cell responses relative to vaccination with DREP-GP or DREP-VP40 vector alone. Our study indicates that co-expression of GP and VP40 antigens based on the SFV replicon vector generates EBOV VLPs in vitro, and vaccination with recombinant DREP vectors containing GP and VP40 antigens induces Ebola antigen-specific humoral and cellular immune responses in mice. This novel approach provides a simple and efficient vaccine platform for Ebola disease prevention. PMID:29375526

Attitude determination using vector observations: A fast optimal matrix algorithm

NASA Technical Reports Server (NTRS)

Markley, F. Landis

1993-01-01

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Load cell having strain gauges of arbitrary location

DOEpatents

Spletzer, Barry [Albuquerque, NM

2007-03-13

A load cell utilizes a plurality of strain gauges mounted upon the load cell body such that there are six independent load-strain relations. Load is determined by applying the inverse of a load-strain sensitivity matrix to a measured strain vector. The sensitivity matrix is determined by performing a multivariate regression technique on a set of known loads correlated to the resulting strains. Temperature compensation is achieved by configuring the strain gauges as co-located orthogonal pairs.

Efficient Basis Formulation for (1 +1 )-Dimensional SU(2) Lattice Gauge Theory: Spectral Calculations with Matrix Product States

NASA Astrophysics Data System (ADS)

Bañuls, Mari Carmen; Cichy, Krzysztof; Cirac, J. Ignacio; Jansen, Karl; Kühn, Stefan

2017-10-01

We propose an explicit formulation of the physical subspace for a (1 +1 )-dimensional SU(2) lattice gauge theory, where the gauge degrees of freedom are integrated out. Our formulation is completely general, and might be potentially suited for the design of future quantum simulators. Additionally, it allows for addressing the theory numerically with matrix product states. We apply this technique to explore the spectral properties of the model and the effect of truncating the gauge degrees of freedom to a small finite dimension. In particular, we determine the scaling exponents for the vector mass. Furthermore, we also compute the entanglement entropy in the ground state and study its scaling towards the continuum limit.

Computation of optimal output-feedback compensators for linear time-invariant systems

NASA Technical Reports Server (NTRS)

Platzman, L. K.

1972-01-01

The control of linear time-invariant systems with respect to a quadratic performance criterion was considered, subject to the constraint that the control vector be a constant linear transformation of the output vector. The optimal feedback matrix, f*, was selected to optimize the expected performance, given the covariance of the initial state. It is first shown that the expected performance criterion can be expressed as the ratio of two multinomials in the element of f. This expression provides the basis for a feasible method of determining f* in the case of single-input single-output systems. A number of iterative algorithms are then proposed for the calculation of f* for multiple input-output systems. For two of these, monotone convergence is proved, but they involve the solution of nonlinear matrix equations at each iteration. Another is proposed involving the solution of Lyapunov equations at each iteration, and the gradual increase of the magnitude of a penalty function. Experience with this algorithm will be needed to determine whether or not it does, indeed, possess desirable convergence properties, and whether it can be used to determine the globally optimal f*.

Smooth muscle cell biglycan overexpression results in increased lipoprotein retention on extracellular matrix: implications for the retention of lipoproteins in atherosclerosis.

PubMed

O'Brien, Kevin D; Lewis, Katherine; Fischer, Jens W; Johnson, Pamela; Hwang, Jin-Yong; Knopp, Eleanor A; Kinsella, Michael G; Barrett, P Hugh R; Chait, Alan; Wight, Thomas N

2004-11-01

Lipoprotein retention on extracellular matrix (ECM) may play a central role in atherogenesis, and a specific extracellular matrix proteoglycan, biglycan, has been implicated in lipoprotein retention in human atherosclerosis. To test whether increased cellular biglycan expression results in increased retention of lipoproteins on ECM, rat aortic smooth muscle cells (SMCs) were transduced with a human biglycan cDNA-containing retroviral vector (LBSN) or with an empty retroviral vector (LXSN). To assess the importance of biglycan's glycosaminoglycan side chains in lipoprotein retention, ECM binding studies were also performed using RASMCs transduced with a retroviral vector encoding for a mutant, glycosaminoglycan-deficient biglycan (LBmutSN). Human biglycan mRNA and protein were confirmed in LBSN and LBmutSN RASMCs by Northern and Western blot analyses. HDL3+E binding to SMC ECM was increased significantly (as determined by 95% confidence intervals for binding curves) for LBSN as compared to either LXSN or LBmutSN cells; the increases for LBSN cell ECM were due primarily to an approximately 50% increase in binding sites (increased Bmax) versus LXSN cell ECM and of approximately 25% versus LBmutSN cell ECM. These results are consistent with the hypothesis that biglycan, through its glycosaminoglycan side chains, may mediate lipoprotein retention on atherosclerotic plaque ECM.

The covariance matrix for the solution vector of an equality-constrained least-squares problem

NASA Technical Reports Server (NTRS)

Lawson, C. L.

1976-01-01

Methods are given for computing the covariance matrix for the solution vector of an equality-constrained least squares problem. The methods are matched to the solution algorithms given in the book, 'Solving Least Squares Problems.'

The Unified Floating Point Vector Coprocessor for Reconfigurable Hardware

NASA Astrophysics Data System (ADS)

Kathiara, Jainik

There has been an increased interest recently in using embedded cores on FPGAs. Many of the applications that make use of these cores have floating point operations. Due to the complexity and expense of floating point hardware, these algorithms are usually converted to fixed point operations or implemented using floating-point emulation in software. As the technology advances, more and more homogeneous computational resources and fixed function embedded blocks are added to FPGAs and hence implementation of floating point hardware becomes a feasible option. In this research we have implemented a high performance, autonomous floating point vector Coprocessor (FPVC) that works independently within an embedded processor system. We have presented a unified approach to vector and scalar computation, using a single register file for both scalar operands and vector elements. The Hybrid vector/SIMD computational model of FPVC results in greater overall performance for most applications along with improved peak performance compared to other approaches. By parameterizing vector length and the number of vector lanes, we can design an application specific FPVC and take optimal advantage of the FPGA fabric. For this research we have also initiated designing a software library for various computational kernels, each of which adapts FPVC's configuration and provide maximal performance. The kernels implemented are from the area of linear algebra and include matrix multiplication and QR and Cholesky decomposition. We have demonstrated the operation of FPVC on a Xilinx Virtex 5 using the embedded PowerPC.

Polarimetric signatures of a canopy of dielectric cylinders based on first and second order vector radiative transfer theory

NASA Technical Reports Server (NTRS)

Tsang, Leung; Chan, Chi Hou; Kong, Jin AU; Joseph, James

1992-01-01

Complete polarimetric signatures of a canopy of dielectric cylinders overlying a homogeneous half space are studied with the first and second order solutions of the vector radiative transfer theory. The vector radiative transfer equations contain a general nondiagonal extinction matrix and a phase matrix. The energy conservation issue is addressed by calculating the elements of the extinction matrix and the elements of the phase matrix in a manner that is consistent with energy conservation. Two methods are used. In the first method, the surface fields and the internal fields of the dielectric cylinder are calculated by using the fields of an infinite cylinder. The phase matrix is calculated and the extinction matrix is calculated by summing the absorption and scattering to ensure energy conservation. In the second method, the method of moments is used to calculate the elements of the extinction and phase matrices. The Mueller matrix based on the first order and second order multiple scattering solutions of the vector radiative transfer equation are calculated. Results from the two methods are compared. The vector radiative transfer equations, combined with the solution based on method of moments, obey both energy conservation and reciprocity. The polarimetric signatures, copolarized and depolarized return, degree of polarization, and phase differences are studied as a function of the orientation, sizes, and dielectric properties of the cylinders. It is shown that second order scattering is generally important for vegetation canopy at C band and can be important at L band for some cases.

Exploring and Making Sense of Large Graphs

DTIC Science & Technology

2015-08-01

and bold) are n × n ; vectors (lower-case bold) are n × 1 column vectors, and scalars (in lower-case plain font) typically correspond to strength of...graph is often denoted as |V| or n . Edges or Links: A finite set E of lines between objects in a graph. The edges represent relationships between the...Adjacency matrix of a simple, unweighted and undirected graph. Adjacency matrix: The adjacency matrix of a graph G is an n × n matrix A, whose element aij

Interactive Software For Astrodynamical Calculations

NASA Technical Reports Server (NTRS)

Schlaifer, Ronald S.; Skinner, David L.; Roberts, Phillip H.

1995-01-01

QUICK computer program provides user with facilities of sophisticated desk calculator performing scalar, vector, and matrix arithmetic; propagate conic-section orbits; determines planetary and satellite coordinates; and performs other related astrodynamic calculations within FORTRAN-like software environment. QUICK is interpreter, and no need to use compiler or linker to run QUICK code. Outputs plotted in variety of formats on variety of terminals. Written in RATFOR.

An efficient matrix product operator representation of the quantum chemical Hamiltonian

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

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

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

Application of Krylov exponential propagation to fluid dynamics equations

NASA Technical Reports Server (NTRS)

Saad, Youcef; Semeraro, David

1991-01-01

An application of matrix exponentiation via Krylov subspace projection to the solution of fluid dynamics problems is presented. The main idea is to approximate the operation exp(A)v by means of a projection-like process onto a krylov subspace. This results in a computation of an exponential matrix vector product similar to the one above but of a much smaller size. Time integration schemes can then be devised to exploit this basic computational kernel. The motivation of this approach is to provide time-integration schemes that are essentially of an explicit nature but which have good stability properties.

Intermediate quantum maps for quantum computation

NASA Astrophysics Data System (ADS)

Giraud, O.; Georgeot, B.

2005-10-01

We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity decay or spectral statistics. We study their matrix elements and entanglement production and show that they converge with time to distributions which differ from random matrix predictions. A randomized version of these maps can be implemented even more economically and yields pseudorandom operators with original properties, enabling, for example, one to produce fractal random vectors. These algorithms are within reach of present-day quantum computers.

Rotman Lens Sidewall Design and Optimization with Hybrid Hardware/Software Based Programming

DTIC Science & Technology

2015-01-09

conventional MoM and stored in memory. The components of Zfar are computed as needed through a fast matrix vector multiplication ( MVM ), which...V vector. Iterative methods, e.g. BiCGSTAB, are employed for solving the linear equation. The matrix-vector multiplications ( MVMs ), which dominate...most of the computation in the solving phase, consists of calculating near and far MVMs . The far MVM comprises aggregation, translation, and

Variational Iterative Methods for Nonsymmetric Systems of Linear Equations.

DTIC Science & Technology

1981-08-01

With a third matrix-vector product, b(i) can be computed as i j ( ATAr i+l’pj)/ApjpApj), and the previous (Apj) need not be saved. Page 8 I OCR I Orthomin... Economics and Mathematical Systems, Volume 134, Springer-Verlag, Berlin, 1976. [51 Paul Concus, Gene H. Golub, and Dianne P. O’Leary. A generalized

Computing energy levels of CH4, CHD3, CH3D, and CH3F with a direct product basis and coordinates based on the methyl subsystem.

PubMed

Zhao, Zhiqiang; Chen, Jun; Zhang, Zhaojun; Zhang, Dong H; Wang, Xiao-Gang; Carrington, Tucker; Gatti, Fabien

2018-02-21

Quantum mechanical calculations of ro-vibrational energies of CH 4 , CHD 3 , CH 3 D, and CH 3 F were made with two different numerical approaches. Both use polyspherical coordinates. The computed energy levels agree, confirming the accuracy of the methods. In the first approach, for all the molecules, the coordinates are defined using three Radau vectors for the CH 3 subsystem and a Jacobi vector between the remaining atom and the centre of mass of CH 3 . Euler angles specifying the orientation of a frame attached to CH 3 with respect to a frame attached to the Jacobi vector are used as vibrational coordinates. A direct product potential-optimized discrete variable vibrational basis is used to build a Hamiltonian matrix. Ro-vibrational energies are computed using a re-started Arnoldi eigensolver. In the second approach, the coordinates are the spherical coordinates associated with four Radau vectors or three Radau vectors and a Jacobi vector, and the frame is an Eckart frame. Vibrational basis functions are products of contracted stretch and bend functions, and eigenvalues are computed with the Lanczos algorithm. For CH 4 , CHD 3 , and CH 3 D, we report the first J > 0 energy levels computed on the Wang-Carrington potential energy surface [X.-G. Wang and T. Carrington, J. Chem. Phys. 141(15), 154106 (2014)]. For CH 3 F, the potential energy surface of Zhao et al. [J. Chem. Phys. 144, 204302 (2016)] was used. All the results are in good agreement with experimental data.

Computing energy levels of CH4, CHD3, CH3D, and CH3F with a direct product basis and coordinates based on the methyl subsystem

NASA Astrophysics Data System (ADS)

Zhao, Zhiqiang; Chen, Jun; Zhang, Zhaojun; Zhang, Dong H.; Wang, Xiao-Gang; Carrington, Tucker; Gatti, Fabien

2018-02-01

Quantum mechanical calculations of ro-vibrational energies of CH4, CHD3, CH3D, and CH3F were made with two different numerical approaches. Both use polyspherical coordinates. The computed energy levels agree, confirming the accuracy of the methods. In the first approach, for all the molecules, the coordinates are defined using three Radau vectors for the CH3 subsystem and a Jacobi vector between the remaining atom and the centre of mass of CH3. Euler angles specifying the orientation of a frame attached to CH3 with respect to a frame attached to the Jacobi vector are used as vibrational coordinates. A direct product potential-optimized discrete variable vibrational basis is used to build a Hamiltonian matrix. Ro-vibrational energies are computed using a re-started Arnoldi eigensolver. In the second approach, the coordinates are the spherical coordinates associated with four Radau vectors or three Radau vectors and a Jacobi vector, and the frame is an Eckart frame. Vibrational basis functions are products of contracted stretch and bend functions, and eigenvalues are computed with the Lanczos algorithm. For CH4, CHD3, and CH3D, we report the first J > 0 energy levels computed on the Wang-Carrington potential energy surface [X.-G. Wang and T. Carrington, J. Chem. Phys. 141(15), 154106 (2014)]. For CH3F, the potential energy surface of Zhao et al. [J. Chem. Phys. 144, 204302 (2016)] was used. All the results are in good agreement with experimental data.

Enhancing Understanding of Transformation Matrices

ERIC Educational Resources Information Center

Dick, Jonathan; Childrey, Maria

2012-01-01

With the Common Core State Standards' emphasis on transformations, teachers need a variety of approaches to increase student understanding. Teaching matrix transformations by focusing on row vectors gives students tools to create matrices to perform transformations. This empowerment opens many doors: Students are able to create the matrices for…

Performance analysis of distributed symmetric sparse matrix vector multiplication algorithm for multi-core architectures

DOE PAGES

Oryspayev, Dossay; Aktulga, Hasan Metin; Sosonkina, Masha; ...

2015-07-14

In this article, sparse matrix vector multiply (SpMVM) is an important kernel that frequently arises in high performance computing applications. Due to its low arithmetic intensity, several approaches have been proposed in literature to improve its scalability and efficiency in large scale computations. In this paper, our target systems are high end multi-core architectures and we use messaging passing interface + open multiprocessing hybrid programming model for parallelism. We analyze the performance of recently proposed implementation of the distributed symmetric SpMVM, originally developed for large sparse symmetric matrices arising in ab initio nuclear structure calculations. We also study important featuresmore » of this implementation and compare with previously reported implementations that do not exploit underlying symmetry. Our SpMVM implementations leverage the hybrid paradigm to efficiently overlap expensive communications with computations. Our main comparison criterion is the "CPU core hours" metric, which is the main measure of resource usage on supercomputers. We analyze the effects of topology-aware mapping heuristic using simplified network load model. Furthermore, we have tested the different SpMVM implementations on two large clusters with 3D Torus and Dragonfly topology. Our results show that the distributed SpMVM implementation that exploits matrix symmetry and hides communication yields the best value for the "CPU core hours" metric and significantly reduces data movement overheads.« less

Performance of Passive and Active Sonars in the Philippine Sea

DTIC Science & Technology

2012-09-30

demodulated to 250 Hz , so the output of the matched filter for the LFM signal is the complex envelope of the pulse compressed signal. We want to...this cross coherence matrix for the 90−180Hz band on the left and 375 −525Hz one on the right. We note that there are 150 entries in each matrix which...Laboratory (CONOPS and vector sensor processing) 4. SSTAG ( Submarine Surveillance Technical Advisory Group) for N975) 5. FCP (Future Concepts Program for

Efficient Parallel Formulations of Hierarchical Methods and Their Applications

NASA Astrophysics Data System (ADS)

Grama, Ananth Y.

1996-01-01

Hierarchical methods such as the Fast Multipole Method (FMM) and Barnes-Hut (BH) are used for rapid evaluation of potential (gravitational, electrostatic) fields in particle systems. They are also used for solving integral equations using boundary element methods. The linear systems arising from these methods are dense and are solved iteratively. Hierarchical methods reduce the complexity of the core matrix-vector product from O(n^2) to O(n log n) and the memory requirement from O(n^2) to O(n). We have developed highly scalable parallel formulations of a hybrid FMM/BH method that are capable of handling arbitrarily irregular distributions. We apply these formulations to astrophysical simulations of Plummer and Gaussian galaxies. We have used our parallel formulations to solve the integral form of the Laplace equation. We show that our parallel hierarchical mat-vecs yield high efficiency and overall performance even on relatively small problems. A problem containing approximately 200K nodes takes under a second to compute on 256 processors and yet yields over 85% efficiency. The efficiency and raw performance is expected to increase for bigger problems. For the 200K node problem, our code delivers about 5 GFLOPS of performance on a 256 processor T3D. This is impressive considering the fact that the problem has floating point divides and roots, and very little locality resulting in poor cache performance. A dense matrix-vector product of the same dimensions would require about 0.5 TeraBytes of memory and about 770 TeraFLOPS of computing speed. Clearly, if the loss in accuracy resulting from the use of hierarchical methods is acceptable, our code yields significant savings in time and memory. We also study the convergence of a GMRES solver built around this mat-vec. We accelerate the convergence of the solver using three preconditioning techniques: diagonal scaling, block-diagonal preconditioning, and inner-outer preconditioning. We study the performance and parallel efficiency of these preconditioned solvers. Using this solver, we solve dense linear systems with hundreds of thousands of unknowns. Solving a 105K unknown problem takes about 10 minutes on a 64 processor T3D. Until very recently, boundary element problems of this magnitude could not even be generated, let alone solved.

Kinetic-energy matrix elements for atomic Hylleraas-CI wave functions.

PubMed

Harris, Frank E

2016-05-28

Hylleraas-CI is a superposition-of-configurations method in which each configuration is constructed from a Slater-type orbital (STO) product to which is appended (linearly) at most one interelectron distance rij. Computations of the kinetic energy for atoms by this method have been difficult due to the lack of formulas expressing these matrix elements for general angular momentum in terms of overlap and potential-energy integrals. It is shown here that a strategic application of angular-momentum theory, including the use of vector spherical harmonics, enables the reduction of all atomic kinetic-energy integrals to overlap and potential-energy matrix elements. The new formulas are validated by showing that they yield correct results for a large number of integrals published by other investigators.

Distributed Matrix Completion: Application to Cooperative Positioning in Noisy Environments

DTIC Science & Technology

2013-12-11

positioning, and a gossip version of low-rank approximation were developed. A convex relaxation for positioning in the presence of noise was shown to...of a large data matrix through gossip algorithms. A new algorithm is proposed that amounts to iteratively multiplying a vector by independent random...sparsification of the original matrix and averaging the resulting normalized vectors. This can be viewed as a generalization of gossip algorithms for

A Perron-Frobenius theory for block matrices associated to a multiplex network

NASA Astrophysics Data System (ADS)

Romance, Miguel; Solá, Luis; Flores, Julio; García, Esther; García del Amo, Alejandro; Criado, Regino

2015-03-01

The uniqueness of the Perron vector of a nonnegative block matrix associated to a multiplex network is discussed. The conclusions come from the relationships between the irreducibility of some nonnegative block matrix associated to a multiplex network and the irreducibility of the corresponding matrices to each layer as well as the irreducibility of the adjacency matrix of the projection network. In addition the computation of that Perron vector in terms of the Perron vectors of the blocks is also addressed. Finally we present the precise relations that allow to express the Perron eigenvector of the multiplex network in terms of the Perron eigenvectors of its layers.

Singer product apertures-A coded aperture system with a fast decoding algorithm

NASA Astrophysics Data System (ADS)

Byard, Kevin; Shutler, Paul M. E.

2017-06-01

A new type of coded aperture configuration that enables fast decoding of the coded aperture shadowgram data is presented. Based on the products of incidence vectors generated from the Singer difference sets, we call these Singer product apertures. For a range of aperture dimensions, we compare experimentally the performance of three decoding methods: standard decoding, induction decoding and direct vector decoding. In all cases the induction and direct vector methods are several orders of magnitude faster than the standard method, with direct vector decoding being significantly faster than induction decoding. For apertures of the same dimensions the increase in speed offered by direct vector decoding over induction decoding is better for lower throughput apertures.

Optical computing and image processing using photorefractive gallium arsenide

NASA Technical Reports Server (NTRS)

Cheng, Li-Jen; Liu, Duncan T. H.

1990-01-01

Recent experimental results on matrix-vector multiplication and multiple four-wave mixing using GaAs are presented. Attention is given to a simple concept of using two overlapping holograms in GaAs to do two matrix-vector multiplication processes operating in parallel with a common input vector. This concept can be used to construct high-speed, high-capacity, reconfigurable interconnection and multiplexing modules, important for optical computing and neural-network applications.

Dynamic Forms. Part 1: Functions

NASA Technical Reports Server (NTRS)

Meyer, George; Smith, G. Allan

1993-01-01

The formalism of dynamic forms is developed as a means for organizing and systematizing the design control systems. The formalism allows the designer to easily compute derivatives to various orders of large composite functions that occur in flight-control design. Such functions involve many function-of-a-function calls that may be nested to many levels. The component functions may be multiaxis, nonlinear, and they may include rotation transformations. A dynamic form is defined as a variable together with its time derivatives up to some fixed but arbitrary order. The variable may be a scalar, a vector, a matrix, a direction cosine matrix, Euler angles, or Euler parameters. Algorithms for standard elementary functions and operations of scalar dynamic forms are developed first. Then vector and matrix operations and transformations between parameterization of rotations are developed in the next level in the hierarchy. Commonly occurring algorithms in control-system design, including inversion of pure feedback systems, are developed in the third level. A large-angle, three-axis attitude servo and other examples are included to illustrate the effectiveness of the developed formalism. All algorithms were implemented in FORTRAN code. Practical experience shows that the proposed formalism may significantly improve the productivity of the design and coding process.

Optimization of large matrix calculations for execution on the Cray X-MP vector supercomputer

NASA Technical Reports Server (NTRS)

Hornfeck, William A.

1988-01-01

A considerable volume of large computational computer codes were developed for NASA over the past twenty-five years. This code represents algorithms developed for machines of earlier generation. With the emergence of the vector supercomputer as a viable, commercially available machine, an opportunity exists to evaluate optimization strategies to improve the efficiency of existing software. This result is primarily due to architectural differences in the latest generation of large-scale machines and the earlier, mostly uniprocessor, machines. A sofware package being used by NASA to perform computations on large matrices is described, and a strategy for conversion to the Cray X-MP vector supercomputer is also described.

SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation

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

Yang, R; Fallone, B; Cross Cancer Institute, Edmonton, AB

Purpose: To develop a Graphic Processor Unit (GPU) accelerated deterministic solution to the Linear Boltzmann Transport Equation (LBTE) for accurate dose calculations in radiotherapy (RT). A deterministic solution yields the potential for major speed improvements due to the sparse matrix-vector and vector-vector multiplications and would thus be of benefit to RT. Methods: In order to leverage the massively parallel architecture of GPUs, the first order LBTE was reformulated as a second order self-adjoint equation using the Least Squares Finite Element Method (LSFEM). This produces a symmetric positive-definite matrix which is efficiently solved using a parallelized conjugate gradient (CG) solver. Themore » LSFEM formalism is applied in space, discrete ordinates is applied in angle, and the Multigroup method is applied in energy. The final linear system of equations produced is tightly coupled in space and angle. Our code written in CUDA-C was benchmarked on an Nvidia GeForce TITAN-X GPU against an Intel i7-6700K CPU. A spatial mesh of 30,950 tetrahedral elements was used with an S4 angular approximation. Results: To avoid repeating a full computationally intensive finite element matrix assembly at each Multigroup energy, a novel mapping algorithm was developed which minimized the operations required at each energy. Additionally, a parallelized memory mapping for the kronecker product between the sparse spatial and angular matrices, including Dirichlet boundary conditions, was created. Atomicity is preserved by graph-coloring overlapping nodes into separate kernel launches. The one-time mapping calculations for matrix assembly, kronecker product, and boundary condition application took 452±1ms on GPU. Matrix assembly for 16 energy groups took 556±3s on CPU, and 358±2ms on GPU using the mappings developed. The CG solver took 93±1s on CPU, and 468±2ms on GPU. Conclusion: Three computationally intensive subroutines in deterministically solving the LBTE have been formulated on GPU, resulting in two orders of magnitude speedup. Funding support from Natural Sciences and Engineering Research Council and Alberta Innovates Health Solutions. Dr. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).« less

High-Order Automatic Differentiation of Unmodified Linear Algebra Routines via Nilpotent Matrices

NASA Astrophysics Data System (ADS)

Dunham, Benjamin Z.

This work presents a new automatic differentiation method, Nilpotent Matrix Differentiation (NMD), capable of propagating any order of mixed or univariate derivative through common linear algebra functions--most notably third-party sparse solvers and decomposition routines, in addition to basic matrix arithmetic operations and power series--without changing data-type or modifying code line by line; this allows differentiation across sequences of arbitrarily many such functions with minimal implementation effort. NMD works by enlarging the matrices and vectors passed to the routines, replacing each original scalar with a matrix block augmented by derivative data; these blocks are constructed with special sparsity structures, termed "stencils," each designed to be isomorphic to a particular multidimensional hypercomplex algebra. The algebras are in turn designed such that Taylor expansions of hypercomplex function evaluations are finite in length and thus exactly track derivatives without approximation error. Although this use of the method in the "forward mode" is unique in its own right, it is also possible to apply it to existing implementations of the (first-order) discrete adjoint method to find high-order derivatives with lowered cost complexity; for example, for a problem with N inputs and an adjoint solver whose cost is independent of N--i.e., O(1)--the N x N Hessian can be found in O(N) time, which is comparable to existing second-order adjoint methods that require far more problem-specific implementation effort. Higher derivatives are likewise less expensive--e.g., a N x N x N rank-three tensor can be found in O(N2). Alternatively, a Hessian-vector product can be found in O(1) time, which may open up many matrix-based simulations to a range of existing optimization or surrogate modeling approaches. As a final corollary in parallel to the NMD-adjoint hybrid method, the existing complex-step differentiation (CD) technique is also shown to be capable of finding the Hessian-vector product. All variants are implemented on a stochastic diffusion problem and compared in-depth with various cost and accuracy metrics.

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.

Research on the application of a decoupling algorithm for structure analysis

NASA Technical Reports Server (NTRS)

Denman, E. D.

1980-01-01

The mathematical theory for decoupling mth-order matrix differential equations is presented. It is shown that the decoupling precedure can be developed from the algebraic theory of matrix polynomials. The role of eigenprojectors and latent projectors in the decoupling process is discussed and the mathematical relationships between eigenvalues, eigenvectors, latent roots, and latent vectors are developed. It is shown that the eigenvectors of the companion form of a matrix contains the latent vectors as a subset. The spectral decomposition of a matrix and the application to differential equations is given.

Predicting the past: a simple reverse stand table projection method

Treesearch

Quang V. Cao; Shanna M. McCarty

2006-01-01

A stand table gives number of trees in each diameter class. Future stand tables can be predicted from current stand tables using a stand table projection method. In the simplest form of this method, a future stand table can be expressed as the product of a matrix of transitional proportions (based on diameter growth rates) and a vector of the current stand table. There...

Walsh-Hadamard transform kernel-based feature vector for shot boundary detection.

PubMed

Lakshmi, Priya G G; Domnic, S

2014-12-01

Video shot boundary detection (SBD) is the first step of video analysis, summarization, indexing, and retrieval. In SBD process, videos are segmented into basic units called shots. In this paper, a new SBD method is proposed using color, edge, texture, and motion strength as vector of features (feature vector). Features are extracted by projecting the frames on selected basis vectors of Walsh-Hadamard transform (WHT) kernel and WHT matrix. After extracting the features, based on the significance of the features, weights are calculated. The weighted features are combined to form a single continuity signal, used as input for Procedure Based shot transition Identification process (PBI). Using the procedure, shot transitions are classified into abrupt and gradual transitions. Experimental results are examined using large-scale test sets provided by the TRECVID 2007, which has evaluated hard cut and gradual transition detection. To evaluate the robustness of the proposed method, the system evaluation is performed. The proposed method yields F1-Score of 97.4% for cut, 78% for gradual, and 96.1% for overall transitions. We have also evaluated the proposed feature vector with support vector machine classifier. The results show that WHT-based features can perform well than the other existing methods. In addition to this, few more video sequences are taken from the Openvideo project and the performance of the proposed method is compared with the recent existing SBD method.

River flow prediction using hybrid models of support vector regression with the wavelet transform, singular spectrum analysis and chaotic approach

NASA Astrophysics Data System (ADS)

Baydaroğlu, Özlem; Koçak, Kasım; Duran, Kemal

2018-06-01

Prediction of water amount that will enter the reservoirs in the following month is of vital importance especially for semi-arid countries like Turkey. Climate projections emphasize that water scarcity will be one of the serious problems in the future. This study presents a methodology for predicting river flow for the subsequent month based on the time series of observed monthly river flow with hybrid models of support vector regression (SVR). Monthly river flow over the period 1940-2012 observed for the Kızılırmak River in Turkey has been used for training the method, which then has been applied for predictions over a period of 3 years. SVR is a specific implementation of support vector machines (SVMs), which transforms the observed input data time series into a high-dimensional feature space (input matrix) by way of a kernel function and performs a linear regression in this space. SVR requires a special input matrix. The input matrix was produced by wavelet transforms (WT), singular spectrum analysis (SSA), and a chaotic approach (CA) applied to the input time series. WT convolutes the original time series into a series of wavelets, and SSA decomposes the time series into a trend, an oscillatory and a noise component by singular value decomposition. CA uses a phase space formed by trajectories, which represent the dynamics producing the time series. These three methods for producing the input matrix for the SVR proved successful, while the SVR-WT combination resulted in the highest coefficient of determination and the lowest mean absolute error.

Fast Eigensolver for Computing 3D Earth's Normal Modes

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

Prototype Vector Machine for Large Scale Semi-Supervised Learning

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

Zhang, Kai; Kwok, James T.; Parvin, Bahram

2009-04-29

Practicaldataminingrarelyfalls exactlyinto the supervisedlearning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised learning (SSL). We note that the computationalintensivenessofgraph-based SSLarises largely from the manifold or graph regularization, which in turn lead to large models that are dificult to handle. To alleviate this, we proposed the prototype vector machine (PVM), a highlyscalable,graph-based algorithm for large-scale SSL. Our key innovation is the use of"prototypes vectors" for effcient approximation on both the graph-based regularizer and model representation. The choice of prototypes are grounded upon two important criteria: they not only perform effective low-rank approximation of themore » kernel matrix, but also span a model suffering the minimum information loss compared with the complete model. We demonstrate encouraging performance and appealing scaling properties of the PVM on a number of machine learning benchmark data sets.« less

Aztec user`s guide. Version 1

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

Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S.

1995-10-01

Aztec is an iterative library that greatly simplifies the parallelization process when solving the linear systems of equations Ax = b where A is a user supplied n x n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. Aztec is intended as a software tool for users who want to avoid cumbersome parallel programming details but who have large sparse linear systems which require an efficiently utilized parallel processing system. A collection of data transformation tools are provided that allow for easy creation of distributed sparsemore » unstructured matrices for parallel solution. Once the distributed matrix is created, computation can be performed on any of the parallel machines running Aztec: nCUBE 2, IBM SP2 and Intel Paragon, MPI platforms as well as standard serial and vector platforms. Aztec includes a number of Krylov iterative methods such as conjugate gradient (CG), generalized minimum residual (GMRES) and stabilized biconjugate gradient (BICGSTAB) to solve systems of equations. These Krylov methods are used in conjunction with various preconditioners such as polynomial or domain decomposition methods using LU or incomplete LU factorizations within subdomains. Although the matrix A can be general, the package has been designed for matrices arising from the approximation of partial differential equations (PDEs). In particular, the Aztec package is oriented toward systems arising from PDE applications.« less

Angle-resolved spin wave band diagrams of square antidot lattices studied by Brillouin light scattering

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

Gubbiotti, G.; Tacchi, S.; Montoncello, F.

2015-06-29

The Brillouin light scattering technique has been exploited to study the angle-resolved spin wave band diagrams of squared Permalloy antidot lattice. Frequency dispersion of spin waves has been measured for a set of fixed wave vector magnitudes, while varying the wave vector in-plane orientation with respect to the applied magnetic field. The magnonic band gap between the two most dispersive modes exhibits a minimum value at an angular position, which exclusively depends on the product between the selected wave vector magnitude and the lattice constant of the array. The experimental data are in very good agreement with predictions obtained bymore » dynamical matrix method calculations. The presented results are relevant for magnonic devices where the antidot lattice, acting as a diffraction grating, is exploited to achieve multidirectional spin wave emission.« less

A fast, preconditioned conjugate gradient Toeplitz solver

NASA Technical Reports Server (NTRS)

Pan, Victor; Schrieber, Robert

1989-01-01

A simple factorization is given of an arbitrary hermitian, positive definite matrix in which the factors are well-conditioned, hermitian, and positive definite. In fact, given knowledge of the extreme eigenvalues of the original matrix A, an optimal improvement can be achieved, making the condition numbers of each of the two factors equal to the square root of the condition number of A. This technique is to applied to the solution of hermitian, positive definite Toeplitz systems. Large linear systems with hermitian, positive definite Toeplitz matrices arise in some signal processing applications. A stable fast algorithm is given for solving these systems that is based on the preconditioned conjugate gradient method. The algorithm exploits Toeplitz structure to reduce the cost of an iteration to O(n log n) by applying the fast Fourier Transform to compute matrix-vector products. Matrix factorization is used as a preconditioner.

Visualization of x-ray computer tomography using computer-generated holography

NASA Astrophysics Data System (ADS)

Daibo, Masahiro; Tayama, Norio

1998-09-01

The theory converted from x-ray projection data to the hologram directly by combining the computer tomography (CT) with the computer generated hologram (CGH), is proposed. The purpose of this study is to offer the theory for realizing the all- electronic and high-speed seeing through 3D visualization system, which is for the application to medical diagnosis and non- destructive testing. First, the CT is expressed using the pseudo- inverse matrix which is obtained by the singular value decomposition. CGH is expressed in the matrix style. Next, `projection to hologram conversion' (PTHC) matrix is calculated by the multiplication of phase matrix of CGH with pseudo-inverse matrix of the CT. Finally, the projection vector is converted to the hologram vector directly, by multiplication of the PTHC matrix with the projection vector. Incorporating holographic analog computation into CT reconstruction, it becomes possible that the calculation amount is drastically reduced. We demonstrate the CT cross section which is reconstituted by He-Ne laser in the 3D space from the real x-ray projection data acquired by x-ray television equipment, using our direct conversion technique.

Solving lattice QCD systems of equations using mixed precision solvers on GPUs

NASA Astrophysics Data System (ADS)

Clark, M. A.; Babich, R.; Barros, K.; Brower, R. C.; Rebbi, C.

2010-09-01

Modern graphics hardware is designed for highly parallel numerical tasks and promises significant cost and performance benefits for many scientific applications. One such application is lattice quantum chromodynamics (lattice QCD), where the main computational challenge is to efficiently solve the discretized Dirac equation in the presence of an SU(3) gauge field. Using NVIDIA's CUDA platform we have implemented a Wilson-Dirac sparse matrix-vector product that performs at up to 40, 135 and 212 Gflops for double, single and half precision respectively on NVIDIA's GeForce GTX 280 GPU. We have developed a new mixed precision approach for Krylov solvers using reliable updates which allows for full double precision accuracy while using only single or half precision arithmetic for the bulk of the computation. The resulting BiCGstab and CG solvers run in excess of 100 Gflops and, in terms of iterations until convergence, perform better than the usual defect-correction approach for mixed precision.

Kinetic-energy matrix elements for atomic Hylleraas-CI wave functions

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

Harris, Frank E., E-mail: harris@qtp.ufl.edu

Hylleraas-CI is a superposition-of-configurations method in which each configuration is constructed from a Slater-type orbital (STO) product to which is appended (linearly) at most one interelectron distance r{sub ij}. Computations of the kinetic energy for atoms by this method have been difficult due to the lack of formulas expressing these matrix elements for general angular momentum in terms of overlap and potential-energy integrals. It is shown here that a strategic application of angular-momentum theory, including the use of vector spherical harmonics, enables the reduction of all atomic kinetic-energy integrals to overlap and potential-energy matrix elements. The new formulas are validatedmore » by showing that they yield correct results for a large number of integrals published by other investigators.« less

Refractive index inversion based on Mueller matrix method

NASA Astrophysics Data System (ADS)

Fan, Huaxi; Wu, Wenyuan; Huang, Yanhua; Li, Zhaozhao

2016-03-01

Based on Stokes vector and Jones vector, the correlation between Mueller matrix elements and refractive index was studied with the result simplified, and through Mueller matrix way, the expression of refractive index inversion was deduced. The Mueller matrix elements, under different incident angle, are simulated through the expression of specular reflection so as to analyze the influence of the angle of incidence and refractive index on it, which is verified through the measure of the Mueller matrix elements of polished metal surface. Research shows that, under the condition of specular reflection, the result of Mueller matrix inversion is consistent with the experiment and can be used as an index of refraction of inversion method, and it provides a new way for target detection and recognition technology.

SVPWM Technique with Varying DC-Link Voltage for Common Mode Voltage Reduction in a Matrix Converter and Analytical Estimation of its Output Voltage Distortion

NASA Astrophysics Data System (ADS)

Padhee, Varsha

Common Mode Voltage (CMV) in any power converter has been the major contributor to premature motor failures, bearing deterioration, shaft voltage build up and electromagnetic interference. Intelligent control methods like Space Vector Pulse Width Modulation (SVPWM) techniques provide immense potential and flexibility to reduce CMV, thereby targeting all the afore mentioned problems. Other solutions like passive filters, shielded cables and EMI filters add to the volume and cost metrics of the entire system. Smart SVPWM techniques therefore, come with a very important advantage of being an economical solution. This thesis discusses a modified space vector technique applied to an Indirect Matrix Converter (IMC) which results in the reduction of common mode voltages and other advanced features. The conventional indirect space vector pulse-width modulation (SVPWM) method of controlling matrix converters involves the usage of two adjacent active vectors and one zero vector for both rectifying and inverting stages of the converter. By suitable selection of space vectors, the rectifying stage of the matrix converter can generate different levels of virtual DC-link voltage. This capability can be exploited for operation of the converter in different ranges of modulation indices for varying machine speeds. This results in lower common mode voltage and improves the harmonic spectrum of the output voltage, without increasing the number of switching transitions as compared to conventional modulation. To summarize it can be said that the responsibility of formulating output voltages with a particular magnitude and frequency has been transferred solely to the rectifying stage of the IMC. Estimation of degree of distortion in the three phase output voltage is another facet discussed in this thesis. An understanding of the SVPWM technique and the switching sequence of the space vectors in detail gives the potential to estimate the RMS value of the switched output voltage of any converter. This conceivably aids the sizing and design of output passive filters. An analytical estimation method has been presented to achieve this purpose for am IMC. Knowledge of the fundamental component in output voltage can be utilized to calculate its Total Harmonic Distortion (THD). The effectiveness of the proposed SVPWM algorithms and the analytical estimation technique is substantiated by simulations in MATLAB / Simulink and experiments on a laboratory prototype of the IMC. Proper comparison plots have been provided to contrast the performance of the proposed methods with the conventional SVPWM method. The behavior of output voltage distortion and CMV with variation in operating parameters like modulation index and output frequency has also been analyzed.

FPGA architecture and implementation of sparse matrix vector multiplication for the finite element method

NASA Astrophysics Data System (ADS)

Elkurdi, Yousef; Fernández, David; Souleimanov, Evgueni; Giannacopoulos, Dennis; Gross, Warren J.

2008-04-01

The Finite Element Method (FEM) is a computationally intensive scientific and engineering analysis tool that has diverse applications ranging from structural engineering to electromagnetic simulation. The trends in floating-point performance are moving in favor of Field-Programmable Gate Arrays (FPGAs), hence increasing interest has grown in the scientific community to exploit this technology. We present an architecture and implementation of an FPGA-based sparse matrix-vector multiplier (SMVM) for use in the iterative solution of large, sparse systems of equations arising from FEM applications. FEM matrices display specific sparsity patterns that can be exploited to improve the efficiency of hardware designs. Our architecture exploits FEM matrix sparsity structure to achieve a balance between performance and hardware resource requirements by relying on external SDRAM for data storage while utilizing the FPGAs computational resources in a stream-through systolic approach. The architecture is based on a pipelined linear array of processing elements (PEs) coupled with a hardware-oriented matrix striping algorithm and a partitioning scheme which enables it to process arbitrarily big matrices without changing the number of PEs in the architecture. Therefore, this architecture is only limited by the amount of external RAM available to the FPGA. The implemented SMVM-pipeline prototype contains 8 PEs and is clocked at 110 MHz obtaining a peak performance of 1.76 GFLOPS. For 8 GB/s of memory bandwidth typical of recent FPGA systems, this architecture can achieve 1.5 GFLOPS sustained performance. Using multiple instances of the pipeline, linear scaling of the peak and sustained performance can be achieved. Our stream-through architecture provides the added advantage of enabling an iterative implementation of the SMVM computation required by iterative solution techniques such as the conjugate gradient method, avoiding initialization time due to data loading and setup inside the FPGA internal memory.

A study of multi-jet production in association with an electroweak vector boson

DOE PAGES

Frederix, R.; Frixione, S.; Papaefstathiou, A.; ...

2016-02-19

Here, we consider the production of a single Z or W boson in association with jets at the LHC. We compute the corresponding cross sections by matching NLO QCD predictions with the Herwig++ and Pythia8 parton showers, and by merging all of the underlying matrix elements with up to two light partons at the Born level. We compare our results with several 7-TeV measurements by the ATLAS and CMS collaborations, and overall we find a good agreement between theory and data.

Proceedings of Workshop on Atmospheric Density and Aerodynamic Drag Models for Air Force Operations Held at Air Force Geophysics Laboratory on 20-22 October 1987. Volume 1

DTIC Science & Technology

1990-02-13

considered with these production processes in a simple photochemical equilibrium calculation , we are able to determine the contribution each makes to the...Hessian matrix of second derivatives (which is required in the Newton-Raphson procedure) by the vector product of the gradient (VJ) and its transpose...was focused on the altitude region 80-250 Km. Papers were presented in the folowing areas: Air Force requirements , physics of density and drag

Standard Free Droplet Digital Polymerase Chain Reaction as a New Tool for the Quality Control of High-Capacity Adenoviral Vectors in Small-Scale Preparations

PubMed Central

Boehme, Philip; Stellberger, Thorsten; Solanki, Manish; Zhang, Wenli; Schulz, Eric; Bergmann, Thorsten; Liu, Jing; Doerner, Johannes; Baiker, Armin E.

2015-01-01

Abstract High-capacity adenoviral vectors (HCAdVs) are promising tools for gene therapy as well as for genetic engineering. However, one limitation of the HCAdV vector system is the complex, time-consuming, and labor-intensive production process and the following quality control procedure. Since HCAdVs are deleted for all viral coding sequences, a helper virus (HV) is needed in the production process to provide the sequences for all viral proteins in trans. For the purification procedure of HCAdV, cesium chloride density gradient centrifugation is usually performed followed by buffer exchange using dialysis or comparable methods. However, performing these steps is technically difficult, potentially error-prone, and not scalable. Here, we establish a new protocol for small-scale production of HCAdV based on commercially available adenovirus purification systems and a standard method for the quality control of final HCAdV preparations. For titration of final vector preparations, we established a droplet digital polymerase chain reaction (ddPCR) that uses a standard free-end-point PCR in small droplets of defined volume. By using different probes, this method is capable of detecting and quantifying HCAdV and HV in one reaction independent of reference material, rendering this method attractive for accurately comparing viral titers between different laboratories. In summary, we demonstrate that it is possible to produce HCAdV in a small scale of sufficient quality and quantity to perform experiments in cell culture, and we established a reliable protocol for vector titration based on ddPCR. Our method significantly reduces time and required equipment to perform HCAdV production. In the future the ddPCR technology could be advantageous for titration of other viral vectors commonly used in gene therapy. PMID:25640117

Computation of ancestry scores with mixed families and unrelated individuals.

PubMed

Zhou, Yi-Hui; Marron, James S; Wright, Fred A

2018-03-01

The issue of robustness to family relationships in computing genotype ancestry scores such as eigenvector projections has received increased attention in genetic association, and is particularly challenging when sets of both unrelated individuals and closely related family members are included. The current standard is to compute loadings (left singular vectors) using unrelated individuals and to compute projected scores for remaining family members. However, projected ancestry scores from this approach suffer from shrinkage toward zero. We consider two main novel strategies: (i) matrix substitution based on decomposition of a target family-orthogonalized covariance matrix, and (ii) using family-averaged data to obtain loadings. We illustrate the performance via simulations, including resampling from 1000 Genomes Project data, and analysis of a cystic fibrosis dataset. The matrix substitution approach has similar performance to the current standard, but is simple and uses only a genotype covariance matrix, while the family-average method shows superior performance. Our approaches are accompanied by novel ancillary approaches that provide considerable insight, including individual-specific eigenvalue scree plots. © 2017 The Authors. Biometrics published by Wiley Periodicals, Inc. on behalf of International Biometric Society.

Research and simulation of the decoupling transformation in AC motor vector control

NASA Astrophysics Data System (ADS)

He, Jiaojiao; Zhao, Zhongjie; Liu, Ken; Zhang, Yongping; Yao, Tuozhong

2018-04-01

Permanent magnet synchronous motor (PMSM) is a nonlinear, strong coupling, multivariable complex object, and transformation decoupling can solve the coupling problem of permanent magnet synchronous motor. This paper gives a permanent magnet synchronous motor (PMSM) mathematical model, introduces the permanent magnet synchronous motor vector control coordinate transformation in the process of modal matrix inductance matrix transform through the matrix related knowledge of different coordinates of diagonalization, which makes the coupling between the independent, realize the control of motor current and excitation the torque current coupling separation, and derived the coordinate transformation matrix, the thought to solve the coupling problem of AC motor. Finally, in the Matlab/Simulink environment, through the establishment and combination between the PMSM ontology, coordinate conversion module, built the simulation model of permanent magnet synchronous motor vector control, introduces the model of each part, and analyzed the simulation results.

Preconditioned MoM Solutions for Complex Planar Arrays

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

Fasenfest, B J; Jackson, D; Champagne, N

2004-01-23

The numerical analysis of large arrays is a complex problem. There are several techniques currently under development in this area. One such technique is the FAIM (Faster Adaptive Integral Method). This method uses a modification of the standard AIM approach which takes into account the reusability properties of matrices that arise from identical array elements. If the array consists of planar conducting bodies, the array elements are meshed using standard subdomain basis functions, such as the RWG basis. These bases are then projected onto a regular grid of interpolating polynomials. This grid can then be used in a 2D ormore » 3D FFT to accelerate the matrix-vector product used in an iterative solver. The method has been proven to greatly reduce solve time by speeding the matrix-vector product computation. The FAIM approach also reduces fill time and memory requirements, since only the near element interactions need to be calculated exactly. The present work extends FAIM by modifying it to allow for layered material Green's Functions and dielectrics. In addition, a preconditioner is implemented to greatly reduce the number of iterations required for a solution. The general scheme of the FAIM method is reported in; this contribution is limited to presenting new results.« less

Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models

NASA Technical Reports Server (NTRS)

Buchholz, Peter; Ciardo, Gianfranco; Donatelli, Susanna; Kemper, Peter

1997-01-01

We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to: (1) managing certain types of state-dependent behavior without incurring extra cost; (2) supporting both Jacobi-style and Gauss-Seidel-style methods by appropriate multiplication algorithms; (3) speeding up algorithms that consider probability vectors of size equal to the "actual" state space instead of the "potential" state space.

Vector production in an academic environment: a tool to assess production costs.

PubMed

Boeke, Aaron; Doumas, Patrick; Reeves, Lilith; McClurg, Kyle; Bischof, Daniela; Sego, Lina; Auberry, Alisha; Tatikonda, Mohan; Cornetta, Kenneth

2013-02-01

Generating gene and cell therapy products under good manufacturing practices is a complex process. When determining the cost of these products, researchers must consider the large number of supplies used for manufacturing and the personnel and facility costs to generate vector and maintain a cleanroom facility. To facilitate cost estimates, the Indiana University Vector Production Facility teamed with the Indiana University Kelley School of Business to develop a costing tool that, in turn, provides pricing. The tool is designed in Microsoft Excel and is customizable to meet the needs of other core facilities. It is available from the National Gene Vector Biorepository. The tool allows cost determinations using three different costing methods and was developed in an effort to meet the A21 circular requirements for U.S. core facilities performing work for federally funded projects. The costing tool analysis reveals that the cost of vector production does not have a linear relationship with batch size. For example, increasing the production from 9 to18 liters of a retroviral vector product increases total costs a modest 1.2-fold rather than doubling in total cost. The analysis discussed in this article will help core facilities and investigators plan a cost-effective strategy for gene and cell therapy production.

Vector Production in an Academic Environment: A Tool to Assess Production Costs

PubMed Central

Boeke, Aaron; Doumas, Patrick; Reeves, Lilith; McClurg, Kyle; Bischof, Daniela; Sego, Lina; Auberry, Alisha; Tatikonda, Mohan

2013-01-01

Abstract Generating gene and cell therapy products under good manufacturing practices is a complex process. When determining the cost of these products, researchers must consider the large number of supplies used for manufacturing and the personnel and facility costs to generate vector and maintain a cleanroom facility. To facilitate cost estimates, the Indiana University Vector Production Facility teamed with the Indiana University Kelley School of Business to develop a costing tool that, in turn, provides pricing. The tool is designed in Microsoft Excel and is customizable to meet the needs of other core facilities. It is available from the National Gene Vector Biorepository. The tool allows cost determinations using three different costing methods and was developed in an effort to meet the A21 circular requirements for U.S. core facilities performing work for federally funded projects. The costing tool analysis reveals that the cost of vector production does not have a linear relationship with batch size. For example, increasing the production from 9 to18 liters of a retroviral vector product increases total costs a modest 1.2-fold rather than doubling in total cost. The analysis discussed in this article will help core facilities and investigators plan a cost-effective strategy for gene and cell therapy production. PMID:23360377

Estimation of the chemical rank for the three-way data: a principal norm vector orthogonal projection approach.

PubMed

Hong-Ping, Xie; Jian-Hui, Jiang; Guo-Li, Shen; Ru-Qin, Yu

2002-01-01

A new approach for estimating the chemical rank of the three-way array called the principal norm vector orthogonal projection method has been proposed. The method is based on the fact that the chemical rank of the three-way data array is equal to one of the column space of the unfolded matrix along the spectral or chromatographic mode. A vector with maximum Frobenius norm is selected among all the column vectors of the unfolded matrix as the principal norm vector (PNV). A transformation is conducted for the column vectors with an orthogonal projection matrix formulated by PNV. The mathematical rank of the column space of the residual matrix thus obtained should decrease by one. Such orthogonal projection is carried out repeatedly till the contribution of chemical species to the signal data is all deleted. At this time the decrease of the mathematical rank would equal that of the chemical rank, and the remaining residual subspace would entirely be due to the noise contribution. The chemical rank can be estimated easily by using an F-test. The method has been used successfully to the simulated HPLC-DAD type three-way data array and two real excitation-emission fluorescence data sets of amino acid mixtures and dye mixtures. The simulation with added relatively high level noise shows that the method is robust in resisting the heteroscedastic noise. The proposed algorithm is simple and easy to program with quite light computational burden.

Activation product transport in fusion reactors. [RAPTOR

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

Klein, A.C.

1983-01-01

Activated corrosion and neutron sputtering products will enter the coolant and/or tritium breeding material of fusion reactor power plants and experiments and cause personnel access problems. Radiation levels around plant components due to these products will cause difficulties with maintenance and repair operations throughout the plant. Similar problems are experienced around fission reactor systems. The determination of the transport of radioactive corrosion and neutron sputtering products through the system is achieved using the computer code RAPTOR. This code calculates the mass transfer of a number of activation products based on the corrosion and sputtering rates through the system, the depositionmore » and release characteristics of various plant components, the neturon flux spectrum, as well as other plant parameters. RAPTOR assembles a system of first order linear differential equations into a matrix equation based upon the reactor system parameters. Included in the transfer matrix are the deposition and erosion coefficients, and the decay and activation data for the various plant nodes and radioactive isotopes. A source vector supplies the corrosion and neutron sputtering source rates. This matrix equation is then solved using a matrix operator technique to give the specific activity distribution of each radioactive species throughout the plant. Once the amount of mass transfer is determined, the photon transport due to the radioactive corrosion and sputtering product sources can be evaluated, and dose rates around the plant components of interest as a function of time can be determined. This method has been used to estimate the radiation hazards around a number of fusion reactor system designs.« less

Understanding Singular Vectors

ERIC Educational Resources Information Center

James, David; Botteron, Cynthia

2013-01-01

matrix yields a surprisingly simple, heuristical approximation to its singular vectors. There are correspondingly good approximations to the singular values. Such rules of thumb provide an intuitive interpretation of the singular vectors that helps explain why the SVD is so…

Implementation of biological tissue Mueller matrix for polarization-sensitive optical coherence tomography based on LabVIEW

NASA Astrophysics Data System (ADS)

Lin, Yongping; Zhang, Xiyang; He, Youwu; Cai, Jianyong; Li, Hui

2018-02-01

The Jones matrix and the Mueller matrix are main tools to study polarization devices. The Mueller matrix can also be used for biological tissue research to get complete tissue properties, while the commercial optical coherence tomography system does not give relevant analysis function. Based on the LabVIEW, a near real time display method of Mueller matrix image of biological tissue is developed and it gives the corresponding phase retardant image simultaneously. A quarter-wave plate was placed at 45 in the sample arm. Experimental results of the two orthogonal channels show that the phase retardance based on incident light vector fixed mode and the Mueller matrix based on incident light vector dynamic mode can provide an effective analysis method of the existing system.

Ghost instabilities of cosmological models with vector fields nonminimally coupled to the curvature

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

Himmetoglu, Burak; Peloso, Marco; Contaldi, Carlo R.

2009-12-15

We prove that many cosmological models characterized by vectors nonminimally coupled to the curvature (such as the Turner-Widrow mechanism for the production of magnetic fields during inflation, and models of vector inflation or vector curvaton) contain ghosts. The ghosts are associated with the longitudinal vector polarization present in these models and are found from studying the sign of the eigenvalues of the kinetic matrix for the physical perturbations. Ghosts introduce two main problems: (1) they make the theories ill defined at the quantum level in the high energy/subhorizon regime (and create serious problems for finding a well-behaved UV completion), andmore » (2) they create an instability already at the linearized level. This happens because the eigenvalue corresponding to the ghost crosses zero during the cosmological evolution. At this point the linearized equations for the perturbations become singular (we show that this happens for all the models mentioned above). We explicitly solve the equations in the simplest cases of a vector without a vacuum expectation value in a Friedmann-Robertson-Walker geometry, and of a vector with a vacuum expectation value plus a cosmological constant, and we show that indeed the solutions of the linearized equations diverge when these equations become singular.« less

Quantitative analysis of eyes and other optical systems in linear optics.

PubMed

Harris, William F; Evans, Tanya; van Gool, Radboud D

2017-05-01

To show that 14-dimensional spaces of augmented point P and angle Q characteristics, matrices obtained from the ray transference, are suitable for quantitative analysis although only the latter define an inner-product space and only on it can one define distances and angles. The paper examines the nature of the spaces and their relationships to other spaces including symmetric dioptric power space. The paper makes use of linear optics, a three-dimensional generalization of Gaussian optics. Symmetric 2 × 2 dioptric power matrices F define a three-dimensional inner-product space which provides a sound basis for quantitative analysis (calculation of changes, arithmetic means, etc.) of refractive errors and thin systems. For general systems the optical character is defined by the dimensionally-heterogeneous 4 × 4 symplectic matrix S, the transference, or if explicit allowance is made for heterocentricity, the 5 × 5 augmented symplectic matrix T. Ordinary quantitative analysis cannot be performed on them because matrices of neither of these types constitute vector spaces. Suitable transformations have been proposed but because the transforms are dimensionally heterogeneous the spaces are not naturally inner-product spaces. The paper obtains 14-dimensional spaces of augmented point P and angle Q characteristics. The 14-dimensional space defined by the augmented angle characteristics Q is dimensionally homogenous and an inner-product space. A 10-dimensional subspace of the space of augmented point characteristics P is also an inner-product space. The spaces are suitable for quantitative analysis of the optical character of eyes and many other systems. Distances and angles can be defined in the inner-product spaces. The optical systems may have multiple separated astigmatic and decentred refracting elements. © 2017 The Authors Ophthalmic & Physiological Optics © 2017 The College of Optometrists.

Angular-Rate Estimation Using Delayed Quaternion Measurements

NASA Technical Reports Server (NTRS)

Azor, R.; Bar-Itzhack, I. Y.; Harman, R. R.

1999-01-01

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared one that uses differentiated quaternion measurements to yield coarse rate measurements, which are then fed into two different estimators. In the other approach the raw quaternion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear part of the rotas rotational dynamics equation of a body into a product of an angular-rate dependent matrix and the angular-rate vector itself. This non unique decomposition, enables the treatment of the nonlinear spacecraft (SC) dynamics model as a linear one and, thus, the application of a PseudoLinear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the gain matrix and thus eliminates the need to compute recursively the filter covariance matrix. The replacement of the rotational dynamics by a simple Markov model is also examined. In this paper special consideration is given to the problem of delayed quaternion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results are presented.

Systematic Constraint Selection Strategy for Rate-Controlled Constrained-Equilibrium Modeling of Complex Nonequilibrium Chemical Kinetics

NASA Astrophysics Data System (ADS)

Beretta, Gian Paolo; Rivadossi, Luca; Janbozorgi, Mohammad

2018-04-01

Rate-Controlled Constrained-Equilibrium (RCCE) modeling of complex chemical kinetics provides acceptable accuracies with much fewer differential equations than for the fully Detailed Kinetic Model (DKM). Since its introduction by James C. Keck, a drawback of the RCCE scheme has been the absence of an automatable, systematic procedure to identify the constraints that most effectively warrant a desired level of approximation for a given range of initial, boundary, and thermodynamic conditions. An optimal constraint identification has been recently proposed. Given a DKM with S species, E elements, and R reactions, the procedure starts by running a probe DKM simulation to compute an S-vector that we call overall degree of disequilibrium (ODoD) because its scalar product with the S-vector formed by the stoichiometric coefficients of any reaction yields its degree of disequilibrium (DoD). The ODoD vector evolves in the same (S-E)-dimensional stoichiometric subspace spanned by the R stoichiometric S-vectors. Next we construct the rank-(S-E) matrix of ODoD traces obtained from the probe DKM numerical simulation and compute its singular value decomposition (SVD). By retaining only the first C largest singular values of the SVD and setting to zero all the others we obtain the best rank-C approximation of the matrix of ODoD traces whereby its columns span a C-dimensional subspace of the stoichiometric subspace. This in turn yields the best approximation of the evolution of the ODoD vector in terms of only C parameters that we call the constraint potentials. The resulting order-C RCCE approximate model reduces the number of independent differential equations related to species, mass, and energy balances from S+2 to C+E+2, with substantial computational savings when C ≪ S-E.

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

NASA Astrophysics Data System (ADS)

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

2018-06-01

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

Distance learning in discriminative vector quantization.

PubMed

Schneider, Petra; Biehl, Michael; Hammer, Barbara

2009-10-01

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

Acoustic 3D modeling by the method of integral equations

NASA Astrophysics Data System (ADS)

Malovichko, M.; Khokhlov, N.; Yavich, N.; Zhdanov, M.

2018-02-01

This paper presents a parallel algorithm for frequency-domain acoustic modeling by the method of integral equations (IE). The algorithm is applied to seismic simulation. The IE method reduces the size of the problem but leads to a dense system matrix. A tolerable memory consumption and numerical complexity were achieved by applying an iterative solver, accompanied by an effective matrix-vector multiplication operation, based on the fast Fourier transform (FFT). We demonstrate that, the IE system matrix is better conditioned than that of the finite-difference (FD) method, and discuss its relation to a specially preconditioned FD matrix. We considered several methods of matrix-vector multiplication for the free-space and layered host models. The developed algorithm and computer code were benchmarked against the FD time-domain solution. It was demonstrated that, the method could accurately calculate the seismic field for the models with sharp material boundaries and a point source and receiver located close to the free surface. We used OpenMP to speed up the matrix-vector multiplication, while MPI was used to speed up the solution of the system equations, and also for parallelizing across multiple sources. The practical examples and efficiency tests are presented as well.

V+jets Background and Systematic Uncertainties in Top Quark Analyses

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

Adomeit, Stefanie; Peters, Reinhild Yvonne

2014-12-01

Vector boson production in association with jets is an important process to test perturbative quantum chromodynamics and also a background process in top quark analyses. Measurements on vector boson production in association with light and heavy flavour jets are presented, performed by the D0 and CDF collaborations at the Tevatron as well as the ATLAS and CMS experiments at LHC. Techniques applied in top quark analyses to estimate the vector boson+jets background are also discussed.

Data-driven probability concentration and sampling on manifold

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

Soize, C., E-mail: christian.soize@univ-paris-est.fr; Ghanem, R., E-mail: ghanem@usc.edu

2016-09-15

A new methodology is proposed for generating realizations of a random vector with values in a finite-dimensional Euclidean space that are statistically consistent with a dataset of observations of this vector. The probability distribution of this random vector, while a priori not known, is presumed to be concentrated on an unknown subset of the Euclidean space. A random matrix is introduced whose columns are independent copies of the random vector and for which the number of columns is the number of data points in the dataset. The approach is based on the use of (i) the multidimensional kernel-density estimation methodmore » for estimating the probability distribution of the random matrix, (ii) a MCMC method for generating realizations for the random matrix, (iii) the diffusion-maps approach for discovering and characterizing the geometry and the structure of the dataset, and (iv) a reduced-order representation of the random matrix, which is constructed using the diffusion-maps vectors associated with the first eigenvalues of the transition matrix relative to the given dataset. The convergence aspects of the proposed methodology are analyzed and a numerical validation is explored through three applications of increasing complexity. The proposed method is found to be robust to noise levels and data complexity as well as to the intrinsic dimension of data and the size of experimental datasets. Both the methodology and the underlying mathematical framework presented in this paper contribute new capabilities and perspectives at the interface of uncertainty quantification, statistical data analysis, stochastic modeling and associated statistical inverse problems.« less

Extending R packages to support 64-bit compiled code: An illustration with spam64 and GIMMS NDVI3g data

NASA Astrophysics Data System (ADS)

Gerber, Florian; Mösinger, Kaspar; Furrer, Reinhard

2017-07-01

Software packages for spatial data often implement a hybrid approach of interpreted and compiled programming languages. The compiled parts are usually written in C, C++, or Fortran, and are efficient in terms of computational speed and memory usage. Conversely, the interpreted part serves as a convenient user-interface and calls the compiled code for computationally demanding operations. The price paid for the user friendliness of the interpreted component is-besides performance-the limited access to low level and optimized code. An example of such a restriction is the 64-bit vector support of the widely used statistical language R. On the R side, users do not need to change existing code and may not even notice the extension. On the other hand, interfacing 64-bit compiled code efficiently is challenging. Since many R packages for spatial data could benefit from 64-bit vectors, we investigate strategies to efficiently pass 64-bit vectors to compiled languages. More precisely, we show how to simply extend existing R packages using the foreign function interface to seamlessly support 64-bit vectors. This extension is shown with the sparse matrix algebra R package spam. The new capabilities are illustrated with an example of GIMMS NDVI3g data featuring a parametric modeling approach for a non-stationary covariance matrix.

Targeted Adenoviral Vector Demonstrates Enhanced Efficacy for In Vivo Gene Therapy of Uterine Leiomyoma

PubMed Central

Abdelaziz, Mohamed; Sherif, Lotfy; ElKhiary, Mostafa; Nair, Sanjeeta; Shalaby, Shahinaz; Mohamed, Sara; Eziba, Noura; El-Lakany, Mohamed; Curiel, David; Ismail, Nahed; Diamond, Michael P.; Al-Hendy, Ayman

2016-01-01

Background: Gene therapy is a potentially effective non-surgical approach for the treatment of uterine leiomyoma. We demonstrated that targeted adenovirus vector, Ad-SSTR-RGD-TK/GCV, was highly effective in selectively inducing apoptosis and inhibiting proliferation of human leiomyoma cells in vitro while sparing normal myometrial cells. Study design: An in-vivo study, to compare efficacy and safety of modified adenovirus vector Ad-SSTR-RGD-TK/GCV versus untargeted vector for treatment of leiomyoma. Materials and methods: Female nude mice were implanted with rat leiomyoma cells subcutaneously. Then mice were randomized into three groups. Group 1 received Ad-LacZ (marker gene), Group 2 received untargeted Ad-TK, and Group 3 received the targeted Ad-SSTR-RGD-TK. Tumors were measured weekly for 4 weeks. Then mice were sacrificed and tissue samples were collected. Evaluation of markers of apoptosis, proliferation, extracellular matrix, and angiogenesis was performed using Western Blot & Immunohistochemistry. Statistical analysis was done using ANOVA. Dissemination of adenovirus was assessed by PCR. Results: In comparison with the untargeted vector, the targeted adenoviral vector significantly shrank leiomyoma size (P < 0.05), reduced expression of proliferation marker (PCNA) (P < 0.05), induced expression of apoptotic protein, c-PARP-1, (P < 0.05) and inhibited expression of extracellular matrix-related genes (TGF beta 3) and angiogenesis-related genes (VEGF & IGF-1) (P < 0.01). There were no detectable adenovirus in tested tissues other than leiomyoma lesions with both targeted and untargeted adenovirus. Conclusion: Targeted adenovirus, effectively reduces tumor size in leiomyoma without dissemination to other organs. Further evaluation of this localized targeted strategy for gene therapy is needed in appropriate preclinical humanoid animal models in preparation for a future pilot human trial. PMID:26884457

Targeted Adenoviral Vector Demonstrates Enhanced Efficacy for In Vivo Gene Therapy of Uterine Leiomyoma.

PubMed

Abdelaziz, Mohamed; Sherif, Lotfy; ElKhiary, Mostafa; Nair, Sanjeeta; Shalaby, Shahinaz; Mohamed, Sara; Eziba, Noura; El-Lakany, Mohamed; Curiel, David; Ismail, Nahed; Diamond, Michael P; Al-Hendy, Ayman

2016-04-01

Gene therapy is a potentially effective non-surgical approach for the treatment of uterine leiomyoma. We demonstrated that targeted adenovirus vector, Ad-SSTR-RGD-TK/GCV, was highly effective in selectively inducing apoptosis and inhibiting proliferation of human leiomyoma cells in vitro while sparing normal myometrial cells. An in-vivo study, to compare efficacy and safety of modified adenovirus vector Ad-SSTR-RGD-TK/GCV versus untargeted vector for treatment of leiomyoma. Female nude mice were implanted with rat leiomyoma cells subcutaneously. Then mice were randomized into three groups. Group 1 received Ad-LacZ (marker gene), Group 2 received untargeted Ad-TK, and Group 3 received the targeted Ad-SSTR-RGD-TK. Tumors were measured weekly for 4 weeks. Then mice were sacrificed and tissue samples were collected. Evaluation of markers of apoptosis, proliferation, extracellular matrix, and angiogenesis was performed using Western Blot & Immunohistochemistry. Statistical analysis was done using ANOVA. Dissemination of adenovirus was assessed by PCR. In comparison with the untargeted vector, the targeted adenoviral vector significantly shrank leiomyoma size (P < 0.05), reduced expression of proliferation marker (PCNA) (P < 0.05), induced expression of apoptotic protein, c-PARP-1, (P < 0.05) and inhibited expression of extracellular matrix-related genes (TGF beta 3) and angiogenesis-related genes (VEGF & IGF-1) (P < 0.01). There were no detectable adenovirus in tested tissues other than leiomyoma lesions with both targeted and untargeted adenovirus. Targeted adenovirus, effectively reduces tumor size in leiomyoma without dissemination to other organs. Further evaluation of this localized targeted strategy for gene therapy is needed in appropriate preclinical humanoid animal models in preparation for a future pilot human trial. © The Author(s) 2016.

Pushing Memory Bandwidth Limitations Through Efficient Implementations of Block-Krylov Space Solvers on GPUs

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

Clark, M. A.; Strelchenko, Alexei; Vaquero, Alejandro

Lattice quantum chromodynamics simulations in nuclear physics have benefited from a tremendous number of algorithmic advances such as multigrid and eigenvector deflation. These improve the time to solution but do not alleviate the intrinsic memory-bandwidth constraints of the matrix-vector operation dominating iterative solvers. Batching this operation for multiple vectors and exploiting cache and register blocking can yield a super-linear speed up. Block-Krylov solvers can naturally take advantage of such batched matrix-vector operations, further reducing the iterations to solution by sharing the Krylov space between solves. However, practical implementations typically suffer from the quadratic scaling in the number of vector-vector operations.more » Using the QUDA library, we present an implementation of a block-CG solver on NVIDIA GPUs which reduces the memory-bandwidth complexity of vector-vector operations from quadratic to linear. We present results for the HISQ discretization, showing a 5x speedup compared to highly-optimized independent Krylov solves on NVIDIA's SaturnV cluster.« less

Equiangular tight frames and unistochastic matrices

NASA Astrophysics Data System (ADS)

Goyeneche, Dardo; Turek, Ondřej

2017-06-01

We demonstrate that a complex equiangular tight frame composed of N vectors in dimension d, denoted ETF (d, N), exists if and only if a certain bistochastic matrix, univocally determined by N and d, belongs to a special class of unistochastic matrices. This connection allows us to find new complex ETFs in infinitely many dimensions and to derive a method to introduce non-trivial free parameters in ETFs. We present an explicit six-parametric family of complex ETF(6,16), which defines a family of symmetric POVMs. Minimal and maximal possible average entanglement of the vectors within this qubit-qutrit family are described. Furthermore, we propose an efficient numerical procedure to compute the unitary matrix underlying a unistochastic matrix, which we apply to find all existing classes of complex ETFs containing up to 20 vectors.

Efficient ICCG on a shared memory multiprocessor

NASA Technical Reports Server (NTRS)

Hammond, Steven W.; Schreiber, Robert

1989-01-01

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

A comparison of linear approaches to filter out environmental effects in structural health monitoring

NASA Astrophysics Data System (ADS)

Deraemaeker, A.; Worden, K.

2018-05-01

This paper discusses the possibility of using the Mahalanobis squared-distance to perform robust novelty detection in the presence of important environmental variability in a multivariate feature vector. By performing an eigenvalue decomposition of the covariance matrix used to compute that distance, it is shown that the Mahalanobis squared-distance can be written as the sum of independent terms which result from a transformation from the feature vector space to a space of independent variables. In general, especially when the size of the features vector is large, there are dominant eigenvalues and eigenvectors associated with the covariance matrix, so that a set of principal components can be defined. Because the associated eigenvalues are high, their contribution to the Mahalanobis squared-distance is low, while the contribution of the other components is high due to the low value of the associated eigenvalues. This analysis shows that the Mahalanobis distance naturally filters out the variability in the training data. This property can be used to remove the effect of the environment in damage detection, in much the same way as two other established techniques, principal component analysis and factor analysis. The three techniques are compared here using real experimental data from a wooden bridge for which the feature vector consists in eigenfrequencies and modeshapes collected under changing environmental conditions, as well as damaged conditions simulated with an added mass. The results confirm the similarity between the three techniques and the ability to filter out environmental effects, while keeping a high sensitivity to structural changes. The results also show that even after filtering out the environmental effects, the normality assumption cannot be made for the residual feature vector. An alternative is demonstrated here based on extreme value statistics which results in a much better threshold which avoids false positives in the training data, while allowing detection of all damaged cases.

Reconstructing householder vectors from Tall-Skinny QR

DOE PAGES

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

2015-08-05

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

CR-Calculus and adaptive array theory applied to MIMO random vibration control tests

NASA Astrophysics Data System (ADS)

Musella, U.; Manzato, S.; Peeters, B.; Guillaume, P.

2016-09-01

Performing Multiple-Input Multiple-Output (MIMO) tests to reproduce the vibration environment in a user-defined number of control points of a unit under test is necessary in applications where a realistic environment replication has to be achieved. MIMO tests require vibration control strategies to calculate the required drive signal vector that gives an acceptable replication of the target. This target is a (complex) vector with magnitude and phase information at the control points for MIMO Sine Control tests while in MIMO Random Control tests, in the most general case, the target is a complete spectral density matrix. The idea behind this work is to tailor a MIMO random vibration control approach that can be generalized to other MIMO tests, e.g. MIMO Sine and MIMO Time Waveform Replication. In this work the approach is to use gradient-based procedures over the complex space, applying the so called CR-Calculus and the adaptive array theory. With this approach it is possible to better control the process performances allowing the step-by-step Jacobian Matrix update. The theoretical bases behind the work are followed by an application of the developed method to a two-exciter two-axis system and by performance comparisons with standard methods.

Bayes linear covariance matrix adjustment

NASA Astrophysics Data System (ADS)

Wilkinson, Darren J.

1995-12-01

In this thesis, a Bayes linear methodology for the adjustment of covariance matrices is presented and discussed. A geometric framework for quantifying uncertainties about covariance matrices is set up, and an inner-product for spaces of random matrices is motivated and constructed. The inner-product on this space captures aspects of our beliefs about the relationship between covariance matrices of interest to us, providing a structure rich enough for us to adjust beliefs about unknown matrices in the light of data such as sample covariance matrices, exploiting second-order exchangeability and related specifications to obtain representations allowing analysis. Adjustment is associated with orthogonal projection, and illustrated with examples of adjustments for some common problems. The problem of adjusting the covariance matrices underlying exchangeable random vectors is tackled and discussed. Learning about the covariance matrices associated with multivariate time series dynamic linear models is shown to be amenable to a similar approach. Diagnostics for matrix adjustments are also discussed.

On Schrödinger's bridge problem

NASA Astrophysics Data System (ADS)

Friedland, S.

2017-11-01

In the first part of this paper we generalize Georgiou-Pavon's result that a positive square matrix can be scaled uniquely to a column stochastic matrix which maps a given positive probability vector to another given positive probability vector. In the second part we prove that a positive quantum channel can be scaled to another positive quantum channel which maps a given positive definite density matrix to another given positive definite density matrix using Brouwer's fixed point theorem. This result proves the Georgiou-Pavon conjecture for two positive definite density matrices, made in their recent paper. We show that the fixed points are unique for certain pairs of positive definite density matrices. Bibliography: 15 titles.

A T Matrix Method Based upon Scalar Basis Functions

NASA Technical Reports Server (NTRS)

Mackowski, D.W.; Kahnert, F. M.; Mishchenko, Michael I.

2013-01-01

A surface integral formulation is developed for the T matrix of a homogenous and isotropic particle of arbitrary shape, which employs scalar basis functions represented by the translation matrix elements of the vector spherical wave functions. The formulation begins with the volume integral equation for scattering by the particle, which is transformed so that the vector and dyadic components in the equation are replaced with associated dipole and multipole level scalar harmonic wave functions. The approach leads to a volume integral formulation for the T matrix, which can be extended, by use of Green's identities, to the surface integral formulation. The result is shown to be equivalent to the traditional surface integral formulas based on the VSWF basis.

Linear models to perform treaty verification tasks for enhanced information security

DOE PAGES

MacGahan, Christopher J.; Kupinski, Matthew A.; Brubaker, Erik M.; ...

2016-11-12

Linear mathematical models were applied to binary-discrimination tasks relevant to arms control verification measurements in which a host party wishes to convince a monitoring party that an item is or is not treaty accountable. These models process data in list-mode format and can compensate for the presence of variability in the source, such as uncertain object orientation and location. The Hotelling observer applies an optimal set of weights to binned detector data, yielding a test statistic that is thresholded to make a decision. The channelized Hotelling observer applies a channelizing matrix to the vectorized data, resulting in a lower dimensionalmore » vector available to the monitor to make decisions. We demonstrate how incorporating additional terms in this channelizing-matrix optimization offers benefits for treaty verification. We present two methods to increase shared information and trust between the host and monitor. The first method penalizes individual channel performance in order to maximize the information available to the monitor while maintaining optimal performance. Second, we present a method that penalizes predefined sensitive information while maintaining the capability to discriminate between binary choices. Data used in this study was generated using Monte Carlo simulations for fission neutrons, accomplished with the GEANT4 toolkit. Custom models for plutonium inspection objects were measured in simulation by a radiation imaging system. Model performance was evaluated and presented using the area under the receiver operating characteristic curve.« less

Linear models to perform treaty verification tasks for enhanced information security

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

MacGahan, Christopher J.; Kupinski, Matthew A.; Brubaker, Erik M.

Linear mathematical models were applied to binary-discrimination tasks relevant to arms control verification measurements in which a host party wishes to convince a monitoring party that an item is or is not treaty accountable. These models process data in list-mode format and can compensate for the presence of variability in the source, such as uncertain object orientation and location. The Hotelling observer applies an optimal set of weights to binned detector data, yielding a test statistic that is thresholded to make a decision. The channelized Hotelling observer applies a channelizing matrix to the vectorized data, resulting in a lower dimensionalmore » vector available to the monitor to make decisions. We demonstrate how incorporating additional terms in this channelizing-matrix optimization offers benefits for treaty verification. We present two methods to increase shared information and trust between the host and monitor. The first method penalizes individual channel performance in order to maximize the information available to the monitor while maintaining optimal performance. Second, we present a method that penalizes predefined sensitive information while maintaining the capability to discriminate between binary choices. Data used in this study was generated using Monte Carlo simulations for fission neutrons, accomplished with the GEANT4 toolkit. Custom models for plutonium inspection objects were measured in simulation by a radiation imaging system. Model performance was evaluated and presented using the area under the receiver operating characteristic curve.« less

Linear models to perform treaty verification tasks for enhanced information security

NASA Astrophysics Data System (ADS)

MacGahan, Christopher J.; Kupinski, Matthew A.; Brubaker, Erik M.; Hilton, Nathan R.; Marleau, Peter A.

2017-02-01

Linear mathematical models were applied to binary-discrimination tasks relevant to arms control verification measurements in which a host party wishes to convince a monitoring party that an item is or is not treaty accountable. These models process data in list-mode format and can compensate for the presence of variability in the source, such as uncertain object orientation and location. The Hotelling observer applies an optimal set of weights to binned detector data, yielding a test statistic that is thresholded to make a decision. The channelized Hotelling observer applies a channelizing matrix to the vectorized data, resulting in a lower dimensional vector available to the monitor to make decisions. We demonstrate how incorporating additional terms in this channelizing-matrix optimization offers benefits for treaty verification. We present two methods to increase shared information and trust between the host and monitor. The first method penalizes individual channel performance in order to maximize the information available to the monitor while maintaining optimal performance. Second, we present a method that penalizes predefined sensitive information while maintaining the capability to discriminate between binary choices. Data used in this study was generated using Monte Carlo simulations for fission neutrons, accomplished with the GEANT4 toolkit. Custom models for plutonium inspection objects were measured in simulation by a radiation imaging system. Model performance was evaluated and presented using the area under the receiver operating characteristic curve.

A Semi-Vectorization Algorithm to Synthesis of Gravitational Anomaly Quantities on the Earth

NASA Astrophysics Data System (ADS)

Abdollahzadeh, M.; Eshagh, M.; Najafi Alamdari, M.

2009-04-01

The Earth's gravitational potential can be expressed by the well-known spherical harmonic expansion. The computational time of summing up this expansion is an important practical issue which can be reduced by an efficient numerical algorithm. This paper proposes such a method for block-wise synthesizing the anomaly quantities on the Earth surface using vectorization. Fully-vectorization means transformation of the summations to the simple matrix and vector products. It is not a practical for the matrices with large dimensions. Here a semi-vectorization algorithm is proposed to avoid working with large vectors and matrices. It speeds up the computations by using one loop for the summation either on degrees or on orders. The former is a good option to synthesize the anomaly quantities on the Earth surface considering a digital elevation model (DEM). This approach is more efficient than the two-step method which computes the quantities on the reference ellipsoid and continues them upward to the Earth surface. The algorithm has been coded in MATLAB which synthesizes a global grid of 5′Ã- 5′ (corresponding 9 million points) of gravity anomaly or geoid height using a geopotential model to degree 360 in 10000 seconds by an ordinary computer with 2G RAM.

Economical Implementation of a Filter Engine in an FPGA

NASA Technical Reports Server (NTRS)

Kowalski, James E.

2009-01-01

A logic design has been conceived for a field-programmable gate array (FPGA) that would implement a complex system of multiple digital state-space filters. The main innovative aspect of this design lies in providing for reuse of parts of the FPGA hardware to perform different parts of the filter computations at different times, in such a manner as to enable the timely performance of all required computations in the face of limitations on available FPGA hardware resources. The implementation of the digital state-space filter involves matrix vector multiplications, which, in the absence of the present innovation, would ordinarily necessitate some multiplexing of vector elements and/or routing of data flows along multiple paths. The design concept calls for implementing vector registers as shift registers to simplify operand access to multipliers and accumulators, obviating both multiplexing and routing of data along multiple paths. Each vector register would be reused for different parts of a calculation. Outputs would always be drawn from the same register, and inputs would always be loaded into the same register. A simple state machine would control each filter. The output of a given filter would be passed to the next filter, accompanied by a "valid" signal, which would start the state machine of the next filter. Multiple filter modules would share a multiplication/accumulation arithmetic unit. The filter computations would be timed by use of a clock having a frequency high enough, relative to the input and output data rate, to provide enough cycles for matrix and vector arithmetic operations. This design concept could prove beneficial in numerous applications in which digital filters are used and/or vectors are multiplied by coefficient matrices. Examples of such applications include general signal processing, filtering of signals in control systems, processing of geophysical measurements, and medical imaging. For these and other applications, it could be advantageous to combine compact FPGA digital filter implementations with other application-specific logic implementations on single integrated-circuit chips. An FPGA could readily be tailored to implement a variety of filters because the filter coefficients would be loaded into memory at startup.

Production of lentiviral vectors

PubMed Central

Merten, Otto-Wilhelm; Hebben, Matthias; Bovolenta, Chiara

2016-01-01

Lentiviral vectors (LV) have seen considerably increase in use as gene therapy vectors for the treatment of acquired and inherited diseases. This review presents the state of the art of the production of these vectors with particular emphasis on their large-scale production for clinical purposes. In contrast to oncoretroviral vectors, which are produced using stable producer cell lines, clinical-grade LV are in most of the cases produced by transient transfection of 293 or 293T cells grown in cell factories. However, more recent developments, also, tend to use hollow fiber reactor, suspension culture processes, and the implementation of stable producer cell lines. As is customary for the biotech industry, rather sophisticated downstream processing protocols have been established to remove any undesirable process-derived contaminant, such as plasmid or host cell DNA or host cell proteins. This review compares published large-scale production and purification processes of LV and presents their process performances. Furthermore, developments in the domain of stable cell lines and their way to the use of production vehicles of clinical material will be presented. PMID:27110581

Error Analysis of Deep Sequencing of Phage Libraries: Peptides Censored in Sequencing

PubMed Central

Matochko, Wadim L.; Derda, Ratmir

2013-01-01

Next-generation sequencing techniques empower selection of ligands from phage-display libraries because they can detect low abundant clones and quantify changes in the copy numbers of clones without excessive selection rounds. Identification of errors in deep sequencing data is the most critical step in this process because these techniques have error rates >1%. Mechanisms that yield errors in Illumina and other techniques have been proposed, but no reports to date describe error analysis in phage libraries. Our paper focuses on error analysis of 7-mer peptide libraries sequenced by Illumina method. Low theoretical complexity of this phage library, as compared to complexity of long genetic reads and genomes, allowed us to describe this library using convenient linear vector and operator framework. We describe a phage library as N × 1 frequency vector n = ||ni||, where ni is the copy number of the ith sequence and N is the theoretical diversity, that is, the total number of all possible sequences. Any manipulation to the library is an operator acting on n. Selection, amplification, or sequencing could be described as a product of a N × N matrix and a stochastic sampling operator (S a). The latter is a random diagonal matrix that describes sampling of a library. In this paper, we focus on the properties of S a and use them to define the sequencing operator (S e q). Sequencing without any bias and errors is S e q = S a IN, where IN is a N × N unity matrix. Any bias in sequencing changes IN to a nonunity matrix. We identified a diagonal censorship matrix (C E N), which describes elimination or statistically significant downsampling, of specific reads during the sequencing process. PMID:24416071

[Adeno-associated viral vectors: methods for production and purification for gene therapy applications].

PubMed

Mena-Enriquez, Mayra; Flores-Contreras, Lucia; Armendáriz-Borunda, Juan

2012-01-01

Viral vectors based on adeno-associated virus (AAV) are widely used in gene therapy protocols, because they have characteristics that make them valuable for the treatment of genetic and chronic degenerative diseases. AAV2 serotype had been the best characterized to date. However, the AAV vectors developed from other serotypes is of special interest, since they have organ-specific tropism which increases their potential for transgene delivery to target cells for performing their therapeutic effects. This article summarizes AAV generalities, methods for their production and purification. It also discusses the use of these vectors in vitro, in vivo and their application in gene therapy clinical trials.

Optimization of sparse matrix-vector multiplication on emerging multicore platforms

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

Williams, Samuel; Oliker, Leonid; Vuduc, Richard

2007-01-01

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD dual-core and Intel quad-core designs, the heterogeneous STI Cell, as well as the first scientificmore » study of the highly multithreaded Sun Niagara2. We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural tradeoffs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.« less

Matching algorithm of missile tail flame based on back-propagation neural network

NASA Astrophysics Data System (ADS)

Huang, Da; Huang, Shucai; Tang, Yidong; Zhao, Wei; Cao, Wenhuan

2018-02-01

This work presents a spectral matching algorithm of missile plume detection that based on neural network. The radiation value of the characteristic spectrum of the missile tail flame is taken as the input of the network. The network's structure including the number of nodes and layers is determined according to the number of characteristic spectral bands and missile types. We can get the network weight matrixes and threshold vectors through training the network using training samples, and we can determine the performance of the network through testing the network using the test samples. A small amount of data cause the network has the advantages of simple structure and practicality. Network structure composed of weight matrix and threshold vector can complete task of spectrum matching without large database support. Network can achieve real-time requirements with a small quantity of data. Experiment results show that the algorithm has the ability to match the precise spectrum and strong robustness.

Multitasking the Davidson algorithm for the large, sparse eigenvalue problem

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

Umar, V.M.; Fischer, C.F.

1989-01-01

The authors report how the Davidson algorithm, developed for handling the eigenvalue problem for large and sparse matrices arising in quantum chemistry, was modified for use in atomic structure calculations. To date these calculations have used traditional eigenvalue methods, which limit the range of feasible calculations because of their excessive memory requirements and unsatisfactory performance attributed to time-consuming and costly processing of zero valued elements. The replacement of a traditional matrix eigenvalue method by the Davidson algorithm reduced these limitations. Significant speedup was found, which varied with the size of the underlying problem and its sparsity. Furthermore, the range ofmore » matrix sizes that can be manipulated efficiently was expended by more than one order or magnitude. On the CRAY X-MP the code was vectorized and the importance of gather/scatter analyzed. A parallelized version of the algorithm obtained an additional 35% reduction in execution time. Speedup due to vectorization and concurrency was also measured on the Alliant FX/8.« less

Vector Observation-Aided/Attitude-Rate Estimation Using Global Positioning System Signals

NASA Technical Reports Server (NTRS)

Oshman, Yaakov; Markley, F. Landis

1997-01-01

A sequential filtering algorithm is presented for attitude and attitude-rate estimation from Global Positioning System (GPS) differential carrier phase measurements. A third-order, minimal-parameter method for solving the attitude matrix kinematic equation is used to parameterize the filter's state, which renders the resulting estimator computationally efficient. Borrowing from tracking theory concepts, the angular acceleration is modeled as an exponentially autocorrelated stochastic process, thus avoiding the use of the uncertain spacecraft dynamic model. The new formulation facilitates the use of aiding vector observations in a unified filtering algorithm, which can enhance the method's robustness and accuracy. Numerical examples are used to demonstrate the performance of the method.

Data-Driven Sampling Matrix Boolean Optimization for Energy-Efficient Biomedical Signal Acquisition by Compressive Sensing.

PubMed

Wang, Yuhao; Li, Xin; Xu, Kai; Ren, Fengbo; Yu, Hao

2017-04-01

Compressive sensing is widely used in biomedical applications, and the sampling matrix plays a critical role on both quality and power consumption of signal acquisition. It projects a high-dimensional vector of data into a low-dimensional subspace by matrix-vector multiplication. An optimal sampling matrix can ensure accurate data reconstruction and/or high compression ratio. Most existing optimization methods can only produce real-valued embedding matrices that result in large energy consumption during data acquisition. In this paper, we propose an efficient method that finds an optimal Boolean sampling matrix in order to reduce the energy consumption. Compared to random Boolean embedding, our data-driven Boolean sampling matrix can improve the image recovery quality by 9 dB. Moreover, in terms of sampling hardware complexity, it reduces the energy consumption by 4.6× and the silicon area by 1.9× over the data-driven real-valued embedding.

A simple suboptimal least-squares algorithm for attitude determination with multiple sensors

NASA Technical Reports Server (NTRS)

Brozenec, Thomas F.; Bender, Douglas J.

1994-01-01

Three-axis attitude determination is equivalent to finding a coordinate transformation matrix which transforms a set of reference vectors fixed in inertial space to a set of measurement vectors fixed in the spacecraft. The attitude determination problem can be expressed as a constrained optimization problem. The constraint is that a coordinate transformation matrix must be proper, real, and orthogonal. A transformation matrix can be thought of as optimal in the least-squares sense if it maps the measurement vectors to the reference vectors with minimal 2-norm errors and meets the above constraint. This constrained optimization problem is known as Wahba's problem. Several algorithms which solve Wahba's problem exactly have been developed and used. These algorithms, while steadily improving, are all rather complicated. Furthermore, they involve such numerically unstable or sensitive operations as matrix determinant, matrix adjoint, and Newton-Raphson iterations. This paper describes an algorithm which minimizes Wahba's loss function, but without the constraint. When the constraint is ignored, the problem can be solved by a straightforward, numerically stable least-squares algorithm such as QR decomposition. Even though the algorithm does not explicitly take the constraint into account, it still yields a nearly orthogonal matrix for most practical cases; orthogonality only becomes corrupted when the sensor measurements are very noisy, on the same order of magnitude as the attitude rotations. The algorithm can be simplified if the attitude rotations are small enough so that the approximation sin(theta) approximately equals theta holds. We then compare the computational requirements for several well-known algorithms. For the general large-angle case, the QR least-squares algorithm is competitive with all other know algorithms and faster than most. If attitude rotations are small, the least-squares algorithm can be modified to run faster, and this modified algorithm is faster than all but a similarly specialized version of the QUEST algorithm. We also introduce a novel measurement averaging technique which reduces the n-measurement case to the two measurement case for our particular application, a star tracker and earth sensor mounted on an earth-pointed geosynchronous communications satellite. Using this technique, many n-measurement problems reduce to less than or equal to 3 measurements; this reduces the amount of required calculation without significant degradation in accuracy. Finally, we present the results of some tests which compare the least-squares algorithm with the QUEST and FOAM algorithms in the two-measurement case. For our example case, all three algorithms performed with similar accuracy.

CAPA-Gene Products in the Haematophagous Sandfly Phlebotomus papatasi (Scopoli) - Vector for Leishmaniasis Disease

DTIC Science & Technology

2012-01-01

121 glass capillary and the tissues were air-dried. For peptide analysis, 122 a limited amount of matrix solution (-cyano-4-hydroxycinnamic 123 acid ...genomic sequence of P. papatasi was screened with 143 the amino acid sequence RSGNMGLFPFPRVGR using TBLASTN. 144 The genomic data were produced by The...250 have the N-terminus of CAPA-PVK-2 blocked by pyroglutamate 251 (see Table 1). Pyroglutamate may prevent rapid degradation of this 252 peptide

Study on the Preparation Process and Influential Factors of Large Area Environment-friendly Molten Carbonate Fuel Cell Matrix

NASA Astrophysics Data System (ADS)

Zhang, Ruiyun; Xu, Shisen; Cheng, Jian; Wang, Hongjian; Ren, Yongqiang

2017-07-01

Low-cost and high-performance matrix materials used in mass production of molten carbonate fuel cell (MCFC) were prepared by automatic casting machine with α-LiAlO2 powder material synthesized by gel-solid method, and distilled water as solvent. The single cell was assembled for generating test, and the good performance of the matrix was verified. The paper analyzed the factors affecting aqueous tape casting matrix preparation, such as solvent content, dispersant content, milling time, blade height and casting machine running speed, providing a solid basis for the mass production of large area environment-friendly matrix used in molten carbonate fuel cell.

Nucleon form factors from quenched lattice QCD with domain wall fermions

NASA Astrophysics Data System (ADS)

Sasaki, Shoichi; Yamazaki, Takeshi

2008-07-01

We present a quenched lattice calculation of the weak nucleon form factors: vector [FV(q2)], induced tensor [FT(q2)], axial vector [FA(q2)] and induced pseudoscalar [FP(q2)] form factors. Our simulations are performed on three different lattice sizes L3×T=243×32, 163×32, and 123×32 with a lattice cutoff of a-1≈1.3GeV and light quark masses down to about 1/4 the strange quark mass (mπ≈390MeV) using a combination of the DBW2 gauge action and domain wall fermions. The physical volume of our largest lattice is about (3.6fm)3, where the finite volume effects on form factors become negligible and the lower momentum transfers (q2≈0.1GeV2) are accessible. The q2 dependences of form factors in the low q2 region are examined. It is found that the vector, induced tensor, and axial-vector form factors are well described by the dipole form, while the induced pseudoscalar form factor is consistent with pion-pole dominance. We obtain the ratio of axial to vector coupling gA/gV=FA(0)/FV(0)=1.219(38) and the pseudoscalar coupling gP=mμFP(0.88mμ2)=8.15(54), where the errors are statistical errors only. These values agree with experimental values from neutron β decay and muon capture on the proton. However, the root mean-squared radii of the vector, induced tensor, and axial vector underestimate the known experimental values by about 20%. We also calculate the pseudoscalar nucleon matrix element in order to verify the axial Ward-Takahashi identity in terms of the nucleon matrix elements, which may be called as the generalized Goldberger-Treiman relation.

DYMAFLEX: DYnamic Manipulation FLight EXperiment

DTIC Science & Technology

2013-09-03

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

Fast higher-order MR image reconstruction using singular-vector separation.

PubMed

Wilm, Bertram J; Barmet, Christoph; Pruessmann, Klaas P

2012-07-01

Medical resonance imaging (MRI) conventionally relies on spatially linear gradient fields for image encoding. However, in practice various sources of nonlinear fields can perturb the encoding process and give rise to artifacts unless they are suitably addressed at the reconstruction level. Accounting for field perturbations that are neither linear in space nor constant over time, i.e., dynamic higher-order fields, is particularly challenging. It was previously shown to be feasible with conjugate-gradient iteration. However, so far this approach has been relatively slow due to the need to carry out explicit matrix-vector multiplications in each cycle. In this work, it is proposed to accelerate higher-order reconstruction by expanding the encoding matrix such that fast Fourier transform can be employed for more efficient matrix-vector computation. The underlying principle is to represent the perturbing terms as sums of separable functions of space and time. Compact representations with this property are found by singular-vector analysis of the perturbing matrix. Guidelines for balancing the accuracy and speed of the resulting algorithm are derived by error propagation analysis. The proposed technique is demonstrated for the case of higher-order field perturbations due to eddy currents caused by diffusion weighting. In this example, image reconstruction was accelerated by two orders of magnitude.

Computing resonance energies, widths, and wave functions using a Lanczos method in real arithmetic.

PubMed

Tremblay, Jean Christophe; Carrington, Tucker

2005-06-22

We introduce new ideas for calculating resonance energies and widths. It is shown that a non-Hermitian-Lanczos approach can be used to compute eigenvalues of H+W, where H is the Hamiltonian and W is a complex absorbing potential (CAP), without evaluating complex matrix-vector products. This is done by exploiting the link between a CAP-modified Hamiltonian matrix and a real but nonsymmetric matrix U suggested by Mandelshtam and Neumaier [J. Theor. Comput. Chem. 1, 1 (2002)] and using a coupled-two-term Lanczos procedure. We use approximate resonance eigenvectors obtained from the non-Hermitian-Lanczos algorithm and a very good CAP to obtain very accurate energies and widths without solving eigenvalue problems for many values of the CAP strength parameter and searching for cusps. The method is applied to the resonances of HCO. We compare properties of the method with those of established approaches.

Quantitative tissue polarimetry using polar decomposition of 3 x 3 Mueller matrix

NASA Astrophysics Data System (ADS)

Swami, M. K.; Manhas, S.; Buddhiwant, P.; Ghosh, N.; Uppal, A.; Gupta, P. K.

2007-05-01

Polarization properties of any optical system are completely described by a sixteen-element (4 x 4) matrix called Mueller matrix, which transform the Stokes vector describing the polarization properties of incident light to the stokes vector of scattered light. Measurement of all the elements of the matrix requires a minimum of sixteen measurements involving both linear and circularly polarized light. However, for many diagnostic applications, it would be useful if all the polarization parameters of the medium (depolarization (Δ), differential attenuation of two orthogonal polarizations, that is, diattenuation (d), and differential phase retardance of two orthogonal polarizations, i.e., retardance (δ )) can be quantified with linear polarization measurements alone. In this paper we show that for a turbid medium, like biological tissue, where the depolarization of linearly polarized light arises primarily due to the randomization of the field vector's direction by multiple scattering, the polarization parameters of the medium can be obtained from the nine Mueller matrix elements involving linear polarization measurements only. Use of the approach for measurement of polarization parameters (Δ, d and δ) of normal and malignant (squamous cell carcinoma) tissues resected from human oral cavity are presented.

Joint Smoothed l₀-Norm DOA Estimation Algorithm for Multiple Measurement Vectors in MIMO Radar.

PubMed

Liu, Jing; Zhou, Weidong; Juwono, Filbert H

2017-05-08

Direction-of-arrival (DOA) estimation is usually confronted with a multiple measurement vector (MMV) case. In this paper, a novel fast sparse DOA estimation algorithm, named the joint smoothed l 0 -norm algorithm, is proposed for multiple measurement vectors in multiple-input multiple-output (MIMO) radar. To eliminate the white or colored Gaussian noises, the new method first obtains a low-complexity high-order cumulants based data matrix. Then, the proposed algorithm designs a joint smoothed function tailored for the MMV case, based on which joint smoothed l 0 -norm sparse representation framework is constructed. Finally, for the MMV-based joint smoothed function, the corresponding gradient-based sparse signal reconstruction is designed, thus the DOA estimation can be achieved. The proposed method is a fast sparse representation algorithm, which can solve the MMV problem and perform well for both white and colored Gaussian noises. The proposed joint algorithm is about two orders of magnitude faster than the l 1 -norm minimization based methods, such as l 1 -SVD (singular value decomposition), RV (real-valued) l 1 -SVD and RV l 1 -SRACV (sparse representation array covariance vectors), and achieves better DOA estimation performance.

Equivalent Vectors

ERIC Educational Resources Information Center

Levine, Robert

2004-01-01

The cross-product is a mathematical operation that is performed between two 3-dimensional vectors. The result is a vector that is orthogonal or perpendicular to both of them. Learning about this for the first time while taking Calculus-III, the class was taught that if AxB = AxC, it does not necessarily follow that B = C. This seemed baffling. The…

Phase contrast imaging X-ray computed tomography: quantitative characterization of human patellar cartilage matrix with topological and geometrical features

NASA Astrophysics Data System (ADS)

Nagarajan, Mahesh B.; Coan, Paola; Huber, Markus B.; Diemoz, Paul C.; Wismüller, Axel

2014-03-01

Current assessment of cartilage is primarily based on identification of indirect markers such as joint space narrowing and increased subchondral bone density on x-ray images. In this context, phase contrast CT imaging (PCI-CT) has recently emerged as a novel imaging technique that allows a direct examination of chondrocyte patterns and their correlation to osteoarthritis through visualization of cartilage soft tissue. This study investigates the use of topological and geometrical approaches for characterizing chondrocyte patterns in the radial zone of the knee cartilage matrix in the presence and absence of osteoarthritic damage. For this purpose, topological features derived from Minkowski Functionals and geometric features derived from the Scaling Index Method (SIM) were extracted from 842 regions of interest (ROI) annotated on PCI-CT images of healthy and osteoarthritic specimens of human patellar cartilage. The extracted features were then used in a machine learning task involving support vector regression to classify ROIs as healthy or osteoarthritic. Classification performance was evaluated using the area under the receiver operating characteristic (ROC) curve (AUC). The best classification performance was observed with high-dimensional geometrical feature vectors derived from SIM (0.95 ± 0.06) which outperformed all Minkowski Functionals (p < 0.001). These results suggest that such quantitative analysis of chondrocyte patterns in human patellar cartilage matrix involving SIM-derived geometrical features can distinguish between healthy and osteoarthritic tissue with high accuracy.

On approximately symmetric informationally complete positive operator-valued measures and related systems of quantum states

NASA Astrophysics Data System (ADS)

Klappenecker, Andreas; Rötteler, Martin; Shparlinski, Igor E.; Winterhof, Arne

2005-08-01

We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension n consisting of n2 operators of rank one which have an inner product close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. However, SIC-POVMs are notoriously hard to construct and, despite some success of constructing them numerically, there is no analytic construction known. We present two constructions of approximate versions of SIC-POVMs, where a small deviation from uniformity of the inner products is allowed. The first construction is based on selecting vectors from a maximal collection of mutually unbiased bases and works whenever the dimension of the system is a prime power. The second construction is based on perturbing the matrix elements of a subset of mutually unbiased bases. Moreover, we construct vector systems in Cn which are almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on results of analytic number theory.

Angular-Rate Estimation Using Star Tracker Measurements

NASA Technical Reports Server (NTRS)

Azor, R.; Bar-Itzhack, I.; Deutschmann, Julie K.; Harman, Richard R.

1999-01-01

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared, one that uses differentiated quatemion measurements to yield coarse rate measurements which are then fed into two different estimators. In the other approach the raw quatemion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear rate dependent part of the rotational dynamics equation of a rigid body into a product of an angular-rate dependent matrix and the angular-rate vector itself This decomposition, which is not unique, enables the treatment of the nonlinear spacecraft dynamics model as a linear one and, consequently, the application of a Pseudo-Linear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the Kalman gain matrix and thus eliminates the need to propagate and update the filter covariance matrix. The replacement of the elaborate rotational dynamics by a simple first order Markov model is also examined. In this paper a special consideration is given to the problem of delayed quatemion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results of these tests are presented.

Angular-Rate Estimation using Star Tracker Measurements

NASA Technical Reports Server (NTRS)

Azor, R.; Bar-Itzhack, Itzhack Y.; Deutschmann, Julie K.; Harman, Richard R.

1999-01-01

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared, one that uses differentiated quaternion measurements to yield coarse rate measurements which are then fed into two different estimators. In the other approach the raw quaternion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear rate dependent part of the rotational dynamics equation of a rigid body into a product of an angular-rate dependent matrix and the angular-rate vector itself. This decomposition, which is not unique, enables the treatment of the nonlinear spacecraft dynamics model as a linear one and, consequently, the application of a Pseudo-Linear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the Kalman gain matrix and thus eliminates the need to propagate and update the filter covariance matrix. The replacement of the elaborate rotational dynamics by a simple first order Markov model is also examined. In this paper a special consideration is given to the problem of delayed quaternion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results of these tests are presented.

An ESS maximum principle for matrix games.

PubMed

Vincent, T L; Cressman, R

2000-11-01

Previous work has demonstrated that for games defined by differential or difference equations with a continuum of strategies, there exists a G-function, related to individual fitness, that must take on a maximum with respect to a virtual variable v whenever v is one of the vectors in the coalition of vectors which make up the evolutionarily stable strategy (ESS). This result, called the ESS maximum principle, is quite useful in determining candidates for an ESS. This principle is reformulated here, so that it may be conveniently applied to matrix games. In particular, we define a matrix game to be one in which fitness is expressed in terms of strategy frequencies and a matrix of expected payoffs. It is shown that the G-function in the matrix game setting must again take on a maximum value at all the strategies which make up the ESS coalition vector. The reformulated maximum principle is applicable to both bilinear and nonlinear matrix games. One advantage in employing this principle to solve the traditional bilinear matrix game is that the same G-function is used to find both pure and mixed strategy solutions by simply specifying an appropriate strategy space. Furthermore we show how the theory may be used to solve matrix games which are not in the usual bilinear form. We examine in detail two nonlinear matrix games: the game between relatives and the sex ratio game. In both of these games an ESS solution is determined. These examples not only illustrate the usefulness of this approach to finding solutions to an expanded class of matrix games, but aids in understanding the nature of the ESS as well.

Performance analysis and comparison of a minimum interconnections direct storage model with traditional neural bidirectional memories.

PubMed

Bhatti, A Aziz

2009-12-01

This study proposes an efficient and improved model of a direct storage bidirectional memory, improved bidirectional associative memory (IBAM), and emphasises the use of nanotechnology for efficient implementation of such large-scale neural network structures at a considerable lower cost reduced complexity, and less area required for implementation. This memory model directly stores the X and Y associated sets of M bipolar binary vectors in the form of (MxN(x)) and (MxN(y)) memory matrices, requires O(N) or about 30% of interconnections with weight strength ranging between +/-1, and is computationally very efficient as compared to sequential, intraconnected and other bidirectional associative memory (BAM) models of outer-product type that require O(N(2)) complex interconnections with weight strength ranging between +/-M. It is shown that it is functionally equivalent to and possesses all attributes of a BAM of outer-product type, and yet it is simple and robust in structure, very large scale integration (VLSI), optical and nanotechnology realisable, modular and expandable neural network bidirectional associative memory model in which the addition or deletion of a pair of vectors does not require changes in the strength of interconnections of the entire memory matrix. The analysis of retrieval process, signal-to-noise ratio, storage capacity and stability of the proposed model as well as of the traditional BAM has been carried out. Constraints on and characteristics of unipolar and bipolar binaries for improved storage and retrieval are discussed. The simulation results show that it has log(e) N times higher storage capacity, superior performance, faster convergence and retrieval time, when compared to traditional sequential and intraconnected bidirectional memories.

Two-dimensional PCA-based human gait identification

NASA Astrophysics Data System (ADS)

Chen, Jinyan; Wu, Rongteng

2012-11-01

It is very necessary to recognize person through visual surveillance automatically for public security reason. Human gait based identification focus on recognizing human by his walking video automatically using computer vision and image processing approaches. As a potential biometric measure, human gait identification has attracted more and more researchers. Current human gait identification methods can be divided into two categories: model-based methods and motion-based methods. In this paper a two-Dimensional Principal Component Analysis and temporal-space analysis based human gait identification method is proposed. Using background estimation and image subtraction we can get a binary images sequence from the surveillance video. By comparing the difference of two adjacent images in the gait images sequence, we can get a difference binary images sequence. Every binary difference image indicates the body moving mode during a person walking. We use the following steps to extract the temporal-space features from the difference binary images sequence: Projecting one difference image to Y axis or X axis we can get two vectors. Project every difference image in the difference binary images sequence to Y axis or X axis difference binary images sequence we can get two matrixes. These two matrixes indicate the styles of one walking. Then Two-Dimensional Principal Component Analysis(2DPCA) is used to transform these two matrixes to two vectors while at the same time keep the maximum separability. Finally the similarity of two human gait images is calculated by the Euclidean distance of the two vectors. The performance of our methods is illustrated using the CASIA Gait Database.

Nested Krylov methods and preserving the orthogonality

NASA Technical Reports Server (NTRS)

Desturler, Eric; Fokkema, Diederik R.

1993-01-01

Recently the GMRESR inner-outer iteraction scheme for the solution of linear systems of equations was proposed by Van der Vorst and Vuik. Similar methods have been proposed by Axelsson and Vassilevski and Saad (FGMRES). The outer iteration is GCR, which minimizes the residual over a given set of direction vectors. The inner iteration is GMRES, which at each step computes a new direction vector by approximately solving the residual equation. However, the optimality of the approximation over the space of outer search directions is ignored in the inner GMRES iteration. This leads to suboptimal corrections to the solution in the outer iteration, as components of the outer iteration directions may reenter in the inner iteration process. Therefore we propose to preserve the orthogonality relations of GCR in the inner GMRES iteration. This gives optimal corrections; however, it involves working with a singular, non-symmetric operator. We will discuss some important properties, and we will show by experiments that, in terms of matrix vector products, this modification (almost) always leads to better convergence. However, because we do more orthogonalizations, it does not always give an improved performance in CPU-time. Furthermore, we will discuss efficient implementations as well as the truncation possibilities of the outer GCR process. The experimental results indicate that for such methods it is advantageous to preserve the orthogonality in the inner iteration. Of course we can also use iteration schemes other than GMRES as the inner method; methods with short recurrences like GICGSTAB are of interest.

Calculation of biochemical net reactions and pathways by using matrix operations.

PubMed Central

Alberty, R A

1996-01-01

Pathways for net biochemical reactions can be calculated by using a computer program that solves systems of linear equations. The coefficients in the linear equations are the stoichiometric numbers in the biochemical equations for the system. The solution of the system of linear equations is a vector of the stoichiometric numbers of the reactions in the pathway for the net reaction; this is referred to as the pathway vector. The pathway vector gives the number of times the various reactions have to occur to produce the desired net reaction. Net reactions may involve unknown numbers of ATP, ADP, and Pi molecules. The numbers of ATP, ADP, and Pi in a desired net reaction can be calculated in a two-step process. In the first step, the pathway is calculated by solving the system of linear equations for an abbreviated stoichiometric number matrix without ATP, ADP, Pi, NADred, and NADox. In the second step, the stoichiometric numbers in the desired net reaction, which includes ATP, ADP, Pi, NADred, and NADox, are obtained by multiplying the full stoichiometric number matrix by the calculated pathway vector. PMID:8804633

Practical Performance Analysis for Multiple Information Fusion Based Scalable Localization System Using Wireless Sensor Networks.

PubMed

Zhao, Yubin; Li, Xiaofan; Zhang, Sha; Meng, Tianhui; Zhang, Yiwen

2016-08-23

In practical localization system design, researchers need to consider several aspects to make the positioning efficiently and effectively, e.g., the available auxiliary information, sensing devices, equipment deployment and the environment. Then, these practical concerns turn out to be the technical problems, e.g., the sequential position state propagation, the target-anchor geometry effect, the Non-line-of-sight (NLOS) identification and the related prior information. It is necessary to construct an efficient framework that can exploit multiple available information and guide the system design. In this paper, we propose a scalable method to analyze system performance based on the Cramér-Rao lower bound (CRLB), which can fuse all of the information adaptively. Firstly, we use an abstract function to represent all of the wireless localization system model. Then, the unknown vector of the CRLB consists of two parts: the first part is the estimated vector, and the second part is the auxiliary vector, which helps improve the estimation accuracy. Accordingly, the Fisher information matrix is divided into two parts: the state matrix and the auxiliary matrix. Unlike the theoretical analysis, our CRLB can be a practical fundamental limit to denote the system that fuses multiple information in the complicated environment, e.g., recursive Bayesian estimation based on the hidden Markov model, the map matching method and the NLOS identification and mitigation methods. Thus, the theoretical results are approaching the real case more. In addition, our method is more adaptable than other CRLBs when considering more unknown important factors. We use the proposed method to analyze the wireless sensor network-based indoor localization system. The influence of the hybrid LOS/NLOS channels, the building layout information and the relative height differences between the target and anchors are analyzed. It is demonstrated that our method exploits all of the available information for the indoor localization systems and serves as an indicator for practical system evaluation.

Solving large-scale PDE-constrained Bayesian inverse problems with Riemann manifold Hamiltonian Monte Carlo

NASA Astrophysics Data System (ADS)

Bui-Thanh, T.; Girolami, M.

2014-11-01

We consider the Riemann manifold Hamiltonian Monte Carlo (RMHMC) method for solving statistical inverse problems governed by partial differential equations (PDEs). The Bayesian framework is employed to cast the inverse problem into the task of statistical inference whose solution is the posterior distribution in infinite dimensional parameter space conditional upon observation data and Gaussian prior measure. We discretize both the likelihood and the prior using the H1-conforming finite element method together with a matrix transfer technique. The power of the RMHMC method is that it exploits the geometric structure induced by the PDE constraints of the underlying inverse problem. Consequently, each RMHMC posterior sample is almost uncorrelated/independent from the others providing statistically efficient Markov chain simulation. However this statistical efficiency comes at a computational cost. This motivates us to consider computationally more efficient strategies for RMHMC. At the heart of our construction is the fact that for Gaussian error structures the Fisher information matrix coincides with the Gauss-Newton Hessian. We exploit this fact in considering a computationally simplified RMHMC method combining state-of-the-art adjoint techniques and the superiority of the RMHMC method. Specifically, we first form the Gauss-Newton Hessian at the maximum a posteriori point and then use it as a fixed constant metric tensor throughout RMHMC simulation. This eliminates the need for the computationally costly differential geometric Christoffel symbols, which in turn greatly reduces computational effort at a corresponding loss of sampling efficiency. We further reduce the cost of forming the Fisher information matrix by using a low rank approximation via a randomized singular value decomposition technique. This is efficient since a small number of Hessian-vector products are required. The Hessian-vector product in turn requires only two extra PDE solves using the adjoint technique. Various numerical results up to 1025 parameters are presented to demonstrate the ability of the RMHMC method in exploring the geometric structure of the problem to propose (almost) uncorrelated/independent samples that are far away from each other, and yet the acceptance rate is almost unity. The results also suggest that for the PDE models considered the proposed fixed metric RMHMC can attain almost as high a quality performance as the original RMHMC, i.e. generating (almost) uncorrelated/independent samples, while being two orders of magnitude less computationally expensive.

An Efficient and Robust Singular Value Method for Star Pattern Recognition and Attitude Determination

NASA Technical Reports Server (NTRS)

Juang, Jer-Nan; Kim, Hye-Young; Junkins, John L.

2003-01-01

A new star pattern recognition method is developed using singular value decomposition of a measured unit column vector matrix in a measurement frame and the corresponding cataloged vector matrix in a reference frame. It is shown that singular values and right singular vectors are invariant with respect to coordinate transformation and robust under uncertainty. One advantage of singular value comparison is that a pairing process for individual measured and cataloged stars is not necessary, and the attitude estimation and pattern recognition process are not separated. An associated method for mission catalog design is introduced and simulation results are presented.

Precision matrix expansion - efficient use of numerical simulations in estimating errors on cosmological parameters

NASA Astrophysics Data System (ADS)

Friedrich, Oliver; Eifler, Tim

2018-01-01

Computing the inverse covariance matrix (or precision matrix) of large data vectors is crucial in weak lensing (and multiprobe) analyses of the large-scale structure of the Universe. Analytically computed covariances are noise-free and hence straightforward to invert; however, the model approximations might be insufficient for the statistical precision of future cosmological data. Estimating covariances from numerical simulations improves on these approximations, but the sample covariance estimator is inherently noisy, which introduces uncertainties in the error bars on cosmological parameters and also additional scatter in their best-fitting values. For future surveys, reducing both effects to an acceptable level requires an unfeasibly large number of simulations. In this paper we describe a way to expand the precision matrix around a covariance model and show how to estimate the leading order terms of this expansion from simulations. This is especially powerful if the covariance matrix is the sum of two contributions, C = A+B, where A is well understood analytically and can be turned off in simulations (e.g. shape noise for cosmic shear) to yield a direct estimate of B. We test our method in mock experiments resembling tomographic weak lensing data vectors from the Dark Energy Survey (DES) and the Large Synoptic Survey Telescope (LSST). For DES we find that 400 N-body simulations are sufficient to achieve negligible statistical uncertainties on parameter constraints. For LSST this is achieved with 2400 simulations. The standard covariance estimator would require >105 simulations to reach a similar precision. We extend our analysis to a DES multiprobe case finding a similar performance.

Rational calculation accuracy in acousto-optical matrix-vector processor

NASA Astrophysics Data System (ADS)

Oparin, V. V.; Tigin, Dmitry V.

1994-01-01

The high speed of parallel computations for a comparatively small-size processor and acceptable power consumption makes the usage of acousto-optic matrix-vector multiplier (AOMVM) attractive for processing of large amounts of information in real time. The limited accuracy of computations is an essential disadvantage of such a processor. The reduced accuracy requirements allow for considerable simplification of the AOMVM architecture and the reduction of the demands on its components.

Fourier transform-wavefront reconstruction for the pyramid wavefront sensor

NASA Astrophysics Data System (ADS)

Quirós-Pacheco, Fernando; Correia, Carlos; Esposito, Simone

The application of Fourier-transform reconstruction techniques to the pyramid wavefront sensor has been investigated. A preliminary study based on end-to-end simulations of an adaptive optics system with ≈40x40 subapertures and actuators shows that the performance of the Fourier-transform reconstructor (FTR) is of the same order of magnitude than the one obtained with a conventional matrix-vector multiply (MVM) method.

The Helioseismic and Magnetic Imager (HMI) Vector Magnetic Field Pipeline: Overview and Performance

NASA Astrophysics Data System (ADS)

Hoeksema, J. Todd; Liu, Yang; Hayashi, Keiji; Sun, Xudong; Schou, Jesper; Couvidat, Sebastien; Norton, Aimee; Bobra, Monica; Centeno, Rebecca; Leka, K. D.; Barnes, Graham; Turmon, Michael

2014-09-01

The Helioseismic and Magnetic Imager (HMI) began near-continuous full-disk solar measurements on 1 May 2010 from the Solar Dynamics Observatory (SDO). An automated processing pipeline keeps pace with observations to produce observable quantities, including the photospheric vector magnetic field, from sequences of filtergrams. The basic vector-field frame list cadence is 135 seconds, but to reduce noise the filtergrams are combined to derive data products every 720 seconds. The primary 720 s observables were released in mid-2010, including Stokes polarization parameters measured at six wavelengths, as well as intensity, Doppler velocity, and the line-of-sight magnetic field. More advanced products, including the full vector magnetic field, are now available. Automatically identified HMI Active Region Patches (HARPs) track the location and shape of magnetic regions throughout their lifetime. The vector field is computed using the Very Fast Inversion of the Stokes Vector (VFISV) code optimized for the HMI pipeline; the remaining 180∘ azimuth ambiguity is resolved with the Minimum Energy (ME0) code. The Milne-Eddington inversion is performed on all full-disk HMI observations. The disambiguation, until recently run only on HARP regions, is now implemented for the full disk. Vector and scalar quantities in the patches are used to derive active region indices potentially useful for forecasting; the data maps and indices are collected in the SHARP data series, hmi.sharp_720s. Definitive SHARP processing is completed only after the region rotates off the visible disk; quick-look products are produced in near real time. Patches are provided in both CCD and heliographic coordinates. HMI provides continuous coverage of the vector field, but has modest spatial, spectral, and temporal resolution. Coupled with limitations of the analysis and interpretation techniques, effects of the orbital velocity, and instrument performance, the resulting measurements have a certain dynamic range and sensitivity and are subject to systematic errors and uncertainties that are characterized in this report.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

Genetic algorithm and graph theory based matrix factorization method for online friend recommendation.

PubMed

Li, Qu; Yao, Min; Yang, Jianhua; Xu, Ning

2014-01-01

Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy.

Low-rank matrix decomposition and spatio-temporal sparse recovery for STAP radar

DOE PAGES

Sen, Satyabrata

2015-08-04

We develop space-time adaptive processing (STAP) methods by leveraging the advantages of sparse signal processing techniques in order to detect a slowly-moving target. We observe that the inherent sparse characteristics of a STAP problem can be formulated as the low-rankness of clutter covariance matrix when compared to the total adaptive degrees-of-freedom, and also as the sparse interference spectrum on the spatio-temporal domain. By exploiting these sparse properties, we propose two approaches for estimating the interference covariance matrix. In the first approach, we consider a constrained matrix rank minimization problem (RMP) to decompose the sample covariance matrix into a low-rank positivemore » semidefinite and a diagonal matrix. The solution of RMP is obtained by applying the trace minimization technique and the singular value decomposition with matrix shrinkage operator. Our second approach deals with the atomic norm minimization problem to recover the clutter response-vector that has a sparse support on the spatio-temporal plane. We use convex relaxation based standard sparse-recovery techniques to find the solutions. With extensive numerical examples, we demonstrate the performances of proposed STAP approaches with respect to both the ideal and practical scenarios, involving Doppler-ambiguous clutter ridges, spatial and temporal decorrelation effects. As a result, the low-rank matrix decomposition based solution requires secondary measurements as many as twice the clutter rank to attain a near-ideal STAP performance; whereas the spatio-temporal sparsity based approach needs a considerably small number of secondary data.« less

Stochastic determination of matrix determinants

NASA Astrophysics Data System (ADS)

Dorn, Sebastian; Enßlin, Torsten A.

2015-07-01

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

Stochastic determination of matrix determinants.

PubMed

Dorn, Sebastian; Ensslin, Torsten A

2015-07-01

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

Generation of a non-transmissive Borna disease virus vector lacking both matrix and glycoprotein genes.

PubMed

Fujino, Kan; Yamamoto, Yusuke; Daito, Takuji; Makino, Akiko; Honda, Tomoyuki; Tomonaga, Keizo

2017-09-01

Borna disease virus (BoDV), a prototype of mammalian bornavirus, is a non-segmented, negative strand RNA virus that often causes severe neurological disorders in infected animals, including horses and sheep. Unique among animal RNA viruses, BoDV transcribes and replicates non-cytopathically in the cell nucleus, leading to establishment of long-lasting persistent infection. This striking feature of BoDV indicates its potential as an RNA virus vector system. It has previously been demonstrated by our team that recombinant BoDV (rBoDV) lacking an envelope glycoprotein (G) gene develops persistent infections in transduced cells without loss of the viral genome. In this study, a novel non-transmissive rBoDV, rBoDV ΔMG, which lacks both matrix (M) and G genes in the genome, is reported. rBoDV-ΔMG expressing green fluorescence protein (GFP), rBoDV ΔMG-GFP, was efficiently generated in Vero/MG cells stably expressing both BoDV M and G proteins. Infection with rBoDV ΔMG-GFP was persistently maintained in the parent Vero cells without propagation within cell culture. The optimal ratio of M and G for efficient viral particle production by transient transfection of M and G expression plasmids into cells persistently infected with rBoDV ΔMG-GFP was also demonstrated. These findings indicate that the rBoDV ΔMG-based BoDV vector may provide an extremely safe virus vector system and could be a novel strategy for investigating the function of M and G proteins and the host range of bornaviruses. © 2017 The Societies and John Wiley & Sons Australia, Ltd.

Practical auxiliary basis implementation of Rung 3.5 functionals

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

Janesko, Benjamin G., E-mail: b.janesko@tcu.edu; Scalmani, Giovanni; Frisch, Michael J.

2014-07-21

Approximate exchange-correlation functionals for Kohn-Sham density functional theory often benefit from incorporating exact exchange. Exact exchange is constructed from the noninteracting reference system's nonlocal one-particle density matrix γ(r{sup -vector},r{sup -vector}′). Rung 3.5 functionals attempt to balance the strengths and limitations of exact exchange using a new ingredient, a projection of γ(r{sup -vector},r{sup -vector} ′) onto a semilocal model density matrix γ{sub SL}(ρ(r{sup -vector}),∇ρ(r{sup -vector}),r{sup -vector}−r{sup -vector} ′). γ{sub SL} depends on the electron density ρ(r{sup -vector}) at reference point r{sup -vector}, and is closely related to semilocal model exchange holes. We present a practical implementation of Rung 3.5 functionals, expandingmore » the r{sup -vector}−r{sup -vector} ′ dependence of γ{sub SL} in an auxiliary basis set. Energies and energy derivatives are obtained from 3D numerical integration as in standard semilocal functionals. We also present numerical tests of a range of properties, including molecular thermochemistry and kinetics, geometries and vibrational frequencies, and bandgaps and excitation energies. Rung 3.5 functionals typically provide accuracy intermediate between semilocal and hybrid approximations. Nonlocal potential contributions from γ{sub SL} yield interesting successes and failures for band structures and excitation energies. The results enable and motivate continued exploration of Rung 3.5 functional forms.« less

Graph theory approach to the eigenvalue problem of large space structures

NASA Technical Reports Server (NTRS)

Reddy, A. S. S. R.; Bainum, P. M.

1981-01-01

Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

Biological Control of the Chagas Disease Vector Triatoma infestans with the Entomopathogenic Fungus Beauveria bassiana Combined with an Aggregation Cue: Field, Laboratory and Mathematical Modeling Assessment

PubMed Central

Forlani, Lucas; Pedrini, Nicolás; Girotti, Juan R.; Mijailovsky, Sergio J.; Cardozo, Rubén M.; Gentile, Alberto G.; Hernández-Suárez, Carlos M.; Rabinovich, Jorge E.; Juárez, M. Patricia

2015-01-01

Background Current Chagas disease vector control strategies, based on chemical insecticide spraying, are growingly threatened by the emergence of pyrethroid-resistant Triatoma infestans populations in the Gran Chaco region of South America. Methodology and findings We have already shown that the entomopathogenic fungus Beauveria bassiana has the ability to breach the insect cuticle and is effective both against pyrethroid-susceptible and pyrethroid-resistant T. infestans, in laboratory as well as field assays. It is also known that T. infestans cuticle lipids play a major role as contact aggregation pheromones. We estimated the effectiveness of pheromone-based infection boxes containing B. bassiana spores to kill indoor bugs, and its effect on the vector population dynamics. Laboratory assays were performed to estimate the effect of fungal infection on female reproductive parameters. The effect of insect exuviae as an aggregation signal in the performance of the infection boxes was estimated both in the laboratory and in the field. We developed a stage-specific matrix model of T. infestans to describe the fungal infection effects on insect population dynamics, and to analyze the performance of the biopesticide device in vector biological control. Conclusions The pheromone-containing infective box is a promising new tool against indoor populations of this Chagas disease vector, with the number of boxes per house being the main driver of the reduction of the total domestic bug population. This ecologically safe approach is the first proven alternative to chemical insecticides in the control of T. infestans. The advantageous reduction in vector population by delayed-action fungal biopesticides in a contained environment is here shown supported by mathematical modeling. PMID:25969989

Investigation into Text Classification With Kernel Based Schemes

DTIC Science & Technology

2010-03-01

Document Matrix TDMs Term-Document Matrices TMG Text to Matrix Generator TN True Negative TP True Positive VSM Vector Space Model xxii THIS PAGE...are represented as a term-document matrix, common evaluation metrics, and the software package Text to Matrix Generator ( TMG ). The classifier...AND METRICS This chapter introduces the indexing capabilities of the Text to Matrix Generator ( TMG ) Toolbox. Specific attention is placed on the

Simplified production and concentration of HIV-1-based lentiviral vectors using HYPERFlask vessels and anion exchange membrane chromatography

PubMed Central

Kutner, Robert H; Puthli, Sharon; Marino, Michael P; Reiser, Jakob

2009-01-01

Background During the past twelve years, lentiviral (LV) vectors have emerged as valuable tools for transgene delivery because of their ability to transduce nondividing cells and their capacity to sustain long-term transgene expression in target cells in vitro and in vivo. However, despite significant progress, the production and concentration of high-titer, high-quality LV vector stocks is still cumbersome and costly. Methods Here we present a simplified protocol for LV vector production on a laboratory scale using HYPERFlask vessels. HYPERFlask vessels are high-yield, high-performance flasks that utilize a multilayered gas permeable growth surface for efficient gas exchange, allowing convenient production of high-titer LV vectors. For subsequent concentration of LV vector stocks produced in this way, we describe a facile protocol involving Mustang Q anion exchange membrane chromatography. Results Our results show that unconcentrated LV vector stocks with titers in excess of 108 transduction units (TU) per ml were obtained using HYPERFlasks and that these titers were higher than those produced in parallel using regular 150-cm2 tissue culture dishes. We also show that up to 500 ml of an unconcentrated LV vector stock prepared using a HYPERFlask vessel could be concentrated using a single Mustang Q Acrodisc with a membrane volume of 0.18 ml. Up to 5.3 × 1010 TU were recovered from a single HYPERFlask vessel. Conclusion The protocol described here is easy to implement and should facilitate high-titer LV vector production for preclinical studies in animal models without the need for multiple tissue culture dishes and ultracentrifugation-based concentration protocols. PMID:19220915

Production of heavy sterile neutrinos from vector boson decay at electroweak temperatures

NASA Astrophysics Data System (ADS)

Lello, Louis; Boyanovsky, Daniel; Pisarski, Robert D.

2017-02-01

In the standard model extended with a seesaw mass matrix, we study the production of sterile neutrinos from the decay of vector bosons at temperatures near the masses of the electroweak bosons. We derive a general quantum kinetic equation for the production of sterile neutrinos and their effective mixing angles, which is applicable over a wide range of temperature, to all orders in interactions of the standard model and to leading order in a small mixing angle for the neutrinos. We emphasize the relation between the production rate and Landau damping at one-loop order and show that production rates and effective mixing angles depend sensitively upon the neutrino's helicity. Sterile neutrinos with positive helicity interact more weakly with the medium than those with negative helicity, and their effective mixing angle is not modified significantly. Negative helicity states couple more strongly to the vector bosons, but their mixing angle is strongly suppressed by the medium. Consequently, if the mass of the sterile neutrino is ≲8.35 MeV , there are fewer states with negative helicity produced than those with positive helicity. There is an Mikheyev-Smirnov-Wolfenstein-type resonance in the absence of lepton asymmetry, but due to screening by the damping rate, the production rate is not enhanced. Sterile neutrinos with negative helicity freeze out at Tf-≃5 GeV , whereas positive helicity neutrinos freeze out at Tf+≃8 GeV , with both distributions far from thermal. As the temperature decreases, due to competition between a decreasing production rate and an increasing mixing angle, the distribution function for states with negative helicity is broader in momentum and hotter than that for those with positive helicity. Sterile neutrinos produced via vector boson decay do not satisfy the abundance, lifetime, and cosmological constraints to be the sole dark matter component in the Universe. Massive sterile neutrinos produced via vector boson decay might solve the 7Li problem, albeit at the very edge of the possible parameter space. A heavy sterile neutrino with a mass of a few MeV could decay into light sterile neutrinos, of a few keV in mass, that contribute to warm dark matter. We argue that heavy sterile neutrinos with lifetime ≤1 /H0 reach local thermodynamic equilibrium.

Production of heavy sterile neutrinos from vector boson decay at electroweak temperatures

DOE PAGES

Lello, Louis; Boyanovsky, Daniel; Pisarski, Robert D.

2017-02-22

Here, in the standard model extended with a seesaw mass matrix, we study the production of sterile neutrinos from the decay of vector bosons at temperatures near the masses of the electroweak bosons. We derive a general quantum kinetic equation for the production of sterile neutrinos and their effective mixing angles, which is applicable over a wide range of temperature, to all orders in interactions of the standard model and to leading order in a small mixing angle for the neutrinos. We emphasize the relation between the production rate and Landau damping at one-loop order and show that production rates and effective mixing angles depend sensitively upon the neutrino’s helicity. Sterile neutrinos with positive helicity interact more weakly with the medium than those with negative helicity, and their effective mixing angle is not modified significantly. Negative helicity states couple more strongly to the vector bosons, but their mixing angle is strongly suppressed by the medium. Consequently, if the mass of the sterile neutrino is ≲ 8.35 MeV , there are fewer states with negative helicity produced than those with positive helicity. There is an Mikheyev-Smirnov-Wolfenstein-type resonance in the absence of lepton asymmetry, but due to screening by the damping rate, the production rate is not enhanced. Sterile neutrinos with negative helicity freeze out at Tmore » $$-\\atop{f}$$ ≃ 5 GeV , whereas positive helicity neutrinos freeze out at T$$+\\atop{f}$$≃ 8 GeV , with both distributions far from thermal. As the temperature decreases, due to competition between a decreasing production rate and an increasing mixing angle, the distribution function for states with negative helicity is broader in momentum and hotter than that for those with positive helicity. Sterile neutrinos produced via vector boson decay do not satisfy the abundance, lifetime, and cosmological constraints to be the sole dark matter component in the Universe. Massive sterile neutrinos produced via vector boson decay might solve the 7Li problem, albeit at the very edge of the possible parameter space. A heavy sterile neutrino with a mass of a few MeV could decay into light sterile neutrinos, of a few keV in mass, that contribute to warm dark matter. In conclusion, we argue that heavy sterile neutrinos with lifetime ≤1/H 0 reach local thermodynamic equilibrium.« less

Bubble vector in automatic merging

NASA Technical Reports Server (NTRS)

Pamidi, P. R.; Butler, T. G.

1987-01-01

It is shown that it is within the capability of the DMAP language to build a set of vectors that can grow incrementally to be applied automatically and economically within a DMAP loop that serves to append sub-matrices that are generated within a loop to a core matrix. The method of constructing such vectors is explained.

Pseudo-Linear Attitude Determination of Spinning Spacecraft

NASA Technical Reports Server (NTRS)

Bar-Itzhack, Itzhack Y.; Harman, Richard R.

2004-01-01

This paper presents the overall mathematical model and results from pseudo linear recursive estimators of attitude and rate for a spinning spacecraft. The measurements considered are vector measurements obtained by sun-sensors, fixed head star trackers, horizon sensors, and three axis magnetometers. Two filters are proposed for estimating the attitude as well as the angular rate vector. One filter, called the q-Filter, yields the attitude estimate as a quaternion estimate, and the other filter, called the D-Filter, yields the estimated direction cosine matrix. Because the spacecraft is gyro-less, Euler s equation of angular motion of rigid bodies is used to enable the estimation of the angular velocity. A simpler Markov model is suggested as a replacement for Euler's equation in the case where the vector measurements are obtained at high rates relative to the spacecraft angular rate. The performance of the two filters is examined using simulated data.

A sparse matrix algorithm on the Boolean vector machine

NASA Technical Reports Server (NTRS)

Wagner, Robert A.; Patrick, Merrell L.

1988-01-01

VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.

1-norm support vector novelty detection and its sparseness.

PubMed

Zhang, Li; Zhou, WeiDa

2013-12-01

This paper proposes a 1-norm support vector novelty detection (SVND) method and discusses its sparseness. 1-norm SVND is formulated as a linear programming problem and uses two techniques for inducing sparseness, or the 1-norm regularization and the hinge loss function. We also find two upper bounds on the sparseness of 1-norm SVND, or exact support vector (ESV) and kernel Gram matrix rank bounds. The ESV bound indicates that 1-norm SVND has a sparser representation model than SVND. The kernel Gram matrix rank bound can loosely estimate the sparseness of 1-norm SVND. Experimental results show that 1-norm SVND is feasible and effective. Copyright © 2013 Elsevier Ltd. All rights reserved.

Algorithms for solving large sparse systems of simultaneous linear equations on vector processors

NASA Technical Reports Server (NTRS)

David, R. E.

1984-01-01

Very efficient algorithms for solving large sparse systems of simultaneous linear equations have been developed for serial processing computers. These involve a reordering of matrix rows and columns in order to obtain a near triangular pattern of nonzero elements. Then an LU factorization is developed to represent the matrix inverse in terms of a sequence of elementary Gaussian eliminations, or pivots. In this paper it is shown how these algorithms are adapted for efficient implementation on vector processors. Results obtained on the CYBER 200 Model 205 are presented for a series of large test problems which show the comparative advantages of the triangularization and vector processing algorithms.

Exploiting data representation for fault tolerance

DOE PAGES

Hoemmen, Mark Frederick; Elliott, J.; Sandia National Lab.; ...

2015-01-06

Incorrect computer hardware behavior may corrupt intermediate computations in numerical algorithms, possibly resulting in incorrect answers. Prior work models misbehaving hardware by randomly flipping bits in memory. We start by accepting this premise, and present an analytic model for the error introduced by a bit flip in an IEEE 754 floating-point number. We then relate this finding to the linear algebra concepts of normalization and matrix equilibration. In particular, we present a case study illustrating that normalizing both vector inputs of a dot product minimizes the probability of a single bit flip causing a large error in the dot product'smore » result. Moreover, the absolute error is either less than one or very large, which allows detection of large errors. Then, we apply this to the GMRES iterative solver. We count all possible errors that can be introduced through faults in arithmetic in the computationally intensive orthogonalization phase of GMRES, and show that when the matrix is equilibrated, the absolute error is bounded above by one.« less

Yersinia pestis Biofilm in the Flea Vector and Its Role in the Transmission of Plague

PubMed Central

Erickson, D. L.

2013-01-01

Transmission by fleabite is a relatively recent evolutionary adaptation of Yersinia pestis, the bacterial agent of bubonic plague. To produce a transmissible infection, Y. pestis grows as an attached biofilm in the foregut of the flea vector. Biofilm formation both in the flea foregut and in vitro is dependent on an extracellular matrix (ECM) synthesized by the Yersinia hms gene products. The hms genes are similar to the pga and ica genes of Escherichia coli and Staphylococcus epidermidis, respectively, that act to synthesize a poly-β-1,6-N-acetyl-d-glucosamine ECM required for biofilm formation. As with extracellular polysaccharide production in many other bacteria, synthesis of the Hms-dependent ECM is controlled by intracellular levels of cyclic-di-GMP. Yersinia pseudotuberculosis, the food- and water-borne enteric pathogen from which Y. pestis evolved recently, possesses identical hms genes and can form biofilm in vitro but not in the flea. The genetic changes in Y. pestis that resulted in adapting biofilm-forming capability to the flea gut environment, a critical step in the evolution of vector-borne transmission, have yet to be identified. During a flea bite, Y. pestis is regurgitated into the dermis in a unique biofilm phenotype, and this has implications for the initial interaction with the mammalian innate immune response. PMID:18453279

Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT

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

Brabec, Jiri; Lin, Lin; Shao, Meiyue

We present two iterative algorithms for approximating the absorption spectrum of molecules within linear response of time-dependent density functional theory (TDDFT) framework. These methods do not attempt to compute eigenvalues or eigenvectors of the linear response matrix. They are designed to approximate the absorption spectrum as a function directly. They take advantage of the special structure of the linear response matrix. Neither method requires the linear response matrix to be constructed explicitly. They only require a procedure that performs the multiplication of the linear response matrix with a vector. These methods can also be easily modified to efficiently estimate themore » density of states (DOS) of the linear response matrix without computing the eigenvalues of this matrix. We show by computational experiments that the methods proposed in this paper can be much more efficient than methods that are based on the exact diagonalization of the linear response matrix. We show that they can also be more efficient than real-time TDDFT simulations. We compare the pros and cons of these methods in terms of their accuracy as well as their computational and storage cost.« less

Nonlinear Adjustment with or without Constraints, Applicable to Geodetic Models

DTIC Science & Technology

1989-03-01

corrections are neglected, resulting in the familiar (linearized) observation equations. In matrix notation, the latter are expressed by V = A X + I...where A is the design matrix, x=X -x is the column-vector of parametric corrections , VzLa-L b is the column-vector of residuals, and L=L -Lb is the...X0 . corresponds to the set ua of model-surface 0 coordinates describing the initial point P. The final set of parametric corrections , X, then

Molecular Optics Nonlinear Optical Processes in Organic and Polymeric Crystals and Films. Part 1

DTIC Science & Technology

1991-11-01

Cycio-Octateraene ........... .93 Figure3.3; THG Dispersion Curve for Cyclo-Octateraene .... ......... 94 Figure3.4; Bloch Vector in Pauli Matrix Space... Jung , P. and Hanggi, P, Phys. Rev. Lett. 61, 11 (1989) I [90] Guckenheimer, J. and Holmes, P., Nonlinear Oscillations, Dynamical Sys- tems, and...identity matrix and Pauli matrices. p(t) = 1(1 + fr(t)F * 5) (3.5.6) I where the 3-vector FF is the linear coefficients of the Pauli matrices and is

CD-Based Indices for Link Prediction in Complex Network.

PubMed

Wang, Tao; Wang, Hongjue; Wang, Xiaoxia

2016-01-01

Lots of similarity-based algorithms have been designed to deal with the problem of link prediction in the past decade. In order to improve prediction accuracy, a novel cosine similarity index CD based on distance between nodes and cosine value between vectors is proposed in this paper. Firstly, node coordinate matrix can be obtained by node distances which are different from distance matrix and row vectors of the matrix are regarded as coordinates of nodes. Then, cosine value between node coordinates is used as their similarity index. A local community density index LD is also proposed. Then, a series of CD-based indices include CD-LD-k, CD*LD-k, CD-k and CDI are presented and applied in ten real networks. Experimental results demonstrate the effectiveness of CD-based indices. The effects of network clustering coefficient and assortative coefficient on prediction accuracy of indices are analyzed. CD-LD-k and CD*LD-k can improve prediction accuracy without considering the assortative coefficient of network is negative or positive. According to analysis of relative precision of each method on each network, CD-LD-k and CD*LD-k indices have excellent average performance and robustness. CD and CD-k indices perform better on positive assortative networks than on negative assortative networks. For negative assortative networks, we improve and refine CD index, referred as CDI index, combining the advantages of CD index and evolutionary mechanism of the network model BA. Experimental results reveal that CDI index can increase prediction accuracy of CD on negative assortative networks.

CD-Based Indices for Link Prediction in Complex Network

PubMed Central

Wang, Tao; Wang, Hongjue; Wang, Xiaoxia

2016-01-01

Lots of similarity-based algorithms have been designed to deal with the problem of link prediction in the past decade. In order to improve prediction accuracy, a novel cosine similarity index CD based on distance between nodes and cosine value between vectors is proposed in this paper. Firstly, node coordinate matrix can be obtained by node distances which are different from distance matrix and row vectors of the matrix are regarded as coordinates of nodes. Then, cosine value between node coordinates is used as their similarity index. A local community density index LD is also proposed. Then, a series of CD-based indices include CD-LD-k, CD*LD-k, CD-k and CDI are presented and applied in ten real networks. Experimental results demonstrate the effectiveness of CD-based indices. The effects of network clustering coefficient and assortative coefficient on prediction accuracy of indices are analyzed. CD-LD-k and CD*LD-k can improve prediction accuracy without considering the assortative coefficient of network is negative or positive. According to analysis of relative precision of each method on each network, CD-LD-k and CD*LD-k indices have excellent average performance and robustness. CD and CD-k indices perform better on positive assortative networks than on negative assortative networks. For negative assortative networks, we improve and refine CD index, referred as CDI index, combining the advantages of CD index and evolutionary mechanism of the network model BA. Experimental results reveal that CDI index can increase prediction accuracy of CD on negative assortative networks. PMID:26752405

A neural network detection model of spilled oil based on the texture analysis of SAR image

NASA Astrophysics Data System (ADS)

An, Jubai; Zhu, Lisong

2006-01-01

A Radial Basis Function Neural Network (RBFNN) Model is investigated for the detection of spilled oil based on the texture analysis of SAR imagery. In this paper, to take the advantage of the abundant texture information of SAR imagery, the texture features are extracted by both wavelet transform and the Gray Level Co-occurrence matrix. The RBFNN Model is fed with a vector of these texture features. The RBFNN Model is trained and tested by the sample data set of the feature vectors. Finally, a SAR image is classified by this model. The classification results of a spilled oil SAR image show that the classification accuracy for oil spill is 86.2 by the RBFNN Model using both wavelet texture and gray texture, while the classification accuracy for oil spill is 78.0 by same RBFNN Model using only wavelet texture as the input of this RBFNN model. The model using both wavelet transform and the Gray Level Co-occurrence matrix is more effective than that only using wavelet texture. Furthermore, it keeps the complicated proximity and has a good performance of classification.

Gender classification from face images by using local binary pattern and gray-level co-occurrence matrix

NASA Astrophysics Data System (ADS)

Uzbaş, Betül; Arslan, Ahmet

2018-04-01

Gender is an important step for human computer interactive processes and identification. Human face image is one of the important sources to determine gender. In the present study, gender classification is performed automatically from facial images. In order to classify gender, we propose a combination of features that have been extracted face, eye and lip regions by using a hybrid method of Local Binary Pattern and Gray-Level Co-Occurrence Matrix. The features have been extracted from automatically obtained face, eye and lip regions. All of the extracted features have been combined and given as input parameters to classification methods (Support Vector Machine, Artificial Neural Networks, Naive Bayes and k-Nearest Neighbor methods) for gender classification. The Nottingham Scan face database that consists of the frontal face images of 100 people (50 male and 50 female) is used for this purpose. As the result of the experimental studies, the highest success rate has been achieved as 98% by using Support Vector Machine. The experimental results illustrate the efficacy of our proposed method.

Optimization of Sparse Matrix-Vector Multiplication on Emerging Multicore Platforms

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

Williams, Samuel; Oliker, Leonid; Vuduc, Richard

2008-10-16

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific-optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD quad-core, AMD dual-core, and Intel quad-core designs, the heterogeneous STI Cell, as well as one ofmore » the first scientific studies of the highly multithreaded Sun Victoria Falls (a Niagara2 SMP). We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural trade-offs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.« less

Offline handwritten word recognition using MQDF-HMMs

NASA Astrophysics Data System (ADS)

Ramachandrula, Sitaram; Hambarde, Mangesh; Patial, Ajay; Sahoo, Dushyant; Kochar, Shaivi

2015-01-01

We propose an improved HMM formulation for offline handwriting recognition (HWR). The main contribution of this work is using modified quadratic discriminant function (MQDF) [1] within HMM framework. In an MQDF-HMM the state observation likelihood is calculated by a weighted combination of MQDF likelihoods of individual Gaussians of GMM (Gaussian Mixture Model). The quadratic discriminant function (QDF) of a multivariate Gaussian can be rewritten by avoiding the inverse of covariance matrix by using the Eigen values and Eigen vectors of it. The MQDF is derived from QDF by substituting few of badly estimated lower-most Eigen values by an appropriate constant. The estimation errors of non-dominant Eigen vectors and Eigen values of covariance matrix for which the training data is insufficient can be controlled by this approach. MQDF has been successfully shown to improve the character recognition performance [1]. The usage of MQDF in HMM improves the computation, storage and modeling power of HMM when there is limited training data. We have got encouraging results on offline handwritten character (NIST database) and word recognition in English using MQDF HMMs.

Ranking Support Vector Machine with Kernel Approximation

PubMed Central

Dou, Yong

2017-01-01

Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms. PMID:28293256

Ranking Support Vector Machine with Kernel Approximation.

PubMed

Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi

2017-01-01

Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

Practical somewhat-secure quantum somewhat-homomorphic encryption with coherent states

NASA Astrophysics Data System (ADS)

Tan, Si-Hui; Ouyang, Yingkai; Rohde, Peter P.

2018-04-01

We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the code space performed via passive linear optics, and with generalized nonlinear phase operations that are polynomials of the photon-number operator in the code space. This encoding scheme can thus be applied to any computation with coherent-state inputs, and the computation proceeds via a combination of passive linear optics and generalized nonlinear phase operations. An example of such a computation is matrix multiplication, whereby a vector representing coherent-state amplitudes is multiplied by a matrix representing a linear optics network, yielding a new vector of coherent-state amplitudes. By finding an orthogonal partitioning of the support of our encoded states, we quantify the security of our scheme via the indistinguishability of the encrypted code words. While we focus on coherent-state encodings, we expect that this phase-key encoding technique could apply to any continuous-variable computation scheme where the phase-shift operator commutes with the computation.

The vector radiative transfer numerical model of coupled ocean-atmosphere system using the matrix-operator method

NASA Astrophysics Data System (ADS)

Xianqiang, He; Delu, Pan; Yan, Bai; Qiankun, Zhu

2005-10-01

The numerical model of the vector radiative transfer of the coupled ocean-atmosphere system is developed based on the matrix-operator method, which is named PCOART. In PCOART, using the Fourier analysis, the vector radiative transfer equation (VRTE) splits up into a set of independent equations with zenith angle as only angular coordinate. Using the Gaussian-Quadrature method, VRTE is finally transferred into the matrix equation, which is calculated by using the adding-doubling method. According to the reflective and refractive properties of the ocean-atmosphere interface, the vector radiative transfer numerical model of ocean and atmosphere is coupled in PCOART. By comparing with the exact Rayleigh scattering look-up-table of MODIS(Moderate-resolution Imaging Spectroradiometer), it is shown that PCOART is an exact numerical calculation model, and the processing methods of the multi-scattering and polarization are correct in PCOART. Also, by validating with the standard problems of the radiative transfer in water, it is shown that PCOART could be used to calculate the underwater radiative transfer problems. Therefore, PCOART is a useful tool to exactly calculate the vector radiative transfer of the coupled ocean-atmosphere system, which can be used to study the polarization properties of the radiance in the whole ocean-atmosphere system and the remote sensing of the atmosphere and ocean.

Generalization of the Jones vector-matrix method and the regularity of the Weigert effect for partially polarized light.

PubMed

Kilosanidze, Barbara

2010-06-01

Generalization of the Jones vector for partially polarized radiation carried out by Kakichashvili is given. Partially polarized light is presented as two noncoherent components of mutually orthogonal polarization. The formal operation of amplitude summation of mutually noncoherent components and the symbol of this operation are introduced. The rules of operating with this symbol are determined. The regularity of the Weigert effect is modified for partial polarization of the inducing light. On this basis the modification of the Jones matrix for partially polarized light is made. The rules for the formation of the resulting matrix from the Jones matrices corresponding to the noncoherent components of partially polarized light are determined.

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.

Subspace aware recovery of low rank and jointly sparse signals

PubMed Central

Biswas, Sampurna; Dasgupta, Soura; Mudumbai, Raghuraman; Jacob, Mathews

2017-01-01

We consider the recovery of a matrix X, which is simultaneously low rank and joint sparse, from few measurements of its columns using a two-step algorithm. Each column of X is measured using a combination of two measurement matrices; one which is the same for every column, while the the second measurement matrix varies from column to column. The recovery proceeds by first estimating the row subspace vectors from the measurements corresponding to the common matrix. The estimated row subspace vectors are then used to recover X from all the measurements using a convex program of joint sparsity minimization. Our main contribution is to provide sufficient conditions on the measurement matrices that guarantee the recovery of such a matrix using the above two-step algorithm. The results demonstrate quite significant savings in number of measurements when compared to the standard multiple measurement vector (MMV) scheme, which assumes same time invariant measurement pattern for all the time frames. We illustrate the impact of the sampling pattern on reconstruction quality using breath held cardiac cine MRI and cardiac perfusion MRI data, while the utility of the algorithm to accelerate the acquisition is demonstrated on MR parameter mapping. PMID:28630889

Pu239 Cross-Section Variations Based on Experimental Uncertainties and Covariances

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

Sigeti, David Edward; Williams, Brian J.; Parsons, D. Kent

2016-10-18

Algorithms and software have been developed for producing variations in plutonium-239 neutron cross sections based on experimental uncertainties and covariances. The varied cross-section sets may be produced as random samples from the multi-variate normal distribution defined by an experimental mean vector and covariance matrix, or they may be produced as Latin-Hypercube/Orthogonal-Array samples (based on the same means and covariances) for use in parametrized studies. The variations obey two classes of constraints that are obligatory for cross-section sets and which put related constraints on the mean vector and covariance matrix that detemine the sampling. Because the experimental means and covariances domore » not obey some of these constraints to sufficient precision, imposing the constraints requires modifying the experimental mean vector and covariance matrix. Modification is done with an algorithm based on linear algebra that minimizes changes to the means and covariances while insuring that the operations that impose the different constraints do not conflict with each other.« less

Vectorization, threading, and cache-blocking considerations for hydrocodes on emerging architectures

DOE PAGES

Fung, J.; Aulwes, R. T.; Bement, M. T.; ...

2015-07-14

This work reports on considerations for improving computational performance in preparation for current and expected changes to computer architecture. The algorithms studied will include increasingly complex prototypes for radiation hydrodynamics codes, such as gradient routines and diffusion matrix assembly (e.g., in [1-6]). The meshes considered for the algorithms are structured or unstructured meshes. The considerations applied for performance improvements are meant to be general in terms of architecture (not specifically graphical processing unit (GPUs) or multi-core machines, for example) and include techniques for vectorization, threading, tiling, and cache blocking. Out of a survey of optimization techniques on applications such asmore » diffusion and hydrodynamics, we make general recommendations with a view toward making these techniques conceptually accessible to the applications code developer. Published 2015. This article is a U.S. Government work and is in the public domain in the USA.« less

Matrix-M™ adjuvant enhances immunogenicity of both protein- and modified vaccinia virus Ankara-based influenza vaccines in mice.

PubMed

Magnusson, Sofia E; Altenburg, Arwen F; Bengtsson, Karin Lövgren; Bosman, Fons; de Vries, Rory D; Rimmelzwaan, Guus F; Stertman, Linda

2018-04-01

Influenza viruses continuously circulate in the human population and escape recognition by virus neutralizing antibodies induced by prior infection or vaccination through accumulation of mutations in the surface proteins hemagglutinin (HA) and neuraminidase (NA). Various strategies to develop a vaccine that provides broad protection against different influenza A viruses are under investigation, including use of recombinant (r) viral vectors and adjuvants. The replication-deficient modified vaccinia virus Ankara (MVA) is a promising vaccine vector that efficiently induces B and T cell responses specific for the antigen of interest. It is assumed that live vaccine vectors do not require an adjuvant to be immunogenic as the vector already mediates recruitment and activation of immune cells. To address this topic, BALB/c mice were vaccinated with either protein- or rMVA-based HA influenza vaccines, formulated with or without the saponin-based Matrix-M™ adjuvant. Co-formulation with Matrix-M significantly increased HA vaccine immunogenicity, resulting in antigen-specific humoral and cellular immune responses comparable to those induced by unadjuvanted rMVA-HA. Of special interest, rMVA-HA immunogenicity was also enhanced by addition of Matrix-M, demonstrated by enhanced HA inhibition antibody titres and cellular immune responses. Matrix-M added to either protein- or rMVA-based HA vaccines mediated recruitment and activation of antigen-presenting cells and lymphocytes to the draining lymph node 24 and 48 h post-vaccination. Taken together, these results suggest that adjuvants can be used not only with protein-based vaccines but also in combination with rMVA to increase vaccine immunogenicity, which may be a step forward to generate new and more effective influenza vaccines.

A diagram for evaluating multiple aspects of model performance in simulating vector fields

NASA Astrophysics Data System (ADS)

Xu, Zhongfeng; Hou, Zhaolu; Han, Ying; Guo, Weidong

2016-12-01

Vector quantities, e.g., vector winds, play an extremely important role in climate systems. The energy and water exchanges between different regions are strongly dominated by wind, which in turn shapes the regional climate. Thus, how well climate models can simulate vector fields directly affects model performance in reproducing the nature of a regional climate. This paper devises a new diagram, termed the vector field evaluation (VFE) diagram, which is a generalized Taylor diagram and able to provide a concise evaluation of model performance in simulating vector fields. The diagram can measure how well two vector fields match each other in terms of three statistical variables, i.e., the vector similarity coefficient, root mean square length (RMSL), and root mean square vector difference (RMSVD). Similar to the Taylor diagram, the VFE diagram is especially useful for evaluating climate models. The pattern similarity of two vector fields is measured by a vector similarity coefficient (VSC) that is defined by the arithmetic mean of the inner product of normalized vector pairs. Examples are provided, showing that VSC can identify how close one vector field resembles another. Note that VSC can only describe the pattern similarity, and it does not reflect the systematic difference in the mean vector length between two vector fields. To measure the vector length, RMSL is included in the diagram. The third variable, RMSVD, is used to identify the magnitude of the overall difference between two vector fields. Examples show that the VFE diagram can clearly illustrate the extent to which the overall RMSVD is attributed to the systematic difference in RMSL and how much is due to the poor pattern similarity.

QCD next-to-leading-order predictions matched to parton showers for vector-like quark models.

PubMed

Fuks, Benjamin; Shao, Hua-Sheng

2017-01-01

Vector-like quarks are featured by a wealth of beyond the Standard Model theories and are consequently an important goal of many LHC searches for new physics. Those searches, as well as most related phenomenological studies, however, rely on predictions evaluated at the leading-order accuracy in QCD and consider well-defined simplified benchmark scenarios. Adopting an effective bottom-up approach, we compute next-to-leading-order predictions for vector-like-quark pair production and single production in association with jets, with a weak or with a Higgs boson in a general new physics setup. We additionally compute vector-like-quark contributions to the production of a pair of Standard Model bosons at the same level of accuracy. For all processes under consideration, we focus both on total cross sections and on differential distributions, most these calculations being performed for the first time in our field. As a result, our work paves the way to precise extraction of experimental limits on vector-like quarks thanks to an accurate control of the shapes of the relevant observables and emphasise the extra handles that could be provided by novel vector-like-quark probes never envisaged so far.

spammpack, Version 2013-06-18

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

2014-01-17

This library is an implementation of the Sparse Approximate Matrix Multiplication (SpAMM) algorithm introduced. It provides a matrix data type, and an approximate matrix product, which exhibits linear scaling computational complexity for matrices with decay. The product error and the performance of the multiply can be tuned by choosing an appropriate tolerance. The library can be compiled for serial execution or parallel execution on shared memory systems with an OpenMP capable compiler

Geographical classification of apple based on hyperspectral imaging

NASA Astrophysics Data System (ADS)

Guo, Zhiming; Huang, Wenqian; Chen, Liping; Zhao, Chunjiang; Peng, Yankun

2013-05-01

Attribute of apple according to geographical origin is often recognized and appreciated by the consumers. It is usually an important factor to determine the price of a commercial product. Hyperspectral imaging technology and supervised pattern recognition was attempted to discriminate apple according to geographical origins in this work. Hyperspectral images of 207 Fuji apple samples were collected by hyperspectral camera (400-1000nm). Principal component analysis (PCA) was performed on hyperspectral imaging data to determine main efficient wavelength images, and then characteristic variables were extracted by texture analysis based on gray level co-occurrence matrix (GLCM) from dominant waveband image. All characteristic variables were obtained by fusing the data of images in efficient spectra. Support vector machine (SVM) was used to construct the classification model, and showed excellent performance in classification results. The total classification rate had the high classify accuracy of 92.75% in the training set and 89.86% in the prediction sets, respectively. The overall results demonstrated that the hyperspectral imaging technique coupled with SVM classifier can be efficiently utilized to discriminate Fuji apple according to geographical origins.

Memristor-Based Analog Computation and Neural Network Classification with a Dot Product Engine.

PubMed

Hu, Miao; Graves, Catherine E; Li, Can; Li, Yunning; Ge, Ning; Montgomery, Eric; Davila, Noraica; Jiang, Hao; Williams, R Stanley; Yang, J Joshua; Xia, Qiangfei; Strachan, John Paul

2018-03-01

Using memristor crossbar arrays to accelerate computations is a promising approach to efficiently implement algorithms in deep neural networks. Early demonstrations, however, are limited to simulations or small-scale problems primarily due to materials and device challenges that limit the size of the memristor crossbar arrays that can be reliably programmed to stable and analog values, which is the focus of the current work. High-precision analog tuning and control of memristor cells across a 128 × 64 array is demonstrated, and the resulting vector matrix multiplication (VMM) computing precision is evaluated. Single-layer neural network inference is performed in these arrays, and the performance compared to a digital approach is assessed. Memristor computing system used here reaches a VMM accuracy equivalent of 6 bits, and an 89.9% recognition accuracy is achieved for the 10k MNIST handwritten digit test set. Forecasts show that with integrated (on chip) and scaled memristors, a computational efficiency greater than 100 trillion operations per second per Watt is possible. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Implementing a Matrix-free Analytical Jacobian to Handle Nonlinearities in Models of 3D Lithospheric Deformation

NASA Astrophysics Data System (ADS)

Kaus, B.; Popov, A.

2015-12-01

The analytical expression for the Jacobian is a key component to achieve fast and robust convergence of the nonlinear Newton-Raphson iterative solver. Accomplishing this task in practice often requires a significant algebraic effort. Therefore it is quite common to use a cheap alternative instead, for example by approximating the Jacobian with a finite difference estimation. Despite its simplicity it is a relatively fragile and unreliable technique that is sensitive to the scaling of the residual and unknowns, as well as to the perturbation parameter selection. Unfortunately no universal rule can be applied to provide both a robust scaling and a perturbation. The approach we use here is to derive the analytical Jacobian for the coupled set of momentum, mass, and energy conservation equations together with the elasto-visco-plastic rheology and a marker in cell/staggered finite difference method. The software project LaMEM (Lithosphere and Mantle Evolution Model) is primarily developed for the thermo-mechanically coupled modeling of the 3D lithospheric deformation. The code is based on a staggered grid finite difference discretization in space, and uses customized scalable solvers form PETSc library to efficiently run on the massively parallel machines (such as IBM Blue Gene/Q). Currently LaMEM relies on the Jacobian-Free Newton-Krylov (JFNK) nonlinear solver, which approximates the Jacobian-vector product using a simple finite difference formula. This approach never requires an assembled Jacobian matrix and uses only the residual computation routine. We use an approximate Jacobian (Picard) matrix to precondition the Krylov solver with the Galerkin geometric multigrid. Because of the inherent problems of the finite difference Jacobian estimation, this approach doesn't always result in stable convergence. In this work we present and discuss a matrix-free technique in which the Jacobian-vector product is replaced by analytically-derived expressions and compare results with those obtained with a finite difference approximation of the Jacobian. This project is funded by ERC Starting Grant 258830 and computer facilities were provided by Jülich supercomputer center (Germany).

Using the Relevance Vector Machine Model Combined with Local Phase Quantization to Predict Protein-Protein Interactions from Protein Sequences.

PubMed

An, Ji-Yong; Meng, Fan-Rong; You, Zhu-Hong; Fang, Yu-Hong; Zhao, Yu-Jun; Zhang, Ming

2016-01-01

We propose a novel computational method known as RVM-LPQ that combines the Relevance Vector Machine (RVM) model and Local Phase Quantization (LPQ) to predict PPIs from protein sequences. The main improvements are the results of representing protein sequences using the LPQ feature representation on a Position Specific Scoring Matrix (PSSM), reducing the influence of noise using a Principal Component Analysis (PCA), and using a Relevance Vector Machine (RVM) based classifier. We perform 5-fold cross-validation experiments on Yeast and Human datasets, and we achieve very high accuracies of 92.65% and 97.62%, respectively, which is significantly better than previous works. To further evaluate the proposed method, we compare it with the state-of-the-art support vector machine (SVM) classifier on the Yeast dataset. The experimental results demonstrate that our RVM-LPQ method is obviously better than the SVM-based method. The promising experimental results show the efficiency and simplicity of the proposed method, which can be an automatic decision support tool for future proteomics research.

Verification of 2A peptide cleavage.

PubMed

Szymczak-Workman, Andrea L; Vignali, Kate M; Vignali, Dario A A

2012-02-01

The need for reliable, multicistronic vectors for multigene delivery is at the forefront of biomedical technology. It is now possible to express multiple proteins from a single open reading frame (ORF) using 2A peptide-linked multicistronic vectors. These small sequences, when cloned between genes, allow for efficient, stoichiometric production of discrete protein products within a single vector through a novel "cleavage" event within the 2A peptide sequence. The easiest and most effective way to assess 2A cleavage is to perform transient transfection of 293T cells (human embryonic kidney cells) followed by western blot analysis, as described in this protocol. 293T cells are easy to grow and can be efficiently transfected with a variety of vectors. Cleavage can be assessed by detection with antibodies against the target proteins or anti-2A serum.

Analysis of spectrally resolved autofluorescence images by support vector machines

NASA Astrophysics Data System (ADS)

Mateasik, A.; Chorvat, D.; Chorvatova, A.

2013-02-01

Spectral analysis of the autofluorescence images of isolated cardiac cells was performed to evaluate and to classify the metabolic state of the cells in respect to the responses to metabolic modulators. The classification was done using machine learning approach based on support vector machine with the set of the automatically calculated features from recorded spectral profile of spectral autofluorescence images. This classification method was compared with the classical approach where the individual spectral components contributing to cell autofluorescence were estimated by spectral analysis, namely by blind source separation using non-negative matrix factorization. Comparison of both methods showed that machine learning can effectively classify the spectrally resolved autofluorescence images without the need of detailed knowledge about the sources of autofluorescence and their spectral properties.

Another elementary proof of the Jordan form of a matrix

NASA Astrophysics Data System (ADS)

Budhi, Wono Setya

2012-05-01

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

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices

NASA Technical Reports Server (NTRS)

Freund, Roland W.; Gutknecht, Martin H.; Nachtigal, Noel M.

1991-01-01

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation is presented of a look-ahead version of the Lanczos algorithm that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead.

Three Interpretations of the Matrix Equation Ax = b

ERIC Educational Resources Information Center

Larson, Christine; Zandieh, Michelle

2013-01-01

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

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

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

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

Simple and practical approach for computing the ray Hessian matrix in geometrical optics.

PubMed

Lin, Psang Dain

2018-02-01

A method is proposed for simplifying the computation of the ray Hessian matrix in geometrical optics by replacing the angular variables in the system variable vector with their equivalent cosine and sine functions. The variable vector of a boundary surface is similarly defined in such a way as to exclude any angular variables. It is shown that the proposed formulations reduce the computation time of the Hessian matrix by around 10 times compared to the previous method reported by the current group in Advanced Geometrical Optics (2016). Notably, the method proposed in this study involves only polynomial differentiation, i.e., trigonometric function calls are not required. As a consequence, the computation complexity is significantly reduced. Five illustrative examples are given. The first three examples show that the proposed method is applicable to the determination of the Hessian matrix for any pose matrix, irrespective of the order in which the rotation and translation motions are specified. The last two examples demonstrate the use of the proposed Hessian matrix in determining the axial and lateral chromatic aberrations of a typical optical system.

Minimal parameter solution of the orthogonal matrix differential equation

NASA Technical Reports Server (NTRS)

Bar-Itzhack, Itzhack Y.; Markley, F. Landis

1990-01-01

As demonstrated in this work, all orthogonal matrices solve a first order differential equation. The straightforward solution of this equation requires n sup 2 integrations to obtain the element of the nth order matrix. There are, however, only n(n-1)/2 independent parameters which determine an orthogonal matrix. The questions of choosing them, finding their differential equation and expressing the orthogonal matrix in terms of these parameters are considered. Several possibilities which are based on attitude determination in three dimensions are examined. It is shown that not all 3-D methods have useful extensions to higher dimensions. It is also shown why the rate of change of the matrix elements, which are the elements of the angular rate vector in 3-D, are the elements of a tensor of the second rank (dyadic) in spaces other than three dimensional. It is proven that the 3-D Gibbs vector (or Cayley Parameters) are extendable to other dimensions. An algorithm is developed emplying the resulting parameters, which are termed Extended Rodrigues Parameters, and numerical results are presented of the application of the algorithm to a fourth order matrix.

Minimal parameter solution of the orthogonal matrix differential equation

NASA Technical Reports Server (NTRS)

Baritzhack, Itzhack Y.; Markley, F. Landis

1988-01-01

As demonstrated in this work, all orthogonal matrices solve a first order differential equation. The straightforward solution of this equation requires n sup 2 integrations to obtain the element of the nth order matrix. There are, however, only n(n-1)/2 independent parameters which determine an orthogonal matrix. The questions of choosing them, finding their differential equation and expressing the orthogonal matrix in terms of these parameters are considered. Several possibilities which are based on attitude determination in three dimensions are examined. It is shown that not all 3-D methods have useful extensions to higher dimensions. It is also shown why the rate of change of the matrix elements, which are the elements of the angular rate vector in 3-D, are the elements of a tensor of the second rank (dyadic) in spaces other than three dimensional. It is proven that the 3-D Gibbs vector (or Cayley Parameters) are extendable to other dimensions. An algorithm is developed employing the resulting parameters, which are termed Extended Rodrigues Parameters, and numerical results are presented of the application of the algorithm to a fourth order matrix.

Genetically modified pigs produced with a nonviral episomal vector

PubMed Central

Manzini, Stefano; Vargiolu, Alessia; Stehle, Isa M; Bacci, Maria Laura; Cerrito, Maria Grazia; Giovannoni, Roberto; Zannoni, Augusta; Bianco, Maria Rosaria; Forni, Monica; Donini, Pierluigi; Papa, Michele; Lipps, Hans J; Lavitrano, Marialuisa

2006-01-01

Genetic modification of cells and animals is an invaluable tool for biotechnology and biomedicine. Currently, integrating vectors are used for this purpose. These vectors, however, may lead to insertional mutagenesis and variable transgene expression and can undergo silencing. Scaffold/matrix attachment region-based vectors are nonviral expression systems that replicate autonomously in mammalian cells, thereby making possible safe and reliable genetic modification of higher eukaryotic cells and organisms. In this study, genetically modified pig fetuses were produced with the scaffold/matrix attachment region-based vector pEPI, delivered to embryos by the sperm-mediated gene transfer method. The pEPI vector was detected in 12 of 18 fetuses in the different tissues analyzed and was shown to be retained as an episome. The reporter gene encoded by the pEPI vector was expressed in 9 of 12 genetically modified fetuses. In positive animals, all tissues analyzed expressed the reporter gene; moreover in these tissues, the positive cells were on the average 79%. The high percentage of EGFP-expressing cells and the absence of mosaicism have important implications for biotechnological and biomedical applications. These results are an important step forward in animal transgenesis and can provide the basis for the future development of germ-line gene therapy. PMID:17101993

Acousto-Optical Vector Matrix Product Processor: Implementation Issues

DTIC Science & Technology

1989-04-25

power by a factor of 3.8. The acoustic velocity in longitudinal TeO2 is 4200 m/s, almost the same as the 4100 m/s acoustic velocity in dense flint glass ...field via an Interaction Model AOD150 dense flint glass Bragg Cell. The cell’s specifications are listed in the table below. BRAGG CELL SPECIFICATIONS...39 ns intervals). Since the speed of sound in dense flint glass is 4100 m/s, the acoustic field generated in a 10 As interval is distributed over a 4.1

An affine projection algorithm using grouping selection of input vectors

NASA Astrophysics Data System (ADS)

Shin, JaeWook; Kong, NamWoong; Park, PooGyeon

2011-10-01

This paper present an affine projection algorithm (APA) using grouping selection of input vectors. To improve the performance of conventional APA, the proposed algorithm adjusts the number of the input vectors using two procedures: grouping procedure and selection procedure. In grouping procedure, the some input vectors that have overlapping information for update is grouped using normalized inner product. Then, few input vectors that have enough information for for coefficient update is selected using steady-state mean square error (MSE) in selection procedure. Finally, the filter coefficients update using selected input vectors. The experimental results show that the proposed algorithm has small steady-state estimation errors comparing with the existing algorithms.

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

PubMed

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

2017-01-01

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

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

PubMed Central

Quispe-Soncco, Raisa

2017-01-01

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

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

NASA Astrophysics Data System (ADS)

Kopriva, Ivica; Peršin, Antun

2010-03-01

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

Boundary Quantum Knizhnik-Zamolodchikov Equations and Bethe Vectors

NASA Astrophysics Data System (ADS)

Reshetikhin, Nicolai; Stokman, Jasper; Vlaar, Bart

2015-06-01

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

Microbiota-induced peritrophic matrix regulates midgut homeostasis and prevents systemic infection of malaria vector mosquitoes

PubMed Central

Rodgers, Faye H.

2017-01-01

Manipulation of the mosquito gut microbiota can lay the foundations for novel methods for disease transmission control. Mosquito blood feeding triggers a significant, transient increase of the gut microbiota, but little is known about the mechanisms by which the mosquito controls this bacterial growth whilst limiting inflammation of the gut epithelium. Here, we investigate the gut epithelial response to the changing microbiota load upon blood feeding in the malaria vector Anopheles coluzzii. We show that the synthesis and integrity of the peritrophic matrix, which physically separates the gut epithelium from its luminal contents, is microbiota dependent. We reveal that the peritrophic matrix limits the growth and persistence of Enterobacteriaceae within the gut, whilst preventing seeding of a systemic infection. Our results demonstrate that the peritrophic matrix is a key regulator of mosquito gut homeostasis and establish functional analogies between this and the mucus layers of the mammalian gastrointestinal tract. PMID:28545061

E-beam generated holographic masks for optical vector-matrix multiplication

NASA Technical Reports Server (NTRS)

Arnold, S. M.; Case, S. K.

1981-01-01

An optical vector matrix multiplication scheme that encodes the matrix elements as a holographic mask consisting of linear diffraction gratings is proposed. The binary, chrome on glass masks are fabricated by e-beam lithography. This approach results in a fairly simple optical system that promises both large numerical range and high accuracy. A partitioned computer generated hologram mask was fabricated and tested. This hologram was diagonally separated outputs, compact facets and symmetry about the axis. The resultant diffraction pattern at the output plane is shown. Since the grating fringes are written at 45 deg relative to the facet boundaries, the many on-axis sidelobes from each output are seen to be diagonally separated from the adjacent output signals.

Vectorization of linear discrete filtering algorithms

NASA Technical Reports Server (NTRS)

Schiess, J. R.

1977-01-01

Linear filters, including the conventional Kalman filter and versions of square root filters devised by Potter and Carlson, are studied for potential application on streaming computers. The square root filters are known to maintain a positive definite covariance matrix in cases in which the Kalman filter diverges due to ill-conditioning of the matrix. Vectorization of the filters is discussed, and comparisons are made of the number of operations and storage locations required by each filter. The Carlson filter is shown to be the most efficient of the filters on the Control Data STAR-100 computer.

Cloning strategy for producing brush-forming protein-based polymers.

PubMed

Henderson, Douglas B; Davis, Richey M; Ducker, William A; Van Cott, Kevin E

2005-01-01

Brush-forming polymers are being used in a variety of applications, and by using recombinant DNA technology, there exists the potential to produce protein-based polymers that incorporate unique structures and functions in these brush layers. Despite this potential, production of protein-based brush-forming polymers is not routinely performed. For the design and production of new protein-based polymers with optimal brush-forming properties, it would be desirable to have a cloning strategy that allows an iterative approach wherein the protein based-polymer product can be produced and evaluated, and then if necessary, it can be sequentially modified in a controlled manner to obtain optimal surface density and brush extension. In this work, we report on the development of a cloning strategy intended for the production of protein-based brush-forming polymers. This strategy is based on the assembly of modules of DNA that encode for blocks of protein-based polymers into a commercially available expression vector; there is no need for custom-modified vectors and no need for intermediate cloning vectors. Additionally, because the design of new protein-based biopolymers can be an iterative process, our method enables sequential modification of a protein-based polymer product. With at least 21 bacterial expression vectors and 11 yeast expression vectors compatible with this strategy, there are a number of options available for production of protein-based polymers. It is our intent that this strategy will aid in advancing the production of protein-based brush-forming polymers.

Effects of phase vector and history extension on prediction power of adaptive-network based fuzzy inference system (ANFIS) model for a real scale anaerobic wastewater treatment plant operating under unsteady state.

PubMed

Perendeci, Altinay; Arslan, Sever; Tanyolaç, Abdurrahman; Celebi, Serdar S

2009-10-01

A conceptual neural fuzzy model based on adaptive-network based fuzzy inference system, ANFIS, was proposed using available input on-line and off-line operational variables for a sugar factory anaerobic wastewater treatment plant operating under unsteady state to estimate the effluent chemical oxygen demand, COD. The predictive power of the developed model was improved as a new approach by adding the phase vector and the recent values of COD up to 5-10 days, longer than overall retention time of wastewater in the system. History of last 10 days for COD effluent with two-valued phase vector in the input variable matrix including all parameters had more predictive power. History of 7 days with two-valued phase vector in the matrix comprised of only on-line variables yielded fairly well estimations. The developed ANFIS model with phase vector and history extension has been able to adequately represent the behavior of the treatment system.

Fourier transform inequalities for phylogenetic trees.

PubMed

Matsen, Frederick A

2009-01-01

Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for phylogenetic trees. A mutation matrix, by its definition, is the exponential of a matrix with non-negative off-diagonal entries; this positivity requirement implies non-trivial constraints on the site-pattern frequency vectors. We call these additional constraints "edge-parameter inequalities". In this paper, we first motivate the edge-parameter inequalities by considering a pathological site-pattern frequency vector corresponding to a quartet tree with a negative internal edge. This site-pattern frequency vector nevertheless satisfies all of the constraints described up to now in the literature. We next describe two complete sets of edge-parameter inequalities for the group-based models; these constraints are square-free monomial inequalities in the Fourier transformed coordinates. These inequalities, along with the phylogenetic invariants, form a complete description of the set of site-pattern frequency vectors corresponding to bona fide trees. Said in mathematical language, this paper explicitly presents two finite lists of inequalities in Fourier coordinates of the form "monomial < or = 1", each list characterizing the phylogenetically relevant semialgebraic subsets of the phylogenetic varieties.

Noniterative MAP reconstruction using sparse matrix representations.

PubMed

Cao, Guangzhi; Bouman, Charles A; Webb, Kevin J

2009-09-01

We present a method for noniterative maximum a posteriori (MAP) tomographic reconstruction which is based on the use of sparse matrix representations. Our approach is to precompute and store the inverse matrix required for MAP reconstruction. This approach has generally not been used in the past because the inverse matrix is typically large and fully populated (i.e., not sparse). In order to overcome this problem, we introduce two new ideas. The first idea is a novel theory for the lossy source coding of matrix transformations which we refer to as matrix source coding. This theory is based on a distortion metric that reflects the distortions produced in the final matrix-vector product, rather than the distortions in the coded matrix itself. The resulting algorithms are shown to require orthonormal transformations of both the measurement data and the matrix rows and columns before quantization and coding. The second idea is a method for efficiently storing and computing the required orthonormal transformations, which we call a sparse-matrix transform (SMT). The SMT is a generalization of the classical FFT in that it uses butterflies to compute an orthonormal transform; but unlike an FFT, the SMT uses the butterflies in an irregular pattern, and is numerically designed to best approximate the desired transforms. We demonstrate the potential of the noniterative MAP reconstruction with examples from optical tomography. The method requires offline computation to encode the inverse transform. However, once these offline computations are completed, the noniterative MAP algorithm is shown to reduce both storage and computation by well over two orders of magnitude, as compared to a linear iterative reconstruction methods.

Exploration of ethyl anthranilate-loaded monolithic matrix-type prophylactic polymeric patch.

PubMed

Islam, Johirul; Zaman, Kamaruz; Chakrabarti, Srijita; Bora, Nilutpal Sharma; Pathak, Manash Pratim; Mandal, Santa; Junejo, Julfikar Ali; Chattopadhyay, Pronobesh

2017-10-01

Compromised stability of pharmaceutical formulations loaded with volatiles is a serious problem associated with devices designed to deliver volatile compounds. The present study has been focused to evaluate the stability potential of matrix-type polymeric patches composed of volatile ethyl anthranilate for prophylaxis against vector-borne diseases. Ethyl anthranilate-loaded matrix-type polymeric patches were fabricated by solvent evaporation method on an impermeable backing membrane and attached to temporary release liners. Stability testing of the polymeric patches was performed as per the International Conference on Harmonization (ICH) guidelines for 6 months under accelerated conditions. In addition, the quantification of residual solvents was also performed as per the ICH guidelines. After conducting the stability studies for 6 months, the optimized patches showed the best possible results with respect to uniformity of drug content, physical appearance, and other analytical parameters. Furthermore, the amount of residual solvent was found well below the accepted limit. Thus, the present report outlined the analytical parameters to be evaluated to ensure the stability of a certain devices consisting of volatile compounds. Copyright © 2016. Published by Elsevier B.V.

Fast space-varying convolution using matrix source coding with applications to camera stray light reduction.

PubMed

Wei, Jianing; Bouman, Charles A; Allebach, Jan P

2014-05-01

Many imaging applications require the implementation of space-varying convolution for accurate restoration and reconstruction of images. Here, we use the term space-varying convolution to refer to linear operators whose impulse response has slow spatial variation. In addition, these space-varying convolution operators are often dense, so direct implementation of the convolution operator is typically computationally impractical. One such example is the problem of stray light reduction in digital cameras, which requires the implementation of a dense space-varying deconvolution operator. However, other inverse problems, such as iterative tomographic reconstruction, can also depend on the implementation of dense space-varying convolution. While space-invariant convolution can be efficiently implemented with the fast Fourier transform, this approach does not work for space-varying operators. So direct convolution is often the only option for implementing space-varying convolution. In this paper, we develop a general approach to the efficient implementation of space-varying convolution, and demonstrate its use in the application of stray light reduction. Our approach, which we call matrix source coding, is based on lossy source coding of the dense space-varying convolution matrix. Importantly, by coding the transformation matrix, we not only reduce the memory required to store it; we also dramatically reduce the computation required to implement matrix-vector products. Our algorithm is able to reduce computation by approximately factoring the dense space-varying convolution operator into a product of sparse transforms. Experimental results show that our method can dramatically reduce the computation required for stray light reduction while maintaining high accuracy.

Quick and clean cloning.

PubMed

Thieme, Frank; Marillonnet, Sylvestre

2014-01-01

Identification of unknown sequences that flank known sequences of interest requires PCR amplification of DNA fragments that contain the junction between the known and unknown flanking sequences. Since amplified products often contain a mixture of specific and nonspecific products, the quick and clean (QC) cloning procedure was developed to clone specific products only. QC cloning is a ligation-independent cloning procedure that relies on the exonuclease activity of T4 DNA polymerase to generate single-stranded extensions at the ends of the vector and insert. A specific feature of QC cloning is the use of vectors that contain a sequence called catching sequence that allows cloning specific products only. QC cloning is performed by a one-pot incubation of insert and vector in the presence of T4 DNA polymerase at room temperature for 10 min followed by direct transformation of the incubation mix in chemo-competent Escherichia coli cells.

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

Gebis, Joseph; Oliker, Leonid; Shalf, John

The disparity between microprocessor clock frequencies and memory latency is a primary reason why many demanding applications run well below peak achievable performance. Software controlled scratchpad memories, such as the Cell local store, attempt to ameliorate this discrepancy by enabling precise control over memory movement; however, scratchpad technology confronts the programmer and compiler with an unfamiliar and difficult programming model. In this work, we present the Virtual Vector Architecture (ViVA), which combines the memory semantics of vector computers with a software-controlled scratchpad memory in order to provide a more effective and practical approach to latency hiding. ViVA requires minimal changesmore » to the core design and could thus be easily integrated with conventional processor cores. To validate our approach, we implemented ViVA on the Mambo cycle-accurate full system simulator, which was carefully calibrated to match the performance on our underlying PowerPC Apple G5 architecture. Results show that ViVA is able to deliver significant performance benefits over scalar techniques for a variety of memory access patterns as well as two important memory-bound compact kernels, corner turn and sparse matrix-vector multiplication -- achieving 2x-13x improvement compared the scalar version. Overall, our preliminary ViVA exploration points to a promising approach for improving application performance on leading microprocessors with minimal design and complexity costs, in a power efficient manner.« less

Perturbative approach to covariance matrix of the matter power spectrum

NASA Astrophysics Data System (ADS)

Mohammed, Irshad; Seljak, Uroš; Vlah, Zvonimir

2017-04-01

We evaluate the covariance matrix of the matter power spectrum using perturbation theory up to dominant terms at 1-loop order and compare it to numerical simulations. We decompose the covariance matrix into the disconnected (Gaussian) part, trispectrum from the modes outside the survey (supersample variance) and trispectrum from the modes inside the survey, and show how the different components contribute to the overall covariance matrix. We find the agreement with the simulations is at a 10 per cent level up to k ˜ 1 h Mpc-1. We show that all the connected components are dominated by the large-scale modes (k < 0.1 h Mpc-1), regardless of the value of the wave vectors k, k΄ of the covariance matrix, suggesting that one must be careful in applying the jackknife or bootstrap methods to the covariance matrix. We perform an eigenmode decomposition of the connected part of the covariance matrix, showing that at higher k, it is dominated by a single eigenmode. The full covariance matrix can be approximated as the disconnected part only, with the connected part being treated as an external nuisance parameter with a known scale dependence, and a known prior on its variance for a given survey volume. Finally, we provide a prescription for how to evaluate the covariance matrix from small box simulations without the need to simulate large volumes.

Use of digital control theory state space formalism for feedback at SLC

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

Himel, T.; Hendrickson, L.; Rouse, F.

The algorithms used in the database-driven SLC fast-feedback system are based on the state space formalism of digital control theory. These are implemented as a set of matrix equations which use a Kalman filter to estimate a vector of states from a vector of measurements, and then apply a gain matrix to determine the actuator settings from the state vector. The matrices used in the calculation are derived offline using Linear Quadratic Gaussian minimization. For a given noise spectrum, this procedure minimizes the rms of the states (e.g., the position or energy of the beam). The offline program also allowsmore » simulation of the loop's response to arbitrary inputs, and calculates its frequency response. 3 refs., 3 figs.« less

Algebraic Bethe ansatz for the XXZ Heisenberg spin chain with triangular boundaries and the corresponding Gaudin model

NASA Astrophysics Data System (ADS)

Manojlović, N.; Salom, I.

2017-10-01

The implementation of the algebraic Bethe ansatz for the XXZ Heisenberg spin chain in the case, when both reflection matrices have the upper-triangular form is analyzed. The general form of the Bethe vectors is studied. In the particular form, Bethe vectors admit the recurrent procedure, with an appropriate modification, used previously in the case of the XXX Heisenberg chain. As expected, these Bethe vectors yield the strikingly simple expression for the off-shell action of the transfer matrix of the chain as well as the spectrum of the transfer matrix and the corresponding Bethe equations. As in the XXX case, the so-called quasi-classical limit gives the off-shell action of the generating function of the corresponding trigonometric Gaudin Hamiltonians with boundary terms.

Recent Selected Papers of Northwestern Polytechnical University in Two Parts, Part II.

DTIC Science & Technology

1981-08-28

OF CONTENTS Page Dual Properties of Elastic Structures 1 Matrix Analysis of Wings 76 On a Method for the Determination of Plane Stress Fracture...I= Ea]{(x, v,z) j l~i l’m mini The equation above means that the cisplacement function vector determines the strain function vector. (Assumption II...means that the distributed load function vector is determined by the stress function vector. In Section 1, there was an analysis of a three

Model Predictive Control of A Matrix-Converter Based Solid State Transformer for Utility Grid Interaction

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

Xue, Yaosuo

The matrix converter solid state transformer (MC-SST), formed from the back-to-back connection of two three-to-single-phase matrix converters, is studied for use in the interconnection of two ac grids. The matrix converter topology provides a light weight and low volume single-stage bidirectional ac-ac power conversion without the need for a dc link. Thus, the lifetime limitations of dc-bus storage capacitors are avoided. However, space vector modulation of this type of MC-SST requires to compute vectors for each of the two MCs, which must be carefully coordinated to avoid commutation failure. An additional controller is also required to control power exchange betweenmore » the two ac grids. In this paper, model predictive control (MPC) is proposed for an MC-SST connecting two different ac power grids. The proposed MPC predicts the circuit variables based on the discrete model of MC-SST system and the cost function is formulated so that the optimal switch vector for the next sample period is selected, thereby generating the required grid currents for the SST. Simulation and experimental studies are carried out to demonstrate the effectiveness and simplicity of the proposed MPC for such MC-SST-based grid interfacing systems.« less

Difference-based ridge-type estimator of parameters in restricted partial linear model with correlated errors.

PubMed

Wu, Jibo

2016-01-01

In this article, a generalized difference-based ridge estimator is proposed for the vector parameter in a partial linear model when the errors are dependent. It is supposed that some additional linear constraints may hold to the whole parameter space. Its mean-squared error matrix is compared with the generalized restricted difference-based estimator. Finally, the performance of the new estimator is explained by a simulation study and a numerical example.

MALDI-TOF MS Profiling-Advances in Species Identification of Pests, Parasites, and Vectors.

PubMed

Murugaiyan, Jayaseelan; Roesler, Uwe

2017-01-01

Invertebrate pests and parasites of humans, animals, and plants continue to cause serious diseases and remain as a high treat to agricultural productivity and storage. The rapid and accurate species identification of the pests and parasites are needed for understanding epidemiology, monitoring outbreaks, and designing control measures. Matrix-assisted laser desorption ionization time-of-flight mass spectrometry (MALDI-TOF MS) profiling has emerged as a rapid, cost effective, and high throughput technique of microbial species identification in modern diagnostic laboratories. The development of soft ionization techniques and the release of commercial pattern matching software platforms has resulted in the exponential growth of applications in higher organisms including parasitology. The present review discusses the proof-of-principle experiments and various methods of MALDI MS profiling in rapid species identification of both laboratory and field isolates of pests, parasites and vectors.

MALDI-TOF MS Profiling-Advances in Species Identification of Pests, Parasites, and Vectors

PubMed Central

Murugaiyan, Jayaseelan; Roesler, Uwe

2017-01-01

Invertebrate pests and parasites of humans, animals, and plants continue to cause serious diseases and remain as a high treat to agricultural productivity and storage. The rapid and accurate species identification of the pests and parasites are needed for understanding epidemiology, monitoring outbreaks, and designing control measures. Matrix-assisted laser desorption ionization time-of-flight mass spectrometry (MALDI-TOF MS) profiling has emerged as a rapid, cost effective, and high throughput technique of microbial species identification in modern diagnostic laboratories. The development of soft ionization techniques and the release of commercial pattern matching software platforms has resulted in the exponential growth of applications in higher organisms including parasitology. The present review discusses the proof-of-principle experiments and various methods of MALDI MS profiling in rapid species identification of both laboratory and field isolates of pests, parasites and vectors. PMID:28555175

Vectorization of a penalty function algorithm for well scheduling

NASA Technical Reports Server (NTRS)

Absar, I.

1984-01-01

In petroleum engineering, the oil production profiles of a reservoir can be simulated by using a finite gridded model. This profile is affected by the number and choice of wells which in turn is a result of various production limits and constraints including, for example, the economic minimum well spacing, the number of drilling rigs available and the time required to drill and complete a well. After a well is available it may be shut in because of excessive water or gas productions. In order to optimize the field performance a penalty function algorithm was developed for scheduling wells. For an example with some 343 wells and 15 different constraints, the scheduling routine vectorized for the CYBER 205 averaged 560 times faster performance than the scalar version.

D → Klv semileptonic decay using lattice QCD with HISQ at physical pion masses

NASA Astrophysics Data System (ADS)

Chakraborty, Bipasha; Davies, Christine; Koponen, Jonna; Lepage, G. Peter

2018-03-01

he quark flavor sector of the Standard Model is a fertile ground to look for new physics effects through a unitarity test of the Cabbibo-Kobayashi-Maskawa (CKM) matrix. We present a lattice QCD calculation of the scalar and the vector form factors (over a large q2 region including q2 = 0) associated with the D→ Klv semi-leptonic decay. This calculation will then allow us to determine the central CKM matrix element, Vcs in the Standard Model, by comparing the lattice QCD results for the form factors and the experimental decay rate. This form factor calculation has been performed on the Nf = 2 + 1 + 1 MILC HISQ ensembles with the physical light quark masses.

A Fast MoM Solver (GIFFT) for Large Arrays of Microstrip and Cavity-Backed Antennas

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

Fasenfest, B J; Capolino, F; Wilton, D

2005-02-02

A straightforward numerical analysis of large arrays of arbitrary contour (and possibly missing elements) requires large memory storage and long computation times. Several techniques are currently under development to reduce this cost. One such technique is the GIFFT (Green's function interpolation and FFT) method discussed here that belongs to the class of fast solvers for large structures. This method uses a modification of the standard AIM approach [1] that takes into account the reusability properties of matrices that arise from identical array elements. If the array consists of planar conducting bodies, the array elements are meshed using standard subdomain basismore » functions, such as the RWG basis. The Green's function is then projected onto a sparse regular grid of separable interpolating polynomials. This grid can then be used in a 2D or 3D FFT to accelerate the matrix-vector product used in an iterative solver [2]. The method has been proven to greatly reduce solve time by speeding up the matrix-vector product computation. The GIFFT approach also reduces fill time and memory requirements, since only the near element interactions need to be calculated exactly. The present work extends GIFFT to layered material Green's functions and multiregion interactions via slots in ground planes. In addition, a preconditioner is implemented to greatly reduce the number of iterations required for a solution. The general scheme of the GIFFT method is reported in [2]; this contribution is limited to presenting new results for array antennas made of slot-excited patches and cavity-backed patch antennas.« less

Detecting double compressed MPEG videos with the same quantization matrix and synchronized group of pictures structure

NASA Astrophysics Data System (ADS)

Aghamaleki, Javad Abbasi; Behrad, Alireza

2018-01-01

Double compression detection is a crucial stage in digital image and video forensics. However, the detection of double compressed videos is challenging when the video forger uses the same quantization matrix and synchronized group of pictures (GOP) structure during the recompression history to conceal tampering effects. A passive approach is proposed for detecting double compressed MPEG videos with the same quantization matrix and synchronized GOP structure. To devise the proposed algorithm, the effects of recompression on P frames are mathematically studied. Then, based on the obtained guidelines, a feature vector is proposed to detect double compressed frames on the GOP level. Subsequently, sparse representations of the feature vectors are used for dimensionality reduction and enrich the traces of recompression. Finally, a support vector machine classifier is employed to detect and localize double compression in temporal domain. The experimental results show that the proposed algorithm achieves the accuracy of more than 95%. In addition, the comparisons of the results of the proposed method with those of other methods reveal the efficiency of the proposed algorithm.

Generation of Stationary Non-Gaussian Time Histories with a Specified Cross-spectral Density

DOE PAGES

Smallwood, David O.

1997-01-01

The paper reviews several methods for the generation of stationary realizations of sampled time histories with non-Gaussian distributions and introduces a new method which can be used to control the cross-spectral density matrix and the probability density functions (pdfs) of the multiple input problem. Discussed first are two methods for the specialized case of matching the auto (power) spectrum, the skewness, and kurtosis using generalized shot noise and using polynomial functions. It is then shown that the skewness and kurtosis can also be controlled by the phase of a complex frequency domain description of the random process. The general casemore » of matching a target probability density function using a zero memory nonlinear (ZMNL) function is then covered. Next methods for generating vectors of random variables with a specified covariance matrix for a class of spherically invariant random vectors (SIRV) are discussed. Finally the general case of matching the cross-spectral density matrix of a vector of inputs with non-Gaussian marginal distributions is presented.« less

Searching for transcription factor binding sites in vector spaces

PubMed Central

2012-01-01

Background Computational approaches to transcription factor binding site identification have been actively researched in the past decade. Learning from known binding sites, new binding sites of a transcription factor in unannotated sequences can be identified. A number of search methods have been introduced over the years. However, one can rarely find one single method that performs the best on all the transcription factors. Instead, to identify the best method for a particular transcription factor, one usually has to compare a handful of methods. Hence, it is highly desirable for a method to perform automatic optimization for individual transcription factors. Results We proposed to search for transcription factor binding sites in vector spaces. This framework allows us to identify the best method for each individual transcription factor. We further introduced two novel methods, the negative-to-positive vector (NPV) and optimal discriminating vector (ODV) methods, to construct query vectors to search for binding sites in vector spaces. Extensive cross-validation experiments showed that the proposed methods significantly outperformed the ungapped likelihood under positional background method, a state-of-the-art method, and the widely-used position-specific scoring matrix method. We further demonstrated that motif subtypes of a TF can be readily identified in this framework and two variants called the k NPV and k ODV methods benefited significantly from motif subtype identification. Finally, independent validation on ChIP-seq data showed that the ODV and NPV methods significantly outperformed the other compared methods. Conclusions We conclude that the proposed framework is highly flexible. It enables the two novel methods to automatically identify a TF-specific subspace to search for binding sites. Implementations are available as source code at: http://biogrid.engr.uconn.edu/tfbs_search/. PMID:23244338

Information matrix estimation procedures for cognitive diagnostic models.

PubMed

Liu, Yanlou; Xin, Tao; Andersson, Björn; Tian, Wei

2018-03-06

Two new methods to estimate the asymptotic covariance matrix for marginal maximum likelihood estimation of cognitive diagnosis models (CDMs), the inverse of the observed information matrix and the sandwich-type estimator, are introduced. Unlike several previous covariance matrix estimators, the new methods take into account both the item and structural parameters. The relationships between the observed information matrix, the empirical cross-product information matrix, the sandwich-type covariance matrix and the two approaches proposed by de la Torre (2009, J. Educ. Behav. Stat., 34, 115) are discussed. Simulation results show that, for a correctly specified CDM and Q-matrix or with a slightly misspecified probability model, the observed information matrix and the sandwich-type covariance matrix exhibit good performance with respect to providing consistent standard errors of item parameter estimates. However, with substantial model misspecification only the sandwich-type covariance matrix exhibits robust performance. © 2018 The British Psychological Society.

Combined group ECC protection and subgroup parity protection

DOEpatents

Gara, Alan G.; Chen, Dong; Heidelberger, Philip; Ohmacht, Martin

2013-06-18

A method and system are disclosed for providing combined error code protection and subgroup parity protection for a given group of n bits. The method comprises the steps of identifying a number, m, of redundant bits for said error protection; and constructing a matrix P, wherein multiplying said given group of n bits with P produces m redundant error correction code (ECC) protection bits, and two columns of P provide parity protection for subgroups of said given group of n bits. In the preferred embodiment of the invention, the matrix P is constructed by generating permutations of m bit wide vectors with three or more, but an odd number of, elements with value one and the other elements with value zero; and assigning said vectors to rows of the matrix P.

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

NASA Technical Reports Server (NTRS)

Barnard, Stephen T.; Pothen, Alex; Simon, Horst D.

1993-01-01

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Characteristics of Minimally Oversized Adeno-Associated Virus Vectors Encoding Human Factor VIII Generated Using Producer Cell Lines and Triple Transfection.

PubMed

Nambiar, Bindu; Cornell Sookdeo, Cathleen; Berthelette, Patricia; Jackson, Robert; Piraino, Susan; Burnham, Brenda; Nass, Shelley; Souza, David; O'Riordan, Catherine R; Vincent, Karen A; Cheng, Seng H; Armentano, Donna; Kyostio-Moore, Sirkka

2017-02-01

Several ongoing clinical studies are evaluating recombinant adeno-associated virus (rAAV) vectors as gene delivery vehicles for a variety of diseases. However, the production of vectors with genomes >4.7 kb is challenging, with vector preparations frequently containing truncated genomes. To determine whether the generation of oversized rAAVs can be improved using a producer cell-line (PCL) process, HeLaS3-cell lines harboring either a 5.1 or 5.4 kb rAAV vector genome encoding codon-optimized cDNA for human B-domain deleted Factor VIII (FVIII) were isolated. High-producing "masterwells" (MWs), defined as producing >50,000 vg/cell, were identified for each oversized vector. These MWs provided stable vector production for >20 passages. The quality and potency of the AAVrh8R/FVIII-5.1 and AAVrh8R/FVIII-5.4 vectors generated by the PCL method were then compared to those prepared via transient transfection (TXN). Southern and dot blot analyses demonstrated that both production methods resulted in packaging of heterogeneously sized genomes. However, the PCL-derived rAAV vector preparations contained some genomes >4.7 kb, whereas the majority of genomes generated by the TXN method were ≤4.7 kb. The PCL process reduced packaging of non-vector DNA for both the AAVrh8R/FVIII-5.1 and the AAVrh8R/FVIII-5.4 kb vector preparations. Furthermore, more DNA-containing viral particles were obtained for the AAVrh8R/FVIII-5.1 vector. In a mouse model of hemophilia A, animals administered a PCL-derived rAAV vector exhibited twofold higher plasma FVIII activity and increased levels of vector genomes in the liver than mice treated with vector produced via TXN did. Hence, the quality of oversized vectors prepared using the PCL method is greater than that of vectors generated using the TXN process, and importantly this improvement translates to enhanced performance in vivo.

Intramuscular injection of AAV8 in mice and macaques is associated with substantial hepatic targeting and transgene expression.

PubMed

Greig, Jenny A; Peng, Hui; Ohlstein, Jason; Medina-Jaszek, C Angelica; Ahonkhai, Omua; Mentzinger, Anne; Grant, Rebecca L; Roy, Soumitra; Chen, Shu-Jen; Bell, Peter; Tretiakova, Anna P; Wilson, James M

2014-01-01

Intramuscular (IM) administration of adeno-associated viral (AAV) vectors has entered the early stages of clinical development with some success, including the first approved gene therapy product in the West called Glybera. In preparation for broader clinical development of IM AAV vector gene therapy, we conducted detailed pre-clinical studies in mice and macaques evaluating aspects of delivery that could affect performance. We found that following IM administration of AAV8 vectors in mice, a portion of the vector reached the liver and hepatic gene expression contributed significantly to total expression of secreted transgenes. The contribution from liver could be controlled by altering injection volume and by the use of traditional (promoter) and non-traditional (tissue-specific microRNA target sites) expression control elements. Hepatic distribution of vector following IM injection was also noted in rhesus macaques. These pre-clinical data on AAV delivery should inform safe and efficient development of future AAV products.

Approximate method of variational Bayesian matrix factorization/completion with sparse prior

NASA Astrophysics Data System (ADS)

Kawasumi, Ryota; Takeda, Koujin

2018-05-01

We derive the analytical expression of a matrix factorization/completion solution by the variational Bayes method, under the assumption that the observed matrix is originally the product of low-rank, dense and sparse matrices with additive noise. We assume the prior of a sparse matrix is a Laplace distribution by taking matrix sparsity into consideration. Then we use several approximations for the derivation of a matrix factorization/completion solution. By our solution, we also numerically evaluate the performance of a sparse matrix reconstruction in matrix factorization, and completion of a missing matrix element in matrix completion.

Model-based VQ for image data archival, retrieval and distribution

NASA Technical Reports Server (NTRS)

Manohar, Mareboyana; Tilton, James C.

1995-01-01

An ideal image compression technique for image data archival, retrieval and distribution would be one with the asymmetrical computational requirements of Vector Quantization (VQ), but without the complications arising from VQ codebooks. Codebook generation and maintenance are stumbling blocks which have limited the use of VQ as a practical image compression algorithm. Model-based VQ (MVQ), a variant of VQ described here, has the computational properties of VQ but does not require explicit codebooks. The codebooks are internally generated using mean removed error and Human Visual System (HVS) models. The error model assumed is the Laplacian distribution with mean, lambda-computed from a sample of the input image. A Laplacian distribution with mean, lambda, is generated with uniform random number generator. These random numbers are grouped into vectors. These vectors are further conditioned to make them perceptually meaningful by filtering the DCT coefficients from each vector. The DCT coefficients are filtered by multiplying by a weight matrix that is found to be optimal for human perception. The inverse DCT is performed to produce the conditioned vectors for the codebook. The only image dependent parameter used in the generation of codebook is the mean, lambda, that is included in the coded file to repeat the codebook generation process for decoding.

Increasing the computational efficient of digital cross correlation by a vectorization method

NASA Astrophysics Data System (ADS)

Chang, Ching-Yuan; Ma, Chien-Ching

2017-08-01

This study presents a vectorization method for use in MATLAB programming aimed at increasing the computational efficiency of digital cross correlation in sound and images, resulting in a speedup of 6.387 and 36.044 times compared with performance values obtained from looped expression. This work bridges the gap between matrix operations and loop iteration, preserving flexibility and efficiency in program testing. This paper uses numerical simulation to verify the speedup of the proposed vectorization method as well as experiments to measure the quantitative transient displacement response subjected to dynamic impact loading. The experiment involved the use of a high speed camera as well as a fiber optic system to measure the transient displacement in a cantilever beam under impact from a steel ball. Experimental measurement data obtained from the two methods are in excellent agreement in both the time and frequency domain, with discrepancies of only 0.68%. Numerical and experiment results demonstrate the efficacy of the proposed vectorization method with regard to computational speed in signal processing and high precision in the correlation algorithm. We also present the source code with which to build MATLAB-executable functions on Windows as well as Linux platforms, and provide a series of examples to demonstrate the application of the proposed vectorization method.

A quantitative structure-activity relationship to predict efficacy of granular activated carbon adsorption to control emerging contaminants.

PubMed

Kennicutt, A R; Morkowchuk, L; Krein, M; Breneman, C M; Kilduff, J E

2016-08-01

A quantitative structure-activity relationship was developed to predict the efficacy of carbon adsorption as a control technology for endocrine-disrupting compounds, pharmaceuticals, and components of personal care products, as a tool for water quality professionals to protect public health. Here, we expand previous work to investigate a broad spectrum of molecular descriptors including subdivided surface areas, adjacency and distance matrix descriptors, electrostatic partial charges, potential energy descriptors, conformation-dependent charge descriptors, and Transferable Atom Equivalent (TAE) descriptors that characterize the regional electronic properties of molecules. We compare the efficacy of linear (Partial Least Squares) and non-linear (Support Vector Machine) machine learning methods to describe a broad chemical space and produce a user-friendly model. We employ cross-validation, y-scrambling, and external validation for quality control. The recommended Support Vector Machine model trained on 95 compounds having 23 descriptors offered a good balance between good performance statistics, low error, and low probability of over-fitting while describing a wide range of chemical features. The cross-validated model using a log-uptake (qe) response calculated at an aqueous equilibrium concentration (Ce) of 1 μM described the training dataset with an r(2) of 0.932, had a cross-validated r(2) of 0.833, and an average residual of 0.14 log units.

A wideband FMBEM for 2D acoustic design sensitivity analysis based on direct differentiation method

NASA Astrophysics Data System (ADS)

Chen, Leilei; Zheng, Changjun; Chen, Haibo

2013-09-01

This paper presents a wideband fast multipole boundary element method (FMBEM) for two dimensional acoustic design sensitivity analysis based on the direct differentiation method. The wideband fast multipole method (FMM) formed by combining the original FMM and the diagonal form FMM is used to accelerate the matrix-vector products in the boundary element analysis. The Burton-Miller formulation is used to overcome the fictitious frequency problem when using a single Helmholtz boundary integral equation for exterior boundary-value problems. The strongly singular and hypersingular integrals in the sensitivity equations can be evaluated explicitly and directly by using the piecewise constant discretization. The iterative solver GMRES is applied to accelerate the solution of the linear system of equations. A set of optimal parameters for the wideband FMBEM design sensitivity analysis are obtained by observing the performances of the wideband FMM algorithm in terms of computing time and memory usage. Numerical examples are presented to demonstrate the efficiency and validity of the proposed algorithm.

Deploy Nalu/Kokkos algorithmic infrastructure with performance benchmarking.

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

Domino, Stefan P.; Ananthan, Shreyas; Knaus, Robert C.

The former Nalu interior heterogeneous algorithm design, which was originally designed to manage matrix assembly operations over all elemental topology types, has been modified to operate over homogeneous collections of mesh entities. This newly templated kernel design allows for removal of workset variable resize operations that were formerly required at each loop over a Sierra ToolKit (STK) bucket (nominally, 512 entities in size). Extensive usage of the Standard Template Library (STL) std::vector has been removed in favor of intrinsic Kokkos memory views. In this milestone effort, the transition to Kokkos as the underlying infrastructure to support performance and portability onmore » many-core architectures has been deployed for key matrix algorithmic kernels. A unit-test driven design effort has developed a homogeneous entity algorithm that employs a team-based thread parallelism construct. The STK Single Instruction Multiple Data (SIMD) infrastructure is used to interleave data for improved vectorization. The collective algorithm design, which allows for concurrent threading and SIMD management, has been deployed for the core low-Mach element- based algorithm. Several tests to ascertain SIMD performance on Intel KNL and Haswell architectures have been carried out. The performance test matrix includes evaluation of both low- and higher-order methods. The higher-order low-Mach methodology builds on polynomial promotion of the core low-order control volume nite element method (CVFEM). Performance testing of the Kokkos-view/SIMD design indicates low-order matrix assembly kernel speed-up ranging between two and four times depending on mesh loading and node count. Better speedups are observed for higher-order meshes (currently only P=2 has been tested) especially on KNL. The increased workload per element on higher-order meshes bene ts from the wide SIMD width on KNL machines. Combining multiple threads with SIMD on KNL achieves a 4.6x speedup over the baseline, with assembly timings faster than that observed on Haswell architecture. The computational workload of higher-order meshes, therefore, seems ideally suited for the many-core architecture and justi es further exploration of higher-order on NGP platforms. A Trilinos/Tpetra-based multi-threaded GMRES preconditioned by symmetric Gauss Seidel (SGS) represents the core solver infrastructure for the low-Mach advection/diffusion implicit solves. The threaded solver stack has been tested on small problems on NREL's Peregrine system using the newly developed and deployed Kokkos-view/SIMD kernels. fforts are underway to deploy the Tpetra-based solver stack on NERSC Cori system to benchmark its performance at scale on KNL machines.« less

Student Understanding of Cross Product Direction and Use of Right-hand Rules: An Exploration of Representation and Context-dependence

NASA Astrophysics Data System (ADS)

Kustusch, Mary Bridget

2011-12-01

Students in introductory physics struggle with vector algebra and with cross product direction in particular. Some have suggested that this may be due to misapplied right-hand rules, but there are few studies that have had the resolution to explore this. Additionally, previous research on student understanding has noted several kinds of representation-dependence of student performance with vector algebra in both physics and non-physics (or math) contexts (e.g. Hawkins et al., 2009; Van Deventer, 2008). Yet with few exceptions (e.g. Scaife and Heckler, 2010), these findings have not been applied to cross product direction questions or the use of right-hand rules. Also, the extensive work in spatial cognition is particularly applicable to cross product direction due to the spatial and kinesthetic nature of the right-hand rule. A synthesis of the literature from these various fields reveals four categories of problem features likely to impact the understanding of cross product direction: (1) the type of reasoning required, (2) the orientation of the vectors, (3) the need for parallel transport, and (4) the physics context and features (or lack thereof). These features formed the basis of the present effort to systematically explore the context-dependence and representation- dependence of student performance on cross product direction questions. This study used a mix of qualitative and quantitative techniques to analyze twenty-seven individual think-aloud interviews. During these interviews, second semester introductory physics students answered 80-100 cross product direction questions in different contexts and with varying problem features. These features were then used as the predictors in regression analyses for correctness and response time. In addition, each problem was coded for the methods used and the errors made to gain a deeper understanding of student behavior and the impact of these features. The results revealed a wide variety of methods (including six different right-hand rules), many different types of errors, and significant context-dependence and representation-dependence for the features mentioned above. Problems that required reasoning backward to find A⃗ (for C⃗=A⃗ xB⃗ ) presented the biggest challenge for students. Participants who recognized the non-commutativity of the cross product would often reverse the order ( B⃗xA⃗ ) on these problems. Also, this error occurred less frequently when a Guess and Check method was used in addition to the right-hand rule. Three different aspects of orientation had a significant impact on performance: (1) the physical discomfort of using a right-hand rule, (2) the plane of the given vectors, and to a lesser extent, (3) the angle between the vectors. One participant was more likely to switch the order of the vectors for the physically awkward orientations than for the physically easy orientations; and there was evidence that some of the difficulty with vector orientations that were not in the xy-plane was due to misinterpretations of the into and out of the page symbols. The impact of both physical discomfort and the plane of the vectors was reduced when participants rotated the paper. Unlike other problem features, the issue of parallel transport did not appear to be nearly as prevalent for cross product direction as it is for vector addition and subtraction. In addition to these findings, this study confirmed earlier findings regarding physics difficulties with magnetic field and magnetic force, such as differences in performance based on the representation of magnetic field (Scaife and Heckler, 2010) and confusion between electric and magnetic fields (Maloney et al., 2001). It also provided evidence of physics difficulties with magnetic field and magnetic force that have been suspected but never explored, specifically the impact of the sign of the charge and the observation location. This study demonstrated that student difficulty with cross product direction is not as simple as misapplied right-hand rules, although this is an issue. Student behavior on cross product direction questions is significantly dependent on both the context of the question and the representation of various problem features. Although more research is necessary, particularly in regard to individual differences, this study represents a significant step forward in our understanding of student difficulties with cross product direction.

A transition matrix approach to the Davenport gryo calibration scheme

NASA Technical Reports Server (NTRS)

Natanson, G. A.

1998-01-01

The in-flight gyro calibration scheme commonly used by NASA Goddard Space Flight Center (GSFC) attitude ground support teams closely follows an original version of the Davenport algorithm developed in the late seventies. Its basic idea is to minimize the least-squares differences between attitudes gyro- propagated over the course of a maneuver and those determined using post- maneuver sensor measurements. The paper represents the scheme in a recursive form by combining necessary partials into a rectangular matrix, which is propagated in exactly the same way as a Kalman filters square transition matrix. The nontrivial structure of the propagation matrix arises from the fact that attitude errors are not included in the state vector, and therefore their derivatives with respect to estimated a parameters do not appear in the transition matrix gyro defined in the conventional way. In cases when the required accuracy can be achieved by a single iteration, representation of the Davenport gyro calibration scheme in a recursive form allows one to discard each gyro measurement immediately after it was used to propagate the attitude and state transition matrix. Another advantage of the new approach is that it utilizes the same expression for the error sensitivity matrix as that used by the Kalman filter. As a result the suggested modification of the Davenport algorithm made it possible to reuse software modules implemented in the Kalman filter estimator, where both attitude errors and gyro calibration parameters are included in the state vector. The new approach has been implemented in the ground calibration utilities used to support the Tropical Rainfall Measuring Mission (TRMM). The paper analyzes some preliminary results of gyro calibration performed by the TRMM ground attitude support team. It is demonstrated that an effect of the second iteration on estimated values of calibration parameters is negligibly small, and therefore there is no need to store processed gyro data. This opens a promising opportunity for onboard implementation of the suggested recursive procedure by combining, it with the Kalman filter used to obtain necessary attitude solutions at the beginning and end of each maneuver.

The epoch state navigation filter. [for maximum likelihood estimates of position and velocity vectors

NASA Technical Reports Server (NTRS)

Battin, R. H.; Croopnick, S. R.; Edwards, J. A.

1977-01-01

The formulation of a recursive maximum likelihood navigation system employing reference position and velocity vectors as state variables is presented. Convenient forms of the required variational equations of motion are developed together with an explicit form of the associated state transition matrix needed to refer measurement data from the measurement time to the epoch time. Computational advantages accrue from this design in that the usual forward extrapolation of the covariance matrix of estimation errors can be avoided without incurring unacceptable system errors. Simulation data for earth orbiting satellites are provided to substantiate this assertion.

Multispectral decomposition for the removal of out-of-band effects of visible/infrared imaging radiometer suite visible and near-infrared bands.

PubMed

Gao, Bo-Cai; Chen, Wei

2012-06-20

The visible/infrared imaging radiometer suite (VIIRS) is now onboard the first satellite platform managed by the Joint Polar Satellite System of the National Oceanic and Atmospheric Administration and NASA. It collects scientific data from an altitude of approximately 830 km in 22 narrow bands located in the 0.4-12.5 μm range. The seven visible and near-infrared (VisNIR) bands in the wavelength interval between 0.4-0.9 μm are known to suffer from the out-of-band (OOB) responses--a small amount of radiances far away from the center of a given band that can pass through the filter and reach detectors in the focal plane. A proper treatment of the OOB effects is necessary in order to obtain calibrated at-sensor radiance data [referred to as the Sensor Data Records (SDRs)] from measurements with these bands and subsequently to derive higher-level data products [referred to as the Environmental Data Records (EDRs)]. We have recently developed a new technique, called multispectral decomposition transform (MDT), which can be used to correct/remove the OOB effects of VIIRS VisNIR bands and to recover the true narrow band radiances from the measured radiances containing OOB effects. An MDT matrix is derived from the laboratory-measured filter transmittance functions. The recovery of the narrow band signals is performed through a matrix multiplication--the production between the MDT matrix and a multispectral vector. Hyperspectral imaging data measured from high altitude aircraft and satellite platforms, the complete VIIRS filter functions, and the truncated VIIRS filter functions to narrower spectral intervals, are used to simulate the VIIRS data with and without OOB effects. Our experimental results using the proposed MDT method have demonstrated that the average errors after decomposition are reduced by more than one order of magnitude.

A fast indirect method to compute functions of genomic relationships concerning genotyped and ungenotyped individuals, for diversity management.

PubMed

Colleau, Jean-Jacques; Palhière, Isabelle; Rodríguez-Ramilo, Silvia T; Legarra, Andres

2017-12-01

Pedigree-based management of genetic diversity in populations, e.g., using optimal contributions, involves computation of the [Formula: see text] type yielding elements (relationships) or functions (usually averages) of relationship matrices. For pedigree-based relationships [Formula: see text], a very efficient method exists. When all the individuals of interest are genotyped, genomic management can be addressed using the genomic relationship matrix [Formula: see text]; however, to date, the computational problem of efficiently computing [Formula: see text] has not been well studied. When some individuals of interest are not genotyped, genomic management should consider the relationship matrix [Formula: see text] that combines genotyped and ungenotyped individuals; however, direct computation of [Formula: see text] is computationally very demanding, because construction of a possibly huge matrix is required. Our work presents efficient ways of computing [Formula: see text] and [Formula: see text], with applications on real data from dairy sheep and dairy goat breeding schemes. For genomic relationships, an efficient indirect computation with quadratic instead of cubic cost is [Formula: see text], where Z is a matrix relating animals to genotypes. For the relationship matrix [Formula: see text], we propose an indirect method based on the difference between vectors [Formula: see text], which involves computation of [Formula: see text] and of products such as [Formula: see text] and [Formula: see text], where [Formula: see text] is a working vector derived from [Formula: see text]. The latter computation is the most demanding but can be done using sparse Cholesky decompositions of matrix [Formula: see text], which allows handling very large genomic and pedigree data files. Studies based on simulations reported in the literature show that the trends of average relationships in [Formula: see text] and [Formula: see text] differ as genomic selection proceeds. When selection is based on genomic relationships but management is based on pedigree data, the true genetic diversity is overestimated. However, our tests on real data from sheep and goat obtained before genomic selection started do not show this. We present efficient methods to compute elements and statistics of the genomic relationships [Formula: see text] and of matrix [Formula: see text] that combines ungenotyped and genotyped individuals. These methods should be useful to monitor and handle genomic diversity.

Computational Performance of Intel MIC, Sandy Bridge, and GPU Architectures: Implementation of a 1D c++/OpenMP Electrostatic Particle-In-Cell Code

DTIC Science & Technology

2014-05-01

fusion, space and astrophysical plasmas, but still the general picture can be presented quite well with the fluid approach [6, 7]. The microscopic...purpose computing CPU for algorithms where processing of large blocks of data is done in parallel. The reason for that is the GPU’s highly effective...parallel structure. Most of the image and video processing computations involve heavy matrix and vector op- erations over large amounts of data and

Progress on adenovirus-vectored universal influenza vaccines.

PubMed

Xiang, Kui; Ying, Guan; Yan, Zhou; Shanshan, Yan; Lei, Zhang; Hongjun, Li; Maosheng, Sun

2015-01-01

Influenza virus (IFV) infection causes serious health problems and heavy financial burdens each year worldwide. The classical inactivated influenza virus vaccine (IIVV) and live attenuated influenza vaccine (LAIV) must be updated regularly to match the new strains that evolve due to antigenic drift and antigenic shift. However, with the discovery of broadly neutralizing antibodies that recognize conserved antigens, and the CD8(+) T cell responses targeting viral internal proteins nucleoprotein (NP), matrix protein 1 (M1) and polymerase basic 1 (PB1), it is possible to develop a universal influenza vaccine based on the conserved hemagglutinin (HA) stem, NP, and matrix proteins. Recombinant adenovirus (rAd) is an ideal influenza vaccine vector because it has an ideal stability and safety profile, induces balanced humoral and cell-mediated immune responses due to activation of innate immunity, provides 'self-adjuvanting' activity, can mimic natural IFV infection, and confers seamless protection against mucosal pathogens. Moreover, this vector can be developed as a low-cost, rapid-response vaccine that can be quickly manufactured. Therefore, an adenovirus vector encoding conserved influenza antigens holds promise in the development of a universal influenza vaccine. This review will summarize the progress in adenovirus-vectored universal flu vaccines and discuss future novel approaches.

A Vector Representation for Thermodynamic Relationships

ERIC Educational Resources Information Center

Pogliani, Lionello

2006-01-01

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

A vector based on the SV40 origin of replication and chromosomal S/MARs replicates episomally in CHO cells.

PubMed Central

Piechaczek, C; Fetzer, C; Baiker, A; Bode, J; Lipps, H J

1999-01-01

We have developed an episomal replicating expression vector in which the SV40 gene coding for the large T-antigen was replaced by chromosomal scaffold/matrix attached regions. Southern analysis as well as vector rescue experiments in CHO cells and in Escherichia coli demonstrate that the vector replicates episomally in CHO cells. It occurs in a very low copy number in the cells and is stably maintained over more than 100 generations without selection pressure. PMID:9862961

Viscoelastic material inversion using Sierra-SD and ROL

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

Walsh, Timothy; Aquino, Wilkins; Ridzal, Denis

2014-11-01

In this report we derive frequency-domain methods for inverse characterization of the constitutive parameters of viscoelastic materials. The inverse problem is cast in a PDE-constrained optimization framework with efficient computation of gradients and Hessian vector products through matrix free operations. The abstract optimization operators for first and second derivatives are derived from first principles. Various methods from the Rapid Optimization Library (ROL) are tested on the viscoelastic inversion problem. The methods described herein are applied to compute the viscoelastic bulk and shear moduli of a foam block model, which was recently used in experimental testing for viscoelastic property characterization.

Two-Dimensional DOA and Polarization Estimation for a Mixture of Uncorrelated and Coherent Sources with Sparsely-Distributed Vector Sensor Array

PubMed Central

Si, Weijian; Zhao, Pinjiao; Qu, Zhiyu

2016-01-01

This paper presents an L-shaped sparsely-distributed vector sensor (SD-VS) array with four different antenna compositions. With the proposed SD-VS array, a novel two-dimensional (2-D) direction of arrival (DOA) and polarization estimation method is proposed to handle the scenario where uncorrelated and coherent sources coexist. The uncorrelated and coherent sources are separated based on the moduli of the eigenvalues. For the uncorrelated sources, coarse estimates are acquired by extracting the DOA information embedded in the steering vectors from estimated array response matrix of the uncorrelated sources, and they serve as coarse references to disambiguate fine estimates with cyclical ambiguity obtained from the spatial phase factors. For the coherent sources, four Hankel matrices are constructed, with which the coherent sources are resolved in a similar way as for the uncorrelated sources. The proposed SD-VS array requires only two collocated antennas for each vector sensor, thus the mutual coupling effects across the collocated antennas are reduced greatly. Moreover, the inter-sensor spacings are allowed beyond a half-wavelength, which results in an extended array aperture. Simulation results demonstrate the effectiveness and favorable performance of the proposed method. PMID:27258271

Fixed weight Hopfield Neural Network based on optical implementation of all-optical MZI-XNOR logic gate

NASA Astrophysics Data System (ADS)

Nugamesh Mutter, Kussay; Mat Jafri, Mohd Zubir; Abdul Aziz, Azlan

2010-05-01

Many researches are conducted to improve Hopfield Neural Network (HNN) performance especially for speed and memory capacity in different approaches. However, there is still a significant scope of developing HNN using Optical Logic Gates. We propose here a new model of HNN based on all-optical XNOR logic gates for real time color image recognition. Firstly, we improved HNN toward optimum learning and converging operations. We considered each unipolar image as a set of small blocks of 3-pixels as vectors for HNN. This enables to save large number of images in the net with best reaching into global minima, and because there are only eight fixed states of weights so that only single iteration performed to construct a vector with stable state at minimum energy. HNN is useless in dealing with data not in bipolar representation. Therefore, HNN failed to work with color images. In RGB bands each represents different values of brightness, for d-bit RGB image it is simply consists of d-layers of unipolar. Each layer is as a single unipolar image for HNN. In addition, the weight matrices with stability of unity at the diagonal perform clear converging in comparison with no self-connecting architecture. Synchronously, each matrix-matrix multiplication operation would run optically in the second part, since we propose an array of all-optical XOR gates, which uses Mach-Zehnder Interferometer (MZI) for neurons setup and a controlling system to distribute timely signals with inverting to achieve XNOR function. The primary operation and simulation of the proposal HNN is demonstrated.

A high-accuracy optical linear algebra processor for finite element applications

NASA Technical Reports Server (NTRS)

Casasent, D.; Taylor, B. K.

1984-01-01

Optical linear processors are computationally efficient computers for solving matrix-matrix and matrix-vector oriented problems. Optical system errors limit their dynamic range to 30-40 dB, which limits their accuray to 9-12 bits. Large problems, such as the finite element problem in structural mechanics (with tens or hundreds of thousands of variables) which can exploit the speed of optical processors, require the 32 bit accuracy obtainable from digital machines. To obtain this required 32 bit accuracy with an optical processor, the data can be digitally encoded, thereby reducing the dynamic range requirements of the optical system (i.e., decreasing the effect of optical errors on the data) while providing increased accuracy. This report describes a new digitally encoded optical linear algebra processor architecture for solving finite element and banded matrix-vector problems. A linear static plate bending case study is described which quantities the processor requirements. Multiplication by digital convolution is explained, and the digitally encoded optical processor architecture is advanced.

DNA melting profiles from a matrix method.

PubMed

Poland, Douglas

2004-02-05

In this article we give a new method for the calculation of DNA melting profiles. Based on the matrix formulation of the DNA partition function, the method relies for its efficiency on the fact that the required matrices are very sparse, essentially reducing matrix multiplication to vector multiplication and thus making the computer time required to treat a DNA molecule containing N base pairs proportional to N(2). A key ingredient in the method is the result that multiplication by the inverse matrix can also be reduced to vector multiplication. The task of calculating the melting profile for the entire genome is further reduced by treating regions of the molecule between helix-plateaus, thus breaking the molecule up into independent parts that can each be treated individually. The method is easily modified to incorporate changes in the assignment of statistical weights to the different structural features of DNA. We illustrate the method using the genome of Haemophilus influenzae. Copyright 2003 Wiley Periodicals, Inc.

A fast time-difference inverse solver for 3D EIT with application to lung imaging.

PubMed

Javaherian, Ashkan; Soleimani, Manuchehr; Moeller, Knut

2016-08-01

A class of sparse optimization techniques that require solely matrix-vector products, rather than an explicit access to the forward matrix and its transpose, has been paid much attention in the recent decade for dealing with large-scale inverse problems. This study tailors application of the so-called Gradient Projection for Sparse Reconstruction (GPSR) to large-scale time-difference three-dimensional electrical impedance tomography (3D EIT). 3D EIT typically suffers from the need for a large number of voxels to cover the whole domain, so its application to real-time imaging, for example monitoring of lung function, remains scarce since the large number of degrees of freedom of the problem extremely increases storage space and reconstruction time. This study shows the great potential of the GPSR for large-size time-difference 3D EIT. Further studies are needed to improve its accuracy for imaging small-size anomalies.

The Design of Case Products’ Shape Form Information Database Based on NURBS Surface

NASA Astrophysics Data System (ADS)

Liu, Xing; Liu, Guo-zhong; Xu, Nuo-qi; Zhang, Wei-she

2017-07-01

In order to improve the computer design of product shape design,applying the Non-uniform Rational B-splines(NURBS) of curves and surfaces surface to the representation of the product shape helps designers to design the product effectively.On the basis of the typical product image contour extraction and using Pro/Engineer(Pro/E) to extract the geometric feature of scanning mold,in order to structure the information data base system of value point,control point and node vector parameter information,this paper put forward a unified expression method of using NURBS curves and surfaces to describe products’ geometric shape and using matrix laboratory(MATLAB) to simulate when products have the same or similar function.A case study of electric vehicle’s front cover illustrates the access process of geometric shape information of case product in this paper.This method can not only greatly reduce the capacity of information debate,but also improve the effectiveness of computer aided geometric innovation modeling.

Analyzing Kernel Matrices for the Identification of Differentially Expressed Genes

PubMed Central

Xia, Xiao-Lei; Xing, Huanlai; Liu, Xueqin

2013-01-01

One of the most important applications of microarray data is the class prediction of biological samples. For this purpose, statistical tests have often been applied to identify the differentially expressed genes (DEGs), followed by the employment of the state-of-the-art learning machines including the Support Vector Machines (SVM) in particular. The SVM is a typical sample-based classifier whose performance comes down to how discriminant samples are. However, DEGs identified by statistical tests are not guaranteed to result in a training dataset composed of discriminant samples. To tackle this problem, a novel gene ranking method namely the Kernel Matrix Gene Selection (KMGS) is proposed. The rationale of the method, which roots in the fundamental ideas of the SVM algorithm, is described. The notion of ''the separability of a sample'' which is estimated by performing -like statistics on each column of the kernel matrix, is first introduced. The separability of a classification problem is then measured, from which the significance of a specific gene is deduced. Also described is a method of Kernel Matrix Sequential Forward Selection (KMSFS) which shares the KMGS method's essential ideas but proceeds in a greedy manner. On three public microarray datasets, our proposed algorithms achieved noticeably competitive performance in terms of the B.632+ error rate. PMID:24349110

Balancing Cell Migration with Matrix Degradation Enhances Gene Delivery to Cells Cultured Three-Dimensionally Within Hydrogels

PubMed Central

Shepard, Jaclyn A.; Huang, Alyssa; Shikanova, Ariella; Shea, Lonnie D.

2010-01-01

In regenerative medicine, hydrogels are employed to fill defects and support the infiltration of cells that can ultimately regenerate tissue. Gene delivery within hydrogels targeting infiltrating cells has the potential to promote tissue formation, but the delivery efficiency of nonviral vectors within hydrogels is low hindering their applicability in tissue regeneration. To improve their functionality, we have conducted a mechanistic study to investigate the contribution of cell migration and matrix degradation on gene delivery. In this report, lipoplexes were entrapped within hydrogels based on poly(ethylene glycol) (PEG) crosslinked with peptides containing matrix metalloproteinase degradable sequences. The mesh size of these hydrogels is substantially less than the size of the entrapped lipoplexes, which can function to retain vectors. Cell migration and transfection were simultaneously measured within hydrogels with varying density of cell adhesion sites (Arg-Gly-Asp peptides) and solids content. Increasing RGD density increased expression levels up to 100-fold, while greater solids content sustained expression levels for 16 days. Increasing RGD density and decreasing solids content increased cell migration, which indicates expression levels increase with increased cell migration. Initially exposing cells to vector resulted in transient expression that declined after 2 days, verifying the requirement of migration to sustain expression. Transfected cells were predominantly located within the population of migrating cells for hydrogels that supported cell migration. Although the small mesh size retained at least 70% of the lipoplexes in the absence of cells after 32 days, the presence of cells decreased retention to 10% after 16 days. These results indicate that vectors retained within hydrogels contact migrating cells, and that persistent cell migration can maintain elevated expression levels. Thus matrix degradation and cell migration are fundamental design parameters for maximizing gene delivery from hydrogels. PMID:20450944

Chimeric cellulase matrix for investigating intramolecular synergism between non-hydrolytic disruptive functions of carbohydrate-binding modules and catalytic hydrolysis.

PubMed

Wang, Yuguo; Tang, Rentao; Tao, Jin; Wang, Xiaonan; Zheng, Baisong; Feng, Yan

2012-08-24

The conversion of renewable cellulosic biomass is of considerable interest for the production of biofuels and materials. The bottleneck in the efficient conversion is the compactness and resistance of crystalline cellulose. Carbohydrate-binding modules (CBMs), which disrupt crystalline cellulose via non-hydrolytic mechanisms, are expected to overcome this bottleneck. However, the lack of convenient methods for quantitative analysis of the disruptive functions of CBMs have hindered systematic studies and molecular modifications. Here we established a practical and systematic platform for quantifying and comparing the non-hydrolytic disruptive activities of CBMs via the synergism of CBMs and a catalytic module within designed chimeric cellulase molecules. Bioinformatics and computational biology were also used to provide a deeper understanding. A convenient vector was constructed to serve as a cellulase matrix into which heterologous CBM sequences can be easily inserted. The resulting chimeric cellulases were suitable for studying disruptive functions, and their activities quantitatively reflected the disruptive functions of CBMs on crystalline cellulose. In addition, this cellulase matrix can be used to construct novel chimeric cellulases with high hydrolytic activities toward crystalline cellulose.

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

NASA Astrophysics Data System (ADS)

Liu, Zhao; Bhatt, R. N.

2015-09-01

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

Combined group ECC protection and subgroup parity protection

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

Gara, Alan; Cheng, Dong; Heidelberger, Philip

A method and system are disclosed for providing combined error code protection and subgroup parity protection for a given group of n bits. The method comprises the steps of identifying a number, m, of redundant bits for said error protection; and constructing a matrix P, wherein multiplying said given group of n bits with P produces m redundant error correction code (ECC) protection bits, and two columns of P provide parity protection for subgroups of said given group of n bits. In the preferred embodiment of the invention, the matrix P is constructed by generating permutations of m bit widemore » vectors with three or more, but an odd number of, elements with value one and the other elements with value zero; and assigning said vectors to rows of the matrix P.« less

Radiance and polarization of multiple scattered light from haze and clouds.

PubMed

Kattawar, G W; Plass, G N

1968-08-01

The radiance and polarization of multiple scattered light is calculated from the Stokes' vectors by a Monte Carlo method. The exact scattering matrix for a typical haze and for a cloud whose spherical drops have an average radius of 12 mu is calculated from the Mie theory. The Stokes' vector is transformed in a collision by this scattering matrix and the rotation matrix. The two angles that define the photon direction after scattering are chosen by a random process that correctly simulates the actual distribution functions for both angles. The Monte Carlo results for Rayleigh scattering compare favorably with well known tabulated results. Curves are given of the reflected and transmitted radiances and polarizations for both the haze and cloud models and for several solar angles, optical thicknesses, and surface albedos. The dependence on these various parameters is discussed.

Search for vector-like quark production in the lepton+jets and dilepton+jets final states using 5.4 fb -1 of Run II data

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

Caughron, Seth

2011-01-01

The Standard Model of particle physics provides an excellent description of particle interactions at energies up to ~1 TeV, but it is expected to fail above that scale. Multiple models developed to describe phenomena above the TeV scale predict the existence of very massive, vector-like quarks. A search for single electroweak production of such particles in pmore » $$\\bar{p}$$ collisions at a center-of-mass energy of 1.96 TeV is performed in the W+jets and Z+jets channels. The data were collected by the DØ detector at the Fermilab Tevatron Collider and correspond to an integrated luminosity of 5.4 fb -1. Events consistent with a heavy object decaying to a vector boson and a jet are selected. We observe no significant excess in comparison to the background prediction and set 95% confidence level upper limits on production cross sections for vector-like quarks decaying to W+jet and Z+jet. Assuming a vector-like quark -- standard model quark coupling parameter $$\\tilde{κ}$$ qQ of unity, we exclude vector-like quarks with mass below 693 GeV for decays to W+jet and mass below 449 GeV for decays to Z+jet. These represent the most sensitive limits to date.« less

Diffraction of seismic waves from 3-D canyons and alluvial basins modeled using the Fast Multipole-accelerated BEM

NASA Astrophysics Data System (ADS)

Chaillat, S.; Bonnet, M.; Semblat, J.

2007-12-01

Seismic wave propagation and amplification in complex media is a major issue in the field of seismology. To compute seismic wave propagation in complex geological structures such as in alluvial basins, various numerical methods have been proposed. The main advantage of the Boundary Element Method (BEM) is that only the domain boundaries (and possibly interfaces) are discretized, leading to a reduction of the number of degrees of freedom. The main drawback of the standard BEM is that the governing matrix is full and non- symmetric, which gives rise to high computational and memory costs. In other areas where the BEM is used (electromagnetism, acoustics), considerable speedup of solution time and decrease of memory requirements have been achieved through the development, over the last decade, of the Fast Multipole Method (FMM). The goal of the FMM is to speed up the matrix-vector product computation needed at each iteration of the GMRES iterative solver. Moreover, the governing matrix is never explicitly formed, which leads to a storage requirement well below the memory necessary for holding the complete matrix. The FMM-accelerated BEM therefore achieves substantial savings in both CPU time and memory. In this work, the FMM is extended to the 3-D frequency-domain elastodynamics and applied to the computation of seismic wave propagation in 3-D. The efficiency of the present FMM-BEM is demonstrated on seismology- oriented examples. First, the diffraction of a plane wave or a point source by a 3-D canyon is studied. The influence of the size of the meshed part of the free surface is studied, and computations are performed for non- dimensional frequencies higher than those considered in other studies (thanks to the use of the FM-BEM), with which comparisons are made whenever possible. The method is also applied to analyze the diffraction of a plane wave or a point source by a 3-D alluvial basin. A parametrical study is performed on the effect of the shape of the basin and the interaction of the wavefield with the basin edges is analyzed.

Using Redundancy To Reduce Errors in Magnetometer Readings

NASA Technical Reports Server (NTRS)

Kulikov, Igor; Zak, Michail

2004-01-01

A method of reducing errors in noisy magnetic-field measurements involves exploitation of redundancy in the readings of multiple magnetometers in a cluster. By "redundancy"is meant that the readings are not entirely independent of each other because the relationships among the magnetic-field components that one seeks to measure are governed by the fundamental laws of electromagnetism as expressed by Maxwell's equations. Assuming that the magnetometers are located outside a magnetic material, that the magnetic field is steady or quasi-steady, and that there are no electric currents flowing in or near the magnetometers, the applicable Maxwell 's equations are delta x B = 0 and delta(raised dot) B = 0, where B is the magnetic-flux-density vector. By suitable algebraic manipulation, these equations can be shown to impose three independent constraints on the values of the components of B at the various magnetometer positions. In general, the problem of reducing the errors in noisy measurements is one of finding a set of corrected values that minimize an error function. In the present method, the error function is formulated as (1) the sum of squares of the differences between the corrected and noisy measurement values plus (2) a sum of three terms, each comprising the product of a Lagrange multiplier and one of the three constraints. The partial derivatives of the error function with respect to the corrected magnetic-field component values and the Lagrange multipliers are set equal to zero, leading to a set of equations that can be put into matrix.vector form. The matrix can be inverted to solve for a vector that comprises the corrected magnetic-field component values and the Lagrange multipliers.

The fourfold way of the genetic code.

PubMed

Jiménez-Montaño, Miguel Angel

2009-11-01

We describe a compact representation of the genetic code that factorizes the table in quartets. It represents a "least grammar" for the genetic language. It is justified by the Klein-4 group structure of RNA bases and codon doublets. The matrix of the outer product between the column-vector of bases and the corresponding row-vector V(T)=(C G U A), considered as signal vectors, has a block structure consisting of the four cosets of the KxK group of base transformations acting on doublet AA. This matrix, translated into weak/strong (W/S) and purine/pyrimidine (R/Y) nucleotide classes, leads to a code table with mixed and unmixed families in separate regions. A basic difference between them is the non-commuting (R/Y) doublets: AC/CA, GU/UG. We describe the degeneracy in the canonical code and the systematic changes in deviant codes in terms of the divisors of 24, employing modulo multiplication groups. We illustrate binary sub-codes characterizing mutations in the quartets. We introduce a decision-tree to predict the mode of tRNA recognition corresponding to each codon, and compare our result with related findings by Jestin and Soulé [Jestin, J.-L., Soulé, C., 2007. Symmetries by base substitutions in the genetic code predict 2' or 3' aminoacylation of tRNAs. J. Theor. Biol. 247, 391-394], and the rearrangements of the table by Delarue [Delarue, M., 2007. An asymmetric underlying rule in the assignment of codons: possible clue to a quick early evolution of the genetic code via successive binary choices. RNA 13, 161-169] and Rodin and Rodin [Rodin, S.N., Rodin, A.S., 2008. On the origin of the genetic code: signatures of its primordial complementarity in tRNAs and aminoacyl-tRNA synthetases. Heredity 100, 341-355], respectively.

Strategies to overcome oxygen transfer limitations during hairy root cultivation of Azadiracta indica for enhanced azadirachtin production.

PubMed

Srivastava, Smita; Srivastava, Ashok Kumar

2012-07-01

The vast untapped potential of hairy root cultures as a stable source of biologically active chemicals has focused the attention of scientific community toward its commercial exploitation. However, the major bottleneck remains its successful scale-up. Due to branching, the roots form an interlocked matrix that exhibits resistance to oxygen transfer. Thus, present work was undertaken to develop cultivation strategies like optimization of inlet gas composition (in terms of % (v/v) O(2) in air), air-flow rate and addition of oxygen vectors in the medium, to curb the oxygen transfer limitations during hairy root cultivation of Azadirachta indica for in vitro azadirachtin (a biopesticide) production. It was found that increasing the oxygen fraction in the inlet air (in the range, 20-100% (v/v) O(2) in air) increased the azadirachtin productivity by approximately threefold, to a maximum of 4.42 mg/L per day (at 100% (v/v) O(2) in air) with respect to 1.68 mg/L per day in control (air with no oxygen supplementation). Similarly, increasing the air-flow rate (in the range, 0.3-2 vvm) also increased the azadirachtin productivity to a maximum of 1.84 mg/L per day at 0.8 vvm of air-flow rate. On the contrary, addition of oxygen vectors (in the range, 1-4% (v/v); hydrogen peroxide, toluene, Tween 80, kerosene, silicone oil, and n-hexadecane), decreased the azadirachtin productivity with respect to control (1.76 mg/L per day).

Advanced Composites: Mechanical Properties and Hardware Programs for Selected Resin Matrix Materials. [considering space shuttle applications

NASA Technical Reports Server (NTRS)

Welhart, E. K.

1976-01-01

This design note presents typical mechanical properties tabulated from industrial and governmental agencies' test programs. All data are correlated to specific products and all of the best known products are presented. The data include six epoxies, eight polyimides and one polyquinoxaline matrix material. Bron and graphite are the fiber reinforcements. Included are forty-two summaries of advanced (resin matrix) composite programs in existence in the United States. It is concluded that the selection of appropriate matrices, the geometric manner in which the fibers are incorporated in the matrix and the durability of the bond between fiber and matrix establish the end properties of the composite material and the performance of the fabricated structure.

An indirect approach to the extensive calculation of relationship coefficients

PubMed Central

Colleau, Jean-Jacques

2002-01-01

A method was described for calculating population statistics on relationship coefficients without using corresponding individual data. It relied on the structure of the inverse of the numerator relationship matrix between individuals under investigation and ancestors. Computation times were observed on simulated populations and were compared to those incurred with a conventional direct approach. The indirect approach turned out to be very efficient for multiplying the relationship matrix corresponding to planned matings (full design) by any vector. Efficiency was generally still good or very good for calculating statistics on these simulated populations. An extreme implementation of the method is the calculation of inbreeding coefficients themselves. Relative performances of the indirect method were good except when many full-sibs during many generations existed in the population. PMID:12270102

FPGA implementation of sparse matrix algorithm for information retrieval

NASA Astrophysics Data System (ADS)

Bojanic, Slobodan; Jevtic, Ruzica; Nieto-Taladriz, Octavio

2005-06-01

Information text data retrieval requires a tremendous amount of processing time because of the size of the data and the complexity of information retrieval algorithms. In this paper the solution to this problem is proposed via hardware supported information retrieval algorithms. Reconfigurable computing may adopt frequent hardware modifications through its tailorable hardware and exploits parallelism for a given application through reconfigurable and flexible hardware units. The degree of the parallelism can be tuned for data. In this work we implemented standard BLAS (basic linear algebra subprogram) sparse matrix algorithm named Compressed Sparse Row (CSR) that is showed to be more efficient in terms of storage space requirement and query-processing timing over the other sparse matrix algorithms for information retrieval application. Although inverted index algorithm is treated as the de facto standard for information retrieval for years, an alternative approach to store the index of text collection in a sparse matrix structure gains more attention. This approach performs query processing using sparse matrix-vector multiplication and due to parallelization achieves a substantial efficiency over the sequential inverted index. The parallel implementations of information retrieval kernel are presented in this work targeting the Virtex II Field Programmable Gate Arrays (FPGAs) board from Xilinx. A recent development in scientific applications is the use of FPGA to achieve high performance results. Computational results are compared to implementations on other platforms. The design achieves a high level of parallelism for the overall function while retaining highly optimised hardware within processing unit.

The promotion of cartilage defect repair using adenovirus mediated Sox9 gene transfer of rabbit bone marrow mesenchymal stem cells.

PubMed

Cao, Lei; Yang, Fei; Liu, Guangwang; Yu, Degang; Li, Huiwu; Fan, Qiming; Gan, Yaokai; Tang, Tingting; Dai, Kerong

2011-06-01

Although Sox9 is essential for chondrogenic differentiation and matrix production, its application in cartilage tissue engineering has been rarely reported. In this study, the chondrogenic effect of Sox9 on bone marrow mesenchymal stem cells (BMSCs) in vitro and its application in articular cartilage repair in vivo were evaluated. Rabbit BMSCs were transduced with adenoviral vector containing Sox9. Toluidine blue, safranin O staining and real-time PCR were performed to check chondrogenic differentiation. The results showed that Sox9 could induce chondrogenesis of BMSCs both in monolayer and on PGA scaffold effectively. The rabbit model with full-thickness cartilage defects was established and then repaired by PGA scaffold and rabbit BMSCs with or without Sox9 transduction. HE, safranin O staining and immunohistochemistry were used to assess the repair of defects by the complex. Better repair, including more newly-formed cartilage tissue and hyaline cartilage-specific extracellular matrix and greater expression of several chondrogenesis marker genes were observed in PGA scaffold and BMSCs with Sox9 transduction, compared to that without transduction. Our findings defined the important role of Sox9 in the repair of cartilage defects in vivo and provided evidence that Sox9 had the potential and advantage in the application of tissue engineering. Copyright © 2011 Elsevier Ltd. All rights reserved.

Frozen orbit realization using LQR analogy

NASA Astrophysics Data System (ADS)

Nagarajan, N.; Rayan, H. Reno

In the case of remote sensing orbits, the Frozen Orbit concept minimizes altitude variations over a given region using passive means. This is achieved by establishing the mean eccentricity vector at the orbital poles i.e., by fixing the mean argument of perigee at 90 deg with an appropriate eccentricity to balance the perturbations due to zonal harmonics J2 and J3 of the Earth's potential. Eccentricity vector is a vector whose magnitude is the eccentricity and direction is the argument of perigee. The launcher dispersions result in an eccentricity vector which is away from the frozen orbit values. The objective is then to formulate an orbit maneuver strategy to optimize the fuel required to achieve the frozen orbit in the presence of visibility and impulse constraints. It is shown that the motion of the eccentricity vector around the frozen perigee can be approximated as a circle. Combining the circular motion of the eccentricity vector around the frozen point and the maneuver equation, the following discrete equation is obtained. X(k+1) = AX(k) + Bu(k), where X is the state (i.e. eccentricity vector components), A the state transition matrix, u the scalar control force (i.e. dV in this case) and B the control matrix which transforms dV into eccentricity vector change. Based on this, it is shown that the problem of optimizing the fuel can be treated as a Linear Quadratic Regulator (LQR) problem in which the maneuver can be solved by using control system design tools like MATLAB by deriving an analogy LQR design.

Metal matrix composite fabrication processes for high performance aerospace structures

NASA Astrophysics Data System (ADS)

Ponzi, C.

A survey is conducted of extant methods of metal matrix composite (MMC) production in order to serve as a basis for prospective MMC users' selection of a matrix/reinforcement combination, cost-effective primary fabrication methods, and secondary fabrication techniques for the achievement of desired performance levels. Attention is given to the illustrative cases of structural fittings, control-surface connecting rods, hypersonic aircraft air inlet ramps, helicopter swash plates, and turbine rotor disks. Methods for technical and cost analysis modeling useful in process optimization are noted.

Silent Aircraft Initiative Concept Risk Assessment

NASA Technical Reports Server (NTRS)

Nickol, Craig L.

2008-01-01

A risk assessment of the Silent Aircraft Initiative's SAX-40 concept design for extremely low noise has been performed. A NASA team developed a list of 27 risk items, and evaluated the level of risk for each item in terms of the likelihood that the risk would occur and the consequences of the occurrence. The following risk items were identified as high risk, meaning that the combination of likelihood and consequence put them into the top one-fourth of the risk matrix: structures and weight prediction; boundary-layer ingestion (BLI) and inlet design; variable-area exhaust and thrust vectoring; displaced-threshold and continuous descent approach (CDA) operational concepts; cost; human factors; and overall noise performance. Several advanced-technology baseline concepts were created to serve as a basis for comparison to the SAX-40 concept. These comparisons indicate that the SAX-40 would have significantly greater research, development, test, and engineering (RDT&E) and production costs than a conventional aircraft with similar technology levels. Therefore, the cost of obtaining the extremely low noise capability that has been estimated for the SAX-40 is significant. The SAX-40 concept design proved successful in focusing attention toward low noise technologies and in raising public awareness of the issue.

Supervised neural network classification of pre-sliced cooked pork ham images using quaternionic singular values.

PubMed

Valous, Nektarios A; Mendoza, Fernando; Sun, Da-Wen; Allen, Paul

2010-03-01

The quaternionic singular value decomposition is a technique to decompose a quaternion matrix (representation of a colour image) into quaternion singular vector and singular value component matrices exposing useful properties. The objective of this study was to use a small portion of uncorrelated singular values, as robust features for the classification of sliced pork ham images, using a supervised artificial neural network classifier. Images were acquired from four qualities of sliced cooked pork ham typically consumed in Ireland (90 slices per quality), having similar appearances. Mahalanobis distances and Pearson product moment correlations were used for feature selection. Six highly discriminating features were used as input to train the neural network. An adaptive feedforward multilayer perceptron classifier was employed to obtain a suitable mapping from the input dataset. The overall correct classification performance for the training, validation and test set were 90.3%, 94.4%, and 86.1%, respectively. The results confirm that the classification performance was satisfactory. Extracting the most informative features led to the recognition of a set of different but visually quite similar textural patterns based on quaternionic singular values. Copyright 2009 Elsevier Ltd. All rights reserved.

Remodelling of human osteoarthritic cartilage by FGF-2, alone or combined with Sox9 via rAAV gene transfer.

PubMed

Cucchiarini, Magali; Terwilliger, Ernest F; Kohn, Dieter; Madry, Henning

2009-08-01

Compensating for the loss of extracellular cartilage matrix, as well as counteracting the alterations of the chondrocyte phenotype in osteoarthritis are of key importance to develop effective therapeutic strategies against this disorder. In the present study, we analysed the benefits of applying a potent gene combination to remodel human osteoarthritic (OA) cartilage. We employed the promising recombinant adeno-associated virus (rAAV) vector to deliver the mitogenic fibroblast growth factor 2 (FGF-2) factor, alone or simultaneously with the transcription factor Sox9 as a key activator of matrix synthesis, to human normal and OA articular chondrocytes. We evaluated the effects of single (FGF-2) or combined (FGF-2/SOX9) transgene expression upon the regenerative activities of chondrocytes in three dimensional cultures in vitro and in cartilage explants in situ. Single overexpression of FGF-2 enhanced the survival and proliferation of both normal and OA chondrocytes, without stimulating the matrix synthetic processes in the increased pools of cells. The mitogenic properties of FGF-2 were maintained when SOX9 was co-overexpressed and concomitant with an increase in the production of proteoglycans and type-II collagen, suggesting that the transcription factor was capable of counterbalancing the effects of FGF-2 on matrix accumulation. Also important, expression of type-X collagen, a marker of hypertrophy strongly decreased following treatment by the candidate vectors. Most remarkably, the levels of activities achieved in co-treated human OA cartilage were similar to or higher than those observed in normal cartilage. The present findings show that combined expression of candidate factors in OA cartilage can re-establish key features of normal cartilage and prevent the pathological shift of metabolic homeostasis. These data provide further motivation to develop coupled gene transfer approaches via rAAV for the treatment of human OA.

Multi-indexed Meixner and little q-Jacobi (Laguerre) polynomials

NASA Astrophysics Data System (ADS)

Odake, Satoru; Sasaki, Ryu

2017-04-01

As the fourth stage of the project multi-indexed orthogonal polynomials, we present the multi-indexed Meixner and little q-Jacobi (Laguerre) polynomials in the framework of ‘discrete quantum mechanics’ with real shifts defined on the semi-infinite lattice in one dimension. They are obtained, in a similar way to the multi-indexed Laguerre and Jacobi polynomials reported earlier, from the quantum mechanical systems corresponding to the original orthogonal polynomials by multiple application of the discrete analogue of the Darboux transformations or the Crum-Krein-Adler deletion of virtual state vectors. The virtual state vectors are the solutions of the matrix Schrödinger equation on all the lattice points having negative energies and infinite norm. This is in good contrast to the (q-)Racah systems defined on a finite lattice, in which the ‘virtual state’ vectors satisfy the matrix Schrödinger equation except for one of the two boundary points.

On the computer analysis of structures and mechanical systems

NASA Technical Reports Server (NTRS)

Bennett, B. E.

1984-01-01

The governing equations for the analysis of open branch-chain mechanical systems are developed in a form suitable for implementation in a general purpose finite element computer program. Lagrange's form of d'Alembert's principle is used to derive the system mass matrix and force vector. The generalized coordinates are selected as the unconstrained relative degrees of freedom giving the position and orientation of each slave link with respect to their master link. Each slave link may have from zero to six degrees of freedom relative to the reference frames of its master link. A strategy for automatic generation of the system mass matrix and force vector is described.

Solving large-scale dynamic systems using band Lanczos method in Rockwell NASTRAN on CRAY X-MP

NASA Technical Reports Server (NTRS)

Gupta, V. K.; Zillmer, S. D.; Allison, R. E.

1986-01-01

The improved cost effectiveness using better models, more accurate and faster algorithms and large scale computing offers more representative dynamic analyses. The band Lanczos eigen-solution method was implemented in Rockwell's version of 1984 COSMIC-released NASTRAN finite element structural analysis computer program to effectively solve for structural vibration modes including those of large complex systems exceeding 10,000 degrees of freedom. The Lanczos vectors were re-orthogonalized locally using the Lanczos Method and globally using the modified Gram-Schmidt method for sweeping rigid-body modes and previously generated modes and Lanczos vectors. The truncated band matrix was solved for vibration frequencies and mode shapes using Givens rotations. Numerical examples are included to demonstrate the cost effectiveness and accuracy of the method as implemented in ROCKWELL NASTRAN. The CRAY version is based on RPK's COSMIC/NASTRAN. The band Lanczos method was more reliable and accurate and converged faster than the single vector Lanczos Method. The band Lanczos method was comparable to the subspace iteration method which was a block version of the inverse power method. However, the subspace matrix tended to be fully populated in the case of subspace iteration and not as sparse as a band matrix.

A three-dimensional nonlinear Timoshenko beam based on the core-congruential formulation

NASA Technical Reports Server (NTRS)

Crivelli, Luis A.; Felippa, Carlos A.

1992-01-01

A three-dimensional, geometrically nonlinear two-node Timoshenkoo beam element based on the total Larangrian description is derived. The element behavior is assumed to be linear elastic, but no restrictions are placed on magnitude of finite rotations. The resulting element has twelve degrees of freedom: six translational components and six rotational-vector components. The formulation uses the Green-Lagrange strains and second Piola-Kirchhoff stresses as energy-conjugate variables and accounts for the bending-stretching and bending-torsional coupling effects without special provisions. The core-congruential formulation (CCF) is used to derived the discrete equations in a staged manner. Core equations involving the internal force vector and tangent stiffness matrix are developed at the particle level. A sequence of matrix transformations carries these equations to beam cross-sections and finally to the element nodal degrees of freedom. The choice of finite rotation measure is made in the next-to-last transformation stage, and the choice of over-the-element interpolation in the last one. The tangent stiffness matrix is found to retain symmetry if the rotational vector is chosen to measure finite rotations. An extensive set of numerical examples is presented to test and validate the present element.

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

Lello, Louis; Boyanovsky, Daniel; Pisarski, Robert D.

Here, in the standard model extended with a seesaw mass matrix, we study the production of sterile neutrinos from the decay of vector bosons at temperatures near the masses of the electroweak bosons. We derive a general quantum kinetic equation for the production of sterile neutrinos and their effective mixing angles, which is applicable over a wide range of temperature, to all orders in interactions of the standard model and to leading order in a small mixing angle for the neutrinos. We emphasize the relation between the production rate and Landau damping at one-loop order and show that production rates and effective mixing angles depend sensitively upon the neutrino’s helicity. Sterile neutrinos with positive helicity interact more weakly with the medium than those with negative helicity, and their effective mixing angle is not modified significantly. Negative helicity states couple more strongly to the vector bosons, but their mixing angle is strongly suppressed by the medium. Consequently, if the mass of the sterile neutrino is ≲ 8.35 MeV , there are fewer states with negative helicity produced than those with positive helicity. There is an Mikheyev-Smirnov-Wolfenstein-type resonance in the absence of lepton asymmetry, but due to screening by the damping rate, the production rate is not enhanced. Sterile neutrinos with negative helicity freeze out at Tmore » $$-\\atop{f}$$ ≃ 5 GeV , whereas positive helicity neutrinos freeze out at T$$+\\atop{f}$$≃ 8 GeV , with both distributions far from thermal. As the temperature decreases, due to competition between a decreasing production rate and an increasing mixing angle, the distribution function for states with negative helicity is broader in momentum and hotter than that for those with positive helicity. Sterile neutrinos produced via vector boson decay do not satisfy the abundance, lifetime, and cosmological constraints to be the sole dark matter component in the Universe. Massive sterile neutrinos produced via vector boson decay might solve the 7Li problem, albeit at the very edge of the possible parameter space. A heavy sterile neutrino with a mass of a few MeV could decay into light sterile neutrinos, of a few keV in mass, that contribute to warm dark matter. In conclusion, we argue that heavy sterile neutrinos with lifetime ≤1/H 0 reach local thermodynamic equilibrium.« less

Monograph On Tensor Notations

NASA Technical Reports Server (NTRS)

Sirlin, Samuel W.

1993-01-01

Eight-page report describes systems of notation used most commonly to represent tensors of various ranks, with emphasis on tensors in Cartesian coordinate systems. Serves as introductory or refresher text for scientists, engineers, and others familiar with basic concepts of coordinate systems, vectors, and partial derivatives. Indicial tensor, vector, dyadic, and matrix notations, and relationships among them described.

Unified treatment of microscopic boundary conditions and efficient algorithms for estimating tangent operators of the homogenized behavior in the computational homogenization method

NASA Astrophysics Data System (ADS)

Nguyen, Van-Dung; Wu, Ling; Noels, Ludovic

2017-03-01

This work provides a unified treatment of arbitrary kinds of microscopic boundary conditions usually considered in the multi-scale computational homogenization method for nonlinear multi-physics problems. An efficient procedure is developed to enforce the multi-point linear constraints arising from the microscopic boundary condition either by the direct constraint elimination or by the Lagrange multiplier elimination methods. The macroscopic tangent operators are computed in an efficient way from a multiple right hand sides linear system whose left hand side matrix is the stiffness matrix of the microscopic linearized system at the converged solution. The number of vectors at the right hand side is equal to the number of the macroscopic kinematic variables used to formulate the microscopic boundary condition. As the resolution of the microscopic linearized system often follows a direct factorization procedure, the computation of the macroscopic tangent operators is then performed using this factorized matrix at a reduced computational time.

Improved detection of DNA-binding proteins via compression technology on PSSM information.

PubMed

Wang, Yubo; Ding, Yijie; Guo, Fei; Wei, Leyi; Tang, Jijun

2017-01-01

Since the importance of DNA-binding proteins in multiple biomolecular functions has been recognized, an increasing number of researchers are attempting to identify DNA-binding proteins. In recent years, the machine learning methods have become more and more compelling in the case of protein sequence data soaring, because of their favorable speed and accuracy. In this paper, we extract three features from the protein sequence, namely NMBAC (Normalized Moreau-Broto Autocorrelation), PSSM-DWT (Position-specific scoring matrix-Discrete Wavelet Transform), and PSSM-DCT (Position-specific scoring matrix-Discrete Cosine Transform). We also employ feature selection algorithm on these feature vectors. Then, these features are fed into the training SVM (support vector machine) model as classifier to predict DNA-binding proteins. Our method applys three datasets, namely PDB1075, PDB594 and PDB186, to evaluate the performance of our approach. The PDB1075 and PDB594 datasets are employed for Jackknife test and the PDB186 dataset is used for the independent test. Our method achieves the best accuracy in the Jacknife test, from 79.20% to 86.23% and 80.5% to 86.20% on PDB1075 and PDB594 datasets, respectively. In the independent test, the accuracy of our method comes to 76.3%. The performance of independent test also shows that our method has a certain ability to be effectively used for DNA-binding protein prediction. The data and source code are at https://doi.org/10.6084/m9.figshare.5104084.

A proposed standard method for polarimetric calibration and calibration verification

NASA Astrophysics Data System (ADS)

Persons, Christopher M.; Jones, Michael W.; Farlow, Craig A.; Morell, L. Denise; Gulley, Michael G.; Spradley, Kevin D.

2007-09-01

Accurate calibration of polarimetric sensors is critical to reducing and analyzing phenomenology data, producing uniform polarimetric imagery for deployable sensors, and ensuring predictable performance of polarimetric algorithms. It is desirable to develop a standard calibration method, including verification reporting, in order to increase credibility with customers and foster communication and understanding within the polarimetric community. This paper seeks to facilitate discussions within the community on arriving at such standards. Both the calibration and verification methods presented here are performed easily with common polarimetric equipment, and are applicable to visible and infrared systems with either partial Stokes or full Stokes sensitivity. The calibration procedure has been used on infrared and visible polarimetric imagers over a six year period, and resulting imagery has been presented previously at conferences and workshops. The proposed calibration method involves the familiar calculation of the polarimetric data reduction matrix by measuring the polarimeter's response to a set of input Stokes vectors. With this method, however, linear combinations of Stokes vectors are used to generate highly accurate input states. This allows the direct measurement of all system effects, in contrast with fitting modeled calibration parameters to measured data. This direct measurement of the data reduction matrix allows higher order effects that are difficult to model to be discovered and corrected for in calibration. This paper begins with a detailed tutorial on the proposed calibration and verification reporting methods. Example results are then presented for a LWIR rotating half-wave retarder polarimeter.

Search for single production of vector-like quarks decaying to a Z boson and a top or a bottom quark in proton-proton collisions at √{s}=13 TeV

NASA Astrophysics Data System (ADS)

Sirunyan, A. M.; Tumasyan, A.; Adam, W.; Asilar, E.; Bergauer, T.; Brandstetter, J.; Brondolin, E.; Dragicevic, M.; Erö, J.; Flechl, M.; Friedl, M.; Frühwirth, R.; Ghete, V. M.; Hartl, C.; Hörmann, N.; Hrubec, J.; Jeitler, M.; König, A.; Krätschmer, I.; Liko, D.; Matsushita, T.; Mikulec, I.; Rabady, D.; Rad, N.; Rahbaran, B.; Rohringer, H.; Schieck, J.; Strauss, J.; Waltenberger, W.; Wulz, C.-E.; Dvornikov, O.; Makarenko, V.; Mossolov, V.; Suarez Gonzalez, J.; Zykunov, V.; Shumeiko, N.; Alderweireldt, S.; De Wolf, E. A.; Janssen, X.; Lauwers, J.; Van De Klundert, M.; Van Haevermaet, H.; Van Mechelen, P.; Van Remortel, N.; Van Spilbeeck, A.; Abu Zeid, S.; Blekman, F.; D'Hondt, J.; Daci, N.; De Bruyn, I.; Deroover, K.; Lowette, S.; Moortgat, S.; Moreels, L.; Olbrechts, A.; Python, Q.; Skovpen, K.; Tavernier, S.; Van Doninck, W.; Van Mulders, P.; Van Parijs, I.; Brun, H.; Clerbaux, B.; De Lentdecker, G.; Delannoy, H.; Fasanella, G.; Favart, L.; Goldouzian, R.; Grebenyuk, A.; Karapostoli, G.; Lenzi, T.; Léonard, A.; Luetic, J.; Maerschalk, T.; Marinov, A.; Randle-conde, A.; Seva, T.; Vander Velde, C.; Vanlaer, P.; Vannerom, D.; Yonamine, R.; Zenoni, F.; Zhang, F.; Cimmino, A.; Cornelis, T.; Dobur, D.; Fagot, A.; Gul, M.; Khvastunov, I.; Poyraz, D.; Salva, S.; Schöfbeck, R.; Tytgat, M.; Van Driessche, W.; Yazgan, E.; Zaganidis, N.; Bakhshiansohi, H.; Beluffi, C.; Bondu, O.; Brochet, S.; Bruno, G.; Caudron, A.; De Visscher, S.; Delaere, C.; Delcourt, M.; Francois, B.; Giammanco, A.; Jafari, A.; Komm, M.; Krintiras, G.; Lemaitre, V.; Magitteri, A.; Mertens, A.; Musich, M.; Piotrzkowski, K.; Quertenmont, L.; Selvaggi, M.; Vidal Marono, M.; Wertz, S.; Beliy, N.; Aldá Júnior, W. L.; Alves, F. L.; Alves, G. A.; Brito, L.; Hensel, C.; Moraes, A.; Pol, M. E.; Rebello Teles, P.; Belchior Batista Das Chagas, E.; Carvalho, W.; Chinellato, J.; Custódio, A.; Da Costa, E. M.; Da Silveira, G. G.; De Jesus Damiao, D.; De Oliveira Martins, C.; Fonseca De Souza, S.; Huertas Guativa, L. M.; Malbouisson, H.; Matos Figueiredo, D.; Mora Herrera, C.; Mundim, L.; Nogima, H.; Prado Da Silva, W. L.; Santoro, A.; Sznajder, A.; Tonelli Manganote, E. J.; Torres Da Silva De Araujo, F.; Vilela Pereira, A.; Ahuja, S.; Bernardes, C. A.; Dogra, S.; Fernandez Perez Tomei, T. R.; Gregores, E. M.; Mercadante, P. G.; Moon, C. S.; Novaes, S. F.; Padula, Sandra S.; Romero Abad, D.; Ruiz Vargas, J. C.; Aleksandrov, A.; Hadjiiska, R.; Iaydjiev, P.; Rodozov, M.; Stoykova, S.; Sultanov, G.; Vu-tova, M.; Dimitrov, A.; Glushkov, I.; Litov, L.; Pavlov, B.; Petkov, P.; Fang, W.; Ahmad, M.; Bian, J. G.; Chen, G. M.; Chen, H. S.; Chen, M.; Chen, Y.; Cheng, T.; Jiang, C. H.; Leggat, D.; Liu, Z.; Romeo, F.; Ruan, M.; Shaheen, S. M.; Spiezia, A.; Tao, J.; Wang, C.; Wang, Z.; Zhang, H.; Zhao, J.; Ban, Y.; Chen, G.; Li, Q.; Liu, S.; Mao, Y.; Qian, S. J.; Wang, D.; Xu, Z.; Avila, C.; Cabrera, A.; Chaparro Sierra, L. F.; Florez, C.; Gomez, J. P.; González Hernández, C. F.; Ruiz Alvarez, J. D.; Sanabria, J. C.; Godinovic, N.; Lelas, D.; Puljak, I.; Ribeiro Cipriano, P. M.; Sculac, T.; Antunovic, Z.; Kovac, M.; Brigljevic, V.; Ferencek, D.; Kadija, K.; Mesic, B.; Susa, T.; Attikis, A.; Mavromanolakis, G.; Mousa, J.; Nicolaou, C.; Ptochos, F.; Razis, P. A.; Rykaczewski, H.; Finger, M.; Finger, M.; Carrera Jarrin, E.; Assran, Y.; Elkafrawy, T.; Mahrous, A.; Kadastik, M.; Perrini, L.; Raidal, M.; Tiko, A.; Veelken, C.; Eerola, P.; Pekkanen, J.; Voutilainen, M.; Härkönen, J.; Järvinen, T.; Karimäki, V.; Kinnunen, R.; Lampén, T.; Lassila-Perini, K.; Lehti, S.; Lindén, T.; Luukka, P.; Tuominiemi, J.; Tuovinen, E.; Wendland, L.; Talvitie, J.; Tuuva, T.; Besancon, M.; Couderc, F.; Dejardin, M.; Denegri, D.; Fabbro, B.; Faure, J. L.; Favaro, C.; Ferri, F.; Ganjour, S.; Ghosh, S.; Givernaud, A.; Gras, P.; Hamel de Monchenault, G.; Jarry, P.; Kucher, I.; Locci, E.; Machet, M.; Malcles, J.; Rander, J.; Rosowsky, A.; Titov, M.; Abdulsalam, A.; Antropov, I.; Baffioni, S.; Beaudette, F.; Busson, P.; Cadamuro, L.; Chapon, E.; Charlot, C.; Davignon, O.; Granier de Cassagnac, R.; Jo, M.; Lisniak, S.; Miné, P.; Nguyen, M.; Ochando, C.; Ortona, G.; Paganini, P.; Pigard, P.; Regnard, S.; Salerno, R.; Sirois, Y.; Strebler, T.; Yilmaz, Y.; Zabi, A.; Zghiche, A.; Agram, J.-L.; Andrea, J.; Aubin, A.; Bloch, D.; Brom, J.-M.; Buttignol, M.; Chabert, E. C.; Chanon, N.; Collard, C.; Conte, E.; Coubez, X.; Fontaine, J.-C.; Gelé, D.; Goerlach, U.; Le Bihan, A.-C.; Van Hove, P.; Gadrat, S.; Beauceron, S.; Bernet, C.; Boudoul, G.; Carrillo Montoya, C. A.; Chierici, R.; Contardo, D.; Courbon, B.; Depasse, P.; El Mamouni, H.; Fay, J.; Gascon, S.; Gouzevitch, M.; Grenier, G.; Ille, B.; Lagarde, F.; Laktineh, I. B.; Lethuillier, M.; Mirabito, L.; Pequegnot, A. L.; Perries, S.; Popov, A.; Sabes, D.; Sordini, V.; Vander Donckt, M.; Verdier, P.; Viret, S.; Khvedelidze, A.; Tsamalaidze, Z.; Autermann, C.; Beranek, S.; Feld, L.; Kiesel, M. K.; Klein, K.; Lipinski, M.; Preuten, M.; Schomakers, C.; Schulz, J.; Verlage, T.; Albert, A.; Brodski, M.; Dietz-Laursonn, E.; Duchardt, D.; Endres, M.; Erdmann, M.; Erd-weg, S.; Esch, T.; Fischer, R.; Güth, A.; Hamer, M.; Hebbeker, T.; Heidemann, C.; Hoepfner, K.; Knutzen, S.; Merschmeyer, M.; Meyer, A.; Millet, P.; Mukherjee, S.; Olschewski, M.; Padeken, K.; Pook, T.; Radziej, M.; Reithler, H.; Rieger, M.; Scheuch, F.; Sonnenschein, L.; Teyssier, D.; Thüer, S.; Cherepanov, V.; Flügge, G.; Kargoll, B.; Kress, T.; Künsken, A.; Lingemann, J.; Müller, T.; Nehrkorn, A.; Nowack, A.; Pistone, C.; Pooth, O.; Stahl, A.; Aldaya Martin, M.; Arndt, T.; Asawatangtrakuldee, C.; Beernaert, K.; Behnke, O.; Behrens, U.; Bin Anuar, A. A.; Borras, K.; Campbell, A.; Connor, P.; Contreras-Campana, C.; Costanza, F.; Diez Pardos, C.; Dolinska, G.; Eckerlin, G.; Eckstein, D.; Eichhorn, T.; Eren, E.; Gallo, E.; Garay Garcia, J.; Geiser, A.; Gizhko, A.; Grados Luyando, J. M.; Grohsjean, A.; Gunnellini, P.; Harb, A.; Hauk, J.; Hempel, M.; Jung, H.; Kalogeropoulos, A.; Karacheban, O.; Kasemann, M.; Keaveney, J.; Kleinwort, C.; Korol, I.; Krücker, D.; Lange, W.; Lelek, A.; Lenz, T.; Leonard, J.; Lipka, K.; Lobanov, A.; Lohmann, W.; Mankel, R.; Melzer-Pellmann, I.-A.; Meyer, A. B.; Mittag, G.; Mnich, J.; Mussgiller, A.; Pitzl, D.; Placakyte, R.; Raspereza, A.; Roland, B.; Sahin, M. Ö.; Saxena, P.; SchoernerSadenius, T.; Spannagel, S.; Stefaniuk, N.; Van Onsem, G. P.; Walsh, R.; Wissing, C.; Blobel, V.; Centis Vignali, M.; Draeger, A. R.; Dreyer, T.; Garutti, E.; Gonzalez, D.; Haller, J.; Hoffmann, M.; Junkes, A.; Klanner, R.; Kogler, R.; Kovalchuk, N.; Lapsien, T.; Marchesini, I.; Marconi, D.; Meyer, M.; Niedziela, M.; Nowatschin, D.; Pantaleo, F.; Peiffer, T.; Perieanu, A.; Poehlsen, J.; Scharf, C.; Schleper, P.; Schmidt, A.; Schumann, S.; Schwandt, J.; Stadie, H.; Steinbrück, G.; Stober, F. M.; Stöver, M.; Tholen, H.; Troendle, D.; Usai, E.; Vanelderen, L.; Vanhoefer, A.; Vormwald, B.; Akbiyik, M.; Barth, C.; Baur, S.; Baus, C.; Berger, J.; Butz, E.; Caspart, R.; Chwalek, T.; Colombo, F.; De Boer, W.; Dierlamm, A.; Fink, S.; Freund, B.; Friese, R.; Giffels, M.; Gilbert, A.; Goldenzweig, P.; Haitz, D.; Hartmann, F.; Heindl, S. M.; Husemann, U.; Katkov, I.; Kudella, S.; Mildner, H.; Mozer, M. U.; Müller, Th.; Plagge, M.; Quast, G.; Rabbertz, K.; Röcker, S.; Roscher, F.; Schröder, M.; Shvetsov, I.; Sieber, G.; Simonis, H. J.; Ulrich, R.; Wayand, S.; Weber, M.; Weiler, T.; Williamson, S.; Wöhrmann, C.; Wolf, R.; Anagnostou, G.; Daskalakis, G.; Geralis, T.; Giakoumopoulou, V. A.; Kyriakis, A.; Loukas, D.; Topsis-Giotis, I.; Kesisoglou, S.; Panagiotou, A.; Saoulidou, N.; Tziaferi, E.; Evangelou, I.; Flouris, G.; Foudas, C.; Kokkas, P.; Loukas, N.; Manthos, N.; Papadopoulos, I.; Paradas, E.; Filipovic, N.; Pasztor, G.; Bencze, G.; Hajdu, C.; Horvath, D.; Sikler, F.; Veszpremi, V.; Vesztergombi, G.; Zsigmond, A. J.; Beni, N.; Czellar, S.; Karancsi, J.; Makovec, A.; Molnar, J.; Szillasi, Z.; Bartók, M.; Raics, P.; Trocsanyi, Z. L.; Ujvari, B.; Komaragiri, J. R.; Bahinipati, S.; Bhowmik, S.; Choudhury, S.; Mal, P.; Mandal, K.; Nayak, A.; Sahoo, D. K.; Sahoo, N.; Swain, S. K.; Bansal, S.; Beri, S. B.; Bhatnagar, V.; Chawla, R.; Bhawandeep, U.; Kalsi, A. K.; Kaur, A.; Kaur, M.; Kumar, R.; Kumari, P.; Mehta, A.; Mittal, M.; Singh, J. B.; Walia, G.; Kumar, Ashok; Bhardwaj, A.; Choudhary, B. C.; Garg, R. B.; Keshri, S.; Malhotra, S.; Naimuddin, M.; Ranjan, K.; Sharma, R.; Sharma, V.; Bhattacharya, R.; Bhattacharya, S.; Chatterjee, K.; Dey, S.; Dutt, S.; Dutta, S.; Ghosh, S.; Majumdar, N.; Modak, A.; Mondal, K.; Mukhopadhyay, S.; Nandan, S.; Purohit, A.; Roy, A.; Roy, D.; Roy Chowdhury, S.; Sarkar, S.; Sharan, M.; Thakur, S.; Behera, P. K.; Chudasama, R.; Dutta, D.; Jha, V.; Kumar, V.; Mohanty, A. K.; Netrakanti, P. K.; Pant, L. M.; Shukla, P.; Topkar, A.; Aziz, T.; Dugad, S.; Kole, G.; Mahakud, B.; Mitra, S.; Mohanty, G. B.; Parida, B.; Sur, N.; Sutar, B.; Banerjee, S.; Dewanjee, R. K.; Ganguly, S.; Guchait, M.; Jain, Sa.; Kumar, S.; Maity, M.; Majumder, G.; Mazumdar, K.; Sarkar, T.; Wickramage, N.; Chauhan, S.; Dube, S.; Hegde, V.; Kapoor, A.; Kothekar, K.; Pandey, S.; Rane, A.; Sharma, S.; Chenarani, S.; Eskandari Tadavani, E.; Etesami, S. M.; Khakzad, M.; Mohammadi Najafabadi, M.; Naseri, M.; Paktinat Mehdiabadi, S.; Rezaei Hosseinabadi, F.; Safarzadeh, B.; Zeinali, M.; Felcini, M.; Grunewald, M.; Abbrescia, M.; Calabria, C.; Caputo, C.; Colaleo, A.; Creanza, D.; Cristella, L.; De Filippis, N.; De Palma, M.; Fiore, L.; Iaselli, G.; Maggi, G.; Maggi, M.; Miniello, G.; My, S.; Nuzzo, S.; Pompili, A.; Pugliese, G.; Radogna, R.; Ranieri, A.; Selvaggi, G.; Sharma, A.; Silvestris, L.; Venditti, R.; Verwilligen, P.; Abbiendi, G.; Battilana, C.; Bonacorsi, D.; Braibant-Giacomelli, S.; Brigliadori, L.; Campanini, R.; Capiluppi, P.; Castro, A.; Cavallo, F. R.; Chhibra, S. S.; Codispoti, G.; Cuffiani, M.; Dallavalle, G. M.; Fabbri, F.; Fanfani, A.; Fasanella, D.; Giacomelli, P.; Grandi, C.; Guiducci, L.; Marcellini, S.; Masetti, G.; Montanari, A.; Navarria, F. L.; Perrotta, A.; Rossi, A. M.; Rovelli, T.; Siroli, G. P.; Tosi, N.; Albergo, S.; Costa, S.; Di Mattia, A.; Giordano, F.; Potenza, R.; Tricomi, A.; Tuve, C.; Barbagli, G.; Ciulli, V.; Civinini, C.; D'Alessandro, R.; Focardi, E.; Lenzi, P.; Meschini, M.; Paoletti, S.; Russo, L.; Sguazzoni, G.; Strom, D.; Viliani, L.; Benussi, L.; Bianco, S.; Fabbri, F.; Piccolo, D.; Primavera, F.; Calvelli, V.; Ferro, F.; Monge, M. R.; Robutti, E.; Tosi, S.; Brianza, L.; Brivio, F.; Ciriolo, V.; Dinardo, M. E.; Fiorendi, S.; Gennai, S.; Ghezzi, A.; Govoni, P.; Malberti, M.; Malvezzi, S.; Manzoni, R. A.; Menasce, D.; Moroni, L.; Paganoni, M.; Pedrini, D.; Pigazzini, S.; Ragazzi, S.; Tabarelli de Fatis, T.; Buontempo, S.; Cavallo, N.; De Nardo, G.; Di Guida, S.; Esposito, M.; Fabozzi, F.; Fienga, F.; Iorio, A. O. M.; Lanza, G.; Lista, L.; Meola, S.; Paolucci, P.; Sciacca, C.; Thyssen, F.; Azzi, P.; Bacchetta, N.; Benato, L.; Bisello, D.; Boletti, A.; Carlin, R.; Carvalho Antunes De Oliveira, A.; Checchia, P.; Dall'Osso, M.; De Castro Manzano, P.; Dorigo, T.; Dosselli, U.; Gozzelino, A.; Lacaprara, S.; Margoni, M.; Meneguzzo, A. T.; Montecassiano, F.; Passaseo, M.; Pazzini, J.; Pozzobon, N.; Ronchese, P.; Simonetto, F.; Torassa, E.; Zanetti, M.; Zotto, P.; Zumerle, G.; Braghieri, A.; Fallavollita, F.; Magnani, A.; Montagna, P.; Ratti, S. P.; Re, V.; Riccardi, C.; Salvini, P.; Vai, I.; Vitulo, P.; Alunni Solestizi, L.; Bilei, G. M.; Ciangottini, D.; Fanò, L.; Lariccia, P.; Leonardi, R.; Mantovani, G.; Menichelli, M.; Saha, A.; Santocchia, A.; Androsov, K.; Azzurri, P.; Bagliesi, G.; Bernardini, J.; Boccali, T.; Castaldi, R.; Ciocci, M. A.; Dell'Orso, R.; Donato, S.; Fedi, G.; Giassi, A.; Grippo, M. T.; Ligabue, F.; Lomtadze, T.; Martini, L.; Messineo, A.; Palla, F.; Rizzi, A.; Savoy-Navarro, A.; Spagnolo, P.; Tenchini, R.; Tonelli, G.; Venturi, A.; Verdini, P. G.; Barone, L.; Cavallari, F.; Cipriani, M.; Del Re, D.; Diemoz, M.; Gelli, S.; Longo, E.; Margaroli, F.; Marzocchi, B.; Meridiani, P.; Organtini, G.; Paramatti, R.; Preiato, F.; Rahatlou, S.; Rovelli, C.; Santanastasio, F.; Amapane, N.; Arcidiacono, R.; Argiro, S.; Arneodo, M.; Bartosik, N.; Bellan, R.; Biino, C.; Cartiglia, N.; Cenna, F.; Costa, M.; Covarelli, R.; Degano, A.; Demaria, N.; Finco, L.; Kiani, B.; Mariotti, C.; Maselli, S.; Migliore, E.; Monaco, V.; Monteil, E.; Monteno, M.; Obertino, M. M.; Pacher, L.; Pastrone, N.; Pelliccioni, M.; Pinna Angioni, G. L.; Ravera, F.; Romero, A.; Ruspa, M.; Sacchi, R.; Shchelina, K.; Sola, V.; Solano, A.; Staiano, A.; Traczyk, P.; Belforte, S.; Casarsa, M.; Cossutti, F.; Della Ricca, G.; Zanetti, A.; Kim, D. H.; Kim, G. N.; Kim, M. S.; Lee, S.; Lee, S. W.; Oh, Y. D.; Sekmen, S.; Son, D. C.; Yang, Y. C.; Lee, A.; Kim, H.; Brochero Cifuentes, J. A.; Kim, T. J.; Cho, S.; Choi, S.; Go, Y.; Gyun, D.; Ha, S.; Hong, B.; Jo, Y.; Kim, Y.; Lee, K.; Lee, K. S.; Lee, S.; Lim, J.; Park, S. K.; Roh, Y.; Almond, J.; Kim, J.; Lee, H.; Oh, S. B.; Radburn-Smith, B. C.; Seo, S. h.; Yang, U. K.; Yoo, H. D.; Yu, G. B.; Choi, M.; Kim, H.; Kim, J. H.; Lee, J. S. H.; Park, I. C.; Ryu, G.; Ryu, M. S.; Choi, Y.; Goh, J.; Hwang, C.; Lee, J.; Yu, I.; Dudenas, V.; Juodagalvis, A.; Vaitkus, J.; Ahmed, I.; Ibrahim, Z. A.; Ali, M. A. B. Md; Mohamad Idris, F.; Wan Abdullah, W. A. T.; Yusli, M. N.; Zolkapli, Z.; Castilla-Valdez, H.; De La Cruz-Burelo, E.; Heredia-De La Cruz, I.; Hernandez-Almada, A.; Lopez-Fernandez, R.; Magaña Villalba, R.; Mejia Guisao, J.; Sanchez-Hernandez, A.; Carrillo Moreno, S.; Oropeza Barrera, C.; Vazquez Valencia, F.; Carpinteyro, S.; Pedraza, I.; Salazar Ibarguen, H. A.; Uribe Estrada, C.; Morelos Pineda, A.; Krofcheck, D.; Butler, P. H.; Ahmad, A.; Ahmad, M.; Hassan, Q.; Hoorani, H. R.; Khan, W. A.; Saddique, A.; Shah, M. A.; Shoaib, M.; Waqas, M.; Bialkowska, H.; Bluj, M.; Boimska, B.; Frueboes, T.; Górski, M.; Kazana, M.; Nawrocki, K.; Romanowska-Rybinska, K.; Szleper, M.; Zalewski, P.; Bunkowski, K.; Byszuk, A.; Doroba, K.; Kalinowski, A.; Konecki, M.; Krolikowski, J.; Misiura, M.; Olszewski, M.; Walczak, M.; Bargassa, P.; Beirão Da Cruz E Silva, C.; Calpas, B.; Di Francesco, A.; Faccioli, P.; Ferreira Parracho, P. G.; Gallinaro, M.; Hollar, J.; Leonardo, N.; Lloret Iglesias, L.; Nemallapudi, M. V.; Rodrigues Antunes, J.; Seixas, J.; Toldaiev, O.; Vadruccio, D.; Varela, J.; Vischia, P.; Afanasiev, S.; Bunin, P.; Gavrilenko, M.; Golutvin, I.; Gorbunov, I.; Kamenev, A.; Karjavin, V.; Lanev, A.; Malakhov, A.; Matveev, V.; Palichik, V.; Perelygin, V.; Savina, M.; Shmatov, S.; Skatchkov, N.; Smirnov, V.; Voytishin, N.; Zarubin, A.; Chtchipounov, L.; Golovtsov, V.; Ivanov, Y.; Kim, V.; Kuznetsova, E.; Murzin, V.; Oreshkin, V.; Sulimov, V.; Vorobyev, A.; Andreev, Yu.; Dermenev, A.; Gninenko, S.; Golubev, N.; Karneyeu, A.; Kirsanov, M.; Krasnikov, N.; Pashenkov, A.; Tlisov, D.; Toropin, A.; Epshteyn, V.; Gavrilov, V.; Lychkovskaya, N.; Popov, V.; Pozdnyakov, I.; Safronov, G.; Spiridonov, A.; Toms, M.; Vlasov, E.; Zhokin, A.; Aushev, T.; Bylinkin, A.; Chistov, R.; Danilov, M.; Polikarpov, S.; Andreev, V.; Azarkin, M.; Dremin, I.; Kirakosyan, M.; Leonidov, A.; Terkulov, A.; Baskakov, A.; Belyaev, A.; Boos, E.; Bunichev, V.; Dubinin, M.; Dudko, L.; Ershov, A.; Gribushin, A.; Klyukhin, V.; Kodolova, O.; Lokhtin, I.; Miagkov, I.; Obraztsov, S.; Perfilov, M.; Savrin, V.; Blinov, V.; Skovpen, Y.; Shtol, D.; Azhgirey, I.; Bayshev, I.; Bitioukov, S.; Elumakhov, D.; Kachanov, V.; Kalinin, A.; Konstantinov, D.; Krychkine, V.; Petrov, V.; Ryutin, R.; Sobol, A.; Troshin, S.; Tyurin, N.; Uzunian, A.; Volkov, A.; Adzic, P.; Cirkovic, P.; Devetak, D.; Dordevic, M.; Milosevic, J.; Rekovic, V.; Alcaraz Maestre, J.; Barrio Luna, M.; Calvo, E.; Cerrada, M.; Chamizo Llatas, M.; Colino, N.; De La Cruz, B.; Delgado Peris, A.; Escalante Del Valle, A.; Fernandez Bedoya, C.; Fernández Ramos, J. P.; Flix, J.; Fouz, M. C.; Garcia-Abia, P.; Gonzalez Lopez, O.; Goy Lopez, S.; Hernandez, J. M.; Josa, M. I.; Navarro De Martino, E.; Pérez-Calero Yzquierdo, A.; Puerta Pelayo, J.; Quintario Olmeda, A.; Redondo, I.; Romero, L.; Soares, M. S.; de Trocóniz, J. F.; Missiroli, M.; Moran, D.; Cuevas, J.; Fernandez Menendez, J.; Gonzalez Caballero, I.; González Fernández, J. R.; Palencia Cortezon, E.; Sanchez Cruz, S.; Suárez Andrés, I.; Vizan Garcia, J. M.; Cabrillo, I. J.; Calderon, A.; Curras, E.; Fernandez, M.; Garcia-Ferrero, J.; Gomez, G.; Lopez Virto, A.; Marco, J.; Martinez Rivero, C.; Matorras, F.; Piedra Gomez, J.; Rodrigo, T.; Ruiz-Jimeno, A.; Scodellaro, L.; Trevisani, N.; Vila, I.; Vilar Cortabitarte, R.; Abbaneo, D.; Auffray, E.; Auzinger, G.; Baillon, P.; Ball, A. H.; Barney, D.; Bloch, P.; Bocci, A.; Botta, C.; Camporesi, T.; Castello, R.; Cepeda, M.; Cerminara, G.; Chen, Y.; d'Enterria, D.; Dabrowski, A.; Daponte, V.; David, A.; De Gruttola, M.; De Roeck, A.; Di Marco, E.; Dobson, M.; Dorney, B.; du Pree, T.; Duggan, D.; Dünser, M.; Dupont, N.; Elliott-Peisert, A.; Everaerts, P.; Fartoukh, S.; Franzoni, G.; Fulcher, J.; Funk, W.; Gigi, D.; Gill, K.; Girone, M.; Glege, F.; Gulhan, D.; Gundacker, S.; Guthoff, M.; Harris, P.; Hegeman, J.; Innocente, V.; Janot, P.; Kieseler, J.; Kirschenmann, H.; Knünz, V.; Kornmayer, A.; Kortelainen, M. J.; Kousouris, K.; Krammer, M.; Lange, C.; Lecoq, P.; Lourenço, C.; Lucchini, M. T.; Malgeri, L.; Mannelli, M.; Martelli, A.; Meijers, F.; Merlin, J. A.; Mersi, S.; Meschi, E.; Milenovic, P.; Moortgat, F.; Morovic, S.; Mulders, M.; Neugebauer, H.; Orfanelli, S.; Orsini, L.; Pape, L.; Perez, E.; Peruzzi, M.; Petrilli, A.; Petrucciani, G.; Pfeiffer, A.; Pierini, M.; Racz, A.; Reis, T.; Rolandi, G.; Rovere, M.; Sakulin, H.; Sauvan, J. B.; Schäfer, C.; Schwick, C.; Seidel, M.; Sharma, A.; Silva, P.; Sphicas, P.; Steggemann, J.; Stoye, M.; Takahashi, Y.; Tosi, M.; Treille, D.; Triossi, A.; Tsirou, A.; Veckalns, V.; Veres, G. I.; Verweij, M.; Wardle, N.; Wöhri, H. K.; Zagozdzinska, A.; Zeuner, W. D.; Bertl, W.; Deiters, K.; Erdmann, W.; Horisberger, R.; Ingram, Q.; Kaestli, H. C.; Kotlinski, D.; Langenegger, U.; Rohe, T.; Wiederkehr, S. A.; Bachmair, F.; Bäni, L.; Bianchini, L.; Casal, B.; Dissertori, G.; Dittmar, M.; Donegà, M.; Grab, C.; Heidegger, C.; Hits, D.; Hoss, J.; Kasieczka, G.; Lustermann, W.; Mangano, B.; Marionneau, M.; Martinez Ruiz del Arbol, P.; Masciovecchio, M.; Meinhard, M. T.; Meister, D.; Micheli, F.; Musella, P.; Nessi-Tedaldi, F.; Pandolfi, F.; Pata, J.; Pauss, F.; Perrin, G.; Perrozzi, L.; Quittnat, M.; Rossini, M.; Schönenberger, M.; Starodumov, A.; Tavolaro, V. R.; Theofilatos, K.; Wallny, R.; Aarrestad, T. K.; Amsler, C.; Caminada, L.; Canelli, M. F.; De Cosa, A.; Galloni, C.; Hinzmann, A.; Hreus, T.; Kilminster, B.; Ngadiuba, J.; Pinna, D.; Rauco, G.; Robmann, P.; Salerno, D.; Seitz, C.; Yang, Y.; Zucchetta, A.; Candelise, V.; Doan, T. H.; Jain, Sh.; Khurana, R.; Konyushikhin, M.; Kuo, C. M.; Lin, W.; Pozdnyakov, A.; Yu, S. S.; Kumar, Arun; Chang, P.; Chang, Y. H.; Chao, Y.; Chen, K. F.; Chen, P. H.; Fiori, F.; Hou, W.-S.; Hsiung, Y.; Liu, Y. F.; Lu, R.-S.; Miñano Moya, M.; Paganis, E.; Psallidas, A.; Tsai, J. f.; Asavapibhop, B.; Singh, G.; Srimanobhas, N.; Suwonjandee, N.; Adiguzel, A.; Bakirci, M. N.; Damarseckin, S.; Demiroglu, Z. S.; Dozen, C.; Eskut, E.; Girgis, S.; Gokbulut, G.; Guler, Y.; Hos, I.; Kangal, E. E.; Kara, O.; Kiminsu, U.; Oglakci, M.; Onengut, G.; Ozdemir, K.; Ozturk, S.; Polatoz, A.; Sunar Cerci, D.; Turkcapar, S.; Zorbakir, I. S.; Zorbilmez, C.; Bilin, B.; Bilmis, S.; Isildak, B.; Karapinar, G.; Yalvac, M.; Zeyrek, M.; Gülmez, E.; Kaya, M.; Kaya, O.; Yetkin, E. A.; Yetkin, T.; Cakir, A.; Cankocak, K.; Sen, S.; Grynyov, B.; Levchuk, L.; Sorokin, P.; Aggleton, R.; Ball, F.; Beck, L.; Brooke, J. J.; Burns, D.; Clement, E.; Cussans, D.; Flacher, H.; Goldstein, J.; Grimes, M.; Heath, G. P.; Heath, H. F.; Jacob, J.; Kreczko, L.; Lucas, C.; Newbold, D. M.; Paramesvaran, S.; Poll, A.; Sakuma, T.; Seif El Nasr-storey, S.; Smith, D.; Smith, V. J.; Bell, K. W.; Belyaev, A.; Brew, C.; Brown, R. M.; Calligaris, L.; Cieri, D.; Cockerill, D. J. A.; Coughlan, J. A.; Harder, K.; Harper, S.; Olaiya, E.; Petyt, D.; Shepherd-Themistocleous, C. H.; Thea, A.; Tomalin, I. R.; Williams, T.; Baber, M.; Bainbridge, R.; Buchmuller, O.; Bundock, A.; Burton, D.; Casasso, S.; Citron, M.; Colling, D.; Corpe, L.; Dauncey, P.; Davies, G.; De Wit, A.; Della Negra, M.; Di Maria, R.; Dunne, P.; Elwood, A.; Futyan, D.; Haddad, Y.; Hall, G.; Iles, G.; James, T.; Lane, R.; Laner, C.; Lucas, R.; Lyons, L.; Magnan, A.-M.; Malik, S.; Mastrolorenzo, L.; Nash, J.; Nikitenko, A.; Pela, J.; Penning, B.; Pesaresi, M.; Raymond, D. M.; Richards, A.; Rose, A.; Scott, E.; Seez, C.; Summers, S.; Tapper, A.; Uchida, K.; Vazquez Acosta, M.; Virdee, T.; Wright, J.; Zenz, S. C.; Cole, J. E.; Hobson, P. R.; Khan, A.; Kyberd, P.; Reid, I. D.; Symonds, P.; Teodorescu, L.; Turner, M.; Borzou, A.; Call, K.; Dittmann, J.; Hatakeyama, K.; Liu, H.; Pastika, N.; Bartek, R.; Dominguez, A.; Buccilli, A.; Cooper, S. I.; Henderson, C.; Rumerio, P.; West, C.; Arcaro, D.; Avetisyan, A.; Bose, T.; Gastler, D.; Rankin, D.; Richardson, C.; Rohlf, J.; Sulak, L.; Zou, D.; Benelli, G.; Cutts, D.; Garabedian, A.; Hakala, J.; Heintz, U.; Hogan, J. M.; Jesus, O.; Kwok, K. H. M.; Laird, E.; Landsberg, G.; Mao, Z.; Narain, M.; Piperov, S.; Sagir, S.; Spencer, E.; Syarif, R.; Breedon, R.; Burns, D.; Calderon De La Barca Sanchez, M.; Chauhan, S.; Chertok, M.; Conway, J.; Conway, R.; Cox, P. T.; Erbacher, R.; Flores, C.; Funk, G.; Gardner, M.; Ko, W.; Lander, R.; Mclean, C.; Mulhearn, M.; Pellett, D.; Pilot, J.; Shalhout, S.; Shi, M.; Smith, J.; Squires, M.; Stolp, D.; Tos, K.; Tripathi, M.; Bachtis, M.; Bravo, C.; Cousins, R.; Dasgupta, A.; Florent, A.; Hauser, J.; Ignatenko, M.; Mccoll, N.; Saltzberg, D.; Schnaible, C.; Valuev, V.; Weber, M.; Bouvier, E.; Burt, K.; Clare, R.; Ellison, J.; Gary, J. W.; Ghiasi Shirazi, S. M. A.; Hanson, G.; Heilman, J.; Jandir, P.; Kennedy, E.; Lacroix, F.; Long, O. R.; Olmedo Negrete, M.; Paneva, M. I.; Shrinivas, A.; Si, W.; Wei, H.; Wimpenny, S.; Yates, B. R.; Branson, J. G.; Cerati, G. B.; Cittolin, S.; Derdzinski, M.; Gerosa, R.; Holzner, A.; Klein, D.; Krutelyov, V.; Letts, J.; Macneill, I.; Olivito, D.; Padhi, S.; Pieri, M.; Sani, M.; Sharma, V.; Simon, S.; Tadel, M.; Vartak, A.; Wasserbaech, S.; Welke, C.; Wood, J.; Würthwein, F.; Yagil, A.; Zevi Della Porta, G.; Amin, N.; Bhandari, R.; Bradmiller-Feld, J.; Campagnari, C.; Dishaw, A.; Dutta, V.; Franco Sevilla, M.; George, C.; Golf, F.; Gouskos, L.; Gran, J.; Heller, R.; Incandela, J.; Mullin, S. D.; Ovcharova, A.; Qu, H.; Richman, J.; Stuart, D.; Suarez, I.; Yoo, J.; Anderson, D.; Bendavid, J.; Bornheim, A.; Bunn, J.; Duarte, J.; Lawhorn, J. M.; Mott, A.; Newman, H. B.; Pena, C.; Spiropulu, M.; Vlimant, J. R.; Xie, S.; Zhu, R. Y.; Andrews, M. B.; Ferguson, T.; Paulini, M.; Russ, J.; Sun, M.; Vogel, H.; Vorobiev, I.; Weinberg, M.; Cumalat, J. P.; Ford, W. T.; Jensen, F.; Johnson, A.; Krohn, M.; Leontsinis, S.; Mulholland, T.; Stenson, K.; Wagner, S. R.; Alexander, J.; Chaves, J.; Chu, J.; Dittmer, S.; Mcdermott, K.; Mirman, N.; Nicolas Kaufman, G.; Patterson, J. R.; Rinkevicius, A.; Ryd, A.; Skinnari, L.; Soffi, L.; Tan, S. M.; Tao, Z.; Thom, J.; Tucker, J.; Wittich, P.; Zientek, M.; Winn, D.; Abdullin, S.; Albrow, M.; Apollinari, G.; Apresyan, A.; Banerjee, S.; Bauerdick, L. A. T.; Beretvas, A.; Berryhill, J.; Bhat, P. C.; Bolla, G.; Burkett, K.; Butler, J. N.; Cheung, H. W. K.; Chlebana, F.; Cihangir, S.; Cremonesi, M.; Elvira, V. D.; Fisk, I.; Freeman, J.; Gottschalk, E.; Gray, L.; Green, D.; Grünendahl, S.; Gutsche, O.; Hare, D.; Harris, R. M.; Hasegawa, S.; Hirschauer, J.; Hu, Z.; Jayatilaka, B.; Jindariani, S.; Johnson, M.; Joshi, U.; Klima, B.; Kreis, B.; Lammel, S.; Linacre, J.; Lincoln, D.; Lipton, R.; Liu, M.; Liu, T.; Lopes De Sá, R.; Lykken, J.; Maeshima, K.; Magini, N.; Marraffino, J. M.; Maruyama, S.; Mason, D.; McBride, P.; Merkel, P.; Mrenna, S.; Nahn, S.; O'Dell, V.; Pedro, K.; Prokofyev, O.; Rakness, G.; Ristori, L.; Sexton-Kennedy, E.; Soha, A.; Spalding, W. J.; Spiegel, L.; Stoynev, S.; Strait, J.; Strobbe, N.; Taylor, L.; Tkaczyk, S.; Tran, N. V.; Uplegger, L.; Vaandering, E. W.; Vernieri, C.; Verzocchi, M.; Vidal, R.; Wang, M.; Weber, H. A.; Whitbeck, A.; Wu, Y.; Acosta, D.; Avery, P.; Bortignon, P.; Bourilkov, D.; Brinkerhoff, A.; Carnes, A.; Carver, M.; Curry, D.; Das, S.; Field, R. D.; Furic, I. K.; Konigsberg, J.; Korytov, A.; Low, J. F.; Ma, P.; Matchev, K.; Mei, H.; Mitselmakher, G.; Rank, D.; Shchutska, L.; Sperka, D.; Thomas, L.; Wang, J.; Wang, S.; Yelton, J.; Linn, S.; Markowitz, P.; Martinez, G.; Rodriguez, J. L.; Ackert, A.; Adams, T.; Askew, A.; Bein, S.; Hagopian, S.; Hagopian, V.; Johnson, K. F.; Kolberg, T.; Prosper, H.; Santra, A.; Yohay, R.; Baarmand, M. M.; Bhopatkar, V.; Colafranceschi, S.; Hohlmann, M.; Noonan, D.; Roy, T.; Yumiceva, F.; Adams, M. R.; Apanasevich, L.; Berry, D.; Betts, R. R.; Bucinskaite, I.; Cavanaugh, R.; Evdokimov, O.; Gauthier, L.; Gerber, C. E.; Hofman, D. J.; Jung, K.; Sandoval Gonzalez, I. D.; Varelas, N.; Wang, H.; Wu, Z.; Zakaria, M.; Zhang, J.; Bilki, B.; Clarida, W.; Dilsiz, K.; Durgut, S.; Gandrajula, R. P.; Haytmyradov, M.; Khristenko, V.; Merlo, J.-P.; Mermerkaya, H.; Mestvirishvili, A.; Moeller, A.; Nachtman, J.; Ogul, H.; Onel, Y.; Ozok, F.; Penzo, A.; Snyder, C.; Tiras, E.; Wetzel, J.; Yi, K.; Anderson, I.; Blumenfeld, B.; Cocoros, A.; Eminizer, N.; Fehling, D.; Feng, L.; Gritsan, A. V.; Maksimovic, P.; Roskes, J.; Sarica, U.; Swartz, M.; Xiao, M.; Xin, Y.; You, C.; Al-bataineh, A.; Baringer, P.; Bean, A.; Boren, S.; Bowen, J.; Castle, J.; Forthomme, L.; Kenny, R. P.; Khalil, S.; Kropivnitskaya, A.; Majumder, D.; Mcbrayer, W.; Murray, M.; Sanders, S.; Stringer, R.; Tapia Takaki, J. D.; Wang, Q.; Ivanov, A.; Kaadze, K.; Maravin, Y.; Mohammadi, A.; Saini, L. K.; Skhirtladze, N.; Toda, S.; Rebassoo, F.; Wright, D.; Anelli, C.; Baden, A.; Baron, O.; Belloni, A.; Calvert, B.; Eno, S. C.; Ferraioli, C.; Gomez, J. A.; Hadley, N. J.; Jabeen, S.; Jeng, G. Y.; Kellogg, R. G.; Kunkle, J.; Mignerey, A. C.; Ricci-Tam, F.; Shin, Y. H.; Skuja, A.; Tonjes, M. B.; Tonwar, S. C.; Abercrombie, D.; Allen, B.; Apyan, A.; Azzolini, V.; Barbieri, R.; Baty, A.; Bi, R.; Bierwagen, K.; Brandt, S.; Busza, W.; Cali, I. A.; D'Alfonso, M.; Demiragli, Z.; Gomez Ceballos, G.; Goncharov, M.; Hsu, D.; Iiyama, Y.; Innocenti, G. M.; Klute, M.; Kovalskyi, D.; Krajczar, K.; Lai, Y. S.; Lee, Y.-J.; Levin, A.; Luckey, P. D.; Maier, B.; Marini, A. C.; Mcginn, C.; Mironov, C.; Narayanan, S.; Niu, X.; Paus, C.; Roland, C.; Roland, G.; Salfeld-Nebgen, J.; Stephans, G. S. F.; Tatar, K.; Velicanu, D.; Wang, J.; Wang, T. W.; Wyslouch, B.; Benvenuti, A. C.; Chatterjee, R. M.; Evans, A.; Hansen, P.; Kalafut, S.; Kao, S. C.; Kubota, Y.; Lesko, Z.; Mans, J.; Nourbakhsh, S.; Ruckstuhl, N.; Rusack, R.; Tambe, N.; Turkewitz, J.; Acosta, J. G.; Oliveros, S.; Avdeeva, E.; Bloom, K.; Claes, D. R.; Fangmeier, C.; Gonzalez Suarez, R.; Kamalieddin, R.; Kravchenko, I.; Malta Rodrigues, A.; Monroy, J.; Siado, J. E.; Snow, G. R.; Stieger, B.; Alyari, M.; Dolen, J.; Godshalk, A.; Harrington, C.; Iashvili, I.; Kaisen, J.; Nguyen, D.; Parker, A.; Rappoccio, S.; Roozbahani, B.; Alverson, G.; Barberis, E.; Hortiangtham, A.; Massironi, A.; Morse, D. M.; Nash, D.; Orimoto, T.; Teixeira De Lima, R.; Trocino, D.; Wang, R.-J.; Wood, D.; Bhattacharya, S.; Charaf, O.; Hahn, K. A.; Kumar, A.; Mucia, N.; Odell, N.; Pollack, B.; Schmitt, M. H.; Sung, K.; Trovato, M.; Velasco, M.; Dev, N.; Hildreth, M.; Hurtado Anampa, K.; Jessop, C.; Karmgard, D. J.; Kellams, N.; Lannon, K.; Marinelli, N.; Meng, F.; Mueller, C.; Musienko, Y.; Planer, M.; Reinsvold, A.; Ruchti, R.; Rupprecht, N.; Smith, G.; Taroni, S.; Wayne, M.; Wolf, M.; Woodard, A.; Alimena, J.; Antonelli, L.; Bylsma, B.; Durkin, L. S.; Flowers, S.; Francis, B.; Hart, A.; Hill, C.; Hughes, R.; Ji, W.; Liu, B.; Luo, W.; Puigh, D.; Winer, B. L.; Wulsin, H. W.; Cooperstein, S.; Driga, O.; Elmer, P.; Hardenbrook, J.; Hebda, P.; Lange, D.; Luo, J.; Marlow, D.; Medvedeva, T.; Mei, K.; Ojalvo, I.; Olsen, J.; Palmer, C.; Piroué, P.; Stickland, D.; Svyatkovskiy, A.; Tully, C.; Malik, S.; Barker, A.; Barnes, V. E.; Folgueras, S.; Gutay, L.; Jha, M. K.; Jones, M.; Jung, A. W.; Khatiwada, A.; Miller, D. H.; Neumeister, N.; Schulte, J. F.; Shi, X.; Sun, J.; Wang, F.; Xie, W.; Parashar, N.; Stupak, J.; Adair, A.; Akgun, B.; Chen, Z.; Ecklund, K. M.; Geurts, F. J. M.; Guilbaud, M.; Li, W.; Michlin, B.; Northup, M.; Padley, B. P.; Roberts, J.; Rorie, J.; Tu, Z.; Zabel, J.; Betchart, B.; Bodek, A.; de Barbaro, P.; Demina, R.; Duh, Y. t.; Ferbel, T.; Galanti, M.; Garcia-Bellido, A.; Han, J.; Hindrichs, O.; Khukhunaishvili, A.; Lo, K. H.; Tan, P.; Verzetti, M.; Agapitos, A.; Chou, J. P.; Gershtein, Y.; Gómez Espinosa, T. A.; Halkiadakis, E.; Heindl, M.; Hughes, E.; Kaplan, S.; Kunnawalkam Elayavalli, R.; Kyriacou, S.; Lath, A.; Nash, K.; Osherson, M.; Saka, H.; Salur, S.; Schnetzer, S.; Sheffield, D.; Somalwar, S.; Stone, R.; Thomas, S.; Thomassen, P.; Walker, M.; Delannoy, A. G.; Foerster, M.; Heideman, J.; Riley, G.; Rose, K.; Spanier, S.; Thapa, K.; Bouhali, O.; Celik, A.; Dalchenko, M.; De Mattia, M.; Delgado, A.; Dildick, S.; Eusebi, R.; Gilmore, J.; Huang, T.; Juska, E.; Kamon, T.; Mueller, R.; Pakhotin, Y.; Patel, R.; Perloff, A.; Perniè, L.; Rathjens, D.; Safonov, A.; Tatarinov, A.; Ulmer, K. A.; Akchurin, N.; Cowden, C.; Damgov, J.; De Guio, F.; Dragoiu, C.; Dudero, P. R.; Faulkner, J.; Gurpinar, E.; Kunori, S.; Lamichhane, K.; Lee, S. W.; Libeiro, T.; Peltola, T.; Undleeb, S.; Volobouev, I.; Wang, Z.; Greene, S.; Gurrola, A.; Janjam, R.; Johns, W.; Maguire, C.; Melo, A.; Ni, H.; Sheldon, P.; Tuo, S.; Velkovska, J.; Xu, Q.; Arenton, M. W.; Barria, P.; Cox, B.; Goodell, J.; Hirosky, R.; Ledovskoy, A.; Li, H.; Neu, C.; Sinthuprasith, T.; Sun, X.; Wang, Y.; Wolfe, E.; Xia, F.; Clarke, C.; Harr, R.; Karchin, P. E.; Sturdy, J.; Belknap, D. A.; Buchanan, J.; Caillol, C.; Dasu, S.; Dodd, L.; Duric, S.; Gomber, B.; Grothe, M.; Herndon, M.; Hervé, A.; Klabbers, P.; Lanaro, A.; Levine, A.; Long, K.; Loveless, R.; Perry, T.; Pierro, G. A.; Polese, G.; Ruggles, T.; Savin, A.; Smith, N.; Smith, W. H.; Taylor, D.; Woods, N.

2017-05-01

A search for single production of vector-like quarks, T and B, decaying into a Z boson and a top or a bottom quark, respectively, is presented. The search is performed using data collected by the CMS experiment at the LHC in proton-proton collisions at √{s}=13 TeV, corresponding to an integrated luminosity of 2.3fb-1. An exotic T quark production mode through the decay of a heavy Z' resonance is also considered. The search is performed in events with a Z boson decaying leptonically, accompanied by a bottom or a top quark decaying hadronically. No excess of events is observed over the standard model background expectation. Products of production cross section and branching fraction for T and B quarks from 1.26 and 0.13 pb are excluded at 95% confidence level for the range of resonance mass considered, which is between 0.7 and 1.7 TeV. Limits on the product of the Z' boson production cross section and branching fraction, with the Z' boson decaying to the Tt final state, are set between 0.31 and 0.13 pb, for Z' boson masses in the range from 1.5 to 2.5 TeV. This is the first search at 13 TeV for single production of vector-like quarks in events with a Z boson decaying leptonically accompanied by boosted jets. [Figure not available: see fulltext.

Search for single production of vector-like quarks decaying to a Z boson and a top or a bottom quark in proton-proton collisions at $$ \\sqrt{s}=13 $$ TeV

DOE PAGES

Sirunyan, A. M.; Tumasyan, A.; Adam, W.; ...

2017-05-05

A search for single production of vector-like quarks, T and B, decaying into a Z boson and a top or a bottom quark, respectively, is presented. The search is performed using data collected by the CMS experiment at the LHC in proton-proton collisions atmore » $$ \\sqrt{s}=13 $$ TeV, corresponding to an integrated luminosity of 2.3fb$$^{-1}$$. An exotic T quark production mode through the decay of a heavy Z' resonance is also considered. The search is performed in events with a Z boson decaying leptonically, accompanied by a bottom or a top quark decaying hadronically. No excess of events is observed over the standard model background expectation. Products of production cross section and branching fraction for T and B quarks from 1.26 and 0.13 pb are excluded at 95% confidence level for the range of resonance mass considered, which is between 0.7 and 1.7 TeV. Limits on the product of the Z' boson production cross section and branching fraction, with the Z' boson decaying to the Tt final state, are set between 0.31 and 0.13 pb, for Z' boson masses in the range from 1.5 to 2.5 TeV. Finally, this is the first search at 13 TeV for single production of vector-like quarks in events with a Z boson decaying leptonically accompanied by boosted jets.« less

A matrix equation solution by an optimization technique

NASA Technical Reports Server (NTRS)

Johnson, M. J.; Mittra, R.

1972-01-01

The computer solution of matrix equations is often difficult to accomplish due to an ill-conditioned matrix or high noise levels. Two methods of solution are compared for matrices of various degrees of ill-conditioning and for various noise levels in the right hand side vector. One method employs the usual Gaussian elimination. The other solves the equation by an optimization technique and employs a function minimization subroutine.

Field evaluation of picaridin repellents reveals differences in repellent sensitivity between Southeast Asian vectors of malaria and arboviruses.

PubMed

Van Roey, Karel; Sokny, Mao; Denis, Leen; Van den Broeck, Nick; Heng, Somony; Siv, Sovannaroth; Sluydts, Vincent; Sochantha, Tho; Coosemans, Marc; Durnez, Lies

2014-12-01

Scaling up of insecticide treated nets has contributed to a substantial malaria decline. However, some malaria vectors, and most arbovirus vectors, bite outdoors and in the early evening. Therefore, topically applied insect repellents may provide crucial additional protection against mosquito-borne pathogens. Among topical repellents, DEET is the most commonly used, followed by others such as picaridin. The protective efficacy of two formulated picaridin repellents against mosquito bites, including arbovirus and malaria vectors, was evaluated in a field study in Cambodia. Over a period of two years, human landing collections were performed on repellent treated persons, with rotation to account for the effect of collection place, time and individual collector. Based on a total of 4996 mosquitoes collected on negative control persons, the overall five hour protection rate was 97.4% [95%CI: 97.1-97.8%], not decreasing over time. Picaridin 20% performed equally well as DEET 20% and better than picaridin 10%. Repellents performed better against Mansonia and Culex spp. as compared to aedines and anophelines. A lower performance was observed against Aedes albopictus as compared to Aedes aegypti, and against Anopheles barbirostris as compared to several vector species. Parity rates were higher in vectors collected on repellent treated person as compared to control persons. As such, field evaluation shows that repellents can provide additional personal protection against early and outdoor biting malaria and arbovirus vectors, with excellent protection up to five hours after application. The heterogeneity in repellent sensitivity between mosquito genera and vector species could however impact the efficacy of repellents in public health programs. Considering its excellent performance and potential to protect against early and outdoor biting vectors, as well as its higher acceptability as compared to DEET, picaridin is an appropriate product to evaluate the epidemiological impact of large scale use of topical repellents on arthropod borne diseases.

Field Evaluation of Picaridin Repellents Reveals Differences in Repellent Sensitivity between Southeast Asian Vectors of Malaria and Arboviruses

PubMed Central

Denis, Leen; Van den Broeck, Nick; Heng, Somony; Siv, Sovannaroth; Sluydts, Vincent; Sochantha, Tho; Coosemans, Marc; Durnez, Lies

2014-01-01

Scaling up of insecticide treated nets has contributed to a substantial malaria decline. However, some malaria vectors, and most arbovirus vectors, bite outdoors and in the early evening. Therefore, topically applied insect repellents may provide crucial additional protection against mosquito-borne pathogens. Among topical repellents, DEET is the most commonly used, followed by others such as picaridin. The protective efficacy of two formulated picaridin repellents against mosquito bites, including arbovirus and malaria vectors, was evaluated in a field study in Cambodia. Over a period of two years, human landing collections were performed on repellent treated persons, with rotation to account for the effect of collection place, time and individual collector. Based on a total of 4996 mosquitoes collected on negative control persons, the overall five hour protection rate was 97.4% [95%CI: 97.1–97.8%], not decreasing over time. Picaridin 20% performed equally well as DEET 20% and better than picaridin 10%. Repellents performed better against Mansonia and Culex spp. as compared to aedines and anophelines. A lower performance was observed against Aedes albopictus as compared to Aedes aegypti, and against Anopheles barbirostris as compared to several vector species. Parity rates were higher in vectors collected on repellent treated person as compared to control persons. As such, field evaluation shows that repellents can provide additional personal protection against early and outdoor biting malaria and arbovirus vectors, with excellent protection up to five hours after application. The heterogeneity in repellent sensitivity between mosquito genera and vector species could however impact the efficacy of repellents in public health programs. Considering its excellent performance and potential to protect against early and outdoor biting vectors, as well as its higher acceptability as compared to DEET, picaridin is an appropriate product to evaluate the epidemiological impact of large scale use of topical repellents on arthropod borne diseases. PMID:25522134

Semantic graphs and associative memories

NASA Astrophysics Data System (ADS)

Pomi, Andrés; Mizraji, Eduardo

2004-12-01

Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.

Machine vision based quality inspection of flat glass products

NASA Astrophysics Data System (ADS)

Zauner, G.; Schagerl, M.

2014-03-01

This application paper presents a machine vision solution for the quality inspection of flat glass products. A contact image sensor (CIS) is used to generate digital images of the glass surfaces. The presented machine vision based quality inspection at the end of the production line aims to classify five different glass defect types. The defect images are usually characterized by very little `image structure', i.e. homogeneous regions without distinct image texture. Additionally, these defect images usually consist of only a few pixels. At the same time the appearance of certain defect classes can be very diverse (e.g. water drops). We used simple state-of-the-art image features like histogram-based features (std. deviation, curtosis, skewness), geometric features (form factor/elongation, eccentricity, Hu-moments) and texture features (grey level run length matrix, co-occurrence matrix) to extract defect information. The main contribution of this work now lies in the systematic evaluation of various machine learning algorithms to identify appropriate classification approaches for this specific class of images. In this way, the following machine learning algorithms were compared: decision tree (J48), random forest, JRip rules, naive Bayes, Support Vector Machine (multi class), neural network (multilayer perceptron) and k-Nearest Neighbour. We used a representative image database of 2300 defect images and applied cross validation for evaluation purposes.

Method of multivariate spectral analysis

DOEpatents

Keenan, Michael R.; Kotula, Paul G.

2004-01-06

A method of determining the properties of a sample from measured spectral data collected from the sample by performing a multivariate spectral analysis. The method can include: generating a two-dimensional matrix A containing measured spectral data; providing a weighted spectral data matrix D by performing a weighting operation on matrix A; factoring D into the product of two matrices, C and S.sup.T, by performing a constrained alternating least-squares analysis of D=CS.sup.T, where C is a concentration intensity matrix and S is a spectral shapes matrix; unweighting C and S by applying the inverse of the weighting used previously; and determining the properties of the sample by inspecting C and S. This method can be used to analyze X-ray spectral data generated by operating a Scanning Electron Microscope (SEM) with an attached Energy Dispersive Spectrometer (EDS).

Production of τ τ jj final states at the LHC and the TauSpinner algorithm: the spin-2 case

NASA Astrophysics Data System (ADS)

Bahmani, M.; Kalinowski, J.; Kotlarski, W.; Richter-Wąs, E.; Wąs, Z.

2018-01-01

The TauSpinner algorithm is a tool that allows one to modify the physics model of the Monte Carlo generated samples due to the changed assumptions of event production dynamics, but without the need of re-generating events. With the help of weights τ -lepton production or decay processes can be modified accordingly to a new physics model. In a recent paper a new version TauSpinner ver.2.0.0 has been presented which includes a provision for introducing non-standard states and couplings and study their effects in the vector-boson-fusion processes by exploiting the spin correlations of τ -lepton pair decay products in processes where final states include also two hard jets. In the present paper we document how this can be achieved taking as an example the non-standard spin-2 state that couples to Standard Model particles and tree-level matrix elements with complete helicity information included for the parton-parton scattering amplitudes into a τ -lepton pair and two outgoing partons. This implementation is prepared as the external (user-provided) routine for the TauSpinner algorithm. It exploits amplitudes generated by MadGraph5 and adapted to the TauSpinner algorithm format. Consistency tests of the implemented matrix elements, re-weighting algorithm and numerical results for observables sensitive to τ polarisation are presented.

Large Electroweak Corrections to Vector-Boson Scattering at the Large Hadron Collider.

PubMed

Biedermann, Benedikt; Denner, Ansgar; Pellen, Mathieu

2017-06-30

For the first time full next-to-leading-order electroweak corrections to off-shell vector-boson scattering are presented. The computation features the complete matrix elements, including all nonresonant and off-shell contributions, to the electroweak process pp→μ^{+}ν_{μ}e^{+}ν_{e}jj and is fully differential. We find surprisingly large corrections, reaching -16% for the fiducial cross section, as an intrinsic feature of the vector-boson-scattering processes. We elucidate the origin of these large electroweak corrections upon using the double-pole approximation and the effective vector-boson approximation along with leading-logarithmic corrections.

Accuracy and speed in computing the Chebyshev collocation derivative

NASA Technical Reports Server (NTRS)

Don, Wai-Sun; Solomonoff, Alex

1991-01-01

We studied several algorithms for computing the Chebyshev spectral derivative and compare their roundoff error. For a large number of collocation points, the elements of the Chebyshev differentiation matrix, if constructed in the usual way, are not computed accurately. A subtle cause is is found to account for the poor accuracy when computing the derivative by the matrix-vector multiplication method. Methods for accurately computing the elements of the matrix are presented, and we find that if the entities of the matrix are computed accurately, the roundoff error of the matrix-vector multiplication is as small as that of the transform-recursion algorithm. Results of CPU time usage are shown for several different algorithms for computing the derivative by the Chebyshev collocation method for a wide variety of two-dimensional grid sizes on both an IBM and a Cray 2 computer. We found that which algorithm is fastest on a particular machine depends not only on the grid size, but also on small details of the computer hardware as well. For most practical grid sizes used in computation, the even-odd decomposition algorithm is found to be faster than the transform-recursion method.

Detection of LSB+/-1 steganography based on co-occurrence matrix and bit plane clipping

NASA Astrophysics Data System (ADS)

Abolghasemi, Mojtaba; Aghaeinia, Hassan; Faez, Karim; Mehrabi, Mohammad Ali

2010-01-01

Spatial LSB+/-1 steganography changes smooth characteristics between adjoining pixels of the raw image. We present a novel steganalysis method for LSB+/-1 steganography based on feature vectors derived from the co-occurrence matrix in the spatial domain. We investigate how LSB+/-1 steganography affects the bit planes of an image and show that it changes more least significant bit (LSB) planes of it. The co-occurrence matrix is derived from an image in which some of its most significant bit planes are clipped. By this preprocessing, in addition to reducing the dimensions of the feature vector, the effects of embedding were also preserved. We compute the co-occurrence matrix in different directions and with different dependency and use the elements of the resulting co-occurrence matrix as features. This method is sensitive to the data embedding process. We use a Fisher linear discrimination (FLD) classifier and test our algorithm on different databases and embedding rates. We compare our scheme with the current LSB+/-1 steganalysis methods. It is shown that the proposed scheme outperforms the state-of-the-art methods in detecting the LSB+/-1 steganographic method for grayscale images.

Matrix Metallopeptidase 14 Plays an Important Role in Regulating Tumorigenic Gene Expression and Invasion Ability of HeLa Cells.

PubMed

Zhang, Ying-Hui; Wang, Juan-Juan; Li, Min; Zheng, Han-Xi; Xu, Lan; Chen, You-Guo

2016-03-01

The objectives of this study were to investigate the functional effect of matrix metallopeptidase 14 (MMP14) on cell invasion in cervical cancer cells (HeLa line) and to study the underlying molecular mechanisms. Expression vector of short hairpin RNA targeting MMP14 was treated in HeLa cells, and then, transfection efficiency was verified by a florescence microscope. Transwell assay was used to investigate cell invasion ability in HeLa cells. Quantitative polymerase chain reaction and Western blotting analysis were used to detect the expression of MMP14 and relative factors in messenger RNA and protein levels, respectively. Matrix metallopeptidase 14 short hairpin RNA expression vector transfection obviously decreased MMP14 expression in messenger RNA and protein levels. Down-regulation of MMP14 suppressed invasion ability of HeLa cells and reduced transforming growth factor β1 and vascular endothelial growth factor B expressions. Furthermore, MMP14 knockdown decreased bone sialoprotein and enhanced forkhead box protein L2 expression in both RNA and protein levels. Matrix metallopeptidase 14 plays an important role in regulating invasion of HeLa cells. Matrix metallopeptidase 14 knockdown contributes to attenuating the malignant phenotype of cervical cancer cell.

An Improved Adaptive Received Beamforming for Nested Frequency Offset and Nested Array FDA-MIMO Radar.

PubMed

Cheng, Sibei; Zhang, Qingjun; Bian, Mingming; Hao, Xinhong

2018-02-08

For the conventional FDA-MIMO (frequency diversity array multiple-input-multiple-output) Radar with uniform frequency offset and uniform linear array, the DOFs (degrees of freedom) of the adaptive beamformer are limited by the number of elements. A better performance-for example, a better suppression for strong interferences and a more desirable trade-off between the main lobe and side lobe-can be achieved with a greater number of DOFs. In order to obtain larger DOFs, this paper researches the signal model of the FDA-MIMO Radar with nested frequency offset and nested array, then proposes an improved adaptive beamforming method that uses the augmented matrix instead of the covariance matrix to calculate the optimum weight vectors and can be used to improve the output performances of FDA-MIMO Radar with the same element number or reduce the element number while maintain the approximate output performances such as the received beampattern, the main lobe width, side lobe depths and the output SINR (signal-to-interference-noise ratio). The effectiveness of the proposed scheme is verified by simulations.

Volumetric characterization of human patellar cartilage matrix on phase contrast x-ray computed tomography

NASA Astrophysics Data System (ADS)

Abidin, Anas Z.; Nagarajan, Mahesh B.; Checefsky, Walter A.; Coan, Paola; Diemoz, Paul C.; Hobbs, Susan K.; Huber, Markus B.; Wismüller, Axel

2015-03-01

Phase contrast X-ray computed tomography (PCI-CT) has recently emerged as a novel imaging technique that allows visualization of cartilage soft tissue, subsequent examination of chondrocyte patterns, and their correlation to osteoarthritis. Previous studies have shown that 2D texture features are effective at distinguishing between healthy and osteoarthritic regions of interest annotated in the radial zone of cartilage matrix on PCI-CT images. In this study, we further extend the texture analysis to 3D and investigate the ability of volumetric texture features at characterizing chondrocyte patterns in the cartilage matrix for purposes of classification. Here, we extracted volumetric texture features derived from Minkowski Functionals and gray-level co-occurrence matrices (GLCM) from 496 volumes of interest (VOI) annotated on PCI-CT images of human patellar cartilage specimens. The extracted features were then used in a machine-learning task involving support vector regression to classify ROIs as healthy or osteoarthritic. Classification performance was evaluated using the area under the receiver operating characteristic (ROC) curve (AUC). The best classification performance was observed with GLCM features correlation (AUC = 0.83 +/- 0.06) and homogeneity (AUC = 0.82 +/- 0.07), which significantly outperformed all Minkowski Functionals (p < 0.05). These results suggest that such quantitative analysis of chondrocyte patterns in human patellar cartilage matrix involving GLCM-derived statistical features can distinguish between healthy and osteoarthritic tissue with high accuracy.

Breast carcinoma with a predominant duct-replacing component and chondroid matrix production.

PubMed

Tajima, Shogo; Koda, Kenji

2016-12-01

Breast carcinomas that produce chondroid matrix are extremely rare. If the carcinoma is invasive, it is classified as a matrix-producing carcinoma (MPC). Herein, we present a case of a breast carcinoma, which showed duct-replacing growth with chondroid matrix production. A 63-year-old woman underwent fine needle aspiration cytology for suspected malignancy, based on radiological findings. Cellular components showed sufficient atypia to allow a diagnosis of malignancy. A partial mastectomy was performed, and no mass-forming lesion was apparent in the surgically resected specimen. Histopathological examination showed that the carcinoma produced chondroid matrix and grew replacing ducts, which were associated with a small amount of an obvious invasive component without matrix production. Some parts of the duct-replacing component might take the form of expansile invasion due to the absence of residual duct-lining myoepithelial cells; it is difficult to decide whether the duct-replacing component is invasive or not. However, regarding a few tumor nests, they would be recognized as MPC-like intraductal components because of the focal presence of myoepithelial cells around them. Hence, this carcinoma could not be definitely diagnosed as a MPC, even though we believe they are closely related. This is the first reported case of a breast carcinoma displaying duct-replacing growth with chondroid matrix production.

Stage-Structured Population Dynamics of AEDES AEGYPTI

NASA Astrophysics Data System (ADS)

Yusoff, Nuraini; Budin, Harun; Ismail, Salemah

Aedes aegypti is the main vector in the transmission of dengue fever, a vector-borne disease affecting world population living in tropical and sub-tropical countries. Better understanding of the dynamics of its population growth will help in the efforts of controlling the spread of this disease. In looking at the population dynamics of Aedes aegypti, this paper explored the stage-structured modeling of the population growth of the mosquito using the matrix population model. The life cycle of the mosquito was divided into five stages: eggs, larvae, pupae, adult1 and adult2. Developmental rates were obtained for the average Malaysian temperature and these were used in constructing the transition matrix for the matrix model. The model, which was based only on temperature, projected that the population of Aedes aegypti will blow up with time, which is not realistic. For further work, other factors need to be taken into account to obtain a more realistic result.

Imer-product array processor for retrieval of stored images represented by bipolar binary (+1,-1) pixels using partial input trinary pixels represented by (+1,-1)

NASA Technical Reports Server (NTRS)

Liu, Hua-Kuang (Inventor); Awwal, Abdul A. S. (Inventor); Karim, Mohammad A. (Inventor)

1993-01-01

An inner-product array processor is provided with thresholding of the inner product during each iteration to make more significant the inner product employed in estimating a vector to be used as the input vector for the next iteration. While stored vectors and estimated vectors are represented in bipolar binary (1,-1), only those elements of an initial partial input vector that are believed to be common with those of a stored vector are represented in bipolar binary; the remaining elements of a partial input vector are set to 0. This mode of representation, in which the known elements of a partial input vector are in bipolar binary form and the remaining elements are set equal to 0, is referred to as trinary representation. The initial inner products corresponding to the partial input vector will then be equal to the number of known elements. Inner-product thresholding is applied to accelerate convergence and to avoid convergence to a negative input product.

Prototype Automatic Target Screener.

DTIC Science & Technology

1980-05-19

JLIST OF TABLES I Table Page 1 PATS Modules 4 2 Vector Read/Write Command Format ( SEL4 ) 29 1 3 Read Vector Data Command Format ( SEL4 ) 30 J 4 Use Matrix...VECTOR READ/WRITE COMMAND FORMAT ( SEL4 ) S 1,4A Output 15 14 1:3 12 11 10 9 8 7 6 5 4 3 2 1 0 Da taI To VNUM VDIR V LEN InterfaceIT TNT = 1 Intensify...elements ! | 29 I TABLE 3. READ VECTOR DATA COMMAND FORMAT ( SEL4 ) SEL4 Read Vector Data Input 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Da ta D D V To 0 A D

Statistics of partially-polarized fields: beyond the Stokes vector and coherence matrix

NASA Astrophysics Data System (ADS)

Charnotskii, Mikhail

2017-08-01

Traditionally, the partially-polarized light is characterized by the four Stokes parameters. Equivalent description is also provided by correlation tensor of the optical field. These statistics specify only the second moments of the complex amplitudes of the narrow-band two-dimensional electric field of the optical wave. Electric field vector of the random quasi monochromatic wave is a nonstationary oscillating two-dimensional real random variable. We introduce a novel statistical description of these partially polarized waves: the Period-Averaged Probability Density Function (PA-PDF) of the field. PA-PDF contains more information on the polarization state of the field than the Stokes vector. In particular, in addition to the conventional distinction between the polarized and depolarized components of the field PA-PDF allows to separate the coherent and fluctuating components of the field. We present several model examples of the fields with identical Stokes vectors and very distinct shapes of PA-PDF. In the simplest case of the nonstationary, oscillating normal 2-D probability distribution of the real electrical field and stationary 4-D probability distribution of the complex amplitudes, the newly-introduced PA-PDF is determined by 13 parameters that include the first moments and covariance matrix of the quadrature components of the oscillating vector field.

PGRP-LD mediates A. stephensi vector competency by regulating homeostasis of microbiota-induced peritrophic matrix synthesis

PubMed Central

Song, Xiumei; Wang, Mengfei; Dong, Li

2018-01-01

Peptidoglycan recognition proteins (PGRPs) and commensal microbes mediate pathogen infection outcomes in insect disease vectors. Although PGRP-LD is retained in multiple vectors, its role in host defense remains elusive. Here we report that Anopheles stephensi PGRP-LD protects the vector from malaria parasite infection by regulating gut homeostasis. Specifically, knock down of PGRP-LD (dsLD) increased susceptibility to Plasmodium berghei infection, decreased the abundance of gut microbiota and changed their spatial distribution. This outcome resulted from a change in the structural integrity of the peritrophic matrix (PM), which is a chitinous and proteinaceous barrier that lines the midgut lumen. Reduction of microbiota in dsLD mosquitoes due to the upregulation of immune effectors led to dysregulation of PM genes and PM fragmentation. Elimination of gut microbiota in antibiotic treated mosquitoes (Abx) led to PM loss and increased vectorial competence. Recolonization of Abx mosquitoes with indigenous Enterobacter sp. restored PM integrity and decreased mosquito vectorial capacity. Silencing PGRP-LD in mosquitoes without PM didn’t influence their vector competence. Our results indicate that PGPR-LD protects the gut microbiota by preventing hyper-immunity, which in turn promotes PM structurally integrity. The intact PM plays a key role in limiting P. berghei infection. PMID:29489896

Modeling of Mean-VaR portfolio optimization by risk tolerance when the utility function is quadratic

NASA Astrophysics Data System (ADS)

Sukono, Sidi, Pramono; Bon, Abdul Talib bin; Supian, Sudradjat

2017-03-01

The problems of investing in financial assets are to choose a combination of weighting a portfolio can be maximized return expectations and minimizing the risk. This paper discusses the modeling of Mean-VaR portfolio optimization by risk tolerance, when square-shaped utility functions. It is assumed that the asset return has a certain distribution, and the risk of the portfolio is measured using the Value-at-Risk (VaR). So, the process of optimization of the portfolio is done based on the model of Mean-VaR portfolio optimization model for the Mean-VaR done using matrix algebra approach, and the Lagrange multiplier method, as well as Khun-Tucker. The results of the modeling portfolio optimization is in the form of a weighting vector equations depends on the vector mean return vector assets, identities, and matrix covariance between return of assets, as well as a factor in risk tolerance. As an illustration of numeric, analyzed five shares traded on the stock market in Indonesia. Based on analysis of five stocks return data gained the vector of weight composition and graphics of efficient surface of portfolio. Vector composition weighting weights and efficient surface charts can be used as a guide for investors in decisions to invest.

Mathematical Methods for Optical Physics and Engineering

NASA Astrophysics Data System (ADS)

Gbur, Gregory J.

2011-01-01

1. Vector algebra; 2. Vector calculus; 3. Vector calculus in curvilinear coordinate systems; 4. Matrices and linear algebra; 5. Advanced matrix techniques and tensors; 6. Distributions; 7. Infinite series; 8. Fourier series; 9. Complex analysis; 10. Advanced complex analysis; 11. Fourier transforms; 12. Other integral transforms; 13. Discrete transforms; 14. Ordinary differential equations; 15. Partial differential equations; 16. Bessel functions; 17. Legendre functions and spherical harmonics; 18. Orthogonal functions; 19. Green's functions; 20. The calculus of variations; 21. Asymptotic techniques; Appendices; References; Index.

The Cross Product of Two Vectors Is Not Just Another Vector--A Major Misconception Being Perpetuated in Calculus and Vector Analysis Textbooks.

ERIC Educational Resources Information Center

Elk, Seymour B.

1997-01-01

Suggests that the cross product of two vectors can be more easily and accurately explained by starting from the perspective of dyadics because then the concept of vector multiplication has a simple geometrical picture that encompasses both the dot and cross products in any number of dimensions in terms of orthogonal unit vector components. (AIM)

Hill Ciphers over Near-Fields

ERIC Educational Resources Information Center

Farag, Mark

2007-01-01

Hill ciphers are linear codes that use as input a "plaintext" vector [p-right arrow above] of size n, which is encrypted with an invertible n x n matrix E to produce a "ciphertext" vector [c-right arrow above] = E [middle dot] [p-right arrow above]. Informally, a near-field is a triple [left angle bracket]N; +, *[right angle bracket] that…

Variable-speed wind power system with improved energy capture via multilevel conversion

DOEpatents

Erickson, Robert W.; Al-Naseem, Osama A.; Fingersh, Lee Jay

2005-05-31

A system and method for efficiently capturing electrical energy from a variable-speed generator are disclosed. The system includes a matrix converter using full-bridge, multilevel switch cells, in which semiconductor devices are clamped to a known constant DC voltage of a capacitor. The multilevel matrix converter is capable of generating multilevel voltage wave waveform of arbitrary magnitude and frequencies. The matrix converter can be controlled by using space vector modulation.

Confounder Detection in High-Dimensional Linear Models Using First Moments of Spectral Measures.

PubMed

Liu, Furui; Chan, Laiwan

2018-06-12

In this letter, we study the confounder detection problem in the linear model, where the target variable [Formula: see text] is predicted using its [Formula: see text] potential causes [Formula: see text]. Based on an assumption of a rotation-invariant generating process of the model, recent study shows that the spectral measure induced by the regression coefficient vector with respect to the covariance matrix of [Formula: see text] is close to a uniform measure in purely causal cases, but it differs from a uniform measure characteristically in the presence of a scalar confounder. Analyzing spectral measure patterns could help to detect confounding. In this letter, we propose to use the first moment of the spectral measure for confounder detection. We calculate the first moment of the regression vector-induced spectral measure and compare it with the first moment of a uniform spectral measure, both defined with respect to the covariance matrix of [Formula: see text]. The two moments coincide in nonconfounding cases and differ from each other in the presence of confounding. This statistical causal-confounding asymmetry can be used for confounder detection. Without the need to analyze the spectral measure pattern, our method avoids the difficulty of metric choice and multiple parameter optimization. Experiments on synthetic and real data show the performance of this method.

Lentivirus Vectors Incorporating the Immunoglobulin Heavy Chain Enhancer and Matrix Attachment Regions Provide Position-Independent Expression in B Lymphocytes

PubMed Central

Lutzko, Carolyn; Senadheera, Dinithi; Skelton, Dianne; Petersen, Denise; Kohn, Donald B.

2003-01-01

In the present studies we developed lentivirus vectors with regulated, consistent transgene expression in B lymphocytes by incorporating the immunoglobulin heavy chain enhancer (Eμ) with and without associated matrix attachment regions (EμMAR) into lentivirus vectors. Incorporation of these fragments upstream of phosphoglycerate kinase (PGK) or cytomegalovirus promoters resulted in a two- to threefold increase in enhanced green fluorescent protein (EGFP) mean fluorescence intensity (MFI) in B-lymphoid but not T-lymphoid, myeloid, fibroblast, or carcinoma cell lines. A 1-log increase in EGFP expression was observed in B-lymphoid cells (but not myeloid cells) differentiated from human CD34+ progenitors in vitro transduced with Eμ- and EμMAR-containing lentivectors. Lastly, we evaluated the expression from the EμMAR element in mice 2 to 24 weeks posttransplant with transduced hematopoietic stem cells. In mice receiving vectors with the Eμ and EμMAR elements upstream of the PGK promoter, there was a 2- to 10-fold increase in EGFP expression in B cells (but not other cell types). Evaluation of the coefficient of variation of expression among different cell types demonstrated that consistent, position-independent transgene expression was observed exclusively in B cells transduced with the EμMAR-containing vector and not other cells types or vectors. Proviral genomes with the EμMAR element had increased chromatin accessibility, which likely contributed to the position independence of expression in B lymphocytes. In summary, incorporation of the EμMAR element in lentivirus vectors resulted in enhanced, position-independent expression in primary B lymphocytes. These vectors provide a useful tool for the study of B-lymphocyte biology and the development of gene therapy for disorders affecting B lymphocytes, such as immune deficiencies. PMID:12805432

Optical implementation of inner product neural associative memory

NASA Technical Reports Server (NTRS)

Liu, Hua-Kuang (Inventor)

1995-01-01

An optical implementation of an inner-product neural associative memory is realized with a first spatial light modulator for entering an initial two-dimensional N-tuple vector and for entering a thresholded output vector image after each iteration until convergence is reached, and a second spatial light modulator for entering M weighted vectors of inner-product scalars multiplied with each of the M stored vectors, where the inner-product scalars are produced by multiplication of the initial input vector in the first iterative cycle (and thresholded vectors in subsequent iterative cycles) with each of the M stored vectors, and the weighted vectors are produced by multiplication of the scalars with corresponding ones of the stored vectors. A Hughes liquid crystal light valve is used for the dual function of summing the weighted vectors and thresholding the sum vector. The thresholded vector is then entered through the first spatial light modulator for reiteration of the process cycle until convergence is reached.

Measurements of spin alignment of vector mesons and global polarization of hyperons with ALICE at the LHC

NASA Astrophysics Data System (ADS)

Mohanty, Bedangadas

2018-02-01

We present the measurements related to global polarization of Λ hyperons and spin alignment of K*0 vector mesons at mid-rapidity for Pb-Pb collisions at = 2.76 TeV using the ALICE detector at the LHC. The global polarization measurements are carried out with respect to the first order event plane while the spin alignment measurements are carried out with respect to the production plane. No global polarization signal for Λ is observed for 5-15% and 15-50% central Pb-Pb collisions. The spin density matrix element ρ00 is found to have values slightly below ⅓ at low transverse momentum (pT) for K*0 mesons, while it is consistent with ⅓ (no spin alignment) at higher pT. No spin alignment is observed for K*0 in pp collisions at √s = 13 TeV and for the spin zero hadron K0S in 20-40% Pb-Pb collisions at = 2.76 TeV.

Aeroelastic analysis of a troposkien-type wind turbine blade

NASA Technical Reports Server (NTRS)

Nitzsche, F.

1981-01-01

The linear aeroelastic equations for one curved blade of a vertical axis wind turbine in state vector form are presented. The method is based on a simple integrating matrix scheme together with the transfer matrix idea. The method is proposed as a convenient way of solving the associated eigenvalue problem for general support conditions.

The derivative and tangent operators of a motion in Lorentzian space

NASA Astrophysics Data System (ADS)

Durmaz, Olgun; Aktaş, Buşra; Gündoğan, Hali˙t

In this paper, by using Lorentzian matrix multiplication, L-Tangent operator is obtained in Lorentzian space. The L-Tangent operators related with planar, spherical and spatial motion are computed via special matrix groups. L-Tangent operators are related to vectors. Some illustrative examples for applications of L-Tangent operators are also presented.

Robust portfolio selection based on asymmetric measures of variability of stock returns

NASA Astrophysics Data System (ADS)

Chen, Wei; Tan, Shaohua

2009-10-01

This paper addresses a new uncertainty set--interval random uncertainty set for robust optimization. The form of interval random uncertainty set makes it suitable for capturing the downside and upside deviations of real-world data. These deviation measures capture distributional asymmetry and lead to better optimization results. We also apply our interval random chance-constrained programming to robust mean-variance portfolio selection under interval random uncertainty sets in the elements of mean vector and covariance matrix. Numerical experiments with real market data indicate that our approach results in better portfolio performance.

Distorted Character Recognition Via An Associative Neural Network

NASA Astrophysics Data System (ADS)

Messner, Richard A.; Szu, Harold H.

1987-03-01

The purpose of this paper is two-fold. First, it is intended to provide some preliminary results of a character recognition scheme which has foundations in on-going neural network architecture modeling, and secondly, to apply some of the neural network results in a real application area where thirty years of effort has had little effect on providing the machine an ability to recognize distorted objects within the same object class. It is the author's belief that the time is ripe to start applying in ernest the results of over twenty years of effort in neural modeling to some of the more difficult problems which seem so hard to solve by conventional means. The character recognition scheme proposed utilizes a preprocessing stage which performs a 2-dimensional Walsh transform of an input cartesian image field, then sequency filters this spectrum into three feature bands. Various features are then extracted and organized into three sets of feature vectors. These vector patterns that are stored and recalled associatively. Two possible associative neural memory models are proposed for further investigation. The first being an outer-product linear matrix associative memory with a threshold function controlling the strength of the output pattern (similar to Kohonen's crosscorrelation approach [1]). The second approach is based upon a modified version of Grossberg's neural architecture [2] which provides better self-organizing properties due to its adaptive nature. Preliminary results of the sequency filtering and feature extraction preprocessing stage and discussion about the use of the proposed neural architectures is included.

Product-Related Impurities in Clinical-Grade Recombinant AAV Vectors: Characterization and Risk Assessment

PubMed Central

Wright, J. Fraser

2014-01-01

Adeno-associated virus (AAV)-based vectors expressing therapeutic genes continue to demonstrate great promise for the treatment of a wide variety of diseases and together with other gene transfer vectors represent an emerging new therapeutic paradigm comparable in potential impact on human health to that achieved by recombinant proteins and vaccines. A challenge for the current pipeline of AAV-based investigational products as they advance through clinical development is the identification, characterization and lot-to-lot control of the process- and product-related impurities present in even highly purified preparations. Especially challenging are AAV vector product-related impurities that closely resemble the vector itself and are, in some cases, without clear precedent in established biotherapeutic products. The determination of acceptable levels of these impurities in vectors prepared for human clinical product development, with the goal of new product licensure, requires careful risk and feasibility assessment. This review focuses primarily on the AAV product-related impurities that have been described in vectors prepared for clinical development. PMID:28548061

MATIN: a random network coding based framework for high quality peer-to-peer live video streaming.

PubMed

Barekatain, Behrang; Khezrimotlagh, Dariush; Aizaini Maarof, Mohd; Ghaeini, Hamid Reza; Salleh, Shaharuddin; Quintana, Alfonso Ariza; Akbari, Behzad; Cabrera, Alicia Triviño

2013-01-01

In recent years, Random Network Coding (RNC) has emerged as a promising solution for efficient Peer-to-Peer (P2P) video multicasting over the Internet. This probably refers to this fact that RNC noticeably increases the error resiliency and throughput of the network. However, high transmission overhead arising from sending large coefficients vector as header has been the most important challenge of the RNC. Moreover, due to employing the Gauss-Jordan elimination method, considerable computational complexity can be imposed on peers in decoding the encoded blocks and checking linear dependency among the coefficients vectors. In order to address these challenges, this study introduces MATIN which is a random network coding based framework for efficient P2P video streaming. The MATIN includes a novel coefficients matrix generation method so that there is no linear dependency in the generated coefficients matrix. Using the proposed framework, each peer encapsulates one instead of n coefficients entries into the generated encoded packet which results in very low transmission overhead. It is also possible to obtain the inverted coefficients matrix using a bit number of simple arithmetic operations. In this regard, peers sustain very low computational complexities. As a result, the MATIN permits random network coding to be more efficient in P2P video streaming systems. The results obtained from simulation using OMNET++ show that it substantially outperforms the RNC which uses the Gauss-Jordan elimination method by providing better video quality on peers in terms of the four important performance metrics including video distortion, dependency distortion, End-to-End delay and Initial Startup delay.

SPECIAL ISSUE ON OPTICAL PROCESSING OF INFORMATION: Analysis of the precision parameters of an optoelectronic vector-matrix processor of digital information

NASA Astrophysics Data System (ADS)

Odinokov, S. B.; Petrov, A. V.

1995-10-01

Mathematical models of components of a vector-matrix optoelectronic multiplier are considered. Perturbing factors influencing a real optoelectronic system — noise and errors of radiation sources and detectors, nonlinearity of an analogue—digital converter, nonideal optical systems — are taken into account. Analytic expressions are obtained for relating the precision of such a multiplier to the probability of an error amounting to one bit, to the parameters describing the quality of the multiplier components, and to the quality of the optical system of the processor. Various methods of increasing the dynamic range of a multiplier are considered at the technical systems level.

Scattering amplitude and bosonization duality in general Chern-Simons vector models

NASA Astrophysics Data System (ADS)

Yokoyama, Shuichi

2016-09-01

We present the exact large N calculus of four point functions in general Chern-Simons bosonic and fermionic vector models. Applying the LSZ formula to the four point function we determine the two body scattering amplitudes in these theories taking a special care for a non-analytic term to achieve unitarity in the singlet channel. We show that the S-matrix enjoys the bosonization duality, an unusual crossing relation and a non-relativistic reduction to Aharonov-Bohm scattering. We also argue that the S-matrix develops a pole in a certain range of coupling constants, which disappears in the range where the theory reduces to the Chern-Simons theory interacting with free fermions.

A self-recalibration method based on scale-invariant registration for structured light measurement systems

NASA Astrophysics Data System (ADS)

Chen, Rui; Xu, Jing; Zhang, Song; Chen, Heping; Guan, Yong; Chen, Ken

2017-01-01

The accuracy of structured light measurement depends on delicate offline calibration. However, in some practical applications, the system is supposed to be reconfigured so frequently to track the target that an online calibration is required. To this end, this paper proposes a rapid and autonomous self-recalibration method. For the proposed method, first, the rotation matrix and the normalized translation vector are attained from the fundamental matrix; second, the scale factor is acquired based on scale-invariant registration such that the actual translation vector is obtained. Experiments have been conducted to verify the effectiveness of our proposed method and the results indicate a high degree of accuracy.

A new method to real-normalize measured complex modes

NASA Technical Reports Server (NTRS)

Wei, Max L.; Allemang, Randall J.; Zhang, Qiang; Brown, David L.

1987-01-01

A time domain subspace iteration technique is presented to compute a set of normal modes from the measured complex modes. By using the proposed method, a large number of physical coordinates are reduced to a smaller number of model or principal coordinates. Subspace free decay time responses are computed using properly scaled complex modal vectors. Companion matrix for the general case of nonproportional damping is then derived in the selected vector subspace. Subspace normal modes are obtained through eigenvalue solution of the (M sub N) sup -1 (K sub N) matrix and transformed back to the physical coordinates to get a set of normal modes. A numerical example is presented to demonstrate the outlined theory.

Scalar and vector form factors of D →π (K )ℓν decays with Nf=2 +1 +1 twisted fermions

NASA Astrophysics Data System (ADS)

Lubicz, V.; Riggio, L.; Salerno, G.; Simula, S.; Tarantino, C.; ETM Collaboration

2017-09-01

We present a lattice determination of the vector and scalar form factors of the D →π ℓν and D →K ℓν semileptonic decays, which are relevant for the extraction of the CKM matrix elements |Vc d| and |Vc s| from experimental data. Our analysis is based on the gauge configurations produced by the European Twisted Mass Collaboration with Nf=2 +1 +1 flavors of dynamical quarks, at three different values of the lattice spacing (a ≃0.062 ,0.082 ,0.089 fm ) and with pion masses as small as 210 MeV. Quark momenta are injected on the lattice using nonperiodic boundary conditions. The matrix elements of both vector and scalar currents are determined for plenty of kinematical conditions in which parent and child mesons are either moving or at rest. Lorentz symmetry breaking due to hypercubic effects is clearly observed in the data and included in the decomposition of the current matrix elements in terms of additional form factors. After the extrapolations to the physical pion mass and to the continuum limit, we determine the vector and scalar form factors in the whole kinematical region from q2=0 up to qmax2=(MD-Mπ (K ))2 accessible in the experiments, obtaining a good overall agreement with experiments, except in the region at high values of q2 where some deviations are visible. A set of synthetic data points, representing our results for f+Dπ (K )(q2) and f0D π (K )(q2) for several selected values of q2, is provided and also the corresponding covariance matrix is available. At zero four-momentum transfer, we get f+D→π(0 )=0.612 (35 ) and f+D→K(0 )=0.765 (31 ). Using the experimental averages for |Vc d|f+D→π(0 ) and |Vc s|f+D→K(0 ), we extract |Vc d|=0.2330 (137 ) and |Vc s|=0.945 (38 ), respectively. The second row of the CKM matrix is found to be in agreement with unitarity within the current uncertainties: |Vc d|2+|Vc s|2+|Vc b|2=0.949 (78 ).

Apparatus and system for multivariate spectral analysis

DOEpatents

Keenan, Michael R.; Kotula, Paul G.

2003-06-24

An apparatus and system for determining the properties of a sample from measured spectral data collected from the sample by performing a method of multivariate spectral analysis. The method can include: generating a two-dimensional matrix A containing measured spectral data; providing a weighted spectral data matrix D by performing a weighting operation on matrix A; factoring D into the product of two matrices, C and S.sup.T, by performing a constrained alternating least-squares analysis of D=CS.sup.T, where C is a concentration intensity matrix and S is a spectral shapes matrix; unweighting C and S by applying the inverse of the weighting used previously; and determining the properties of the sample by inspecting C and S. This method can be used by a spectrum analyzer to process X-ray spectral data generated by a spectral analysis system that can include a Scanning Electron Microscope (SEM) with an Energy Dispersive Detector and Pulse Height Analyzer.

Automated vector selection of SIVQ and parallel computing integration MATLAB™: Innovations supporting large-scale and high-throughput image analysis studies.

PubMed

Cheng, Jerome; Hipp, Jason; Monaco, James; Lucas, David R; Madabhushi, Anant; Balis, Ulysses J

2011-01-01

Spatially invariant vector quantization (SIVQ) is a texture and color-based image matching algorithm that queries the image space through the use of ring vectors. In prior studies, the selection of one or more optimal vectors for a particular feature of interest required a manual process, with the user initially stochastically selecting candidate vectors and subsequently testing them upon other regions of the image to verify the vector's sensitivity and specificity properties (typically by reviewing a resultant heat map). In carrying out the prior efforts, the SIVQ algorithm was noted to exhibit highly scalable computational properties, where each region of analysis can take place independently of others, making a compelling case for the exploration of its deployment on high-throughput computing platforms, with the hypothesis that such an exercise will result in performance gains that scale linearly with increasing processor count. An automated process was developed for the selection of optimal ring vectors to serve as the predicate matching operator in defining histopathological features of interest. Briefly, candidate vectors were generated from every possible coordinate origin within a user-defined vector selection area (VSA) and subsequently compared against user-identified positive and negative "ground truth" regions on the same image. Each vector from the VSA was assessed for its goodness-of-fit to both the positive and negative areas via the use of the receiver operating characteristic (ROC) transfer function, with each assessment resulting in an associated area-under-the-curve (AUC) figure of merit. Use of the above-mentioned automated vector selection process was demonstrated in two cases of use: First, to identify malignant colonic epithelium, and second, to identify soft tissue sarcoma. For both examples, a very satisfactory optimized vector was identified, as defined by the AUC metric. Finally, as an additional effort directed towards attaining high-throughput capability for the SIVQ algorithm, we demonstrated the successful incorporation of it with the MATrix LABoratory (MATLAB™) application interface. The SIVQ algorithm is suitable for automated vector selection settings and high throughput computation.

Comparison of finite element and transfer matrix methods for numerical investigation of surface plasmon waveguides

NASA Astrophysics Data System (ADS)

Haddouche, Issam; Cherbi, Lynda

2017-01-01

In this paper, we investigate Surface Plasmon Polaritons (SPPs) in the visible regime at a metal/dielectric interface within two different waveguide structures, the first is a Photonic Crystal Fiber where the Full Vector Finite Element Method (FVFEM) is used and the second is a slab waveguide where the transfer matrix method (TMM) is used. Knowing the diversities between the two methods in terms of speed, simplicity, and scope of application, computation is implemented with respect to wavelength and metal layer thickness in order to analyze and compare the performances of the two methods. Simulation results show that the TMM can be a good approximation for the FVFEM and that SPPs behave more like modes propagating in a semi infinite metal/dielectric structure as metal thickness increases from about 150 nm.

Next-to-leading-order electroweak corrections to the production of three charged leptons plus missing energy at the LHC

NASA Astrophysics Data System (ADS)

Biedermann, Benedikt; Denner, Ansgar; Hofer, Lars

2017-10-01

The production of a neutral and a charged vector boson with subsequent decays into three charged leptons and a neutrino is a very important process for precision tests of the Standard Model of elementary particles and in searches for anomalous triple-gauge-boson couplings. In this article, the first computation of next-to-leading-order electroweak corrections to the production of the four-lepton final states μ + μ -e+ ν e, {μ}+{μ}-{e}-{\\overline{ν}}e , μ + μ - μ + ν μ , and {μ}+{μ}-{μ}-{\\overline{ν}}_{μ } at the Large Hadron Collider is presented. We use the complete matrix elements at leading and next-to-leading order, including all off-shell effects of intermediate massive vector bosons and virtual photons. The relative electroweak corrections to the fiducial cross sections from quark-induced partonic processes vary between -3% and -6%, depending significantly on the event selection. At the level of differential distributions, we observe large negative corrections of up to -30% in the high-energy tails of distributions originating from electroweak Sudakov logarithms. Photon-induced contributions at next-to-leading order raise the leading-order fiducial cross section by +2%. Interference effects in final states with equal-flavour leptons are at the permille level for the fiducial cross section, but can lead to sizeable effects in off-shell sensitive phase-space regions.

Melamine detection by mid- and near-infrared (MIR/NIR) spectroscopy: a quick and sensitive method for dairy products analysis including liquid milk, infant formula, and milk powder.

PubMed

Balabin, Roman M; Smirnov, Sergey V

2011-07-15

Melamine (2,4,6-triamino-1,3,5-triazine) is a nitrogen-rich chemical implicated in the pet and human food recalls and in the global food safety scares involving milk products. Due to the serious health concerns associated with melamine consumption and the extensive scope of affected products, rapid and sensitive methods to detect melamine's presence are essential. We propose the use of spectroscopy data-produced by near-infrared (near-IR/NIR) and mid-infrared (mid-IR/MIR) spectroscopies, in particular-for melamine detection in complex dairy matrixes. None of the up-to-date reported IR-based methods for melamine detection has unambiguously shown its wide applicability to different dairy products as well as limit of detection (LOD) below 1 ppm on independent sample set. It was found that infrared spectroscopy is an effective tool to detect melamine in dairy products, such as infant formula, milk powder, or liquid milk. ALOD below 1 ppm (0.76±0.11 ppm) can be reached if a correct spectrum preprocessing (pretreatment) technique and a correct multivariate (MDA) algorithm-partial least squares regression (PLS), polynomial PLS (Poly-PLS), artificial neural network (ANN), support vector regression (SVR), or least squares support vector machine (LS-SVM)-are used for spectrum analysis. The relationship between MIR/NIR spectrum of milk products and melamine content is nonlinear. Thus, nonlinear regression methods are needed to correctly predict the triazine-derivative content of milk products. It can be concluded that mid- and near-infrared spectroscopy can be regarded as a quick, sensitive, robust, and low-cost method for liquid milk, infant formula, and milk powder analysis. Copyright © 2011 Elsevier B.V. All rights reserved.

Development of a sugar-binding residue prediction system from protein sequences using support vector machine.

PubMed

Banno, Masaki; Komiyama, Yusuke; Cao, Wei; Oku, Yuya; Ueki, Kokoro; Sumikoshi, Kazuya; Nakamura, Shugo; Terada, Tohru; Shimizu, Kentaro

2017-02-01

Several methods have been proposed for protein-sugar binding site prediction using machine learning algorithms. However, they are not effective to learn various properties of binding site residues caused by various interactions between proteins and sugars. In this study, we classified sugars into acidic and nonacidic sugars and showed that their binding sites have different amino acid occurrence frequencies. By using this result, we developed sugar-binding residue predictors dedicated to the two classes of sugars: an acid sugar binding predictor and a nonacidic sugar binding predictor. We also developed a combination predictor which combines the results of the two predictors. We showed that when a sugar is known to be an acidic sugar, the acidic sugar binding predictor achieves the best performance, and showed that when a sugar is known to be a nonacidic sugar or is not known to be either of the two classes, the combination predictor achieves the best performance. Our method uses only amino acid sequences for prediction. Support vector machine was used as a machine learning algorithm and the position-specific scoring matrix created by the position-specific iterative basic local alignment search tool was used as the feature vector. We evaluated the performance of the predictors using five-fold cross-validation. We have launched our system, as an open source freeware tool on the GitHub repository (https://doi.org/10.5281/zenodo.61513). Copyright © 2016 The Authors. Published by Elsevier Ltd.. All rights reserved.

Semiblind channel estimation for MIMO-OFDM systems

NASA Astrophysics Data System (ADS)

Chen, Yi-Sheng; Song, Jyu-Han

2012-12-01

This article proposes a semiblind channel estimation method for multiple-input multiple-output orthogonal frequency-division multiplexing systems based on circular precoding. Relying on the precoding scheme at the transmitters, the autocorrelation matrix of the received data induces a structure relating the outer product of the channel frequency response matrix and precoding coefficients. This structure makes it possible to extract information about channel product matrices, which can be used to form a Hermitian matrix whose positive eigenvalues and corresponding eigenvectors yield the channel impulse response matrix. This article also tests the resistance of the precoding design to finite-sample estimation errors, and explores the effects of the precoding scheme on channel equalization by performing pairwise error probability analysis. The proposed method is immune to channel zero locations, and is reasonably robust to channel order overestimation. The proposed method is applicable to the scenarios in which the number of transmitters exceeds that of the receivers. Simulation results demonstrate the performance of the proposed method and compare it with some existing methods.

Production of first generation adenoviral vectors for preclinical protocols: amplification, purification and functional titration.

PubMed

Armendáriz-Borunda, Juan; Bastidas-Ramírez, Blanca Estela; Sandoval-Rodríguez, Ana; González-Cuevas, Jaime; Gómez-Meda, Belinda; García-Bañuelos, Jesús

2011-11-01

Gene therapy represents a promising approach in the treatment of several diseases. Currently, the ideal vector has yet to be designed; though, adenoviral vectors (Ad-v) have provided the most utilized tool for gene transfer due principally to their simple production, among other specific characteristics. Ad-v viability represents a critical variable that may be affected by storage or shipping conditions and therefore it is advisable to be assessed previously to protocol performance. The present work is unique in this matter, as the complete detailed process to obtain Ad-v of preclinical grade is explained. Amplification in permissive HEK-293 cells, purification in CsCl gradients in a period of 10 h, spectrophotometric titration of viral particles (VP) and titration of infectious units (IU), yielding batches of AdβGal, AdGFP, AdHuPA and AdMMP8, of approximately 10¹³-10¹⁴ VP and 10¹²-10¹³ IU were carried out. In vivo functionality of therapeutic AdHuPA and AdMMP8 was evidenced in rats presenting CCl₄-induced fibrosis, as more than 60% of fibrosis was eliminated in livers after systemic delivery through iliac vein in comparison with irrelevant AdβGal. Time required to accomplish the whole Ad-v production steps, including IU titration was 20 to 30 days. We conclude that production of Ad-v following standard operating procedures assuring vector functionality and the possibility to effectively evaluate experimental gene therapy results, leaving aside the use of high-cost commercial kits or sophisticated instrumentation, can be performed in a conventional laboratory of cell culture. Copyright © 2011 The Society for Biotechnology, Japan. Published by Elsevier B.V. All rights reserved.

PI controller design for indirect vector controlled induction motor: A decoupling approach.

PubMed

Jain, Jitendra Kr; Ghosh, Sandip; Maity, Somnath; Dworak, Pawel

2017-09-01

Decoupling of the stator currents is important for smoother torque response of indirect vector controlled induction motors. Typically, feedforward decoupling is used to take care of current coupling that requires exact knowledge of motor parameters, additional circuitry and signal processing. In this paper, a method is proposed to design the regulating proportional-integral gains that minimize coupling without any requirement of the additional decoupler. The variation of the coupling terms for change in load torque is considered as the performance measure. An iterative linear matrix inequality based H ∞ control design approach is used to obtain the controller gains. A comparison between the feedforward and the proposed decoupling schemes is presented through simulation and experimental results. The results show that the proposed scheme is simple yet effective even without additional block or burden on signal processing. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Detrended cross-correlation coefficient: Application to predict apoptosis protein subcellular localization.

PubMed

Liang, Yunyun; Liu, Sanyang; Zhang, Shengli

2016-12-01

Apoptosis, or programed cell death, plays a central role in the development and homeostasis of an organism. Obtaining information on subcellular location of apoptosis proteins is very helpful for understanding the apoptosis mechanism. The prediction of subcellular localization of an apoptosis protein is still a challenging task, and existing methods mainly based on protein primary sequences. In this paper, we introduce a new position-specific scoring matrix (PSSM)-based method by using detrended cross-correlation (DCCA) coefficient of non-overlapping windows. Then a 190-dimensional (190D) feature vector is constructed on two widely used datasets: CL317 and ZD98, and support vector machine is adopted as classifier. To evaluate the proposed method, objective and rigorous jackknife cross-validation tests are performed on the two datasets. The results show that our approach offers a novel and reliable PSSM-based tool for prediction of apoptosis protein subcellular localization. Copyright © 2016 Elsevier Inc. All rights reserved.

Disclosing the Parameters Leading to High Productivity of Retroviral Producer Cells Lines: Evaluating Random Versus Targeted Integration.

PubMed

Bandeira, Vanessa S; Tomás, Hélio A; Alici, Evren; Carrondo, Manuel J T; Coroadinha, Ana S

2017-04-01

Gammaretrovirus and lentivirus are the preferred viral vectors to genetically modify T and natural killer cells to be used in immune cell therapies. The transduction efficiency of hematopoietic and T cells is more efficient using gibbon ape leukemia virus (GaLV) pseudotyping. In this context gammaretroviral vector producer cells offer competitive higher titers than transient lentiviral vectors productions. The main aim of this work was to identify the key parameters governing GaLV-pseudotyped gammaretroviral vector productivity in stable producer cells, using a retroviral vector expression cassette enabling positive (facilitating cell enrichment) and negative cell selection (allowing cell elimination). The retroviral vector contains a thymidine kinase suicide gene fused with a ouabain-resistant Na + ,K + -ATPase gene, a potential safer and faster marker. The establishment of retroviral vector producer cells is traditionally performed by randomly integrating the retroviral vector expression cassette codifying the transgene. More recently, recombinase-mediated cassette exchange methodologies have been introduced to achieve targeted integration. Herein we compared random and targeted integration of the retroviral vector transgene construct. Two retroviral producer cell lines, 293 OuaS and 293 FlexOuaS, were generated by random and targeted integration, respectively, producing high titers (on the order of 10 7 infectious particles·ml -1 ). Results showed that the retroviral vector transgene cassette is the key retroviral vector component determining the viral titers notwithstanding, single-copy integration is sufficient to provide high titers. The expression levels of the three retroviral constructs (gag-pol, GaLV env, and retroviral vector transgene) were analyzed. Although gag-pol and GaLV env gene expression levels should surpass a minimal threshold, we found that relatively modest expression levels of these two expression cassettes are required. Their levels of expression should not be maximized. We concluded, to establish a high producer retroviral vector cell line only the expression level of the genomic retroviral RNA, that is, the retroviral vector transgene cassette, should be maximized, both through (1) the optimization of its design (i.e., genetic elements composition) and (2) the selection of high expressing chromosomal locus for its integration. The use of methodologies identifying and promoting integration into high-expression loci, as targeted integration or high-throughput screening are in this perspective highly valuable.

Analysis of Genetic Algorithm for Rule-Set Production (GARP) modeling approach for predicting distributions of fleas implicated as vectors of plague, Yersinia pestis, in California.

PubMed

Adjemian, Jennifer C Z; Girvetz, Evan H; Beckett, Laurel; Foley, Janet E

2006-01-01

More than 20 species of fleas in California are implicated as potential vectors of Yersinia pestis. Extremely limited spatial data exist for plague vectors-a key component to understanding where the greatest risks for human, domestic animal, and wildlife health exist. This study increases the spatial data available for 13 potential plague vectors by using the ecological niche modeling system Genetic Algorithm for Rule-Set Production (GARP) to predict their respective distributions. Because the available sample sizes in our data set varied greatly from one species to another, we also performed an analysis of the robustness of GARP by using the data available for flea Oropsylla montana (Baker) to quantify the effects that sample size and the chosen explanatory variables have on the final species distribution map. GARP effectively modeled the distributions of 13 vector species. Furthermore, our analyses show that all of these modeled ranges are robust, with a sample size of six fleas or greater not significantly impacting the percentage of the in-state area where the flea was predicted to be found, or the testing accuracy of the model. The results of this study will help guide the sampling efforts of future studies focusing on plague vectors.

An Empirical State Error Covariance Matrix Orbit Determination Example

NASA Technical Reports Server (NTRS)

Frisbee, Joseph H., Jr.

2015-01-01

State estimation techniques serve effectively to provide mean state estimates. However, the state error covariance matrices provided as part of these techniques suffer from some degree of lack of confidence in their ability to adequately describe the uncertainty in the estimated states. A specific problem with the traditional form of state error covariance matrices is that they represent only a mapping of the assumed observation error characteristics into the state space. Any errors that arise from other sources (environment modeling, precision, etc.) are not directly represented in a traditional, theoretical state error covariance matrix. First, consider that an actual observation contains only measurement error and that an estimated observation contains all other errors, known and unknown. Then it follows that a measurement residual (the difference between expected and observed measurements) contains all errors for that measurement. Therefore, a direct and appropriate inclusion of the actual measurement residuals in the state error covariance matrix of the estimate will result in an empirical state error covariance matrix. This empirical state error covariance matrix will fully include all of the errors in the state estimate. The empirical error covariance matrix is determined from a literal reinterpretation of the equations involved in the weighted least squares estimation algorithm. It is a formally correct, empirical state error covariance matrix obtained through use of the average form of the weighted measurement residual variance performance index rather than the usual total weighted residual form. Based on its formulation, this matrix will contain the total uncertainty in the state estimate, regardless as to the source of the uncertainty and whether the source is anticipated or not. It is expected that the empirical error covariance matrix will give a better, statistical representation of the state error in poorly modeled systems or when sensor performance is suspect. In its most straight forward form, the technique only requires supplemental calculations to be added to existing batch estimation algorithms. In the current problem being studied a truth model making use of gravity with spherical, J2 and J4 terms plus a standard exponential type atmosphere with simple diurnal and random walk components is used. The ability of the empirical state error covariance matrix to account for errors is investigated under four scenarios during orbit estimation. These scenarios are: exact modeling under known measurement errors, exact modeling under corrupted measurement errors, inexact modeling under known measurement errors, and inexact modeling under corrupted measurement errors. For this problem a simple analog of a distributed space surveillance network is used. The sensors in this network make only range measurements and with simple normally distributed measurement errors. The sensors are assumed to have full horizon to horizon viewing at any azimuth. For definiteness, an orbit at the approximate altitude and inclination of the International Space Station is used for the study. The comparison analyses of the data involve only total vectors. No investigation of specific orbital elements is undertaken. The total vector analyses will look at the chisquare values of the error in the difference between the estimated state and the true modeled state using both the empirical and theoretical error covariance matrices for each of scenario.

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

PubMed

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

2017-08-02

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

D → π and D → K semileptonic form factors with Nf = 2 + 1 + 1 twisted mass fermions

NASA Astrophysics Data System (ADS)

Lubicz, Vittorio; Riggio, Lorenzo; Salerno, Giorgio; Simula, Silvano; Tarantino, Cecilia

2018-03-01

We present a lattice determination of the vector and scalar form factors of the D → π(K)lv semileptonic decays, which are relevant for the extraction of the CKM matrix elements |Vcd| and |Vcs| from experimental data. Our analysis is based on the gauge configurations produced by the European Twisted Mass Collaboration with Nf = 2 + 1 +1 flavors of dynamical quarks. We simulated at three different values of the lattice spacing and with pion masses as small as 210 MeV. The matrix elements of both vector and scalar currents are determined for a plenty of kinematical conditions in which parent and child mesons are either moving or at rest. Lorentz symmetry breaking due to hypercubic effects is clearly observed in the data and included in the decomposition of the current matrix elements in terms of additional form factors. After the extrapolations to the physical pion mass and to the continuum limit the vector and scalar form factors are determined in the whole kinematical region from q2 = 0 up to qmax2 = (MD - Mπ(K))2 accessible in the experiments, obtaining a good overall agreement with experiments, except in the region at high values of q2 where some deviations are visible.

Determination of Flavonol Aglycones in Ginkgo biloba Dietary Supplement Crude Materials and Finished Products by High-Performance Liquid Chromatography: Single Laboratory Validation

PubMed Central

Gray, Dean; LeVanseler, Kerri; Pan, Meide

2008-01-01

A single laboratory validation (SLV) was completed for a method to determine the flavonol aglycones quercetin, kaempferol, and isorhamnetin in Ginkgo biloba products. The method calculates total glycosides based on these aglycones formed following acid hydrolysis. Nine matrixes were chosen for the study, including crude leaf material, standardized dry powder extract, single and multiple entity finished products, and ethanol and glycerol tinctures. For the 9 matrixes evaluated as part of this SLV, the method appeared to be selective and specific, with no observed interferences. The simplified 60 min oven heating hydrolysis procedure was effective for each of the matrixes studied, with no apparent or consistent differences between 60, 75, and 90 min at 90°C. A Youden ruggedness trial testing 7 factors with the potential to affect quantitative results showed that 2 factors (volume hydrolyzed and test sample extraction/hydrolysis weight) were the most important parameters for control during sample preparation. The method performed well in terms of precision, with 4 matrixes tested in triplicate over a 3-day period showing an overall repeatability (relative standard deviation, RSD) of 2.3%. Analysis of variance testing at α = 0.05 showed no significant differences among the within- or between-group sources of variation, although comparisons of within-day (Sw), between-day (Sb), and total (St) precision showed that a majority of the standard deviation came from within-day determinations for all matrixes. Accuracy testing at 2 levels (approximately 30 and 90% of the determined concentrations in standardized dry powder extract) from 2 complex negative control matrixes showed an overall 96% recovery and RSD of 1.0% for the high spike, and 94% recovery and RSD of 2.5% for the low spike. HorRat scores were within the limits for performance acceptability, ranging from 0.4 to 1.3. Based on the performance results presented herein, it is recommended that this method progress to the collaborative laboratory trial. PMID:16001841

Structuring Stokes correlation functions using vector-vortex beam

NASA Astrophysics Data System (ADS)

Kumar, Vijay; Anwar, Ali; Singh, R. P.

2018-01-01

Higher order statistical correlations of the optical vector speckle field, formed due to scattering of a vector-vortex beam, are explored. Here, we report on the experimental construction of the Stokes parameters covariance matrix, consisting of all possible spatial Stokes parameters correlation functions. We also propose and experimentally realize a new Stokes correlation functions called Stokes field auto correlation functions. It is observed that the Stokes correlation functions of the vector-vortex beam will be reflected in the respective Stokes correlation functions of the corresponding vector speckle field. The major advantage of proposing Stokes correlation functions is that the Stokes correlation function can be easily tuned by manipulating the polarization of vector-vortex beam used to generate vector speckle field and to get the phase information directly from the intensity measurements. Moreover, this approach leads to a complete experimental Stokes characterization of a broad range of random fields.

Vector meson photoproduction with a linearly polarized beam

NASA Astrophysics Data System (ADS)

Mathieu, V.; Nys, J.; Fernández-Ramírez, C.; Jackura, A.; Pilloni, A.; Sherrill, N.; Szczepaniak, A. P.; Fox, G.; Joint Physics Analysis Center

2018-05-01

We propose a model based on Regge theory to describe photoproduction of light vector mesons. We fit the SLAC data and make predictions for the energy and momentum-transfer dependence of the spin-density matrix elements in photoproduction of ω , ρ0 and ϕ mesons at Eγ˜8.5 GeV , which are soon to be measured at Jefferson Lab.

Measurement of vector boson plus D*(2010)+ meson production in p ¯p collisions at √{s }=1.96 TeV

NASA Astrophysics Data System (ADS)

Aaltonen, T.; Amerio, S.; Amidei, D.; Anastassov, A.; Annovi, A.; Antos, J.; Apollinari, G.; Appel, J. A.; Arisawa, T.; Artikov, A.; Asaadi, J.; Ashmanskas, W.; Auerbach, B.; Aurisano, A.; Azfar, F.; Badgett, W.; Bae, T.; Barbaro-Galtieri, A.; Barnes, V. E.; Barnett, B. A.; Barria, P.; Bartos, P.; Bauce, M.; Bedeschi, F.; Behari, S.; Bellettini, G.; Bellinger, J.; Benjamin, D.; Beretvas, A.; Bhatti, A.; Bland, K. R.; Blumenfeld, B.; Bocci, A.; Bodek, A.; Bortoletto, D.; Boudreau, J.; Boveia, A.; Brigliadori, L.; Bromberg, C.; Brucken, E.; Budagov, J.; Budd, H. S.; Burkett, K.; Busetto, G.; Bussey, P.; Butti, P.; Buzatu, A.; Calamba, A.; Camarda, S.; Campanelli, M.; Canelli, F.; Carls, B.; Carlsmith, D.; Carosi, R.; Carrillo, S.; Casal, B.; Casarsa, M.; Castro, A.; Catastini, P.; Cauz, D.; Cavaliere, V.; Cerri, A.; Cerrito, L.; Chen, Y. C.; Chertok, M.; Chiarelli, G.; Chlachidze, G.; Cho, K.; Chokheli, D.; Clark, A.; Clarke, C.; Convery, M. E.; Conway, J.; Corbo, M.; Cordelli, M.; Cox, C. A.; Cox, D. J.; Cremonesi, M.; Cruz, D.; Cuevas, J.; Culbertson, R.; d'Ascenzo, N.; Datta, M.; de Barbaro, P.; Demortier, L.; Deninno, M.; D'Errico, M.; Devoto, F.; Di Canto, A.; Di Ruzza, B.; Dittmann, J. R.; Donati, S.; D'Onofrio, M.; Dorigo, M.; Driutti, A.; Ebina, K.; Edgar, R.; Elagin, A.; Erbacher, R.; Errede, S.; Esham, B.; Farrington, S.; Fernández Ramos, J. P.; Field, R.; Flanagan, G.; Forrest, R.; Franklin, M.; Freeman, J. C.; Frisch, H.; Funakoshi, Y.; Galloni, C.; Garfinkel, A. F.; Garosi, P.; Gerberich, H.; Gerchtein, E.; Giagu, S.; Giakoumopoulou, V.; Gibson, K.; Ginsburg, C. M.; Giokaris, N.; Giromini, P.; Glagolev, V.; Glenzinski, D.; Gold, M.; Goldin, D.; Golossanov, A.; Gomez, G.; Gomez-Ceballos, G.; Goncharov, M.; González López, O.; Gorelov, I.; Goshaw, A. T.; Goulianos, K.; Gramellini, E.; Grosso-Pilcher, C.; Group, R. C.; Guimaraes da Costa, J.; Hahn, S. R.; Han, J. Y.; Happacher, F.; Hara, K.; Hare, M.; Harr, R. F.; Harrington-Taber, T.; Hatakeyama, K.; Hays, C.; Heinrich, J.; Herndon, M.; Hocker, A.; Hong, Z.; Hopkins, W.; Hou, S.; Hughes, R. E.; Husemann, U.; Hussein, M.; Huston, J.; Introzzi, G.; Iori, M.; Ivanov, A.; James, E.; Jang, D.; Jayatilaka, B.; Jeon, E. J.; Jindariani, S.; Jones, M.; Joo, K. K.; Jun, S. Y.; Junk, T. R.; Kambeitz, M.; Kamon, T.; Karchin, P. E.; Kasmi, A.; Kato, Y.; Ketchum, W.; Keung, J.; Kilminster, B.; Kim, D. H.; Kim, H. S.; Kim, J. E.; Kim, M. J.; Kim, S. H.; Kim, S. B.; Kim, Y. J.; Kim, Y. K.; Kimura, N.; Kirby, M.; Knoepfel, K.; Kondo, K.; Kong, D. J.; Konigsberg, J.; Kotwal, A. V.; Kreps, M.; Kroll, J.; Kruse, M.; Kuhr, T.; Kurata, M.; Laasanen, A. T.; Lammel, S.; Lancaster, M.; Lannon, K.; Latino, G.; Lee, H. S.; Lee, J. S.; Leo, S.; Leone, S.; Lewis, J. D.; Limosani, A.; Lipeles, E.; Lister, A.; Liu, H.; Liu, Q.; Liu, T.; Lockwitz, S.; Loginov, A.; Lucchesi, D.; Lucà, A.; Lueck, J.; Lujan, P.; Lukens, P.; Lungu, G.; Lys, J.; Lysak, R.; Madrak, R.; Maestro, P.; Malik, S.; Manca, G.; Manousakis-Katsikakis, A.; Marchese, L.; Margaroli, F.; Marino, P.; Matera, K.; Mattson, M. E.; Mazzacane, A.; Mazzanti, P.; McNulty, R.; Mehta, A.; Mehtala, P.; Mesropian, C.; Miao, T.; Mietlicki, D.; Mitra, A.; Miyake, H.; Moed, S.; Moggi, N.; Moon, C. S.; Moore, R.; Morello, M. J.; Mukherjee, A.; Muller, Th.; Murat, P.; Mussini, M.; Nachtman, J.; Nagai, Y.; Naganoma, J.; Nakano, I.; Napier, A.; Nett, J.; Neu, C.; Nigmanov, T.; Nodulman, L.; Noh, S. Y.; Norniella, O.; Oakes, L.; Oh, S. H.; Oh, Y. D.; Oksuzian, I.; Okusawa, T.; Orava, R.; Ortolan, L.; Pagliarone, C.; Palencia, E.; Palni, P.; Papadimitriou, V.; Parker, W.; Pauletta, G.; Paulini, M.; Paus, C.; Phillips, T. J.; Piacentino, G.; Pianori, E.; Pilot, J.; Pitts, K.; Plager, C.; Pondrom, L.; Poprocki, S.; Potamianos, K.; Pranko, A.; Prokoshin, F.; Ptohos, F.; Punzi, G.; Redondo Fernández, I.; Renton, P.; Rescigno, M.; Rimondi, F.; Ristori, L.; Robson, A.; Rodriguez, T.; Rolli, S.; Ronzani, M.; Roser, R.; Rosner, J. L.; Ruffini, F.; Ruiz, A.; Russ, J.; Rusu, V.; Sakumoto, W. K.; Sakurai, Y.; Santi, L.; Sato, K.; Saveliev, V.; Savoy-Navarro, A.; Schlabach, P.; Schmidt, E. E.; Schwarz, T.; Scodellaro, L.; Scuri, F.; Seidel, S.; Seiya, Y.; Semenov, A.; Sforza, F.; Shalhout, S. Z.; Shears, T.; Shepard, P. F.; Shimojima, M.; Shochet, M.; Shreyber-Tecker, I.; Simonenko, A.; Sliwa, K.; Smith, J. R.; Snider, F. D.; Song, H.; Sorin, V.; Denis, R. St.; Stancari, M.; Stentz, D.; Strologas, J.; Sudo, Y.; Sukhanov, A.; Suslov, I.; Takemasa, K.; Takeuchi, Y.; Tang, J.; Tecchio, M.; Teng, P. K.; Thom, J.; Thomson, E.; Thukral, V.; Toback, D.; Tokar, S.; Tollefson, K.; Tomura, T.; Tonelli, D.; Torre, S.; Torretta, D.; Totaro, P.; Trovato, M.; Ukegawa, F.; Uozumi, S.; Vázquez, F.; Velev, G.; Vellidis, C.; Vernieri, C.; Vidal, M.; Vilar, R.; Vizán, J.; Vogel, M.; Volpi, G.; Wagner, P.; Wallny, R.; Wang, S. M.; Waters, D.; Wester, W. C.; Whiteson, D.; Wicklund, A. B.; Wilbur, S.; Williams, H. H.; Wilson, J. S.; Wilson, P.; Winer, B. L.; Wittich, P.; Wolbers, S.; Wolfe, H.; Wright, T.; Wu, X.; Wu, Z.; Yamamoto, K.; Yamato, D.; Yang, T.; Yang, U. K.; Yang, Y. C.; Yao, W.-M.; Yeh, G. P.; Yi, K.; Yoh, J.; Yorita, K.; Yoshida, T.; Yu, G. B.; Yu, I.; Zanetti, A. M.; Zeng, Y.; Zhou, C.; Zucchelli, S.; CDF Collaboration

2016-03-01

A measurement of vector boson (V ) production in conjunction with a D*(2010)+meson is presented. Using a data sample corresponding to 9.7 fb-1 of proton-antiproton collisions at center-of-mass energy √{s }=1.96 TeV produced by the Fermilab Tevatron, we reconstruct V +D*+ samples with the CDF II detector. The D*+ is fully reconstructed in the D*(2010)+→D0(→K-π+)π+ decay mode. This technique is sensitive to the associated production of vector boson plus charm or bottom mesons. We measure the ratio of production cross sections σ (W +D*)/σ (W )=[1.75 ±0.13 (stat ) ±0.09 (stat ) ]% and σ (Z +D*)/σ (Z )=[1.5 ±0.4 (stat ) ±0.2 (stat ) ]% and perform a differential measurement of d σ (W +D*)/d pT(D*). Event properties are utilized to determine the fraction of V +D*(2010)+ events originating from different production processes. The results are in agreement with the predictions obtained with the pythia program, limiting possible contribution from non-standard-model physics processes.

[Locally weighted least squares estimation of DPOAE evoked by continuously sweeping primaries].

PubMed

Han, Xiaoli; Fu, Xinxing; Cui, Jie; Xiao, Ling

2013-12-01

Distortion product otoacoustic emission (DPOAE) signal can be used for diagnosis of hearing loss so that it has an important clinical value. Continuously using sweeping primaries to measure DPOAE provides an efficient tool to record DPOAE data rapidly when DPOAE is measured in a large frequency range. In this paper, locally weighted least squares estimation (LWLSE) of 2f1-f2 DPOAE is presented based on least-squares-fit (LSF) algorithm, in which DPOAE is evoked by continuously sweeping tones. In our study, we used a weighted error function as the loss function and the weighting matrixes in the local sense to obtain a smaller estimated variance. Firstly, ordinary least squares estimation of the DPOAE parameters was obtained. Then the error vectors were grouped and the different local weighting matrixes were calculated in each group. And finally, the parameters of the DPOAE signal were estimated based on least squares estimation principle using the local weighting matrixes. The simulation results showed that the estimate variance and fluctuation errors were reduced, so the method estimates DPOAE and stimuli more accurately and stably, which facilitates extraction of clearer DPOAE fine structure.

Chimeric Cellulase Matrix for Investigating Intramolecular Synergism between Non-hydrolytic Disruptive Functions of Carbohydrate-binding Modules and Catalytic Hydrolysis*

PubMed Central

Wang, Yuguo; Tang, Rentao; Tao, Jin; Wang, Xiaonan; Zheng, Baisong; Feng, Yan

2012-01-01

The conversion of renewable cellulosic biomass is of considerable interest for the production of biofuels and materials. The bottleneck in the efficient conversion is the compactness and resistance of crystalline cellulose. Carbohydrate-binding modules (CBMs), which disrupt crystalline cellulose via non-hydrolytic mechanisms, are expected to overcome this bottleneck. However, the lack of convenient methods for quantitative analysis of the disruptive functions of CBMs have hindered systematic studies and molecular modifications. Here we established a practical and systematic platform for quantifying and comparing the non-hydrolytic disruptive activities of CBMs via the synergism of CBMs and a catalytic module within designed chimeric cellulase molecules. Bioinformatics and computational biology were also used to provide a deeper understanding. A convenient vector was constructed to serve as a cellulase matrix into which heterologous CBM sequences can be easily inserted. The resulting chimeric cellulases were suitable for studying disruptive functions, and their activities quantitatively reflected the disruptive functions of CBMs on crystalline cellulose. In addition, this cellulase matrix can be used to construct novel chimeric cellulases with high hydrolytic activities toward crystalline cellulose. PMID:22778256

Extended spin symmetry and the standard model

NASA Astrophysics Data System (ADS)

Besprosvany, J.; Romero, R.

2010-12-01

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

Quantum non-Abelian hydrodynamics: Anyonic or spin-orbital entangled liquids, nonunitarity of scattering matrix and charge fractionalization

NASA Astrophysics Data System (ADS)

Pareek, Tribhuvan Prasad

2015-09-01

In this article, we develop an exact (nonadiabatic, nonperturbative) density matrix scattering theory for a two component quantum liquid which interacts or scatters off from a generic spin-dependent quantum potential. The generic spin dependent quantum potential [Eq. (1)] is a matrix potential, hence, adiabaticity criterion is ill-defined. Therefore the full matrix potential should be treated nonadiabatically. We succeed in doing so using the notion of vectorial matrices which allows us to obtain an exact analytical expression for the scattered density matrix (SDM), ϱsc [Eq. (30)]. We find that the number or charge density in scattered fluid, Tr(ϱsc), expressions in Eqs. (32) depends on nontrivial quantum interference coefficients, Qα β 0ijk, which arises due to quantum interference between spin-independent and spin-dependent scattering amplitudes and among spin-dependent scattering amplitudes. Further it is shown that Tr(ϱsc) can be expressed in a compact form [Eq. (39)] where the effect of quantum interference coefficients can be included using a vector Qαβ, which allows us to define a vector order parameterQ. Since the number density is obtained using an exact scattered density matrix, therefore, we do not need to prove that Q is non-zero. However, for sake of completeness, we make detailed mathematical analysis for the conditions under which the vector order parameterQ would be zero or nonzero. We find that in presence of spin-dependent interaction the vector order parameterQ is necessarily nonzero and is related to the commutator and anti-commutator of scattering matrix S with its dagger S† [Eq. (78)]. It is further shown that Q≠0, implies four physically equivalent conditions,i.e., spin-orbital entanglement is nonzero, non-Abelian scattering phase, i.e., matrices, scattering matrix is nonunitary and the broken time reversal symmetry for SDM. This also implies that quasi particle excitation are anyonic in nature, hence, charge fractionalization is a natural consequence. This aspect has also been discussed from the perspective of number or charge density conservation, which implies i.e., Tr(ϱ} sc) = Tr(ϱin). On the other hand Q = 0 turns out to be a mathematically forced unphysical solution in presence of spin-dependent potential or scattering which is equivalent to Abelian hydrodynamics, unitary scattering matrix, absence of spin-space entanglement and preserved time reversal symmetry. We have formulated the theory using mesoscopic language, specifically, we have considered two terminal systems connected to spin-dependent scattering region, which is equivalent to having two potential wells separated by a generic spin-dependent potential barrier. The formulation using mesoscopic language is practically useful because it leads directly to the measured quantities such as conductance and spin-polarization density in the leads, however, the presented formulation is not limited to the mesoscopic system only, its generality has been stressed at various places in this article.

Modeling and parameter identification of impulse response matrix of mechanical systems

NASA Astrophysics Data System (ADS)

Bordatchev, Evgueni V.

1998-12-01

A method for studying the problem of modeling, identification and analysis of mechanical system dynamic characteristic in view of the impulse response matrix for the purpose of adaptive control is developed here. Two types of the impulse response matrices are considered: (i) on displacement, which describes the space-coupled relationship between vectors of the force and simulated displacement, which describes the space-coupled relationship between vectors of the force and simulated displacement and (ii) on acceleration, which also describes the space-coupled relationship between the vectors of the force and measured acceleration. The idea of identification consists of: (a) the practical obtaining of the impulse response matrix on acceleration by 'impact-response' technique; (b) the modeling and parameter estimation of the each impulse response function on acceleration through the fundamental representation of the impulse response function on displacement as a sum of the damped sine curves applying linear and non-linear least square methods; (c) simulating the impulse provides the additional possibility to calculate masses, damper and spring constants. The damped natural frequencies are used as a priori information and are found through the standard FFT analysis. The problem of double numerical integration is avoided by taking two derivations of the fundamental dynamic model of a mechanical system as linear combination of the mass-damper-spring subsystems. The identified impulse response matrix on displacement represents the dynamic properties of the mechanical system. From the engineering point of view, this matrix can be also understood as a 'dynamic passport' of the mechanical system and can be used for dynamic certification and analysis of the dynamic quality. In addition, the suggested approach mathematically reproduces amplitude-frequency response matrix in a low-frequency band and on zero frequency. This allows the possibility of determining the matrix of the static stiffness due to dynamic testing over the time of 10- 15 minutes. As a practical example, the dynamic properties in view of the impulse and frequency response matrices of the lathe spindle are obtained, identified and investigated. The developed approach for modeling and parameter identification appears promising for a wide range o industrial applications; for example, rotary systems.

Quantum Linear System Algorithm for Dense Matrices.

PubMed

Wossnig, Leonard; Zhao, Zhikuan; Prakash, Anupam

2018-02-02

Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix A and a vector b the task is to find the vector x such that Ax=b. We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of O(κ^{2}sqrt[n]polylog(n)/ε) for an n×n dimensional A with bounded spectral norm, where κ denotes the condition number of A, and ε is the desired precision parameter. This amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices, and poses a new state of the art for solving dense linear systems on a quantum computer. Furthermore, an exponential improvement is achievable if the rank of A is polylogarithmic in the matrix dimension. Our algorithm is built upon a singular value estimation subroutine, which makes use of a memory architecture that allows for efficient preparation of quantum states that correspond to the rows of A and the vector of Euclidean norms of the rows of A.

Biquaternion beamspace with its application to vector-sensor array direction findings and polarization estimations

NASA Astrophysics Data System (ADS)

Li, Dan; Xu, Feng; Jiang, Jing Fei; Zhang, Jian Qiu

2017-12-01

In this paper, a biquaternion beamspace, constructed by projecting the original data of an electromagnetic vector-sensor array into a subspace of a lower dimension via a quaternion transformation matrix, is first proposed. To estimate the direction and polarization angles of sources, biquaternion beamspace multiple signal classification (BB-MUSIC) estimators are then formulated. The analytical results show that the biquaternion beamspaces offer us some additional degrees of freedom to simultaneously achieve three goals. One is to save the memory spaces for storing the data covariance matrix and reduce the computation efforts of the eigen-decomposition. Another is to decouple the estimations of the sources' polarization parameters from those of their direction angles. The other is to blindly whiten the coherent noise of the six constituent antennas in each vector-sensor. It is also shown that the existing biquaternion multiple signal classification (BQ-MUSIC) estimator is a specific case of our BB-MUSIC ones. The simulation results verify the correctness and effectiveness of the analytical ones.

A Simple Deep Learning Method for Neuronal Spike Sorting

NASA Astrophysics Data System (ADS)

Yang, Kai; Wu, Haifeng; Zeng, Yu

2017-10-01

Spike sorting is one of key technique to understand brain activity. With the development of modern electrophysiology technology, some recent multi-electrode technologies have been able to record the activity of thousands of neuronal spikes simultaneously. The spike sorting in this case will increase the computational complexity of conventional sorting algorithms. In this paper, we will focus spike sorting on how to reduce the complexity, and introduce a deep learning algorithm, principal component analysis network (PCANet) to spike sorting. The introduced method starts from a conventional model and establish a Toeplitz matrix. Through the column vectors in the matrix, we trains a PCANet, where some eigenvalue vectors of spikes could be extracted. Finally, support vector machine (SVM) is used to sort spikes. In experiments, we choose two groups of simulated data from public databases availably and compare this introduced method with conventional methods. The results indicate that the introduced method indeed has lower complexity with the same sorting errors as the conventional methods.

Virtual world reconstruction using the modeling and simulation extended vector product prototype

DOT National Transportation Integrated Search

1997-05-30

The MS Extended Vector Product (MSEVP) prototype being developed is an extended vector product format-based product containing a continuous surface representation and a consistent view of elevation across the thematic coverages contained within a dat...

International Conference on Materials and Mechanisms of Superconductivity -- High Temperature Superconductors

DTIC Science & Technology

1989-10-01

wide range of Selds and temperatures.’ is the symmetrized two-dimensional strain matrix, A The .L der?.nn criterion assumes wave vector -inde- and A are...plificatioG, especially if fluctuations are important. A then (assuming 2 1 + A >> ) more accurate theory would use wave vector dependent k8 T elastic...with this siri’ M respect to B, H and Ha; the three latter approach; e.g., a possible anisotropy in the vectors are almost the same in"’’e and basal