Review: The state-of-art of sparse channel models and their applicability to performance assessment of radioactive waste repositories in fractured crystalline formations

NASA Astrophysics Data System (ADS)

Figueiredo, Bruno; Tsang, Chin-Fu; Niemi, Auli; Lindgren, Georg

2016-11-01

Laboratory and field experiments done on fractured rock show that flow and solute transport often occur along flow channels. `Sparse channels' refers to the case where these channels are characterised by flow in long flow paths separated from each other by large spacings relative to the size of flow domain. A literature study is presented that brings together information useful to assess whether a sparse-channel network concept is an appropriate representation of the flow system in tight fractured rock of low transmissivity, such as that around a nuclear waste repository in deep crystalline rocks. A number of observations are made in this review. First, conventional fracture network models may lead to inaccurate results for flow and solute transport in tight fractured rocks. Secondly, a flow dimension of 1, as determined by the analysis of pressure data in well testing, may be indicative of channelised flow, but such interpretation is not unique or definitive. Thirdly, in sparse channels, the percolation may be more influenced by the fracture shape than the fracture size and orientation but further studies are needed. Fourthly, the migration of radionuclides from a waste canister in a repository to the biosphere may be strongly influenced by the type of model used (e.g. discrete fracture network, channel model). Fifthly, the determination of appropriateness of representing an in situ flow system by a sparse-channel network model needs parameters usually neglected in site characterisation, such as the density of channels or fracture intersections.

Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and Navigation Support

DTIC Science & Technology

2014-09-30

underwater acoustic communication technologies for autonomous distributed underwater networks , through innovative signal processing, coding, and...4. TITLE AND SUBTITLE Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and...coding: 3) OFDM modulated dynamic coded cooperation in underwater acoustic channels; 3 Localization, Networking , and Testbed: 4) On-demand

Spatially Correlated Sparse MIMO Channel Path Delay Estimation in Scattering Environments Based on Signal Subspace Tracking

PubMed Central

Chargé, Pascal; Bazzi, Oussama; Ding, Yuehua

2018-01-01

A parametric scheme for spatially correlated sparse multiple-input multiple-output (MIMO) channel path delay estimation in scattering environments is presented in this paper. In MIMO outdoor communication scenarios, channel impulse responses (CIRs) of different transmit–receive antenna pairs are often supposed to be sparse due to a few significant scatterers, and share a common sparse pattern, such that path delays are assumed to be equal for every transmit–receive antenna pair. In some existing works, an exact common support condition is exploited, where the path delays are considered equal for every transmit–receive antenna pair, meanwhile ignoring the influence of scattering. A more realistic channel model is proposed in this paper, where due to scatterers in the environment, the received signals are modeled as clusters of multi-rays around a nominal or mean time delay at different antenna elements, resulting in a non-strictly exact common support phenomenon. A method for estimating the channel mean path delays is then derived based on the subspace approach, and the tracking of the effective dimension of the signal subspace that changes due to the wireless environment. The proposed method shows an improved channel mean path delays estimation performance in comparison with the conventional estimation methods. PMID:29734797

Spatially Correlated Sparse MIMO Channel Path Delay Estimation in Scattering Environments Based on Signal Subspace Tracking.

PubMed

Mohydeen, Ali; Chargé, Pascal; Wang, Yide; Bazzi, Oussama; Ding, Yuehua

2018-05-06

A parametric scheme for spatially correlated sparse multiple-input multiple-output (MIMO) channel path delay estimation in scattering environments is presented in this paper. In MIMO outdoor communication scenarios, channel impulse responses (CIRs) of different transmit⁻receive antenna pairs are often supposed to be sparse due to a few significant scatterers, and share a common sparse pattern, such that path delays are assumed to be equal for every transmit⁻receive antenna pair. In some existing works, an exact common support condition is exploited, where the path delays are considered equal for every transmit⁻receive antenna pair, meanwhile ignoring the influence of scattering. A more realistic channel model is proposed in this paper, where due to scatterers in the environment, the received signals are modeled as clusters of multi-rays around a nominal or mean time delay at different antenna elements, resulting in a non-strictly exact common support phenomenon. A method for estimating the channel mean path delays is then derived based on the subspace approach, and the tracking of the effective dimension of the signal subspace that changes due to the wireless environment. The proposed method shows an improved channel mean path delays estimation performance in comparison with the conventional estimation methods.

Intercomparison of two BRDF models in the estimation of the directional emissivity in MIR channel from MSG1-SEVIRI data.

PubMed

Jiang, Geng-Ming; Li, Zhao-Liang

2008-11-10

This work intercompared two Bi-directional Reflectance Distribution Function (BRDF) models, the modified Minnaert's model and the RossThick-LiSparse-R model, in the estimation of the directional emissivity in Middle Infra-Red (MIR) channel from the data acquired by the Spinning Enhanced Visible and Infra-Red Imager (SEVIRI) onboard the first Meteosat Second Generation (MSG1). The bi-directional reflectances in SEVIRI channel 4 (3.9 microm) were estimated from the combined MIR and Thermal Infra-Red (TIR) data and then were used to estimate the directional emissivity in this channel with aid of the BRDF models. The results show that: (1) Both models can relatively well describe the non-Lambertian reflective behavior of land surfaces in SEVIRI channel 4; (2) The RossThick-LiSparse-R model is better than the modified Minnaert's model in modeling the bi-directional reflectances, and the directional emissivities modeled by the modified Minnaert's model are always lower than the ones obtained by the RossThick-LiSparse-R model with averaged emissivity differences of approximately 0.01 and approximately 0.04 over the vegetated and bare areas, respectively. The use of the RossThick-LiSparse-R model in the estimation of the directional emissivity in MIR channel is recommended.

A new EEG synchronization strength analysis method: S-estimator based normalized weighted-permutation mutual information.

PubMed

Cui, Dong; Pu, Weiting; Liu, Jing; Bian, Zhijie; Li, Qiuli; Wang, Lei; Gu, Guanghua

2016-10-01

Synchronization is an important mechanism for understanding information processing in normal or abnormal brains. In this paper, we propose a new method called normalized weighted-permutation mutual information (NWPMI) for double variable signal synchronization analysis and combine NWPMI with S-estimator measure to generate a new method named S-estimator based normalized weighted-permutation mutual information (SNWPMI) for analyzing multi-channel electroencephalographic (EEG) synchronization strength. The performances including the effects of time delay, embedding dimension, coupling coefficients, signal to noise ratios (SNRs) and data length of the NWPMI are evaluated by using Coupled Henon mapping model. The results show that the NWPMI is superior in describing the synchronization compared with the normalized permutation mutual information (NPMI). Furthermore, the proposed SNWPMI method is applied to analyze scalp EEG data from 26 amnestic mild cognitive impairment (aMCI) subjects and 20 age-matched controls with normal cognitive function, who both suffer from type 2 diabetes mellitus (T2DM). The proposed methods NWPMI and SNWPMI are suggested to be an effective index to estimate the synchronization strength. Copyright © 2016 Elsevier Ltd. All rights reserved.

Capacity of the Generalized Pulse-Position Modulation Channel

NASA Technical Reports Server (NTRS)

Hamkins, J.; Klimesh, M.; McElience, R.; Moision, B.

2005-01-01

We show the capacity of a generalized pulse-position modulation (PPM) channel, where the input vectors may be any set that allows a transitive group of coordinate permutations, is achieved by a uniform input distribution. We derive a simple expression in terms of the Kullback Leibler distance for the binary case, and the asymptote in the PPM order. We prove a sub-additivity result for the PPM channel and use it to show PPM capacity is monotonic in the order.

Brain Computation Is Organized via Power-of-Two-Based Permutation Logic.

PubMed

Xie, Kun; Fox, Grace E; Liu, Jun; Lyu, Cheng; Lee, Jason C; Kuang, Hui; Jacobs, Stephanie; Li, Meng; Liu, Tianming; Song, Sen; Tsien, Joe Z

2016-01-01

There is considerable scientific interest in understanding how cell assemblies-the long-presumed computational motif-are organized so that the brain can generate intelligent cognition and flexible behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic ( N = 2 i -1), producing specific-to-general cell-assembly architecture capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based permutation logic is widely used in cortical and subcortical circuits across animal species and is conserved for the processing of a variety of cognitive modalities including appetitive, emotional and social information. However, modulatory neurons, such as dopaminergic (DA) neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact although NMDA receptors-the synaptic switch for learning and memory-were deleted throughout adulthood, suggesting that the logic is developmentally pre-configured. Moreover, this computational logic is implemented in the cortex via combining a random-connectivity strategy in superficial layers 2/3 with nonrandom organizations in deep layers 5/6. This randomness of layers 2/3 cliques-which preferentially encode specific and low-combinatorial features and project inter-cortically-is ideal for maximizing cross-modality novel pattern-extraction, pattern-discrimination and pattern-categorization using sparse code, consequently explaining why it requires hippocampal offline-consolidation. In contrast, the nonrandomness in layers 5/6-which consists of few specific cliques but a higher portion of more general cliques projecting mostly to subcortical systems-is ideal for feedback-control of motivation, emotion, consciousness and behaviors. These observations suggest that the brain's basic computational algorithm is indeed organized by the power-of-two-based permutation logic. This simple mathematical logic can account for brain computation across the entire evolutionary spectrum, ranging from the simplest neural networks to the most complex.

Brain Computation Is Organized via Power-of-Two-Based Permutation Logic

PubMed Central

Xie, Kun; Fox, Grace E.; Liu, Jun; Lyu, Cheng; Lee, Jason C.; Kuang, Hui; Jacobs, Stephanie; Li, Meng; Liu, Tianming; Song, Sen; Tsien, Joe Z.

2016-01-01

There is considerable scientific interest in understanding how cell assemblies—the long-presumed computational motif—are organized so that the brain can generate intelligent cognition and flexible behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic (N = 2i–1), producing specific-to-general cell-assembly architecture capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based permutation logic is widely used in cortical and subcortical circuits across animal species and is conserved for the processing of a variety of cognitive modalities including appetitive, emotional and social information. However, modulatory neurons, such as dopaminergic (DA) neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact although NMDA receptors—the synaptic switch for learning and memory—were deleted throughout adulthood, suggesting that the logic is developmentally pre-configured. Moreover, this computational logic is implemented in the cortex via combining a random-connectivity strategy in superficial layers 2/3 with nonrandom organizations in deep layers 5/6. This randomness of layers 2/3 cliques—which preferentially encode specific and low-combinatorial features and project inter-cortically—is ideal for maximizing cross-modality novel pattern-extraction, pattern-discrimination and pattern-categorization using sparse code, consequently explaining why it requires hippocampal offline-consolidation. In contrast, the nonrandomness in layers 5/6—which consists of few specific cliques but a higher portion of more general cliques projecting mostly to subcortical systems—is ideal for feedback-control of motivation, emotion, consciousness and behaviors. These observations suggest that the brain’s basic computational algorithm is indeed organized by the power-of-two-based permutation logic. This simple mathematical logic can account for brain computation across the entire evolutionary spectrum, ranging from the simplest neural networks to the most complex. PMID:27895562

Rank score and permutation testing alternatives for regression quantile estimates

USGS Publications Warehouse

Cade, B.S.; Richards, J.D.; Mielke, P.W.

2006-01-01

Performance of quantile rank score tests used for hypothesis testing and constructing confidence intervals for linear quantile regression estimates (0 ≤ τ ≤ 1) were evaluated by simulation for models with p = 2 and 6 predictors, moderate collinearity among predictors, homogeneous and hetero-geneous errors, small to moderate samples (n = 20–300), and central to upper quantiles (0.50–0.99). Test statistics evaluated were the conventional quantile rank score T statistic distributed as χ2 random variable with q degrees of freedom (where q parameters are constrained by H 0:) and an F statistic with its sampling distribution approximated by permutation. The permutation F-test maintained better Type I errors than the T-test for homogeneous error models with smaller n and more extreme quantiles τ. An F distributional approximation of the F statistic provided some improvements in Type I errors over the T-test for models with > 2 parameters, smaller n, and more extreme quantiles but not as much improvement as the permutation approximation. Both rank score tests required weighting to maintain correct Type I errors when heterogeneity under the alternative model increased to 5 standard deviations across the domain of X. A double permutation procedure was developed to provide valid Type I errors for the permutation F-test when null models were forced through the origin. Power was similar for conditions where both T- and F-tests maintained correct Type I errors but the F-test provided some power at smaller n and extreme quantiles when the T-test had no power because of excessively conservative Type I errors. When the double permutation scheme was required for the permutation F-test to maintain valid Type I errors, power was less than for the T-test with decreasing sample size and increasing quantiles. Confidence intervals on parameters and tolerance intervals for future predictions were constructed based on test inversion for an example application relating trout densities to stream channel width:depth.

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

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

Reducible boundary conditions in coupled channels

NASA Astrophysics Data System (ADS)

Pankrashkin, Konstantin

2005-10-01

We study Hamiltonians with point interactions in spaces of vector-valued functions. Using some information from the theory of quantum graphs, we describe a class of the operators which can be reduced to the direct sum of several one-dimensional problems. It shown that such a reduction is closely connected with the invariance under channel permutations. Examples are provided by some 'model' interactions, in particular, the so-called δ, δ' and the Kirchhoff couplings.

International Symposium on Information Theory Held in San Diego, California on 14-19 January 1990: Abstracts of Papers

DTIC Science & Technology

1990-01-01

intrinsic side information generated by an appropriate coding scheme . In this paper, we give sufficient conditions on channel classes for which a... zero redundancy case can be generalized to include the use of block channel coding of the permuted indices. An effective design method is introduced for...M. Naidjate, and C. R. P. Hartmann Boston University, College of Engineering, 44 Cummington Street, Boston, MA 02215 A generalization of the zero

Experimental Assessment of Different Receiver Structures for Underwater Acoustic Communications over Multipath Channels

PubMed Central

Zhang, Guosong; Hovem, Jens M.; Dong, Hefeng

2012-01-01

Underwater communication channels are often complicated, and in particular multipath propagation may cause intersymbol interference (ISI). This paper addresses how to remove ISI, and evaluates the performance of three different receiver structures and their implementations. Using real data collected in a high-frequency (10–14 kHz) field experiment, the receiver structures are evaluated by off-line data processing. The three structures are multichannel decision feedback equalizer (DFE), passive time reversal receiver (passive-phase conjugation (PPC) with a single channel DFE), and the joint PPC with multichannel DFE. In sparse channels, dominant arrivals represent the channel information, and the matching pursuit (MP) algorithm which exploits the channel sparseness has been investigated for PPC processing. In the assessment, it is found that: (1) it is advantageous to obtain spatial gain using the adaptive multichannel combining scheme; and (2) the MP algorithm improves the performance of communications using PPC processing. PMID:22438755

Interconnection networks

DOEpatents

Faber, V.; Moore, J.W.

1988-06-20

A network of interconnected processors is formed from a vertex symmetric graph selected from graphs GAMMA/sub d/(k) with degree d, diameter k, and (d + 1)exclamation/ (d /minus/ k + 1)exclamation processors for each d greater than or equal to k and GAMMA/sub d/(k, /minus/1) with degree d /minus/ 1, diameter k + 1, and (d + 1)exclamation/(d /minus/ k + 1)exclamation processors for each d greater than or equal to k greater than or equal to 4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, where each processor has one less channel than the selected number of letters forming the sequence. Where a network GAMMA/sub d/(k, /minus/1) is provided, no processor has a channel connected to form an edge in a direction delta/sub 1/. Each of the channels has an identification number selected from the sequence of letters and connected from a first processor having a first extended address to a second processor having a second address formed from a second extended address defined by moving to the front of the first extended address the letter found in the position within the first extended address defined by the channel identification number. The second address is then formed by selecting the first elements of the second extended address corresponding to the selected number used to form the address permutations. 9 figs.

Bandwidth efficient channel estimation method for airborne hyperspectral data transmission in sparse doubly selective communication channels

NASA Astrophysics Data System (ADS)

Vahidi, Vahid; Saberinia, Ebrahim; Regentova, Emma E.

2017-10-01

A channel estimation (CE) method based on compressed sensing (CS) is proposed to estimate the sparse and doubly selective (DS) channel for hyperspectral image transmission from unmanned aircraft vehicles to ground stations. The proposed method contains three steps: (1) the priori estimate of the channel by orthogonal matching pursuit (OMP), (2) calculation of the linear minimum mean square error (LMMSE) estimate of the received pilots given the estimated channel, and (3) estimate of the complex amplitudes and Doppler shifts of the channel using the enhanced received pilot data applying a second round of a CS algorithm. The proposed method is named DS-LMMSE-OMP, and its performance is evaluated by simulating transmission of AVIRIS hyperspectral data via the communication channel and assessing their fidelity for the automated analysis after demodulation. The performance of the DS-LMMSE-OMP approach is compared with that of two other state-of-the-art CE methods. The simulation results exhibit up to 8-dB figure of merit in the bit error rate and 50% improvement in the hyperspectral image classification accuracy.

Optimal parallel solution of sparse triangular systems

NASA Technical Reports Server (NTRS)

Alvarado, Fernando L.; Schreiber, Robert

1990-01-01

A method for the parallel solution of triangular sets of equations is described that is appropriate when there are many right-handed sides. By preprocessing, the method can reduce the number of parallel steps required to solve Lx = b compared to parallel forward or backsolve. Applications are to iterative solvers with triangular preconditioners, to structural analysis, or to power systems applications, where there may be many right-handed sides (not all available a priori). The inverse of L is represented as a product of sparse triangular factors. The problem is to find a factored representation of this inverse of L with the smallest number of factors (or partitions), subject to the requirement that no new nonzero elements be created in the formation of these inverse factors. A method from an earlier reference is shown to solve this problem. This method is improved upon by constructing a permutation of the rows and columns of L that preserves triangularity and allow for the best possible such partition. A number of practical examples and algorithmic details are presented. The parallelism attainable is illustrated by means of elimination trees and clique trees.

Optimized OFDM Transmission of Encrypted Image Over Fading Channel

NASA Astrophysics Data System (ADS)

Eldin, Salwa M. Serag

2014-11-01

This paper compares the quality of diffusion-based and permutation-based encrypted image transmission using orthogonal frequency division multiplexing (OFDM) over wireless fading channel. Sensitivity to carrier frequency offsets (CFOs) is one of the limitations in OFDM transmission that was compensated here. Different OFDM diffusions are investigated to study encrypted image transmission optimization. Peak signal-to-noise ratio between the original image and the decrypted image is used to evaluate the received image quality. Chaotic encrypted image modulated with CFOs compensated FFT-OFDM was found to give outstanding performance against other encryption and modulation techniques.

Multi-channel feature dictionaries for RGB-D object recognition

NASA Astrophysics Data System (ADS)

Lan, Xiaodong; Li, Qiming; Chong, Mina; Song, Jian; Li, Jun

2018-04-01

Hierarchical matching pursuit (HMP) is a popular feature learning method for RGB-D object recognition. However, the feature representation with only one dictionary for RGB channels in HMP does not capture sufficient visual information. In this paper, we propose multi-channel feature dictionaries based feature learning method for RGB-D object recognition. The process of feature extraction in the proposed method consists of two layers. The K-SVD algorithm is used to learn dictionaries in sparse coding of these two layers. In the first-layer, we obtain features by performing max pooling on sparse codes of pixels in a cell. And the obtained features of cells in a patch are concatenated to generate patch jointly features. Then, patch jointly features in the first-layer are used to learn the dictionary and sparse codes in the second-layer. Finally, spatial pyramid pooling can be applied to the patch jointly features of any layer to generate the final object features in our method. Experimental results show that our method with first or second-layer features can obtain a comparable or better performance than some published state-of-the-art methods.

Joint sparse coding based spatial pyramid matching for classification of color medical image.

PubMed

Shi, Jun; Li, Yi; Zhu, Jie; Sun, Haojie; Cai, Yin

2015-04-01

Although color medical images are important in clinical practice, they are usually converted to grayscale for further processing in pattern recognition, resulting in loss of rich color information. The sparse coding based linear spatial pyramid matching (ScSPM) and its variants are popular for grayscale image classification, but cannot extract color information. In this paper, we propose a joint sparse coding based SPM (JScSPM) method for the classification of color medical images. A joint dictionary can represent both the color information in each color channel and the correlation between channels. Consequently, the joint sparse codes calculated from a joint dictionary can carry color information, and therefore this method can easily transform a feature descriptor originally designed for grayscale images to a color descriptor. A color hepatocellular carcinoma histological image dataset was used to evaluate the performance of the proposed JScSPM algorithm. Experimental results show that JScSPM provides significant improvements as compared with the majority voting based ScSPM and the original ScSPM for color medical image classification. Copyright © 2014 Elsevier Ltd. All rights reserved.

Polarization-independent tunable spectral slicing filter in Ti:LiNbO3.

PubMed

Rabelo, Renato C; Eknoyan, Ohannes; Taylor, Henry F

2011-02-01

A two-port polarization-independent tunable spectral slicing filter at the 1530 nm wavelength regime is presented. The design utilizes an asymmetric interferometer with a sparse index grating along its arms. The sparse grating makes it possible to select equally spaced frequency channels from an incident WDM signal and to place nulls between them to coincide with the signal comb frequency. The number of selected channels and nulls between them depends on the number of coupling regions used in the sparse grating. The free spectral range depends on the spacing between the coupling regions. The Z-transform method is used to synthesize the filter and determine the spectral response. The operation of a device with six coupling regions is demonstrated, and good agreement with theoretical predictions is obtained. A 3 dB bandwidth of ∼1 nm and thermal tuning over a range of ∼13 nm are measured.

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

PubMed

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

2015-11-01

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

Harnessing data structure for recovery of randomly missing structural vibration responses time history: Sparse representation versus low-rank structure

NASA Astrophysics Data System (ADS)

Yang, Yongchao; Nagarajaiah, Satish

2016-06-01

Randomly missing data of structural vibration responses time history often occurs in structural dynamics and health monitoring. For example, structural vibration responses are often corrupted by outliers or erroneous measurements due to sensor malfunction; in wireless sensing platforms, data loss during wireless communication is a common issue. Besides, to alleviate the wireless data sampling or communication burden, certain accounts of data are often discarded during sampling or before transmission. In these and other applications, recovery of the randomly missing structural vibration responses from the available, incomplete data, is essential for system identification and structural health monitoring; it is an ill-posed inverse problem, however. This paper explicitly harnesses the data structure itself-of the structural vibration responses-to address this (inverse) problem. What is relevant is an empirical, but often practically true, observation, that is, typically there are only few modes active in the structural vibration responses; hence a sparse representation (in frequency domain) of the single-channel data vector, or, a low-rank structure (by singular value decomposition) of the multi-channel data matrix. Exploiting such prior knowledge of data structure (intra-channel sparse or inter-channel low-rank), the new theories of ℓ1-minimization sparse recovery and nuclear-norm-minimization low-rank matrix completion enable recovery of the randomly missing or corrupted structural vibration response data. The performance of these two alternatives, in terms of recovery accuracy and computational time under different data missing rates, is investigated on a few structural vibration response data sets-the seismic responses of the super high-rise Canton Tower and the structural health monitoring accelerations of a real large-scale cable-stayed bridge. Encouraging results are obtained and the applicability and limitation of the presented methods are discussed.

The exact analysis of contingency tables in medical research.

PubMed

Mehta, C R

1994-01-01

A unified view of exact nonparametric inference, with special emphasis on data in the form of contingency tables, is presented. While the concept of exact tests has been in existence since the early work of RA Fisher, the computational complexity involved in actually executing such tests precluded their use until fairly recently. Modern algorithmic advances, combined with the easy availability of inexpensive computing power, has renewed interest in exact methods of inference, especially because they remain valid in the face of small, sparse, imbalanced, or heavily tied data. After defining exact p-values in terms of the permutation principle, we reference algorithms for computing them. Several data sets are then analysed by both exact and asymptotic methods. We end with a discussion of the available software.

Array signal recovery algorithm for a single-RF-channel DBF array

NASA Astrophysics Data System (ADS)

Zhang, Duo; Wu, Wen; Fang, Da Gang

2016-12-01

An array signal recovery algorithm based on sparse signal reconstruction theory is proposed for a single-RF-channel digital beamforming (DBF) array. A single-RF-channel antenna array is a low-cost antenna array in which signals are obtained from all antenna elements by only one microwave digital receiver. The spatially parallel array signals are converted into time-sequence signals, which are then sampled by the system. The proposed algorithm uses these time-sequence samples to recover the original parallel array signals by exploiting the second-order sparse structure of the array signals. Additionally, an optimization method based on the artificial bee colony (ABC) algorithm is proposed to improve the reconstruction performance. Using the proposed algorithm, the motion compensation problem for the single-RF-channel DBF array can be solved effectively, and the angle and Doppler information for the target can be simultaneously estimated. The effectiveness of the proposed algorithms is demonstrated by the results of numerical simulations.

Effective channel estimation and efficient symbol detection for multi-input multi-output underwater acoustic communications

NASA Astrophysics Data System (ADS)

Ling, Jun

Achieving reliable underwater acoustic communications (UAC) has long been recognized as a challenging problem owing to the scarce bandwidth available and the reverberant spread in both time and frequency domains. To pursue high data rates, we consider a multi-input multi-output (MIMO) UAC system, and our focus is placed on two main issues regarding a MIMO UAC system: (1) channel estimation, which involves the design of the training sequences and the development of a reliable channel estimation algorithm, and (2) symbol detection, which requires interference cancelation schemes due to simultaneous transmission from multiple transducers. To enhance channel estimation performance, we present a cyclic approach for designing training sequences with good auto- and cross-correlation properties, and a channel estimation algorithm called the iterative adaptive approach (IAA). Sparse channel estimates can be obtained by combining IAA with the Bayesian information criterion (BIC). Moreover, we present sparse learning via iterative minimization (SLIM) and demonstrate that SLIM gives similar performance to IAA but at a much lower computational cost. Furthermore, an extension of the SLIM algorithm is introduced to estimate the sparse and frequency modulated acoustic channels. The extended algorithm is referred to as generalization of SLIM (GoSLIM). Regarding symbol detection, a linear minimum mean-squared error based detection scheme, called RELAX-BLAST, which is a combination of vertical Bell Labs layered space-time (V-BLAST) algorithm and the cyclic principle of the RELAX algorithm, is presented and it is shown that RELAX-BLAST outperforms V-BLAST. We show that RELAX-BLAST can be implemented efficiently by making use of the conjugate gradient method and diagonalization properties of circulant matrices. This fast implementation approach requires only simple fast Fourier transform operations and facilitates parallel implementations. The effectiveness of the proposed MIMO schemes is verified by both computer simulations and experimental results obtained by analyzing the measurements acquired in multiple in-water experiments.

iSAP: Interactive Sparse Astronomical Data Analysis Packages

NASA Astrophysics Data System (ADS)

Fourt, O.; Starck, J.-L.; Sureau, F.; Bobin, J.; Moudden, Y.; Abrial, P.; Schmitt, J.

2013-03-01

iSAP consists of three programs, written in IDL, which together are useful for spherical data analysis. MR/S (MultiResolution on the Sphere) contains routines for wavelet, ridgelet and curvelet transform on the sphere, and applications such denoising on the sphere using wavelets and/or curvelets, Gaussianity tests and Independent Component Analysis on the Sphere. MR/S has been designed for the PLANCK project, but can be used for many other applications. SparsePol (Polarized Spherical Wavelets and Curvelets) has routines for polarized wavelet, polarized ridgelet and polarized curvelet transform on the sphere, and applications such denoising on the sphere using wavelets and/or curvelets, Gaussianity tests and blind source separation on the Sphere. SparsePol has been designed for the PLANCK project. MS-VSTS (Multi-Scale Variance Stabilizing Transform on the Sphere), designed initially for the FERMI project, is useful for spherical mono-channel and multi-channel data analysis when the data are contaminated by a Poisson noise. It contains routines for wavelet/curvelet denoising, wavelet deconvolution, multichannel wavelet denoising and deconvolution.

Protograph LDPC Codes for the Erasure Channel

NASA Technical Reports Server (NTRS)

Pollara, Fabrizio; Dolinar, Samuel J.; Divsalar, Dariush

2006-01-01

This viewgraph presentation reviews the use of protograph Low Density Parity Check (LDPC) codes for erasure channels. A protograph is a Tanner graph with a relatively small number of nodes. A "copy-and-permute" operation can be applied to the protograph to obtain larger derived graphs of various sizes. For very high code rates and short block sizes, a low asymptotic threshold criterion is not the best approach to designing LDPC codes. Simple protographs with much regularity and low maximum node degrees appear to be the best choices Quantized-rateless protograph LDPC codes can be built by careful design of the protograph such that multiple puncturing patterns will still permit message passing decoding to proceed

Multi-focus image fusion and robust encryption algorithm based on compressive sensing

NASA Astrophysics Data System (ADS)

Xiao, Di; Wang, Lan; Xiang, Tao; Wang, Yong

2017-06-01

Multi-focus image fusion schemes have been studied in recent years. However, little work has been done in multi-focus image transmission security. This paper proposes a scheme that can reduce data transmission volume and resist various attacks. First, multi-focus image fusion based on wavelet decomposition can generate complete scene images and optimize the perception of the human eye. The fused images are sparsely represented with DCT and sampled with structurally random matrix (SRM), which reduces the data volume and realizes the initial encryption. Then the obtained measurements are further encrypted to resist noise and crop attack through combining permutation and diffusion stages. At the receiver, the cipher images can be jointly decrypted and reconstructed. Simulation results demonstrate the security and robustness of the proposed scheme.

A new scripting library for modeling flow and transport in fractured rock with channel networks

NASA Astrophysics Data System (ADS)

Dessirier, Benoît; Tsang, Chin-Fu; Niemi, Auli

2018-02-01

Deep crystalline bedrock formations are targeted to host spent nuclear fuel owing to their overall low permeability. They are however highly heterogeneous and only a few preferential paths pertaining to a small set of dominant rock fractures usually carry most of the flow or mass fluxes, a behavior known as channeling that needs to be accounted for in the performance assessment of repositories. Channel network models have been developed and used to investigate the effect of channeling. They are usually simpler than discrete fracture networks based on rock fracture mappings and rely on idealized full or sparsely populated lattices of channels. This study reexamines the fundamental parameter structure required to describe a channel network in terms of groundwater flow and solute transport, leading to an extended description suitable for unstructured arbitrary networks of channels. An implementation of this formalism in a Python scripting library is presented and released along with this article. A new algebraic multigrid preconditioner delivers a significant speedup in the flow solution step compared to previous channel network codes. 3D visualization is readily available for verification and interpretation of the results by exporting the results to an open and free dedicated software. The new code is applied to three example cases to verify its results on full uncorrelated lattices of channels, sparsely populated percolation lattices and to exemplify the use of unstructured networks to accommodate knowledge on local rock fractures.

Extending Differential Fault Analysis to Dynamic S-Box Advanced Encryption Standard Implementations

DTIC Science & Technology

2014-09-18

entropy . At the same time, researchers strive to enhance AES and mitigate these growing threats. This paper researches the extension of existing...the algorithm or use side channels to reduce entropy , such as Differential Fault Analysis (DFA). At the same time, continuing research strives to...the state matrix. The S-box is an 8-bit 16x16 table built from an affine transformation on multiplicative inverses which guarantees full permutation (S

Combining DCQGMP-Based Sparse Decomposition and MPDR Beamformer for Multi-Type Interferences Mitigation for GNSS Receivers.

PubMed

Guo, Qiang; Qi, Liangang

2017-04-10

In the coexistence of multiple types of interfering signals, the performance of interference suppression methods based on time and frequency domains is degraded seriously, and the technique using an antenna array requires a large enough size and huge hardware costs. To combat multi-type interferences better for GNSS receivers, this paper proposes a cascaded multi-type interferences mitigation method combining improved double chain quantum genetic matching pursuit (DCQGMP)-based sparse decomposition and an MPDR beamformer. The key idea behind the proposed method is that the multiple types of interfering signals can be excised by taking advantage of their sparse features in different domains. In the first stage, the single-tone (multi-tone) and linear chirp interfering signals are canceled by sparse decomposition according to their sparsity in the over-complete dictionary. In order to improve the timeliness of matching pursuit (MP)-based sparse decomposition, a DCQGMP is introduced by combining an improved double chain quantum genetic algorithm (DCQGA) and the MP algorithm, and the DCQGMP algorithm is extended to handle the multi-channel signals according to the correlation among the signals in different channels. In the second stage, the minimum power distortionless response (MPDR) beamformer is utilized to nullify the residuary interferences (e.g., wideband Gaussian noise interferences). Several simulation results show that the proposed method can not only improve the interference mitigation degree of freedom (DoF) of the array antenna, but also effectively deal with the interference arriving from the same direction with the GNSS signal, which can be sparse represented in the over-complete dictionary. Moreover, it does not bring serious distortions into the navigation signal.

Combining DCQGMP-Based Sparse Decomposition and MPDR Beamformer for Multi-Type Interferences Mitigation for GNSS Receivers

PubMed Central

Guo, Qiang; Qi, Liangang

2017-01-01

In the coexistence of multiple types of interfering signals, the performance of interference suppression methods based on time and frequency domains is degraded seriously, and the technique using an antenna array requires a large enough size and huge hardware costs. To combat multi-type interferences better for GNSS receivers, this paper proposes a cascaded multi-type interferences mitigation method combining improved double chain quantum genetic matching pursuit (DCQGMP)-based sparse decomposition and an MPDR beamformer. The key idea behind the proposed method is that the multiple types of interfering signals can be excised by taking advantage of their sparse features in different domains. In the first stage, the single-tone (multi-tone) and linear chirp interfering signals are canceled by sparse decomposition according to their sparsity in the over-complete dictionary. In order to improve the timeliness of matching pursuit (MP)-based sparse decomposition, a DCQGMP is introduced by combining an improved double chain quantum genetic algorithm (DCQGA) and the MP algorithm, and the DCQGMP algorithm is extended to handle the multi-channel signals according to the correlation among the signals in different channels. In the second stage, the minimum power distortionless response (MPDR) beamformer is utilized to nullify the residuary interferences (e.g., wideband Gaussian noise interferences). Several simulation results show that the proposed method can not only improve the interference mitigation degree of freedom (DoF) of the array antenna, but also effectively deal with the interference arriving from the same direction with the GNSS signal, which can be sparse represented in the over-complete dictionary. Moreover, it does not bring serious distortions into the navigation signal. PMID:28394290

Information transmission and signal permutation in active flow networks

NASA Astrophysics Data System (ADS)

Woodhouse, Francis G.; Fawcett, Joanna B.; Dunkel, Jörn

2018-03-01

Recent experiments show that both natural and artificial microswimmers in narrow channel-like geometries will self-organise to form steady, directed flows. This suggests that networks of flowing active matter could function as novel autonomous microfluidic devices. However, little is known about how information propagates through these far-from-equilibrium systems. Through a mathematical analogy with spin-ice vertex models, we investigate here the input–output characteristics of generic incompressible active flow networks (AFNs). Our analysis shows that information transport through an AFN is inherently different from conventional pressure or voltage driven networks. Active flows on hexagonal arrays preserve input information over longer distances than their passive counterparts and are highly sensitive to bulk topological defects, whose presence can be inferred from marginal input–output distributions alone. This sensitivity further allows controlled permutations on parallel inputs, revealing an unexpected link between active matter and group theory that can guide new microfluidic mixing strategies facilitated by active matter and aid the design of generic autonomous information transport networks.

Long-range multi-carrier acoustic communications in shallow water based on iterative sparse channel estimation.

PubMed

Kang, Taehyuk; Song, H C; Hodgkiss, W S; Soo Kim, Jea

2010-12-01

Long-range orthogonal frequency division multiplexing (OFDM) acoustic communications is demonstrated using data from the Kauai Acomms MURI 2008 (KAM08) experiment carried out in about 106 m deep shallow water west of Kauai, HI, in June 2008. The source bandwidth was 8 kHz (12-20 kHz), and the data were received by a 16-element vertical array at a distance of 8 km. Iterative sparse channel estimation is applied in conjunction with low-density parity-check decoding. In addition, the impact of diversity combining in a highly inhomogeneous underwater environment is investigated. Error-free transmission using 16-quadtrative amplitude modulation is achieved at a data rate of 10 kb/s.

OmpF, a nucleotide-sensing nanoprobe, computational evaluation of single channel activities

NASA Astrophysics Data System (ADS)

Abdolvahab, R. H.; Mobasheri, H.; Nikouee, A.; Ejtehadi, M. R.

2016-09-01

The results of highthroughput practical single channel experiments should be formulated and validated by signal analysis approaches to increase the recognition precision of translocating molecules. For this purpose, the activities of the single nano-pore forming protein, OmpF, in the presence of nucleotides were recorded in real time by the voltage clamp technique and used as a means for nucleotide recognition. The results were analyzed based on the permutation entropy of current Time Series (TS), fractality, autocorrelation, structure function, spectral density, and peak fraction to recognize each nucleotide, based on its signature effect on the conductance, gating frequency and voltage sensitivity of channel at different concentrations and membrane potentials. The amplitude and frequency of ion current fluctuation increased in the presence of Adenine more than Cytosine and Thymine in milli-molar (0.5 mM) concentrations. The variance of the current TS at various applied voltages showed a non-monotonic trend whose initial increasing slope in the presence of Thymine changed to a decreasing one in the second phase and was different from that of Adenine and Cytosine; e.g., by increasing the voltage from 40 to 140 mV in the 0.5 mM concentration of Adenine or Cytosine, the variance decreased by one third while for the case of Thymine it was doubled. Moreover, according to the structure function of TS, the fractality of current TS differed as a function of varying membrane potentials (pd) and nucleotide concentrations. Accordingly, the calculated permutation entropy of the TS, validated the biophysical approach defined for the recognition of different nucleotides at various concentrations, pd's and polarities. Thus, the promising outcomes of the combined experimental and theoretical methodologies presented here can be implemented as a complementary means in pore-based nucleotide recognition approaches.

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

DTIC Science & Technology

1981-01-01

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

Novel permutation measures for image encryption algorithms

NASA Astrophysics Data System (ADS)

Abd-El-Hafiz, Salwa K.; AbdElHaleem, Sherif H.; Radwan, Ahmed G.

2016-10-01

This paper proposes two measures for the evaluation of permutation techniques used in image encryption. First, a general mathematical framework for describing the permutation phase used in image encryption is presented. Using this framework, six different permutation techniques, based on chaotic and non-chaotic generators, are described. The two new measures are, then, introduced to evaluate the effectiveness of permutation techniques. These measures are (1) Percentage of Adjacent Pixels Count (PAPC) and (2) Distance Between Adjacent Pixels (DBAP). The proposed measures are used to evaluate and compare the six permutation techniques in different scenarios. The permutation techniques are applied on several standard images and the resulting scrambled images are analyzed. Moreover, the new measures are used to compare the permutation algorithms on different matrix sizes irrespective of the actual parameters used in each algorithm. The analysis results show that the proposed measures are good indicators of the effectiveness of the permutation technique.

Blocks in cycles and k-commuting permutations.

PubMed

Moreno, Rutilo; Rivera, Luis Manuel

2016-01-01

We introduce and study k -commuting permutations. One of our main results is a characterization of permutations that k -commute with a given permutation. Using this characterization, we obtain formulas for the number of permutations that k -commute with a permutation [Formula: see text], for some cycle types of [Formula: see text]. Our enumerative results are related with integer sequences in "The On-line Encyclopedia of Integer Sequences", and in some cases provide new interpretations for such sequences.

Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation.

PubMed

Gog, Simon; Bader, Martin

2008-10-01

The problem of sorting signed permutations by reversals is a well-studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pevzner in 1995. The algorithm was improved several times, and nowadays the most efficient algorithm has a subquadratic running time. Simple permutations played an important role in the development of these algorithms. Although the latest result of Tannier et al. does not require simple permutations, the preliminary version of their algorithm as well as the first polynomial time algorithm of Hannenhalli and Pevzner use the structure of simple permutations. More precisely, the latter algorithms require a precomputation that transforms a permutation into an equivalent simple permutation. To the best of our knowledge, all published algorithms for this transformation have at least a quadratic running time. For further investigations on genome rearrangement problems, the existence of a fast algorithm for the transformation could be crucial. Another important task is the back transformation, i.e. if we have a sorting on the simple permutation, transform it into a sorting on the original permutation. Again, the naive approach results in an algorithm with quadratic running time. In this paper, we present a linear time algorithm for transforming a permutation into an equivalent simple permutation, and an O(n log n) algorithm for the back transformation of the sorting sequence.

A Random Variable Related to the Inversion Vector of a Partial Random Permutation

ERIC Educational Resources Information Center

Laghate, Kavita; Deshpande, M. N.

2005-01-01

In this article, we define the inversion vector of a permutation of the integers 1, 2,..., n. We set up a particular kind of permutation, called a partial random permutation. The sum of the elements of the inversion vector of such a permutation is a random variable of interest.

A transposase strategy for creating libraries of circularly permuted proteins.

PubMed

Mehta, Manan M; Liu, Shirley; Silberg, Jonathan J

2012-05-01

A simple approach for creating libraries of circularly permuted proteins is described that is called PERMutation Using Transposase Engineering (PERMUTE). In PERMUTE, the transposase MuA is used to randomly insert a minitransposon that can function as a protein expression vector into a plasmid that contains the open reading frame (ORF) being permuted. A library of vectors that express different permuted variants of the ORF-encoded protein is created by: (i) using bacteria to select for target vectors that acquire an integrated minitransposon; (ii) excising the ensemble of ORFs that contain an integrated minitransposon from the selected vectors; and (iii) circularizing the ensemble of ORFs containing integrated minitransposons using intramolecular ligation. Construction of a Thermotoga neapolitana adenylate kinase (AK) library using PERMUTE revealed that this approach produces vectors that express circularly permuted proteins with distinct sequence diversity from existing methods. In addition, selection of this library for variants that complement the growth of Escherichia coli with a temperature-sensitive AK identified functional proteins with novel architectures, suggesting that PERMUTE will be useful for the directed evolution of proteins with new functions.

A transposase strategy for creating libraries of circularly permuted proteins

PubMed Central

Mehta, Manan M.; Liu, Shirley; Silberg, Jonathan J.

2012-01-01

A simple approach for creating libraries of circularly permuted proteins is described that is called PERMutation Using Transposase Engineering (PERMUTE). In PERMUTE, the transposase MuA is used to randomly insert a minitransposon that can function as a protein expression vector into a plasmid that contains the open reading frame (ORF) being permuted. A library of vectors that express different permuted variants of the ORF-encoded protein is created by: (i) using bacteria to select for target vectors that acquire an integrated minitransposon; (ii) excising the ensemble of ORFs that contain an integrated minitransposon from the selected vectors; and (iii) circularizing the ensemble of ORFs containing integrated minitransposons using intramolecular ligation. Construction of a Thermotoga neapolitana adenylate kinase (AK) library using PERMUTE revealed that this approach produces vectors that express circularly permuted proteins with distinct sequence diversity from existing methods. In addition, selection of this library for variants that complement the growth of Escherichia coli with a temperature-sensitive AK identified functional proteins with novel architectures, suggesting that PERMUTE will be useful for the directed evolution of proteins with new functions. PMID:22319214

A nine-dimensional ab initio global potential energy surface for the H2O+ + H2 → H3O+ + H reaction

NASA Astrophysics Data System (ADS)

Li, Anyang; Guo, Hua

2014-06-01

An accurate full-dimensional global potential energy surface (PES) is developed for the title reaction. While the long-range interactions in the reactant asymptote are represented by an analytical expression, the interaction region of the PES is fit to more than 81 000 of ab initio points at the UCCSD(T)-F12b/AVTZ level using the permutation invariant polynomial neural network approach. Fully symmetric with respect to permutation of all four hydrogen atoms, the PES provides a faithful representation of the ab initio points, with a root mean square error of 1.8 meV or 15 cm-1. The reaction path for this exoergic reaction features an attractive and barrierless entrance channel, a submerged saddle point, a shallow H4O+ well, and a barrierless exit channel. The rate coefficients for the title reaction and kinetic isotope effect have been determined on this PES using quasi-classical trajectories, and they are in good agreement with available experimental data. It is further shown that the H2O+ rotational enhancement of reactivity observed experimentally can be traced to the submerged saddle point. Using our recently proposed Sudden Vector Projection model, we demonstrate that a rotational degree of freedom of the H2O+ reactant is strongly coupled with the reaction coordinate at this saddle point, thus unraveling the origin of the pronounced mode specificity in this reaction.

Encoding Sequential Information in Semantic Space Models: Comparing Holographic Reduced Representation and Random Permutation

PubMed Central

Recchia, Gabriel; Sahlgren, Magnus; Kanerva, Pentti; Jones, Michael N.

2015-01-01

Circular convolution and random permutation have each been proposed as neurally plausible binding operators capable of encoding sequential information in semantic memory. We perform several controlled comparisons of circular convolution and random permutation as means of encoding paired associates as well as encoding sequential information. Random permutations outperformed convolution with respect to the number of paired associates that can be reliably stored in a single memory trace. Performance was equal on semantic tasks when using a small corpus, but random permutations were ultimately capable of achieving superior performance due to their higher scalability to large corpora. Finally, “noisy” permutations in which units are mapped to other units arbitrarily (no one-to-one mapping) perform nearly as well as true permutations. These findings increase the neurological plausibility of random permutations and highlight their utility in vector space models of semantics. PMID:25954306

Finite state model and compatibility theory - New analysis tools for permutation networks

NASA Technical Reports Server (NTRS)

Huang, S.-T.; Tripathi, S. K.

1986-01-01

A simple model to describe the fundamental operation theory of shuffle-exchange-type permutation networks, the finite permutation machine (FPM), is described, and theorems which transform the control matrix result to a continuous compatible vector result are developed. It is found that only 2n-1 shuffle exchange passes are necessary, and that 3n-3 passes are sufficient, to realize all permutations, reducing the sufficient number of passes by two from previous results. The flexibility of the approach is demonstrated by the description of a stack permutation machine (SPM) which can realize all permutations, and by showing that the FPM corresponding to the Benes (1965) network belongs to the SPM. The FPM corresponding to the network with two cascaded reverse-exchange networks is found to realize all permutations, and a simple mechanism to verify several equivalence relationships of various permutation networks is discussed.

Sorting permutations by prefix and suffix rearrangements.

PubMed

Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni

2017-02-01

Some interesting combinatorial problems have been motivated by genome rearrangements, which are mutations that affect large portions of a genome. When we represent genomes as permutations, the goal is to transform a given permutation into the identity permutation with the minimum number of rearrangements. When they affect segments from the beginning (respectively end) of the permutation, they are called prefix (respectively suffix) rearrangements. This paper presents results for rearrangement problems that involve prefix and suffix versions of reversals and transpositions considering unsigned and signed permutations. We give 2-approximation and ([Formula: see text])-approximation algorithms for these problems, where [Formula: see text] is a constant divided by the number of breakpoints (pairs of consecutive elements that should not be consecutive in the identity permutation) in the input permutation. We also give bounds for the diameters concerning these problems and provide ways of improving the practical results of our algorithms.

A Reversible Logical Circuit Synthesis Algorithm Based on Decomposition of Cycle Representations of Permutations

NASA Astrophysics Data System (ADS)

Zhu, Wei; Li, Zhiqiang; Zhang, Gaoman; Pan, Suhan; Zhang, Wei

2018-05-01

A reversible function is isomorphic to a permutation and an arbitrary permutation can be represented by a series of cycles. A new synthesis algorithm for 3-qubit reversible circuits was presented. It consists of two parts, the first part used the Number of reversible function's Different Bits (NDBs) to decide whether the NOT gate should be added to decrease the Hamming distance of the input and output vectors; the second part was based on the idea of exploring properties of the cycle representation of permutations, decomposed the cycles to make the permutation closer to the identity permutation and finally turn into the identity permutation, it was realized by using totally controlled Toffoli gates with positive and negative controls.

Sparse aperiodic arrays for optical beam forming and LIDAR.

PubMed

Komljenovic, Tin; Helkey, Roger; Coldren, Larry; Bowers, John E

2017-02-06

We analyze optical phased arrays with aperiodic pitch and element-to-element spacing greater than one wavelength at channel counts exceeding hundreds of elements. We optimize the spacing between waveguides for highest side-mode suppression providing grating lobe free steering in full visible space while preserving the narrow beamwidth. Optimum waveguide placement strategies are derived and design guidelines for sparse (> 1.5 λ and > 3 λ average element spacing) optical phased arrays are given. Scaling to larger array areas by means of tiling is considered.

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

NASA Astrophysics Data System (ADS)

ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

2017-05-01

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

Memory Retrieval in Mice and Men

PubMed Central

Ben-Yakov, Aya; Dudai, Yadin; Mayford, Mark R.

2015-01-01

Retrieval, the use of learned information, was until recently mostly terra incognita in the neurobiology of memory, owing to shortage of research methods with the spatiotemporal resolution required to identify and dissect fast reactivation or reconstruction of complex memories in the mammalian brain. The development of novel paradigms, model systems, and new tools in molecular genetics, electrophysiology, optogenetics, in situ microscopy, and functional imaging, have contributed markedly in recent years to our ability to investigate brain mechanisms of retrieval. We review selected developments in the study of explicit retrieval in the rodent and human brain. The picture that emerges is that retrieval involves coordinated fast interplay of sparse and distributed corticohippocampal and neocortical networks that may permit permutational binding of representational elements to yield specific representations. These representations are driven largely by the activity patterns shaped during encoding, but are malleable, subject to the influence of time and interaction of the existing memory with novel information. PMID:26438596

Low-rank factorization of electron integral tensors and its application in electronic structure theory

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

Peng, Bo; Kowalski, Karol

In this letter, we introduce the reverse Cuthill-McKee (RCM) algorithm, which is often used for the bandwidth reduction of sparse tensors, to transform the two-electron integral tensors to their block diagonal forms. By further applying the pivoted Cholesky decomposition (CD) on each of the diagonal blocks, we are able to represent the high-dimensional two-electron integral tensors in terms of permutation matrices and low-rank Cholesky vectors. This representation facilitates the low-rank factorization of the high-dimensional tensor contractions that are usually encountered in post-Hartree-Fock calculations. In this letter, we discuss the second-order Møller-Plesset (MP2) method and linear coupled- cluster model with doublesmore » (L-CCD) as two simple examples to demonstrate the efficiency of the RCM-CD technique in representing two-electron integrals in a compact form.« less

Decryption of pure-position permutation algorithms.

PubMed

Zhao, Xiao-Yu; Chen, Gang; Zhang, Dan; Wang, Xiao-Hong; Dong, Guang-Chang

2004-07-01

Pure position permutation image encryption algorithms, commonly used as image encryption investigated in this work are unfortunately frail under known-text attack. In view of the weakness of pure position permutation algorithm, we put forward an effective decryption algorithm for all pure-position permutation algorithms. First, a summary of the pure position permutation image encryption algorithms is given by introducing the concept of ergodic matrices. Then, by using probability theory and algebraic principles, the decryption probability of pure-position permutation algorithms is verified theoretically; and then, by defining the operation system of fuzzy ergodic matrices, we improve a specific decryption algorithm. Finally, some simulation results are shown.

Weight distributions for turbo codes using random and nonrandom permutations

NASA Technical Reports Server (NTRS)

Dolinar, S.; Divsalar, D.

1995-01-01

This article takes a preliminary look at the weight distributions achievable for turbo codes using random, nonrandom, and semirandom permutations. Due to the recursiveness of the encoders, it is important to distinguish between self-terminating and non-self-terminating input sequences. The non-self-terminating sequences have little effect on decoder performance, because they accumulate high encoded weight until they are artificially terminated at the end of the block. From probabilistic arguments based on selecting the permutations randomly, it is concluded that the self-terminating weight-2 data sequences are the most important consideration in the design of constituent codes; higher-weight self-terminating sequences have successively decreasing importance. Also, increasing the number of codes and, correspondingly, the number of permutations makes it more and more likely that the bad input sequences will be broken up by one or more of the permuters. It is possible to design nonrandom permutations that ensure that the minimum distance due to weight-2 input sequences grows roughly as the square root of (2N), where N is the block length. However, these nonrandom permutations amplify the bad effects of higher-weight inputs, and as a result they are inferior in performance to randomly selected permutations. But there are 'semirandom' permutations that perform nearly as well as the designed nonrandom permutations with respect to weight-2 input sequences and are not as susceptible to being foiled by higher-weight inputs.

PERMutation Using Transposase Engineering (PERMUTE): A Simple Approach for Constructing Circularly Permuted Protein Libraries.

PubMed

Jones, Alicia M; Atkinson, Joshua T; Silberg, Jonathan J

2017-01-01

Rearrangements that alter the order of a protein's sequence are used in the lab to study protein folding, improve activity, and build molecular switches. One of the simplest ways to rearrange a protein sequence is through random circular permutation, where native protein termini are linked together and new termini are created elsewhere through random backbone fission. Transposase mutagenesis has emerged as a simple way to generate libraries encoding different circularly permuted variants of proteins. With this approach, a synthetic transposon (called a permuteposon) is randomly inserted throughout a circularized gene to generate vectors that express different permuted variants of a protein. In this chapter, we outline the protocol for constructing combinatorial libraries of circularly permuted proteins using transposase mutagenesis, and we describe the different permuteposons that have been developed to facilitate library construction.

A noise resistant symmetric key cryptosystem based on S8 S-boxes and chaotic maps

NASA Astrophysics Data System (ADS)

Hussain, Iqtadar; Anees, Amir; Aslam, Muhammad; Ahmed, Rehan; Siddiqui, Nasir

2018-04-01

In this manuscript, we have proposed an encryption algorithm to encrypt any digital data. The proposed algorithm is primarily based on the substitution-permutation in which the substitution process is performed by the S 8 Substitution boxes. The proposed algorithm incorporates three different chaotic maps. We have analysed the behaviour of chaos by secure communication in great length, and accordingly, we have applied those chaotic sequences in the proposed encryption algorithm. The simulation and statistical results revealed that the proposed encryption scheme is secure against different attacks. Moreover, the encryption scheme can tolerate the channel noise as well; if the encrypted data is corrupted by the unauthenticated user or by the channel noise, the decryption can still be successfully done with some distortion. The overall results confirmed that the presented work has good cryptographic features, low computational complexity and resistant to the channel noise which makes it suitable for low profile mobile applications.

Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and Navigation Support

DTIC Science & Technology

2011-09-30

channel interference mitigation for underwater acoustic MIMO - OFDM . 3) Turbo equalization for OFDM modulated physical layer network coding. 4) Blind CFO...Underwater Acoustic MIMO - OFDM . MIMO - OFDM has been actively studied for high data rate communications over the bandwidthlimited underwater acoustic...with the cochannel interference (CCI) due to parallel transmissions in MIMO - OFDM . Our proposed receiver has the following components: 1

Opposition-Based Memetic Algorithm and Hybrid Approach for Sorting Permutations by Reversals.

PubMed

Soncco-Álvarez, José Luis; Muñoz, Daniel M; Ayala-Rincón, Mauricio

2018-02-21

Sorting unsigned permutations by reversals is a difficult problem; indeed, it was proved to be NP-hard by Caprara (1997). Because of its high complexity, many approximation algorithms to compute the minimal reversal distance were proposed until reaching the nowadays best-known theoretical ratio of 1.375. In this article, two memetic algorithms to compute the reversal distance are proposed. The first one uses the technique of opposition-based learning leading to an opposition-based memetic algorithm; the second one improves the previous algorithm by applying the heuristic of two breakpoint elimination leading to a hybrid approach. Several experiments were performed with one-hundred randomly generated permutations, single benchmark permutations, and biological permutations. Results of the experiments showed that the proposed OBMA and Hybrid-OBMA algorithms achieve the best results for practical cases, that is, for permutations of length up to 120. Also, Hybrid-OBMA showed to improve the results of OBMA for permutations greater than or equal to 60. The applicability of our proposed algorithms was checked processing permutations based on biological data, in which case OBMA gave the best average results for all instances.

Visual recognition of permuted words

NASA Astrophysics Data System (ADS)

Rashid, Sheikh Faisal; Shafait, Faisal; Breuel, Thomas M.

2010-02-01

In current study we examine how letter permutation affects in visual recognition of words for two orthographically dissimilar languages, Urdu and German. We present the hypothesis that recognition or reading of permuted and non-permuted words are two distinct mental level processes, and that people use different strategies in handling permuted words as compared to normal words. A comparison between reading behavior of people in these languages is also presented. We present our study in context of dual route theories of reading and it is observed that the dual-route theory is consistent with explanation of our hypothesis of distinction in underlying cognitive behavior for reading permuted and non-permuted words. We conducted three experiments in lexical decision tasks to analyze how reading is degraded or affected by letter permutation. We performed analysis of variance (ANOVA), distribution free rank test, and t-test to determine the significance differences in response time latencies for two classes of data. Results showed that the recognition accuracy for permuted words is decreased 31% in case of Urdu and 11% in case of German language. We also found a considerable difference in reading behavior for cursive and alphabetic languages and it is observed that reading of Urdu is comparatively slower than reading of German due to characteristics of cursive script.

Four applications of permutation methods to testing a single-mediator model.

PubMed

Taylor, Aaron B; MacKinnon, David P

2012-09-01

Four applications of permutation tests to the single-mediator model are described and evaluated in this study. Permutation tests work by rearranging data in many possible ways in order to estimate the sampling distribution for the test statistic. The four applications to mediation evaluated here are the permutation test of ab, the permutation joint significance test, and the noniterative and iterative permutation confidence intervals for ab. A Monte Carlo simulation study was used to compare these four tests with the four best available tests for mediation found in previous research: the joint significance test, the distribution of the product test, and the percentile and bias-corrected bootstrap tests. We compared the different methods on Type I error, power, and confidence interval coverage. The noniterative permutation confidence interval for ab was the best performer among the new methods. It successfully controlled Type I error, had power nearly as good as the most powerful existing methods, and had better coverage than any existing method. The iterative permutation confidence interval for ab had lower power than do some existing methods, but it performed better than any other method in terms of coverage. The permutation confidence interval methods are recommended when estimating a confidence interval is a primary concern. SPSS and SAS macros that estimate these confidence intervals are provided.

Joint analysis of multiple high-dimensional data types using sparse matrix approximations of rank-1 with applications to ovarian and liver cancer.

PubMed

Okimoto, Gordon; Zeinalzadeh, Ashkan; Wenska, Tom; Loomis, Michael; Nation, James B; Fabre, Tiphaine; Tiirikainen, Maarit; Hernandez, Brenda; Chan, Owen; Wong, Linda; Kwee, Sandi

2016-01-01

Technological advances enable the cost-effective acquisition of Multi-Modal Data Sets (MMDS) composed of measurements for multiple, high-dimensional data types obtained from a common set of bio-samples. The joint analysis of the data matrices associated with the different data types of a MMDS should provide a more focused view of the biology underlying complex diseases such as cancer that would not be apparent from the analysis of a single data type alone. As multi-modal data rapidly accumulate in research laboratories and public databases such as The Cancer Genome Atlas (TCGA), the translation of such data into clinically actionable knowledge has been slowed by the lack of computational tools capable of analyzing MMDSs. Here, we describe the Joint Analysis of Many Matrices by ITeration (JAMMIT) algorithm that jointly analyzes the data matrices of a MMDS using sparse matrix approximations of rank-1. The JAMMIT algorithm jointly approximates an arbitrary number of data matrices by rank-1 outer-products composed of "sparse" left-singular vectors (eigen-arrays) that are unique to each matrix and a right-singular vector (eigen-signal) that is common to all the matrices. The non-zero coefficients of the eigen-arrays identify small subsets of variables for each data type (i.e., signatures) that in aggregate, or individually, best explain a dominant eigen-signal defined on the columns of the data matrices. The approximation is specified by a single "sparsity" parameter that is selected based on false discovery rate estimated by permutation testing. Multiple signals of interest in a given MDDS are sequentially detected and modeled by iterating JAMMIT on "residual" data matrices that result from a given sparse approximation. We show that JAMMIT outperforms other joint analysis algorithms in the detection of multiple signatures embedded in simulated MDDS. On real multimodal data for ovarian and liver cancer we show that JAMMIT identified multi-modal signatures that were clinically informative and enriched for cancer-related biology. Sparse matrix approximations of rank-1 provide a simple yet effective means of jointly reducing multiple, big data types to a small subset of variables that characterize important clinical and/or biological attributes of the bio-samples from which the data were acquired.

Pilot-based parametric channel estimation algorithm for DCO-OFDM-based visual light communications

NASA Astrophysics Data System (ADS)

Qian, Xuewen; Deng, Honggui; He, Hailang

2017-10-01

Due to wide modulation bandwidth in optical communication, multipath channels may be non-sparse and deteriorate communication performance heavily. Traditional compressive sensing-based channel estimation algorithm cannot be employed in this kind of situation. In this paper, we propose a practical parametric channel estimation algorithm for orthogonal frequency division multiplexing (OFDM)-based visual light communication (VLC) systems based on modified zero correlation code (ZCC) pair that has the impulse-like correlation property. Simulation results show that the proposed algorithm achieves better performances than existing least squares (LS)-based algorithm in both bit error ratio (BER) and frequency response estimation.

Circular Permutation of a Chaperonin Protein: Biophysics and Application to Nanotechnology

NASA Technical Reports Server (NTRS)

Paavola, Chad; Chan, Suzanne; Li, Yi-Fen; McMillan, R. Andrew; Trent, Jonathan

2004-01-01

We have designed five circular permutants of a chaperonin protein derived from the hyperthermophilic organism Sulfolobus shibatae. These permuted proteins were expressed in E. coli and are well-folded. Furthermore, all the permutants assemble into 18-mer double rings of the same form as the wild-type protein. We characterized the thermodynamics of folding for each permutant by both guanidine denaturation and differential scanning calorimetry. We also examined the assembly of chaperonin rings into higher order structures that may be used as nanoscale templates. The results show that circular permutation can be used to tune the thermodynamic properties of a protein template as well as facilitating the fusion of peptides, binding proteins or enzymes onto nanostructured templates.

The structure of a thermophilic kinase shapes fitness upon random circular permutation

PubMed Central

Jones, Alicia M.; Mehta, Manan M.; Thomas, Emily E.; Atkinson, Joshua T.; Segall-Shapiro, Thomas H.; Liu, Shirley; Silberg, Jonathan J.

2016-01-01

Proteins can be engineered for synthetic biology through circular permutation, a sequence rearrangement where native protein termini become linked and new termini are created elsewhere through backbone fission. However, it remains challenging to anticipate a protein’s functional tolerance to circular permutation. Here, we describe new transposons for creating libraries of randomly circularly permuted proteins that minimize peptide additions at their termini, and we use transposase mutagenesis to study the tolerance of a thermophilic adenylate kinase (AK) to circular permutation. We find that libraries expressing permuted AK with either short or long peptides amended to their N-terminus yield distinct sets of active variants and present evidence that this trend arises because permuted protein expression varies across libraries. Mapping all sites that tolerate backbone cleavage onto AK structure reveals that the largest contiguous regions of sequence that lack cleavage sites are proximal to the phosphotransfer site. A comparison of our results with a range of structure-derived parameters further showed that retention of function correlates to the strongest extent with the distance to the phosphotransfer site, amino acid variability in an AK family sequence alignment, and residue-level deviations in superimposed AK structures. Our work illustrates how permuted protein libraries can be created with minimal peptide additions using transposase mutagenesis, and they reveal a challenge of maintaining consistent expression across permuted variants in a library that minimizes peptide additions. Furthermore, these findings provide a basis for interpreting responses of thermophilic phosphotransferases to circular permutation by calibrating how different structure-derived parameters relate to retention of function in a cellular selection. PMID:26976658

The Structure of a Thermophilic Kinase Shapes Fitness upon Random Circular Permutation.

PubMed

Jones, Alicia M; Mehta, Manan M; Thomas, Emily E; Atkinson, Joshua T; Segall-Shapiro, Thomas H; Liu, Shirley; Silberg, Jonathan J

2016-05-20

Proteins can be engineered for synthetic biology through circular permutation, a sequence rearrangement in which native protein termini become linked and new termini are created elsewhere through backbone fission. However, it remains challenging to anticipate a protein's functional tolerance to circular permutation. Here, we describe new transposons for creating libraries of randomly circularly permuted proteins that minimize peptide additions at their termini, and we use transposase mutagenesis to study the tolerance of a thermophilic adenylate kinase (AK) to circular permutation. We find that libraries expressing permuted AKs with either short or long peptides amended to their N-terminus yield distinct sets of active variants and present evidence that this trend arises because permuted protein expression varies across libraries. Mapping all sites that tolerate backbone cleavage onto AK structure reveals that the largest contiguous regions of sequence that lack cleavage sites are proximal to the phosphotransfer site. A comparison of our results with a range of structure-derived parameters further showed that retention of function correlates to the strongest extent with the distance to the phosphotransfer site, amino acid variability in an AK family sequence alignment, and residue-level deviations in superimposed AK structures. Our work illustrates how permuted protein libraries can be created with minimal peptide additions using transposase mutagenesis, and it reveals a challenge of maintaining consistent expression across permuted variants in a library that minimizes peptide additions. Furthermore, these findings provide a basis for interpreting responses of thermophilic phosphotransferases to circular permutation by calibrating how different structure-derived parameters relate to retention of function in a cellular selection.

Dimension-Factorized Range Migration Algorithm for Regularly Distributed Array Imaging

PubMed Central

Guo, Qijia; Wang, Jie; Chang, Tianying

2017-01-01

The two-dimensional planar MIMO array is a popular approach for millimeter wave imaging applications. As a promising practical alternative, sparse MIMO arrays have been devised to reduce the number of antenna elements and transmitting/receiving channels with predictable and acceptable loss in image quality. In this paper, a high precision three-dimensional imaging algorithm is proposed for MIMO arrays of the regularly distributed type, especially the sparse varieties. Termed the Dimension-Factorized Range Migration Algorithm, the new imaging approach factorizes the conventional MIMO Range Migration Algorithm into multiple operations across the sparse dimensions. The thinner the sparse dimensions of the array, the more efficient the new algorithm will be. Advantages of the proposed approach are demonstrated by comparison with the conventional MIMO Range Migration Algorithm and its non-uniform fast Fourier transform based variant in terms of all the important characteristics of the approaches, especially the anti-noise capability. The computation cost is analyzed as well to evaluate the efficiency quantitatively. PMID:29113083

Efficient Sparse Signal Transmission over a Lossy Link Using Compressive Sensing

PubMed Central

Wu, Liantao; Yu, Kai; Cao, Dongyu; Hu, Yuhen; Wang, Zhi

2015-01-01

Reliable data transmission over lossy communication link is expensive due to overheads for error protection. For signals that have inherent sparse structures, compressive sensing (CS) is applied to facilitate efficient sparse signal transmissions over lossy communication links without data compression or error protection. The natural packet loss in the lossy link is modeled as a random sampling process of the transmitted data, and the original signal will be reconstructed from the lossy transmission results using the CS-based reconstruction method at the receiving end. The impacts of packet lengths on transmission efficiency under different channel conditions have been discussed, and interleaving is incorporated to mitigate the impact of burst data loss. Extensive simulations and experiments have been conducted and compared to the traditional automatic repeat request (ARQ) interpolation technique, and very favorable results have been observed in terms of both accuracy of the reconstructed signals and the transmission energy consumption. Furthermore, the packet length effect provides useful insights for using compressed sensing for efficient sparse signal transmission via lossy links. PMID:26287195

Efficient Processing of Acoustic Signals for High Rate Information Transmission over Sparse Underwater Channels

DTIC Science & Technology

2016-09-02

the fractionally-spaced channel estimators and the short feedforward equalizer filters . Receiver algorithm is applied to real data transmitted at 10...multichannel decision-feedback equalizer (DFE)[1]. This receiver consists of a bank of adaptive feedforwad filters , one per array element, followed by a...decision-feedback filter . It has been implemented in the prototype high-rate acoustic modem developed at the Woods Hole Oceanographic Institution, and

Teaching Tip: When a Matrix and Its Inverse Are Stochastic

ERIC Educational Resources Information Center

Ding, J.; Rhee, N. H.

2013-01-01

A stochastic matrix is a square matrix with nonnegative entries and row sums 1. The simplest example is a permutation matrix, whose rows permute the rows of an identity matrix. A permutation matrix and its inverse are both stochastic. We prove the converse, that is, if a matrix and its inverse are both stochastic, then it is a permutation matrix.

Permutation-based inference for the AUC: A unified approach for continuous and discontinuous data.

PubMed

Pauly, Markus; Asendorf, Thomas; Konietschke, Frank

2016-11-01

We investigate rank-based studentized permutation methods for the nonparametric Behrens-Fisher problem, that is, inference methods for the area under the ROC curve. We hereby prove that the studentized permutation distribution of the Brunner-Munzel rank statistic is asymptotically standard normal, even under the alternative. Thus, incidentally providing the hitherto missing theoretical foundation for the Neubert and Brunner studentized permutation test. In particular, we do not only show its consistency, but also that confidence intervals for the underlying treatment effects can be computed by inverting this permutation test. In addition, we derive permutation-based range-preserving confidence intervals. Extensive simulation studies show that the permutation-based confidence intervals appear to maintain the preassigned coverage probability quite accurately (even for rather small sample sizes). For a convenient application of the proposed methods, a freely available software package for the statistical software R has been developed. A real data example illustrates the application. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Efficient Blockwise Permutation Tests Preserving Exchangeability

PubMed Central

Zhou, Chunxiao; Zwilling, Chris E.; Calhoun, Vince D.; Wang, Michelle Y.

2014-01-01

In this paper, we present a new blockwise permutation test approach based on the moments of the test statistic. The method is of importance to neuroimaging studies. In order to preserve the exchangeability condition required in permutation tests, we divide the entire set of data into certain exchangeability blocks. In addition, computationally efficient moments-based permutation tests are performed by approximating the permutation distribution of the test statistic with the Pearson distribution series. This involves the calculation of the first four moments of the permutation distribution within each block and then over the entire set of data. The accuracy and efficiency of the proposed method are demonstrated through simulated experiment on the magnetic resonance imaging (MRI) brain data, specifically the multi-site voxel-based morphometry analysis from structural MRI (sMRI). PMID:25289113

Epileptic Seizure Detection with Log-Euclidean Gaussian Kernel-Based Sparse Representation.

PubMed

Yuan, Shasha; Zhou, Weidong; Wu, Qi; Zhang, Yanli

2016-05-01

Epileptic seizure detection plays an important role in the diagnosis of epilepsy and reducing the massive workload of reviewing electroencephalography (EEG) recordings. In this work, a novel algorithm is developed to detect seizures employing log-Euclidean Gaussian kernel-based sparse representation (SR) in long-term EEG recordings. Unlike the traditional SR for vector data in Euclidean space, the log-Euclidean Gaussian kernel-based SR framework is proposed for seizure detection in the space of the symmetric positive definite (SPD) matrices, which form a Riemannian manifold. Since the Riemannian manifold is nonlinear, the log-Euclidean Gaussian kernel function is applied to embed it into a reproducing kernel Hilbert space (RKHS) for performing SR. The EEG signals of all channels are divided into epochs and the SPD matrices representing EEG epochs are generated by covariance descriptors. Then, the testing samples are sparsely coded over the dictionary composed by training samples utilizing log-Euclidean Gaussian kernel-based SR. The classification of testing samples is achieved by computing the minimal reconstructed residuals. The proposed method is evaluated on the Freiburg EEG dataset of 21 patients and shows its notable performance on both epoch-based and event-based assessments. Moreover, this method handles multiple channels of EEG recordings synchronously which is more speedy and efficient than traditional seizure detection methods.

MO-DE-207A-05: Dictionary Learning Based Reconstruction with Low-Rank Constraint for Low-Dose Spectral CT

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

Xu, Q; Stanford University School of Medicine, Stanford, CA; Liu, H

Purpose: Spectral CT enabled by an energy-resolved photon-counting detector outperforms conventional CT in terms of material discrimination, contrast resolution, etc. One reconstruction method for spectral CT is to generate a color image from a reconstructed component in each energy channel. However, given the radiation dose, the number of photons in each channel is limited, which will result in strong noise in each channel and affect the final color reconstruction. Here we propose a novel dictionary learning method for spectral CT that combines dictionary-based sparse representation method and the patch based low-rank constraint to simultaneously improve the reconstruction in each channelmore » and to address the inter-channel correlations to further improve the reconstruction. Methods: The proposed method has two important features: (1) guarantee of the patch based sparsity in each energy channel, which is the result of the dictionary based sparse representation constraint; (2) the explicit consideration of the correlations among different energy channels, which is realized by patch-by-patch nuclear norm-based low-rank constraint. For each channel, the dictionary consists of two sub-dictionaries. One is learned from the average of the images in all energy channels, and the other is learned from the average of the images in all energy channels except the current channel. With average operation to reduce noise, these two dictionaries can effectively preserve the structural details and get rid of artifacts caused by noise. Combining them together can express all structural information in current channel. Results: Dictionary learning based methods can obtain better results than FBP and the TV-based method. With low-rank constraint, the image quality can be further improved in the channel with more noise. The final color result by the proposed method has the best visual quality. Conclusion: The proposed method can effectively improve the image quality of low-dose spectral CT. This work is partially supported by the National Natural Science Foundation of China (No. 61302136), and the Natural Science Basic Research Plan in Shaanxi Province of China (No. 2014JQ8317).« less

An AUC-based permutation variable importance measure for random forests

PubMed Central

2013-01-01

Background The random forest (RF) method is a commonly used tool for classification with high dimensional data as well as for ranking candidate predictors based on the so-called random forest variable importance measures (VIMs). However the classification performance of RF is known to be suboptimal in case of strongly unbalanced data, i.e. data where response class sizes differ considerably. Suggestions were made to obtain better classification performance based either on sampling procedures or on cost sensitivity analyses. However to our knowledge the performance of the VIMs has not yet been examined in the case of unbalanced response classes. In this paper we explore the performance of the permutation VIM for unbalanced data settings and introduce an alternative permutation VIM based on the area under the curve (AUC) that is expected to be more robust towards class imbalance. Results We investigated the performance of the standard permutation VIM and of our novel AUC-based permutation VIM for different class imbalance levels using simulated data and real data. The results suggest that the new AUC-based permutation VIM outperforms the standard permutation VIM for unbalanced data settings while both permutation VIMs have equal performance for balanced data settings. Conclusions The standard permutation VIM loses its ability to discriminate between associated predictors and predictors not associated with the response for increasing class imbalance. It is outperformed by our new AUC-based permutation VIM for unbalanced data settings, while the performance of both VIMs is very similar in the case of balanced classes. The new AUC-based VIM is implemented in the R package party for the unbiased RF variant based on conditional inference trees. The codes implementing our study are available from the companion website: http://www.ibe.med.uni-muenchen.de/organisation/mitarbeiter/070_drittmittel/janitza/index.html. PMID:23560875

An AUC-based permutation variable importance measure for random forests.

PubMed

Janitza, Silke; Strobl, Carolin; Boulesteix, Anne-Laure

2013-04-05

The random forest (RF) method is a commonly used tool for classification with high dimensional data as well as for ranking candidate predictors based on the so-called random forest variable importance measures (VIMs). However the classification performance of RF is known to be suboptimal in case of strongly unbalanced data, i.e. data where response class sizes differ considerably. Suggestions were made to obtain better classification performance based either on sampling procedures or on cost sensitivity analyses. However to our knowledge the performance of the VIMs has not yet been examined in the case of unbalanced response classes. In this paper we explore the performance of the permutation VIM for unbalanced data settings and introduce an alternative permutation VIM based on the area under the curve (AUC) that is expected to be more robust towards class imbalance. We investigated the performance of the standard permutation VIM and of our novel AUC-based permutation VIM for different class imbalance levels using simulated data and real data. The results suggest that the new AUC-based permutation VIM outperforms the standard permutation VIM for unbalanced data settings while both permutation VIMs have equal performance for balanced data settings. The standard permutation VIM loses its ability to discriminate between associated predictors and predictors not associated with the response for increasing class imbalance. It is outperformed by our new AUC-based permutation VIM for unbalanced data settings, while the performance of both VIMs is very similar in the case of balanced classes. The new AUC-based VIM is implemented in the R package party for the unbiased RF variant based on conditional inference trees. The codes implementing our study are available from the companion website: http://www.ibe.med.uni-muenchen.de/organisation/mitarbeiter/070_drittmittel/janitza/index.html.

Between giant oscillations and uniform distribution of droplets: The role of varying lumen of channels in microfluidic networks.

PubMed

Cybulski, Olgierd; Jakiela, Slawomir; Garstecki, Piotr

2015-12-01

The simplest microfluidic network (a loop) comprises two parallel channels with a common inlet and a common outlet. Recent studies that assumed a constant cross section of the channels along their length have shown that the sequence of droplets entering the left (L) or right (R) arm of the loop can present either a uniform distribution of choices (e.g., RLRLRL...) or long sequences of repeated choices (RRR...LLL), with all the intermediate permutations being dynamically equivalent and virtually equally probable to be observed. We use experiments and computer simulations to show that even small variation of the cross section along channels completely shifts the dynamics either into the strong preference for highly grouped patterns (RRR...LLL) that generate system-size oscillations in flow or just the opposite-to patterns that distribute the droplets homogeneously between the arms of the loop. We also show the importance of noise in the process of self-organization of the spatiotemporal patterns of droplets. Our results provide guidelines for rational design of systems that reproducibly produce either grouped or homogeneous sequences of droplets flowing in microfluidic networks.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S [Santa Fe, NM; Cabantous, Stephanie [Los Alamos, NM

2008-06-24

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S; Cabantous, Stephanie

2013-02-12

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S [Santa Fe, NM; Cabantous, Stephanie [Los Alamos, NM

2011-06-14

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S.; Cabantous, Stephanie

2013-04-16

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Postselection technique for quantum channels with applications to quantum cryptography.

PubMed

Christandl, Matthias; König, Robert; Renner, Renato

2009-01-16

We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for an arbitrary input, it is sufficient to consider the case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. Our technique can be applied to the analysis of information-theoretic problems. For example, in quantum cryptography, we get a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks. The resulting security bounds are tighter than previously known bounds obtained with help of the exponential de Finetti theorem.

Image encryption using a synchronous permutation-diffusion technique

NASA Astrophysics Data System (ADS)

Enayatifar, Rasul; Abdullah, Abdul Hanan; Isnin, Ismail Fauzi; Altameem, Ayman; Lee, Malrey

2017-03-01

In the past decade, the interest on digital images security has been increased among scientists. A synchronous permutation and diffusion technique is designed in order to protect gray-level image content while sending it through internet. To implement the proposed method, two-dimensional plain-image is converted to one dimension. Afterward, in order to reduce the sending process time, permutation and diffusion steps for any pixel are performed in the same time. The permutation step uses chaotic map and deoxyribonucleic acid (DNA) to permute a pixel, while diffusion employs DNA sequence and DNA operator to encrypt the pixel. Experimental results and extensive security analyses have been conducted to demonstrate the feasibility and validity of this proposed image encryption method.

Controls on sinuosity in the sparsely vegetated Fossálar River, southern Iceland

NASA Astrophysics Data System (ADS)

Ielpi, Alessandro

2017-06-01

Vegetation exerts strong controls on fluvial sinuosity, providing bank stability and buffering surface runoff. These controls are manifest in densely vegetated landscapes, whereas sparsely vegetated fluvial systems have been so far overlooked. This study integrates remote sensing and gauging records of the meandering to wandering Fossálar River, a relatively steep-sloped (< 2.5%) Icelandic river featuring well-developed point bars (79%-85% of total active bar surface) despite the lack of thick, arborescent vegetation. Over four decades, fluctuations in the sinuosity index (1.15-1.43) and vegetation cover (63%-83%) are not significantly correlated (r = 0.28, p > 0.05), suggesting that relationships between the two are mediated by intervening variables and uncertain lag times. By comparison, discharge regime and fluvial planform show direct correlation over monthly to yearly time scales, with stable discharge stages accompanying the accretion of meander bends and peak floods related to destructive point-bar reworking. Rapid planform change is aided by the unconsolidated nature of unrooted alluvial banks, with recorded rates of lateral channel-belt migration averaging 18 m/yr. Valley confinement and channel mobility also control the geometry and evolution of individual point bars, with the highest degree of spatial geomorphic variability recorded in low-gradient stretches where lateral migration is unimpeded. Point bars in the Fossálar River display morphometric values comparable to those of other sparsely vegetated rivers, suggesting shared scalar properties. This conjecture prompts the need for more sophisticated integrations between remote sensing and gauging records on modern rivers lacking widespread plant life. While a large volume of experimental and field-based work maintains that thick vegetation has a critical role in limiting braiding, thus favouring sinuosity, this study demonstrates the stronger controls of discharge regime and alluvial morphology on sparsely vegetated sinuous rivers.

WAVELET-DOMAIN REGRESSION AND PREDICTIVE INFERENCE IN PSYCHIATRIC NEUROIMAGING

PubMed Central

Reiss, Philip T.; Huo, Lan; Zhao, Yihong; Kelly, Clare; Ogden, R. Todd

2016-01-01

An increasingly important goal of psychiatry is the use of brain imaging data to develop predictive models. Here we present two contributions to statistical methodology for this purpose. First, we propose and compare a set of wavelet-domain procedures for fitting generalized linear models with scalar responses and image predictors: sparse variants of principal component regression and of partial least squares, and the elastic net. Second, we consider assessing the contribution of image predictors over and above available scalar predictors, in particular via permutation tests and an extension of the idea of confounding to the case of functional or image predictors. Using the proposed methods, we assess whether maps of a spontaneous brain activity measure, derived from functional magnetic resonance imaging, can meaningfully predict presence or absence of attention deficit/hyperactivity disorder (ADHD). Our results shed light on the role of confounding in the surprising outcome of the recent ADHD-200 Global Competition, which challenged researchers to develop algorithms for automated image-based diagnosis of the disorder. PMID:27330652

Coherent beam combining in atmospheric channels using gated backscatter.

PubMed

Naeh, Itay; Katzir, Abraham

2016-02-01

This paper introduces the concept of atmospheric channels and describes a possible approach for the coherent beam combining of lasers of an optical phased array (OPA) in a turbulent atmosphere. By using the recently introduced sparse spectrum harmonic augmentation method, a comprehensive simulative investigation was performed and the exceptional properties of the atmospheric channels were numerically demonstrated. Among the interesting properties are the ability to guide light in a confined manner in a refractive channel, the ability to gather different sources to the same channel, and the ability to maintain a constant relative phase within the channel between several sources. The newly introduced guiding properties combined with a suggested method for channel probing and phase measurement by aerosol backscattered radiation allows coherence improvement of the phased array's elements and energy refocusing at the location of the channel in order to increase power in the bucket without feedback from the target. The method relies on the electronic focusing, electronic scanning, and time gating of the OPA, combined with elements of the relative phase measurements.

Block sparsity-based joint compressed sensing recovery of multi-channel ECG signals.

PubMed

Singh, Anurag; Dandapat, Samarendra

2017-04-01

In recent years, compressed sensing (CS) has emerged as an effective alternative to conventional wavelet based data compression techniques. This is due to its simple and energy-efficient data reduction procedure, which makes it suitable for resource-constrained wireless body area network (WBAN)-enabled electrocardiogram (ECG) telemonitoring applications. Both spatial and temporal correlations exist simultaneously in multi-channel ECG (MECG) signals. Exploitation of both types of correlations is very important in CS-based ECG telemonitoring systems for better performance. However, most of the existing CS-based works exploit either of the correlations, which results in a suboptimal performance. In this work, within a CS framework, the authors propose to exploit both types of correlations simultaneously using a sparse Bayesian learning-based approach. A spatiotemporal sparse model is employed for joint compression/reconstruction of MECG signals. Discrete wavelets transform domain block sparsity of MECG signals is exploited for simultaneous reconstruction of all the channels. Performance evaluations using Physikalisch-Technische Bundesanstalt MECG diagnostic database show a significant gain in the diagnostic reconstruction quality of the MECG signals compared with the state-of-the art techniques at reduced number of measurements. Low measurement requirement may lead to significant savings in the energy-cost of the existing CS-based WBAN systems.

Relationships among rotational and conventional grazing systems, stream channels, and macroinvertebrates

USGS Publications Warehouse

Raymond, K.L.; Vondracek, B.

2011-01-01

Cattle grazing in riparian areas can reduce water quality, alter stream channel characteristics, and alter fish and macroinvertebrate assemblage structure. The U.S. Department of Agriculture, Natural Resources Conservation Services has recommended Rotational Grazing (RG) as an alternative management method on livestock and dairy operations to protect riparian areas and water quality. We evaluated 13 stream channel characteristics, benthic macroinvertebrate larvae (BML), and chironomid pupal exuviae (CPE) from 18 sites in the Upper Midwest of the United States in relation to RG and conventional grazing (CG). A Biotic Composite Score comprised of several macroinvertebrate metrics was developed for both the BML assemblage and the CPE assemblage. Multi-Response Permutation Procedures (MRPP) indicated a significant difference in stream channel characteristics between RG and CG. Nonmetric Multidimensional Scaling indicated that RG sites were associated with more stable stream banks, higher quality aquatic habitat, lower soil compaction, and larger particles in the streambed. However, neither MRPP nor Mann-Whitney U tests demonstrated a difference in Biotic Composite Scores for BML or CPE along RG and CG sites. The BML and CPE metrics were significantly correlated, indicating that they were likely responding to similar variables among the study sites. Although stream channel characteristics appeared to respond to grazing management, BML and CPE may have responded to land use throughout the watershed, as well as local land use. ?? 2011 Springer Science+Business Media B.V. (outside the USA).

Overlap Cycles for Permutations: Necessary and Sufficient Conditions

DTIC Science & Technology

2013-09-19

for Weak Orders, To appear in SIAM Journal of Discrete Math . [9] G. Hurlbert and G. Isaak, Equivalence class universal cycles for permutations, Discrete ... Math . 149 (1996), pp. 123–129. [10] J. R. Johnson, Universal cycles for permutations, Discrete Math . 309 (2009), pp. 5264– 5270. [11] E. A. Ragland

Multi-response permutation procedure as an alternative to the analysis of variance: an SPSS implementation.

PubMed

Cai, Li

2006-02-01

A permutation test typically requires fewer assumptions than does a comparable parametric counterpart. The multi-response permutation procedure (MRPP) is a class of multivariate permutation tests of group difference useful for the analysis of experimental data. However, psychologists seldom make use of the MRPP in data analysis, in part because the MRPP is not implemented in popular statistical packages that psychologists use. A set of SPSS macros implementing the MRPP test is provided in this article. The use of the macros is illustrated by analyzing example data sets.

MIMO channel estimation and evaluation for airborne traffic surveillance in cellular networks

NASA Astrophysics Data System (ADS)

Vahidi, Vahid; Saberinia, Ebrahim

2018-01-01

A channel estimation (CE) procedure based on compressed sensing is proposed to estimate the multiple-input multiple-output sparse channel for traffic data transmission from drones to ground stations. The proposed procedure consists of an offline phase and a real-time phase. In the offline phase, a pilot arrangement method, which considers the interblock and block mutual coherence simultaneously, is proposed. The real-time phase contains three steps. At the first step, it obtains the priori estimate of the channel by block orthogonal matching pursuit; afterward, it utilizes that estimated channel to calculate the linear minimum mean square error of the received pilots. Finally, the block compressive sampling matching pursuit utilizes the enhanced received pilots to estimate the channel more accurately. The performance of the CE procedure is evaluated by simulating the transmission of traffic data through the communication channel and evaluating its fidelity for car detection after demodulation. Simulation results indicate that the proposed CE technique enhances the performance of the car detection in a traffic image considerably.

Single-Pixel Optical Fluctuation Analysis of Calcium Channel Function in Active Zones of Motor Nerve Terminals

PubMed Central

Luo, Fujun; Dittrich, Markus; Stiles, Joel R.; Meriney, Stephen D.

2011-01-01

We used high-resolution fluorescence imaging and single-pixel optical fluctuation analysis to estimate the opening probability of individual voltage-gated calcium (Ca2+) channels during an action potential and the number of such Ca2+ channels within active zones of frog neuromuscular junctions. Analysis revealed ~36 Ca2+ channels within each active zone, similar to the number of docked synaptic vesicles but far less than the total number of transmembrane particles reported based on freeze-fracture analysis (~200–250). The probability that each channel opened during an action potential was only ~0.2. These results suggest why each active zone averages only one quantal release event during every other action potential, despite a substantial number of docked vesicles. With sparse Ca2+ channels and low opening probability, triggering of fusion for each vesicle is primarily controlled by Ca2+ influx through individual Ca2+ channels. In contrast, the entire synapse is highly reliable because it contains hundreds of active zones. PMID:21813687

Using R to Simulate Permutation Distributions for Some Elementary Experimental Designs

ERIC Educational Resources Information Center

Eudey, T. Lynn; Kerr, Joshua D.; Trumbo, Bruce E.

2010-01-01

Null distributions of permutation tests for two-sample, paired, and block designs are simulated using the R statistical programming language. For each design and type of data, permutation tests are compared with standard normal-theory and nonparametric tests. These examples (often using real data) provide for classroom discussion use of metrics…

Circular permutation of a WW domain: Folding still occurs after excising the turn of the folding-nucleating hairpin

PubMed Central

Kier, Brandon L.; Anderson, Jordan M.; Andersen, Niels H.

2014-01-01

A hyperstable Pin1 WW domain has been circularly permuted via excision of the fold-nucleating turn; it still folds to form the native three-strand sheet and hydrophobic core features. Multiprobe folding dynamics studies of the normal and circularly permuted sequences, as well as their constituent hairpin fragments and comparable-length β-strand-loop-β-strand models, indicate 2-state folding for all topologies. N-terminal hairpin formation is the fold nucleating event for the wild-type sequence; the slower folding circular permutant has a more distributed folding transition state. PMID:24350581

Application of a sparseness constraint in multivariate curve resolution - Alternating least squares.

PubMed

Hugelier, Siewert; Piqueras, Sara; Bedia, Carmen; de Juan, Anna; Ruckebusch, Cyril

2018-02-13

The use of sparseness in chemometrics is a concept that has increased in popularity. The advantage is, above all, a better interpretability of the results obtained. In this work, sparseness is implemented as a constraint in multivariate curve resolution - alternating least squares (MCR-ALS), which aims at reproducing raw (mixed) data by a bilinear model of chemically meaningful profiles. In many cases, the mixed raw data analyzed are not sparse by nature, but their decomposition profiles can be, as it is the case in some instrumental responses, such as mass spectra, or in concentration profiles linked to scattered distribution maps of powdered samples in hyperspectral images. To induce sparseness in the constrained profiles, one-dimensional and/or two-dimensional numerical arrays can be fitted using a basis of Gaussian functions with a penalty on the coefficients. In this work, a least squares regression framework with L 0 -norm penalty is applied. This L 0 -norm penalty constrains the number of non-null coefficients in the fit of the array constrained without having an a priori on the number and their positions. It has been shown that the sparseness constraint induces the suppression of values linked to uninformative channels and noise in MS spectra and improves the location of scattered compounds in distribution maps, resulting in a better interpretability of the constrained profiles. An additional benefit of the sparseness constraint is a lower ambiguity in the bilinear model, since the major presence of null coefficients in the constrained profiles also helps to limit the solutions for the profiles in the counterpart matrix of the MCR bilinear model. Copyright © 2017 Elsevier B.V. All rights reserved.

Physical Connectivity Mapping by Circular Permutation of Human Telomerase RNA Reveals New Regions Critical for Activity and Processivity.

PubMed

Mefford, Melissa A; Zappulla, David C

2016-01-15

Telomerase is a specialized ribonucleoprotein complex that extends the 3' ends of chromosomes to counteract telomere shortening. However, increased telomerase activity is associated with ∼90% of human cancers. The telomerase enzyme minimally requires an RNA (hTR) and a specialized reverse transcriptase protein (TERT) for activity in vitro. Understanding the structure-function relationships within hTR has important implications for human disease. For the first time, we have tested the physical-connectivity requirements in the 451-nucleotide hTR RNA using circular permutations, which reposition the 5' and 3' ends. Our extensive in vitro analysis identified three classes of hTR circular permutants with altered function. First, circularly permuting 3' of the template causes specific defects in repeat-addition processivity, revealing that the template recognition element found in ciliates is conserved in human telomerase RNA. Second, seven circular permutations residing within the catalytically important core and CR4/5 domains completely abolish telomerase activity, unveiling mechanistically critical portions of these domains. Third, several circular permutations between the core and CR4/5 significantly increase telomerase activity. Our extensive circular permutation results provide insights into the architecture and coordination of human telomerase RNA and highlight where the RNA could be targeted for the development of antiaging and anticancer therapeutics. Copyright © 2016, American Society for Microbiology. All Rights Reserved.

Cipher image damage and decisions in real time

NASA Astrophysics Data System (ADS)

Silva-García, Victor Manuel; Flores-Carapia, Rolando; Rentería-Márquez, Carlos; Luna-Benoso, Benjamín; Jiménez-Vázquez, Cesar Antonio; González-Ramírez, Marlon David

2015-01-01

This paper proposes a method for constructing permutations on m position arrangements. Our objective is to encrypt color images using advanced encryption standard (AES), using variable permutations means a different one for each 128-bit block in the first round after the x-or operation is applied. Furthermore, this research offers the possibility of knowing the original image when the encrypted figure suffered a failure from either an attack or not. This is achieved by permuting the original image pixel positions before being encrypted with AES variable permutations, which means building a pseudorandom permutation of 250,000 position arrays or more. To this end, an algorithm that defines a bijective function between the nonnegative integer and permutation sets is built. From this algorithm, the way to build permutations on the 0,1,…,m-1 array, knowing m-1 constants, is presented. The transcendental numbers are used to select these m-1 constants in a pseudorandom way. The quality of the proposed encryption according to the following criteria is evaluated: the correlation coefficient, the entropy, and the discrete Fourier transform. A goodness-of-fit test for each basic color image is proposed to measure the bits randomness degree of the encrypted figure. On the other hand, cipher images are obtained in a loss-less encryption way, i.e., no JPEG file formats are used.

Physical Connectivity Mapping by Circular Permutation of Human Telomerase RNA Reveals New Regions Critical for Activity and Processivity

PubMed Central

Mefford, Melissa A.

2015-01-01

Telomerase is a specialized ribonucleoprotein complex that extends the 3′ ends of chromosomes to counteract telomere shortening. However, increased telomerase activity is associated with ∼90% of human cancers. The telomerase enzyme minimally requires an RNA (hTR) and a specialized reverse transcriptase protein (TERT) for activity in vitro. Understanding the structure-function relationships within hTR has important implications for human disease. For the first time, we have tested the physical-connectivity requirements in the 451-nucleotide hTR RNA using circular permutations, which reposition the 5′ and 3′ ends. Our extensive in vitro analysis identified three classes of hTR circular permutants with altered function. First, circularly permuting 3′ of the template causes specific defects in repeat-addition processivity, revealing that the template recognition element found in ciliates is conserved in human telomerase RNA. Second, seven circular permutations residing within the catalytically important core and CR4/5 domains completely abolish telomerase activity, unveiling mechanistically critical portions of these domains. Third, several circular permutations between the core and CR4/5 significantly increase telomerase activity. Our extensive circular permutation results provide insights into the architecture and coordination of human telomerase RNA and highlight where the RNA could be targeted for the development of antiaging and anticancer therapeutics. PMID:26503788

Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems.

PubMed

Yu, Xue; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Yuan, Huaqiang; Kwong, Sam; Zhang, Jun

2018-07-01

This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class and they can be very different. However, as the permutation-based MOCOPs share the inherent similarity that the structure of their search space is usually in the shape of a permutation tree, this paper proposes a generic multiobjective set-based particle swarm optimization methodology based on decomposition, termed MS-PSO/D. In order to coordinate with the property of permutation-based MOCOPs, MS-PSO/D utilizes an element-based representation and a constructive approach. Through this, feasible solutions under constraints can be generated step by step following the permutation-tree-shaped structure. And problem-related heuristic information is introduced in the constructive approach for efficiency. In order to address the multiobjective optimization issues, the decomposition strategy is employed, in which the problem is converted into multiple single-objective subproblems according to a set of weight vectors. Besides, a flexible mechanism for diversity control is provided in MS-PSO/D. Extensive experiments have been conducted to study MS-PSO/D on two permutation-based MOCOPs, namely the MOTSP and the MOPSP. Experimental results validate that the proposed methodology is promising.

Reconstruction of finite-valued sparse signals

NASA Astrophysics Data System (ADS)

Keiper, Sandra; Kutyniok, Gitta; Lee, Dae Gwan; Pfander, Götz

2017-08-01

The need of reconstructing discrete-valued sparse signals from few measurements, that is solving an undetermined system of linear equations, appears frequently in science and engineering. Those signals appear, for example, in error correcting codes as well as massive Multiple-Input Multiple-Output (MIMO) channel and wideband spectrum sensing. A particular example is given by wireless communications, where the transmitted signals are sequences of bits, i.e., with entries in f0; 1g. Whereas classical compressed sensing algorithms do not incorporate the additional knowledge of the discrete nature of the signal, classical lattice decoding approaches do not utilize sparsity constraints. In this talk, we present an approach that incorporates a discrete values prior into basis pursuit. In particular, we address finite-valued sparse signals, i.e., sparse signals with entries in a finite alphabet. We will introduce an equivalent null space characterization and show that phase transition takes place earlier than when using the classical basis pursuit approach. We will further discuss robustness of the algorithm and show that the nonnegative case is very different from the bipolar one. One of our findings is that the positioning of the zero in the alphabet - i.e., whether it is a boundary element or not - is crucial.

Altering the orientation of a fused protein to the RNA-binding ribosomal protein L7Ae and its derivatives through circular permutation.

PubMed

Ohuchi, Shoji J; Sagawa, Fumihiko; Sakamoto, Taiichi; Inoue, Tan

2015-10-23

RNA-protein complexes (RNPs) are useful for constructing functional nano-objects because a variety of functional proteins can be displayed on a designed RNA scaffold. Here, we report circular permutations of an RNA-binding protein L7Ae based on the three-dimensional structure information to alter the orientation of the displayed proteins on the RNA scaffold. An electrophoretic mobility shift assay and atomic force microscopy (AFM) analysis revealed that most of the designed circular permutants formed an RNP nano-object. Moreover, the alteration of the enhanced green fluorescent protein (EGFP) orientation was confirmed with AFM by employing EGFP on the L7Ae permutant on the RNA. The results demonstrate that targeted fine-tuning of the stereo-specific fixation of a protein on a protein-binding RNA is feasible by using the circular permutation technique. Copyright © 2015 Elsevier Inc. All rights reserved.

Linear models: permutation methods

USGS Publications Warehouse

Cade, B.S.; Everitt, B.S.; Howell, D.C.

2005-01-01

Permutation tests (see Permutation Based Inference) for the linear model have applications in behavioral studies when traditional parametric assumptions about the error term in a linear model are not tenable. Improved validity of Type I error rates can be achieved with properly constructed permutation tests. Perhaps more importantly, increased statistical power, improved robustness to effects of outliers, and detection of alternative distributional differences can be achieved by coupling permutation inference with alternative linear model estimators. For example, it is well-known that estimates of the mean in linear model are extremely sensitive to even a single outlying value of the dependent variable compared to estimates of the median [7, 19]. Traditionally, linear modeling focused on estimating changes in the center of distributions (means or medians). However, quantile regression allows distributional changes to be estimated in all or any selected part of a distribution or responses, providing a more complete statistical picture that has relevance to many biological questions [6]...

Altering the orientation of a fused protein to the RNA-binding ribosomal protein L7Ae and its derivatives through circular permutation

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

Ohuchi, Shoji J.; Sagawa, Fumihiko; Sakamoto, Taiichi

RNA-protein complexes (RNPs) are useful for constructing functional nano-objects because a variety of functional proteins can be displayed on a designed RNA scaffold. Here, we report circular permutations of an RNA-binding protein L7Ae based on the three-dimensional structure information to alter the orientation of the displayed proteins on the RNA scaffold. An electrophoretic mobility shift assay and atomic force microscopy (AFM) analysis revealed that most of the designed circular permutants formed an RNP nano-object. Moreover, the alteration of the enhanced green fluorescent protein (EGFP) orientation was confirmed with AFM by employing EGFP on the L7Ae permutant on the RNA. Themore » results demonstrate that targeted fine-tuning of the stereo-specific fixation of a protein on a protein-binding RNA is feasible by using the circular permutation technique.« less

Tensor-based Dictionary Learning for Spectral CT Reconstruction

PubMed Central

Zhang, Yanbo; Wang, Ge

2016-01-01

Spectral computed tomography (CT) produces an energy-discriminative attenuation map of an object, extending a conventional image volume with a spectral dimension. In spectral CT, an image can be sparsely represented in each of multiple energy channels, and are highly correlated among energy channels. According to this characteristics, we propose a tensor-based dictionary learning method for spectral CT reconstruction. In our method, tensor patches are extracted from an image tensor, which is reconstructed using the filtered backprojection (FBP), to form a training dataset. With the Candecomp/Parafac decomposition, a tensor-based dictionary is trained, in which each atom is a rank-one tensor. Then, the trained dictionary is used to sparsely represent image tensor patches during an iterative reconstruction process, and the alternating minimization scheme is adapted for optimization. The effectiveness of our proposed method is validated with both numerically simulated and real preclinical mouse datasets. The results demonstrate that the proposed tensor-based method generally produces superior image quality, and leads to more accurate material decomposition than the currently popular popular methods. PMID:27541628

CSI feedback-based CS for underwater acoustic adaptive modulation OFDM system with channel prediction

NASA Astrophysics Data System (ADS)

Kuai, Xiao-yan; Sun, Hai-xin; Qi, Jie; Cheng, En; Xu, Xiao-ka; Guo, Yu-hui; Chen, You-gan

2014-06-01

In this paper, we investigate the performance of adaptive modulation (AM) orthogonal frequency division multiplexing (OFDM) system in underwater acoustic (UWA) communications. The aim is to solve the problem of large feedback overhead for channel state information (CSI) in every subcarrier. A novel CSI feedback scheme is proposed based on the theory of compressed sensing (CS). We propose a feedback from the receiver that only feedback the sparse channel parameters. Additionally, prediction of the channel state is proposed every several symbols to realize the AM in practice. We describe a linear channel prediction algorithm which is used in adaptive transmission. This system has been tested in the real underwater acoustic channel. The linear channel prediction makes the AM transmission techniques more feasible for acoustic channel communications. The simulation and experiment show that significant improvements can be obtained both in bit error rate (BER) and throughput in the AM scheme compared with the fixed Quadrature Phase Shift Keying (QPSK) modulation scheme. Moreover, the performance with standard CS outperforms the Discrete Cosine Transform (DCT) method.

Analysis of spontaneous EEG activity in Alzheimer's disease using cross-sample entropy and graph theory.

PubMed

Gomez, Carlos; Poza, Jesus; Gomez-Pilar, Javier; Bachiller, Alejandro; Juan-Cruz, Celia; Tola-Arribas, Miguel A; Carreres, Alicia; Cano, Monica; Hornero, Roberto

2016-08-01

The aim of this pilot study was to analyze spontaneous electroencephalography (EEG) activity in Alzheimer's disease (AD) by means of Cross-Sample Entropy (Cross-SampEn) and two local measures derived from graph theory: clustering coefficient (CC) and characteristic path length (PL). Five minutes of EEG activity were recorded from 37 patients with dementia due to AD and 29 elderly controls. Our results showed that Cross-SampEn values were lower in the AD group than in the control one for all the interactions among EEG channels. This finding indicates that EEG activity in AD is characterized by a lower statistical dissimilarity among channels. Significant differences were found mainly for fronto-central interactions (p <; 0.01, permutation test). Additionally, the application of graph theory measures revealed diverse neural network changes, i.e. lower CC and higher PL values in AD group, leading to a less efficient brain organization. This study suggests the usefulness of our approach to provide further insights into the underlying brain dynamics associated with AD.

Permutation inference for the general linear model

PubMed Central

Winkler, Anderson M.; Ridgway, Gerard R.; Webster, Matthew A.; Smith, Stephen M.; Nichols, Thomas E.

2014-01-01

Permutation methods can provide exact control of false positives and allow the use of non-standard statistics, making only weak assumptions about the data. With the availability of fast and inexpensive computing, their main limitation would be some lack of flexibility to work with arbitrary experimental designs. In this paper we report on results on approximate permutation methods that are more flexible with respect to the experimental design and nuisance variables, and conduct detailed simulations to identify the best method for settings that are typical for imaging research scenarios. We present a generic framework for permutation inference for complex general linear models (glms) when the errors are exchangeable and/or have a symmetric distribution, and show that, even in the presence of nuisance effects, these permutation inferences are powerful while providing excellent control of false positives in a wide range of common and relevant imaging research scenarios. We also demonstrate how the inference on glm parameters, originally intended for independent data, can be used in certain special but useful cases in which independence is violated. Detailed examples of common neuroimaging applications are provided, as well as a complete algorithm – the “randomise” algorithm – for permutation inference with the glm. PMID:24530839

Automatic event detection in low SNR microseismic signals based on multi-scale permutation entropy and a support vector machine

NASA Astrophysics Data System (ADS)

Jia, Rui-Sheng; Sun, Hong-Mei; Peng, Yan-Jun; Liang, Yong-Quan; Lu, Xin-Ming

2017-07-01

Microseismic monitoring is an effective means for providing early warning of rock or coal dynamical disasters, and its first step is microseismic event detection, although low SNR microseismic signals often cannot effectively be detected by routine methods. To solve this problem, this paper presents permutation entropy and a support vector machine to detect low SNR microseismic events. First, an extraction method of signal features based on multi-scale permutation entropy is proposed by studying the influence of the scale factor on the signal permutation entropy. Second, the detection model of low SNR microseismic events based on the least squares support vector machine is built by performing a multi-scale permutation entropy calculation for the collected vibration signals, constructing a feature vector set of signals. Finally, a comparative analysis of the microseismic events and noise signals in the experiment proves that the different characteristics of the two can be fully expressed by using multi-scale permutation entropy. The detection model of microseismic events combined with the support vector machine, which has the features of high classification accuracy and fast real-time algorithms, can meet the requirements of online, real-time extractions of microseismic events.

Modulation of a protein free-energy landscape by circular permutation.

PubMed

Radou, Gaël; Enciso, Marta; Krivov, Sergei; Paci, Emanuele

2013-11-07

Circular permutations usually retain the native structure and function of a protein while inevitably perturbing its folding dynamics. By using simulations with a structure-based model and a rigorous methodology to determine free-energy surfaces from trajectories, we evaluate the effect of a circular permutation on the free-energy landscape of the protein T4 lysozyme. We observe changes which, although subtle, largely affect the cooperativity between the two subdomains. Such a change in cooperativity has been previously experimentally observed and recently also characterized using single molecule optical tweezers and the Crooks relation. The free-energy landscapes show that both the wild type and circular permutant have an on-pathway intermediate, previously experimentally characterized, in which one of the subdomains is completely formed. The landscapes, however, differ in the position of the rate-limiting step for folding, which occurs before the intermediate in the wild type and after in the circular permutant. This shift of transition state explains the observed change in the cooperativity. The underlying free-energy landscape thus provides a microscopic description of the folding dynamics and the connection between circular permutation and the loss of cooperativity experimentally observed.

SANC: the process γγ → ΖΖ

NASA Astrophysics Data System (ADS)

Bardin, D.; Bondarenko, S.; Christova, P.; Kalinovskaya, L.; von Schlippe, W.; Uglov, E.

2017-11-01

The implementation of the process γγ → ΖΖ at the one-loop level within SANC system multichannel approach is considered. The derived one-loop scalar form factors can be used for any cross channel after an appropriate permutation of their arguments-Mandelstam variables s, t, u. To check of the correctness of the results we observe the independence of the scalar form factors on the gauge parameters and the validity of Ward identity (external photon transversality). We present the complete analytical results for the covariant and tensor structures and helicity amplitudes for this process. We make an extensive comparison of our analytical and numerical results with those existing in the literature.

Toward a general theory of conical intersections in systems of identical nuclei

NASA Astrophysics Data System (ADS)

Keating, Sean P.; Mead, C. Alden

1987-02-01

It has been shown previously that the Herzberg-Longuet-Higgins sign change produced in Born-Oppenheimer electronic wave functions when the nuclei traverse a closed path around a conical intersection has implications for the symmetry of wave functions under permutations of identical nuclei. For systems of three or four identical nuclei, there are special features present which have facilitated the detailed analysis. The present paper reports progress toward a general theory for systems of n nuclei. For n=3 or 4, the two key functions which locate conical intersections and define compensating phase factors can conveniently be defined so as to transform under permutations according to a two-dimensional irreducible representation of the permutation group. Since such representations do not exist for n>4, we have chosen to develop a formalism in terms of lab-fixed electronic basis functions, and we show how to define the two key functions in principle. The functions so defined both turn out to be totally symmetric under permutations. We show how they can be used to define compensating phase factors so that all modified electronic wave functions are either totally symmetric or totally antisymmetric under permutations. A detailed analysis is made to cyclic permutations in the neighborhood of Dnh symmetry, which can be extended by continuity arguments to more general configurations, and criteria are obtained for sign changes. There is a qualitative discussion of the treatment of more general permutations.

Complex sparse spatial filter for decoding mixed frequency and phase coded steady-state visually evoked potentials.

PubMed

Morikawa, Naoki; Tanaka, Toshihisa; Islam, Md Rabiul

2018-07-01

Mixed frequency and phase coding (FPC) can achieve the significant increase of the number of commands in steady-state visual evoked potential-based brain-computer interface (SSVEP-BCI). However, the inconsistent phases of the SSVEP over channels in a trial and the existence of non-contributing channels due to noise effects can decrease accurate detection of stimulus frequency. We propose a novel command detection method based on a complex sparse spatial filter (CSSF) by solving ℓ 1 - and ℓ 2,1 -regularization problems for a mixed-coded SSVEP-BCI. In particular, ℓ 2,1 -regularization (aka group sparsification) can lead to the rejection of electrodes that are not contributing to the SSVEP detection. A calibration data based canonical correlation analysis (CCA) and CSSF with ℓ 1 - and ℓ 2,1 -regularization cases were demonstrated for a 16-target stimuli with eleven subjects. The results of statistical test suggest that the proposed method with ℓ 1 - and ℓ 2,1 -regularization significantly achieved the highest ITR. The proposed approaches do not need any reference signals, automatically select prominent channels, and reduce the computational cost compared to the other mixed frequency-phase coding (FPC)-based BCIs. The experimental results suggested that the proposed method can be usable implementing BCI effectively with reduce visual fatigue. Copyright © 2018 Elsevier B.V. All rights reserved.

A Fast and Accurate Sparse Continuous Signal Reconstruction by Homotopy DCD with Non-Convex Regularization

PubMed Central

Wang, Tianyun; Lu, Xinfei; Yu, Xiaofei; Xi, Zhendong; Chen, Weidong

2014-01-01

In recent years, various applications regarding sparse continuous signal recovery such as source localization, radar imaging, communication channel estimation, etc., have been addressed from the perspective of compressive sensing (CS) theory. However, there are two major defects that need to be tackled when considering any practical utilization. The first issue is off-grid problem caused by the basis mismatch between arbitrary located unknowns and the pre-specified dictionary, which would make conventional CS reconstruction methods degrade considerably. The second important issue is the urgent demand for low-complexity algorithms, especially when faced with the requirement of real-time implementation. In this paper, to deal with these two problems, we have presented three fast and accurate sparse reconstruction algorithms, termed as HR-DCD, Hlog-DCD and Hlp-DCD, which are based on homotopy, dichotomous coordinate descent (DCD) iterations and non-convex regularizations, by combining with the grid refinement technique. Experimental results are provided to demonstrate the effectiveness of the proposed algorithms and related analysis. PMID:24675758

Permutation parity machines for neural cryptography.

PubMed

Reyes, Oscar Mauricio; Zimmermann, Karl-Heinz

2010-06-01

Recently, synchronization was proved for permutation parity machines, multilayer feed-forward neural networks proposed as a binary variant of the tree parity machines. This ability was already used in the case of tree parity machines to introduce a key-exchange protocol. In this paper, a protocol based on permutation parity machines is proposed and its performance against common attacks (simple, geometric, majority and genetic) is studied.

Inference for Distributions over the Permutation Group

DTIC Science & Technology

2008-05-01

world problems, such as voting , ranking, and data association. Representing uncertainty over permutations is challenging, since there are n...problems, such as voting , ranking, and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities...the Krone ker (or Tensor ) Produ t Representation.In general, the Krone ker produ t representation is redu ible, and so it ande omposed into a dire t

Students' Errors in Solving the Permutation and Combination Problems Based on Problem Solving Steps of Polya

ERIC Educational Resources Information Center

Sukoriyanto; Nusantara, Toto; Subanji; Chandra, Tjang Daniel

2016-01-01

This article was written based on the results of a study evaluating students' errors in problem solving of permutation and combination in terms of problem solving steps according to Polya. Twenty-five students were asked to do four problems related to permutation and combination. The research results showed that the students still did a mistake in…

Permutation parity machines for neural cryptography

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

Reyes, Oscar Mauricio; Escuela de Ingenieria Electrica, Electronica y Telecomunicaciones, Universidad Industrial de Santander, Bucaramanga; Zimmermann, Karl-Heinz

2010-06-15

Recently, synchronization was proved for permutation parity machines, multilayer feed-forward neural networks proposed as a binary variant of the tree parity machines. This ability was already used in the case of tree parity machines to introduce a key-exchange protocol. In this paper, a protocol based on permutation parity machines is proposed and its performance against common attacks (simple, geometric, majority and genetic) is studied.

Sorting signed permutations by short operations.

PubMed

Galvão, Gustavo Rodrigues; Lee, Orlando; Dias, Zanoni

2015-01-01

During evolution, global mutations may alter the order and the orientation of the genes in a genome. Such mutations are referred to as rearrangement events, or simply operations. In unichromosomal genomes, the most common operations are reversals, which are responsible for reversing the order and orientation of a sequence of genes, and transpositions, which are responsible for switching the location of two contiguous portions of a genome. The problem of computing the minimum sequence of operations that transforms one genome into another - which is equivalent to the problem of sorting a permutation into the identity permutation - is a well-studied problem that finds application in comparative genomics. There are a number of works concerning this problem in the literature, but they generally do not take into account the length of the operations (i.e. the number of genes affected by the operations). Since it has been observed that short operations are prevalent in the evolution of some species, algorithms that efficiently solve this problem in the special case of short operations are of interest. In this paper, we investigate the problem of sorting a signed permutation by short operations. More precisely, we study four flavors of this problem: (i) the problem of sorting a signed permutation by reversals of length at most 2; (ii) the problem of sorting a signed permutation by reversals of length at most 3; (iii) the problem of sorting a signed permutation by reversals and transpositions of length at most 2; and (iv) the problem of sorting a signed permutation by reversals and transpositions of length at most 3. We present polynomial-time solutions for problems (i) and (iii), a 5-approximation for problem (ii), and a 3-approximation for problem (iv). Moreover, we show that the expected approximation ratio of the 5-approximation algorithm is not greater than 3 for random signed permutations with more than 12 elements. Finally, we present experimental results that show that the approximation ratios of the approximation algorithms cannot be smaller than 3. In particular, this means that the approximation ratio of the 3-approximation algorithm is tight.

Sedimentological analysis and bed thickness statistics from a Carboniferous deep-water channel-levee complex: Myall Trough, SE Australia

NASA Astrophysics Data System (ADS)

Palozzi, Jason; Pantopoulos, George; Maravelis, Angelos G.; Nordsvan, Adam; Zelilidis, Avraam

2018-02-01

This investigation presents an outcrop-based integrated study of internal division analysis and statistical treatment of turbidite bed thickness applied to a Carboniferous deep-water channel-levee complex in the Myall Trough, southeast Australia. Turbidite beds of the studied succession are characterized by a range of sedimentary structures grouped into two main associations, a thick-bedded and a thin-bedded one, that reflect channel-fill and overbank/levee deposits, respectively. Three vertically stacked channel-levee cycles have been identified. Results of statistical analysis of bed thickness, grain-size and internal division patterns applied on the studied channel-levee succession, indicate that turbidite bed thickness data seem to be well characterized by a bimodal lognormal distribution, which is possibly reflecting the difference between deposition from lower-density flows (in a levee/overbank setting) and very high-density flows (in a channel fill setting). Power law and exponential distributions were observed to hold only for the thick-bedded parts of the succession and cannot characterize the whole bed thickness range of the studied sediments. The succession also exhibits non-random clustering of bed thickness and grain-size measurements. The studied sediments are also characterized by the presence of statistically detected fining-upward sandstone packets. A novel quantitative approach (change-point analysis) is proposed for the detection of those packets. Markov permutation statistics also revealed the existence of order in the alternation of internal divisions in the succession expressed by an optimal internal division cycle reflecting two main types of gravity flow events deposited within both thick-bedded conglomeratic and thin-bedded sandstone associations. The analytical methods presented in this study can be used as additional tools for quantitative analysis and recognition of depositional environments in hydrocarbon-bearing research of ancient deep-water channel-levee settings.

Mechanism of auxiliary β-subunit-mediated membrane targeting of L-type (CaV1.2) channels

PubMed Central

Fang, Kun; Colecraft, Henry M

2011-01-01

Abstract Ca2+ influx via CaV1/CaV2 channels drives processes ranging from neurotransmission to muscle contraction. Association of a pore-forming α1 and cytosolic β is necessary for trafficking CaV1/CaV2 channels to the cell surface through poorly understood mechanisms. A prevalent idea suggests β binds the α1 intracellular I–II loop, masking an endoplasmic reticulum (ER) retention signal as the dominant mechanism for CaV1/CaV2 channel membrane trafficking. There are hints that other α1 subunit cytoplasmic domains may play a significant role, but the nature of their potential contribution is unclear. We assessed the roles of all intracellular domains of CaV1.2-α1C by generating chimeras featuring substitutions of all possible permutations of intracellular loops/termini of α1C into the β-independent CaV3.1-α1G channel. Surprisingly, functional analyses demonstrated α1C I–II loop strongly increases channel surface density while other cytoplasmic domains had a competing opposing effect. Alanine-scanning mutagenesis identified an acidic-residue putative ER export motif responsible for the I–II loop-mediated increase in channel surface density. β-dependent increase in current arose as an emergent property requiring four α1C intracellular domains, with the I–II loop and C-terminus being essential. The results suggest β binding to the α1C I–II loop causes a C-terminus-dependent rearrangement of intracellular domains, shifting a balance of power between export signals on the I–II loop and retention signals elsewhere. PMID:21746784

Twenty Years of "Plug-and-Pond" Meadow Restoration: A Geomorphic Review

NASA Astrophysics Data System (ADS)

Natali, J.

2015-12-01

Channel incision has degraded the ecological function of wet meadows across montane regions of California. Conservation groups estimate that half of the Sierra Nevada's 333,000 acres of meadow are entrenched in a degraded state that is characterized by a shift from groundwater­fed, herbaceous vegetation to more sparse, drought­tolerant woody vegetation. My poster will present results of field research on a prominent restoration technique in California's montane meadows, the "Plug­and­Pond." Fundamentally, the technique re­channelizes the meadow by blocking flow into incised stream channels. Spoils dug from meadow sediments plug the incised channel, creating ponds as a by­product. One of three approaches to re­channelization ensues: (1) construct a new shallow and sinuous channel, (2) redirect flows into a remnant channel, (3) or allow the channel to define itself over the meadow floodplain. Re­ channelization aims to support overbank flows at 1.5 to 3 year recurrence intervals. Field surveys of ten of the oldest "plug-and-pond" meadow restoration projects in California reveal that channel bed degradation caused by meadow-scale changes to channel slope (i.e. culverts concentrating flows, channel straightening, meadow grazing) may be more conducive to intensive restoration approaches like Plug-and-Pond.

Sediment and channel-geometry investigations for the Kansas River bank stabilization study, Kansas, Nebraska, and Colorado

USGS Publications Warehouse

Osterkamp, W.R.; Curtis, R.E.; Crowther, H.G.

1982-01-01

Analysis of hydrologic data from the Kansas River basin suggests that the channels of the lower Solomon, Saline, and Smoky Hill Rivers have narrowed and stabilized as a result of construction of upstream reservoirs. The Kansas River channel, however, remains relatively unstable and locally active. Streamflow regulation and sediment trapping by reservoirs are possible causes of changes occurring at various Kansas River sites. An inferred deficiency of the suspended-sediment load, however, is likely to cause continuing instability. Suspended sediment in the Kansas River apparently is too sparse to form and maintain stable alluvial banks. The deficiency probably results in an increase of bed material movement, general channel widening, and local braiding. Significant channel degradation is lacking at most sites, but may occur in response to long-term (decades-to-centuries) regulation. Recent degradation near Bonner Springs, Kans., may be the result of sand and gravel removal. Any imposed changes that shorten the channel or reduce the suspended-sediment discharge of the Kansas River are expected to cause additional channel instability. (USGS)

Determining distinct circuit in complete graphs using permutation

NASA Astrophysics Data System (ADS)

Karim, Sharmila; Ibrahim, Haslinda; Darus, Maizon Mohd

2017-11-01

A Half Butterfly Method (HBM) is a method introduced to construct the distinct circuits in complete graphs where used the concept of isomorphism. The Half Butterfly Method was applied in the field of combinatorics such as in listing permutations of n elements. However the method of determining distinct circuit using HBM for n > 4 is become tedious. Thus, in this paper, we present the method of generating distinct circuit using permutation.

A Versatile Platform for Nanotechnology Based on Circular Permutation of a Chaperonin Protein

NASA Technical Reports Server (NTRS)

Paavola, Chad; McMillan, Andrew; Trent, Jonathan; Chan, Suzanne; Mazzarella, Kellen; Li, Yi-Fen

2004-01-01

A number of protein complexes have been developed as nanoscale templates. These templates can be functionalized using the peptide sequences that bind inorganic materials. However, it is difficult to integrate peptides into a specific position within a protein template. Integrating intact proteins with desirable binding or catalytic activities is an even greater challenge. We present a general method for modifying protein templates using circular permutation so that additional peptide sequence can be added in a wide variety of specific locations. Circular permutation is a reordering of the polypeptide chain such that the original termini are joined and new termini are created elsewhere in the protein. New sequence can be joined to the protein termini without perturbing the protein structure and with minimal limitation on the size and conformation of the added sequence. We have used this approach to modify a chaperonin protein template, placing termini at five different locations distributed across the surface of the protein complex. These permutants are competent to form the double-ring structures typical of chaperonin proteins. The permuted double-rings also form the same assemblies as the unmodified protein. We fused a fluorescent protein to two representative permutants and demonstrated that it assumes its active structure and does not interfere with assembly of chaperonin double-rings.

An empirical study using permutation-based resampling in meta-regression

PubMed Central

2012-01-01

Background In meta-regression, as the number of trials in the analyses decreases, the risk of false positives or false negatives increases. This is partly due to the assumption of normality that may not hold in small samples. Creation of a distribution from the observed trials using permutation methods to calculate P values may allow for less spurious findings. Permutation has not been empirically tested in meta-regression. The objective of this study was to perform an empirical investigation to explore the differences in results for meta-analyses on a small number of trials using standard large sample approaches verses permutation-based methods for meta-regression. Methods We isolated a sample of randomized controlled clinical trials (RCTs) for interventions that have a small number of trials (herbal medicine trials). Trials were then grouped by herbal species and condition and assessed for methodological quality using the Jadad scale, and data were extracted for each outcome. Finally, we performed meta-analyses on the primary outcome of each group of trials and meta-regression for methodological quality subgroups within each meta-analysis. We used large sample methods and permutation methods in our meta-regression modeling. We then compared final models and final P values between methods. Results We collected 110 trials across 5 intervention/outcome pairings and 5 to 10 trials per covariate. When applying large sample methods and permutation-based methods in our backwards stepwise regression the covariates in the final models were identical in all cases. The P values for the covariates in the final model were larger in 78% (7/9) of the cases for permutation and identical for 22% (2/9) of the cases. Conclusions We present empirical evidence that permutation-based resampling may not change final models when using backwards stepwise regression, but may increase P values in meta-regression of multiple covariates for relatively small amount of trials. PMID:22587815

An analysis of spectral envelope-reduction via quadratic assignment problems

NASA Technical Reports Server (NTRS)

George, Alan; Pothen, Alex

1994-01-01

A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

Supervised Learning Based on Temporal Coding in Spiking Neural Networks.

PubMed

Mostafa, Hesham

2017-08-01

Gradient descent training techniques are remarkably successful in training analog-valued artificial neural networks (ANNs). Such training techniques, however, do not transfer easily to spiking networks due to the spike generation hard nonlinearity and the discrete nature of spike communication. We show that in a feedforward spiking network that uses a temporal coding scheme where information is encoded in spike times instead of spike rates, the network input-output relation is differentiable almost everywhere. Moreover, this relation is piecewise linear after a transformation of variables. Methods for training ANNs thus carry directly to the training of such spiking networks as we show when training on the permutation invariant MNIST task. In contrast to rate-based spiking networks that are often used to approximate the behavior of ANNs, the networks we present spike much more sparsely and their behavior cannot be directly approximated by conventional ANNs. Our results highlight a new approach for controlling the behavior of spiking networks with realistic temporal dynamics, opening up the potential for using these networks to process spike patterns with complex temporal information.

A physiologically motivated sparse, compact, and smooth (SCS) approach to EEG source localization.

PubMed

Cao, Cheng; Akalin Acar, Zeynep; Kreutz-Delgado, Kenneth; Makeig, Scott

2012-01-01

Here, we introduce a novel approach to the EEG inverse problem based on the assumption that principal cortical sources of multi-channel EEG recordings may be assumed to be spatially sparse, compact, and smooth (SCS). To enforce these characteristics of solutions to the EEG inverse problem, we propose a correlation-variance model which factors a cortical source space covariance matrix into the multiplication of a pre-given correlation coefficient matrix and the square root of the diagonal variance matrix learned from the data under a Bayesian learning framework. We tested the SCS method using simulated EEG data with various SNR and applied it to a real ECOG data set. We compare the results of SCS to those of an established SBL algorithm.

Example-Based Image Colorization Using Locality Consistent Sparse Representation.

PubMed

Bo Li; Fuchen Zhao; Zhuo Su; Xiangguo Liang; Yu-Kun Lai; Rosin, Paul L

2017-11-01

Image colorization aims to produce a natural looking color image from a given gray-scale image, which remains a challenging problem. In this paper, we propose a novel example-based image colorization method exploiting a new locality consistent sparse representation. Given a single reference color image, our method automatically colorizes the target gray-scale image by sparse pursuit. For efficiency and robustness, our method operates at the superpixel level. We extract low-level intensity features, mid-level texture features, and high-level semantic features for each superpixel, which are then concatenated to form its descriptor. The collection of feature vectors for all the superpixels from the reference image composes the dictionary. We formulate colorization of target superpixels as a dictionary-based sparse reconstruction problem. Inspired by the observation that superpixels with similar spatial location and/or feature representation are likely to match spatially close regions from the reference image, we further introduce a locality promoting regularization term into the energy formulation, which substantially improves the matching consistency and subsequent colorization results. Target superpixels are colorized based on the chrominance information from the dominant reference superpixels. Finally, to further improve coherence while preserving sharpness, we develop a new edge-preserving filter for chrominance channels with the guidance from the target gray-scale image. To the best of our knowledge, this is the first work on sparse pursuit image colorization from single reference images. Experimental results demonstrate that our colorization method outperforms the state-of-the-art methods, both visually and quantitatively using a user study.

A Space-Time-Frequency Dictionary for Sparse Cortical Source Localization.

PubMed

Korats, Gundars; Le Cam, Steven; Ranta, Radu; Louis-Dorr, Valerie

2016-09-01

Cortical source imaging aims at identifying activated cortical areas on the surface of the cortex from the raw electroencephalogram (EEG) data. This problem is ill posed, the number of channels being very low compared to the number of possible source positions. In some realistic physiological situations, the active areas are sparse in space and of short time durations, and the amount of spatio-temporal data to carry the inversion is then limited. In this study, we propose an original data driven space-time-frequency (STF) dictionary which takes into account simultaneously both spatial and time-frequency sparseness while preserving smoothness in the time frequency (i.e., nonstationary smooth time courses in sparse locations). Based on these assumptions, we take benefit of the matching pursuit (MP) framework for selecting the most relevant atoms in this highly redundant dictionary. We apply two recent MP algorithms, single best replacement (SBR) and source deflated matching pursuit, and we compare the results using a spatial dictionary and the proposed STF dictionary to demonstrate the improvements of our multidimensional approach. We also provide comparison using well-established inversion methods, FOCUSS and RAP-MUSIC, analyzing performances under different degrees of nonstationarity and signal to noise ratio. Our STF dictionary combined with the SBR approach provides robust performances on realistic simulations. From a computational point of view, the algorithm is embedded in the wavelet domain, ensuring high efficiency in term of computation time. The proposed approach ensures fast and accurate sparse cortical localizations on highly nonstationary and noisy data.

A 1.375-approximation algorithm for sorting by transpositions.

PubMed

Elias, Isaac; Hartman, Tzvika

2006-01-01

Sorting permutations by transpositions is an important problem in genome rearrangements. A transposition is a rearrangement operation in which a segment is cut out of the permutation and pasted in a different location. The complexity of this problem is still open and it has been a 10-year-old open problem to improve the best known 1.5-approximation algorithm. In this paper, we provide a 1.375-approximation algorithm for sorting by transpositions. The algorithm is based on a new upper bound on the diameter of 3-permutations. In addition, we present some new results regarding the transposition diameter: we improve the lower bound for the transposition diameter of the symmetric group and determine the exact transposition diameter of simple permutations.

Permutational distribution of the log-rank statistic under random censorship with applications to carcinogenicity assays.

PubMed

Heimann, G; Neuhaus, G

1998-03-01

In the random censorship model, the log-rank test is often used for comparing a control group with different dose groups. If the number of tumors is small, so-called exact methods are often applied for computing critical values from a permutational distribution. Two of these exact methods are discussed and shown to be incorrect. The correct permutational distribution is derived and studied with respect to its behavior under unequal censoring in the light of recent results proving that the permutational version and the unconditional version of the log-rank test are asymptotically equivalent even under unequal censoring. The log-rank test is studied by simulations of a realistic scenario from a bioassay with small numbers of tumors.

Multi-channel EEG-based sleep stage classification with joint collaborative representation and multiple kernel learning.

PubMed

Shi, Jun; Liu, Xiao; Li, Yan; Zhang, Qi; Li, Yingjie; Ying, Shihui

2015-10-30

Electroencephalography (EEG) based sleep staging is commonly used in clinical routine. Feature extraction and representation plays a crucial role in EEG-based automatic classification of sleep stages. Sparse representation (SR) is a state-of-the-art unsupervised feature learning method suitable for EEG feature representation. Collaborative representation (CR) is an effective data coding method used as a classifier. Here we use CR as a data representation method to learn features from the EEG signal. A joint collaboration model is established to develop a multi-view learning algorithm, and generate joint CR (JCR) codes to fuse and represent multi-channel EEG signals. A two-stage multi-view learning-based sleep staging framework is then constructed, in which JCR and joint sparse representation (JSR) algorithms first fuse and learning the feature representation from multi-channel EEG signals, respectively. Multi-view JCR and JSR features are then integrated and sleep stages recognized by a multiple kernel extreme learning machine (MK-ELM) algorithm with grid search. The proposed two-stage multi-view learning algorithm achieves superior performance for sleep staging. With a K-means clustering based dictionary, the mean classification accuracy, sensitivity and specificity are 81.10 ± 0.15%, 71.42 ± 0.66% and 94.57 ± 0.07%, respectively; while with the dictionary learned using the submodular optimization method, they are 80.29 ± 0.22%, 71.26 ± 0.78% and 94.38 ± 0.10%, respectively. The two-stage multi-view learning based sleep staging framework outperforms all other classification methods compared in this work, while JCR is superior to JSR. The proposed multi-view learning framework has the potential for sleep staging based on multi-channel or multi-modality polysomnography signals. Copyright © 2015 Elsevier B.V. All rights reserved.

A Computationally Efficient Hypothesis Testing Method for Epistasis Analysis using Multifactor Dimensionality Reduction

PubMed Central

Pattin, Kristine A.; White, Bill C.; Barney, Nate; Gui, Jiang; Nelson, Heather H.; Kelsey, Karl R.; Andrew, Angeline S.; Karagas, Margaret R.; Moore, Jason H.

2008-01-01

Multifactor dimensionality reduction (MDR) was developed as a nonparametric and model-free data mining method for detecting, characterizing, and interpreting epistasis in the absence of significant main effects in genetic and epidemiologic studies of complex traits such as disease susceptibility. The goal of MDR is to change the representation of the data using a constructive induction algorithm to make nonadditive interactions easier to detect using any classification method such as naïve Bayes or logistic regression. Traditionally, MDR constructed variables have been evaluated with a naïve Bayes classifier that is combined with 10-fold cross validation to obtain an estimate of predictive accuracy or generalizability of epistasis models. Traditionally, we have used permutation testing to statistically evaluate the significance of models obtained through MDR. The advantage of permutation testing is that it controls for false-positives due to multiple testing. The disadvantage is that permutation testing is computationally expensive. This is in an important issue that arises in the context of detecting epistasis on a genome-wide scale. The goal of the present study was to develop and evaluate several alternatives to large-scale permutation testing for assessing the statistical significance of MDR models. Using data simulated from 70 different epistasis models, we compared the power and type I error rate of MDR using a 1000-fold permutation test with hypothesis testing using an extreme value distribution (EVD). We find that this new hypothesis testing method provides a reasonable alternative to the computationally expensive 1000-fold permutation test and is 50 times faster. We then demonstrate this new method by applying it to a genetic epidemiology study of bladder cancer susceptibility that was previously analyzed using MDR and assessed using a 1000-fold permutation test. PMID:18671250

Estrogen pathway polymorphisms in relation to primary open angle glaucoma: An analysis accounting for gender from the United States

PubMed Central

Loomis, Stephanie J.; Weinreb, Robert N.; Kang, Jae H.; Yaspan, Brian L.; Bailey, Jessica Cooke; Gaasterland, Douglas; Gaasterland, Terry; Lee, Richard K.; Scott, William K.; Lichter, Paul R.; Budenz, Donald L.; Liu, Yutao; Realini, Tony; Friedman, David S.; McCarty, Catherine A.; Moroi, Sayoko E.; Olson, Lana; Schuman, Joel S.; Singh, Kuldev; Vollrath, Douglas; Wollstein, Gadi; Zack, Donald J.; Brilliant, Murray; Sit, Arthur J.; Christen, William G.; Fingert, John; Kraft, Peter; Zhang, Kang; Allingham, R. Rand; Pericak-Vance, Margaret A.; Richards, Julia E.; Hauser, Michael A.; Haines, Jonathan L.; Wiggs, Janey L.

2013-01-01

Purpose Circulating estrogen levels are relevant in glaucoma phenotypic traits. We assessed the association between an estrogen metabolism single nucleotide polymorphism (SNP) panel in relation to primary open angle glaucoma (POAG), accounting for gender. Methods We included 3,108 POAG cases and 3,430 controls of both genders from the Glaucoma Genes and Environment (GLAUGEN) study and the National Eye Institute Glaucoma Human Genetics Collaboration (NEIGHBOR) consortium genotyped on the Illumina 660W-Quad platform. We assessed the relation between the SNP panels representative of estrogen metabolism and POAG using pathway- and gene-based approaches with the Pathway Analysis by Randomization Incorporating Structure (PARIS) software. PARIS executes a permutation algorithm to assess statistical significance relative to the pathways and genes of comparable genetic architecture. These analyses were performed using the meta-analyzed results from the GLAUGEN and NEIGHBOR data sets. We evaluated POAG overall as well as two subtypes of POAG defined as intraocular pressure (IOP) ≥22 mmHg (high-pressure glaucoma [HPG]) or IOP <22 mmHg (normal pressure glaucoma [NPG]) at diagnosis. We conducted these analyses for each gender separately and then jointly in men and women. Results Among women, the estrogen SNP pathway was associated with POAG overall (permuted p=0.006) and HPG (permuted p<0.001) but not NPG (permuted p=0.09). Interestingly, there was no relation between the estrogen SNP pathway and POAG when men were considered alone (permuted p>0.99). Among women, gene-based analyses revealed that the catechol-O-methyltransferase gene showed strong associations with HTG (permuted gene p≤0.001) and NPG (permuted gene p=0.01). Conclusions The estrogen SNP pathway was associated with POAG among women. PMID:23869166

Error-free holographic frames encryption with CA pixel-permutation encoding algorithm

NASA Astrophysics Data System (ADS)

Li, Xiaowei; Xiao, Dan; Wang, Qiong-Hua

2018-01-01

The security of video data is necessary in network security transmission hence cryptography is technique to make video data secure and unreadable to unauthorized users. In this paper, we propose a holographic frames encryption technique based on the cellular automata (CA) pixel-permutation encoding algorithm. The concise pixel-permutation algorithm is used to address the drawbacks of the traditional CA encoding methods. The effectiveness of the proposed video encoding method is demonstrated by simulation examples.

A Flexible Computational Framework Using R and Map-Reduce for Permutation Tests of Massive Genetic Analysis of Complex Traits.

PubMed

Mahjani, Behrang; Toor, Salman; Nettelblad, Carl; Holmgren, Sverker

2017-01-01

In quantitative trait locus (QTL) mapping significance of putative QTL is often determined using permutation testing. The computational needs to calculate the significance level are immense, 10 4 up to 10 8 or even more permutations can be needed. We have previously introduced the PruneDIRECT algorithm for multiple QTL scan with epistatic interactions. This algorithm has specific strengths for permutation testing. Here, we present a flexible, parallel computing framework for identifying multiple interacting QTL using the PruneDIRECT algorithm which uses the map-reduce model as implemented in Hadoop. The framework is implemented in R, a widely used software tool among geneticists. This enables users to rearrange algorithmic steps to adapt genetic models, search algorithms, and parallelization steps to their needs in a flexible way. Our work underlines the maturity of accessing distributed parallel computing for computationally demanding bioinformatics applications through building workflows within existing scientific environments. We investigate the PruneDIRECT algorithm, comparing its performance to exhaustive search and DIRECT algorithm using our framework on a public cloud resource. We find that PruneDIRECT is vastly superior for permutation testing, and perform 2 ×10 5 permutations for a 2D QTL problem in 15 hours, using 100 cloud processes. We show that our framework scales out almost linearly for a 3D QTL search.

Photographs and Committees: Activities That Help Students Discover Permutations and Combinations.

ERIC Educational Resources Information Center

Szydlik, Jennifer Earles

2000-01-01

Presents problem situations that support students when discovering the multiplication principle, permutations, combinations, Pascal's triangle, and relationships among those objects in a concrete context. (ASK)

A permutation characterization of Sturm global attractors of Hamiltonian type

NASA Astrophysics Data System (ADS)

Fiedler, Bernold; Rocha, Carlos; Wolfrum, Matthias

We consider Neumann boundary value problems of the form u=u+f on the interval 0⩽x⩽π for dissipative nonlinearities f=f(u). A permutation characterization for the global attractors of the semiflows generated by these equations is well known, even in the much more general case f=f(x,u,u). We present a permutation characterization for the global attractors in the restrictive class of nonlinearities f=f(u). In this class the stationary solutions of the parabolic equation satisfy the second order ODE v+f(v)=0 and we obtain the permutation characterization from a characterization of the set of 2 π-periodic orbits of this planar Hamiltonian system. Our results are based on a diligent discussion of this mere pendulum equation.

PBOOST: a GPU-based tool for parallel permutation tests in genome-wide association studies.

PubMed

Yang, Guangyuan; Jiang, Wei; Yang, Qiang; Yu, Weichuan

2015-05-01

The importance of testing associations allowing for interactions has been demonstrated by Marchini et al. (2005). A fast method detecting associations allowing for interactions has been proposed by Wan et al. (2010a). The method is based on likelihood ratio test with the assumption that the statistic follows the χ(2) distribution. Many single nucleotide polymorphism (SNP) pairs with significant associations allowing for interactions have been detected using their method. However, the assumption of χ(2) test requires the expected values in each cell of the contingency table to be at least five. This assumption is violated in some identified SNP pairs. In this case, likelihood ratio test may not be applicable any more. Permutation test is an ideal approach to checking the P-values calculated in likelihood ratio test because of its non-parametric nature. The P-values of SNP pairs having significant associations with disease are always extremely small. Thus, we need a huge number of permutations to achieve correspondingly high resolution for the P-values. In order to investigate whether the P-values from likelihood ratio tests are reliable, a fast permutation tool to accomplish large number of permutations is desirable. We developed a permutation tool named PBOOST. It is based on GPU with highly reliable P-value estimation. By using simulation data, we found that the P-values from likelihood ratio tests will have relative error of >100% when 50% cells in the contingency table have expected count less than five or when there is zero expected count in any of the contingency table cells. In terms of speed, PBOOST completed 10(7) permutations for a single SNP pair from the Wellcome Trust Case Control Consortium (WTCCC) genome data (Wellcome Trust Case Control Consortium, 2007) within 1 min on a single Nvidia Tesla M2090 device, while it took 60 min in a single CPU Intel Xeon E5-2650 to finish the same task. More importantly, when simultaneously testing 256 SNP pairs for 10(7) permutations, our tool took only 5 min, while the CPU program took 10 h. By permuting on a GPU cluster consisting of 40 nodes, we completed 10(12) permutations for all 280 SNP pairs reported with P-values smaller than 1.6 × 10⁻¹² in the WTCCC datasets in 1 week. The source code and sample data are available at http://bioinformatics.ust.hk/PBOOST.zip. gyang@ust.hk; eeyu@ust.hk Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Engineering calculations for solving the orbital allotment problem

NASA Technical Reports Server (NTRS)

Reilly, C.; Walton, E. K.; Mount-Campbell, C.; Caldecott, R.; Aebker, E.; Mata, F.

1988-01-01

Four approaches for calculating downlink interferences for shaped-beam antennas are described. An investigation of alternative mixed-integer programming models for satellite synthesis is summarized. Plans for coordinating the various programs developed under this grant are outlined. Two procedures for ordering satellites to initialize the k-permutation algorithm are proposed. Results are presented for the k-permutation algorithms. Feasible solutions are found for 5 of the 6 problems considered. Finally, it is demonstrated that the k-permutation algorithm can be used to solve arc allotment problems.

Kinetics and dynamics of the C(3P) + H2O reaction on a full-dimensional accurate triplet state potential energy surface.

PubMed

Li, Jun; Xie, Changjian; Guo, Hua

2017-08-30

A full dimensional accurate potential energy surface (PES) for the C( 3 P) and H 2 O reaction is developed based on ∼34 000 data points calculated at the level of the explicitly correlated unrestricted coupled cluster method with single, double, and perturbative triple excitations with the augmented correlation-consistent polarized triple zeta basis set (CCSD(T)-F12a/AVTZ). The PES is invariant with respect to the permutation of the two hydrogen atoms and the total root mean square error (RMSE) of the fit is only 0.31 kcal mol -1 . The PES features two barriers in the entrance channel and several potential minima, as well as multiple product channels. The rate coefficients of this reaction calculated using a transition-state theory and quasi-classical trajectory (QCT) method are small near room temperature, consistent with experiments. The reaction dynamics is also investigated with QCT on the new PES, which found that the reactivity is constrained by the entrance barriers and the final product branching is not statistical.

Chemical construction and structural permutation of neurotoxic natural product, antillatoxin: importance of the three-dimensional structure of the bulky side chain

PubMed Central

INOUE, Masayuki

2014-01-01

Antillatoxin 1 is a unique natural product that displays potent neurotoxic and neuritogenic activities through activation of voltage-gated sodium channels. The peptidic macrocycle of 1 was attached to a side chain with an exceptionally high degree of methylation. In this review, we discuss the total synthesis and biological evaluation of 1 and its analogues. First we describe an efficient synthetic route to 1. This strategy enabled the unified preparation of nine side chain analogues. Structure-activity relationship studies of these analogues revealed that subtle side chain modification leads to dramatic changes in activity, and detailed structural analyses indicated the importance of the overall size and three dimensional shape of the side chain. Based on these data, we designed and synthesized a photoresponsive analogue, proving that the activity of 1 was modulated via a photochemical reaction. The knowledge accumulated through these studies will be useful for the rational design of new tailor-made molecules to control the function and behavior of ion channels. PMID:24522155

Permutation invariant polynomial neural network approach to fitting potential energy surfaces. II. Four-atom systems

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

Li, Jun; Jiang, Bin; Guo, Hua, E-mail: hguo@unm.edu

2013-11-28

A rigorous, general, and simple method to fit global and permutation invariant potential energy surfaces (PESs) using neural networks (NNs) is discussed. This so-called permutation invariant polynomial neural network (PIP-NN) method imposes permutation symmetry by using in its input a set of symmetry functions based on PIPs. For systems with more than three atoms, it is shown that the number of symmetry functions in the input vector needs to be larger than the number of internal coordinates in order to include both the primary and secondary invariant polynomials. This PIP-NN method is successfully demonstrated in three atom-triatomic reactive systems, resultingmore » in full-dimensional global PESs with average errors on the order of meV. These PESs are used in full-dimensional quantum dynamical calculations.« less

The coupling analysis between stock market indices based on permutation measures

NASA Astrophysics Data System (ADS)

Shi, Wenbin; Shang, Pengjian; Xia, Jianan; Yeh, Chien-Hung

2016-04-01

Many information-theoretic methods have been proposed for analyzing the coupling dependence between time series. And it is significant to quantify the correlation relationship between financial sequences since the financial market is a complex evolved dynamic system. Recently, we developed a new permutation-based entropy, called cross-permutation entropy (CPE), to detect the coupling structures between two synchronous time series. In this paper, we extend the CPE method to weighted cross-permutation entropy (WCPE), to address some of CPE's limitations, mainly its inability to differentiate between distinct patterns of a certain motif and the sensitivity of patterns close to the noise floor. It shows more stable and reliable results than CPE does when applied it to spiky data and AR(1) processes. Besides, we adapt the CPE method to infer the complexity of short-length time series by freely changing the time delay, and test it with Gaussian random series and random walks. The modified method shows the advantages in reducing deviations of entropy estimation compared with the conventional one. Finally, the weighted cross-permutation entropy of eight important stock indices from the world financial markets is investigated, and some useful and interesting empirical results are obtained.

Permutation entropy of fractional Brownian motion and fractional Gaussian noise

NASA Astrophysics Data System (ADS)

Zunino, L.; Pérez, D. G.; Martín, M. T.; Garavaglia, M.; Plastino, A.; Rosso, O. A.

2008-06-01

We have worked out theoretical curves for the permutation entropy of the fractional Brownian motion and fractional Gaussian noise by using the Bandt and Shiha [C. Bandt, F. Shiha, J. Time Ser. Anal. 28 (2007) 646] theoretical predictions for their corresponding relative frequencies. Comparisons with numerical simulations show an excellent agreement. Furthermore, the entropy-gap in the transition between these processes, observed previously via numerical results, has been here theoretically validated. Also, we have analyzed the behaviour of the permutation entropy of the fractional Gaussian noise for different time delays.

A Comparison of Multiscale Permutation Entropy Measures in On-Line Depth of Anesthesia Monitoring

PubMed Central

Li, Xiaoli; Li, Duan; Li, Yongwang; Ursino, Mauro

2016-01-01

Objective Multiscale permutation entropy (MSPE) is becoming an interesting tool to explore neurophysiological mechanisms in recent years. In this study, six MSPE measures were proposed for on-line depth of anesthesia (DoA) monitoring to quantify the anesthetic effect on the real-time EEG recordings. The performance of these measures in describing the transient characters of simulated neural populations and clinical anesthesia EEG were evaluated and compared. Methods Six MSPE algorithms—derived from Shannon permutation entropy (SPE), Renyi permutation entropy (RPE) and Tsallis permutation entropy (TPE) combined with the decomposition procedures of coarse-graining (CG) method and moving average (MA) analysis—were studied. A thalamo-cortical neural mass model (TCNMM) was used to generate noise-free EEG under anesthesia to quantitatively assess the robustness of each MSPE measure against noise. Then, the clinical anesthesia EEG recordings from 20 patients were analyzed with these measures. To validate their effectiveness, the ability of six measures were compared in terms of tracking the dynamical changes in EEG data and the performance in state discrimination. The Pearson correlation coefficient (R) was used to assess the relationship among MSPE measures. Results CG-based MSPEs failed in on-line DoA monitoring at multiscale analysis. In on-line EEG analysis, the MA-based MSPE measures at 5 decomposed scales could track the transient changes of EEG recordings and statistically distinguish the awake state, unconsciousness and recovery of consciousness (RoC) state significantly. Compared to single-scale SPE and RPE, MSPEs had better anti-noise ability and MA-RPE at scale 5 performed best in this aspect. MA-TPE outperformed other measures with faster tracking speed of the loss of unconsciousness. Conclusions MA-based multiscale permutation entropies have the potential for on-line anesthesia EEG analysis with its simple computation and sensitivity to drug effect changes. CG-based multiscale permutation entropies may fail to describe the characteristics of EEG at high decomposition scales. PMID:27723803

A Comparison of Multiscale Permutation Entropy Measures in On-Line Depth of Anesthesia Monitoring.

PubMed

Su, Cui; Liang, Zhenhu; Li, Xiaoli; Li, Duan; Li, Yongwang; Ursino, Mauro

2016-01-01

Multiscale permutation entropy (MSPE) is becoming an interesting tool to explore neurophysiological mechanisms in recent years. In this study, six MSPE measures were proposed for on-line depth of anesthesia (DoA) monitoring to quantify the anesthetic effect on the real-time EEG recordings. The performance of these measures in describing the transient characters of simulated neural populations and clinical anesthesia EEG were evaluated and compared. Six MSPE algorithms-derived from Shannon permutation entropy (SPE), Renyi permutation entropy (RPE) and Tsallis permutation entropy (TPE) combined with the decomposition procedures of coarse-graining (CG) method and moving average (MA) analysis-were studied. A thalamo-cortical neural mass model (TCNMM) was used to generate noise-free EEG under anesthesia to quantitatively assess the robustness of each MSPE measure against noise. Then, the clinical anesthesia EEG recordings from 20 patients were analyzed with these measures. To validate their effectiveness, the ability of six measures were compared in terms of tracking the dynamical changes in EEG data and the performance in state discrimination. The Pearson correlation coefficient (R) was used to assess the relationship among MSPE measures. CG-based MSPEs failed in on-line DoA monitoring at multiscale analysis. In on-line EEG analysis, the MA-based MSPE measures at 5 decomposed scales could track the transient changes of EEG recordings and statistically distinguish the awake state, unconsciousness and recovery of consciousness (RoC) state significantly. Compared to single-scale SPE and RPE, MSPEs had better anti-noise ability and MA-RPE at scale 5 performed best in this aspect. MA-TPE outperformed other measures with faster tracking speed of the loss of unconsciousness. MA-based multiscale permutation entropies have the potential for on-line anesthesia EEG analysis with its simple computation and sensitivity to drug effect changes. CG-based multiscale permutation entropies may fail to describe the characteristics of EEG at high decomposition scales.

Multiple comparisons permutation test for image based data mining in radiotherapy.

PubMed

Chen, Chun; Witte, Marnix; Heemsbergen, Wilma; van Herk, Marcel

2013-12-23

: Comparing incidental dose distributions (i.e. images) of patients with different outcomes is a straightforward way to explore dose-response hypotheses in radiotherapy. In this paper, we introduced a permutation test that compares images, such as dose distributions from radiotherapy, while tackling the multiple comparisons problem. A test statistic Tmax was proposed that summarizes the differences between the images into a single value and a permutation procedure was employed to compute the adjusted p-value. We demonstrated the method in two retrospective studies: a prostate study that relates 3D dose distributions to failure, and an esophagus study that relates 2D surface dose distributions of the esophagus to acute esophagus toxicity. As a result, we were able to identify suspicious regions that are significantly associated with failure (prostate study) or toxicity (esophagus study). Permutation testing allows direct comparison of images from different patient categories and is a useful tool for data mining in radiotherapy.

Generalized permutation entropy analysis based on the two-index entropic form S q , δ

NASA Astrophysics Data System (ADS)

Xu, Mengjia; Shang, Pengjian

2015-05-01

Permutation entropy (PE) is a novel measure to quantify the complexity of nonlinear time series. In this paper, we propose a generalized permutation entropy ( P E q , δ ) based on the recently postulated entropic form, S q , δ , which was proposed as an unification of the well-known Sq of nonextensive-statistical mechanics and S δ , a possibly appropriate candidate for the black-hole entropy. We find that P E q , δ with appropriate parameters can amplify minor changes and trends of complexities in comparison to PE. Experiments with this generalized permutation entropy method are performed with both synthetic and stock data showing its power. Results show that P E q , δ is an exponential function of q and the power ( k ( δ ) ) is a constant if δ is determined. Some discussions about k ( δ ) are provided. Besides, we also find some interesting results about power law.

Permutational symmetries for coincidence rates in multimode multiphotonic interferometry

NASA Astrophysics Data System (ADS)

Khalid, Abdullah; Spivak, Dylan; Sanders, Barry C.; de Guise, Hubert

2018-06-01

We obtain coincidence rates for passive optical interferometry by exploiting the permutational symmetries of partially distinguishable input photons, and our approach elucidates qualitative features of multiphoton coincidence landscapes. We treat the interferometer input as a product state of any number of photons in each input mode with photons distinguished by their arrival time. Detectors at the output of the interferometer count photons from each output mode over a long integration time. We generalize and prove the claim of Tillmann et al. [Phys. Rev. X 5, 041015 (2015), 10.1103/PhysRevX.5.041015] that coincidence rates can be elegantly expressed in terms of immanants. Immanants are functions of matrices that exhibit permutational symmetries and the immanants appearing in our coincidence-rate expressions share permutational symmetries with the input state. Our results are obtained by employing representation theory of the symmetric group to analyze systems of an arbitrary number of photons in arbitrarily sized interferometers.

A Formal Messaging Notation for Alaskan Aviation Data

NASA Technical Reports Server (NTRS)

Rios, Joseph L.

2015-01-01

Data exchange is an increasingly important aspect of the National Airspace System. While many data communication channels have become more capable of sending and receiving data at higher throughput rates, there is still a need to use communication channels efficiently with limited throughput. The limitation can be based on technological issues, financial considerations, or both. This paper provides a complete description of several important aviation weather data in Abstract Syntax Notation format. By doing so, data providers can take advantage of Abstract Syntax Notation's ability to encode data in a highly compressed format. When data such as pilot weather reports, surface weather observations, and various weather predictions are compressed in such a manner, it allows for the efficient use of throughput-limited communication channels. This paper provides details on the Abstract Syntax Notation One (ASN.1) implementation for Alaskan aviation data, and demonstrates its use on real-world aviation weather data samples as Alaska has sparse terrestrial data infrastructure and data are often sent via relatively costly satellite channels.

Higher order explicit symmetric integrators for inseparable forms of coordinates and momenta

NASA Astrophysics Data System (ADS)

Liu, Lei; Wu, Xin; Huang, Guoqing; Liu, Fuyao

2016-06-01

Pihajoki proposed the extended phase-space second-order explicit symmetric leapfrog methods for inseparable Hamiltonian systems. On the basis of this work, we survey a critical problem on how to mix the variables in the extended phase space. Numerical tests show that sequent permutations of coordinates and momenta can make the leapfrog-like methods yield the most accurate results and the optimal long-term stabilized error behaviour. We also present a novel method to construct many fourth-order extended phase-space explicit symmetric integration schemes. Each scheme represents the symmetric production of six usual second-order leapfrogs without any permutations. This construction consists of four segments: the permuted coordinates, triple product of the usual second-order leapfrog without permutations, the permuted momenta and the triple product of the usual second-order leapfrog without permutations. Similarly, extended phase-space sixth, eighth and other higher order explicit symmetric algorithms are available. We used several inseparable Hamiltonian examples, such as the post-Newtonian approach of non-spinning compact binaries, to show that one of the proposed fourth-order methods is more efficient than the existing methods; examples include the fourth-order explicit symplectic integrators of Chin and the fourth-order explicit and implicit mixed symplectic integrators of Zhong et al. Given a moderate choice for the related mixing and projection maps, the extended phase-space explicit symplectic-like methods are well suited for various inseparable Hamiltonian problems. Samples of these problems involve the algorithmic regularization of gravitational systems with velocity-dependent perturbations in the Solar system and post-Newtonian Hamiltonian formulations of spinning compact objects.

Non-parametric combination and related permutation tests for neuroimaging.

PubMed

Winkler, Anderson M; Webster, Matthew A; Brooks, Jonathan C; Tracey, Irene; Smith, Stephen M; Nichols, Thomas E

2016-04-01

In this work, we show how permutation methods can be applied to combination analyses such as those that include multiple imaging modalities, multiple data acquisitions of the same modality, or simply multiple hypotheses on the same data. Using the well-known definition of union-intersection tests and closed testing procedures, we use synchronized permutations to correct for such multiplicity of tests, allowing flexibility to integrate imaging data with different spatial resolutions, surface and/or volume-based representations of the brain, including non-imaging data. For the problem of joint inference, we propose and evaluate a modification of the recently introduced non-parametric combination (NPC) methodology, such that instead of a two-phase algorithm and large data storage requirements, the inference can be performed in a single phase, with reasonable computational demands. The method compares favorably to classical multivariate tests (such as MANCOVA), even when the latter is assessed using permutations. We also evaluate, in the context of permutation tests, various combining methods that have been proposed in the past decades, and identify those that provide the best control over error rate and power across a range of situations. We show that one of these, the method of Tippett, provides a link between correction for the multiplicity of tests and their combination. Finally, we discuss how the correction can solve certain problems of multiple comparisons in one-way ANOVA designs, and how the combination is distinguished from conjunctions, even though both can be assessed using permutation tests. We also provide a common algorithm that accommodates combination and correction. © 2016 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.

Robust image obfuscation for privacy protection in Web 2.0 applications

NASA Astrophysics Data System (ADS)

Poller, Andreas; Steinebach, Martin; Liu, Huajian

2012-03-01

We present two approaches to robust image obfuscation based on permutation of image regions and channel intensity modulation. The proposed concept of robust image obfuscation is a step towards end-to-end security in Web 2.0 applications. It helps to protect the privacy of the users against threats caused by internet bots and web applications that extract biometric and other features from images for data-linkage purposes. The approaches described in this paper consider that images uploaded to Web 2.0 applications pass several transformations, such as scaling and JPEG compression, until the receiver downloads them. In contrast to existing approaches, our focus is on usability, therefore the primary goal is not a maximum of security but an acceptable trade-off between security and resulting image quality.

Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and Navigation Support

DTIC Science & Technology

2012-09-30

Estimation Methods for Underwater OFDM 5) Two Iterative Receivers for Distributed MIMO - OFDM with Large Doppler Deviations. 6) Asynchronous Multiuser...multi-input multi-output ( MIMO ) OFDM is also pursued, where it is shown that the proposed hybrid initialization enables drastically improved receiver...are investigated. 5) Two Iterative Receivers for Distributed MIMO - OFDM with Large Doppler Deviations. This work studies a distributed system with

Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and Navigation Support

DTIC Science & Technology

2013-09-30

underwater acoustic communication technologies for autonomous distributed underwater networks, through innovative signal processing, coding, and navigation...in real enviroments , an offshore testbed has been developed to conduct field experimetns. The testbed consists of four nodes and has been deployed...Leadership by the Connecticut Technology Council. Dr. Zhaohui Wang joined the faculty of the Department of Electrical and Computer Engineering at

Sylow p-groups of polynomial permutations on the integers mod pn☆

PubMed Central

Frisch, Sophie; Krenn, Daniel

2013-01-01

We enumerate and describe the Sylow p-groups of the groups of polynomial permutations of the integers mod pn for n⩾1 and of the pro-finite group which is the projective limit of these groups. PMID:26869732

Storage and computationally efficient permutations of factorized covariance and square-root information arrays

NASA Technical Reports Server (NTRS)

Muellerschoen, R. J.

1988-01-01

A unified method to permute vector stored Upper triangular Diagonal factorized covariance and vector stored upper triangular Square Root Information arrays is presented. The method involves cyclic permutation of the rows and columns of the arrays and retriangularization with fast (slow) Givens rotations (reflections). Minimal computation is performed, and a one dimensional scratch array is required. To make the method efficient for large arrays on a virtual memory machine, computations are arranged so as to avoid expensive paging faults. This method is potentially important for processing large volumes of radio metric data in the Deep Space Network.

Note on new KLT relations

NASA Astrophysics Data System (ADS)

Feng, Bo; He, Song; Huang, Rijun; Jia, Yin

2010-10-01

In this short note, we present two results about KLT relations discussed in recent several papers. Our first result is the re-derivation of Mason-Skinner MHV amplitude by applying the S n-3 permutation symmetric KLT relations directly to MHV amplitude. Our second result is the equivalence proof of the newly discovered S n-2 permutation symmetric KLT relations and the well-known S n-3 permutation symmetric KLT relations. Although both formulas have been shown to be correct by BCFW recursion relations, our result is the first direct check using the regularized definition of the new formula.

Combating HER2-overexpressing breast cancer through induction of calreticulin exposure by Tras-Permut CrossMab

PubMed Central

Zhang, Fan; Zhang, Jie; Liu, Moyan; Zhao, Lichao; LingHu, RuiXia; Feng, Fan; Gao, Xudong; Jiao, Shunchang; Zhao, Lei; Hu, Yi; Yang, Junlan

2015-01-01

Although trastuzumab has succeeded in breast cancer treatment, acquired resistance is one of the prime obstacles for breast cancer therapies. There is an urgent need to develop novel HER2 antibodies against trastuzumab resistance. Here, we first rational designed avidity-imporved trastuzumab and pertuzumab variants, and explored the correlation between the binding avidity improvement and their antitumor activities. After characterization of a pertuzumab variant L56TY with potent antitumor activities, a bispecific immunoglobulin G-like CrossMab (Tras-Permut CrossMab) was generated from trastuzumab and binding avidity-improved pertuzumab variant L56TY. Although, the antitumor efficacy of trastuzumab was not enhanced by improving its binding avidity, binding avidity improvement could significantly increase the anti-proliferative and antibody-dependent cellular cytotoxicity (ADCC) activities of pertuzumab. Further studies showed that Tras-Permut CrossMab exhibited exceptional high efficiency to inhibit the progression of trastuzumab-resistant breast cancer. Notably, we found that calreticulin (CRT) exposure induced by Tras-Permut CrossMab was essential for induction of tumor-specific T cell immunity against tumor recurrence. These data indicated that simultaneous blockade of HER2 protein by Tras-Permut CrossMab could trigger CRT exposure and subsequently induce potent tumor-specific T cell immunity, suggesting it could be a promising therapeutic strategy against trastuzumab resistance. PMID:25949918

Automatic NEPHIS Coding of Descriptive Titles for Permuted Index Generation.

ERIC Educational Resources Information Center

Craven, Timothy C.

1982-01-01

Describes a system for the automatic coding of most descriptive titles which generates Nested Phrase Indexing System (NEPHIS) input strings of sufficient quality for permuted index production. A series of examples and an 11-item reference list accompany the text. (JL)

A LANDSAT study of ephemeral and perennial rangeland vegetation and soils

NASA Technical Reports Server (NTRS)

Bentley, R. G., Jr. (Principal Investigator); Salmon-Drexler, B. C.; Bonner, W. J.; Vincent, R. K.

1976-01-01

The author has identified the following significant results. Several methods of computer processing were applied to LANDSAT data for mapping vegetation characteristics of perennial rangeland in Montana and ephemeral rangeland in Arizona. The choice of optimal processing technique was dependent on prescribed mapping and site condition. Single channel level slicing and ratioing of channels were used for simple enhancement. Predictive models for mapping percent vegetation cover based on data from field spectra and LANDSAT data were generated by multiple linear regression of six unique LANDSAT spectral ratios. Ratio gating logic and maximum likelihood classification were applied successfully to recognize plant communities in Montana. Maximum likelihood classification did little to improve recognition of terrain features when compared to a single channel density slice in sparsely vegetated Arizona. LANDSAT was found to be more sensitive to differences between plant communities based on percentages of vigorous vegetation than to actual physical or spectral differences among plant species.

A Vehicle Active Safety Model: Vehicle Speed Control Based on Driver Vigilance Detection Using Wearable EEG and Sparse Representation.

PubMed

Zhang, Zutao; Luo, Dianyuan; Rasim, Yagubov; Li, Yanjun; Meng, Guanjun; Xu, Jian; Wang, Chunbai

2016-02-19

In this paper, we present a vehicle active safety model for vehicle speed control based on driver vigilance detection using low-cost, comfortable, wearable electroencephalographic (EEG) sensors and sparse representation. The proposed system consists of three main steps, namely wireless wearable EEG collection, driver vigilance detection, and vehicle speed control strategy. First of all, a homemade low-cost comfortable wearable brain-computer interface (BCI) system with eight channels is designed for collecting the driver's EEG signal. Second, wavelet de-noising and down-sample algorithms are utilized to enhance the quality of EEG data, and Fast Fourier Transformation (FFT) is adopted to extract the EEG power spectrum density (PSD). In this step, sparse representation classification combined with k-singular value decomposition (KSVD) is firstly introduced in PSD to estimate the driver's vigilance level. Finally, a novel safety strategy of vehicle speed control, which controls the electronic throttle opening and automatic braking after driver fatigue detection using the above method, is presented to avoid serious collisions and traffic accidents. The simulation and practical testing results demonstrate the feasibility of the vehicle active safety model.

A Vehicle Active Safety Model: Vehicle Speed Control Based on Driver Vigilance Detection Using Wearable EEG and Sparse Representation

PubMed Central

Zhang, Zutao; Luo, Dianyuan; Rasim, Yagubov; Li, Yanjun; Meng, Guanjun; Xu, Jian; Wang, Chunbai

2016-01-01

In this paper, we present a vehicle active safety model for vehicle speed control based on driver vigilance detection using low-cost, comfortable, wearable electroencephalographic (EEG) sensors and sparse representation. The proposed system consists of three main steps, namely wireless wearable EEG collection, driver vigilance detection, and vehicle speed control strategy. First of all, a homemade low-cost comfortable wearable brain-computer interface (BCI) system with eight channels is designed for collecting the driver’s EEG signal. Second, wavelet de-noising and down-sample algorithms are utilized to enhance the quality of EEG data, and Fast Fourier Transformation (FFT) is adopted to extract the EEG power spectrum density (PSD). In this step, sparse representation classification combined with k-singular value decomposition (KSVD) is firstly introduced in PSD to estimate the driver’s vigilance level . Finally, a novel safety strategy of vehicle speed control, which controls the electronic throttle opening and automatic braking after driver fatigue detection using the above method, is presented to avoid serious collisions and traffic accidents. The simulation and practical testing results demonstrate the feasibility of the vehicle active safety model. PMID:26907278

Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network.

PubMed

Han, Changcai; Yang, Jinsheng

2017-10-30

The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes.

Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network

PubMed Central

Han, Changcai; Yang, Jinsheng

2017-01-01

The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes. PMID:29084155

Non‐parametric combination and related permutation tests for neuroimaging

PubMed Central

Webster, Matthew A.; Brooks, Jonathan C.; Tracey, Irene; Smith, Stephen M.; Nichols, Thomas E.

2016-01-01

Abstract In this work, we show how permutation methods can be applied to combination analyses such as those that include multiple imaging modalities, multiple data acquisitions of the same modality, or simply multiple hypotheses on the same data. Using the well‐known definition of union‐intersection tests and closed testing procedures, we use synchronized permutations to correct for such multiplicity of tests, allowing flexibility to integrate imaging data with different spatial resolutions, surface and/or volume‐based representations of the brain, including non‐imaging data. For the problem of joint inference, we propose and evaluate a modification of the recently introduced non‐parametric combination (NPC) methodology, such that instead of a two‐phase algorithm and large data storage requirements, the inference can be performed in a single phase, with reasonable computational demands. The method compares favorably to classical multivariate tests (such as MANCOVA), even when the latter is assessed using permutations. We also evaluate, in the context of permutation tests, various combining methods that have been proposed in the past decades, and identify those that provide the best control over error rate and power across a range of situations. We show that one of these, the method of Tippett, provides a link between correction for the multiplicity of tests and their combination. Finally, we discuss how the correction can solve certain problems of multiple comparisons in one‐way ANOVA designs, and how the combination is distinguished from conjunctions, even though both can be assessed using permutation tests. We also provide a common algorithm that accommodates combination and correction. Hum Brain Mapp 37:1486‐1511, 2016. © 2016 Wiley Periodicals, Inc. PMID:26848101

Application of a Combination of a Knowledge-Based Algorithm and 2-Stage Screening to Hypothesis-Free Genomic Data on Irinotecan-Treated Patients for Identification of a Candidate Single Nucleotide Polymorphism Related to an Adverse Effect

PubMed Central

Takahashi, Hiro; Sai, Kimie; Saito, Yoshiro; Kaniwa, Nahoko; Matsumura, Yasuhiro; Hamaguchi, Tetsuya; Shimada, Yasuhiro; Ohtsu, Atsushi; Yoshino, Takayuki; Doi, Toshihiko; Okuda, Haruhiro; Ichinohe, Risa; Takahashi, Anna; Doi, Ayano; Odaka, Yoko; Okuyama, Misuzu; Saijo, Nagahiro; Sawada, Jun-ichi; Sakamoto, Hiromi; Yoshida, Teruhiko

2014-01-01

Interindividual variation in a drug response among patients is known to cause serious problems in medicine. Genomic information has been proposed as the basis for “personalized” health care. The genome-wide association study (GWAS) is a powerful technique for examining single nucleotide polymorphisms (SNPs) and their relationship with drug response variation; however, when using only GWAS, it often happens that no useful SNPs are identified due to multiple testing problems. Therefore, in a previous study, we proposed a combined method consisting of a knowledge-based algorithm, 2 stages of screening, and a permutation test for identifying SNPs. In the present study, we applied this method to a pharmacogenomics study where 109,365 SNPs were genotyped using Illumina Human-1 BeadChip in 168 cancer patients treated with irinotecan chemotherapy. We identified the SNP rs9351963 in potassium voltage-gated channel subfamily KQT member 5 (KCNQ5) as a candidate factor related to incidence of irinotecan-induced diarrhea. The p value for rs9351963 was 3.31×10−5 in Fisher's exact test and 0.0289 in the permutation test (when multiple testing problems were corrected). Additionally, rs9351963 was clearly superior to the clinical parameters and the model involving rs9351963 showed sensitivity of 77.8% and specificity of 57.6% in the evaluation by means of logistic regression. Recent studies showed that KCNQ4 and KCNQ5 genes encode members of the M channel expressed in gastrointestinal smooth muscle and suggested that these genes are associated with irritable bowel syndrome and similar peristalsis diseases. These results suggest that rs9351963 in KCNQ5 is a possible predictive factor of incidence of diarrhea in cancer patients treated with irinotecan chemotherapy and for selecting chemotherapy regimens, such as irinotecan alone or a combination of irinotecan with a KCNQ5 opener. Nonetheless, clinical importance of rs9351963 should be further elucidated. PMID:25127363

Application of a combination of a knowledge-based algorithm and 2-stage screening to hypothesis-free genomic data on irinotecan-treated patients for identification of a candidate single nucleotide polymorphism related to an adverse effect.

PubMed

Takahashi, Hiro; Sai, Kimie; Saito, Yoshiro; Kaniwa, Nahoko; Matsumura, Yasuhiro; Hamaguchi, Tetsuya; Shimada, Yasuhiro; Ohtsu, Atsushi; Yoshino, Takayuki; Doi, Toshihiko; Okuda, Haruhiro; Ichinohe, Risa; Takahashi, Anna; Doi, Ayano; Odaka, Yoko; Okuyama, Misuzu; Saijo, Nagahiro; Sawada, Jun-ichi; Sakamoto, Hiromi; Yoshida, Teruhiko

2014-01-01

Interindividual variation in a drug response among patients is known to cause serious problems in medicine. Genomic information has been proposed as the basis for "personalized" health care. The genome-wide association study (GWAS) is a powerful technique for examining single nucleotide polymorphisms (SNPs) and their relationship with drug response variation; however, when using only GWAS, it often happens that no useful SNPs are identified due to multiple testing problems. Therefore, in a previous study, we proposed a combined method consisting of a knowledge-based algorithm, 2 stages of screening, and a permutation test for identifying SNPs. In the present study, we applied this method to a pharmacogenomics study where 109,365 SNPs were genotyped using Illumina Human-1 BeadChip in 168 cancer patients treated with irinotecan chemotherapy. We identified the SNP rs9351963 in potassium voltage-gated channel subfamily KQT member 5 (KCNQ5) as a candidate factor related to incidence of irinotecan-induced diarrhea. The p value for rs9351963 was 3.31×10-5 in Fisher's exact test and 0.0289 in the permutation test (when multiple testing problems were corrected). Additionally, rs9351963 was clearly superior to the clinical parameters and the model involving rs9351963 showed sensitivity of 77.8% and specificity of 57.6% in the evaluation by means of logistic regression. Recent studies showed that KCNQ4 and KCNQ5 genes encode members of the M channel expressed in gastrointestinal smooth muscle and suggested that these genes are associated with irritable bowel syndrome and similar peristalsis diseases. These results suggest that rs9351963 in KCNQ5 is a possible predictive factor of incidence of diarrhea in cancer patients treated with irinotecan chemotherapy and for selecting chemotherapy regimens, such as irinotecan alone or a combination of irinotecan with a KCNQ5 opener. Nonetheless, clinical importance of rs9351963 should be further elucidated.

Smartphone-Based Indoor Localization with Bluetooth Low Energy Beacons

PubMed Central

Zhuang, Yuan; Yang, Jun; Li, You; Qi, Longning; El-Sheimy, Naser

2016-01-01

Indoor wireless localization using Bluetooth Low Energy (BLE) beacons has attracted considerable attention after the release of the BLE protocol. In this paper, we propose an algorithm that uses the combination of channel-separate polynomial regression model (PRM), channel-separate fingerprinting (FP), outlier detection and extended Kalman filtering (EKF) for smartphone-based indoor localization with BLE beacons. The proposed algorithm uses FP and PRM to estimate the target’s location and the distances between the target and BLE beacons respectively. We compare the performance of distance estimation that uses separate PRM for three advertisement channels (i.e., the separate strategy) with that use an aggregate PRM generated through the combination of information from all channels (i.e., the aggregate strategy). The performance of FP-based location estimation results of the separate strategy and the aggregate strategy are also compared. It was found that the separate strategy can provide higher accuracy; thus, it is preferred to adopt PRM and FP for each BLE advertisement channel separately. Furthermore, to enhance the robustness of the algorithm, a two-level outlier detection mechanism is designed. Distance and location estimates obtained from PRM and FP are passed to the first outlier detection to generate improved distance estimates for the EKF. After the EKF process, the second outlier detection algorithm based on statistical testing is further performed to remove the outliers. The proposed algorithm was evaluated by various field experiments. Results show that the proposed algorithm achieved the accuracy of <2.56 m at 90% of the time with dense deployment of BLE beacons (1 beacon per 9 m), which performs 35.82% better than <3.99 m from the Propagation Model (PM) + EKF algorithm and 15.77% more accurate than <3.04 m from the FP + EKF algorithm. With sparse deployment (1 beacon per 18 m), the proposed algorithm achieves the accuracies of <3.88 m at 90% of the time, which performs 49.58% more accurate than <8.00 m from the PM + EKF algorithm and 21.41% better than <4.94 m from the FP + EKF algorithm. Therefore, the proposed algorithm is especially useful to improve the localization accuracy in environments with sparse beacon deployment. PMID:27128917

Smartphone-Based Indoor Localization with Bluetooth Low Energy Beacons.

PubMed

Zhuang, Yuan; Yang, Jun; Li, You; Qi, Longning; El-Sheimy, Naser

2016-04-26

Indoor wireless localization using Bluetooth Low Energy (BLE) beacons has attracted considerable attention after the release of the BLE protocol. In this paper, we propose an algorithm that uses the combination of channel-separate polynomial regression model (PRM), channel-separate fingerprinting (FP), outlier detection and extended Kalman filtering (EKF) for smartphone-based indoor localization with BLE beacons. The proposed algorithm uses FP and PRM to estimate the target's location and the distances between the target and BLE beacons respectively. We compare the performance of distance estimation that uses separate PRM for three advertisement channels (i.e., the separate strategy) with that use an aggregate PRM generated through the combination of information from all channels (i.e., the aggregate strategy). The performance of FP-based location estimation results of the separate strategy and the aggregate strategy are also compared. It was found that the separate strategy can provide higher accuracy; thus, it is preferred to adopt PRM and FP for each BLE advertisement channel separately. Furthermore, to enhance the robustness of the algorithm, a two-level outlier detection mechanism is designed. Distance and location estimates obtained from PRM and FP are passed to the first outlier detection to generate improved distance estimates for the EKF. After the EKF process, the second outlier detection algorithm based on statistical testing is further performed to remove the outliers. The proposed algorithm was evaluated by various field experiments. Results show that the proposed algorithm achieved the accuracy of <2.56 m at 90% of the time with dense deployment of BLE beacons (1 beacon per 9 m), which performs 35.82% better than <3.99 m from the Propagation Model (PM) + EKF algorithm and 15.77% more accurate than <3.04 m from the FP + EKF algorithm. With sparse deployment (1 beacon per 18 m), the proposed algorithm achieves the accuracies of <3.88 m at 90% of the time, which performs 49.58% more accurate than <8.00 m from the PM + EKF algorithm and 21.41% better than <4.94 m from the FP + EKF algorithm. Therefore, the proposed algorithm is especially useful to improve the localization accuracy in environments with sparse beacon deployment.

Creation of a Ligand-Dependent Enzyme by Fusing Circularly Permuted Antibody Variable Region Domains.

PubMed

Iwai, Hiroto; Kojima-Misaizu, Miki; Dong, Jinhua; Ueda, Hiroshi

2016-04-20

Allosteric control of enzyme activity with exogenous substances has been hard to achieve, especially using antibody domains that potentially allow control by any antigens of choice. Here, in order to attain this goal, we developed a novel antibody variable region format introduced with circular permutations, called Clampbody. The two variable-region domains of the antibone Gla protein (BGP) antibody were each circularly permutated to have novel termini at the loops near their domain interface. Through their attachment to the N- and C-termini of a circularly permutated TEM-1 β-lactamase (cpBLA), we created a molecular switch that responds to the antigen peptide. The fusion protein specifically recognized the antigen, and in the presence of some detergent or denaturant, its catalytic activity was enhanced up to 4.7-fold in an antigen-dependent manner, due to increased resistance to these reagents. Hence, Clampbody will be a powerful tool for the allosteric regulation of enzyme and other protein activities and especially useful to design robust biosensors.

Multiple comparisons permutation test for image based data mining in radiotherapy

PubMed Central

2013-01-01

Comparing incidental dose distributions (i.e. images) of patients with different outcomes is a straightforward way to explore dose-response hypotheses in radiotherapy. In this paper, we introduced a permutation test that compares images, such as dose distributions from radiotherapy, while tackling the multiple comparisons problem. A test statistic Tmax was proposed that summarizes the differences between the images into a single value and a permutation procedure was employed to compute the adjusted p-value. We demonstrated the method in two retrospective studies: a prostate study that relates 3D dose distributions to failure, and an esophagus study that relates 2D surface dose distributions of the esophagus to acute esophagus toxicity. As a result, we were able to identify suspicious regions that are significantly associated with failure (prostate study) or toxicity (esophagus study). Permutation testing allows direct comparison of images from different patient categories and is a useful tool for data mining in radiotherapy. PMID:24365155

Quantum one-way permutation over the finite field of two elements

NASA Astrophysics Data System (ADS)

de Castro, Alexandre

2017-06-01

In quantum cryptography, a one-way permutation is a bounded unitary operator U:{H} → {H} on a Hilbert space {H} that is easy to compute on every input, but hard to invert given the image of a random input. Levin (Probl Inf Transm 39(1):92-103, 2003) has conjectured that the unitary transformation g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \\in {GF}_{{2}^{\\Vert x\\Vert }}, is an information-theoretically secure operator within a polynomial factor. Here, we show that Levin's one-way permutation is provably secure because its output values are four maximally entangled two-qubit states, and whose probability of factoring them approaches zero faster than the multiplicative inverse of any positive polynomial poly( x) over the Boolean ring of all subsets of x. Our results demonstrate through well-known theorems that existence of classical one-way functions implies existence of a universal quantum one-way permutation that cannot be inverted in subexponential time in the worst case.

Discriminative spatial-frequency-temporal feature extraction and classification of motor imagery EEG: An sparse regression and Weighted Naïve Bayesian Classifier-based approach.

PubMed

Miao, Minmin; Zeng, Hong; Wang, Aimin; Zhao, Changsen; Liu, Feixiang

2017-02-15

Common spatial pattern (CSP) is most widely used in motor imagery based brain-computer interface (BCI) systems. In conventional CSP algorithm, pairs of the eigenvectors corresponding to both extreme eigenvalues are selected to construct the optimal spatial filter. In addition, an appropriate selection of subject-specific time segments and frequency bands plays an important role in its successful application. This study proposes to optimize spatial-frequency-temporal patterns for discriminative feature extraction. Spatial optimization is implemented by channel selection and finding discriminative spatial filters adaptively on each time-frequency segment. A novel Discernibility of Feature Sets (DFS) criteria is designed for spatial filter optimization. Besides, discriminative features located in multiple time-frequency segments are selected automatically by the proposed sparse time-frequency segment common spatial pattern (STFSCSP) method which exploits sparse regression for significant features selection. Finally, a weight determined by the sparse coefficient is assigned for each selected CSP feature and we propose a Weighted Naïve Bayesian Classifier (WNBC) for classification. Experimental results on two public EEG datasets demonstrate that optimizing spatial-frequency-temporal patterns in a data-driven manner for discriminative feature extraction greatly improves the classification performance. The proposed method gives significantly better classification accuracies in comparison with several competing methods in the literature. The proposed approach is a promising candidate for future BCI systems. Copyright © 2016 Elsevier B.V. All rights reserved.

Blind Compressed Image Watermarking for Noisy Communication Channels

DTIC Science & Technology

2015-10-26

Lenna test image [11] for our simulations, and gradient projection for sparse recon- struction (GPSR) [12] to solve the convex optimization prob- lem...E. Candes, J. Romberg , and T. Tao, “Robust uncertainty prin- ciples: exact signal reconstruction from highly incomplete fre- quency information,” IEEE...Images - Requirements and Guidelines,” ITU-T Recommen- dation T.81, 1992. [6] M. Gkizeli, D. Pados, and M. Medley, “Optimal signature de - sign for

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

PubMed

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

Levels of Conceptual Development in Melodic Permutation Concepts Based on Piaget's Theory

ERIC Educational Resources Information Center

Larn, Ronald L.

1973-01-01

Article considered different ways in which subjects at different age levels solved a musical task involving melodic permutation. The differences in responses to the musical task between age groups were judged to be compatible with Piaget's theory of cognitive development. (Author/RK)

In Response to Rowland on "Realism and Debateability in Policy Advocacy."

ERIC Educational Resources Information Center

Herbeck, Dale A.; Katsulas, John P.

1986-01-01

Argues that Robert Rowland has overstated the case against the permutation process for assessing counterplan competitiveness. Claims that the permutation standard is a viable method for ascertaining counterplan competitiveness. Examines Rowland's alternative and argues that it is an unsatisfactory method for determining counterplan…

EPEPT: A web service for enhanced P-value estimation in permutation tests

PubMed Central

2011-01-01

Background In computational biology, permutation tests have become a widely used tool to assess the statistical significance of an event under investigation. However, the common way of computing the P-value, which expresses the statistical significance, requires a very large number of permutations when small (and thus interesting) P-values are to be accurately estimated. This is computationally expensive and often infeasible. Recently, we proposed an alternative estimator, which requires far fewer permutations compared to the standard empirical approach while still reliably estimating small P-values [1]. Results The proposed P-value estimator has been enriched with additional functionalities and is made available to the general community through a public website and web service, called EPEPT. This means that the EPEPT routines can be accessed not only via a website, but also programmatically using any programming language that can interact with the web. Examples of web service clients in multiple programming languages can be downloaded. Additionally, EPEPT accepts data of various common experiment types used in computational biology. For these experiment types EPEPT first computes the permutation values and then performs the P-value estimation. Finally, the source code of EPEPT can be downloaded. Conclusions Different types of users, such as biologists, bioinformaticians and software engineers, can use the method in an appropriate and simple way. Availability http://informatics.systemsbiology.net/EPEPT/ PMID:22024252

A network of spiking neurons for computing sparse representations in an energy efficient way

PubMed Central

Hu, Tao; Genkin, Alexander; Chklovskii, Dmitri B.

2013-01-01

Computing sparse redundant representations is an important problem both in applied mathematics and neuroscience. In many applications, this problem must be solved in an energy efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating via low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, such operation is equivalent to a network of integrate-and-fire neurons, suggesting that HDA may serve as a model of neural computation. We compare the numerical performance of HDA with existing algorithms and show that in the asymptotic regime the representation error of HDA decays with time, t, as 1/t. We show that HDA is stable against time-varying noise, specifically, the representation error decays as 1/t for Gaussian white noise. PMID:22920853

A low complexity reweighted proportionate affine projection algorithm with memory and row action projection

NASA Astrophysics Data System (ADS)

Liu, Jianming; Grant, Steven L.; Benesty, Jacob

2015-12-01

A new reweighted proportionate affine projection algorithm (RPAPA) with memory and row action projection (MRAP) is proposed in this paper. The reweighted PAPA is derived from a family of sparseness measures, which demonstrate performance similar to mu-law and the l 0 norm PAPA but with lower computational complexity. The sparseness of the channel is taken into account to improve the performance for dispersive system identification. Meanwhile, the memory of the filter's coefficients is combined with row action projections (RAP) to significantly reduce computational complexity. Simulation results demonstrate that the proposed RPAPA MRAP algorithm outperforms both the affine projection algorithm (APA) and PAPA, and has performance similar to l 0 PAPA and mu-law PAPA, in terms of convergence speed and tracking ability. Meanwhile, the proposed RPAPA MRAP has much lower computational complexity than PAPA, mu-law PAPA, and l 0 PAPA, etc., which makes it very appealing for real-time implementation.

A network of spiking neurons for computing sparse representations in an energy-efficient way.

PubMed

Hu, Tao; Genkin, Alexander; Chklovskii, Dmitri B

2012-11-01

Computing sparse redundant representations is an important problem in both applied mathematics and neuroscience. In many applications, this problem must be solved in an energy-efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating by low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, the operation is equivalent to a network of integrate-and-fire neurons, suggesting that HDA may serve as a model of neural computation. We show that the numerical performance of HDA is on par with existing algorithms. In the asymptotic regime, the representation error of HDA decays with time, t, as 1/t. HDA is stable against time-varying noise; specifically, the representation error decays as 1/√t for gaussian white noise.

FieldTrip: Open source software for advanced analysis of MEG, EEG, and invasive electrophysiological data.

PubMed

Oostenveld, Robert; Fries, Pascal; Maris, Eric; Schoffelen, Jan-Mathijs

2011-01-01

This paper describes FieldTrip, an open source software package that we developed for the analysis of MEG, EEG, and other electrophysiological data. The software is implemented as a MATLAB toolbox and includes a complete set of consistent and user-friendly high-level functions that allow experimental neuroscientists to analyze experimental data. It includes algorithms for simple and advanced analysis, such as time-frequency analysis using multitapers, source reconstruction using dipoles, distributed sources and beamformers, connectivity analysis, and nonparametric statistical permutation tests at the channel and source level. The implementation as toolbox allows the user to perform elaborate and structured analyses of large data sets using the MATLAB command line and batch scripting. Furthermore, users and developers can easily extend the functionality and implement new algorithms. The modular design facilitates the reuse in other software packages.

Introduction to Permutation and Resampling-Based Hypothesis Tests

ERIC Educational Resources Information Center

LaFleur, Bonnie J.; Greevy, Robert A.

2009-01-01

A resampling-based method of inference--permutation tests--is often used when distributional assumptions are questionable or unmet. Not only are these methods useful for obvious departures from parametric assumptions (e.g., normality) and small sample sizes, but they are also more robust than their parametric counterparts in the presences of…

Explorations in Statistics: Permutation Methods

ERIC Educational Resources Information Center

Curran-Everett, Douglas

2012-01-01

Learning about statistics is a lot like learning about science: the learning is more meaningful if you can actively explore. This eighth installment of "Explorations in Statistics" explores permutation methods, empiric procedures we can use to assess an experimental result--to test a null hypothesis--when we are reluctant to trust statistical…

Flood Inundation Modelling in Data Sparse Deltas

NASA Astrophysics Data System (ADS)

Hawker, Laurence; Bates, Paul; Neal, Jeffrey

2017-04-01

An estimated 7% of global population currently live in deltas, and this number is increasing over time. This has resulted in numerous human induced impacts on deltas ranging from subsidence, upstream sediment trapping and coastal erosion amongst others. These threats have already impacted on flood dynamics in deltas and could intensify in line with human activities. However, the myriad of threats creates a large number of potential scenarios that need to be evaluated. Therefore, to assess the impacts of these scenarios, a pre-requisite is a flood inundation model that is both computationally efficient and flexible in its setup so it can be applied in data-sparse settings. An intermediate scale, which compromises between the computational speed of a global model and the detail of a case specific bespoke model, was chosen to achieve this. To this end, we have developed an intermediate scale flood inundation model at a resolution of 540m of the Mekong Delta, built with freely available data, using the LISFLOOD-FP hydrodynamic model. The purpose of this is to answer the following questions: 1) How much detail is required to accurately simulate flooding in the Mekong Delta? , 2) What characteristics of deltas are most important to include in flood inundation models? Models were run using a vegetation removed SRTM DEM and a hind-casting of tidal heights as a downstream boundary. Results indicate the importance of vegetation removal in the DEM for inundation extent and the sensitivity of water level to roughness coefficients. The propagation of the tidal signal was found to be sensitive to bathymetry, both within the river channel and offshore, yet data availability for this is poor, meaning the modeller has to be careful in his or her choice of bathymetry interpolation Supplementing global river channel data with more localised data demonstrated minor improvements in results suggesting detailed channel information is not always needed to produce good results. It is envisaged that this work will lead to current and future flood risk analysis of not only the Mekong Delta, but also other data sparse deltas owing to the model's utilisation of freely available data that has a global coverage. This will ultimately aid in the much-needed estimation of flood risk in deltaic settings.

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

Vernon, E.; De Geronimo, G.; Ackley, K.

We report on the development of an application specific integrated circuit (ASIC) for 3D position sensitive detectors (3D PSD). The ASIC is designed to operate with pixelated wide bandgap sensors like Cadmium-Zinc-Telluride (CZT), Mercuric Iodide (Hgl2) and Thallium Bromide (TIBr). It measures the amplitudes and timings associated with an ionizing event on 128 anodes, the anode grid, and the cathode. Each channel provides low-noise charge amplification, high-order shaping with peaking time adjustable from 250 ns to 12 {micro}s, gain adjustable to 20 mV/fC or 120 mV/fC (for a dynamic range of 3.2 MeV and 530 keV in CZT), amplitude discriminationmore » with 5-bit trimming, and positive and negative peak and timing detections. The readout can be full or sparse, based on a flag and single- or multi-cycle token passing. All channels, triggered channels only, or triggered with neighbors can be read out thus increasing the rate capability of the system to more than 10 kcps. The ASIC dissipates 330 mW which corresponds to about 2.5 mW per channel.« less

Optimization of digital breast tomosynthesis (DBT) acquisition parameters for human observers: effect of reconstruction algorithms

NASA Astrophysics Data System (ADS)

Zeng, Rongping; Badano, Aldo; Myers, Kyle J.

2017-04-01

We showed in our earlier work that the choice of reconstruction methods does not affect the optimization of DBT acquisition parameters (angular span and number of views) using simulated breast phantom images in detecting lesions with a channelized Hotelling observer (CHO). In this work we investigate whether the model-observer based conclusion is valid when using humans to interpret images. We used previously generated DBT breast phantom images and recruited human readers to find the optimal geometry settings associated with two reconstruction algorithms, filtered back projection (FBP) and simultaneous algebraic reconstruction technique (SART). The human reader results show that image quality trends as a function of the acquisition parameters are consistent between FBP and SART reconstructions. The consistent trends confirm that the optimization of DBT system geometry is insensitive to the choice of reconstruction algorithm. The results also show that humans perform better in SART reconstructed images than in FBP reconstructed images. In addition, we applied CHOs with three commonly used channel models, Laguerre-Gauss (LG) channels, square (SQR) channels and sparse difference-of-Gaussian (sDOG) channels. We found that LG channels predict human performance trends better than SQR and sDOG channel models for the task of detecting lesions in tomosynthesis backgrounds. Overall, this work confirms that the choice of reconstruction algorithm is not critical for optimizing DBT system acquisition parameters.

NASA Thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1976-01-01

The NASA Thesaurus -- Volume 2, Access Vocabulary -- contains an alphabetical listing of all Thesaurus terms (postable and nonpostable) and permutations of all multiword and pseudo-multiword terms. Also included are Other Words (non-Thesaurus terms) consisting of abbreviations, chemical symbols, etc. The permutations and Other Words provide 'access' to the appropriate postable entries in the Thesaurus.

A Permutation Test for Correlated Errors in Adjacent Questionnaire Items

ERIC Educational Resources Information Center

Hildreth, Laura A.; Genschel, Ulrike; Lorenz, Frederick O.; Lesser, Virginia M.

2013-01-01

Response patterns are of importance to survey researchers because of the insight they provide into the thought processes respondents use to answer survey questions. In this article we propose the use of structural equation modeling to examine response patterns and develop a permutation test to quantify the likelihood of observing a specific…

The Parity Theorem Shuffle

ERIC Educational Resources Information Center

Smith, Michael D.

2016-01-01

The Parity Theorem states that any permutation can be written as a product of transpositions, but no permutation can be written as a product of both an even number and an odd number of transpositions. Most proofs of the Parity Theorem take several pages of mathematical formalism to complete. This article presents an alternative but equivalent…

Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

ERIC Educational Resources Information Center

Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie

2008-01-01

Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…

Permutation Entropy and Signal Energy Increase the Accuracy of Neuropathic Change Detection in Needle EMG

PubMed Central

2018-01-01

Background and Objective. Needle electromyography can be used to detect the number of changes and morphological changes in motor unit potentials of patients with axonal neuropathy. General mathematical methods of pattern recognition and signal analysis were applied to recognize neuropathic changes. This study validates the possibility of extending and refining turns-amplitude analysis using permutation entropy and signal energy. Methods. In this study, we examined needle electromyography in 40 neuropathic individuals and 40 controls. The number of turns, amplitude between turns, signal energy, and “permutation entropy” were used as features for support vector machine classification. Results. The obtained results proved the superior classification performance of the combinations of all of the above-mentioned features compared to the combinations of fewer features. The lowest accuracy from the tested combinations of features had peak-ratio analysis. Conclusion. Using the combination of permutation entropy with signal energy, number of turns and mean amplitude in SVM classification can be used to refine the diagnosis of polyneuropathies examined by needle electromyography. PMID:29606959

permGPU: Using graphics processing units in RNA microarray association studies.

PubMed

Shterev, Ivo D; Jung, Sin-Ho; George, Stephen L; Owzar, Kouros

2010-06-16

Many analyses of microarray association studies involve permutation, bootstrap resampling and cross-validation, that are ideally formulated as embarrassingly parallel computing problems. Given that these analyses are computationally intensive, scalable approaches that can take advantage of multi-core processor systems need to be developed. We have developed a CUDA based implementation, permGPU, that employs graphics processing units in microarray association studies. We illustrate the performance and applicability of permGPU within the context of permutation resampling for a number of test statistics. An extensive simulation study demonstrates a dramatic increase in performance when using permGPU on an NVIDIA GTX 280 card compared to an optimized C/C++ solution running on a conventional Linux server. permGPU is available as an open-source stand-alone application and as an extension package for the R statistical environment. It provides a dramatic increase in performance for permutation resampling analysis in the context of microarray association studies. The current version offers six test statistics for carrying out permutation resampling analyses for binary, quantitative and censored time-to-event traits.

Testing for the Presence of Correlation Changes in a Multivariate Time Series: A Permutation Based Approach.

PubMed

Cabrieto, Jedelyn; Tuerlinckx, Francis; Kuppens, Peter; Hunyadi, Borbála; Ceulemans, Eva

2018-01-15

Detecting abrupt correlation changes in multivariate time series is crucial in many application fields such as signal processing, functional neuroimaging, climate studies, and financial analysis. To detect such changes, several promising correlation change tests exist, but they may suffer from severe loss of power when there is actually more than one change point underlying the data. To deal with this drawback, we propose a permutation based significance test for Kernel Change Point (KCP) detection on the running correlations. Given a requested number of change points K, KCP divides the time series into K + 1 phases by minimizing the within-phase variance. The new permutation test looks at how the average within-phase variance decreases when K increases and compares this to the results for permuted data. The results of an extensive simulation study and applications to several real data sets show that, depending on the setting, the new test performs either at par or better than the state-of-the art significance tests for detecting the presence of correlation changes, implying that its use can be generally recommended.

Multi-scale symbolic transfer entropy analysis of EEG

NASA Astrophysics Data System (ADS)

Yao, Wenpo; Wang, Jun

2017-10-01

From both global and local perspectives, we symbolize two kinds of EEG and analyze their dynamic and asymmetrical information using multi-scale transfer entropy. Multi-scale process with scale factor from 1 to 199 and step size of 2 is applied to EEG of healthy people and epileptic patients, and then the permutation with embedding dimension of 3 and global approach are used to symbolize the sequences. The forward and reverse symbol sequences are taken as the inputs of transfer entropy. Scale factor intervals of permutation and global way are (37, 57) and (65, 85) where the two kinds of EEG have satisfied entropy distinctions. When scale factor is 67, transfer entropy of the healthy and epileptic subjects of permutation, 0.1137 and 0.1028, have biggest difference. And the corresponding values of the global symbolization is 0.0641 and 0.0601 which lies in the scale factor of 165. Research results show that permutation which takes contribution of local information has better distinction and is more effectively applied to our multi-scale transfer entropy analysis of EEG.

Sorting signed permutations by inversions in O(nlogn) time.

PubMed

Swenson, Krister M; Rajan, Vaibhav; Lin, Yu; Moret, Bernard M E

2010-03-01

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inversions, improved algorithms have been designed, culminating with an optimal linear-time algorithm for computing the inversion distance and a subquadratic algorithm for providing a shortest sequence of inversions--also known as sorting by inversions. Remaining open was the question of whether sorting by inversions could be done in O(nlogn) time. In this article, we present a qualified answer to this question, by providing two new sorting algorithms, a simple and fast randomized algorithm and a deterministic refinement. The deterministic algorithm runs in time O(nlogn + kn), where k is a data-dependent parameter. We provide the results of extensive experiments showing that both the average and the standard deviation for k are small constants, independent of the size of the permutation. We conclude (but do not prove) that almost all signed permutations can be sorted by inversions in O(nlogn) time.

Revisiting the European sovereign bonds with a permutation-information-theory approach

NASA Astrophysics Data System (ADS)

Fernández Bariviera, Aurelio; Zunino, Luciano; Guercio, María Belén; Martinez, Lisana B.; Rosso, Osvaldo A.

2013-12-01

In this paper we study the evolution of the informational efficiency in its weak form for seventeen European sovereign bonds time series. We aim to assess the impact of two specific economic situations in the hypothetical random behavior of these time series: the establishment of a common currency and a wide and deep financial crisis. In order to evaluate the informational efficiency we use permutation quantifiers derived from information theory. Specifically, time series are ranked according to two metrics that measure the intrinsic structure of their correlations: permutation entropy and permutation statistical complexity. These measures provide the rectangular coordinates of the complexity-entropy causality plane; the planar location of the time series in this representation space reveals the degree of informational efficiency. According to our results, the currency union contributed to homogenize the stochastic characteristics of the time series and produced synchronization in the random behavior of them. Additionally, the 2008 financial crisis uncovered differences within the apparently homogeneous European sovereign markets and revealed country-specific characteristics that were partially hidden during the monetary union heyday.

Symmetric encryption algorithms using chaotic and non-chaotic generators: A review

PubMed Central

Radwan, Ahmed G.; AbdElHaleem, Sherif H.; Abd-El-Hafiz, Salwa K.

2015-01-01

This paper summarizes the symmetric image encryption results of 27 different algorithms, which include substitution-only, permutation-only or both phases. The cores of these algorithms are based on several discrete chaotic maps (Arnold’s cat map and a combination of three generalized maps), one continuous chaotic system (Lorenz) and two non-chaotic generators (fractals and chess-based algorithms). Each algorithm has been analyzed by the correlation coefficients between pixels (horizontal, vertical and diagonal), differential attack measures, Mean Square Error (MSE), entropy, sensitivity analyses and the 15 standard tests of the National Institute of Standards and Technology (NIST) SP-800-22 statistical suite. The analyzed algorithms include a set of new image encryption algorithms based on non-chaotic generators, either using substitution only (using fractals) and permutation only (chess-based) or both. Moreover, two different permutation scenarios are presented where the permutation-phase has or does not have a relationship with the input image through an ON/OFF switch. Different encryption-key lengths and complexities are provided from short to long key to persist brute-force attacks. In addition, sensitivities of those different techniques to a one bit change in the input parameters of the substitution key as well as the permutation key are assessed. Finally, a comparative discussion of this work versus many recent research with respect to the used generators, type of encryption, and analyses is presented to highlight the strengths and added contribution of this paper. PMID:26966561

Development of isothermal-isobaric replica-permutation method for molecular dynamics and Monte Carlo simulations and its application to reveal temperature and pressure dependence of folded, misfolded, and unfolded states of chignolin

NASA Astrophysics Data System (ADS)

Yamauchi, Masataka; Okumura, Hisashi

2017-11-01

We developed a two-dimensional replica-permutation molecular dynamics method in the isothermal-isobaric ensemble. The replica-permutation method is a better alternative to the replica-exchange method. It was originally developed in the canonical ensemble. This method employs the Suwa-Todo algorithm, instead of the Metropolis algorithm, to perform permutations of temperatures and pressures among more than two replicas so that the rejection ratio can be minimized. We showed that the isothermal-isobaric replica-permutation method performs better sampling efficiency than the isothermal-isobaric replica-exchange method and infinite swapping method. We applied this method to a β-hairpin mini protein, chignolin. In this simulation, we observed not only the folded state but also the misfolded state. We calculated the temperature and pressure dependence of the fractions on the folded, misfolded, and unfolded states. Differences in partial molar enthalpy, internal energy, entropy, partial molar volume, and heat capacity were also determined and agreed well with experimental data. We observed a new phenomenon that misfolded chignolin becomes more stable under high-pressure conditions. We also revealed this mechanism of the stability as follows: TYR2 and TRP9 side chains cover the hydrogen bonds that form a β-hairpin structure. The hydrogen bonds are protected from the water molecules that approach the protein as the pressure increases.

EXPLICIT SYMPLECTIC-LIKE INTEGRATORS WITH MIDPOINT PERMUTATIONS FOR SPINNING COMPACT BINARIES

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

Luo, Junjie; Wu, Xin; Huang, Guoqing

2017-01-01

We refine the recently developed fourth-order extended phase space explicit symplectic-like methods for inseparable Hamiltonians using Yoshida’s triple product combined with a midpoint permuted map. The midpoint between the original variables and their corresponding extended variables at every integration step is readjusted as the initial values of the original variables and their corresponding extended ones at the next step integration. The triple-product construction is apparently superior to the composition of two triple products in computational efficiency. Above all, the new midpoint permutations are more effective in restraining the equality of the original variables and their corresponding extended ones at each integration step thanmore » the existing sequent permutations of momenta and coordinates. As a result, our new construction shares the benefit of implicit symplectic integrators in the conservation of the second post-Newtonian Hamiltonian of spinning compact binaries. Especially for the chaotic case, it can work well, but the existing sequent permuted algorithm cannot. When dissipative effects from the gravitational radiation reaction are included, the new symplectic-like method has a secular drift in the energy error of the dissipative system for the orbits that are regular in the absence of radiation, as an implicit symplectic integrator does. In spite of this, it is superior to the same-order implicit symplectic integrator in accuracy and efficiency. The new method is particularly useful in discussing the long-term evolution of inseparable Hamiltonian problems.« less

A studentized permutation test for three-arm trials in the 'gold standard' design.

PubMed

Mütze, Tobias; Konietschke, Frank; Munk, Axel; Friede, Tim

2017-03-15

The 'gold standard' design for three-arm trials refers to trials with an active control and a placebo control in addition to the experimental treatment group. This trial design is recommended when being ethically justifiable and it allows the simultaneous comparison of experimental treatment, active control, and placebo. Parametric testing methods have been studied plentifully over the past years. However, these methods often tend to be liberal or conservative when distributional assumptions are not met particularly with small sample sizes. In this article, we introduce a studentized permutation test for testing non-inferiority and superiority of the experimental treatment compared with the active control in three-arm trials in the 'gold standard' design. The performance of the studentized permutation test for finite sample sizes is assessed in a Monte Carlo simulation study under various parameter constellations. Emphasis is put on whether the studentized permutation test meets the target significance level. For comparison purposes, commonly used Wald-type tests, which do not make any distributional assumptions, are included in the simulation study. The simulation study shows that the presented studentized permutation test for assessing non-inferiority in three-arm trials in the 'gold standard' design outperforms its competitors, for instance the test based on a quasi-Poisson model, for count data. The methods discussed in this paper are implemented in the R package ThreeArmedTrials which is available on the comprehensive R archive network (CRAN). Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Sensory-evoked perturbations of locomotor activity by sparse sensory input: a computational study

PubMed Central

Brownstone, Robert M.

2015-01-01

Sensory inputs from muscle, cutaneous, and joint afferents project to the spinal cord, where they are able to affect ongoing locomotor activity. Activation of sensory input can initiate or prolong bouts of locomotor activity depending on the identity of the sensory afferent activated and the timing of the activation within the locomotor cycle. However, the mechanisms by which afferent activity modifies locomotor rhythm and the distribution of sensory afferents to the spinal locomotor networks have not been determined. Considering the many sources of sensory inputs to the spinal cord, determining this distribution would provide insights into how sensory inputs are integrated to adjust ongoing locomotor activity. We asked whether a sparsely distributed set of sensory inputs could modify ongoing locomotor activity. To address this question, several computational models of locomotor central pattern generators (CPGs) that were mechanistically diverse and generated locomotor-like rhythmic activity were developed. We show that sensory inputs restricted to a small subset of the network neurons can perturb locomotor activity in the same manner as seen experimentally. Furthermore, we show that an architecture with sparse sensory input improves the capacity to gate sensory information by selectively modulating sensory channels. These data demonstrate that sensory input to rhythm-generating networks need not be extensively distributed. PMID:25673740

Profiling the array of Ca(v)3.1 variants from the human T-type calcium channel gene CACNA1G: alternative structures, developmental expression, and biophysical variations.

PubMed

Emerick, Mark C; Stein, Rebecca; Kunze, Robin; McNulty, Megan M; Regan, Melissa R; Hanck, Dorothy A; Agnew, William S

2006-08-01

We describe the regulated transcriptome of CACNA1G, a human gene for T-type Ca(v)3.1 calcium channels that is subject to extensive alternative RNA splicing. Fifteen sites of transcript variation include 2 alternative 5'-UTR promoter sites, 2 alternative 3'-UTR polyadenylation sites, and 11 sites of alternative splicing within the open reading frame. A survey of 1580 fetal and adult human brain full-length complementary DNAs reveals a family of 30 distinct transcripts, including multiple functional forms that vary in expression with development. Statistical analyses of fetal and adult transcript populations reveal patterns of linkages among intramolecular splice site configurations that change dramatically with development. A shift from nearly independent, biased splicing in fetal transcripts to strongly concerted splicing in adult transcripts suggests progressive activation of multiple "programs" of splicing regulation that reorganize molecular structures in differentiating cells. Patch-clamp studies of nine selected variants help relate splicing regulation to permutations of the gating parameters most likely to modify T-channel physiology in expressing neurons. Gating behavior reflects combinatorial interactions between variable domains so that molecular phenotype depends on ensembles of coselected domains, consistent with the observed emergence of concerted splicing during development. We conclude that the structural gene and networks of splicing regulatory factors define an integrated system for the phenotypic variation of Ca(v)3.1 biophysics during nervous system development. Copyright 2006 Wiley-Liss, Inc.

Quantum image encryption based on restricted geometric and color transformations

NASA Astrophysics Data System (ADS)

Song, Xian-Hua; Wang, Shen; Abd El-Latif, Ahmed A.; Niu, Xia-Mu

2014-08-01

A novel encryption scheme for quantum images based on restricted geometric and color transformations is proposed. The new strategy comprises efficient permutation and diffusion properties for quantum image encryption. The core idea of the permutation stage is to scramble the codes of the pixel positions through restricted geometric transformations. Then, a new quantum diffusion operation is implemented on the permutated quantum image based on restricted color transformations. The encryption keys of the two stages are generated by two sensitive chaotic maps, which can ensure the security of the scheme. The final step, measurement, is built by the probabilistic model. Experiments conducted on statistical analysis demonstrate that significant improvements in the results are in favor of the proposed approach.

Statistical validation of normal tissue complication probability models.

PubMed

Xu, Cheng-Jian; van der Schaaf, Arjen; Van't Veld, Aart A; Langendijk, Johannes A; Schilstra, Cornelis

2012-09-01

To investigate the applicability and value of double cross-validation and permutation tests as established statistical approaches in the validation of normal tissue complication probability (NTCP) models. A penalized regression method, LASSO (least absolute shrinkage and selection operator), was used to build NTCP models for xerostomia after radiation therapy treatment of head-and-neck cancer. Model assessment was based on the likelihood function and the area under the receiver operating characteristic curve. Repeated double cross-validation showed the uncertainty and instability of the NTCP models and indicated that the statistical significance of model performance can be obtained by permutation testing. Repeated double cross-validation and permutation tests are recommended to validate NTCP models before clinical use. Copyright © 2012 Elsevier Inc. All rights reserved.

Performance and structure of single-mode bosonic codes

NASA Astrophysics Data System (ADS)

Albert, Victor V.; Noh, Kyungjoo; Duivenvoorden, Kasper; Young, Dylan J.; Brierley, R. T.; Reinhold, Philip; Vuillot, Christophe; Li, Linshu; Shen, Chao; Girvin, S. M.; Terhal, Barbara M.; Jiang, Liang

2018-03-01

The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an oscillator has recently been followed by cat- and binomial-code proposals. Numerically optimized codes have also been proposed, and we introduce codes of this type here. These codes have yet to be compared using the same error model; we provide such a comparison by determining the entanglement fidelity of all codes with respect to the bosonic pure-loss channel (i.e., photon loss) after the optimal recovery operation. We then compare achievable communication rates of the combined encoding-error-recovery channel by calculating the channel's hashing bound for each code. Cat and binomial codes perform similarly, with binomial codes outperforming cat codes at small loss rates. Despite not being designed to protect against the pure-loss channel, GKP codes significantly outperform all other codes for most values of the loss rate. We show that the performance of GKP and some binomial codes increases monotonically with increasing average photon number of the codes. In order to corroborate our numerical evidence of the cat-binomial-GKP order of performance occurring at small loss rates, we analytically evaluate the quantum error-correction conditions of those codes. For GKP codes, we find an essential singularity in the entanglement fidelity in the limit of vanishing loss rate. In addition to comparing the codes, we draw parallels between binomial codes and discrete-variable systems. First, we characterize one- and two-mode binomial as well as multiqubit permutation-invariant codes in terms of spin-coherent states. Such a characterization allows us to introduce check operators and error-correction procedures for binomial codes. Second, we introduce a generalization of spin-coherent states, extending our characterization to qudit binomial codes and yielding a multiqudit code.

The English Channel: Contamination status of its transitional and coastal waters.

PubMed

Tappin, A D; Millward, G E

2015-06-30

The chemical contamination (organic compounds, metals, radionuclides, microplastics, nutrients) of English Channel waters has been reviewed, focussing on the sources, concentrations and impacts. River loads were only reliable for Pb, whereas atmospheric loads appeared robust for Cd, Pb, Hg, PCB-153 and γ-HCH. Temporal trends in atmospheric inputs were decreasing. Contaminant concentrations in biota were relatively constant or decreasing, but not for Cd, Hg and HBCDD, and deleterious impacts on fish and copepods were reported. However, data on ecotoxicological effects were generally sparse for legacy and emerging contaminants. Intercomparison of activity concentrations of artificial radionuclides in sediments and biota on both Channel coasts was hindered by differences in methodological approaches. Riverine phosphate loads decreased with time, while nitrate loads remained uniform. Increased biomass of algae, attributable to terrestrial inputs of nutrients, has affected benthic production and shellfisheries. A strategic approach to the identification of contaminant impacts on marine biota is recommended. Copyright © 2014 Elsevier Ltd. All rights reserved.

Distribution and character of naleds in northeastern Alaska

USGS Publications Warehouse

Harden, Deborah; Barnes, Peter W.; Reimnitz, Erk

1977-01-01

An examination of the distribution of river naleds seen in Landsat satellite imagery and high- and low-altitude aerial photography of Alaska's North Slope indicates that these features are widespread east of the Colville River and less abundant to the west. Where naleds occur, stream channels are wide and often form braided channels. Their distribution can be related to changes in stream gradient and to the occurrence of springs. Large naleds, such as on the Kongakut River, often remain through the summer melt season to form the nucleus of icing in the succeeding winter. Major naleds also are likely to significantly influence the nature of permafrost in their immediate vicinity. The map of naleds may serve as a guide to the occurrence of year-round flowing water, a sparse commodity in northern Alaska.

A generalized geologic map of Mars.

NASA Technical Reports Server (NTRS)

Carr, M. H.; Masursky, H.; Saunders, R. S.

1973-01-01

A geologic map of Mars has been constructed largely on the basis of photographic evidence. Four classes of units are recognized: (1) primitive cratered terrain, (2) sparsely cratered volcanic eolian plains, (3) circular radially symmetric volcanic constructs such as shield volcanoes, domes, and craters, and (4) tectonic erosional units such as chaotic and channel deposits. Grabens are the main structural features; compressional and strike slip features are almost completely absent. Most grabens are part of a set radial to the main volcanic area, Tharsis.

A Compressed Sensing Based Ultra-Wideband Communication System

DTIC Science & Technology

2009-06-01

principle, most of the processing at the receiver can be moved to the transmitter—where energy consumption and computation are sufficient for many advanced...extended to continuous time signals. We use ∗ to denote the convolution process in a linear time-invariant (LTI) system. Assume that there is an analog...Filter Channel Low Rate A/D Processing Sparse Bit Sequence UWB Pulse Generator α̂ Waves)(RadioGHz 5 MHz125 θ Ψ Φ y θ̂ 1 ˆ arg min s.t. yθ

The pungent substances piperine, capsaicin, 6-gingerol and polygodial inhibit the human two-pore domain potassium channels TASK-1, TASK-3 and TRESK

PubMed Central

Beltrán, Leopoldo R.; Dawid, Corinna; Beltrán, Madeline; Gisselmann, Guenter; Degenhardt, Katharina; Mathie, Klaus; Hofmann, Thomas; Hatt, Hanns

2013-01-01

For a long time, the focus of trigeminal chemoperception has rested almost exclusively on TRP channels. However, two-pore domain (K2P) potassium channels have recently been identified as targets for substances associated with typical trigeminal sensations, such as numbing and tingling. In addition, they have been shown to be modulated by several TRP agonists. We investigated whether the pungent substances piperine, capsaicin, 6-gingerol and polygodial have an effect on human K2P channels. For this purpose, we evaluated the effects of these pungent substances on both wild-type and mutant K2P channels by means of two-electrode voltage-clamp experiments using Xenopus laevis oocytes. All four pungent substances were found to inhibit the basal activity of TASK-1 (K2P 3.1), TASK-3 (K2P 9.1), and TRESK (K2P 18.1) channels. This inhibitory effect was dose-dependent and, with the exception of polygodial on TASK-1, fully reversible. However, only piperine exhibited an IC50 similar to its reported EC50 on TRP channels. Finally, we observed for TASK-3 that mutating H98 to E markedly decreased the inhibition induced by piperine, capsaicin, and 6-gingerol, but not by polygodial. Our data contribute to the relatively sparse knowledge concerning the pharmacology of K2P channels and also raise the question of whether K2P channels could be involved in the pungency perception of piperine. PMID:24302912

Splice loss requirements in multi-mode fiber mode-division-multiplex transmission links.

PubMed

Warm, Stefan; Petermann, Klaus

2013-01-14

We investigate numerically the influence of fiber splices and fiber connectors to the statistics of mode dependent loss (MDL) and multiple-input multiple-output (MIMO) outage capacity in mode multiplexed multi-mode fiber links. Our results indicate required splice losses much lower than currently feasible to achieve a reasonable outage capacity in long-haul transmission systems. Splice losses as low as 0.03dB may effectively lead to an outage of MIMO channels after only a few hundred kilometers transmission length. In a first approximation, the relative capacity solely depends on the accumulated splice loss and should be less than ≈ 2dB to ensure a relative capacity of 90%. We also show that discrete mode permutation (mixing) within the transmission line may effectively increase the maximum transmission distance by a factor of 5 for conventional splice losses.

FieldTrip: Open Source Software for Advanced Analysis of MEG, EEG, and Invasive Electrophysiological Data

PubMed Central

Oostenveld, Robert; Fries, Pascal; Maris, Eric; Schoffelen, Jan-Mathijs

2011-01-01

This paper describes FieldTrip, an open source software package that we developed for the analysis of MEG, EEG, and other electrophysiological data. The software is implemented as a MATLAB toolbox and includes a complete set of consistent and user-friendly high-level functions that allow experimental neuroscientists to analyze experimental data. It includes algorithms for simple and advanced analysis, such as time-frequency analysis using multitapers, source reconstruction using dipoles, distributed sources and beamformers, connectivity analysis, and nonparametric statistical permutation tests at the channel and source level. The implementation as toolbox allows the user to perform elaborate and structured analyses of large data sets using the MATLAB command line and batch scripting. Furthermore, users and developers can easily extend the functionality and implement new algorithms. The modular design facilitates the reuse in other software packages. PMID:21253357

Multicomponent reactions provide key molecules for secret communication.

PubMed

Boukis, Andreas C; Reiter, Kevin; Frölich, Maximiliane; Hofheinz, Dennis; Meier, Michael A R

2018-04-12

A convenient and inherently more secure communication channel for encoding messages via specifically designed molecular keys is introduced by combining advanced encryption standard cryptography with molecular steganography. The necessary molecular keys require large structural diversity, thus suggesting the application of multicomponent reactions. Herein, the Ugi four-component reaction of perfluorinated acids is utilized to establish an exemplary database consisting of 130 commercially available components. Considering all permutations, this combinatorial approach can unambiguously provide 500,000 molecular keys in only one synthetic procedure per key. The molecular keys are transferred nondigitally and concealed by either adsorption onto paper, coffee, tea or sugar as well as by dissolution in a perfume or in blood. Re-isolation and purification from these disguises is simplified by the perfluorinated sidechains of the molecular keys. High resolution tandem mass spectrometry can unequivocally determine the molecular structure and thus the identity of the key for a subsequent decryption of an encoded message.

NASA thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1985-01-01

The Access Vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries, and pseudo-multiword terms that are permutations of words that contain words within words. The Access Vocabulary contains 40,738 entries that give increased access to the hierarchies in Volume 1 - Hierarchical Listing.

NASA Thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1982-01-01

The Access Vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries, and pseudo-multiword terms that are permutations of words that contain words within words. The Access Vocabulary contains, 40,661 entries that give increased access to he hierarchies in Volume 1 - Hierarchical Listing.

Instability of Hierarchical Cluster Analysis Due to Input Order of the Data: The PermuCLUSTER Solution

ERIC Educational Resources Information Center

van der Kloot, Willem A.; Spaans, Alexander M. J.; Heiser, Willem J.

2005-01-01

Hierarchical agglomerative cluster analysis (HACA) may yield different solutions under permutations of the input order of the data. This instability is caused by ties, either in the initial proximity matrix or arising during agglomeration. The authors recommend to repeat the analysis on a large number of random permutations of the rows and columns…

Optimal control of hybrid qubits: Implementing the quantum permutation algorithm

NASA Astrophysics Data System (ADS)

Rivera-Ruiz, C. M.; de Lima, E. F.; Fanchini, F. F.; Lopez-Richard, V.; Castelano, L. K.

2018-03-01

The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with a fidelity higher than 0.9997, when noise is not taken into account. Particularly, these quantum gates were chosen to perform the permutation algorithm in hybrid qubits in double quantum dots (DQDs). The permutation algorithm is an oracle based quantum algorithm that solves the problem of the permutation parity faster than a classical algorithm without the necessity of entanglement between particles. The only requirement for achieving the speedup is the use of a one-particle quantum system with at least three levels. The high fidelity found in our results is closely related to the quantum speed limit, which is a measure of how fast a quantum state can be manipulated. Furthermore, we model charge noise by considering an average over the optimal field centered at different values of the reference detuning, which follows a Gaussian distribution. When the Gaussian spread is of the order of 5 μ eV (10% of the correct value), the fidelity is still higher than 0.95. Our scheme also can be used for the practical realization of different quantum algorithms in DQDs.

Weighted multiscale Rényi permutation entropy of nonlinear time series

NASA Astrophysics Data System (ADS)

Chen, Shijian; Shang, Pengjian; Wu, Yue

2018-04-01

In this paper, based on Rényi permutation entropy (RPE), which has been recently suggested as a relative measure of complexity in nonlinear systems, we propose multiscale Rényi permutation entropy (MRPE) and weighted multiscale Rényi permutation entropy (WMRPE) to quantify the complexity of nonlinear time series over multiple time scales. First, we apply MPRE and WMPRE to the synthetic data and make a comparison of modified methods and RPE. Meanwhile, the influence of the change of parameters is discussed. Besides, we interpret the necessity of considering not only multiscale but also weight by taking the amplitude into account. Then MRPE and WMRPE methods are employed to the closing prices of financial stock markets from different areas. By observing the curves of WMRPE and analyzing the common statistics, stock markets are divided into 4 groups: (1) DJI, S&P500, and HSI, (2) NASDAQ and FTSE100, (3) DAX40 and CAC40, and (4) ShangZheng and ShenCheng. Results show that the standard deviations of weighted methods are smaller, showing WMRPE is able to ensure the results more robust. Besides, WMPRE can provide abundant dynamical properties of complex systems, and demonstrate the intrinsic mechanism.

Confidence intervals and hypothesis testing for the Permutation Entropy with an application to epilepsy

NASA Astrophysics Data System (ADS)

Traversaro, Francisco; O. Redelico, Francisco

2018-04-01

In nonlinear dynamics, and to a lesser extent in other fields, a widely used measure of complexity is the Permutation Entropy. But there is still no known method to determine the accuracy of this measure. There has been little research on the statistical properties of this quantity that characterize time series. The literature describes some resampling methods of quantities used in nonlinear dynamics - as the largest Lyapunov exponent - but these seems to fail. In this contribution, we propose a parametric bootstrap methodology using a symbolic representation of the time series to obtain the distribution of the Permutation Entropy estimator. We perform several time series simulations given by well-known stochastic processes: the 1/fα noise family, and show in each case that the proposed accuracy measure is as efficient as the one obtained by the frequentist approach of repeating the experiment. The complexity of brain electrical activity, measured by the Permutation Entropy, has been extensively used in epilepsy research for detection in dynamical changes in electroencephalogram (EEG) signal with no consideration of the variability of this complexity measure. An application of the parametric bootstrap methodology is used to compare normal and pre-ictal EEG signals.

Mapping ephemeral stream networks in desert environments using very-high-spatial-resolution multispectral remote sensing

DOE PAGES

Hamada, Yuki; O'Connor, Ben L.; Orr, Andrew B.; ...

2016-03-26

In this paper, understanding the spatial patterns of ephemeral streams is crucial for understanding how hydrologic processes influence the abundance and distribution of wildlife habitats in desert regions. Available methods for mapping ephemeral streams at the watershed scale typically underestimate the size of channel networks. Although remote sensing is an effective means of collecting data and obtaining information on large, inaccessible areas, conventional techniques for extracting channel features are not sufficient in regions that have small topographic gradients and subtle target-background spectral contrast. By using very high resolution multispectral imagery, we developed a new algorithm that applies landscape information tomore » map ephemeral channels in desert regions of the Southwestern United States where utility-scale solar energy development is occurring. Knowledge about landscape features and structures was integrated into the algorithm using a series of spectral transformation and spatial statistical operations to integrate information about landscape features and structures. The algorithm extracted ephemeral stream channels at a local scale, with the result that approximately 900% more ephemeral streams was identified than what were identified by using the U.S. Geological Survey’s National Hydrography Dataset. The accuracy of the algorithm in detecting channel areas was as high as 92%, and its accuracy in delineating channel center lines was 91% when compared to a subset of channel networks that were digitized by using the very high resolution imagery. Although the algorithm captured stream channels in desert landscapes across various channel sizes and forms, it often underestimated stream headwaters and channels obscured by bright soils and sparse vegetation. While further improvement is warranted, the algorithm provides an effective means of obtaining detailed information about ephemeral streams, and it could make a significant contribution toward improving the hydrological modelling of desert environments.« less

Mapping ephemeral stream networks in desert environments using very-high-spatial-resolution multispectral remote sensing

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

Hamada, Yuki; O'Connor, Ben L.; Orr, Andrew B.

In this paper, understanding the spatial patterns of ephemeral streams is crucial for understanding how hydrologic processes influence the abundance and distribution of wildlife habitats in desert regions. Available methods for mapping ephemeral streams at the watershed scale typically underestimate the size of channel networks. Although remote sensing is an effective means of collecting data and obtaining information on large, inaccessible areas, conventional techniques for extracting channel features are not sufficient in regions that have small topographic gradients and subtle target-background spectral contrast. By using very high resolution multispectral imagery, we developed a new algorithm that applies landscape information tomore » map ephemeral channels in desert regions of the Southwestern United States where utility-scale solar energy development is occurring. Knowledge about landscape features and structures was integrated into the algorithm using a series of spectral transformation and spatial statistical operations to integrate information about landscape features and structures. The algorithm extracted ephemeral stream channels at a local scale, with the result that approximately 900% more ephemeral streams was identified than what were identified by using the U.S. Geological Survey’s National Hydrography Dataset. The accuracy of the algorithm in detecting channel areas was as high as 92%, and its accuracy in delineating channel center lines was 91% when compared to a subset of channel networks that were digitized by using the very high resolution imagery. Although the algorithm captured stream channels in desert landscapes across various channel sizes and forms, it often underestimated stream headwaters and channels obscured by bright soils and sparse vegetation. While further improvement is warranted, the algorithm provides an effective means of obtaining detailed information about ephemeral streams, and it could make a significant contribution toward improving the hydrological modelling of desert environments.« less

Geochemistry of inorganic nitrogen in waters released from coal-bed natural gas production wells in the Powder River Basin, Wyoming

USGS Publications Warehouse

Smith, Richard L.; Repert, Deborah A.; Hart, Charles P.

2009-01-01

Water originating from coal-bed natural gas (CBNG) production wells typically contains ammonium and is often disposed via discharge to ephemeral channels. A study conducted in the Powder River Basin, Wyoming, documented downstream changes in CBNG water composition, emphasizing nitrogen-cycling processes and the fate of ammonium. Dissolved ammonium concentrations from 19 CBNG discharge points ranged from 95 to 527 μM. Within specific channels, ammonium concentrations decreased with transport distance, with subsequent increases in nitrite and nitrate concentrations. Removal efficiency, or uptake, of total dissolved inorganic nitrogen (DIN) varied between channel types. DIN uptake was greater in the gentle-sloped, vegetated channel as compared to the incised, steep, and sparsely vegetated channel and was highly correlated with diel patterns of incident light and dissolved oxygen concentration. In a larger main channel with multiple discharge inputs (n = 13), DIN concentrations were >300 μM, with pH > 8.5, after 5 km of transport. Ammonium represented 25−30% of the large-channel DIN, and ammonium concentrations remained relatively constant with time, with only a weak diel pattern evident. In July 2003, the average daily large-channel DIN load was 23 kg N day−1entering the Powder River, an amount which substantially increased the total Powder River DIN load after the channel confluence. These results suggest that CBNG discharge may be an important source of DIN to western watersheds, at least at certain times of the year, and that net oxidation and/or removal is dependent upon the extent of contact with sediment and biomass, type of drainage channel, and time of day.

Controllability of symmetric spin networks

NASA Astrophysics Data System (ADS)

Albertini, Francesca; D'Alessandro, Domenico

2018-05-01

We consider a network of n spin 1/2 systems which are pairwise interacting via Ising interaction and are controlled by the same electro-magnetic control field. Such a system presents symmetries since the Hamiltonian is unchanged if we permute two spins. This prevents full (operator) controllability, in that not every unitary evolution can be obtained. We prove however that controllability is verified if we restrict ourselves to unitary evolutions which preserve the above permutation invariance. For low dimensional cases, n = 2 and n = 3, we provide an analysis of the Lie group of available evolutions and give explicit control laws to transfer between two arbitrary permutation invariant states. This class of states includes highly entangled states such as Greenberger-Horne-Zeilinger (GHZ) states and W states, which are of interest in quantum information.

A permutation information theory tour through different interest rate maturities: the Libor case.

PubMed

Bariviera, Aurelio Fernández; Guercio, María Belén; Martinez, Lisana B; Rosso, Osvaldo A

2015-12-13

This paper analyses Libor interest rates for seven different maturities and referred to operations in British pounds, euros, Swiss francs and Japanese yen, during the period 2001-2015. The analysis is performed by means of two quantifiers derived from information theory: the permutation Shannon entropy and the permutation Fisher information measure. An anomalous behaviour in the Libor is detected in all currencies except euros during the years 2006-2012. The stochastic switch is more severe in one, two and three months maturities. Given the special mechanism of Libor setting, we conjecture that the behaviour could have been produced by the manipulation that was uncovered by financial authorities. We argue that our methodology is pertinent as a market overseeing instrument. © 2015 The Author(s).

Storage and computationally efficient permutations of factorized covariance and square-root information matrices

NASA Technical Reports Server (NTRS)

Muellerschoen, R. J.

1988-01-01

A unified method to permute vector-stored upper-triangular diagonal factorized covariance (UD) and vector stored upper-triangular square-root information filter (SRIF) arrays is presented. The method involves cyclical permutation of the rows and columns of the arrays and retriangularization with appropriate square-root-free fast Givens rotations or elementary slow Givens reflections. A minimal amount of computation is performed and only one scratch vector of size N is required, where N is the column dimension of the arrays. To make the method efficient for large SRIF arrays on a virtual memory machine, three additional scratch vectors each of size N are used to avoid expensive paging faults. The method discussed is compared with the methods and routines of Bierman's Estimation Subroutine Library (ESL).

The effect of channel height on bubble nucleation in superhydrophobic microchannels due to subcritical heating

NASA Astrophysics Data System (ADS)

Cowley, Adam; Maynes, Daniel; Crockett, Julie; Iverson, Brian

2017-11-01

This work experimentally investigates the effects of heating on laminar flow in high aspect ratio superhydrophobic (SH) microchannels. When water that is saturated with dissolved air is used, the unwetted cavities of the SH surfaces act as nucleation sites and air effervesces out of solution onto the surfaces. The microchannels consist of a rib/cavity structured SH surface, that is heated, and a glass surface that is utilized for flow visualization. Two channel heights of nominally 183 and 366 μm are considered. The friction factor-Reynolds product (fRe) is obtained via pressure drop and volumetric flow rate measurements and the temperature profile along the channel is obtained via thermocouples embedded in an aluminum block below the SH surface. Five surface types/configurations are investigated: smooth hydrophilic, smooth hydrophobic, SH with ribs perpendicular to the flow, SH with ribs parallel to the flow, and SH with both ribs parallel to the flow and sparse ribs perpendicular to the flow. Depending on the surface type/configuration, large bubbles can form and adversely affect fRe and lead to higher temperatures along the channel. Once bubbles grow large enough, they are expelled from the channel. The channel size greatly effects the residence time of the bubbles and consequently fRe and the channel temperature. This research was supported by the National Science Foundation (NSF) (Grant No. CBET-1235881) and the Utah NASA Space Grant Consortium (NASA Grant NNX15A124H).

Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD

NASA Astrophysics Data System (ADS)

Daneshgaran, Fred; Mondin, Marina; Olia, Khashayar

This paper is focused on the problem of Information Reconciliation (IR) for continuous variable Quantum Key Distribution (QKD). The main problem is quantization and assignment of labels to the samples of the Gaussian variables observed at Alice and Bob. Trouble is that most of the samples, assuming that the Gaussian variable is zero mean which is de-facto the case, tend to have small magnitudes and are easily disturbed by noise. Transmission over longer and longer distances increases the losses corresponding to a lower effective Signal-to-Noise Ratio (SNR) exasperating the problem. Quantization over higher dimensions is advantageous since it allows for fractional bit per sample accuracy which may be needed at very low SNR conditions whereby the achievable secret key rate is significantly less than one bit per sample. In this paper, we propose to use Permutation Modulation (PM) for quantization of Gaussian vectors potentially containing thousands of samples. PM is applied to the magnitudes of the Gaussian samples and we explore the dependence of the sign error probability on the magnitude of the samples. At very low SNR, we may transmit the entire label of the PM code from Bob to Alice in Reverse Reconciliation (RR) over public channel. The side information extracted from this label can then be used by Alice to characterize the sign error probability of her individual samples. Forward Error Correction (FEC) coding can be used by Bob on each subset of samples with similar sign error probability to aid Alice in error correction. This can be done for different subsets of samples with similar sign error probabilities leading to an Unequal Error Protection (UEP) coding paradigm.

NASA thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1988-01-01

The access vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries and pseudo-multiword terms that are permutations of words that contain words within words. The access vocabulary contains almost 42,000 entries that give increased access to the hierarchies in Volume 1 - Hierarchical Listing.

Genomic Analysis of Complex Microbial Communities in Wounds

DTIC Science & Technology

2012-01-01

thoroughly in the ecology literature. Permutation Multivariate Analysis of Variance ( PerMANOVA ). We used PerMANOVA to test the null-hypothesis of no...difference between the bacterial communities found within a single wound compared to those from different patients (α = 0.05). PerMANOVA is a...permutation-based version of the multivariate analysis of variance (MANOVA). PerMANOVA uses the distances between samples to partition variance and

Circular permutation of the starch-binding domain: inversion of ligand selectivity with increased affinity.

PubMed

Stephen, Preyesh; Tseng, Kai-Li; Liu, Yu-Nan; Lyu, Ping-Chiang

2012-03-07

Proteins containing starch-binding domains (SBDs) are used in a variety of scientific and technological applications. A circularly permutated SBD (CP90) with improved affinity and selectivity toward longer-chain carbohydrates was synthesized, suggesting that a new starch-binding protein may be developed for specific scientific and industrial applications. This journal is © The Royal Society of Chemistry 2012

Sampling solution traces for the problem of sorting permutations by signed reversals

PubMed Central

2012-01-01

Background Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge. A so-called trace represents a group of solutions which share the same set of reversals that must be applied to sort the original permutation following a partial ordering. By using traces, we therefore can represent the set of optimal solutions in a more compact way. Algorithms for enumerating the complete set of traces of solutions were developed. However, due to their exponential complexity, their practical use is limited to small permutations. A partial enumeration of traces is a sampling of the complete set of traces and can be an alternative for the study of distinct evolutionary scenarios of big permutations. Ideally, the sampling should be done uniformly from the space of all optimal solutions. This is however conjectured to be ♯P-complete. Results We propose and evaluate three algorithms for producing a sampling of the complete set of traces that instead can be shown in practice to preserve some of the characteristics of the space of all solutions. The first algorithm (RA) performs the construction of traces through a random selection of reversals on the list of optimal 1-sequences. The second algorithm (DFALT) consists in a slight modification of an algorithm that performs the complete enumeration of traces. Finally, the third algorithm (SWA) is based on a sliding window strategy to improve the enumeration of traces. All proposed algorithms were able to enumerate traces for permutations with up to 200 elements. Conclusions We analysed the distribution of the enumerated traces with respect to their height and average reversal length. Various works indicate that the reversal length can be an important aspect in genome rearrangements. The algorithms RA and SWA show a tendency to lose traces with high average reversal length. Such traces are however rare, and qualitatively our results show that, for testable-sized permutations, the algorithms DFALT and SWA produce distributions which approximate the reversal length distributions observed with a complete enumeration of the set of traces. PMID:22704580

Permutation glass.

PubMed

Williams, Mobolaji

2018-01-01

The field of disordered systems in statistical physics provides many simple models in which the competing influences of thermal and nonthermal disorder lead to new phases and nontrivial thermal behavior of order parameters. In this paper, we add a model to the subject by considering a disordered system where the state space consists of various orderings of a list. As in spin glasses, the disorder of such "permutation glasses" arises from a parameter in the Hamiltonian being drawn from a distribution of possible values, thus allowing nominally "incorrect orderings" to have lower energies than "correct orderings" in the space of permutations. We analyze a Gaussian, uniform, and symmetric Bernoulli distribution of energy costs, and, by employing Jensen's inequality, derive a simple condition requiring the permutation glass to always transition to the correctly ordered state at a temperature lower than that of the nondisordered system, provided that this correctly ordered state is accessible. We in turn find that in order for the correctly ordered state to be accessible, the probability that an incorrectly ordered component is energetically favored must be less than the inverse of the number of components in the system. We show that all of these results are consistent with a replica symmetric ansatz of the system. We conclude by arguing that there is no distinct permutation glass phase for the simplest model considered here and by discussing how to extend the analysis to more complex Hamiltonians capable of novel phase behavior and replica symmetry breaking. Finally, we outline an apparent correspondence between the presented system and a discrete-energy-level fermion gas. In all, the investigation introduces a class of exactly soluble models into statistical mechanics and provides a fertile ground to investigate statistical models of disorder.

Efficient computation of significance levels for multiple associations in large studies of correlated data, including genomewide association studies.

PubMed

Dudbridge, Frank; Koeleman, Bobby P C

2004-09-01

Large exploratory studies, including candidate-gene-association testing, genomewide linkage-disequilibrium scans, and array-expression experiments, are becoming increasingly common. A serious problem for such studies is that statistical power is compromised by the need to control the false-positive rate for a large family of tests. Because multiple true associations are anticipated, methods have been proposed that combine evidence from the most significant tests, as a more powerful alternative to individually adjusted tests. The practical application of these methods is currently limited by a reliance on permutation testing to account for the correlated nature of single-nucleotide polymorphism (SNP)-association data. On a genomewide scale, this is both very time-consuming and impractical for repeated explorations with standard marker panels. Here, we alleviate these problems by fitting analytic distributions to the empirical distribution of combined evidence. We fit extreme-value distributions for fixed lengths of combined evidence and a beta distribution for the most significant length. An initial phase of permutation sampling is required to fit these distributions, but it can be completed more quickly than a simple permutation test and need be done only once for each panel of tests, after which the fitted parameters give a reusable calibration of the panel. Our approach is also a more efficient alternative to a standard permutation test. We demonstrate the accuracy of our approach and compare its efficiency with that of permutation tests on genomewide SNP data released by the International HapMap Consortium. The estimation of analytic distributions for combined evidence will allow these powerful methods to be applied more widely in large exploratory studies.

Statistical significance approximation in local trend analysis of high-throughput time-series data using the theory of Markov chains.

PubMed

Xia, Li C; Ai, Dongmei; Cram, Jacob A; Liang, Xiaoyi; Fuhrman, Jed A; Sun, Fengzhu

2015-09-21

Local trend (i.e. shape) analysis of time series data reveals co-changing patterns in dynamics of biological systems. However, slow permutation procedures to evaluate the statistical significance of local trend scores have limited its applications to high-throughput time series data analysis, e.g., data from the next generation sequencing technology based studies. By extending the theories for the tail probability of the range of sum of Markovian random variables, we propose formulae for approximating the statistical significance of local trend scores. Using simulations and real data, we show that the approximate p-value is close to that obtained using a large number of permutations (starting at time points >20 with no delay and >30 with delay of at most three time steps) in that the non-zero decimals of the p-values obtained by the approximation and the permutations are mostly the same when the approximate p-value is less than 0.05. In addition, the approximate p-value is slightly larger than that based on permutations making hypothesis testing based on the approximate p-value conservative. The approximation enables efficient calculation of p-values for pairwise local trend analysis, making large scale all-versus-all comparisons possible. We also propose a hybrid approach by integrating the approximation and permutations to obtain accurate p-values for significantly associated pairs. We further demonstrate its use with the analysis of the Polymouth Marine Laboratory (PML) microbial community time series from high-throughput sequencing data and found interesting organism co-occurrence dynamic patterns. The software tool is integrated into the eLSA software package that now provides accelerated local trend and similarity analysis pipelines for time series data. The package is freely available from the eLSA website: http://bitbucket.org/charade/elsa.

How to think about indiscernible particles

NASA Astrophysics Data System (ADS)

Giglio, Daniel Joseph

Permutation symmetries which arise in quantum mechanics pose an intriguing problem. It is not clear that particles which exhibit permutation symmetries (i.e. particles which are indiscernible, meaning that they can be swapped with each other without this yielding a new physical state) qualify as "objects" in any reasonable sense of the term. One solution to this puzzle, which I attribute to W.V. Quine, would have us eliminate such particles from our ontology altogether in order to circumvent the metaphysical vexations caused by permutation symmetries. In this essay I argue that Quine's solution is too rash, and in its place I suggest a novel solution based on altering some of the language of quantum mechanics. Before launching into the technical details of indiscernible particles, however, I begin this essay with some remarks on the methodology -- instrumentalism -- which motivates my arguments.

Weighted fractional permutation entropy and fractional sample entropy for nonlinear Potts financial dynamics

NASA Astrophysics Data System (ADS)

Xu, Kaixuan; Wang, Jun

2017-02-01

In this paper, recently introduced permutation entropy and sample entropy are further developed to the fractional cases, weighted fractional permutation entropy (WFPE) and fractional sample entropy (FSE). The fractional order generalization of information entropy is utilized in the above two complexity approaches, to detect the statistical characteristics of fractional order information in complex systems. The effectiveness analysis of proposed methods on the synthetic data and the real-world data reveals that tuning the fractional order allows a high sensitivity and more accurate characterization to the signal evolution, which is useful in describing the dynamics of complex systems. Moreover, the numerical research on nonlinear complexity behaviors is compared between the returns series of Potts financial model and the actual stock markets. And the empirical results confirm the feasibility of the proposed model.

Fermion systems in discrete space-time

NASA Astrophysics Data System (ADS)

Finster, Felix

2007-05-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Dynamic Testing and Automatic Repair of Reconfigurable Wiring Harnesses

DTIC Science & Technology

2006-11-27

Switch An M ×N grid of switches configured to provide a M -input, N -output routing network. Permutation Network A permutation network performs an...wiring reduces the effective advantage of their reduced switch count, particularly when considering that regular grids (crossbar switches being a...are connected to. The outline circuit shown in Fig. 20 shows how a suitable ‘discovery probe’ might be implemented. The circuit shows a UART

Research of Planetary Gear Fault Diagnosis Based on Permutation Entropy of CEEMDAN and ANFIS

PubMed Central

Kuai, Moshen; Cheng, Gang; Li, Yong

2018-01-01

For planetary gear has the characteristics of small volume, light weight and large transmission ratio, it is widely used in high speed and high power mechanical system. Poor working conditions result in frequent failures of planetary gear. A method is proposed for diagnosing faults in planetary gear based on permutation entropy of Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) Adaptive Neuro-fuzzy Inference System (ANFIS) in this paper. The original signal is decomposed into 6 intrinsic mode functions (IMF) and residual components by CEEMDAN. Since the IMF contains the main characteristic information of planetary gear faults, time complexity of IMFs are reflected by permutation entropies to quantify the fault features. The permutation entropies of each IMF component are defined as the input of ANFIS, and its parameters and membership functions are adaptively adjusted according to training samples. Finally, the fuzzy inference rules are determined, and the optimal ANFIS is obtained. The overall recognition rate of the test sample used for ANFIS is 90%, and the recognition rate of gear with one missing tooth is relatively high. The recognition rates of different fault gears based on the method can also achieve better results. Therefore, the proposed method can be applied to planetary gear fault diagnosis effectively. PMID:29510569

Tolerance of a Knotted Near-Infrared Fluorescent Protein to Random Circular Permutation.

PubMed

Pandey, Naresh; Kuypers, Brianna E; Nassif, Barbara; Thomas, Emily E; Alnahhas, Razan N; Segatori, Laura; Silberg, Jonathan J

2016-07-12

Bacteriophytochrome photoreceptors (BphP) are knotted proteins that have been developed as near-infrared fluorescent protein (iRFP) reporters of gene expression. To explore how rearrangements in the peptides that interlace into the knot within the BphP photosensory core affect folding, we subjected iRFPs to random circular permutation using an improved transposase mutagenesis strategy and screened for variants that fluoresce. We identified 27 circularly permuted iRFPs that display biliverdin-dependent fluorescence in Escherichia coli. The variants with the brightest whole cell fluorescence initiated translation at residues near the domain linker and knot tails, although fluorescent variants that initiated translation within the PAS and GAF domains were discovered. Circularly permuted iRFPs retained sufficient cofactor affinity to fluoresce in tissue culture without the addition of biliverdin, and one variant displayed enhanced fluorescence when expressed in bacteria and tissue culture. This variant displayed a quantum yield similar to that of iRFPs but exhibited increased resistance to chemical denaturation, suggesting that the observed increase in the magnitude of the signal arose from more efficient protein maturation. These results show how the contact order of a knotted BphP can be altered without disrupting chromophore binding and fluorescence, an important step toward the creation of near-infrared biosensors with expanded chemical sensing functions for in vivo imaging.

Tolerance of a knotted near infrared fluorescent protein to random circular permutation

PubMed Central

Pandey, Naresh; Kuypers, Brianna E.; Nassif, Barbara; Thomas, Emily E.; Alnahhas, Razan N.; Segatori, Laura; Silberg, Jonathan J.

2016-01-01

Bacteriophytochrome photoreceptors (BphP) are knotted proteins that have been developed as near-infrared fluorescent protein (iRFP) reporters of gene expression. To explore how rearrangements in the peptides that interlace into the knot within the BphP photosensory core affect folding, we subjected iRFP to random circular permutation using an improved transposase mutagenesis strategy and screened for variants that fluoresce. We identified twenty seven circularly permuted iRFP that display biliverdin-dependent fluorescence in Escherichia coli. The variants with the brightest whole cell fluorescence initiated translation at residues near the domain linker and knot tails, although fluorescent variants were discovered that initiated translation within the PAS and GAF domains. Circularly permuted iRFP retained sufficient cofactor affinity to fluoresce in tissue culture without the addition of biliverdin, and one variant displayed enhanced fluorescence when expressed in bacteria and tissue culture. This variant displayed a similar quantum yield as iRFP, but exhibited increased resistance to chemical denaturation, suggesting that the observed signal increase arose from more efficient protein maturation. These results show how the contact order of a knotted BphP can be altered without disrupting chromophore binding and fluorescence, an important step towards the creation of near-infrared biosensors with expanded chemical-sensing functions for in vivo imaging. PMID:27304983

Research of Planetary Gear Fault Diagnosis Based on Permutation Entropy of CEEMDAN and ANFIS.

PubMed

Kuai, Moshen; Cheng, Gang; Pang, Yusong; Li, Yong

2018-03-05

For planetary gear has the characteristics of small volume, light weight and large transmission ratio, it is widely used in high speed and high power mechanical system. Poor working conditions result in frequent failures of planetary gear. A method is proposed for diagnosing faults in planetary gear based on permutation entropy of Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) Adaptive Neuro-fuzzy Inference System (ANFIS) in this paper. The original signal is decomposed into 6 intrinsic mode functions (IMF) and residual components by CEEMDAN. Since the IMF contains the main characteristic information of planetary gear faults, time complexity of IMFs are reflected by permutation entropies to quantify the fault features. The permutation entropies of each IMF component are defined as the input of ANFIS, and its parameters and membership functions are adaptively adjusted according to training samples. Finally, the fuzzy inference rules are determined, and the optimal ANFIS is obtained. The overall recognition rate of the test sample used for ANFIS is 90%, and the recognition rate of gear with one missing tooth is relatively high. The recognition rates of different fault gears based on the method can also achieve better results. Therefore, the proposed method can be applied to planetary gear fault diagnosis effectively.

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.

General Rotorcraft Aeromechanical Stability Program (GRASP) - Theory Manual

DTIC Science & Technology

1990-10-01

the A basis. Two symbols frequently encountered in vector operations that use index notation are the Kronecker delta eij and the Levi - Civita epsilon...Blade root cutout fijk Levi - Civita epsilon permutation symbol 0 pretwist angle 0’ pretwist per unit length (d;) Oi Tait-Bryan angles K~i moment strains...the components of the identity tensor in a Cartesian coordinate system, while the Levi Civita epsilon consists of components of the permutation

Using permutations to detect dependence between time series

NASA Astrophysics Data System (ADS)

Cánovas, Jose S.; Guillamón, Antonio; Ruíz, María del Carmen

2011-07-01

In this paper, we propose an independence test between two time series which is based on permutations. The proposed test can be carried out by means of different common statistics such as Pearson’s chi-square or the likelihood ratio. We also point out why an exact test is necessary. Simulated and real data (return exchange rates between several currencies) reveal the capacity of this test to detect linear and nonlinear dependences.

Scrambled Sobol Sequences via Permutation

DTIC Science & Technology

2009-01-01

LCG LCG64 LFG MLFG PMLCG Sobol Scrambler PermutationScrambler LinearScrambler <<uses>> PermuationFactory StaticFactory DynamicFactory <<uses>> Figure 3...Phy., 19:252–256, 1979. [2] Emanouil I. Atanassov. A new efficient algorithm for generating the scrambled sobol ’ sequence. In NMA ’02: Revised Papers...Deidre W.Evan, and Micheal Mascagni. On the scrambled sobol sequence. In ICCS2005, pages 775–782, 2005. [7] Richard Durstenfeld. Algorithm 235: Random

Using NDVI to measure precipitation in semi-arid landscapes

USGS Publications Warehouse

Birtwhistle, Amy N.; Laituri, Melinda; Bledsoe, Brian; Friedman, Jonathan M.

2016-01-01

Measuring precipitation in semi-arid landscapes is important for understanding the processes related to rainfall and run-off; however, measuring precipitation accurately can often be challenging especially within remote regions where precipitation instruments are scarce. Typically, rain-gauges are sparsely distributed and research comparing rain-gauge and RADAR precipitation estimates reveal that RADAR data are often misleading, especially for monsoon season convective storms. This study investigates an alternative way to map the spatial and temporal variation of precipitation inputs along ephemeral stream channels using Normalized Difference Vegetation Index (NDVI) derived from Landsat Thematic Mapper imagery. NDVI values from 26 years of pre- and post-monsoon season Landsat imagery were derived across Yuma Proving Ground (YPG), a region covering 3,367 km2 of semiarid landscapes in southwestern Arizona, USA. The change in NDVI from a pre-to post-monsoon season image along ephemeral stream channels explained 73% of the variance in annual monsoonal precipitation totals from a nearby rain-gauge. In addition, large seasonal changes in NDVI along channels were useful in determining when and where flow events have occurred.

Data Decomposition Techniques with Multi-Scale Permutation Entropy Calculations for Bearing Fault Diagnosis

PubMed Central

Yasir, Muhammad Naveed; Koh, Bong-Hwan

2018-01-01

This paper presents the local mean decomposition (LMD) integrated with multi-scale permutation entropy (MPE), also known as LMD-MPE, to investigate the rolling element bearing (REB) fault diagnosis from measured vibration signals. First, the LMD decomposed the vibration data or acceleration measurement into separate product functions that are composed of both amplitude and frequency modulation. MPE then calculated the statistical permutation entropy from the product functions to extract the nonlinear features to assess and classify the condition of the healthy and damaged REB system. The comparative experimental results of the conventional LMD-based multi-scale entropy and MPE were presented to verify the authenticity of the proposed technique. The study found that LMD-MPE’s integrated approach provides reliable, damage-sensitive features when analyzing the bearing condition. The results of REB experimental datasets show that the proposed approach yields more vigorous outcomes than existing methods. PMID:29690526

Optimization and experimental realization of the quantum permutation algorithm

NASA Astrophysics Data System (ADS)

Yalçınkaya, I.; Gedik, Z.

2017-12-01

The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its n -qubit implementations, the number of required quantum gates scales quadratically with n due to the quantum Fourier transforms included. We show here for the n -qubit case that the algorithm can be simplified so that it requires only O (n ) quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.

A faster 1.375-approximation algorithm for sorting by transpositions.

PubMed

Cunha, Luís Felipe I; Kowada, Luis Antonio B; Hausen, Rodrigo de A; de Figueiredo, Celina M H

2015-11-01

Sorting by Transpositions is an NP-hard problem for which several polynomial-time approximation algorithms have been developed. Hartman and Shamir (2006) developed a 1.5-approximation [Formula: see text] algorithm, whose running time was improved to O(nlogn) by Feng and Zhu (2007) with a data structure they defined, the permutation tree. Elias and Hartman (2006) developed a 1.375-approximation O(n(2)) algorithm, and Firoz et al. (2011) claimed an improvement to the running time, from O(n(2)) to O(nlogn), by using the permutation tree. We provide counter-examples to the correctness of Firoz et al.'s strategy, showing that it is not possible to reach a component by sufficient extensions using the method proposed by them. In addition, we propose a 1.375-approximation algorithm, modifying Elias and Hartman's approach with the use of permutation trees and achieving O(nlogn) time.

A Weak Quantum Blind Signature with Entanglement Permutation

NASA Astrophysics Data System (ADS)

Lou, Xiaoping; Chen, Zhigang; Guo, Ying

2015-09-01

Motivated by the permutation encryption algorithm, a weak quantum blind signature (QBS) scheme is proposed. It involves three participants, including the sender Alice, the signatory Bob and the trusted entity Charlie, in four phases, i.e., initializing phase, blinding phase, signing phase and verifying phase. In a small-scale quantum computation network, Alice blinds the message based on a quantum entanglement permutation encryption algorithm that embraces the chaotic position string. Bob signs the blinded message with private parameters shared beforehand while Charlie verifies the signature's validity and recovers the original message. Analysis shows that the proposed scheme achieves the secure blindness for the signer and traceability for the message owner with the aid of the authentic arbitrator who plays a crucial role when a dispute arises. In addition, the signature can neither be forged nor disavowed by the malicious attackers. It has a wide application to E-voting and E-payment system, etc.

Phase Transitions in Definite Total Spin States of Two-Component Fermi Gases.

PubMed

Yurovsky, Vladimir A

2017-05-19

Second-order phase transitions have no latent heat and are characterized by a change in symmetry. In addition to the conventional symmetric and antisymmetric states under permutations of bosons and fermions, mathematical group-representation theory allows for non-Abelian permutation symmetry. Such symmetry can be hidden in states with defined total spins of spinor gases, which can be formed in optical cavities. The present work shows that the symmetry reveals itself in spin-independent or coordinate-independent properties of these gases, namely as non-Abelian entropy in thermodynamic properties. In weakly interacting Fermi gases, two phases appear associated with fermionic and non-Abelian symmetry under permutations of particle states, respectively. The second-order transitions between the phases are characterized by discontinuities in specific heat. Unlike other phase transitions, the present ones are not caused by interactions and can appear even in ideal gases. Similar effects in Bose gases and strong interactions are discussed.

Data Decomposition Techniques with Multi-Scale Permutation Entropy Calculations for Bearing Fault Diagnosis.

PubMed

Yasir, Muhammad Naveed; Koh, Bong-Hwan

2018-04-21

This paper presents the local mean decomposition (LMD) integrated with multi-scale permutation entropy (MPE), also known as LMD-MPE, to investigate the rolling element bearing (REB) fault diagnosis from measured vibration signals. First, the LMD decomposed the vibration data or acceleration measurement into separate product functions that are composed of both amplitude and frequency modulation. MPE then calculated the statistical permutation entropy from the product functions to extract the nonlinear features to assess and classify the condition of the healthy and damaged REB system. The comparative experimental results of the conventional LMD-based multi-scale entropy and MPE were presented to verify the authenticity of the proposed technique. The study found that LMD-MPE’s integrated approach provides reliable, damage-sensitive features when analyzing the bearing condition. The results of REB experimental datasets show that the proposed approach yields more vigorous outcomes than existing methods.

An extended continuous estimation of distribution algorithm for solving the permutation flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Shao, Zhongshi; Pi, Dechang; Shao, Weishi

2017-11-01

This article proposes an extended continuous estimation of distribution algorithm (ECEDA) to solve the permutation flow-shop scheduling problem (PFSP). In ECEDA, to make a continuous estimation of distribution algorithm (EDA) suitable for the PFSP, the largest order value rule is applied to convert continuous vectors to discrete job permutations. A probabilistic model based on a mixed Gaussian and Cauchy distribution is built to maintain the exploration ability of the EDA. Two effective local search methods, i.e. revolver-based variable neighbourhood search and Hénon chaotic-based local search, are designed and incorporated into the EDA to enhance the local exploitation. The parameters of the proposed ECEDA are calibrated by means of a design of experiments approach. Simulation results and comparisons based on some benchmark instances show the efficiency of the proposed algorithm for solving the PFSP.

Far Ultraviolet Refractive Index of Optical Materials for Solar Blind Channel (SBC) Filters for HST Advanced Camera for Surveys

NASA Technical Reports Server (NTRS)

Leviton, Douglas B.; Madison, Timothy J.; Petrone, Peter

1998-01-01

Refractive index measurements using the minimum deviation method have been carried out for prisms of a variety of far ultraviolet optical materials used in the manufacture of Solar Blind Channel (SBC) filters for the HST Advanced Camera for Surveys (ACS). Some of the materials measured are gaining popularity in a variety of high technology applications including high power excimer lasers and advanced microlithography optics operating in a wavelength region where high quality knowledge of optical material properties is sparse. Our measurements are of unusually high accuracy and precision for this wavelength region owing to advanced instrumentation in the large vacuum chamber of the Diffraction Grating Evaluation Facility (DGEF) at Goddard Space Flight Center (GSFC). Index values for CaF2, BaF2, LiF, and far ultraviolet grades of synthetic sapphire and synthetic fused silica are reported and compared with values from the literature.

Inferring the Presence of Reverse Proxies Through Timing Analysis

DTIC Science & Technology

2015-06-01

16 Figure 3.2 The three different instances of timing measurement configurations 17 Figure 3.3 Permutation of a web request iteration...Their data showed that they could detect at least 6 bits of entropy between unlike devices and that it was enough to determine that they are in fact...depending on the permutation being executed so that every iteration was conducted under the same distance 15 City   Lat   Long   City   Lat   Long

Permutation entropy and statistical complexity analysis of turbulence in laboratory plasmas and the solar wind.

PubMed

Weck, P J; Schaffner, D A; Brown, M R; Wicks, R T

2015-02-01

The Bandt-Pompe permutation entropy and the Jensen-Shannon statistical complexity are used to analyze fluctuating time series of three different turbulent plasmas: the magnetohydrodynamic (MHD) turbulence in the plasma wind tunnel of the Swarthmore Spheromak Experiment (SSX), drift-wave turbulence of ion saturation current fluctuations in the edge of the Large Plasma Device (LAPD), and fully developed turbulent magnetic fluctuations of the solar wind taken from the Wind spacecraft. The entropy and complexity values are presented as coordinates on the CH plane for comparison among the different plasma environments and other fluctuation models. The solar wind is found to have the highest permutation entropy and lowest statistical complexity of the three data sets analyzed. Both laboratory data sets have larger values of statistical complexity, suggesting that these systems have fewer degrees of freedom in their fluctuations, with SSX magnetic fluctuations having slightly less complexity than the LAPD edge I(sat). The CH plane coordinates are compared to the shape and distribution of a spectral decomposition of the wave forms. These results suggest that fully developed turbulence (solar wind) occupies the lower-right region of the CH plane, and that other plasma systems considered to be turbulent have less permutation entropy and more statistical complexity. This paper presents use of this statistical analysis tool on solar wind plasma, as well as on an MHD turbulent experimental plasma.

Unifying the rotational and permutation symmetry of nuclear spin states: Schur-Weyl duality in molecular physics.

PubMed

Schmiedt, Hanno; Jensen, Per; Schlemmer, Stephan

2016-08-21

In modern physics and chemistry concerned with many-body systems, one of the mainstays is identical-particle-permutation symmetry. In particular, both the intra-molecular dynamics of a single molecule and the inter-molecular dynamics associated, for example, with reactive molecular collisions are strongly affected by selection rules originating in nuclear-permutation symmetry operations being applied to the total internal wavefunctions, including nuclear spin, of the molecules involved. We propose here a general tool to determine coherently the permutation symmetry and the rotational symmetry (associated with the group of arbitrary rotations of the entire molecule in space) of molecular wavefunctions, in particular the nuclear-spin functions. Thus far, these two symmetries were believed to be mutually independent and it has even been argued that under certain circumstances, it is impossible to establish a one-to-one correspondence between them. However, using the Schur-Weyl duality theorem we show that the two types of symmetry are inherently coupled. In addition, we use the ingenious representation-theory technique of Young tableaus to represent the molecular nuclear-spin degrees of freedom in terms of well-defined mathematical objects. This simplifies the symmetry classification of the nuclear wavefunction even for large molecules. Also, the application to reactive collisions is very straightforward and provides a much simplified approach to obtaining selection rules.

Unifying the rotational and permutation symmetry of nuclear spin states: Schur-Weyl duality in molecular physics

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

Schmiedt, Hanno; Schlemmer, Stephan; Jensen, Per, E-mail: jensen@uni-wuppertal.de

In modern physics and chemistry concerned with many-body systems, one of the mainstays is identical-particle-permutation symmetry. In particular, both the intra-molecular dynamics of a single molecule and the inter-molecular dynamics associated, for example, with reactive molecular collisions are strongly affected by selection rules originating in nuclear-permutation symmetry operations being applied to the total internal wavefunctions, including nuclear spin, of the molecules involved. We propose here a general tool to determine coherently the permutation symmetry and the rotational symmetry (associated with the group of arbitrary rotations of the entire molecule in space) of molecular wavefunctions, in particular the nuclear-spin functions. Thusmore » far, these two symmetries were believed to be mutually independent and it has even been argued that under certain circumstances, it is impossible to establish a one-to-one correspondence between them. However, using the Schur-Weyl duality theorem we show that the two types of symmetry are inherently coupled. In addition, we use the ingenious representation-theory technique of Young tableaus to represent the molecular nuclear-spin degrees of freedom in terms of well-defined mathematical objects. This simplifies the symmetry classification of the nuclear wavefunction even for large molecules. Also, the application to reactive collisions is very straightforward and provides a much simplified approach to obtaining selection rules.« less

Potential energy surface fitting by a statistically localized, permutationally invariant, local interpolating moving least squares method for the many-body potential: Method and application to N{sub 4}

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

Bender, Jason D.; Doraiswamy, Sriram; Candler, Graham V., E-mail: truhlar@umn.edu, E-mail: candler@aem.umn.edu

2014-02-07

Fitting potential energy surfaces to analytic forms is an important first step for efficient molecular dynamics simulations. Here, we present an improved version of the local interpolating moving least squares method (L-IMLS) for such fitting. Our method has three key improvements. First, pairwise interactions are modeled separately from many-body interactions. Second, permutational invariance is incorporated in the basis functions, using permutationally invariant polynomials in Morse variables, and in the weight functions. Third, computational cost is reduced by statistical localization, in which we statistically correlate the cutoff radius with data point density. We motivate our discussion in this paper with amore » review of global and local least-squares-based fitting methods in one dimension. Then, we develop our method in six dimensions, and we note that it allows the analytic evaluation of gradients, a feature that is important for molecular dynamics. The approach, which we call statistically localized, permutationally invariant, local interpolating moving least squares fitting of the many-body potential (SL-PI-L-IMLS-MP, or, more simply, L-IMLS-G2), is used to fit a potential energy surface to an electronic structure dataset for N{sub 4}. We discuss its performance on the dataset and give directions for further research, including applications to trajectory calculations.« less

Aberration compensation of an ultrasound imaging instrument with a reduced number of channels.

PubMed

Jiang, Wei; Astheimer, Jeffrey P; Waag, Robert C

2012-10-01

Focusing and imaging qualities of an ultrasound imaging system that uses aberration correction were experimentally investigated as functions of the number of parallel channels. Front-end electronics that consolidate signals from multiple physical elements can be used to lower hardware and computational costs by reducing the number of parallel channels. However, the signals from sparse arrays of synthetic elements yield poorer aberration estimates. In this study, aberration estimates derived from synthetic arrays of varying element sizes are evaluated by comparing compensated receive focuses, compensated transmit focuses, and compensated b-scan images of a point target and a cyst phantom. An array of 80 x 80 physical elements with a pitch of 0.6 x 0.6 mm was used for all of the experiments and the aberration was produced by a phantom selected to mimic propagation through abdominal wall. The results show that aberration correction derived from synthetic arrays with pitches that have a diagonal length smaller than 70% of the correlation length of the aberration yield focuses and images of approximately the same quality. This connection between correlation length of the aberration and synthetic element size provides a guideline for determining the number of parallel channels that are required when designing imaging systems that employ aberration correction.

A Robust Semi-Parametric Test for Detecting Trait-Dependent Diversification.

PubMed

Rabosky, Daniel L; Huang, Huateng

2016-03-01

Rates of species diversification vary widely across the tree of life and there is considerable interest in identifying organismal traits that correlate with rates of speciation and extinction. However, it has been challenging to develop methodological frameworks for testing hypotheses about trait-dependent diversification that are robust to phylogenetic pseudoreplication and to directionally biased rates of character change. We describe a semi-parametric test for trait-dependent diversification that explicitly requires replicated associations between character states and diversification rates to detect effects. To use the method, diversification rates are reconstructed across a phylogenetic tree with no consideration of character states. A test statistic is then computed to measure the association between species-level traits and the corresponding diversification rate estimates at the tips of the tree. The empirical value of the test statistic is compared to a null distribution that is generated by structured permutations of evolutionary rates across the phylogeny. The test is applicable to binary discrete characters as well as continuous-valued traits and can accommodate extremely sparse sampling of character states at the tips of the tree. We apply the test to several empirical data sets and demonstrate that the method has acceptable Type I error rates. © The Author(s) 2015. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Decentralized modal identification using sparse blind source separation

NASA Astrophysics Data System (ADS)

Sadhu, A.; Hazra, B.; Narasimhan, S.; Pandey, M. D.

2011-12-01

Popular ambient vibration-based system identification methods process information collected from a dense array of sensors centrally to yield the modal properties. In such methods, the need for a centralized processing unit capable of satisfying large memory and processing demands is unavoidable. With the advent of wireless smart sensor networks, it is now possible to process information locally at the sensor level, instead. The information at the individual sensor level can then be concatenated to obtain the global structure characteristics. A novel decentralized algorithm based on wavelet transforms to infer global structure mode information using measurements obtained using a small group of sensors at a time is proposed in this paper. The focus of the paper is on algorithmic development, while the actual hardware and software implementation is not pursued here. The problem of identification is cast within the framework of under-determined blind source separation invoking transformations of measurements to the time-frequency domain resulting in a sparse representation. The partial mode shape coefficients so identified are then combined to yield complete modal information. The transformations are undertaken using stationary wavelet packet transform (SWPT), yielding a sparse representation in the wavelet domain. Principal component analysis (PCA) is then performed on the resulting wavelet coefficients, yielding the partial mixing matrix coefficients from a few measurement channels at a time. This process is repeated using measurements obtained from multiple sensor groups, and the results so obtained from each group are concatenated to obtain the global modal characteristics of the structure.

Convolutional Sparse Coding for RGB+NIR Imaging.

PubMed

Hu, Xuemei; Heide, Felix; Dai, Qionghai; Wetzstein, Gordon

2018-04-01

Emerging sensor designs increasingly rely on novel color filter arrays (CFAs) to sample the incident spectrum in unconventional ways. In particular, capturing a near-infrared (NIR) channel along with conventional RGB color is an exciting new imaging modality. RGB+NIR sensing has broad applications in computational photography, such as low-light denoising, it has applications in computer vision, such as facial recognition and tracking, and it paves the way toward low-cost single-sensor RGB and depth imaging using structured illumination. However, cost-effective commercial CFAs suffer from severe spectral cross talk. This cross talk represents a major challenge in high-quality RGB+NIR imaging, rendering existing spatially multiplexed sensor designs impractical. In this work, we introduce a new approach to RGB+NIR image reconstruction using learned convolutional sparse priors. We demonstrate high-quality color and NIR imaging for challenging scenes, even including high-frequency structured NIR illumination. The effectiveness of the proposed method is validated on a large data set of experimental captures, and simulated benchmark results which demonstrate that this work achieves unprecedented reconstruction quality.

High-level ab initio potential energy surface and dynamics of the F- + CH3I SN2 and proton-transfer reactions.

PubMed

Olasz, Balázs; Szabó, István; Czakó, Gábor

2017-04-01

Bimolecular nucleophilic substitution (S N 2) and proton transfer are fundamental processes in chemistry and F - + CH 3 I is an important prototype of these reactions. Here we develop the first full-dimensional ab initio analytical potential energy surface (PES) for the F - + CH 3 I system using a permutationally invariant fit of high-level composite energies obtained with the combination of the explicitly-correlated CCSD(T)-F12b method, the aug-cc-pVTZ basis, core electron correlation effects, and a relativistic effective core potential for iodine. The PES accurately describes the S N 2 channel producing I - + CH 3 F via Walden-inversion, front-side attack, and double-inversion pathways as well as the proton-transfer channel leading to HF + CH 2 I - . The relative energies of the stationary points on the PES agree well with the new explicitly-correlated all-electron CCSD(T)-F12b/QZ-quality benchmark values. Quasiclassical trajectory computations on the PES show that the proton transfer becomes significant at high collision energies and double-inversion as well as front-side attack trajectories can occur. The computed broad angular distributions and hot internal energy distributions indicate the dominance of indirect mechanisms at lower collision energies, which is confirmed by analyzing the integration time and leaving group velocity distributions. Comparison with available crossed-beam experiments shows usually good agreement.

Development of Scaffolds for Light Harvesting and Photocatalysis from the Coat Protein of Tobacco Mosaic Virus

NASA Astrophysics Data System (ADS)

Dedeo, Michel Toussaint

The utility of a previously developed TMV-based light harvesting system has been dramatically expanded through the introduction of reactive handles for the site-specific modification of the interior and exterior surfaces. Further experiments to reengineer the coat protein have produced structures with unique, unexpected, and useful assembly properties that complement the newly available surface modifications. Energy transfer from chromophores in the RNA channel of self-assembled TMV structures to the exterior was made possible by conjugation of acceptor dyes and porphyrins to the N-terminus. By repositioning the N-terminus to the pore through circular permutation, this process was repeated to create structures that mimic the light harvesting 1 complex of photosynthetic bacteria. To study and improve upon natural photosynthesis, closely packed chromophore arrays and gold nanoparticles were tethered to the pore of stabilized TMV disks through introduction of a uniquely reactive lysine. Finally, a dimeric TMV coat protein was produced to control the distribution and arrangement of synthetic groups with synergistic activity.

Successful attack on permutation-parity-machine-based neural cryptography.

PubMed

Seoane, Luís F; Ruttor, Andreas

2012-02-01

An algorithm is presented which implements a probabilistic attack on the key-exchange protocol based on permutation parity machines. Instead of imitating the synchronization of the communicating partners, the strategy consists of a Monte Carlo method to sample the space of possible weights during inner rounds and an analytic approach to convey the extracted information from one outer round to the next one. The results show that the protocol under attack fails to synchronize faster than an eavesdropper using this algorithm.

Crossbar Switches For Optical Data-Communication Networks

NASA Technical Reports Server (NTRS)

Monacos, Steve P.

1994-01-01

Optoelectronic and electro-optical crossbar switches called "permutation engines" (PE's) developed to route packets of data through fiber-optic communication networks. Basic network concept described in "High-Speed Optical Wide-Area Data-Communication Network" (NPO-18983). Nonblocking operation achieved by decentralized switching and control scheme. Each packet routed up or down in each column of this 5-input/5-output permutation engine. Routing algorithm ensures each packet arrives at its designated output port without blocking any other packet that does not contend for same output port.

Security of the Five-Round KASUMI Type Permutation

NASA Astrophysics Data System (ADS)

Iwata, Tetsu; Yagi, Tohru; Kurosawa, Kaoru

KASUMI is a blockcipher that forms the heart of the 3GPP confidentiality and integrity algorithms. In this paper, we study the security of the five-round KASUMI type permutations, and derive a highly non-trivial security bound against adversaries with adaptive chosen plaintext and chosen ciphertext attacks. To derive our security bound, we heavily use the tools from graph theory. However the result does not show its super-pseudorandomness, this gives us a strong evidence that the design of KASUMI is sound.

Lysine and the Na+/K+ Selectivity in Mammalian Voltage-Gated Sodium Channels.

PubMed

Li, Yang; Liu, Huihui; Xia, Mengdie; Gong, Haipeng

2016-01-01

Voltage-gated sodium (Nav) channels are critical in the generation and transmission of neuronal signals in mammals. The crystal structures of several prokaryotic Nav channels determined in recent years inspire the mechanistic studies on their selection upon the permeable cations (especially between Na+ and K+ ions), a property that is proposed to be mainly determined by residues in the selectivity filter. However, the mechanism of cation selection in mammalian Nav channels lacks direct explanation at atomic level due to the difference in amino acid sequences between mammalian and prokaryotic Nav homologues, especially at the constriction site where the DEKA motif has been identified to determine the Na+/K+ selectivity in mammalian Nav channels but is completely absent in the prokaryotic counterparts. Among the DEKA residues, Lys is of the most importance since its mutation to Arg abolishes the Na+/K+ selectivity. In this work, we modeled the pore domain of mammalian Nav channels by mutating the four residues at the constriction site of a prokaryotic Nav channel (NavRh) to DEKA, and then mechanistically investigated the contribution of Lys in cation selection using molecular dynamics simulations. The DERA mutant was generated as a comparison to understand the loss of ion selectivity caused by the K-to-R mutation. Simulations and free energy calculations on the mutants indicate that Lys facilitates Na+/K+ selection by electrostatically repelling the cation to a highly Na+-selective location sandwiched by the carboxylate groups of Asp and Glu at the constriction site. In contrast, the electrostatic repulsion is substantially weakened when Lys is mutated to Arg, because of two intrinsic properties of the Arg side chain: the planar geometric design and the sparse charge distribution of the guanidine group.

Anomalously-dense firn in an ice-shelf channel revealed by wide-angle radar

NASA Astrophysics Data System (ADS)

Drews, R.; Brown, J.; Matsuoka, K.; Witrant, E.; Philippe, M.; Hubbard, B.; Pattyn, F.

2015-10-01

The thickness of ice shelves, a basic parameter for mass balance estimates, is typically inferred using hydrostatic equilibrium for which knowledge of the depth-averaged density is essential. The densification from snow to ice depends on a number of local factors (e.g. temperature and surface mass balance) causing spatial and temporal variations in density-depth profiles. However, direct measurements of firn density are sparse, requiring substantial logistical effort. Here, we infer density from radio-wave propagation speed using ground-based wide-angle radar datasets (10 MHz) collected at five sites on Roi Baudouin Ice Shelf (RBIS), Dronning Maud Land, Antarctica. Using a novel algorithm including traveltime inversion and raytracing with a prescribed shape of the depth-density relationship, we show that the depth to internal reflectors, the local ice thickness and depth-averaged densities can reliably be reconstructed. For the particular case of an ice-shelf channel, where ice thickness and surface slope change substantially over a few kilometers, the radar data suggests that firn inside the channel is about 5 % denser than outside the channel. Although this density difference is at the detection limit of the radar, it is consistent with a similar density anomaly reconstructed from optical televiewing, which reveals 10 % denser firn inside compared to outside the channel. The denser firn in the ice-shelf channel should be accounted for when using the hydrostatic ice thickness for determining basal melt rates. The radar method presented here is robust and can easily be adapted to different radar frequencies and data-acquisition geometries.

Constraining variable density of ice shelves using wide-angle radar measurements

NASA Astrophysics Data System (ADS)

Drews, Reinhard; Brown, Joel; Matsuoka, Kenichi; Witrant, Emmanuel; Philippe, Morgane; Hubbard, Bryn; Pattyn, Frank

2016-04-01

The thickness of ice shelves, a basic parameter for mass balance estimates, is typically inferred using hydrostatic equilibrium, for which knowledge of the depth-averaged density is essential. The densification from snow to ice depends on a number of local factors (e.g., temperature and surface mass balance) causing spatial and temporal variations in density-depth profiles. However, direct measurements of firn density are sparse, requiring substantial logistical effort. Here, we infer density from radio-wave propagation speed using ground-based wide-angle radar data sets (10 MHz) collected at five sites on Roi Baudouin Ice Shelf (RBIS), Dronning Maud Land, Antarctica. We reconstruct depth to internal reflectors, local ice thickness, and firn-air content using a novel algorithm that includes traveltime inversion and ray tracing with a prescribed shape of the depth-density relationship. For the particular case of an ice-shelf channel, where ice thickness and surface slope change substantially over a few kilometers, the radar data suggest that firn inside the channel is about 5 % denser than outside the channel. Although this density difference is at the detection limit of the radar, it is consistent with a similar density anomaly reconstructed from optical televiewing, which reveals that the firn inside the channel is 4.7 % denser than that outside the channel. Hydrostatic ice thickness calculations used for determining basal melt rates should account for the denser firn in ice-shelf channels. The radar method presented here is robust and can easily be adapted to different radar frequencies and data-acquisition geometries.

Characterization of network structure in stereoEEG data using consensus-based partial coherence.

PubMed

Ter Wal, Marije; Cardellicchio, Pasquale; LoRusso, Giorgio; Pelliccia, Veronica; Avanzini, Pietro; Orban, Guy A; Tiesinga, Paul He

2018-06-06

Coherence is a widely used measure to determine the frequency-resolved functional connectivity between pairs of recording sites, but this measure is confounded by shared inputs to the pair. To remove shared inputs, the 'partial coherence' can be computed by conditioning the spectral matrices of the pair on all other recorded channels, which involves the calculation of a matrix (pseudo-) inverse. It has so far remained a challenge to use the time-resolved partial coherence to analyze intracranial recordings with a large number of recording sites. For instance, calculating the partial coherence using a pseudoinverse method produces a high number of false positives when it is applied to a large number of channels. To address this challenge, we developed a new method that randomly aggregated channels into a smaller number of effective channels on which the calculation of partial coherence was based. We obtained a 'consensus' partial coherence (cPCOH) by repeating this approach for several random aggregations of channels (permutations) and only accepting those activations in time and frequency with a high enough consensus. Using model data we show that the cPCOH method effectively filters out the effect of shared inputs and performs substantially better than the pseudo-inverse. We successfully applied the cPCOH procedure to human stereotactic EEG data and demonstrated three key advantages of this method relative to alternative procedures. First, it reduces the number of false positives relative to the pseudo-inverse method. Second, it allows for titration of the amount of false positives relative to the false negatives by adjusting the consensus threshold, thus allowing the data-analyst to prioritize one over the other to meet specific analysis demands. Third, it substantially reduced the number of identified interactions compared to coherence, providing a sparser network of connections from which clear spatial patterns emerged. These patterns can serve as a starting point of further analyses that provide insight into network dynamics during cognitive processes. These advantages likely generalize to other modalities in which shared inputs introduce confounds, such as electroencephalography (EEG) and magneto-encephalography (MEG). Copyright © 2018. Published by Elsevier Inc.

Validation of brain-derived signals in near-infrared spectroscopy through multivoxel analysis of concurrent functional magnetic resonance imaging.

PubMed

Moriguchi, Yoshiya; Noda, Takamasa; Nakayashiki, Kosei; Takata, Yohei; Setoyama, Shiori; Kawasaki, Shingo; Kunisato, Yoshihiko; Mishima, Kazuo; Nakagome, Kazuyuki; Hanakawa, Takashi

2017-10-01

Near-infrared spectroscopy (NIRS) is a convenient and safe brain-mapping tool. However, its inevitable confounding with hemodynamic responses outside the brain, especially in the frontotemporal head, has questioned its validity. Some researchers attempted to validate NIRS signals through concurrent measurements with functional magnetic resonance imaging (fMRI), but, counterintuitively, NIRS signals rarely correlate with local fMRI signals in NIRS channels, although both mapping techniques should measure the same hemoglobin concentration. Here, we tested a novel hypothesis that different voxels within the scalp and the brain tissues might have substantially different hemoglobin absorption rates of near-infrared light, which might differentially contribute to NIRS signals across channels. Therefore, we newly applied a multivariate approach, a partial least squares regression, to explain NIRS signals with multivoxel information from fMRI within the brain and soft tissues in the head. We concurrently obtained fMRI and NIRS signals in 9 healthy human subjects engaging in an n-back task. The multivariate fMRI model was quite successfully able to predict the NIRS signals by cross-validation (interclass correlation coefficient = ∼0.85). This result confirmed that fMRI and NIRS surely measure the same hemoglobin concentration. Additional application of Monte-Carlo permutation tests confirmed that the model surely reflects temporal and spatial hemodynamic information, not random noise. After this thorough validation, we calculated the ratios of the contributions of the brain and soft-tissue hemodynamics to the NIRS signals, and found that the contribution ratios were quite different across different NIRS channels in reality, presumably because of the structural complexity of the frontotemporal regions. Hum Brain Mapp 38:5274-5291, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Coupled potential energy surface for the F(2P)+CH4→HF+CH3 entrance channel and quantum dynamics of the CH4·F- photodetachment.

PubMed

Westermann, Till; Eisfeld, Wolfgang; Manthe, Uwe

2013-07-07

An approach to construct vibronically and spin-orbit coupled diabatic potential energy surfaces (PESs) which describe all three relevant electronic states in the entrance channels of the X(P) + CH4 →HX + CH3 reactions (with X=F((2)P), Cl((2)P), or O((3)P)) is introduced. The diabatization relies on the permutational symmetry present in the methane molecule and results in diabatic states which transform as the three p orbitals of the X atom. Spin-orbit coupling is easily and accurately included using the atomic spin-orbit coupling matrix of the isolated X atom. The method is applied to the F + CH4 system obtaining an accurate PES for the entrance channel based on ab initio multi-reference configuration interaction (MRCI) calculations. Comparing the resulting PESs with spin-orbit MRCI calculations, excellent agreement is found for the excited electronic states at all relevant geometries. The photodetachment spectrum of CH4·F(-) is investigated via full-dimensional (12D) quantum dynamics calculations on the coupled PESs using the multi-layer multi-configurational time-dependent Hartree approach. Extending previous work [J. Palma and U. Manthe, J. Chem. Phys. 137, 044306 (2012)], which was restricted to the dynamics on a single adiabatic PES, the contributions of the electronically excited states to the photodetachment spectrum are calculated and compared to experiment. Considering different experimental setups, good agreement between experiment and theory is found. Addressing questions raised in the previous work, the present dynamical calculations show that the main contribution to the second peak in the photodetachment spectrum results from electron detachment into the electronically excited states of the CH4F complex.

A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems.

PubMed

Brusco, Michael J; Steinley, Douglas

2012-02-01

There are a number of important problems in quantitative psychology that require the identification of a permutation of the n rows and columns of an n × n proximity matrix. These problems encompass applications such as unidimensional scaling, paired-comparison ranking, and anti-Robinson forms. The importance of simultaneously incorporating multiple objective criteria in matrix permutation applications is well recognized in the literature; however, to date, there has been a reliance on weighted-sum approaches that transform the multiobjective problem into a single-objective optimization problem. Although exact solutions to these single-objective problems produce supported Pareto efficient solutions to the multiobjective problem, many interesting unsupported Pareto efficient solutions may be missed. We illustrate the limitation of the weighted-sum approach with an example from the psychological literature and devise an effective heuristic algorithm for estimating both the supported and unsupported solutions of the Pareto efficient set. © 2011 The British Psychological Society.

Automated matching of corresponding seed images of three simulator radiographs to allow 3D triangulation of implanted seeds.

PubMed

Altschuler, M D; Kassaee, A

1997-02-01

To match corresponding seed images in different radiographs so that the 3D seed locations can be triangulated automatically and without ambiguity requires (at least) three radiographs taken from different perspectives, and an algorithm that finds the proper permutations of the seed-image indices. Matching corresponding images in only two radiographs introduces inherent ambiguities which can be resolved only with the use of non-positional information obtained with intensive human effort. Matching images in three or more radiographs is an 'NP (Non-determinant in Polynomial time)-complete' problem. Although the matching problem is fundamental, current methods for three-radiograph seed-image matching use 'local' (seed-by-seed) methods that may lead to incorrect matchings. We describe a permutation-sampling method which not only gives good 'global' (full permutation) matches for the NP-complete three-radiograph seed-matching problem, but also determines the reliability of the radiographic data themselves, namely, whether the patient moved in the interval between radiographic perspectives.

Automated matching of corresponding seed images of three simulator radiographs to allow 3D triangulation of implanted seeds

NASA Astrophysics Data System (ADS)

Altschuler, Martin D.; Kassaee, Alireza

1997-02-01

To match corresponding seed images in different radiographs so that the 3D seed locations can be triangulated automatically and without ambiguity requires (at least) three radiographs taken from different perspectives, and an algorithm that finds the proper permutations of the seed-image indices. Matching corresponding images in only two radiographs introduces inherent ambiguities which can be resolved only with the use of non-positional information obtained with intensive human effort. Matching images in three or more radiographs is an `NP (Non-determinant in Polynomial time)-complete' problem. Although the matching problem is fundamental, current methods for three-radiograph seed-image matching use `local' (seed-by-seed) methods that may lead to incorrect matchings. We describe a permutation-sampling method which not only gives good `global' (full permutation) matches for the NP-complete three-radiograph seed-matching problem, but also determines the reliability of the radiographic data themselves, namely, whether the patient moved in the interval between radiographic perspectives.

Classifying epileptic EEG signals with delay permutation entropy and Multi-Scale K-means.

PubMed

Zhu, Guohun; Li, Yan; Wen, Peng Paul; Wang, Shuaifang

2015-01-01

Most epileptic EEG classification algorithms are supervised and require large training datasets, that hinder their use in real time applications. This chapter proposes an unsupervised Multi-Scale K-means (MSK-means) MSK-means algorithm to distinguish epileptic EEG signals and identify epileptic zones. The random initialization of the K-means algorithm can lead to wrong clusters. Based on the characteristics of EEGs, the MSK-means MSK-means algorithm initializes the coarse-scale centroid of a cluster with a suitable scale factor. In this chapter, the MSK-means algorithm is proved theoretically superior to the K-means algorithm on efficiency. In addition, three classifiers: the K-means, MSK-means MSK-means and support vector machine (SVM), are used to identify seizure and localize epileptogenic zone using delay permutation entropy features. The experimental results demonstrate that identifying seizure with the MSK-means algorithm and delay permutation entropy achieves 4. 7 % higher accuracy than that of K-means, and 0. 7 % higher accuracy than that of the SVM.

Exploiting Lipid Permutation Symmetry to Compute Membrane Remodeling Free Energies.

PubMed

Bubnis, Greg; Risselada, Herre Jelger; Grubmüller, Helmut

2016-10-28

A complete physical description of membrane remodeling processes, such as fusion or fission, requires knowledge of the underlying free energy landscapes, particularly in barrier regions involving collective shape changes, topological transitions, and high curvature, where Canham-Helfrich (CH) continuum descriptions may fail. To calculate these free energies using atomistic simulations, one must address not only the sampling problem due to high free energy barriers, but also an orthogonal sampling problem of combinatorial complexity stemming from the permutation symmetry of identical lipids. Here, we solve the combinatorial problem with a permutation reduction scheme to map a structural ensemble into a compact, nondegenerate subregion of configuration space, thereby permitting straightforward free energy calculations via umbrella sampling. We applied this approach, using a coarse-grained lipid model, to test the CH description of bending and found sharp increases in the bending modulus for curvature radii below 10 nm. These deviations suggest that an anharmonic bending term may be required for CH models to give quantitative energetics of highly curved states.

A fast chaos-based image encryption scheme with a dynamic state variables selection mechanism

NASA Astrophysics Data System (ADS)

Chen, Jun-xin; Zhu, Zhi-liang; Fu, Chong; Yu, Hai; Zhang, Li-bo

2015-03-01

In recent years, a variety of chaos-based image cryptosystems have been investigated to meet the increasing demand for real-time secure image transmission. Most of them are based on permutation-diffusion architecture, in which permutation and diffusion are two independent procedures with fixed control parameters. This property results in two flaws. (1) At least two chaotic state variables are required for encrypting one plain pixel, in permutation and diffusion stages respectively. Chaotic state variables produced with high computation complexity are not sufficiently used. (2) The key stream solely depends on the secret key, and hence the cryptosystem is vulnerable against known/chosen-plaintext attacks. In this paper, a fast chaos-based image encryption scheme with a dynamic state variables selection mechanism is proposed to enhance the security and promote the efficiency of chaos-based image cryptosystems. Experimental simulations and extensive cryptanalysis have been carried out and the results prove the superior security and high efficiency of the scheme.

Simultaneous and Sequential MS/MS Scan Combinations and Permutations in a Linear Quadrupole Ion Trap.

PubMed

Snyder, Dalton T; Szalwinski, Lucas J; Cooks, R Graham

2017-10-17

Methods of performing precursor ion scans as well as neutral loss scans in a single linear quadrupole ion trap have recently been described. In this paper we report methodology for performing permutations of MS/MS scan modes, that is, ordered combinations of precursor, product, and neutral loss scans following a single ion injection event. Only particular permutations are allowed; the sequences demonstrated here are (1) multiple precursor ion scans, (2) precursor ion scans followed by a single neutral loss scan, (3) precursor ion scans followed by product ion scans, and (4) segmented neutral loss scans. (5) The common product ion scan can be performed earlier in these sequences, under certain conditions. Simultaneous scans can also be performed. These include multiple precursor ion scans, precursor ion scans with an accompanying neutral loss scan, and multiple neutral loss scans. We argue that the new capability to perform complex simultaneous and sequential MS n operations on single ion populations represents a significant step in increasing the selectivity of mass spectrometry.

Permutation coding technique for image recognition systems.

PubMed

Kussul, Ernst M; Baidyk, Tatiana N; Wunsch, Donald C; Makeyev, Oleksandr; Martín, Anabel

2006-11-01

A feature extractor and neural classifier for image recognition systems are proposed. The proposed feature extractor is based on the concept of random local descriptors (RLDs). It is followed by the encoder that is based on the permutation coding technique that allows to take into account not only detected features but also the position of each feature on the image and to make the recognition process invariant to small displacements. The combination of RLDs and permutation coding permits us to obtain a sufficiently general description of the image to be recognized. The code generated by the encoder is used as an input data for the neural classifier. Different types of images were used to test the proposed image recognition system. It was tested in the handwritten digit recognition problem, the face recognition problem, and the microobject shape recognition problem. The results of testing are very promising. The error rate for the Modified National Institute of Standards and Technology (MNIST) database is 0.44% and for the Olivetti Research Laboratory (ORL) database it is 0.1%.

Rank-based permutation approaches for non-parametric factorial designs.

PubMed

Umlauft, Maria; Konietschke, Frank; Pauly, Markus

2017-11-01

Inference methods for null hypotheses formulated in terms of distribution functions in general non-parametric factorial designs are studied. The methods can be applied to continuous, ordinal or even ordered categorical data in a unified way, and are based only on ranks. In this set-up Wald-type statistics and ANOVA-type statistics are the current state of the art. The first method is asymptotically exact but a rather liberal statistical testing procedure for small to moderate sample size, while the latter is only an approximation which does not possess the correct asymptotic α level under the null. To bridge these gaps, a novel permutation approach is proposed which can be seen as a flexible generalization of the Kruskal-Wallis test to all kinds of factorial designs with independent observations. It is proven that the permutation principle is asymptotically correct while keeping its finite exactness property when data are exchangeable. The results of extensive simulation studies foster these theoretical findings. A real data set exemplifies its applicability. © 2017 The British Psychological Society.

The role of riparian vegetation density, channel orientation and water velocity in determining river temperature dynamics

NASA Astrophysics Data System (ADS)

Garner, Grace; Malcolm, Iain A.; Sadler, Jonathan P.; Hannah, David M.

2017-10-01

A simulation experiment was used to understand the importance of riparian vegetation density, channel orientation and flow velocity for stream energy budgets and river temperature dynamics. Water temperature and meteorological observations were obtained in addition to hemispherical photographs along a ∼1 km reach of the Girnock Burn, a tributary of the Aberdeenshire Dee, Scotland. Data from nine hemispherical images (representing different uniform canopy density scenarios) were used to parameterise a deterministic net radiation model and simulate radiative fluxes. For each vegetation scenario, the effects of eight channel orientations were investigated by changing the position of north at 45° intervals in each hemispheric image. Simulated radiative fluxes and observed turbulent fluxes drove a high-resolution water temperature model of the reach. Simulations were performed under low and high water velocity scenarios. Both velocity scenarios yielded decreases in mean (≥1.6 °C) and maximum (≥3.0 °C) temperature as canopy density increased. Slow-flowing water resided longer within the reach, which enhanced heat accumulation and dissipation, and drove higher maximum and lower minimum temperatures. Intermediate levels of shade produced highly variable energy flux and water temperature dynamics depending on the channel orientation and thus the time of day when the channel was shaded. We demonstrate that in many reaches relatively sparse but strategically located vegetation could produce substantial reductions in maximum temperature and suggest that these criteria are used to inform future river management.

Structure-based Design of Cyclically Permuted HIV-1 gp120 Trimers That Elicit Neutralizing Antibodies*

PubMed Central

Kesavardhana, Sannula; Das, Raksha; Citron, Michael; Datta, Rohini; Ecto, Linda; Srilatha, Nonavinakere Seetharam; DiStefano, Daniel; Swoyer, Ryan; Joyce, Joseph G.; Dutta, Somnath; LaBranche, Celia C.; Montefiori, David C.; Flynn, Jessica A.; Varadarajan, Raghavan

2017-01-01

A major goal for HIV-1 vaccine development is an ability to elicit strong and durable broadly neutralizing antibody (bNAb) responses. The trimeric envelope glycoprotein (Env) spikes on HIV-1 are known to contain multiple epitopes that are susceptible to bNAbs isolated from infected individuals. Nonetheless, all trimeric and monomeric Env immunogens designed to date have failed to elicit such antibodies. We report the structure-guided design of HIV-1 cyclically permuted gp120 that forms homogeneous, stable trimers, and displays enhanced binding to multiple bNAbs, including VRC01, VRC03, VRC-PG04, PGT128, and the quaternary epitope-specific bNAbs PGT145 and PGDM1400. Constructs that were cyclically permuted in the V1 loop region and contained an N-terminal trimerization domain to stabilize V1V2-mediated quaternary interactions, showed the highest homogeneity and the best antigenic characteristics. In guinea pigs, a DNA prime-protein boost regimen with these new gp120 trimer immunogens elicited potent neutralizing antibody responses against highly sensitive Tier 1A isolates and weaker neutralizing antibody responses with an average titer of about 115 against a panel of heterologous Tier 2 isolates. A modest fraction of the Tier 2 virus neutralizing activity appeared to target the CD4 binding site on gp120. These results suggest that cyclically permuted HIV-1 gp120 trimers represent a viable platform in which further modifications may be made to eventually achieve protective bNAb responses. PMID:27879316

Two-level optimization of composite wing structures based on panel genetic optimization

NASA Astrophysics Data System (ADS)

Liu, Boyang

The design of complex composite structures used in aerospace or automotive vehicles presents a major challenge in terms of computational cost. Discrete choices for ply thicknesses and ply angles leads to a combinatorial optimization problem that is too expensive to solve with presently available computational resources. We developed the following methodology for handling this problem for wing structural design: we used a two-level optimization approach with response-surface approximations to optimize panel failure loads for the upper-level wing optimization. We tailored efficient permutation genetic algorithms to the panel stacking sequence design on the lower level. We also developed approach for improving continuity of ply stacking sequences among adjacent panels. The decomposition approach led to a lower-level optimization of stacking sequence with a given number of plies in each orientation. An efficient permutation genetic algorithm (GA) was developed for handling this problem. We demonstrated through examples that the permutation GAs are more efficient for stacking sequence optimization than a standard GA. Repair strategies for standard GA and the permutation GAs for dealing with constraints were also developed. The repair strategies can significantly reduce computation costs for both standard GA and permutation GA. A two-level optimization procedure for composite wing design subject to strength and buckling constraints is presented. At wing-level design, continuous optimization of ply thicknesses with orientations of 0°, 90°, and +/-45° is performed to minimize weight. At the panel level, the number of plies of each orientation (rounded to integers) and inplane loads are specified, and a permutation genetic algorithm is used to optimize the stacking sequence. The process begins with many panel genetic optimizations for a range of loads and numbers of plies of each orientation. Next, a cubic polynomial response surface is fitted to the optimum buckling load. The resulting response surface is used for wing-level optimization. In general, complex composite structures consist of several laminates. A common problem in the design of such structures is that some plies in the adjacent laminates terminate in the boundary between the laminates. These discontinuities may cause stress concentrations and may increase manufacturing difficulty and cost. We developed measures of continuity of two adjacent laminates. We studied tradeoffs between weight and continuity through a simple composite wing design. Finally, we compared the two-level optimization to a single-level optimization based on flexural lamination parameters. The single-level optimization is efficient and feasible for a wing consisting of unstiffened panels.

Comparison of in-situ and optical current-meter estimates of rip-current circulation

NASA Astrophysics Data System (ADS)

Moulton, M.; Chickadel, C. C.; Elgar, S.; Raubenheimer, B.

2016-12-01

Rip currents are fast, narrow, seaward flows that transport material from the shoreline to the shelf. Spatially and temporally complex rip current circulation patterns are difficult to resolve with in-situ instrument arrays. Here, high spatial-resolution estimates of rip current circulation from remotely sensed optical images of the sea surface are compared with in-situ estimates of currents in and near channels ( 1- to 2-m deep and 30-m wide) dredged across the surf zone. Alongshore flows are estimated using the optical current-meter method, and cross-shore flows are derived with the assumption of continuity. The observations span a range of wave conditions, tidal elevations, and flow patterns, including meandering alongshore currents near and in the channel, and 0.5 m/s alongshore flows converging at a 0.8 m/s rip jet in the channel. In addition, the remotely sensed velocities are used to investigate features of the spatially complex flow patterns not resolved by the spatially sparse in-situ sensors, including the spatial extent of feeder current zones and the width, alongshore position, and cross-shore extent of rip current jets. Funded by ASD(R&E) and NSF.

Continuous Estimates of Surface Density and Annual Snow Accumulation with Multi-Channel Snow/Firn Penetrating Radar in the Percolation Zone, Western Greenland Ice Sheet

NASA Astrophysics Data System (ADS)

Meehan, T.; Marshall, H. P.; Bradford, J.; Hawley, R. L.; Osterberg, E. C.; McCarthy, F.; Lewis, G.; Graeter, K.

2017-12-01

A priority of ice sheet surface mass balance (SMB) prediction is ascertaining the surface density and annual snow accumulation. These forcing data can be supplied into firn compaction models and used to tune Regional Climate Models (RCM). RCMs do not accurately capture subtle changes in the snow accumulation gradient. Additionally, leading RCMs disagree among each other and with accumulation studies in regions of the Greenland Ice Sheet (GrIS) over large distances and temporal scales. RCMs tend to yield inconsistencies over GrIS because of sparse and outdated validation data in the reanalysis pool. Greenland Traverse for Accumulation and Climate Studies (GreenTrACS) implemented multi-channel 500 MHz Radar in multi-offset configuration throughout two traverse campaigns totaling greater than 3500 km along the western percolation zone of GrIS. The multi-channel radar has the capability of continuously estimating snow depth, average density, and annual snow accumulation, expressed at 95% confidence (+-) 0.15 m, (+-) 17 kgm-3, (+-) 0.04 m w.e. respectively, by examination of the primary reflection return from the previous year's summer surface.

Color filter array design based on a human visual model

NASA Astrophysics Data System (ADS)

Parmar, Manu; Reeves, Stanley J.

2004-05-01

To reduce cost and complexity associated with registering multiple color sensors, most consumer digital color cameras employ a single sensor. A mosaic of color filters is overlaid on a sensor array such that only one color channel is sampled per pixel location. The missing color values must be reconstructed from available data before the image is displayed. The quality of the reconstructed image depends fundamentally on the array pattern and the reconstruction technique. We present a design method for color filter array patterns that use red, green, and blue color channels in an RGB array. A model of the human visual response for luminance and opponent chrominance channels is used to characterize the perceptual error between a fully sampled and a reconstructed sparsely-sampled image. Demosaicking is accomplished using Wiener reconstruction. To ensure that the error criterion reflects perceptual effects, reconstruction is done in a perceptually uniform color space. A sequential backward selection algorithm is used to optimize the error criterion to obtain the sampling arrangement. Two different types of array patterns are designed: non-periodic and periodic arrays. The resulting array patterns outperform commonly used color filter arrays in terms of the error criterion.

Digital Self-Interference Cancellation for Asynchronous In-Band Full-Duplex Underwater Acoustic Communication.

PubMed

Qiao, Gang; Gan, Shuwei; Liu, Songzuo; Ma, Lu; Sun, Zongxin

2018-05-24

To improve the throughput of underwater acoustic (UWA) networking, the In-band full-duplex (IBFD) communication is one of the most vital pieces of research. The major drawback of IBFD-UWA communication is Self-Interference (SI). This paper presents a digital SI cancellation algorithm for asynchronous IBFD-UWA communication system. We focus on two issues: one is asynchronous communication dissimilar to IBFD radio communication, the other is nonlinear distortion caused by power amplifier (PA). First, we discuss asynchronous IBFD-UWA signal model with the nonlinear distortion of PA. Then, we design a scheme for asynchronous IBFD-UWA communication utilizing the non-overlapping region between SI and intended signal to estimate the nonlinear SI channel. To cancel the nonlinear distortion caused by PA, we propose an Over-Parameterization based Recursive Least Squares (RLS) algorithm (OPRLS) to estimate the nonlinear SI channel. Furthermore, we present the OPRLS with a sparse constraint to estimate the SI channel, which reduces the requirement of the length of the non-overlapping region. Finally, we verify our concept through simulation and the pool experiment. Results demonstrate that the proposed digital SI cancellation scheme can cancel SI efficiently.

To Each According to its Degree: The Meritocracy and Topocracy of Embedded Markets

NASA Astrophysics Data System (ADS)

Borondo, J.; Borondo, F.; Rodriguez-Sickert, C.; Hidalgo, C. A.

2014-01-01

A system is said to be meritocratic if the compensation and power available to individuals is determined by their abilities and merits. A system is topocratic if the compensation and power available to an individual is determined primarily by her position in a network. Here we introduce a model that is perfectly meritocratic for fully connected networks but that becomes topocratic for sparse networks-like the ones in society. In the model, individuals produce and sell content, but also distribute the content produced by others when they belong to the shortest path connecting a buyer and a seller. The production and distribution of content defines two channels of compensation: a meritocratic channel, where individuals are compensated for the content they produce, and a topocratic channel, where individual compensation is based on the number of shortest paths that go through them in the network. We solve the model analytically and show that the distribution of payoffs is meritocratic only if the average degree of the nodes is larger than a root of the total number of nodes. We conclude that, in the light of this model, the sparsity and structure of networks represents a fundamental constraint to the meritocracy of societies.

To each according to its degree: the meritocracy and topocracy of embedded markets.

PubMed

Borondo, J; Borondo, F; Rodriguez-Sickert, C; Hidalgo, C A

2014-01-21

A system is said to be meritocratic if the compensation and power available to individuals is determined by their abilities and merits. A system is topocratic if the compensation and power available to an individual is determined primarily by her position in a network. Here we introduce a model that is perfectly meritocratic for fully connected networks but that becomes topocratic for sparse networks-like the ones in society. In the model, individuals produce and sell content, but also distribute the content produced by others when they belong to the shortest path connecting a buyer and a seller. The production and distribution of content defines two channels of compensation: a meritocratic channel, where individuals are compensated for the content they produce, and a topocratic channel, where individual compensation is based on the number of shortest paths that go through them in the network. We solve the model analytically and show that the distribution of payoffs is meritocratic only if the average degree of the nodes is larger than a root of the total number of nodes. We conclude that, in the light of this model, the sparsity and structure of networks represents a fundamental constraint to the meritocracy of societies.

Comparison of background EEG activity of different groups of patients with idiopathic epilepsy using Shannon spectral entropy and cluster-based permutation statistical testing

PubMed Central

Artieda, Julio; Iriarte, Jorge

2017-01-01

Idiopathic epilepsy is characterized by generalized seizures with no apparent cause. One of its main problems is the lack of biomarkers to monitor the evolution of patients. The only tools they can use are limited to inspecting the amount of seizures during previous periods of time and assessing the existence of interictal discharges. As a result, there is a need for improving the tools to assist the diagnosis and follow up of these patients. The goal of the present study is to compare and find a way to differentiate between two groups of patients suffering from idiopathic epilepsy, one group that could be followed-up by means of specific electroencephalographic (EEG) signatures (intercritical activity present), and another one that could not due to the absence of these markers. To do that, we analyzed the background EEG activity of each in the absence of seizures and epileptic intercritical activity. We used the Shannon spectral entropy (SSE) as a metric to discriminate between the two groups and performed permutation-based statistical tests to detect the set of frequencies that show significant differences. By constraining the spectral entropy estimation to the [6.25–12.89) Hz range, we detect statistical differences (at below 0.05 alpha-level) between both types of epileptic patients at all available recording channels. Interestingly, entropy values follow a trend that is inversely related to the elapsed time from the last seizure. Indeed, this trend shows asymptotical convergence to the SSE values measured in a group of healthy subjects, which present SSE values lower than any of the two groups of patients. All these results suggest that the SSE, measured in a specific range of frequencies, could serve to follow up the evolution of patients suffering from idiopathic epilepsy. Future studies remain to be conducted in order to assess the predictive value of this approach for the anticipation of seizures. PMID:28922360

Mechanical stretch triggers rapid epithelial cell division through Piezo1.

PubMed

Gudipaty, S A; Lindblom, J; Loftus, P D; Redd, M J; Edes, K; Davey, C F; Krishnegowda, V; Rosenblatt, J

2017-03-02

Despite acting as a barrier for the organs they encase, epithelial cells turn over at some of the fastest rates in the body. However, epithelial cell division must be tightly linked to cell death to preserve barrier function and prevent tumour formation. How does the number of dying cells match those dividing to maintain constant numbers? When epithelial cells become too crowded, they activate the stretch-activated channel Piezo1 to trigger extrusion of cells that later die. However, it is unclear how epithelial cell division is controlled to balance cell death at the steady state. Here we show that mammalian epithelial cell division occurs in regions of low cell density where cells are stretched. By experimentally stretching epithelia, we find that mechanical stretch itself rapidly stimulates cell division through activation of the Piezo1 channel. To stimulate cell division, stretch triggers cells that are paused in early G2 phase to activate calcium-dependent phosphorylation of ERK1/2, thereby activating the cyclin B transcription that is necessary to drive cells into mitosis. Although both epithelial cell division and cell extrusion require Piezo1 at the steady state, the type of mechanical force controls the outcome: stretch induces cell division, whereas crowding induces extrusion. How Piezo1-dependent calcium transients activate two opposing processes may depend on where and how Piezo1 is activated, as it accumulates in different subcellular sites with increasing cell density. In sparse epithelial regions in which cells divide, Piezo1 localizes to the plasma membrane and cytoplasm, whereas in dense regions in which cells extrude, it forms large cytoplasmic aggregates. Because Piezo1 senses both mechanical crowding and stretch, it may act as a homeostatic sensor to control epithelial cell numbers, triggering extrusion and apoptosis in crowded regions and cell division in sparse regions.

Graph Theory Meets Ab Initio Molecular Dynamics: Atomic Structures and Transformations at the Nanoscale

NASA Astrophysics Data System (ADS)

Pietrucci, Fabio; Andreoni, Wanda

2011-08-01

Social permutation invariant coordinates are introduced describing the bond network around a given atom. They originate from the largest eigenvalue and the corresponding eigenvector of the contact matrix, are invariant under permutation of identical atoms, and bear a clear signature of an order-disorder transition. Once combined with ab initio metadynamics, these coordinates are shown to be a powerful tool for the discovery of low-energy isomers of molecules and nanoclusters as well as for a blind exploration of isomerization, association, and dissociation reactions.

Finding fixed satellite service orbital allotments with a k-permutation algorithm

NASA Technical Reports Server (NTRS)

Reilly, Charles H.; Mount-Campbell, Clark A.; Gonsalvez, David J. A.

1990-01-01

A satellite system synthesis problem, the satellite location problem (SLP), is addressed. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the fixed satellite service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: the problem of ordering the satellites and the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, has been developed to find solutions to SLPs. Solutions to small sample problems are presented and analyzed on the basis of calculated interferences.

Permutation approach, high frequency trading and variety of micro patterns in financial time series

NASA Astrophysics Data System (ADS)

Aghamohammadi, Cina; Ebrahimian, Mehran; Tahmooresi, Hamed

2014-11-01

Permutation approach is suggested as a method to investigate financial time series in micro scales. The method is used to see how high frequency trading in recent years has affected the micro patterns which may be seen in financial time series. Tick to tick exchange rates are considered as examples. It is seen that variety of patterns evolve through time; and that the scale over which the target markets have no dominant patterns, have decreased steadily over time with the emergence of higher frequency trading.

Magic informationally complete POVMs with permutations

NASA Astrophysics Data System (ADS)

Planat, Michel; Gedik, Zafer

2017-09-01

Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation (Planat, Rukhsan-Ul-Haq 2017 Adv. Math. Phys. 2017, 5287862 (doi:10.1155/2017/5287862)). We show in this paper that a subset of such magic states, when acting on the generalized Pauli group, define (asymmetric) informationally complete POVMs. Such informationally complete POVMs, investigated in dimensions 2-12, exhibit simple finite geometries in their projector products and, for dimensions 4 and 8 and 9, relate to two-qubit, three-qubit and two-qutrit contextuality.

Anatomy of a Flash Flood in the Amargosa Desert, U.S.A.

NASA Astrophysics Data System (ADS)

Stonestrom, D. A.; Prudic, D. E.; Glancy, P. A.; Beck, D. A.

2004-12-01

In August 2004, intense convective rainstorms caused flash flooding throughout the Amargosa River drainage network, temporarily closing Death Valley National Park and causing two fatalities when runoff from Furnace Creek and other channels overtopped roadways in the Park. In 1998, we began installing streambed temperature loggers, pressure transducers, and scour chains in the normally dry channel and selected tributaries of the river in the Amargosa Desert and Oasis Valley. The primary objective of this work is to improve understanding of ground-water recharge from ephemeral streamflows under current climatic conditions. Two weeks after the flash flooding, we visited instrumented sites and estimated peak flows by surveying high-water marks and corresponding channel geometries. Time series of temperatures and stages, together with peak-flow estimates, reveal the routing and evolution of distinct flood pulses in the upper Amargosa River basin. The data also reveal previously undocumented details of individual flash-flood hydrographs, including initial and subsequent flood pulses at two sites. Arid environments are prone to flash flooding not only because vegetation is sparse, but also because the surface-water network is decoupled from underlying ground water by a thick unsaturated zone. Nonlinear interactions between runoff (with energy potentials on the order of a meter of head) and the unsaturated zone (with energy potentials on the order of negative hundreds of meters of head) keep advancing fronts of flood pulses sharp. Profiles of water content beneath the main channel before and after the passage of a flood pulse, together with down-channel attenuation of flow volume within individual pulses, show the leaky nature of dry alluvial channels and the efficiency at which flash floods become potential recharge.

Investigating the Performance of One- and Two-dimensional Flood Models in a Channelized River Network: A Case Study of the Obion River System

NASA Astrophysics Data System (ADS)

Kalyanapu, A. J.; Dullo, T. T.; Thornton, J. C.; Auld, L. A.

2015-12-01

Obion River, is located in the northwestern Tennessee region, and discharges into the Mississippi River. In the past, the river system was largely channelized for agricultural purposes that resulted in increased erosion, loss of wildlife habitat and downstream flood risks. These impacts are now being slowly reversed mainly due to wetland restoration. The river system is characterized by a large network of "loops" around the main channels that hold water either from excess flows or due to flow diversions. Without data on each individual channel, levee, canal, or pond it is not known where the water flows from or to. In some segments along the river, the natural channel has been altered and rerouted by the farmers for their irrigation purposes. Satellite imagery can aid in identifying these features, but its spatial coverage is temporally sparse. All the alterations that have been done to the watershed make it difficult to develop hydraulic models, which could predict flooding and droughts. This is especially true when building one-dimensional (1D) hydraulic models compared to two-dimensional (2D) models, as the former cannot adequately simulate lateral flows in the floodplain and in complex terrains. The objective of this study therefore is to study the performance of 1D and 2D flood models in this complex river system, evaluate the limitations of 1D models and highlight the advantages of 2D models. The study presents the application of HEC-RAS and HEC-2D models developed by the Hydrologic Engineering Center (HEC), a division of the US Army Corps of Engineers. The broader impacts of this study is the development of best practices for developing flood models in channelized river systems and in agricultural watersheds.

Conceptual model of sediment processes in the upper Yuba River watershed, Sierra Nevada, CA

USGS Publications Warehouse

Curtis, J.A.; Flint, L.E.; Alpers, Charles N.; Yarnell, S.M.

2005-01-01

This study examines the development of a conceptual model of sediment processes in the upper Yuba River watershed; and we hypothesize how components of the conceptual model may be spatially distributed using a geographical information system (GIS). The conceptual model illustrates key processes controlling sediment dynamics in the upper Yuba River watershed and was tested and revised using field measurements, aerial photography, and low elevation videography. Field reconnaissance included mass wasting and channel storage inventories, assessment of annual channel change in upland tributaries, and evaluation of the relative importance of sediment sources and transport processes. Hillslope erosion rates throughout the study area are relatively low when compared to more rapidly eroding landscapes such as the Pacific Northwest and notable hillslope sediment sources include highly erodible andesitic mudflows, serpentinized ultramafics, and unvegetated hydraulic mine pits. Mass wasting dominates surface erosion on the hillslopes; however, erosion of stored channel sediment is the primary contributor to annual sediment yield. We used GIS to spatially distribute the components of the conceptual model and created hillslope erosion potential and channel storage models. The GIS models exemplify the conceptual model in that landscapes with low potential evapotranspiration, sparse vegetation, steep slopes, erodible geology and soils, and high road densities display the greatest hillslope erosion potential and channel storage increases with increasing stream order. In-channel storage in upland tributaries impacted by hydraulic mining is an exception. Reworking of stored hydraulic mining sediment in low-order tributaries continues to elevate upper Yuba River sediment yields. Finally, we propose that spatially distributing the components of a conceptual model in a GIS framework provides a guide for developing more detailed sediment budgets or numerical models making it an inexpensive way to develop a roadmap for understanding sediment dynamics at a watershed scale.

Far-ultraviolet refractive index of optical materials for solar blind channel (SBC) filters for the HST advanced camera for surveys (ACS)

NASA Astrophysics Data System (ADS)

Leviton, Douglas B.; Madison, Timothy J.; Petrone, Peter

1998-10-01

Refractive index measurements using the minimum deviation method have been carried out for prisms of a variety of far ultraviolet optical materials used in the manufacture of Solar Blind Channel (SBC) filters for the HST Advanced Camera for Surveys (ACS). Some of the materials measured are gaining popularity in a variety of high technology applications including high power excimer lasers and advanced microlithography optics operating in a wavelength region where high quality knowledge of optical material properties is sparse yet critical. Our measurements are of unusually high accuracy and precision for this wavelength region owing to advanced instrumentation in the large vacuum chamber of the Diffraction Grating Evaluation Facility (DGEF) at Goddard Space Flight Center (GSFC) used to implement a minimum deviation method refractometer. Index values for CaF2, BaF2, LiF, and far ultraviolet grades of synthetic sapphire and synthetic fused silica are reported and compared with values from the literature.

Nonlinear effects in the time measurement device based on surface acoustic wave filter excitation.

PubMed

Prochazka, Ivan; Panek, Petr

2009-07-01

A transversal surface acoustic wave filter has been used as a time interpolator in a time interval measurement device. We are presenting the experiments and results of an analysis of the nonlinear effects in such a time interpolator. The analysis shows that the nonlinear distortion in the time interpolator circuits causes a deterministic measurement error which can be understood as the time interpolation nonlinearity. The dependence of this error on time of the measured events can be expressed as a sparse Fourier series thus it usually oscillates very quickly in comparison to the clock period. The theoretical model is in good agreement with experiments carried out on an experimental two-channel timing system. Using highly linear amplifiers in the time interpolator and adjusting the filter excitation level to the optimum, we have achieved the interpolation nonlinearity below 0.2 ps. The overall single-shot precision of the experimental timing device is 0.9 ps rms in each channel.

Dense Array Optimization of Cross-Flow Turbines

NASA Astrophysics Data System (ADS)

Scherl, Isabel; Strom, Benjamin; Brunton, Steven; Polagye, Brian

2017-11-01

Cross-flow turbines, where the axis of rotation is perpendicular to the freestream flow, can be used to convert the kinetic energy in wind or water currents to electrical power. By taking advantage of mean and time-resolved wake structures, the optimal density of an array of cross-flow turbines has the potential for higher power output per unit area of land or sea-floor than an equivalent array of axial-flow turbines. In addition, dense arrays in tidal or river channels may be able to further elevate efficiency by exploiting flow confinement and surface proximity. In this work, a two-turbine array is optimized experimentally in a recirculating water channel. The spacing between turbines, as well as individual and coordinated turbine control strategies are optimized. Array efficiency is found to exceed the maximum efficiency for a sparse array (i.e., no interaction between turbines) for stream-wise rotor spacing of less than two diameters. Results are discussed in the context of wake measurements made behind a single rotor.

Recovery of a spectrum based on a compressive-sensing algorithm with weighted principal component analysis

NASA Astrophysics Data System (ADS)

Dafu, Shen; Leihong, Zhang; Dong, Liang; Bei, Li; Yi, Kang

2017-07-01

The purpose of this study is to improve the reconstruction precision and better copy the color of spectral image surfaces. A new spectral reflectance reconstruction algorithm based on an iterative threshold combined with weighted principal component space is presented in this paper, and the principal component with weighted visual features is the sparse basis. Different numbers of color cards are selected as the training samples, a multispectral image is the testing sample, and the color differences in the reconstructions are compared. The channel response value is obtained by a Mega Vision high-accuracy, multi-channel imaging system. The results show that spectral reconstruction based on weighted principal component space is superior in performance to that based on traditional principal component space. Therefore, the color difference obtained using the compressive-sensing algorithm with weighted principal component analysis is less than that obtained using the algorithm with traditional principal component analysis, and better reconstructed color consistency with human eye vision is achieved.

Permutation-invariant distance between atomic configurations

NASA Astrophysics Data System (ADS)

Ferré, Grégoire; Maillet, Jean-Bernard; Stoltz, Gabriel

2015-09-01

We present a permutation-invariant distance between atomic configurations, defined through a functional representation of atomic positions. This distance enables us to directly compare different atomic environments with an arbitrary number of particles, without going through a space of reduced dimensionality (i.e., fingerprints) as an intermediate step. Moreover, this distance is naturally invariant through permutations of atoms, avoiding the time consuming associated minimization required by other common criteria (like the root mean square distance). Finally, the invariance through global rotations is accounted for by a minimization procedure in the space of rotations solved by Monte Carlo simulated annealing. A formal framework is also introduced, showing that the distance we propose verifies the property of a metric on the space of atomic configurations. Two examples of applications are proposed. The first one consists in evaluating faithfulness of some fingerprints (or descriptors), i.e., their capacity to represent the structural information of a configuration. The second application concerns structural analysis, where our distance proves to be efficient in discriminating different local structures and even classifying their degree of similarity.

Hurdles and sorting by inversions: combinatorial, statistical, and experimental results.

PubMed

Swenson, Krister M; Lin, Yu; Rajan, Vaibhav; Moret, Bernard M E

2009-10-01

As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also called reversals), was characterized by Hannenhalli and Pevzner and this characterization in turn extended by various authors. The characterization relies on the concepts of breakpoints, cycles, and obstructions colorfully named hurdles and fortresses. In this paper, we study the probability of generating a hurdle in the process of sorting a permutation if one does not take special precautions to avoid them (as in a randomized algorithm, for instance). To do this we revisit and extend the work of Caprara and of Bergeron by providing simple and exact characterizations of the probability of encountering a hurdle in a random permutation. Using similar methods we provide the first asymptotically tight analysis of the probability that a fortress exists in a random permutation. Finally, we study other aspects of hurdles, both analytically and through experiments: when are they created in a sequence of sorting inversions, how much later are they detected, and how much work may need to be undone to return to a sorting sequence.

SCOPES: steganography with compression using permutation search

NASA Astrophysics Data System (ADS)

Boorboor, Sahar; Zolfaghari, Behrouz; Mozafari, Saadat Pour

2011-10-01

LSB (Least Significant Bit) is a widely used method for image steganography, which hides the secret message as a bit stream in LSBs of pixel bytes in the cover image. This paper proposes a variant of LSB named SCOPES that encodes and compresses the secret message while being hidden through storing addresses instead of message bytes. Reducing the length of the stored message improves the storage capacity and makes the stego image visually less suspicious to the third party. The main idea behind the SCOPES approach is dividing the message into 3-character segments, seeking each segment in the cover image and storing the address of the position containing the segment instead of the segment itself. In this approach, every permutation of the 3 bytes (if found) can be stored along with some extra bits indicating the permutation. In some rare cases the segment may not be found in the image and this can cause the message to be expanded by some overhead bits2 instead of being compressed. But experimental results show that SCOPES performs overlay better than traditional LSB even in the worst cases.

Generalized composite multiscale permutation entropy and Laplacian score based rolling bearing fault diagnosis

NASA Astrophysics Data System (ADS)

Zheng, Jinde; Pan, Haiyang; Yang, Shubao; Cheng, Junsheng

2018-01-01

Multiscale permutation entropy (MPE) is a recently proposed nonlinear dynamic method for measuring the randomness and detecting the nonlinear dynamic change of time series and can be used effectively to extract the nonlinear dynamic fault feature from vibration signals of rolling bearing. To solve the drawback of coarse graining process in MPE, an improved MPE method called generalized composite multiscale permutation entropy (GCMPE) was proposed in this paper. Also the influence of parameters on GCMPE and its comparison with the MPE are studied by analyzing simulation data. GCMPE was applied to the fault feature extraction from vibration signal of rolling bearing and then based on the GCMPE, Laplacian score for feature selection and the Particle swarm optimization based support vector machine, a new fault diagnosis method for rolling bearing was put forward in this paper. Finally, the proposed method was applied to analyze the experimental data of rolling bearing. The analysis results show that the proposed method can effectively realize the fault diagnosis of rolling bearing and has a higher fault recognition rate than the existing methods.

An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Xu, Ye; Wang, Ling; Wang, Shengyao; Liu, Min

2014-09-01

In this article, an effective hybrid immune algorithm (HIA) is presented to solve the distributed permutation flow-shop scheduling problem (DPFSP). First, a decoding method is proposed to transfer a job permutation sequence to a feasible schedule considering both factory dispatching and job sequencing. Secondly, a local search with four search operators is presented based on the characteristics of the problem. Thirdly, a special crossover operator is designed for the DPFSP, and mutation and vaccination operators are also applied within the framework of the HIA to perform an immune search. The influence of parameter setting on the HIA is investigated based on the Taguchi method of design of experiment. Extensive numerical testing results based on 420 small-sized instances and 720 large-sized instances are provided. The effectiveness of the HIA is demonstrated by comparison with some existing heuristic algorithms and the variable neighbourhood descent methods. New best known solutions are obtained by the HIA for 17 out of 420 small-sized instances and 585 out of 720 large-sized instances.

Cluster mass inference via random field theory.

PubMed

Zhang, Hui; Nichols, Thomas E; Johnson, Timothy D

2009-01-01

Cluster extent and voxel intensity are two widely used statistics in neuroimaging inference. Cluster extent is sensitive to spatially extended signals while voxel intensity is better for intense but focal signals. In order to leverage strength from both statistics, several nonparametric permutation methods have been proposed to combine the two methods. Simulation studies have shown that of the different cluster permutation methods, the cluster mass statistic is generally the best. However, to date, there is no parametric cluster mass inference available. In this paper, we propose a cluster mass inference method based on random field theory (RFT). We develop this method for Gaussian images, evaluate it on Gaussian and Gaussianized t-statistic images and investigate its statistical properties via simulation studies and real data. Simulation results show that the method is valid under the null hypothesis and demonstrate that it can be more powerful than the cluster extent inference method. Further, analyses with a single subject and a group fMRI dataset demonstrate better power than traditional cluster size inference, and good accuracy relative to a gold-standard permutation test.

Sparsity-aware multiple relay selection in large multi-hop decode-and-forward relay networks

NASA Astrophysics Data System (ADS)

Gouissem, A.; Hamila, R.; Al-Dhahir, N.; Foufou, S.

2016-12-01

In this paper, we propose and investigate two novel techniques to perform multiple relay selection in large multi-hop decode-and-forward relay networks. The two proposed techniques exploit sparse signal recovery theory to select multiple relays using the orthogonal matching pursuit algorithm and outperform state-of-the-art techniques in terms of outage probability and computation complexity. To reduce the amount of collected channel state information (CSI), we propose a limited-feedback scheme where only a limited number of relays feedback their CSI. Furthermore, a detailed performance-complexity tradeoff investigation is conducted for the different studied techniques and verified by Monte Carlo simulations.

OPTIMA: sensitive and accurate whole-genome alignment of error-prone genomic maps by combinatorial indexing and technology-agnostic statistical analysis.

PubMed

Verzotto, Davide; M Teo, Audrey S; Hillmer, Axel M; Nagarajan, Niranjan

2016-01-01

Resolution of complex repeat structures and rearrangements in the assembly and analysis of large eukaryotic genomes is often aided by a combination of high-throughput sequencing and genome-mapping technologies (for example, optical restriction mapping). In particular, mapping technologies can generate sparse maps of large DNA fragments (150 kilo base pairs (kbp) to 2 Mbp) and thus provide a unique source of information for disambiguating complex rearrangements in cancer genomes. Despite their utility, combining high-throughput sequencing and mapping technologies has been challenging because of the lack of efficient and sensitive map-alignment algorithms for robustly aligning error-prone maps to sequences. We introduce a novel seed-and-extend glocal (short for global-local) alignment method, OPTIMA (and a sliding-window extension for overlap alignment, OPTIMA-Overlap), which is the first to create indexes for continuous-valued mapping data while accounting for mapping errors. We also present a novel statistical model, agnostic with respect to technology-dependent error rates, for conservatively evaluating the significance of alignments without relying on expensive permutation-based tests. We show that OPTIMA and OPTIMA-Overlap outperform other state-of-the-art approaches (1.6-2 times more sensitive) and are more efficient (170-200 %) and precise in their alignments (nearly 99 % precision). These advantages are independent of the quality of the data, suggesting that our indexing approach and statistical evaluation are robust, provide improved sensitivity and guarantee high precision.

High-dimensional fitting of sparse datasets of CCSD(T) electronic energies and MP2 dipole moments, illustrated for the formic acid dimer and its complex IR spectrum

NASA Astrophysics Data System (ADS)

Qu, Chen; Bowman, Joel M.

2018-06-01

We present high-level, coupled-mode calculations of the infrared spectrum of the cyclic formic acid dimer. The calculations make use of full-dimensional, ab initio potential energy and dipole moment surfaces. The potential is a linear least-squares fit to 13 475 CCSD(T)-F12a/haTZ (haTZ means aug-cc-pVTZ basis set for O and C, and cc-pVTZ for H) energies, and the dipole moment surface is a fit to the dipole components, calculated at the MP2/haTZ level of theory. The variables of both fits are all (45) internuclear distances (actually Morse variables). The potential, which is fully permutationally invariant, is the one published recently and the dipole moment surface is newly reported here. Details of the fits, especially the dipole moment, and the database of configurations are given. The infrared spectrum of the dimer is calculated by solving the nuclear Schrödinger equation using a vibrational self-consistent field and virtual-state configuration interaction method, with subsets of the 24 normal modes, up to 15 modes. The calculations indicate strong mode-coupling in the C—H and O—H stretching region of the spectrum. Comparisons are made with experiments and the complexity of the experimental spectrum in the C—H and O—H stretching region is successfully reproduced.

A Hybrid Algorithm for Period Analysis from Multiband Data with Sparse and Irregular Sampling for Arbitrary Light-curve Shapes

NASA Astrophysics Data System (ADS)

Saha, Abhijit; Vivas, A. Katherina

2017-12-01

Ongoing and future surveys with repeat imaging in multiple bands are producing (or will produce) time-spaced measurements of brightness, resulting in the identification of large numbers of variable sources in the sky. A large fraction of these are periodic variables: compilations of these are of scientific interest for a variety of purposes. Unavoidably, the data sets from many such surveys not only have sparse sampling, but also have embedded frequencies in the observing cadence that beat against the natural periodicities of any object under investigation. Such limitations can make period determination ambiguous and uncertain. For multiband data sets with asynchronous measurements in multiple passbands, we wish to maximally use the information on periodicity in a manner that is agnostic of differences in the light-curve shapes across the different channels. Given large volumes of data, computational efficiency is also at a premium. This paper develops and presents a computationally economic method for determining periodicity that combines the results from two different classes of period-determination algorithms. The underlying principles are illustrated through examples. The effectiveness of this approach for combining asynchronously sampled measurements in multiple observables that share an underlying fundamental frequency is also demonstrated.

Wireless Sensor Array Network DoA Estimation from Compressed Array Data via Joint Sparse Representation.

PubMed

Yu, Kai; Yin, Ming; Luo, Ji-An; Wang, Yingguan; Bao, Ming; Hu, Yu-Hen; Wang, Zhi

2016-05-23

A compressive sensing joint sparse representation direction of arrival estimation (CSJSR-DoA) approach is proposed for wireless sensor array networks (WSAN). By exploiting the joint spatial and spectral correlations of acoustic sensor array data, the CSJSR-DoA approach provides reliable DoA estimation using randomly-sampled acoustic sensor data. Since random sampling is performed at remote sensor arrays, less data need to be transmitted over lossy wireless channels to the fusion center (FC), and the expensive source coding operation at sensor nodes can be avoided. To investigate the spatial sparsity, an upper bound of the coherence of incoming sensor signals is derived assuming a linear sensor array configuration. This bound provides a theoretical constraint on the angular separation of acoustic sources to ensure the spatial sparsity of the received acoustic sensor array signals. The Cram e ´ r-Rao bound of the CSJSR-DoA estimator that quantifies the theoretical DoA estimation performance is also derived. The potential performance of the CSJSR-DoA approach is validated using both simulations and field experiments on a prototype WSAN platform. Compared to existing compressive sensing-based DoA estimation methods, the CSJSR-DoA approach shows significant performance improvement.

Interpreting quantum coherence through a quantum measurement process

NASA Astrophysics Data System (ADS)

Yao, Yao; Dong, G. H.; Xiao, Xing; Li, Mo; Sun, C. P.

2017-11-01

Recently, there has been a renewed interest in the quantification of coherence or other coherencelike concepts within the framework of quantum resource theory. However, rigorously defined or not, the notion of coherence or decoherence has already been used by the community for decades since the advent of quantum theory. Intuitively, the definitions of coherence and decoherence should be two sides of the same coin. Therefore, a natural question is raised: How can the conventional decoherence processes, such as the von Neumann-Lüders (projective) measurement postulation or partially dephasing channels, fit into the bigger picture of the recently established theoretical framework? Here we show that the state collapse rules of the von Neumann or Lüders-type measurements, as special cases of genuinely incoherent operations (GIOs), are consistent with the resource theories of quantum coherence. New hierarchical measures of coherence are proposed for the Lüders-type measurement and their relationship with measurement-dependent discord is addressed. Moreover, utilizing the fixed-point theory for C* algebra, we prove that GIOs indeed represent a particular type of partially dephasing (phase-damping) channels which have a matrix representation based on the Schur product. By virtue of the Stinespring dilation theorem, the physical realizations of incoherent operations are investigated in detail and we find that GIOs in fact constitute the core of strictly incoherent operations and generally incoherent operations and the unspeakable notion of coherence induced by GIOs can be transferred to the theories of speakable coherence by the corresponding permutation or relabeling operators.

A k-permutation algorithm for Fixed Satellite Service orbital allotments

NASA Technical Reports Server (NTRS)

Reilly, Charles H.; Mount-Campbell, Clark A.; Gonsalvez, David J. A.

1988-01-01

A satellite system synthesis problem, the satellite location problem (SLP), is addressed in this paper. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the Fixed Satellite Service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: (1) the problem of ordering the satellites and (2) the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, that has been developed to find solutions to SLPs formulated in the manner suggested is described. Solutions to small example problems are presented and analyzed.

Convergence to equilibrium under a random Hamiltonian.

PubMed

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

2012-09-01

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

Convergence to equilibrium under a random Hamiltonian

NASA Astrophysics Data System (ADS)

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

2012-09-01

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

A new Nawaz-Enscore-Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time

NASA Astrophysics Data System (ADS)

Liu, Weibo; Jin, Yan; Price, Mark

2016-10-01

A new heuristic based on the Nawaz-Enscore-Ham algorithm is proposed in this article for solving a permutation flow-shop scheduling problem. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion with the objective of minimizing both makespan and machine idle time. Statistical tests illustrate better solution quality of the proposed algorithm compared to existing benchmark heuristics.

Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems

NASA Astrophysics Data System (ADS)

Cruz-Chávez, Marco Antonio

2015-11-01

This paper presents a neighbourhood generation mechanism for the job shop scheduling problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack time between the adjacent pair of operations that is permuted, then it is proven, through theory and experimentation, that the new neighbour (schedule) generated is feasible. It is demonstrated that the neighbourhood generation mechanism is very efficient and effective in a simulated annealing.

Comparing vector-based and Bayesian memory models using large-scale datasets: User-generated hashtag and tag prediction on Twitter and Stack Overflow.

PubMed

Stanley, Clayton; Byrne, Michael D

2016-12-01

The growth of social media and user-created content on online sites provides unique opportunities to study models of human declarative memory. By framing the task of choosing a hashtag for a tweet and tagging a post on Stack Overflow as a declarative memory retrieval problem, 2 cognitively plausible declarative memory models were applied to millions of posts and tweets and evaluated on how accurately they predict a user's chosen tags. An ACT-R based Bayesian model and a random permutation vector-based model were tested on the large data sets. The results show that past user behavior of tag use is a strong predictor of future behavior. Furthermore, past behavior was successfully incorporated into the random permutation model that previously used only context. Also, ACT-R's attentional weight term was linked to an entropy-weighting natural language processing method used to attenuate high-frequency words (e.g., articles and prepositions). Word order was not found to be a strong predictor of tag use, and the random permutation model performed comparably to the Bayesian model without including word order. This shows that the strength of the random permutation model is not in the ability to represent word order, but rather in the way in which context information is successfully compressed. The results of the large-scale exploration show how the architecture of the 2 memory models can be modified to significantly improve accuracy, and may suggest task-independent general modifications that can help improve model fit to human data in a much wider range of domains. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

Hemodynamic Response to Interictal Epileptiform Discharges Addressed by Personalized EEG-fNIRS Recordings

PubMed Central

Pellegrino, Giovanni; Machado, Alexis; von Ellenrieder, Nicolas; Watanabe, Satsuki; Hall, Jeffery A.; Lina, Jean-Marc; Kobayashi, Eliane; Grova, Christophe

2016-01-01

Objective: We aimed at studying the hemodynamic response (HR) to Interictal Epileptic Discharges (IEDs) using patient-specific and prolonged simultaneous ElectroEncephaloGraphy (EEG) and functional Near InfraRed Spectroscopy (fNIRS) recordings. Methods: The epileptic generator was localized using Magnetoencephalography source imaging. fNIRS montage was tailored for each patient, using an algorithm to optimize the sensitivity to the epileptic generator. Optodes were glued using collodion to achieve prolonged acquisition with high quality signal. fNIRS data analysis was handled with no a priori constraint on HR time course, averaging fNIRS signals to similar IEDs. Cluster-permutation analysis was performed on 3D reconstructed fNIRS data to identify significant spatio-temporal HR clusters. Standard (GLM with fixed HRF) and cluster-permutation EEG-fMRI analyses were performed for comparison purposes. Results: fNIRS detected HR to IEDs for 8/9 patients. It mainly consisted oxy-hemoglobin increases (seven patients), followed by oxy-hemoglobin decreases (six patients). HR was lateralized in six patients and lasted from 8.5 to 30 s. Standard EEG-fMRI analysis detected an HR in 4/9 patients (4/9 without enough IEDs, 1/9 unreliable result). The cluster-permutation EEG-fMRI analysis restricted to the region investigated by fNIRS showed additional strong and non-canonical BOLD responses starting earlier than the IEDs and lasting up to 30 s. Conclusions: (i) EEG-fNIRS is suitable to detect the HR to IEDs and can outperform EEG-fMRI because of prolonged recordings and greater chance to detect IEDs; (ii) cluster-permutation analysis unveils additional HR features underestimated when imposing a canonical HR function (iii) the HR is often bilateral and lasts up to 30 s. PMID:27047325

Quantile-based permutation thresholds for quantitative trait loci hotspots.

PubMed

Neto, Elias Chaibub; Keller, Mark P; Broman, Andrew F; Attie, Alan D; Jansen, Ritsert C; Broman, Karl W; Yandell, Brian S

2012-08-01

Quantitative trait loci (QTL) hotspots (genomic locations affecting many traits) are a common feature in genetical genomics studies and are biologically interesting since they may harbor critical regulators. Therefore, statistical procedures to assess the significance of hotspots are of key importance. One approach, randomly allocating observed QTL across the genomic locations separately by trait, implicitly assumes all traits are uncorrelated. Recently, an empirical test for QTL hotspots was proposed on the basis of the number of traits that exceed a predetermined LOD value, such as the standard permutation LOD threshold. The permutation null distribution of the maximum number of traits across all genomic locations preserves the correlation structure among the phenotypes, avoiding the detection of spurious hotspots due to nongenetic correlation induced by uncontrolled environmental factors and unmeasured variables. However, by considering only the number of traits above a threshold, without accounting for the magnitude of the LOD scores, relevant information is lost. In particular, biologically interesting hotspots composed of a moderate to small number of traits with strong LOD scores may be neglected as nonsignificant. In this article we propose a quantile-based permutation approach that simultaneously accounts for the number and the LOD scores of traits within the hotspots. By considering a sliding scale of mapping thresholds, our method can assess the statistical significance of both small and large hotspots. Although the proposed approach can be applied to any type of heritable high-volume "omic" data set, we restrict our attention to expression (e)QTL analysis. We assess and compare the performances of these three methods in simulations and we illustrate how our approach can effectively assess the significance of moderate and small hotspots with strong LOD scores in a yeast expression data set.

Vegetative impacts upon bedload transport capacity and channel stability for differing alluvial planforms in the Yellow River source zone

NASA Astrophysics Data System (ADS)

Li, Zhi Wei; Yu, Guo An; Brierley, Gary; Wang, Zhao Yin

2016-07-01

The influence of vegetation upon bedload transport and channel morphodynamics is examined along a channel stability gradient ranging from meandering to anabranching to anabranching-braided to fully braided planform conditions along trunk and tributary reaches of the Upper Yellow River in western China. Although the regional geology and climate are relatively consistent across the study area, there is a distinct gradient in the presence and abundance of riparian vegetation for these reaches atop the Qinghai-Tibet Plateau (elevations in the study area range from 2800 to 3400 m a.s.l.). To date, the influence of vegetative impacts upon channel planform and bedload transport capacity of alluvial reaches of the Upper Yellow River remains unclear because of a lack of hydrological and field data. In this region, the types and pattern of riparian vegetation vary with planform type as follows: trees exert the strongest influence in the anabranching reach, the meandering reach flows through meadow vegetation, the anabranching-braided reach has a grass, herb, and sparse shrub cover, and the braided reach has no riparian vegetation. A non-linear relation between vegetative cover on the valley floor and bedload transport capacity is evident, wherein bedload transport capacity is the highest for the anabranching reach, roughly followed by the anabranching-braided, braided, and meandering reaches. The relationship between the bedload transport capacity of a reach and sediment supply from upstream exerts a significant influence upon channel stability. Bedload transport capacity during the flood season (June-September) in the braided reach is much less than the rate of sediment supply, inducing bed aggradation and dynamic channel adjustments. Rates of channel adjustment are less pronounced for the anabranching-braided and anabranching reaches, while the meandering reach is relatively stable (i.e., this is a passive meandering reach).

A field guide for the assessment of erosion, sediment transport, and deposition in incised channels of the southwestern United States

USGS Publications Warehouse

Parker, John T.C.

2000-01-01

Deeply incised channels, commonly called arroyos, are a typical feature of the dry alluvium-filled valleys of the southwestern United States. Unlike many geological processes that operate over millions of years, the formation of many miles of arroyos is one that took place in a little more than a century. Most arroyos in the region began to form in the late 19th century. Because dry landscapes change so quickly, they present society with special problems. Rapid expansion of channels by headcut migration, deepening, and widening causes loss of productive agricultural and commercial lands and threatens infrastructure such as roads, bridges, and buildings. High rates of sedimentation shorten the life of reservoirs, clog culverts, and fill stream channels to the extent that they can no longer contain streamflow within their banks. This report presents an explanation of erosional and depositional processes in desert landscapes, especially those characterized by incised channels, for the use of those who use, manage, and live on such lands. The basic principles of erosion, sediment transport, and deposition are presented including the formation of sediment, the forces that erode and transport it, the forces that resist its erosion and transport, and the conditions that cause it to be deposited. The peculiarities of sedimentation processes in the Southwest include the infrequent and variable precipitation, the geological setting, and the sparseness of vegetation. A classification system for incised channels that is intended for users who do not necessarily have a background in fluvial hydrology has been developed and is presented in this report. The classification system is intended to enable a user to classify a reach of channel quickly on the basis of field observations. The system is based on the shape and condition of channels and on the sedimentation processes that are predominantly responsible for those conditions. Because those processes are controlled by environmental factors operating on the entire drainage basin, classification of channels can provide land managers and users with an understanding of what areas are likely to be most susceptible to erosion or the effects of high sedimentation rates and under what conditions they are most likely to occur.

Calibration, Monitoring, and Control of Complex Detector Systems

NASA Astrophysics Data System (ADS)

Breidenbach, M.

1981-04-01

LEP Detectors will probably be complex devices having tens of subsystems; some subsystems having perhaps tens of thousands of channels. Reasonable design goals for such a detector will include economic use of money and people, rapid and reliable calibration and monitoring of the detector, and simple control and operation of the device. The synchronous operation of an e+e- storage ring, coupled with its relatively low interaction rate, allow the design of simple circuits for time and charge measurements. These circuits, and more importantly, the basic detector channels, can usually be tested and calibrated by signal injection into the detector. Present detectors utilize semi-autonomous controllers which collect such calibration data and calculate statistics as well as control sparse data scans. Straightforward improvements in programming technology should move the entire calibration into these local controllers, so that calibration and testing time will be a constant independent of the number of channels in a system. Considerable programming effort may be saved by emphasizing the similarities of the subsystems, so that the subsystems can be described by a reasonable database and general purpose calibration and test routines can be used. Monitoring of the apparatus will probably continue to be of two classes: "passive" histogramming of channel occupancies and other more complex combinations of the data; and "active" injection of test patterns and calibration signals during a run. The relative importance of active monitoring will increase for the low data rates expected off resonances at high s. Experience at SPEAR and PEP is used to illustrate these approaches.

High-level ab initio potential energy surface and dynamics of the F– + CH3I SN2 and proton-transfer reactions† †Electronic supplementary information (ESI) available: Benchmark classical and adiabatic relative energies (Table S1), vibrational frequencies of all the stationary points (Tables S2 and S3), direct/indirect trajectory separation function parameters (Table S4), entrance-channel potential (Fig. S1), structures of the minima and saddle points corresponding to the abstraction channel (Fig. S2), reaction probabilities (Fig. S3), trajectory integration time distributions (Fig. S4), trajectory integration time vs. I– velocity distributions (Fig. S5), and mechanism-specific reaction probabilities (Fig. S6). See DOI: 10.1039/c7sc00033b Click here for additional data file.

PubMed Central

Olasz, Balázs; Szabó, István

2017-01-01

Bimolecular nucleophilic substitution (SN2) and proton transfer are fundamental processes in chemistry and F– + CH3I is an important prototype of these reactions. Here we develop the first full-dimensional ab initio analytical potential energy surface (PES) for the F– + CH3I system using a permutationally invariant fit of high-level composite energies obtained with the combination of the explicitly-correlated CCSD(T)-F12b method, the aug-cc-pVTZ basis, core electron correlation effects, and a relativistic effective core potential for iodine. The PES accurately describes the SN2 channel producing I– + CH3F via Walden-inversion, front-side attack, and double-inversion pathways as well as the proton-transfer channel leading to HF + CH2I–. The relative energies of the stationary points on the PES agree well with the new explicitly-correlated all-electron CCSD(T)-F12b/QZ-quality benchmark values. Quasiclassical trajectory computations on the PES show that the proton transfer becomes significant at high collision energies and double-inversion as well as front-side attack trajectories can occur. The computed broad angular distributions and hot internal energy distributions indicate the dominance of indirect mechanisms at lower collision energies, which is confirmed by analyzing the integration time and leaving group velocity distributions. Comparison with available crossed-beam experiments shows usually good agreement. PMID:28507692

A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems

PubMed Central

Zhang, Le; Wu, Jinnan

2014-01-01

This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve the search diversification of the hybrid metaheuristic, a solution replacement strategy based on the pathrelinking is presented to replace the particles that have been trapped in local optimum. Computational results on benchmark instances show that the proposed PSO-based hybrid metaheuristic is competitive with other powerful metaheuristics in the literature. PMID:24672389

A PSO-based hybrid metaheuristic for permutation flowshop scheduling problems.

PubMed

Zhang, Le; Wu, Jinnan

2014-01-01

This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve the search diversification of the hybrid metaheuristic, a solution replacement strategy based on the pathrelinking is presented to replace the particles that have been trapped in local optimum. Computational results on benchmark instances show that the proposed PSO-based hybrid metaheuristic is competitive with other powerful metaheuristics in the literature.

Palmprint verification using Lagrangian decomposition and invariant interest points

NASA Astrophysics Data System (ADS)

Gupta, P.; Rattani, A.; Kisku, D. R.; Hwang, C. J.; Sing, J. K.

2011-06-01

This paper presents a palmprint based verification system using SIFT features and Lagrangian network graph technique. We employ SIFT for feature extraction from palmprint images whereas the region of interest (ROI) which has been extracted from wide palm texture at the preprocessing stage, is considered for invariant points extraction. Finally, identity is established by finding permutation matrix for a pair of reference and probe palm graphs drawn on extracted SIFT features. Permutation matrix is used to minimize the distance between two graphs. The propsed system has been tested on CASIA and IITK palmprint databases and experimental results reveal the effectiveness and robustness of the system.

Index to Nuclear Safety: a technical progress review by chronology, permuted title, and author, Volume 18 (1) through Volume 22 (6)

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

Cottrell, W.B.; Passiakos, M.

This index to Nuclear Safety covers articles published in Nuclear Safety, Volume 18, Number 1 (January-February 1977) through Volume 22, Number 6 (November-December 1981). The index is divided into three section: a chronological list of articles (including abstracts), a permuted-title (KWIC) index, and an author index. Nuclear Safety, a bimonthly technical progress review prepared by the Nuclear Safety Information Center, covers all safety aspects of nuclear power reactors and associated facilities. Over 300 technical articles published in Nuclear Safety in the last 5 years are listed in this index.

Non-Weyl asymptotics for quantum graphs with general coupling conditions

NASA Astrophysics Data System (ADS)

Davies, E. Brian; Exner, Pavel; Lipovský, Jiří

2010-11-01

Inspired by a recent result of Davies and Pushnitski, we study resonance asymptotics of quantum graphs with general coupling conditions at the vertices. We derive a criterion for the asymptotics to be of a non-Weyl character. We show that for balanced vertices with permutation-invariant couplings the asymptotics is non-Weyl only in the case of Kirchhoff or anti-Kirchhoff conditions. While for graphs without permutation symmetry numerous examples of non-Weyl behaviour can be constructed. Furthermore, we present an insight into what makes the Kirchhoff/anti-Kirchhoff coupling particular from the resonance point of view. Finally, we demonstrate a generalization to quantum graphs with unequal edge weights.

[Local fractal analysis of noise-like time series by all permutations method for 1-115 min periods].

PubMed

Panchelyuga, V A; Panchelyuga, M S

2015-01-01

Results of local fractal analysis of 329-per-day time series of 239Pu alpha-decay rate fluctuations by means of all permutations method (APM) are presented. The APM-analysis reveals in the time series some steady frequency set. The coincidence of the frequency set with the Earth natural oscillations was demonstrated. A short review of works by different authors who analyzed the time series of fluctuations in processes of different nature is given. We have shown that the periods observed in those works correspond to the periods revealed in our study. It points to a common mechanism of the phenomenon observed.

Estimation of absolute solvent and solvation shell entropies via permutation reduction

NASA Astrophysics Data System (ADS)

Reinhard, Friedemann; Grubmüller, Helmut

2007-01-01

Despite its prominent contribution to the free energy of solvated macromolecules such as proteins or DNA, and although principally contained within molecular dynamics simulations, the entropy of the solvation shell is inaccessible to straightforward application of established entropy estimation methods. The complication is twofold. First, the configurational space density of such systems is too complex for a sufficiently accurate fit. Second, and in contrast to the internal macromolecular dynamics, the configurational space volume explored by the diffusive motion of the solvent molecules is too large to be exhaustively sampled by current simulation techniques. Here, we develop a method to overcome the second problem and to significantly alleviate the first one. We propose to exploit the permutation symmetry of the solvent by transforming the trajectory in a way that renders established estimation methods applicable, such as the quasiharmonic approximation or principal component analysis. Our permutation-reduced approach involves a combinatorial problem, which is solved through its equivalence with the linear assignment problem, for which O(N3) methods exist. From test simulations of dense Lennard-Jones gases, enhanced convergence and improved entropy estimates are obtained. Moreover, our approach renders diffusive systems accessible to improved fit functions.

Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding.

PubMed

Zhang, Xuncai; Han, Feng; Niu, Ying

2017-01-01

With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule's inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.

Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding

PubMed Central

2017-01-01

With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule's inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis. PMID:28912802

Analysis of crude oil markets with improved multiscale weighted permutation entropy

NASA Astrophysics Data System (ADS)

Niu, Hongli; Wang, Jun; Liu, Cheng

2018-03-01

Entropy measures are recently extensively used to study the complexity property in nonlinear systems. Weighted permutation entropy (WPE) can overcome the ignorance of the amplitude information of time series compared with PE and shows a distinctive ability to extract complexity information from data having abrupt changes in magnitude. Improved (or sometimes called composite) multi-scale (MS) method possesses the advantage of reducing errors and improving the accuracy when applied to evaluate multiscale entropy values of not enough long time series. In this paper, we combine the merits of WPE and improved MS to propose the improved multiscale weighted permutation entropy (IMWPE) method for complexity investigation of a time series. Then it is validated effective through artificial data: white noise and 1 / f noise, and real market data of Brent and Daqing crude oil. Meanwhile, the complexity properties of crude oil markets are explored respectively of return series, volatility series with multiple exponents and EEMD-produced intrinsic mode functions (IMFs) which represent different frequency components of return series. Moreover, the instantaneous amplitude and frequency of Brent and Daqing crude oil are analyzed by the Hilbert transform utilized to each IMF.

Diversification of Protein Cage Structure Using Circularly Permuted Subunits.

PubMed

Azuma, Yusuke; Herger, Michael; Hilvert, Donald

2018-01-17

Self-assembling protein cages are useful as nanoscale molecular containers for diverse applications in biotechnology and medicine. To expand the utility of such systems, there is considerable interest in customizing the structures of natural cage-forming proteins and designing new ones. Here we report that a circularly permuted variant of lumazine synthase, a cage-forming enzyme from Aquifex aeolicus (AaLS) affords versatile building blocks for the construction of nanocompartments that can be easily produced, tailored, and diversified. The topologically altered protein, cpAaLS, self-assembles into spherical and tubular cage structures with morphologies that can be controlled by the length of the linker connecting the native termini. Moreover, cpAaLS proteins integrate into wild-type and other engineered AaLS assemblies by coproduction in Escherichia coli to form patchwork cages. This coassembly strategy enables encapsulation of guest proteins in the lumen, modification of the exterior through genetic fusion, and tuning of the size and electrostatics of the compartments. This addition to the family of AaLS cages broadens the scope of this system for further applications and highlights the utility of circular permutation as a potentially general strategy for tailoring the properties of cage-forming proteins.

Structural redesign of lipase B from Candida antarctica by circular permutation and incremental truncation.

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

Qian, Zhen; Horton, John R.; Cheng, Xiadong

2009-11-02

Circular permutation of Candida antarctica lipase B yields several enzyme variants with substantially increased catalytic activity. To better understand the structural and functional consequences of protein termini reorganization, we have applied protein engineering and x-ray crystallography to cp283, one of the most active hydrolase variants. Our initial investigation has focused on the role of an extended surface loop, created by linking the native N- and C-termini, on protein integrity. Incremental truncation of the loop partially compensates for observed losses in secondary structure and the permutants temperature of unfolding. Unexpectedly, the improvements are accompanied by quaternary-structure changes from monomer to dimer.more » The crystal structures of one truncated variant (cp283{Delta}7) in the apo-form determined at 1.49 {angstrom} resolution and with a bound phosphonate inhibitor at 1.69 {angstrom} resolution confirmed the formation of a homodimer by swapping of the enzyme's 35-residue N-terminal region. Separately, the new protein termini at amino acid positions 282/283 convert the narrow access tunnel to the catalytic triad into a broad crevice for accelerated substrate entry and product exit while preserving the native active-site topology for optimal catalytic turnover.« less

Interpreting support vector machine models for multivariate group wise analysis in neuroimaging

PubMed Central

Gaonkar, Bilwaj; Shinohara, Russell T; Davatzikos, Christos

2015-01-01

Machine learning based classification algorithms like support vector machines (SVMs) have shown great promise for turning a high dimensional neuroimaging data into clinically useful decision criteria. However, tracing imaging based patterns that contribute significantly to classifier decisions remains an open problem. This is an issue of critical importance in imaging studies seeking to determine which anatomical or physiological imaging features contribute to the classifier’s decision, thereby allowing users to critically evaluate the findings of such machine learning methods and to understand disease mechanisms. The majority of published work addresses the question of statistical inference for support vector classification using permutation tests based on SVM weight vectors. Such permutation testing ignores the SVM margin, which is critical in SVM theory. In this work we emphasize the use of a statistic that explicitly accounts for the SVM margin and show that the null distributions associated with this statistic are asymptotically normal. Further, our experiments show that this statistic is a lot less conservative as compared to weight based permutation tests and yet specific enough to tease out multivariate patterns in the data. Thus, we can better understand the multivariate patterns that the SVM uses for neuroimaging based classification. PMID:26210913

Conditional Bounds on Polarization Transfer

NASA Astrophysics Data System (ADS)

Nielsen, N. C.; Sorensen, O. W.

The implications of constraints on unitary transformations of spin operators with respect to the accessible regions of Liouville space are analyzed. Specifically, the effects of spin-permutation symmetry on the unitary propagators are investigated. The influence of S2 and S3 propagator symmetry on two-dimensional bounds for F z = Σ Ni=1 I iz ↔ G z = Σ Mj=1 S jz polarization transfer in IS and I 2S spin- {1}/{2} systems is examined in detail. One result is that the maximum achievable F z ↔ G z polarization transfer is not reduced by permutation symmetry among the spins. For I 2S spin systems, S3 symmetry in the unitary propagator is shown to significantly reduce the accessible region in the 2D F z-S z Liouville subspace compared to the case restricted by unitarity alone. That result is compared with transformations under symmetric dipolar and scalar J coupling as well as shift and RF interactions. An important practical implication is that the refined spin thermodynamic theory of Levitt, Suter, and Ernst ( J. Chem. Phys.84, 4243, 1986) for cross polarization in solid-state NMR does not predict experimental outcomes incompatible with constraints of unitarity and spin-permutation symmetry.

A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling.

PubMed

Li, Bin-Bin; Wang, Ling

2007-06-01

This paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for the multiobjective flow shop scheduling problem (FSSP), which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. On the one hand, a quantum-inspired GA (QGA) based on Q-bit representation is applied for exploration in the discrete 0-1 hyperspace by using the updating operator of quantum gate and genetic operators of Q-bit. Moreover, random-key representation is used to convert the Q-bit representation to job permutation for evaluating the objective values of the schedule solution. On the other hand, permutation-based GA (PGA) is applied for both performing exploration in permutation-based scheduling space and stressing exploitation for good schedule solutions. To evaluate solutions in multiobjective sense, a randomly weighted linear-sum function is used in QGA, and a nondominated sorting technique including classification of Pareto fronts and fitness assignment is applied in PGA with regard to both proximity and diversity of solutions. To maintain the diversity of the population, two trimming techniques for population are proposed. The proposed HQGA is tested based on some multiobjective FSSPs. Simulation results and comparisons based on several performance metrics demonstrate the effectiveness of the proposed HQGA.

Permutation flow-shop scheduling problem to optimize a quadratic objective function

NASA Astrophysics Data System (ADS)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

SO(4) algebraic approach to the three-body bound state problem in two dimensions

NASA Astrophysics Data System (ADS)

Dmitrašinović, V.; Salom, Igor

2014-08-01

We use the permutation symmetric hyperspherical three-body variables to cast the non-relativistic three-body Schrödinger equation in two dimensions into a set of (possibly decoupled) differential equations that define an eigenvalue problem for the hyper-radial wave function depending on an SO(4) hyper-angular matrix element. We express this hyper-angular matrix element in terms of SO(3) group Clebsch-Gordan coefficients and use the latter's properties to derive selection rules for potentials with different dynamical/permutation symmetries. Three-body potentials acting on three identical particles may have different dynamical symmetries, in order of increasing symmetry, as follows: (1) S3 ⊗ OL(2), the permutation times rotational symmetry, that holds in sums of pairwise potentials, (2) O(2) ⊗ OL(2), the so-called "kinematic rotations" or "democracy symmetry" times rotational symmetry, that holds in area-dependent potentials, and (3) O(4) dynamical hyper-angular symmetry, that holds in hyper-radial three-body potentials. We show how the different residual dynamical symmetries of the non-relativistic three-body Hamiltonian lead to different degeneracies of certain states within O(4) multiplets.

cit: hypothesis testing software for mediation analysis in genomic applications.

PubMed

Millstein, Joshua; Chen, Gary K; Breton, Carrie V

2016-08-01

The challenges of successfully applying causal inference methods include: (i) satisfying underlying assumptions, (ii) limitations in data/models accommodated by the software and (iii) low power of common multiple testing approaches. The causal inference test (CIT) is based on hypothesis testing rather than estimation, allowing the testable assumptions to be evaluated in the determination of statistical significance. A user-friendly software package provides P-values and optionally permutation-based FDR estimates (q-values) for potential mediators. It can handle single and multiple binary and continuous instrumental variables, binary or continuous outcome variables and adjustment covariates. Also, the permutation-based FDR option provides a non-parametric implementation. Simulation studies demonstrate the validity of the cit package and show a substantial advantage of permutation-based FDR over other common multiple testing strategies. The cit open-source R package is freely available from the CRAN website (https://cran.r-project.org/web/packages/cit/index.html) with embedded C ++ code that utilizes the GNU Scientific Library, also freely available (http://www.gnu.org/software/gsl/). joshua.millstein@usc.edu Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

A novel image encryption algorithm based on the chaotic system and DNA computing

NASA Astrophysics Data System (ADS)

Chai, Xiuli; Gan, Zhihua; Lu, Yang; Chen, Yiran; Han, Daojun

A novel image encryption algorithm using the chaotic system and deoxyribonucleic acid (DNA) computing is presented. Different from the traditional encryption methods, the permutation and diffusion of our method are manipulated on the 3D DNA matrix. Firstly, a 3D DNA matrix is obtained through bit plane splitting, bit plane recombination, DNA encoding of the plain image. Secondly, 3D DNA level permutation based on position sequence group (3DDNALPBPSG) is introduced, and chaotic sequences generated from the chaotic system are employed to permutate the positions of the elements of the 3D DNA matrix. Thirdly, 3D DNA level diffusion (3DDNALD) is given, the confused 3D DNA matrix is split into sub-blocks, and XOR operation by block is manipulated to the sub-DNA matrix and the key DNA matrix from the chaotic system. At last, by decoding the diffused DNA matrix, we get the cipher image. SHA 256 hash of the plain image is employed to calculate the initial values of the chaotic system to avoid chosen plaintext attack. Experimental results and security analyses show that our scheme is secure against several known attacks, and it can effectively protect the security of the images.

A novel chaos-based image encryption algorithm using DNA sequence operations

NASA Astrophysics Data System (ADS)

Chai, Xiuli; Chen, Yiran; Broyde, Lucie

2017-01-01

An image encryption algorithm based on chaotic system and deoxyribonucleic acid (DNA) sequence operations is proposed in this paper. First, the plain image is encoded into a DNA matrix, and then a new wave-based permutation scheme is performed on it. The chaotic sequences produced by 2D Logistic chaotic map are employed for row circular permutation (RCP) and column circular permutation (CCP). Initial values and parameters of the chaotic system are calculated by the SHA 256 hash of the plain image and the given values. Then, a row-by-row image diffusion method at DNA level is applied. A key matrix generated from the chaotic map is used to fuse the confused DNA matrix; also the initial values and system parameters of the chaotic system are renewed by the hamming distance of the plain image. Finally, after decoding the diffused DNA matrix, we obtain the cipher image. The DNA encoding/decoding rules of the plain image and the key matrix are determined by the plain image. Experimental results and security analyses both confirm that the proposed algorithm has not only an excellent encryption result but also resists various typical attacks.

Searching for the fastest dynamo: laminar ABC flows.

PubMed

Alexakis, Alexandros

2011-08-01

The growth rate of the dynamo instability as a function of the magnetic Reynolds number R(M) is investigated by means of numerical simulations for the family of the Arnold-Beltrami-Childress (ABC) flows and for two different forcing scales. For the ABC flows that are driven at the largest available length scale, it is found that, as the magnetic Reynolds number is increased: (a) The flow that results first in a dynamo is the 2 1/2-dimensional flow for which A=B and C=0 (and all permutations). (b) The second type of flow that results in a dynamo is the one for which A=B≃2C/5 (and permutations). (c) The most symmetric flow, A=B=C, is the third type of flow that results in a dynamo. (d) As R(M) is increased, the A=B=C flow stops being a dynamo and transitions from a local maximum to a third-order saddle point. (e) At larger R(M), the A=B=C flow reestablishes itself as a dynamo but remains a saddle point. (f) At the largest examined R(M), the growth rate of the 2 1/2-dimensional flows starts to decay, the A=B=C flow comes close to a local maximum again, and the flow A=B≃2C/5 (and permutations) results in the fastest dynamo with growth rate γ≃0.12 at the largest examined R(M). For the ABC flows that are driven at the second largest available length scale, it is found that (a) the 2 1/2-dimensional flows A=B,C=0 (and permutations) are again the first flows that result in a dynamo with a decreased onset. (b) The most symmetric flow, A=B=C, is the second type of flow that results in a dynamo. It is, and it remains, a local maximum. (c) At larger R(M), the flow A=B≃2C/5 (and permutations) appears as the third type of flow that results in a dynamo. As R(M) is increased, it becomes the flow with the largest growth rate. The growth rates appear to have some correlation with the Lyapunov exponents, but constructive refolding of the field lines appears equally important in determining the fastest dynamo flow.

Vibration Analysis of the Space Shuttle External Tank Cable Tray Flight Data With and Without PAL Ramp

NASA Technical Reports Server (NTRS)

Walker, Bruce E.; Panda, Jayanta; Sutliff, Daniel L.

2008-01-01

External Tank Cable Tray vibration data for three successive Space Shuttle flights were analyzed to assess response to buffet and the effect of removal of the Protuberance Air Loads (PAL) ramp. Waveform integration, spectral analysis, cross-correlation analysis and wavelet analysis were employed to estimate vibration modes and temporal development of vibration motion from a sparse array of accelerometers and an on-board system that acquired 16 channels of data for approximately the first 2 min of each flight. The flight data indicated that PAL ramp removal had minimal effect on the fluctuating loads on the cable tray. The measured vibration frequencies and modes agreed well with predicted structural response.

Vibration Analysis of the Space Shuttle External Tank Cable Tray Flight Data with and without PAL Ramp

NASA Technical Reports Server (NTRS)

Walker, B. E.; Panda, B. E.; Sutliff, D. L.

2008-01-01

External Tank Cable Tray vibration data for three successive Space Shuttle flights were analyzed to assess response to buffet and the effect of removal of the Protuberance Air Loads (PAL) ramp. Waveform integration, spectral analysis, cross-correlation analysis and wavelet analysis were employed to estimate vibration modes and temporal development of vibration motion from a sparse array of accelerometers and an on-board system that acquired 16 channels of data for approximately the first two minutes of each flight. The flight data indicated that PAL ramp removal had minimal effect on the fluctuating loads on the cable tray. The measured vibration frequencies and modes agreed well with predicted structural response.

Accelerating scientific computations with mixed precision algorithms

NASA Astrophysics Data System (ADS)

Baboulin, Marc; Buttari, Alfredo; Dongarra, Jack; Kurzak, Jakub; Langou, Julie; Langou, Julien; Luszczek, Piotr; Tomov, Stanimire

2009-12-01

On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. The approach presented here can apply not only to conventional processors but also to other technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the STI Cell BE processor. Results on modern processor architectures and the STI Cell BE are presented. Program summaryProgram title: ITER-REF Catalogue identifier: AECO_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECO_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 7211 No. of bytes in distributed program, including test data, etc.: 41 862 Distribution format: tar.gz Programming language: FORTRAN 77 Computer: desktop, server Operating system: Unix/Linux RAM: 512 Mbytes Classification: 4.8 External routines: BLAS (optional) Nature of problem: On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. Solution method: Mixed precision algorithms stem from the observation that, in many cases, a single precision solution of a problem can be refined to the point where double precision accuracy is achieved. A common approach to the solution of linear systems, either dense or sparse, is to perform the LU factorization of the coefficient matrix using Gaussian elimination. First, the coefficient matrix A is factored into the product of a lower triangular matrix L and an upper triangular matrix U. Partial row pivoting is in general used to improve numerical stability resulting in a factorization PA=LU, where P is a permutation matrix. The solution for the system is achieved by first solving Ly=Pb (forward substitution) and then solving Ux=y (backward substitution). Due to round-off errors, the computed solution, x, carries a numerical error magnified by the condition number of the coefficient matrix A. In order to improve the computed solution, an iterative process can be applied, which produces a correction to the computed solution at each iteration, which then yields the method that is commonly known as the iterative refinement algorithm. Provided that the system is not too ill-conditioned, the algorithm produces a solution correct to the working precision. Running time: seconds/minutes

Structural basis of RND-type multidrug exporters

PubMed Central

Yamaguchi, Akihito; Nakashima, Ryosuke; Sakurai, Keisuke

2015-01-01

Bacterial multidrug exporters are intrinsic membrane transporters that act as cellular self-defense mechanism. The most notable characteristics of multidrug exporters is that they export a wide range of drugs and toxic compounds. The overexpression of these exporters causes multidrug resistance. Multidrug-resistant pathogens have become a serious problem in modern chemotherapy. Over the past decade, investigations into the structure of bacterial multidrug exporters have revealed the multidrug recognition and export mechanisms. In this review, we primarily discuss RND-type multidrug exporters particularly AcrAB-TolC, major drug exporter in Gram-negative bacteria. RND-type drug exporters are tripartite complexes comprising a cell membrane transporter, an outer membrane channel and an adaptor protein. Cell membrane transporters and outer membrane channels are homo-trimers; however, there is no consensus on the number of adaptor proteins in these tripartite complexes. The three monomers of a cell membrane transporter have varying conformations (access, binding, and extrusion) during transport. Drugs are exported following an ordered conformational change in these three monomers, through a functional rotation mechanism coupled with the proton relay cycle in ion pairs, which is driven by proton translocation. Multidrug recognition is based on a multisite drug-binding mechanism, in which two voluminous multidrug-binding pockets in cell membrane exporters recognize a wide range of substrates as a result of permutations at numerous binding sites that are specific for the partial structures of substrate molecules. The voluminous multidrug-binding pocket may have numerous binding sites even for a single substrate, suggesting that substrates may move between binding sites during transport, an idea named as multisite-drug-oscillation hypothesis. This hypothesis is consistent with the apparently broad substrate specificity of cell membrane exporters and their highly efficient ejection of drugs from the cell. Substrates are transported through dual multidrug-binding pockets via the peristaltic motion of the substrate translocation channel. Although there are no clinically available inhibitors of bacterial multidrug exporters, efforts to develop inhibitors based on structural information are underway. PMID:25941524

Structural basis of RND-type multidrug exporters.

PubMed

Yamaguchi, Akihito; Nakashima, Ryosuke; Sakurai, Keisuke

2015-01-01

Bacterial multidrug exporters are intrinsic membrane transporters that act as cellular self-defense mechanism. The most notable characteristics of multidrug exporters is that they export a wide range of drugs and toxic compounds. The overexpression of these exporters causes multidrug resistance. Multidrug-resistant pathogens have become a serious problem in modern chemotherapy. Over the past decade, investigations into the structure of bacterial multidrug exporters have revealed the multidrug recognition and export mechanisms. In this review, we primarily discuss RND-type multidrug exporters particularly AcrAB-TolC, major drug exporter in Gram-negative bacteria. RND-type drug exporters are tripartite complexes comprising a cell membrane transporter, an outer membrane channel and an adaptor protein. Cell membrane transporters and outer membrane channels are homo-trimers; however, there is no consensus on the number of adaptor proteins in these tripartite complexes. The three monomers of a cell membrane transporter have varying conformations (access, binding, and extrusion) during transport. Drugs are exported following an ordered conformational change in these three monomers, through a functional rotation mechanism coupled with the proton relay cycle in ion pairs, which is driven by proton translocation. Multidrug recognition is based on a multisite drug-binding mechanism, in which two voluminous multidrug-binding pockets in cell membrane exporters recognize a wide range of substrates as a result of permutations at numerous binding sites that are specific for the partial structures of substrate molecules. The voluminous multidrug-binding pocket may have numerous binding sites even for a single substrate, suggesting that substrates may move between binding sites during transport, an idea named as multisite-drug-oscillation hypothesis. This hypothesis is consistent with the apparently broad substrate specificity of cell membrane exporters and their highly efficient ejection of drugs from the cell. Substrates are transported through dual multidrug-binding pockets via the peristaltic motion of the substrate translocation channel. Although there are no clinically available inhibitors of bacterial multidrug exporters, efforts to develop inhibitors based on structural information are underway.

Revealing kinetics and state-dependent binding properties of IKur-targeting drugs that maximize atrial fibrillation selectivity

NASA Astrophysics Data System (ADS)

Ellinwood, Nicholas; Dobrev, Dobromir; Morotti, Stefano; Grandi, Eleonora

2017-09-01

The KV1.5 potassium channel, which underlies the ultra-rapid delayed-rectifier current (IKur) and is predominantly expressed in atria vs. ventricles, has emerged as a promising target to treat atrial fibrillation (AF). However, while numerous KV1.5-selective compounds have been screened, characterized, and tested in various animal models of AF, evidence of antiarrhythmic efficacy in humans is still lacking. Moreover, current guidelines for pre-clinical assessment of candidate drugs heavily rely on steady-state concentration-response curves or IC50 values, which can overlook adverse cardiotoxic effects. We sought to investigate the effects of kinetics and state-dependent binding of IKur-targeting drugs on atrial electrophysiology in silico and reveal the ideal properties of IKur blockers that maximize anti-AF efficacy and minimize pro-arrhythmic risk. To this aim, we developed a new Markov model of IKur that describes KV1.5 gating based on experimental voltage-clamp data in atrial myocytes from patient right-atrial samples in normal sinus rhythm. We extended the IKur formulation to account for state-specificity and kinetics of KV1.5-drug interactions and incorporated it into our human atrial cell model. We simulated 1- and 3-Hz pacing protocols in drug-free conditions and with a [drug] equal to the IC50 value. The effects of binding and unbinding kinetics were determined by examining permutations of the forward (kon) and reverse (koff) binding rates to the closed, open, and inactivated states of the KV1.5 channel. We identified a subset of ideal drugs exhibiting anti-AF electrophysiological parameter changes at fast pacing rates (effective refractory period prolongation), while having little effect on normal sinus rhythm (limited action potential prolongation). Our results highlight that accurately accounting for channel interactions with drugs, including kinetics and state-dependent binding, is critical for developing safer and more effective pharmacological anti-AF options.

Robust Group Sparse Beamforming for Multicast Green Cloud-RAN With Imperfect CSI

NASA Astrophysics Data System (ADS)

Shi, Yuanming; Zhang, Jun; Letaief, Khaled B.

2015-09-01

In this paper, we investigate the network power minimization problem for the multicast cloud radio access network (Cloud-RAN) with imperfect channel state information (CSI). The key observation is that network power minimization can be achieved by adaptively selecting active remote radio heads (RRHs) via controlling the group-sparsity structure of the beamforming vector. However, this yields a non-convex combinatorial optimization problem, for which we propose a three-stage robust group sparse beamforming algorithm. In the first stage, a quadratic variational formulation of the weighted mixed l1/l2-norm is proposed to induce the group-sparsity structure in the aggregated beamforming vector, which indicates those RRHs that can be switched off. A perturbed alternating optimization algorithm is then proposed to solve the resultant non-convex group-sparsity inducing optimization problem by exploiting its convex substructures. In the second stage, we propose a PhaseLift technique based algorithm to solve the feasibility problem with a given active RRH set, which helps determine the active RRHs. Finally, the semidefinite relaxation (SDR) technique is adopted to determine the robust multicast beamformers. Simulation results will demonstrate the convergence of the perturbed alternating optimization algorithm, as well as, the effectiveness of the proposed algorithm to minimize the network power consumption for multicast Cloud-RAN.

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

DE GERONIMO,G.; CHEN, W.; FRIED, J.

We present an application specific integrated circuit (ASIC) for high-resolution x-ray spectrometers. The ASIC is designed to read out signals from a pixelated silicon drift detector (SDD). Each hexagonal pixel has an area of 15 mmz and an anode capacitance of less than 100 fF. There is no integrated Field Effect transistor (FET) in the pixel, rather, the readout is done by wirebonding the anodes to the inputs of the ASIC. The ASIC provides 14 channels of low-noise charge amplification, high-order shaping with baseline stabilization, and peak detection with analog memory. The readout is sparse and based on low voltagemore » differential signaling. An interposer provides all the interconnections required to bias and operate the system. The channel dissipates 1.6 mW. The complete 14-pixel unit covers an area of 210 mm{sup 2}, dissipates 12 mW cm{sup -2}, and can be tiled to cover an arbitrarily large detection area. We measured a preliminary resolution of 172 eV at -35 C on the 6 keV peak of a {sup 55}Fe source.« less

Crystal structure of phototoxic orange fluorescent proteins with α tryptophan-based chromophore

DOE PAGES

Pletneva, Nadya V.; Pletnev, Vladimir Z.; Sarkisyan, Karen S.; ...

2015-12-23

Phototoxic fluorescent proteins represent a sparse group of genetically encoded photosensitizers that could be used for precise light-induced inactivation of target proteins, DNA damage, and cell killing. Only two such GFP-based fluorescent proteins (FPs), KillerRed and its monomeric variant SuperNova, were described up to date. We present a crystallographic study of their two orange successors, dimeric KillerOrange and monomeric mKiller-Orange, at 1.81 and 1.57 Å resolution, respectively. They are the first orange-emitting protein photosensitizers with a tryptophan-based chromophore (Gln65-Trp66-Gly67). Same as their red progenitors, both orange photosensitizers have a water-filled channel connecting the chromophore to the β-barrel exterior and enablingmore » transport of ROS. In both proteins, Trp66 of the chromophore adopts an unusual trans-cis conformation stabilized by H-bond with the nearby Gln159. This trans-cis conformation along with the water channel was shown to be a key structural feature providing bright orange emission and phototoxicity of both examined orange photosensitizers.« less

A 32-channel front-end ASIC for GEM detectors used in beam monitoring applications

NASA Astrophysics Data System (ADS)

Ciciriello, F.; Altieri, P. R.; Corsi, F.; De Robertis, G.; Felici, G.; Loddo, F.; Lorusso, L.; Marzocca, C.; Matarrese, G.; Ranieri, A.; Stamerra, A.

2017-11-01

A multichannel, mixed-signal, front-end ASIC for GEM detectors, intended for beam monitoring in hadron therapy applications, has been designed and prototyped in a standard 0.35 μm CMOS technology. The analog channels are based on the classic CSA + shaper processing chain, followed by a peak detector which can work as an analog memory, to simplifiy the analog-to-digital conversion of the peak voltage of the output pulse, proportional to the energy of the detected event. The available hardware resources include an 8-bit A/D converter and a standard-cell digital part, which manages the read-out procedure, in sparse or serial mode. The ASIC is self-triggered and transfers energy and address data to the external DAQ via a fast 100 MHz LVDS link. Preliminary characterization results show that the non-linearity error is limited to 5% for a maximum input charge of about 70 fC, the measured ENC is about 1400e- and the time jitter of the trigger signal generated in response to an injected charge of 60 fC is close to 200 ps.

An Open, Snow-based Hydrologic System on Noachian Mars

NASA Technical Reports Server (NTRS)

Zent, A. P.

1999-01-01

Properties of Noachian valley networks on Mars suggest that the conditions under which they formed were marginal for liquid water formation. The networks are sparsely scattered, poorly dissected, and tend to be small; a majority occupy areas only a few hundred kilometers in extent. Models in which networks formed by mass wasting are contra-indicated by the discovery of channels within the valleys. Greenhouse hypotheses for the stability of liquid water have foundered on familiar problems: first, a very substantial CO2 atmosphere would be required to bring global average conditions to 273 K; the CO2 should still be present in extensive carbonate deposits that have not been detected. Explanations that call upon groundwater sapping are hampered by the need for a hydrologic system to recharge the groundwater system, which effectively reinstates the need for a heavy CO2 atmosphere. Based upon field experience and geomorphic similarities between drainage developed in the periglacial terrain in and around the Haughton impact structure, Devon Island, Nuunavuut, Canada, we have suggested that some of the channel networks may have formed either subglacially, or as ice marginal structures.

Compact FPGA-based beamformer using oversampled 1-bit A/D converters.

PubMed

Tomov, Borislav Gueorguiev; Jensen, Jørgen Arendt

2005-05-01

A compact medical ultrasound beamformer architecture that uses oversampled 1-bit analog-to-digital (A/D) converters is presented. Sparse sample processing is used, as the echo signal for the image lines is reconstructed in 512 equidistant focal points along the line through its in-phase and quadrature components. That information is sufficient for presenting a B-mode image and creating a color flow map. The high sampling rate provides the necessary delay resolution for the focusing. The low channel data width (1-bit) makes it possible to construct a compact beamformer logic. The signal reconstruction is done using finite impulse reponse (FIR) filters, applied on selected bit sequences of the delta-sigma modulator output stream. The approach allows for a multichannel beamformer to fit in a single field programmable gate array (FPGA) device. A 32-channel beamformer is estimated to occupy 50% of the available logic resources in a commercially available mid-range FPGA, and to be able to operate at 129 MHz. Simulation of the architecture at 140 MHz provides images with a dynamic range approaching 60 dB for an excitation frequency of 3 MHz.

Crystal Structure of Phototoxic Orange Fluorescent Proteins with a Tryptophan-Based Chromophore

PubMed Central

Pletneva, Nadya V.; Pletnev, Vladimir Z.; Sarkisyan, Karen S.; Gorbachev, Dmitry A.; Egorov, Evgeny S.; Mishin, Alexander S.; Lukyanov, Konstantin A.; Dauter, Zbigniew; Pletnev, Sergei

2015-01-01

Phototoxic fluorescent proteins represent a sparse group of genetically encoded photosensitizers that could be used for precise light-induced inactivation of target proteins, DNA damage, and cell killing. Only two such GFP-based fluorescent proteins (FPs), KillerRed and its monomeric variant SuperNova, were described up to date. Here, we present a crystallographic study of their two orange successors, dimeric KillerOrange and monomeric mKillerOrange, at 1.81 and 1.57 Å resolution, respectively. They are the first orange-emitting protein photosensitizers with a tryptophan-based chromophore (Gln65-Trp66-Gly67). Same as their red progenitors, both orange photosensitizers have a water-filled channel connecting the chromophore to the β-barrel exterior and enabling transport of ROS. In both proteins, Trp66 of the chromophore adopts an unusual trans-cis conformation stabilized by H-bond with the nearby Gln159. This trans-cis conformation along with the water channel was shown to be a key structural feature providing bright orange emission and phototoxicity of both examined orange photosensitizers. PMID:26699366

Hollow laser plasma self-confined microjet generation

NASA Astrophysics Data System (ADS)

Sizyuk, Valeryi; Hassanein, Ahmed; CenterMaterials under Extreme Environment Team

2017-10-01

Hollow laser beam produced plasma (LPP) devices are being used for the generation of the self-confined cumulative microjet. Most important place by this LPP device construction is achieving of an annular distribution of the laser beam intensity by spot. An integrated model is being developed to detailed simulation of the plasma generation and evolution inside the laser beam channel. The model describes in two temperature approximation hydrodynamic processes in plasma, laser absorption processes, heat conduction, and radiation energy transport. The total variation diminishing scheme in the Lax-Friedrich formulation for the description of plasma hydrodynamic is used. Laser absorption and radiation transport models on the base of Monte Carlo method are being developed. Heat conduction part on the implicit scheme with sparse matrixes using is realized. The developed models are being integrated into HEIGHTS-LPP computer simulation package. The integrated modeling of the hollow beam laser plasma generation showed the self-confinement and acceleration of the plasma microjet inside the laser channel. It was found dependence of the microjet parameters including radiation emission on the hole and beam radiuses ratio. This work is supported by the National Science Foundation, PIRE project.

ON THE NUMBER OF SOLUTIONS OF THE EQUATION x^k = a IN THE SYMMETRIC GROUP S_n

NASA Astrophysics Data System (ADS)

Pavlov, A. I.

1981-04-01

This paper consists of three sections. In the first a formula is given for the number N_n^{(k)}(a) of solutions of the equation x^k = a in S_n depending on the cyclic structure of the permutation a. In the second an asymptotic formula is given for the quantity M_n^{(k)} = \\max_{a \\in S_n} N_n^{(k)}(a) for a fixed k \\geq 2 as n \\to \\infty. In the third an asymptotic formula is found for the cardinality of the set of permutations a such that the equation x^k = a has a unique solution. Bibliography: 5 titles.

Approximate strip exchanging.

PubMed

Roy, Swapnoneel; Thakur, Ashok Kumar

2008-01-01

Genome rearrangements have been modelled by a variety of primitives such as reversals, transpositions, block moves and block interchanges. We consider such a genome rearrangement primitive Strip Exchanges. Given a permutation, the challenge is to sort it by using minimum number of strip exchanges. A strip exchanging move interchanges the positions of two chosen strips so that they merge with other strips. The strip exchange problem is to sort a permutation using minimum number of strip exchanges. We present here the first non-trivial 2-approximation algorithm to this problem. We also observe that sorting by strip-exchanges is fixed-parameter-tractable. Lastly we discuss the application of strip exchanges in a different area Optical Character Recognition (OCR) with an example.

EXTENDING MULTIVARIATE DISTANCE MATRIX REGRESSION WITH AN EFFECT SIZE MEASURE AND THE ASYMPTOTIC NULL DISTRIBUTION OF THE TEST STATISTIC

PubMed Central

McArtor, Daniel B.; Lubke, Gitta H.; Bergeman, C. S.

2017-01-01

Person-centered methods are useful for studying individual differences in terms of (dis)similarities between response profiles on multivariate outcomes. Multivariate distance matrix regression (MDMR) tests the significance of associations of response profile (dis)similarities and a set of predictors using permutation tests. This paper extends MDMR by deriving and empirically validating the asymptotic null distribution of its test statistic, and by proposing an effect size for individual outcome variables, which is shown to recover true associations. These extensions alleviate the computational burden of permutation tests currently used in MDMR and render more informative results, thus making MDMR accessible to new research domains. PMID:27738957

Extending multivariate distance matrix regression with an effect size measure and the asymptotic null distribution of the test statistic.

PubMed

McArtor, Daniel B; Lubke, Gitta H; Bergeman, C S

2017-12-01

Person-centered methods are useful for studying individual differences in terms of (dis)similarities between response profiles on multivariate outcomes. Multivariate distance matrix regression (MDMR) tests the significance of associations of response profile (dis)similarities and a set of predictors using permutation tests. This paper extends MDMR by deriving and empirically validating the asymptotic null distribution of its test statistic, and by proposing an effect size for individual outcome variables, which is shown to recover true associations. These extensions alleviate the computational burden of permutation tests currently used in MDMR and render more informative results, thus making MDMR accessible to new research domains.

On the representation matrices of the spin permutation group. [for atomic and molecular electronic structures

NASA Technical Reports Server (NTRS)

Wilson, S.

1977-01-01

A method is presented for the determination of the representation matrices of the spin permutation group (symmetric group), a detailed knowledge of these matrices being required in the study of the electronic structure of atoms and molecules. The method is characterized by the use of two different coupling schemes. Unlike the Yamanouchi spin algebraic scheme, the method is not recursive. The matrices for the fundamental transpositions can be written down directly in one of the two bases. The method results in a computationally significant reduction in the number of matrix elements that have to be stored when compared with, say, the standard Young tableaux group theoretical approach.

Reduced complexity modeling of Arctic delta dynamics

NASA Astrophysics Data System (ADS)

Piliouras, A.; Lauzon, R.; Rowland, J. C.

2017-12-01

How water and sediment are routed through deltas has important implications for our understanding of nutrient and sediment fluxes to the coastal ocean. These fluxes may be especially important in Arctic environments, because the Arctic ocean receives a disproportionately large amount of river discharge and high latitude regions are expected to be particularly vulnerable to climate change. The Arctic has some of the world's largest but least studied deltas. This lack of data is due to remote and hazardous conditions, sparse human populations, and limited remote sensing resources. In the absence of data, complex models may be of limited scientific utility in understanding Arctic delta dynamics. To overcome this challenge, we adapt the reduced complexity delta-building model DeltaRCM for Arctic environments to explore the influence of sea ice and permafrost on delta morphology and dynamics. We represent permafrost by increasing the threshold for sediment erosion, as permafrost has been found to increase cohesion and reduce channel migration rates. The presence of permafrost in the model results in the creation of more elongate channels, fewer active channels, and a rougher shoreline. We consider several effects of sea ice, including introducing friction which increases flow resistance, constriction of flow by landfast ice, and changes in effective water surface elevation. Flow constriction and increased friction from ice results in a rougher shoreline, more frequent channel switching, decreased channel migration rates, and enhanced deposition offshore of channel mouths. The reduced complexity nature of the model is ideal for generating a basic understanding of which processes unique to Arctic environments may have important effects on delta evolution, and it allows us to explore a variety of rules for incorporating those processes into the model to inform future Arctic delta modelling efforts. Finally, we plan to use the modeling results to determine how the presence of permafrost and sea ice may influence delta morphology and the resulting large-scale patterns of water and sediment fluxes at the coast.

Localisation of SCN10A gene product Na(v)1.8 and novel pain-related ion channels in human heart.

PubMed

Facer, Paul; Punjabi, Prakash P; Abrari, Andleeb; Kaba, Riyaz A; Severs, Nicholas J; Chambers, John; Kooner, Jaspal S; Anand, Praveen

2011-01-01

We have shown that the gene SCN10A encoding the sodium channel Na(v)1.8 is a susceptibility factor for heart block and serious ventricular arrhythmia. Since Na(v)1.8 is known to be present in nerve fibres that mediate pain, it may be related to both cardiac pain and dysrhythmia. The localisation of Na(v)1.8 and other key nociceptive ion channels, including Na(v)1.7, Na(v)1.9, capsaicin receptor TRPV1, and purinergic receptor P2X(3), have not been reported in human heart. The aim of this study was to determine the distribution of Na(v)1.8, related sodium and other sensory channels in human cardiac tissue, and correlate their density with sympathetic nerves, regenerating nerves (GAP-43), and vascularity. Human heart atrial appendage tissues (n = 13) were collected during surgery for valve disease. Tissues were investigated by immunohistology using specific antibodies to Na(v)1.8 and other markers. Na(v)1.8 immunoreactivity was detected in nerve fibres and fascicles in the myocardium, often closely associated with small capillaries. Na(v)1.8 nerve fibres per mm(2) correlated significantly with vascular markers. Na(v)1.8-immunoreactivity was present also in cardiomyocytes with a similar distribution pattern to that seen with connexins, the specialised gap junction proteins of myocardial intercalated discs. Na(v)1.5-immunoreactivity was detected in cardiomyocytes but not in nerve fibres. Na(v)1.7, Na(v)1.9, TRPV1, P2X(3)/P2X(2), and GAP43 positive nerve fibres were relatively sparse, whereas sympathetic innervation and connexin43 were abundant. We conclude that sodium channel Na(v)1.8 is present in sensory nerves and cardiomyocytes of human heart. Na(v)1.8 and other pain channels provide new targets for the understanding and treatment of cardiac pain and dysrhythmia.

Material elemental decomposition in dual and multi-energy CT via a sparsity-dictionary approach for proton stopping power ratio calculation.

PubMed

Shen, Chenyang; Li, Bin; Chen, Liyuan; Yang, Ming; Lou, Yifei; Jia, Xun

2018-04-01

Accurate calculation of proton stopping power ratio (SPR) relative to water is crucial to proton therapy treatment planning, since SPR affects prediction of beam range. Current standard practice derives SPR using a single CT scan. Recent studies showed that dual-energy CT (DECT) offers advantages to accurately determine SPR. One method to further improve accuracy is to incorporate prior knowledge on human tissue composition through a dictionary approach. In addition, it is also suggested that using CT images with multiple (more than two) energy channels, i.e., multi-energy CT (MECT), can further improve accuracy. In this paper, we proposed a sparse dictionary-based method to convert CT numbers of DECT or MECT to elemental composition (EC) and relative electron density (rED) for SPR computation. A dictionary was constructed to include materials generated based on human tissues of known compositions. For a voxel with CT numbers of different energy channels, its EC and rED are determined subject to a constraint that the resulting EC is a linear non-negative combination of only a few tissues in the dictionary. We formulated this as a non-convex optimization problem. A novel algorithm was designed to solve the problem. The proposed method has a unified structure to handle both DECT and MECT with different number of channels. We tested our method in both simulation and experimental studies. Average errors of SPR in experimental studies were 0.70% in DECT, 0.53% in MECT with three energy channels, and 0.45% in MECT with four channels. We also studied the impact of parameter values and established appropriate parameter values for our method. The proposed method can accurately calculate SPR using DECT and MECT. The results suggest that using more energy channels may improve the SPR estimation accuracy. © 2018 American Association of Physicists in Medicine.

Distribution and sediment production of large benthic foraminifers on reef flats of the Majuro Atoll, Marshall Islands

NASA Astrophysics Data System (ADS)

Fujita, K.; Osawa, Y.; Kayanne, H.; Ide, Y.; Yamano, H.

2009-03-01

The distributions and population densities of large benthic foraminifers (LBFs) were investigated on reef flats of the Majuro Atoll, Marshall Islands. Annual sediment production by foraminifers was estimated based on population density data. Predominant LBFs were Calcarina and Amphistegina, and the population densities of these foraminifers varied with location and substratum type on reef flats. Both foraminifers primarily attached to macrophytes, particularly turf-forming algae, and were most abundant on an ocean reef flat (ORF) and in an inter-island channel near windward, sparsely populated islands. Calcarina density was higher on windward compared to leeward sides of ORFs, whereas Amphistegina density was similar on both sides of ORFs. These foraminifers were more common on the ocean side relative to the lagoon side of reef flats around a windward reef island, and both were rare or absent in nearshore zones around reef islands and on an ORF near windward, densely populated islands. Foraminiferal production rates varied with the degree to which habitats were subject to water motion and human influences. Highly productive sites (>103 g CaCO3 m-2 year-1) included an ORF and an inter-island channel near windward, sparsely populated islands, and a seaward area of a reef flat with no reef islands. Low-productivity sites (<10 g CaCO3 m-2 year-1) included generally nearshore zones of lagoonal reef flats, leeward ORFs, and a windward ORF near densely populated islands. These results suggest that the distribution and production of LBFs were largely influenced by a combination of natural environmental factors, including water motion, water depth, elevation relative to the lowest tidal level at spring tide, and the distribution of suitable substratum. The presence of reef islands may limit the distribution and production of foraminifers by altering water circulation in nearshore environments. Furthermore, increased anthropogenic factors (population and activities) may adversely affect foraminiferal distribution and production.

Dynamic characterisation of the specific surface area for fracture networks

NASA Astrophysics Data System (ADS)

Cvetkovic, V.

2017-12-01

One important application of chemical transport is geological disposal of high-level nuclear waste for which crystalline rock is a prime candidate for instance in Scandinavia. Interconnected heterogeneous fractures of sparsely fractured rock such as granite, act as conduits for transport of dissolved tracers. Fluid flow is known to be highly channelized in such rocks. Channels imply narrow flow paths, adjacent to essentially stagnant water in the fracture and/or the rock matrix. Tracers are transported along channelised flow paths and retained by minerals and/or stagnant water, depending on their sorption properties; this mechanism is critical for rocks to act as a barrier and ultimately provide safety for a geological repository. The sorbing tracers are retained by diffusion and sorption on mineral surfaces, whereas non-sorbing tracers can be retained only by diffusion into stagnant water of fractures. The retention and transport properties of a sparsely fractured rock will primarily depend on the specific surface area (SSA) of the fracture network which is determined by the heterogeneous structure and flow. The main challenge when characterising SSA on the field-scale is its dependence on the flow dynamics. We first define SSA as a physical quantity and clarify its importance for chemical transport. A methodology for dynamic characterisation of SSA in fracture networks is proposed that relies on three sets of data: i) Flow rate data as obtained by a flow logging procedure; ii) transmissivity data as obtained by pumping tests; iii) fracture network data as obtained from outcrop and geophysical observations. The proposed methodology utilises these data directly as well as indirectly through flow and particle tracking simulations in three-dimensional discrete fracture networks. The methodology is exemplified using specific data from the Swedish site Laxemar. The potential impact of uncertainties is of particular significance and is illustrated for radionuclide attenuation. Effects of internal fracture heterogeneity vs fracture network heterogeneity, and of rock deformation, on the statistical properties of SSA are briefly discussed.

Phylotranscriptomic analysis of the origin and early diversification of land plants

PubMed Central

Wickett, Norman J.; Mirarab, Siavash; Nguyen, Nam; Warnow, Tandy; Carpenter, Eric; Matasci, Naim; Ayyampalayam, Saravanaraj; Barker, Michael S.; Burleigh, J. Gordon; Gitzendanner, Matthew A.; Ruhfel, Brad R.; Wafula, Eric; Graham, Sean W.; Mathews, Sarah; Melkonian, Michael; Soltis, Douglas E.; Soltis, Pamela S.; Miles, Nicholas W.; Rothfels, Carl J.; Pokorny, Lisa; Shaw, A. Jonathan; DeGironimo, Lisa; Stevenson, Dennis W.; Surek, Barbara; Villarreal, Juan Carlos; Roure, Béatrice; Philippe, Hervé; dePamphilis, Claude W.; Chen, Tao; Deyholos, Michael K.; Baucom, Regina S.; Kutchan, Toni M.; Augustin, Megan M.; Wang, Jun; Zhang, Yong; Tian, Zhijian; Yan, Zhixiang; Wu, Xiaolei; Sun, Xiao; Wong, Gane Ka-Shu; Leebens-Mack, James

2014-01-01

Reconstructing the origin and evolution of land plants and their algal relatives is a fundamental problem in plant phylogenetics, and is essential for understanding how critical adaptations arose, including the embryo, vascular tissue, seeds, and flowers. Despite advances in molecular systematics, some hypotheses of relationships remain weakly resolved. Inferring deep phylogenies with bouts of rapid diversification can be problematic; however, genome-scale data should significantly increase the number of informative characters for analyses. Recent phylogenomic reconstructions focused on the major divergences of plants have resulted in promising but inconsistent results. One limitation is sparse taxon sampling, likely resulting from the difficulty and cost of data generation. To address this limitation, transcriptome data for 92 streptophyte taxa were generated and analyzed along with 11 published plant genome sequences. Phylogenetic reconstructions were conducted using up to 852 nuclear genes and 1,701,170 aligned sites. Sixty-nine analyses were performed to test the robustness of phylogenetic inferences to permutations of the data matrix or to phylogenetic method, including supermatrix, supertree, and coalescent-based approaches, maximum-likelihood and Bayesian methods, partitioned and unpartitioned analyses, and amino acid versus DNA alignments. Among other results, we find robust support for a sister-group relationship between land plants and one group of streptophyte green algae, the Zygnematophyceae. Strong and robust support for a clade comprising liverworts and mosses is inconsistent with a widely accepted view of early land plant evolution, and suggests that phylogenetic hypotheses used to understand the evolution of fundamental plant traits should be reevaluated. PMID:25355905

Classification of California streams using combined deductive and inductive approaches: Setting the foundation for analysis of hydrologic alteration

USGS Publications Warehouse

Pyne, Matthew I.; Carlisle, Daren M.; Konrad, Christopher P.; Stein, Eric D.

2017-01-01

Regional classification of streams is an early step in the Ecological Limits of Hydrologic Alteration framework. Many stream classifications are based on an inductive approach using hydrologic data from minimally disturbed basins, but this approach may underrepresent streams from heavily disturbed basins or sparsely gaged arid regions. An alternative is a deductive approach, using watershed climate, land use, and geomorphology to classify streams, but this approach may miss important hydrological characteristics of streams. We classified all stream reaches in California using both approaches. First, we used Bayesian and hierarchical clustering to classify reaches according to watershed characteristics. Streams were clustered into seven classes according to elevation, sedimentary rock, and winter precipitation. Permutation-based analysis of variance and random forest analyses were used to determine which hydrologic variables best separate streams into their respective classes. Stream typology (i.e., the class that a stream reach is assigned to) is shaped mainly by patterns of high and mean flow behavior within the stream's landscape context. Additionally, random forest was used to determine which hydrologic variables best separate minimally disturbed reference streams from non-reference streams in each of the seven classes. In contrast to stream typology, deviation from reference conditions is more difficult to detect and is largely defined by changes in low-flow variables, average daily flow, and duration of flow. Our combined deductive/inductive approach allows us to estimate flow under minimally disturbed conditions based on the deductive analysis and compare to measured flow based on the inductive analysis in order to estimate hydrologic change.

Quantile regression models of animal habitat relationships

USGS Publications Warehouse

Cade, Brian S.

2003-01-01

Typically, all factors that limit an organism are not measured and included in statistical models used to investigate relationships with their environment. If important unmeasured variables interact multiplicatively with the measured variables, the statistical models often will have heterogeneous response distributions with unequal variances. Quantile regression is an approach for estimating the conditional quantiles of a response variable distribution in the linear model, providing a more complete view of possible causal relationships between variables in ecological processes. Chapter 1 introduces quantile regression and discusses the ordering characteristics, interval nature, sampling variation, weighting, and interpretation of estimates for homogeneous and heterogeneous regression models. Chapter 2 evaluates performance of quantile rankscore tests used for hypothesis testing and constructing confidence intervals for linear quantile regression estimates (0 ≤ τ ≤ 1). A permutation F test maintained better Type I errors than the Chi-square T test for models with smaller n, greater number of parameters p, and more extreme quantiles τ. Both versions of the test required weighting to maintain correct Type I errors when there was heterogeneity under the alternative model. An example application related trout densities to stream channel width:depth. Chapter 3 evaluates a drop in dispersion, F-ratio like permutation test for hypothesis testing and constructing confidence intervals for linear quantile regression estimates (0 ≤ τ ≤ 1). Chapter 4 simulates from a large (N = 10,000) finite population representing grid areas on a landscape to demonstrate various forms of hidden bias that might occur when the effect of a measured habitat variable on some animal was confounded with the effect of another unmeasured variable (spatially and not spatially structured). Depending on whether interactions of the measured habitat and unmeasured variable were negative (interference interactions) or positive (facilitation interactions), either upper (τ > 0.5) or lower (τ < 0.5) quantile regression parameters were less biased than mean rate parameters. Sampling (n = 20 - 300) simulations demonstrated that confidence intervals constructed by inverting rankscore tests provided valid coverage of these biased parameters. Quantile regression was used to estimate effects of physical habitat resources on a bivalve mussel (Macomona liliana) in a New Zealand harbor by modeling the spatial trend surface as a cubic polynomial of location coordinates.

Wildland Arson as Clandestine Resource Management: A Space-Time Permutation Analysis and Classification of Informal Fire Management Regimes in Georgia, USA

NASA Astrophysics Data System (ADS)

Coughlan, Michael R.

2016-05-01

Forest managers are increasingly recognizing the value of disturbance-based land management techniques such as prescribed burning. Unauthorized, "arson" fires are common in the southeastern United States where a legacy of agrarian cultural heritage persists amidst an increasingly forest-dominated landscape. This paper reexamines unauthorized fire-setting in the state of Georgia, USA from a historical ecology perspective that aims to contribute to historically informed, disturbance-based land management. A space-time permutation analysis is employed to discriminate systematic, management-oriented unauthorized fires from more arbitrary or socially deviant fire-setting behaviors. This paper argues that statistically significant space-time clusters of unauthorized fire occurrence represent informal management regimes linked to the legacy of traditional land management practices. Recent scholarship has pointed out that traditional management has actively promoted sustainable resource use and, in some cases, enhanced biodiversity often through the use of fire. Despite broad-scale displacement of traditional management during the 20th century, informal management practices may locally circumvent more formal and regionally dominant management regimes. Space-time permutation analysis identified 29 statistically significant fire regimes for the state of Georgia. The identified regimes are classified by region and land cover type and their implications for historically informed disturbance-based resource management are discussed.

Permuting input for more effective sampling of 3D conformer space

NASA Astrophysics Data System (ADS)

Carta, Giorgio; Onnis, Valeria; Knox, Andrew J. S.; Fayne, Darren; Lloyd, David G.

2006-03-01

SMILES strings and other classic 2D structural formats offer a convenient way to represent molecules as a simplistic connection table, with the inherent advantages of ease of handling and storage. In the context of virtual screening, chemical databases to be screened are often initially represented by canonicalised SMILES strings that can be filtered and pre-processed in a number of ways, resulting in molecules that occupy similar regions of chemical space to active compounds of a therapeutic target. A wide variety of software exists to convert molecules into SMILES format, namely, Mol2smi (Daylight Inc.), MOE (Chemical Computing Group) and Babel (Openeye Scientific Software). Depending on the algorithm employed, the atoms of a SMILES string defining a molecule can be ordered differently. Upon conversion to 3D coordinates they result in the production of ostensibly the same molecule. In this work we show how different permutations of a SMILES string can affect conformer generation, affecting reliability and repeatability of the results. Furthermore, we propose a novel procedure for the generation of conformers, taking advantage of the permutation of the input strings—both SMILES and other 2D formats, leading to more effective sampling of conformation space in output, and also implementing fingerprint and principal component analyses step to post process and visualise the results.

Estimating Temporal Causal Interaction between Spike Trains with Permutation and Transfer Entropy

PubMed Central

Li, Zhaohui; Li, Xiaoli

2013-01-01

Estimating the causal interaction between neurons is very important for better understanding the functional connectivity in neuronal networks. We propose a method called normalized permutation transfer entropy (NPTE) to evaluate the temporal causal interaction between spike trains, which quantifies the fraction of ordinal information in a neuron that has presented in another one. The performance of this method is evaluated with the spike trains generated by an Izhikevich’s neuronal model. Results show that the NPTE method can effectively estimate the causal interaction between two neurons without influence of data length. Considering both the precision of time delay estimated and the robustness of information flow estimated against neuronal firing rate, the NPTE method is superior to other information theoretic method including normalized transfer entropy, symbolic transfer entropy and permutation conditional mutual information. To test the performance of NPTE on analyzing simulated biophysically realistic synapses, an Izhikevich’s cortical network that based on the neuronal model is employed. It is found that the NPTE method is able to characterize mutual interactions and identify spurious causality in a network of three neurons exactly. We conclude that the proposed method can obtain more reliable comparison of interactions between different pairs of neurons and is a promising tool to uncover more details on the neural coding. PMID:23940662

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

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

Unequal homologous recombination between tandemly arranged sequences stably incorporated into cultured rat cells.

PubMed Central

Stringer, J R; Kuhn, R M; Newman, J L; Meade, J C

1985-01-01

Cultured rat cells deficient in endogenous thymidine kinase activity (tk) were stably transformed with a recombination-indicator DNA substrate constructed in vitro by rearrangement of the herpes simplex virus tk gene sequences into a partially redundant permutation of the functional gene. The recombination-indicator DNA did not express tk, but was designed to allow formation of a functional tk gene via homologous recombination. A clonal cell line (519) was isolated that harbored several permuted herpes simplex virus tk genes. 519 cells spontaneously produced progeny that survived in medium containing hypoxanthine, aminopterin, and thymidine. Acquisition of resistance to hypoxanthine, aminopterin, and thymidine was accompanied by the rearrangement of the defective tk gene to functional configuration. The rearrangement apparently occurred by unequal exchange between one permuted tk gene and a replicated copy of itself. Recombination was between 500-base-pair tracts of DNA sequence homology that were separated by 3.4 kilobases. Exchanges occurred spontaneously at a frequency of approximately 5 X 10(-6) events per cell per generation. Recombination also mediated reversion to the tk- phenotype; however, the predominant mechanism by which cells escaped death in the presence of drugs rendered toxic by thymidine kinase was not recombination, but rather inactivation of the intact tk gene. Images PMID:3016511

Detecting the influence of rare stressors on rare species in Yosemite National Park using a novel stratified permutation test

USGS Publications Warehouse

Matchett, John R.; Stark, Philip B.; Ostoja, Steven M.; Knapp, Roland A.; McKenny, Heather C.; Brooks, Matthew L.; Langford, William T.; Joppa, Lucas N.; Berlow, Eric L.

2015-01-01

Statistical models often use observational data to predict phenomena; however, interpreting model terms to understand their influence can be problematic. This issue poses a challenge in species conservation where setting priorities requires estimating influences of potential stressors using observational data. We present a novel approach for inferring influence of a rare stressor on a rare species by blending predictive models with nonparametric permutation tests. We illustrate the approach with two case studies involving rare amphibians in Yosemite National Park, USA. The endangered frog, Rana sierrae, is known to be negatively impacted by non-native fish, while the threatened toad, Anaxyrus canorus, is potentially affected by packstock. Both stressors and amphibians are rare, occurring in ~10% of potential habitat patches. We first predict amphibian occupancy with a statistical model that includes all predictors but the stressor to stratify potential habitat by predicted suitability. A stratified permutation test then evaluates the association between stressor and amphibian, all else equal. Our approach confirms the known negative relationship between fish and R. sierrae, but finds no evidence of a negative relationship between current packstock use and A. canorus breeding. Our statistical approach has potential broad application for deriving understanding (not just prediction) from observational data.

A Space–Time Permutation Scan Statistic for Disease Outbreak Detection

PubMed Central

Kulldorff, Martin; Heffernan, Richard; Hartman, Jessica; Assunção, Renato; Mostashari, Farzad

2005-01-01

Background The ability to detect disease outbreaks early is important in order to minimize morbidity and mortality through timely implementation of disease prevention and control measures. Many national, state, and local health departments are launching disease surveillance systems with daily analyses of hospital emergency department visits, ambulance dispatch calls, or pharmacy sales for which population-at-risk information is unavailable or irrelevant. Methods and Findings We propose a prospective space–time permutation scan statistic for the early detection of disease outbreaks that uses only case numbers, with no need for population-at-risk data. It makes minimal assumptions about the time, geographical location, or size of the outbreak, and it adjusts for natural purely spatial and purely temporal variation. The new method was evaluated using daily analyses of hospital emergency department visits in New York City. Four of the five strongest signals were likely local precursors to citywide outbreaks due to rotavirus, norovirus, and influenza. The number of false signals was at most modest. Conclusion If such results hold up over longer study times and in other locations, the space–time permutation scan statistic will be an important tool for local and national health departments that are setting up early disease detection surveillance systems. PMID:15719066

Detecting the influence of rare stressors on rare species in Yosemite National Park using a novel stratified permutation test

PubMed Central

Matchett, J. R.; Stark, Philip B.; Ostoja, Steven M.; Knapp, Roland A.; McKenny, Heather C.; Brooks, Matthew L.; Langford, William T.; Joppa, Lucas N.; Berlow, Eric L.

2015-01-01

Statistical models often use observational data to predict phenomena; however, interpreting model terms to understand their influence can be problematic. This issue poses a challenge in species conservation where setting priorities requires estimating influences of potential stressors using observational data. We present a novel approach for inferring influence of a rare stressor on a rare species by blending predictive models with nonparametric permutation tests. We illustrate the approach with two case studies involving rare amphibians in Yosemite National Park, USA. The endangered frog, Rana sierrae, is known to be negatively impacted by non-native fish, while the threatened toad, Anaxyrus canorus, is potentially affected by packstock. Both stressors and amphibians are rare, occurring in ~10% of potential habitat patches. We first predict amphibian occupancy with a statistical model that includes all predictors but the stressor to stratify potential habitat by predicted suitability. A stratified permutation test then evaluates the association between stressor and amphibian, all else equal. Our approach confirms the known negative relationship between fish and R. sierrae, but finds no evidence of a negative relationship between current packstock use and A. canorus breeding. Our statistical approach has potential broad application for deriving understanding (not just prediction) from observational data. PMID:26031755

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

PubMed

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

2017-12-01

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

Combining p-values in replicated single-case experiments with multivariate outcome.

PubMed

Solmi, Francesca; Onghena, Patrick

2014-01-01

Interest in combining probabilities has a long history in the global statistical community. The first steps in this direction were taken by Ronald Fisher, who introduced the idea of combining p-values of independent tests to provide a global decision rule when multiple aspects of a given problem were of interest. An interesting approach to this idea of combining p-values is the one based on permutation theory. The methods belonging to this particular approach exploit the permutation distributions of the tests to be combined, and use a simple function to combine probabilities. Combining p-values finds a very interesting application in the analysis of replicated single-case experiments. In this field the focus, while comparing different treatments effects, is more articulated than when just looking at the means of the different populations. Moreover, it is often of interest to combine the results obtained on the single patients in order to get more global information about the phenomenon under study. This paper gives an overview of how the concept of combining p-values was conceived, and how it can be easily handled via permutation techniques. Finally, the method of combining p-values is applied to a simulated replicated single-case experiment, and a numerical illustration is presented.

A permutation-based non-parametric analysis of CRISPR screen data.

PubMed

Jia, Gaoxiang; Wang, Xinlei; Xiao, Guanghua

2017-07-19

Clustered regularly-interspaced short palindromic repeats (CRISPR) screens are usually implemented in cultured cells to identify genes with critical functions. Although several methods have been developed or adapted to analyze CRISPR screening data, no single specific algorithm has gained popularity. Thus, rigorous procedures are needed to overcome the shortcomings of existing algorithms. We developed a Permutation-Based Non-Parametric Analysis (PBNPA) algorithm, which computes p-values at the gene level by permuting sgRNA labels, and thus it avoids restrictive distributional assumptions. Although PBNPA is designed to analyze CRISPR data, it can also be applied to analyze genetic screens implemented with siRNAs or shRNAs and drug screens. We compared the performance of PBNPA with competing methods on simulated data as well as on real data. PBNPA outperformed recent methods designed for CRISPR screen analysis, as well as methods used for analyzing other functional genomics screens, in terms of Receiver Operating Characteristics (ROC) curves and False Discovery Rate (FDR) control for simulated data under various settings. Remarkably, the PBNPA algorithm showed better consistency and FDR control on published real data as well. PBNPA yields more consistent and reliable results than its competitors, especially when the data quality is low. R package of PBNPA is available at: https://cran.r-project.org/web/packages/PBNPA/ .

Tensor models, Kronecker coefficients and permutation centralizer algebras

NASA Astrophysics Data System (ADS)

Geloun, Joseph Ben; Ramgoolam, Sanjaye

2017-11-01

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

Permutation auto-mutual information of electroencephalogram in anesthesia

NASA Astrophysics Data System (ADS)

Liang, Zhenhu; Wang, Yinghua; Ouyang, Gaoxiang; Voss, Logan J.; Sleigh, Jamie W.; Li, Xiaoli

2013-04-01

Objective. The dynamic change of brain activity in anesthesia is an interesting topic for clinical doctors and drug designers. To explore the dynamical features of brain activity in anesthesia, a permutation auto-mutual information (PAMI) method is proposed to measure the information coupling of electroencephalogram (EEG) time series obtained in anesthesia. Approach. The PAMI is developed and applied on EEG data collected from 19 patients under sevoflurane anesthesia. The results are compared with the traditional auto-mutual information (AMI), SynchFastSlow (SFS, derived from the BIS index), permutation entropy (PE), composite PE (CPE), response entropy (RE) and state entropy (SE). Performance of all indices is assessed by pharmacokinetic/pharmacodynamic (PK/PD) modeling and prediction probability. Main results. The PK/PD modeling and prediction probability analysis show that the PAMI index correlates closely with the anesthetic effect. The coefficient of determination R2 between PAMI values and the sevoflurane effect site concentrations, and the prediction probability Pk are higher in comparison with other indices. The information coupling in EEG series can be applied to indicate the effect of the anesthetic drug sevoflurane on the brain activity as well as other indices. The PAMI of the EEG signals is suggested as a new index to track drug concentration change. Significance. The PAMI is a useful index for analyzing the EEG dynamics during general anesthesia.

Refined composite multiscale weighted-permutation entropy of financial time series

NASA Astrophysics Data System (ADS)

Zhang, Yongping; Shang, Pengjian

2018-04-01

For quantifying the complexity of nonlinear systems, multiscale weighted-permutation entropy (MWPE) has recently been proposed. MWPE has incorporated amplitude information and been applied to account for the multiple inherent dynamics of time series. However, MWPE may be unreliable, because its estimated values show large fluctuation for slight variation of the data locations, and a significant distinction only for the different length of time series. Therefore, we propose the refined composite multiscale weighted-permutation entropy (RCMWPE). By comparing the RCMWPE results with other methods' results on both synthetic data and financial time series, RCMWPE method shows not only the advantages inherited from MWPE but also lower sensitivity to the data locations, more stable and much less dependent on the length of time series. Moreover, we present and discuss the results of RCMWPE method on the daily price return series from Asian and European stock markets. There are significant differences between Asian markets and European markets, and the entropy values of Hang Seng Index (HSI) are close to but higher than those of European markets. The reliability of the proposed RCMWPE method has been supported by simulations on generated and real data. It could be applied to a variety of fields to quantify the complexity of the systems over multiple scales more accurately.

Wildland Arson as Clandestine Resource Management: A Space-Time Permutation Analysis and Classification of Informal Fire Management Regimes in Georgia, USA.

PubMed

Coughlan, Michael R

2016-05-01

Forest managers are increasingly recognizing the value of disturbance-based land management techniques such as prescribed burning. Unauthorized, "arson" fires are common in the southeastern United States where a legacy of agrarian cultural heritage persists amidst an increasingly forest-dominated landscape. This paper reexamines unauthorized fire-setting in the state of Georgia, USA from a historical ecology perspective that aims to contribute to historically informed, disturbance-based land management. A space-time permutation analysis is employed to discriminate systematic, management-oriented unauthorized fires from more arbitrary or socially deviant fire-setting behaviors. This paper argues that statistically significant space-time clusters of unauthorized fire occurrence represent informal management regimes linked to the legacy of traditional land management practices. Recent scholarship has pointed out that traditional management has actively promoted sustainable resource use and, in some cases, enhanced biodiversity often through the use of fire. Despite broad-scale displacement of traditional management during the 20th century, informal management practices may locally circumvent more formal and regionally dominant management regimes. Space-time permutation analysis identified 29 statistically significant fire regimes for the state of Georgia. The identified regimes are classified by region and land cover type and their implications for historically informed disturbance-based resource management are discussed.

Randomization in cancer clinical trials: permutation test and development of a computer program.

PubMed Central

Ohashi, Y

1990-01-01

When analyzing cancer clinical trial data where the treatment allocation is done using dynamic balancing methods such as the minimization method for balancing the distribution of important prognostic factors in each arm, conservativeness occurs if such a randomization scheme is ignored and a simple unstratified analysis is carried out. In this paper, the above conservativeness is demonstrated by computer simulation, and the development of a computer program that carries out permutation tests of the log-rank statistics for clinical trial data where the allocation is done by the minimization method or a stratified permuted block design is introduced. We are planning to use this program in practice to supplement a usual stratified analysis and model-based methods such as the Cox regression. The most serious problem in cancer clinical trials in Japan is how to carry out the quality control or data management in trials that are initiated and conducted by researchers without support from pharmaceutical companies. In the final section of this paper, one international collaborative work for developing international guidelines on data management in clinical trials of bladder cancer is briefly introduced, and the differences between the system adopted in US/European statistical centers and the Japanese system is described. PMID:2269216

STRUCTURAL AND FUNCTIONAL CONSEQUENCES OF CIRCULAR PERMUTATION ON THE ACTIVE SITE OF OLD YELLOW ENZYME.

PubMed

Daugherty, Ashley B; Horton, John R; Cheng, Xiaodong; Lutz, Stefan

2015-02-06

Circular permutation of the NADPH-dependent oxidoreductase Old Yellow Enzyme from Saccharomyces pastorianus (OYE1) can significantly enhance the enzyme's catalytic performance. Termini relocation into four regions of the protein (sectors I-IV) near the active site has proven effective in altering enzyme function. To better understand the structural consequences and rationalize the observed functional gains in these OYE1 variants, we selected representatives from sectors I-III for further characterization by biophysical methods and X-ray crystallography. These investigations not only show trends in enzyme stability and quaternary structure as a function of termini location, but also provide a possible explanation for the catalytic gains in our top-performing OYE variant (new N-terminus at residue 303; sector III). Crystallographic analysis indicates that termini relocation into sector III affects the loop β6 region (amino acid positions: 290-310) of OYE1 which forms a lid over the active site. Peptide backbone cleavage greatly enhances local flexibility, effectively converting the loop into a tether and consequently increasing the environmental exposure of the active site. Interestingly, such active site remodeling does not negatively impact the enzyme's activity and stereoselectivity, nor does it perturb the conformation of other key active site residues with the exception of Y375. These observations were confirmed in truncation experiments, deleting all residues of the loop β6 region in our OYE variant. Intrigued by the finding that circular permutation leaves most of the key catalytic residues unchanged, we also tested OYE permutants for possible additive or synergistic effects of amino acid substitutions. Distinct functional changes in these OYE variants were detected upon mutations at W116, known in native OYE1 to cause inversion of diastereo-selectivity for ( S )-carvone reduction. Our findings demonstrate the contribution of loop β6 toward determining the stereoselectivity of OYE1, an important insight for future OYE engineering efforts.

Structural and Functional Consequences of Circular Permutation on the Active Site of Old Yellow Enzyme

DOE PAGES

Daugherty, Ashley B.; Horton, John R.; Cheng, Xiaodong; ...

2014-12-09

Circular permutation of the NADPH-dependent oxidoreductase Old Yellow Enzyme from Saccharomyces pastorianus (OYE1) can significantly enhance the enzyme’s catalytic performance. Termini relocation into four regions of the protein (sectors I–IV) near the active site has proven effective in altering enzyme function. To better understand the structural consequences and rationalize the observed functional gains in these OYE1 variants, we selected representatives from sectors I–III for further characterization by biophysical methods and X-ray crystallography. These investigations not only show trends in enzyme stability and quaternary structure as a function of termini location but also provide a possible explanation for the catalytic gainsmore » in our top-performing OYE variant (new N-terminus at residue 303; sector III). Crystallographic analysis indicates that termini relocation into sector III affects the loop β6 region (amino acid positions: 290–310) of OYE1, which forms a lid over the active site. Peptide backbone cleavage greatly enhances local flexibility, effectively converting the loop into a tether and consequently increasing the environmental exposure of the active site. Interestingly, such an active site remodeling does not negatively impact the enzyme’s activity and stereoselectivity; neither does it perturb the conformation of other key active site residues with the exception of Y375. These observations were confirmed in truncation experiments, deleting all residues of the loop β6 region in our OYE variant. Intrigued by the finding that circular permutation leaves most of the key catalytic residues unchanged, we also tested OYE permutants for possible additive or synergistic effects of amino acid substitutions. Distinct functional changes in these OYE variants were detected upon mutations at W116, known in native OYE1 to cause inversion of diastereoselectivity for (S)-carvone reduction. In conclusion, our findings demonstrate the contribution of loop β6 toward determining the stereoselectivity of OYE1, an important insight for future OYE engineering efforts.« less

Deciphering the Preference and Predicting the Viability of Circular Permutations in Proteins

PubMed Central

Liu, Yen-Yi; Wang, Li-Fen; Hwang, Jenn-Kang; Lyu, Ping-Chiang

2012-01-01

Circular permutation (CP) refers to situations in which the termini of a protein are relocated to other positions in the structure. CP occurs naturally and has been artificially created to study protein function, stability and folding. Recently CP is increasingly applied to engineer enzyme structure and function, and to create bifunctional fusion proteins unachievable by tandem fusion. CP is a complicated and expensive technique. An intrinsic difficulty in its application lies in the fact that not every position in a protein is amenable for creating a viable permutant. To examine the preferences of CP and develop CP viability prediction methods, we carried out comprehensive analyses of the sequence, structural, and dynamical properties of known CP sites using a variety of statistics and simulation methods, such as the bootstrap aggregating, permutation test and molecular dynamics simulations. CP particularly favors Gly, Pro, Asp and Asn. Positions preferred by CP lie within coils, loops, turns, and at residues that are exposed to solvent, weakly hydrogen-bonded, environmentally unpacked, or flexible. Disfavored positions include Cys, bulky hydrophobic residues, and residues located within helices or near the protein's core. These results fostered the development of an effective viable CP site prediction system, which combined four machine learning methods, e.g., artificial neural networks, the support vector machine, a random forest, and a hierarchical feature integration procedure developed in this work. As assessed by using the hydrofolate reductase dataset as the independent evaluation dataset, this prediction system achieved an AUC of 0.9. Large-scale predictions have been performed for nine thousand representative protein structures; several new potential applications of CP were thus identified. Many unreported preferences of CP are revealed in this study. The developed system is the best CP viability prediction method currently available. This work will facilitate the application of CP in research and biotechnology. PMID:22359629

Assessing Discriminative Performance at External Validation of Clinical Prediction Models

PubMed Central

Nieboer, Daan; van der Ploeg, Tjeerd; Steyerberg, Ewout W.

2016-01-01

Introduction External validation studies are essential to study the generalizability of prediction models. Recently a permutation test, focusing on discrimination as quantified by the c-statistic, was proposed to judge whether a prediction model is transportable to a new setting. We aimed to evaluate this test and compare it to previously proposed procedures to judge any changes in c-statistic from development to external validation setting. Methods We compared the use of the permutation test to the use of benchmark values of the c-statistic following from a previously proposed framework to judge transportability of a prediction model. In a simulation study we developed a prediction model with logistic regression on a development set and validated them in the validation set. We concentrated on two scenarios: 1) the case-mix was more heterogeneous and predictor effects were weaker in the validation set compared to the development set, and 2) the case-mix was less heterogeneous in the validation set and predictor effects were identical in the validation and development set. Furthermore we illustrated the methods in a case study using 15 datasets of patients suffering from traumatic brain injury. Results The permutation test indicated that the validation and development set were homogenous in scenario 1 (in almost all simulated samples) and heterogeneous in scenario 2 (in 17%-39% of simulated samples). Previously proposed benchmark values of the c-statistic and the standard deviation of the linear predictors correctly pointed at the more heterogeneous case-mix in scenario 1 and the less heterogeneous case-mix in scenario 2. Conclusion The recently proposed permutation test may provide misleading results when externally validating prediction models in the presence of case-mix differences between the development and validation population. To correctly interpret the c-statistic found at external validation it is crucial to disentangle case-mix differences from incorrect regression coefficients. PMID:26881753

Overcoming the effects of false positives and threshold bias in graph theoretical analyses of neuroimaging data.

PubMed

Drakesmith, M; Caeyenberghs, K; Dutt, A; Lewis, G; David, A S; Jones, D K

2015-09-01

Graph theory (GT) is a powerful framework for quantifying topological features of neuroimaging-derived functional and structural networks. However, false positive (FP) connections arise frequently and influence the inferred topology of networks. Thresholding is often used to overcome this problem, but an appropriate threshold often relies on a priori assumptions, which will alter inferred network topologies. Four common network metrics (global efficiency, mean clustering coefficient, mean betweenness and smallworldness) were tested using a model tractography dataset. It was found that all four network metrics were significantly affected even by just one FP. Results also show that thresholding effectively dampens the impact of FPs, but at the expense of adding significant bias to network metrics. In a larger number (n=248) of tractography datasets, statistics were computed across random group permutations for a range of thresholds, revealing that statistics for network metrics varied significantly more than for non-network metrics (i.e., number of streamlines and number of edges). Varying degrees of network atrophy were introduced artificially to half the datasets, to test sensitivity to genuine group differences. For some network metrics, this atrophy was detected as significant (p<0.05, determined using permutation testing) only across a limited range of thresholds. We propose a multi-threshold permutation correction (MTPC) method, based on the cluster-enhanced permutation correction approach, to identify sustained significant effects across clusters of thresholds. This approach minimises requirements to determine a single threshold a priori. We demonstrate improved sensitivity of MTPC-corrected metrics to genuine group effects compared to an existing approach and demonstrate the use of MTPC on a previously published network analysis of tractography data derived from a clinical population. In conclusion, we show that there are large biases and instability induced by thresholding, making statistical comparisons of network metrics difficult. However, by testing for effects across multiple thresholds using MTPC, true group differences can be robustly identified. Copyright © 2015. Published by Elsevier Inc.

On the rank-distance median of 3 permutations.

PubMed

Chindelevitch, Leonid; Pereira Zanetti, João Paulo; Meidanis, João

2018-05-08

Recently, Pereira Zanetti, Biller and Meidanis have proposed a new definition of a rearrangement distance between genomes. In this formulation, each genome is represented as a matrix, and the distance d is the rank distance between these matrices. Although defined in terms of matrices, the rank distance is equal to the minimum total weight of a series of weighted operations that leads from one genome to the other, including inversions, translocations, transpositions, and others. The computational complexity of the median-of-three problem according to this distance is currently unknown. The genome matrices are a special kind of permutation matrices, which we study in this paper. In their paper, the authors provide an [Formula: see text] algorithm for determining three candidate medians, prove the tight approximation ratio [Formula: see text], and provide a sufficient condition for their candidates to be true medians. They also conduct some experiments that suggest that their method is accurate on simulated and real data. In this paper, we extend their results and provide the following: Three invariants characterizing the problem of finding the median of 3 matrices A sufficient condition for uniqueness of medians that can be checked in O(n) A faster, [Formula: see text] algorithm for determining the median under this condition A new heuristic algorithm for this problem based on compressed sensing A [Formula: see text] algorithm that exactly solves the problem when the inputs are orthogonal matrices, a class that includes both permutations and genomes as special cases. Our work provides the first proof that, with respect to the rank distance, the problem of finding the median of 3 genomes, as well as the median of 3 permutations, is exactly solvable in polynomial time, a result which should be contrasted with its NP-hardness for the DCJ (double cut-and-join) distance and most other families of genome rearrangement operations. This result, backed by our experimental tests, indicates that the rank distance is a viable alternative to the DCJ distance widely used in genome comparisons.

Identification of IL-7 as a candidate disease mediator in osteoarthritis in Chinese Han population: a case-control study.

PubMed

Zhang, Hong-Xin; Wang, Yan-Gui; Lu, Shun-Yuan; Lu, Xiong-Xiong; Liu, Jie

2016-09-01

Little is known about the biochemical mediators IL-7 that correlate with the initiation and progression of OA. We performed this study to assess the role of variants of IL-7 in OA susceptibility in the Chinese Han population. We performed a retrospective, case-control study in the Chinese Han population from 2013 to 2015. Four single nucleotide polymorphisms were genotyped (using a ligase detection reaction) in 602 patients and 454 controls. Differences between groups were analysed, and association was assessed by the odds ratio (OR) and 95% CI. Among these polymorphisms, rs2583764, rs2583760 and rs6993386 showed no significant association with OA in the Chinese Han population {rs2583764 [P-allele = 0.98651, P-genotype = 0.40392, OR (95% CI): 1.00162 (0.83066, 1.20775)]; rs2583760 [P-allele = 0.384500, P-genotype = 0.58752, OR (95% CI): 0.69859 (0.30996, 1.57449)]; rs6993386 [P-allele = 0.69525, P-genotype = 0.50712, OR (95% CI): 0.96432 (0.80406, 1.15653)]}. However, the results showed that the rs2583759 polymorphism was significantly associated with OA [P-allele = 0.00 P-genotype = 3.86 × 10(-30), OR (95% CI): 0.27794 (0.22407, 0.34476)], even when the 10 000 times permutation was performed (P-allele-permutation < 0.00010, P-genotype-permutation = 0.00010). Haplotype analyses showed A-G-A-C, A-G-A-T and G-G-G-C of rs2583764-rs2583760-rs6993386-rs2583759 were risk factors for OA, both before or after the 10 000 times permutation, indicating IL-7 to be associated with OA. There was a significant association between IL-7, especially rs2583759, and OA in the Chinese Han population. © The Author 2016. Published by Oxford University Press on behalf of the British Society for Rheumatology. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Assessing Discriminative Performance at External Validation of Clinical Prediction Models.

PubMed

Nieboer, Daan; van der Ploeg, Tjeerd; Steyerberg, Ewout W

2016-01-01

External validation studies are essential to study the generalizability of prediction models. Recently a permutation test, focusing on discrimination as quantified by the c-statistic, was proposed to judge whether a prediction model is transportable to a new setting. We aimed to evaluate this test and compare it to previously proposed procedures to judge any changes in c-statistic from development to external validation setting. We compared the use of the permutation test to the use of benchmark values of the c-statistic following from a previously proposed framework to judge transportability of a prediction model. In a simulation study we developed a prediction model with logistic regression on a development set and validated them in the validation set. We concentrated on two scenarios: 1) the case-mix was more heterogeneous and predictor effects were weaker in the validation set compared to the development set, and 2) the case-mix was less heterogeneous in the validation set and predictor effects were identical in the validation and development set. Furthermore we illustrated the methods in a case study using 15 datasets of patients suffering from traumatic brain injury. The permutation test indicated that the validation and development set were homogenous in scenario 1 (in almost all simulated samples) and heterogeneous in scenario 2 (in 17%-39% of simulated samples). Previously proposed benchmark values of the c-statistic and the standard deviation of the linear predictors correctly pointed at the more heterogeneous case-mix in scenario 1 and the less heterogeneous case-mix in scenario 2. The recently proposed permutation test may provide misleading results when externally validating prediction models in the presence of case-mix differences between the development and validation population. To correctly interpret the c-statistic found at external validation it is crucial to disentangle case-mix differences from incorrect regression coefficients.

Cytokine–Ion Channel Interactions in Pulmonary Inflammation

PubMed Central

Hamacher, Jürg; Hadizamani, Yalda; Borgmann, Michèle; Mohaupt, Markus; Männel, Daniela Narcissa; Moehrlen, Ueli; Lucas, Rudolf; Stammberger, Uz

2018-01-01

The lungs conceptually represent a sponge that is interposed in series in the bodies’ systemic circulation to take up oxygen and eliminate carbon dioxide. As such, it matches the huge surface areas of the alveolar epithelium to the pulmonary blood capillaries. The lung’s constant exposure to the exterior necessitates a competent immune system, as evidenced by the association of clinical immunodeficiencies with pulmonary infections. From the in utero to the postnatal and adult situation, there is an inherent vital need to manage alveolar fluid reabsorption, be it postnatally, or in case of hydrostatic or permeability edema. Whereas a wealth of literature exists on the physiological basis of fluid and solute reabsorption by ion channels and water pores, only sparse knowledge is available so far on pathological situations, such as in microbial infection, acute lung injury or acute respiratory distress syndrome, and in the pulmonary reimplantation response in transplanted lungs. The aim of this review is to discuss alveolar liquid clearance in a selection of lung injury models, thereby especially focusing on cytokines and mediators that modulate ion channels. Inflammation is characterized by complex and probably time-dependent co-signaling, interactions between the involved cell types, as well as by cell demise and barrier dysfunction, which may not uniquely determine a clinical picture. This review, therefore, aims to give integrative thoughts and wants to foster the unraveling of unmet needs in future research. PMID:29354115

SVM-Based Spectral Analysis for Heart Rate from Multi-Channel WPPG Sensor Signals.

PubMed

Xiong, Jiping; Cai, Lisang; Wang, Fei; He, Xiaowei

2017-03-03

Although wrist-type photoplethysmographic (hereafter referred to as WPPG) sensor signals can measure heart rate quite conveniently, the subjects' hand movements can cause strong motion artifacts, and then the motion artifacts will heavily contaminate WPPG signals. Hence, it is challenging for us to accurately estimate heart rate from WPPG signals during intense physical activities. The WWPG method has attracted more attention thanks to the popularity of wrist-worn wearable devices. In this paper, a mixed approach called Mix-SVM is proposed, it can use multi-channel WPPG sensor signals and simultaneous acceleration signals to measurement heart rate. Firstly, we combine the principle component analysis and adaptive filter to remove a part of the motion artifacts. Due to the strong relativity between motion artifacts and acceleration signals, the further denoising problem is regarded as a sparse signals reconstruction problem. Then, we use a spectrum subtraction method to eliminate motion artifacts effectively. Finally, the spectral peak corresponding to heart rate is sought by an SVM-based spectral analysis method. Through the public PPG database in the 2015 IEEE Signal Processing Cup, we acquire the experimental results, i.e., the average absolute error was 1.01 beat per minute, and the Pearson correlation was 0.9972. These results also confirm that the proposed Mix-SVM approach has potential for multi-channel WPPG-based heart rate estimation in the presence of intense physical exercise.

Dual neutral particle induced transmutation in CINDER2008

NASA Astrophysics Data System (ADS)

Martin, W. J.; de Oliveira, C. R. E.; Hecht, A. A.

2014-12-01

Although nuclear transmutation methods for fission have existed for decades, the focus has been on neutron-induced reactions. Recent novel concepts have sought to use both neutrons and photons for purposes such as active interrogation of cargo to detect the smuggling of highly enriched uranium, a concept that would require modeling the transmutation caused by both incident particles. As photonuclear transmutation has yet to be modeled alongside neutron-induced transmutation in a production code, new methods need to be developed. The CINDER2008 nuclear transmutation code from Los Alamos National Laboratory is extended from neutron applications to dual neutral particle applications, allowing both neutron- and photon-induced reactions for this modeling with a focus on fission. Following standard reaction modeling, the induced fission reaction is understood as a two-part reaction, with an entrance channel to the excited compound nucleus, and an exit channel from the excited compound nucleus to the fission fragmentation. Because photofission yield data-the exit channel from the compound nucleus-are sparse, neutron fission yield data are used in this work. With a different compound nucleus and excitation, the translation to the excited compound state is modified, as appropriate. A verification and validation of these methods and data has been performed. This has shown that the translation of neutron-induced fission product yield sets, and their use in photonuclear applications, is appropriate, and that the code has been extended correctly.

Applications of remote sensing to stream discharge predictions

NASA Technical Reports Server (NTRS)

Krause, F. R.; Winn, C. B.

1972-01-01

A feasibility study has been initiated on the use of remote earth observations for augmenting stream discharge prediction for the design and/or operation of major reservoir systems, pumping systems and irrigation systems. The near-term objectives are the interpolation of sparsely instrumented precipitation surveillance networks and the direct measurement of water loss by evaporation. The first steps of the study covered a survey of existing reservoir systems, stream discharge prediction methods, gage networks and the development of a self-adaptive variation of the Kentucky Watershed model, SNOPSET, that includes snowmelt. As a result of these studies, a special three channel scanner is being built for a small aircraft, which should provide snow, temperature and water vapor maps for the spatial and temporal interpolation of stream gages.

Meandering channels without vegetation: Examples from Nevada and Chile

NASA Astrophysics Data System (ADS)

Matsubara, Y.; Howard, A. D.; Burr, D. M.; Williams, R. M.; Moore, J. M.

2012-12-01

We report on a study motivated by the occurrence of highly sinuous, actively migrating paleochannels on Mars. Highly sinuous, unconfined meanders require small aspect ratios, which in turn require cohesive channel banks. This cohesion is obtained most commonly by vegetation cover coupled with high suspended sediment loading. The dominant role of vegetation in meandering is reflected in the difficulty in creating highly sinuous channels in flume experiment without introduction of vegetation. The occurrence of strongly meandering channels on Mars suggests meanders can develop in the absence of vegetation. The main objective of our study is to understand the processes of meander evolution in non-vegetated surfaces. We have studied two terrestrial sites in which meandering channels form where vegetation is sparse and has little influence on bank erodibility or point-bar deposition, indicating that there must be other mechanisms creating bank cohesion. One mechanism is stabilization of point-bar deposits by mud drapes. The Quinn River in Nevada is a sinuous channel that flows through fine lacustrine sediments on the floor of paleolake Lahontan resulting in the river having both bed and bank composed of sediment containing least 40% silt/clay. In addition to abundant mud, high salt content of the river water encourages flocculation and settling of fine sediment; thus both high clay/silt content and salt work together at the Quinn River to maintain a small aspect ratio. In contrast to the Quinn River, meandering channels on alluvial fans in the Atacama Desert in northern Chile are deposited by flows originating from the foothills of the Andes Mountains where sediments are coarser and more variable in size. Like Quinn River both fine sediments and salts contribute to meandering. The bank cohesion is provided by mudflows or hyperconcentrated flows creating bank drapes as well as extensive overbank levees which harden to adobe-like consistency. The Atacama Desert is rich in precipitated salts forming salt crusted deposits, and because grains are coarser, we speculate that these salts may possibly be playing a much more direct role in providing the cohesion than they do in the Quinn River. We are using chemical analyses and Scanning Electron Microscope (SEM) images of sediment samples to investigate cementation mechanisms.

Global Analysis of River Planform Change using the Google Earth Engine

NASA Astrophysics Data System (ADS)

Bryk, A.; Dietrich, W. E.; Gorelick, N.; Sargent, R.; Braudrick, C. A.

2014-12-01

Geomorphologists have historically tracked river dynamics using a combination of maps, aerial photographs, and the stratigraphic record. Although stratigraphic records can extend into deep time, maps and aerial photographs often confine our record of change to sparse measurements over the last ~80 years and in some cases much less time. For the first time Google's Earth Engine (GEE) cloud based platform allows researchers the means to analyze quantitatively the pattern and pace of river channel change over the last 30 years with high temporal resolution across the entire planet. The GEE provides an application programing interface (API) that enables quantitative analysis of various data sets including the entire Landsat L1T archive. This allows change detection for channels wider than about 150 m over 30 years of successive, georeferenced imagery. Qualitatively, it becomes immediately evident that the pace of channel morphodynamics for similar planforms varies by orders of magnitude across the planet and downstream along individual rivers. To quantify these rates of change and to explore their controls we have developed methods for differentiating channels from floodplain along large alluvial rivers. We introduce a new metric of morphodynamics: the ratio of eroded area to channel area per unit time, referred to as "M". We also keep track of depositional areas resulting from channel shifting. To date our quantitative analysis has focused on rivers in the Andean foreland. Our analysis shows channel bank erosion rates, M, varies by orders of magnitude for these rivers, from 0 to ~0.25 yr-1, yet these rivers have essentially identical curvature and sinuosity and are visually indistinguishable. By tracking both bank paths in time, we find that, for some meandering rivers, a significant fraction of new floodplain is produced through outer-bank accretion rather than point bar deposition. This process is perhaps more important in generating floodplain stratigraphy than previously recognized. These initial findings indicate a new set of quantitative observations will emerge to further test and advance morphodynamic theory. The Google Earth Engine offers the opportunity to explore river morphodynamics on an unprecedented scale and provides a powerful tool for addressing fundamental questions in river morphodynamics.

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

Orlenko, E. V., E-mail: eorlenko@mail.ru; Evstafev, A. V.; Orlenko, F. E.

A formalism of exchange perturbation theory (EPT) is developed for the case of interactions that explicitly depend on time. Corrections to the wave function obtained in any order of perturbation theory and represented in an invariant form include exchange contributions due to intercenter electron permutations in complex multicenter systems. For collisions of atomic systems with an arbitrary type of interaction, general expressions are obtained for the transfer (T) and scattering (S) matrices in which intercenter electron permutations between overlapping nonorthogonal states belonging to different centers (atoms) are consistently taken into account. The problem of collision of alpha particles with lithiummore » atoms accompanied by the redistribution of electrons between centers is considered. The differential and total charge-exchange cross sections of lithium are calculated.« less

Security Analysis of Some Diffusion Mechanisms Used in Chaotic Ciphers

NASA Astrophysics Data System (ADS)

Zhang, Leo Yu; Zhang, Yushu; Liu, Yuansheng; Yang, Anjia; Chen, Guanrong

As a variant of the substitution-permutation network, the permutation-diffusion structure has received extensive attention in the field of chaotic cryptography over the last three decades. Because of the high implementation speed and nonlinearity over GF(2), the Galois field of two elements, mixing modulo addition/multiplication and Exclusive OR becomes very popular in various designs to achieve the desired diffusion effect. This paper reports that some diffusion mechanisms based on modulo addition/multiplication and Exclusive OR are not resistant to plaintext attacks as claimed. By cracking several recently proposed chaotic ciphers as examples, it is demonstrated that a good understanding of the strength and weakness of these crypto-primitives is crucial for designing more practical chaotic encryption algorithms in the future.

Optimal recombination in genetic algorithms for flowshop scheduling problems

NASA Astrophysics Data System (ADS)

Kovalenko, Julia

2016-10-01

The optimal recombination problem consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We prove NP-hardness of the optimal recombination for various variants of the flowshop scheduling problem with makespan criterion and criterion of maximum lateness. An algorithm for solving the optimal recombination problem for permutation flowshop problems is built, using enumeration of prefect matchings in a special bipartite graph. The algorithm is adopted for the classical flowshop scheduling problem and for the no-wait flowshop problem. It is shown that the optimal recombination problem for the permutation flowshop scheduling problem is solvable in polynomial time for almost all pairs of parent solutions as the number of jobs tends to infinity.

Zero-point Energy is Needed in Molecular Dynamics Calculations to Access the Saddle Point for H+HCN→H2CN* and cis/trans-HCNH* on a New Potential Energy Surface.

PubMed

Wang, Xiaohong; Bowman, Joel M

2013-02-12

We calculate the probabilities for the association reactions H+HCN→H2CN* and cis/trans-HCNH*, using quasiclassical trajectory (QCT) and classical trajectory (CT) calculations, on a new global ab initio potential energy surface (PES) for H2CN including the reaction channels. The surface is a linear least-squares fit of roughly 60 000 CCSD(T)-F12b/aug-cc-pVDZ electronic energies, using a permutationally invariant basis with Morse-type variables. The reaction probabilities are obtained at a variety of collision energies and impact parameters. Large differences in the threshold energies in the two types of dynamics calculations are traced to the absence of zero-point energy in the CT calculations. We argue that the QCT threshold energy is the realistic one. In addition, trajectories find a direct pathway to trans-HCNH, even though there is no obvious transition state (TS) for this pathway. Instead the saddle point (SP) for the addition to cis-HCNH is evidently also the TS for direct formation of trans-HCNH.

Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform

NASA Astrophysics Data System (ADS)

Lee, Moon Ho; Khan, Md Hashem Ali; Kim, Kyeong Jin

2013-12-01

Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to the identity matrix. Therefore, we mathematically propose a fast block-wise inverse Jacket transform of orders N = 2 k , 3 k , 5 k , and 6 k , where k is a positive integer. Based on the Kronecker product of the successive lower order Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse and fast algorithms of Arikan polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are obtained from BIJTs, they can be applied in areas such as 3GPP physical layer for ultra mobile broadband permutation matrices design, first-order q-ary Reed-Muller code design, diagonal channel design, diagonal subchannel decompose for interference alignment, and 4G MIMO long-term evolution Alamouti precoding design.

Sparse Matrices in MATLAB: Design and Implementation

NASA Technical Reports Server (NTRS)

Gilbert, John R.; Moler, Cleve; Schreiber, Robert

1992-01-01

The matrix computation language and environment MATLAB is extended to include sparse matrix storage and operations. The only change to the outward appearance of the MATLAB language is a pair of commands to create full or sparse matrices. Nearly all the operations of MATLAB now apply equally to full or sparse matrices, without any explicit action by the user. The sparse data structure represents a matrix in space proportional to the number of nonzero entries, and most of the operations compute sparse results in time proportional to the number of arithmetic operations on nonzeros.

Storage of sparse files using parallel log-structured file system

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

Bent, John M.; Faibish, Sorin; Grider, Gary

A sparse file is stored without holes by storing a data portion of the sparse file using a parallel log-structured file system; and generating an index entry for the data portion, the index entry comprising a logical offset, physical offset and length of the data portion. The holes can be restored to the sparse file upon a reading of the sparse file. The data portion can be stored at a logical end of the sparse file. Additional storage efficiency can optionally be achieved by (i) detecting a write pattern for a plurality of the data portions and generating a singlemore » patterned index entry for the plurality of the patterned data portions; and/or (ii) storing the patterned index entries for a plurality of the sparse files in a single directory, wherein each entry in the single directory comprises an identifier of a corresponding sparse file.« less

Learning Sparse Feature Representations using Probabilistic Quadtrees and Deep Belief Nets

DTIC Science & Technology

2015-04-24

Feature Representations usingProbabilistic Quadtrees and Deep Belief Nets Learning sparse feature representations is a useful instru- ment for solving an...novel framework for the classifi cation of handwritten digits that learns sparse representations using probabilistic quadtrees and Deep Belief Nets... Learning Sparse Feature Representations usingProbabilistic Quadtrees and Deep Belief Nets Report Title Learning sparse feature representations is a useful

User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver). Version 1.

NASA Technical Reports Server (NTRS)

Reddy, C. J.

2000-01-01

PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.

Atypical nucleus accumbens morphology in psychopathy: another limbic piece in the puzzle.

PubMed

Boccardi, Marina; Bocchetta, Martina; Aronen, Hannu J; Repo-Tiihonen, Eila; Vaurio, Olli; Thompson, Paul M; Tiihonen, Jari; Frisoni, Giovanni B

2013-01-01

Psychopathy has been associated with increased putamen and striatum volumes. The nucleus accumbens - a key structure in reversal learning, less effective in psychopathy - has not yet received specific attention. Moreover, basal ganglia morphology has never been explored. We examined the morphology of the caudate, putamen and accumbens, manually segmented from magnetic resonance images of 26 offenders (age: 32.5 ± 8.4) with medium-high psychopathy (mean PCL-R=30 ± 5) and 25 healthy controls (age: 34.6 ± 10.8). Local differences were statistically modeled using a surface-based radial distance mapping method (p<0.05; multiple comparisons correction through permutation tests). In psychopathy, the caudate and putamen had normal global volume, but different morphology, significant after correction for multiple comparisons, for the right dorsal putamen (permutation test: p=0.02). The volume of the nucleus accumbens was 13% smaller in psychopathy (p corrected for multiple comparisons <0.006). The atypical morphology consisted of predominant anterior hypotrophy bilaterally (10-30%). Caudate and putamen local morphology displayed negative correlation with the lifestyle factor of the PCL-R (permutation test: p=0.05 and 0.03). From these data, psychopathy appears to be associated with an atypical striatal morphology, with highly significant global and local differences of the accumbens. This is consistent with the clinical syndrome and with theories of limbic involvement. Copyright © 2013 Elsevier Ltd. All rights reserved.

Multiscale permutation entropy analysis of laser beam wandering in isotropic turbulence.

PubMed

Olivares, Felipe; Zunino, Luciano; Gulich, Damián; Pérez, Darío G; Rosso, Osvaldo A

2017-10-01

We have experimentally quantified the temporal structural diversity from the coordinate fluctuations of a laser beam propagating through isotropic optical turbulence. The main focus here is on the characterization of the long-range correlations in the wandering of a thin Gaussian laser beam over a screen after propagating through a turbulent medium. To fulfill this goal, a laboratory-controlled experiment was conducted in which coordinate fluctuations of the laser beam were recorded at a sufficiently high sampling rate for a wide range of turbulent conditions. Horizontal and vertical displacements of the laser beam centroid were subsequently analyzed by implementing the symbolic technique based on ordinal patterns to estimate the well-known permutation entropy. We show that the permutation entropy estimations at multiple time scales evidence an interplay between different dynamical behaviors. More specifically, a crossover between two different scaling regimes is observed. We confirm a transition from an integrated stochastic process contaminated with electronic noise to a fractional Brownian motion with a Hurst exponent H=5/6 as the sampling time increases. Besides, we are able to quantify, from the estimated entropy, the amount of electronic noise as a function of the turbulence strength. We have also demonstrated that these experimental observations are in very good agreement with numerical simulations of noisy fractional Brownian motions with a well-defined crossover between two different scaling regimes.

A secure transmission scheme of streaming media based on the encrypted control message

NASA Astrophysics Data System (ADS)

Li, Bing; Jin, Zhigang; Shu, Yantai; Yu, Li

2007-09-01

As the use of streaming media applications increased dramatically in recent years, streaming media security becomes an important presumption, protecting the privacy. This paper proposes a new encryption scheme in view of characteristics of streaming media and the disadvantage of the living method: encrypt the control message in the streaming media with the high security lever and permute and confuse the data which is non control message according to the corresponding control message. Here the so-called control message refers to the key data of the streaming media, including the streaming media header and the header of the video frame, and the seed key. We encrypt the control message using the public key encryption algorithm which can provide high security lever, such as RSA. At the same time we make use of the seed key to generate key stream, from which the permutation list P responding to GOP (group of picture) is derived. The plain text of the non-control message XORs the key stream and gets the middle cipher text. And then obtained one is permutated according to P. In contrast the decryption process is the inverse process of the above. We have set up a testbed for the above scheme and found our scheme is six to eight times faster than the conventional method. It can be applied not only between PCs but also between handheld devices.

Fecal Microbiota Characteristics of Patients with Colorectal Adenoma Detected by Screening: A Population-based Study

PubMed Central

Goedert, James J.; Gong, Yangming; Hua, Xing; Zhong, Huanzi; He, Yimin; Peng, Peng; Yu, Guoqin; Wang, Wenjing; Ravel, Jacques; Shi, Jianxin; Zheng, Ying

2015-01-01

Background Screening for colorectal cancer (CRC) and precancerous colorectal adenoma (CRA) can detect curable disease. However, participation in colonoscopy and sensitivity of fecal heme for CRA are low. Methods Microbiota metrics were determined by Illumina sequencing of 16S rRNA genes amplified from DNA extracted from feces self-collected in RNAlater. Among fecal immunochemical test-positive (FIT +) participants, colonoscopically-defined normal versus CRA patients were compared by regression, permutation, and random forest plus leave-one-out methods. Findings Of 95 FIT + participants, 61 had successful fecal microbiota profiling and colonoscopy, identifying 24 completely normal patients, 20 CRA patients, 2 CRC patients, and 15 with other conditions. Phylum-level fecal community composition differed significantly between CRA and normal patients (permutation P = 0.02). Rank phylum-level abundance distinguished CRA from normal patients (area under the curve = 0.767, permutation P = 0.006). CRA prevalence was 59% in phylum-level cluster B versus 20% in cluster A (exact P = 0.01). Most of the difference reflected 3-fold higher median relative abundance of Proteobacteria taxa (Wilcoxon signed-rank P = 0.03, positive predictive value = 67%). Antibiotic exposure and other potential confounders did not affect the associations. Interpretation If confirmed in larger, more diverse populations, fecal microbiota analysis might be employed to improve screening for CRA and ultimately to reduce mortality from CRC. PMID:26288821

Effectiveness of qPCR permutations, internal controls and dilution as means for minimizing the impact of inhibition while measuring Enterococcus in environmental waters.

PubMed

Cao, Y; Griffith, J F; Dorevitch, S; Weisberg, S B

2012-07-01

  Draft criteria for the optional use of qPCR for recreational water quality monitoring have been published in the United States. One concern is that inhibition of the qPCR assay can lead to false-negative results and potentially inadequate public health protection. We evaluate the effectiveness of strategies for minimizing the impact of inhibition.   Five qPCR method permutations for measuring Enterococcus were challenged with 133 potentially inhibitory fresh and marine water samples. Serial dilutions were conducted to assess Enterococcus target assay inhibition, to which inhibition identified using four internal controls (IC) was compared. The frequency and magnitude of inhibition varied considerably among qPCR methods, with the permutation using an environmental master mix performing substantially better. Fivefold dilution was also effective at reducing inhibition in most samples (>78%). ICs were variable and somewhat ineffective, with 54-85% agreement between ICs and serial dilution.   The current IC methods appear to not accurately predict Enterococcus inhibition and should be used with caution; fivefold dilution and the use of reagents designed for environmental sample analysis (i.e. more robust qPCR chemistry) may be preferable.   Suitable approaches for defining, detecting and reducing inhibition will improve implementation of qPCR for water monitoring. © 2012 The Authors. Journal of Applied Microbiology © 2012 The Society for Applied Microbiology.

2-D Ultrasound Sparse Arrays Multidepth Radiation Optimization Using Simulated Annealing and Spiral-Array Inspired Energy Functions.

PubMed

Roux, Emmanuel; Ramalli, Alessandro; Tortoli, Piero; Cachard, Christian; Robini, Marc C; Liebgott, Herve

2016-12-01

Full matrix arrays are excellent tools for 3-D ultrasound imaging, but the required number of active elements is too high to be individually controlled by an equal number of scanner channels. The number of active elements is significantly reduced by the sparse array techniques, but the position of the remaining elements must be carefully optimized. This issue is faced here by introducing novel energy functions in the simulated annealing (SA) algorithm. At each iteration step of the optimization process, one element is freely translated and the associated radiated pattern is simulated. To control the pressure field behavior at multiple depths, three energy functions inspired by the pressure field radiated by a Blackman-tapered spiral array are introduced. Such energy functions aim at limiting the main lobe width while lowering the side lobe and grating lobe levels at multiple depths. Numerical optimization results illustrate the influence of the number of iterations, pressure measurement points, and depths, as well as the influence of the energy function definition on the optimized layout. It is also shown that performance close to or even better than the one provided by a spiral array, here assumed as reference, may be obtained. The finite-time convergence properties of SA allow the duration of the optimization process to be set in advance.

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

Suggestive evidence for association between L-type voltage-gated calcium channel (CACNA1C) gene haplotypes and bipolar disorder in Latinos: a family-based association study

PubMed Central

Gonzalez, Suzanne; Xu, Chun; Ramirez, Mercedes; Zavala, Juan; Armas, Regina; Contreras, Salvador A; Contreras, Javier; Dassori, Albana; Leach, Robin J; Flores, Deborah; Jerez, Alvaro; Raventós, Henriette; Ontiveros, Alfonso; Nicolini, Humberto; Escamilla, Michael

2013-01-01

Objectives Through recent genome-wide association studies (GWAS), several groups have reported significant association between variants in the alpha 1C subunit of the L-type voltage-gated calcium channel (CACNA1C) and bipolar disorder (BP) in European and European-American cohorts. We performed a family-based association study to determine whether CACNA1C is associated with BP in the Latino population. Methods This study consisted of 913 individuals from 215 Latino pedigrees recruited from the United States, Mexico, Guatemala, and Costa Rica. The Illumina GoldenGate Genotyping Assay was used to genotype 58 single-nucleotide polymorphisms (SNPs) that spanned a 602.9 kb region encompassing the CACNA1C gene including two SNPs (rs7297582 and rs1006737) previously shown to associate with BP. Individual SNP and haplotype association analyses were performed using Family-Based Association Test (version 2.0.3) and Haploview (version 4.2) software. Results An eight-locus haplotype block that included these two markers showed significant association with BP (global marker permuted p = 0.0018) in the Latino population. For individual SNPs, this sample had insufficient power (10%) to detect associations with SNPs with minor effect (odds ratio = 1.15). Conclusions Although we were not able to replicate findings of association between individual CACNA1C SNPs rs7297582 and rs1006737 and BP, we were able to replicate the GWAS signal reported for CACNA1C through a haplotype analysis that encompassed these previously reported significant SNPs. These results provide additional evidence that CACNA1C is associated with BP and provides the first evidence that variations in this gene might play a role in the pathogenesis of this disorder in the Latino population. PMID:23437964

Mapping of electrophysiological response to transcranial infrared laser stimulation on the human brain in vivo measured by electroencephalography (Conference Presentation)

NASA Astrophysics Data System (ADS)

Wang, Xinlong; Reddy, Divya Dhandapani; Gonzalez-Lima, F.; Liu, Hanli

2017-02-01

Transcranial infrared laser stimulation (TILS) is a non-destructive and non-thermal photobiomodulation therapy or process on the human brain; TILS uses infrared light from lasers or LEDs and has gained increased recognition for its beneficial effects on a variety of neurological and psychological conditions. While the mechanism of TILS has been assumed to stem from cytochrome-c-oxidase (CCO), which is the last enzyme in the electron transportation chain and is the primary photoacceptor, no literature is found to report electrophysiological response to TILS. In this study, a 64-channel electroencephalography (EEG) system was employed to monitor electrophysiological activities from 15 healthy human participants before, during and after TILS. A placebo experimental protocol was also applied for rigorous comparison. After recording a 3-minute baseline, we applied a 1064-nm laser with a power of 3.5W on the right forehead of each human participant for 8 minutes, followed by a 5-minute recovery period. In 64-channel EEG data analysis, we utilized several methods (root mean square, principal component analysis followed by independent component analysis, permutation conditional mutual information, and time-frequency wavelet analysis) to reveal differences in electrophysiological response to TILS between the stimulated versus placebo group. The analyzed results were further investigated using general linear model and paired t-test to reveal statistically meaningful responses induced by TILS. Moreover, this study will provide spatial mapping of human electrophysiological and possibly neural network responses to TILS for first time, indicating the potential of EEG to be an effective method for monitoring neurological improvement induced by TILS.

Local structure preserving sparse coding for infrared target recognition

PubMed Central

Han, Jing; Yue, Jiang; Zhang, Yi; Bai, Lianfa

2017-01-01

Sparse coding performs well in image classification. However, robust target recognition requires a lot of comprehensive template images and the sparse learning process is complex. We incorporate sparsity into a template matching concept to construct a local sparse structure matching (LSSM) model for general infrared target recognition. A local structure preserving sparse coding (LSPSc) formulation is proposed to simultaneously preserve the local sparse and structural information of objects. By adding a spatial local structure constraint into the classical sparse coding algorithm, LSPSc can improve the stability of sparse representation for targets and inhibit background interference in infrared images. Furthermore, a kernel LSPSc (K-LSPSc) formulation is proposed, which extends LSPSc to the kernel space to weaken the influence of the linear structure constraint in nonlinear natural data. Because of the anti-interference and fault-tolerant capabilities, both LSPSc- and K-LSPSc-based LSSM can implement target identification based on a simple template set, which just needs several images containing enough local sparse structures to learn a sufficient sparse structure dictionary of a target class. Specifically, this LSSM approach has stable performance in the target detection with scene, shape and occlusions variations. High performance is demonstrated on several datasets, indicating robust infrared target recognition in diverse environments and imaging conditions. PMID:28323824

A CBLT and MCST capable VME slave interface

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

Wuerthwein, F.; Strohman, C.; Honscheid, K.

1996-12-31

We report on the development of a VME slave interface for the CLEO III detector implemented in an ALTERA EPM7256 CPLD. This includes the first implementation of the chained block transfer protocol (CBLT) and multi-cast cycles (MCST) as defined by the VME-P task group of VIPA. Within VME64 there is no operation that guarantees efficient readout of large blocks of data that are sparsely distributed among a series of slave modules in a VME crate. This has led the VME-P task group of VIPA to specify protocols that enable a master to address many slaves at a single address. Whichmore » slave is to drive the data bus is determined by a token passing mechanism that uses the *IACKOUT, *IACKIN daisy chain. This protocol requires no special features from the master besides conformance to VME64. Non-standard features are restricted to the VME slave interface. The CLEO III detector comprises {approximately}400,000 electronic channels that have to be digitized, sparsified, and stored within 20{mu}s in order to incur less than 2% dead time at an anticipated trigger rate of 1000Hz. 95% of these channels are accounted for by only two detector subsystems, the silicon microstrip detector (125,000 channels), and the ring imaging Cerenkov detector (RICH) (230,400 channels). After sparsification either of these two detector subsystems is expected to provide event fragments on the order of 10KBytes, spread over 4, and 8 VME crates, respectively. We developed a chip set that sparsifies, tags, and stores the incoming digital data on the data boards, and includes a VME slave interface that implements MCST and CUT protocols. In this poster, we briefly describe this chip set and then discuss the VME slave interface in detail.« less

From viscous fingers to wormholes - interactions between structures emerging in unstable growth

NASA Astrophysics Data System (ADS)

Budek, Agnieszka; Kwiatkowski, Kamil; Szymczak, Piotr

2017-04-01

Dissolution of porous and fractured rock can lead to instabilities, where long finger-like channels or „wormholes" are spontaneously formed, focusing the majority of the flow. Formation of those structures leads to a significant increase in permeability of the system, and is thus important in many engineering applications, e.g. in acidization during oil and gas recovery stimulation. In this communication, we analyse this process using two different numerical models (a network model and a Darcy scale one). We show that wormhole patterns depend strongly on the amount of soluble material in the system, as quantified by the permeability contrast κ between the dissolved and undissolved medium. For small and intermediate values of κ, a large number of relatively thin and strongly interacting channels are formed. The longer channels attract shorter ones, with loops being formed as a result. However, for large values of κ the pattern gets sparse with individual wormholes repelling each other. Interestingly, a similar succession of patterns can be observed in viscous fingering in a rectangular network of channels. In such a system, anisotropy of the network promotes the growth of long and thin fingers which behave similarly to wormholes. The attraction rate between growing fingers depends strongly on the viscosity ratio, I. The latter plays a role similar to that of permeability ratio for dissolution of porous material. To explain this behaviour, we have created a simple analytical model of interacting fingers, allowing us to quantify their mutual interaction as a function of finger lengths, distances between them and - most importantly - relative permeabilities. The theoretical predictions are in a good agreement with simulation data for both dissolution and viscous fingering processes.

A Framework of Temporal-Spatial Descriptors-Based Feature Extraction for Improved Myoelectric Pattern Recognition.

PubMed

Khushaba, Rami N; Al-Timemy, Ali H; Al-Ani, Ahmed; Al-Jumaily, Adel

2017-10-01

The extraction of the accurate and efficient descriptors of muscular activity plays an important role in tackling the challenging problem of myoelectric control of powered prostheses. In this paper, we present a new feature extraction framework that aims to give an enhanced representation of muscular activities through increasing the amount of information that can be extracted from individual and combined electromyogram (EMG) channels. We propose to use time-domain descriptors (TDDs) in estimating the EMG signal power spectrum characteristics; a step that preserves the computational power required for the construction of spectral features. Subsequently, TDD is used in a process that involves: 1) representing the temporal evolution of the EMG signals by progressively tracking the correlation between the TDD extracted from each analysis time window and a nonlinearly mapped version of it across the same EMG channel and 2) representing the spatial coherence between the different EMG channels, which is achieved by calculating the correlation between the TDD extracted from the differences of all possible combinations of pairs of channels and their nonlinearly mapped versions. The proposed temporal-spatial descriptors (TSDs) are validated on multiple sparse and high-density (HD) EMG data sets collected from a number of intact-limbed and amputees performing a large number of hand and finger movements. Classification results showed significant reductions in the achieved error rates in comparison to other methods, with the improvement of at least 8% on average across all subjects. Additionally, the proposed TSDs achieved significantly well in problems with HD-EMG with average classification errors of <5% across all subjects using windows lengths of 50 ms only.

The Use of Sparse Direct Solver in Vector Finite Element Modeling for Calculating Two Dimensional (2-D) Magnetotelluric Responses in Transverse Electric (TE) Mode

NASA Astrophysics Data System (ADS)

Yihaa Roodhiyah, Lisa’; Tjong, Tiffany; Nurhasan; Sutarno, D.

2018-04-01

The late research, linear matrices of vector finite element in two dimensional(2-D) magnetotelluric (MT) responses modeling was solved by non-sparse direct solver in TE mode. Nevertheless, there is some weakness which have to be improved especially accuracy in the low frequency (10-3 Hz-10-5 Hz) which is not achieved yet and high cost computation in dense mesh. In this work, the solver which is used is sparse direct solver instead of non-sparse direct solverto overcome the weaknesses of solving linear matrices of vector finite element metod using non-sparse direct solver. Sparse direct solver will be advantageous in solving linear matrices of vector finite element method because of the matrix properties which is symmetrical and sparse. The validation of sparse direct solver in solving linear matrices of vector finite element has been done for a homogen half-space model and vertical contact model by analytical solution. Thevalidation result of sparse direct solver in solving linear matrices of vector finite element shows that sparse direct solver is more stable than non-sparse direct solver in computing linear problem of vector finite element method especially in low frequency. In the end, the accuracy of 2D MT responses modelling in low frequency (10-3 Hz-10-5 Hz) has been reached out under the efficient allocation memory of array and less computational time consuming.

Permutation entropy analysis of financial time series based on Hill's diversity number

NASA Astrophysics Data System (ADS)

Zhang, Yali; Shang, Pengjian

2017-12-01

In this paper the permutation entropy based on Hill's diversity number (Nn,r) is introduced as a new way to assess the complexity of a complex dynamical system such as stock market. We test the performance of this method with simulated data. Results show that Nn,r with appropriate parameters is more sensitive to the change of system and describes the trends of complex systems clearly. In addition, we research the stock closing price series from different data that consist of six indices: three US stock indices and three Chinese stock indices during different periods, Nn,r can quantify the changes of complexity for stock market data. Moreover, we get richer information from Nn,r, and obtain some properties about the differences between the US and Chinese stock indices.

Adinkra (in)equivalence from Coxeter group representations: A case study

NASA Astrophysics Data System (ADS)

Chappell, Isaac; Gates, S. James; Hübsch, T.

2014-02-01

Using a MathematicaTM code, we present a straightforward numerical analysis of the 384-dimensional solution space of signed permutation 4×4 matrices, which in sets of four, provide representations of the 𝒢ℛ(4, 4) algebra, closely related to the 𝒩 = 1 (simple) supersymmetry algebra in four-dimensional space-time. Following after ideas discussed in previous papers about automorphisms and classification of adinkras and corresponding supermultiplets, we make a new and alternative proposal to use equivalence classes of the (unsigned) permutation group S4 to define distinct representations of higher-dimensional spin bundles within the context of adinkras. For this purpose, the definition of a dual operator akin to the well-known Hodge star is found to partition the space of these 𝒢ℛ(4, 4) representations into three suggestive classes.

Tag-KEM from Set Partial Domain One-Way Permutations

NASA Astrophysics Data System (ADS)

Abe, Masayuki; Cui, Yang; Imai, Hideki; Kurosawa, Kaoru

Recently a framework called Tag-KEM/DEM was introduced to construct efficient hybrid encryption schemes. Although it is known that generic encode-then-encrypt construction of chosen ciphertext secure public-key encryption also applies to secure Tag-KEM construction and some known encoding method like OAEP can be used for this purpose, it is worth pursuing more efficient encoding method dedicated for Tag-KEM construction. This paper proposes an encoding method that yields efficient Tag-KEM schemes when combined with set partial one-way permutations such as RSA and Rabin's encryption scheme. To our knowledge, this leads to the most practical hybrid encryption scheme of this type. We also present an efficient Tag-KEM which is CCA-secure under general factoring assumption rather than Blum factoring assumption.

An Off-Grid Turbo Channel Estimation Algorithm for Millimeter Wave Communications.

PubMed

Han, Lingyi; Peng, Yuexing; Wang, Peng; Li, Yonghui

2016-09-22

The bandwidth shortage has motivated the exploration of the millimeter wave (mmWave) frequency spectrum for future communication networks. To compensate for the severe propagation attenuation in the mmWave band, massive antenna arrays can be adopted at both the transmitter and receiver to provide large array gains via directional beamforming. To achieve such array gains, channel estimation (CE) with high resolution and low latency is of great importance for mmWave communications. However, classic super-resolution subspace CE methods such as multiple signal classification (MUSIC) and estimation of signal parameters via rotation invariant technique (ESPRIT) cannot be applied here due to RF chain constraints. In this paper, an enhanced CE algorithm is developed for the off-grid problem when quantizing the angles of mmWave channel in the spatial domain where off-grid problem refers to the scenario that angles do not lie on the quantization grids with high probability, and it results in power leakage and severe reduction of the CE performance. A new model is first proposed to formulate the off-grid problem. The new model divides the continuously-distributed angle into a quantized discrete grid part, referred to as the integral grid angle, and an offset part, termed fractional off-grid angle. Accordingly, an iterative off-grid turbo CE (IOTCE) algorithm is proposed to renew and upgrade the CE between the integral grid part and the fractional off-grid part under the Turbo principle. By fully exploiting the sparse structure of mmWave channels, the integral grid part is estimated by a soft-decoding based compressed sensing (CS) method called improved turbo compressed channel sensing (ITCCS). It iteratively updates the soft information between the linear minimum mean square error (LMMSE) estimator and the sparsity combiner. Monte Carlo simulations are presented to evaluate the performance of the proposed method, and the results show that it enhances the angle detection resolution greatly.

Sparse Reconstruction Techniques in MRI: Methods, Applications, and Challenges to Clinical Adoption

PubMed Central

Yang, Alice Chieh-Yu; Kretzler, Madison; Sudarski, Sonja; Gulani, Vikas; Seiberlich, Nicole

2016-01-01

The family of sparse reconstruction techniques, including the recently introduced compressed sensing framework, has been extensively explored to reduce scan times in Magnetic Resonance Imaging (MRI). While there are many different methods that fall under the general umbrella of sparse reconstructions, they all rely on the idea that a priori information about the sparsity of MR images can be employed to reconstruct full images from undersampled data. This review describes the basic ideas behind sparse reconstruction techniques, how they could be applied to improve MR imaging, and the open challenges to their general adoption in a clinical setting. The fundamental principles underlying different classes of sparse reconstructions techniques are examined, and the requirements that each make on the undersampled data outlined. Applications that could potentially benefit from the accelerations that sparse reconstructions could provide are described, and clinical studies using sparse reconstructions reviewed. Lastly, technical and clinical challenges to widespread implementation of sparse reconstruction techniques, including optimization, reconstruction times, artifact appearance, and comparison with current gold-standards, are discussed. PMID:27003227

Streamflow Prediction in Ungauged, Irrigated Basins

NASA Astrophysics Data System (ADS)

Zhang, M.; Thompson, S. E.

2016-12-01

The international "predictions in ungauged basins" or "PUB" effort has broadened and improved the tools available to support water resources management in sparsely observed regions. These tools have, however, been primarily focused on regions with limited diversion of surface or shallow groundwater resources. Incorporating anthropogenic activity into PUB methods is essential given the high level of development of many basins. We extended an existing stochastic framework used to predict the flow duration curve to explore the effects of irrigation on streamflow dynamics. Four canonical scenarios were considered in which irrigation water was (i) primarily sourced from water imports, (ii) primarily sourced from direct in-channel diversions, (iii) sourced from shallow groundwater with direct connectivity to stream channels, or (iv) sourced from deep groundwater that is indirectly connected to surface flow via a shallow aquifer. By comparing the predicted flow duration curves to those predicted by accounting for climate and geomorphic factors in isolation, specific "fingerprints" of human water withdrawals could be identified for the different irrigation scenarios, and shown to be sensitive to irrigation volumes and scheduling. The results provide a first insight into PUB methodologies that could be employed in heavily managed basins.

Adaptive spatial combining for passive time-reversed communications.

PubMed

Gomes, João; Silva, António; Jesus, Sérgio

2008-08-01

Passive time reversal has aroused considerable interest in underwater communications as a computationally inexpensive means of mitigating the intersymbol interference introduced by the channel using a receiver array. In this paper the basic technique is extended by adaptively weighting sensor contributions to partially compensate for degraded focusing due to mismatch between the assumed and actual medium impulse responses. Two algorithms are proposed, one of which restores constructive interference between sensors, and the other one minimizes the output residual as in widely used equalization schemes. These are compared with plain time reversal and variants that employ postequalization and channel tracking. They are shown to improve the residual error and temporal stability of basic time reversal with very little added complexity. Results are presented for data collected in a passive time-reversal experiment that was conducted during the MREA'04 sea trial. In that experiment a single acoustic projector generated a 24-PSK (phase-shift keyed) stream at 200400 baud, modulated at 3.6 kHz, and received at a range of about 2 km on a sparse vertical array with eight hydrophones. The data were found to exhibit significant Doppler scaling, and a resampling-based preprocessing method is also proposed here to compensate for that scaling.

The volcanism of the Comores archipelago: mantle plume or lithosperic deformation?

NASA Astrophysics Data System (ADS)

Michon, Laurent

2015-04-01

The development of the Comores archipelago in the Mozambique channel has been diversely interpreted since the 1970's. The two end-members causes are, on the one hand, a deep mantle plume that developed a hotspot track from the Seychelles Plateau to the Grande Comore, and, on the other hand, a lithospheric deformation that reactivated transform faults and controlled the magma path. The present work first surveys the sparse geological, geophysical and geochronological data available for this archipelago, re-evaluates the age of the magmatic activity and integrates this evolution at a regional scale. Combining realistic magma production rates, the volume of each edifice and the geochronological, it is showed that the magmatic activity started first in Mayotte about 20 Ma and second, almost simultaneously, in Anjouan, Mohéli and Grande Comore about 10 Ma ago. This magmatism, coeval with magmatic periods in areas surrounding the Mozambic channel, the southern East African rift and Madagascar, is organised in three periods since Late Oligocene. Magmatic provinces are now superimposed with seismic zones and graben structures. In consequence, the Comores archipelago is tentatively interpret as part of the East African rift rather than related to a distinct deep mantle plume.

Assortative mixing in functional brain networks during epileptic seizures

NASA Astrophysics Data System (ADS)

Bialonski, Stephan; Lehnertz, Klaus

2013-09-01

We investigate assortativity of functional brain networks before, during, and after one-hundred epileptic seizures with different anatomical onset locations. We construct binary functional networks from multi-channel electroencephalographic data recorded from 60 epilepsy patients; and from time-resolved estimates of the assortativity coefficient, we conclude that positive degree-degree correlations are inherent to seizure dynamics. While seizures evolve, an increasing assortativity indicates a segregation of the underlying functional network into groups of brain regions that are only sparsely interconnected, if at all. Interestingly, assortativity decreases already prior to seizure end. Together with previous observations of characteristic temporal evolutions of global statistical properties and synchronizability of epileptic brain networks, our findings may help to gain deeper insights into the complicated dynamics underlying generation, propagation, and termination of seizures.

Information jet: Handling noisy big data from weakly disconnected network

NASA Astrophysics Data System (ADS)

Aurongzeb, Deeder

Sudden aggregation (information jet) of large amount of data is ubiquitous around connected social networks, driven by sudden interacting and non-interacting events, network security threat attacks, online sales channel etc. Clustering of information jet based on time series analysis and graph theory is not new but little work is done to connect them with particle jet statistics. We show pre-clustering based on context can element soft network or network of information which is critical to minimize time to calculate results from noisy big data. We show difference between, stochastic gradient boosting and time series-graph clustering. For disconnected higher dimensional information jet, we use Kallenberg representation theorem (Kallenberg, 2005, arXiv:1401.1137) to identify and eliminate jet similarities from dense or sparse graph.

Monitoring global vegetation using Nimbus-7 37 GHz data - Some empirical relations

NASA Technical Reports Server (NTRS)

Choudhury, B. J.; Tucker, C. J.

1987-01-01

The difference of the vertically and horizontally polarized brightness temperatures observed by the 37 GHz channel of the SMMR on board the Nimbus-7 satellite are correlated temporally with three indicators of vegetation density, namely the temporal variation of the atmospheric CO2 concentration at Mauna Loa (Hawaii), rainfall over the Sahel and the normalized difference vegetation index derived from the AVHRR on board the NOAA-7 satellite. SMMR 37 GHz and AVHRR provide complementary data sets for monitoring global vegetation, the 37 GHz data being more suitable for arid and semiarid regions as these data are more sensitive to changes in sparse vegetation. The 37-GHz data might be useful for understanding desertification and indexing Co2 exchange between the biosphere and the atmosphere.

Sparse gammatone signal model optimized for English speech does not match the human auditory filters.

PubMed

Strahl, Stefan; Mertins, Alfred

2008-07-18

Evidence that neurosensory systems use sparse signal representations as well as improved performance of signal processing algorithms using sparse signal models raised interest in sparse signal coding in the last years. For natural audio signals like speech and environmental sounds, gammatone atoms have been derived as expansion functions that generate a nearly optimal sparse signal model (Smith, E., Lewicki, M., 2006. Efficient auditory coding. Nature 439, 978-982). Furthermore, gammatone functions are established models for the human auditory filters. Thus far, a practical application of a sparse gammatone signal model has been prevented by the fact that deriving the sparsest representation is, in general, computationally intractable. In this paper, we applied an accelerated version of the matching pursuit algorithm for gammatone dictionaries allowing real-time and large data set applications. We show that a sparse signal model in general has advantages in audio coding and that a sparse gammatone signal model encodes speech more efficiently in terms of sparseness than a sparse modified discrete cosine transform (MDCT) signal model. We also show that the optimal gammatone parameters derived for English speech do not match the human auditory filters, suggesting for signal processing applications to derive the parameters individually for each applied signal class instead of using psychometrically derived parameters. For brain research, it means that care should be taken with directly transferring findings of optimality for technical to biological systems.

Lorenz, Gödel and Penrose: new perspectives on determinism and causality in fundamental physics

NASA Astrophysics Data System (ADS)

Palmer, T. N.

2014-07-01

Despite being known for his pioneering work on chaotic unpredictability, the key discovery at the core of meteorologist Ed Lorenz's work is the link between space-time calculus and state-space fractal geometry. Indeed, properties of Lorenz's fractal invariant set relate space-time calculus to deep areas of mathematics such as Gödel's Incompleteness Theorem. Could such properties also provide new perspectives on deep unsolved issues in fundamental physics? Recent developments in cosmology motivate what is referred to as the 'cosmological invariant set postulate': that the universe ? can be considered a deterministic dynamical system evolving on a causal measure-zero fractal invariant set ? in its state space. Symbolic representations of ? are constructed explicitly based on permutation representations of quaternions. The resulting 'invariant set theory' provides some new perspectives on determinism and causality in fundamental physics. For example, while the cosmological invariant set appears to have a rich enough structure to allow a description of (quantum) probability, its measure-zero character ensures it is sparse enough to prevent invariant set theory being constrained by the Bell inequality (consistent with a partial violation of the so-called measurement independence postulate). The primacy of geometry as embodied in the proposed theory extends the principles underpinning general relativity. As a result, the physical basis for contemporary programmes which apply standard field quantisation to some putative gravitational lagrangian is questioned. Consistent with Penrose's suggestion of a deterministic but non-computable theory of fundamental physics, an alternative 'gravitational theory of the quantum' is proposed based on the geometry of ?, with new perspectives on the problem of black-hole information loss and potential observational consequences for the dark universe.

Automated image based prominent nucleoli detection

PubMed Central

Yap, Choon K.; Kalaw, Emarene M.; Singh, Malay; Chong, Kian T.; Giron, Danilo M.; Huang, Chao-Hui; Cheng, Li; Law, Yan N.; Lee, Hwee Kuan

2015-01-01

Introduction: Nucleolar changes in cancer cells are one of the cytologic features important to the tumor pathologist in cancer assessments of tissue biopsies. However, inter-observer variability and the manual approach to this work hamper the accuracy of the assessment by pathologists. In this paper, we propose a computational method for prominent nucleoli pattern detection. Materials and Methods: Thirty-five hematoxylin and eosin stained images were acquired from prostate cancer, breast cancer, renal clear cell cancer and renal papillary cell cancer tissues. Prostate cancer images were used for the development of a computer-based automated prominent nucleoli pattern detector built on a cascade farm. An ensemble of approximately 1000 cascades was constructed by permuting different combinations of classifiers such as support vector machines, eXclusive component analysis, boosting, and logistic regression. The output of cascades was then combined using the RankBoost algorithm. The output of our prominent nucleoli pattern detector is a ranked set of detected image patches of patterns of prominent nucleoli. Results: The mean number of detected prominent nucleoli patterns in the top 100 ranked detected objects was 58 in the prostate cancer dataset, 68 in the breast cancer dataset, 86 in the renal clear cell cancer dataset, and 76 in the renal papillary cell cancer dataset. The proposed cascade farm performs twice as good as the use of a single cascade proposed in the seminal paper by Viola and Jones. For comparison, a naive algorithm that randomly chooses a pixel as a nucleoli pattern would detect five correct patterns in the first 100 ranked objects. Conclusions: Detection of sparse nucleoli patterns in a large background of highly variable tissue patterns is a difficult challenge our method has overcome. This study developed an accurate prominent nucleoli pattern detector with the potential to be used in the clinical settings. PMID:26167383

Automated image based prominent nucleoli detection.

PubMed

Yap, Choon K; Kalaw, Emarene M; Singh, Malay; Chong, Kian T; Giron, Danilo M; Huang, Chao-Hui; Cheng, Li; Law, Yan N; Lee, Hwee Kuan

2015-01-01

Nucleolar changes in cancer cells are one of the cytologic features important to the tumor pathologist in cancer assessments of tissue biopsies. However, inter-observer variability and the manual approach to this work hamper the accuracy of the assessment by pathologists. In this paper, we propose a computational method for prominent nucleoli pattern detection. Thirty-five hematoxylin and eosin stained images were acquired from prostate cancer, breast cancer, renal clear cell cancer and renal papillary cell cancer tissues. Prostate cancer images were used for the development of a computer-based automated prominent nucleoli pattern detector built on a cascade farm. An ensemble of approximately 1000 cascades was constructed by permuting different combinations of classifiers such as support vector machines, eXclusive component analysis, boosting, and logistic regression. The output of cascades was then combined using the RankBoost algorithm. The output of our prominent nucleoli pattern detector is a ranked set of detected image patches of patterns of prominent nucleoli. The mean number of detected prominent nucleoli patterns in the top 100 ranked detected objects was 58 in the prostate cancer dataset, 68 in the breast cancer dataset, 86 in the renal clear cell cancer dataset, and 76 in the renal papillary cell cancer dataset. The proposed cascade farm performs twice as good as the use of a single cascade proposed in the seminal paper by Viola and Jones. For comparison, a naive algorithm that randomly chooses a pixel as a nucleoli pattern would detect five correct patterns in the first 100 ranked objects. Detection of sparse nucleoli patterns in a large background of highly variable tissue patterns is a difficult challenge our method has overcome. This study developed an accurate prominent nucleoli pattern detector with the potential to be used in the clinical settings.

A simulation model to quantify the value of implementing whole-herd Bovine viral diarrhea virus testing strategies in beef cow-calf herds.

PubMed

Nickell, Jason S; White, Brad J; Larson, Robert L; Renter, David G; Sanderson, Mike W

2011-03-01

Although numerous diagnostic tests are available to identify cattle persistently infected (PI) with Bovine viral diarrhea virus (BVDV) in cow-calf herds, data are sparse when evaluating the economic viability of individual tests or diagnostic strategies. Multiple factors influence BVDV testing in determining if testing should be performed and which strategy to use. A stochastic model was constructed to estimate the value of implementing various whole-herd BVDV cow-calf testing protocols. Three common BVDV tests (immunohistochemistry, antigen-capture enzyme-linked immunosorbent assay, and polymerase chain reaction) performed on skin tissue were evaluated as single- or two-test strategies. The estimated testing value was calculated for each strategy at 3 herd sizes that reflect typical farm sizes in the United States (50, 100, and 500 cows) and 3 probabilities of BVDV-positive herd status (0.077, 0.19, 0.47) based upon the literature. The economic value of testing was the difference in estimated gross revenue between simulated cow-calf herds that either did or did not apply the specific testing strategy. Beneficial economic outcomes were more frequently observed when the probability of a herd being BVDV positive was 0.47. Although the relative value ranking of many testing strategies varied by each scenario, the two-test strategy composed of immunohistochemistry had the highest estimated value in all but one herd size-herd prevalence permutation. These data indicate that the estimated value of applying BVDV whole-herd testing strategies is influenced by the selected strategy, herd size, and the probability of herd BVDV-positive status; therefore, these factors should be considered when designing optimum testing strategies for cow-calf herds.

Identifying sighting clusters of endangered taxa with historical records.

PubMed

Duffy, Karl J

2011-04-01

The probability and time of extinction of taxa is often inferred from statistical analyses of historical records. Many of these analyses require the exclusion of multiple records within a unit of time (i.e., a month or a year). Nevertheless, spatially explicit, temporally aggregated data may be useful for identifying clusters of sightings (i.e., sighting clusters) in space and time. Identification of sighting clusters highlights changes in the historical recording of endangered taxa. I used two methods to identify sighting clusters in historical records: the Ederer-Myers-Mantel (EMM) test and the space-time permutation scan (STPS). I applied these methods to the spatially explicit sighting records of three species of orchids that are listed as endangered in the Republic of Ireland under the Wildlife Act (1976): Cephalanthera longifolia, Hammarbya paludosa, and Pseudorchis albida. Results with the EMM test were strongly affected by the choice of the time interval, and thus the number of temporal samples, used to examine the records. For example, sightings of P. albida clustered when the records were partitioned into 20-year temporal samples, but not when they were partitioned into 22-year temporal samples. Because the statistical power of EMM was low, it will not be useful when data are sparse. Nevertheless, the STPS identified regions that contained sighting clusters because it uses a flexible scanning window (defined by cylinders of varying size that move over the study area and evaluate the likelihood of clustering) to detect them, and it identified regions with high and regions with low rates of orchid sightings. The STPS analyses can be used to detect sighting clusters of endangered species that may be related to regions of extirpation and may assist in the categorization of threat status. ©2010 Society for Conservation Biology.

Microarray analysis of laser capture microdissected-anulus cells from the human intervertebral disc.

PubMed

Gruber, Helen E; Mougeot, Jean-Luc; Hoelscher, Gretchen; Ingram, Jane A; Hanley, Edward N

2007-05-15

Five Thompson Grade I/II discs (Group 1), 7 Grade III discs (Group 2), and 3 Grade IV discs (Group IV) were studied here in a project approved by the authors' Human Subjects Institutional Review Board. Our objective was to use laser capture microdissection (LCM) to harvest cells from the human anulus and to derive gene expression profiles using microarray analysis. Appropriate gene expression is essential in the intervertebral disc for maintenance of extracellular matrix (ECM), ECM remodeling, and maintenance of a viable disc cell population. During disc degeneration, cell numbers drop, making gene expression studies challenging. LCM was used to harvest cells from paraffin-embedded sections of human anulus tissue. Gene profiling used Affymetrix GeneChip Human X3P arrays. ANOVA and SAM permutation analysis were applied to dCHIP normalized, filtered, and log-transformed gene expression data ( approximately 33,500 probes), and data analyzed to identify genes that were significantly differentially expressed between the 3 groups. We identified 47 genes that were significantly differentially expressed between the 3 groups (P < 0.001 and lowest q values). Compared with the healthiest discs (Grade I/II), 13 genes were up-regulated and 19 down-regulated in both the Grade III and the Grade IV discs. Genes with biologic significance regulated during degeneration involved cell senescence, low cell division rates, hypoxia-related genes, heat-shock protein 70 interacting protein, neuropilin 2, and interleukin-23p19 (interleukin-12 family). Results expand our understanding of disc aging and degeneration and show that LCM is a valuable technique that can be used to collect mRNA amounts adequate for microarray analysis from the sparse cell population of the human anulus.

Early suppression effect in human primary visual cortex during Kanizsa illusion processing: A magnetoencephalographic evidence.

PubMed

Chernyshev, Boris V; Pronko, Platon K; Stroganova, Tatiana A

2016-01-01

Detection of illusory contours (ICs) such as Kanizsa figures is known to depend primarily upon the lateral occipital complex. Yet there is no universal agreement on the role of the primary visual cortex in this process; some existing evidence hints that an early stage of the visual response in V1 may involve relative suppression to Kanizsa figures compared with controls. Iso-oriented luminance borders, which are responsible for Kanizsa illusion, may evoke surround suppression in V1 and adjacent areas leading to the reduction in the initial response to Kanizsa figures. We attempted to test the existence, as well as to find localization and timing of the early suppression effect produced by Kanizsa figures in adult nonclinical human participants. We used two sizes of visual stimuli (4.5 and 9.0°) in order to probe the effect at two different levels of eccentricity; the stimuli were presented centrally in passive viewing conditions. We recorded magnetoencephalogram, which is more sensitive than electroencephalogram to activity originating from V1 and V2 areas. We restricted our analysis to the medial occipital area and the occipital pole, and to a 40-120 ms time window after the stimulus onset. By applying threshold-free cluster enhancement technique in combination with permutation statistics, we were able to detect the inverted IC effect-a relative suppression of the response to the Kanizsa figures compared with the control stimuli. The current finding is highly compatible with the explanation involving surround suppression evoked by iso-oriented collinear borders. The effect may be related to the principle of sparse coding, according to which V1 suppresses representations of inner parts of collinear assemblies as being informationally redundant. Such a mechanism is likely to be an important preliminary step preceding object contour detection.

Low abundance of sweat duct Cl− channel CFTR in both healthy and cystic fibrosis athletes with exceptionally salty sweat during exercise

PubMed Central

Haack, Karla K. V.; Pollack, Brian P.; Millard-Stafford, Mindy; McCarty, Nael A.

2011-01-01

To understand potential mechanisms explaining interindividual variability observed in human sweat sodium concentration ([Na+]), we investigated the relationship among [Na+] of thermoregulatory sweat, plasma membrane expression of Na+ and Cl− transport proteins in biopsied human eccrine sweat ducts, and basal levels of vasopressin (AVP) and aldosterone. Lower ductal luminal membrane expression of the Cl− channel cystic fibrosis transmembrane conductance regulator (CFTR) was observed in immunofluorescent staining of sweat glands from healthy young adults identified as exceptionally “salty sweaters” (SS) (n = 6, P < 0.05) and from patients with cystic fibrosis (CF) (n = 6, P < 0.005) compared with ducts from healthy young adults with “typical” sweat [Na+] (control, n = 6). Genetic testing of healthy subjects did not reveal any heterozygotes (“carriers”) for any of the 39 most common disease-causing CFTR mutations in the United States. SS had higher baseline plasma [AVP] compared with control (P = 0.029). Immunostaining to investigate a potential relationship between higher plasma [AVP] (and sweat [Na+]) and ductal membrane aquaporin-5 revealed for all groups a relatively sparse and location-dependent ductal expression of the water channel with localization primarily to the secretory coil. Availability of CFTR for NaCl transport across the ductal membrane appears related to the significant physiological variability observed in sweat salt concentration in apparently healthy humans. At present, a heritable link between healthy salty sweaters and the most prevalent disease-causing CFTR mutations cannot be established. PMID:21228336

Classification of multispectral or hyperspectral satellite imagery using clustering of sparse approximations on sparse representations in learned dictionaries obtained using efficient convolutional sparse coding

DOEpatents

Moody, Daniela; Wohlberg, Brendt

2018-01-02

An approach for land cover classification, seasonal and yearly change detection and monitoring, and identification of changes in man-made features may use a clustering of sparse approximations (CoSA) on sparse representations in learned dictionaries. The learned dictionaries may be derived using efficient convolutional sparse coding to build multispectral or hyperspectral, multiresolution dictionaries that are adapted to regional satellite image data. Sparse image representations of images over the learned dictionaries may be used to perform unsupervised k-means clustering into land cover categories. The clustering process behaves as a classifier in detecting real variability. This approach may combine spectral and spatial textural characteristics to detect geologic, vegetative, hydrologic, and man-made features, as well as changes in these features over time.

Permutation-symmetric three-particle hyper-spherical harmonics based on the S3 ⊗ SO(3)rot ⊂ O(2)⊗SO(3)rot ⊂ U(3)⋊S2 ⊂ O(6) subgroup chain

NASA Astrophysics Data System (ADS)

Salom, Igor; Dmitrašinović, V.

2017-07-01

We construct the three-body permutation symmetric hyperspherical harmonics to be used in the non-relativistic three-body Schrödinger equation in three spatial dimensions (3D). We label the state vectors according to the S3 ⊗ SO(3)rot ⊂ O (2) ⊗ SO(3)rot ⊂ U (3) ⋊S2 ⊂ O (6) subgroup chain, where S3 is the three-body permutation group and S2 is its two element subgroup containing transposition of first two particles, O (2) is the ;democracy transformation;, or ;kinematic rotation; group for three particles; SO(3)rot is the 3D rotation group, and U (3) , O (6) are the usual Lie groups. We discuss the good quantum numbers implied by the above chain of algebras, as well as their relation to the S3 permutation properties of the harmonics, particularly in view of the SO(3)rot ⊂ SU (3) degeneracy. We provide a definite, practically implementable algorithm for the calculation of harmonics with arbitrary finite integer values of the hyper angular momentum K, and show an explicit example of this construction in a specific case with degeneracy, as well as tables of K ≤ 6 harmonics. All harmonics are expressed as homogeneous polynomials in the Jacobi vectors (λ , ρ) with coefficients given as algebraic numbers unless the ;operator method; is chosen for the lifting of the SO(3)rot ⊂ SU (3) multiplicity and the dimension of the degenerate subspace is greater than four - in which case one must resort to numerical diagonalization; the latter condition is not met by any K ≤ 15 harmonic, or by any L ≤ 7 harmonic with arbitrary K. We also calculate a certain type of matrix elements (the Gaunt integrals of products of three harmonics) in two ways: 1) by explicit evaluation of integrals and 2) by reduction to known SU (3) Clebsch-Gordan coefficients. In this way we complete the calculation of the ingredients sufficient for the solution to the quantum-mechanical three-body bound state problem.

Morphological evolution of the Maipo River in central Chile: Influence of instream gravel mining

NASA Astrophysics Data System (ADS)

Arróspide, Felipe; Mao, Luca; Escauriaza, Cristián

2018-04-01

Instream gravel mining is one of the most important causes of channel degradation in South America, specifically in rivers located near large metropolitan areas with rapidly growing cities, where no river management strategies exist. In the western region of the continent, many of these rivers belong to Andean systems, in which significant parts of the watersheds are located in mountain areas at high altitude, with considerable seasonal rainfall variability and steep channel slopes. In these rivers, gravel mining has produced significant incision of the channels with serious physical and ecological consequences, affecting habitats, modifying the supply and transport of sediments, and amplifying the risk to infrastructure in and around the channel during floods. In spite of the degraded conditions of many channels, no quantitative studies of the geomorphic impacts of gravel mining have been carried out in the region, mostly because of the insufficient and sparse data available. In this investigation we perform an analysis of the morphodynamic evolution in a section of the Maipo River in the metropolitan region of Santiago, Chile. This river is economically the most important in the country, as it provides drinking and irrigation water to urban and rural areas, is utilized by the energy generation industry, and runs along and below critical infrastructure. We have collected and analyzed data from 1954 to 2015, during which the city population increased by more than 5 million inhabitants whose presence accelerated land use changes. The analysis shows a rapid morphological evolution of the channel where in 31 years effects such as: river sections showing incision of up to 20 m, an increase of the area affected by gravel mining from 86.62 to 368.13 ha, and a net erosion volume of 39.4 million m3 can be observed. This work yields quantitative information on the consequences of gravel mining in the Maipo River, providing the necessary data to develop an integrated strategy to define management and restoration actions for this and other similar Andean rivers.

High sub-seasonal variability in water volume transports, revealed through a new ocean monitoring initiative using autonomous gliders

NASA Astrophysics Data System (ADS)

Heslop, E.; Ruiz, S.; Allen, J.; Tintoré, J.

2012-04-01

One of the clear challenges facing oceanography today is to define variability in ocean processes at a seasonal and sub-seasonal scale, in order to clearly identify the signature of both natural large-scale climatic oscillations and the long-term trends brought about by the human-induced change in atmospheric composition. Without visibility of this variance, which helps to determine the margins of significance for long-term trends and decipher cause and effect, the inferences drawn from sparse data points can be misleading. The cyclonic basin scale circulation pattern in the Western Mediterranean has long been known; the role/contribution that processes in the Balearic Basin play in modifying this is less well defined. The Balearic Channels (channels between the Balearic Islands) are constriction points on this basin scale circulation that appear to exert a controlling influence on the north/south exchange of water masses. Understanding the variability in current flows through these channels is important, not just for the transport of heat and salt, but also for ocean biology that responds to physical variability at the scale of that variability. Earlier studies at a seasonal scale identified; an interannual summer/winter variation of 1 Sv in the strength of the main circulation pattern and a high cruise-to-cruise variability in the pattern and strength of the flows through the channels brought about by mesoscale activity. Initial results using new high-resolution data from glider based monitoring missions across the Ibiza Channel (the main exchange channel in the Balearic Basin), combined with ship and contemporaneous satellite data, indicate surprisingly high and rapid changes in the flows of surface and intermediate waters imposed on the broad seasonal cycle. To date the data suggests that there are three potential 'modes' of water volume transport, generated from the interplay between basin and mesoscale circulation. We will review the concept of transport modes as seen through the earlier seasonal ship based studies and demonstrate that the scales of variability captured by the glider monitoring provides a unique view of variability in this circulation system, which is as high on a weekly timescale as the previously identified seasonal cycle.

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

NASA Technical Reports Server (NTRS)

Rogers, David

1988-01-01

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

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

Jakeman, J.D., E-mail: jdjakem@sandia.gov; Wildey, T.

2015-01-01

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchicalmore » surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.« less

Precession missile feature extraction using sparse component analysis of radar measurements

NASA Astrophysics Data System (ADS)

Liu, Lihua; Du, Xiaoyong; Ghogho, Mounir; Hu, Weidong; McLernon, Des

2012-12-01

According to the working mode of the ballistic missile warning radar (BMWR), the radar return from the BMWR is usually sparse. To recognize and identify the warhead, it is necessary to extract the precession frequency and the locations of the scattering centers of the missile. This article first analyzes the radar signal model of the precessing conical missile during flight and develops the sparse dictionary which is parameterized by the unknown precession frequency. Based on the sparse dictionary, the sparse signal model is then established. A nonlinear least square estimation is first applied to roughly extract the precession frequency in the sparse dictionary. Based on the time segmented radar signal, a sparse component analysis method using the orthogonal matching pursuit algorithm is then proposed to jointly estimate the precession frequency and the scattering centers of the missile. Simulation results illustrate the validity of the proposed method.

Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis.

PubMed

Kim, Hyunsoo; Park, Haesun

2007-06-15

Many practical pattern recognition problems require non-negativity constraints. For example, pixels in digital images and chemical concentrations in bioinformatics are non-negative. Sparse non-negative matrix factorizations (NMFs) are useful when the degree of sparseness in the non-negative basis matrix or the non-negative coefficient matrix in an NMF needs to be controlled in approximating high-dimensional data in a lower dimensional space. In this article, we introduce a novel formulation of sparse NMF and show how the new formulation leads to a convergent sparse NMF algorithm via alternating non-negativity-constrained least squares. We apply our sparse NMF algorithm to cancer-class discovery and gene expression data analysis and offer biological analysis of the results obtained. Our experimental results illustrate that the proposed sparse NMF algorithm often achieves better clustering performance with shorter computing time compared to other existing NMF algorithms. The software is available as supplementary material.

Feasibility of Very Large Sparse Aperture Deployable Antennas

DTIC Science & Technology

2014-03-27

FEASIBILITY OF VERY LARGE SPARSE APERTURE DEPLOYABLE ANTENNAS THESIS Jason C. Heller, Captain...States. AFIT-ENY-14-M-24 FEASIBILITY OF VERY LARGE SPARSE APERTURE DEPLOYABLE ANTENNAS THESIS Presented to the Faculty...UNLIMITED AFIT-ENY-14-M-24 FEASIBILITY OF VERY LARGE SPARSE APERTURE DEPLOYABLE ANTENNAS Jason C. Heller, B.S., Aerospace

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.

Constructing LDPC Codes from Loop-Free Encoding Modules

NASA Technical Reports Server (NTRS)

Divsalar, Dariush; Dolinar, Samuel; Jones, Christopher; Thorpe, Jeremy; Andrews, Kenneth

2009-01-01

A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.

Machine-learned analysis of the association of next-generation sequencing-based human TRPV1 and TRPA1 genotypes with the sensitivity to heat stimuli and topically applied capsaicin.

PubMed

Kringel, Dario; Geisslinger, Gerd; Resch, Eduard; Oertel, Bruno G; Thrun, Michael C; Heinemann, Sarah; Lötsch, Jörn

2018-03-27

Heat pain and its modulation by capsaicin varies among subjects in experimental and clinical settings. A plausible cause is a genetic component, of which TRPV1 ion channels, by their response to both heat and capsaicin, are primary candidates. However, TRPA1 channels can heterodimerize with TRPV1 channels and carry genetic variants reported to modulate heat pain sensitivity. To address the role of these candidate genes in capsaicin-induced hypersensitization to heat, pain thresholds acquired before and after topical application of capsaicin and TRPA1/TRPV1 exomic sequences derived by next-generation sequencing were assessed in n = 75 healthy volunteers and the genetic information comprised 278 loci. Gaussian mixture modeling indicated 2 phenotype groups with high or low capsaicin-induced hypersensitization to heat. Unsupervised machine learning implemented as swarm-based clustering hinted at differences in the genetic pattern between these phenotype groups. Several methods of supervised machine learning implemented as random forests, adaptive boosting, k-nearest neighbors, naive Bayes, support vector machines, and for comparison, binary logistic regression predicted the phenotype group association consistently better when based on the observed genotypes than when using a random permutation of the exomic sequences. Of note, TRPA1 variants were more important for correct phenotype group association than TRPV1 variants. This indicates a role of the TRPA1 and TRPV1 next-generation sequencing-based genetic pattern in the modulation of the individual response to heat-related pain phenotypes. When considering earlier evidence that topical capsaicin can induce neuropathy-like quantitative sensory testing patterns in healthy subjects, implications for future analgesic treatments with transient receptor potential inhibitors arise.This is an open-access article distributed under the terms of the Creative Commons Attribution-Non Commercial-No Derivatives License 4.0 (CCBY-NC-ND), where it is permissible to download and share the work provided it is properly cited. The work cannot be changed in any way or used commercially without permission from the journal.

Liver segmentation from CT images using a sparse priori statistical shape model (SP-SSM).

PubMed

Wang, Xuehu; Zheng, Yongchang; Gan, Lan; Wang, Xuan; Sang, Xinting; Kong, Xiangfeng; Zhao, Jie

2017-01-01

This study proposes a new liver segmentation method based on a sparse a priori statistical shape model (SP-SSM). First, mark points are selected in the liver a priori model and the original image. Then, the a priori shape and its mark points are used to obtain a dictionary for the liver boundary information. Second, the sparse coefficient is calculated based on the correspondence between mark points in the original image and those in the a priori model, and then the sparse statistical model is established by combining the sparse coefficients and the dictionary. Finally, the intensity energy and boundary energy models are built based on the intensity information and the specific boundary information of the original image. Then, the sparse matching constraint model is established based on the sparse coding theory. These models jointly drive the iterative deformation of the sparse statistical model to approximate and accurately extract the liver boundaries. This method can solve the problems of deformation model initialization and a priori method accuracy using the sparse dictionary. The SP-SSM can achieve a mean overlap error of 4.8% and a mean volume difference of 1.8%, whereas the average symmetric surface distance and the root mean square symmetric surface distance can reach 0.8 mm and 1.4 mm, respectively.

Feature Selection and Pedestrian Detection Based on Sparse Representation.

PubMed

Yao, Shihong; Wang, Tao; Shen, Weiming; Pan, Shaoming; Chong, Yanwen; Ding, Fei

2015-01-01

Pedestrian detection have been currently devoted to the extraction of effective pedestrian features, which has become one of the obstacles in pedestrian detection application according to the variety of pedestrian features and their large dimension. Based on the theoretical analysis of six frequently-used features, SIFT, SURF, Haar, HOG, LBP and LSS, and their comparison with experimental results, this paper screens out the sparse feature subsets via sparse representation to investigate whether the sparse subsets have the same description abilities and the most stable features. When any two of the six features are fused, the fusion feature is sparsely represented to obtain its important components. Sparse subsets of the fusion features can be rapidly generated by avoiding calculation of the corresponding index of dimension numbers of these feature descriptors; thus, the calculation speed of the feature dimension reduction is improved and the pedestrian detection time is reduced. Experimental results show that sparse feature subsets are capable of keeping the important components of these six feature descriptors. The sparse features of HOG and LSS possess the same description ability and consume less time compared with their full features. The ratios of the sparse feature subsets of HOG and LSS to their full sets are the highest among the six, and thus these two features can be used to best describe the characteristics of the pedestrian and the sparse feature subsets of the combination of HOG-LSS show better distinguishing ability and parsimony.

A space efficient flexible pivot selection approach to evaluate determinant and inverse of a matrix.

PubMed

Jafree, Hafsa Athar; Imtiaz, Muhammad; Inayatullah, Syed; Khan, Fozia Hanif; Nizami, Tajuddin

2014-01-01

This paper presents new simple approaches for evaluating determinant and inverse of a matrix. The choice of pivot selection has been kept arbitrary thus they reduce the error while solving an ill conditioned system. Computation of determinant of a matrix has been made more efficient by saving unnecessary data storage and also by reducing the order of the matrix at each iteration, while dictionary notation [1] has been incorporated for computing the matrix inverse thereby saving unnecessary calculations. These algorithms are highly class room oriented, easy to use and implemented by students. By taking the advantage of flexibility in pivot selection, one may easily avoid development of the fractions by most. Unlike the matrix inversion method [2] and [3], the presented algorithms obviate the use of permutations and inverse permutations.

User manual for Blossom statistical package for R

USGS Publications Warehouse

Talbert, Marian; Cade, Brian S.

2005-01-01

Blossom is an R package with functions for making statistical comparisons with distance-function based permutation tests developed by P.W. Mielke, Jr. and colleagues at Colorado State University (Mielke and Berry, 2001) and for testing parameters estimated in linear models with permutation procedures developed by B. S. Cade and colleagues at the Fort Collins Science Center, U.S. Geological Survey. This manual is intended to provide identical documentation of the statistical methods and interpretations as the manual by Cade and Richards (2005) does for the original Fortran program, but with changes made with respect to command inputs and outputs to reflect the new implementation as a package for R (R Development Core Team, 2012). This implementation in R has allowed for numerous improvements not supported by the Cade and Richards (2005) Fortran implementation, including use of categorical predictor variables in most routines.

Parallel approach on sorting of genes in search of optimal solution.

PubMed

Kumar, Pranav; Sahoo, G

2018-05-01

An important tool for comparing genome analysis is the rearrangement event that can transform one given genome into other. For finding minimum sequence of fission and fusion, we have proposed here an algorithm and have shown a transformation example for converting the source genome into the target genome. The proposed algorithm comprises of circular sequence i.e. "cycle graph" in place of mapping. The main concept of algorithm is based on optimal result of permutation. These sorting processes are performed in constant running time by showing permutation in the form of cycle. In biological instances it has been observed that transposition occurs half of the frequency as that of reversal. In this paper we are not dealing with reversal instead commencing with the rearrangement of fission, fusion as well as transposition. Copyright © 2017 Elsevier Inc. All rights reserved.

An authenticated image encryption scheme based on chaotic maps and memory cellular automata

NASA Astrophysics Data System (ADS)

Bakhshandeh, Atieh; Eslami, Ziba

2013-06-01

This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.

Repelling Point Bosons

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

McGuire, J. B.

2011-12-01

There is a body of conventional wisdom that holds that a solvable quantum problem, by virtue of its solvability, is pathological and thus irrelevant. It has been difficult to refute this view owing to the paucity of theoretical constructs and experimental results. Recent experiments involving equivalent ions trapped in a spatial conformation of extreme anisotropic confinement (longitudinal extension tens, hundreds or even thousands of times transverse extension) have modified the view of relevancy, and it is now possible to consider systems previously thought pathological, in particular point Bosons that repel in one dimension. It has been difficult for the experimentalistsmore » to utilize existing theory, mainly due to long-standing theoretical misunderstanding of the relevance of the permutation group, in particular the non-commutativity of translations (periodicity) and transpositions (permutation). This misunderstanding is most easily rectified in the case of repelling Bosons.« less

Parallel solution of closely coupled systems

NASA Technical Reports Server (NTRS)

Utku, S.; Salama, M.

1986-01-01

The odd-even permutation and associated unitary transformations for reordering the matrix coefficient A are employed as means of breaking the strong seriality which is characteristic of closely coupled systems. The nested dissection technique is also reviewed, and the equivalence between reordering A and dissecting its network is established. The effect of transforming A with odd-even permutation on its topology and the topology of its Cholesky factors is discussed. This leads to the construction of directed graphs showing the computational steps required for factoring A, their precedence relationships and their sequential and concurrent assignment to the available processors. Expressions for the speed-up and efficiency of using N processors in parallel relative to the sequential use of a single processor are derived from the directed graph. Similar expressions are also derived when the number of available processors is fewer than required.

Simulating the component counts of combinatorial structures.

PubMed

Arratia, Richard; Barbour, A D; Ewens, W J; Tavaré, Simon

2018-02-09

This article describes and compares methods for simulating the component counts of random logarithmic combinatorial structures such as permutations and mappings. We exploit the Feller coupling for simulating permutations to provide a very fast method for simulating logarithmic assemblies more generally. For logarithmic multisets and selections, this approach is replaced by an acceptance/rejection method based on a particular conditioning relationship that represents the distribution of the combinatorial structure as that of independent random variables conditioned on a weighted sum. We show how to improve its acceptance rate. We illustrate the method by estimating the probability that a random mapping has no repeated component sizes, and establish the asymptotic distribution of the difference between the number of components and the number of distinct component sizes for a very general class of logarithmic structures. Copyright © 2018. Published by Elsevier Inc.

The structure of EAP-groups and self-autopermutable subgroups.

PubMed

Housieni, Shima; Moghaddam, Mohammad Reza Rajabzadeh

2014-01-01

A subgroup H of a given group G is said to be autopermutable, if HH(α) = H(α)H for all α ∈ Aut(G). We also call H a self-autopermutable subgroup of G, when HH(α) = H(α)H implies that H(α) = H. Moreover, G is said to be EAP-group, if every subgroup of G is autopermutable. One notes that if α runs over the inner automorphisms of the group, one obtains the notions of conjugate-permutability, self-conjugate-permutability, and ECP-groups, which were studied by Foguel in 1997, Li and Meng in 2007, and Xu and Zhang in 2005, respectively. In the present paper, we determine the structure of a finite EAP-group when its centre is of index 4 in G. We also show that self-autopermutability and characteristic properties are equivalent for nilpotent groups.

Permutation Entropy Applied to Movement Behaviors of Drosophila Melanogaster

NASA Astrophysics Data System (ADS)

Liu, Yuedan; Chon, Tae-Soo; Baek, Hunki; Do, Younghae; Choi, Jin Hee; Chung, Yun Doo

Movement of different strains in Drosophila melanogaster was continuously observed by using computer interfacing techniques and was analyzed by permutation entropy (PE) after exposure to toxic chemicals, toluene (0.1 mg/m3) and formaldehyde (0.01 mg/m3). The PE values based on one-dimensional time series position (vertical) data were variable according to internal constraint (i.e. strains) and accordingly increased in response to external constraint (i.e. chemicals) by reflecting diversity in movement patterns from both normal and intoxicated states. Cross-correlation function revealed temporal associations between the PE values and between the component movement patterns in different chemicals and strains through the period of intoxication. The entropy based on the order of position data could be a useful means for complexity measure in behavioral changes and for monitoring the impact of stressors in environment.

Communication: Fitting potential energy surfaces with fundamental invariant neural network

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

Shao, Kejie; Chen, Jun; Zhao, Zhiqiang

A more flexible neural network (NN) method using the fundamental invariants (FIs) as the input vector is proposed in the construction of potential energy surfaces for molecular systems involving identical atoms. Mathematically, FIs finitely generate the permutation invariant polynomial (PIP) ring. In combination with NN, fundamental invariant neural network (FI-NN) can approximate any function to arbitrary accuracy. Because FI-NN minimizes the size of input permutation invariant polynomials, it can efficiently reduce the evaluation time of potential energy, in particular for polyatomic systems. In this work, we provide the FIs for all possible molecular systems up to five atoms. Potential energymore » surfaces for OH{sub 3} and CH{sub 4} were constructed with FI-NN, with the accuracy confirmed by full-dimensional quantum dynamic scattering and bound state calculations.« less

Recursive boson system in the Cuntz algebra O{sub {infinity}}

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

Kawamura, Katsunori

2007-09-15

Bosons and fermions are often written by elements of other algebras. Abe (private communication) gave a realization of bosons by formal infinite sums of the canonical generators of the Cuntz algebra O{sub {infinity}}. We show that such formal infinite sum always makes sense on a certain dense subspace of any permutative representation of O{sub {infinity}}. In this meaning, we can regard as if the algebra B of bosons was a unital *-subalgebra of O{sub {infinity}} on a given permutative representation. According to this relation, we compute branching laws arising from restrictions of representations of O{sub {infinity}} on B. For example,more » it is shown that the Fock representation of B is given as the restriction of the standard representation of O{sub {infinity}} on B.« less