Formation and emission mechanisms of Ag nanoclusters in the Ar matrix assembly cluster source

NASA Astrophysics Data System (ADS)

Zhao, Junlei; Cao, Lu; Palmer, Richard E.; Nordlund, Kai; Djurabekova, Flyura

2017-11-01

In this paper, we study the mechanisms of growth of Ag nanoclusters in a solid Ar matrix and the emission of these nanoclusters from the matrix by a combination of experimental and theoretical methods. The molecular dynamics simulations show that the cluster growth mechanism can be described as "thermal spike-enhanced clustering" in multiple sequential ion impact events. We further show that experimentally observed large sputtered metal clusters cannot be formed by direct sputtering of Ag mixed in the Ar. Instead, we describe the mechanism of emission of the metal nanocluster that, at first, is formed in the cryogenic matrix due to multiple ion impacts, and then is emitted as a result of the simultaneous effects of interface boiling and spring force. We also develop an analytical model describing this size-dependent cluster emission. The model bridges the atomistic simulations and experimental time and length scales, and allows increasing the controllability of fast generation of nanoclusters in experiments with a high production rate.

A simplified implementation of edge detection in MATLAB is faster and more sensitive than fast fourier transform for actin fiber alignment quantification.

PubMed

Kemeny, Steven Frank; Clyne, Alisa Morss

2011-04-01

Fiber alignment plays a critical role in the structure and function of cells and tissues. While fiber alignment quantification is important to experimental analysis and several different methods for quantifying fiber alignment exist, many studies focus on qualitative rather than quantitative analysis perhaps due to the complexity of current fiber alignment methods. Speed and sensitivity were compared in edge detection and fast Fourier transform (FFT) for measuring actin fiber alignment in cells exposed to shear stress. While edge detection using matrix multiplication was consistently more sensitive than FFT, image processing time was significantly longer. However, when MATLAB functions were used to implement edge detection, MATLAB's efficient element-by-element calculations and fast filtering techniques reduced computation cost 100 times compared to the matrix multiplication edge detection method. The new computation time was comparable to the FFT method, and MATLAB edge detection produced well-distributed fiber angle distributions that statistically distinguished aligned and unaligned fibers in half as many sample images. When the FFT sensitivity was improved by dividing images into smaller subsections, processing time grew larger than the time required for MATLAB edge detection. Implementation of edge detection in MATLAB is simpler, faster, and more sensitive than FFT for fiber alignment quantification.

A fast reconstruction algorithm for fluorescence optical diffusion tomography based on preiteration.

PubMed

Song, Xiaolei; Xiong, Xiaoyun; Bai, Jing

2007-01-01

Fluorescence optical diffusion tomography in the near-infrared (NIR) bandwidth is considered to be one of the most promising ways for noninvasive molecular-based imaging. Many reconstructive approaches to it utilize iterative methods for data inversion. However, they are time-consuming and they are far from meeting the real-time imaging demands. In this work, a fast preiteration algorithm based on the generalized inverse matrix is proposed. This method needs only one step of matrix-vector multiplication online, by pushing the iteration process to be executed offline. In the preiteration process, the second-order iterative format is employed to exponentially accelerate the convergence. Simulations based on an analytical diffusion model show that the distribution of fluorescent yield can be well estimated by this algorithm and the reconstructed speed is remarkably increased.

Limited-memory fast gradient descent method for graph regularized nonnegative matrix factorization.

PubMed

Guan, Naiyang; Wei, Lei; Luo, Zhigang; Tao, Dacheng

2013-01-01

Graph regularized nonnegative matrix factorization (GNMF) decomposes a nonnegative data matrix X[Symbol:see text]R(m x n) to the product of two lower-rank nonnegative factor matrices, i.e.,W[Symbol:see text]R(m x r) and H[Symbol:see text]R(r x n) (r < min {m,n}) and aims to preserve the local geometric structure of the dataset by minimizing squared Euclidean distance or Kullback-Leibler (KL) divergence between X and WH. The multiplicative update rule (MUR) is usually applied to optimize GNMF, but it suffers from the drawback of slow-convergence because it intrinsically advances one step along the rescaled negative gradient direction with a non-optimal step size. Recently, a multiple step-sizes fast gradient descent (MFGD) method has been proposed for optimizing NMF which accelerates MUR by searching the optimal step-size along the rescaled negative gradient direction with Newton's method. However, the computational cost of MFGD is high because 1) the high-dimensional Hessian matrix is dense and costs too much memory; and 2) the Hessian inverse operator and its multiplication with gradient cost too much time. To overcome these deficiencies of MFGD, we propose an efficient limited-memory FGD (L-FGD) method for optimizing GNMF. In particular, we apply the limited-memory BFGS (L-BFGS) method to directly approximate the multiplication of the inverse Hessian and the gradient for searching the optimal step size in MFGD. The preliminary results on real-world datasets show that L-FGD is more efficient than both MFGD and MUR. To evaluate the effectiveness of L-FGD, we validate its clustering performance for optimizing KL-divergence based GNMF on two popular face image datasets including ORL and PIE and two text corpora including Reuters and TDT2. The experimental results confirm the effectiveness of L-FGD by comparing it with the representative GNMF solvers.

Multiple Frequency Contrast Source Inversion Method for Vertical Electromagnetic Profiling: 2D Simulation Results and Analyses

NASA Astrophysics Data System (ADS)

Li, Jinghe; Song, Linping; Liu, Qing Huo

2016-02-01

A simultaneous multiple frequency contrast source inversion (CSI) method is applied to reconstructing hydrocarbon reservoir targets in a complex multilayered medium in two dimensions. It simulates the effects of a salt dome sedimentary formation in the context of reservoir monitoring. In this method, the stabilized biconjugate-gradient fast Fourier transform (BCGS-FFT) algorithm is applied as a fast solver for the 2D volume integral equation for the forward computation. The inversion technique with CSI combines the efficient FFT algorithm to speed up the matrix-vector multiplication and the stable convergence of the simultaneous multiple frequency CSI in the iteration process. As a result, this method is capable of making quantitative conductivity image reconstruction effectively for large-scale electromagnetic oil exploration problems, including the vertical electromagnetic profiling (VEP) survey investigated here. A number of numerical examples have been demonstrated to validate the effectiveness and capacity of the simultaneous multiple frequency CSI method for a limited array view in VEP.

Symmetric nonnegative matrix factorization: algorithms and applications to probabilistic clustering.

PubMed

He, Zhaoshui; Xie, Shengli; Zdunek, Rafal; Zhou, Guoxu; Cichocki, Andrzej

2011-12-01

Nonnegative matrix factorization (NMF) is an unsupervised learning method useful in various applications including image processing and semantic analysis of documents. This paper focuses on symmetric NMF (SNMF), which is a special case of NMF decomposition. Three parallel multiplicative update algorithms using level 3 basic linear algebra subprograms directly are developed for this problem. First, by minimizing the Euclidean distance, a multiplicative update algorithm is proposed, and its convergence under mild conditions is proved. Based on it, we further propose another two fast parallel methods: α-SNMF and β -SNMF algorithms. All of them are easy to implement. These algorithms are applied to probabilistic clustering. We demonstrate their effectiveness for facial image clustering, document categorization, and pattern clustering in gene expression.

Characteristics of Matrix Metals in Which Fast Diffusion of Foreign Metallic Elements Occurs

NASA Astrophysics Data System (ADS)

Mae, Yoshiharu

2018-04-01

A few foreign elements are known to diffuse faster than the self-diffusion of the matrix metal. However, the characteristics of the matrix metal, which contribute to such fast diffusion remain unknown. In this study, the diffusion coefficients of various elements were plotted on a TC-YM diagram. The matrix metals that show fast diffusion are located in the low thermal conductivity range of the TC-YM diagram, while diffuser elements that undergo fast diffusion are mainly gulf elements such as Fe, Ni, Co, Cr, and Cu. The gulf elements are those that show the largest combination of thermal conductivity and Young's modulus. The great difference in the electron mobility between the matrix metal and diffuser elements generates a repulsive force between them, and the repulsive force—acting between the soft and large atoms of the matrix metal and the hard and small atoms of the diffuser elements—deforms the atoms of the matrix metal to open passageways for fast diffusion of diffuser elements.

Preprocessed cumulative reconstructor with domain decomposition: a fast wavefront reconstruction method for pyramid wavefront sensor.

PubMed

Shatokhina, Iuliia; Obereder, Andreas; Rosensteiner, Matthias; Ramlau, Ronny

2013-04-20

We present a fast method for the wavefront reconstruction from pyramid wavefront sensor (P-WFS) measurements. The method is based on an analytical relation between pyramid and Shack-Hartmann sensor (SH-WFS) data. The algorithm consists of two steps--a transformation of the P-WFS data to SH data, followed by the application of cumulative reconstructor with domain decomposition, a wavefront reconstructor from SH-WFS measurements. The closed loop simulations confirm that our method provides the same quality as the standard matrix vector multiplication method. A complexity analysis as well as speed tests confirm that the method is very fast. Thus, the method can be used on extremely large telescopes, e.g., for eXtreme adaptive optics systems.

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

NASA Technical Reports Server (NTRS)

Chew, W. C.; Song, J. M.; Lu, C. C.; Weedon, W. H.

1995-01-01

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

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.

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.

Fast and simple high-capacity quantum cryptography with error detection

PubMed Central

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A.

2017-01-01

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth. PMID:28406240

Fast and simple high-capacity quantum cryptography with error detection.

PubMed

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A

2017-04-13

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

Fast and simple high-capacity quantum cryptography with error detection

NASA Astrophysics Data System (ADS)

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A.

2017-04-01

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

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.

A fast collocation method for a variable-coefficient nonlocal diffusion model

NASA Astrophysics Data System (ADS)

Wang, Che; Wang, Hong

2017-02-01

We develop a fast collocation scheme for a variable-coefficient nonlocal diffusion model, for which a numerical discretization would yield a dense stiffness matrix. The development of the fast method is achieved by carefully handling the variable coefficients appearing inside the singular integral operator and exploiting the structure of the dense stiffness matrix. The resulting fast method reduces the computational work from O (N3) required by a commonly used direct solver to O (Nlog ⁡ N) per iteration and the memory requirement from O (N2) to O (N). Furthermore, the fast method reduces the computational work of assembling the stiffness matrix from O (N2) to O (N). Numerical results are presented to show the utility of the fast method.

Multiple scattering by infinitely long cylindrical glass inclusions in a saturated Biot porous medium of glass beads.

PubMed

Trabelsi, W; Franklin, H; Tinel, A

2016-05-01

The resonance spectrum of sets of two to five infinitely long parallel cylindrical glass inclusions in a fluid saturated porous matrix of unconsolidated glass beads is investigated. The ratio of bead diameters to inclusion diameters is 1/5. The far field form functions and the related phase derivatives are calculated by using an exact multiple scattering formalism and by assuming that the porous medium obeys Biot's model. In order to validate this hypothesis, comparisons between theory and experiments are done in the special case of a fast incident wave on a set of two and three inclusions.

Matrix-Assisted Plasma Atomization Emission Spectrometry for Surface Sampling Elemental Analysis

PubMed Central

Yuan, Xin; Zhan, Xuefang; Li, Xuemei; Zhao, Zhongjun; Duan, Yixiang

2016-01-01

An innovative technology has been developed involving a simple and sensitive optical spectrometric method termed matrix-assisted plasma atomization emission spectrometry (MAPAES) for surface sampling elemental analysis using a piece of filter paper (FP) for sample introduction. MAPAES was carried out by direct interaction of the plasma tail plume with the matrix surface. The FP absorbs energy from the plasma source and releases combustion heating to the analytes originally present on its surface, thus to promote the atomization and excitation process. The matrix-assisted plasma atomization excitation phenomenon was observed for multiple elements. The FP matrix served as the partial energy producer and also the sample substrate to adsorb sample solution. Qualitative and quantitative determinations of metal ions were achieved by atomic emission measurements for elements Ba, Cu, Eu, In, Mn, Ni, Rh and Y. The detection limits were down to pg level with linear correlation coefficients better than 0.99. The proposed MAPAES provides a new way for atomic spectrometry which offers advantages of fast analysis speed, little sample consumption, less sample pretreatment, small size, and cost-effective. PMID:26762972

A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations

NASA Astrophysics Data System (ADS)

Ke, Rihuan; Ng, Michael K.; Sun, Hai-Wei

2015-12-01

In this paper, we study the block lower triangular Toeplitz-like with tri-diagonal blocks system which arises from the time-fractional partial differential equation. Existing fast numerical solver (e.g., fast approximate inversion method) cannot handle such linear system as the main diagonal blocks are different. The main contribution of this paper is to propose a fast direct method for solving this linear system, and to illustrate that the proposed method is much faster than the classical block forward substitution method for solving this linear system. Our idea is based on the divide-and-conquer strategy and together with the fast Fourier transforms for calculating Toeplitz matrix-vector multiplication. The complexity needs O (MNlog2 ⁡ M) arithmetic operations, where M is the number of blocks (the number of time steps) in the system and N is the size (number of spatial grid points) of each block. Numerical examples from the finite difference discretization of time-fractional partial differential equations are also given to demonstrate the efficiency of the proposed method.

Fast and stable algorithms for computing the principal square root of a complex matrix

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Lian, Sui R.; Mcinnis, Bayliss C.

1987-01-01

This note presents recursive algorithms that are rapidly convergent and more stable for finding the principal square root of a complex matrix. Also, the developed algorithms are utilized to derive the fast and stable matrix sign algorithms which are useful in developing applications to control system problems.

Acceleration of the matrix multiplication of Radiance three phase daylighting simulations with parallel computing on heterogeneous hardware of personal computer

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

Zuo, Wangda; McNeil, Andrew; Wetter, Michael

2013-05-23

Building designers are increasingly relying on complex fenestration systems to reduce energy consumed for lighting and HVAC in low energy buildings. Radiance, a lighting simulation program, has been used to conduct daylighting simulations for complex fenestration systems. Depending on the configurations, the simulation can take hours or even days using a personal computer. This paper describes how to accelerate the matrix multiplication portion of a Radiance three-phase daylight simulation by conducting parallel computing on heterogeneous hardware of a personal computer. The algorithm was optimized and the computational part was implemented in parallel using OpenCL. The speed of new approach wasmore » evaluated using various daylighting simulation cases on a multicore central processing unit and a graphics processing unit. Based on the measurements and analysis of the time usage for the Radiance daylighting simulation, further speedups can be achieved by using fast I/O devices and storing the data in a binary format.« less

Computer-intensive simulation of solid-state NMR experiments using SIMPSON.

PubMed

Tošner, Zdeněk; Andersen, Rasmus; Stevensson, Baltzar; Edén, Mattias; Nielsen, Niels Chr; Vosegaard, Thomas

2014-09-01

Conducting large-scale solid-state NMR simulations requires fast computer software potentially in combination with efficient computational resources to complete within a reasonable time frame. Such simulations may involve large spin systems, multiple-parameter fitting of experimental spectra, or multiple-pulse experiment design using parameter scan, non-linear optimization, or optimal control procedures. To efficiently accommodate such simulations, we here present an improved version of the widely distributed open-source SIMPSON NMR simulation software package adapted to contemporary high performance hardware setups. The software is optimized for fast performance on standard stand-alone computers, multi-core processors, and large clusters of identical nodes. We describe the novel features for fast computation including internal matrix manipulations, propagator setups and acquisition strategies. For efficient calculation of powder averages, we implemented interpolation method of Alderman, Solum, and Grant, as well as recently introduced fast Wigner transform interpolation technique. The potential of the optimal control toolbox is greatly enhanced by higher precision gradients in combination with the efficient optimization algorithm known as limited memory Broyden-Fletcher-Goldfarb-Shanno. In addition, advanced parallelization can be used in all types of calculations, providing significant time reductions. SIMPSON is thus reflecting current knowledge in the field of numerical simulations of solid-state NMR experiments. The efficiency and novel features are demonstrated on the representative simulations. Copyright © 2014 Elsevier Inc. All rights reserved.

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.

Membranes for nanometer-scale mass fast transport

DOEpatents

Bakajin, Olgica [San Leandro, CA; Holt, Jason [Berkeley, CA; Noy, Aleksandr [Belmont, CA; Park, Hyung Gyu [Oakland, CA

2011-10-18

Nanoporous membranes comprising single walled, double walled, and multiwalled carbon nanotubes embedded in a matrix material were fabricated for fluid mechanics and mass transfer studies on the nanometer scale and commercial applications. Average pore size can be 2 nm to 20 nm, or seven nm or less, or two nanometers or less. The membrane can be free of large voids spanning the membrane such that transport of material such as gas or liquid occurs exclusively through the tubes. Fast fluid, vapor, and liquid transport are observed. Versatile micromachining methods can be used for membrane fabrication. A single chip can comprise multiple membranes. These membranes are a robust platform for the study of confined molecular transport, with applications in liquid and gas separations and chemical sensing including desalination, dialysis, and fabric formation.

Time evolution of photon-pulse propagation in scattering and absorbing media: The dynamic radiative transfer system

NASA Astrophysics Data System (ADS)

Georgakopoulos, A.; Politopoulos, K.; Georgiou, E.

2018-03-01

A new dynamic-system approach to the problem of radiative transfer inside scattering and absorbing media is presented, directly based on first-hand physical principles. This method, the Dynamic Radiative Transfer System (DRTS), employs a dynamical system formality using a global sparse matrix, which characterizes the physical, optical and geometrical properties of the material-volume of interest. The new system state is generated by the above time-independent matrix, using simple matrix-vector multiplication for each subsequent time step. DRTS is capable of calculating accurately the time evolution of photon propagation in media of complex structure and shape. The flexibility of DRTS allows the integration of time-dependent sources, boundary conditions, different media and several optical phenomena like reflection and refraction in a unified and consistent way. Various examples of DRTS simulation results are presented for ultra-fast light pulse 3-D propagation, demonstrating greatly reduced computational cost and resource requirements compared to other methods.

Efficient estimation of three-dimensional covariance and its application in the analysis of heterogeneous samples in cryo-electron microscopy

PubMed Central

Liao, Hstau Y.; Hashem, Yaser; Frank, Joachim

2015-01-01

Summary Single-particle cryogenic electron microscopy (cryo-EM) is a powerful tool for the study of macromolecular structures at high resolution. Classification allows multiple structural states to be extracted and reconstructed from the same sample. One classification approach is via the covariance matrix, which captures the correlation between every pair of voxels. Earlier approaches employ computing-intensive resampling and estimate only the eigenvectors of the matrix, which are then used in a separate fast classification step. We propose an iterative scheme to explicitly estimate the covariance matrix in its entirety. In our approach, the flexibility in choosing the solution domain allows us to examine a part of the molecule in greater detail. 3D covariance maps obtained in this way from experimental data (cryo-EM images of the eukaryotic pre-initiation complex) prove to be in excellent agreement with conclusions derived by using traditional approaches, revealing in addition the interdependencies of ligand bindings and structural changes. PMID:25982529

Efficient estimation of three-dimensional covariance and its application in the analysis of heterogeneous samples in cryo-electron microscopy.

PubMed

Liao, Hstau Y; Hashem, Yaser; Frank, Joachim

2015-06-02

Single-particle cryogenic electron microscopy (cryo-EM) is a powerful tool for the study of macromolecular structures at high resolution. Classification allows multiple structural states to be extracted and reconstructed from the same sample. One classification approach is via the covariance matrix, which captures the correlation between every pair of voxels. Earlier approaches employ computing-intensive resampling and estimate only the eigenvectors of the matrix, which are then used in a separate fast classification step. We propose an iterative scheme to explicitly estimate the covariance matrix in its entirety. In our approach, the flexibility in choosing the solution domain allows us to examine a part of the molecule in greater detail. Three-dimensional covariance maps obtained in this way from experimental data (cryo-EM images of the eukaryotic pre-initiation complex) prove to be in excellent agreement with conclusions derived by using traditional approaches, revealing in addition the interdependencies of ligand bindings and structural changes. Copyright © 2015 Elsevier Ltd. All rights reserved.

Bit-parallel arithmetic in a massively-parallel associative processor

NASA Technical Reports Server (NTRS)

Scherson, Isaac D.; Kramer, David A.; Alleyne, Brian D.

1992-01-01

A simple but powerful new architecture based on a classical associative processor model is presented. Algorithms for performing the four basic arithmetic operations both for integer and floating point operands are described. For m-bit operands, the proposed architecture makes it possible to execute complex operations in O(m) cycles as opposed to O(m exp 2) for bit-serial machines. A word-parallel, bit-parallel, massively-parallel computing system can be constructed using this architecture with VLSI technology. The operation of this system is demonstrated for the fast Fourier transform and matrix multiplication.

On the Duality of Forward and Inverse Light Transport.

PubMed

Chandraker, Manmohan; Bai, Jiamin; Ng, Tian-Tsong; Ramamoorthi, Ravi

2011-10-01

Inverse light transport seeks to undo global illumination effects, such as interreflections, that pervade images of most scenes. This paper presents the theoretical and computational foundations for inverse light transport as a dual of forward rendering. Mathematically, this duality is established through the existence of underlying Neumann series expansions. Physically, it can be shown that each term of our inverse series cancels an interreflection bounce, just as the forward series adds them. While the convergence properties of the forward series are well known, we show that the oscillatory convergence of the inverse series leads to more interesting conditions on material reflectance. Conceptually, the inverse problem requires the inversion of a large light transport matrix, which is impractical for realistic resolutions using standard techniques. A natural consequence of our theoretical framework is a suite of fast computational algorithms for light transport inversion--analogous to finite element radiosity, Monte Carlo and wavelet-based methods in forward rendering--that rely at most on matrix-vector multiplications. We demonstrate two practical applications, namely, separation of individual bounces of the light transport and fast projector radiometric compensation, to display images free of global illumination artifacts in real-world environments.

Superresolution radar imaging based on fast inverse-free sparse Bayesian learning for multiple measurement vectors

NASA Astrophysics Data System (ADS)

He, Xingyu; Tong, Ningning; Hu, Xiaowei

2018-01-01

Compressive sensing has been successfully applied to inverse synthetic aperture radar (ISAR) imaging of moving targets. By exploiting the block sparse structure of the target image, sparse solution for multiple measurement vectors (MMV) can be applied in ISAR imaging and a substantial performance improvement can be achieved. As an effective sparse recovery method, sparse Bayesian learning (SBL) for MMV involves a matrix inverse at each iteration. Its associated computational complexity grows significantly with the problem size. To address this problem, we develop a fast inverse-free (IF) SBL method for MMV. A relaxed evidence lower bound (ELBO), which is computationally more amiable than the traditional ELBO used by SBL, is obtained by invoking fundamental property for smooth functions. A variational expectation-maximization scheme is then employed to maximize the relaxed ELBO, and a computationally efficient IF-MSBL algorithm is proposed. Numerical results based on simulated and real data show that the proposed method can reconstruct row sparse signal accurately and obtain clear superresolution ISAR images. Moreover, the running time and computational complexity are reduced to a great extent compared with traditional SBL methods.

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.

Developing the fuzzy c-means clustering algorithm based on maximum entropy for multitarget tracking in a cluttered environment

NASA Astrophysics Data System (ADS)

Chen, Xiao; Li, Yaan; Yu, Jing; Li, Yuxing

2018-01-01

For fast and more effective implementation of tracking multiple targets in a cluttered environment, we propose a multiple targets tracking (MTT) algorithm called maximum entropy fuzzy c-means clustering joint probabilistic data association that combines fuzzy c-means clustering and the joint probabilistic data association (PDA) algorithm. The algorithm uses the membership value to express the probability of the target originating from measurement. The membership value is obtained through fuzzy c-means clustering objective function optimized by the maximum entropy principle. When considering the effect of the public measurement, we use a correction factor to adjust the association probability matrix to estimate the state of the target. As this algorithm avoids confirmation matrix splitting, it can solve the high computational load problem of the joint PDA algorithm. The results of simulations and analysis conducted for tracking neighbor parallel targets and cross targets in a different density cluttered environment show that the proposed algorithm can realize MTT quickly and efficiently in a cluttered environment. Further, the performance of the proposed algorithm remains constant with increasing process noise variance. The proposed algorithm has the advantages of efficiency and low computational load, which can ensure optimum performance when tracking multiple targets in a dense cluttered environment.

Robust alignment of chromatograms by statistically analyzing the shifts matrix generated by moving window fast Fourier transform cross-correlation.

PubMed

Zhang, Mingjing; Wen, Ming; Zhang, Zhi-Min; Lu, Hongmei; Liang, Yizeng; Zhan, Dejian

2015-03-01

Retention time shift is one of the most challenging problems during the preprocessing of massive chromatographic datasets. Here, an improved version of the moving window fast Fourier transform cross-correlation algorithm is presented to perform nonlinear and robust alignment of chromatograms by analyzing the shifts matrix generated by moving window procedure. The shifts matrix in retention time can be estimated by fast Fourier transform cross-correlation with a moving window procedure. The refined shift of each scan point can be obtained by calculating the mode of corresponding column of the shifts matrix. This version is simple, but more effective and robust than the previously published moving window fast Fourier transform cross-correlation method. It can handle nonlinear retention time shift robustly if proper window size has been selected. The window size is the only one parameter needed to adjust and optimize. The properties of the proposed method are investigated by comparison with the previous moving window fast Fourier transform cross-correlation and recursive alignment by fast Fourier transform using chromatographic datasets. The pattern recognition results of a gas chromatography mass spectrometry dataset of metabolic syndrome can be improved significantly after preprocessing by this method. Furthermore, the proposed method is available as an open source package at https://github.com/zmzhang/MWFFT2. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Walsh Function Module Users' Manual

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2014-01-01

The solution of partial differential equations (PDEs) with Walsh functions offers new opportunities to simulate many challenging problems in mathematical physics. The approach was developed to better simulate hypersonic flows with shocks on unstructured grids. It is unique in that integrals and derivatives are computed using simple matrix multiplication of series representations of functions without the need for divided differences. The product of any two Walsh functions is another Walsh function - a feature that radically changes an algorithm for solving PDEs. A FORTRAN module for supporting Walsh function simulations is documented. A FORTRAN code is also documented with options for solving time-dependent problems: an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the usage of the Walsh function module including such features as operator overloading, Fast Walsh Transforms in multi-dimensions, and a Fast Walsh reciprocal.

LSRN: A PARALLEL ITERATIVE SOLVER FOR STRONGLY OVER- OR UNDERDETERMINED SYSTEMS*

PubMed Central

Meng, Xiangrui; Saunders, Michael A.; Mahoney, Michael W.

2014-01-01

We describe a parallel iterative least squares solver named LSRN that is based on random normal projection. LSRN computes the min-length solution to minx∈ℝn ‖Ax − b‖2, where A ∈ ℝm × n with m ≫ n or m ≪ n, and where A may be rank-deficient. Tikhonov regularization may also be included. Since A is involved only in matrix-matrix and matrix-vector multiplications, it can be a dense or sparse matrix or a linear operator, and LSRN automatically speeds up when A is sparse or a fast linear operator. The preconditioning phase consists of a random normal projection, which is embarrassingly parallel, and a singular value decomposition of size ⌈γ min(m, n)⌉ × min(m, n), where γ is moderately larger than 1, e.g., γ = 2. We prove that the preconditioned system is well-conditioned, with a strong concentration result on the extreme singular values, and hence that the number of iterations is fully predictable when we apply LSQR or the Chebyshev semi-iterative method. As we demonstrate, the Chebyshev method is particularly efficient for solving large problems on clusters with high communication cost. Numerical results show that on a shared-memory machine, LSRN is very competitive with LAPACK’s DGELSD and a fast randomized least squares solver called Blendenpik on large dense problems, and it outperforms the least squares solver from SuiteSparseQR on sparse problems without sparsity patterns that can be exploited to reduce fill-in. Further experiments show that LSRN scales well on an Amazon Elastic Compute Cloud cluster. PMID:25419094

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.

Linear precoding based on polynomial expansion: reducing complexity in massive MIMO.

PubMed

Mueller, Axel; Kammoun, Abla; Björnson, Emil; Debbah, Mérouane

Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, the computational precoding complexity grows with the system dimensions. For example, the close-to-optimal and relatively "antenna-efficient" regularized zero-forcing (RZF) precoding is very complicated to implement in practice, since it requires fast inversions of large matrices in every coherence period. Motivated by the high performance of RZF, we propose to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol. The degree of the matrix polynomial can be adapted to the available hardware resources and enables smooth transition between simple maximum ratio transmission and more advanced RZF. By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.

BASIC Matrix Operations.

ERIC Educational Resources Information Center

Digital Equipment Corp., Maynard, MA.

The curriculum materials and computer programs in this booklet introduce the idea of a matrix. They go on to discuss matrix operations of addition, subtraction, multiplication by a scalar, and matrix multiplication. The last section covers several contemporary applications of matrix multiplication, including problems of communication…

Fast mean and variance computation of the diffuse sound transmission through finite-sized thick and layered wall and floor systems

NASA Astrophysics Data System (ADS)

Decraene, Carolina; Dijckmans, Arne; Reynders, Edwin P. B.

2018-05-01

A method is developed for computing the mean and variance of the diffuse field sound transmission loss of finite-sized layered wall and floor systems that consist of solid, fluid and/or poroelastic layers. This is achieved by coupling a transfer matrix model of the wall or floor to statistical energy analysis subsystem models of the adjacent room volumes. The modal behavior of the wall is approximately accounted for by projecting the wall displacement onto a set of sinusoidal lateral basis functions. This hybrid modal transfer matrix-statistical energy analysis method is validated on multiple wall systems: a thin steel plate, a polymethyl methacrylate panel, a thick brick wall, a sandwich panel, a double-leaf wall with poro-elastic material in the cavity, and a double glazing. The predictions are compared with experimental data and with results obtained using alternative prediction methods such as the transfer matrix method with spatial windowing, the hybrid wave based-transfer matrix method, and the hybrid finite element-statistical energy analysis method. These comparisons confirm the prediction accuracy of the proposed method and the computational efficiency against the conventional hybrid finite element-statistical energy analysis method.

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.

Exploiting Symmetry on Parallel Architectures.

NASA Astrophysics Data System (ADS)

Stiller, Lewis Benjamin

1995-01-01

This thesis describes techniques for the design of parallel programs that solve well-structured problems with inherent symmetry. Part I demonstrates the reduction of such problems to generalized matrix multiplication by a group-equivariant matrix. Fast techniques for this multiplication are described, including factorization, orbit decomposition, and Fourier transforms over finite groups. Our algorithms entail interaction between two symmetry groups: one arising at the software level from the problem's symmetry and the other arising at the hardware level from the processors' communication network. Part II illustrates the applicability of our symmetry -exploitation techniques by presenting a series of case studies of the design and implementation of parallel programs. First, a parallel program that solves chess endgames by factorization of an associated dihedral group-equivariant matrix is described. This code runs faster than previous serial programs, and discovered it a number of results. Second, parallel algorithms for Fourier transforms for finite groups are developed, and preliminary parallel implementations for group transforms of dihedral and of symmetric groups are described. Applications in learning, vision, pattern recognition, and statistics are proposed. Third, parallel implementations solving several computational science problems are described, including the direct n-body problem, convolutions arising from molecular biology, and some communication primitives such as broadcast and reduce. Some of our implementations ran orders of magnitude faster than previous techniques, and were used in the investigation of various physical phenomena.

Three dimensional time reversal optical tomography

NASA Astrophysics Data System (ADS)

Wu, Binlin; Cai, W.; Alrubaiee, M.; Xu, M.; Gayen, S. K.

2011-03-01

Time reversal optical tomography (TROT) approach is used to detect and locate absorptive targets embedded in a highly scattering turbid medium to assess its potential in breast cancer detection. TROT experimental arrangement uses multi-source probing and multi-detector signal acquisition and Multiple-Signal-Classification (MUSIC) algorithm for target location retrieval. Light transport from multiple sources through the intervening medium with embedded targets to the detectors is represented by a response matrix constructed using experimental data. A TR matrix is formed by multiplying the response matrix by its transpose. The eigenvectors with leading non-zero eigenvalues of the TR matrix correspond to embedded objects. The approach was used to: (a) obtain the location and spatial resolution of an absorptive target as a function of its axial position between the source and detector planes; and (b) study variation in spatial resolution of two targets at the same axial position but different lateral positions. The target(s) were glass sphere(s) of diameter ~9 mm filled with ink (absorber) embedded in a 60 mm-thick slab of Intralipid-20% suspension in water with an absorption coefficient μa ~ 0.003 mm-1 and a transport mean free path lt ~ 1 mm at 790 nm, which emulate the average values of those parameters for human breast tissue. The spatial resolution and accuracy of target location depended on axial position, and target contrast relative to the background. Both the targets could be resolved and located even when they were only 4-mm apart. The TROT approach is fast, accurate, and has the potential to be useful in breast cancer detection and localization.

MALDI imaging mass spectrometry analysis-A new approach for protein mapping in multiple sclerosis brain lesions.

PubMed

Maccarrone, Giuseppina; Nischwitz, Sandra; Deininger, Sören-Oliver; Hornung, Joachim; König, Fatima Barbara; Stadelmann, Christine; Turck, Christoph W; Weber, Frank

2017-03-15

Multiple sclerosis is a disease of the central nervous system characterized by recurrent inflammatory demyelinating lesions in the early disease stage. Lesion formation and mechanisms leading to lesion remyelination are not fully understood. Matrix Assisted Laser Desorption Ionisation Mass Spectrometry imaging (MALDI-IMS) is a technology which analyses proteins and peptides in tissue, preserves their spatial localization, and generates molecular maps within the tissue section. In a pilot study we employed MALDI imaging mass spectrometry to profile and identify peptides and proteins expressed in normal-appearing white matter, grey matter and multiple sclerosis brain lesions with different extents of remyelination. The unsupervised clustering analysis of the mass spectra generated images which reflected the tissue section morphology in luxol fast blue stain and in myelin basic protein immunohistochemistry. Lesions with low remyelination extent were defined by compounds with molecular weight smaller than 5300Da, while more completely remyelinated lesions showed compounds with molecular weights greater than 15,200Da. An in-depth analysis of the mass spectra enabled the detection of cortical lesions which were not seen by routine luxol fast blue histology. An ion mass, mainly distributed at the rim of multiple sclerosis lesions, was identified by liquid chromatography and tandem mass spectrometry as thymosin beta-4, a protein known to be involved in cell migration and in restorative processes. The ion mass of thymosin beta-4 was profiled by MALDI imaging mass spectrometry in brain slides of 12 multiple sclerosis patients and validated by immunohistochemical analysis. In summary, our results demonstrate the ability of the MALDI-IMS technology to map proteins within the brain parenchyma and multiple sclerosis lesions and to identify potential markers involved in multiple sclerosis pathogenesis and/or remyelination. Copyright © 2016 Elsevier B.V. All rights reserved.

A fast pulse design for parallel excitation with gridding conjugate gradient.

PubMed

Feng, Shuo; Ji, Jim

2013-01-01

Parallel excitation (pTx) is recognized as a crucial technique in high field MRI to address the transmit field inhomogeneity problem. However, it can be time consuming to design pTx pulses which is not desirable. In this work, we propose a pulse design with gridding conjugate gradient (CG) based on the small-tip-angle approximation. The two major time consuming matrix-vector multiplications are substituted by two operators which involves with FFT and gridding only. Simulation results have shown that the proposed method is 3 times faster than conventional method and the memory cost is reduced by 1000 times.

$n$ -Dimensional Discrete Cat Map Generation Using Laplace Expansions.

PubMed

Wu, Yue; Hua, Zhongyun; Zhou, Yicong

2016-11-01

Different from existing methods that use matrix multiplications and have high computation complexity, this paper proposes an efficient generation method of n -dimensional ( [Formula: see text]) Cat maps using Laplace expansions. New parameters are also introduced to control the spatial configurations of the [Formula: see text] Cat matrix. Thus, the proposed method provides an efficient way to mix dynamics of all dimensions at one time. To investigate its implementations and applications, we further introduce a fast implementation algorithm of the proposed method with time complexity O(n 4 ) and a pseudorandom number generator using the Cat map generated by the proposed method. The experimental results show that, compared with existing generation methods, the proposed method has a larger parameter space and simpler algorithm complexity, generates [Formula: see text] Cat matrices with a lower inner correlation, and thus yields more random and unpredictable outputs of [Formula: see text] Cat maps.

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

PubMed

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

2008-04-01

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

Fast Algorithms for Structured Least Squares and Total Least Squares Problems

PubMed Central

Kalsi, Anoop; O’Leary, Dianne P.

2006-01-01

We consider the problem of solving least squares problems involving a matrix M of small displacement rank with respect to two matrices Z1 and Z2. We develop formulas for the generators of the matrix M HM in terms of the generators of M and show that the Cholesky factorization of the matrix M HM can be computed quickly if Z1 is close to unitary and Z2 is triangular and nilpotent. These conditions are satisfied for several classes of matrices, including Toeplitz, block Toeplitz, Hankel, and block Hankel, and for matrices whose blocks have such structure. Fast Cholesky factorization enables fast solution of least squares problems, total least squares problems, and regularized total least squares problems involving these classes of matrices. PMID:27274922

Fast Algorithms for Structured Least Squares and Total Least Squares Problems.

PubMed

Kalsi, Anoop; O'Leary, Dianne P

2006-01-01

We consider the problem of solving least squares problems involving a matrix M of small displacement rank with respect to two matrices Z 1 and Z 2. We develop formulas for the generators of the matrix M (H) M in terms of the generators of M and show that the Cholesky factorization of the matrix M (H) M can be computed quickly if Z 1 is close to unitary and Z 2 is triangular and nilpotent. These conditions are satisfied for several classes of matrices, including Toeplitz, block Toeplitz, Hankel, and block Hankel, and for matrices whose blocks have such structure. Fast Cholesky factorization enables fast solution of least squares problems, total least squares problems, and regularized total least squares problems involving these classes of matrices.

MEG source imaging method using fast L1 minimum-norm and its applications to signals with brain noise and human resting-state source amplitude images.

PubMed

Huang, Ming-Xiong; Huang, Charles W; Robb, Ashley; Angeles, AnneMarie; Nichols, Sharon L; Baker, Dewleen G; Song, Tao; Harrington, Deborah L; Theilmann, Rebecca J; Srinivasan, Ramesh; Heister, David; Diwakar, Mithun; Canive, Jose M; Edgar, J Christopher; Chen, Yu-Han; Ji, Zhengwei; Shen, Max; El-Gabalawy, Fady; Levy, Michael; McLay, Robert; Webb-Murphy, Jennifer; Liu, Thomas T; Drake, Angela; Lee, Roland R

2014-01-01

The present study developed a fast MEG source imaging technique based on Fast Vector-based Spatio-Temporal Analysis using a L1-minimum-norm (Fast-VESTAL) and then used the method to obtain the source amplitude images of resting-state magnetoencephalography (MEG) signals for different frequency bands. The Fast-VESTAL technique consists of two steps. First, L1-minimum-norm MEG source images were obtained for the dominant spatial modes of sensor-waveform covariance matrix. Next, accurate source time-courses with millisecond temporal resolution were obtained using an inverse operator constructed from the spatial source images of Step 1. Using simulations, Fast-VESTAL's performance was assessed for its 1) ability to localize multiple correlated sources; 2) ability to faithfully recover source time-courses; 3) robustness to different SNR conditions including SNR with negative dB levels; 4) capability to handle correlated brain noise; and 5) statistical maps of MEG source images. An objective pre-whitening method was also developed and integrated with Fast-VESTAL to remove correlated brain noise. Fast-VESTAL's performance was then examined in the analysis of human median-nerve MEG responses. The results demonstrated that this method easily distinguished sources in the entire somatosensory network. Next, Fast-VESTAL was applied to obtain the first whole-head MEG source-amplitude images from resting-state signals in 41 healthy control subjects, for all standard frequency bands. Comparisons between resting-state MEG sources images and known neurophysiology were provided. Additionally, in simulations and cases with MEG human responses, the results obtained from using conventional beamformer technique were compared with those from Fast-VESTAL, which highlighted the beamformer's problems of signal leaking and distorted source time-courses. © 2013.

MEG Source Imaging Method using Fast L1 Minimum-norm and its Applications to Signals with Brain Noise and Human Resting-state Source Amplitude Images

PubMed Central

Huang, Ming-Xiong; Huang, Charles W.; Robb, Ashley; Angeles, AnneMarie; Nichols, Sharon L.; Baker, Dewleen G.; Song, Tao; Harrington, Deborah L.; Theilmann, Rebecca J.; Srinivasan, Ramesh; Heister, David; Diwakar, Mithun; Canive, Jose M.; Edgar, J. Christopher; Chen, Yu-Han; Ji, Zhengwei; Shen, Max; El-Gabalawy, Fady; Levy, Michael; McLay, Robert; Webb-Murphy, Jennifer; Liu, Thomas T.; Drake, Angela; Lee, Roland R.

2014-01-01

The present study developed a fast MEG source imaging technique based on Fast Vector-based Spatio-Temporal Analysis using a L1-minimum-norm (Fast-VESTAL) and then used the method to obtain the source amplitude images of resting-state magnetoencephalography (MEG) signals for different frequency bands. The Fast-VESTAL technique consists of two steps. First, L1-minimum-norm MEG source images were obtained for the dominant spatial modes of sensor-waveform covariance matrix. Next, accurate source time-courses with millisecond temporal resolution were obtained using an inverse operator constructed from the spatial source images of Step 1. Using simulations, Fast-VESTAL’s performance of was assessed for its 1) ability to localize multiple correlated sources; 2) ability to faithfully recover source time-courses; 3) robustness to different SNR conditions including SNR with negative dB levels; 4) capability to handle correlated brain noise; and 5) statistical maps of MEG source images. An objective pre-whitening method was also developed and integrated with Fast-VESTAL to remove correlated brain noise. Fast-VESTAL’s performance was then examined in the analysis of human mediannerve MEG responses. The results demonstrated that this method easily distinguished sources in the entire somatosensory network. Next, Fast-VESTAL was applied to obtain the first whole-head MEG source-amplitude images from resting-state signals in 41 healthy control subjects, for all standard frequency bands. Comparisons between resting-state MEG sources images and known neurophysiology were provided. Additionally, in simulations and cases with MEG human responses, the results obtained from using conventional beamformer technique were compared with those from Fast-VESTAL, which highlighted the beamformer’s problems of signal leaking and distorted source time-courses. PMID:24055704

UFLC-ESI-MS/MS analysis of multiple mycotoxins in medicinal and edible Areca catechu.

PubMed

Liu, Hongmei; Luo, Jiaoyang; Kong, Weijun; Liu, Qiutao; Hu, Yichen; Yang, Meihua

2016-05-01

A robust, sensitive and reliable ultra fast liquid chromatography combined with electrospray ionization tandem mass spectrometry (UFLC-ESI-MS/MS) was optimized and validated for simultaneous identification and quantification of eleven mycotoxins in medicinal and edible Areca catechu, based on one-step extraction without any further clean-up. Separation and quantification were performed in both positive and negative modes under multiple reaction monitoring (MRM) in a single run with zearalanone (ZAN) as internal standard. The chromatographic conditions and MS/MS parameters were carefully optimized. Matrix-matched calibration was recommended to reduce matrix effects and improve accuracy, showing good linearity within wide concentration ranges. Limits of quantification (LOQ) were lower than 50 μg kg(-1), while limits of detection (LOD) were in the range of 0.1-20 μg kg(-1). The accuracy of the developed method was validated for recoveries, ranging from 85% to 115% with relative standard deviation (RSD) ≤14.87% at low level, from 75% to 119% with RSD ≤ 14.43% at medium level and from 61% to 120% with RSD ≤ 13.18% at high level, respectively. Finally, the developed multi-mycotoxin method was applied for screening of these mycotoxins in 24 commercial samples. Only aflatoxin B2 and zearalenone were found in 2 samples. This is the first report on the application of UFLC-ESI(+/-)-MS/MS for multi-class mycotoxins in A. catechu. The developed method with many advantages of simple pretreatment, rapid determination and high sensitivity is a proposed candidate for large-scale detection and quantification of multiple mycotoxins in other complex matrixes. Copyright © 2016 Elsevier Ltd. All rights reserved.

Matrix multiplication operations with data pre-conditioning in a high performance computing architecture

DOEpatents

Eichenberger, Alexandre E; Gschwind, Michael K; Gunnels, John A

2013-11-05

Mechanisms for performing matrix multiplication operations with data pre-conditioning in a high performance computing architecture are provided. A vector load operation is performed to load a first vector operand of the matrix multiplication operation to a first target vector register. A load and splat operation is performed to load an element of a second vector operand and replicating the element to each of a plurality of elements of a second target vector register. A multiply add operation is performed on elements of the first target vector register and elements of the second target vector register to generate a partial product of the matrix multiplication operation. The partial product of the matrix multiplication operation is accumulated with other partial products of the matrix multiplication operation.

Fast-SNP: a fast matrix pre-processing algorithm for efficient loopless flux optimization of metabolic models

PubMed Central

Saa, Pedro A.; Nielsen, Lars K.

2016-01-01

Motivation: Computation of steady-state flux solutions in large metabolic models is routinely performed using flux balance analysis based on a simple LP (Linear Programming) formulation. A minimal requirement for thermodynamic feasibility of the flux solution is the absence of internal loops, which are enforced using ‘loopless constraints’. The resulting loopless flux problem is a substantially harder MILP (Mixed Integer Linear Programming) problem, which is computationally expensive for large metabolic models. Results: We developed a pre-processing algorithm that significantly reduces the size of the original loopless problem into an easier and equivalent MILP problem. The pre-processing step employs a fast matrix sparsification algorithm—Fast- sparse null-space pursuit (SNP)—inspired by recent results on SNP. By finding a reduced feasible ‘loop-law’ matrix subject to known directionalities, Fast-SNP considerably improves the computational efficiency in several metabolic models running different loopless optimization problems. Furthermore, analysis of the topology encoded in the reduced loop matrix enabled identification of key directional constraints for the potential permanent elimination of infeasible loops in the underlying model. Overall, Fast-SNP is an effective and simple algorithm for efficient formulation of loop-law constraints, making loopless flux optimization feasible and numerically tractable at large scale. Availability and Implementation: Source code for MATLAB including examples is freely available for download at http://www.aibn.uq.edu.au/cssb-resources under Software. Optimization uses Gurobi, CPLEX or GLPK (the latter is included with the algorithm). Contact: lars.nielsen@uq.edu.au Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27559155

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

Determination of the self-adjoint matrix Schrödinger operators without the bound state data

NASA Astrophysics Data System (ADS)

Xu, Xiao-Chuan; Yang, Chuan-Fu

2018-06-01

(i) For the matrix Schrödinger operator on the half line, it is shown that the scattering data, which consists of the scattering matrix and the bound state data, uniquely determines the potential and the boundary condition. It is also shown that only the scattering matrix uniquely determines the self-adjoint potential and the boundary condition if either the potential exponentially decreases fast enough or the potential is known a priori on (), where a is an any fixed positive number. (ii) For the matrix Schrödinger operator on the full line, it is shown that the left (or right) reflection coefficient uniquely determine the self-adjoint potential if either the potential exponentially decreases fast enough or the potential is known a priori on (or ()), where b is an any fixed number.

System and plastic scintillator for discrimination of thermal neutron, fast neutron, and gamma radiation

DOEpatents

Zaitseva, Natalia P.; Carman, M. Leslie; Faust, Michelle A.; Glenn, Andrew M.; Martinez, H. Paul; Pawelczak, Iwona A.; Payne, Stephen A.

2017-05-16

A scintillator material according to one embodiment includes a polymer matrix; a primary dye in the polymer matrix, the primary dye being a fluorescent dye, the primary dye being present in an amount of 3 wt % or more; and at least one component in the polymer matrix, the component being selected from a group consisting of B, Li, Gd, a B-containing compound, a Li-containing compound and a Gd-containing compound, wherein the scintillator material exhibits an optical response signature for thermal neutrons that is different than an optical response signature for fast neutrons and gamma rays. A system according to one embodiment includes a scintillator material as disclosed herein and a photodetector for detecting the response of the material to fast neutron, thermal neutron and gamma ray irradiation.

Combined fast multipole-QR compression technique for solving electrically small to large structures for broadband applications

NASA Technical Reports Server (NTRS)

Jandhyala, Vikram (Inventor); Chowdhury, Indranil (Inventor)

2011-01-01

An approach that efficiently solves for a desired parameter of a system or device that can include both electrically large fast multipole method (FMM) elements, and electrically small QR elements. The system or device is setup as an oct-tree structure that can include regions of both the FMM type and the QR type. An iterative solver is then used to determine a first matrix vector product for any electrically large elements, and a second matrix vector product for any electrically small elements that are included in the structure. These matrix vector products for the electrically large elements and the electrically small elements are combined, and a net delta for a combination of the matrix vector products is determined. The iteration continues until a net delta is obtained that is within predefined limits. The matrix vector products that were last obtained are used to solve for the desired parameter.

Catalytic Fast Pyrolysis of Cellulose Using Nano Zeolite and Zeolite/Matrix Catalysts in a GC/Micro-Pyrolyzer.

PubMed

Lee, Kyong-Hwan

2016-05-01

Cellulose, as a model compound of biomass, was catalyzed over zeolite (HY,.HZSM-5) and zeolite/matrix (HY/Clay, HM/Clay) in a GC/micro-pyrolyzer at 500 degrees C, to produce the valuable products. The catalysts used were pure zeolite and zeolite/matrix including 20 wt% matrix content, which were prepared into different particle sizes (average size; 0.1 mm, 1.6 mm) to study the effect of the particle size of the catalyst for the distribution of product yields. Catalytic pyrolysis had much more volatile products as light components and less content of sugars than pyrolysis only. This phenomenon was strongly influenced by the particle size of the catalyst in catalytic fast pyrolysis. Also, in zeolite and zeolite/matrix catalysts the zeolite type gave the dominant impact on the distribution of product yields.

On the physics of unstable infiltration, seepage, and gravity drainage in partially saturated tuffs

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

Faybishenko, B.; Bodvarsson, G.S.; Salve, R.

2002-04-01

To improve understanding of the physics of dynamic instabilities in unsaturated flow processes within the Paintbrush nonwelded unit (PTn) and the middle nonlithophysal portion of the Tonopah Spring welded tuff unit (TSw) of Yucca Mountain, we analyzed data from a series of infiltration tests carried out at two sites (Alcove 4 and Alcove 6) in the Exploratory Studies Facility, using analytical and empirical functions. The analysis of infiltration rates measured at both sites showed three temporal scales of infiltration rate: (1) a macro-scale trend of overall decreasing flow, (2) a meso-scale trend of fast and slow motion exhibiting three-stage variationsmore » of the flow rate (decreasing, increasing, and [again] decreasing flow rate, as observed in soils in the presence of entrapped air), and (3) micro-scale (high frequency) fluctuations. Infiltration tests in the nonwelded unit at Alcove 4 indicate that this unit may effectively dampen episodic fast infiltration events; however, well-known Kostyakov, Horton, and Philip equations do not satisfactorily describe the observed trends of the infiltration rate. Instead, a Weibull distribution model can most accurately describe experimentally determined time trends of the infiltration rate. Infiltration tests in highly permeable, fractured, welded tuff at Alcove 6 indicate that the infiltration rate exhibits pulsation, which may have been caused by multiple threshold effects and water-air redistribution between fractures and matrix. The empirical relationships between the extrinsic seepage from fractures, matrix imbibition, and gravity drainage versus the infiltration rate, as well as scaling and self-similarity for the leading edge of the water front are the hallmark of the nonlinear dynamic processes in water flow under episodic infiltration through fractured tuff. Based on the analysis of experimental data, we propose a conceptual model of a dynamic fracture flow and fracture-matrix interaction in fractured tuff, incorporating the time dependent processes of water redistribution in the fracture-matrix system.« less

Matrix multiplication on the Intel Touchstone Delta

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

Huss-Lederman, S.; Jacobson, E.M.; Tsao, A.

1993-12-31

Matrix multiplication is a key primitive in block matrix algorithms such as those found in LAPACK. We present results from our study of matrix multiplication algorithms on the Intel Touchstone Delta, a distributed memory message-passing architecture with a two-dimensional mesh topology. We obtain an implementation that uses communication primitives highly suited to the Delta and exploits the single node assembly-coded matrix multiplication. Our algorithm is completely general, able to deal with arbitrary mesh aspect ratios and matrix dimensions, and has achieved parallel efficiency of 86% with overall peak performance in excess of 8 Gflops on 256 nodes for an 8800more » {times} 8800 matrix. We describe our algorithm design and implementation, and present performance results that demonstrate scalability and robust behavior over varying mesh topologies.« less

Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

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

Deveci, Mehmet; Trott, Christian Robert; Rajamanickam, Sivasankaran

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and datamore » structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.« less

Multi-threaded Sparse Matrix-Matrix Multiplication for Many-Core and GPU Architectures.

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

Deveci, Mehmet; Rajamanickam, Sivasankaran; Trott, Christian Robert

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scienti c computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and datamore » structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.« less

Integrated semiconductor quantum dot scintillation detector: Ultimate limit for speed and light yield

DOE PAGES

Oktyabrsky, Serge; Yakimov, Michael; Tokranov, Vadim; ...

2016-03-30

Here, a picosecond-range timing of charged particles and photons is a long-standing challenge for many high-energy physics, biophysics, medical and security applications. We present a design, technological pathway and challenges, and some properties important for realization of an ultrafast high-efficient room-temperature semiconductor scintillator based on self-assembled InAs quantum dots (QD) embedded in a GaAs matrix. Low QD density (<; 10 15 cm -3), fast (~5 ps) electron capture, luminescence peak redshifted by 0.2-0.3 eV from GaAs absorption edge with fast decay time (0.5-1 ns) along with the efficient energy transfer in the GaAs matrix (4.2 eV/pair) allows for fabrication ofmore » a semiconductor scintillator with the unsurpassed performance parameters. The major technological challenge is fabrication of a large volume (> 1 cm 3 ) of epitaxial QD medium. This requires multiple film separation and bonding, likely using separate epitaxial films as waveguides for improved light coupling. Compared to traditional inorganic scintillators, the semiconductor-QD based scintillators could have about 5x higher light yield and 20x faster decay time, opening a way to gamma detectors with the energy resolution better than 1% and sustaining counting rates MHz. Picosecond-scale timing requires segmented low-capacitance photodiodes integrated with the scintillator. For photons, the proposed detector inherently provides the depth-of-interaction information.« less

Fast underdetermined BSS architecture design methodology for real time applications.

PubMed

Mopuri, Suresh; Reddy, P Sreenivasa; Acharyya, Amit; Naik, Ganesh R

2015-01-01

In this paper, we propose a high speed architecture design methodology for the Under-determined Blind Source Separation (UBSS) algorithm using our recently proposed high speed Discrete Hilbert Transform (DHT) targeting real time applications. In UBSS algorithm, unlike the typical BSS, the number of sensors are less than the number of the sources, which is of more interest in the real time applications. The DHT architecture has been implemented based on sub matrix multiplication method to compute M point DHT, which uses N point architecture recursively and where M is an integer multiples of N. The DHT architecture and state of the art architecture are coded in VHDL for 16 bit word length and ASIC implementation is carried out using UMC 90 - nm technology @V DD = 1V and @ 1MHZ clock frequency. The proposed architecture implementation and experimental comparison results show that the DHT design is two times faster than state of the art architecture.

Optical matrix-matrix multiplication method demonstrated by the use of a multifocus hololens

NASA Technical Reports Server (NTRS)

Liu, H. K.; Liang, Y.-Z.

1984-01-01

A method of optical matrix-matrix multiplication is presented. The feasibility of the method is also experimentally demonstrated by the use of a dichromated-gelatin multifocus holographic lens (hololens). With the specific values of matrices chosen, the average percentage error between the theoretical and experimental data of the elements of the output matrix of the multiplication of some specific pairs of 3 x 3 matrices is 0.4 percent, which corresponds to an 8-bit accuracy.

Incompressible SPH (ISPH) with fast Poisson solver on a GPU

NASA Astrophysics Data System (ADS)

Chow, Alex D.; Rogers, Benedict D.; Lind, Steven J.; Stansby, Peter K.

2018-05-01

This paper presents a fast incompressible SPH (ISPH) solver implemented to run entirely on a graphics processing unit (GPU) capable of simulating several millions of particles in three dimensions on a single GPU. The ISPH algorithm is implemented by converting the highly optimised open-source weakly-compressible SPH (WCSPH) code DualSPHysics to run ISPH on the GPU, combining it with the open-source linear algebra library ViennaCL for fast solutions of the pressure Poisson equation (PPE). Several challenges are addressed with this research: constructing a PPE matrix every timestep on the GPU for moving particles, optimising the limited GPU memory, and exploiting fast matrix solvers. The ISPH pressure projection algorithm is implemented as 4 separate stages, each with a particle sweep, including an algorithm for the population of the PPE matrix suitable for the GPU, and mixed precision storage methods. An accurate and robust ISPH boundary condition ideal for parallel processing is also established by adapting an existing WCSPH boundary condition for ISPH. A variety of validation cases are presented: an impulsively started plate, incompressible flow around a moving square in a box, and dambreaks (2-D and 3-D) which demonstrate the accuracy, flexibility, and speed of the methodology. Fragmentation of the free surface is shown to influence the performance of matrix preconditioners and therefore the PPE matrix solution time. The Jacobi preconditioner demonstrates robustness and reliability in the presence of fragmented flows. For a dambreak simulation, GPU speed ups demonstrate up to 10-18 times and 1.1-4.5 times compared to single-threaded and 16-threaded CPU run times respectively.

Time reversal optical tomography locates fluorescent targets in a turbid medium

NASA Astrophysics Data System (ADS)

Wu, Binlin; Cai, W.; Gayen, S. K.

2013-03-01

A fluorescence optical tomography approach that extends time reversal optical tomography (TROT) to locate fluorescent targets embedded in a turbid medium is introduced. It uses a multi-source illumination and multi-detector signal acquisition scheme, along with TR matrix formalism, and multiple signal classification (MUSIC) to construct pseudo-image of the targets. The samples consisted of a single or two small tubes filled with water solution of Indocyanine Green (ICG) dye as targets embedded in a 250 mm × 250 mm × 60 mm rectangular cell filled with Intralipid-20% suspension as the scattering medium. The ICG concentration was 1μM, and the Intralipid-20% concentration was adjusted to provide ~ 1-mm transport length for both excitation wavelength of 790 nm and fluorescence wavelength around 825 nm. The data matrix was constructed using the diffusely transmitted fluorescence signals for all scan positions, and the TR matrix was constructed by multiplying data matrix with its transpose. A pseudo spectrum was calculated using the signal subspace of the TR matrix. Tomographic images were generated using the pseudo spectrum. The peaks in the pseudo images provided locations of the target(s) with sub-millimeter accuracy. Concurrent transmission TROT measurements corroborated fluorescence-TROT findings. The results demonstrate that TROT is a fast approach that can be used to obtain accurate three-dimensional position information of fluorescence targets embedded deep inside a highly scattering medium, such as, a contrast-enhanced tumor in a human breast.

A set of parallel, implicit methods for a reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids

DOE PAGES

Xia, Yidong; Luo, Hong; Frisbey, Megan; ...

2014-07-01

A set of implicit methods are proposed for a third-order hierarchical WENO reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids. An attractive feature in these methods are the application of the Jacobian matrix based on the P1 element approximation, resulting in a huge reduction of memory requirement compared with DG (P2). Also, three approaches -- analytical derivation, divided differencing, and automatic differentiation (AD) are presented to construct the Jacobian matrix respectively, where the AD approach shows the best robustness. A variety of compressible flow problems are computed to demonstrate the fast convergence property of the implemented flowmore » solver. Furthermore, an SPMD (single program, multiple data) programming paradigm based on MPI is proposed to achieve parallelism. The numerical results on complex geometries indicate that this low-storage implicit method can provide a viable and attractive DG solution for complicated flows of practical importance.« less

Fully nonlocal inelastic scattering computations for spectroscopical transmission electron microscopy methods

NASA Astrophysics Data System (ADS)

Rusz, Ján; Lubk, Axel; Spiegelberg, Jakob; Tyutyunnikov, Dmitry

2017-12-01

The complex interplay of elastic and inelastic scattering amenable to different levels of approximation constitutes the major challenge for the computation and hence interpretation of TEM-based spectroscopical methods. The two major approaches to calculate inelastic scattering cross sections of fast electrons on crystals—Yoshioka-equations-based forward propagation and the reciprocal wave method—are founded in two conceptually differing schemes—a numerical forward integration of each inelastically scattered wave function, yielding the exit density matrix, and a computation of inelastic scattering matrix elements using elastically scattered initial and final states (double channeling). Here, we compare both approaches and show that the latter is computationally competitive to the former by exploiting analytical integration schemes over multiple excited states. Moreover, we show how to include full nonlocality of the inelastic scattering event, neglected in the forward propagation approaches, at no additional computing costs in the reciprocal wave method. Detailed simulations show in some cases significant errors due to the z -locality approximation and hence pitfalls in the interpretation of spectroscopical TEM results.

Rapid convergence of optimal control in NMR using numerically-constructed toggling frames

NASA Astrophysics Data System (ADS)

Coote, Paul; Anklin, Clemens; Massefski, Walter; Wagner, Gerhard; Arthanari, Haribabu

2017-08-01

We present a numerical method for rapidly solving the Bloch equation for an arbitrary time-varying spin-1/2 Hamiltonian. The method relies on fast, vectorized computations such as summation and quaternion multiplication, rather than slow computations such as matrix exponentiation. A toggling frame is constructed in which the Hamiltonian is time-invariant, and therefore has a simple analytical solution. The key insight is that constructing this frame is faster than solving the system dynamics in the original frame. Rapidly solving the Bloch equations for an arbitrary Hamiltonian is particularly useful in the context of NMR optimal control. Optimal control theory can be used to design pulse shapes for a range of tasks in NMR spectroscopy. However, it requires multiple simulations of the Bloch equations at each stage of the algorithm, and for each relevant set of parameters (e.g. chemical shift frequencies). This is typically time consuming. We demonstrate that by working in an appropriate toggling frame, optimal control pulses can be generated much faster. We present a new alternative to the well-known GRAPE algorithm to continuously update the toggling-frame as the optimal pulse is generated, and demonstrate that this approach is extremely fast. The use and benefit of rapid optimal pulse generation is demonstrated for 19F fragment screening experiments.

Memory sparing, fast scattering formalism for rigorous diffraction modeling

NASA Astrophysics Data System (ADS)

Iff, W.; Kämpfe, T.; Jourlin, Y.; Tishchenko, A. V.

2017-07-01

The basics and algorithmic steps of a novel scattering formalism suited for memory sparing and fast electromagnetic calculations are presented. The formalism, called ‘S-vector algorithm’ (by analogy with the known scattering-matrix algorithm), allows the calculation of the collective scattering spectra of individual layered micro-structured scattering objects. A rigorous method of linear complexity is applied to model the scattering at individual layers; here the generalized source method (GSM) resorting to Fourier harmonics as basis functions is used as one possible method of linear complexity. The concatenation of the individual scattering events can be achieved sequentially or in parallel, both having pros and cons. The present development will largely concentrate on a consecutive approach based on the multiple reflection series. The latter will be reformulated into an implicit formalism which will be associated with an iterative solver, resulting in improved convergence. The examples will first refer to 1D grating diffraction for the sake of simplicity and intelligibility, with a final 2D application example.

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

PubMed

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

2006-01-20

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

SparRec: An effective matrix completion framework of missing data imputation for GWAS

NASA Astrophysics Data System (ADS)

Jiang, Bo; Ma, Shiqian; Causey, Jason; Qiao, Linbo; Hardin, Matthew Price; Bitts, Ian; Johnson, Daniel; Zhang, Shuzhong; Huang, Xiuzhen

2016-10-01

Genome-wide association studies present computational challenges for missing data imputation, while the advances of genotype technologies are generating datasets of large sample sizes with sample sets genotyped on multiple SNP chips. We present a new framework SparRec (Sparse Recovery) for imputation, with the following properties: (1) The optimization models of SparRec, based on low-rank and low number of co-clusters of matrices, are different from current statistics methods. While our low-rank matrix completion (LRMC) model is similar to Mendel-Impute, our matrix co-clustering factorization (MCCF) model is completely new. (2) SparRec, as other matrix completion methods, is flexible to be applied to missing data imputation for large meta-analysis with different cohorts genotyped on different sets of SNPs, even when there is no reference panel. This kind of meta-analysis is very challenging for current statistics based methods. (3) SparRec has consistent performance and achieves high recovery accuracy even when the missing data rate is as high as 90%. Compared with Mendel-Impute, our low-rank based method achieves similar accuracy and efficiency, while the co-clustering based method has advantages in running time. The testing results show that SparRec has significant advantages and competitive performance over other state-of-the-art existing statistics methods including Beagle and fastPhase.

Technique for fast and efficient hierarchical clustering

DOEpatents

Stork, Christopher

2013-10-08

A fast and efficient technique for hierarchical clustering of samples in a dataset includes compressing the dataset to reduce a number of variables within each of the samples of the dataset. A nearest neighbor matrix is generated to identify nearest neighbor pairs between the samples based on differences between the variables of the samples. The samples are arranged into a hierarchy that groups the samples based on the nearest neighbor matrix. The hierarchy is rendered to a display to graphically illustrate similarities or differences between the samples.

Fast QC-LDPC code for free space optical communication

NASA Astrophysics Data System (ADS)

Wang, Jin; Zhang, Qi; Udeh, Chinonso Paschal; Wu, Rangzhong

2017-02-01

Free Space Optical (FSO) Communication systems use the atmosphere as a propagation medium. Hence the atmospheric turbulence effects lead to multiplicative noise related with signal intensity. In order to suppress the signal fading induced by multiplicative noise, we propose a fast Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) code for FSO Communication systems. As a linear block code based on sparse matrix, the performances of QC-LDPC is extremely near to the Shannon limit. Currently, the studies on LDPC code in FSO Communications is mainly focused on Gauss-channel and Rayleigh-channel, respectively. In this study, the LDPC code design over atmospheric turbulence channel which is nether Gauss-channel nor Rayleigh-channel is closer to the practical situation. Based on the characteristics of atmospheric channel, which is modeled as logarithmic-normal distribution and K-distribution, we designed a special QC-LDPC code, and deduced the log-likelihood ratio (LLR). An irregular QC-LDPC code for fast coding, of which the rates are variable, is proposed in this paper. The proposed code achieves excellent performance of LDPC codes and can present the characteristics of high efficiency in low rate, stable in high rate and less number of iteration. The result of belief propagation (BP) decoding shows that the bit error rate (BER) obviously reduced as the Signal-to-Noise Ratio (SNR) increased. Therefore, the LDPC channel coding technology can effectively improve the performance of FSO. At the same time, the BER, after decoding reduces with the increase of SNR arbitrarily, and not having error limitation platform phenomenon with error rate slowing down.

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

ERIC Educational Resources Information Center

Zhang, Zhidong

2016-01-01

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

Development of UO2/PuO2 dispersed in uranium matrix CERMET fuel system for fast reactors

NASA Astrophysics Data System (ADS)

Sinha, V. P.; Hegde, P. V.; Prasad, G. J.; Pal, S.; Mishra, G. P.

2012-08-01

CERMET fuel with either PuO2 or enriched UO2 dispersed in uranium metal matrix has a strong potential of becoming a fuel for the liquid metal cooled fast breeder reactors (LMR's). In fact it may act as a bridge between the advantages and disadvantages associated with the two extremes of fuel systems (i.e. ceramic fuel and metallic fuel) for fast reactors. At Bhabha Atomic Research Centre (BARC), R & D efforts are on to develop this CERMET fuel by powder metallurgy route. This paper describes the development of flow sheet for preparation of UO2 dispersed in uranium metal matrix pellets for three different compositions i.e. U-20 wt%UO2, U-25 wt%UO2 and U-30 wt%UO2. It was found that the sintered pellets were having excellent integrity and their linear mass was higher than that of carbide fuel pellets used in Fast Breeder Test Reactor programme (FBTR) in India. The pellets were characterized by X-ray diffraction (XRD) technique for phase analysis and lattice parameter determination. The optical microstructures were developed and reported for all the three different U-UO2 compositions.

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

Quantum Double of Yangian of strange Lie superalgebra Qn and multiplicative formula for universal R-matrix

NASA Astrophysics Data System (ADS)

Stukopin, Vladimir

2018-02-01

Main result is the multiplicative formula for universal R-matrix for Quantum Double of Yangian of strange Lie superalgebra Qn type. We introduce the Quantum Double of the Yangian of the strange Lie superalgebra Qn and define its PBW basis. We compute the Hopf pairing for the generators of the Yangian Double. From the Hopf pairing formulas we derive a factorized multiplicative formula for the universal R-matrix of the Yangian Double of the Lie superalgebra Qn . After them we obtain coefficients in this multiplicative formula for universal R-matrix.

FastSKAT: Sequence kernel association tests for very large sets of markers.

PubMed

Lumley, Thomas; Brody, Jennifer; Peloso, Gina; Morrison, Alanna; Rice, Kenneth

2018-06-22

The sequence kernel association test (SKAT) is widely used to test for associations between a phenotype and a set of genetic variants that are usually rare. Evaluating tail probabilities or quantiles of the null distribution for SKAT requires computing the eigenvalues of a matrix related to the genotype covariance between markers. Extracting the full set of eigenvalues of this matrix (an n×n matrix, for n subjects) has computational complexity proportional to n 3 . As SKAT is often used when n>104, this step becomes a major bottleneck in its use in practice. We therefore propose fastSKAT, a new computationally inexpensive but accurate approximations to the tail probabilities, in which the k largest eigenvalues of a weighted genotype covariance matrix or the largest singular values of a weighted genotype matrix are extracted, and a single term based on the Satterthwaite approximation is used for the remaining eigenvalues. While the method is not particularly sensitive to the choice of k, we also describe how to choose its value, and show how fastSKAT can automatically alert users to the rare cases where the choice may affect results. As well as providing faster implementation of SKAT, the new method also enables entirely new applications of SKAT that were not possible before; we give examples grouping variants by topologically associating domains, and comparing chromosome-wide association by class of histone marker. © 2018 WILEY PERIODICALS, INC.

Iron oxide nanomatrix facilitating metal ionization in matrix-assisted laser desorption/ionization mass spectrometry.

PubMed

Obena, Rofeamor P; Lin, Po-Chiao; Lu, Ying-Wei; Li, I-Che; del Mundo, Florian; Arco, Susan dR; Nuesca, Guillermo M; Lin, Chung-Chen; Chen, Yu-Ju

2011-12-15

The significance and epidemiological effects of metals to life necessitate the development of direct, efficient, and rapid method of analysis. Taking advantage of its simple, fast, and high-throughput features, we present a novel approach to metal ion detection by matrix-functionalized magnetic nanoparticle (matrix@MNP)-assisted MALDI-MS. Utilizing 21 biologically and environmentally relevant metal ion solutions, the performance of core and matrix@MNP against conventional matrixes in MALDI-MS and laser desorption ionization (LDI) MS were systemically tested to evaluate the versatility of matrix@MNP as ionization element. The matrix@MNPs provided 20- to >100-fold enhancement on detection sensitivity of metal ions and unambiguous identification through characteristic isotope patterns and accurate mass (<5 ppm), which may be attributed to its multifunctional role as metal chelator, preconcentrator, absorber, and reservoir of energy. Together with the comparison on the ionization behaviors of various metals having different ionization potentials (IP), we formulated a metal ionization mechanism model, alluding to the role of exciton pooling in matrix@MNP-assisted MALDI-MS. Moreover, the detection of Cu in spiked tap water demonstrated the practicability of this new approach as an efficient and direct alternative tool for fast, sensitive, and accurate determination of trace metal ions in real samples.

Conceptualizing Matrix Multiplication: A Framework for Student Thinking, an Historical Analysis, and a Modeling Perspective

ERIC Educational Resources Information Center

Larson, Christine

2010-01-01

Little is known about the variety of ways students conceptualize matrix multiplication, yet this is a fundamental part of most introductory linear algebra courses. My dissertation follows a three-paper format, with the three papers exploring conceptualizations of matrix multiplication from a variety of viewpoints. In these papers, I explore (1)…

Fast calculation of the sensitivity matrix in magnetic induction tomography by tetrahedral edge finite elements and the reciprocity theorem.

PubMed

Hollaus, K; Magele, C; Merwa, R; Scharfetter, H

2004-02-01

Magnetic induction tomography of biological tissue is used to reconstruct the changes in the complex conductivity distribution by measuring the perturbation of an alternating primary magnetic field. To facilitate the sensitivity analysis and the solution of the inverse problem a fast calculation of the sensitivity matrix, i.e. the Jacobian matrix, which maps the changes of the conductivity distribution onto the changes of the voltage induced in a receiver coil, is needed. The use of finite differences to determine the entries of the sensitivity matrix does not represent a feasible solution because of the high computational costs of the basic eddy current problem. Therefore, the reciprocity theorem was exploited. The basic eddy current problem was simulated by the finite element method using symmetric tetrahedral edge elements of second order. To test the method various simulations were carried out and discussed.

Fast and Adaptive Sparse Precision Matrix Estimation in High Dimensions

PubMed Central

Liu, Weidong; Luo, Xi

2014-01-01

This paper proposes a new method for estimating sparse precision matrices in the high dimensional setting. It has been popular to study fast computation and adaptive procedures for this problem. We propose a novel approach, called Sparse Column-wise Inverse Operator, to address these two issues. We analyze an adaptive procedure based on cross validation, and establish its convergence rate under the Frobenius norm. The convergence rates under other matrix norms are also established. This method also enjoys the advantage of fast computation for large-scale problems, via a coordinate descent algorithm. Numerical merits are illustrated using both simulated and real datasets. In particular, it performs favorably on an HIV brain tissue dataset and an ADHD resting-state fMRI dataset. PMID:25750463

Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent.

PubMed

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

2011-07-01

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

AITRAC: Augmented Interactive Transient Radiation Analysis by Computer. User's information manual

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

Not Available

1977-10-01

AITRAC is a program designed for on-line, interactive, DC, and transient analysis of electronic circuits. The program solves linear and nonlinear simultaneous equations which characterize the mathematical models used to predict circuit response. The program features 100 external node--200 branch capability; conversional, free-format input language; built-in junction, FET, MOS, and switch models; sparse matrix algorithm with extended-precision H matrix and T vector calculations, for fast and accurate execution; linear transconductances: beta, GM, MU, ZM; accurate and fast radiation effects analysis; special interface for user-defined equations; selective control of multiple outputs; graphical outputs in wide and narrow formats; and on-line parametermore » modification capability. The user describes the problem by entering the circuit topology and part parameters. The program then automatically generates and solves the circuit equations, providing the user with printed or plotted output. The circuit topology and/or part values may then be changed by the user, and a new analysis, requested. Circuit descriptions may be saved on disk files for storage and later use. The program contains built-in standard models for resistors, voltage and current sources, capacitors, inductors including mutual couplings, switches, junction diodes and transistors, FETS, and MOS devices. Nonstandard models may be constructed from standard models or by using the special equations interface. Time functions may be described by straight-line segments or by sine, damped sine, and exponential functions. 42 figures, 1 table. (RWR)« less

Unsteady Solution of Non-Linear Differential Equations Using Walsh Function Series

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2015-01-01

Walsh functions form an orthonormal basis set consisting of square waves. The discontinuous nature of square waves make the system well suited for representing functions with discontinuities. The product of any two Walsh functions is another Walsh function - a feature that can radically change an algorithm for solving non-linear partial differential equations (PDEs). The solution algorithm of non-linear differential equations using Walsh function series is unique in that integrals and derivatives may be computed using simple matrix multiplication of series representations of functions. Solutions to PDEs are derived as functions of wave component amplitude. Three sample problems are presented to illustrate the Walsh function series approach to solving unsteady PDEs. These include an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the use of the Walsh function solution algorithms, exploiting Fast Walsh Transforms in multi-dimensions (O(Nlog(N))). Details of a Fast Walsh Reciprocal, defined here for the first time, enable inversion of aWalsh Symmetric Matrix in O(Nlog(N)) operations. Walsh functions have been derived using a fractal recursion algorithm and these fractal patterns are observed in the progression of pairs of wave number amplitudes in the solutions. These patterns are most easily observed in a remapping defined as a fractal fingerprint (FFP). A prolongation of existing solutions to the next highest order exploits these patterns. The algorithms presented here are considered a work in progress that provide new alternatives and new insights into the solution of non-linear PDEs.

Performance Tested Method multiple laboratory validation study of ELISA-based assays for the detection of peanuts in food.

PubMed

Park, Douglas L; Coates, Scott; Brewer, Vickery A; Garber, Eric A E; Abouzied, Mohamed; Johnson, Kurt; Ritter, Bruce; McKenzie, Deborah

2005-01-01

Performance Tested Method multiple laboratory validations for the detection of peanut protein in 4 different food matrixes were conducted under the auspices of the AOAC Research Institute. In this blind study, 3 commercially available ELISA test kits were validated: Neogen Veratox for Peanut, R-Biopharm RIDASCREEN FAST Peanut, and Tepnel BioKits for Peanut Assay. The food matrixes used were breakfast cereal, cookies, ice cream, and milk chocolate spiked at 0 and 5 ppm peanut. Analyses of the samples were conducted by laboratories representing industry and international and U.S governmental agencies. All 3 commercial test kits successfully identified spiked and peanut-free samples. The validation study required 60 analyses on test samples at the target level 5 microg peanut/g food and 60 analyses at a peanut-free level, which was designed to ensure that the lower 95% confidence limit for the sensitivity and specificity would not be <90%. The probability that a test sample contains an allergen given a prevalence rate of 5% and a positive test result using a single test kit analysis with 95% sensitivity and 95% specificity, which was demonstrated for these test kits, would be 50%. When 2 test kits are run simultaneously on all samples, the probability becomes 95%. It is therefore recommended that all field samples be analyzed with at least 2 of the validated kits.

Influence of multiple-passes on microstructure and mechanical properties of Al-Mg/SiC surface composites fabricated via underwater friction stir processing

NASA Astrophysics Data System (ADS)

Srivastava, Manu; Rathee, Sandeep; Maheshwari, Sachin; Siddiquee, Arshad Noor

2018-06-01

Friction stir processing (FSP) is a relatively newly developed solid-state process involving surface modifications for fabricating metal matrix surface composites. Obtaining metal matrix nano-composites with uniform dispersion of reinforcement particles via FSP route is an intricate task to accomplish. In this work, AA5059/SiC nano surface composites (SCs) were developed. Effect of multiple FSP passes and SiC addition on microstructure and mechanical properties of fabricated SCs during underwater condition was investigated. Results reflected that the average microhardness value of base metal (BM) increases from 85 Hv to 159 Hv in stir zone of four pass underwater friction stir processed (FSPed) SC. Highest ultimate tensile strength (UTS) achieved during four pass FSPed sample was 377 MPa that is higher than UTS of BM (321 MPa) and four pass FSPed sample developed at ambient air FSP conditions (347 MPa). An appreciably narrower heat affected zone is obtained owing to fast cooling and reduced heat conduction during underwater FSP, amounting to higher UTS as compared to BM and SC at ambient conditions. Thus, it can be concluded that surrounding medium and number of FSP passes have significant impact on mechanical properties of fabricated SCs. Analysis of microstructures and distribution of SiC particles in fabricated SCs were studied by optical microscope and FESEM respectively and found in good corroboration with the mechanical properties.

New Factorization Techniques and Fast Serial and Parrallel Algorithms for Operational Space Control of Robot Manipulators

NASA Technical Reports Server (NTRS)

Fijany, Amir; Djouani, Karim; Fried, George; Pontnau, Jean

1997-01-01

In this paper a new factorization technique for computation of inverse of mass matrix, and the operational space mass matrix, as arising in implementation of the operational space control scheme, is presented.

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.

Fast and accurate computation of system matrix for area integral model-based algebraic reconstruction technique

NASA Astrophysics Data System (ADS)

Zhang, Shunli; Zhang, Dinghua; Gong, Hao; Ghasemalizadeh, Omid; Wang, Ge; Cao, Guohua

2014-11-01

Iterative algorithms, such as the algebraic reconstruction technique (ART), are popular for image reconstruction. For iterative reconstruction, the area integral model (AIM) is more accurate for better reconstruction quality than the line integral model (LIM). However, the computation of the system matrix for AIM is more complex and time-consuming than that for LIM. Here, we propose a fast and accurate method to compute the system matrix for AIM. First, we calculate the intersection of each boundary line of a narrow fan-beam with pixels in a recursive and efficient manner. Then, by grouping the beam-pixel intersection area into six types according to the slopes of the two boundary lines, we analytically compute the intersection area of the narrow fan-beam with the pixels in a simple algebraic fashion. Overall, experimental results show that our method is about three times faster than the Siddon algorithm and about two times faster than the distance-driven model (DDM) in computation of the system matrix. The reconstruction speed of our AIM-based ART is also faster than the LIM-based ART that uses the Siddon algorithm and DDM-based ART, for one iteration. The fast reconstruction speed of our method was accomplished without compromising the image quality.

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

75 FR 13774 - Agency Information Collection Activities: Submission for OMB Review; Comment Request, OMB No...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-23

.... 1660-NEW; FEMA Form 089-4, TSGP Investment Justification; FEMA Form 089-27, Fast Track Cost Training...-27, Fast Track Cost Training Matrix. Abstract: The TSGP is an important component of the Department...

Mixed matrix membranes with fast and selective transport pathways for efficient CO2 separation

NASA Astrophysics Data System (ADS)

Hou, Jinpeng; Li, Xueqin; Guo, Ruili; Zhang, Jianshu; Wang, Zhongming

2018-03-01

To improve CO2 separation performance, porous carbon nanosheets (PCNs) were used as a filler into a Pebax MH 1657 (Pebax) matrix, fabricating mixed matrix membranes (MMMs). The PCNs exhibited a preferential horizontal orientation within the Pebax matrix because of the extremely large 2D plane and nanoscale thickness of the matrix. Therefore, the micropores of the PCNs provided fast CO2 transport pathways, which led to increased CO2 permeability. The reduced pore size of the PCNs was a consequence of the overlapping of PCNs and the polymer chains penetrating into the pores of the PCNs. The reduction in the pore size of the PCNs improved the CO2/gas selectivity. As a result, the CO2 permeability and CO2/CH4 selectivity of the Pebax membrane with 10 wt% PCNs-loading (Pebax-PCNs-10) were 520 barrer and 51, respectively, for CO2/CH4 mixed-gas. The CO2 permeability and CO2/N2 selectivity of the Pebax-PCNs-10 membrane were 614 barrer and 61, respectively, for CO2/N2 mixed-gas.

Phase matrix induced symmetrics for multiple scattering using the matrix operator method

NASA Technical Reports Server (NTRS)

Hitzfelder, S. J.; Kattawar, G. W.

1973-01-01

Entirely rigorous proofs of the symmetries induced by the phase matrix into the reflection and transmission operators used in the matrix operator theory are given. Results are obtained for multiple scattering in both homogeneous and inhomogeneous atmospheres. These results will be useful to researchers using the method since large savings in computer time and storage are obtainable.

Ionospheric-thermospheric UV tomography: 1. Image space reconstruction algorithms

NASA Astrophysics Data System (ADS)

Dymond, K. F.; Budzien, S. A.; Hei, M. A.

2017-03-01

We present and discuss two algorithms of the class known as Image Space Reconstruction Algorithms (ISRAs) that we are applying to the solution of large-scale ionospheric tomography problems. ISRAs have several desirable features that make them useful for ionospheric tomography. In addition to producing nonnegative solutions, ISRAs are amenable to sparse-matrix formulations and are fast, stable, and robust. We present the results of our studies of two types of ISRA: the Least Squares Positive Definite and the Richardson-Lucy algorithms. We compare their performance to the Multiplicative Algebraic Reconstruction and Conjugate Gradient Least Squares algorithms. We then discuss the use of regularization in these algorithms and present our new approach based on regularization to a partial differential equation.

A 640-MHz 32-megachannel real-time polyphase-FFT spectrum analyzer

NASA Technical Reports Server (NTRS)

Zimmerman, G. A.; Garyantes, M. F.; Grimm, M. J.; Charny, B.

1991-01-01

A polyphase fast Fourier transform (FFT) spectrum analyzer being designed for NASA's Search for Extraterrestrial Intelligence (SETI) Sky Survey at the Jet Propulsion Laboratory is described. By replacing the time domain multiplicative window preprocessing with polyphase filter processing, much of the processing loss of windowed FFTs can be eliminated. Polyphase coefficient memory costs are minimized by effective use of run length compression. Finite word length effects are analyzed, producing a balanced system with 8 bit inputs, 16 bit fixed point polyphase arithmetic, and 24 bit fixed point FFT arithmetic. Fixed point renormalization midway through the computation is seen to be naturally accommodated by the matrix FFT algorithm proposed. Simulation results validate the finite word length arithmetic analysis and the renormalization technique.

ppcor: An R Package for a Fast Calculation to Semi-partial Correlation Coefficients.

PubMed

Kim, Seongho

2015-11-01

Lack of a general matrix formula hampers implementation of the semi-partial correlation, also known as part correlation, to the higher-order coefficient. This is because the higher-order semi-partial correlation calculation using a recursive formula requires an enormous number of recursive calculations to obtain the correlation coefficients. To resolve this difficulty, we derive a general matrix formula of the semi-partial correlation for fast computation. The semi-partial correlations are then implemented on an R package ppcor along with the partial correlation. Owing to the general matrix formulas, users can readily calculate the coefficients of both partial and semi-partial correlations without computational burden. The package ppcor further provides users with the level of the statistical significance with its test statistic.

Fast Geostatistical Inversion using Randomized Matrix Decompositions and Sketchings for Heterogeneous Aquifer Characterization

NASA Astrophysics Data System (ADS)

O'Malley, D.; Le, E. B.; Vesselinov, V. V.

2015-12-01

We present a fast, scalable, and highly-implementable stochastic inverse method for characterization of aquifer heterogeneity. The method utilizes recent advances in randomized matrix algebra and exploits the structure of the Quasi-Linear Geostatistical Approach (QLGA), without requiring a structured grid like Fast-Fourier Transform (FFT) methods. The QLGA framework is a more stable version of Gauss-Newton iterates for a large number of unknown model parameters, but provides unbiased estimates. The methods are matrix-free and do not require derivatives or adjoints, and are thus ideal for complex models and black-box implementation. We also incorporate randomized least-square solvers and data-reduction methods, which speed up computation and simulate missing data points. The new inverse methodology is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). Julia is an advanced high-level scientific programing language that allows for efficient memory management and utilization of high-performance computational resources. Inversion results based on series of synthetic problems with steady-state and transient calibration data are presented.

Algorithms for System Identification and Source Location.

NASA Astrophysics Data System (ADS)

Nehorai, Arye

This thesis deals with several topics in least squares estimation and applications to source location. It begins with a derivation of a mapping between Wiener theory and Kalman filtering for nonstationary autoregressive moving average (ARMO) processes. Applying time domain analysis, connections are found between time-varying state space realizations and input-output impulse response by matrix fraction description (MFD). Using these connections, the whitening filters are derived by the two approaches, and the Kalman gain is expressed in terms of Wiener theory. Next, fast estimation algorithms are derived in a unified way as special cases of the Conjugate Direction Method. The fast algorithms included are the block Levinson, fast recursive least squares, ladder (or lattice) and fast Cholesky algorithms. The results give a novel derivation and interpretation for all these methods, which are efficient alternatives to available recursive system identification algorithms. Multivariable identification algorithms are usually designed only for left MFD models. In this work, recursive multivariable identification algorithms are derived for right MFD models with diagonal denominator matrices. The algorithms are of prediction error and model reference type. Convergence analysis results obtained by the Ordinary Differential Equation (ODE) method are presented along with simulations. Sources of energy can be located by estimating time differences of arrival (TDOA's) of waves between the receivers. A new method for TDOA estimation is proposed for multiple unknown ARMA sources and additive correlated receiver noise. The method is based on a formula that uses only the receiver cross-spectra and the source poles. Two algorithms are suggested that allow tradeoffs between computational complexity and accuracy. A new time delay model is derived and used to show the applicability of the methods for non -integer TDOA's. Results from simulations illustrate the performance of the algorithms. The last chapter analyzes the response of exact least squares predictors for enhancement of sinusoids with additive colored noise. Using the matrix inversion lemma and the Christoffel-Darboux formula, the frequency response and amplitude gain of the sinusoids are expressed as functions of the signal and noise characteristics. The results generalize the available white noise case.

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

PubMed

Lu, Canyi; Lin, Zhouchen; Yan, Shuicheng

2015-02-01

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

MGUPGMA: A Fast UPGMA Algorithm With Multiple Graphics Processing Units Using NCCL

PubMed Central

Hua, Guan-Jie; Hung, Che-Lun; Lin, Chun-Yuan; Wu, Fu-Che; Chan, Yu-Wei; Tang, Chuan Yi

2017-01-01

A phylogenetic tree is a visual diagram of the relationship between a set of biological species. The scientists usually use it to analyze many characteristics of the species. The distance-matrix methods, such as Unweighted Pair Group Method with Arithmetic Mean and Neighbor Joining, construct a phylogenetic tree by calculating pairwise genetic distances between taxa. These methods have the computational performance issue. Although several new methods with high-performance hardware and frameworks have been proposed, the issue still exists. In this work, a novel parallel Unweighted Pair Group Method with Arithmetic Mean approach on multiple Graphics Processing Units is proposed to construct a phylogenetic tree from extremely large set of sequences. The experimental results present that the proposed approach on a DGX-1 server with 8 NVIDIA P100 graphic cards achieves approximately 3-fold to 7-fold speedup over the implementation of Unweighted Pair Group Method with Arithmetic Mean on a modern CPU and a single GPU, respectively. PMID:29051701

MGUPGMA: A Fast UPGMA Algorithm With Multiple Graphics Processing Units Using NCCL.

PubMed

Hua, Guan-Jie; Hung, Che-Lun; Lin, Chun-Yuan; Wu, Fu-Che; Chan, Yu-Wei; Tang, Chuan Yi

2017-01-01

A phylogenetic tree is a visual diagram of the relationship between a set of biological species. The scientists usually use it to analyze many characteristics of the species. The distance-matrix methods, such as Unweighted Pair Group Method with Arithmetic Mean and Neighbor Joining, construct a phylogenetic tree by calculating pairwise genetic distances between taxa. These methods have the computational performance issue. Although several new methods with high-performance hardware and frameworks have been proposed, the issue still exists. In this work, a novel parallel Unweighted Pair Group Method with Arithmetic Mean approach on multiple Graphics Processing Units is proposed to construct a phylogenetic tree from extremely large set of sequences. The experimental results present that the proposed approach on a DGX-1 server with 8 NVIDIA P100 graphic cards achieves approximately 3-fold to 7-fold speedup over the implementation of Unweighted Pair Group Method with Arithmetic Mean on a modern CPU and a single GPU, respectively.

A new fracture mechanics model for multiple matrix cracks of SiC fiber reinforced brittle-matrix composites

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

Okabe, T.; Takeda, N.; Komotori, J.

1999-11-26

A new model is proposed for multiple matrix cracking in order to take into account the role of matrix-rich regions in the cross section in initiating crack growth. The model is used to predict the matrix cracking stress and the total number of matrix cracks. The model converts the matrix-rich regions into equivalent penny shape crack sizes and predicts the matrix cracking stress with a fracture mechanics crack-bridging model. The estimated distribution of matrix cracking stresses is used as statistical input to predict the number of matrix cracks. The results show good agreement with the experimental results by replica observations.more » Therefore, it is found that the matrix cracking behavior mainly depends on the distribution of matrix-rich regions in the composite.« less

Detecting Earthquakes over a Seismic Network using Single-Station Similarity Measures

NASA Astrophysics Data System (ADS)

Bergen, Karianne J.; Beroza, Gregory C.

2018-03-01

New blind waveform-similarity-based detection methods, such as Fingerprint and Similarity Thresholding (FAST), have shown promise for detecting weak signals in long-duration, continuous waveform data. While blind detectors are capable of identifying similar or repeating waveforms without templates, they can also be susceptible to false detections due to local correlated noise. In this work, we present a set of three new methods that allow us to extend single-station similarity-based detection over a seismic network; event-pair extraction, pairwise pseudo-association, and event resolution complete a post-processing pipeline that combines single-station similarity measures (e.g. FAST sparse similarity matrix) from each station in a network into a list of candidate events. The core technique, pairwise pseudo-association, leverages the pairwise structure of event detections in its network detection model, which allows it to identify events observed at multiple stations in the network without modeling the expected move-out. Though our approach is general, we apply it to extend FAST over a sparse seismic network. We demonstrate that our network-based extension of FAST is both sensitive and maintains a low false detection rate. As a test case, we apply our approach to two weeks of continuous waveform data from five stations during the foreshock sequence prior to the 2014 Mw 8.2 Iquique earthquake. Our method identifies nearly five times as many events as the local seismicity catalog (including 95% of the catalog events), and less than 1% of these candidate events are false detections.

Matrix Methods for Estimating the Coherence Functions from Estimates of the Cross-Spectral Density Matrix

DOE PAGES

Smallwood, D. O.

1996-01-01

It is shown that the usual method for estimating the coherence functions (ordinary, partial, and multiple) for a general multiple-input! multiple-output problem can be expressed as a modified form of Cholesky decomposition of the cross-spectral density matrix of the input and output records. The results can be equivalently obtained using singular value decomposition (SVD) of the cross-spectral density matrix. Using SVD suggests a new form of fractional coherence. The formulation as a SVD problem also suggests a way to order the inputs when a natural physical order of the inputs is absent.

Use of immobilized exopeptidases and volatile buffers for analysis of peptides by fast atom bombardment mass spectrometry.

PubMed

Wagner, R M; Fraser, B A

1987-05-01

beta-Lipotrophin (62-77) or Ac-gastrin releasing peptide was incubated with immobilized carboxypeptidase Y or aminopeptidase M. Subsequent aliquots of each incubation mixture were analysed by fast atom bombardment mass spectrometry using a dithiothreitol/dithioerythritol liquid matrix. The use of immobilized enzymes and volatile buffers for exopeptidase digestions enabled rapid and facile separation of enzyme from digestion products. This approach to mass spectral peptide analysis reduced spectral background arising from a glycerol matrix, buffer salts, or enzyme proteins and contaminants, enabling analysis of as little as 200 picomoles of a suitable peptide.

Computation of transform domain covariance matrices

NASA Technical Reports Server (NTRS)

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

1975-01-01

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

Matrix models for size-structured populations: unrealistic fast growth or simply diffusion?

PubMed

Picard, Nicolas; Liang, Jingjing

2014-01-01

Matrix population models are widely used to study population dynamics but have been criticized because their outputs are sensitive to the dimension of the matrix (or, equivalently, to the class width). This sensitivity is concerning for the population growth rate (λ) because this is an intrinsic characteristic of the population that should not depend on the model specification. It has been suggested that the sensitivity of λ to matrix dimension was linked to the existence of fast pathways (i.e. the fraction of individuals that systematically move up a class), whose proportion increases when class width increases. We showed that for matrix population models with growth transition only from class i to class i + 1, λ was independent of the class width when the mortality and the recruitment rates were constant, irrespective of the growth rate. We also showed that if there were indeed fast pathways, there were also in about the same proportion slow pathways (i.e. the fraction of individuals that systematically remained in the same class), and that they jointly act as a diffusion process (where diffusion here is the movement in size of an individual whose size increments are random according to a normal distribution with mean zero). For 53 tree species from a tropical rain forest in the Central African Republic, the diffusion resulting from common matrix dimensions was much stronger than would be realistic. Yet, the sensitivity of λ to matrix dimension for a class width in the range 1-10 cm was small, much smaller than the sampling uncertainty on the value of λ. Moreover, λ could either increase or decrease when class width increased depending on the species. Overall, even if the class width should be kept small enough to limit diffusion, it had little impact on the estimate of λ for tree species.

Uncertainty in dual permeability model parameters for structured soils.

PubMed

Arora, B; Mohanty, B P; McGuire, J T

2012-01-01

Successful application of dual permeability models (DPM) to predict contaminant transport is contingent upon measured or inversely estimated soil hydraulic and solute transport parameters. The difficulty in unique identification of parameters for the additional macropore- and matrix-macropore interface regions, and knowledge about requisite experimental data for DPM has not been resolved to date. Therefore, this study quantifies uncertainty in dual permeability model parameters of experimental soil columns with different macropore distributions (single macropore, and low- and high-density multiple macropores). Uncertainty evaluation is conducted using adaptive Markov chain Monte Carlo (AMCMC) and conventional Metropolis-Hastings (MH) algorithms while assuming 10 out of 17 parameters to be uncertain or random. Results indicate that AMCMC resolves parameter correlations and exhibits fast convergence for all DPM parameters while MH displays large posterior correlations for various parameters. This study demonstrates that the choice of parameter sampling algorithms is paramount in obtaining unique DPM parameters when information on covariance structure is lacking, or else additional information on parameter correlations must be supplied to resolve the problem of equifinality of DPM parameters. This study also highlights the placement and significance of matrix-macropore interface in flow experiments of soil columns with different macropore densities. Histograms for certain soil hydraulic parameters display tri-modal characteristics implying that macropores are drained first followed by the interface region and then by pores of the matrix domain in drainage experiments. Results indicate that hydraulic properties and behavior of the matrix-macropore interface is not only a function of saturated hydraulic conductivity of the macroporematrix interface ( K sa ) and macropore tortuosity ( l f ) but also of other parameters of the matrix and macropore domains.

Uncertainty in dual permeability model parameters for structured soils

NASA Astrophysics Data System (ADS)

Arora, B.; Mohanty, B. P.; McGuire, J. T.

2012-01-01

Successful application of dual permeability models (DPM) to predict contaminant transport is contingent upon measured or inversely estimated soil hydraulic and solute transport parameters. The difficulty in unique identification of parameters for the additional macropore- and matrix-macropore interface regions, and knowledge about requisite experimental data for DPM has not been resolved to date. Therefore, this study quantifies uncertainty in dual permeability model parameters of experimental soil columns with different macropore distributions (single macropore, and low- and high-density multiple macropores). Uncertainty evaluation is conducted using adaptive Markov chain Monte Carlo (AMCMC) and conventional Metropolis-Hastings (MH) algorithms while assuming 10 out of 17 parameters to be uncertain or random. Results indicate that AMCMC resolves parameter correlations and exhibits fast convergence for all DPM parameters while MH displays large posterior correlations for various parameters. This study demonstrates that the choice of parameter sampling algorithms is paramount in obtaining unique DPM parameters when information on covariance structure is lacking, or else additional information on parameter correlations must be supplied to resolve the problem of equifinality of DPM parameters. This study also highlights the placement and significance of matrix-macropore interface in flow experiments of soil columns with different macropore densities. Histograms for certain soil hydraulic parameters display tri-modal characteristics implying that macropores are drained first followed by the interface region and then by pores of the matrix domain in drainage experiments. Results indicate that hydraulic properties and behavior of the matrix-macropore interface is not only a function of saturated hydraulic conductivity of the macroporematrix interface (Ksa) and macropore tortuosity (lf) but also of other parameters of the matrix and macropore domains.

U-PuO2, U-PuC, U-PuN cermet fuel for fast reactor

NASA Astrophysics Data System (ADS)

Mishra, Sudhir; Kaity, Santu; Banerjee, Joydipta; Nandi, Chiranjeet; Dey, G. K.; Khan, K. B.

2018-02-01

Cermet fuel combines beneficial properties of both ceramic and metal and attracts global interest for research as a candidate fuel for nuclear reactors. In the present study, U matrix PuC/PuN/PuO2 cermet for fast reactor have been fabricated on laboratory scale by the powder metallurgy route. Characterization of the fuel has been carried out using Dilatometer, Differential Thermal analysis (DTA), X-ray diffractometer and Optical microscope. X ray diffraction study of the fuel reveals presence of different phases. The PuN dispersed cermet was observed to have high solidus temperature as compared to PuC and PuO2 dispersed cermet. Swelling was observed in U matrix PuO2 cermet which also showed higher thermal expansion. Among the three cermets studied, U matrix PuC cermet showed maximum thermal conductivity.

Fast Minimum Variance Beamforming Based on Legendre Polynomials.

PubMed

Bae, MooHo; Park, Sung Bae; Kwon, Sung Jae

2016-09-01

Currently, minimum variance beamforming (MV) is actively investigated as a method that can improve the performance of an ultrasound beamformer, in terms of the lateral and contrast resolution. However, this method has the disadvantage of excessive computational complexity since the inverse spatial covariance matrix must be calculated. Some noteworthy methods among various attempts to solve this problem include beam space adaptive beamforming methods and the fast MV method based on principal component analysis, which are similar in that the original signal in the element space is transformed to another domain using an orthonormal basis matrix and the dimension of the covariance matrix is reduced by approximating the matrix only with important components of the matrix, hence making the inversion of the matrix very simple. Recently, we proposed a new method with further reduced computational demand that uses Legendre polynomials as the basis matrix for such a transformation. In this paper, we verify the efficacy of the proposed method through Field II simulations as well as in vitro and in vivo experiments. The results show that the approximation error of this method is less than or similar to those of the above-mentioned methods and that the lateral response of point targets and the contrast-to-speckle noise in anechoic cysts are also better than or similar to those methods when the dimensionality of the covariance matrices is reduced to the same dimension.

Fast screening of short-chain chlorinated paraffins in indoor dust samples by graphene-assisted laser desorption/ionization mass spectrometry.

PubMed

Huang, Xiu; Liu, Qian; Gao, Wei; Wang, Yawei; Nie, Zhou; Yao, Shouzhuo; Jiang, Guibin

2018-03-01

As an important class of emerging chemical contaminants, short-chain chlorinated paraffins (SCCPs) are considered as one of the most challenging groups of compounds to analyze. In this paper, we report a new method for fast screening of SCCPs based on matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS) with graphene as a matrix and 2,5,6,9-tetrachlorodecane as an internal standard. We found that the use of graphene as MALDI matrix generated high peak intensities for SCCPs while producing few background noises. The ion fragmentation mechanisms of SCCPs in MALDI are discussed in detail. Under the optimized conditions, much lower detection limits of SCCP congeners (0.1-5ng/mL) than those reported previously were obtained. Other distinct advantages such as short analysis time and simplified sample preparation procedures are also demonstrated. The method was successfully applied in fast screening of SCCPs in indoor dust samples and monitoring of human exposure levels to SCCPs, and the results were verified by gas chromatography coupled to negative chemical ionization quadrupole time-of-flight high-resolution mass spectrometry. This work not only offers a new promising tool for SCCP studies, but also further demonstrates the promise of graphene as a new generation of MALDI matrix. Copyright © 2017 Elsevier B.V. All rights reserved.

Bit error rate tester using fast parallel generation of linear recurring sequences

DOEpatents

Pierson, Lyndon G.; Witzke, Edward L.; Maestas, Joseph H.

2003-05-06

A fast method for generating linear recurring sequences by parallel linear recurring sequence generators (LRSGs) with a feedback circuit optimized to balance minimum propagation delay against maximal sequence period. Parallel generation of linear recurring sequences requires decimating the sequence (creating small contiguous sections of the sequence in each LRSG). A companion matrix form is selected depending on whether the LFSR is right-shifting or left-shifting. The companion matrix is completed by selecting a primitive irreducible polynomial with 1's most closely grouped in a corner of the companion matrix. A decimation matrix is created by raising the companion matrix to the (n*k).sup.th power, where k is the number of parallel LRSGs and n is the number of bits to be generated at a time by each LRSG. Companion matrices with 1's closely grouped in a corner will yield sparse decimation matrices. A feedback circuit comprised of XOR logic gates implements the decimation matrix in hardware. Sparse decimation matrices can be implemented with minimum number of XOR gates, and therefore a minimum propagation delay through the feedback circuit. The LRSG of the invention is particularly well suited to use as a bit error rate tester on high speed communication lines because it permits the receiver to synchronize to the transmitted pattern within 2n bits.

Sparse matrix multiplications for linear scaling electronic structure calculations in an atom-centered basis set using multiatom blocks.

PubMed

Saravanan, Chandra; Shao, Yihan; Baer, Roi; Ross, Philip N; Head-Gordon, Martin

2003-04-15

A sparse matrix multiplication scheme with multiatom blocks is reported, a tool that can be very useful for developing linear-scaling methods with atom-centered basis functions. Compared to conventional element-by-element sparse matrix multiplication schemes, efficiency is gained by the use of the highly optimized basic linear algebra subroutines (BLAS). However, some sparsity is lost in the multiatom blocking scheme because these matrix blocks will in general contain negligible elements. As a result, an optimal block size that minimizes the CPU time by balancing these two effects is recovered. In calculations on linear alkanes, polyglycines, estane polymers, and water clusters the optimal block size is found to be between 40 and 100 basis functions, where about 55-75% of the machine peak performance was achieved on an IBM RS6000 workstation. In these calculations, the blocked sparse matrix multiplications can be 10 times faster than a standard element-by-element sparse matrix package. Copyright 2003 Wiley Periodicals, Inc. J Comput Chem 24: 618-622, 2003

Do persistently fast-growing juveniles contribute disproportionately to population growth? A new analysis tool for matrix models and its application to rainforest trees.

PubMed

Zuidema, Pieter A; Brienen, Roel J W; During, Heinjo J; Güneralp, Burak

2009-11-01

Plants and animals often exhibit strong and persistent growth variation among individuals within a species. Persistently fast-growing individuals have a higher chance of reaching reproductive size, do so at a younger age, and therefore contribute disproportionately to population growth (lambda). Here we introduce a new approach to quantify this "fast-growth effect." We propose using age-size-structured matrix models in which persistently fast and slow growers are distinguished as they occur in relatively young and old age classes for a given size category. Life-cycle pathways involving fast growth can then be identified, and their contribution to lambda is quantified through loop analysis. We applied this approach to an example species, the tropical rainforest tree Cedrela odorata, that shows persistent growth variation among individuals. Loop analysis showed that juvenile trees reaching the 10-cm diameter class at below-median age contributed twice as much to lambda as slow juvenile growers. Fast growth to larger-diameter categories also contributed disproportionately to lambda. The results were robust to changes in parameter values and life-history trade-offs. These results show that the fast-growth effect can be strong in long-lived species. Persistent growth differences among individuals should therefore be accommodated for in demographic models and life-history studies.

Analysis of multiple mycotoxins in food.

PubMed

Hajslova, Jana; Zachariasova, Milena; Cajka, Tomas

2011-01-01

Mycotoxins are secondary metabolites of microscopic filamentous fungi. With regard to the widespread distribution of fungi in the environment, mycotoxins are considered to be one of the most important natural contaminants in foods and feeds. To protect consumers' health and reduce economic losses, surveillance and control of mycotoxins in food and feed has become a major objective for producers, regulatory authorities, and researchers worldwide. In this context, availability of reliable analytical methods applicable for this purpose is essential. Since the variety of chemical structures of mycotoxins makes impossible to use one single technique for their analysis, a vast number of analytical methods has been developed and validated. Both a large variability of food matrices and growing demands for a fast, cost-saving and accurate determination of multiple mycotoxins by a single method outline new challenges for analytical research. This strong effort is facilitated by technical developments in mass spectrometry allowing decreasing the influence of matrix effects in spite of omitting sample clean-up step. The current state-of-the-art together with future trends is presented in this chapter. Attention is focused mainly on instrumental method; advances in biosensors and other screening bioanalytical approaches enabling analysis of multiple mycotoxins are not discussed in detail.

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

Zhu, Xiaojun; Lei, Guangtsai; Pan, Guangwen

In this paper, the continuous operator is discretized into matrix forms by Galerkin`s procedure, using periodic Battle-Lemarie wavelets as basis/testing functions. The polynomial decomposition of wavelets is applied to the evaluation of matrix elements, which makes the computational effort of the matrix elements no more expensive than that of method of moments (MoM) with conventional piecewise basis/testing functions. A new algorithm is developed employing the fast wavelet transform (FWT). Owing to localization, cancellation, and orthogonal properties of wavelets, very sparse matrices have been obtained, which are then solved by the LSQR iterative method. This algorithm is also adaptive in thatmore » one can add at will finer wavelet bases in the regions where fields vary rapidly, without any damage to the system orthogonality of the wavelet basis functions. To demonstrate the effectiveness of the new algorithm, we applied it to the evaluation of frequency-dependent resistance and inductance matrices of multiple lossy transmission lines. Numerical results agree with previously published data and laboratory measurements. The valid frequency range of the boundary integral equation results has been extended two to three decades in comparison with the traditional MoM approach. The new algorithm has been integrated into the computer aided design tool, MagiCAD, which is used for the design and simulation of high-speed digital systems and multichip modules Pan et al. 29 refs., 7 figs., 6 tabs.« less

Pump-Probe Spectroscopy Using the Hadamard Transform.

PubMed

Beddard, Godfrey S; Yorke, Briony A

2016-08-01

A new method of performing pump-probe experiments is proposed and experimentally demonstrated by a proof of concept on the millisecond scale. The idea behind this method is to measure the total probe intensity arising from several time points as a group, instead of measuring each time separately. These measurements are multiplexes that are then transformed into the true signal via multiplication with a binary Hadamard S matrix. Each group of probe pulses is determined by using the pattern of a row of the Hadamard S matrix and the experiment is completed by rotating this pattern by one step for each sample excitation until the original pattern is again produced. Thus to measure n time points, n excitation events are needed and n probe patterns each taken from the n × n S matrix. The time resolution is determined by the shortest time between the probe pulses. In principle, this method could be used over all timescales, instead of the conventional pump-probe method which uses delay lines for picosecond and faster time resolution, or fast detectors and oscilloscopes on longer timescales. This new method is particularly suitable for situations where the probe intensity is weak and/or the detector is noisy. When the detector is noisy, there is in principle a signal to noise advantage over conventional pump-probe methods. © The Author(s) 2016.

Integrated readout electronics for Belle II pixel detector

NASA Astrophysics Data System (ADS)

Blanco, R.; Leys, R.; Perić, I.

2018-03-01

This paper describes the readout components for Belle II that have been designed as integrated circuits. The ICs are connected to DEPFET sensor by bump bonding. Three types of ICs have been developed: SWITCHER for pixel matrix control, DCD for readout and digitizing of sensor signals and DHP for digital data processing. The ICs are radiation tolerant and use several novel features, such as the multiple-input differential amplifiers and the fast and radiation hard high-voltage drivers. SWITCHER and DCD have been developed at University of Heidelberg, Karlsruhe Institute of Technology (KIT) and DHP at Bonn University. The IC-development started in 2009 and was accomplished in 2016 with the submissions of final designs. The final ICs for Belle II pixel detector and the related measurement results will be presented in this contribution.

A Parallel Multiclassification Algorithm for Big Data Using an Extreme Learning Machine.

PubMed

Duan, Mingxing; Li, Kenli; Liao, Xiangke; Li, Keqin

2018-06-01

As data sets become larger and more complicated, an extreme learning machine (ELM) that runs in a traditional serial environment cannot realize its ability to be fast and effective. Although a parallel ELM (PELM) based on MapReduce to process large-scale data shows more efficient learning speed than identical ELM algorithms in a serial environment, some operations, such as intermediate results stored on disks and multiple copies for each task, are indispensable, and these operations create a large amount of extra overhead and degrade the learning speed and efficiency of the PELMs. In this paper, an efficient ELM based on the Spark framework (SELM), which includes three parallel subalgorithms, is proposed for big data classification. By partitioning the corresponding data sets reasonably, the hidden layer output matrix calculation algorithm, matrix decomposition algorithm, and matrix decomposition algorithm perform most of the computations locally. At the same time, they retain the intermediate results in distributed memory and cache the diagonal matrix as broadcast variables instead of several copies for each task to reduce a large amount of the costs, and these actions strengthen the learning ability of the SELM. Finally, we implement our SELM algorithm to classify large data sets. Extensive experiments have been conducted to validate the effectiveness of the proposed algorithms. As shown, our SELM achieves an speedup on a cluster with ten nodes, and reaches a speedup with 15 nodes, an speedup with 20 nodes, a speedup with 25 nodes, a speedup with 30 nodes, and a speedup with 35 nodes.

Fast Low-Rank Bayesian Matrix Completion With Hierarchical Gaussian Prior Models

NASA Astrophysics Data System (ADS)

Yang, Linxiao; Fang, Jun; Duan, Huiping; Li, Hongbin; Zeng, Bing

2018-06-01

The problem of low rank matrix completion is considered in this paper. To exploit the underlying low-rank structure of the data matrix, we propose a hierarchical Gaussian prior model, where columns of the low-rank matrix are assumed to follow a Gaussian distribution with zero mean and a common precision matrix, and a Wishart distribution is specified as a hyperprior over the precision matrix. We show that such a hierarchical Gaussian prior has the potential to encourage a low-rank solution. Based on the proposed hierarchical prior model, a variational Bayesian method is developed for matrix completion, where the generalized approximate massage passing (GAMP) technique is embedded into the variational Bayesian inference in order to circumvent cumbersome matrix inverse operations. Simulation results show that our proposed method demonstrates superiority over existing state-of-the-art matrix completion methods.

Matrix multiplication operations using pair-wise load and splat operations

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

Eichenberger, Alexandre E.; Gschwind, Michael K.; Gunnels, John A.

Mechanisms for performing a matrix multiplication operation are provided. A vector load operation is performed to load a first vector operand of the matrix multiplication operation to a first target vector register. A pair-wise load and splat operation is performed to load a pair of scalar values of a second vector operand and replicate the pair of scalar values within a second target vector register. An operation is performed on elements of the first target vector register and elements of the second target vector register to generate a partial product of the matrix multiplication operation. The partial product is accumulatedmore » with other partial products and a resulting accumulated partial product is stored. This operation may be repeated for a second pair of scalar values of the second vector operand.« less

Distorted Born iterative T-matrix method for inversion of CSEM data in anisotropic media

NASA Astrophysics Data System (ADS)

Jakobsen, Morten; Tveit, Svenn

2018-05-01

We present a direct iterative solutions to the nonlinear controlled-source electromagnetic (CSEM) inversion problem in the frequency domain, which is based on a volume integral equation formulation of the forward modelling problem in anisotropic conductive media. Our vectorial nonlinear inverse scattering approach effectively replaces an ill-posed nonlinear inverse problem with a series of linear ill-posed inverse problems, for which there already exist efficient (regularized) solution methods. The solution update the dyadic Green's function's from the source to the scattering-volume and from the scattering-volume to the receivers, after each iteration. The T-matrix approach of multiple scattering theory is used for efficient updating of all dyadic Green's functions after each linearized inversion step. This means that we have developed a T-matrix variant of the Distorted Born Iterative (DBI) method, which is often used in the acoustic and electromagnetic (medical) imaging communities as an alternative to contrast-source inversion. The main advantage of using the T-matrix approach in this context, is that it eliminates the need to perform a full forward simulation at each iteration of the DBI method, which is known to be consistent with the Gauss-Newton method. The T-matrix allows for a natural domain decomposition, since in the sense that a large model can be decomposed into an arbitrary number of domains that can be treated independently and in parallel. The T-matrix we use for efficient model updating is also independent of the source-receiver configuration, which could be an advantage when performing fast-repeat modelling and time-lapse inversion. The T-matrix is also compatible with the use of modern renormalization methods that can potentially help us to reduce the sensitivity of the CSEM inversion results on the starting model. To illustrate the performance and potential of our T-matrix variant of the DBI method for CSEM inversion, we performed a numerical experiments based on synthetic CSEM data associated with 2D VTI and 3D orthorombic model inversions. The results of our numerical experiment suggest that the DBIT method for inversion of CSEM data in anisotropic media is both accurate and efficient.

Pre-Processed Recursive Lattice Reduction for Complexity Reduction in Spatially and Temporally Correlated MIMO Channels

NASA Astrophysics Data System (ADS)

An, Chan-Ho; Yang, Janghoon; Jang, Seunghun; Kim, Dong Ku

In this letter, a pre-processed lattice reduction (PLR) scheme is developed for the lattice reduction aided (LRA) detection of multiple input multiple-output (MIMO) systems in spatially correlated channel. The PLR computes the LLL-reduced matrix of the equivalent matrix, which is the product of the present channel matrix and unimodular transformation matrix for LR of spatial correlation matrix, rather than the present channel matrix itself. In conjunction with PLR followed by recursive lattice reduction (RLR) scheme [7], pre-processed RLR (PRLR) is shown to efficiently carry out the LR of the channel matrix, especially for the burst packet message in spatially and temporally correlated channel while matching the performance of conventional LRA detection.

A hybrid method for transient wave propagation in a multilayered solid

NASA Astrophysics Data System (ADS)

Tian, Jiayong; Xie, Zhoumin

2009-08-01

We present a hybrid method for the evaluation of transient elastic-wave propagation in a multilayered solid, integrating reverberation matrix method with the theory of generalized rays. Adopting reverberation matrix formulation, Laplace-Fourier domain solutions of elastic waves in the multilayered solid are expanded into the sum of a series of generalized-ray group integrals. Each generalized-ray group integral containing Kth power of reverberation matrix R represents the set of K-times reflections and refractions of source waves arriving at receivers in the multilayered solid, which was computed by fast inverse Laplace transform (FILT) and fast Fourier transform (FFT) algorithms. However, the calculation burden and low precision of FILT-FFT algorithm limit the application of reverberation matrix method. In this paper, we expand each of generalized-ray group integrals into the sum of a series of generalized-ray integrals, each of which is accurately evaluated by Cagniard-De Hoop method in the theory of generalized ray. The numerical examples demonstrate that the proposed method makes it possible to calculate the early-time transient response in the complex multilayered-solid configuration efficiently.

Minimizing energy dissipation of matrix multiplication kernel on Virtex-II

NASA Astrophysics Data System (ADS)

Choi, Seonil; Prasanna, Viktor K.; Jang, Ju-wook

2002-07-01

In this paper, we develop energy-efficient designs for matrix multiplication on FPGAs. To analyze the energy dissipation, we develop a high-level model using domain-specific modeling techniques. In this model, we identify architecture parameters that significantly affect the total energy (system-wide energy) dissipation. Then, we explore design trade-offs by varying these parameters to minimize the system-wide energy. For matrix multiplication, we consider a uniprocessor architecture and a linear array architecture to develop energy-efficient designs. For the uniprocessor architecture, the cache size is a parameter that affects the I/O complexity and the system-wide energy. For the linear array architecture, the amount of storage per processing element is a parameter affecting the system-wide energy. By using maximum amount of storage per processing element and minimum number of multipliers, we obtain a design that minimizes the system-wide energy. We develop several energy-efficient designs for matrix multiplication. For example, for 6×6 matrix multiplication, energy savings of upto 52% for the uniprocessor architecture and 36% for the linear arrary architecture is achieved over an optimized library for Virtex-II FPGA from Xilinx.

Reducing Actinide Production Using Inert Matrix Fuels

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

Deinert, Mark

2017-08-23

The environmental and geopolitical problems that surround nuclear power stem largely from the longlived transuranic isotopes of Am, Cm, Np and Pu that are contained in spent nuclear fuel. New methods for transmuting these elements into more benign forms are needed. Current research efforts focus largely on the development of fast burner reactors, because it has been shown that they could dramatically reduce the accumulation of transuranics. However, despite five decades of effort, fast reactors have yet to achieve industrial viability. A critical limitation to this, and other such strategies, is that they require a type of spent fuel reprocessingmore » that can efficiently separate all of the transuranics from the fission products with which they are mixed. Unfortunately, the technology for doing this on an industrial scale is still in development. In this project, we explore a strategy for transmutation that can be deployed using existing, current generation reactors and reprocessing systems. We show that use of an inert matrix fuel to recycle transuranics in a conventional pressurized water reactor could reduce overall production of these materials by an amount that is similar to what is achievable using proposed fast reactor cycles. Furthermore, we show that these transuranic reductions can be achieved even if the fission products are carried into the inert matrix fuel along with the transuranics, bypassing the critical separations hurdle described above. The implications of these findings are significant, because they imply that inert matrix fuel could be made directly from the material streams produced by the commercially available PUREX process. Zirconium dioxide would be an ideal choice of inert matrix in this context because it is known to form a stable solid solution with both fission products and transuranics.« less

Validation of a simple and fast method to quantify in vitro mineralization with fluorescent probes used in molecular imaging of bone

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

Moester, Martiene J.C.; Schoeman, Monique A.E.; Oudshoorn, Ineke B.

2014-01-03

Highlights: •We validate a simple and fast method of quantification of in vitro mineralization. •Fluorescently labeled agents can detect calcium deposits in the mineralized matrix of cell cultures. •Fluorescent signals of the probes correlated with Alizarin Red S staining. -- Abstract: Alizarin Red S staining is the standard method to indicate and quantify matrix mineralization during differentiation of osteoblast cultures. KS483 cells are multipotent mouse mesenchymal progenitor cells that can differentiate into chondrocytes, adipocytes and osteoblasts and are a well-characterized model for the study of bone formation. Matrix mineralization is the last step of differentiation of bone cells and ismore » therefore a very important outcome measure in bone research. Fluorescently labelled calcium chelating agents, e.g. BoneTag and OsteoSense, are currently used for in vivo imaging of bone. The aim of the present study was to validate these probes for fast and simple detection and quantification of in vitro matrix mineralization by KS483 cells and thus enabling high-throughput screening experiments. KS483 cells were cultured under osteogenic conditions in the presence of compounds that either stimulate or inhibit osteoblast differentiation and thereby matrix mineralization. After 21 days of differentiation, fluorescence of stained cultures was quantified with a near-infrared imager and compared to Alizarin Red S quantification. Fluorescence of both probes closely correlated to Alizarin Red S staining in both inhibiting and stimulating conditions. In addition, both compounds displayed specificity for mineralized nodules. We therefore conclude that this method of quantification of bone mineralization using fluorescent compounds is a good alternative for the Alizarin Red S staining.« less

Multi-Target Angle Tracking Algorithm for Bistatic Multiple-Input Multiple-Output (MIMO) Radar Based on the Elements of the Covariance Matrix.

PubMed

Zhang, Zhengyan; Zhang, Jianyun; Zhou, Qingsong; Li, Xiaobo

2018-03-07

In this paper, we consider the problem of tracking the direction of arrivals (DOA) and the direction of departure (DOD) of multiple targets for bistatic multiple-input multiple-output (MIMO) radar. A high-precision tracking algorithm for target angle is proposed. First, the linear relationship between the covariance matrix difference and the angle difference of the adjacent moment was obtained through three approximate relations. Then, the proposed algorithm obtained the relationship between the elements in the covariance matrix difference. On this basis, the performance of the algorithm was improved by averaging the covariance matrix element. Finally, the least square method was used to estimate the DOD and DOA. The algorithm realized the automatic correlation of the angle and provided better performance when compared with the adaptive asymmetric joint diagonalization (AAJD) algorithm. The simulation results demonstrated the effectiveness of the proposed algorithm. The algorithm provides the technical support for the practical application of MIMO radar.

Detecting earthquakes over a seismic network using single-station similarity measures

NASA Astrophysics Data System (ADS)

Bergen, Karianne J.; Beroza, Gregory C.

2018-06-01

New blind waveform-similarity-based detection methods, such as Fingerprint and Similarity Thresholding (FAST), have shown promise for detecting weak signals in long-duration, continuous waveform data. While blind detectors are capable of identifying similar or repeating waveforms without templates, they can also be susceptible to false detections due to local correlated noise. In this work, we present a set of three new methods that allow us to extend single-station similarity-based detection over a seismic network; event-pair extraction, pairwise pseudo-association, and event resolution complete a post-processing pipeline that combines single-station similarity measures (e.g. FAST sparse similarity matrix) from each station in a network into a list of candidate events. The core technique, pairwise pseudo-association, leverages the pairwise structure of event detections in its network detection model, which allows it to identify events observed at multiple stations in the network without modeling the expected moveout. Though our approach is general, we apply it to extend FAST over a sparse seismic network. We demonstrate that our network-based extension of FAST is both sensitive and maintains a low false detection rate. As a test case, we apply our approach to 2 weeks of continuous waveform data from five stations during the foreshock sequence prior to the 2014 Mw 8.2 Iquique earthquake. Our method identifies nearly five times as many events as the local seismicity catalogue (including 95 per cent of the catalogue events), and less than 1 per cent of these candidate events are false detections.

Indirect fabrication of multiple post-and-core patterns with a vinyl polysiloxane matrix.

PubMed

Sabbak, Sahar Asaad

2002-11-01

In the described technique, a vinyl polysiloxane material is used as a matrix for the indirect fabrication of multiple custom-cast posts and cores. The matrix technique enables the clinician to fabricate multiple posts and cores in a short period of time. The form, harmony, and common axis of preparation for all cores are well controlled before the definitive crown/fixed partial denture restorations are fabricated. Oral tissues are not exposed to the heat of polymerization or the excess monomer of the resin material when this technique is used.

Evolution of worldwide stock markets, correlation structure, and correlation-based graphs

NASA Astrophysics Data System (ADS)

Song, Dong-Ming; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N.

2011-08-01

We investigate the daily correlation present among market indices of stock exchanges located all over the world in the time period January 1996 to July 2009. We discover that the correlation among market indices presents both a fast and a slow dynamics. The slow dynamics reflects the development and consolidation of globalization. The fast dynamics is associated with critical events that originate in a specific country or region of the world and rapidly affect the global system. We provide evidence that the short term time scale of correlation among market indices is less than 3 trading months (about 60 trading days). The average values of the nondiagonal elements of the correlation matrix, correlation-based graphs, and the spectral properties of the largest eigenvalues and eigenvectors of the correlation matrix are carrying information about the fast and slow dynamics of the correlation of market indices. We introduce a measure of mutual information based on link co-occurrence in networks in order to detect the fast dynamics of successive changes of correlation-based graphs in a quantitative way.

Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

DOE PAGES

Azad, Ariful; Ballard, Grey; Buluc, Aydin; ...

2016-11-08

Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdös-Rényi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first implementation of the 3D SpGEMM formulation that exploits multiple (intranode and internode) levels of parallelism, achievingmore » significant speedups over the state-of-the-art publicly available codes at all levels of concurrencies. We extensively evaluate our implementation and identify bottlenecks that should be subject to further research.« less

Complex matrix multiplication operations with data pre-conditioning in a high performance computing architecture

DOEpatents

Eichenberger, Alexandre E; Gschwind, Michael K; Gunnels, John A

2014-02-11

Mechanisms for performing a complex matrix multiplication operation are provided. A vector load operation is performed to load a first vector operand of the complex matrix multiplication operation to a first target vector register. The first vector operand comprises a real and imaginary part of a first complex vector value. A complex load and splat operation is performed to load a second complex vector value of a second vector operand and replicate the second complex vector value within a second target vector register. The second complex vector value has a real and imaginary part. A cross multiply add operation is performed on elements of the first target vector register and elements of the second target vector register to generate a partial product of the complex matrix multiplication operation. The partial product is accumulated with other partial products and a resulting accumulated partial product is stored in a result vector register.

Compressed sensing of hyperspectral images based on scrambled block Hadamard ensemble

NASA Astrophysics Data System (ADS)

Wang, Li; Feng, Yan

2016-11-01

A fast measurement matrix based on scrambled block Hadamard ensemble for compressed sensing (CS) of hyperspectral images (HSI) is investigated. The proposed measurement matrix offers several attractive features. First, the proposed measurement matrix possesses Gaussian behavior, which illustrates that the matrix is universal and requires a near-optimal number of samples for exact reconstruction. In addition, it could be easily implemented in the optical domain due to its integer-valued elements. More importantly, the measurement matrix only needs small memory for storage in the sampling process. Experimental results on HSIs reveal that the reconstruction performance of the proposed measurement matrix is comparable or better than Gaussian matrix and Bernoulli matrix using different reconstruction algorithms while consuming less computational time. The proposed matrix could be used in CS of HSI, which would save the storage memory on board, improve the sampling efficiency, and ameliorate the reconstruction quality.

Advances in vascular tissue engineering.

PubMed

Thomas, Anita C; Campbell, Gordon R; Campbell, Julie H

2003-01-01

Coronary and peripheral artery bypass grafting is commonly used to relieve the symptoms of vascular deficiencies, but the supply of autologous artery or vein may not be sufficient or suitable for multiple bypass or repeat procedures, necessitating the use of other materials. Synthetic materials are suitable for large bore arteries but often thrombose when used in smaller arteries. Suitable replacement grafts must have appropriate characteristics, including resistance to infection, low immunogenicity and good biocompatability and thromboresistance, with appropriate mechanical and physiological properties and cheap and fast manufacture. Current avenues of graft development include coating synthetic grafts with either biological chemicals or cells with anticoagulatory properties. Matrix templates or acellular tubes of extracellular matrix (such as collagen) may be coated or infiltrated with cultured cells. Once placed into the artery, these grafts may become colonised by host cells and gain many of the properties of normal artery. "Tissue-engineered blood vessels" may also be formed from layers of human vascular cells grown in culture. These engineered vessels have many of the characteristics of arteries formed in vivo. "Artificial arteries" may be also be derived from peritoneal granulation tissue in body "bioreactors" by adapting the body's natural wound healing response to produce a hollow tube.

One Shot Detection with Laplacian Object and Fast Matrix Cosine Similarity.

PubMed

Biswas, Sujoy Kumar; Milanfar, Peyman

2016-03-01

One shot, generic object detection involves searching for a single query object in a larger target image. Relevant approaches have benefited from features that typically model the local similarity patterns. In this paper, we combine local similarity (encoded by local descriptors) with a global context (i.e., a graph structure) of pairwise affinities among the local descriptors, embedding the query descriptors into a low dimensional but discriminatory subspace. Unlike principal components that preserve global structure of feature space, we actually seek a linear approximation to the Laplacian eigenmap that permits us a locality preserving embedding of high dimensional region descriptors. Our second contribution is an accelerated but exact computation of matrix cosine similarity as the decision rule for detection, obviating the computationally expensive sliding window search. We leverage the power of Fourier transform combined with integral image to achieve superior runtime efficiency that allows us to test multiple hypotheses (for pose estimation) within a reasonably short time. Our approach to one shot detection is training-free, and experiments on the standard data sets confirm the efficacy of our model. Besides, low computation cost of the proposed (codebook-free) object detector facilitates rather straightforward query detection in large data sets including movie videos.

Compensation of matrix effects in gas chromatography-mass spectrometry analysis of pesticides using a combination of matrix matching and multiple isotopically labeled internal standards.

PubMed

Tsuchiyama, Tomoyuki; Katsuhara, Miki; Nakajima, Masahiro

2017-11-17

In the multi-residue analysis of pesticides using GC-MS, the quantitative results are adversely affected by a phenomenon known as the matrix effect. Although the use of matrix-matched standards is considered to be one of the most practical solutions to this problem, complete removal of the matrix effect is difficult in complex food matrices owing to their inconsistency. As a result, residual matrix effects can introduce analytical errors. To compensate for residual matrix effects, we have developed a novel method that employs multiple isotopically labeled internal standards (ILIS). The matrix effects of ILIS and pesticides were evaluated in spiked matrix extracts of various agricultural commodities, and the obtained data were subjected to simple statistical analysis. Based on the similarities between the patterns of variation in the analytical response, a total of 32 isotopically labeled compounds were assigned to 338 pesticides as internal standards. It was found that by utilizing multiple ILIS, residual matrix effects could be effectively compensated. The developed method exhibited superior quantitative performance compared with the common single-internal-standard method. The proposed method is more feasible for regulatory purposes than that using only predetermined correction factors and is considered to be promising for practical applications. Copyright © 2017 Elsevier B.V. All rights reserved.

VX fate on common matrices: evaporation versus degradation.

PubMed

Columbus, Ishay; Waysbort, Daniel; Marcovitch, Itzhak; Yehezkel, Lea; Mizrahi, Dana M

2012-04-03

A study of the volatilization rate of the nerve agent VX (O-ethyl S-2-(N,N-diisopropylamino)ethyl methylphosphonothiolate) from various urban matrices in a specially designed climatic chamber (model system) is described. The performance of the model system combined with the analytical procedure produced profiles of vapor concentration obtained from samples of VX dispersed as small droplets on the surfaces of the matrices. The results indicated that the bitumen-containing surfaces such as asphalt blocks and bitumen sheets conserve VX and slow-release part of it over a long period of time. No complete mass balance could be obtained for these surfaces. Influence of environmental and experimental parameters as well as the efficacy of decontamination procedure were also measured. From smooth surface tiles a fast release of VX was measured and almost a complete mass balance was obtained, which characterizes the behavior of inert surfaces. Experiments carried out on concrete blocks showed fast decay of the concentration profile along with a very poor reconstruction of the initial quantity of VX, implying that this matrix degraded VX actively due to its multiple basic catalytic sites. To complement this study, solid-state NMR measurements were compared to add data concerning agent-fate within the matrices.

An improved data integration algorithm to constrain the 3D displacement field induced by fast deformation phenomena tested on the Napa Valley earthquake

NASA Astrophysics Data System (ADS)

Polcari, Marco; Fernández, José; Albano, Matteo; Bignami, Christian; Palano, Mimmo; Stramondo, Salvatore

2017-12-01

In this work, we propose an improved algorithm to constrain the 3D ground displacement field induced by fast surface deformations due to earthquakes or landslides. Based on the integration of different data, we estimate the three displacement components by solving a function minimization problem from the Bayes theory. We exploit the outcomes from SAR Interferometry (InSAR), Global Positioning System (GNSS) and Multiple Aperture Interferometry (MAI) to retrieve the 3D surface displacement field. Any other source of information can be added to the processing chain in a simple way, being the algorithm computationally efficient. Furthermore, we use the intensity Pixel Offset Tracking (POT) to locate the discontinuity produced on the surface by a sudden deformation phenomenon and then improve the GNSS data interpolation. This approach allows to be independent from other information such as in-situ investigations, tectonic studies or knowledge of the data covariance matrix. We applied such a method to investigate the ground deformation field related to the 2014 Mw 6.0 Napa Valley earthquake, occurred few kilometers from the San Andreas fault system.

Monte Carlo-based fluorescence molecular tomography reconstruction method accelerated by a cluster of graphic processing units.

PubMed

Quan, Guotao; Gong, Hui; Deng, Yong; Fu, Jianwei; Luo, Qingming

2011-02-01

High-speed fluorescence molecular tomography (FMT) reconstruction for 3-D heterogeneous media is still one of the most challenging problems in diffusive optical fluorescence imaging. In this paper, we propose a fast FMT reconstruction method that is based on Monte Carlo (MC) simulation and accelerated by a cluster of graphics processing units (GPUs). Based on the Message Passing Interface standard, we modified the MC code for fast FMT reconstruction, and different Green's functions representing the flux distribution in media are calculated simultaneously by different GPUs in the cluster. A load-balancing method was also developed to increase the computational efficiency. By applying the Fréchet derivative, a Jacobian matrix is formed to reconstruct the distribution of the fluorochromes using the calculated Green's functions. Phantom experiments have shown that only 10 min are required to get reconstruction results with a cluster of 6 GPUs, rather than 6 h with a cluster of multiple dual opteron CPU nodes. Because of the advantages of high accuracy and suitability for 3-D heterogeneity media with refractive-index-unmatched boundaries from the MC simulation, the GPU cluster-accelerated method provides a reliable approach to high-speed reconstruction for FMT imaging.

Neutron Multiplicity: LANL W Covariance Matrix for Curve Fitting

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

Wendelberger, James G.

2016-12-08

In neutron multiplicity counting one may fit a curve by minimizing an objective function, χmore » $$2\\atop{n}$$. The objective function includes the inverse of an n by n matrix of covariances, W. The inverse of the W matrix has a closed form solution. In addition W -1 is a tri-diagonal matrix. The closed form and tridiagonal nature allows for a simpler expression of the objective function χ$$2\\atop{n}$$. Minimization of this simpler expression will provide the optimal parameters for the fitted curve.« less

Polylactide-based polyurethane shape memory nanocomposites (Fe3O4/PLAUs) with fast magnetic responsiveness

NASA Astrophysics Data System (ADS)

Gu, Shu-Ying; Jin, Sheng-Peng; Gao, Xie-Feng; Mu, Jian

2016-05-01

Polylactide-based polyurethane shape memory nanocomposites (Fe3O4/PLAUs) with fast magnetic responsiveness are presented. For the purpose of fast response and homogeneous dispersion of magnetic nanoparticles, oleic acid was used to improve the dispersibility of Fe3O4 nanoparticles in a polymer matrix. A homogeneous distribution of Fe3O4 nanoparticles in the polymer matrix was obtained for nanocomposites with low Fe3O4 loading content. A small agglomeration was observed for nanocomposites with 6 wt% and 9 wt% loading content, leading to a small decline in the mechanical properties. PLAU and its nanocomposites have glass transition around 52 °C, which can be used as the triggering temperature. PLAU and its nanocomposites have shape fixity ratios above 99%, shape recovery ratios above 82% for the first cycle and shape recovery ratios above 91% for the second cycle. PLAU and its nanocomposites also exhibit a fast water bath or magnetic responsiveness. The magnetic recovery time decreases with an increase in the loading content of Fe3O4 nanoparticles due to an improvement in heating performance for increased weight percentage of fillers. The nanocomposites have fast responses in an alternating magnetic field and have potential application in biomedical areas such as intravascular stent.

Adaptive Inverse Control for Rotorcraft Vibration Reduction

NASA Technical Reports Server (NTRS)

Jacklin, Stephen A.

1985-01-01

This thesis extends the Least Mean Square (LMS) algorithm to solve the mult!ple-input, multiple-output problem of alleviating N/Rev (revolutions per minute by number of blades) helicopter fuselage vibration by means of adaptive inverse control. A frequency domain locally linear model is used to represent the transfer matrix relating the higher harmonic pitch control inputs to the harmonic vibration outputs to be controlled. By using the inverse matrix as the controller gain matrix, an adaptive inverse regulator is formed to alleviate the N/Rev vibration. The stability and rate of convergence properties of the extended LMS algorithm are discussed. It is shown that the stability ranges for the elements of the stability gain matrix are directly related to the eigenvalues of the vibration signal information matrix for the learning phase, but not for the control phase. The overall conclusion is that the LMS adaptive inverse control method can form a robust vibration control system, but will require some tuning of the input sensor gains, the stability gain matrix, and the amount of control relaxation to be used. The learning curve of the controller during the learning phase is shown to be quantitatively close to that predicted by averaging the learning curves of the normal modes. For higher order transfer matrices, a rough estimate of the inverse is needed to start the algorithm efficiently. The simulation results indicate that the factor which most influences LMS adaptive inverse control is the product of the control relaxation and the the stability gain matrix. A small stability gain matrix makes the controller less sensitive to relaxation selection, and permits faster and more stable vibration reduction, than by choosing the stability gain matrix large and the control relaxation term small. It is shown that the best selections of the stability gain matrix elements and the amount of control relaxation is basically a compromise between slow, stable convergence and fast convergence with increased possibility of unstable identification. In the simulation studies, the LMS adaptive inverse control algorithm is shown to be capable of adapting the inverse (controller) matrix to track changes in the flight conditions. The algorithm converges quickly for moderate disturbances, while taking longer for larger disturbances. Perfect knowledge of the inverse matrix is not required for good control of the N/Rev vibration. However it is shown that measurement noise will prevent the LMS adaptive inverse control technique from controlling the vibration, unless the signal averaging method presented is incorporated into the algorithm.

Fast Electromagnetic Solvers for Large-Scale Naval Scattering Problems

DTIC Science & Technology

2008-09-27

IEEE Trans. Antennas Propag., vol. 52, no. 8, pp. 2141–2146, 2004. [12] R. J. Burkholder and J. F. Lee, “Fast dual-MGS block-factorization algorithm...Golub and C. F. V. Loan, Matrix Computations. Baltimore: The Johns Hopkins University Press, 1996. [20] W. D. Li, W. Hong, and H. X. Zhou, “Integral

Intelligent peak deconvolution through in-depth study of the data matrix from liquid chromatography coupled with a photo-diode array detector applied to pharmaceutical analysis.

PubMed

Arase, Shuntaro; Horie, Kanta; Kato, Takashi; Noda, Akira; Mito, Yasuhiro; Takahashi, Masatoshi; Yanagisawa, Toshinobu

2016-10-21

Multivariate curve resolution-alternating least squares (MCR-ALS) method was investigated for its potential to accelerate pharmaceutical research and development. The fast and efficient separation of complex mixtures consisting of multiple components, including impurities as well as major drug substances, remains a challenging application for liquid chromatography in the field of pharmaceutical analysis. In this paper we suggest an integrated analysis algorithm functioning on a matrix of data generated from HPLC coupled with photo-diode array detector (HPLC-PDA) and consisting of the mathematical program for the developed multivariate curve resolution method using an expectation maximization (EM) algorithm with a bidirectional exponentially modified Gaussian (BEMG) model function as a constraint for chromatograms and numerous PDA spectra aligned with time axis. The algorithm provided less than ±1.0% error between true and separated peak area values at resolution (R s ) of 0.6 using simulation data for a three-component mixture with an elution order of a/b/c with similarity (a/b)=0.8410, (b/c)=0.9123 and (a/c)=0.9809 of spectra at peak apex. This software concept provides fast and robust separation analysis even when method development efforts fail to achieve complete separation of the target peaks. Additionally, this approach is potentially applicable to peak deconvolution, allowing quantitative analysis of co-eluted compounds having exactly the same molecular weight. This is complementary to the use of LC-MS to perform quantitative analysis on co-eluted compounds using selected ions to differentiate the proportion of response attributable to each compound. Copyright © 2016 Elsevier B.V. All rights reserved.

Piezoelectric T-matrix approach and multiple scattering of electroacoustic waves in thin plates

NASA Astrophysics Data System (ADS)

Darabi, Amir; Ruzzene, Massimo; Leamy, Michael J.

2017-12-01

Metamaterial-enhanced harvesting (MEH) of wave energy in thin plates and other structures has appeared recently for powering small sensors and devices. To support continued MEH concept development, this paper proposes a fully coupled T-matrix formulation for analyzing scattering of incident wave energy from a piezoelectric patch attached to a thin plate. More generally, the T-matrix represents an input-output relationship between incident and reflected waves from inclusions in a host layer, and is introduced herein for a piezoelectric patch connected to an external circuit. The utility of a T-matrix formalism is most apparent in scenarios employing multiple piezoelectric harvesters, where it can be re-used with other T-matrices (such as those previously formulated for rigid, void, and elastic inclusions) in a multiple scattering context to compute the total wavefield and other response quantities, such as harvested power. Following development of the requisite T-matrix, harvesting in an example funnel-shaped metamaterial waveguide structure is predicted using the multiple scattering approach. Enhanced wave energy harvesting predictions are verified through comparisons to experimental results of a funnel-shaped waveguide formed by placing rigid aluminum inclusions in, and multiple piezoelectric harvesters on, a Lexan plate. Good agreement with predicted response quantities is noted.

Development of an on-line flow injection Sr/matrix separation method for accurate, high-throughput determination of Sr isotope ratios by multiple collector-inductively coupled plasma-mass spectrometry.

PubMed

Galler, Patrick; Limbeck, Andreas; Boulyga, Sergei F; Stingeder, Gerhard; Hirata, Takafumi; Prohaska, Thomas

2007-07-01

This work introduces a newly developed on-line flow injection (FI) Sr/Rb separation method as an alternative to the common, manual Sr/matrix batch separation procedure, since total analysis time is often limited by sample preparation despite the fast rate of data acquisition possible by inductively coupled plasma-mass spectrometers (ICPMS). Separation columns containing approximately 100 muL of Sr-specific resin were used for on-line FI Sr/matrix separation with subsequent determination of (87)Sr/(86)Sr isotope ratios by multiple collector ICPMS. The occurrence of memory effects exhibited by the Sr-specific resin, a major restriction to the repetitive use of this costly material, could successfully be overcome. The method was fully validated by means of certified reference materials. A set of two biological and six geological Sr- and Rb-bearing samples was successfully characterized for its (87)Sr/(86)Sr isotope ratios with precisions of 0.01-0.04% 2 RSD (n = 5-10). Based on our measurements we suggest (87)Sr/(86)Sr isotope ratios of 0.713 15 +/- 0.000 16 (2 SD) and 0.709 31 +/- 0.000 06 (2 SD) for the NIST SRM 1400 bone ash and the NIST SRM 1486 bone meal, respectively. Measured (87)Sr/(86)Sr isotope ratios for five basalt samples are in excellent agreement with published data with deviations from the published value ranging from 0 to 0.03%. A mica sample with a Rb/Sr ratio of approximately 1 was successfully characterized for its (87)Sr/(86)Sr isotope signature to be 0.718 24 +/- 0.000 29 (2 SD) by the proposed method. Synthetic samples with Rb/Sr ratios of up to 10/1 could successfully be measured without significant interferences on mass 87, which would otherwise bias the accuracy and uncertainty of the obtained data.

Treatment of multiple adjacent Miller Class I and II gingival recessions with collagen matrix and the modified coronally advanced tunnel technique.

PubMed

Molnár, Bálint; Aroca, Sofia; Keglevich, Tibor; Gera, István; Windisch, Péter; Stavropoulos, Andreas; Sculean, Anton

2013-01-01

To clinically evaluate the treatment of Miller Class I and II multiple adjacent gingival recessions using the modified coronally advanced tunnel technique combined with a newly developed bioresorbable collagen matrix of porcine origin. Eight healthy patients exhibiting at least three multiple Miller Class I and II multiple adjacent gingival recessions (a total of 42 recessions) were consecutively treated by means of the modified coronally advanced tunnel technique and collagen matrix. The following clinical parameters were assessed at baseline and 12 months postoperatively: full mouth plaque score (FMPS), full mouth bleeding score (FMBS), probing depth (PD), recession depth (RD), recession width (RW), keratinized tissue thickness (KTT), and keratinized tissue width (KTW). The primary outcome variable was complete root coverage. Neither allergic reactions nor soft tissue irritations or matrix exfoliations occurred. Postoperative pain and discomfort were reported to be low, and patient acceptance was generally high. At 12 months, complete root coverage was obtained in 2 out of the 8 patients and 30 of the 42 recessions (71%). Within their limits, the present results indicate that treatment of Miller Class I and II multiple adjacent gingival recessions by means of the modified coronally advanced tunnel technique and collagen matrix may result in statistically and clinically significant complete root coverage. Further studies are warranted to evaluate the performance of collagen matrix compared with connective tissue grafts and other soft tissue grafts.

Bit-Table Based Biclustering and Frequent Closed Itemset Mining in High-Dimensional Binary Data

PubMed Central

Király, András; Abonyi, János

2014-01-01

During the last decade various algorithms have been developed and proposed for discovering overlapping clusters in high-dimensional data. The two most prominent application fields in this research, proposed independently, are frequent itemset mining (developed for market basket data) and biclustering (applied to gene expression data analysis). The common limitation of both methodologies is the limited applicability for very large binary data sets. In this paper we propose a novel and efficient method to find both frequent closed itemsets and biclusters in high-dimensional binary data. The method is based on simple but very powerful matrix and vector multiplication approaches that ensure that all patterns can be discovered in a fast manner. The proposed algorithm has been implemented in the commonly used MATLAB environment and freely available for researchers. PMID:24616651

SU-E-T-395: Multi-GPU-Based VMAT Treatment Plan Optimization Using a Column-Generation Approach

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

Tian, Z; Shi, F; Jia, X

Purpose: GPU has been employed to speed up VMAT optimizations from hours to minutes. However, its limited memory capacity makes it difficult to handle cases with a huge dose-deposition-coefficient (DDC) matrix, e.g. those with a large target size, multiple arcs, small beam angle intervals and/or small beamlet size. We propose multi-GPU-based VMAT optimization to solve this memory issue to make GPU-based VMAT more practical for clinical use. Methods: Our column-generation-based method generates apertures sequentially by iteratively searching for an optimal feasible aperture (referred as pricing problem, PP) and optimizing aperture intensities (referred as master problem, MP). The PP requires accessmore » to the large DDC matrix, which is implemented on a multi-GPU system. Each GPU stores a DDC sub-matrix corresponding to one fraction of beam angles and is only responsible for calculation related to those angles. Broadcast and parallel reduction schemes are adopted for inter-GPU data transfer. MP is a relatively small-scale problem and is implemented on one GPU. One headand- neck cancer case was used for test. Three different strategies for VMAT optimization on single GPU were also implemented for comparison: (S1) truncating DDC matrix to ignore its small value entries for optimization; (S2) transferring DDC matrix part by part to GPU during optimizations whenever needed; (S3) moving DDC matrix related calculation onto CPU. Results: Our multi-GPU-based implementation reaches a good plan within 1 minute. Although S1 was 10 seconds faster than our method, the obtained plan quality is worse. Both S2 and S3 handle the full DDC matrix and hence yield the same plan as in our method. However, the computation time is longer, namely 4 minutes and 30 minutes, respectively. Conclusion: Our multi-GPU-based VMAT optimization can effectively solve the limited memory issue with good plan quality and high efficiency, making GPUbased ultra-fast VMAT planning practical for real clinical use.« less

Feasibility of large volume tumor ablation using multiple-mode strategy with fast scanning method: A numerical study

NASA Astrophysics Data System (ADS)

Wu, Hao; Shen, Guofeng; Qiao, Shan; Chen, Yazhu

2017-03-01

Sonication with fast scanning method can generate homogeneous lesions without complex planning. But when the target region is large, switching focus too fast will reduce the heat accumulation, the margin of which may not ablated. Furthermore, high blood perfusion rate will reduce this maximum volume that can be ablated. Therefore, fast scanning method may not be applied to large volume tumor. To expand the therapy scope, this study combines the fast scan method with multiple mode strategy. Through simulation and experiment, the feasibility of this new strategy is evaluated and analyzed.

Visualizing Matrix Multiplication

ERIC Educational Resources Information Center

Daugulis, Peteris; Sondore, Anita

2018-01-01

Efficient visualizations of computational algorithms are important tools for students, educators, and researchers. In this article, we point out an innovative visualization technique for matrix multiplication. This method differs from the standard, formal approach by using block matrices to make computations more visual. We find this method a…

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.

The bilinear complexity and practical algorithms for matrix multiplication

NASA Astrophysics Data System (ADS)

Smirnov, A. V.

2013-12-01

A method for deriving bilinear algorithms for matrix multiplication is proposed. New estimates for the bilinear complexity of a number of problems of the exact and approximate multiplication of rectangular matrices are obtained. In particular, the estimate for the boundary rank of multiplying 3 × 3 matrices is improved and a practical algorithm for the exact multiplication of square n × n matrices is proposed. The asymptotic arithmetic complexity of this algorithm is O( n 2.7743).

Method and apparatus for optimized processing of sparse matrices

DOEpatents

Taylor, Valerie E.

1993-01-01

A computer architecture for processing a sparse matrix is disclosed. The apparatus stores a value-row vector corresponding to nonzero values of a sparse matrix. Each of the nonzero values is located at a defined row and column position in the matrix. The value-row vector includes a first vector including nonzero values and delimiting characters indicating a transition from one column to another. The value-row vector also includes a second vector which defines row position values in the matrix corresponding to the nonzero values in the first vector and column position values in the matrix corresponding to the column position of the nonzero values in the first vector. The architecture also includes a circuit for detecting a special character within the value-row vector. Matrix-vector multiplication is executed on the value-row vector. This multiplication is performed by multiplying an index value of the first vector value by a column value from a second matrix to form a matrix-vector product which is added to a previous matrix-vector product.

Targeting functional motifs of a protein family

NASA Astrophysics Data System (ADS)

Bhadola, Pradeep; Deo, Nivedita

2016-10-01

The structural organization of a protein family is investigated by devising a method based on the random matrix theory (RMT), which uses the physiochemical properties of the amino acid with multiple sequence alignment. A graphical method to represent protein sequences using physiochemical properties is devised that gives a fast, easy, and informative way of comparing the evolutionary distances between protein sequences. A correlation matrix associated with each property is calculated, where the noise reduction and information filtering is done using RMT involving an ensemble of Wishart matrices. The analysis of the eigenvalue statistics of the correlation matrix for the β -lactamase family shows the universal features as observed in the Gaussian orthogonal ensemble (GOE). The property-based approach captures the short- as well as the long-range correlation (approximately following GOE) between the eigenvalues, whereas the previous approach (treating amino acids as characters) gives the usual short-range correlations, while the long-range correlations are the same as that of an uncorrelated series. The distribution of the eigenvector components for the eigenvalues outside the bulk (RMT bound) deviates significantly from RMT observations and contains important information about the system. The information content of each eigenvector of the correlation matrix is quantified by introducing an entropic estimate, which shows that for the β -lactamase family the smallest eigenvectors (low eigenmodes) are highly localized as well as informative. These small eigenvectors when processed gives clusters involving positions that have well-defined biological and structural importance matching with experiments. The approach is crucial for the recognition of structural motifs as shown in β -lactamase (and other families) and selectively identifies the important positions for targets to deactivate (activate) the enzymatic actions.

A fast algorithm for forward-modeling of gravitational fields in spherical coordinates with 3D Gauss-Legendre quadrature

NASA Astrophysics Data System (ADS)

Zhao, G.; Liu, J.; Chen, B.; Guo, R.; Chen, L.

2017-12-01

Forward modeling of gravitational fields at large-scale requires to consider the curvature of the Earth and to evaluate the Newton's volume integral in spherical coordinates. To acquire fast and accurate gravitational effects for subsurface structures, subsurface mass distribution is usually discretized into small spherical prisms (called tesseroids). The gravity fields of tesseroids are generally calculated numerically. One of the commonly used numerical methods is the 3D Gauss-Legendre quadrature (GLQ). However, the traditional GLQ integration suffers from low computational efficiency and relatively poor accuracy when the observation surface is close to the source region. We developed a fast and high accuracy 3D GLQ integration based on the equivalence of kernel matrix, adaptive discretization and parallelization using OpenMP. The equivalence of kernel matrix strategy increases efficiency and reduces memory consumption by calculating and storing the same matrix elements in each kernel matrix just one time. In this method, the adaptive discretization strategy is used to improve the accuracy. The numerical investigations show that the executing time of the proposed method is reduced by two orders of magnitude compared with the traditional method that without these optimized strategies. High accuracy results can also be guaranteed no matter how close the computation points to the source region. In addition, the algorithm dramatically reduces the memory requirement by N times compared with the traditional method, where N is the number of discretization of the source region in the longitudinal direction. It makes the large-scale gravity forward modeling and inversion with a fine discretization possible.

Fast DNA sieving through submicrometer cylindrical glass capillary matrix.

PubMed

Cao, Zhen; Yobas, Levent

2014-01-07

Here, we report on DNA electrophoresis through a novel artificial sieving matrix based on the highly regular submicrometer cylindrical glass capillary segments alternatingly arranged with wells. Such round capillaries pose a higher-order confinement resulting in a lower partition coefficient and greater entropic energy barrier while limiting the driving field strength to a small fraction of the applied electric field. In return, the separation can be performed at high average field strengths (up to 1.6 kV/cm) without encountering the field-dependent loss of resolving power. This leads to fast DNA sieving as demonstrated here on the capillaries of 750 nm in diameter. The 600 bp to 21 kbp long chains are shown to resolve within 4 min after having undergone a fairly limited number of entropic barriers (128 in total). The capillary matrix also exhibits a critical field threshold below which DNA bands fail to launch, and this occurs at a considerably greater magnitude than in other matrixes. The submicrometer capillaries are batch-fabricated on silicon through a fabrication process that does not require high-resolution advanced lithography or well-controlled wafer bonding techniques to define their critical dimension.

Free Volume Structure of Acrylic-Type Dental Nanocomposites Tested with Annihilating Positrons.

PubMed

Shpotyuk, Olha; Ingram, Adam; Shpotyuk, Oleh

2016-12-01

Positron annihilation spectroscopy in lifetime measuring mode exploring conventional fast-fast coincidence ORTEC system is employed to characterize free volume structure of commercially available acrylic-type dental restorative composite Charisma® (Heraeus Kulzer GmbH, Germany). The measured lifetime spectra for uncured and light-cured composites are reconstructed from unconstrained x3-term fitting and semi-empirical model exploring x3-x2-coupling decomposition algorithm. The governing channel of positron annihilation in the composites studied is ascribed to mixed positron-Ps trapping, where Ps decaying in the third component is caused entirely by input from free-volume holes in polymer matrix, while the second component is defined by free positron trapping in interfacial free-volume holes between filler nanoparticles and surrounded polymer matrix. Microstructure scenario of the photopolymerization shrinkage includes cross-linking of structural chains in polymer matrix followed by conversion of bound positron-electron (positronium) traps in positron-trapping interfacial free-volume voids in a vicinity of agglomerated filler nanoparticles.

Progress on inert matrix fuels for minor actinide transmutation in fast reactor

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

Bonnerot, Jean-Marc; Ferroud-Plattet, Marie-Pierre; Lamontagne, Jerome

2007-07-01

An extensive irradiation program has been devoted by CEA to the assessment of transmutation using minor actinide bearing inert support targets. A first irradiation experiment was performed in the fast neutron reactor Phenix, in parallel to other experiments carried out in the HFR and Siloe reactors, in order to assess the behavior under fast neutron flux of various materials intended as inert support matrix for transmutation targets. This experiment, which included the two steps MATINA 1 and MATINA 1A, was completed in 2004 and underwent complete post irradiation examinations (PIE) , whose results are presented in this paper. All themore » pure inert materials showed a satisfactory behavior under fast neutrons except Al{sub 2}O{sub 3} - which exhibits a swelling close to 11 vol. % after irradiation. In presence of UO{sub 2} fissile particles, MgAl{sub 2}O{sub 4} proved to be more stable in term of swelling as inert support than MgO and Al{sub 2}O{sub 3} matrices, under the same irradiation conditions. A second experiment ECRIX H in Phenix involving composite pellets with an MgO matrix and AmO{sub 2-x} particles was completed in 2006. The very first PIE results on ECRIX H are described in this paper. At the light of these first experiments, a second phase dedicated to the design optimization of the target was initiated and three new irradiation experiments - MATINA 2-3, CAMIX COCHIX in Phenix and HELIOS in HFR - were started in 2006 and 2007. (authors)« less

Risk of falls in older people during fast-walking--the TASCOG study.

PubMed

Callisaya, M L; Blizzard, L; McGinley, J L; Srikanth, V K

2012-07-01

To investigate the relationship between fast-walking and falls in older people. Individuals aged 60-86 years were randomly selected from the electoral roll (n=176). Gait speed, step length, cadence and a walk ratio were recorded during preferred- and fast-walking using an instrumented walkway. Falls were recorded prospectively over 12 months. Log multinomial regression was used to estimate the relative risk of single and multiple falls associated with gait variables during fast-walking and change between preferred- and fast-walking. Covariates included age, sex, mood, physical activity, sensorimotor and cognitive measures. The risk of multiple falls was increased for those with a smaller walk ratio (shorter steps, faster cadence) during fast-walking (RR 0.92, CI 0.87, 0.97) and greater reduction in the walk ratio (smaller increase in step length, larger increase in cadence) when changing to fast-walking (RR 0.73, CI 0.63, 0.85). These gait patterns were associated with poorer physiological and cognitive function (p<0.05). A higher risk of multiple falls was also seen for those in the fastest quarter of gait speed (p=0.01) at fast-walking. A trend for better reaction time, balance, memory and physical activity for higher categories of gait speed was stronger for fallers than non-fallers (p<0.05). Tests of fast-walking may be useful in identifying older individuals at risk of multiple falls. There may be two distinct groups at risk--the frail person with short shuffling steps, and the healthy person exposed to greater risk. Copyright © 2012 Elsevier B.V. All rights reserved.

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…

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.

Notch sensitivity and stress redistribution in three ceramic-matrix composites

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

Mackin, T.J.; He, M.Y.; Evans, A.G.

Fiber-reinforced ceramic-matrix composites (CMCs) depend upon inelastic mechanisms to diffuse stress concentrations associated with holes, notches, and cracks. These mechanisms consist of fiber debonding and pullout, multiple matrix cracking, and shear band formation. In order to understand these effects, experiments have bee conducted on several double-edge-notched CMCs that exhibit different stress redistribution mechanisms. Stresses have been measured an d mechanisms identified by using a combination of methods including X0-ray imaging, edge replication, and thermoelastic analysis. Multiple matrix cracking was found to be the most effective stress redistribution mechanism.

Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems

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

Zheng, Bin; Chen, Luoping; Hu, Xiaozhe

2016-03-05

In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigatemore » the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.« less

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

Wu, J; Gong, G; Cui, Y

Purpose: To predict early pathological response of breast cancer to neoadjuvant chemotherapy (NAC) based on quantitative, multi-region analysis of dynamic contrast enhancement magnetic resonance imaging (DCE-MRI). Methods: In this institution review board-approved study, 35 patients diagnosed with stage II/III breast cancer were retrospectively investigated using DCE-MR images acquired before and after the first cycle of NAC. First, principal component analysis (PCA) was used to reduce the dimensionality of the DCE-MRI data with a high-temporal resolution. We then partitioned the whole tumor into multiple subregions using k-means clustering based on the PCA-defined eigenmaps. Within each tumor subregion, we extracted four quantitativemore » Haralick texture features based on the gray-level co-occurrence matrix (GLCM). The change in texture features in each tumor subregion between pre- and during-NAC was used to predict pathological complete response after NAC. Results: Three tumor subregions were identified through clustering, each with distinct enhancement characteristics. In univariate analysis, all imaging predictors except one extracted from the tumor subregion associated with fast wash-out were statistically significant (p< 0.05) after correcting for multiple testing, with area under the ROC curve or AUCs between 0.75 and 0.80. In multivariate analysis, the proposed imaging predictors achieved an AUC of 0.79 (p = 0.002) in leave-one-out cross validation. This improved upon conventional imaging predictors such as tumor volume (AUC=0.53) and texture features based on whole-tumor analysis (AUC=0.65). Conclusion: The heterogeneity of the tumor subregion associated with fast wash-out on DCE-MRI predicted early pathological response to neoadjuvant chemotherapy in breast cancer.« less

Treatment of multiple recessions by means of a collagen matrix: a case series.

PubMed

Schlee, Markus; Lex, Maria; Rathe, Florian; Kasaj, Adrian; Sader, Robert

2014-01-01

This case series evaluated the use of a collagen matrix with a coronally advanced flap procedure for the treatment of multiple recession defects. Fifteen patients with a total of 80 recession defects were included. Root coverage was 85% ± 13% at 6 months and 81% ± 22% at 12 months. Complete root coverage was achieved in 60% of the sites after 6 months and in 56% after 12 months. The percentage of sites with thick gingival morphotype increased significantly. The results indicated that the collagen matrix may be a useful alternative to the connective tissue graft in the treatment of multiple recession defects.

A review of failure models for unidirectional ceramic matrix composites under monotonic loads

NASA Technical Reports Server (NTRS)

Tripp, David E.; Hemann, John H.; Gyekenyesi, John P.

1989-01-01

Ceramic matrix composites offer significant potential for improving the performance of turbine engines. In order to achieve their potential, however, improvements in design methodology are needed. In the past most components using structural ceramic matrix composites were designed by trial and error since the emphasis of feasibility demonstration minimized the development of mathematical models. To understand the key parameters controlling response and the mechanics of failure, the development of structural failure models is required. A review of short term failure models with potential for ceramic matrix composite laminates under monotonic loads is presented. Phenomenological, semi-empirical, shear-lag, fracture mechanics, damage mechanics, and statistical models for the fast fracture analysis of continuous fiber unidirectional ceramic matrix composites under monotonic loads are surveyed.

Proteomic Analysis of Altered Extracellular Matrix Turnover in Bleomycin-induced Pulmonary Fibrosis

PubMed Central

Decaris, Martin L.; Gatmaitan, Michelle; FlorCruz, Simplicia; Luo, Flora; Li, Kelvin; Holmes, William E.; Hellerstein, Marc K.; Turner, Scott M.; Emson, Claire L.

2014-01-01

Fibrotic disease is characterized by the pathological accumulation of extracellular matrix (ECM) proteins. Surprisingly, very little is known about the synthesis and degradation rates of the many proteins and proteoglycans that constitute healthy or pathological extracellular matrix. A comprehensive understanding of altered ECM protein synthesis and degradation during the onset and progression of fibrotic disease would be immensely valuable. We have developed a dynamic proteomics platform that quantifies the fractional synthesis rates of large numbers of proteins via stable isotope labeling and LC/MS-based mass isotopomer analysis. Here, we present the first broad analysis of ECM protein kinetics during the onset of experimental pulmonary fibrosis. Mice were labeled with heavy water for up to 21 days following the induction of lung fibrosis with bleomycin. Lung tissue was subjected to sequential protein extraction to fractionate cellular, guanidine-soluble ECM proteins and residual insoluble ECM proteins. Fractional synthesis rates were calculated for 34 ECM proteins or protein subunits, including collagens, proteoglycans, and microfibrillar proteins. Overall, fractional synthesis rates of guanidine-soluble ECM proteins were faster than those of insoluble ECM proteins, suggesting that the insoluble fraction reflected older, more mature matrix components. This was confirmed through the quantitation of pyridinoline cross-links in each protein fraction. In fibrotic lung tissue, there was a significant increase in the fractional synthesis of unique sets of matrix proteins during early (pre-1 week) and late (post-1 week) fibrotic response. Furthermore, we isolated fast turnover subpopulations of several ECM proteins (e.g. type I collagen) based on guanidine solubility, allowing for accelerated detection of increased synthesis of typically slow-turnover protein populations. This establishes the presence of multiple kinetic pools of pulmonary collagen in vivo with altered turnover rates during evolving fibrosis. These data demonstrate the utility of dynamic proteomics in analyzing changes in ECM protein turnover associated with the onset and progression of fibrotic disease. PMID:24741116

Scaling a Conditional Proximity Matrix to Symmetry.

ERIC Educational Resources Information Center

Levin, Joseph; Brown, Morton

1979-01-01

Two least squares procedures for symmetrization of a conditional proximity matrix are derived. The solutions provide multiplicative constants for scaling the rows or columns of the matrix to maximize symmetry. (Author/JKS)

Superconducting matrix fault current limiter with current-driven trigger mechanism

DOEpatents

Yuan; Xing

2008-04-15

A modular and scalable Matrix-type Fault Current Limiter (MFCL) that functions as a "variable impedance" device in an electric power network, using components made of superconducting and non-superconducting electrically conductive materials. An inductor is connected in series with the trigger superconductor in the trigger matrix and physically surrounds the superconductor. The current surge during a fault will generate a trigger magnetic field in the series inductor to cause fast and uniform quenching of the trigger superconductor to significantly reduce burnout risk due to superconductor material non-uniformity.

Fast time- and frequency-domain finite-element methods for electromagnetic analysis

NASA Astrophysics Data System (ADS)

Lee, Woochan

Fast electromagnetic analysis in time and frequency domain is of critical importance to the design of integrated circuits (IC) and other advanced engineering products and systems. Many IC structures constitute a very large scale problem in modeling and simulation, the size of which also continuously grows with the advancement of the processing technology. This results in numerical problems beyond the reach of existing most powerful computational resources. Different from many other engineering problems, the structure of most ICs is special in the sense that its geometry is of Manhattan type and its dielectrics are layered. Hence, it is important to develop structure-aware algorithms that take advantage of the structure specialties to speed up the computation. In addition, among existing time-domain methods, explicit methods can avoid solving a matrix equation. However, their time step is traditionally restricted by the space step for ensuring the stability of a time-domain simulation. Therefore, making explicit time-domain methods unconditionally stable is important to accelerate the computation. In addition to time-domain methods, frequency-domain methods have suffered from an indefinite system that makes an iterative solution difficult to converge fast. The first contribution of this work is a fast time-domain finite-element algorithm for the analysis and design of very large-scale on-chip circuits. The structure specialty of on-chip circuits such as Manhattan geometry and layered permittivity is preserved in the proposed algorithm. As a result, the large-scale matrix solution encountered in the 3-D circuit analysis is turned into a simple scaling of the solution of a small 1-D matrix, which can be obtained in linear (optimal) complexity with negligible cost. Furthermore, the time step size is not sacrificed, and the total number of time steps to be simulated is also significantly reduced, thus achieving a total cost reduction in CPU time. The second contribution is a new method for making an explicit time-domain finite-element method (TDFEM) unconditionally stable for general electromagnetic analysis. In this method, for a given time step, we find the unstable modes that are the root cause of instability, and deduct them directly from the system matrix resulting from a TDFEM based analysis. As a result, an explicit TDFEM simulation is made stable for an arbitrarily large time step irrespective of the space step. The third contribution is a new method for full-wave applications from low to very high frequencies in a TDFEM based on matrix exponential. In this method, we directly deduct the eigenmodes having large eigenvalues from the system matrix, thus achieving a significantly increased time step in the matrix exponential based TDFEM. The fourth contribution is a new method for transforming the indefinite system matrix of a frequency-domain FEM to a symmetric positive definite one. We deduct non-positive definite component directly from the system matrix resulting from a frequency-domain FEM-based analysis. The resulting new representation of the finite-element operator ensures an iterative solution to converge in a small number of iterations. We then add back the non-positive definite component to synthesize the original solution with negligible cost.

Fast discrete cosine transform structure suitable for implementation with integer computation

NASA Astrophysics Data System (ADS)

Jeong, Yeonsik; Lee, Imgeun

2000-10-01

The discrete cosine transform (DCT) has wide applications in speech and image coding. We propose a fast DCT scheme with the property of reduced multiplication stages and fewer additions and multiplications. The proposed algorithm is structured so that most multiplications are performed at the final stage, which reduces the propagation error that could occur in the integer computation.

Multiple-Matrix Sampling: A Technique for Maximizing the Effectiveness of Lengthy Survey Instruments.

ERIC Educational Resources Information Center

Shemick, John M.

1983-01-01

In a project to identify and verify professional competencies for beginning industrial education teachers, researchers found a 173-item questionnaire unwieldy. Using multiple-matrix sampling, they distributed subsets of items to respondents, resulting in adequate returns as well as duplication, postage, and time savings. (SK)

Efficient Computation Of Manipulator Inertia Matrix

NASA Technical Reports Server (NTRS)

Fijany, Amir; Bejczy, Antal K.

1991-01-01

Improved method for computation of manipulator inertia matrix developed, based on concept of spatial inertia of composite rigid body. Required for implementation of advanced dynamic-control schemes as well as dynamic simulation of manipulator motion. Motivated by increasing demand for fast algorithms to provide real-time control and simulation capability and, particularly, need for faster-than-real-time simulation capability, required in many anticipated space teleoperation applications.

Technique for Solving Electrically Small to Large Structures for Broadband Applications

NASA Technical Reports Server (NTRS)

Jandhyala, Vikram; Chowdhury, Indranil

2011-01-01

Fast iterative algorithms are often used for solving Method of Moments (MoM) systems, having a large number of unknowns, to determine current distribution and other parameters. The most commonly used fast methods include the fast multipole method (FMM), the precorrected fast Fourier transform (PFFT), and low-rank QR compression methods. These methods reduce the O(N) memory and time requirements to O(N log N) by compressing the dense MoM system so as to exploit the physics of Green s Function interactions. FFT-based techniques for solving such problems are efficient for spacefilling and uniform structures, but their performance substantially degrades for non-uniformly distributed structures due to the inherent need to employ a uniform global grid. FMM or QR techniques are better suited than FFT techniques; however, neither the FMM nor the QR technique can be used at all frequencies. This method has been developed to efficiently solve for a desired parameter of a system or device that can include both electrically large FMM elements, and electrically small QR elements. The system or device is set up as an oct-tree structure that can include regions of both the FMM type and the QR type. The system is enclosed with a cube at a 0- th level, splitting the cube at the 0-th level into eight child cubes. This forms cubes at a 1st level, recursively repeating the splitting process for cubes at successive levels until a desired number of levels is created. For each cube that is thus formed, neighbor lists and interaction lists are maintained. An iterative solver is then used to determine a first matrix vector product for any electrically large elements as well as a second matrix vector product for any electrically small elements that are included in the structure. These matrix vector products for the electrically large and small elements are combined, and a net delta for a combination of the matrix vector products is determined. The iteration continues until a net delta is obtained that is within the predefined limits. The matrix vector products that were last obtained are used to solve for the desired parameter. The solution for the desired parameter is then presented to a user in a tangible form; for example, on a display.

Cellular fibronectin response to supervised moderate aerobic training in patients with type 2 diabetes

PubMed Central

Alghadir, Ahmad H.; Gabr, Sami A.; Al-Eisa, Einas

2016-01-01

[Purpose] Physical activity is one of the most pivotal targets for the prevention and management of vascular complications, especially endothelial dysfunctions. Cellular fibronectin is an endothelium-derived protein involved in subendothelial matrix assembly. Its plasma levels reflect matrix alterations and vessel wall destruction in patients with type II diabetes. This study investigated the influence of 12 weeks of supervised aerobic training on cellular fibronectin and its relationship with insulin resistance and body weight in type II diabetic subjects. [Subjects and Methods] This study included 50 men with type II diabetes who had a mean age of 48.8 ± 14.6 years and were randomly divided into two groups: an aerobic exercise group (12 weeks, three 50 minutes sessions per week) and control group. To examine changes in cellular fibronectin, glycosylated hemoglobin, insulin resistance, fasting insulin, fasting blood sugar, and lipid profile, 5 ml of blood was taken from the brachial vein of patients before and 48 hours after completion of the exercise period and after 12 hours of fasting at rest. Data analysis was performed using the SPSS-16 software with the independent and paired t-tests. [Results] A significant decrease was observed in body mass index and body fat percentage in the experimental group. Compared with the control group, the aerobic exercise group showed a significant decrease in cellular fibronectin, glycosylated hemoglobin, insulin resistance, fasting insulin, fasting blood sugar, and lipid profile after 12 weeks of aerobic exercise. The change in cellular fibronectin showed positive significant correlation with body mass index, diabetic biomarkers, and physical activity level. [Conclusion] The results showed that supervised aerobic exercise as a stimulus can change the levels of cellular fibronectin as matrix metalloproteinase protein a long with improvement of insulin sensitivity and glycosylated hemoglobin in order to prevent cardiovascular diseases in men with diabetes PMID:27190433

A fast Monte Carlo EM algorithm for estimation in latent class model analysis with an application to assess diagnostic accuracy for cervical neoplasia in women with AGC

PubMed Central

Kang, Le; Carter, Randy; Darcy, Kathleen; Kauderer, James; Liao, Shu-Yuan

2013-01-01

In this article we use a latent class model (LCM) with prevalence modeled as a function of covariates to assess diagnostic test accuracy in situations where the true disease status is not observed, but observations on three or more conditionally independent diagnostic tests are available. A fast Monte Carlo EM (MCEM) algorithm with binary (disease) diagnostic data is implemented to estimate parameters of interest; namely, sensitivity, specificity, and prevalence of the disease as a function of covariates. To obtain standard errors for confidence interval construction of estimated parameters, the missing information principle is applied to adjust information matrix estimates. We compare the adjusted information matrix based standard error estimates with the bootstrap standard error estimates both obtained using the fast MCEM algorithm through an extensive Monte Carlo study. Simulation demonstrates that the adjusted information matrix approach estimates the standard error similarly with the bootstrap methods under certain scenarios. The bootstrap percentile intervals have satisfactory coverage probabilities. We then apply the LCM analysis to a real data set of 122 subjects from a Gynecologic Oncology Group (GOG) study of significant cervical lesion (S-CL) diagnosis in women with atypical glandular cells of undetermined significance (AGC) to compare the diagnostic accuracy of a histology-based evaluation, a CA-IX biomarker-based test and a human papillomavirus (HPV) DNA test. PMID:24163493

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

Piot, P.; Halavanau, A.

This paper discusses the implementation of a python- based high-level interface to the Fermilab acnet control system. The interface has been successfully employed during the commissioning of the Fermilab Accelerator Science & Technology (FAST) facility. Specifically, we present examples of applications at FAST which include the interfacing of the elegant program to assist lattice matching, an automated emittance measurement via the quadrupole-scan method and tranverse transport matrix measurement of a superconducting RF cavity.

Recovering hidden diagonal structures via non-negative matrix factorization with multiple constraints.

PubMed

Yang, Xi; Han, Guoqiang; Cai, Hongmin; Song, Yan

2017-03-31

Revealing data with intrinsically diagonal block structures is particularly useful for analyzing groups of highly correlated variables. Earlier researches based on non-negative matrix factorization (NMF) have been shown to be effective in representing such data by decomposing the observed data into two factors, where one factor is considered to be the feature and the other the expansion loading from a linear algebra perspective. If the data are sampled from multiple independent subspaces, the loading factor would possess a diagonal structure under an ideal matrix decomposition. However, the standard NMF method and its variants have not been reported to exploit this type of data via direct estimation. To address this issue, a non-negative matrix factorization with multiple constraints model is proposed in this paper. The constraints include an sparsity norm on the feature matrix and a total variational norm on each column of the loading matrix. The proposed model is shown to be capable of efficiently recovering diagonal block structures hidden in observed samples. An efficient numerical algorithm using the alternating direction method of multipliers model is proposed for optimizing the new model. Compared with several benchmark models, the proposed method performs robustly and effectively for simulated and real biological data.

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.

A frequency domain global parameter estimation method for multiple reference frequency response measurements

NASA Astrophysics Data System (ADS)

Shih, C. Y.; Tsuei, Y. G.; Allemang, R. J.; Brown, D. L.

1988-10-01

A method of using the matrix Auto-Regressive Moving Average (ARMA) model in the Laplace domain for multiple-reference global parameter identification is presented. This method is particularly applicable to the area of modal analysis where high modal density exists. The method is also applicable when multiple reference frequency response functions are used to characterise linear systems. In order to facilitate the mathematical solution, the Forsythe orthogonal polynomial is used to reduce the ill-conditioning of the formulated equations and to decouple the normal matrix into two reduced matrix blocks. A Complex Mode Indicator Function (CMIF) is introduced, which can be used to determine the proper order of the rational polynomials.

Parallel matrix multiplication on the Connection Machine

NASA Technical Reports Server (NTRS)

Tichy, Walter F.

1988-01-01

Matrix multiplication is a computation and communication intensive problem. Six parallel algorithms for matrix multiplication on the Connection Machine are presented and compared with respect to their performance and processor usage. For n by n matrices, the algorithms have theoretical running times of O(n to the 2nd power log n), O(n log n), O(n), and O(log n), and require n, n to the 2nd power, n to the 2nd power, and n to the 3rd power processors, respectively. With careful attention to communication patterns, the theoretically predicted runtimes can indeed be achieved in practice. The parallel algorithms illustrate the tradeoffs between performance, communication cost, and processor usage.

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.

Matrix differentiation formulas

NASA Technical Reports Server (NTRS)

Usikov, D. A.; Tkhabisimov, D. K.

1983-01-01

A compact differentiation technique (without using indexes) is developed for scalar functions that depend on complex matrix arguments which are combined by operations of complex conjugation, transposition, addition, multiplication, matrix inversion and taking the direct product. The differentiation apparatus is developed in order to simplify the solution of extremum problems of scalar functions of matrix arguments.

The fast algorithm of spark in compressive sensing

NASA Astrophysics Data System (ADS)

Xie, Meihua; Yan, Fengxia

2017-01-01

Compressed Sensing (CS) is an advanced theory on signal sampling and reconstruction. In CS theory, the reconstruction condition of signal is an important theory problem, and spark is a good index to study this problem. But the computation of spark is NP hard. In this paper, we study the problem of computing spark. For some special matrixes, for example, the Gaussian random matrix and 0-1 random matrix, we obtain some conclusions. Furthermore, for Gaussian random matrix with fewer rows than columns, we prove that its spark equals to the number of its rows plus one with probability 1. For general matrix, two methods are given to compute its spark. One is the method of directly searching and the other is the method of dual-tree searching. By simulating 24 Gaussian random matrixes and 18 0-1 random matrixes, we tested the computation time of these two methods. Numerical results showed that the dual-tree searching method had higher efficiency than directly searching, especially for those matrixes which has as much as rows and columns.

Imaging of human differentiated 3D neural aggregates using light sheet fluorescence microscopy.

PubMed

Gualda, Emilio J; Simão, Daniel; Pinto, Catarina; Alves, Paula M; Brito, Catarina

2014-01-01

The development of three dimensional (3D) cell cultures represents a big step for the better understanding of cell behavior and disease in a more natural like environment, providing not only single but multiple cell type interactions in a complex 3D matrix, highly resembling physiological conditions. Light sheet fluorescence microscopy (LSFM) is becoming an excellent tool for fast imaging of such 3D biological structures. We demonstrate the potential of this technique for the imaging of human differentiated 3D neural aggregates in fixed and live samples, namely calcium imaging and cell death processes, showing the power of imaging modality compared with traditional microscopy. The combination of light sheet microscopy and 3D neural cultures will open the door to more challenging experiments involving drug testing at large scale as well as a better understanding of relevant biological processes in a more realistic environment.

Improvements on non-equilibrium and transport Green function techniques: The next-generation TRANSIESTA

NASA Astrophysics Data System (ADS)

Papior, Nick; Lorente, Nicolás; Frederiksen, Thomas; García, Alberto; Brandbyge, Mads

2017-03-01

We present novel methods implemented within the non-equilibrium Green function code (NEGF) TRANSIESTA based on density functional theory (DFT). Our flexible, next-generation DFT-NEGF code handles devices with one or multiple electrodes (Ne ≥ 1) with individual chemical potentials and electronic temperatures. We describe its novel methods for electrostatic gating, contour optimizations, and assertion of charge conservation, as well as the newly implemented algorithms for optimized and scalable matrix inversion, performance-critical pivoting, and hybrid parallelization. Additionally, a generic NEGF "post-processing" code (TBTRANS/PHTRANS) for electron and phonon transport is presented with several novelties such as Hamiltonian interpolations, Ne ≥ 1 electrode capability, bond-currents, generalized interface for user-defined tight-binding transport, transmission projection using eigenstates of a projected Hamiltonian, and fast inversion algorithms for large-scale simulations easily exceeding 106 atoms on workstation computers. The new features of both codes are demonstrated and bench-marked for relevant test systems.

Fixed target matrix for femtosecond time-resolved and in situ serial micro-crystallography

PubMed Central

Mueller, C.; Marx, A.; Epp, S. W.; Zhong, Y.; Kuo, A.; Balo, A. R.; Soman, J.; Schotte, F.; Lemke, H. T.; Owen, R. L.; Pai, E. F.; Pearson, A. R.; Olson, J. S.; Anfinrud, P. A.; Ernst, O. P.; Dwayne Miller, R. J.

2015-01-01

We present a crystallography chip enabling in situ room temperature crystallography at microfocus synchrotron beamlines and X-ray free-electron laser (X-FEL) sources. Compared to other in situ approaches, we observe extremely low background and high diffraction data quality. The chip design is robust and allows fast and efficient loading of thousands of small crystals. The ability to load a large number of protein crystals, at room temperature and with high efficiency, into prescribed positions enables high throughput automated serial crystallography with microfocus synchrotron beamlines. In addition, we demonstrate the application of this chip for femtosecond time-resolved serial crystallography at the Linac Coherent Light Source (LCLS, Menlo Park, California, USA). The chip concept enables multiple images to be acquired from each crystal, allowing differential detection of changes in diffraction intensities in order to obtain high signal-to-noise and fully exploit the time resolution capabilities of XFELs. PMID:26798825

Fixed target matrix for femtosecond time-resolved and in situ serial micro-crystallography.

PubMed

Mueller, C; Marx, A; Epp, S W; Zhong, Y; Kuo, A; Balo, A R; Soman, J; Schotte, F; Lemke, H T; Owen, R L; Pai, E F; Pearson, A R; Olson, J S; Anfinrud, P A; Ernst, O P; Dwayne Miller, R J

2015-09-01

We present a crystallography chip enabling in situ room temperature crystallography at microfocus synchrotron beamlines and X-ray free-electron laser (X-FEL) sources. Compared to other in situ approaches, we observe extremely low background and high diffraction data quality. The chip design is robust and allows fast and efficient loading of thousands of small crystals. The ability to load a large number of protein crystals, at room temperature and with high efficiency, into prescribed positions enables high throughput automated serial crystallography with microfocus synchrotron beamlines. In addition, we demonstrate the application of this chip for femtosecond time-resolved serial crystallography at the Linac Coherent Light Source (LCLS, Menlo Park, California, USA). The chip concept enables multiple images to be acquired from each crystal, allowing differential detection of changes in diffraction intensities in order to obtain high signal-to-noise and fully exploit the time resolution capabilities of XFELs.

Imaging of human differentiated 3D neural aggregates using light sheet fluorescence microscopy

PubMed Central

Gualda, Emilio J.; Simão, Daniel; Pinto, Catarina; Alves, Paula M.; Brito, Catarina

2014-01-01

The development of three dimensional (3D) cell cultures represents a big step for the better understanding of cell behavior and disease in a more natural like environment, providing not only single but multiple cell type interactions in a complex 3D matrix, highly resembling physiological conditions. Light sheet fluorescence microscopy (LSFM) is becoming an excellent tool for fast imaging of such 3D biological structures. We demonstrate the potential of this technique for the imaging of human differentiated 3D neural aggregates in fixed and live samples, namely calcium imaging and cell death processes, showing the power of imaging modality compared with traditional microscopy. The combination of light sheet microscopy and 3D neural cultures will open the door to more challenging experiments involving drug testing at large scale as well as a better understanding of relevant biological processes in a more realistic environment. PMID:25161607

Site-percolation threshold of carbon nanotube fibers-Fast inspection of percolation with Markov stochastic theory

NASA Astrophysics Data System (ADS)

Xu, Fangbo; Xu, Zhiping; Yakobson, Boris I.

2014-08-01

We present a site-percolation model based on a modified FCC lattice, as well as an efficient algorithm of inspecting percolation which takes advantage of the Markov stochastic theory, in order to study the percolation threshold of carbon nanotube (CNT) fibers. Our Markov-chain based algorithm carries out the inspection of percolation by performing repeated sparse matrix-vector multiplications, which allows parallelized computation to accelerate the inspection for a given configuration. With this approach, we determine that the site-percolation transition of CNT fibers occurs at pc=0.1533±0.0013, and analyze the dependence of the effective percolation threshold (corresponding to 0.5 percolation probability) on the length and the aspect ratio of a CNT fiber on a finite-size-scaling basis. We also discuss the aspect ratio dependence of percolation probability with various values of p (not restricted to pc).

Tensor completion for estimating missing values in visual data.

PubMed

Liu, Ji; Musialski, Przemyslaw; Wonka, Peter; Ye, Jieping

2013-01-01

In this paper, we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and then by building a working algorithm. First, we propose a definition for the tensor trace norm that generalizes the established definition of the matrix trace norm. Second, similarly to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we developed three algorithms: simple low rank tensor completion (SiLRTC), fast low rank tensor completion (FaLRTC), and high accuracy low rank tensor completion (HaLRTC). The SiLRTC algorithm is simple to implement and employs a relaxation technique to separate the dependent relationships and uses the block coordinate descent (BCD) method to achieve a globally optimal solution; the FaLRTC algorithm utilizes a smoothing scheme to transform the original nonsmooth problem into a smooth one and can be used to solve a general tensor trace norm minimization problem; the HaLRTC algorithm applies the alternating direction method of multipliers (ADMMs) to our problem. Our experiments show potential applications of our algorithms and the quantitative evaluation indicates that our methods are more accurate and robust than heuristic approaches. The efficiency comparison indicates that FaLTRC and HaLRTC are more efficient than SiLRTC and between FaLRTC an- HaLRTC the former is more efficient to obtain a low accuracy solution and the latter is preferred if a high-accuracy solution is desired.

Generating Multiple Imputations for Matrix Sampling Data Analyzed with Item Response Models.

ERIC Educational Resources Information Center

Thomas, Neal; Gan, Nianci

1997-01-01

Describes and assesses missing data methods currently used to analyze data from matrix sampling designs implemented by the National Assessment of Educational Progress. Several improved methods are developed, and these models are evaluated using an EM algorithm to obtain maximum likelihood estimates followed by multiple imputation of complete data…

[Penile augmentation using acellular dermal matrix].

PubMed

Zhang, Jin-ming; Cui, Yong-yan; Pan, Shu-juan; Liang, Wei-qiang; Chen, Xiao-xuan

2004-11-01

Penile enhancement was performed using acellular dermal matrix. Multiple layers of acellular dermal matrix were placed underneath the penile skin to enlarge its girth. Since March 2002, penile augmentation has been performed on 12 cases using acellular dermal matrix. Postoperatively all the patients had a 1.3-3.1 cm (2.6 cm in average) increase in penile girth in a flaccid state. The penis had normal appearance and feeling without contour deformities. All patients gained sexual ability 3 months after the operation. One had a delayed wound healing due to tight dressing, which was repaired with a scrotal skin flap. Penile enlargement by implantation of multiple layers of acellular dermal matrix was a safe and effective operation. This method can be performed in an outpatient ambulatory setting. The advantages of the acellular dermal matrix over the autogenous dermal fat grafts are elimination of donor site injury and scar and significant shortening of operation time.

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.

[Determination of 25 quinolones in cosmetics by liquid chromatography-tandem mass spectrometry].

PubMed

Lin, Li; Zhang, Yi; Tu, Xiaoke; Xie, Liqi; Yue, Zhenfeng; Kang, Haining; Wu, Weidong; Luo, Yao

2015-03-01

An analytical method was developed for the simultaneous determination of 25 quinolones, including danofloxacin mesylate, enrofloxacin, flumequine, oxloinic acid, ciprofloxacin, sarafloxacin, nalidixic acid, norfloxacin, and ofloxacin etc in cosmetics using direct extraction and liquid chromatography-electrospray ionization tandem mass spectrometry (LC-ESI-MS/MS). Cosmetic sample was extracted by acidified acetonitrile, defatted by n-hexane and separated on Poroshell EC-C18 column with gradient elution program using acetonitrile and water (both containing 0. 1% formic acid) as the mobile phases and analyzed by LC-ESI-MS/MS under the positive mode using multiple reaction monitoring (MRM). The interference of matrix was reduced by the matrix-matched calibration standard curve. The method showed good linearities over the range of 1-200 mg/kg for the 25 quinolones with good linear correlation coefficients (r ≥ 0.999). The method detection limit of the 25 quinolones was 1.0 mg/kg, and the recoveries of all analytes in lotion, milky and cream cosmetics matrices ranged from 87.4% to 105% at the spiked levels of 1, 5 and 10 mg/kg with the relative standard deviations (RSD) of 4.54%-19.7% (n = 6). The results indicated that this method is simple, fast and credible, and suitable for the simultaneous determination of the quinolones in the above three types of cosmetics.

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.

Characterizing the inverses of block tridiagonal, block Toeplitz matrices

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

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

2014-12-04

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

Evolution of correlation structure of industrial indices of U.S. equity markets.

PubMed

Buccheri, Giuseppe; Marmi, Stefano; Mantegna, Rosario N

2013-07-01

We investigate the dynamics of correlations present between pairs of industry indices of U.S. stocks traded in U.S. markets by studying correlation-based networks and spectral properties of the correlation matrix. The study is performed by using 49 industry index time series computed by K. French and E. Fama during the time period from July 1969 to December 2011, which spans more than 40 years. We show that the correlation between industry indices presents both a fast and a slow dynamics. The slow dynamics has a time scale longer than 5 years, showing that a different degree of diversification of the investment is possible in different periods of time. Moreover, we also detect a fast dynamics associated with exogenous or endogenous events. The fast time scale we use is a monthly time scale and the evaluation time period is a 3-month time period. By investigating the correlation dynamics monthly, we are able to detect two examples of fast variations in the first and second eigenvalue of the correlation matrix. The first occurs during the dot-com bubble (from March 1999 to April 2001) and the second occurs during the period of highest impact of the subprime crisis (from August 2008 to August 2009).

Evolution of correlation structure of industrial indices of U.S. equity markets

NASA Astrophysics Data System (ADS)

Buccheri, Giuseppe; Marmi, Stefano; Mantegna, Rosario N.

2013-07-01

We investigate the dynamics of correlations present between pairs of industry indices of U.S. stocks traded in U.S. markets by studying correlation-based networks and spectral properties of the correlation matrix. The study is performed by using 49 industry index time series computed by K. French and E. Fama during the time period from July 1969 to December 2011, which spans more than 40 years. We show that the correlation between industry indices presents both a fast and a slow dynamics. The slow dynamics has a time scale longer than 5 years, showing that a different degree of diversification of the investment is possible in different periods of time. Moreover, we also detect a fast dynamics associated with exogenous or endogenous events. The fast time scale we use is a monthly time scale and the evaluation time period is a 3-month time period. By investigating the correlation dynamics monthly, we are able to detect two examples of fast variations in the first and second eigenvalue of the correlation matrix. The first occurs during the dot-com bubble (from March 1999 to April 2001) and the second occurs during the period of highest impact of the subprime crisis (from August 2008 to August 2009).

Dynamic interactions between cells and their extracellular matrix mediate embryonic development.

PubMed

Goody, Michelle F; Henry, Clarissa A

2010-06-01

Cells and their surrounding extracellular matrix microenvironment interact throughout all stages of life. Understanding the continuously changing scope of cell-matrix interactions in vivo is crucial to garner insights into both congenital birth defects and disease progression. A current challenge in the field of developmental biology is to adapt in vitro tools and rapidly evolving imaging technology to study cell-matrix interactions in a complex 4-D environment. In this review, we highlight the dynamic modulation of cell-matrix interactions during development. We propose that individual cell-matrix adhesion proteins are best considered as complex proteins that can play multiple, often seemingly contradictory roles, depending upon the context of the microenvironment. In addition, cell-matrix proteins can also exert different short versus long term effects. It is thus important to consider cell behavior in light of the microenvironment because of the constant and dynamic reciprocal interactions occurring between them. Finally, we suggest that analysis of cell-matrix interactions at multiple levels (molecules, cells, tissues) in vivo is critical for an integrated understanding because different information can be acquired from all size scales. Copyright 2010 Wiley-Liss, Inc.

Gas Permeable Chemochromic Compositions for Hydrogen Sensing

NASA Technical Reports Server (NTRS)

Mohajeri, Nahid (Inventor); Muradov, Nazim (Inventor); Tabatabaie-Raissi, Ali (Inventor); Bokerman, Gary (Inventor)

2013-01-01

A (H2) sensor composition includes a gas permeable matrix material intermixed and encapsulating at least one chemochromic pigment. The chemochromic pigment produces a detectable change in color of the overall sensor composition in the presence of H2 gas. The matrix material provides high H2 permeability, which permits fast permeation of H2 gas. In one embodiment, the chemochromic pigment comprises PdO/TiO2. The sensor can be embodied as a two layer structure with the gas permeable matrix material intermixed with the chemochromic pigment in one layer and a second layer which provides a support or overcoat layer.

Numerical modeling of coupled variably saturated fluid flow and reactive transport with fast and slow chemical reactions

NASA Astrophysics Data System (ADS)

Yeh, Gour-Tsyh (George); Siegel, Malcolm D.; Li, Ming-Hsu

2001-02-01

The couplings among chemical reaction rates, advective and diffusive transport in fractured media or soils, and changes in hydraulic properties due to precipitation and dissolution within fractures and in rock matrix are important for both nuclear waste disposal and remediation of contaminated sites. This paper describes the development and application of LEHGC2.0, a mechanistically based numerical model for simulation of coupled fluid flow and reactive chemical transport, including both fast and slow reactions in variably saturated media. Theoretical bases and numerical implementations are summarized, and two example problems are demonstrated. The first example deals with the effect of precipitation/dissolution on fluid flow and matrix diffusion in a two-dimensional fractured media. Because of the precipitation and decreased diffusion of solute from the fracture into the matrix, retardation in the fractured medium is not as large as the case wherein interactions between chemical reactions and transport are not considered. The second example focuses on a complicated but realistic advective-dispersive-reactive transport problem. This example exemplifies the need for innovative numerical algorithms to solve problems involving stiff geochemical reactions.

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.

An optimal algorithm for reconstructing images from binary measurements

NASA Astrophysics Data System (ADS)

Yang, Feng; Lu, Yue M.; Sbaiz, Luciano; Vetterli, Martin

2010-01-01

We have studied a camera with a very large number of binary pixels referred to as the gigavision camera [1] or the gigapixel digital film camera [2, 3]. Potential advantages of this new camera design include improved dynamic range, thanks to its logarithmic sensor response curve, and reduced exposure time in low light conditions, due to its highly sensitive photon detection mechanism. We use maximum likelihood estimator (MLE) to reconstruct a high quality conventional image from the binary sensor measurements of the gigavision camera. We prove that when the threshold T is "1", the negative loglikelihood function is a convex function. Therefore, optimal solution can be achieved using convex optimization. Base on filter bank techniques, fast algorithms are given for computing the gradient and the multiplication of a vector and Hessian matrix of the negative log-likelihood function. We show that with a minor change, our algorithm also works for estimating conventional images from multiple binary images. Numerical experiments with synthetic 1-D signals and images verify the effectiveness and quality of the proposed algorithm. Experimental results also show that estimation performance can be improved by increasing the oversampling factor or the number of binary images.

Fast calculation of the `ILC norm' in iterative learning control

NASA Astrophysics Data System (ADS)

Rice, Justin K.; van Wingerden, Jan-Willem

2013-06-01

In this paper, we discuss and demonstrate a method for the exploitation of matrix structure in computations for iterative learning control (ILC). In Barton, Bristow, and Alleyne [International Journal of Control, 83(2), 1-8 (2010)], a special insight into the structure of the lifted convolution matrices involved in ILC is used along with a modified Lanczos method to achieve very fast computational bounds on the learning convergence, by calculating the 'ILC norm' in ? computational complexity. In this paper, we show how their method is equivalent to a special instance of the sequentially semi-separable (SSS) matrix arithmetic, and thus can be extended to many other computations in ILC, and specialised in some cases to even faster methods. Our SSS-based methodology will be demonstrated on two examples: a linear time-varying example resulting in the same ? complexity as in Barton et al., and a linear time-invariant example where our approach reduces the computational complexity to ?, thus decreasing the computation time, for an example, from the literature by a factor of almost 100. This improvement is achieved by transforming the norm computation via a linear matrix inequality into a check of positive definiteness - which allows us to further exploit the almost-Toeplitz properties of the matrix, and additionally provides explicit upper and lower bounds on the norm of the matrix, instead of the indirect Ritz estimate. These methods are now implemented in a MATLAB toolbox, freely available on the Internet.

Covariance Matrix Estimation for Massive MIMO

NASA Astrophysics Data System (ADS)

Upadhya, Karthik; Vorobyov, Sergiy A.

2018-04-01

We propose a novel pilot structure for covariance matrix estimation in massive multiple-input multiple-output (MIMO) systems in which each user transmits two pilot sequences, with the second pilot sequence multiplied by a random phase-shift. The covariance matrix of a particular user is obtained by computing the sample cross-correlation of the channel estimates obtained from the two pilot sequences. This approach relaxes the requirement that all the users transmit their uplink pilots over the same set of symbols. We derive expressions for the achievable rate and the mean-squared error of the covariance matrix estimate when the proposed method is used with staggered pilots. The performance of the proposed method is compared with existing methods through simulations.

Fusion of microlitre water-in-oil droplets for simple, fast and green chemical assays.

PubMed

Chiu, S-H; Urban, P L

2015-08-07

A simple format for microscale chemical assays is proposed. It does not require the use of test tubes, microchips or microtiter plates. Microlitre-range (ca. 0.7-5.0 μL) aqueous droplets are generated by a commercial micropipette in a non-polar matrix inside a Petri dish. When two droplets are pipetted nearby, they spontaneously coalesce within seconds, priming a chemical reaction. Detection of the reaction product is accomplished by colorimetry, spectrophotometry, or fluorimetry using simple light-emitting diode (LED) arrays as the sources of monochromatic light, while chemiluminescence detection of the analytes present in single droplets is conducted in the dark. A smartphone camera is used as the detector. The limits of detection obtained for the developed in-droplet assays are estimated to be: 1.4 nmol (potassium permanganate by colorimetry), 1.4 pmol (fluorescein by fluorimetry), and 580 fmol (sodium hypochlorite by chemiluminescence detection). The format has successfully been used to monitor the progress of chemical and biochemical reactions over time with sub-second resolution. A semi-quantitative analysis of ascorbic acid using Tillman's reagent is presented. A few tens of individual droplets can be scanned in parallel. Rapid switching of the LED light sources with different wavelengths enables a spectral analysis of multiple droplets. Very little solid waste is produced. The assay matrix is readily recycled, thus the volume of liquid waste produced each time is also very small (typically, 1-10 μL per analysis). Various water-immiscible translucent liquids can be used as the reaction matrix: including silicone oil, 1-octanol as well as soybean cooking oil.

Periodontal plastic surgery of gingival recessions at single and multiple teeth.

PubMed

Cairo, Francesco

2017-10-01

This manuscript aims to review periodontal plastic surgery for root coverage at single and multiple gingival recessions. Techniques are assessed based on biological principles, surgical procedures, prognosticative factors and expected clinical and esthetic outcomes. The use of coronally advanced flap, laterally sliding flap, free gingival graft, the tunnel grafting technique, barrier membranes, enamel matrix derivative, collagen matrix and acellular dermal matrix are evaluated. The clinical scenario and practical implications are analyzed according to a modern evidence-based approach. © 2017 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

Fast turn-on osmium coated cathode

NASA Astrophysics Data System (ADS)

Marrian, C. R. K.; Haas, G. A.; Shih, A.

1984-03-01

This abstract discloses a fast turn-on refractory coated cathode comprising a porous tungsten metal matrix impregnated with barium calcium aluminate and coated with osmium. The osmium coating has a planned series of interruptions with each interruption being on the order of several microns in width to thereby expose the tungsten. These interruptions permit the barium and oxygen from the impregnant to rise to the cathode surface during activation or reactivation to form a desired near monolayer of barium and oxygen to enhance electron emission. Thus, this cathode design provides a fast turn-on characteristic even after shelf storage.

Simple Fabrication of a Highly Sensitive and Fast Glucose Biosensor using Enzyme Immobilized in Mesocellular Carbon Foam

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

Lee, Dohoon; Lee, Jinwoo; Kim, Jungbae

2005-12-05

We fabricated a highly sensitive and fast glucose biosensor by simply immobilizing glucose oxidase in mesocellular carbon foam. Due to its unique structure, the MSU-F-C enabled high enzyme loading without serious mass transfer limitation, resulting in high catalytic efficiency. As a result, the glucose biosensor fabricated with MSU-F-C/GOx showed a high sensitivity and fast response. Given these results and the inherent electrical conductivity, we anticipate that MSU-F-C will make a useful matrix for enzyme immobilization in various biocatalytic and electrobiocatalytic applications.

Gradient-based stochastic estimation of the density matrix

NASA Astrophysics Data System (ADS)

Wang, Zhentao; Chern, Gia-Wei; Batista, Cristian D.; Barros, Kipton

2018-03-01

Fast estimation of the single-particle density matrix is key to many applications in quantum chemistry and condensed matter physics. The best numerical methods leverage the fact that the density matrix elements f(H)ij decay rapidly with distance rij between orbitals. This decay is usually exponential. However, for the special case of metals at zero temperature, algebraic decay of the density matrix appears and poses a significant numerical challenge. We introduce a gradient-based probing method to estimate all local density matrix elements at a computational cost that scales linearly with system size. For zero-temperature metals, the stochastic error scales like S-(d+2)/2d, where d is the dimension and S is a prefactor to the computational cost. The convergence becomes exponential if the system is at finite temperature or is insulating.

Intermittent fasting during Ramadan: does it affect sleep?

PubMed

Bahammam, Ahmed S; Almushailhi, Khalid; Pandi-Perumal, Seithikurippu R; Sharif, Munir M

2014-02-01

Islamic intermittent fasting is distinct from regular voluntary or experimental fasting. We hypothesised that if a regimen of a fixed sleep-wake schedule and a fixed caloric intake is followed during intermittent fasting, the effects of fasting on sleep architecture and daytime sleepiness will be minimal. Therefore, we designed this study to objectively assess the effects of Islamic intermittent fasting on sleep architecture and daytime sleepiness. Eight healthy volunteers reported to the Sleep Disorders Centre on five occasions for polysomnography and multiple sleep latency tests: (1) during adaptation; (2) 3 weeks before Ramadan, after having performed Islamic fasting for 1 week (baseline fasting); (3) 1 week before Ramadan (non-fasting baseline); (4) 2 weeks into Ramadan (Ramadan); and (5) 2 weeks after Ramadan (non-fasting; Recovery). Daytime sleepiness was assessed using the Epworth Sleepiness Scale and the multiple sleep latency test. The participants had a mean age of 26.6 ± 4.9 years, a body mass index of 23.7 ± 3.5 kg m(-2) and an Epworth Sleepiness Scale score of 7.3 ± 2.7. There was no change in weight or the Epworth Sleepiness Scale in the four study periods. The rapid eye movement sleep percentage was significantly lower during fasting. There was no difference in sleep latency, non-rapid eye movement sleep percentage, arousal index and sleep efficiency. The multiple sleep latency test analysis revealed no difference in the sleep latency between the 'non-fasting baseline', 'baseline fasting', 'Ramadan' and 'Recovery' time points. Under conditions of a fixed sleep-wake schedule and a fixed caloric intake, Islamic intermittent fasting results in decreased rapid eye movement sleep with no impact on other sleep stages, the arousal index or daytime sleepiness. © 2013 European Sleep Research Society.

Real-time inextensible surgical thread simulation.

PubMed

Xu, Lang; Liu, Qian

2018-03-27

This paper discusses a real-time simulation method of inextensible surgical thread based on the Cosserat rod theory using position-based dynamics (PBD). The method realizes stable twining and knotting of surgical thread while including inextensibility, bending, twisting and coupling effects. The Cosserat rod theory is used to model the nonlinear elastic behavior of surgical thread. The surgical thread model is solved with PBD to achieve a real-time, extremely stable simulation. Due to the one-dimensional linear structure of surgical thread, the direct solution of the distance constraint based on tridiagonal matrix algorithm is used to enhance stretching resistance in every constraint projection iteration. In addition, continuous collision detection and collision response guarantee a large time step and high performance. Furthermore, friction is integrated into the constraint projection process to stabilize the twining of multiple threads and complex contact situations. Through comparisons with existing methods, the surgical thread maintains constant length under large deformation after applying the direct distance constraint in our method. The twining and knotting of multiple threads correspond to stable solutions to contact and friction forces. A surgical suture scene is also modeled to demonstrate the practicality and simplicity of our method. Our method achieves stable and fast simulation of inextensible surgical thread. Benefiting from the unified particle framework, the rigid body, elastic rod, and soft body can be simultaneously simulated. The method is appropriate for applications in virtual surgery that require multiple dynamic bodies.

Consistency between real and synthetic fast-ion measurements at ASDEX Upgrade

NASA Astrophysics Data System (ADS)

Rasmussen, J.; Nielsen, S. K.; Stejner, M.; Geiger, B.; Salewski, M.; Jacobsen, A. S.; Korsholm, S. B.; Leipold, F.; Michelsen, P. K.; Moseev, D.; Schubert, M.; Stober, J.; Tardini, G.; Wagner, D.; The ASDEX Upgrade Team

2015-07-01

Internally consistent characterization of the properties of the fast-ion distribution from multiple diagnostics is a prerequisite for obtaining a full understanding of fast-ion behavior in tokamak plasmas. Here we benchmark several absolutely-calibrated core fast-ion diagnostics at ASDEX Upgrade by comparing fast-ion measurements from collective Thomson scattering, fast-ion {{\\text{D}}α} spectroscopy, and neutron rate detectors with numerical predictions from the TRANSP/NUBEAM transport code. We also study the sensitivity of the theoretical predictions to uncertainties in the plasma kinetic profiles. We find that theory and measurements generally agree within these uncertainties for all three diagnostics during heating phases with either one or two neutral beam injection sources. This suggests that the measurements can be described by the same model assuming classical slowing down of fast ions. Since the three diagnostics in the adopted configurations probe partially overlapping regions in fast-ion velocity space, this is also consistent with good internal agreement among the measurements themselves. Hence, our results support the feasibility of combining multiple diagnostics at ASDEX Upgrade to reconstruct the fast-ion distribution function in 2D velocity space.

Intratumor partitioning and texture analysis of dynamic contrast-enhanced (DCE)-MRI identifies relevant tumor subregions to predict pathological response of breast cancer to neoadjuvant chemotherapy.

PubMed

Wu, Jia; Gong, Guanghua; Cui, Yi; Li, Ruijiang

2016-11-01

To predict pathological response of breast cancer to neoadjuvant chemotherapy (NAC) based on quantitative, multiregion analysis of dynamic contrast enhancement magnetic resonance imaging (DCE-MRI). In this Institutional Review Board-approved study, 35 patients diagnosed with stage II/III breast cancer were retrospectively investigated using 3T DCE-MR images acquired before and after the first cycle of NAC. First, principal component analysis (PCA) was used to reduce the dimensionality of the DCE-MRI data with high temporal resolution. We then partitioned the whole tumor into multiple subregions using k-means clustering based on the PCA-defined eigenmaps. Within each tumor subregion, we extracted four quantitative Haralick texture features based on the gray-level co-occurrence matrix (GLCM). The change in texture features in each tumor subregion between pre- and during-NAC was used to predict pathological complete response after NAC. Three tumor subregions were identified through clustering, each with distinct enhancement characteristics. In univariate analysis, all imaging predictors except one extracted from the tumor subregion associated with fast washout were statistically significant (P < 0.05) after correcting for multiple testing, with area under the receiver operating characteristic (ROC) curve (AUC) or AUCs between 0.75 and 0.80. In multivariate analysis, the proposed imaging predictors achieved an AUC of 0.79 (P = 0.002) in leave-one-out cross-validation. This improved upon conventional imaging predictors such as tumor volume (AUC = 0.53) and texture features based on whole-tumor analysis (AUC = 0.65). The heterogeneity of the tumor subregion associated with fast washout on DCE-MRI predicted pathological response to NAC in breast cancer. J. Magn. Reson. Imaging 2016;44:1107-1115. © 2016 International Society for Magnetic Resonance in Medicine.

Simultaneous pre-concentration and separation on simple paper-based analytical device for protein analysis.

PubMed

Niu, Ji-Cheng; Zhou, Ting; Niu, Li-Li; Xie, Zhen-Sheng; Fang, Fang; Yang, Fu-Quan; Wu, Zhi-Yong

2018-02-01

In this work, fast isoelectric focusing (IEF) was successfully implemented on an open paper fluidic channel for simultaneous concentration and separation of proteins from complex matrix. With this simple device, IEF can be finished in 10 min with a resolution of 0.03 pH units and concentration factor of 10, as estimated by color model proteins by smartphone-based colorimetric detection. Fast detection of albumin from human serum and glycated hemoglobin (HBA1c) from blood cell was demonstrated. In addition, off-line identification of the model proteins from the IEF fractions with matrix-assisted laser desorption ionization time-of-flight mass spectrometry (MALDI-TOF-MS) was also shown. This PAD IEF is potentially useful either for point of care test (POCT) or biomarker analysis as a cost-effective sample pretreatment method.

Development of a fast screening and confirmatory method by liquid chromatography-quadrupole-time-of-flight mass spectrometry for glucuronide-conjugated methyltestosterone metabolite in tilapia.

PubMed

Amarasinghe, Kande; Chu, Pak-Sin; Evans, Eric; Reimschuessel, Renate; Hasbrouck, Nicholas; Jayasuriya, Hiranthi

2012-05-23

This paper describes the development of a fast method to screen and confirm methyltestosterone 17-O-glucuronide (MT-glu) in tilapia bile. The method consists of solid-phase extraction (SPE) followed by high-performance liquid chromatography-mass spectrometry. The system used was an Agilent 6530 Q-TOF with an Agilent Jet stream electrospray ionization interface. The glucuronide detected in the bile was characterized as MT-glu by comparison with a chemically synthesized standard. MT-glu was detected in bile for up to 7 days after dosing. Semiquantification was done with matrix-matched calibration curves, because MT-glu showed signal suppression due to matrix effects. This method provides a suitable tool to monitor the illegal use of methyltestosterone in tilapia culture.

Covariance, correlation matrix, and the multiscale community structure of networks.

PubMed

Shen, Hua-Wei; Cheng, Xue-Qi; Fang, Bin-Xing

2010-07-01

Empirical studies show that real world networks often exhibit multiple scales of topological descriptions. However, it is still an open problem how to identify the intrinsic multiple scales of networks. In this paper, we consider detecting the multiscale community structure of network from the perspective of dimension reduction. According to this perspective, a covariance matrix of network is defined to uncover the multiscale community structure through the translation and rotation transformations. It is proved that the covariance matrix is the unbiased version of the well-known modularity matrix. We then point out that the translation and rotation transformations fail to deal with the heterogeneous network, which is very common in nature and society. To address this problem, a correlation matrix is proposed through introducing the rescaling transformation into the covariance matrix. Extensive tests on real world and artificial networks demonstrate that the correlation matrix significantly outperforms the covariance matrix, identically the modularity matrix, as regards identifying the multiscale community structure of network. This work provides a novel perspective to the identification of community structure and thus various dimension reduction methods might be used for the identification of community structure. Through introducing the correlation matrix, we further conclude that the rescaling transformation is crucial to identify the multiscale community structure of network, as well as the translation and rotation transformations.

Multi-Target Angle Tracking Algorithm for Bistatic MIMO Radar Based on the Elements of the Covariance Matrix

PubMed Central

Zhang, Zhengyan; Zhang, Jianyun; Zhou, Qingsong; Li, Xiaobo

2018-01-01

In this paper, we consider the problem of tracking the direction of arrivals (DOA) and the direction of departure (DOD) of multiple targets for bistatic multiple-input multiple-output (MIMO) radar. A high-precision tracking algorithm for target angle is proposed. First, the linear relationship between the covariance matrix difference and the angle difference of the adjacent moment was obtained through three approximate relations. Then, the proposed algorithm obtained the relationship between the elements in the covariance matrix difference. On this basis, the performance of the algorithm was improved by averaging the covariance matrix element. Finally, the least square method was used to estimate the DOD and DOA. The algorithm realized the automatic correlation of the angle and provided better performance when compared with the adaptive asymmetric joint diagonalization (AAJD) algorithm. The simulation results demonstrated the effectiveness of the proposed algorithm. The algorithm provides the technical support for the practical application of MIMO radar. PMID:29518957

Engineering a collagen matrix that replicates the biological properties of native extracellular matrix.

PubMed

Nam, Kwangwoo; Sakai, Yuuki; Funamoto, Seiichi; Kimura, Tsuyoshi; Kishida, Akio

2011-01-01

In this study, we aimed to replicate the function of native tissues that can be used in tissue engineering and regenerative medicine. The key to such replication is the preparation of an artificial collagen matrix that possesses a structure resembling that of the extracellular matrix. We, therefore, prepared a collagen matrix by fibrillogenesis in a NaCl/Na(2)HPO(4) aqueous solution using a dialysis cassette and investigated its biological behavior in vitro and in vivo. The in vitro cell adhesion and proliferation did not show any significant differences. The degradation rate in the living body could be controlled according to the preparation condition, where the collagen matrix with high water content (F-collagen matrix, >98%) showed fast degradation and collagen matrix with lower water content (T-collagen matrix, >80%) showed no degradation for 8 weeks. The degradation did not affect the inflammatory response at all and relatively faster wound healing response was observed. Comparing this result with that of collagen gel and decellularized cornea, it can be concluded that the structural factor is very important and no cell abnormal behavior would be observed for quaternary structured collagen matrix.

Enhancement of ORR catalytic activity by multiple heteroatom-doped carbon materials.

PubMed

Kim, Dae-wook; Li, Oi Lun; Saito, Nagahiro

2015-01-07

Heteroatom-doped carbon matrices have been attracting significant attention due to their superior electrochemical stability, light weight and low cost. Hence, in this study, various types of heteroatom, including single dopants of N, B and P and multiple dopants of B-N and P-N with a carbon matrix were synthesized by an innovative method named the solution plasma process. The heteroatom was doped into the carbon matrix during the discharge process by continuous dissociation and recombination of precursors. The chemical bonding structure, ORR activity and electrochemical performance were compared in detail for each single dopant and multiple dopants. According to the Raman spectra, the carbon structures were deformed by the doped heteroatoms in the carbon matrix. In comparison with N-doped structures (NCNS), the ORR potential of PN-doped structures (PNCNS) was positively shifted from -0.27 V to -0.24 V. It was observed that doping with N decreased the bonding between P and C in the matrix. The multiple doping induced additional active sites for ORR which further enhanced ORR activity and stability. Therefore, PNCNS is a promising metal-free catalyst for ORR at the cathode in a fuel cell.

Matrix formalism of electromagnetic wave propagation through multiple layers in the near-field region: application to the flat panel display.

PubMed

Lee, C Y; Lee, D E; Hong, Y K; Shim, J H; Jeong, C K; Joo, J; Zang, D S; Shim, M G; Lee, J J; Cha, J K; Yang, H G

2003-04-01

We have developed an electromagnetic (EM) wave propagation theory through a single layer and multiple layers in the near-field and far-field regions, and have constructed a matrix formalism in terms of the boundary conditions of the EM waves. From the shielding efficiency (SE) against EM radiation in the near-field region calculated by using the matrix formalism, we propose that the effect of multiple layers yields enhanced shielding capability compared to a single layer with the same total thickness in conducting layers as the multiple layers. We compare the intensities of an EM wave propagating through glass coated with conducting indium tin oxide (ITO) on one side and on both sides, applying it to the electromagnetic interference (EMI) shielding filter in a flat panel display such as a plasma display panel (PDP). From the measured intensities of EMI noise generated by a PDP loaded with ITO coated glass samples, the two-side coated glass shows a lower intensity of EMI noise compared to the one-side coated glass. The result confirms the enhancement of the SE due to the effect of multiple layers, as expected in the matrix formalism of EM wave propagation in the near-field region. In the far-field region, the two-side coated glass with ITO in multiple layers has a higher SE than the one-side coated glass with ITO, when the total thickness of ITO in both cases is the same.

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.

a Global Registration Algorithm of the Single-Closed Ring Multi-Stations Point Cloud

NASA Astrophysics Data System (ADS)

Yang, R.; Pan, L.; Xiang, Z.; Zeng, H.

2018-04-01

Aimed at the global registration problem of the single-closed ring multi-stations point cloud, a formula in order to calculate the error of rotation matrix was constructed according to the definition of error. The global registration algorithm of multi-station point cloud was derived to minimize the error of rotation matrix. And fast-computing formulas of transformation matrix with whose implementation steps and simulation experiment scheme was given. Compared three different processing schemes of multi-station point cloud, the experimental results showed that the effectiveness of the new global registration method was verified, and it could effectively complete the global registration of point cloud.

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.

Modal identification of dynamic mechanical systems

NASA Astrophysics Data System (ADS)

Srivastava, R. K.; Kundra, T. K.

1992-07-01

This paper reviews modal identification techniques which are now helping designers all over the world to improve the dynamic behavior of vibrating engineering systems. In this context the need to develop more accurate and faster parameter identification is ever increasing. A new dynamic stiffness matrix based identification method which is highly accurate, fast and system-dynamic-modification compatible is presented. The technique is applicable to all those multidegree-of-freedom systems where full receptance matrix can be experimentally measured.

Performance comparisons on spatial lattice algorithm and direct matrix inverse method with application to adaptive arrays processing

NASA Technical Reports Server (NTRS)

An, S. H.; Yao, K.

1986-01-01

Lattice algorithm has been employed in numerous adaptive filtering applications such as speech analysis/synthesis, noise canceling, spectral analysis, and channel equalization. In this paper the application to adaptive-array processing is discussed. The advantages are fast convergence rate as well as computational accuracy independent of the noise and interference conditions. The results produced by this technique are compared to those obtained by the direct matrix inverse method.

Matrix-assisted laser desorption ionization-time of flight mass spectrometry for direct bacterial identification from positive blood culture pellets.

PubMed

Prod'hom, Guy; Bizzini, Alain; Durussel, Christian; Bille, Jacques; Greub, Gilbert

2010-04-01

An ammonium chloride erythrocyte-lysing procedure was used to prepare a bacterial pellet from positive blood cultures for direct matrix-assisted laser desorption-ionization time of flight (MALDI-TOF) mass spectrometry analysis. Identification was obtained for 78.7% of the pellets tested. Moreover, 99% of the MALDI-TOF identifications were congruent at the species level when considering valid scores. This fast and accurate method is promising.

Validation of the Applied Biosystems 7500 Fast Instrument for Detection of Listeria Species with the SureTect Listeria Species PCR Assay.

PubMed

Cloke, Jonathan; Arizanova, Julia; Crabtree, David; Simpson, Helen; Evans, Katharine; Vaahtoranta, Laura; Palomäki, Jukka-Pekka; Artimo, Paulus; Huang, Feng; Liikanen, Maria; Koskela, Suvi; Chen, Yi

2016-01-01

The Thermo Scientific™ SureTect™ Listeria species Real-Time PCR Assay was certified during 2013 by the AOAC Research Institute (RI) Performance Tested Methods(SM) program as a rapid method for the detection of Listeria species from a wide range of food matrixes and surface samples. A method modification study was conducted in 2015 to extend the matrix claims of the product to a wider range of food matrixes. This report details the method modification study undertaken to extend the use of this PCR kit to the Applied Biosystems™ 7500 Fast PCR Instrument and Applied Biosystems RapidFinder™ Express 2.0 software allowing use of the assay on a 96-well format PCR cycler in addition to the current workflow, using the 24-well Thermo Scientific PikoReal™ PCR Instrument and Thermo Scientific SureTect software. The method modification study presented in this report was assessed by the AOAC-RI as being a level 2 method modification study, necessitating a method developer study on a representative range of food matrixes covering raw ground turkey, 2% fat pasteurized milk, and bagged lettuce as well as stainless steel surface samples. All testing was conducted in comparison to the reference method detailed in International Organization for Standardization (ISO) 6579:2002. No significant difference by probability of detection statistical analysis was found between the SureTect Listeria species PCR Assay or the ISO reference method methods for any of the three food matrixes and the surface samples analyzed during the study.

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.

A fast Bayesian approach to discrete object detection in astronomical data sets - PowellSnakes I

NASA Astrophysics Data System (ADS)

Carvalho, Pedro; Rocha, Graça; Hobson, M. P.

2009-03-01

A new fast Bayesian approach is introduced for the detection of discrete objects immersed in a diffuse background. This new method, called PowellSnakes, speeds up traditional Bayesian techniques by (i) replacing the standard form of the likelihood for the parameters characterizing the discrete objects by an alternative exact form that is much quicker to evaluate; (ii) using a simultaneous multiple minimization code based on Powell's direction set algorithm to locate rapidly the local maxima in the posterior and (iii) deciding whether each located posterior peak corresponds to a real object by performing a Bayesian model selection using an approximate evidence value based on a local Gaussian approximation to the peak. The construction of this Gaussian approximation also provides the covariance matrix of the uncertainties in the derived parameter values for the object in question. This new approach provides a speed up in performance by a factor of `100' as compared to existing Bayesian source extraction methods that use Monte Carlo Markov chain to explore the parameter space, such as that presented by Hobson & McLachlan. The method can be implemented in either real or Fourier space. In the case of objects embedded in a homogeneous random field, working in Fourier space provides a further speed up that takes advantage of the fact that the correlation matrix of the background is circulant. We illustrate the capabilities of the method by applying to some simplified toy models. Furthermore, PowellSnakes has the advantage of consistently defining the threshold for acceptance/rejection based on priors which cannot be said of the frequentist methods. We present here the first implementation of this technique (version I). Further improvements to this implementation are currently under investigation and will be published shortly. The application of the method to realistic simulated Planck observations will be presented in a forthcoming publication.

RSAT matrix-clustering: dynamic exploration and redundancy reduction of transcription factor binding motif collections

PubMed Central

Jaeger, Sébastien; Thieffry, Denis

2017-01-01

Abstract Transcription factor (TF) databases contain multitudes of binding motifs (TFBMs) from various sources, from which non-redundant collections are derived by manual curation. The advent of high-throughput methods stimulated the production of novel collections with increasing numbers of motifs. Meta-databases, built by merging these collections, contain redundant versions, because available tools are not suited to automatically identify and explore biologically relevant clusters among thousands of motifs. Motif discovery from genome-scale data sets (e.g. ChIP-seq) also produces redundant motifs, hampering the interpretation of results. We present matrix-clustering, a versatile tool that clusters similar TFBMs into multiple trees, and automatically creates non-redundant TFBM collections. A feature unique to matrix-clustering is its dynamic visualisation of aligned TFBMs, and its capability to simultaneously treat multiple collections from various sources. We demonstrate that matrix-clustering considerably simplifies the interpretation of combined results from multiple motif discovery tools, and highlights biologically relevant variations of similar motifs. We also ran a large-scale application to cluster ∼11 000 motifs from 24 entire databases, showing that matrix-clustering correctly groups motifs belonging to the same TF families, and drastically reduced motif redundancy. matrix-clustering is integrated within the RSAT suite (http://rsat.eu/), accessible through a user-friendly web interface or command-line for its integration in pipelines. PMID:28591841

Fast Numerical Methods for the Design of Layered Photonic Structures with Rough Interfaces

NASA Technical Reports Server (NTRS)

Komarevskiy, Nikolay; Braginsky, Leonid; Shklover, Valery; Hafner, Christian; Lawson, John

2011-01-01

Modified boundary conditions (MBC) and a multilayer approach (MA) are proposed as fast and efficient numerical methods for the design of 1D photonic structures with rough interfaces. These methods are applicable for the structures, composed of materials with arbitrary permittivity tensor. MBC and MA are numerically validated on different types of interface roughness and permittivities of the constituent materials. The proposed methods can be combined with the 4x4 scattering matrix method as a field solver and an evolutionary strategy as an optimizer. The resulted optimization procedure is fast, accurate, numerically stable and can be used to design structures for various applications.

An inexpensive and fast method for infiltration coating of complex geometry matrices for ISOL production target applications

NASA Astrophysics Data System (ADS)

Kawai, Y.; Alton, G. D.; Bilheux, J.-C.

2005-12-01

An inexpensive, fast, and close to universal infiltration coating technique has been developed for fabricating fast diffusion-release ISOL targets. Targets are fabricated by deposition of finely divided (∼1 μm) compound materials in a paint-slurry onto highly permeable, complex structure reticulated-vitreous-carbon-foam (RVCF) matrices, followed by thermal heat treatment. In this article, we describe the coating method and present information on the physical integrity, uniformity of deposition, and matrix adherence of SiC, HfC and UC2 targets, destined for on-line use as targets at the Holifield Radioactive Ion Beam Facility (HRIBF).

Development of a multiple-class analytical method based on the use of synthetic matrices for the simultaneous determination of commonly used commercial surfactants in wastewater by liquid chromatography-tandem mass spectrometry.

PubMed

Alexandre, Bergé; Barbara, Giroud; Laure, Wiest; Bruno, Domenjoud; Adriana, Gonzalez-Ospina; Emmanuelle, Vulliet

2016-06-10

Discharges of surfactants from wastewater treatment plants are often considered as the principal vector of pollution into the environment. The analysis of complex matrices, such as urban wastewater, suspended solids and biological sludge requires careful preparation of the sample to obtain a sensitive, selective and reproducible analysis. A simple, fast, effective and multi-residue method based on the SPE (water) and QuEChERS (solid matrices) approaches using synthetic matrices for validation and quantification, has been developed for the determination of 16 surfactants in wastewater, suspended solids and biological sludge. This work resulted in an innovative method that was validated to detect and assess several classes of surfactants such as quaternary ammonium compounds, betaïns, alkylphenols and their ethoxylated or sulfated derivatives in urban wastewater and solid matrices. The optimised extraction method exhibited recoveries comprised between 83% and 120% for all the tested compounds in the dissolved matrix and between 50% and 109% for particulate matrix. The limits of quantification of all compounds were comprised between 0.1 and 1.0μg/L for dissolved matrix and between 2 and 1000ng/g (dry weight) in particulate matrix. Linearity was assessed for all compounds within the [LOQ-250LOQ] range. Confidence intervals were also computed in real matrices with less than 15% margin of error for all studied surfactants. This work has confirmed, first and foremost, that surfactants are indeed highly concentrated in urban wastewater. As expected, linear alkylbenzene sulfonates were present at significant concentrations (up to 1-2mg/L). In addition, although biological processing results in significant removal of the total pollution, the residual concentrations at output of WWTP remain significant (up to 100μg/L). Copyright © 2016 Elsevier B.V. All rights reserved.

Rational reduction of periodic propagators for off-period observations.

PubMed

Blanton, Wyndham B; Logan, John W; Pines, Alexander

2004-02-01

Many common solid-state nuclear magnetic resonance problems take advantage of the periodicity of the underlying Hamiltonian to simplify the computation of an observation. Most of the time-domain methods used, however, require the time step between observations to be some integer or reciprocal-integer multiple of the period, thereby restricting the observation bandwidth. Calculations of off-period observations are usually reduced to brute force direct methods resulting in many demanding matrix multiplications. For large spin systems, the matrix multiplication becomes the limiting step. A simple method that can dramatically reduce the number of matrix multiplications required to calculate the time evolution when the observation time step is some rational fraction of the period of the Hamiltonian is presented. The algorithm implements two different optimization routines. One uses pattern matching and additional memory storage, while the other recursively generates the propagators via time shifting. The net result is a significant speed improvement for some types of time-domain calculations.

Matrix-assisted laser desorption/ionization time-of-flight mass spectrometry as a tool for fast identification of protein binders in color layers of paintings.

PubMed

Hynek, Radovan; Kuckova, Stepanka; Hradilova, Janka; Kodicek, Milan

2004-01-01

Identification of materials in color layers of paintings is necessary for correct decisions concerning restoration procedures as well as proving the authenticity of the painting. The proteins are usually important components of the painting layers. In this paper it has been demonstrated that matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOFMS) can be used for fast and reliable identification of proteins in color layers even in old, highly aged matrices. The digestion can be easily performed directly on silica wafers which are routinely used for infrared analysis. The amount of material necessary for such an analysis is extremely small. Peptide mass mapping using digestion with trypsin followed by MALDI-TOFMS and identification of the protein was successfully used for determination of the binder from a painting of the 19th century. Copyright 2004 John Wiley & Sons, Ltd.

A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

NASA Astrophysics Data System (ADS)

Gillis, Nicolas; Luce, Robert

2018-01-01

A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth optimization problem where the sparsity is enforced through linear constraints. We show that the Euclidean projection on the polyhedron defined by these constraints can be computed efficiently, and propose a fast gradient method to solve our model. We compare our algorithm with several state-of-the-art methods on synthetic data sets and real-world hyperspectral images.

Neuronal matrix metalloproteinase-9 is a determinant of selective neurodegeneration

PubMed Central

Kaplan, Artem; Spiller, Krista J.; Towne, Christopher; Kanning, Kevin C.; Choe, Ginn T.; Geber, Adam; Akay, Turgay; Aebischer, Patrick; Henderson, Christopher E.

2018-01-01

SUMMARY Selective neuronal loss is the hallmark of neurodegenerative diseases. In patients with amyotrophic lateral sclerosis (ALS), most motor neurons die but those innervating extraocular, pelvic sphincter and slow limb muscles exhibit selective resistance. We identified 18 genes that show >10-fold differential expression between resistant and vulnerable motor neurons. One of these, matrix metalloproteinase-9 (MMP-9), is expressed only by fast motor neurons, which are selectively vulnerable. In ALS model mice expressing mutant SOD1, reduction of MMP-9 function using gene ablation, viral gene therapy or pharmacological inhibition significantly delayed muscle denervation. In the presence of mutant SOD1, MMP-9 expressed by fast motor neurons themselves enhances activation of ER stress and is sufficient to trigger axonal die-back. These findings define MMP-9 as a candidate therapeutic target for ALS. The molecular basis of neuronal diversity thus provides novel insights into mechanisms of selective vulnerability to neurodegeneration. PMID:24462097

An efficient matrix-matrix multiplication based antisymmetric tensor contraction engine for general order coupled cluster.

PubMed

Hanrath, Michael; Engels-Putzka, Anna

2010-08-14

In this paper, we present an efficient implementation of general tensor contractions, which is part of a new coupled-cluster program. The tensor contractions, used to evaluate the residuals in each coupled-cluster iteration are particularly important for the performance of the program. We developed a generic procedure, which carries out contractions of two tensors irrespective of their explicit structure. It can handle coupled-cluster-type expressions of arbitrary excitation level. To make the contraction efficient without loosing flexibility, we use a three-step procedure. First, the data contained in the tensors are rearranged into matrices, then a matrix-matrix multiplication is performed, and finally the result is backtransformed to a tensor. The current implementation is significantly more efficient than previous ones capable of treating arbitrary high excitations.

Sampling and Homogenization Strategies Significantly Influence the Detection of Foodborne Pathogens in Meat.

PubMed

Rohde, Alexander; Hammerl, Jens Andre; Appel, Bernd; Dieckmann, Ralf; Al Dahouk, Sascha

2015-01-01

Efficient preparation of food samples, comprising sampling and homogenization, for microbiological testing is an essential, yet largely neglected, component of foodstuff control. Salmonella enterica spiked chicken breasts were used as a surface contamination model whereas salami and meat paste acted as models of inner-matrix contamination. A systematic comparison of different homogenization approaches, namely, stomaching, sonication, and milling by FastPrep-24 or SpeedMill, revealed that for surface contamination a broad range of sample pretreatment steps is applicable and loss of culturability due to the homogenization procedure is marginal. In contrast, for inner-matrix contamination long treatments up to 8 min are required and only FastPrep-24 as a large-volume milling device produced consistently good recovery rates. In addition, sampling of different regions of the spiked sausages showed that pathogens are not necessarily homogenously distributed throughout the entire matrix. Instead, in meat paste the core region contained considerably more pathogens compared to the rim, whereas in the salamis the distribution was more even with an increased concentration within the intermediate region of the sausages. Our results indicate that sampling and homogenization as integral parts of food microbiology and monitoring deserve more attention to further improve food safety.

Sampling and Homogenization Strategies Significantly Influence the Detection of Foodborne Pathogens in Meat

PubMed Central

Rohde, Alexander; Hammerl, Jens Andre; Appel, Bernd; Dieckmann, Ralf; Al Dahouk, Sascha

2015-01-01

Efficient preparation of food samples, comprising sampling and homogenization, for microbiological testing is an essential, yet largely neglected, component of foodstuff control. Salmonella enterica spiked chicken breasts were used as a surface contamination model whereas salami and meat paste acted as models of inner-matrix contamination. A systematic comparison of different homogenization approaches, namely, stomaching, sonication, and milling by FastPrep-24 or SpeedMill, revealed that for surface contamination a broad range of sample pretreatment steps is applicable and loss of culturability due to the homogenization procedure is marginal. In contrast, for inner-matrix contamination long treatments up to 8 min are required and only FastPrep-24 as a large-volume milling device produced consistently good recovery rates. In addition, sampling of different regions of the spiked sausages showed that pathogens are not necessarily homogenously distributed throughout the entire matrix. Instead, in meat paste the core region contained considerably more pathogens compared to the rim, whereas in the salamis the distribution was more even with an increased concentration within the intermediate region of the sausages. Our results indicate that sampling and homogenization as integral parts of food microbiology and monitoring deserve more attention to further improve food safety. PMID:26539462

W-phase estimation of first-order rupture distribution for megathrust earthquakes

NASA Astrophysics Data System (ADS)

Benavente, Roberto; Cummins, Phil; Dettmer, Jan

2014-05-01

Estimating the rupture pattern for large earthquakes during the first hour after the origin time can be crucial for rapid impact assessment and tsunami warning. However, the estimation of coseismic slip distribution models generally involves complex methodologies that are difficult to implement rapidly. Further, while model parameter uncertainty can be crucial for meaningful estimation, they are often ignored. In this work we develop a finite fault inversion for megathrust earthquakes which rapidly generates good first order estimates and uncertainties of spatial slip distributions. The algorithm uses W-phase waveforms and a linear automated regularization approach to invert for rupture models of some recent megathrust earthquakes. The W phase is a long period (100-1000 s) wave which arrives together with the P wave. Because it is fast, has small amplitude and a long-period character, the W phase is regularly used to estimate point source moment tensors by the NEIC and PTWC, among others, within an hour of earthquake occurrence. We use W-phase waveforms processed in a manner similar to that used for such point-source solutions. The inversion makes use of 3 component W-phase records retrieved from the Global Seismic Network. The inverse problem is formulated by a multiple time window method, resulting in a linear over-parametrized problem. The over-parametrization is addressed by Tikhonov regularization and regularization parameters are chosen according to the discrepancy principle by grid search. Noise on the data is addressed by estimating the data covariance matrix from data residuals. The matrix is obtained by starting with an a priori covariance matrix and then iteratively updating the matrix based on the residual errors of consecutive inversions. Then, a covariance matrix for the parameters is computed using a Bayesian approach. The application of this approach to recent megathrust earthquakes produces models which capture the most significant features of their slip distributions. Also, reliable solutions are generally obtained with data in a 30-minute window following the origin time, suggesting that a real-time system could obtain solutions in less than one hour following the origin time.

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

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

A new fast algorithm for computing a complex number: Theoretic transforms

NASA Technical Reports Server (NTRS)

Reed, I. S.; Liu, K. Y.; Truong, T. K.

1977-01-01

A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.

Strategies for global optimization in photonics design.

PubMed

Vukovic, Ana; Sewell, Phillip; Benson, Trevor M

2010-10-01

This paper reports on two important issues that arise in the context of the global optimization of photonic components where large problem spaces must be investigated. The first is the implementation of a fast simulation method and associated matrix solver for assessing particular designs and the second, the strategies that a designer can adopt to control the size of the problem design space to reduce runtimes without compromising the convergence of the global optimization tool. For this study an analytical simulation method based on Mie scattering and a fast matrix solver exploiting the fast multipole method are combined with genetic algorithms (GAs). The impact of the approximations of the simulation method on the accuracy and runtime of individual design assessments and the consequent effects on the GA are also examined. An investigation of optimization strategies for controlling the design space size is conducted on two illustrative examples, namely, 60° and 90° waveguide bends based on photonic microstructures, and their effectiveness is analyzed in terms of a GA's ability to converge to the best solution within an acceptable timeframe. Finally, the paper describes some particular optimized solutions found in the course of this work.

Alternative Manufacturing Concepts for Solid Oral Dosage Forms From Drug Nanosuspensions Using Fluid Dispensing and Forced Drying Technology.

PubMed

Bonhoeffer, Bastian; Kwade, Arno; Juhnke, Michael

2018-03-01

Flexible manufacturing technologies for solid oral dosage forms with a continuous adjustability of the manufactured dose strength are of interest for applications in personalized medicine. This study explored the feasibility of using microvalve technology for the manufacturing of different solid oral dosage form concepts. Hard gelatin capsules filled with excipients, placebo tablets, and polymer films, placed in hard gelatin capsules after drying, were considered as substrates. For each concept, a basic understanding of relevant formulation parameters and their impact on dissolution behavior has been established. Suitable matrix formers, present either on the substrate or directly in the drug nanosuspension, proved to be essential to prevent nanoparticle agglomeration of the drug nanoparticles and to ensure a fast dissolution behavior. Furthermore, convection and radiation drying methods were investigated for the fast drying of drug nanosuspensions dispensed onto polymer films, which were then placed in hard gelatin capsules. Changes in morphology and in drug and matrix former distribution were observed for increasing drying intensity. However, even fast drying times below 1 min could be realized, while maintaining the nanoparticulate drug structure and a good dissolution behavior. Copyright © 2018 American Pharmacists Association®. Published by Elsevier Inc. All rights reserved.

Dynamic formation of microenvironments at the myotendinous junction correlates with muscle fiber morphogenesis in zebrafish

PubMed Central

Snow, Chelsi J.; Henry, Clarissa A.

2009-01-01

Muscle development involves the specification and morphogenesis of muscle fibers that attach to tendons. After attachment, muscles and tendons then function as an integrated unit to transduce force to the skeletal system and stabilize joints. The attachment site is the myotendinous junction, or MTJ, and is the primary site of force transmission. We find that attachment of fast-twitch myofibers to the MTJ correlates with the formation of novel microenvironments within the MTJ. The expression or activation of two proteins involved in anchoring the intracellular cytoskeleton to the extracellular matrix, Focal adhesion kinase (Fak) and β-dystroglycan is up-regulated. Conversely, the extracellular matrix protein Fibronectin (Fn) is down-regulated. This degradation of Fn as fast-twitch fibers attach to the MTJ results in Fn protein defining a novel microenvironment within the MTJ adjacent to slow-twitch, but not fast-twitch, muscle. Interestingly, however, Fak, laminin, Fn and β-dystroglycan concentrate at the MTJ in mutants that do not have slow-twitch fibers. Taken together, these data elucidate novel and dynamic microenvironments within the MTJ and indicate that MTJ morphogenesis is spatially and temporally complex. PMID:18783736

aMC fast: automation of fast NLO computations for PDF fits

NASA Astrophysics Data System (ADS)

Bertone, Valerio; Frederix, Rikkert; Frixione, Stefano; Rojo, Juan; Sutton, Mark

2014-08-01

We present the interface between M adG raph5_ aMC@NLO, a self-contained program that calculates cross sections up to next-to-leading order accuracy in an automated manner, and APPL grid, a code that parametrises such cross sections in the form of look-up tables which can be used for the fast computations needed in the context of PDF fits. The main characteristic of this interface, which we dub aMC fast, is its being fully automated as well, which removes the need to extract manually the process-specific information for additional physics processes, as is the case with other matrix-element calculators, and renders it straightforward to include any new process in the PDF fits. We demonstrate this by studying several cases which are easily measured at the LHC, have a good constraining power on PDFs, and some of which were previously unavailable in the form of a fast interface.

Feasibility Study to Evaluate Candidate Materials of Nanofilled Block Copolymers for Use in Ultra High Density Pulsed Power Capacitors

DTIC Science & Technology

2015-10-26

grafting block copolymer (BCP) to nanoparticles (BCP-g-NPs) to chemically match the corona of NPs with BCP matrix has resulted in a highly dispersed BCP...strategy of grafting BCP to nanoparticles in order to chemically match the corona of nanoparticles with BCP matrix has resulted in a highly dispersed...fast energy storage and discharge capabilities. However, the energy storage density of these capacitors is limited by the dielectric properties of

Density-matrix-based algorithm for solving eigenvalue problems

NASA Astrophysics Data System (ADS)

Polizzi, Eric

2009-03-01

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

Unsupervised Learning for Monaural Source Separation Using Maximization–Minimization Algorithm with Time–Frequency Deconvolution †

PubMed Central

Bouridane, Ahmed; Ling, Bingo Wing-Kuen

2018-01-01

This paper presents an unsupervised learning algorithm for sparse nonnegative matrix factor time–frequency deconvolution with optimized fractional β-divergence. The β-divergence is a group of cost functions parametrized by a single parameter β. The Itakura–Saito divergence, Kullback–Leibler divergence and Least Square distance are special cases that correspond to β=0, 1, 2, respectively. This paper presents a generalized algorithm that uses a flexible range of β that includes fractional values. It describes a maximization–minimization (MM) algorithm leading to the development of a fast convergence multiplicative update algorithm with guaranteed convergence. The proposed model operates in the time–frequency domain and decomposes an information-bearing matrix into two-dimensional deconvolution of factor matrices that represent the spectral dictionary and temporal codes. The deconvolution process has been optimized to yield sparse temporal codes through maximizing the likelihood of the observations. The paper also presents a method to estimate the fractional β value. The method is demonstrated on separating audio mixtures recorded from a single channel. The paper shows that the extraction of the spectral dictionary and temporal codes is significantly more efficient by using the proposed algorithm and subsequently leads to better source separation performance. Experimental tests and comparisons with other factorization methods have been conducted to verify its efficacy. PMID:29702629

Matrix diffusion coefficients in volcanic rocks at the Nevada test site: influence of matrix porosity, matrix permeability, and fracture coating minerals.

PubMed

Reimus, Paul W; Callahan, Timothy J; Ware, S Doug; Haga, Marc J; Counce, Dale A

2007-08-15

Diffusion cell experiments were conducted to measure nonsorbing solute matrix diffusion coefficients in forty-seven different volcanic rock matrix samples from eight different locations (with multiple depth intervals represented at several locations) at the Nevada Test Site. The solutes used in the experiments included bromide, iodide, pentafluorobenzoate (PFBA), and tritiated water ((3)HHO). The porosity and saturated permeability of most of the diffusion cell samples were measured to evaluate the correlation of these two variables with tracer matrix diffusion coefficients divided by the free-water diffusion coefficient (D(m)/D*). To investigate the influence of fracture coating minerals on matrix diffusion, ten of the diffusion cells represented paired samples from the same depth interval in which one sample contained a fracture surface with mineral coatings and the other sample consisted of only pure matrix. The log of (D(m)/D*) was found to be positively correlated with both the matrix porosity and the log of matrix permeability. A multiple linear regression analysis indicated that both parameters contributed significantly to the regression at the 95% confidence level. However, the log of the matrix diffusion coefficient was more highly-correlated with the log of matrix permeability than with matrix porosity, which suggests that matrix diffusion coefficients, like matrix permeabilities, have a greater dependence on the interconnectedness of matrix porosity than on the matrix porosity itself. The regression equation for the volcanic rocks was found to provide satisfactory predictions of log(D(m)/D*) for other types of rocks with similar ranges of matrix porosity and permeability as the volcanic rocks, but it did a poorer job predicting log(D(m)/D*) for rocks with lower porosities and/or permeabilities. The presence of mineral coatings on fracture walls did not appear to have a significant effect on matrix diffusion in the ten paired diffusion cell experiments.

Matrix diffusion coefficients in volcanic rocks at the Nevada test site: Influence of matrix porosity, matrix permeability, and fracture coating minerals

NASA Astrophysics Data System (ADS)

Reimus, Paul W.; Callahan, Timothy J.; Ware, S. Doug; Haga, Marc J.; Counce, Dale A.

2007-08-01

Diffusion cell experiments were conducted to measure nonsorbing solute matrix diffusion coefficients in forty-seven different volcanic rock matrix samples from eight different locations (with multiple depth intervals represented at several locations) at the Nevada Test Site. The solutes used in the experiments included bromide, iodide, pentafluorobenzoate (PFBA), and tritiated water ( 3HHO). The porosity and saturated permeability of most of the diffusion cell samples were measured to evaluate the correlation of these two variables with tracer matrix diffusion coefficients divided by the free-water diffusion coefficient ( Dm/ D*). To investigate the influence of fracture coating minerals on matrix diffusion, ten of the diffusion cells represented paired samples from the same depth interval in which one sample contained a fracture surface with mineral coatings and the other sample consisted of only pure matrix. The log of ( Dm/ D*) was found to be positively correlated with both the matrix porosity and the log of matrix permeability. A multiple linear regression analysis indicated that both parameters contributed significantly to the regression at the 95% confidence level. However, the log of the matrix diffusion coefficient was more highly-correlated with the log of matrix permeability than with matrix porosity, which suggests that matrix diffusion coefficients, like matrix permeabilities, have a greater dependence on the interconnectedness of matrix porosity than on the matrix porosity itself. The regression equation for the volcanic rocks was found to provide satisfactory predictions of log( Dm/ D*) for other types of rocks with similar ranges of matrix porosity and permeability as the volcanic rocks, but it did a poorer job predicting log( Dm/ D*) for rocks with lower porosities and/or permeabilities. The presence of mineral coatings on fracture walls did not appear to have a significant effect on matrix diffusion in the ten paired diffusion cell experiments.

Use of a new collagen matrix (mucograft) for the treatment of multiple gingival recessions: case reports.

PubMed

Rotundo, Roberto; Pini-Prato, Giovanpaolo

2012-08-01

The aim of this case report study was to demonstrate the use of a new collagen matrix as an alternative to the connective tissue graft for the treatment of multiple gingival recessions. Three women showing 11 maxillary gingival recessions were treated by means of the envelope flap technique associated with a novel collagen matrix as a substitute for the connective tissue graft. At 1 year, complete root coverage was achieved in 9 treated sites, with a mean keratinized tissue width of 3.1 mm, complete resolution of dental hypersensitivity, and a high level of esthetic satisfaction.

Determination of perfluorinated carboxylic acids in fish fillet by micro-solid phase extraction, followed by liquid chromatography-triple quadrupole mass spectrometry.

PubMed

Lashgari, Maryam; Lee, Hian Kee

2014-11-21

In the current study, a simple, fast and efficient combination of protein precipitation and micro-solid phase extraction (μ-SPE) followed by liquid chromatography-triple quadrupole tandem mass spectrometry (LC-MS/MS) was developed for the determination of perfluorinated carboxylic acids (PFCAs) in fish fillet. Ten PFCAs with different hydrocarbon chain lengths (C5-C14) were analysed simultaneously using this method. Protein precipitation by acetonitrile and μ-SPE by surfactant-incorporated ordered mesoporous silica were applied to the extraction and concentration of the PFCAs as well as for removal of interferences. Determination of the PFCAs was carried out by LC-MS/MS in negative electrospray ionization mode. MS/MS parameters were optimized for multiple reaction monitoring of the analytes. (13)C mass labelled PFOA as a stable-isotopic internal standard, was used for calibration. The detection limits of the method ranged from 0.97 ng/g to 2.7 ng/g, with a relative standard deviation of between 5.4 and 13.5. The recoveries were evaluated for each analyte and were ranged from 77% to 120%. The t-test at 95% confidence level showed that for all the analytes, the relative recoveries did not depend on their concentrations in the explored concentration range. The effect of the matrix on MS signals (suppression or enhancement) was also evaluated. Contamination at low levels was detected for some analytes in the fish samples. The protective role of the polypropylene membrane used in μ-SPE in the elimination of matrix effects was evaluated by parallel experiments in classical dispersive solid phase extraction. The results evidently showed that the polypropylene membrane was significantly effective in reducing matrix effects. Copyright © 2014 Elsevier B.V. All rights reserved.

Fast Generation of Ensembles of Cosmological N-Body Simulations via Mode-Resampling

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

Schneider, M D; Cole, S; Frenk, C S

2011-02-14

We present an algorithm for quickly generating multiple realizations of N-body simulations to be used, for example, for cosmological parameter estimation from surveys of large-scale structure. Our algorithm uses a new method to resample the large-scale (Gaussian-distributed) Fourier modes in a periodic N-body simulation box in a manner that properly accounts for the nonlinear mode-coupling between large and small scales. We find that our method for adding new large-scale mode realizations recovers the nonlinear power spectrum to sub-percent accuracy on scales larger than about half the Nyquist frequency of the simulation box. Using 20 N-body simulations, we obtain a powermore » spectrum covariance matrix estimate that matches the estimator from Takahashi et al. (from 5000 simulations) with < 20% errors in all matrix elements. Comparing the rates of convergence, we determine that our algorithm requires {approx}8 times fewer simulations to achieve a given error tolerance in estimates of the power spectrum covariance matrix. The degree of success of our algorithm indicates that we understand the main physical processes that give rise to the correlations in the matter power spectrum. Namely, the large-scale Fourier modes modulate both the degree of structure growth through the variation in the effective local matter density and also the spatial frequency of small-scale perturbations through large-scale displacements. We expect our algorithm to be useful for noise modeling when constraining cosmological parameters from weak lensing (cosmic shear) and galaxy surveys, rescaling summary statistics of N-body simulations for new cosmological parameter values, and any applications where the influence of Fourier modes larger than the simulation size must be accounted for.« less

Detection of Matrix Crack Density of CFRP using an Electrical Potential Change Method with Multiple Probes

NASA Astrophysics Data System (ADS)

Todoroki, Akira; Omagari, Kazuomi

Carbon Fiber Reinforced Plastic (CFRP) laminates are adopted for fuel tank structures of next generation space rockets or automobiles. Matrix cracks may cause fuel leak or trigger fatigue damage. A monitoring system of the matrix crack density is required. The authors have developed an electrical resistance change method for the monitoring of delamination cracks in CFRP laminates. Reinforcement fibers are used as a self-sensing system. In the present study, the electric potential method is adopted for matrix crack density monitoring. Finite element analysis (FEA) was performed to investigate the possibility of monitoring matrix crack density using multiple electrodes mounted on a single surface of a specimen. The FEA reveals the matrix crack density increases electrical resistance for a target segment between electrodes. Experimental confirmation was also performed using cross-ply laminates. Eight electrodes were mounted on a single surface of a specimen using silver paste after polishing of the specimen surface with sandpaper. The two outermost electrodes applied electrical current, and the inner electrodes measured electric voltage changes. The slope of electrical resistance during reloading is revealed to be an appropriate index for the detection of matrix crack density.

Implementation and simulations of the sphere solution in FAST

NASA Astrophysics Data System (ADS)

Murgolo, F. P.; Schirone, M. G.; Lattanzi, M.; Bernacca, P. L.

1989-06-01

The details of the implementation of the sphere solution software in the Fundamental Astronomy by Space Techniques (FAST) consortium, are described. The simulation results for realistic data sets, both with and without grid-step errors are given. Expected errors on the astrometric parameters of the primary stars and the precision of the reference great circle zero points, are provided as a function of mission duration. The design matrix, the diagrams of the context processor and the processors experimental results are given.

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.

Fast iterative image reconstruction using sparse matrix factorization with GPU acceleration

NASA Astrophysics Data System (ADS)

Zhou, Jian; Qi, Jinyi

2011-03-01

Statistically based iterative approaches for image reconstruction have gained much attention in medical imaging. An accurate system matrix that defines the mapping from the image space to the data space is the key to high-resolution image reconstruction. However, an accurate system matrix is often associated with high computational cost and huge storage requirement. Here we present a method to address this problem by using sparse matrix factorization and parallel computing on a graphic processing unit (GPU).We factor the accurate system matrix into three sparse matrices: a sinogram blurring matrix, a geometric projection matrix, and an image blurring matrix. The sinogram blurring matrix models the detector response. The geometric projection matrix is based on a simple line integral model. The image blurring matrix is to compensate for the line-of-response (LOR) degradation due to the simplified geometric projection matrix. The geometric projection matrix is precomputed, while the sinogram and image blurring matrices are estimated by minimizing the difference between the factored system matrix and the original system matrix. The resulting factored system matrix has much less number of nonzero elements than the original system matrix and thus substantially reduces the storage and computation cost. The smaller size also allows an efficient implement of the forward and back projectors on GPUs, which have limited amount of memory. Our simulation studies show that the proposed method can dramatically reduce the computation cost of high-resolution iterative image reconstruction. The proposed technique is applicable to image reconstruction for different imaging modalities, including x-ray CT, PET, and SPECT.

Scanning electron microscopy of bone: instrument, specimen, and issues.

PubMed

Boyde, A; Jones, S J

1996-02-01

There are many ways available now to maximise and analyse the information that can be obtained on the structure and constitution of bone using SEM. This paper considers a range of methods and the problems that arise relating to instrumentation and methodology as they apply to the use of SEM in the study of bone. In addition to the review content, some novel technical approaches to the SEM of bone are considered here for the first time; these include low kV imaging for the detection of new surface bone packets (and residual demineralized matrix after resorption), low kV BSE imaging of uncoated, embedded, and unembedded samples, environmental SEM for the study of wet tissue, low distortion, very low magnification imaging for the study of cancellous bone architecture, the use of multiple detectors for fast electrons in improving the imaging of porous samples, and high resolution, low voltage imaging for the study of collagen degradation during bone resorption.

Fixed target matrix for femtosecond time-resolved and in situ serial micro-crystallography

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

Mueller, C.; Marx, A.; Epp, S. W.

We present a crystallography chip enabling in situ room temperature crystallography at microfocus synchrotron beamlines and X-ray free-electron laser (X-FEL) sources. Compared to other in situ approaches, we observe extremely low background and high diffraction data quality. The chip design is robust and allows fast and efficient loading of thousands of small crystals. The ability to load a large number of protein crystals, at room temperature and with high efficiency, into prescribed positions enables high throughput automated serial crystallography with microfocus synchrotron beamlines. In addition, we demonstrate the application of this chip for femtosecond time-resolved serial crystallography at the Linacmore » Coherent Light Source (LCLS, Menlo Park, California, USA). As a result, the chip concept enables multiple images to be acquired from each crystal, allowing differential detection of changes in diffraction intensities in order to obtain high signal-to-noise and fully exploit the time resolution capabilities of XFELs.« less

Fixed target matrix for femtosecond time-resolved and in situ serial micro-crystallography

DOE PAGES

Mueller, C.; Marx, A.; Epp, S. W.; ...

2015-08-18

We present a crystallography chip enabling in situ room temperature crystallography at microfocus synchrotron beamlines and X-ray free-electron laser (X-FEL) sources. Compared to other in situ approaches, we observe extremely low background and high diffraction data quality. The chip design is robust and allows fast and efficient loading of thousands of small crystals. The ability to load a large number of protein crystals, at room temperature and with high efficiency, into prescribed positions enables high throughput automated serial crystallography with microfocus synchrotron beamlines. In addition, we demonstrate the application of this chip for femtosecond time-resolved serial crystallography at the Linacmore » Coherent Light Source (LCLS, Menlo Park, California, USA). As a result, the chip concept enables multiple images to be acquired from each crystal, allowing differential detection of changes in diffraction intensities in order to obtain high signal-to-noise and fully exploit the time resolution capabilities of XFELs.« less

Micro-CT image reconstruction based on alternating direction augmented Lagrangian method and total variation.

PubMed

Gopi, Varun P; Palanisamy, P; Wahid, Khan A; Babyn, Paul; Cooper, David

2013-01-01

Micro-computed tomography (micro-CT) plays an important role in pre-clinical imaging. The radiation from micro-CT can result in excess radiation exposure to the specimen under test, hence the reduction of radiation from micro-CT is essential. The proposed research focused on analyzing and testing an alternating direction augmented Lagrangian (ADAL) algorithm to recover images from random projections using total variation (TV) regularization. The use of TV regularization in compressed sensing problems makes the recovered image quality sharper by preserving the edges or boundaries more accurately. In this work TV regularization problem is addressed by ADAL which is a variant of the classic augmented Lagrangian method for structured optimization. The per-iteration computational complexity of the algorithm is two fast Fourier transforms, two matrix vector multiplications and a linear time shrinkage operation. Comparison of experimental results indicate that the proposed algorithm is stable, efficient and competitive with the existing algorithms for solving TV regularization problems. Copyright © 2013 Elsevier Ltd. All rights reserved.

Fast, long-term, super-resolution imaging with Hessian structured illumination microscopy.

PubMed

Huang, Xiaoshuai; Fan, Junchao; Li, Liuju; Liu, Haosen; Wu, Runlong; Wu, Yi; Wei, Lisi; Mao, Heng; Lal, Amit; Xi, Peng; Tang, Liqiang; Zhang, Yunfeng; Liu, Yanmei; Tan, Shan; Chen, Liangyi

2018-06-01

To increase the temporal resolution and maximal imaging time of super-resolution (SR) microscopy, we have developed a deconvolution algorithm for structured illumination microscopy based on Hessian matrixes (Hessian-SIM). It uses the continuity of biological structures in multiple dimensions as a priori knowledge to guide image reconstruction and attains artifact-minimized SR images with less than 10% of the photon dose used by conventional SIM while substantially outperforming current algorithms at low signal intensities. Hessian-SIM enables rapid imaging of moving vesicles or loops in the endoplasmic reticulum without motion artifacts and with a spatiotemporal resolution of 88 nm and 188 Hz. Its high sensitivity allows the use of sub-millisecond excitation pulses followed by dark recovery times to reduce photobleaching of fluorescent proteins, enabling hour-long time-lapse SR imaging of actin filaments in live cells. Finally, we observed the structural dynamics of mitochondrial cristae and structures that, to our knowledge, have not been observed previously, such as enlarged fusion pores during vesicle exocytosis.

Real-Time Compressive Sensing MRI Reconstruction Using GPU Computing and Split Bregman Methods

PubMed Central

Smith, David S.; Gore, John C.; Yankeelov, Thomas E.; Welch, E. Brian

2012-01-01

Compressive sensing (CS) has been shown to enable dramatic acceleration of MRI acquisition in some applications. Being an iterative reconstruction technique, CS MRI reconstructions can be more time-consuming than traditional inverse Fourier reconstruction. We have accelerated our CS MRI reconstruction by factors of up to 27 by using a split Bregman solver combined with a graphics processing unit (GPU) computing platform. The increases in speed we find are similar to those we measure for matrix multiplication on this platform, suggesting that the split Bregman methods parallelize efficiently. We demonstrate that the combination of the rapid convergence of the split Bregman algorithm and the massively parallel strategy of GPU computing can enable real-time CS reconstruction of even acquisition data matrices of dimension 40962 or more, depending on available GPU VRAM. Reconstruction of two-dimensional data matrices of dimension 10242 and smaller took ~0.3 s or less, showing that this platform also provides very fast iterative reconstruction for small-to-moderate size images. PMID:22481908

Real-Time Compressive Sensing MRI Reconstruction Using GPU Computing and Split Bregman Methods.

PubMed

Smith, David S; Gore, John C; Yankeelov, Thomas E; Welch, E Brian

2012-01-01

Compressive sensing (CS) has been shown to enable dramatic acceleration of MRI acquisition in some applications. Being an iterative reconstruction technique, CS MRI reconstructions can be more time-consuming than traditional inverse Fourier reconstruction. We have accelerated our CS MRI reconstruction by factors of up to 27 by using a split Bregman solver combined with a graphics processing unit (GPU) computing platform. The increases in speed we find are similar to those we measure for matrix multiplication on this platform, suggesting that the split Bregman methods parallelize efficiently. We demonstrate that the combination of the rapid convergence of the split Bregman algorithm and the massively parallel strategy of GPU computing can enable real-time CS reconstruction of even acquisition data matrices of dimension 4096(2) or more, depending on available GPU VRAM. Reconstruction of two-dimensional data matrices of dimension 1024(2) and smaller took ~0.3 s or less, showing that this platform also provides very fast iterative reconstruction for small-to-moderate size images.

Efficient two-dimensional compressive sensing in MIMO radar

NASA Astrophysics Data System (ADS)

Shahbazi, Nafiseh; Abbasfar, Aliazam; Jabbarian-Jahromi, Mohammad

2017-12-01

Compressive sensing (CS) has been a way to lower sampling rate leading to data reduction for processing in multiple-input multiple-output (MIMO) radar systems. In this paper, we further reduce the computational complexity of a pulse-Doppler collocated MIMO radar by introducing a two-dimensional (2D) compressive sensing. To do so, we first introduce a new 2D formulation for the compressed received signals and then we propose a new measurement matrix design for our 2D compressive sensing model that is based on minimizing the coherence of sensing matrix using gradient descent algorithm. The simulation results show that our proposed 2D measurement matrix design using gradient decent algorithm (2D-MMDGD) has much lower computational complexity compared to one-dimensional (1D) methods while having better performance in comparison with conventional methods such as Gaussian random measurement matrix.

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.

RSAT matrix-clustering: dynamic exploration and redundancy reduction of transcription factor binding motif collections.

PubMed

Castro-Mondragon, Jaime Abraham; Jaeger, Sébastien; Thieffry, Denis; Thomas-Chollier, Morgane; van Helden, Jacques

2017-07-27

Transcription factor (TF) databases contain multitudes of binding motifs (TFBMs) from various sources, from which non-redundant collections are derived by manual curation. The advent of high-throughput methods stimulated the production of novel collections with increasing numbers of motifs. Meta-databases, built by merging these collections, contain redundant versions, because available tools are not suited to automatically identify and explore biologically relevant clusters among thousands of motifs. Motif discovery from genome-scale data sets (e.g. ChIP-seq) also produces redundant motifs, hampering the interpretation of results. We present matrix-clustering, a versatile tool that clusters similar TFBMs into multiple trees, and automatically creates non-redundant TFBM collections. A feature unique to matrix-clustering is its dynamic visualisation of aligned TFBMs, and its capability to simultaneously treat multiple collections from various sources. We demonstrate that matrix-clustering considerably simplifies the interpretation of combined results from multiple motif discovery tools, and highlights biologically relevant variations of similar motifs. We also ran a large-scale application to cluster ∼11 000 motifs from 24 entire databases, showing that matrix-clustering correctly groups motifs belonging to the same TF families, and drastically reduced motif redundancy. matrix-clustering is integrated within the RSAT suite (http://rsat.eu/), accessible through a user-friendly web interface or command-line for its integration in pipelines. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

Double and Multiple Star Measurements at the Southern Sky with a 50cm-Cassegrain and a Fast CCD Camera in 2008

NASA Astrophysics Data System (ADS)

Anton, Rainer

2011-04-01

Using a 50cm Cassegrain in Namibia, recordings of double and multiple stars were made with a fast CCD camera and a notebook computer. From superpositions of "lucky images", measurements of 149 systems were obtained and compared with literature data. B/W and color images of some remarkable systems are also presented.

Double and Multiple Star Measurements in the Northern Sky with a 10" Newtonian and a Fast CCD Camera in 2006 through 2009

NASA Astrophysics Data System (ADS)

Anton, Rainer

2010-07-01

Using a 10" Newtonian and a fast CCD camera, recordings of double and multiple stars were made at high frame rates with a notebook computer. From superpositions of "lucky images", measurements of 139 systems were obtained and compared with literature data. B/w and color images of some noteworthy systems are also presented.

Structural profiling of individual glycosphingolipids in a single thin-layer chromatogram by multiple sequential immunodetection matched with Direct IR-MALDI-o-TOF mass spectrometry.

PubMed

Souady, Jamal; Soltwisch, Jens; Dreisewerd, Klaus; Haier, Jörg; Peter-Katalinić, Jasna; Müthing, Johannes

2009-11-15

The thin-layer chromatography (TLC) immunoenzyme overlay assay is a widely used tool for antibody-mediated identification of glycosphingolipids (GSLs) in mixtures. However, because the majority of GSLs is left unexamined in a chromatogram of a single assay, we developed a novel method that permits detection of various GSLs by sequential multiple immunostaining combined with individual coloring of GSLs in the same chromatogram. Specific staining was achieved by means of primary anti-GSL antibodies, directed against lactosylceramide, globotriaosylceramide, and globotetraosylceramide, in conjunction with alkaline phosphatase (AP)- or horseradish peroxidase (HRP)-conjugated secondary antibodies together with the appropriate chromogenic substrates. Triple coloring with 5-bromo-4-chloro-3-indolyl phosphate (BCIP)-AP, Fast Red-AP, and 3,3'-diaminobenzidine (DAB)-HRP resulted in blue, red, and black precipitates, respectively, following three sequential immunostaining rounds. Structures of antibody-detected GSLs were determined by direct coupling of TLC with infrared matrix-assisted laser desorption/ionization orthogonal time-of-flight mass spectrometry. This combinatorial technique was used to demonstrate structural GSL profiling of crude lipid extracts from human hepatocellular cancer. This powerful technology allows efficient structural characterization of GSLs in small tissue samples and marks a further step forward in the emerging field of glycosphingolipidomics.

Cholesky-decomposed density MP2 with density fitting: Accurate MP2 and double-hybrid DFT energies for large systems

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

Maurer, Simon A.; Clin, Lucien; Ochsenfeld, Christian, E-mail: christian.ochsenfeld@uni-muenchen.de

2014-06-14

Our recently developed QQR-type integral screening is introduced in our Cholesky-decomposed pseudo-densities Møller-Plesset perturbation theory of second order (CDD-MP2) method. We use the resolution-of-the-identity (RI) approximation in combination with efficient integral transformations employing sparse matrix multiplications. The RI-CDD-MP2 method shows an asymptotic cubic scaling behavior with system size and a small prefactor that results in an early crossover to conventional methods for both small and large basis sets. We also explore the use of local fitting approximations which allow to further reduce the scaling behavior for very large systems. The reliability of our method is demonstrated on test sets formore » interaction and reaction energies of medium sized systems and on a diverse selection from our own benchmark set for total energies of larger systems. Timings on DNA systems show that fast calculations for systems with more than 500 atoms are feasible using a single processor core. Parallelization extends the range of accessible system sizes on one computing node with multiple cores to more than 1000 atoms in a double-zeta basis and more than 500 atoms in a triple-zeta basis.« less

Technology optimization techniques for multicomponent optical band-pass filter manufacturing

NASA Astrophysics Data System (ADS)

Baranov, Yuri P.; Gryaznov, Georgiy M.; Rodionov, Andrey Y.; Obrezkov, Andrey V.; Medvedev, Roman V.; Chivanov, Alexey N.

2016-04-01

Narrowband optical devices (like IR-sensing devices, celestial navigation systems, solar-blind UV-systems and many others) are one of the most fast-growing areas in optical manufacturing. However, signal strength in this type of applications is quite low and performance of devices depends on attenuation level of wavelengths out of operating range. Modern detectors (photodiodes, matrix detectors, photomultiplier tubes and others) usually do not have required selectivity or have higher sensitivity to background spectrum at worst. Manufacturing of a single component band-pass filter with high attenuation level of wavelength is resource-intensive task. Sometimes it's not possible to find solution for this problem using existing technologies. Different types of filters have technology variations of transmittance profile shape due to various production factors. At the same time there are multiple tasks with strict requirements for background spectrum attenuation in narrowband optical devices. For example, in solar-blind UV-system wavelengths above 290-300 nm must be attenuated by 180dB. In this paper techniques of multi-component optical band-pass filters assembly from multiple single elements with technology variations of transmittance profile shape for optimal signal-tonoise ratio (SNR) were proposed. Relationships between signal-to-noise ratio and different characteristics of transmittance profile shape were shown. Obtained practical results were in rather good agreement with our calculations.

An HTS-compatible 3D colony formation assay to identify tumor-specific chemotherapeutics.

PubMed

Horman, Shane R; To, Jeremy; Orth, Anthony P

2013-12-01

There has been increasing interest in the development of cellular behavior models that take advantage of three-dimensional (3D) cell culture. To enable assessment of differential perturbagen impacts on cell growth in 2D and 3D, we have miniaturized and adapted for high-throughput screening (HTS) the soft agar colony formation assay, employing a laser-scanning cytometer to image and quantify multiple cell types simultaneously. The assay is HTS compatible, providing high-quality, image-based, replicable data for multiple, co-cultured cell types. As proof of concept, we subjected colorectal carcinoma colonies in 3D soft agar to a mini screen of 1528 natural product compounds. Hit compounds from the primary screen were rescreened in an HTS 3D co-culture matrix containing colon stromal cells and cancer cells. By combining tumor cells and normal, nontransformed colon epithelial cells in one primary screening assay, we were able to obtain differential IC50 data, thereby distinguishing tumor-specific compounds from general cytotoxic compounds. Moreover, we were able to identify compounds that antagonized tumor colony formation in 3D only, highlighting the importance of this assay in identifying agents that interfere with 3D tumor structural growth. This screening platform provides a fast, simple, and robust method for identification of tumor-specific agents in a biologically relevant microenvironment.

Electromagnetic energy coupling mechanism with matrix architecture control

NASA Technical Reports Server (NTRS)

Hughes, Eli (Inventor); Knowles, Gareth (Inventor)

2006-01-01

The present invention relates generally to reconfigurable, solid-state matrix arrays comprising multiple rows and columns of reconfigurable secondary mechanisms that are independently tuned. Specifically, the invention relates to reconfigurable devices comprising multiple, solid-state mechanisms characterized by at least one voltage-varied parameter disposed within a flexible, multi-laminate film, which are suitable for use as magnetic conductors, ground surfaces, antennas, varactors, ferrotunable substrates, or other active or passive electronic mechanisms.

Study of optoelectronic switch for satellite-switched time-division multiple access

NASA Technical Reports Server (NTRS)

Su, Shing-Fong; Jou, Liz; Lenart, Joe

1987-01-01

The use of optoelectronic switching for satellite switched time division multiple access will improve the isolation and reduce the crosstalk of an IF switch matrix. The results are presented of a study on optoelectronic switching. Tasks include literature search, system requirements study, candidate switching architecture analysis, and switch model optimization. The results show that the power divided and crossbar switching architectures are good candidates for an IF switch matrix.

A matrix contraction process

NASA Astrophysics Data System (ADS)

Wilkinson, Michael; Grant, John

2018-03-01

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

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.

Multiple cracking of unidirectional and cross-ply ceramic matrix composites

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

Kuo, W.S.; Chou, T.W.

1995-03-01

This paper examines the multiple cracking behavior of unidirectional and cross-ply ceramic matrix composites. For unidirectional composites, a model of concentric cylinders with finite crack spacing and debonding length is introduced. Stresses in the fiber and matrix are found and then applied to predict the composite moduli. Using an energy balance method, critical stresses for matrix cracking initiation are predicted. Effects of interfacial shear stress, debonding length and bonding energy on the critical stress are studied. All the three composite systems examined show that the critical stress for the completely debonded case is lower than that for the perfectly bondedmore » case. For crossply composites, an extensive study has been made for the transverse cracking in 90{degree} plies and the matrix cracking in 0{degree} plies. One transverse cracking and four matrix cracking modes are studied, and closed-form solutions of the critical stresses are obtained. The results indicate that the case of combined matrix and transverse crackings with associated fiber/matrix interfacial sliding in the 0{degree} plies gives the lowest critical stress for matrix cracking. The theoretical predictions are compared with experimental data of SiC/CAS cross-ply composites; both results demonstrated that an increase in the transverse ply thickness reduces the critical stress for matrix cracking in the longitudinal plies. The effects of fiber volume fraction and fiber modulus on the critical stress have been quantified. Thermal residual stresses are included in the analysis.« less

Novel entries in a fungal biofilm matrix encyclopedia.

PubMed

Zarnowski, Robert; Westler, William M; Lacmbouh, Ghislain Ade; Marita, Jane M; Bothe, Jameson R; Bernhardt, Jörg; Lounes-Hadj Sahraoui, Anissa; Fontaine, Joël; Sanchez, Hiram; Hatfield, Ronald D; Ntambi, James M; Nett, Jeniel E; Mitchell, Aaron P; Andes, David R

2014-08-05

Virulence of Candida is linked with its ability to form biofilms. Once established, biofilm infections are nearly impossible to eradicate. Biofilm cells live immersed in a self-produced matrix, a blend of extracellular biopolymers, many of which are uncharacterized. In this study, we provide a comprehensive analysis of the matrix manufactured by Candida albicans both in vitro and in a clinical niche animal model. We further explore the function of matrix components, including the impact on drug resistance. We uncovered components from each of the macromolecular classes (55% protein, 25% carbohydrate, 15% lipid, and 5% nucleic acid) in the C. albicans biofilm matrix. Three individual polysaccharides were identified and were suggested to interact physically. Surprisingly, a previously identified polysaccharide of functional importance, β-1,3-glucan, comprised only a small portion of the total matrix carbohydrate. Newly described, more abundant polysaccharides included α-1,2 branched α-1,6-mannans (87%) associated with unbranched β-1,6-glucans (13%) in an apparent mannan-glucan complex (MGCx). Functional matrix proteomic analysis revealed 458 distinct activities. The matrix lipids consisted of neutral glycerolipids (89.1%), polar glycerolipids (10.4%), and sphingolipids (0.5%). Examination of matrix nucleic acid identified DNA, primarily noncoding sequences. Several of the in vitro matrix components, including proteins and each of the polysaccharides, were also present in the matrix of a clinically relevant in vivo biofilm. Nuclear magnetic resonance (NMR) analysis demonstrated interaction of aggregate matrix with the antifungal fluconazole, consistent with a role in drug impedance and contribution of multiple matrix components. Importance: This report is the first to decipher the complex and unique macromolecular composition of the Candida biofilm matrix, demonstrate the clinical relevance of matrix components, and show that multiple matrix components are needed for protection from antifungal drugs. The availability of these biochemical analyses provides a unique resource for further functional investigation of the biofilm matrix, a defining trait of this lifestyle. Copyright © 2014 Zarnowski et al.

Improving recovery of ECG signal with deterministic guarantees using split signal for multiple supports of matching pursuit (SS-MSMP) algorithm.

PubMed

Tawfic, Israa Shaker; Kayhan, Sema Koc

2017-02-01

Compressed sensing (CS) is a new field used for signal acquisition and design of sensor that made a large drooping in the cost of acquiring sparse signals. In this paper, new algorithms are developed to improve the performance of the greedy algorithms. In this paper, a new greedy pursuit algorithm, SS-MSMP (Split Signal for Multiple Support of Matching Pursuit), is introduced and theoretical analyses are given. The SS-MSMP is suggested for sparse data acquisition, in order to reconstruct analog and efficient signals via a small set of general measurements. This paper proposes a new fast method which depends on a study of the behavior of the support indices through picking the best estimation of the corrosion between residual and measurement matrix. The term multiple supports originates from an algorithm; in each iteration, the best support indices are picked based on maximum quality created by discovering correlation for a particular length of support. We depend on this new algorithm upon our previous derivative of halting condition that we produce for Least Support Orthogonal Matching Pursuit (LS-OMP) for clear and noisy signal. For better reconstructed results, SS-MSMP algorithm provides the recovery of support set for long signals such as signals used in WBAN. Numerical experiments demonstrate that the new suggested algorithm performs well compared to existing algorithms in terms of many factors used for reconstruction performance. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

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.

Methods for absorbing neutrons

DOEpatents

Guillen, Donna P [Idaho Falls, ID; Longhurst, Glen R [Idaho Falls, ID; Porter, Douglas L [Idaho Falls, ID; Parry, James R [Idaho Falls, ID

2012-07-24

A conduction cooled neutron absorber may include a metal matrix composite that comprises a metal having a thermal neutron cross-section of at least about 50 barns and a metal having a thermal conductivity of at least about 1 W/cmK. Apparatus for providing a neutron flux having a high fast-to-thermal neutron ratio may include a source of neutrons that produces fast neutrons and thermal neutrons. A neutron absorber positioned adjacent the neutron source absorbs at least some of the thermal neutrons so that a region adjacent the neutron absorber has a fast-to-thermal neutron ratio of at least about 15. A coolant in thermal contact with the neutron absorber removes heat from the neutron absorber.

40 CFR 51.357 - Test procedures and standards.

Code of Federal Regulations, 2014 CFR

2014-07-01

... invalid test condition, unsafe conditions, fast pass/fail algorithms, or, in the case of the on-board... using approved fast pass or fast fail algorithms and multiple pass/fail algorithms may be used during the test cycle to eliminate false failures. The transient test procedure, including algorithms and...

40 CFR 51.357 - Test procedures and standards.

Code of Federal Regulations, 2012 CFR

2012-07-01

... invalid test condition, unsafe conditions, fast pass/fail algorithms, or, in the case of the on-board... using approved fast pass or fast fail algorithms and multiple pass/fail algorithms may be used during the test cycle to eliminate false failures. The transient test procedure, including algorithms and...

40 CFR 51.357 - Test procedures and standards.

Code of Federal Regulations, 2011 CFR

2011-07-01

... invalid test condition, unsafe conditions, fast pass/fail algorithms, or, in the case of the on-board... using approved fast pass or fast fail algorithms and multiple pass/fail algorithms may be used during the test cycle to eliminate false failures. The transient test procedure, including algorithms and...

40 CFR 51.357 - Test procedures and standards.

Code of Federal Regulations, 2013 CFR

2013-07-01

... invalid test condition, unsafe conditions, fast pass/fail algorithms, or, in the case of the on-board... using approved fast pass or fast fail algorithms and multiple pass/fail algorithms may be used during the test cycle to eliminate false failures. The transient test procedure, including algorithms and...

Exploring Hill Ciphers with Graphing Calculators.

ERIC Educational Resources Information Center

St. John, Dennis

1998-01-01

Explains how to code and decode messages using Hill ciphers which combine matrix multiplication and modular arithmetic. Discusses how a graphing calculator can facilitate the matrix and modular arithmetic used in the coding and decoding procedures. (ASK)

Non-linear wave-particle interactions and fast ion loss induced by multiple Alfvén eigenmodes in the DIII-D tokamak

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

Chen, Xi; Kramer, Gerrit J.; Heidbrink, William W.

2014-05-21

A new non-linear feature has been observed in fast-ion loss from tokamak plasmas in the form of oscillations at the sum, difference and second harmonic frequencies of two independent Alfvén eigenmodes (AEs). Full orbit calculations and analytic theory indicate this non-linearity is due to coupling of fast-ion orbital response as it passes through each AE — a change in wave-particle phase k • r by one mode alters the force exerted by the next. Furthermore, the loss measurement is of barely confined, non-resonant particles, while similar non-linear interactions can occur between well-confined particles and multiple AEs leading to enhanced fast-ionmore » transport.« less

On Max-Plus Algebra and Its Application on Image Steganography

PubMed Central

Santoso, Kiswara Agung

2018-01-01

We propose a new steganography method to hide an image into another image using matrix multiplication operations on max-plus algebra. This is especially interesting because the matrix used in encoding or information disguises generally has an inverse, whereas matrix multiplication operations in max-plus algebra do not have an inverse. The advantages of this method are the size of the image that can be hidden into the cover image, larger than the previous method. The proposed method has been tested on many secret images, and the results are satisfactory which have a high level of strength and a high level of security and can be used in various operating systems. PMID:29887761

On Max-Plus Algebra and Its Application on Image Steganography.

PubMed

Santoso, Kiswara Agung; Fatmawati; Suprajitno, Herry

2018-01-01

We propose a new steganography method to hide an image into another image using matrix multiplication operations on max-plus algebra. This is especially interesting because the matrix used in encoding or information disguises generally has an inverse, whereas matrix multiplication operations in max-plus algebra do not have an inverse. The advantages of this method are the size of the image that can be hidden into the cover image, larger than the previous method. The proposed method has been tested on many secret images, and the results are satisfactory which have a high level of strength and a high level of security and can be used in various operating systems.

Characterization of various analytes using matrix-assisted laser desorption/ionization time-of-flight mass spectrometry and 2-[(2E)-3-(4-tert-butylphenyl)-2-methylprop-2-enylidene]malononitrile matrix.

PubMed

Wyatt, Mark F; Stein, Bridget K; Brenton, A Gareth

2006-01-01

2-[(2E)-3-(4-tert-Butylphenyl)-2-methylprop-2-enylidene]malononitrile (DCTB) is a nonpolar, aprotic matrix and was used in the analysis of a variety of compounds by matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOFMS). The classes of compounds include coordination compounds, organometallics, conjugated organic compounds (including porphyrins and phthalocyanines), carbohydrates, calixarenes, and macrocycles. For some samples, comparisons are made with spectra acquired with the use of 1,8,9-trihydroxyanthracene (dithranol), 2,5-dihydroxybenzoic acid, and 2,4,6-trihydroxyacetophenone matrixes. Traditionally, the majority of these compounds would have been analyzed by fast-atom bombardment (FAB), liquid secondary ion mass spectrometry (LSIMS), or electrospray techniques, but this work shows that MALDI-TOFMS using DCTB has advantages over these techniques, particularly FAB and LSIMS. Certain limitations of DCTB are noted, for example, in the analysis of water-soluble compounds such as peptides, proteins, and oligonucleotides, and good working practices for the use of the matrix are also outlined.

Effect of multiple plasmon excitation on single, double and multiple ionizations of C60 in collisions with fast highly charged Si ions

NASA Astrophysics Data System (ADS)

Kelkar, A. H.; Kadhane, U.; Misra, D.; Kumar, A.; Tribedi, L. C.

2007-06-01

We have investigated the single and multiple ionizations of the C60 molecule in collisions with fast Siq+ projectiles for various projectile charge states (q) between q = 6 and 14. The q-dependence of the ionization cross sections and their ratios is compared with the giant dipole plasmon resonance (GDPR) model. The excellent qualitative agreement with the model in case of single and double ionizations and also a reasonable agreement with the triple (and to some extent with quadruple) ionization (without evaporation) yields signify dominant contributions of the single-, double- and triple-plasmon excitations on the single- and multiple-ionization process.

Effects of prolonged fasting on fatigue and quality of life in patients with multiple sclerosis.

PubMed

Etemadifar, Masoud; Sayahi, Farnaz; Alroughani, Raed; Toghianifar, Nafiseh; Akbari, Mojtaba; Nasr, Zahra

2016-06-01

Fasting is one of the recommended worships of several great religions in the world. During the month of Ramadan, circadian rhythm and pattern of eating changes result in physiological, biochemical and hormonal changes in the body. Many Muslims with medical conditions ask their physicians about the feasibility and safety of fasting during Ramadan. In this study, we aim to assess the effect of Ramadan fasting on the quality of life and fatigue in multiple sclerosis (MS) patients. Relapsing-remitting MS (RRMS) patients according to McDonald's criteria who had mild disability (EDSS score ≤3) were included in this study. Fatigue and quality of life were were assessed using the validated Persian versions of modified fatigue impact scale (MFIS) and multiple sclerosis quality of life-54 (MSQOL-54) questionnaires, respectively. 218 patients (150 females and 68 males) were enrolled in our study. There was no statistically significant difference between the mean total score of MSIF before and after fasting (25.50 ± 13.81 versus 26.94 ± 16.65; p = 0.58). The mean physical health and mental health composites of quality of life increased significantly after fasting (p = 0.008 and p = 0.003 respectively). Despite the observed lack of favorable effects on fatigue, our results showed increased quality of life of MS patients once Ramadan has ended. Whether this is specifically related to Ramadan-related fasting deserves further testing in appropriately designed larger prospective clinical studies.

Islamic fasting and multiple sclerosis

PubMed Central

2014-01-01

Background Month-long daytime Ramadan fasting pose s major challenges to multiple sclerosis (MS) patients in Muslim countries. Physicians should have practical knowledge on the implications of fasting on MS. We present a summary of database searches (Cochrane Database of Systematic Reviews, PubMed) and a mini-symposium on Ramadan fasting and MS. In this symposium, we aimed to review the effect of fasting on MS and suggest practical guidelines on management. Discussion In general, fasting is possible for most stable patients. Appropriate amendment of drug regimens, careful monitoring of symptoms, as well as providing patients with available evidence on fasting and MS are important parts of management. Evidence from experimental studies suggests that calorie restriction before disease induction reduces inflammation and subsequent demyelination and attenuates disease severity. Fasting does not appear to have unfavorable effects on disease course in patients with mild disability (Expanded Disability Status Scale (EDSS) score ≤3). Most experts believed that during fasting (especially in summer), some MS symptoms (fatigue, fatigue perception, dizziness, spasticity, cognitive problems, weakness, vision, balance, gait) might worsen but return to normal levels during feasting. There was a general consensus that fasting is not safe for patients: on high doses of anti-convulsants, anti-spastics, and corticosteroids; with coagulopathy or active disease; during attacks; with EDSS score ≥7. Summary These data suggest that MS patients should have tailored care. Fasting in MS patients is a challenge that is directly associated with the spiritual belief of the patient. PMID:24655543

Islamic fasting and multiple sclerosis.

PubMed

Jahromi, Soodeh Razeghi; Sahraian, Mohammad Ali; Ashtari, Fereshteh; Ayromlou, Hormoz; Etemadifar, Massoud; Ghaffarpour, Majid; Mohammadianinejad, Ehsan; Nafissi, Shahriar; Nickseresht, Alireza; Shaygannejad, Vahid; Togha, Mansoreh; Torabi, Hamid Reza; Ziaie, Shadi

2014-03-22

Month-long daytime Ramadan fasting pose s major challenges to multiple sclerosis (MS) patients in Muslim countries. Physicians should have practical knowledge on the implications of fasting on MS. We present a summary of database searches (Cochrane Database of Systematic Reviews, PubMed) and a mini-symposium on Ramadan fasting and MS. In this symposium, we aimed to review the effect of fasting on MS and suggest practical guidelines on management. In general, fasting is possible for most stable patients. Appropriate amendment of drug regimens, careful monitoring of symptoms, as well as providing patients with available evidence on fasting and MS are important parts of management. Evidence from experimental studies suggests that calorie restriction before disease induction reduces inflammation and subsequent demyelination and attenuates disease severity. Fasting does not appear to have unfavorable effects on disease course in patients with mild disability (Expanded Disability Status Scale (EDSS) score ≤3). Most experts believed that during fasting (especially in summer), some MS symptoms (fatigue, fatigue perception, dizziness, spasticity, cognitive problems, weakness, vision, balance, gait) might worsen but return to normal levels during feasting. There was a general consensus that fasting is not safe for patients: on high doses of anti-convulsants, anti-spastics, and corticosteroids; with coagulopathy or active disease; during attacks; with EDSS score ≥7. These data suggest that MS patients should have tailored care. Fasting in MS patients is a challenge that is directly associated with the spiritual belief of the patient.

A Romantic Excursion Into the Multiplication Table

ERIC Educational Resources Information Center

Callahan, Leroy C.

1969-01-01

Uses the geoboard as an aid in developing an intuitive "feel for the relationship between sums of numbers in a two by two matrix. Numbers in the matrix are represented as "area numbers on the geoboard. (RP)

Coronally advanced flap with and without a xenogenic collagen matrix in the treatment of multiple recessions: a randomized controlled clinical study.

PubMed

Cardaropoli, Daniele; Tamagnone, Lorenzo; Roffredo, Alessandro; Gaveglio, Lorena

2014-01-01

Multiple adjacent recession defects were treated in 32 patients using a coronally advanced flap (CAF) with or without a collagen matrix (CM). The percentage of root coverage was 81.49% ± 23.45% (58% complete root coverage) for CAF sites (control) and 93.25% ± 10.01% root coverage (72% complete root coverage) for CM plus CAF sites (test). The results achieved in the test group were significantly greater than in the control group, indicating that CM plus CAF is a suitable option for the treatment of multiple adjacent gingival recessions.

Analysis of the Hessian for Inverse Scattering Problems. Part 3. Inverse Medium Scattering of Electromagnetic Waves in Three Dimensions

DTIC Science & Technology

2012-08-01

small data noise and model error, the discrete Hessian can be approximated by a low-rank matrix. This in turn enables fast solution of an appropriately...implication of the compactness of the Hessian is that for small data noise and model error, the discrete Hessian can be approximated by a low-rank matrix. This...probability distribution is given by the inverse of the Hessian of the negative log likelihood function. For Gaussian data noise and model error, this

Self-Powered High-Resolution and Pressure-Sensitive Triboelectric Sensor Matrix for Real-Time Tactile Mapping.

PubMed

Wang, Xiandi; Zhang, Hanlu; Dong, Lin; Han, Xun; Du, Weiming; Zhai, Junyi; Pan, Caofeng; Wang, Zhong Lin

2016-04-20

A triboelectric sensor matrix (TESM) can accurately track and map 2D tactile sensing. A self-powered, high-resolution, pressure-sensitive, flexible and durable TESM with 16 × 16 pixels is fabricated for the fast detection of single-point and multi-point touching. Using cross-locating technology, a cross-type TESM with 32 × 20 pixels is developed for more rapid tactile mapping, which significantly reduces the addressing lines from m × n to m + n. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Analysis of cocaine/crack biomarkers in meconium by LC-MS.

PubMed

D'Avila, Felipe Bianchini; Ferreira, Pâmela C Lukasewicz; Salazar, Fernanda Rodrigues; Pereira, Andrea Garcia; Santos, Maíra Kerpel Dos; Pechansky, Flavio; Limberger, Renata Pereira; Fröehlich, Pedro Eduardo

2016-02-15

Fetal exposure to illicit drugs is a worldwide problem, since many addicted women do not stop using it during pregnancy. Cocaine consumed in powdered (snorted or injected) or smoked (crack cocaine) form are harmful for the baby and its side effects are not completely known. Meconium, the first stool of a newborn, is a precious matrix usually discarded, that may contain amounts of substances consumed in the last two trimesters of pregnancy. Analyzing this biological matrix it is possible to detect the unaltered molecule of cocaine (COC) or its metabolite benzoylecgonine (BZE) and pyrolytic products anhydroecgonine methyl ester (AEME) and anhydroecgonine (AEC). A liquid chromatography mass spectrometry (LC-MS) method was validated for meconium samples after solvent extraction, followed by direct injection of 10μL. Linearity covered a concentration range of 15 to 500ng/mg with a lower limit of quantification (LLOQ) of 15ng/mg for all analytes. Matrix effect was evaluated and showed adequate results. Detection of illicit substances usage can be crucial for the baby, since knowing that can help provide medical care as fast as possible. The method proved to be simple and fast, and was applied to 17 real meconium samples. Copyright © 2016 Elsevier B.V. All rights reserved.

Fast and Simple Analytical Method for Direct Determination of Total Chlorine Content in Polyglycerol by ICP-MS.

PubMed

Jakóbik-Kolon, Agata; Milewski, Andrzej; Dydo, Piotr; Witczak, Magdalena; Bok-Badura, Joanna

2018-02-23

The fast and simple method for total chlorine determination in polyglycerols using low resolution inductively coupled plasma mass spectrometry (ICP-MS) without the need for additional equipment and time-consuming sample decomposition was evaluated. Linear calibration curve for 35 Cl isotope in the concentration range 20-800 µg/L was observed. Limits of detection and quantification equaled to 15 µg/L and 44 µg/L, respectively. This corresponds to possibility of detection 3 µg/g and determination 9 µg/g of chlorine in polyglycerol using studied conditions (0.5% matrix-polyglycerol samples diluted or dissolved with water to an overall concentration of 0.5%). Matrix effects as well as the effect of chlorine origin have been evaluated. The presence of 0.5% (m/m) of matrix species similar to polyglycerol (polyethylene glycol-PEG) did not influence the chlorine determination for PEGs with average molecular weights (MW) up to 2000 Da. Good precision and accuracy of the chlorine content determination was achieved regardless on its origin (inorganic/organic). High analyte recovery level and low relative standard deviation values were observed for real polyglycerol samples spiked with chloride. Additionally, the Combustion Ion Chromatography System was used as a reference method. The results confirmed high accuracy and precision of the tested method.

SubVis: an interactive R package for exploring the effects of multiple substitution matrices on pairwise sequence alignment

PubMed Central

Coan, Heather B.; Youker, Robert T.

2017-01-01

Understanding how proteins mutate is critical to solving a host of biological problems. Mutations occur when an amino acid is substituted for another in a protein sequence. The set of likelihoods for amino acid substitutions is stored in a matrix and input to alignment algorithms. The quality of the resulting alignment is used to assess the similarity of two or more sequences and can vary according to assumptions modeled by the substitution matrix. Substitution strategies with minor parameter variations are often grouped together in families. For example, the BLOSUM and PAM matrix families are commonly used because they provide a standard, predefined way of modeling substitutions. However, researchers often do not know if a given matrix family or any individual matrix within a family is the most suitable. Furthermore, predefined matrix families may inaccurately reflect a particular hypothesis that a researcher wishes to model or otherwise result in unsatisfactory alignments. In these cases, the ability to compare the effects of one or more custom matrices may be needed. This laborious process is often performed manually because the ability to simultaneously load multiple matrices and then compare their effects on alignments is not readily available in current software tools. This paper presents SubVis, an interactive R package for loading and applying multiple substitution matrices to pairwise alignments. Users can simultaneously explore alignments resulting from multiple predefined and custom substitution matrices. SubVis utilizes several of the alignment functions found in R, a common language among protein scientists. Functions are tied together with the Shiny platform which allows the modification of input parameters. Information regarding alignment quality and individual amino acid substitutions is displayed with the JavaScript language which provides interactive visualizations for revealing both high-level and low-level alignment information. PMID:28674656

The Molecular Basis of Memory

PubMed Central

2012-01-01

We propose a tripartite biochemical mechanism for memory. Three physiologic components are involved, namely, the neuron (individual and circuit), the surrounding neural extracellular matrix, and the various trace metals distributed within the matrix. The binding of a metal cation affects a corresponding nanostructure (shrinking, twisting, expansion) and dielectric sensibility of the chelating node (address) within the matrix lattice, sensed by the neuron. The neural extracellular matrix serves as an electro-elastic lattice, wherein neurons manipulate multiple trace metals (n > 10) to encode, store, and decode coginive information. The proposed mechanism explains brains low energy requirements and high rates of storage capacity described in multiples of Avogadro number (NA = 6 × 1023). Supportive evidence correlates memory loss to trace metal toxicity or deficiency, or breakdown in the delivery/transport of metals to the matrix, or its degradation. Inherited diseases revolving around dysfunctional trace metal metabolism and memory dysfunction, include Alzheimer's disease (Al, Zn, Fe), Wilson’s disease (Cu), thalassemia (Fe), and autism (metallothionein). The tripartite mechanism points to the electro-elastic interactions of neurons with trace metals distributed within the neural extracellular matrix, as the molecular underpinning of “synaptic plasticity” affecting short-term memory, long-term memory, and forgetting. PMID:23050060

Constraining anomalous Higgs boson couplings to the heavy-flavor fermions using matrix element techniques

NASA Astrophysics Data System (ADS)

Gritsan, Andrei V.; Röntsch, Raoul; Schulze, Markus; Xiao, Meng

2016-09-01

In this paper, we investigate anomalous interactions of the Higgs boson with heavy fermions, employing shapes of kinematic distributions. We study the processes p p →t t ¯+H , b b ¯+H , t q +H , and p p →H →τ+τ- and present applications of event generation, reweighting techniques for fast simulation of anomalous couplings, as well as matrix element techniques for optimal sensitivity. We extend the matrix element likelihood approach (MELA) technique, which proved to be a powerful matrix element tool for Higgs boson discovery and characterization during Run I of the LHC, and implement all analysis tools in the JHU generator framework. A next-to-leading-order QCD description of the p p →t t ¯+H process allows us to investigate the performance of the MELA in the presence of extra radiation. Finally, projections for LHC measurements through the end of Run III are presented.

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.

Effect of Mechanical and Thermal Loading Histories on Residual Properties of SiCf/SiC Ceramic Matrix Composites

NASA Technical Reports Server (NTRS)

Almansour, Amjad; Kiser, Doug; Smith, Craig; Bhatt, Ram; Gorican, Dan; Phillips, Ron; McCue, Terry R.

2017-01-01

Silicon Carbide based Ceramic Matrix Composites (CMCs) are attractive materials for use in high-temperature structural applications in the aerospace and nuclear industries. Under high stresses and temperatures, creep degradation is the dominant damage mechanism in CMCs. Consequently, chemical vapor infiltration (CVI) SiCf/SiC ceramic matrix composites (CMC) incorporating SylramicTM-iBN SiC fibers coated with boron nitride (BN) interphase and CVI-SiC matrix were tested to examine creep behavior in air at a range of elevated temperatures of (2200 - 2700 F). Samples that survived creep tests were evaluated via RT fast fracture tensile tests to determine residual properties, with the use of acoustic emission (AE) to assess stress dependent damage initiation and progression. Microscopy of regions within the gage section of the tested specimens was performed. Observed material degradation mechanisms are discussed.

Development and characterization of a snapshot Mueller matrix polarimeter for the determination of cervical cancer risk in the low resource setting

NASA Astrophysics Data System (ADS)

Ramella-Roman, Jessica C.; Gonzalez, Mariacarla; Chue-Sang, Joseph; Montejo, Karla; Krup, Karl; Srinivas, Vijaya; DeHoog, Edward; Madhivanan, Purnima

2018-04-01

Mueller Matrix polarimetry can provide useful information about the function and structure of the extracellular matrix. Mueller Matrix systems are sophisticated and costly optical tools that have been used primarily in the laboratory or in hospital settings. Here we introduce a low-cost snapshot Mueller Matrix polarimeter that that does not require external power, has no moving parts, and can acquire a full Mueller Matrix in less than 50 milliseconds. We utilized this technology in the study of cervical cancer in Mysore India, yet the system could be translated in multiple diagnostic applications.

Evaluation and application of a fast module in a PLC based interlock and control system

NASA Astrophysics Data System (ADS)

Zaera-Sanz, M.

2009-08-01

The LHC Beam Interlock system requires a controller performing a simple matrix function to collect the different beam dump requests. To satisfy the expected safety level of the Interlock, the system should be robust and reliable. The PLC is a promising candidate to fulfil both aspects but too slow to meet the expected response time which is of the order of μseconds. Siemens has introduced a ``so called'' fast module (FM352-5 Boolean Processor). It provides independent and extremely fast control of a process within a larger control system using an onboard processor, a Field Programmable Gate Array (FPGA), to execute code in parallel which results in extremely fast scan times. It is interesting to investigate its features and to evaluate it as a possible candidate for the beam interlock system. This paper publishes the results of this study. As well, this paper could be useful for other applications requiring fast processing using a PLC.

Fasting insulin levels and metabolic risk factors in type 2 diabetic patients at the first visit in Japan: a 10-year, nationwide, observational study (JDDM 28).

PubMed

Matsuba, Ikuro; Saito, Kazumi; Takai, Masahiko; Hirao, Koichi; Sone, Hirohito

2012-09-01

To investigate the relationship between fasting insulin levels and metabolic risk factors (MRFs) in type 2 diabetic patients at the first clinic/hospital visit in Japan over the years 2000 to 2009. In total, 4,798 drug-naive Japanese patients with type 2 diabetes were registered on their first clinic/hospital visits. Conventional clinical factors and fasting insulin levels were observed at baseline within the Japan Diabetes Clinical Data Management (JDDM) study between consecutive 2-year groups. Multiple linear regression analysis was performed using a model in which the dependent variable was fasting insulin values using various clinical explanatory variables. Fasting insulin levels were found to be decreasing from 2000 to 2009. Multiple linear regression analysis with the fasting insulin levels as the dependent variable showed that waist circumference (WC), BMI, mean blood pressure, triglycerides, and HDL cholesterol were significant, with WC and BMI as the main factors. ANCOVA after adjustment for age and fasting plasma glucose clearly shows the decreasing trend in fasting insulin levels and the increasing trend in BMI. During the 10-year observation period, the decreasing trend in fasting insulin was related to the slight increase in WC/BMI in type 2 diabetes. Low pancreatic β-cell reserve on top of a lifestyle background might be dependent on an increase in MRFs.

Fasting Insulin Levels and Metabolic Risk Factors in Type 2 Diabetic Patients at the First Visit in Japan

PubMed Central

Matsuba, Ikuro; Saito, Kazumi; Takai, Masahiko; Hirao, Koichi; Sone, Hirohito

2012-01-01

OBJECTIVE To investigate the relationship between fasting insulin levels and metabolic risk factors (MRFs) in type 2 diabetic patients at the first clinic/hospital visit in Japan over the years 2000 to 2009. RESEARCH DESIGN AND METHODS In total, 4,798 drug-naive Japanese patients with type 2 diabetes were registered on their first clinic/hospital visits. Conventional clinical factors and fasting insulin levels were observed at baseline within the Japan Diabetes Clinical Data Management (JDDM) study between consecutive 2-year groups. Multiple linear regression analysis was performed using a model in which the dependent variable was fasting insulin values using various clinical explanatory variables. RESULTS Fasting insulin levels were found to be decreasing from 2000 to 2009. Multiple linear regression analysis with the fasting insulin levels as the dependent variable showed that waist circumference (WC), BMI, mean blood pressure, triglycerides, and HDL cholesterol were significant, with WC and BMI as the main factors. ANCOVA after adjustment for age and fasting plasma glucose clearly shows the decreasing trend in fasting insulin levels and the increasing trend in BMI. CONCLUSIONS During the 10-year observation period, the decreasing trend in fasting insulin was related to the slight increase in WC/BMI in type 2 diabetes. Low pancreatic β-cell reserve on top of a lifestyle background might be dependent on an increase in MRFs. PMID:22665215

Evolutionary profiles derived from the QR factorization of multiple structural alignments gives an economy of information.

PubMed

O'Donoghue, Patrick; Luthey-Schulten, Zaida

2005-02-25

We present a new algorithm, based on the multidimensional QR factorization, to remove redundancy from a multiple structural alignment by choosing representative protein structures that best preserve the phylogenetic tree topology of the homologous group. The classical QR factorization with pivoting, developed as a fast numerical solution to eigenvalue and linear least-squares problems of the form Ax=b, was designed to re-order the columns of A by increasing linear dependence. Removing the most linear dependent columns from A leads to the formation of a minimal basis set which well spans the phase space of the problem at hand. By recasting the problem of redundancy in multiple structural alignments into this framework, in which the matrix A now describes the multiple alignment, we adapted the QR factorization to produce a minimal basis set of protein structures which best spans the evolutionary (phase) space. The non-redundant and representative profiles obtained from this procedure, termed evolutionary profiles, are shown in initial results to outperform well-tested profiles in homology detection searches over a large sequence database. A measure of structural similarity between homologous proteins, Q(H), is presented. By properly accounting for the effect and presence of gaps, a phylogenetic tree computed using this metric is shown to be congruent with the maximum-likelihood sequence-based phylogeny. The results indicate that evolutionary information is indeed recoverable from the comparative analysis of protein structure alone. Applications of the QR ordering and this structural similarity metric to analyze the evolution of structure among key, universally distributed proteins involved in translation, and to the selection of representatives from an ensemble of NMR structures are also discussed.

Proceedings of the ECOM Hybrid Microcircuit Symposium, 1976

DTIC Science & Technology

1976-06-01

remove both stationary and moving clutter. The hex fast line receiver micrýocircuit is a thin film chip-and-wire microcircuit (shown in Figure 7) which...of the following: (a) multiple usage, (b) high volume production, or (c) moderate volume and multiple usage. These criteria are not hard and fast ...compounding when the circuit complexity increases. O particular concern are open or intermittent bonds, susceptibility to moisture and impurities in the

Rapid, High-Throughput Tracking of Bacterial Motility in 3D via Phase-Contrast Holographic Video Microscopy

PubMed Central

Cheong, Fook Chiong; Wong, Chui Ching; Gao, YunFeng; Nai, Mui Hoon; Cui, Yidan; Park, Sungsu; Kenney, Linda J.; Lim, Chwee Teck

2015-01-01

Tracking fast-swimming bacteria in three dimensions can be extremely challenging with current optical techniques and a microscopic approach that can rapidly acquire volumetric information is required. Here, we introduce phase-contrast holographic video microscopy as a solution for the simultaneous tracking of multiple fast moving cells in three dimensions. This technique uses interference patterns formed between the scattered and the incident field to infer the three-dimensional (3D) position and size of bacteria. Using this optical approach, motility dynamics of multiple bacteria in three dimensions, such as speed and turn angles, can be obtained within minutes. We demonstrated the feasibility of this method by effectively tracking multiple bacteria species, including Escherichia coli, Agrobacterium tumefaciens, and Pseudomonas aeruginosa. In addition, we combined our fast 3D imaging technique with a microfluidic device to present an example of a drug/chemical assay to study effects on bacterial motility. PMID:25762336

Fast implementation of length-adaptive privacy amplification in quantum key distribution

NASA Astrophysics Data System (ADS)

Zhang, Chun-Mei; Li, Mo; Huang, Jing-Zheng; Patcharapong, Treeviriyanupab; Li, Hong-Wei; Li, Fang-Yi; Wang, Chuan; Yin, Zhen-Qiang; Chen, Wei; Keattisak, Sripimanwat; Han, Zhen-Fu

2014-09-01

Post-processing is indispensable in quantum key distribution (QKD), which is aimed at sharing secret keys between two distant parties. It mainly consists of key reconciliation and privacy amplification, which is used for sharing the same keys and for distilling unconditional secret keys. In this paper, we focus on speeding up the privacy amplification process by choosing a simple multiplicative universal class of hash functions. By constructing an optimal multiplication algorithm based on four basic multiplication algorithms, we give a fast software implementation of length-adaptive privacy amplification. “Length-adaptive” indicates that the implementation of privacy amplification automatically adapts to different lengths of input blocks. When the lengths of the input blocks are 1 Mbit and 10 Mbit, the speed of privacy amplification can be as fast as 14.86 Mbps and 10.88 Mbps, respectively. Thus, it is practical for GHz or even higher repetition frequency QKD systems.

Fast dictionary generation and searching for magnetic resonance fingerprinting.

PubMed

Jun Xie; Mengye Lyu; Jian Zhang; Hui, Edward S; Wu, Ed X; Ze Wang

2017-07-01

A super-fast dictionary generation and searching (DGS) algorithm was developed for MR parameter quantification using magnetic resonance fingerprinting (MRF). MRF is a new technique for simultaneously quantifying multiple MR parameters using one temporally resolved MR scan. But it has a multiplicative computation complexity, resulting in a big burden of dictionary generating, saving, and retrieving, which can easily be intractable for any state-of-art computers. Based on retrospective analysis of the dictionary matching object function, a multi-scale ZOOM like DGS algorithm, dubbed as MRF-ZOOM, was proposed. MRF ZOOM is quasi-parameter-separable so the multiplicative computation complexity is broken into additive one. Evaluations showed that MRF ZOOM was hundreds or thousands of times faster than the original MRF parameter quantification method even without counting the dictionary generation time in. Using real data, it yielded nearly the same results as produced by the original method. MRF ZOOM provides a super-fast solution for MR parameter quantification.

Asthma Inhalers: Which One's Right for You?

MedlinePlus

... medication in these inhalers by breathing in a deep, fast breath. There are multiple-dose devices, which ... and convenient to carry. Doesn't require a deep, fast, inhaled breath. Doesn't require a deep, ...

Full-mouth esthetic rehabilitation with acellular dermal matrix.

PubMed

Clozza, Emanuele; Suzuki, Takanori; Engebretson, Steven P

2014-01-01

Treatment of multiple recession defects with the adjunct use of a connective tissue graft (CTG) represents a challenge when diagnosed in several teeth of the mouth. The amount of CTG harvested from the palate may not be adequate to address this condition. In such scenarios, alternative sources such as acellular dermal matrix (ADM) are preferred due to the unlimited availability. A case report is presented, dealing with the treatment of multiple gingival recessions affecting the majority of dentition using ADM, with a 6-month follow-up.

A fast identification algorithm for Box-Cox transformation based radial basis function neural network.

PubMed

Hong, Xia

2006-07-01

In this letter, a Box-Cox transformation-based radial basis function (RBF) neural network is introduced using the RBF neural network to represent the transformed system output. Initially a fixed and moderate sized RBF model base is derived based on a rank revealing orthogonal matrix triangularization (QR decomposition). Then a new fast identification algorithm is introduced using Gauss-Newton algorithm to derive the required Box-Cox transformation, based on a maximum likelihood estimator. The main contribution of this letter is to explore the special structure of the proposed RBF neural network for computational efficiency by utilizing the inverse of matrix block decomposition lemma. Finally, the Box-Cox transformation-based RBF neural network, with good generalization and sparsity, is identified based on the derived optimal Box-Cox transformation and a D-optimality-based orthogonal forward regression algorithm. The proposed algorithm and its efficacy are demonstrated with an illustrative example in comparison with support vector machine regression.

Enrichment of peptides in serum by C(8)-functionalized magnetic nanoparticles for direct matrix-assisted laser desorption/ionization time-of-flight mass spectrometry analysis.

PubMed

Yao, Ning; Chen, Hemei; Lin, Huaqing; Deng, Chunhui; Zhang, Xiangmin

2008-03-21

Human serum contains a complex array of proteolytically derived peptides (serum peptidome), which contain biomarkers of preclinical screening and disease diagnosis. Recently, commercial C(8)-functionalized magnetic beads (1-10 microm) were widely applied to the separation and enrichment of peptides in human serum, prior to matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF-MS) analysis. In this work, laboratory-prepared C(8)-functionalized magnetic nanoparticles (about 50 nm) were prepared and applied to the fast separation and the enrichment of peptides from serum. At first, the C(8)-magnetic nanoparticles were synthesized by modifying amine-functionalized magnetic nanoparticles with chlorodimethyloctylsilane. These synthesized C(8)-amine-functionalized magnetic particles have excellent magnetic responsibility, high dispersibility and large surface area. Finally, the C(8)-magnetic nanoparticles were successfully applied to fast and efficient enrichment of low-abundance peptides from protein tryptic digestion and human serum followed by MALDI-TOF-MS analysis.

A flexible new method for 3D measurement based on multi-view image sequences

NASA Astrophysics Data System (ADS)

Cui, Haihua; Zhao, Zhimin; Cheng, Xiaosheng; Guo, Changye; Jia, Huayu

2016-11-01

Three-dimensional measurement is the base part for reverse engineering. The paper developed a new flexible and fast optical measurement method based on multi-view geometry theory. At first, feature points are detected and matched with improved SIFT algorithm. The Hellinger Kernel is used to estimate the histogram distance instead of traditional Euclidean distance, which is immunity to the weak texture image; then a new filter three-principle for filtering the calculation of essential matrix is designed, the essential matrix is calculated using the improved a Contrario Ransac filter method. One view point cloud is constructed accurately with two view images; after this, the overlapped features are used to eliminate the accumulated errors caused by added view images, which improved the camera's position precision. At last, the method is verified with the application of dental restoration CAD/CAM, experiment results show that the proposed method is fast, accurate and flexible for tooth 3D measurement.

Fast matrix treatment of 3-D radiative transfer in vegetation canopies: SPARTACUS-Vegetation 1.1

NASA Astrophysics Data System (ADS)

Hogan, Robin J.; Quaife, Tristan; Braghiere, Renato

2018-01-01

A fast scheme is described to compute the 3-D interaction of solar radiation with vegetation canopies. The canopy is split in the horizontal plane into one clear region and one or more vegetated regions, and the two-stream equations are used for each, but with additional terms representing lateral exchange of radiation between regions that are proportional to the area of the interface between them. The resulting coupled set of ordinary differential equations is solved using the matrix-exponential method. The scheme is compared to solar Monte Carlo calculations for idealized scenes from the RAMI4PILPS intercomparison project, for open forest canopies and shrublands both with and without snow on the ground. Agreement is good in both the visible and infrared: for the cases compared, the root-mean-squared difference in reflectance, transmittance and canopy absorptance is 0.020, 0.038 and 0.033, respectively. The technique has potential application to weather and climate modelling.

Neuronal matrix metalloproteinase-9 is a determinant of selective neurodegeneration.

PubMed

Kaplan, Artem; Spiller, Krista J; Towne, Christopher; Kanning, Kevin C; Choe, Ginn T; Geber, Adam; Akay, Turgay; Aebischer, Patrick; Henderson, Christopher E

2014-01-22

Selective neuronal loss is the hallmark of neurodegenerative diseases. In patients with amyotrophic lateral sclerosis (ALS), most motor neurons die but those innervating extraocular, pelvic sphincter, and slow limb muscles exhibit selective resistance. We identified 18 genes that show >10-fold differential expression between resistant and vulnerable motor neurons. One of these, matrix metalloproteinase-9 (MMP-9), is expressed only by fast motor neurons, which are selectively vulnerable. In ALS model mice expressing mutant superoxide dismutase (SOD1), reduction of MMP-9 function using gene ablation, viral gene therapy, or pharmacological inhibition significantly delayed muscle denervation. In the presence of mutant SOD1, MMP-9 expressed by fast motor neurons themselves enhances activation of ER stress and is sufficient to trigger axonal die-back. These findings define MMP-9 as a candidate therapeutic target for ALS. The molecular basis of neuronal diversity thus provides significant insights into mechanisms of selective vulnerability to neurodegeneration. Copyright © 2014 Elsevier Inc. All rights reserved.

Fast modal extraction in NASTRAN via the FEER computer program. [based on automatic matrix reduction method for lower modes of structures with many degrees of freedom

NASA Technical Reports Server (NTRS)

Newman, M. B.; Pipano, A.

1973-01-01

A new eigensolution routine, FEER (Fast Eigensolution Extraction Routine), used in conjunction with NASTRAN at Israel Aircraft Industries is described. The FEER program is based on an automatic matrix reduction scheme whereby the lower modes of structures with many degrees of freedom can be accurately extracted from a tridiagonal eigenvalue problem whose size is of the same order of magnitude as the number of required modes. The process is effected without arbitrary lumping of masses at selected node points or selection of nodes to be retained in the analysis set. The results of computational efficiency studies are presented, showing major arithmetic operation counts and actual computer run times of FEER as compared to other methods of eigenvalue extraction, including those available in the NASTRAN READ module. It is concluded that the tridiagonal reduction method used in FEER would serve as a valuable addition to NASTRAN for highly increased efficiency in obtaining structural vibration modes.

Field assisted sintering of refractory carbide ceramics and fiber reinforced ceramic matrix composites

NASA Astrophysics Data System (ADS)

Gephart, Sean

The sintering behaviors of silicon carbide (SiC) and boron carbide (B4C) based materials were investigated using an emerging sintering technology known as field assisted sintering technology (FAST), also known as spark plasma sintering (SPS) and pulse electric current sintering (PECS). Sintering by FAST utilizes high density electric current, uniaxial pressure, and relatively high heating rate compared to conventional sintering techniques. This effort investigated issues of scaling from laboratory FAST system (25 ton capacity) to industrial FAST system (250 ton capacity), as well as exploring the difference in sintering behavior of single phase B4C and SiC using FAST and conventional sintering techniques including hot-pressing (HP) and pressure-less sintering (PL). Materials were analyzed for mechanical and bulk properties, including characterization of density, hardness, fracture toughness, fracture (bend) strength, elastic modulus and microstructure. A parallel investigation was conducted in the development of ceramic matrix composites (CMC) using SiC powder impregnation of fiber compacts followed by FAST sintering. The FAST technique was used to sinter several B4C and SiC materials to near theoretical density. Preliminary efforts established optimized sintering temperatures using the smaller 25 ton laboratory unit, targeting a sample size of 40 mm diameter and 8 mm thickness. Then the same B4C and SiC materials were sintered by the larger 250 ton industrial FAST system, a HP system, and PL sintering system with a targeted dense material geometry of 4 x 4 x 0.315 inches3 (101.6 x 101.6 x 8 mm3). The resulting samples were studied to determine if the sintering dynamics and/or the resulting material properties were influenced by the sintering technique employed. This study determined that FAST sintered ceramic materials resulted in consistently higher averaged values for mechanical properties as well as smaller grain size when compared to conventionally sintered materials. While FAST sintered materials showed higher average values, in general they also showed consistently larger variation in the scattered data and consequently larger standard deviation for the resulting material properties. In addition, dynamic impact testing (V50 test) was conducted on the resulting materials and it was determined that there was no discernable correlation between observed mechanical properties of the ceramic materials and the resulting dynamic testing. Another study was conducted on the sintering of SiC and carbon fiber reinforced SiC ceramic matrix composites (CMC) using FAST. There has been much interest recently in fabricating high strength, low porosity SiC CMC.s for high temperature structural applications, but the current methods of production, namely chemical vapor infiltration (CVI), melt infiltration (MI), and polymer infiltration and pyrolysis (PIP), are considered time consuming and involve material related shortcomings associated with their respective methodologies. In this study, SiC CMC.s were produced using the 25 ton laboratory unit with a target sample size of 40 mm diameter and 3 mm thickness, as well as on the larger 250 ton industrial FAST system targeting a sample size of 101.6 x 101.6 x 3 mm3 to investigate issues associated with scaling. Several sintering conditions were explored including: pressure of 35-65 MPa, temperature of 1700-1900°C, and heating rates between 50-400°C/min. The SiC fibers used in this study were coated using chemical vapor deposition (CVD) with boron nitride (BN) and pyrolytic carbon to act as a barrier layer and preserve the integrity of the fibers during sintering. Then the barrier coating was coated by an outer layer of SiC to enhance the bonding between the fibers and the SiC matrix. Microstructures of the sintered samples were examined by FE-SEM. Mechanical properties including flexural strength-deflection and stress-strain were characterized using 4-point bend testing. Tensile testing was performed on the larger 101.6 x 101.6 x 3 mm samples. The microstructures of samples sintered using the 25 ton laboratory FAST system showed a reduction in porosity and good adhesion between the fiber-fiber and fiber-matrix interface. The microstructures of samples sintered on the 250 ton industrial FAST system showed a reduction in porosity, but there was visible reaction of the fiber and fiber coatings with the surrounding matrix. Additionally, there was significant radial cracking of the fibers visible in the microstructures. There is gap in the understanding of sintering behavior between laboratory and industrial scale FAST systems. The vast majority of publications on FAST sintering have been primarily focused on small sample geometries (20 mm diameter, less than 3 mm thick). A study was coordinated to investigate the thermal properties during heating and cooling using a 250 ton industrial FAST system at 900°C using B4C and SiC materials inside the graphite die assembly. The thermal properties were then compared to the resulting material properties of the identically sintered B4C and SiC to approximately 94% relative density, at a temperature of 1950°C, pressure of 45 MPa, 10 minute hold, and heated at a rate of 100°C/min. The study determined that at 900°C there were significant thermal gradients within the system for the examined materials, and that these gradients correlated well with the material property difference of the samples sintered at higher temperatures where the gradients are presumably larger due to an increase in radiative heat loss. The observed temperatures throughout the graphite were significantly different between B4C and SiC. These temperatures also correlated well with the material properties of the sintered products which showed more substantial variation for B4C when compared to SiC which was overall less affected by thermal gradients. This was attributed to the intrinsic thermal conductivity difference between the two subject materials which was manifested as thermal gradients throughout the material and graphite die assembly. Additionally, both the observed temperature gradients throughout the graphite die assembly and the difference in temperature reading between the optical pyrometer and thermocouples were significantly larger for the 250 ton FAST system than previous publications have demonstrated experimentally or via modeling of smaller laboratory scale systems. The findings from this work showed that relative to conventional sintering methods, the FAST process demonstrated comparable or improved material and mechanical properties with a significantly shorter processing cycle. However, the results demonstrated on the 25 ton laboratory scale unit were significantly different compared to results for the same materials sintered using the 250 ton industrial scale unit. The temperature gradients observed on the 250 ton FAST unit were significantly larger than previous reports on smaller FAST units. This result showed future efforts to scale up the FAST sintering process while maintaining similar results will require careful attention to minimizing temperature gradients. This could potentially be achieved by reducing radiative heat loss during processing and/or optimizing the graphite die design and implementing heat spreaders in specific locations dependent on the host material.s thermal and electrical properties as well as the sample geometry.

Communication Optimal Parallel Multiplication of Sparse Random Matrices

DTIC Science & Technology

2013-02-21

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

A covariant multiple scattering series for elastic projectile-target scattering

NASA Technical Reports Server (NTRS)

Gross, Franz; Maung-Maung, Khin

1989-01-01

A covariant formulation of the multiple scattering series for the optical potential is presented. The case of a scalar nucleon interacting with a spin zero isospin zero A-body target through meson exchange, is considered. It is shown that a covariant equation for the projectile-target t-matrix can be obtained which sums the ladder and crossed ladder diagrams efficiently. From this equation, a multiple scattering series for the optical potential is derived, and it is shown that in the impulse approximation, the two-body t-matrix associated with the first order optical potential is the one in which one particle is kept on mass-shell. The meaning of various terms in the multiple scattering series is given. The construction of the first-order optical potential for elastic scattering calculations is described.

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.

Coordination of ScO+ and YO+ by multiple Ar, Kr, and Xe atoms in noble gas matrixes: a matrix isolation infrared spectroscopic and theoretical study.

PubMed

Zhao, Yanying; Gong, Yu; Chen, Mohua; Ding, Chuanfan; Zhou, Mingfei

2005-12-29

The combination of matrix isolation infrared spectroscopic and quantum chemical calculation results provide strong evidence that scandium and yttrium monoxide cations, ScO+ and YO+, coordinate multiple noble gas atoms in forming noble gas complexes. The results showed that ScO+ coordinates five Ar, Kr, or Xe atoms, and YO+ coordinates six Ar or Kr and five Xe atoms in solid noble gas matrixes. Hence, the ScO+ and YO+ cations trapped in solid noble gas matrixes should be regarded as the [ScO(Ng)5]+ (Ng = Ar, Kr, or Xe), [YO(Ng)6]+ (Ng = Ar or Kr) or [YO(Xe)5]+ complexes. Experiments with dilute krypton or xenon in argon or krypton in xenon produced new IR bands, which are due to the stepwise formation of the [ScO(Ar)(5-n)(Kr)n]+, [ScO(Kr)(5-n)(Xe)n]+ (n = 1-5), [YO(Ar)(6-n)(Kr)n]+ (n = 1-6), and [YO(Ar)(6-n)(Xe)n]+ (n = 1-4) complexes.

Using Dynamic Multi-Task Non-Negative Matrix Factorization to Detect the Evolution of User Preferences in Collaborative Filtering

PubMed Central

Ju, Bin; Qian, Yuntao; Ye, Minchao; Ni, Rong; Zhu, Chenxi

2015-01-01

Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about temporal item selection data. In this paper, we developed a unified model that combines Multi-task Non-negative Matrix Factorization and Linear Dynamical Systems to capture the evolution of user preferences. Specifically, user and item features are projected into latent factor space by factoring co-occurrence matrices into a common basis item-factor matrix and multiple factor-user matrices. Moreover, we represented both within and between relationships of multiple factor-user matrices using a state transition matrix to capture the changes in user preferences over time. The experiments show that our proposed algorithm outperforms the other algorithms on two real datasets, which were extracted from Netflix movies and Last.fm music. Furthermore, our model provides a novel dynamic topic model for tracking the evolution of the behavior of a user over time. PMID:26270539

Using Dynamic Multi-Task Non-Negative Matrix Factorization to Detect the Evolution of User Preferences in Collaborative Filtering.

PubMed

Ju, Bin; Qian, Yuntao; Ye, Minchao; Ni, Rong; Zhu, Chenxi

2015-01-01

Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about temporal item selection data. In this paper, we developed a unified model that combines Multi-task Non-negative Matrix Factorization and Linear Dynamical Systems to capture the evolution of user preferences. Specifically, user and item features are projected into latent factor space by factoring co-occurrence matrices into a common basis item-factor matrix and multiple factor-user matrices. Moreover, we represented both within and between relationships of multiple factor-user matrices using a state transition matrix to capture the changes in user preferences over time. The experiments show that our proposed algorithm outperforms the other algorithms on two real datasets, which were extracted from Netflix movies and Last.fm music. Furthermore, our model provides a novel dynamic topic model for tracking the evolution of the behavior of a user over time.

Matched field localization based on CS-MUSIC algorithm

NASA Astrophysics Data System (ADS)

Guo, Shuangle; Tang, Ruichun; Peng, Linhui; Ji, Xiaopeng

2016-04-01

The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered. A matched field localization algorithm based on CS-MUSIC (Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning. The signal matrix is calculated through the SVD (Singular Value Decomposition) of the observation matrix. The observation matrix in the sparse mathematical model is replaced by the signal matrix, and a new concise sparse mathematical model is obtained, which means not only the scale of the localization problem but also the noise level is reduced; then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS (Compressive Sensing) method and MUSIC (Multiple Signal Classification) method. The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots, and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large, which will be proved in this paper.

An algorithm for solving an arbitrary triangular fully fuzzy Sylvester matrix equations

NASA Astrophysics Data System (ADS)

Daud, Wan Suhana Wan; Ahmad, Nazihah; Malkawi, Ghassan

2017-11-01

Sylvester matrix equations played a prominent role in various areas including control theory. Considering to any un-certainty problems that can be occurred at any time, the Sylvester matrix equation has to be adapted to the fuzzy environment. Therefore, in this study, an algorithm for solving an arbitrary triangular fully fuzzy Sylvester matrix equation is constructed. The construction of the algorithm is based on the max-min arithmetic multiplication operation. Besides that, an associated arbitrary matrix equation is modified in obtaining the final solution. Finally, some numerical examples are presented to illustrate the proposed algorithm.

FPGA-based coprocessor for matrix algorithms implementation

NASA Astrophysics Data System (ADS)

Amira, Abbes; Bensaali, Faycal

2003-03-01

Matrix algorithms are important in many types of applications including image and signal processing. These areas require enormous computing power. A close examination of the algorithms used in these, and related, applications reveals that many of the fundamental actions involve matrix operations such as matrix multiplication which is of O (N3) on a sequential computer and O (N3/p) on a parallel system with p processors complexity. This paper presents an investigation into the design and implementation of different matrix algorithms such as matrix operations, matrix transforms and matrix decompositions using an FPGA based environment. Solutions for the problem of processing large matrices have been proposed. The proposed system architectures are scalable, modular and require less area and time complexity with reduced latency when compared with existing structures.

Multi-GPU implementation of a VMAT treatment plan optimization algorithm.

PubMed

Tian, Zhen; Peng, Fei; Folkerts, Michael; Tan, Jun; Jia, Xun; Jiang, Steve B

2015-06-01

Volumetric modulated arc therapy (VMAT) optimization is a computationally challenging problem due to its large data size, high degrees of freedom, and many hardware constraints. High-performance graphics processing units (GPUs) have been used to speed up the computations. However, GPU's relatively small memory size cannot handle cases with a large dose-deposition coefficient (DDC) matrix in cases of, e.g., those with a large target size, multiple targets, multiple arcs, and/or small beamlet size. The main purpose of this paper is to report an implementation of a column-generation-based VMAT algorithm, previously developed in the authors' group, on a multi-GPU platform to solve the memory limitation problem. While the column-generation-based VMAT algorithm has been previously developed, the GPU implementation details have not been reported. Hence, another purpose is to present detailed techniques employed for GPU implementation. The authors also would like to utilize this particular problem as an example problem to study the feasibility of using a multi-GPU platform to solve large-scale problems in medical physics. The column-generation approach generates VMAT apertures sequentially by solving a pricing problem (PP) and a master problem (MP) iteratively. In the authors' method, the sparse DDC matrix is first stored on a CPU in coordinate list format (COO). On the GPU side, this matrix is split into four submatrices according to beam angles, which are stored on four GPUs in compressed sparse row format. Computation of beamlet price, the first step in PP, is accomplished using multi-GPUs. A fast inter-GPU data transfer scheme is accomplished using peer-to-peer access. The remaining steps of PP and MP problems are implemented on CPU or a single GPU due to their modest problem scale and computational loads. Barzilai and Borwein algorithm with a subspace step scheme is adopted here to solve the MP problem. A head and neck (H&N) cancer case is then used to validate the authors' method. The authors also compare their multi-GPU implementation with three different single GPU implementation strategies, i.e., truncating DDC matrix (S1), repeatedly transferring DDC matrix between CPU and GPU (S2), and porting computations involving DDC matrix to CPU (S3), in terms of both plan quality and computational efficiency. Two more H&N patient cases and three prostate cases are used to demonstrate the advantages of the authors' method. The authors' multi-GPU implementation can finish the optimization process within ∼ 1 min for the H&N patient case. S1 leads to an inferior plan quality although its total time was 10 s shorter than the multi-GPU implementation due to the reduced matrix size. S2 and S3 yield the same plan quality as the multi-GPU implementation but take ∼4 and ∼6 min, respectively. High computational efficiency was consistently achieved for the other five patient cases tested, with VMAT plans of clinically acceptable quality obtained within 23-46 s. Conversely, to obtain clinically comparable or acceptable plans for all six of these VMAT cases that the authors have tested in this paper, the optimization time needed in a commercial TPS system on CPU was found to be in an order of several minutes. The results demonstrate that the multi-GPU implementation of the authors' column-generation-based VMAT optimization can handle the large-scale VMAT optimization problem efficiently without sacrificing plan quality. The authors' study may serve as an example to shed some light on other large-scale medical physics problems that require multi-GPU techniques.

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

Fast algorithm for computing complex number-theoretic transforms

NASA Technical Reports Server (NTRS)

Reed, I. S.; Liu, K. Y.; Truong, T. K.

1977-01-01

A high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.

Computation of scattering matrix elements of large and complex shaped absorbing particles with multilevel fast multipole algorithm

NASA Astrophysics Data System (ADS)

Wu, Yueqian; Yang, Minglin; Sheng, Xinqing; Ren, Kuan Fang

2015-05-01

Light scattering properties of absorbing particles, such as the mineral dusts, attract a wide attention due to its importance in geophysical and environment researches. Due to the absorbing effect, light scattering properties of particles with absorption differ from those without absorption. Simple shaped absorbing particles such as spheres and spheroids have been well studied with different methods but little work on large complex shaped particles has been reported. In this paper, the surface Integral Equation (SIE) with Multilevel Fast Multipole Algorithm (MLFMA) is applied to study scattering properties of large non-spherical absorbing particles. SIEs are carefully discretized with piecewise linear basis functions on triangle patches to model whole surface of the particle, hence computation resource needs increase much more slowly with the particle size parameter than the volume discretized methods. To improve further its capability, MLFMA is well parallelized with Message Passing Interface (MPI) on distributed memory computer platform. Without loss of generality, we choose the computation of scattering matrix elements of absorbing dust particles as an example. The comparison of the scattering matrix elements computed by our method and the discrete dipole approximation method (DDA) for an ellipsoid dust particle shows that the precision of our method is very good. The scattering matrix elements of large ellipsoid dusts with different aspect ratios and size parameters are computed. To show the capability of the presented algorithm for complex shaped particles, scattering by asymmetry Chebyshev particle with size parameter larger than 600 of complex refractive index m = 1.555 + 0.004 i and different orientations are studied.

Circulating matrix modulators (MMP-9 and TIMP-1) and their association with severity of diabetic retinopathy.

PubMed

Jayashree, Kuppuswami; Yasir, Md; Senthilkumar, Gandhipuram Periyasamy; Ramesh Babu, K; Mehalingam, Vadivelan; Mohanraj, Palani Selvam

2018-05-05

Diabetic Retinopathy (DR) is the leading cause of vision loss in the working age population. Matrix metalloproteinase-9 (MMP-9) and tissue inhibitor of metalloproteinase-1 (TIMP-1), are molecules involved in extracellular tissue matrix remodelling. They are implicated in the loss of retinal tissue integrity, a major cause of DR, that leads to retinal tissue degradation and apoptosis. This study is therefore, conducted to compare the serum levels of MMP-9 and TIMP-1 in T2DM patients without and with retinopathy, and to evaluate their association with the severity of DR. Our study comprised of 2 groups of 41 each. Group A (cases) included T2DM patients with retinopathy and Group B (controls) included T2DM patients without retinopathy. Routine parameters, mainly, fasting blood glucose, and lipid profile were measured using autoanalyzer. Serum MMP-9, TIMP-1, and insulin levels were assessed using ELISA method. Statistically significant increase in the levels of MMP-9, insulin, fasting blood glucose and lipid profile were observed in the serum of T2DM patients with retinopathy, as compared with those without retinopathy. These results help to conclude that rise in MMP-9, and associated serum markers promote disease progress in DR. These findings suggest that the elevations of our study markers in the serum of the type 2 diabetic patients with retinopathy, as compared to those without retinopathy, play important roles in aggravating tissue matrix degradation, supporting DR disease progression. Copyright © 2018. Published by Elsevier Ltd.

Comprehensive Evaluation Report for the Canadian Replication of the Families and Schools Together (FAST) Program.

ERIC Educational Resources Information Center

Sass, James S.

Families and Schools Together (FAST) is a 2-year program beginning with 8 weeks of multiple family meetings and transitioning into a long-term follow-up segment called FASTWORKS. FAST uses tested family therapy principles, delinquency and substance-abuse strategies, psychiatric techniques, family systems theory, and group dynamics to give parents…

Advanced bredigite-containing magnesium-matrix composites for biodegradable bone implant applications.

PubMed

Dezfuli, Sina Naddaf; Huan, Zhiguang; Mol, Arjan; Leeflang, Sander; Chang, Jiang; Zhou, Jie

2017-10-01

The present research was aimed at developing magnesium-matrix composites that could allow effective control over their physiochemical and mechanical responses when in contact with physiological solutions. A biodegradable, bioactive ceramic - bredigite was chosen as the reinforcing phase in the composites, based on the hypothesis that the silicon- and magnesium-containing ceramic could protect magnesium from fast corrosion and at the same time stimulate cell proliferation. Methods to prepare composites with integrated microstructures - a prerequisite to achieve controlled biodegradation were developed. A systematic experimental approach was taken in order to elucidate the in vitro biodegradation mechanisms and kinetics of the composites. It was found that the composites with 20-40% homogenously dispersed bredigite particles, prepared from powders, could indeed significantly decrease the degradation rate of magnesium by up to 24 times. Slow degradation of the composites resulted in the retention of the mechanical integrity of the composites within the strength range of cortical bone after 12days of immersion in a cell culture medium. Cell attachment, cytotoxicity and bioactivity tests confirmed the stimulatory effects of bredigite embedded in the composites on the attachment, viability and differentiation of bone marrow stromal cells. Thus, the multiple benefits of adding bredigite to magnesium in enhancing degradation behavior, mechanical properties, biocompatibility and bioactivity were obtained. The results from this research showed the excellent potential of the bredigite-containing composites for bone implant applications, thus warranting further in vitro and in vivo research. Copyright © 2017 Elsevier B.V. All rights reserved.

A space-time lower-upper symmetric Gauss-Seidel scheme for the time-spectral method

NASA Astrophysics Data System (ADS)

Zhan, Lei; Xiong, Juntao; Liu, Feng

2016-05-01

The time-spectral method (TSM) offers the advantage of increased order of accuracy compared to methods using finite-difference in time for periodic unsteady flow problems. Explicit Runge-Kutta pseudo-time marching and implicit schemes have been developed to solve iteratively the space-time coupled nonlinear equations resulting from TSM. Convergence of the explicit schemes is slow because of the stringent time-step limit. Many implicit methods have been developed for TSM. Their computational efficiency is, however, still limited in practice because of delayed implicit temporal coupling, multiple iterative loops, costly matrix operations, or lack of strong diagonal dominance of the implicit operator matrix. To overcome these shortcomings, an efficient space-time lower-upper symmetric Gauss-Seidel (ST-LU-SGS) implicit scheme with multigrid acceleration is presented. In this scheme, the implicit temporal coupling term is split as one additional dimension of space in the LU-SGS sweeps. To improve numerical stability for periodic flows with high frequency, a modification to the ST-LU-SGS scheme is proposed. Numerical results show that fast convergence is achieved using large or even infinite Courant-Friedrichs-Lewy (CFL) numbers for unsteady flow problems with moderately high frequency and with the use of moderately high numbers of time intervals. The ST-LU-SGS implicit scheme is also found to work well in calculating periodic flow problems where the frequency is not known a priori and needed to be determined by using a combined Fourier analysis and gradient-based search algorithm.

Extensional ionomeric polymer conductor composite actuators with ionic liquids

NASA Astrophysics Data System (ADS)

Liu, Sheng; Lin, Minren; Zhang, Qiming

2008-03-01

Although the Ionic Polymer-Metal Composite (IPMC) actuators developed up to date are in the form of bending actuators, development of extensional actuators based on IMPC is highly desirable from practical applications and fundamental understanding points of view. This talk presents the design, fabrication and characterization of a recent work on an extensional Ionic Polymer-Metal Composite actuator. The extensional actuator consists of the Nafion ionomer as the matrix and the sub-micron size RuO II particles as the conductive filler for the conductor/ionomr composites. In this investigation, several ionic liquids (IL) were investigated. For a Nafion/RuO II composite with 1-Ethyl-3-methylimidazolium trifluoromethanesulfonate (EMI-Tf) IL, it was found that as the ions are driven into the ionomer/RuO II composite (the composite under negative voltage), an extensional strain of 0.9% was observed; while as the ions were expelled from the ionomer/RuO II composite (under positive voltage), a contraction of -1.2% was observed. The results indicate that multiple ions are participating in charge transport and actuation process. In this paper, we also discuss several design considerations for future extensional actuators with fast response, much improved strain and stress level. Especially an actuator based on multilayer configuration can significantly increase the electric field level in the actuator and consequently significantly improve the actuator speed. The extensional actuator investigated here provides a unique platform to investigate various phenomena related to ion transport and their interaction with the ionomer/conductor matrix to realize high electromechanical performance.

Pharmacokinetic profile of extended-release versus immediate-release oral naproxen sodium after single and multiple dosing under fed and fasting conditions: two randomized, open-label trials.

PubMed

Laurora, Irene; Wang, Yuan

2016-10-01

Extended-release (ER) naproxen sodium provides pain relief for up to 24 hours with a single dose (660 mg/day). Its pharmacokinetic profile after single and multiple dosing was compared to immediate release (IR) naproxen sodium in two randomized, open-label, crossover studies, under fasting and fed conditions. Eligible healthy subjects were randomized to ER naproxen sodium 660-mg tablet once daily or IR naproxen sodium 220-mg tablet twice daily (440 mg initially, followed by 220 mg 12 hours later). Primary variables: pharmacokinetic parameters after singleday administration (day 1) and at steady state after multiple-day administration (day 6). Total exposure was comparable for both treatments under fasting and fed conditions. After fasting: peak naproxen concentrations were slightly lower with ER naproxen sodium than with IR naproxen sodium but were reached at a similar time. Fed conditions: mean peak concentrations were comparable but reached after a longer time with ER vs. IR naproxen sodium. ER naproxen sodium was well tolerated, with a similar safety profile to IR naproxen sodium. The total exposure of ER naproxen sodium (660 mg) is comparable to IR naproxen sodium (220 mg) when administered at the maximum over the counter (OTC) dose of 660-mg daily dose on a single day and over multiple days. The rate of absorption is delayed under fed conditions.

Linear and nonlinear dynamic analysis of redundant load path bearingless rotor systems

NASA Technical Reports Server (NTRS)

Murthy, V. R.; Shultz, Louis A.

1994-01-01

The goal of this research is to develop the transfer matrix method to treat nonlinear autonomous boundary value problems with multiple branches. The application is the complete nonlinear aeroelastic analysis of multiple-branched rotor blades. Once the development is complete, it can be incorporated into the existing transfer matrix analyses. There are several difficulties to be overcome in reaching this objective. The conventional transfer matrix method is limited in that it is applicable only to linear branch chain-like structures, but consideration of multiple branch modeling is important for bearingless rotors. Also, hingeless and bearingless rotor blade dynamic characteristics (particularly their aeroelasticity problems) are inherently nonlinear. The nonlinear equations of motion and the multiple-branched boundary value problem are treated together using a direct transfer matrix method. First, the formulation is applied to a nonlinear single-branch blade to validate the nonlinear portion of the formulation. The nonlinear system of equations is iteratively solved using a form of Newton-Raphson iteration scheme developed for differential equations of continuous systems. The formulation is then applied to determine the nonlinear steady state trim and aeroelastic stability of a rotor blade in hover with two branches at the root. A comprehensive computer program is developed and is used to obtain numerical results for the (1) free vibration, (2) nonlinearly deformed steady state, (3) free vibration about the nonlinearly deformed steady state, and (4) aeroelastic stability tasks. The numerical results obtained by the present method agree with results from other methods.

Deep convolutional neural network based antenna selection in multiple-input multiple-output system

NASA Astrophysics Data System (ADS)

Cai, Jiaxin; Li, Yan; Hu, Ying

2018-03-01

Antenna selection of wireless communication system has attracted increasing attention due to the challenge of keeping a balance between communication performance and computational complexity in large-scale Multiple-Input MultipleOutput antenna systems. Recently, deep learning based methods have achieved promising performance for large-scale data processing and analysis in many application fields. This paper is the first attempt to introduce the deep learning technique into the field of Multiple-Input Multiple-Output antenna selection in wireless communications. First, the label of attenuation coefficients channel matrix is generated by minimizing the key performance indicator of training antenna systems. Then, a deep convolutional neural network that explicitly exploits the massive latent cues of attenuation coefficients is learned on the training antenna systems. Finally, we use the adopted deep convolutional neural network to classify the channel matrix labels of test antennas and select the optimal antenna subset. Simulation experimental results demonstrate that our method can achieve better performance than the state-of-the-art baselines for data-driven based wireless antenna selection.

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

Multiple solution of linear algebraic systems by an iterative method with recomputed preconditioner in the analysis of microstrip structures

NASA Astrophysics Data System (ADS)

Ahunov, Roman R.; Kuksenko, Sergey P.; Gazizov, Talgat R.

2016-06-01

A multiple solution of linear algebraic systems with dense matrix by iterative methods is considered. To accelerate the process, the recomputing of the preconditioning matrix is used. A priory condition of the recomputing based on change of the arithmetic mean of the current solution time during the multiple solution is proposed. To confirm the effectiveness of the proposed approach, the numerical experiments using iterative methods BiCGStab and CGS for four different sets of matrices on two examples of microstrip structures are carried out. For solution of 100 linear systems the acceleration up to 1.6 times, compared to the approach without recomputing, is obtained.

Iterative-method performance evaluation for multiple vectors associated with a large-scale sparse matrix

NASA Astrophysics Data System (ADS)

Imamura, Seigo; Ono, Kenji; Yokokawa, Mitsuo

2016-07-01

Ensemble computing, which is an instance of capacity computing, is an effective computing scenario for exascale parallel supercomputers. In ensemble computing, there are multiple linear systems associated with a common coefficient matrix. We improve the performance of iterative solvers for multiple vectors by solving them at the same time, that is, by solving for the product of the matrices. We implemented several iterative methods and compared their performance. The maximum performance on Sparc VIIIfx was 7.6 times higher than that of a naïve implementation. Finally, to deal with the different convergence processes of linear systems, we introduced a control method to eliminate the calculation of already converged vectors.

Applications of multiple-constraint matrix updates to the optimal control of large structures

NASA Technical Reports Server (NTRS)

Smith, S. W.; Walcott, B. L.

1992-01-01

Low-authority control or vibration suppression in large, flexible space structures can be formulated as a linear feedback control problem requiring computation of displacement and velocity feedback gain matrices. To ensure stability in the uncontrolled modes, these gain matrices must be symmetric and positive definite. In this paper, efficient computation of symmetric, positive-definite feedback gain matrices is accomplished through the use of multiple-constraint matrix update techniques originally developed for structural identification applications. Two systems were used to illustrate the application: a simple spring-mass system and a planar truss. From these demonstrations, use of this multiple-constraint technique is seen to provide a straightforward approach for computing the low-authority gains.

The Influence of Preferential Flow on Pressure Propagation and Landslide Triggering of the Rocca Pitigliana Landslide

NASA Astrophysics Data System (ADS)

Shao, W.; Bogaard, T.; Bakker, M.; Berti, M.; Savenije, H. H. G.

2016-12-01

The fast pore water pressure response to rain events is an important triggering factor for slope instability. The fast pressure response may be caused by preferential flow that bypasses the soil matrix. Currently, most of the hydro-mechanical models simulate pore water pressure using a single-permeability model, which cannot quantify the effects of preferential flow on pressure propagation and landslide triggering. Previous studies showed that a model based on the linear-diffusion equation can simulate the fast pressure propagation in near-saturated landslides such as the Rocca Pitigliana landslide. In such a model, the diffusion coefficient depends on the degree of saturation, which makes it difficult to use the model for predictions. In this study, the influence of preferential flow on pressure propagation and slope stability is investigated with a 1D dual-permeability model coupled with an infinite-slope stability approach. The dual-permeability model uses two modified Darcy-Richards equations to simultaneously simulate the matrix flow and preferential flow in hillslopes. The simulated pressure head is used in an infinite-slope stability analysis to identify the influence of preferential flow on the fast pressure response and landslide triggering. The dual-permeability model simulates the height and arrival of the pressure peak reasonably well. Performance of the dual-permeability model is as good as or better than the linear-diffusion model even though the dual-permeability model is calibrated for two single pulse rain events only, while the linear-diffusion model is calibrated for each rain event separately.

A Taxonomy of Latent Structure Assumptions for Probability Matrix Decomposition Models.

ERIC Educational Resources Information Center

Meulders, Michel; De Boeck, Paul; Van Mechelen, Iven

2003-01-01

Proposed a taxonomy of latent structure assumptions for probability matrix decomposition (PMD) that includes the original PMD model and a three-way extension of the multiple classification latent class model. Simulation study results show the usefulness of the taxonomy. (SLD)

Solving large mixed linear models using preconditioned conjugate gradient iteration.

PubMed

Strandén, I; Lidauer, M

1999-12-01

Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.

Lack of specificity for the analysis of raltegravir using online sample clean-up liquid chromatography-electrospray tandem mass spectrometry.

PubMed

Jourdil, Jean François; Bartoli, Mireille; Stanke-Labesque, Françoise

2009-11-01

Raltegravir is the first antiretroviral agent to target the human immunodeficiency virus-1 (HIV-1) integrase. It is indicated, in association with other antiretrovirals, in the treatment of acquired immunodeficiency syndrome (AIDS) in antiretroviral treatment-experienced adult patients with viral resistance. To evaluate the feasibility of raltegravir therapeutic drug monitoring, we developed a rapid and specific analytical method for the quantification of raltegravir in human plasma by online sample clean-up liquid chromatography-tandem mass spectrometry (LC-MS/MS). After protein precipitation (with 100 microL of acetonitrile/methanol (50/50)) of 25 microL of plasma, fast online matrix-clean-up was performed using a column switching program. The chromatographic step was optimized to separate raltegravir and its glucuronide metabolite (G-raltegravir). Multiple reaction monitoring (MRM) was used for detection of raltegravir and G-raltegravir. In the absence of G-raltegravir standard, G-raltegravir identification was confirmed by beta-glucuronidase pre-treatment. A total analysis of 3.8 min was needed to separate raltegravir to G-raltegravir. The method was linear between 10 and 3000 ng/mL for raltegravir. Analytical recovery was 94+/-1%. Variation coefficients ranged between 5% and 8.4%. Pre-treatment of plasma from a patient under raltegravir treatment with beta-glucuronidase suppressed G-raltegravir peak. We describe a fast online LC-MS/MS assay that is valid and reliable for the quantification of raltegravir, despite the lack of specificity that could occur in MRM scanning mode experiments.

An Efficient Method for Co-purification of Eggshell Matrix Proteins OC-17, OC-116, and OCX-36

PubMed Central

2016-01-01

In this study, we improved the eggshell-membrane separation process by separating the shell and membrane with EDTA solution, evaluating effects of three different extraction solutions (acetic acid, EDTA, and phosphate solution), and co-purifying multiple eggshell proteins with two successive ion-exchange chromatography procedures (CM Sepharose Fast Flow and DEAE Sepharose Fast Flow). The recovery and residual rates of eggshell and membrane separated by the modified method with added EDTA solution were 93.88%, 91.15% and 1.01%, 2.87%, respectively. Ovocleidin-116 (OC-116) and ovocalyxin-36 (OCX-36) were obtained by loading 50 mM Na-Hepes, pH 7.5, 2 mM DTT and 350 mM NaCl buffer onto the DEAE-FF column at a flow rate of 1 mL/min, ovocleidin-17 (OC-17) was obtained by loading 100 mM NaCl, 50 mM Tris, pH 8.0 on the CM-FF column at a flow rate of 0.5 mL/min. The purities of OCX-36, OC-17 and OC-116 were 96.82%, 80.15% and 73.22%, and the recovery rates were 55.27%, 53.38% and 36.34%, respectively. Antibacterial activity test suggested that phosphate solution extract exhibited significantly higher activity against the tested bacterial strains than the acetic acid or EDTA extract, probably due to more types of proteins in the extract. These results demonstrate that this separation method is feasible and efficient. PMID:28115888

Using Stochastic Approximation Techniques to Efficiently Construct Confidence Intervals for Heritability.

PubMed

Schweiger, Regev; Fisher, Eyal; Rahmani, Elior; Shenhav, Liat; Rosset, Saharon; Halperin, Eran

2018-06-22

Estimation of heritability is an important task in genetics. The use of linear mixed models (LMMs) to determine narrow-sense single-nucleotide polymorphism (SNP)-heritability and related quantities has received much recent attention, due of its ability to account for variants with small effect sizes. Typically, heritability estimation under LMMs uses the restricted maximum likelihood (REML) approach. The common way to report the uncertainty in REML estimation uses standard errors (SEs), which rely on asymptotic properties. However, these assumptions are often violated because of the bounded parameter space, statistical dependencies, and limited sample size, leading to biased estimates and inflated or deflated confidence intervals (CIs). In addition, for larger data sets (e.g., tens of thousands of individuals), the construction of SEs itself may require considerable time, as it requires expensive matrix inversions and multiplications. Here, we present FIESTA (Fast confidence IntErvals using STochastic Approximation), a method for constructing accurate CIs. FIESTA is based on parametric bootstrap sampling, and, therefore, avoids unjustified assumptions on the distribution of the heritability estimator. FIESTA uses stochastic approximation techniques, which accelerate the construction of CIs by several orders of magnitude, compared with previous approaches as well as to the analytical approximation used by SEs. FIESTA builds accurate CIs rapidly, for example, requiring only several seconds for data sets of tens of thousands of individuals, making FIESTA a very fast solution to the problem of building accurate CIs for heritability for all data set sizes.

De novo biosynthesis of glycosaminoglycans in the extracellular matrix of skin studied by matrix-assisted laser desorption/ionization mass spectrometry.

PubMed

Böhme, Julia; Anderegg, Ulf; Nimptsch, Ariane; Nimptsch, Kathrin; Hacker, Michael; Schulz-Siegmund, Michaela; Huster, Daniel; Schiller, Jürgen

2012-02-15

The self-healing capacity of skin is limited, and medical intervention is often unavoidable. Skin may be generated ex vivo from cultured fibroblasts. Because the molecular composition of de novo formed skin (mostly collagen and glycosaminoglycans [GAGs]) is crucial, analytical methods are required for the quality control of tissue-engineered products. Here, we show that matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS) of fibroblast cultures subsequent to digestion with chondroitinase ABC is a reliable and fast method to monitor the GAG content of native and bioengineered skin. Furthermore, the supplementation of the fibroblast medium with ¹³C-labeled glucose provides insights into the biosynthesis of GAGs. Copyright © 2011 Elsevier Inc. All rights reserved.

A fast efficient implicit scheme for the gasdynamic equations using a matrix reduction technique

NASA Technical Reports Server (NTRS)

Barth, T. J.; Steger, J. L.

1985-01-01

An efficient implicit finite-difference algorithm for the gasdynamic equations utilizing matrix reduction techniques is presented. A significant reduction in arithmetic operations is achieved without loss of the stability characteristics generality found in the Beam and Warming approximate factorization algorithm. Steady-state solutions to the conservative Euler equations in generalized coordinates are obtained for transonic flows and used to show that the method offers computational advantages over the conventional Beam and Warming scheme. Existing Beam and Warming codes can be retrofit with minimal effort. The theoretical extension of the matrix reduction technique to the full Navier-Stokes equations in Cartesian coordinates is presented in detail. Linear stability, using a Fourier stability analysis, is demonstrated and discussed for the one-dimensional Euler equations.

Microfabricated capillary electrophoresis chip and method for simultaneously detecting multiple redox labels

DOEpatents

Mathies, Richard A.; Singhal, Pankaj; Xie, Jin; Glazer, Alexander N.

2002-01-01

This invention relates to a microfabricated capillary electrophoresis chip for detecting multiple redox-active labels simultaneously using a matrix coding scheme and to a method of selectively labeling analytes for simultaneous electrochemical detection of multiple label-analyte conjugates after electrophoretic or chromatographic separation.

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

Multi-Mode Estimation for Small Fixed Wing Unmanned Aerial Vehicle Localization Based on a Linear Matrix Inequality Approach

PubMed Central

Elzoghby, Mostafa; Li, Fu; Arafa, Ibrahim. I.; Arif, Usman

2017-01-01

Information fusion from multiple sensors ensures the accuracy and robustness of a navigation system, especially in the absence of global positioning system (GPS) data which gets degraded in many cases. A way to deal with multi-mode estimation for a small fixed wing unmanned aerial vehicle (UAV) localization framework is proposed, which depends on utilizing a Luenberger observer-based linear matrix inequality (LMI) approach. The proposed estimation technique relies on the interaction between multiple measurement modes and a continuous observer. The state estimation is performed in a switching environment between multiple active sensors to exploit the available information as much as possible, especially in GPS-denied environments. Luenberger observer-based projection is implemented as a continuous observer to optimize the estimation performance. The observer gain might be chosen by solving a Lyapunov equation by means of a LMI algorithm. Convergence is achieved by utilizing the linear matrix inequality (LMI), based on Lyapunov stability which keeps the dynamic estimation error bounded by selecting the observer gain matrix (L). Simulation results are presented for a small UAV fixed wing localization problem. The results obtained using the proposed approach are compared with a single mode Extended Kalman Filter (EKF). Simulation results are presented to demonstrate the viability of the proposed strategy. PMID:28420214

A Fast Turn-Around Facility for Very Large Scale Integration (VLSI)

DTIC Science & Technology

1982-06-01

statistics determination, the first test mask set will use the MATRIX chip design which was recently developed here at Stanford. This chip provides...reached when the basewidth is reduced to zero. Such devices, variably known as depleted- base transistors or bipolar static-induction transitors , have been

Differentiating characteristic microstructural features of cancerous tissues using Mueller matrix microscope.

PubMed

Wang, Ye; He, Honghui; Chang, Jintao; Zeng, Nan; Liu, Shaoxiong; Li, Migao; Ma, Hui

2015-12-01

Polarized light imaging can provide rich microstructural information of samples, and has been applied to the detections of various abnormal tissues. In this paper, we report a polarized light microscope based on Mueller matrix imaging by adding the polarization state generator and analyzer (PSG and PSA) to a commercial transmission optical microscope. The maximum errors for the absolute values of Mueller matrix elements are reduced to 0.01 after calibration. This Mueller matrix microscope has been used to examine human cervical and liver cancerous tissues with fibrosis. Images of the transformed Mueller matrix parameters provide quantitative assessment on the characteristic features of the pathological tissues. Contrast mechanism of the experimental results are backed up by Monte Carlo simulations based on the sphere-cylinder birefringence model, which reveal the relationship between the pathological features in the cancerous tissues at the cellular level and the polarization parameters. Both the experimental and simulated data indicate that the microscopic transformed Mueller matrix parameters can distinguish the breaking down of birefringent normal tissues for cervical cancer, or the formation of birefringent surrounding structures accompanying the inflammatory reaction for liver cancer. With its simple structure, fast measurement and high precision, polarized light microscope based on Mueller matrix shows a good diagnosis application prospect. Copyright © 2015 Elsevier Ltd. All rights reserved.

Effects of a westernized lifestyle on the association between fasting serum nonesterified fatty acids and insulin secretion in Japanese men.

PubMed

Kamei, Nozomu; Yamane, Kiminori; Nakanishi, Shuhei; Ishida, Kazufumi; Ohtaki, Megu; Okubo, Masamichi; Kohno, Nobuoki

2005-06-01

The effects of the prolonged elevation of nonesterified fatty acid (NEFA) levels on insulin secretion have been controversial and thought to be sex-specific. To investigate the association between a westernized lifestyle and the effects of NEFA on insulin secretion in Japanese men, we examined 67 nondiabetic Japanese-American men and 220 nondiabetic native Japanese men who underwent a 75-g oral glucose tolerance test (OGTT). Most Japanese Americans we surveyed are genetically identical to Japanese living in Japan, but their lifestyle is more westernized. Sets of multiple regression analyses were performed to evaluate the relationship between the sum of the immunoreactive insulin (IRI) levels during the OGTT ((Sigma)IRI) and clinical parameters. Japanese Americans had higher levels of fasting IRI, (Sigma)IRI, and a higher insulin resistance index (homeostasis model assessment for insulin resistance [HOMA-IR]) than native Japanese, whereas there were no significant differences in fasting NEFA and triglyceride levels. A multiple regression analysis adjusted for age, fasting triglycerides, and body mass index (BMI) demonstrated that the fasting NEFA level was an independent determinant of the (Sigma)IRI only in Japanese-American men ( P = .001), but not in native Japanese men ( P = .054). Even when HOMA-IR was included in models instead of BMI, the NEFA level was a significant variable of (Sigma)IRI only in Japanese Americans ( P < .001), and not in native Japanese ( P = .098). In addition, a multiple regression analysis adjusted for age, fasting triglycerides, and BMI demonstrated that the fasting NEFA level was the only independent determinant of (Sigma)C-peptide in Japanese-American men ( P = .041). In conclusion, NEFA seems to be associated with insulin secretion independent of obesity or HOMA-IR. A westernized lifestyle may increase the effects of serum fasting NEFA levels on total insulin secretion after a glucose load in Japanese men.

Hierarchically porous carbon derived from banana peel for lithium sulfur battery with high areal and gravimetric sulfur loading

NASA Astrophysics Data System (ADS)

Li, Fanqun; Qin, Furong; Zhang, Kai; Fang, Jing; Lai, Yanqing; Li, Jie

2017-09-01

Facile and sustainable route is developed to convert biomass into hierarchically porous carbon matrix cooperating with highly conductive graphene. By tailoring the porosity of the carbon matrix to promote fast mass transfer and cooperating highly conductive interconnected graphene frameworks to accelerate the electron transport, the carbon sulfur cathodes simultaneously achieve high areal and gravimetric sulfur loading/content (6 mg cm-2/67 wt%) and deliver outstanding electrochemical performance. After 100 cyclic discharge-charge test at the current density of 0.2 C, the reversible capacity maintains at 707 mA h g-1.

Analysis and measurement of the transfer matrix of a 9-cell, 1.3-GHz superconducting cavity

DOE PAGES

Halavanau, A.; Eddy, N.; Edstrom, D.; ...

2017-04-13

Superconducting linacs are capable of producing intense, stable, high-quality electron beams that have found widespread applications in science and industry. Here, the 9-cell, 1.3-GHz superconducting standing-wave accelerating rf cavity originally developed for e +/e - linear-collider applications has been broadly employed in various superconducting-linac designs. In this paper we discuss the transfer matrix of such a cavity and present its measurement performed at the Fermilab Accelerator Science and Technology (FAST) facility. Finally, the experimental results are found to be in agreement with analytical calculations and numerical simulations.

A fast and mild decellularization protocol for obtaining extracellular matrix.

PubMed

Mirzarafie, Ariana; Grainger, Rhian K; Thomas, Ben; Bains, William; Ustok, Fatma I; Lowe, Chris R

2014-04-01

Degradation of extracellular matrix (ECM) function with age is a major cause of loss of tissue function with age that we would wish to reverse. Tissue engineering to provide replacement tissue requires an ECM-mimicking scaffold for cell organization. The standard protocols for achieving this take 10 days and include steps that may change the protein structure of the ECM. Here we describe a much shorter protocol for decellularizing chicken muscle, skin, and tendon samples that achieves the same efficiency as the original protocol without protein cross-link interference. Our protocol can be completed in 72 hr.

Chandrasekhar-type algorithms for fast recursive estimation in linear systems with constant parameters

NASA Technical Reports Server (NTRS)

Choudhury, A. K.; Djalali, M.

1975-01-01

In this recursive method proposed, the gain matrix for the Kalman filter and the convariance of the state vector are computed not via the Riccati equation, but from certain other equations. These differential equations are of Chandrasekhar-type. The 'invariant imbedding' idea resulted in the reduction of the basic boundary value problem of transport theory to an equivalent initial value system, a significant computational advance. Initial value experience showed that there is some computational savings in the method and the loss of positive definiteness of the covariance matrix is less vulnerable.

Speeding up the Consensus Clustering methodology for microarray data analysis

PubMed Central

2011-01-01

Background The inference of the number of clusters in a dataset, a fundamental problem in Statistics, Data Analysis and Classification, is usually addressed via internal validation measures. The stated problem is quite difficult, in particular for microarrays, since the inferred prediction must be sensible enough to capture the inherent biological structure in a dataset, e.g., functionally related genes. Despite the rich literature present in that area, the identification of an internal validation measure that is both fast and precise has proved to be elusive. In order to partially fill this gap, we propose a speed-up of Consensus (Consensus Clustering), a methodology whose purpose is the provision of a prediction of the number of clusters in a dataset, together with a dissimilarity matrix (the consensus matrix) that can be used by clustering algorithms. As detailed in the remainder of the paper, Consensus is a natural candidate for a speed-up. Results Since the time-precision performance of Consensus depends on two parameters, our first task is to show that a simple adjustment of the parameters is not enough to obtain a good precision-time trade-off. Our second task is to provide a fast approximation algorithm for Consensus. That is, the closely related algorithm FC (Fast Consensus) that would have the same precision as Consensus with a substantially better time performance. The performance of FC has been assessed via extensive experiments on twelve benchmark datasets that summarize key features of microarray applications, such as cancer studies, gene expression with up and down patterns, and a full spectrum of dimensionality up to over a thousand. Based on their outcome, compared with previous benchmarking results available in the literature, FC turns out to be among the fastest internal validation methods, while retaining the same outstanding precision of Consensus. Moreover, it also provides a consensus matrix that can be used as a dissimilarity matrix, guaranteeing the same performance as the corresponding matrix produced by Consensus. We have also experimented with the use of Consensus and FC in conjunction with NMF (Nonnegative Matrix Factorization), in order to identify the correct number of clusters in a dataset. Although NMF is an increasingly popular technique for biological data mining, our results are somewhat disappointing and complement quite well the state of the art about NMF, shedding further light on its merits and limitations. Conclusions In summary, FC with a parameter setting that makes it robust with respect to small and medium-sized datasets, i.e, number of items to cluster in the hundreds and number of conditions up to a thousand, seems to be the internal validation measure of choice. Moreover, the technique we have developed here can be used in other contexts, in particular for the speed-up of stability-based validation measures. PMID:21235792

Project Solo; Newsletter Number Twenty.

ERIC Educational Resources Information Center

Pittsburgh Univ., PA. Project Solo.

Three Project Solo modules are presented. They are designed to teach the concepts of elementary matrix operation, matrix multiplication, and finite-state automata. Together with the module on communication matrices from Newsletter #17 they form a well motivated but structured path to expertise in this area. (JY)

Switching Matrix For Optical Signals

NASA Technical Reports Server (NTRS)

Grove, Charles H.

1990-01-01

Proposed matrix of electronically controlled shutters switches signals in optical fibers between multiple input and output channels. Size, weight, and power consumption reduced. Device serves as building block for small, low-power, broad-band television- and data-signal-switching systems providing high isolation between nominally disconnected channels.

Multiple-layered effective medium approximation approach to modeling environmental effects on alumina passivated highly porous silicon nanostructured thin films measured by in-situ Mueller matrix ellipsometry

NASA Astrophysics Data System (ADS)

Mock, Alyssa; Carlson, Timothy; VanDerslice, Jeremy; Mohrmann, Joel; Woollam, John A.; Schubert, Eva; Schubert, Mathias

2017-11-01

Optical changes in alumina passivated highly porous silicon slanted columnar thin films during controlled exposure to toluene vapor are reported. Electron-beam evaporation glancing angle deposition and subsequent atomic layer deposition are utilized to deposit alumina passivated nanostructured porous silicon thin films. In-situ Mueller matrix generalized spectroscopic ellipsometry in an environmental cell is then used to determine changes in optical properties of the nanostructured thin films by inspection of individual Mueller matrix elements, each of which exhibit sensitivity to adsorption. The use of a multiple-layered effective medium approximation model allows for accurate description of the inhomogeneous nature of toluene adsorption onto alumina passivated highly porous silicon slanted columnar thin films.

Hardware Implementation of a MIMO Decoder Using Matrix Factorization Based Channel Estimation

NASA Astrophysics Data System (ADS)

Islam, Mohammad Tariqul; Numan, Mostafa Wasiuddin; Misran, Norbahiah; Ali, Mohd Alauddin Mohd; Singh, Mandeep

2011-05-01

This paper presents an efficient hardware realization of multiple-input multiple-output (MIMO) wireless communication decoder that utilizes the available resources by adopting the technique of parallelism. The hardware is designed and implemented on Xilinx Virtex™-4 XC4VLX60 field programmable gate arrays (FPGA) device in a modular approach which simplifies and eases hardware update, and facilitates testing of the various modules independently. The decoder involves a proficient channel estimation module that employs matrix factorization on least squares (LS) estimation to reduce a full rank matrix into a simpler form in order to eliminate matrix inversion. This results in performance improvement and complexity reduction of the MIMO system. Performance evaluation of the proposed method is validated through MATLAB simulations which indicate 2 dB improvement in terms of SNR compared to LS estimation. Moreover complexity comparison is performed in terms of mathematical operations, which shows that the proposed approach appreciably outperforms LS estimation at a lower complexity and represents a good solution for channel estimation technique.

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.

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.

Load partitioning between the bcc-iron matrix and NiAl-type precipitates in a ferritic alloy on multiple length scales

PubMed Central

Sun, Zhiqian; Song, Gian; Sisneros, Thomas A.; Clausen, Bjørn; Pu, Chao; Li, Lin; Gao, Yanfei; Liaw, Peter K.

2016-01-01

An understanding of load sharing among constituent phases aids in designing mechanical properties of multiphase materials. Here we investigate load partitioning between the body-centered-cubic iron matrix and NiAl-type precipitates in a ferritic alloy during uniaxial tensile tests at 364 and 506 °C on multiple length scales by in situ neutron diffraction and crystal plasticity finite element modeling. Our findings show that the macroscopic load-transfer efficiency is not as high as that predicted by the Eshelby model; moreover, it depends on the matrix strain-hardening behavior. We explain the grain-level anisotropic load-partitioning behavior by considering the plastic anisotropy of the matrix and elastic anisotropy of precipitates. We further demonstrate that the partitioned load on NiAl-type precipitates relaxes at 506 °C, most likely through thermally-activated dislocation rearrangement on the microscopic scale. The study contributes to further understanding of load-partitioning characteristics in multiphase materials. PMID:26979660

Load partitioning between the bcc-iron matrix and NiAl-type precipitates in a ferritic alloy on multiple length scales

DOE PAGES

Sun, Zhiqian; Song, Gian; Sisneros, Thomas A.; ...

2016-03-16

An understanding of load sharing among constituent phases aids in designing mechanical properties of multiphase materials. Here we investigate load partitioning between the body-centered-cubic iron matrix and NiAl-type precipitates in a ferritic alloy during uniaxial tensile tests at 364 and 506 C on multiple length scales by in situ neutron diffraction and crystal plasticity finite element modeling. Our findings show that the macroscopic load-transfer efficiency is not as high as that predicted by the Eshelby model; moreover, it depends on the matrix strain-hardening behavior. We explain the grain-level anisotropic load-partitioning behavior by considering the plastic anisotropy of the matrix andmore » elastic anisotropy of precipitates. We further demonstrate that the partitioned load on NiAl-type precipitates relaxes at 506 C, most likely through thermally-activated dislocation rearrangement on the microscopic scale. Furthermore, the study contributes to further understanding of load-partitioning characteristics in multiphase materials.« less

Manipulation of biological cells using a microelectromagnet matrix

NASA Astrophysics Data System (ADS)

Lee, H.; Purdon, A. M.; Westervelt, R. M.

2004-08-01

Noninvasive manipulation of biological cells inside a microfluidic channel was demonstrated using a microelectromagnet matrix. The matrix consists of two layers of straight Au wires, aligned perpendicular to each other, that are covered by insulating layers. By adjusting the current in each independent wire, the microelectromagnet matrix can create versatile magnetic field patterns to control the motion of individual cells in fluid. Single or multiple yeast cells attached to magnetic beads were trapped, continuously moved and rotated, and a viable cell was separated from nonviable cells for cell sorting.

Double Cantilever Beam Fracture Toughness Testing of Several Composite Materials

NASA Technical Reports Server (NTRS)

Kessler, Jeff A.; Adams, Donald F.

1992-01-01

Double-cantilever beam fracture toughness tests were performed by the Composite Materials Research Group on several different unidirectional composite materials provided by NASA Langley Research Center. The composite materials consisted of Hercules IM-7 carbon fiber and various matrix resin formulations. Multiple formulations of four different families of matrix resins were tested: LaRC - ITPI, LaRC - IA, RPT46T, and RP67/RP55. Report presents the materials tested and pertinent details supplied by NASA. For each material, three replicate specimens were tested. Multiple crack extensions were performed on each replicate.

Dual-scale topology optoelectronic processor.

PubMed

Marsden, G C; Krishnamoorthy, A V; Esener, S C; Lee, S H

1991-12-15

The dual-scale topology optoelectronic processor (D-STOP) is a parallel optoelectronic architecture for matrix algebraic processing. The architecture can be used for matrix-vector multiplication and two types of vector outer product. The computations are performed electronically, which allows multiplication and summation concepts in linear algebra to be generalized to various nonlinear or symbolic operations. This generalization permits the application of D-STOP to many computational problems. The architecture uses a minimum number of optical transmitters, which thereby reduces fabrication requirements while maintaining area-efficient electronics. The necessary optical interconnections are space invariant, minimizing space-bandwidth requirements.

Some issues related to the novel spectral acceleration method for the fast computation of radiation/scattering from one-dimensional extremely large scale quasi-planar structures

NASA Astrophysics Data System (ADS)

Torrungrueng, Danai; Johnson, Joel T.; Chou, Hsi-Tseng

2002-03-01

The novel spectral acceleration (NSA) algorithm has been shown to produce an $[\\mathcal{O}]$(Ntot) efficient iterative method of moments for the computation of radiation/scattering from both one-dimensional (1-D) and two-dimensional large-scale quasi-planar structures, where Ntot is the total number of unknowns to be solved. This method accelerates the matrix-vector multiplication in an iterative method of moments solution and divides contributions between points into ``strong'' (exact matrix elements) and ``weak'' (NSA algorithm) regions. The NSA method is based on a spectral representation of the electromagnetic Green's function and appropriate contour deformation, resulting in a fast multipole-like formulation in which contributions from large numbers of points to a single point are evaluated simultaneously. In the standard NSA algorithm the NSA parameters are derived on the basis of the assumption that the outermost possible saddle point, φs,max, along the real axis in the complex angular domain is small. For given height variations of quasi-planar structures, this assumption can be satisfied by adjusting the size of the strong region Ls. However, for quasi-planar structures with large height variations, the adjusted size of the strong region is typically large, resulting in significant increases in computational time for the computation of the strong-region contribution and degrading overall efficiency of the NSA algorithm. In addition, for the case of extremely large scale structures, studies based on the physical optics approximation and a flat surface assumption show that the given NSA parameters in the standard NSA algorithm may yield inaccurate results. In this paper, analytical formulas associated with the NSA parameters for an arbitrary value of φs,max are presented, resulting in more flexibility in selecting Ls to compromise between the computation of the contributions of the strong and weak regions. In addition, a ``multilevel'' algorithm, decomposing 1-D extremely large scale quasi-planar structures into more than one weak region and appropriately choosing the NSA parameters for each weak region, is incorporated into the original NSA method to improve its accuracy.

Development and validation of a sensitive and fast UPLC-MS/MS method for simultaneous determination of seven bioactive compounds in rat plasma after oral administration of Guizhi-gancao decoction.

PubMed

Ji, Bin; Zhuo, Limeng; Yang, Bin; Wang, Yang; Li, Lin; Yu, Miao; Zhao, Yunli; Yu, Zhiguo

2017-04-15

Rapid, sensitive, selective and accurate UPLC-MS/MS method was developed and fully validated for simultaneous determination of cinnamaldehyde, cinnamic acid, 2-methoxy cinnamic acid, glycyrrhizic acid, glycyrrhetinic acid, liquiritigenin and isoliquiritin in rat plasma after oral administration of Guizhi-gancao decoction. Plasma samples were processed with a simple protein precipitation technique using acetonitrile, followed by chromatographic separation using a Thermo Hypersil GOLD C 18 column. A 11.0min linear gradient elution was used at a flow rate of 0.2mL/min with a mobile phase of 0.1% acetic acid containing 0.2mM ammonium acetate in water and acetonitrile. The analytes and internal standard, schisandrin, were detected using both positive and negative ion electrospray ionization in multiple reaction monitoring mode. The developed method was validated for intra-day and inter-day accuracy and precision whose values fell in the acceptable limits. Matrix effect was found to be minimal. Recovery efficiency of all the analytes was found to be >60%. Stability results showed that the analytes were stable at all the conditions. This validated method was successfully used to study the pharmacokinetics of multiple compounds in rat plasma after oral administration of Guizhi-gancao decoction. Copyright © 2017 Elsevier B.V. All rights reserved.

Longitudinal gradient coils with enhanced radial uniformity in restricted diameter: Single-current and multiple-current approaches.

PubMed

Romero, Javier A; Domínguez, Gabriela A; Anoardo, Esteban

2017-03-01

An important requirement for a gradient coil is that the uniformity of the generated magnetic field gradient should be maximal within the active volume of the coil. For a cylindrical geometry, the radial uniformity of the gradient turns critic, particularly in cases where the gradient-unit has to be designed to fit into the inner bore of a compact magnet of reduced dimensions, like those typically used in fast-field-cycling NMR. In this paper we present two practical solutions aimed to fulfill this requirement. We propose a matrix-inversion optimization algorithm based on the Biot-Savart law, that using a proper cost function, allows maximizing the uniformity of the gradient and power efficiency. The used methodology and the simulation code were validated in a single-current design, by comparing the computer simulated field map with the experimental data measured in a real prototype. After comparing the obtained results with the target field approach, a multiple-element coil driven by independent current sources is discussed, and a real prototype evaluated. Opposed equispaced independent windings are connected in pairs conforming an arrangement of independent anti-Helmholtz units. This last coil seizes 80% of its radial dimension with a gradient uniformity better than 5%. The design also provides an adaptable region of uniformity along with adjustable coil efficiency. Copyright © 2017 Elsevier Inc. All rights reserved.

Quantum molecular dynamics and multistep-direct analyses of multiple preequilibrium emission

NASA Astrophysics Data System (ADS)

Chadwick, M. B.; Chiba, S.; Niita, K.; Maruyama, T.; Iwamoto, A.

1995-11-01

We study multiple preequilibrium emission in nucleon induced reactions at intermediate energies, and compare quantum molecular dynamics (QMD) calculations with multistep-direct Feshbach-Kerman-Koonin results [M. B. Chadwick, P. G. Young, D. C. George, and Y. Watanabe, Phys. Rev. C 50, 996 (1994)]. When the theoretical expressions of this reference are reformulated so that the definitions of primary and multiple emission correspond to those used in QMD, the two theories yield similar results for primary and multiple preequilibrium emission. We use QMD as a tool to determine the multiplicities of fast preequilibrium nucleons as a function of incident energy. For fast particle cross sections to exceed 5% of the inclusive preequilibrium emission cross sections we find that two particles should be included in reactions above 50 MeV, three above about 180 MeV, and four are only needed when the incident energy exceeds about 400 MeV.

Improvements in simulation of multiple scattering effects in ATLAS fast simulation

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

Basalaev, A. E., E-mail: artem.basalaev@cern.ch

Fast ATLAS Tracking Simulation (Fatras) package was verified on single layer geometry with respect to full simulation with GEANT4. Fatras hadronic interactions and multiple scattering simulation were studied in comparison with GEANT4. Disagreement was found in multiple scattering distributions of primary charged particles (μ, π, e). A new model for multiple scattering simulation was implemented in Fatras. The model was based on R. Frühwirth’s mixture models. New model was tested on single layer geometry and a good agreement with GEANT4 was achieved. Also a comparison of reconstructed tracks’ parameters was performed for Inner Detector geometry, and Fatras with new multiplemore » scattering model proved to have better agreement with GEANT4. New model of multiple scattering was added as a part of Fatras package in the development release of ATLAS software—ATHENA.« less

Fast methodology for the reliable determination of nonylphenol in water samples by minimal labeling isotope dilution mass spectrometry.

PubMed

Fabregat-Cabello, Neus; Castillo, Ángel; Sancho, Juan V; González, Florenci V; Roig-Navarro, Antoni Francesc

2013-08-02

In this work we have developed and validated an accurate and fast methodology for the determination of 4-nonylphenol (technical mixture) in complex matrix water samples by UHPLC-ESI-MS/MS. The procedure is based on isotope dilution mass spectrometry (IDMS) in combination with isotope pattern deconvolution (IPD), which provides the concentration of the analyte directly from the spiked sample without requiring any methodological calibration graph. To avoid any possible isotopic effect during the analytical procedure the in-house synthesized (13)C1-4-(3,6-dimethyl-3-heptyl)phenol was used as labeled compound. This proposed surrogate was able to compensate the matrix effect even from wastewater samples. A SPE pre-concentration step together with exhaustive efforts to avoid contamination were included to reach the signal-to-noise ratio necessary to detect the endogenous concentrations present in environmental samples. Calculations were performed acquiring only three transitions, achieving limits of detection lower than 100ng/g for all water matrix assayed. Recoveries within 83-108% and coefficients of variation ranging from 1.5% to 9% were obtained. On the contrary a considerable overestimation was obtained with the most usual classical calibration procedure using 4-n-nonylphenol as internal standard, demonstrating the suitability of the minimal labeling approach. Copyright © 2013 Elsevier B.V. All rights reserved.

PWMScan: a fast tool for scanning entire genomes with a position-specific weight matrix.

PubMed

Ambrosini, Giovanna; Groux, Romain; Bucher, Philipp

2018-03-05

Transcription factors (TFs) regulate gene expression by binding to specific short DNA sequences of 5 to 20-bp to regulate the rate of transcription of genetic information from DNA to messenger RNA. We present PWMScan, a fast web-based tool to scan server-resident genomes for matches to a user-supplied PWM or TF binding site model from a public database. The web server and source code are available at http://ccg.vital-it.ch/pwmscan and https://sourceforge.net/projects/pwmscan, respectively. giovanna.ambrosini@epfl.ch. SUPPLEMENTARY DATA ARE AVAILABLE AT BIOINFORMATICS ONLINE.

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

Chemical signature of a migrating grain boundaries in polycrystalline olivine

NASA Astrophysics Data System (ADS)

Boneh, Y.; Marquardt, K.; Skemer, P. A.

2017-12-01

Olivine is the most abundant phase and influences strongly the physical and chemical properties of the upper mantle. The structure and chemistry of olivine grain-boundaries is important to understand, as these interfaces provide a reservoir for incompatible elements and partial melt, and serve as a fast pathway for chemical diffusion. This project investigates the chemical characteristics of grain boundaries in an olivine-rich aggregate. The sample is composed of Fo50 olivine crystals with minor amounts of enstatite. It was previously deformed (Hansen et al., 2016) and then annealed (Boneh et al., 2017) to investigate the microstructural changes during recrystallization. This transient microstructure has a bimodal grain size distribution and includes grains that experienced abnormal grain-growth, (porphyroblasts) and highly strained grains with no significant recrystallization or growth (matrix). Using high-resolution transmission electron microscopy (HR-TEM) with energy dispersive X-ray (EDX) at the Bayerisches Geoinstitut (BGI), we characterized boundaries between pairs of porphyroblasts, pairs of matrix grains, and mixed boundaries between porphyroblast and matrix grains. It was found that the boundary between porphyroblasts is enriched in Al and Ca and depleted in Mg, in comparison to grain interiors. However, matrix-matrix boundaries show less chemical segregation of these elements. The relatively high level of chemical segregation to porphyroblast grain boundaries offers different possible interpretations: 1) During grain boundary migration incompatible elements are swept up by the migrating grain boundary. 2) Large angle grain boundaries provide a large density of energetically favorable storage sites for incompatible elements. 3) Diffusion along low angle grain boundaries is too slow to allow for fast chemical equilibration between the different grain boundaries. 4) Dislocations cores serve as an important transport media for impurities (i.e., Cottrell atmosphere). We will further discuss these different interpretations, their feasibility, and implications for the geochemistry of the mantle.

Multiple pathways from the neighborhood food environment to increased body mass index through dietary behaviors: A structural equation-based analysis in the CARDIA study

PubMed Central

Richardson, Andrea S.; Meyer, Katie A.; Howard, Annie Green; Boone-Heinonen, Janne; Popkin, Barry M.; Evenson, Kelly R.; Shikany, James M.; Lewis, Cora E.; Gordon-Larsen, Penny

2016-01-01

Objectives To examine longitudinal pathways from multiple types of neighborhood restaurants and food stores to BMI, through dietary behaviors. Methods We used data from participants (n=5114) in the United States-based Coronary Artery Risk Development in Young Adults study and a structural equation model to estimate longitudinal (1985–86 to 2005–06) pathways simultaneously from neighborhood fast food restaurants, sit-down restaurants, supermarkets, and convenience stores to BMI through dietary behaviors, controlling for socioeconomic status (SES) and physical activity. Results Higher numbers of neighborhood fast food restaurants and lower numbers of sit-down restaurants were associated with higher consumption of an obesogenic fast food-type diet. The pathways from food stores to BMI through diet were inconsistent in magnitude and statistical significance. Conclusions Efforts to decrease the numbers of neighborhood fast food restaurants and to increase the numbers of sit-down restaurant options could influence diet behaviors. Availability of neighborhood fast food and sit-down restaurants may play comparatively stronger roles than food stores in shaping dietary behaviors and BMI. PMID:26454248

Use of freeze-casting in advanced burner reactor fuel design

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

Lang, A. L.; Yablinsky, C. A.; Allen, T. R.

2012-07-01

This paper will detail the modeling of a fast reactor with fuel pins created using a freeze-casting process. Freeze-casting is a method of creating an inert scaffold within a fuel pin. The scaffold is created using a directional solidification process and results in open porosity for emplacement of fuel, with pores ranging in size from 300 microns to 500 microns in diameter. These pores allow multiple fuel types and enrichments to be loaded into one fuel pin. Also, each pore could be filled with varying amounts of fuel to allow for the specific volume of fission gases created by thatmore » fuel type. Currently fast reactors, including advanced burner reactors (ABR's), are not economically feasible due to the high cost of operating the reactors and of reprocessing the fuel. However, if the fuel could be very precisely placed, such as within a freeze-cast scaffold, this could increase fuel performance and result in a valid design with a much lower cost per megawatt. In addition to competitive costs, freeze-cast fuel would also allow for selective breeding or burning of actinides within specific locations in fast reactors. For example, fast flux peak locations could be utilized on a minute scale to target specific actinides for transmutation. Freeze-cast fuel is extremely flexible and has great potential in a variety of applications. This paper performs initial modeling of freeze-cast fuel, with the generic fast reactor parameters for this model based on EBR-II. The core has an assumed power of 62.5 MWt. The neutronics code used was Monte Carlo N-Particle (MCNP5) transport code. Uniform pore sizes were used in increments of 100 microns. Two different freeze-cast scaffold materials were used: ceramic (MgO-ZrO{sub 2}) and steel (SS316L). Separate models were needed for each material because the freeze-cast ceramic and metal scaffolds have different structural characteristics and overall porosities. Basic criticality results were compiled for the various models. Preliminary results show that criticality is achievable with freeze-cast fuel pins despite the significant amount of inert fuel matrix. Freeze casting is a promising method to achieve very precise fuel placement within fuel pins. (authors)« less

Stochastic population dynamics in populations of western terrestrial garter snakes with divergent life histories

USGS Publications Warehouse

Miller, David A.; Clark, W.R.; Arnold, S.J.; Bronikowski, A.M.

2011-01-01

Comparative evaluations of population dynamics in species with temporal and spatial variation in life-history traits are rare because they require long-term demographic time series from multiple populations. We present such an analysis using demographic data collected during the interval 1978-1996 for six populations of western terrestrial garter snakes (Thamnophis elegans) from two evolutionarily divergent ecotypes. Three replicate populations from a slow-living ecotype, found in mountain meadows of northeastern California, were characterized by individuals that develop slowly, mature late, reproduce infrequently with small reproductive effort, and live longer than individuals of three populations of a fast-living ecotype found at lakeshore locales. We constructed matrix population models for each of the populations based on 8-13 years of data per population and analyzed both deterministic dynamics based on mean annual vital rates and stochastic dynamics incorporating annual variation in vital rates. (1) Contributions of highly variable vital rates to fitness (??s) were buffered against the negative effects of stochastic variation, and this relationship was consistent with differences between the meadow (M-slow) and lakeshore (L-fast) ecotypes. (2) Annual variation in the proportion of gravid females had the greatest negative effect among all vital rates on ?? s. The magnitude of variation in the proportion of gravid females and its effect on ??s was greater in M-slow than L-fast populations. (3) Variation in the proportion of gravid females, in turn, depended on annual variation in prey availability, and its effect on ??s was 4- 23 times greater in M-slow than L-fast populations. In addition to differences in stochastic dynamics between ecotypes, we also found higher mean mortality rates across all age classes in the L-fast populations. Our results suggest that both deterministic and stochastic selective forces have affected the evolution of divergent life-history traits in the two ecotypes, which, in turn, affect population dynamics. M-slow populations have evolved life-history traits that buffer fitness against direct effects of variation in reproduction and that spread lifetime reproduction across a greater number of reproductive bouts. These results highlight the importance of long-term demographic and environmental monitoring and of incorporating temporal dynamics into empirical studies of life-history evolution. ?? 2011 by the Ecological Society of America.

Stochastic population dynamics in populations of western terrestrial garter snakes with divergent life histories.

PubMed

Miller, David A; Clark, William R; Arnold, Stevan J; Bronikowski, Anne M

2011-08-01

Comparative evaluations of population dynamics in species with temporal and spatial variation in life-history traits are rare because they require long-term demographic time series from multiple populations. We present such an analysis using demographic data collected during the interval 1978-1996 for six populations of western terrestrial garter snakes (Thamnophis elegans) from two evolutionarily divergent ecotypes. Three replicate populations from a slow-living ecotype, found in mountain meadows of northeastern California, were characterized by individuals that develop slowly, mature late, reproduce infrequently with small reproductive effort, and live longer than individuals of three populations of a fast-living ecotype found at lakeshore locales. We constructed matrix population models for each of the populations based on 8-13 years of data per population and analyzed both deterministic dynamics based on mean annual vital rates and stochastic dynamics incorporating annual variation in vital rates. (1) Contributions of highly variable vital rates to fitness (lambda(s)) were buffered against the negative effects of stochastic variation, and this relationship was consistent with differences between the meadow (M-slow) and lakeshore (L-fast) ecotypes. (2) Annual variation in the proportion of gravid females had the greatest negative effect among all vital rates on lambda(s). The magnitude of variation in the proportion of gravid females and its effect on lambda(s) was greater in M-slow than L-fast populations. (3) Variation in the proportion of gravid females, in turn, depended on annual variation in prey availability, and its effect on lambda(s) was 4 23 times greater in M-slow than L-fast populations. In addition to differences in stochastic dynamics between ecotypes, we also found higher mean mortality rates across all age classes in the L-fast populations. Our results suggest that both deterministic and stochastic selective forces have affected the evolution of divergent life-history traits in the two ecotypes, which, in turn, affect population dynamics. M-slow populations have evolved life-history traits that buffer fitness against direct effects of variation in reproduction and that spread lifetime reproduction across a greater number of reproductive bouts. These results highlight the importance of long-term demographic and environmental monitoring and of incorporating temporal dynamics into empirical studies of life-history evolution.

Improving performances of suboptimal greedy iterative biclustering heuristics via localization.

PubMed

Erten, Cesim; Sözdinler, Melih

2010-10-15

Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. Even the simplest versions of the problem are computationally hard. Most of the proposed solutions therefore employ greedy iterative heuristics that locally optimize a suitably assigned scoring function. We provide a fast and simple pre-processing algorithm called localization that reorders the rows and columns of the input data matrix in such a way as to group correlated entries in small local neighborhoods within the matrix. The proposed localization algorithm takes its roots from effective use of graph-theoretical methods applied to problems exhibiting a similar structure to that of biclustering. In order to evaluate the effectivenesss of the localization pre-processing algorithm, we focus on three representative greedy iterative heuristic methods. We show how the localization pre-processing can be incorporated into each representative algorithm to improve biclustering performance. Furthermore, we propose a simple biclustering algorithm, Random Extraction After Localization (REAL) that randomly extracts submatrices from the localization pre-processed data matrix, eliminates those with low similarity scores, and provides the rest as correlated structures representing biclusters. We compare the proposed localization pre-processing with another pre-processing alternative, non-negative matrix factorization. We show that our fast and simple localization procedure provides similar or even better results than the computationally heavy matrix factorization pre-processing with regards to H-value tests. We next demonstrate that the performances of the three representative greedy iterative heuristic methods improve with localization pre-processing when biological correlations in the form of functional enrichment and PPI verification constitute the main performance criteria. The fact that the random extraction method based on localization REAL performs better than the representative greedy heuristic methods under same criteria also confirms the effectiveness of the suggested pre-processing method. Supplementary material including code implementations in LEDA C++ library, experimental data, and the results are available at http://code.google.com/p/biclustering/ cesim@khas.edu.tr; melihsozdinler@boun.edu.tr Supplementary data are available at Bioinformatics online.

Simulation of irradiation hardening of Zircaloy within plate-type dispersion nuclear fuel elements

NASA Astrophysics Data System (ADS)

Jiang, Yijie; Wang, Qiming; Cui, Yi; Huo, Yongzhong; Ding, Shurong

2011-06-01

Within plate-type dispersion nuclear fuel elements, the metal matrix and cladding attacked continuously by fast neutrons undergo irradiation hardening, which might have remarkable effects upon the mechanical behaviors within fuel elements. In this paper, with the irradiation hardening effect of metal materials mainly considered together with irradiation growth effect of the cladding, the three-dimensional large-deformation constitutive relations for the metal matrix and cladding are developed. The method of virtual temperature increase in the previous studies is further developed to model the irradiation swelling of fuel particles; the method of anisotropic thermal expansion is introduced to model irradiation growth of the cladding; and a method of multi-step-temperature loading is proposed to simulate the coupling features of irradiation-induced swelling of the fuel particles together with irradiation growth of the cladding. Above all, based on the developed relationship between irradiation growth at certain burnup and the loaded virtual temperatures, with considering that certain burnup corresponds to certain fast neutron fluence, the time-dependent constitutive relation due to irradiation hardening effect is replaced by the virtual-temperature-dependent one which is introduced into the commercial software to simulate the irradiation hardening effects of the matrix and cladding. Numerical simulations of the irradiation-induced mechanical behaviors are implemented with the finite element method in consideration of the micro-structure of the fuel meat. The obtained results indicate that when the irradiation hardening effects are introduced into the constitutive relations of the metal matrix and cladding: (1) higher maximum Mises stresses for certain burnup at the matrix exist with the equivalent plastic strains remaining almost the same at lower burnups; (2) the maximum Mises stresses for certain burnup at the cladding are enhanced while the maximum equivalent plastic strains are reduced; and (3) the maximum first principal stresses for certain burnup at the matrix or the cladding are lower than the ones without the hardening effect, and the differences are found to increase with burnup; and the variation rules of the interfacial stresses are similar.

Near-optimal matrix recovery from random linear measurements.

PubMed

Romanov, Elad; Gavish, Matan

2018-06-25

In matrix recovery from random linear measurements, one is interested in recovering an unknown M-by-N matrix [Formula: see text] from [Formula: see text] measurements [Formula: see text], where each [Formula: see text] is an M-by-N measurement matrix with i.i.d. random entries, [Formula: see text] We present a matrix recovery algorithm, based on approximate message passing, which iteratively applies an optimal singular-value shrinker-a nonconvex nonlinearity tailored specifically for matrix estimation. Our algorithm typically converges exponentially fast, offering a significant speedup over previously suggested matrix recovery algorithms, such as iterative solvers for nuclear norm minimization (NNM). It is well known that there is a recovery tradeoff between the information content of the object [Formula: see text] to be recovered (specifically, its matrix rank r) and the number of linear measurements n from which recovery is to be attempted. The precise tradeoff between r and n, beyond which recovery by a given algorithm becomes possible, traces the so-called phase transition curve of that algorithm in the [Formula: see text] plane. The phase transition curve of our algorithm is noticeably better than that of NNM. Interestingly, it is close to the information-theoretic lower bound for the minimal number of measurements needed for matrix recovery, making it not only state of the art in terms of convergence rate, but also near optimal in terms of the matrices it successfully recovers. Copyright © 2018 the Author(s). Published by PNAS.

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.

Automatic building detection based on Purposive FastICA (PFICA) algorithm using monocular high resolution Google Earth images

NASA Astrophysics Data System (ADS)

Ghaffarian, Saman; Ghaffarian, Salar

2014-11-01

This paper proposes an improved FastICA model named as Purposive FastICA (PFICA) with initializing by a simple color space transformation and a novel masking approach to automatically detect buildings from high resolution Google Earth imagery. ICA and FastICA algorithms are defined as Blind Source Separation (BSS) techniques for unmixing source signals using the reference data sets. In order to overcome the limitations of the ICA and FastICA algorithms and make them purposeful, we developed a novel method involving three main steps: 1-Improving the FastICA algorithm using Moore-Penrose pseudo inverse matrix model, 2-Automated seeding of the PFICA algorithm based on LUV color space and proposed simple rules to split image into three regions; shadow + vegetation, baresoil + roads and buildings, respectively, 3-Masking out the final building detection results from PFICA outputs utilizing the K-means clustering algorithm with two number of clusters and conducting simple morphological operations to remove noises. Evaluation of the results illustrates that buildings detected from dense and suburban districts with divers characteristics and color combinations using our proposed method have 88.6% and 85.5% overall pixel-based and object-based precision performances, respectively.

Approaches to optimization of SS/TDMA time slot assignment. [satellite switched time division multiple access

NASA Technical Reports Server (NTRS)

Wade, T. O.

1984-01-01

Reduction techniques for traffic matrices are explored in some detail. These matrices arise in satellite switched time-division multiple access (SS/TDMA) techniques whereby switching of uplink and downlink beams is required to facilitate interconnectivity of beam zones. A traffic matrix is given to represent that traffic to be transmitted from n uplink beams to n downlink beams within a TDMA frame typically of 1 ms duration. The frame is divided into segments of time and during each segment a portion of the traffic is represented by a switching mode. This time slot assignment is characterized by a mode matrix in which there is not more than a single non-zero entry on each line (row or column) of the matrix. Investigation is confined to decomposition of an n x n traffic matrix by mode matrices with a requirement that the decomposition be 100 percent efficient or, equivalently, that the line(s) in the original traffic matrix whose sum is maximal (called critical line(s)) remain maximal as mode matrices are subtracted throughout the decomposition process. A method of decomposition of an n x n traffic matrix by mode matrices results in a number of steps that is bounded by n(2) - 2n + 2. It is shown that this upper bound exists for an n x n matrix wherein all the lines are maximal (called a quasi doubly stochastic (QDS) matrix) or for an n x n matrix that is completely arbitrary. That is, the fact that no method can exist with a lower upper bound is shown for both QDS and arbitrary matrices, in an elementary and straightforward manner.

Matrix effects of calcium on high-precision sulfur isotope measurement by multiple-collector inductively coupled plasma mass spectrometry.

PubMed

Liu, Chenhui; Bian, Xiao-Peng; Yang, Tao; Lin, An-Jun; Jiang, Shao-Yong

2016-05-01

Multiple-collector inductively coupled plasma mass spectrometry (MC-ICP-MS) has been successfully applied in the rapid and high-precision measurement for sulfur isotope ratios in recent years. During the measurement, the presence of matrix elements would affect the instrumental mass bias for sulfur and these matrix-induced effects have aroused a lot of researchers' interest. However, these studies have placed more weight on highlighting the necessity for their proposed correction protocols (e.g., chemical purification and matrix-matching) while less attention on the key property of the matrix element gives rise to the matrix effects. In this study, four groups of sulfate solutions, which have different concentrations of sulfur (0.05-0.60mM) but a constant sequence of atomic calcium/sulfur ratios (0.1-50), are investigated under wet (solution) and dry (desolvation) plasma conditions to make a detailed evaluation on the matrix effects from calcium on sulfur isotope measurement. Based on a series of comparative analyses, we indicated that, the matrix effects of calcium on both measured sulfur isotope ratios and detected (32)S signal intensities are dependent mainly on the absolute calcium concentration rather than its relative concentration ratio to sulfur (i.e., atomic calcium/sulfur ratio). Also, for the same group of samples, the matrix effects of calcium under dry plasma condition are much more significant than that of wet plasma. This research affords the opportunity to realize direct and relatively precise sulfur isotope measurement for evaporite gypsum, and further provides some suggestions with regard to sulfur isotope analytical protocols for sedimentary pore water. Copyright © 2016 Elsevier B.V. All rights reserved.

Impact of Fast Charging on Life of EV Batteries

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

Neubauer, Jeremy; Wood, Eric; Burton, Evan

2015-05-03

Utilization of public charging infrastructure is heavily dependent on user-specific travel behavior. The availability of fast chargers can positively affect the utility of battery electric vehicles, even given infrequent use. Estimated utilization rates do not appear frequent enough to significantly impact battery life. Battery thermal management systems are critical in mitigating dangerous thermal conditions on long distance tours with multiple fast charge events.

Computer-Based Video Instruction to Teach Students with Intellectual Disabilities to Verbally Respond to Questions and Make Purchases in Fast Food Restaurants

ERIC Educational Resources Information Center

Mechling, Linda C.; Pridgen, Leslie S.; Cronin, Beth A.

2005-01-01

Computer-based video instruction (CBVI) was used to teach verbal responses to questions presented by cashiers and purchasing skills in fast food restaurants. A multiple probe design across participants was used to evaluate the effectiveness of CBVI. Instruction occurred through simulations of three fast food restaurants on the computer using video…

Analysis of Peroxisome Biogenesis in Pollen by Confocal Microscopy and Transmission Electron Microscopy.

PubMed

Jia, Peng-Fei; Li, Hong-Ju; Yang, Wei-Cai

2017-01-01

Peroxisome is an essential single-membrane bound organelle in most eukaryotic cells and functions in diverse cellular processes. De novo formation, division, and turnover of peroxisomes contribute to its biogenesis, morphology, and population regulation. In plants, peroxisome plays multiple roles, including metabolism, development, and stress response. Defective peroxisome biogenesis and development retard plant growth, adaption, and reproduction. Through tracing the subcellular localization of fluorescent reporter tagged matrix protein of peroxisome, fluorescence microscopy is a reliable and fast way to detect peroxisome biogenesis. Further fine-structural observation of peroxisome by TEM enables researchers to observe the detailed ultrastructure of its morphology and spatial contact with other organelles. Pollen grain is a specialized structure where two small sperm cells are enclosed in the cytoplasm of a large vegetative cell. Two features make pollen grain a good system to study peroxisome biogenesis: indispensable requirement of peroxisome for germination on the stigma and homogeneity. Here, we describe the methods of studying peroxisome biogenesis in Arabidopsis pollen grains by fluorescent live-imaging with confocal laser scanning microscopy (CLSM) and by DAB-staining based transmission electron microscopy (TEM).

Graphene nano-ink biosensor arrays on a microfluidic paper for multiplexed detection of metabolites.

PubMed

Labroo, Pratima; Cui, Yue

2014-02-27

The development of a miniaturized and low-cost platform for the highly sensitive, selective and rapid detection of multiplexed metabolites is of great interest for healthcare, pharmaceuticals, food science, and environmental monitoring. Graphene is a delicate single-layer, two-dimensional network of carbon atoms with extraordinary electrical sensing capability. Microfluidic paper with printing technique is a low cost matrix. Here, we demonstrated the development of graphene-ink based biosensor arrays on a microfluidic paper for the multiplexed detection of different metabolites, such as glucose, lactate, xanthine and cholesterol. Our results show that the graphene biosensor arrays can detect multiple metabolites on a microfluidic paper sensitively, rapidly and simultaneously. The device exhibits a fast measuring time of less than 2 min, a low detection limit of 0.3 μM, and a dynamic detection range of 0.3-15 μM. The process is simple and inexpensive to operate and requires a low consumption of sample volume. We anticipate that these results could open exciting opportunities for a variety of applications. Copyright © 2014 Elsevier B.V. All rights reserved.

An Automatic Multi-Target Independent Analysis Framework for Non-Planar Infrared-Visible Registration.

PubMed

Sun, Xinglong; Xu, Tingfa; Zhang, Jizhou; Zhao, Zishu; Li, Yuankun

2017-07-26

In this paper, we propose a novel automatic multi-target registration framework for non-planar infrared-visible videos. Previous approaches usually analyzed multiple targets together and then estimated a global homography for the whole scene, however, these cannot achieve precise multi-target registration when the scenes are non-planar. Our framework is devoted to solving the problem using feature matching and multi-target tracking. The key idea is to analyze and register each target independently. We present a fast and robust feature matching strategy, where only the features on the corresponding foreground pairs are matched. Besides, new reservoirs based on the Gaussian criterion are created for all targets, and a multi-target tracking method is adopted to determine the relationships between the reservoirs and foreground blobs. With the matches in the corresponding reservoir, the homography of each target is computed according to its moving state. We tested our framework on both public near-planar and non-planar datasets. The results demonstrate that the proposed framework outperforms the state-of-the-art global registration method and the manual global registration matrix in all tested datasets.

Fast computation of an optimal controller for large-scale adaptive optics.

PubMed

Massioni, Paolo; Kulcsár, Caroline; Raynaud, Henri-François; Conan, Jean-Marc

2011-11-01

The linear quadratic Gaussian regulator provides the minimum-variance control solution for a linear time-invariant system. For adaptive optics (AO) applications, under the hypothesis of a deformable mirror with instantaneous response, such a controller boils down to a minimum-variance phase estimator (a Kalman filter) and a projection onto the mirror space. The Kalman filter gain can be computed by solving an algebraic Riccati matrix equation, whose computational complexity grows very quickly with the size of the telescope aperture. This "curse of dimensionality" makes the standard solvers for Riccati equations very slow in the case of extremely large telescopes. In this article, we propose a way of computing the Kalman gain for AO systems by means of an approximation that considers the turbulence phase screen as the cropped version of an infinite-size screen. We demonstrate the advantages of the methods for both off- and on-line computational time, and we evaluate its performance for classical AO as well as for wide-field tomographic AO with multiple natural guide stars. Simulation results are reported.

UV-responsive polyvinyl alcohol nanofibers prepared by electrospinning

NASA Astrophysics Data System (ADS)

Khatri, Zeeshan; Ali, Shamshad; Khatri, Imran; Mayakrishnan, Gopiraman; Kim, Seong Hun; Kim, Ick-Soo

2015-07-01

We report UV-responsive polyvinyl alcohol (PVA) nanofibers for potential application for recording and erasing quick response (QR) codes. We incorporate 1‧-3‧-dihydro-8-methoxy-1‧,3‧,3‧-trimethyl-6-nitrospiro [2H-1-benzopyran-2,2‧-(2H)-indole] (indole) and,3-dihydro-1,3,3-trimethylspiro [2H-indole-2,3‧-[3H] phenanthr [9,10-b] (1,4) oxazine] (oxazine) into PVA polymer matrix via electrospinning technique. The resultant nanofibers were measured for recording-erasing, photo-coloration and thermal reversibility. The rate of photo-coloration of PVA-indole nanofibers was five times higher than the PVA-oxazine nanofibers, whereas the thermal reversibility found to be more than twice as fast as PVA-oxazine nanofibers. Results showed that the resultant nanofibers have very good capability of recording QR codes multiple times. The FTIR spectroscopy and SEM were employed to characterize the electrospun nanofibers. The UV-responsive PVA nanofibers have great potentials as a light-driven nanomaterials incorporated within sensors, sensitive displays and in optical devices such as erasable and rewritable optical storage.

Grayscale Optical Correlator Workbench

NASA Technical Reports Server (NTRS)

Hanan, Jay; Zhou, Hanying; Chao, Tien-Hsin

2006-01-01

Grayscale Optical Correlator Workbench (GOCWB) is a computer program for use in automatic target recognition (ATR). GOCWB performs ATR with an accurate simulation of a hardware grayscale optical correlator (GOC). This simulation is performed to test filters that are created in GOCWB. Thus, GOCWB can be used as a stand-alone ATR software tool or in combination with GOC hardware for building (target training), testing, and optimization of filters. The software is divided into three main parts, denoted filter, testing, and training. The training part is used for assembling training images as input to a filter. The filter part is used for combining training images into a filter and optimizing that filter. The testing part is used for testing new filters and for general simulation of GOC output. The current version of GOCWB relies on the mathematical software tools from MATLAB binaries for performing matrix operations and fast Fourier transforms. Optimization of filters is based on an algorithm, known as OT-MACH, in which variables specified by the user are parameterized and the best filter is selected on the basis of an average result for correct identification of targets in multiple test images.

Low-discrepancy sampling of parametric surface using adaptive space-filling curves (SFC)

NASA Astrophysics Data System (ADS)

Hsu, Charles; Szu, Harold

2014-05-01

Space-Filling Curves (SFCs) are encountered in different fields of engineering and computer science, especially where it is important to linearize multidimensional data for effective and robust interpretation of the information. Examples of multidimensional data are matrices, images, tables, computational grids, and Electroencephalography (EEG) sensor data resulting from the discretization of partial differential equations (PDEs). Data operations like matrix multiplications, load/store operations and updating and partitioning of data sets can be simplified when we choose an efficient way of going through the data. In many applications SFCs present just this optimal manner of mapping multidimensional data onto a one dimensional sequence. In this report, we begin with an example of a space-filling curve and demonstrate how it can be used to find the most similarity using Fast Fourier transform (FFT) through a set of points. Next we give a general introduction to space-filling curves and discuss properties of them. Finally, we consider a discrete version of space-filling curves and present experimental results on discrete space-filling curves optimized for special tasks.

Biological tissue imaging with a position and time sensitive pixelated detector.

PubMed

Jungmann, Julia H; Smith, Donald F; MacAleese, Luke; Klinkert, Ivo; Visser, Jan; Heeren, Ron M A

2012-10-01

We demonstrate the capabilities of a highly parallel, active pixel detector for large-area, mass spectrometric imaging of biological tissue sections. A bare Timepix assembly (512 × 512 pixels) is combined with chevron microchannel plates on an ion microscope matrix-assisted laser desorption time-of-flight mass spectrometer (MALDI TOF-MS). The detector assembly registers position- and time-resolved images of multiple m/z species in every measurement frame. We prove the applicability of the detection system to biomolecular mass spectrometry imaging on biologically relevant samples by mass-resolved images from Timepix measurements of a peptide-grid benchmark sample and mouse testis tissue slices. Mass-spectral and localization information of analytes at physiologic concentrations are measured in MALDI-TOF-MS imaging experiments. We show a high spatial resolution (pixel size down to 740 × 740 nm(2) on the sample surface) and a spatial resolving power of 6 μm with a microscope mode laser field of view of 100-335 μm. Automated, large-area imaging is demonstrated and the Timepix' potential for fast, large-area image acquisition is highlighted.

A quantitative approach for pesticide analysis in grape juice by direct interfacing of a matrix compatible SPME phase to dielectric barrier discharge ionization-mass spectrometry.

PubMed

Mirabelli, Mario F; Gionfriddo, Emanuela; Pawliszyn, Janusz; Zenobi, Renato

2018-02-12

We evaluated the performance of a dielectric barrier discharge ionization (DBDI) source for pesticide analysis in grape juice, a fairly complex matrix due to the high content of sugars (≈20% w/w) and pigments. A fast sample preparation method based on direct immersion solid-phase microextraction (SPME) was developed, and novel matrix compatible SPME fibers were used to reduce in-source matrix suppression effects. A high resolution LTQ Orbitrap mass spectrometer allowed for rapid quantification in full scan mode. This direct SPME-DBDI-MS approach was proven to be effective for the rapid and direct analysis of complex sample matrices, with limits of detection in the parts-per-trillion (ppt) range and inter- and intra-day precision below 30% relative standard deviation (RSD) for samples spiked at 1, 10 and 10 ng ml -1 , with overall performance comparable or even superior to existing chromatographic approaches.

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.

A parallel computer implementation of fast low-rank QR approximation of the Biot-Savart law

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

White, D A; Fasenfest, B J; Stowell, M L

2005-11-07

In this paper we present a low-rank QR method for evaluating the discrete Biot-Savart law on parallel computers. It is assumed that the known current density and the unknown magnetic field are both expressed in a finite element expansion, and we wish to compute the degrees-of-freedom (DOF) in the basis function expansion of the magnetic field. The matrix that maps the current DOF to the field DOF is full, but if the spatial domain is properly partitioned the matrix can be written as a block matrix, with blocks representing distant interactions being low rank and having a compressed QR representation.more » The matrix partitioning is determined by the number of processors, the rank of each block (i.e. the compression) is determined by the specific geometry and is computed dynamically. In this paper we provide the algorithmic details and present computational results for large-scale computations.« less

Analysis and Development of A Robust Fuel for Gas-Cooled Fast Reactors

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

Knight, Travis W.

2010-01-31

The focus of this effort was on the development of an advanced fuel for gas-cooled fast reactor (GFR) applications. This composite design is based on carbide fuel kernels dispersed in a ZrC matrix. The choice of ZrC is based on its high temperature properties and good thermal conductivity and improved retention of fission products to temperatures beyond that of traditional SiC based coated particle fuels. A key component of this study was the development and understanding of advanced fabrication techniques for GFR fuels that have potential to reduce minor actinide (MA) losses during fabrication owing to their higher vapor pressuresmore » and greater volatility. The major accomplishments of this work were the study of combustion synthesis methods for fabrication of the ZrC matrix, fabrication of high density UC electrodes for use in the rotating electrode process, production of UC particles by rotating electrode method, integration of UC kernels in the ZrC matrix, and the full characterization of each component. Major accomplishments in the near-term have been the greater characterization of the UC kernels produced by the rotating electrode method and their condition following the integration in the composite (ZrC matrix) following the short time but high temperature combustion synthesis process. This work has generated four journal publications, one conference proceeding paper, and one additional journal paper submitted for publication (under review). The greater significance of the work can be understood in that it achieved an objective of the DOE Generation IV (GenIV) roadmap for GFR Fuel—namely the demonstration of a composite carbide fuel with 30% volume fuel. This near-term accomplishment is even more significant given the expected or possible time frame for implementation of the GFR in the years 2030 -2050 or beyond.« less

SU-D-206-02: Evaluation of Partial Storage of the System Matrix for Cone Beam Computed Tomography Using a GPU Platform

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

Matenine, D; Cote, G; Mascolo-Fortin, J

2016-06-15

Purpose: Iterative reconstruction algorithms in computed tomography (CT) require a fast method for computing the intersections between the photons’ trajectories and the object, also called ray-tracing or system matrix computation. This work evaluates different ways to store the system matrix, aiming to reconstruct dense image grids in reasonable time. Methods: We propose an optimized implementation of the Siddon’s algorithm using graphics processing units (GPUs) with a novel data storage scheme. The algorithm computes a part of the system matrix on demand, typically, for one projection angle. The proposed method was enhanced with accelerating options: storage of larger subsets of themore » system matrix, systematic reuse of data via geometric symmetries, an arithmetic-rich parallel code and code configuration via machine learning. It was tested on geometries mimicking a cone beam CT acquisition of a human head. To realistically assess the execution time, the ray-tracing routines were integrated into a regularized Poisson-based reconstruction algorithm. The proposed scheme was also compared to a different approach, where the system matrix is fully pre-computed and loaded at reconstruction time. Results: Fast ray-tracing of realistic acquisition geometries, which often lack spatial symmetry properties, was enabled via the proposed method. Ray-tracing interleaved with projection and backprojection operations required significant additional time. In most cases, ray-tracing was shown to use about 66 % of the total reconstruction time. In absolute terms, tracing times varied from 3.6 s to 7.5 min, depending on the problem size. The presence of geometrical symmetries allowed for non-negligible ray-tracing and reconstruction time reduction. Arithmetic-rich parallel code and machine learning permitted a modest reconstruction time reduction, in the order of 1 %. Conclusion: Partial system matrix storage permitted the reconstruction of higher 3D image grid sizes and larger projection datasets at the cost of additional time, when compared to the fully pre-computed approach. This work was supported in part by the Fonds de recherche du Quebec - Nature et technologies (FRQ-NT). The authors acknowledge partial support by the CREATE Medical Physics Research Training Network grant of the Natural Sciences and Engineering Research Council of Canada (Grant No. 432290).« less

Multiple-Input Multiple-Output (MIMO) Linear Systems Extreme Inputs/Outputs

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

Smallwood, David O.

2007-01-01

A linear structure is excited at multiple points with a stationary normal random process. The response of the structure is measured at multiple outputs. If the autospectral densities of the inputs are specified, the phase relationships between the inputs are derived that will minimize or maximize the trace of the autospectral density matrix of the outputs. If the autospectral densities of the outputs are specified, the phase relationships between the outputs that will minimize or maximize the trace of the input autospectral density matrix are derived. It is shown that other phase relationships and ordinary coherence less than one willmore » result in a trace intermediate between these extremes. Least favorable response and some classes of critical response are special cases of the development. It is shown that the derivation for stationary random waveforms can also be applied to nonstationary random, transients, and deterministic waveforms.« less

A weighted information criterion for multiple minor components and its adaptive extraction algorithms.

PubMed

Gao, Yingbin; Kong, Xiangyu; Zhang, Huihui; Hou, Li'an

2017-05-01

Minor component (MC) plays an important role in signal processing and data analysis, so it is a valuable work to develop MC extraction algorithms. Based on the concepts of weighted subspace and optimum theory, a weighted information criterion is proposed for searching the optimum solution of a linear neural network. This information criterion exhibits a unique global minimum attained if and only if the state matrix is composed of the desired MCs of an autocorrelation matrix of an input signal. By using gradient ascent method and recursive least square (RLS) method, two algorithms are developed for multiple MCs extraction. The global convergences of the proposed algorithms are also analyzed by the Lyapunov method. The proposed algorithms can extract the multiple MCs in parallel and has advantage in dealing with high dimension matrices. Since the weighted matrix does not require an accurate value, it facilitates the system design of the proposed algorithms for practical applications. The speed and computation advantages of the proposed algorithms are verified through simulations. Copyright © 2017 Elsevier Ltd. All rights reserved.

Blood Sugar - Multiple Languages

MedlinePlus

... Sugar Test - العربية (Arabic) Bilingual PDF Health Information Translations Chinese, Simplified (Mandarin dialect) (简体中文) Expand Section Fasting ... Chinese, Simplified (Mandarin dialect)) Bilingual PDF Health Information Translations Chinese, Traditional (Cantonese dialect) (繁體中文) Expand Section Fasting ...

Matrix Interdiction Problem

NASA Astrophysics Data System (ADS)

Kasiviswanathan, Shiva Prasad; Pan, Feng

In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove a set of k matrix columns that minimizes in the residual matrix the sum of the row values, where the value of a row is defined to be the largest entry in that row. This combinatorial problem is closely related to bipartite network interdiction problem that can be applied to minimize the probability that an adversary can successfully smuggle weapons. After introducing the matrix interdiction problem, we study the computational complexity of this problem. We show that the matrix interdiction problem is NP-hard and that there exists a constant γ such that it is even NP-hard to approximate this problem within an n γ additive factor. We also present an algorithm for this problem that achieves an (n - k) multiplicative approximation ratio.

Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions

DTIC Science & Technology

2012-03-22

with performance profiles, Math. Program., 91 (2002), pp. 201–213. [6] P. DRINEAS, R. KANNAN, AND M. W. MAHONEY , Fast Monte Carlo algorithms for matrices...computing invariant subspaces of non-Hermitian matri- ces, Numer. Math., 25 ( 1975 /76), pp. 123–136. [25] , Matrix algorithms Vol. II: Eigensystems

Data Stream Mining Based Dynamic Link Anomaly Analysis Using Paired Sliding Time Window Data

DTIC Science & Technology

2014-11-01

Conference on Knowledge Dis- covery and Data Mining, PAKDD’10, Hyderabad, India , (2010). [2] Almansoori, W., Gao, S., Jarada, T. N., Elsheikh, A. M...F., Greif, C., and Lakshmanan, L. V., “Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores,” Internet Mathematics, Vol

Design and characterization of the ePix10k: a high dynamic range integrating pixel ASIC for LCLS detectors

NASA Astrophysics Data System (ADS)

Caragiulo, P.; Dragone, A.; Markovic, B.; Herbst, R.; Nishimura, K.; Reese, B.; Herrmann, S.; Hart, P.; Blaj, G.; Segal, J.; Tomada, A.; Hasi, J.; Carini, G.; Kenney, C.; Haller, G.

2015-05-01

ePix10k is a variant of a novel class of integrating pixel ASICs architectures optimized for the processing of signals in second generation LINAC Coherent Light Source (LCLS) X-Ray cameras. The ASIC is optimized for high dynamic range application requiring high spatial resolution and fast frame rates. ePix ASICs are based on a common platform composed of a random access analog matrix of pixel with global shutter, fast parallel column readout, and dedicated sigma-delta analog to digital converters per column. The ePix10k variant has 100um×100um pixels arranged in a 176×192 matrix, a resolution of 140e- r.m.s. and a signal range of 3.5pC (10k photons at 8keV). In its final version it will be able to sustain a frame rate of 2kHz. A first prototype has been fabricated and characterized. Performance in terms of noise, linearity, uniformity, cross-talk, together with preliminary measurements with bump bonded sensors are reported here.

Exact numerical calculation of fixation probability and time on graphs.

PubMed

Hindersin, Laura; Möller, Marius; Traulsen, Arne; Bauer, Benedikt

2016-12-01

The Moran process on graphs is a popular model to study the dynamics of evolution in a spatially structured population. Exact analytical solutions for the fixation probability and time of a new mutant have been found for only a few classes of graphs so far. Simulations are time-expensive and many realizations are necessary, as the variance of the fixation times is high. We present an algorithm that numerically computes these quantities for arbitrary small graphs by an approach based on the transition matrix. The advantage over simulations is that the calculation has to be executed only once. Building the transition matrix is automated by our algorithm. This enables a fast and interactive study of different graph structures and their effect on fixation probability and time. We provide a fast implementation in C with this note (Hindersin et al., 2016). Our code is very flexible, as it can handle two different update mechanisms (Birth-death or death-Birth), as well as arbitrary directed or undirected graphs. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

In-Situ Strain Analysis of Potential Habitat Composites Exposed to a Simulated Long-Term Lunar Radiation Exposure

NASA Technical Reports Server (NTRS)

Rojdev, Kristina; O'Rourke, Mary Jane; Hill, Charles; Nutt, Steven; Atwell, William

2010-01-01

NASA is studying the effects of long-term space radiation on potential multifunctional composite materials for habitats to better determine their characteristics in the harsh space environment. Two composite materials were selected for the study and were placed in a test stand that simulated the stresses of a pressure vessel wall on the material. The samples in the test stand were exposed to radiation at either a fast dose rate or a slow dose rate, and their strain and temperature was recorded during the exposure. It was found that during a fast dose rate exposure the materials saw a decreased strain with time, or a shrinking of the materials. Given previous radiation studies of polymers, this is believed to be a result of crosslinking occurring in the matrix material. However, with a slow dose rate, the materials saw an increase in strain with time, or a stretching of the materials. This result is consistent with scission or degradation of the matrix occurring, possibly due to oxidative degradation.

Production of ZrC Matrix for Use in Gas Fast Reactor Composite Fuels

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

Vasudevamurthy, Gokul; Knight, Travis W.; Roberts, Elwyn

2007-07-01

Zirconium carbide is being considered as a candidate for inert matrix material in composite nuclear fuel for Gas fast reactors due to its favorable characteristics. ZrC can be produced by the direct reaction of pure zirconium and graphite powders. Such a reaction is exothermic in nature. The reaction is self sustaining once initial ignition has been achieved. The heat released during the reaction is high enough to complete the reaction and achieve partial sintering without any external pressure applied. External heat source is required to achieve ignition of the reactants and maintain the temperature close to the adiabatic temperature tomore » achieve higher levels of sintering. External pressure is also a driving force for sintering. In the experiments described, cylindrical compacts of ZrC were produced by direct combustion reaction. External induction heating combined with varying amounts of external applied pressure was employed to achieve varying degrees of density/porosity. The effect of reactant particle size on the product characteristics was also studied. The samples were characterized for density/porosity, composition and microstructure. (authors)« less

Phone camera detection of glucose blood level based on magnetic particles entrapped inside bubble wrap.

PubMed

Martinkova, Pavla; Pohanka, Miroslav

2016-12-18

Glucose is an important diagnostic biochemical marker of diabetes but also for organophosphates, carbamates, acetaminophens or salicylates poisoning. Hence, innovation of accurate and fast detection assay is still one of priorities in biomedical research. Glucose sensor based on magnetic particles (MPs) with immobilized enzymes glucose oxidase (GOx) and horseradish peroxidase (HRP) was developed and the GOx catalyzed reaction was visualized by a smart-phone-integrated camera. Exponential decay concentration curve with correlation coefficient 0.997 and with limit of detection 0.4 mmol/l was achieved. Interfering and matrix substances were measured due to possibility of assay influencing and no effect of the tested substances was observed. Spiked plasma samples were also measured and no influence of plasma matrix on the assay was proved. The presented assay showed complying results with reference method (standard spectrophotometry based on enzymes glucose oxidase and peroxidase inside plastic cuvettes) with linear dependence and correlation coefficient 0.999 in concentration range between 0 and 4 mmol/l. On the grounds of measured results, method was considered as highly specific, accurate and fast assay for detection of glucose.

Analysis of wave motion in one-dimensional structures through fast-Fourier-transform-based wavelet finite element method

NASA Astrophysics Data System (ADS)

Shen, Wei; Li, Dongsheng; Zhang, Shuaifang; Ou, Jinping

2017-07-01

This paper presents a hybrid method that combines the B-spline wavelet on the interval (BSWI) finite element method and spectral analysis based on fast Fourier transform (FFT) to study wave propagation in One-Dimensional (1D) structures. BSWI scaling functions are utilized to approximate the theoretical wave solution in the spatial domain and construct a high-accuracy dynamic stiffness matrix. Dynamic reduction on element level is applied to eliminate the interior degrees of freedom of BSWI elements and substantially reduce the size of the system matrix. The dynamic equations of the system are then transformed and solved in the frequency domain through FFT-based spectral analysis which is especially suitable for parallel computation. A comparative analysis of four different finite element methods is conducted to demonstrate the validity and efficiency of the proposed method when utilized in high-frequency wave problems. Other numerical examples are utilized to simulate the influence of crack and delamination on wave propagation in 1D rods and beams. Finally, the errors caused by FFT and their corresponding solutions are presented.

Multiple Concentric Cylinder Model (MCCM) user's guide

NASA Technical Reports Server (NTRS)

Williams, Todd O.; Pindera, Marek-Jerzy

1994-01-01

A user's guide for the computer program mccm.f is presented. The program is based on a recently developed solution methodology for the inelastic response of an arbitrarily layered, concentric cylinder assemblage under thermomechanical loading which is used to model the axisymmetric behavior of unidirectional metal matrix composites in the presence of various microstructural details. These details include the layered morphology of certain types of ceramic fibers, as well as multiple fiber/matrix interfacial layers recently proposed as a means of reducing fabrication-induced, and in-service, residual stress. The computer code allows efficient characterization and evaluation of new fibers and/or new coating systems on existing fibers with a minimum of effort, taking into account inelastic and temperature-dependent properties and different morphologies of the fiber and the interfacial region. It also facilitates efficient design of engineered interfaces for unidirectional metal matrix composites.

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.

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.

Development of a Lozenge for Oral Transmucosal Delivery of Trans-Resveratrol in Humans: Proof of Concept

PubMed Central

Blanchard, Otis L.; Friesenhahn, Gregory; Javors, Martin A.; Smoliga, James M.

2014-01-01

Resveratrol provides multiple physiologic benefits which promote healthspan in various model species and clinical trials support continued exploration of resveratrol treatment in humans. However, there remains concern regarding low bioavailability and wide inter-individual differences in absorption and metabolism in humans, which suggests a great need to develop novel methods for resveratrol delivery. We hypothesized that oral transmucosal delivery, using a lozenge composed of a resveratrol-excipient matrix, would allow resveratrol to be absorbed rapidly into the bloodstream. We pursued proof of concept through two experiments. In the first experiment, the solubility of trans-resveratrol (tRES) in water and 2.0 M solutions of dextrose, fructose, ribose, sucrose, and xylitol was determined using HPLC. Independent t-tests with a Bonferroni correction were used to compare the solubility of tRES in each of the solutions to that in water. tRES was significantly more soluble in the ribose solution (p = 0.0013) than in the other four solutions. Given the enhanced solubility of tRES in a ribose solution, a resveratrol-ribose matrix was developed into a lozenge suitable for human consumption. Lozenges were prepared, each containing 146±5.5 mg tRES per 2000 mg of lozenge mass. Two healthy human participants consumed one of the prepared lozenges following an overnight fast. Venipuncture was performed immediately before and 15, 30, 45, and 60 minutes following lozenge administration. Maximal plasma concentrations (C max) for tRES alone (i.e., resveratrol metabolites not included) were 325 and 332 ng⋅mL−1 for the two participants at 15 minute post-administration for both individuals. These results suggest a resveratrol-ribose matrix lozenge can achieve greater C max and enter the bloodstream faster than previously reported dosage forms for gastrointestinal absorption. While this study is limited by small sample size and only one method of resveratrol delivery, it does provide proof of concept to support further exploration of novel delivery methods for resveratrol administration. PMID:24587240

Pure endmember extraction using robust kernel archetypoid analysis for hyperspectral imagery

NASA Astrophysics Data System (ADS)

Sun, Weiwei; Yang, Gang; Wu, Ke; Li, Weiyue; Zhang, Dianfa

2017-09-01

A robust kernel archetypoid analysis (RKADA) method is proposed to extract pure endmembers from hyperspectral imagery (HSI). The RKADA assumes that each pixel is a sparse linear mixture of all endmembers and each endmember corresponds to a real pixel in the image scene. First, it improves the re8gular archetypal analysis with a new binary sparse constraint, and the adoption of the kernel function constructs the principal convex hull in an infinite Hilbert space and enlarges the divergences between pairwise pixels. Second, the RKADA transfers the pure endmember extraction problem into an optimization problem by minimizing residual errors with the Huber loss function. The Huber loss function reduces the effects from big noises and outliers in the convergence procedure of RKADA and enhances the robustness of the optimization function. Third, the random kernel sinks for fast kernel matrix approximation and the two-stage algorithm for optimizing initial pure endmembers are utilized to improve its computational efficiency in realistic implementations of RKADA, respectively. The optimization equation of RKADA is solved by using the block coordinate descend scheme and the desired pure endmembers are finally obtained. Six state-of-the-art pure endmember extraction methods are employed to make comparisons with the RKADA on both synthetic and real Cuprite HSI datasets, including three geometrical algorithms vertex component analysis (VCA), alternative volume maximization (AVMAX) and orthogonal subspace projection (OSP), and three matrix factorization algorithms the preconditioning for successive projection algorithm (PreSPA), hierarchical clustering based on rank-two nonnegative matrix factorization (H2NMF) and self-dictionary multiple measurement vector (SDMMV). Experimental results show that the RKADA outperforms all the six methods in terms of spectral angle distance (SAD) and root-mean-square-error (RMSE). Moreover, the RKADA has short computational times in offline operations and shows significant improvement in identifying pure endmembers for ground objects with smaller spectrum differences. Therefore, the RKADA could be an alternative for pure endmember extraction from hyperspectral images.

Effects of glucose ingestion on circulating inflammatory mediators: Influence of sex and weight excess.

PubMed

Escobar-Morreale, Héctor F; Martínez-García, M Ángeles; Montes-Nieto, Rafael; Fernández-Durán, Elena; Temprano-Carazo, Sara; Luque-Ramírez, Manuel

2017-04-01

Low-grade chronic inflammation is involved in the pathophysiology of obesity. However, little is known about the influence of sex and sex hormones on surrogate inflammatory markers and mediators, particularly after glucose ingestion. Observational study. We measured the circulating concentrations of interleukin-6, interleukin-18, macrophage migration inhibitory factor, matrix metallopeptidase-9, monocyte chemotactic protein-1 and pentraxin-3, in the fasting state and during a 75 g oral glucose tolerance test, in 24 women and 25 men. Eleven men and 11 women were lean whereas 14 men and 13 women had weight excess. Anti-inflammatory cytokines (interleukin-6 and interleukin-18) were increased in the fasting state and/or decreased in some women during the oral glucose tolerance test, as opposed to inflammatory mediators such as macrophage migration inhibitory factor and matrix metallopeptidase-9 that increased during the oral glucose tolerance test especially in subjects with weight excess. Body mass index and waist circumference were the main determinants of these changes. Fasting pentraxin-3 levels were especially increased in lean women in parallel to a decrease in free testosterone levels, and decreased during the oral glucose tolerance test as opposed to the increase in insulin concentrations. The circulating concentrations of markers of low-grade chronic inflammation in young healthy adults are not only influenced by obesity but also by abdominal adiposity, fasting and glucose ingestion and, in some cases, by sex and sex hormones. These influences should be considered when these markers are used as surrogate markers of the inflammatory milieu associated with obesity. Copyright © 2016 Elsevier Ltd and European Society for Clinical Nutrition and Metabolism. All rights reserved.

The influence of preferential flow on pressure propagation and landslide triggering of the Rocca Pitigliana landslide

NASA Astrophysics Data System (ADS)

Shao, Wei; Bogaard, Thom; Bakker, Mark; Berti, Matteo

2016-12-01

The fast pore water pressure response to rain events is an important triggering factor for slope instability. The fast pressure response may be caused by preferential flow that bypasses the soil matrix. Currently, most of the hydro-mechanical models simulate pore water pressure using a single-permeability model, which cannot quantify the effects of preferential flow on pressure propagation and landslide triggering. Previous studies showed that a model based on the linear-diffusion equation can simulate the fast pressure propagation in near-saturated landslides such as the Rocca Pitigliana landslide. In such a model, the diffusion coefficient depends on the degree of saturation, which makes it difficult to use the model for predictions. In this study, the influence of preferential flow on pressure propagation and slope stability is investigated with a 1D dual-permeability model coupled with an infinite-slope stability approach. The dual-permeability model uses two modified Darcy-Richards equations to simultaneously simulate the matrix flow and preferential flow in hillslopes. The simulated pressure head is used in an infinite-slope stability analysis to identify the influence of preferential flow on the fast pressure response and landslide triggering. The dual-permeability model simulates the height and arrival of the pressure peak reasonably well. Performance of the dual-permeability model is as good as or better than the linear-diffusion model even though the dual-permeability model is calibrated for two single pulse rain events only, while the linear-diffusion model is calibrated for each rain event separately. In conclusion, the 1D dual-permeability model is a promising tool for landslides under similar conditions.

Multiple Testing with Modified Bonferroni Methods.

ERIC Educational Resources Information Center

Li, Jianmin; And Others

This paper discusses the issue of multiple testing and overall Type I error rates in contexts other than multiple comparisons of means. It demonstrates, using a 5 x 5 correlation matrix, the application of 5 recently developed modified Bonferroni procedures developed by the following authors: (1) Y. Hochberg (1988); (2) B. S. Holland and M. D.…

Expression and purification of myristoylated matrix protein of Mason-Pfizer monkey virus for NMR and MS measurements.

PubMed

Prchal, Jan; Junkova, Petra; Strmiskova, Miroslava; Lipov, Jan; Hynek, Radovan; Ruml, Tomas; Hrabal, Richard

2011-09-01

Matrix proteins play multiple roles both in early and late stages of the viral replication cycle. Their N-terminal myristoylation is important for interaction with the host cell membrane during virus budding. We used Escherichia coli, carrying N-myristoyltransferase gene, for the expression of the myristoylated His-tagged matrix protein of Mason-Pfizer monkey virus. An efficient, single-step purification procedure eliminating all contaminating proteins including, importantly, the non-myristoylated matrix protein was designed. The comparison of NMR spectra of matrix protein with its myristoylated form revealed substantial structural changes induced by this fatty acid modification. Copyright © 2011 Elsevier Inc. All rights reserved.

Multiple-attribute group decision making with different formats of preference information on attributes.

PubMed

Xu, Zeshui

2007-12-01

Interval utility values, interval fuzzy preference relations, and interval multiplicative preference relations are three common uncertain-preference formats used by decision-makers to provide their preference information in the process of decision making under fuzziness. This paper is devoted in investigating multiple-attribute group-decision-making problems where the attribute values are not precisely known but the value ranges can be obtained, and the decision-makers provide their preference information over attributes by three different uncertain-preference formats i.e., 1) interval utility values; 2) interval fuzzy preference relations; and 3) interval multiplicative preference relations. We first utilize some functions to normalize the uncertain decision matrix and then transform it into an expected decision matrix. We establish a goal-programming model to integrate the expected decision matrix and all three different uncertain-preference formats from which the attribute weights and the overall attribute values of alternatives can be obtained. Then, we use the derived overall attribute values to get the ranking of the given alternatives and to select the best one(s). The model not only can reflect both the subjective considerations of all decision-makers and the objective information but also can avoid losing and distorting the given objective and subjective decision information in the process of information integration. Furthermore, we establish some models to solve the multiple-attribute group-decision-making problems with three different preference formats: 1) utility values; 2) fuzzy preference relations; and 3) multiplicative preference relations. Finally, we illustrate the applicability and effectiveness of the developed models with two practical examples.

Fully-reversible optical sensor for hydrogen peroxide with fast response.

PubMed

Ding, Longjiang; Chen, Siyu; Zhang, Wei; Zhang, Yinglu; Wang, Xu-Dong

2018-05-09

A fully reversible optical sensor for hydrogen peroxide with fast response is presented. The sensor was fabricated by in-situ growing ultra-small platinum nanoparticles (PtNPs) inside the pores of fibrous silica particles (KCC-1). The nanocomposite was then embedded into a hydrogel matrix and form a sensor layer, the immobilized PtNPs can catalytically convert hydrogen peroxide into molecular oxygen, which is measured via luminescent quenching based oxygen sensor underneath. Owing to the high porosity and permeability of KCC-1 and high local concentration of PtNPs, the sensor exhibits fast response (less than 1 min) and full reversibility. The measurement range of the sensor covers 1.0 μM to 10.0 mM, and very small amount of sample is required during measurement (200 μL). Because of its high stability, excellent reversibility and selectivity, and extremely fast response, the sensor could fulfill all industry requirements for real-time measurement, and fill market vacancy.

Tracking Multiple Video Targets with an Improved GM-PHD Tracker

PubMed Central

Zhou, Xiaolong; Yu, Hui; Liu, Honghai; Li, Youfu

2015-01-01

Tracking multiple moving targets from a video plays an important role in many vision-based robotic applications. In this paper, we propose an improved Gaussian mixture probability hypothesis density (GM-PHD) tracker with weight penalization to effectively and accurately track multiple moving targets from a video. First, an entropy-based birth intensity estimation method is incorporated to eliminate the false positives caused by noisy video data. Then, a weight-penalized method with multi-feature fusion is proposed to accurately track the targets in close movement. For targets without occlusion, a weight matrix that contains all updated weights between the predicted target states and the measurements is constructed, and a simple, but effective method based on total weight and predicted target state is proposed to search the ambiguous weights in the weight matrix. The ambiguous weights are then penalized according to the fused target features that include spatial-colour appearance, histogram of oriented gradient and target area and further re-normalized to form a new weight matrix. With this new weight matrix, the tracker can correctly track the targets in close movement without occlusion. For targets with occlusion, a robust game-theoretical method is used. Finally, the experiments conducted on various video scenarios validate the effectiveness of the proposed penalization method and show the superior performance of our tracker over the state of the art. PMID:26633422

Experiences in autotuning matrix multiplication for energy minimization on GPUs

DOE PAGES

Anzt, Hartwig; Haugen, Blake; Kurzak, Jakub; ...

2015-05-20

In this study, we report extensive results and analysis of autotuning the computationally intensive graphics processing units kernel for dense matrix–matrix multiplication in double precision. In contrast to traditional autotuning and/or optimization for runtime performance only, we also take the energy efficiency into account. For kernels achieving equal performance, we show significant differences in their energy balance. We also identify the memory throughput as the most influential metric that trades off performance and energy efficiency. Finally, as a result, the performance optimal case ends up not being the most efficient kernel in overall resource use.

A Fast-Time Simulation Environment for Airborne Merging and Spacing Research

NASA Technical Reports Server (NTRS)

Bussink, Frank J. L.; Doble, Nathan A.; Barmore, Bryan E.; Singer, Sharon

2005-01-01

As part of NASA's Distributed Air/Ground Traffic Management (DAG-TM) effort, NASA Langley Research Center is developing concepts and algorithms for merging multiple aircraft arrival streams and precisely spacing aircraft over the runway threshold. An airborne tool has been created for this purpose, called Airborne Merging and Spacing for Terminal Arrivals (AMSTAR). To evaluate the performance of AMSTAR and complement human-in-the-loop experiments, a simulation environment has been developed that enables fast-time studies of AMSTAR operations. The environment is based on TMX, a multiple aircraft desktop simulation program created by the Netherlands National Aerospace Laboratory (NLR). This paper reviews the AMSTAR concept, discusses the integration of the AMSTAR algorithm into TMX and the enhancements added to TMX to support fast-time AMSTAR studies, and presents initial simulation results.

Integrable generalizations of non-linear multiple three-wave interaction models

NASA Astrophysics Data System (ADS)

Jurčo, Branislav

1989-07-01

Integrable generalizations of multiple three-wave interaction models in terms of r-matrix formulation are investigated. The Lax representations, complete sets of first integrals in involution are constructed, the quantization leading to Gaudin's models is discussed.

Demyelination of subcortical nuclei in multiple sclerosis

NASA Astrophysics Data System (ADS)

Krutenkova, E.; Aitmagambetova, G.; Khodanovich, M.; Bowen, J.; Gangadharan, B.; Henson, L.; Mayadev, A.; Repovic, P.; Qian, P.; Yarnykh, V.

2016-02-01

Myelin containing in basal ganglia in multiple sclerosis patients was evaluated using new noninvasive quantitative MRI method fast whole brain macromolecular proton fraction mapping. Myelin level in globus pallidus and putamen significantly decreased in multiple sclerosis patients as compared with healthy control subjects but not in substantia nigra and caudate nucleus.

In vitro quantitative ((1))H and ((19))F nuclear magnetic resonance spectroscopy and imaging studies of fluvastatin™ in Lescol® XL tablets in a USP-IV dissolution cell.

PubMed

Zhang, Qilei; Gladden, Lynn; Avalle, Paolo; Mantle, Michael

2011-12-20

Swellable polymeric matrices are key systems in the controlled drug release area. Currently, the vast majority of research is still focused on polymer swelling dynamics. This study represents the first quantitative multi-nuclear (((1))H and ((19))F) fast magnetic resonance imaging study of the complete dissolution process of a commercial (Lescol® XL) tablet, whose formulation is based on the hydroxypropyl methylcellulose (HPMC) polymer under in vitro conditions in a standard USP-IV (United States Pharmacopeia apparatus IV) flow-through cell that is incorporated into high field superconducting magnetic resonance spectrometer. Quantitative RARE ((1))H magnetic resonance imaging (MRI) and ((19))F nuclear magnetic resonance (NMR) spectroscopy and imaging methods have been used to give information on: (i) dissolution media uptake and hydrodynamics; (ii) active pharmaceutical ingredient (API) mobilisation and dissolution; (iii) matrix swelling and dissolution and (iv) media activity within the swelling matrix. In order to better reflect the in vivo conditions, the bio-relevant media Simulated Gastric Fluid (SGF) and Fasted State Simulated Intestinal Fluid (FaSSIF) were used. A newly developed quantitative ultra-fast MRI technique was applied and the results clearly show the transport dynamics of media penetration and hydrodynamics along with the polymer swelling processes. The drug dissolution and mobility inside the gel matrix was characterised, in parallel to the ((1))H measurements, by ((19))F NMR spectroscopy and MRI, and the drug release profile in the bulk solution was recorded offline by UV spectrometer. We found that NMR spectroscopy and 1D-MRI can be uniquely used to monitor the drug dissolution/mobilisation process within the gel layer, and the results from ((19))F NMR spectra indicate that in the gel layer, the physical mobility of the drug changes from "dissolved immobilised drug" to "dissolved mobilised drug". Copyright © 2011 Elsevier B.V. All rights reserved.

[Diagnostic value of dynamic-extended focused assessment with sonography for trauma in patients with multiple trauma].

PubMed

Xu, Yongsong; Wang, Runze; Zhu, Mengmeng; Li, Xuexue; Pan, Xiaodong; Ni, Tong; Zhou, Shusheng

2018-01-01

To investigate the diagnostic value of dynamic-extended focused assessment with sonography for trauma (D-EFAST) in patients with multiple trauma in intensive care unit (ICU). A prospective clinical study was conducted. Eighty patients with multiple trauma admitted to ICU of Anhui Provincial Hospital from September 1st, 2014 to December 31st, 2016 were enrolled. Extended focused assessment with sonography for trauma (E-FAST) check was conducted at first, for those who had positive findings diagnosis was confirmed by immediately CT examination or surgical exploration. If it was negative, the patients received E-FAST every morning for 7 days (defined as D-EFAST), for those with positive findings, immediately CT or surgery was performed to clarify the diagnosis. The final clinical diagnosis was used as the "gold standard" to calculate the diagnostic accordance rate of EFAST and D-EFAST examination technique for pneumothorax, pleural effusion, spleen injury, kidney damage, liver damage, gastrointestinal injury, pericardial effusion, bladder rupture, and pancreatic injury, as well as their sensitivity, specificity, positive predictive value, negative predictive value, accuracy rate, and missed diagnosis rate, and the difference between EFAST and D-EFAST was compared. There were 4 patients excluded because of death and abandoning treatment, and finally 76 patients were included in the study. The total sensitivity of E-FAST examination technique for pneumothorax, pleural effusion, spleen injury, liver damage, gastrointestinal injury, pericardial effusion, and bladder rupture was 75.9% (66/87), and the specificity was 98.3% (587/597), the positive predictive value was 86.8% (66/76), and the negative predictive value was 96.5% (587/608), the accuracy rate was 95.5% (653/684), and the rate of missed diagnosis was 24.1% (21/87). The most of the delayed injury in patients with multiple trauma occurred at 2-7 days after injury with incidence of 4.8% (33/684). The diagnostic sensitivity of D-EFAST for delayed injury was 98.3% (118/120), the specificity was 99.8% (563/564), the positive predictive value was 99.2% (118/119), the negative predictive value was 99.6% (563/565), the diagnostic accuracy rate was 99.6% (681/684), and rate of missed diagnosis was 1.7% (2/120). When the final clinical diagnosis was set as the "gold standard", D-EFAST technology for the detection rate was 98.3% (118/120) for patients with multiple trauma on organ injury while the detection rate of E-FAST was 75.9% (66/87), with statistical significant difference (P < 0.01), indicating that D-EFAST was better than E-FAST in check of multiple trauma patients with organ injury. Although the E-FAST technology can quickly diagnose the multiple trauma patients and win the rescue time for critical patients, multiple trauma patients injured after 2-7 days prone to delayed damage and are difficult to detect, and D-EFAST can be used to find delayed damage earlier, and reduce the misdiagnosis rate of multiple trauma patients.

Metabolic Effects of Intermittent Fasting.

PubMed

Patterson, Ruth E; Sears, Dorothy D

2017-08-21

The objective of this review is to provide an overview of intermittent fasting regimens, summarize the evidence on the health benefits of intermittent fasting, and discuss physiological mechanisms by which intermittent fasting might lead to improved health outcomes. A MEDLINE search was performed using PubMed and the terms "intermittent fasting," "fasting," "time-restricted feeding," and "food timing." Modified fasting regimens appear to promote weight loss and may improve metabolic health. Several lines of evidence also support the hypothesis that eating patterns that reduce or eliminate nighttime eating and prolong nightly fasting intervals may result in sustained improvements in human health. Intermittent fasting regimens are hypothesized to influence metabolic regulation via effects on (a) circadian biology, (b) the gut microbiome, and (c) modifiable lifestyle behaviors, such as sleep. If proven to be efficacious, these eating regimens offer promising nonpharmacological approaches to improving health at the population level, with multiple public health benefits.

Fasting, circadian rhythms, and time restricted feeding in healthy lifespan

PubMed Central

Longo, Valter D.; Panda, Satchidananda

2016-01-01

Summary Feeding in most animals is confined to a defined period, leaving short periods of fasting that coincide with sleep. Fasting enables organisms to enter alternative metabolic phases, which rely less on glucose and more on ketone body-like carbon sources. Both intermittent and periodic fasting result in benefits ranging from prevention to the enhanced treatment of diseases. Similarly, time-restricted feeding (TRF), in which feeding time is restricted to certain hours of the day, allows the daily fasting period to last >12 h, thus imparting pleiotropic benefits in multiple organisms. Understanding the mechanistic link between nutrients and the fasting benefits is leading to the identification of fasting mimicking diets (FMDs) that achieve changes similar to those caused by fasting. Given the pleiotropic and sustained benefits of TRF and FMD, both basic science and translational research are warranted to develop fasting-associated interventions into effective and inexpensive treatments with the potential to improve healthspan. PMID:27304506

Effect of Cyclic Thermo-Mechanical Loads on Fatigue Reliability in Polymer Matrix Composites

NASA Technical Reports Server (NTRS)

Shah, A. R.; Murthy, P. L. N.; Chamis, C. C.

1996-01-01

A methodology to compute probabilistic fatigue life of polymer matrix laminated composites has been developed and demonstrated. Matrix degradation effects caused by long term environmental exposure and mechanical/thermal cyclic loads are accounted for in the simulation process. A unified time-temperature-stress dependent multi-factor interaction relationship developed at NASA Lewis Research Center has been used to model the degradation/aging of material properties due to cyclic loads. The fast probability integration method is used to compute probabilistic distribution of response. Sensitivities of fatigue life reliability to uncertainties in the primitive random variables (e.g., constituent properties, fiber volume ratio, void volume ratio, ply thickness, etc.) computed and their significance in the reliability- based design for maximum life is discussed. The effect of variation in the thermal cyclic loads on the fatigue reliability for a (0/+/- 45/90)(sub s) graphite/epoxy laminate with a ply thickness of 0.127 mm, with respect to impending failure modes has been studied. The results show that, at low mechanical cyclic loads and low thermal cyclic amplitudes, fatigue life for 0.999 reliability is most sensitive to matrix compressive strength, matrix modulus, thermal expansion coefficient, and ply thickness. Whereas at high mechanical cyclic loads and high thermal cyclic amplitudes, fatigue life at 0.999 reliability is more sensitive to the shear strength of matrix, longitudinal fiber modulus, matrix modulus, and ply thickness.

Adaptive multiple super fast simulated annealing for stochastic microstructure reconstruction

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

Ryu, Seun; Lin, Guang; Sun, Xin

2013-01-01

Fast image reconstruction from statistical information is critical in image fusion from multimodality chemical imaging instrumentation to create high resolution image with large domain. Stochastic methods have been used widely in image reconstruction from two point correlation function. The main challenge is to increase the efficiency of reconstruction. A novel simulated annealing method is proposed for fast solution of image reconstruction. Combining the advantage of very fast cooling schedules, dynamic adaption and parallelization, the new simulation annealing algorithm increases the efficiencies by several orders of magnitude, making the large domain image fusion feasible.

Applicability of refractometry for fast routine checking of hospital preparations.

PubMed

Hendrickx, Stijn; Verón, Aurora Monteagudo; Van Schepdael, Ann; Adams, Erwin

2016-04-30

Quality control of hospital pharmacy formulations is of the utmost importance to ensure constant quality and to avoid potential mistakes before administration to the patient. In this study we investigated the applicability of refractometry as a fast, inexpensive and easy-to-use quality control measurement. Refractive indices (RI) of a multitude of different hospital formulations with varying concentrations of active compound were measured. The samples consisted of a number of binary aqueous solutions (one compound in water), complex aqueous solutions (multiple compounds in water or in a constant matrix), two suspensions and one emulsion. For all these formulations, linear regression analysis was performed, quality control limits determined and accuracy and repeatability were checked. Subsequently, actual hospital pharmacy samples were analyzed to check whether they were within the specified limits. For both binary and complex aqueous formulations, repeatability was good and a linear correlation for all samples could be observed on condition that the concentration of the active compound was sufficiently high. The refractometer was not sensitive enough for solutions of folic acid and levothyroxine, which had too low a concentration of active compound. Due to lack of homogeneity and light scattering, emulsions and suspensions do not seem suitable for quality control by refractometry. A mathematical equation was generated to predict the refractive index of an aqueous solution containing clonidine HCl as active compound. Values calculated from the equation were compared with measured values and deviations of all samples were found to be lower than 1.3%. In order to use refractometry in a hospital pharmacy for quality control of multicomponent samples, additional intermediate measurements would be required, to overcome the fact that refractometry is not compound specific. In conclusion, we found that refractometry could potentially be useful for daily, fast quality measurements of relatively concentrated binary and more complex aqueous solutions in the hospital pharmacy. Copyright © 2016 Elsevier B.V. All rights reserved.

Improved optical axis determination accuracy for fiber-based polarization-sensitive optical coherence tomography

NASA Astrophysics Data System (ADS)

Lu, Zenghai; Matcher, Stephen J.

2013-03-01

We report on a new calibration technique that permits the accurate extraction of sample Jones matrix and hence fast-axis orientation by using fiber-based polarization-sensitive optical coherence tomography (PS-OCT) that is completely based on non polarization maintaining fiber such as SMF-28. In this technique, two quarter waveplates are used to completely specify the parameters of the system fibers in the sample arm so that the Jones matrix of the sample can be determined directly. The device was validated on measurements of a quarter waveplate and an equine tendon sample by a single-mode fiber-based swept-source PS-OCT system.

Species identification of clinical isolates of anaerobic bacteria: a comparison of two matrix-assisted laser desorption ionization-time of flight mass spectrometry systems.

PubMed

Justesen, Ulrik Stenz; Holm, Anette; Knudsen, Elisa; Andersen, Line Bisgaard; Jensen, Thøger Gorm; Kemp, Michael; Skov, Marianne Nielsine; Gahrn-Hansen, Bente; Møller, Jens Kjølseth

2011-12-01

We compared two matrix-assisted laser desorption ionization-time of flight mass spectrometry (MALDI-TOF MS) systems (Shimadzu/SARAMIS and Bruker) on a collection of consecutive clinically important anaerobic bacteria (n = 290). The Bruker system had more correct identifications to the species level (67.2% versus 49.0%), but also more incorrect identifications (7.9% versus 1.4%). The system databases need to be optimized to increase identification levels. However, MALDI-TOF MS in its present version seems to be a fast and inexpensive method for identification of most clinically important anaerobic bacteria.

Mesospheric dynamics and chemistry from SME data

NASA Technical Reports Server (NTRS)

Strobel, Darrell F.

1987-01-01

A fast Curtis matrix calculation of cooling rates due to the 15 micron band of CO2 is modified to parameterize the detailed calculations by Dickinson (1984) of infrared cooling by CO2 in the mesosphere and lower thermosphere. The calculations included separate NLTE treatment of the different 15 micron bands likely to be important for cooling. The goal was to compress the detailed properties of the different bands into a modified Curtis matrix, which represents one composite band with appropriate averaged radiative properties to allow for a simple and quick calculation of cooling rates given a temperature profile. Vertical constituent transport in the mesosphere was also studied.

Detection of Amine Impurity and Quality Assessment of the MALDI Matrix α-Cyano-4-Hydroxy-Cinnamic Acid for Peptide Analysis in the amol Range

NASA Astrophysics Data System (ADS)

Rechthaler, Justyna; Pittenauer, Ernst; Schaub, Tanner M.; Allmaier, Günter

2013-05-01

We have studied sample preparation conditions to increase the reproducibility of positive UV-MALDI-TOF mass spectrometry of peptides in the amol range. By evaluating several α-cyano-4-hydroxy-cinnamic acid (CHCA) matrix batches and preparation protocols, it became apparent that two factors have a large influence on the reproducibility and the quality of the generated peptide mass spectra: (1) the selection of the CHCA matrix, which allows the most sensitive measurements and an easier finding of the "sweet spots," and (2) the amount of the sample volume deposited onto the thin crystalline matrix layer. We have studied in detail the influence of a contaminant, coming from commercial CHCA matrix batches, on sensitivity of generated peptide mass spectra in the amol as well as fmol range of a tryptic peptide mixture. The structure of the contaminant, N, N-dimethylbutyl amine, was determined by applying MALDI-FT-ICR mass spectrometry experiments for elemental composition and MALDI high energy CID experiments utilizing a tandem mass spectrometer (TOF/RTOF). A recrystallization of heavily contaminated CHCA batches that reduces or eliminates the determined impurity is described. Furthermore, a fast and reliable method for the assessment of CHCA matrix batches prior to tryptic peptide MALDI mass spectrometric analyses is presented.

Reducing computational costs in large scale 3D EIT by using a sparse Jacobian matrix with block-wise CGLS reconstruction.

PubMed

Yang, C L; Wei, H Y; Adler, A; Soleimani, M

2013-06-01

Electrical impedance tomography (EIT) is a fast and cost-effective technique to provide a tomographic conductivity image of a subject from boundary current-voltage data. This paper proposes a time and memory efficient method for solving a large scale 3D EIT inverse problem using a parallel conjugate gradient (CG) algorithm. The 3D EIT system with a large number of measurement data can produce a large size of Jacobian matrix; this could cause difficulties in computer storage and the inversion process. One of challenges in 3D EIT is to decrease the reconstruction time and memory usage, at the same time retaining the image quality. Firstly, a sparse matrix reduction technique is proposed using thresholding to set very small values of the Jacobian matrix to zero. By adjusting the Jacobian matrix into a sparse format, the element with zeros would be eliminated, which results in a saving of memory requirement. Secondly, a block-wise CG method for parallel reconstruction has been developed. The proposed method has been tested using simulated data as well as experimental test samples. Sparse Jacobian with a block-wise CG enables the large scale EIT problem to be solved efficiently. Image quality measures are presented to quantify the effect of sparse matrix reduction in reconstruction results.

Inelastic behaviour of collagen networks in cell-matrix interactions and mechanosensation.

PubMed

Mohammadi, Hamid; Arora, Pamma D; Simmons, Craig A; Janmey, Paul A; McCulloch, Christopher A

2015-01-06

The mechanical properties of extracellular matrix proteins strongly influence cell-induced tension in the matrix, which in turn influences cell function. Despite progress on the impact of elastic behaviour of matrix proteins on cell-matrix interactions, little is known about the influence of inelastic behaviour, especially at the large and slow deformations that characterize cell-induced matrix remodelling. We found that collagen matrices exhibit deformation rate-dependent behaviour, which leads to a transition from pronounced elastic behaviour at fast deformations to substantially inelastic behaviour at slow deformations (1 μm min(-1), similar to cell-mediated deformation). With slow deformations, the inelastic behaviour of floating gels was sensitive to collagen concentration, whereas attached gels exhibited similar inelastic behaviour independent of collagen concentration. The presence of an underlying rigid support had a similar effect on cell-matrix interactions: cell-induced deformation and remodelling were similar on 1 or 3 mg ml(-1) attached collagen gels while deformations were two- to fourfold smaller in floating gels of high compared with low collagen concentration. In cross-linked collagen matrices, which did not exhibit inelastic behaviour, cells did not respond to the presence of the underlying rigid foundation. These data indicate that at the slow rates of collagen compaction generated by fibroblasts, the inelastic responses of collagen gels, which are influenced by collagen concentration and the presence of an underlying rigid foundation, are important determinants of cell-matrix interactions and mechanosensation. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Inelastic behaviour of collagen networks in cell–matrix interactions and mechanosensation

PubMed Central

Mohammadi, Hamid; Arora, Pamma D.; Simmons, Craig A.; Janmey, Paul A.; McCulloch, Christopher A.

2015-01-01

The mechanical properties of extracellular matrix proteins strongly influence cell-induced tension in the matrix, which in turn influences cell function. Despite progress on the impact of elastic behaviour of matrix proteins on cell–matrix interactions, little is known about the influence of inelastic behaviour, especially at the large and slow deformations that characterize cell-induced matrix remodelling. We found that collagen matrices exhibit deformation rate-dependent behaviour, which leads to a transition from pronounced elastic behaviour at fast deformations to substantially inelastic behaviour at slow deformations (1 μm min−1, similar to cell-mediated deformation). With slow deformations, the inelastic behaviour of floating gels was sensitive to collagen concentration, whereas attached gels exhibited similar inelastic behaviour independent of collagen concentration. The presence of an underlying rigid support had a similar effect on cell–matrix interactions: cell-induced deformation and remodelling were similar on 1 or 3 mg ml−1 attached collagen gels while deformations were two- to fourfold smaller in floating gels of high compared with low collagen concentration. In cross-linked collagen matrices, which did not exhibit inelastic behaviour, cells did not respond to the presence of the underlying rigid foundation. These data indicate that at the slow rates of collagen compaction generated by fibroblasts, the inelastic responses of collagen gels, which are influenced by collagen concentration and the presence of an underlying rigid foundation, are important determinants of cell–matrix interactions and mechanosensation. PMID:25392399

Modulation and control of matrix converter for aerospace application

NASA Astrophysics Data System (ADS)

Kobravi, Keyhan

In the context of modern aircraft systems, a major challenge is power conversion to supply the aircraft's electrical instruments. These instruments are energized through a fixed-frequency internal power grid. In an aircraft, the available sources of energy are a set of variable-speed generators which provide variable-frequency ac voltages. Therefore, to energize the internal power grid of an aircraft, the variable-frequency ac voltages should be converted to a fixed-frequency ac voltage. As a result, an ac to ac power conversion is required within an aircraft's power system. This thesis develops a Matrix Converter to energize the aircraft's internal power grid. The Matrix Converter provides a direct ac to ac power conversion. A major challenge of designing Matrix Converters for aerospace applications is to minimize the volume and weight of the converter. These parameters are minimized by increasing the switching frequency of the converter. To design a Matrix Converter operating at a high switching frequency, this thesis (i) develops a scheme to integrate fast semiconductor switches within the current available Matrix Converter topologies, i.e., MOSFET-based Matrix Converter, and (ii) develops a new modulation strategy for the Matrix Converter. This Matrix Converter and the new modulation strategy enables the operation of the converter at a switching-frequency of 40kHz. To provide a reliable source of energy, this thesis also develops a new methodology for robust control of Matrix Converter. To verify the performance of the proposed MOSFET-based Matrix Converter, modulation strategy, and control design methodology, various simulation and experimental results are presented. The experimental results are obtained under operating condition present in an aircraft. The experimental results verify the proposed Matrix Converter provides a reliable power conversion in an aircraft under extreme operating conditions. The results prove the superiority of the proposed Matrix Converter technology for ac to ac power conversion regarding the existing technologies of Matrix Converters.

The Use of Matrix Training to Promote Generative Language with Children with Autism

ERIC Educational Resources Information Center

Frampton, Sarah E.; Wymer, Sarah C.; Hansen, Bethany; Shillingsburg, M. Alice

2016-01-01

Matrix training consists of planning instruction by arranging components of desired skills across 2 axes. After training with diagonal targets that each combine 2 unique skill components, responses to nondiagonal targets, consisting of novel combinations of the components, may emerge. A multiple-probe design across participants was used to…

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.

Silicon carbide/calcium aluminosilicate: A notch-insensitive ceramic-matrix composite

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

Cady, C.M.; Mackin, T.J.; Evans, A.G.

Tension experiments performed on a 0/90 laminated silicon carbide/calcium aluminosilicate composite at room temperature establish that this material is notch insensitive. Multiple matrix cracking is determined to be the stress redistribution mechanism. This mechanism is found to provide a particularly efficient means for creating local inelastic strains, which eliminate stress concentrations.

Effect of processing on recovery and variability associated with immunochemical analytical methods for multiple allergens in a single matrix: sugar cookies.

PubMed

Khuda, Sefat; Slate, Andrew; Pereira, Marion; Al-Taher, Fadwa; Jackson, Lauren; Diaz-Amigo, Carmen; Bigley, Elmer C; Whitaker, Thomas; Williams, Kristina M

2012-05-02

Among the major food allergies, peanut, egg, and milk are the most common. The immunochemical detection of food allergens depends on various factors, such as the food matrix and processing method, which can affect allergen conformation and extractability. This study aimed to (1) develop matrix-specific incurred reference materials for allergen testing, (2) determine whether multiple allergens in the same model food can be simultaneously detected, and (3) establish the effect of processing on reference material stability and allergen detection. Defatted peanut flour, whole egg powder, and spray-dried milk were added to cookie dough at seven incurred levels before baking. Allergens were measured using five commercial enzyme-linked immunosorbent assay (ELISA) kits. All kits showed decreased recovery of all allergens after baking. Analytical coefficients of variation for most kits increased with baking time, but decreased with incurred allergen level. Thus, food processing negatively affects the recovery and variability of peanut, egg, and milk detection in a sugar cookie matrix when using immunochemical methods.

Synchronized and sustained release of multiple components in silymarin from erodible glyceryl monostearate matrix system.

PubMed

Lu, Cheng; Lu, Yi; Chen, Jian; Zhang, Wentong; Wu, Wei

2007-05-01

Development of sustained delivery systems for herbal medicines was very difficult because of their complexity in composition. The concept of synchronized release from sustained release systems, which is characterized by release of multiple components in their original ratio that defines a herbal medicine, served as the basis for keeping the original pharmacological activity. In this study, erodible matrix systems based on glyceryl monostearate and polyethylene glycol 6000 or poloxamer 188 were prepared to perform strict control on synchronized release of the five active components of silymarin, i.e. taxifolin, silychrystin, silydianin, isosilybin and silybin. The matrix system was prepared by a melt fusion method. Synchronized release was achieved with high similarity factor f(2) values between each two of the five components. Erosion profiles of the matrix were in good correlation with release profiles of the five components, showing erosion-controlled release mechanisms. Through tuning some of the formulation variables, the system can be adjusted for synchronized and sustained release of silymarin for oral administration. In vitro hemolysis study indicated that the synchronized release samples showed a much better stabilizing effect on erythrocyte membrane.

Improvement of structural models using covariance analysis and nonlinear generalized least squares

NASA Technical Reports Server (NTRS)

Glaser, R. J.; Kuo, C. P.; Wada, B. K.

1992-01-01

The next generation of large, flexible space structures will be too light to support their own weight, requiring a system of structural supports for ground testing. The authors have proposed multiple boundary-condition testing (MBCT), using more than one support condition to reduce uncertainties associated with the supports. MBCT would revise the mass and stiffness matrix, analytically qualifying the structure for operation in space. The same procedure is applicable to other common test conditions, such as empty/loaded tanks and subsystem/system level tests. This paper examines three techniques for constructing the covariance matrix required by nonlinear generalized least squares (NGLS) to update structural models based on modal test data. The methods range from a complicated approach used to generate the simulation data (i.e., the correct answer) to a diagonal matrix based on only two constants. The results show that NGLS is very insensitive to assumptions about the covariance matrix, suggesting that a workable NGLS procedure is possible. The examples also indicate that the multiple boundary condition procedure more accurately reduces errors than individual boundary condition tests alone.

Real-time tracking and fast retrieval of persons in multiple surveillance cameras of a shopping mall

NASA Astrophysics Data System (ADS)

Bouma, Henri; Baan, Jan; Landsmeer, Sander; Kruszynski, Chris; van Antwerpen, Gert; Dijk, Judith

2013-05-01

The capability to track individuals in CCTV cameras is important for e.g. surveillance applications at large areas such as train stations, airports and shopping centers. However, it is laborious to track and trace people over multiple cameras. In this paper, we present a system for real-time tracking and fast interactive retrieval of persons in video streams from multiple static surveillance cameras. This system is demonstrated in a shopping mall, where the cameras are positioned without overlapping fields-of-view and have different lighting conditions. The results show that the system allows an operator to find the origin or destination of a person more efficiently. The misses are reduced with 37%, which is a significant improvement.

Computing the Density Matrix in Electronic Structure Theory on Graphics Processing Units.

PubMed

Cawkwell, M J; Sanville, E J; Mniszewski, S M; Niklasson, Anders M N

2012-11-13

The self-consistent solution of a Schrödinger-like equation for the density matrix is a critical and computationally demanding step in quantum-based models of interatomic bonding. This step was tackled historically via the diagonalization of the Hamiltonian. We have investigated the performance and accuracy of the second-order spectral projection (SP2) algorithm for the computation of the density matrix via a recursive expansion of the Fermi operator in a series of generalized matrix-matrix multiplications. We demonstrate that owing to its simplicity, the SP2 algorithm [Niklasson, A. M. N. Phys. Rev. B2002, 66, 155115] is exceptionally well suited to implementation on graphics processing units (GPUs). The performance in double and single precision arithmetic of a hybrid GPU/central processing unit (CPU) and full GPU implementation of the SP2 algorithm exceed those of a CPU-only implementation of the SP2 algorithm and traditional matrix diagonalization when the dimensions of the matrices exceed about 2000 × 2000. Padding schemes for arrays allocated in the GPU memory that optimize the performance of the CUBLAS implementations of the level 3 BLAS DGEMM and SGEMM subroutines for generalized matrix-matrix multiplications are described in detail. The analysis of the relative performance of the hybrid CPU/GPU and full GPU implementations indicate that the transfer of arrays between the GPU and CPU constitutes only a small fraction of the total computation time. The errors measured in the self-consistent density matrices computed using the SP2 algorithm are generally smaller than those measured in matrices computed via diagonalization. Furthermore, the errors in the density matrices computed using the SP2 algorithm do not exhibit any dependence of system size, whereas the errors increase linearly with the number of orbitals when diagonalization is employed.

A GPU-accelerated semi-implicit fractional-step method for numerical solutions of incompressible Navier-Stokes equations

NASA Astrophysics Data System (ADS)

Ha, Sanghyun; Park, Junshin; You, Donghyun

2018-01-01

Utility of the computational power of Graphics Processing Units (GPUs) is elaborated for solutions of incompressible Navier-Stokes equations which are integrated using a semi-implicit fractional-step method. The Alternating Direction Implicit (ADI) and the Fourier-transform-based direct solution methods used in the semi-implicit fractional-step method take advantage of multiple tridiagonal matrices whose inversion is known as the major bottleneck for acceleration on a typical multi-core machine. A novel implementation of the semi-implicit fractional-step method designed for GPU acceleration of the incompressible Navier-Stokes equations is presented. Aspects of the programing model of Compute Unified Device Architecture (CUDA), which are critical to the bandwidth-bound nature of the present method are discussed in detail. A data layout for efficient use of CUDA libraries is proposed for acceleration of tridiagonal matrix inversion and fast Fourier transform. OpenMP is employed for concurrent collection of turbulence statistics on a CPU while the Navier-Stokes equations are computed on a GPU. Performance of the present method using CUDA is assessed by comparing the speed of solving three tridiagonal matrices using ADI with the speed of solving one heptadiagonal matrix using a conjugate gradient method. An overall speedup of 20 times is achieved using a Tesla K40 GPU in comparison with a single-core Xeon E5-2660 v3 CPU in simulations of turbulent boundary-layer flow over a flat plate conducted on over 134 million grids. Enhanced performance of 48 times speedup is reached for the same problem using a Tesla P100 GPU.

The ectoenzyme-side of matrix metalloproteinases (MMPs) makes inflammation by serum amyloid A (SAA) and chemokines go round.

PubMed

De Buck, Mieke; Gouwy, Mieke; Struyf, Sofie; Opdenakker, Ghislain; Van Damme, Jo

2018-06-02

During an inflammatory response, a large number of distinct mediators appears in the affected tissues or in the blood circulation. These include acute phase proteins such as serum amyloid A (SAA), cytokines and chemokines and proteolytic enzymes. Although these molecules are generated within a cascade sequence in specific body compartments allowing for independent action, their co-appearance in space and time during acute or chronic inflammation points toward important mutual interactions. Pathogen-associated molecular patterns lead to fast induction of the pro-inflammatory endogenous pyrogens, which are evoking the acute phase response. Interleukin-1, tumor necrosis factor-α and interferons simultaneously trigger different cell types, including leukocytes, endothelial cells and fibroblasts for tissue-specific or systemic production of chemokines and matrix metalloproteinases (MMPs). In addition, SAA induces chemokines and both stimulate secretion of MMPs from multiple cell types. As a consequence, these mediators may cooperate to enhance the inflammatory response. Indeed, SAA synergizes with chemokines to increase chemoattraction of monocytes and granulocytes. On the other hand, MMPs post-translationally modify chemokines and SAA to reduce their activity. Indeed, MMPs internally cleave SAA with loss of its cytokine-inducing and direct chemotactic potential whilst retaining its capacity to synergize with chemokines in leukocyte migration. Finally, MMPs truncate chemokines at their NH 2 - or COOH-terminal end, resulting in reduced or enhanced chemotactic activity. Therefore, the complex interactions between chemokines, SAA and MMPs either maintain or dampen the inflammatory response. Copyright © 2018. Published by Elsevier B.V.